Search content
Sort by
Showing 20 of 85 results by unclevito
Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
for all those prefix hunters out there.
Public Address: 1MvdYgvasN6c9pChhUBrJxg5LCC6wvjhEL
Private WIF: p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qddt9LsH77wYHYC11LP2
Private HEX: D5412A3C9A69FA280 (68 bit)
Public Address: 1MVdYGvASN6gDvqkEpiwK6n2Pbikto2bCn
Private WIF: p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qdgJT5gsFnMqL2mvnFqf
Private HEX: D711DB111F2CE6D52 (68 bit)
Public Address: 1MVdygvASN6Y3LKqADfXCv6WzHVeGPgqJP
Private WIF: p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qdwTcmfH1HZKaCmiRwEY
Private HEX: E271A4B53ED3EB990 (68 bit)
Public Address: 1MVDYGvAsN6arwspXpJ3o87pW3Ubs6yDkd
Private WIF: p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qe2e5AJjbp3PApbDvj2s
Private HEX: E654BEE77B62BAB83 (68 bit)
Public Address: 1MvDYGVASn6yhppeJWNxXVgXAVpenNkB47
Private WIF: p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qe2pQbJ7oT3vNcXjCD8K
Private HEX: E676F9A1FE169CA7A (68 bit)
Public Address: 1MvdYgvASn6VpM9kyNXA86F9qp3pHZfHQD
Private WIF: p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qe6KnYpoVukVUSejeCmL
Private HEX: E9188FD362C330678 (68 bit)
Public Address: 1MVdYgVAsN6m9daCgHYGEYJ8cEprrBZ8do
Private WIF: p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qe9ZKApxkgnZZLzTmxiF
Private HEX: EB85A6C641943CCF9 (68 bit)
Public Address: 1MVdYGVAsN6hwziaQefEXbUcftg6TzrY7h
Private WIF: p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qeBtqjC8gwrf4NchE3La
Private HEX: ED4683AB293E9C7F2 (68 bit)
Public Address: 1MvdYGvASn6m9m47bPxG6DhXm1GPS1bdRR
Private WIF: p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qeDdMH79KwS49MudFaYM
Private HEX: EE93667313F1C256A (68 bit)
Public Address: 1MvDygVasn6fQXX77KhjY3zGtkyjvKopbu
Private WIF: p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qeFZjfK6F4rzYnhS8Lyu
Private HEX: F0079EDF018ED4A9D (68 bit)
Public Address: 1MvDYGVasN6rA6mYDDUtXnzXo6nDp8fjtx
Private WIF: p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qeLtQyR4MEaiXSgMQT9s
Private HEX: F405F4E7EED97C6F3 (68 bit)
Public Address: 1MVdygvasn62h2Xja4K1SkZoVUV9R9fTfB
Private WIF: p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qeQy78kdyUZqVKpcipSo
Private HEX: F715E0DA097D80336 (68 bit)
Public Address: 1MVdYGVaSn6Z2TPkJBqhLqfKKj4WLjpo6S
Private WIF: p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qeQwvMnaGyWmfUXY8J5A
Private HEX: F711F377507E85D78 (68 bit)
Public Address: 1MvdYGvaSn6GUX5zD3xxW6b72LAXKMoggf
Private WIF: p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qeXqKYBEgp2RHpn4Kv59
Private HEX: FC3CC1A74B41681BE (68 bit)
Public Address: 1MvdYGVaSn6w4kaaUDxBgq6hyPc4rvzmgw
Private WIF: p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qeY3YsPjUj6tXJMCT6sM
Private HEX: FC6542F3CE21BE377 (68 bit)
Public Address: 1MvdYgvasN6c9pChhUBrJxg5LCC6wvjhEL
Private WIF: p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qddt9LsH77wYHYC11LP2
Private HEX: D5412A3C9A69FA280 (68 bit)
Public Address: 1MVdYGvASN6gDvqkEpiwK6n2Pbikto2bCn
Private WIF: p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qdgJT5gsFnMqL2mvnFqf
Private HEX: D711DB111F2CE6D52 (68 bit)
Public Address: 1MVdygvASN6Y3LKqADfXCv6WzHVeGPgqJP
Private WIF: p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qdwTcmfH1HZKaCmiRwEY
Private HEX: E271A4B53ED3EB990 (68 bit)
Public Address: 1MVDYGvAsN6arwspXpJ3o87pW3Ubs6yDkd
Private WIF: p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qe2e5AJjbp3PApbDvj2s
Private HEX: E654BEE77B62BAB83 (68 bit)
Public Address: 1MvDYGVASn6yhppeJWNxXVgXAVpenNkB47
Private WIF: p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qe2pQbJ7oT3vNcXjCD8K
Private HEX: E676F9A1FE169CA7A (68 bit)
Public Address: 1MvdYgvASn6VpM9kyNXA86F9qp3pHZfHQD
Private WIF: p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qe6KnYpoVukVUSejeCmL
Private HEX: E9188FD362C330678 (68 bit)
Public Address: 1MVdYgVAsN6m9daCgHYGEYJ8cEprrBZ8do
Private WIF: p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qe9ZKApxkgnZZLzTmxiF
Private HEX: EB85A6C641943CCF9 (68 bit)
Public Address: 1MVdYGVAsN6hwziaQefEXbUcftg6TzrY7h
Private WIF: p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qeBtqjC8gwrf4NchE3La
Private HEX: ED4683AB293E9C7F2 (68 bit)
Public Address: 1MvdYGvASn6m9m47bPxG6DhXm1GPS1bdRR
Private WIF: p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qeDdMH79KwS49MudFaYM
Private HEX: EE93667313F1C256A (68 bit)
Public Address: 1MvDygVasn6fQXX77KhjY3zGtkyjvKopbu
Private WIF: p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qeFZjfK6F4rzYnhS8Lyu
Private HEX: F0079EDF018ED4A9D (68 bit)
Public Address: 1MvDYGVasN6rA6mYDDUtXnzXo6nDp8fjtx
Private WIF: p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qeLtQyR4MEaiXSgMQT9s
Private HEX: F405F4E7EED97C6F3 (68 bit)
Public Address: 1MVdygvasn62h2Xja4K1SkZoVUV9R9fTfB
Private WIF: p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qeQy78kdyUZqVKpcipSo
Private HEX: F715E0DA097D80336 (68 bit)
Public Address: 1MVdYGVaSn6Z2TPkJBqhLqfKKj4WLjpo6S
Private WIF: p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qeQwvMnaGyWmfUXY8J5A
Private HEX: F711F377507E85D78 (68 bit)
Public Address: 1MvdYGvaSn6GUX5zD3xxW6b72LAXKMoggf
Private WIF: p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qeXqKYBEgp2RHpn4Kv59
Private HEX: FC3CC1A74B41681BE (68 bit)
Public Address: 1MvdYGVaSn6w4kaaUDxBgq6hyPc4rvzmgw
Private WIF: p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qeY3YsPjUj6tXJMCT6sM
Private HEX: FC6542F3CE21BE377 (68 bit)
Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
No I don't use it either I just made some adjustments that I saw could be causing errors for some. I use lostcoins.exe and get about 1.6 billion/s and vbcr.exe about 950 million/s
Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
If just for puzzle 69 try these adjustments
from bitcoin import privtopub, pubtoaddr
import random
import string
import multiprocessing
import time
import os
import secrets
def create_random_slider_field(columns):
return [random.choice(string.hexdigits.lower()) for _ in range(columns)]
def adjust_slider(slider, column, direction):
hex_chars = string.hexdigits.lower()
current_index = hex_chars.index(slider[column])
new_index = (current_index + direction) % len(hex_chars)
slider[column] = hex_chars[new_index]
return slider
def check_address(private_key, target_address):
try:
address = pubtoaddr(privtopub(private_key))
return address == target_address
except Exception as e:
print(f"Error generating address: {e}")
return False
def search_process(target_address, process_attempts, result_queue):
byte_values = list(range(256))
random_bytes = [secrets.choice(byte_values) for _ in range(8)]
random.seed(int.from_bytes(random_bytes, byteorder='big'))
slider_columns = 17 # Adjusted to 17 for remaining digits
attempts = 0
hex_chars = string.hexdigits.lower()
while attempts < process_attempts:
slider = create_random_slider_field(slider_columns)
# Construct private key with fixed '1' at the start
private_key = '0' * 46 + '1' + ''.join(slider)
# Check the constructed private key
if check_address(private_key, target_address):
result_queue.put((private_key, attempts))
return
attempts += 1
if attempts % 1000 == 0:
print(f"Process {multiprocessing.current_process().name} Attempts: {attempts}, Current slider: 1{''.join(slider)}")
result_queue.put((None, attempts))
def multiprocessing_search(target_address, max_attempts=1000000, num_processes=4): #max_attempts / 4 cores
processes = []
result_queue = multiprocessing.Queue()
attempts_per_process = max_attempts // num_processes
start_time = time.time()
for i in range(num_processes):
p = multiprocessing.Process(
target=search_process,
args=(target_address, attempts_per_process, result_queue)
)
processes.append(p)
p.start()
total_attempts = 0
for _ in range(num_processes):
result, attempts = result_queue.get()
total_attempts += attempts
if result:
# Stop all processes
for p in processes:
p.terminate()
return result, total_attempts
# Wait for all processes to complete
for p in processes:
p.join()
end_time = time.time()
print(f"Total time: {end_time - start_time:.2f} seconds")
return None, total_attempts
if __name__ == "__main__":
target_address = "19vkiEajfhuZ8bs8Zu2jgmC6oqZbWqhxhG" # puzzle address
print(f"Target Bitcoin Address: {target_address}")
result, attempts = multiprocessing_search(target_address)
if result:
f = open("keys.txt", "a")
f.write(result + '\n')
f.close()
print(f"Matching private key found: {result}")
print(f"Total attempts: {attempts}")
f = open("keys.txt", "a")
f.write(result + '\n')
f.close()
else:
print(f"No match found after {attempts} attempts")
from bitcoin import privtopub, pubtoaddr
import random
import string
import multiprocessing
import time
import os
import secrets
def create_random_slider_field(columns):
return [random.choice(string.hexdigits.lower()) for _ in range(columns)]
def adjust_slider(slider, column, direction):
hex_chars = string.hexdigits.lower()
current_index = hex_chars.index(slider[column])
new_index = (current_index + direction) % len(hex_chars)
slider[column] = hex_chars[new_index]
return slider
def check_address(private_key, target_address):
try:
address = pubtoaddr(privtopub(private_key))
return address == target_address
except Exception as e:
print(f"Error generating address: {e}")
return False
def search_process(target_address, process_attempts, result_queue):
byte_values = list(range(256))
random_bytes = [secrets.choice(byte_values) for _ in range(8)]
random.seed(int.from_bytes(random_bytes, byteorder='big'))
slider_columns = 17 # Adjusted to 17 for remaining digits
attempts = 0
hex_chars = string.hexdigits.lower()
while attempts < process_attempts:
slider = create_random_slider_field(slider_columns)
# Construct private key with fixed '1' at the start
private_key = '0' * 46 + '1' + ''.join(slider)
# Check the constructed private key
if check_address(private_key, target_address):
result_queue.put((private_key, attempts))
return
attempts += 1
if attempts % 1000 == 0:
print(f"Process {multiprocessing.current_process().name} Attempts: {attempts}, Current slider: 1{''.join(slider)}")
result_queue.put((None, attempts))
def multiprocessing_search(target_address, max_attempts=1000000, num_processes=4): #max_attempts / 4 cores
processes = []
result_queue = multiprocessing.Queue()
attempts_per_process = max_attempts // num_processes
start_time = time.time()
for i in range(num_processes):
p = multiprocessing.Process(
target=search_process,
args=(target_address, attempts_per_process, result_queue)
)
processes.append(p)
p.start()
total_attempts = 0
for _ in range(num_processes):
result, attempts = result_queue.get()
total_attempts += attempts
if result:
# Stop all processes
for p in processes:
p.terminate()
return result, total_attempts
# Wait for all processes to complete
for p in processes:
p.join()
end_time = time.time()
print(f"Total time: {end_time - start_time:.2f} seconds")
return None, total_attempts
if __name__ == "__main__":
target_address = "19vkiEajfhuZ8bs8Zu2jgmC6oqZbWqhxhG" # puzzle address
print(f"Target Bitcoin Address: {target_address}")
result, attempts = multiprocessing_search(target_address)
if result:
f = open("keys.txt", "a")
f.write(result + '\n')
f.close()
print(f"Matching private key found: {result}")
print(f"Total attempts: {attempts}")
f = open("keys.txt", "a")
f.write(result + '\n')
f.close()
else:
print(f"No match found after {attempts} attempts")
Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
If you just want it for 69 then try this
from bitcoin import privtopub, pubtoaddr
import random
import string
import multiprocessing
import time
import os
import secrets
def create_random_slider_field(columns):
return [random.choice(string.hexdigits.lower()) for _ in range(columns)]
def adjust_slider(slider, column, direction):
hex_chars = string.hexdigits.lower()
current_index = hex_chars.index(slider[column])
new_index = (current_index + direction) % len(hex_chars)
slider[column] = hex_chars[new_index]
return slider
def check_address(private_key, target_address):
try:
address = pubtoaddr(privtopub(private_key))
return address == target_address
except Exception as e:
print(f"Error generating address: {e}")
return False
def search_process(target_address, process_attempts, result_queue):
byte_values = list(range(256))
random_bytes = [secrets.choice(byte_values) for _ in range(
]
random.seed(int.from_bytes(random_bytes, byteorder='big'))
slider_columns = 17
attempts = 0
hex_chars = string.hexdigits.lower()
while attempts < process_attempts:
slider = create_random_slider_field(slider_columns)
for column in range(slider_columns):
original_value = slider[column]
original_index = hex_chars.index(original_value)
# Check original value
private_key = '0' * 46 + '1' + ''.join(slider) # Updated prefix, adjust leading zeros.
if check_address(private_key, target_address):
result_queue.put((private_key, attempts))
return
attempts += 1
# Optimized range checking
for i in range(1, 16):
# Check increasing values
new_index = (original_index + i) % 16
slider[column] = hex_chars[new_index]
private_key = '0' * 46 + '1' + ''.join(slider) # Updated prefix, adjust leading zeros.
if check_address(private_key, target_address):
result_queue.put((private_key, attempts))
return
attempts += 1
# Reset to original value before moving to next column
slider[column] = original_value
if attempts % 1000 == 0:
print(f"Process {multiprocessing.current_process().name} Attempts: {attempts}, Current slider: 1{''.join(slider)}")
result_queue.put((None, attempts))
def multiprocessing_search(target_address, max_attempts=1000000, num_processes=4): #max_attempts / 4 cores
processes = []
result_queue = multiprocessing.Queue()
attempts_per_process = max_attempts // num_processes
start_time = time.time()
for i in range(num_processes):
p = multiprocessing.Process(
target=search_process,
args=(target_address, attempts_per_process, result_queue)
)
processes.append(p)
p.start()
total_attempts = 0
for _ in range(num_processes):
result, attempts = result_queue.get()
total_attempts += attempts
if result:
# Stop all processes
for p in processes:
p.terminate()
return result, total_attempts
# Wait for all processes to complete
for p in processes:
p.join()
end_time = time.time()
print(f"Total time: {end_time - start_time:.2f} seconds")
return None, total_attempts
if __name__ == "__main__":
target_address = "19vkiEajfhuZ8bs8Zu2jgmC6oqZbWqhxhG" # puzzle address
print(f"Target Bitcoin Address: {target_address}")
result, attempts = multiprocessing_search(target_address)
if result:
f = open("keys.txt", "a")
f.write(result + '\n')
f.close()
print(f"Matching private key found: {result}")
print(f"Total attempts: {attempts}")
f = open("keys.txt", "a")
f.write(result + '\n')
f.close()
else:
print(f"No match found after {attempts} attempts")
from bitcoin import privtopub, pubtoaddr
import random
import string
import multiprocessing
import time
import os
import secrets
def create_random_slider_field(columns):
return [random.choice(string.hexdigits.lower()) for _ in range(columns)]
def adjust_slider(slider, column, direction):
hex_chars = string.hexdigits.lower()
current_index = hex_chars.index(slider[column])
new_index = (current_index + direction) % len(hex_chars)
slider[column] = hex_chars[new_index]
return slider
def check_address(private_key, target_address):
try:
address = pubtoaddr(privtopub(private_key))
return address == target_address
except Exception as e:
print(f"Error generating address: {e}")
return False
def search_process(target_address, process_attempts, result_queue):
byte_values = list(range(256))
random_bytes = [secrets.choice(byte_values) for _ in range(
]random.seed(int.from_bytes(random_bytes, byteorder='big'))
slider_columns = 17
attempts = 0
hex_chars = string.hexdigits.lower()
while attempts < process_attempts:
slider = create_random_slider_field(slider_columns)
for column in range(slider_columns):
original_value = slider[column]
original_index = hex_chars.index(original_value)
# Check original value
private_key = '0' * 46 + '1' + ''.join(slider) # Updated prefix, adjust leading zeros.
if check_address(private_key, target_address):
result_queue.put((private_key, attempts))
return
attempts += 1
# Optimized range checking
for i in range(1, 16):
# Check increasing values
new_index = (original_index + i) % 16
slider[column] = hex_chars[new_index]
private_key = '0' * 46 + '1' + ''.join(slider) # Updated prefix, adjust leading zeros.
if check_address(private_key, target_address):
result_queue.put((private_key, attempts))
return
attempts += 1
# Reset to original value before moving to next column
slider[column] = original_value
if attempts % 1000 == 0:
print(f"Process {multiprocessing.current_process().name} Attempts: {attempts}, Current slider: 1{''.join(slider)}")
result_queue.put((None, attempts))
def multiprocessing_search(target_address, max_attempts=1000000, num_processes=4): #max_attempts / 4 cores
processes = []
result_queue = multiprocessing.Queue()
attempts_per_process = max_attempts // num_processes
start_time = time.time()
for i in range(num_processes):
p = multiprocessing.Process(
target=search_process,
args=(target_address, attempts_per_process, result_queue)
)
processes.append(p)
p.start()
total_attempts = 0
for _ in range(num_processes):
result, attempts = result_queue.get()
total_attempts += attempts
if result:
# Stop all processes
for p in processes:
p.terminate()
return result, total_attempts
# Wait for all processes to complete
for p in processes:
p.join()
end_time = time.time()
print(f"Total time: {end_time - start_time:.2f} seconds")
return None, total_attempts
if __name__ == "__main__":
target_address = "19vkiEajfhuZ8bs8Zu2jgmC6oqZbWqhxhG" # puzzle address
print(f"Target Bitcoin Address: {target_address}")
result, attempts = multiprocessing_search(target_address)
if result:
f = open("keys.txt", "a")
f.write(result + '\n')
f.close()
print(f"Matching private key found: {result}")
print(f"Total attempts: {attempts}")
f = open("keys.txt", "a")
f.write(result + '\n')
f.close()
else:
print(f"No match found after {attempts} attempts")
Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
What do you see, when you have the public key ?
3+2= 5, 3*2= 6, 6/3= 2, 2-3= 1, 3-2= -1. Now we have public key of 1, 2, 3, 4, 5, 6. Add, divide, subtract and multiply, it all works the same whether you do it with public keys of the private keys, or you just do them directly with private keys.
In other words, if you have the public key of private key 89, then by having 1 up to 9 public keys saved, you could solve the private key after subtracting G 80 times from 89, when you reach public key of 9 after 80 steps then you know the target's value. It works the same with multiplying, dividing etc.
Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
hi... new here. apologies for entering the gates with suspicions but merely curious what these means, if anything important. I have followed along for a bit now and recognize many geniuses in here that know more than I in this realm.. so I understand the first response will be "If you dont trust it, just dont use it" and the second will be "NEVER use any exe you didnt compile"... Got it.
Now, I uploaded brichard19's cuBitcrack.exe into this site virustotal.com and also Iceland2k14's close source file from his bsgs 'ice_secp256k1.dll'... is it normal to have 'Contacted IP traffic' for these types of things and also are these Execution Parents actually part of the dll file? Alas, BSGS Cuda by Etasyon. My PC through up every red flag and refused for me to allow it to be on my machine.. virustotal showing IP Traffic of some sort...
https://www.virustotal.com/gui/file/0eecdbfabaaef36f497e944a6ceb468d01824f3ae6457b4ae4b3ac8e95eebb55/relations
https://www.virustotal.com/gui/file/fcc1fa47a3f7aabfd2b7772b86987b699d5741584a6312743cf2778e01894ab1/relations
https://www.virustotal.com/gui/file/292d7c84618df3be1179aabbc599ead21c7ad00dfc5222dc2fc6ff44676f891f/behavior
Silly, I see i cant post pics here so the links will have to suffice for reference.
They are false positives. If you are using Windows just block their ability to send and receive to and from the internet they should still work, most of the anti-viruses will give some kind of warning on mining software even though these are not considered mining software. I have been using each on and off for years with no issuesNow, I uploaded brichard19's cuBitcrack.exe into this site virustotal.com and also Iceland2k14's close source file from his bsgs 'ice_secp256k1.dll'... is it normal to have 'Contacted IP traffic' for these types of things and also are these Execution Parents actually part of the dll file? Alas, BSGS Cuda by Etasyon. My PC through up every red flag and refused for me to allow it to be on my machine.. virustotal showing IP Traffic of some sort...
https://www.virustotal.com/gui/file/0eecdbfabaaef36f497e944a6ceb468d01824f3ae6457b4ae4b3ac8e95eebb55/relations
https://www.virustotal.com/gui/file/fcc1fa47a3f7aabfd2b7772b86987b699d5741584a6312743cf2778e01894ab1/relations
https://www.virustotal.com/gui/file/292d7c84618df3be1179aabbc599ead21c7ad00dfc5222dc2fc6ff44676f891f/behavior
Silly, I see i cant post pics here so the links will have to suffice for reference.
Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
I doubt if 10 minutes for 66 even on a super computer is enough and after the 10 minutes its $1.60 per minute so 130 would cost a lot more money than 66. eventually the cost will go down.
Keep in mind the limitations imposed by the IBM Quantum provider, such as the number of allowed jobs, 10 minutes execution time, and queuing times (a shared resources).
Instead of applying Controlled-X gates individually in a loop, you can use Qiskit's QuantumCircuit.mct (Multiple-Control Toffoli) gate to combine multiple Controlled-X gates into a single operation.
qc.mct(list(range(16)), 16)
Code:
def sha256_compression_function(qc, message_bits, expression):
# Ensure the length of message_bits is 256
assert len(message_bits) == 256,
# Apply Controlled-X gates based on the message bits
qc.mct(list(range(16)), 16) # Combine Controlled-X gates into a single operation
# Manually construct the boolean conditions from the expression
qc.x([i for i, char in enumerate(expression) if char == '1' and i < 16])
# Ensure the length of message_bits is 256
assert len(message_bits) == 256,
# Apply Controlled-X gates based on the message bits
qc.mct(list(range(16)), 16) # Combine Controlled-X gates into a single operation
# Manually construct the boolean conditions from the expression
qc.x([i for i, char in enumerate(expression) if char == '1' and i < 16])
Good Luck !
p.s.
I think it takes at least a week or two to hit something with this...... Every day is $1.60x1440.
High class gambling.
I need to make changes to the Kangaroo_CPU.dll file. How can I do this? I cannot see its content. I tried various programs but I could not see the codes. The programs give errors, I think it is encrypted
DLLs and SOs are binary files that contain compiled code. If you have access to the source code of the library, it is always better to make the necessary changes there and recompile the library. This is the safest and most recommended approach. If not, the question arises as to what is hidden in them?
Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
@unclevito, your code looks like a time travel code, and you got a chance at using a quantum computer just to waste it on 66? They are not good at brute forcing, they should be used for public key calculations.
6.6 bitcoins is over $250,000 dollars so 66 is not a waste unless you are an evil billionaireRe: Bitcoin puzzle transaction ~32 BTC prize to who solves it
@unclevito, your code looks like a time travel code, and you got a chance at using a quantum computer just to waste it on 66? They are not good at brute forcing, they should be used for public key calculations.
6.6 bitcoins is over $250,000 dollars so 66 is not a waste unless you are an evil billionaireRe: Bitcoin puzzle transaction ~32 BTC prize to who solves it
@unclevito, your code looks like a time travel code, and you got a chance at using a quantum computer just to waste it on 66? They are not good at brute forcing, they should be used for public key calculations.
anyone can use it since you are using IBM's resources. any computer that can execute python can get it running
Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
I wrote a program to connect to IBM quantum to test looking for puzzle 66 and am currently connected to IBM_Kyoto Japan super computer with the free 10 minutes outcome unknown, is 10 minutes enough?. System puts you in and out of queue with 2 to 3 second snipets so the 10 minutes could take hours before any results if any. anyone who wants to try it go to my github page to download script/instructions https://github.com/unclevito2017 If like me I have already tried everything
import qiskit
from qiskit import execute, Aer, IBMQ
from qiskit.circuit.library import PhaseOracle
from qiskit_ibm_provider import IBMProvider
from qiskit import QuantumCircuit
def sha256_compression_function(qc, message_bits, expression):
# Ensure the length of message_bits is 256
assert len(message_bits) == 256, "Message must be 256 bits long"
# Apply controlled-X gates based on the message bits
for i, bit in enumerate(message_bits[:32]):
if bit == '1' and i < 16: # Ensure i is within the valid range
qc.cx(i, 31) # Apply CX gate to qubit 16 with control qubit i
# Manually construct the boolean conditions from the expression
for i, char in enumerate(expression):
if char == '1' and i < 16: # Ensure i is within the valid range
qc.x(i) # Apply X gate to qubit i
# Apply the oracle to each qubit individually
for i in range(16):
qc.cx(i, 16) # Controlled-X gate with control qubit i and target qubit 16
qc.x(i) # Reset the control qubit qubit 16
def main():
# Load IBM Quantum account
IBMQ.load_account()
provider = IBMProvider() # No hub, group, or project parameters
# Target Bitcoin address
target_address_hex = "20d45a6a762535700ce9e0b216e31994335db8a5"
target_address_decimal = int(target_address_hex, 16)
# Define the range for iteration in hexadecimal
start_range = 0x2000000000000000
end_range = 0x3fffffffffffffff
# Iterate over the range
for decimal_value in range(int(start_range), int(end_range) + 1):
# Convert decimal value to bytes and binary string
hex_value = hex(decimal_value)[2:].zfill(32) # Ensure a fixed length of 32 characters
message_bytes = bytes.fromhex(hex_value)
binary_message = ''.join(format(byte, '08b') for byte in message_bytes)
binary_message = binary_message.zfill(256) # Pad to 256 bits
# Initialize quantum circuit with the initial state based on the binary message
qc = QuantumCircuit(32, 32, name="qc", global_phase=0)
# Apply bit operations to encode the initial state and message onto the qubits
for i, bit in enumerate(binary_message[:16]):
if bit == '1':
qc.x(i)
# Implement the SHA-256 compression function using a quantum oracle search for target address prefix 20d45
sha256_compression_function(qc, binary_message, expression="message[0] == '1' and message[1] == '0' and message[2] == '1' and message[3] == '1'")
# Measure the final state of the qubits
qc.measure_all()
# Use the IBM Quantum backend
backend = provider.get_backend('ibm_kyoto')
# Simulate the circuit on the IBM Quantum backend
job = execute(qc, backend=backend, shots=1024)
# Get the results and extract the final state
counts = job.result().get_counts(qc)
final_state = int(list(counts.keys())[0].replace(" ", ""), 2)
# Check if the generated hash matches the target address characters 10
if hex(final_state)[:10] == hex(target_address_decimal)[:10]:
print(f"Target address found!")
print(f"Decimal Value: {decimal_value}")
print(f"Simulated Bitcoin hash160: {hex(final_state)[2:].zfill(40)}")
break
else:
print("Target address not found within the specified range.")
if __name__ == "__main__":
main()
import qiskit
from qiskit import execute, Aer, IBMQ
from qiskit.circuit.library import PhaseOracle
from qiskit_ibm_provider import IBMProvider
from qiskit import QuantumCircuit
def sha256_compression_function(qc, message_bits, expression):
# Ensure the length of message_bits is 256
assert len(message_bits) == 256, "Message must be 256 bits long"
# Apply controlled-X gates based on the message bits
for i, bit in enumerate(message_bits[:32]):
if bit == '1' and i < 16: # Ensure i is within the valid range
qc.cx(i, 31) # Apply CX gate to qubit 16 with control qubit i
# Manually construct the boolean conditions from the expression
for i, char in enumerate(expression):
if char == '1' and i < 16: # Ensure i is within the valid range
qc.x(i) # Apply X gate to qubit i
# Apply the oracle to each qubit individually
for i in range(16):
qc.cx(i, 16) # Controlled-X gate with control qubit i and target qubit 16
qc.x(i) # Reset the control qubit qubit 16
def main():
# Load IBM Quantum account
IBMQ.load_account()
provider = IBMProvider() # No hub, group, or project parameters
# Target Bitcoin address
target_address_hex = "20d45a6a762535700ce9e0b216e31994335db8a5"
target_address_decimal = int(target_address_hex, 16)
# Define the range for iteration in hexadecimal
start_range = 0x2000000000000000
end_range = 0x3fffffffffffffff
# Iterate over the range
for decimal_value in range(int(start_range), int(end_range) + 1):
# Convert decimal value to bytes and binary string
hex_value = hex(decimal_value)[2:].zfill(32) # Ensure a fixed length of 32 characters
message_bytes = bytes.fromhex(hex_value)
binary_message = ''.join(format(byte, '08b') for byte in message_bytes)
binary_message = binary_message.zfill(256) # Pad to 256 bits
# Initialize quantum circuit with the initial state based on the binary message
qc = QuantumCircuit(32, 32, name="qc", global_phase=0)
# Apply bit operations to encode the initial state and message onto the qubits
for i, bit in enumerate(binary_message[:16]):
if bit == '1':
qc.x(i)
# Implement the SHA-256 compression function using a quantum oracle search for target address prefix 20d45
sha256_compression_function(qc, binary_message, expression="message[0] == '1' and message[1] == '0' and message[2] == '1' and message[3] == '1'")
# Measure the final state of the qubits
qc.measure_all()
# Use the IBM Quantum backend
backend = provider.get_backend('ibm_kyoto')
# Simulate the circuit on the IBM Quantum backend
job = execute(qc, backend=backend, shots=1024)
# Get the results and extract the final state
counts = job.result().get_counts(qc)
final_state = int(list(counts.keys())[0].replace(" ", ""), 2)
# Check if the generated hash matches the target address characters 10
if hex(final_state)[:10] == hex(target_address_decimal)[:10]:
print(f"Target address found!")
print(f"Decimal Value: {decimal_value}")
print(f"Simulated Bitcoin hash160: {hex(final_state)[2:].zfill(40)}")
break
else:
print("Target address not found within the specified range.")
if __name__ == "__main__":
main()
Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
I've acquired a new RTX4070 to add to my aging set of Nvidia cards. Does anyone know if any of the software (Kangaroo, Keyhunt, Bitcrack) take advantage of CCap higher than 7.5? I'm pretty sure none of them do since none of them (except keyhunt) has had recent development.
Two of the newest programs within the past 6 months are https://github.com/Etayson/Etarkangaroo and https://github.com/ilkerccom/bitcrackrandomiser . Hope that helpsRe: Bitcoin puzzle transaction ~32 BTC prize to who solves it
PUZZLE SOLVED: Wed Oct 11 12:13:21 2023, total time: 13.47 sec
nice catching again nomachine, is this programmable for 120th and up
- WIF: -0000000000000000000000000000000000000000000000000022bd43c2e9354
nice catching again nomachine, is this programmable for 120th and up
Yes.
It takes about 3 minutes to start solving Puzzle 130 on my 12 Core - but will start.
Here is code for Puzzle130
Code:
import sys
import os
import time
import random
import hashlib
import gmpy2
from gmpy2 import mpz
from functools import lru_cache
import multiprocessing
from multiprocessing import Pool, cpu_count
# Constants
MODULO = gmpy2.mpz(0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFFC2F)
ORDER = gmpy2.mpz(0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEBAAEDCE6AF48A03BBFD25E8CD0364141)
GX = gmpy2.mpz(0x79BE667EF9DCBBAC55A06295CE870B07029BFCDB2DCE28D959F2815B16F81798)
GY = gmpy2.mpz(0x483ADA7726A3C4655DA4FBFC0E1108A8FD17B448A68554199C47D08FFB10D4B8)
# Define Point class
class Point:
def __init__(self, x=0, y=0):
self.x = x
self.y = y
PG = Point(GX, GY)
ZERO_POINT = Point(0, 0)
# Function to multiply a point by 2
def multiply_by_2(P, p=MODULO):
c = gmpy2.f_mod(3 * P.x * P.x * gmpy2.powmod(2 * P.y, -1, p), p)
R = Point()
R.x = gmpy2.f_mod(c * c - 2 * P.x, p)
R.y = gmpy2.f_mod(c * (P.x - R.x) - P.y, p)
return R
# Function to add two points
def add_points(P, Q, p=MODULO):
dx = Q.x - P.x
dy = Q.y - P.y
c = gmpy2.f_mod(dy * gmpy2.invert(dx, p), p)
R = Point()
R.x = gmpy2.f_mod(c * c - P.x - Q.x, p)
R.y = gmpy2.f_mod(c * (P.x - R.x) - P.y, p)
return R
# Function to calculate Y-coordinate from X-coordinate
@lru_cache(maxsize=None)
def x_to_y(X, y_parity, p=MODULO):
Y = gmpy2.mpz(3)
tmp = gmpy2.mpz(1)
while Y > 0:
if Y % 2 == 1:
tmp = gmpy2.f_mod(tmp * X, p)
Y >>= 1
X = gmpy2.f_mod(X * X, p)
X = gmpy2.f_mod(tmp + 7, p)
Y = gmpy2.f_div(gmpy2.add(p, 1), 4)
tmp = gmpy2.mpz(1)
while Y > 0:
if Y % 2 == 1:
tmp = gmpy2.f_mod(tmp * X, p)
Y >>= 1
X = gmpy2.f_mod(X * X, p)
Y = tmp
if Y % 2 != y_parity:
Y = gmpy2.f_mod(-Y, p)
return Y
# Function to compute a table of points
def compute_point_table():
points = [PG]
for k in range(255):
points.append(multiply_by_2(points[k]))
return points
POINTS_TABLE = compute_point_table()
# Global event to signal all processes to stop
STOP_EVENT = multiprocessing.Event()
# Function to check and compare points for potential solutions
def check(P, Pindex, DP_rarity, A, Ak, B, Bk):
check = gmpy2.f_mod(P.x, DP_rarity)
if check == 0:
message = f"\r[+] [Pindex]: {mpz(Pindex)}"
messages = []
messages.append(message)
output = "\033[01;33m" + ''.join(messages) + "\r"
sys.stdout.write(output)
sys.stdout.flush()
A.append(mpz(P.x))
Ak.append(mpz(Pindex))
return comparator(A, Ak, B, Bk)
else:
return False
# Function to compare two sets of points and find a common point
def comparator(A, Ak, B, Bk):
global STOP_EVENT
result = set(A).intersection(set(B))
if result:
sol_kt = A.index(next(iter(result)))
sol_kw = B.index(next(iter(result)))
difference = Ak[sol_kt] - Bk[sol_kw]
HEX = "%064x" % difference
t = time.ctime()
pid = os.getpid() # Get the process ID
core_number = pid % cpu_count() # Calculate the CPU core number
total_time = time.time() - starttime
print(f"\033[32m[+] PUZZLE SOLVED: {t}, total time: {total_time:.2f} sec, Core: {core_number+1:02} \033[0m")
print(f"\033[32m[+] WIF: \033[32m {HEX} \033[0m")
with open("KEYFOUNDKEYFOUND.txt", "a") as file:
file.write("\n\nSOLVED " + t)
file.write(f"\nTotal Time: {total_time:.2f} sec")
file.write("\nPrivate Key (decimal): " + str(difference))
file.write("\nPrivate Key (hex): " + HEX)
file.write(
"\n-------------------------------------------------------------------------------------------------------------------------------------\n"
)
STOP_EVENT.set() # Set the stop event to signal all processes
# Memoization for point multiplication
ECMULTIPLY_MEMO = {}
# Function to multiply a point by a scalar
def ecmultiply(k, P=PG, p=MODULO):
if k == 0:
return ZERO_POINT
elif k == 1:
return P
elif k % 2 == 0:
if k in ECMULTIPLY_MEMO:
return ECMULTIPLY_MEMO[k]
else:
result = ecmultiply(k // 2, multiply_by_2(P, p), p)
ECMULTIPLY_MEMO[k] = result
return result
else:
return add_points(P, ecmultiply((k - 1) // 2, multiply_by_2(P, p), p))
# Recursive function to multiply a point by a scalar
def mulk(k, P=PG, p=MODULO):
if k == 0:
return ZERO_POINT
elif k == 1:
return P
elif k % 2 == 0:
return mulk(k // 2, multiply_by_2(P, p), p)
else:
return add_points(P, mulk((k - 1) // 2, multiply_by_2(P, p), p))
# Generate a list of powers of two for faster access
@lru_cache(maxsize=None)
def generate_powers_of_two(hop_modulo):
return [mpz(1 << pw) for pw in range(hop_modulo)]
# Worker function for point search
def search_worker(
Nt, Nw, puzzle, kangaroo_power, starttime, lower_range_limit, upper_range_limit
):
global STOP_EVENT
pid = os.getpid()
core_number = pid % cpu_count()
#Random seed Config
#constant_prefix = b'' #back to no constant
#constant_prefix = b'\xbc\x9b\x8cd\xfc\xa1?\xcf' #Puzzle 50 seed - 10-18s
constant_prefix = b'\xbc\x9b'
prefix_length = len(constant_prefix)
length = 8
ending_length = length - prefix_length
with open("/dev/urandom", "rb") as urandom_file:
ending_bytes = urandom_file.read(ending_length)
random_bytes = constant_prefix + ending_bytes
print(f"[+] [Core]: {core_number+1:02}, [Random seed]: {random_bytes}")
random.seed(random_bytes)
t = [
mpz(
lower_range_limit
+ mpz(random.randint(0, upper_range_limit - lower_range_limit))
)
for _ in range(Nt)
]
T = [mulk(ti) for ti in t]
dt = [mpz(0) for _ in range(Nt)]
w = [
mpz(random.randint(0, upper_range_limit - lower_range_limit)) for _ in range(Nt)
]
W = [add_points(W0, mulk(wk)) for wk in w]
dw = [mpz(0) for _ in range(Nw)]
Hops, Hops_old = 0, 0
oldtime = time.time()
starttime = oldtime
while True:
for k in range(Nt):
Hops += 1
pw = T[k].x % hop_modulo
dt[k] = powers_of_two[pw]
solved = check(T[k], t[k], DP_rarity, T, t, W, w)
if solved:
STOP_EVENT.set()
break
t[k] = mpz(t[k]) + dt[k] # Use mpz here
T[k] = add_points(POINTS_TABLE[pw], T[k])
for k in range(Nw):
Hops += 1
pw = W[k].x % hop_modulo
dw[k] = powers_of_two[pw]
solved = check(W[k], w[k], DP_rarity, W, w, T, t)
if solved:
STOP_EVENT.set()
break
w[k] = mpz(w[k]) + dw[k] # Use mpz here
W[k] = add_points(POINTS_TABLE[pw], W[k])
if STOP_EVENT.is_set():
break
# Main script
if __name__ == "__main__":
os.system("clear")
t = time.ctime()
sys.stdout.write("\033[01;33m")
sys.stdout.write(f"[+] [Kangaroo]: {t}" + "\n")
sys.stdout.flush()
# Configuration for the puzzle
puzzle = 130
compressed_public_key = "03633cbe3ec02b9401c5effa144c5b4d22f87940259634858fc7e59b1c09937852" # Puzzle 130
lower_range_limit = 2 ** (puzzle - 1)
upper_range_limit = (2 ** puzzle) - 1
kangaroo_power = puzzle // 8
Nt = Nw = (2 ** kangaroo_power // puzzle) * puzzle + 8
DP_rarity = 8 * puzzle
hop_modulo = (puzzle // 2) + 8
# Precompute powers of two for faster access
powers_of_two = generate_powers_of_two(hop_modulo)
T, t, dt = [], [], []
W, w, dw = [], [], []
if len(compressed_public_key) == 66:
X = mpz(compressed_public_key[2:66], 16)
Y = x_to_y(X, mpz(compressed_public_key[:2]) - 2)
else:
print("[error] pubkey len(66/130) invalid!")
print(f"[+] [Puzzle]: {puzzle}")
print(f"[+] [Lower range limit]: {lower_range_limit}")
print(f"[+] [Upper range limit]: {upper_range_limit}")
print("[+] [Xcoordinate]: %064x" % X)
print("[+] [Ycoordinate]: %064x" % Y)
W0 = Point(X, Y)
starttime = oldtime = time.time()
Hops = 0
process_count = cpu_count()
print(f"[+] [Using {process_count} CPU cores for parallel search]:")
# Create a pool of worker processes
pool = Pool(process_count)
results = pool.starmap(
search_worker,
[
(
Nt,
Nw,
puzzle,
kangaroo_power,
starttime,
lower_range_limit,
upper_range_limit,
)
]
* process_count,
)
pool.close()
pool.join()
import os
import time
import random
import hashlib
import gmpy2
from gmpy2 import mpz
from functools import lru_cache
import multiprocessing
from multiprocessing import Pool, cpu_count
# Constants
MODULO = gmpy2.mpz(0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFFC2F)
ORDER = gmpy2.mpz(0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEBAAEDCE6AF48A03BBFD25E8CD0364141)
GX = gmpy2.mpz(0x79BE667EF9DCBBAC55A06295CE870B07029BFCDB2DCE28D959F2815B16F81798)
GY = gmpy2.mpz(0x483ADA7726A3C4655DA4FBFC0E1108A8FD17B448A68554199C47D08FFB10D4B8)
# Define Point class
class Point:
def __init__(self, x=0, y=0):
self.x = x
self.y = y
PG = Point(GX, GY)
ZERO_POINT = Point(0, 0)
# Function to multiply a point by 2
def multiply_by_2(P, p=MODULO):
c = gmpy2.f_mod(3 * P.x * P.x * gmpy2.powmod(2 * P.y, -1, p), p)
R = Point()
R.x = gmpy2.f_mod(c * c - 2 * P.x, p)
R.y = gmpy2.f_mod(c * (P.x - R.x) - P.y, p)
return R
# Function to add two points
def add_points(P, Q, p=MODULO):
dx = Q.x - P.x
dy = Q.y - P.y
c = gmpy2.f_mod(dy * gmpy2.invert(dx, p), p)
R = Point()
R.x = gmpy2.f_mod(c * c - P.x - Q.x, p)
R.y = gmpy2.f_mod(c * (P.x - R.x) - P.y, p)
return R
# Function to calculate Y-coordinate from X-coordinate
@lru_cache(maxsize=None)
def x_to_y(X, y_parity, p=MODULO):
Y = gmpy2.mpz(3)
tmp = gmpy2.mpz(1)
while Y > 0:
if Y % 2 == 1:
tmp = gmpy2.f_mod(tmp * X, p)
Y >>= 1
X = gmpy2.f_mod(X * X, p)
X = gmpy2.f_mod(tmp + 7, p)
Y = gmpy2.f_div(gmpy2.add(p, 1), 4)
tmp = gmpy2.mpz(1)
while Y > 0:
if Y % 2 == 1:
tmp = gmpy2.f_mod(tmp * X, p)
Y >>= 1
X = gmpy2.f_mod(X * X, p)
Y = tmp
if Y % 2 != y_parity:
Y = gmpy2.f_mod(-Y, p)
return Y
# Function to compute a table of points
def compute_point_table():
points = [PG]
for k in range(255):
points.append(multiply_by_2(points[k]))
return points
POINTS_TABLE = compute_point_table()
# Global event to signal all processes to stop
STOP_EVENT = multiprocessing.Event()
# Function to check and compare points for potential solutions
def check(P, Pindex, DP_rarity, A, Ak, B, Bk):
check = gmpy2.f_mod(P.x, DP_rarity)
if check == 0:
message = f"\r[+] [Pindex]: {mpz(Pindex)}"
messages = []
messages.append(message)
output = "\033[01;33m" + ''.join(messages) + "\r"
sys.stdout.write(output)
sys.stdout.flush()
A.append(mpz(P.x))
Ak.append(mpz(Pindex))
return comparator(A, Ak, B, Bk)
else:
return False
# Function to compare two sets of points and find a common point
def comparator(A, Ak, B, Bk):
global STOP_EVENT
result = set(A).intersection(set(B))
if result:
sol_kt = A.index(next(iter(result)))
sol_kw = B.index(next(iter(result)))
difference = Ak[sol_kt] - Bk[sol_kw]
HEX = "%064x" % difference
t = time.ctime()
pid = os.getpid() # Get the process ID
core_number = pid % cpu_count() # Calculate the CPU core number
total_time = time.time() - starttime
print(f"\033[32m[+] PUZZLE SOLVED: {t}, total time: {total_time:.2f} sec, Core: {core_number+1:02} \033[0m")
print(f"\033[32m[+] WIF: \033[32m {HEX} \033[0m")
with open("KEYFOUNDKEYFOUND.txt", "a") as file:
file.write("\n\nSOLVED " + t)
file.write(f"\nTotal Time: {total_time:.2f} sec")
file.write("\nPrivate Key (decimal): " + str(difference))
file.write("\nPrivate Key (hex): " + HEX)
file.write(
"\n-------------------------------------------------------------------------------------------------------------------------------------\n"
)
STOP_EVENT.set() # Set the stop event to signal all processes
# Memoization for point multiplication
ECMULTIPLY_MEMO = {}
# Function to multiply a point by a scalar
def ecmultiply(k, P=PG, p=MODULO):
if k == 0:
return ZERO_POINT
elif k == 1:
return P
elif k % 2 == 0:
if k in ECMULTIPLY_MEMO:
return ECMULTIPLY_MEMO[k]
else:
result = ecmultiply(k // 2, multiply_by_2(P, p), p)
ECMULTIPLY_MEMO[k] = result
return result
else:
return add_points(P, ecmultiply((k - 1) // 2, multiply_by_2(P, p), p))
# Recursive function to multiply a point by a scalar
def mulk(k, P=PG, p=MODULO):
if k == 0:
return ZERO_POINT
elif k == 1:
return P
elif k % 2 == 0:
return mulk(k // 2, multiply_by_2(P, p), p)
else:
return add_points(P, mulk((k - 1) // 2, multiply_by_2(P, p), p))
# Generate a list of powers of two for faster access
@lru_cache(maxsize=None)
def generate_powers_of_two(hop_modulo):
return [mpz(1 << pw) for pw in range(hop_modulo)]
# Worker function for point search
def search_worker(
Nt, Nw, puzzle, kangaroo_power, starttime, lower_range_limit, upper_range_limit
):
global STOP_EVENT
pid = os.getpid()
core_number = pid % cpu_count()
#Random seed Config
#constant_prefix = b'' #back to no constant
#constant_prefix = b'\xbc\x9b\x8cd\xfc\xa1?\xcf' #Puzzle 50 seed - 10-18s
constant_prefix = b'\xbc\x9b'
prefix_length = len(constant_prefix)
length = 8
ending_length = length - prefix_length
with open("/dev/urandom", "rb") as urandom_file:
ending_bytes = urandom_file.read(ending_length)
random_bytes = constant_prefix + ending_bytes
print(f"[+] [Core]: {core_number+1:02}, [Random seed]: {random_bytes}")
random.seed(random_bytes)
t = [
mpz(
lower_range_limit
+ mpz(random.randint(0, upper_range_limit - lower_range_limit))
)
for _ in range(Nt)
]
T = [mulk(ti) for ti in t]
dt = [mpz(0) for _ in range(Nt)]
w = [
mpz(random.randint(0, upper_range_limit - lower_range_limit)) for _ in range(Nt)
]
W = [add_points(W0, mulk(wk)) for wk in w]
dw = [mpz(0) for _ in range(Nw)]
Hops, Hops_old = 0, 0
oldtime = time.time()
starttime = oldtime
while True:
for k in range(Nt):
Hops += 1
pw = T[k].x % hop_modulo
dt[k] = powers_of_two[pw]
solved = check(T[k], t[k], DP_rarity, T, t, W, w)
if solved:
STOP_EVENT.set()
break
t[k] = mpz(t[k]) + dt[k] # Use mpz here
T[k] = add_points(POINTS_TABLE[pw], T[k])
for k in range(Nw):
Hops += 1
pw = W[k].x % hop_modulo
dw[k] = powers_of_two[pw]
solved = check(W[k], w[k], DP_rarity, W, w, T, t)
if solved:
STOP_EVENT.set()
break
w[k] = mpz(w[k]) + dw[k] # Use mpz here
W[k] = add_points(POINTS_TABLE[pw], W[k])
if STOP_EVENT.is_set():
break
# Main script
if __name__ == "__main__":
os.system("clear")
t = time.ctime()
sys.stdout.write("\033[01;33m")
sys.stdout.write(f"[+] [Kangaroo]: {t}" + "\n")
sys.stdout.flush()
# Configuration for the puzzle
puzzle = 130
compressed_public_key = "03633cbe3ec02b9401c5effa144c5b4d22f87940259634858fc7e59b1c09937852" # Puzzle 130
lower_range_limit = 2 ** (puzzle - 1)
upper_range_limit = (2 ** puzzle) - 1
kangaroo_power = puzzle // 8
Nt = Nw = (2 ** kangaroo_power // puzzle) * puzzle + 8
DP_rarity = 8 * puzzle
hop_modulo = (puzzle // 2) + 8
# Precompute powers of two for faster access
powers_of_two = generate_powers_of_two(hop_modulo)
T, t, dt = [], [], []
W, w, dw = [], [], []
if len(compressed_public_key) == 66:
X = mpz(compressed_public_key[2:66], 16)
Y = x_to_y(X, mpz(compressed_public_key[:2]) - 2)
else:
print("[error] pubkey len(66/130) invalid!")
print(f"[+] [Puzzle]: {puzzle}")
print(f"[+] [Lower range limit]: {lower_range_limit}")
print(f"[+] [Upper range limit]: {upper_range_limit}")
print("[+] [Xcoordinate]: %064x" % X)
print("[+] [Ycoordinate]: %064x" % Y)
W0 = Point(X, Y)
starttime = oldtime = time.time()
Hops = 0
process_count = cpu_count()
print(f"[+] [Using {process_count} CPU cores for parallel search]:")
# Create a pool of worker processes
pool = Pool(process_count)
results = pool.starmap(
search_worker,
[
(
Nt,
Nw,
puzzle,
kangaroo_power,
starttime,
lower_range_limit,
upper_range_limit,
)
]
* process_count,
)
pool.close()
pool.join()
I put only 2 bytes as a constant - the rest will be randomized through all CPU cores, since we don't know what the seed for 130 is. . .
constant_prefix = b'\xbc\x9b'
constant_prefix = b'' is all random
ON the smaller puzzles it is easy to guess what the seed is. You need to restart and restart app and you will find out which is the fastest seed by repetition. The script will show exactly which seed and which core hit the WIF. You can experiment with different ones as you like.
FileNotFoundError: [Errno 2] No such file or directory: '/dev/urandom'
I am getting error like this:
C:\Users\abc\Desktop>py 4.py
'clear' is not recognized as an internal or external command,
operable program or batch file.
- [Kangaroo]: Mon Oct 16 15:48:30 2023
- [Puzzle]: 130
- [Lower range limit]: 680564733841876926926749214863536422912
- [Upper range limit]: 1361129467683753853853498429727072845823
- [Xcoordinate]: 633cbe3ec02b9401c5effa144c5b4d22f87940259634858fc7e59b1c09937852
- [Ycoordinate]: b078a17cc1558a9a4fa0b406f194c9a2b71d9a61424b533ceefe27408b3191e3
- [Using 8 CPU cores for parallel search]:
operable program or batch file.
'clear' is not recognized as an internal or external command,
operable program or batch file.
'clear' is not recognized as an internal or external command,
operable program or batch file.
'clear' is not recognized as an internal or external command,
operable program or batch file.
'clear' is not recognized as an internal or external command,
operable program or batch file.
'clear' is not recognized as an internal or external command,
operable program or batch file.
'clear' is not recognized as an internal or external command,
operable program or batch file.
'clear' is not recognized as an internal or external command,
operable program or batch file.
- [Kangaroo]: Mon Oct 16 15:48:30 2023
- [Kangaroo]: Mon Oct 16 15:48:30 2023
- [Kangaroo]: Mon Oct 16 15:48:30 2023
- [Kangaroo]: Mon Oct 16 15:48:30 2023
- [Kangaroo]: Mon Oct 16 15:48:30 2023
- [Puzzle]: 130
- [Puzzle]: 130
- [Kangaroo]: Mon Oct 16 15:48:30 2023
- [Puzzle]: 130
- [Puzzle]: 130
- [Lower range limit]: 680564733841876926926749214863536422912
- [Puzzle]: 130
- [Lower range limit]: 680564733841876926926749214863536422912
- [Lower range limit]: 680564733841876926926749214863536422912
- [Puzzle]: 130
- [Lower range limit]: 680564733841876926926749214863536422912
- [Upper range limit]: 1361129467683753853853498429727072845823
- [Lower range limit]: 680564733841876926926749214863536422912
- [Upper range limit]: 1361129467683753853853498429727072845823
- [Upper range limit]: 1361129467683753853853498429727072845823
- [Lower range limit]: 680564733841876926926749214863536422912
- [Upper range limit]: 1361129467683753853853498429727072845823
- [Xcoordinate]: 633cbe3ec02b9401c5effa144c5b4d22f87940259634858fc7e59b1c09937852
- [Upper range limit]: 1361129467683753853853498429727072845823
- [Xcoordinate]: 633cbe3ec02b9401c5effa144c5b4d22f87940259634858fc7e59b1c09937852
- [Xcoordinate]: 633cbe3ec02b9401c5effa144c5b4d22f87940259634858fc7e59b1c09937852
- [Upper range limit]: 1361129467683753853853498429727072845823
- [Xcoordinate]: 633cbe3ec02b9401c5effa144c5b4d22f87940259634858fc7e59b1c09937852
- [Ycoordinate]: b078a17cc1558a9a4fa0b406f194c9a2b71d9a61424b533ceefe27408b3191e3
- [Xcoordinate]: 633cbe3ec02b9401c5effa144c5b4d22f87940259634858fc7e59b1c09937852
- [Ycoordinate]: b078a17cc1558a9a4fa0b406f194c9a2b71d9a61424b533ceefe27408b3191e3
- [Kangaroo]: Mon Oct 16 15:48:30 2023
- [Ycoordinate]: b078a17cc1558a9a4fa0b406f194c9a2b71d9a61424b533ceefe27408b3191e3
- [Xcoordinate]: 633cbe3ec02b9401c5effa144c5b4d22f87940259634858fc7e59b1c09937852
- [Kangaroo]: Mon Oct 16 15:48:30 2023
- [Ycoordinate]: b078a17cc1558a9a4fa0b406f194c9a2b71d9a61424b533ceefe27408b3191e3
- [Ycoordinate]: b078a17cc1558a9a4fa0b406f194c9a2b71d9a61424b533ceefe27408b3191e3
- [Ycoordinate]: b078a17cc1558a9a4fa0b406f194c9a2b71d9a61424b533ceefe27408b3191e3
- [Puzzle]: 130
- [Lower range limit]: 680564733841876926926749214863536422912
- [Upper range limit]: 1361129467683753853853498429727072845823
- [Xcoordinate]: 633cbe3ec02b9401c5effa144c5b4d22f87940259634858fc7e59b1c09937852
- [Ycoordinate]: b078a17cc1558a9a4fa0b406f194c9a2b71d9a61424b533ceefe27408b3191e3
- [Puzzle]: 130
- [Lower range limit]: 680564733841876926926749214863536422912
- [Upper range limit]: 1361129467683753853853498429727072845823
- [Xcoordinate]: 633cbe3ec02b9401c5effa144c5b4d22f87940259634858fc7e59b1c09937852
- [Ycoordinate]: b078a17cc1558a9a4fa0b406f194c9a2b71d9a61424b533ceefe27408b3191e3
"""
Traceback (most recent call last):
File "C:\Program Files\Python311\Lib\multiprocessing\pool.py", line 125, in worker
result = (True, func(*args, **kwds))
^^^^^^^^^^^^^^^^^^^
File "C:\Program Files\Python311\Lib\multiprocessing\pool.py", line 51, in starmapstar
return list(itertools.starmap(args[0], args[1]))
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
File "C:\Users\abc\Desktop\4.py", line 219, in search_worker
with open("/dev/urandom", "rb") as urandom_file:
^^^^^^^^^^^^^^^^^^^^^^^^^^
FileNotFoundError: [Errno 2] No such file or directory: '/dev/urandom'
"""
The above exception was the direct cause of the following exception:
Traceback (most recent call last):
File "C:\Users\abc\Desktop\4.py", line 277, in <module>
results = pool.starmap(
^^^^^^^^^^^^^
File "C:\Program Files\Python311\Lib\multiprocessing\pool.py", line 375, in starmap
return self._map_async(func, iterable, starmapstar, chunksize).get()
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
File "C:\Program Files\Python311\Lib\multiprocessing\pool.py", line 774, in get
raise self._value
FileNotFoundError: [Errno 2] No such file or directory: '/dev/urandom'
C:\Users\abc\Desktop>
help me bro
This is not my code but it looks like you are using windows and '/dev/urandom' is a linux function that is also available in Windows Subsystem Ubuntu so I think you are using a linux program.in windows. I think a few pages back the creator of this program posted a version that does not use '/dev/urandom' that should work in windows.
Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
Based on the information provided, it appears that the pattern for generating the private key (PVK) values for these Bitcoin addresses involves incrementing the PVK values by a specific sequence of integers. Let's calculate the PVK value for Address 15 and beyond based on the observed pattern:
Address 15: PVK value = Address 14's PVK value + 27
Address 15: PVK value = 10544 + 27
Address 15: PVK value = 10571
So, the PVK value for Address 15 is 10571.
You can continue this pattern to calculate the PVK values for addresses beyond Address 15 by adding the next integer in the sequence to the PVK value of the previous address.
Address 15: PVK value = Address 14's PVK value + 27
Address 15: PVK value = 10544 + 27
Address 15: PVK value = 10571
So, the PVK value for Address 15 is 10571.
You can continue this pattern to calculate the PVK values for addresses beyond Address 15 by adding the next integer in the sequence to the PVK value of the previous address.
What is for 66 then ?
I can even help you further how to program this
import math
# Given list of numbers
numbers = [
1, 3, 7, 8, 21, 49, 76, 224, 467, 514, 1155, 2683, 5216, 10544, 26867, 51510,
95823, 198669, 357535, 863317, 1811764, 3007503, 5598802, 14428676, 33185509,
54538862, 111949941, 227634408, 400708894, 1033162084, 2102388551, 3093472814,
7137437912, 14133072157, 20112871792, 42387769980, 100251560595, 146971536592,
323724968937, 1003651412950, 1458252205147, 2895374552463, 7409811047825,
15404761757071, 19996463086597, 51408670348612, 119666659114170, 191206974700443,
409118905032525, 611140496167764, 2058769515153876, 4216495639600700,
6763683971478124, 9974455244496707, 30045390491869460, 44218742292676575,
138245758910846492, 199976667976342049, 525070384258266191, 1135041350219496382,
1425787542618654982, 3908372542507822062, 8993229949524469768,
17799667357578236628, 30568377312064202855
]
Give me math formula that can calculate pattern for WIF 66 here ?
Whoever succeeds in doing this will receive a greater prize than the Nobel Prize.
p.s.
It doesn't even have to be an exact number.
That it is accurate to approximately +/- 8 decimal places.
you must be a very big joker if you think there is a pattern in the numbers you see up there
Tell that to him.
No pattern
[1.0986122886681098, 0.8472978603872034, 0.13353139262452252, 0.9650808960435873, 0.8472978603872034, 0.4389130421757046, 1.0809127115687085, 0.7346832058138579, 0.095894007786268, 0.8096323575007283, 0.8428352274697302, 0.6647952531808645, 0.7038261531358003, 0.9353417899552472, 0.6508771958620958, 0.6207267760911943, 0.7291373836260231, 0.5875931361451538, 0.8815486874877241, 0.7412742883673946, 0.5068092100595862, 0.621442479911261, 0.9466649690007394, 0.8328956894510604, 0.4968002070443873, 0.7191383042437529, 0.7096890523067678, 0.565494345222092, 0.9471441493574098, 0.7104500196844334, 0.3862202442339999, 0.8360595282539585, 0.6831637178413494, 0.3528424038245319, 0.7454998789960143, 0.8608227563358781, 0.38255630630651183, 0.7896553545955527, 1.1315057477074362, 0.37359383611238073, 0.6858758829076486, 0.9396904576187914, 0.7318717272660606, 0.26087874561462243, 0.9442514298159388, 0.8449031946466405, 0.46864644180339354, 0.7606493566316814, 0.4013210422240192, 1.2145368832080123, 0.7168958843120095, 0.47256334190535654, 0.38845964139438394, 1.1026819053976311, 0.38643947837596926, 1.1398842299982945, 0.3691677366484285, 0.9653316192351014, 0.7708920423038066, 0.22805524036508018, 1.0083967352657979, 0.8333510086282203, 0.682707702906626, 0.540786284089215]
Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
No more 66, just played with it for a while but have some 10 character 68 for whatever you are experimenting with. Also these addresses have not been checked for possible balance. Good luck.
Seems that sha256 and rmd160 is a joke for most users here, all those partial address are not useful at all.
Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
Please do post as many of these #66 addresses with 11 characters 13zb1hQbWVs.. and their priv keys cause they are useful but not in a way you would expect!
No more 66, just played with it for a while but have some 10 character 68 for whatever you are experimenting with. Also these addresses have not been checked for possible balance. Good luck.Public Address: 1MvdyGVaSnFsGhuneW4a1bxX9QMwgPVfK7
Private WIF: p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qeQ4mTtyQAL9M2j7wngg
Private HEX: F668882BB573D4042 (68 bit)
Public Address: 1MvDyGvasnz9FMN7c4FJii2pkC2J7uem8v
Private WIF: p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qeW257e6pwSo4NtdtEEC
Private HEX: FAE02CAB0033F51B2 (68 bit)
Public Address: 1MVdygvAsNK2Y2yQBwxu6di6eFRQc5XPGE
Private WIF: p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qeGzXxWNgNFrjhT6TvQX
Private HEX: F119D8D4A16FF7B2D (68 bit)
Public Address: 1MVdygVASnvUR1mjq3uU45HF99SxnTBNfX
Private WIF: p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qeHNg3HAVS4GuhsgGCSR
Private HEX: F1632C13D1F56F610 (68 bit)
Public Address: 1MVdYgvasnQViMvKgU7ZcMLxPsKfzXmVLn
Private WIF: p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qeH6g97mTbh62k6CS8o6
Private HEX: F12E2FA90A7282D89 (68 bit)
Public Address: 1MVDygvasnuHJjicLCqbnVXpSEGiJBBSwE
Private WIF: p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qdzDY8NkESz1KDguW1ZR
Private HEX: E4834BB8E00915EA3 (68 bit)
Public Address: 1MVdyGvASN7Fjvs1kkzcyskkRRsfVUmq5B
Private WIF: p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qdRRmrVuhAkFdWdXVeAu
Private HEX: CBE8AF6167D94E5ED (68 bit)
Public Address: 1MVdyGvasnmybtzLS69hvTUNLwuamnHxi8
Private WIF: p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qeMofxK3YityvHN9wGm5
Private HEX: F4B658E8E5ADF6E3C (68 bit)
Public Address: 1MvDYgVAsNU9pW8ocMXS4kbtaMwAdrTqU2
Private WIF: p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qdtaNBhThUkhYyhV3odg
Private HEX: E047B587613B7D8F4 (68 bit)
Public Address: 1MvDYgvASnD6Wiyz5HDLjarVCxWENynQZC
Private WIF: p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qeNhwxECcpxQqzHSJFLE
Private HEX: F5637BEBC898C37B6 (68 bit)
Public Address: 1MVDYgVAsNsRgzhyGQpmnR9AqRHrVk6u7o
Private WIF: p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qeMHfFNeHGC7Wy34cEvv
Private HEX: F452F28CFB53836E6 (68 bit)
Public Address: 1MVdyGVASN7YBrGQVLPobFsAiAktH5Dm6W
Private WIF: p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qcVxCyNivigBfK9Lcnry
Private HEX: A3C857EFD87150551 (68 bit)
Public Address: 1MvdyGVaSNATQJKT37biasiqahTTrd7ChP
Private WIF: p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qcXGRbEE1Fv4KQmZrAWj
Private HEX: A4C4C65D6ACDE6619 (68 bit)
Public Address: 1MvdygvAsnTPuUJ7WZJ3vbVepHGi4AS7Dt
Private WIF: p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qePYNDdieYX6JhPqVVQB
Private HEX: F603D84FB53B8E664 (68 bit)
Public Address: 1MVdYgvASNxLNJ8P8UiM7NiaCLuJQpyRbC
Private WIF: p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qePzv1u3MN7mzErV9rYJ
Private HEX: F65BC5B628277ED9E (68 bit)
Public Address: 1MVdYGVasnPS4ycFJHSmxaLhfycJEoFfBN
Private WIF: p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qeQ6Wvf2uDmFdd2NB6pA
Private HEX: F66E536008E81B2CE (68 bit)
Public Address: 1MvdyGVasnpM6EoCoDiY5FzNSBdxNNC3LB
Private WIF: p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qdtW9Z8KXMVmE1bhrb5D
Private HEX: E039BD6B0FDDDBB4D (68 bit)
Public Address: 1MVdygVAsNyioNPdGWRqoG3Bumd9MucFqE
Private WIF: p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qdc5KHnREJkJiJKheJEB
Private HEX: D3E5F9800DDA1BF85 (68 bit)
Public Address: 1MvDYGVASNSfEjJ7d6feKmEpq95TrzavBd
Private WIF: p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qeMWDPtMdRTKLhJyiyJZ
Private HEX: F47C86E6DD2336B8B (68 bit)
Public Address: 1MvdYgvAsnWpaELwESphfRDYoqEkKUqPXs
Private WIF: p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qcoWhCYqHhfJhtYpabks
Private HEX: B0F58E3AE961629CA (68 bit)
Public Address: 1MVDyGvASn7V4A2W8yR6RhLAjAxrCGnyRG
Private WIF: p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qd1SxtF3iemDPN6jEYGC
Private HEX: B9EA583072C1B83A8 (68 bit)
Public Address: 1MvDYGvaSnBC3pv9ks1GwNwqitCCw6LVzv
Private WIF: p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qeJ1u39NRfVeFSfh29rx
Private HEX: F1DE75333CA0C4A8E (68 bit)
Public Address: 1MVdygVASnBcgZnKPVT8GrpLghsZRtBp6T
Private WIF: p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qeJGR6JavyVrdLZryvEH
Private HEX: F20E8AB381FBE5EA0 (68 bit)
Public Address: 1MvDygvaSNiGvsgZWehsi3NXxgsG8BhW2X
Private WIF: p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qeJJ4G1bSmv9zrJbY4MY
Private HEX: F213F9E5AB61B6789 (68 bit)
Public Address: 1MvDYgVASNb6t3MqGDJhJQvFiXqoJTJ9qC
Private WIF: p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qeJZWruVPRzfjGzfSMPx
Private HEX: F2472CCA951DE7883 (68 bit)
Public Address: 1MvdYGvASnkaYuJqhquebddF18baefhHdr
Private WIF: p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qeJd4bhd3sdMGnerZ7qW
Private HEX: F252EC5A3D501E3BC (68 bit)
Public Address: 1MvDYgvASnntBY5qfLzz3YNZCTA6vMpd81
Private WIF: p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qeLehPYVHy4pCuRaRNxw
Private HEX: F3D886BABD27AC2F9 (68 bit)
Public Address: 1MVDyGvAsn8CPNeYf2wtWaPtumgFewKeNM
Private WIF: p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qeMpmndbwBQ62QDdgXqd
Private HEX: F4B9FE0C6AB86B84F (68 bit)
Public Address: 1MvDyGvAsNoJMG6Fmh21P7hxgBYAWVZfJ1
Private WIF: p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qeRJfZp8VhfDAh5jNNNc
Private HEX: F756A87326112C3AC (68 bit)
Public Address: 1MvDygvasne3gAaAGfGsVX7nLE66QqCgPd
Private WIF: p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qduJwnPAgqCeLk488cic
Private HEX: E0D4BB22C5D9B2A3C (68 bit)
Public Address: 1MVDYGVAsNhWHRK5PLfF8XdxCyq82tdQcV
Private WIF: p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qe1G9Jkf7t6PgKM8vHHf
Private HEX: E54C0610735882DF4 (68 bit)
Public Address: 1MVdYgvaSNmxz6yeSAoKtwSZ1TWuttC1rq
Private WIF: p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qe2n9GD29kr8NYuKYCGr
Private HEX: E66F79CF3F62B3D89 (68 bit)
Public Address: 1MvdYGvAsnv7jZikFSSKschRSGf13AqurU
Private WIF: p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qe5AAbAbba2zMRpBbf9q
Private HEX: E8389AFEA6970AAA5 (68 bit)
Public Address: 1MVDYgVAsNzfXkpMFSXLjk1tXTboAmTUSP
Private WIF: p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qeAZSrEWUcBTrBXp83Mr
Private HEX: EC462F6194B2EEBDA (68 bit)
Public Address: 1MvdYGVAsNE7C62p7Qxc3ayfv8dsZSYCGF
Private WIF: p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qeFXmoqXpDUEu4HD5arV
Private HEX: F0011E853F4013F67 (68 bit)
Public Address: 1MvDyGVASNWGq19ULfEDp7CuezUGVsfBZF
Private WIF: p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qeFyN9pFEjiCvnzeUrWm
Private HEX: F055E1485B53D96F8 (68 bit)
Public Address: 1MVdYGVasNA98feozXP13gEgpPaTCbaEfr
Private WIF: p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qeLE2xrSbpEiKdS6wAHt
Private HEX: F386D82C84A7A43DC (68 bit)
Public Address: 1MvdYgvAsnFL2myuSfR92GonXjHgjtdcbc
Private WIF: p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qeXwuUgikYiTznunjxqC
Private HEX: FC529101FAC1A9553 (68 bit)
Public Address: 1MvDYgVaSNm4t3tAQ9pNwPsNfRi1a3HaLN
Private WIF: p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qcEeryE7En6q9WXW91Wp
Private HEX: 984D789616C870F09 (68 bit)
Public Address: 1MVDyGVasnKaKAaQqCybRz1pUSSiJUMPYX
Private WIF: p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qcYVRkzPRTqg5m9Kf8mS
Private HEX: A5AFEF749C2108448 (68 bit)
Public Address: 1MVDyGVAsnMt9QNFB2LhcnY6KtwTkxbBje
Private WIF: p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qcrJCqe3ktPXYNh1tfHT
Private HEX: B30C7A43FD6293CAE (68 bit)
Public Address: 1MvDygVaSnWYQ2faQNweJpxyhrE12tnrW9
Private WIF: p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qcmpLT67DJ3j9uCMBJ6R
Private HEX: AFAFCBD73953376FC (68 bit)
Public Address: 1MvdygVASNe9NxmTYFbUeXMWCzLp6TFHcn
Private WIF: p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qcvkjuRNjv7AsoL8A3aU
Private HEX: B664BE5788A511183 (68 bit)
Public Address: 1MVDygvaSNUbsE4rA7CdikYif3aKsnpfBT
Private WIF: p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qd4Pgk39b2X9vmiM7ZAK
Private HEX: BC1FC5A8FF9B998C3 (68 bit)
Public Address: 1MvDyGVaSNXgoT7xemvs5nvNXsWLeSJcBy
Private WIF: p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qdAgcEVvonbEatJqVk3G
Private HEX: C0D86392D1140213D (68 bit)
Public Address: 1MvDygvAsNafx3GR22x15eBL5CHKDKL5NM
Private WIF: p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qdE8N6T4vtqSeXahevnk
Private HEX: C36DFA7E52FEAC35D (68 bit)
Public Address: 1MvdygVasNKyLc2UBznFrAbre5pcptW88T
Private WIF: p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qdE8K7oF7nkvwGYcMXSq
Private HEX: C36DCEFA596710A30 (68 bit)
Public Address: 1MVdYgVASNHF9N3jn2LJb8iRi2Rv7Exn3t
Private WIF: p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qdem7nF7Dx4saf1gRbTR
Private HEX: D5E9FCAA5BF3B5B51 (68 bit)
Public Address: 1MVdYgvaSNreoWiKHkimb2Z9tVHSAkomHJ
Private WIF: p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qdbEmC13UpGhH6oCp4Ke
Private HEX: D3452A96874625DD1 (68 bit)
Public Address: 1MVDygVasnmF8sgLNSyyW5QQyQgSHgbEJ7
Private WIF: p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qdbSorLFFGcWfphFF1Se
Private HEX: D36D0FE6F9D90E809 (68 bit)
Public Address: 1MVdygvaSNYLH9pRoabDHF5NhKQggmEG13
Private WIF: p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qdtH1R2mMcvBqVK5v9T6
Private HEX: E00E3825605FD41CF (68 bit)
Public Address: 1MVDYgVasnFevNCHyrAU3N7ncVQTHXmDev
Private WIF: p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qdv4EXYDCxcCBTELUqtY
Private HEX: E1641A3BA29DEB995 (68 bit)
Public Address: 1MvDYgvaSNw2R2vLToBwE2CKCLrd4fpdnB
Private WIF: p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qdzCqKkMSezoyYUwh8CK
Private HEX: E480F73BC8C780615 (68 bit)
Public Address: 1MVDYGVaSN8F7hyUg2vFp1VK5FDYCaGP7e
Private WIF: p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qe8uszhcgdydJqV182U7
Private HEX: EB09ABA500489AD62 (68 bit)
Public Address: 1MVDYGVAsNXELqxauCm3295zq5vZ1ZhbCP
Private WIF: p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qe9DVMXMM3qDVDYpppvo
Private HEX: EB43FE4B3A7C3D8D4 (68 bit)
Public Address: 1MVdyGvASNnGdmtRJemFzy7ZK3S4CvJTYZ
Private WIF: p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qeFfAawen3w5Cg4SPRby
Private HEX: F0199A91FFB92F279 (68 bit)
Public Address: 1MvDyGVasNp1akZ5w9J5vFmgnZ4FUqrsrW
Private WIF: p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qeHc5L3MEvsocomVmYSf
Private HEX: F18F8ECF5F87A1CD1 (68 bit)
Public Address: 1MvDyGvAsnGazYQRwvFRRutmx36aBxkGd1
Private WIF: p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qeHSdFsQ9PEm6wf9tQR8
Private HEX: F17042DE19C5B2A83 (68 bit)
Public Address: 1MvDyGvasnXnQVFzgf8CqE3iCy8stjCrPK
Private WIF: p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qeJMpLJFbKT55JXzCT3R
Private HEX: F2206DCAC26935992 (68 bit)
Public Address: 1MvdYGVASNw2TKDC4sy6Hif82qe76MkTtg
Private WIF: p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qeJSsLRDQZ9EDMvRNdqj
Private HEX: F23129048753DC681 (68 bit)
Public Address: 1MVDyGVaSNKmXqDxpeL5sJmA7f6L3hTiCZ
Private WIF: p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qeKG31pct11LRuP5gVqP
Private HEX: F2CD604FF18ADE4B1 (68 bit)
Public Address: 1MvdYgvASnhEd2aY9BDa5osUmGfSDiG73k
Private WIF: p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qeKgGvXiTxgz2jkZ1L98
Private HEX: F31DA8781D5C8A0FB (68 bit)
Public Address: 1MVdygVAsnyW1dWMe1E9QuMgf14cq4g9rV
Private WIF: p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qeLVPsaw54Mx2fBb6Dx8
Private HEX: F3B9B7DA7E02B8D92 (68 bit)
Public Address: 1MvdyGVasnvAT5prKbTfWQUj2cUtKJXciS
Private WIF: p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qeNEtsmkSosmLecpEbTz
Private HEX: F509E2817BD2BD569 (68 bit)
Public Address: 1MvDygvasNbSCtAfrVJv8UDZi5xyn4Rrce
Private WIF: p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qePKpdATe5Ebt4Qi4UoN
Private HEX: F5DA4C0947EEFC96F (68 bit)
Public Address: 1MVDYGvASNbWnbvnWAo88j31tN1oFyFD59
Private WIF: p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qeUSLtjVXTVVB5vXvc1u
Private HEX: F9B05F73537D31130 (68 bit)
Public Address: 1MVDygvaSNAG2RhC3qhroB5r7K3WQsFVDi
Private WIF: p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qeUVBAJg97XhV4aVJ78X
Private HEX: F9B9C0CB96C8B4051 (68 bit)
Public Address: 1MVDygVASNkZWYmbYXojqMmKLtjAEhgVkg
Private WIF: p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qeVq66iREjkuj7sZUb8R
Private HEX: FABBCC81372866A93 (68 bit)
Public Address: 1MVdYgvASNpBKfwugmNNYbgamYkQqH5yYo
Private WIF: p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qeWQ4YU8N3GjJTBVbR4C
Private HEX: FB2901676ADB5A801 (68 bit)
Public Address: 1MVdyGVASnaUkxQaoQrmfG4gXu6aUqWwot
Private WIF: p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qebvmEAPMQSMYFbZoRjG
Private HEX: FF4F29EA60AF4FC00 (68 bit)
PubAddress: 1MvdygvASN5XeYYqEWkTiHohpYTP19YHRj
Priv (WIF): p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qeW4JhwCjY1dASJyQHzx
Priv (HEX): FAE793164FD6785D2 (68 bit)
PubAddress: 1MvdyGVasN5h14sbZ5D4BBiDeDAtpbqfUn
Priv (WIF): p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qeUSaZUWmnadaDknNoH8
Priv (HEX): F9B127412135DC023 (68 bit)
Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
Look closely, I am working with artistic binary, not with base58, Ripemd160, decimal, or hexadecimal. and just print output in any format, If you have any output result even in any format, please show us. 100% of people are trying randomly even in 130 also, and I am also trying randomly, but with some logic. You are a master of mathematics, so you can solve 130 directly even with your mobile. All the best!
I don't know if this will help you in any way:
the problem is I have almost 2 thousand of these which will be posted as a code below, in order to maintain orderliness and less consumption of space
Code:
13zb1hQbUMfsukCbQ68xfiRUKmQsjnuN4i - 48373146411643185729 - 20d45a6a761982f4c90f65d426f7f529e296d53b - 29F4FF05E95F42A41 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZhbhBQjwQVHnkvfNJTv
13zb1hQbUNQk542NaQsTARn4DHMJyNeHyF - 56079894187336241810 - 20d45a6a761994c64363d754ac40d31b1956e6ff - 30A43CEA3ADAB9292 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZrWNidYDipR4MKTPUez
13zb1hQbUS3MinKVRsfLv7dnWJvaxGEkp2 - 52723525194923494754 - 20d45a6a7619ec52e73033af2735e1d20805de55 - 2DBAF96D2D5C5CD62 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZndMYToFaPpKxu88cjD
13zb1hQbUSkr7XJdPxdsTbj1pktPYL7tV9 - 51637160598513618584 - 20d45a6a7619fd9206ab6d54e7420173783299af - 2CC9C0BFA9C338E98 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZmNXEdH4k77QPgCFjWK
13zb1hQbUTKNyCRK2TVAf5hwkLa9Uu645s - 46307419374150351508 - 20d45a6a761a0b17ee9d1607a1ba6707925baade - 282A50092D545FA94 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZfDCe8fYcijS1VJFjb8
13zb1hQbUTYE5CZ5rgM3484Cu7VjUvWS5j - 45530387498103924700 - 20d45a6a761a106f025a34d6c08ad869bafe27f7 - 277DC6E32FE5EE7DC - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZeK7AgYYCCD7RPSEKwY
13zb1hQbUUKpzmjCTNBRDreH8mPKJwSk3y - 40783378601333411922 - 20d45a6a761a2363c7081e895a67f2fe4358ebab - 235FBAAC220BED052 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZYprWu8QCpVmZF5bxfM
13zb1hQbUXTKFHSYSy9DqKxRo4AQDGRsTM - 50710785841633655170 - 20d45a6a761a6ed4cb272462c99e21757b4f056b - 2BFC0E70BB37B7982 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZkJR3bamqyuJkR4yET8
13zb1hQbUXmjNLhf3c4JHYtY1vAx3dGM6a - 71066356642963105794 - 20d45a6a761a767c8710d0073ad100da1b754b53 - 3DA3E6AD75109A802 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qa9q7HVyZWzFnu9UtHox
13zb1hQbUbUo6sUMZqDUGTeknSpidzg9dK - 63844582612081437934 - 20d45a6a761acfe2af2dd8b9c7abf24f809060fa - 37605859F6231ECEE - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qa1UwZKBNX2zidGx6x1R
13zb1hQbUdWHTrzuX2UkbXqxc1ZSjas6k5 - 52578885193495407418 - 20d45a6a761b00b95228ef19d2dcff1546075e7a - 2D9ADB9823456EB3A - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZnTf7XsoDK7FaHSLf7x
13zb1hQbUeRDvf9ErscMG9Br7qXeXLhuf3 - 62212354265957463079 - 20d45a6a761b16bad845af99ceaa5c539ffa36f6 - 35F5EAE96F726F427 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZybWfojnLBpor2M8EQS
13zb1hQbUeuZeDL4xUiPewJYGJ2KwVBP4L - 45945488787136122994 - 20d45a6a761b2282a6764f7775cedbf1e46845a3 - 27D9F2A9F4CF11072 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZenwHFYpW26N4K4PVzu
13zb1hQbUfaZvv19wWCprmHnKcYTSTv4wj - 69602263947050363453 - 20d45a6a761b32b960e200d690d3591e08169d9e - 3C5ECEA4A8EEA2A3D - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qa88xBwUV1mEg4Bv7ZDw
13zb1hQbUieeh5TafCEtjdMia1geeAZQHC - 39010224650660463935 - 20d45a6a761b7cc00d6abece985aa7c4dde56fd6 - 21D6028A27ECDC53F - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZWmyeBEAaiKRicih6Z4
13zb1hQbUmY7wQsyzweNc31DrHgyQ67Ntv - 67768482581973269012 - 20d45a6a761bc25d69ad842c5c589c97708636c8 - 3AC7A03DB01C37A14 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qa621ZoZWmgDLD8G8J5r
13zb1hQbUn1G3nRUpDNVer7uTUp1Nuz1Gg - 71218851260447208337 - 20d45a6a761bcda581f4ecff0ae2f5085caa11da - 3DC5C2FE342563391 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qaA1LFtwQyCneiGEFCLH
13zb1hQbUnjJiX1BbK8fKbyogwgUTySLLb - 63586286590600392899 - 20d45a6a761bdf1fd93547d232bb5e65b9384111 - 3726FDEC272EBB0C3 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qa1BdBL6cFKPGBM6B2jh
13zb1hQbUonPt6ivuAoT3ESzjXLHcXpsVf - 60209185519109236906 - 20d45a6a761bf884a9e09895c4fe8d02a2554a2b - 34391FF3A4A1968AA - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZwHDPRB5eUqzuGGaork
13zb1hQbUqAtiBYWZLAczE9H5p5oU8nPHi - 56721454423665497548 - 20d45a6a761c19fac9c0e8c96241fd25e9e02eb9 - 3132B1646721755CC - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZsFPQugpErH2a9D7Uzb
13zb1hQbUqjw89WnMc1AJBhNrxUyXebQBe - 40814589889422392579 - 20d45a6a761c27b6ec5cb135362252e87b13b069 - 2366A8D426C457D03 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZYrwt3FhLfvEPKghnq6
13zb1hQbUrLu5j8mN1WLfnAqjgFuQiQ9jJ - 64983447597674406245 - 20d45a6a761c363fb730bd0b8407eebedd8e9bb7 - 385D3954B03982165 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qa2oJ1fL187cB4nPnDfK
13zb1hQbUrRLu51PRAm1yriMZuNbkAyGAf - 64828058755413437369 - 20d45a6a761c3818be5173188610be49e16c472e - 383AB87F6DA91EBB9 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qa2csnXT4SJoJWuaMEkb
13zb1hQbUwxB7V9vD9mzRYBgXU6aRMfAmc - 49910945312668584909 - 20d45a6a761cbd762050f4b97939f6cc79c15a27 - 2B4A74C52858F0BCD - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZjNnt4w47xDdyNRzyYo
13zb1hQbUx9SgeG8AJYFAy1KB7UhJjZzJv - 44987181335164522958 - 20d45a6a761cc22543f9a8a13d8aea5cd87a01e5 - 270529312709091CE - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZdggvP7XdMV1Lbyfrq1
13zb1hQbV1CSJ3mApejKZg9Q2ZwxHbsf4h - 52539621551147244828 - 20d45a6a761d0bb812c58436c6cbab43bd6a209c - 2D9223B6F1596DD1C - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZnR2SL8GH8saJUKAZ7Y
13zb1hQbV1QDJaoPRhM3v8wSVYtJQMak9f - 40633044818028117832 - 20d45a6a761d109d391dd10d7d8832cf6be0226b - 233E592FA9917BF48 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZYemwqi7L4SZ87yfE7y
13zb1hQbV1dSErMEBGXyxQj3JiuVzn2Ki6 - 62969084214533516027 - 20d45a6a761d161c5b53781f8ff7e93afb7cda8f - 369DF2077F6ED6AFB - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZzUFCXRcPN5HFCgR4Lh
13zb1hQbV3XUSRTMSK9e62k6XNMFKzssYE - 47409107039558925764 - 20d45a6a761d43da15912400aa81f2eb9684c03e - 291EEFBAB13617DC4 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZgV4Xovk7Ab8exDkuGW
13zb1hQbV4b6pR5tQVFcm3h4qSazcWZ1zE - 72050580919479989201 - 20d45a6a761d5d782b501196fc63084274a04055 - 3E7E7159B1E2473D1 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qaAy6RSTpVr5fKF1Xudm
13zb1hQbV5q1zq4HkPBTSu19kNiejqGdme - 40583925234315236828 - 20d45a6a761d7b5d3b7aab25d3972c4340f6ba06 - 2333710FA4E5F15DC - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZYbUwotGsQnJNQPkLfk
13zb1hQbVC6MQ6QJLgjDbMnUUBHRiCuAqk - 69693481010025281322 - 20d45a6a761e12659cae4c9c2a0a786fa14d6113 - 3C730FBBA0AFD372A - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qa8F4tJ3KhdMy18Xju2i
13zb1hQbVHY9MT6hrzfFtSgXSNcdg9zVhw - 39344071570337342528 - 20d45a6a761e95aac5a50c6b71b960f1e20fb710 - 2220238A3AF80A440 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZXAMoJ9h9s4YUNziGPn
13zb1hQbVKVNL4npzuchFbFQ4xCkrNY61C - 55574839596039944241 - 20d45a6a761ec4bb84a22db233709a86e8e13098 - 303417E2A1B463831 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZqvWpj2hvkUwmrsTUZx
13zb1hQbVL8EazBem1iNCcEsvKDet5yFFD - 38547530011398808927 - 20d45a6a761ed40eae64ff9112cacf9e372fbdc1 - 216F4564FD222A55F - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZWExTnpv2HRFPqEoamJ
13zb1hQbVLxbTu9nH6Vy2jETg7WdcrwQBg - 48578036181456736893 - 20d45a6a761ee828ecd1bff4b9d99ee8ad034dae - 2A227DA8791CD527D - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZhqRtakAt1C9s22Xgww
13zb1hQbVP2wBA6gqgnD91GK5QNi3H5qXC - 61626912946917582431 - 20d45a6a761f1a2eefabc0aa143aa36d1516fb48 - 3573EC6CFD4F1A65F - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZxvGC8dqYfZtBTYdugB
13zb1hQbVRjaEWQCfzDWQNQVWMCBT7TGgg - 43426421386561873307 - 20d45a6a761f5b4bba36f21960ec7242c1feceb5 - 25AA9A42B0472659B - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZbt3wGwX3hJ3CAf27GY
13zb1hQbVTDtJZBzJM4Az2QWMwDnjaiNN1 - 40016679490149059183 - 20d45a6a761f7f2c9a8edaffe256be83c43e25b1 - 22B57CDFA94FE8A6F - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZXwTDpLXzKBay8Cgszb
13zb1hQbVUK6aaF9PdJoecHTwY2mWee6iA - 68496122321250678520 - 20d45a6a761f99734be5c267bbf7d32251e2607f - 3B6931C57D9D9F6F8 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qa6rnykddCFoiTkEmAWf
13zb1hQbVV6Wspr6hKCva5V16kupYzpU3F - 45710493447657181424 - 20d45a6a761fac54917e6f2459117a243889a319 - 27A5C4B9B276D50F0 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZeXBWK9vRg8AGmNzzZG
13zb1hQbVVGivyJQnVrHF2aGyBtqCEmLgW - 44591259433357248018 - 20d45a6a761fb092d6b10b82176e59ff375a96fc - 26AD3FA33348B8612 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZdE9PNmG9NbLWV9mxt6
13zb1hQbVYZXqEjLBvLD686xw8DkqtrwSw - 63378459962790095029 - 20d45a6a761fffe3d01ba222ccc232ad58352e23 - 36F8D858AED6BA8B5 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZzwh3oVvSyF5x4pAW1E
13zb1hQbVYxbKaqgH153ahCmtCEAS7o8Sy - 55793361886353676191 - 20d45a6a76200979c484d46ee0cd46d916c483bf - 30649D7079CEDD79F - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZrBAYTy4EXikGXVmMiH
13zb1hQbVZvJec2vhoAp3cSVPzyfihu2Cb - 41519339909890313544 - 20d45a6a762020a270a3bebd31157d3810592484 - 2403253AB4DB60D48 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZZgCHdPH8EzxwzTaFT4
13zb1hQbVay9HvCTGYcbM5qqnAD1f7ZHWk - 51558826148598714495 - 20d45a6a762039ec9c744bd3744c1f071918e9a6 - 2CB85BF363759107F - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZmHGdiDfYWMsAfCW6LK
13zb1hQbVduNtf74hem3mZtkC7RZCGUM8u - 42469672927311339040 - 20d45a6a762080b02d3c188aaea202d26a6bcfd1 - 24D6296836F6A9E20 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZamue1TB1tPCwKidCXa
13zb1hQbVk2GWNK1XiQcESPRwoH1q11Pg5 - 69011055032482558937 - 20d45a6a76211435ec710a9daed88c438fd73b73 - 3BDB884EA720E73D9 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qa7TKHVL5mMs7oCKiPdo
13zb1hQbVnnREPjyLyuqQC295UBBFsbcKC - 41642945547972771287 - 20d45a6a762156c8645caef14de054e7c42239ff - 241E9765793D9FDD7 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZZpUvdzN4UW4gFqjpPF
13zb1hQbVporSKzvnjXGHurafGhEJqVS8n - 52296969161005638398 - 20d45a6a762187993cea8dcfa25b6af24c2262ae - 2D5C4285EE74CA2FE - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZn8ktV1hWNCEzjx847R
13zb1hQbVq6Eb6DWpo2jL82VVKsyaAPfj9 - 67363950421618710667 - 20d45a6a76218e6886944fb91c276476aa3ed6ec - 3A6DCD3FFBB9BD88B - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qa5YtYuj3pLVE1RcqYv2
13zb1hQbVrkA9L1HgEkfbG5V7gVLhz9GNC - 66273030322280827366 - 20d45a6a7621b6483f96d396b6d4228864cb78ef - 397B919F2D43D89E6 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qa4HkXfMyXJMFPcM8FRT
13zb1hQbVscBuukft24v2NyYTwPNEmszWV - 47892007991488533054 - 20d45a6a7621cb144333dc2bb1f98781c70185de - 298A2978688D7D23E - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZh3SHN3FmrxLjkW7bh7
13zb1hQbVtAe743EdjjZDj3WAgUyjLCHyx - 45451784428954582698 - 20d45a6a7621d8919c541d15f053b7e98e517264 - 276C52D1FCF77FEAA - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZeDqXBidEwQMajMiVdN
13zb1hQbVvvbvBRXGJz6fCdnWKEGphyE86 - 56307328097674805592 - 20d45a6a76221b100eebcc27121c2fedcf1d7ebd - 30D6BD09369474158 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZrmd6E2U4TvXmmGqp4t
13zb1hQbVxm6wChizxeUrV3WsAiRzDxnAi - 39245800942542946961 - 20d45a6a762247555429d31ba44aa1f4a00ad1fe - 220A5180629F68291 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZX3mg8yNzpqevU2xWDj
13zb1hQbVzb191oGK38LtWZHzFrxPgvXMi - 43012420006970119220 - 20d45a6a7622735ab97166ac50f34d5cbf3c7c40 - 254EAD01B555BD434 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZbQJ6mgew3rQG3qRTJV
13zb1hQbW4zTBXzQ4igazJNS6wLqYyXXYB - 69995096379101670571 - 20d45a6a7622dd8a6e0d439a2bca55f072268128 - 3CB60894E8F95ECAB - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qa8bHiAwQKR8JY82HF8g
13zb1hQbW8TLaLD7TXMSBm13JSpVPSW7b2 - 46953846807416350502 - 20d45a6a7623310bccacf5c820cc37b4987b7cbe - 28B9D92E632292726 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZfxYG7sub3PDwDHwg7c
13zb1hQbW72XwBQfK6oE64RgiT4HNv73oS - 71261271020632337880 - 20d45a6a76230ea02a213a4684b9d694f57d0104 - 3DCF2E46F53A0EDD8 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qaA4BCuPUVUDAEw7bKYs
13zb1hQbWA4X1qZYgTbsmrTy94uNRrLNLb - 69556136017161912978 - 20d45a6a762357c79597112d43241cf7f6b26247 - 3C549092EF3B08292 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qa85rpd273YESRqBCkUW
13zb1hQbWAJbshtWU9oVGAoV3TbPM3mvk7 - 65149433827363738528 - 20d45a6a76235da250f03c4e19861c3167386470 - 3882148E3B5D553A0 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qa2zRSr2NVLAwV5e78eh
13zb1hQbWCTqdfWG2FLQGVpf3x8dPQLjV3 - 73298600510165034337 - 20d45a6a762391b17b2e367243ea9f89a66e04a3 - 3F938F0CFB5A72561 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qaCQmKdSq37ixUsxaAnQ
13zb1hQbWCawzPaQjJS6yH21Ca2H6ffNcX - 50316961988096453655 - 20d45a6a762394a60d8e337072e1be5b81b25dcd - 2BA49C25665526C17 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZjr1fmV5TU47oykGuPj
13zb1hQbWDug7ALk8a6n6P3eoLGVdoQGFK - 63987715262463982305 - 20d45a6a7623b48ae545395e9cf4d36af6eb5582 - 3780208028001BAE1 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qa1eY8HfryZx2ciimRk3
13zb1hQbWEs3eyJh6GxKjYDvPBKNGA7tu7 - 71815568295163669889 - 20d45a6a7623cb8f470cf956cedebd3311d5aaf7 - 3E4A426DE88092D81 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qaAhLaby6thqFF79Ngye
13zb1hQbWLR9dM1d2UYxXZczQ9jTifrjM8 - 70075455103007441891 - 20d45a6a76245173fccc672eb683a0dd5ad93fdb - 3CC7E0723F897C3E3 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qa8ggBdDdAT2S6vkxoQk
13zb1hQbWMpoRQPbThGFKQctQBxF5t9xDp - 73136266424643369142 - 20d45a6a76247364f9dfbf35dca0dbf9154e0022 - 3F6F836D2173238B6 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qaCDt67tov6tdAH7jMYu
13zb1hQbWN6K35xCA81B1aeSxjmX3fcnyT - 40799075511426865443 - 20d45a6a762479d78b11b4a065e0fd7cc14a3700 - 236336F03CEEFD923 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZYquZ42cbhfmaeU7mo7
13zb1hQbWSLKkwU6JEWuzXzuquFRWZfxkv - 44173824119322458366 - 20d45a6a7624e01b0d1580dccb8097a0e46862af - 26508F2FE5ACC38FE - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZckACQjQnmcDNmtrThj
13zb1hQbWU7gKnHcdw1rns9uPKkxBT85SP - 56099930137197539386 - 20d45a6a76250b1191bc59e6354e6a18f4473d87 - 30A8AFD3AC7E3F03A - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZrXidNm4MGzRJiWvduP
13zb1hQbWUYK9k78D4QX59kQ7NCTQQAeWA - 72817564770812256532 - 20d45a6a7625154f1b496df1b1b7f11255aebe59 - 3F28BF55AE5436114 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qaBrWpjtxikSRFwEotTb
13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so - 00000000000000000000 - 20d45a6a762535700ce9e0b216e31994335db8a5 - 00000000000000000 - 000000000000000000000000000-TARGET000000000000000000
13zb1hQbWYBvBExvJuAqxa6aM78RbgR487 - 55145666727244079428 - 20d45a6a76256d450402f9c1ce90e91929ed5c72 - 2FD4CC3B6D3762144 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZqRjzZpnTrHHWs3M5XF
13zb1hQbWYW5KKzjcDzsqwBtkuGeCimdEi - 62024157306347942536 - 20d45a6a762574d142d67158ef33c7fb16a216a8 - 35CC21273B9D17288 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZyNtsPrRcqdmvtqHAub
13zb1hQbWZSNzY7UwDRJYQm9VJoMkg4jbA - 45606245947757331515 - 20d45a6a76258b641f6b124d7cdaaaf0c9837be8 - 278E9EF0EA72C843B - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZeQC9BRGmpomZrQT3cp
13zb1hQbWZmzeXkvtTHJG86NiqTkdfSbkC - 66148191081923118495 - 20d45a6a7625938b6edbbf0b63628318d37a9468 - 395FD955224B0859F - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qa49P6SCAPvvoqpgjHxP
13zb1hQbWZuoV4TfwnvXC6BnDDyhU3GAPW - 39317810175253066921 - 20d45a6a762596ca4636ef07294de48266bfcc3b - 221A4EC0A2A32B4A9 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZX8bgWpn5XqU3jDLiCB
13zb1hQbWaZCQTTffYsbnKwsooYosFtWKA - 37891183378881205528 - 20d45a6a7625a655b26d0c505893874ba25397e3 - 20DD88686E9665518 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZVUxGi5B8Ub2GE5y3Bk
13zb1hQbWck6G2xZu5hAEH1HmzcmDsgpxe - 66318799227067830575 - 20d45a6a7625db152cef54d549416f2b427b0bd6 - 3985BB48663D4112F - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qa4LpW1TtLWh9LPWWqSh
13zb1hQbWdrMpVnzfovrujmfXcMSCpBUjG - 41456641856437793344 - 20d45a6a7625f5cc4ede86a815a36a9bceedcf23 - 23F53941F2990B240 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZZbzVDf45rMjRVRDXJh
13zb1hQbWedDzbUC6kf9ggMc14QsZE8Lg8 - 37679986193554222877 - 20d45a6a76260872a446cc6665c0a32e2e239e5b - 20AEA33CE506C2F1D - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZVEo31ithLP4tj2N5pp
13zb1hQbWef5YtDvkHJiukc8Wf89rnKRuC - 61258678184956742412 - 20d45a6a76260937fb2c9cd38726d0076d3c9256 - 352228B3F30514B0C - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZxVaKTZeHkSJt7bDccX
13zb1hQbWf72wkXYpmGwZJk8PMVxCjkh6G - 56941504739411340064 - 20d45a6a76261402000d578fceebd4a42593e56c - 31638DCDF18D5AB20 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZsW95GVZcjPn15HmN5V
13zb1hQbWgQVJePGHpxWP5duTubGsWLsn7 - 43380502377963478386 - 20d45a6a7626335f84aab3316248dda87e7e47e7 - 25A068112B0805D72 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZbpyP5MU3sxRpGPW158
13zb1hQbWgm4NWZGmhHAEgME3DdYzG12aG - 41110424991635851487 - 20d45a6a76263bec7eabe95cabed74bd4a9e5f16 - 23A8591B7AFCBC8DF - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZZCnEHMiQ9r1hXaY5if
13zb1hQbWh4LwgVmxvPedYv6bB68o5jmuS - 67492302064416046358 - 20d45a6a7626431bf62b22539a9cf00a2f60d1e9 - 3A8A4D32356E1BD16 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qa5hVeJ6frGgkDLyt44M
13zb1hQbWiqJh1dtKPPn2xSmYxYuiPUUoC - 52866479422723392567 - 20d45a6a76266de89cc2ad0916073a4a14fb2f09 - 2DDAB76EFB4ED0437 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZnnwRCNTPArgHFSb9vJ
13zb1hQbWjXbd2F91XwNHFe45VUwLNgvMW - 40255744070289703429 - 20d45a6a76267ea84ac8a75fc029bd161d170dca - 22EA921F2A6A7C205 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZYDUpVrPW46ob85JSQ5
13zb1hQbWqJef9ERQMwzZnLW7BCm4Kd7wW - 70578683669620254920 - 20d45a6a762709ef042c4f7e069e9555836a007f - 3D379DADB0A60E8C8 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qa9GQyhmve2nr4ksvUrA
13zb1hQbWs2MTRhuR93xucc6aR5UcENk86 - 62035402709595819040 - 20d45a6a76273360fe3dfc4bf860c90ff1f45031 - 35CEA061633C38C20 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZyPebbGTSMZ3Fm4dxJZ
13zb1hQbWsjb89Ts6oFRNt3YLc9sDWmAsy - 45219811061500219094 - 20d45a6a7627448519b0ee369fa989ae5c11a92e - 2738D0A935B000ED6 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZdxHVoHGwY2JnRjRRrA
13zb1hQbWxG511DNcPfsHQh7gYjfEdJdJB - 49293932962848220671 - 20d45a6a7627b1a113cdbd8c0e2dbefb22c57f45 - 2AC173ADBF87CA5FF - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZifRe7xvEMZvZmJnzMj
13zb1hQbWySaBnrmvGUGDeWxy6dW2rayNp - 55038106902729731292 - 20d45a6a7627ce1adf4a9f51ce08d3bc0c9c3aed - 2FBCEA29FA72E2CDC - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZqJXkQ5DH7BWMS2c6nd
13zb1hQbWyxLZNvFN2m6Mo1SuR6dbpDMZV - 72783912085515232789 - 20d45a6a7627da7a5480efdf6ca36b52a2194f55 - 3F214666A84656615 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qaBpFxzDxpf6GuKK3gmQ
13zb1hQbX1c3auT3JEJt53zSmx4qTcrRhe - 52535808446312523671 - 20d45a6a7628024310760ecbeb805323d6cb2d1e - 2D914AF6F6E6CA797 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZnQmcMUo4PhGtFb4qcD
13zb1hQbX3S5fz6Lh432E3qbqrY1o2CCRb - 60778693653465495993 - 20d45a6a76282e56ecc9bb30441bd432309d2855 - 34B794BDBC71979B9 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZwwPuehqASDhm444B1s
13zb1hQbX5h9sqqDJwjvW96M1GP79adL5k - 41009465893750056097 - 20d45a6a762864d30dd587bf65ba286dbfdf5f88 - 2391EE3F3F17824A1 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZZ61eniAoBVU6Wh4r3q
13zb1hQbX8AWVB3crhTjDnW4sjujRaeurx - 61144573894634420232 - 20d45a6a7628a06a4427abd24b7ba9b21636b3f6 - 3508D29FFD44EB808 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZxMvdJeXCM8acCm1Yz8
13zb1hQbX74csDRZKpfVxcn5CxZA6B566A - 54027091218435242382 - 20d45a6a762885db63350ad5c714d913d10a84eb - 2EDC6C9372275798E - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZp8kS9F8ZCFcEvkT968
13zb1hQbXBKCVtooPcnw2Fz9HBadwxdtTL - 64926152529041250630 - 20d45a6a7628ec5b474462c929e5524462f590ac - 3850807BB4E555946 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qa2jTDoE2UscVaZSih2A
13zb1hQbXDgQUZpmQhaDmkf3UTVAD69mnj - 65017328348174567175 - 20d45a6a7629256429212b89fc3b6211366098df - 3864BF3A7F5E14707 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qa2qZkrHcF67mXMhW1DH
13zb1hQbXGteXHnTmMcZLkGKvFz2PQdB2C - 72621240731378449212 - 20d45a6a762972cf31bbf7af80f726b18a0d39dc - 3EFD279AE6DF0FB3C - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qaBdMRQutQBKrmuSDxy5
13zb1hQbXM3nYUjcbZfiLZJSyRjE9g2jMG - 53258146830810104088 - 20d45a6a7629d70c044fda1ce139d360eafa8293 - 2E31AF25E6E084118 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZoFCQgLGgQqiLTgb3iu
13zb1hQbXM8TNDbsej2du8HeEJMismHSha - 37374982255611240282 - 20d45a6a7629d8fce8b0ff10b0e023c5f708ecc2 - 206AE9C57203C5F5A - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZUtM2uUCUXc3zKRKKh7
13zb1hQbXQ4ZFwTx5wmtVTX9gntRzVetQ5 - 46090302046286485533 - 20d45a6a762a1fb2556e826316200959acb32b24 - 27FA1A583A35D981D - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZexePFq38nx5qqu8q5n
13zb1hQbXQbeDew3174qy1qDE3izmGdxPv - 39259768439105628017 - 20d45a6a762a2c9e4fdf825b790b7962306883b6 - 220D6B76360FBA771 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZX4hzFgDhtJZQJ5k4BF
13zb1hQbXQrdeM3om3tLtWPc8oSc5gLHvo - 58270247312686672141 - 20d45a6a762a32d97d3380777a00642d610e0eb3 - 328A98133AED9690D - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZu3Ds4ZvcGkfo178cQw
13zb1hQbXS5897kPMm7zVzm5zkHdFnwPSr - 37500976854243917276 - 20d45a6a762a5026d94df4c5793088c52b107dce - 2086E3BC29F5ABDDC - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZV2nxhhrrdcySNm1JJB
13zb1hQbXVnktT5X9pC9vYHz3ykguigEGh - 38535956016073628200 - 20d45a6a762aa9c993de96864741e063bfd57054 - 216CB37D30A255A28 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZWEBTV9d3aFmtYAGEx2
13zb1hQbXXQSTTvCGLeUWPLit8EnyJaWTP - 73230120805853816891 - 20d45a6a762ad0bacec1dd3f1b873e9316969992 - 3F845A6E213DBE83B - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qaCLB3GpX8EmrJ7cfmzm
13zb1hQbXXdCXY3wyiiWudPx9ccYdnCnMA - 55657115228247565511 - 20d45a6a762ad608a66175860b12b61a047c903e - 30465CB6A82AE24C7 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZr22kW6ZTCNpVisKuzR
13zb1hQbXYmFTWCiKBfgt6oKKuHDxJs7Zn - 48700601901610118707 - 20d45a6a762af17d711aca5a28be931e8a500393 - 2A3DB4B67152F2E33 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZhyeV4LkWuzESALmAc2
13zb1hQbXZDvUFMjDziLarGed3wRrVKYbo - 44707433644951436443 - 20d45a6a762afc93d208bc1ff355a0b48a5d52fa - 26C70B607AAAD7C9B - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZdMw8N1Je73BMwRCzfH
13zb1hQbXZVXdWa1gWegGSyoCFRBDgrsPa - 51024094854440717155 - 20d45a6a762b03108f72f8e97eea082ca31cde9c - 2C419FFEED0C68B63 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZkfRLmG6js7ubLHKN4s
13zb1hQbXc7Jn61hxweprPwG8JjF6GGDSN - 38932451728412660621 - 20d45a6a762b42281e31a56ab86826267abcffa4 - 21C4BDA92F314538D - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZWgmDuRk8UJotVum3n6
13zb1hQbXfyhemZNoET5JP4ykgsSN6BbH2 - 53739755137386749849 - 20d45a6a762b9f6f219253b6e1a676b7d8e7c23a - 2E9C9F69270691F99 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZooV8hYi7QNHsMbUrWH
13zb1hQbXgD88nWNS8FhZRL64nYjz6nJQc - 71844343667329810196 - 20d45a6a762ba5037388fe7232c23026174c817c - 3E50A61EAF4473F14 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qaAjGUNFHbUrMbvt137j
13zb1hQbXgTdNb4FLTmNuEa4qPCwhHVH7A - 50310123917629309033 - 20d45a6a762bab0ae9353650bb98aaf6c8dedd02 - 2BA3177260C2DC069 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZjqZ5ZiqpbMN8JsGFuP
13zb1hQbXkEbBnrzqGHWcfR4pfYFwdPvAW - 40079025440128169558 - 20d45a6a762c060fde57a08a5e9f375bdb4a3aeb - 22C354D4A3EAEF656 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZY1depFf1jz3bhH2PtE
13zb1hQbXrRYKvepbr7j7BoywVyDUrLvc3 - 70270594495434863631 - 20d45a6a762c9b45be5d6599a82e1e6b6595134a - 3CF334D624FEA340F - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qa8ukyn1ofEvUfbVSyES
13zb1hQbXvRGzqhE5RrPU65w5LES6LBmrQ - 55027615392277872963 - 20d45a6a762cfb99fcb8cd73415036c5d21c1452 - 2FBA95CA6858A4143 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZqHpxEDWJGVpmKnqrf3
13zb1hQbXvqsfMQ5QgTazTLP1wMpPiYPPu - 63620016244583966926 - 20d45a6a762d05d38e5a1b3bf8a8ce9619befcf8 - 372E7B3B37F0228CE - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qa1DtLSavDEQHBep3y3L
13zb1hQbXwKPx7jR2VChYvMJ7stf5bGqHs - 61069294061442299326 - 20d45a6a762d114458187241948f23debe1eff65 - 34F81B763D023F5BE - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZxGsuJZrDTgWRjj5yGX
13zb1hQbXyTLcWnjVfCnf87QEbAsu3H7p1 - 52179147553824693678 - 20d45a6a762d44c9ba23c573c0a1ab4be2375b79 - 2D421923E4469DDAE - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZmzrjxSQnSTVQcTeAsi
13zb1hQbY2BUeRHjrPJhyijpvFEsrNMKRH - 49385504878230964733 - 20d45a6a762d8686187d3f83ab694bedec425302 - 2AD5C8F07F84709FD - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZimZiWJSyPRrPCXBzAa
13zb1hQbY4W3tKfnDPX9f27A9yJsVUX6F7 - 69053226515201010566 - 20d45a6a762dbe76be484ce1ddfa5c7f03c84e05 - 3BE4E57A7E9242B86 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qa7W9GW6i9fXw4brbNu3
13zb1hQbY5EzbEmEnvYFQSigEueVdAYetr - 39572159738397903066 - 20d45a6a762dd0508f5ce7eb73199d3a07003d2e - 2252C8D9EAA38C8DA - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZXReiStD9PX54ND2mxC
13zb1hQbY8qXCcEXHgn3u7QY6WZhRdK6NA - 39929654604119693545 - 20d45a6a762e26ff1ee785031855a21f124d090b - 22A22A14E5A9858E9 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZXqcpw15kb72GkP52Kh
13zb1hQbY9dZ3kXNf1WSBGmbZXmhbdk5QT - 47279683625450009538 - 20d45a6a762e3a219e1a7e1ceb75e0c9dada3a33 - 290232DC243CCF3C2 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZgLPGhsoNBtvg9DNdHJ
13zb1hQbY38XeiDZm7Mi47gh58NZ5Tusxp - 73247582339681576548 - 20d45a6a762d9d6874835163bce4300ef4b86503 - 3F883B00E3CE56664 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qaCMLwQVi5cLJwnjfFbh
13zb1hQbYGFQivg9ECV8Hsk1pjkq4y4PU4 - 72264780422866023316 - 20d45a6a762ed9b1d9c501ef33b74e17bdcb8a0f - 3EAE012EB5C883394 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qaBDTLFgQ84Q6HPUDjTz
13zb1hQbYHSXrB5v1cAzbk6v3is4g9Mkha - 37900158026065292022 - 20d45a6a762ef66d95a389ffaddfd25bf59b93ec - 20DF868EBCACAAAF6 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZVVZAn56dGCoxPpQ97E
13zb1hQbYJUfc8fcrVKmtqcph8ptB2DehR - 37829572104561087270 - 20d45a6a762f0f6cbdc09b9feaea92c0044f23d5 - 20CFDA3664163D326 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZVQphQLYYsKUorQK8wt
13zb1hQbYMeSY3EqfxkzNchg7Cj5hmQGze - 61469704939003827820 - 20d45a6a762f5bd130b2b83cb66c5d20374c71d6 - 3551042F62965D66C - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZxjitiXZ9awoDghshRb
13zb1hQbYMuv1wrFCtxuE9APdvp8YR3Cam - 68683406980166653001 - 20d45a6a762f623fd789e23a4f5edb2358d60e3c - 3B92C7ABF886B1449 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qa75MEQrJ6aXK7EtNcPN
13zb1hQbYN2KwFa37ZtUNRmxH4HKnBdu6m - 63518637526512040799 - 20d45a6a762f64ea383d513e686c22f322aeaa31 - 3717F884B508BFB5F - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qa1768Jx4wBMjC4Tq6N7
13zb1hQbYNfr49EiVdjTDAkZh7AW15qJqW - 49154128302803991035 - 20d45a6a762f7482d966eb13db68bd577253eb16 - 2AA268B42FC9B39FB - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZiW41iQmQXk3ZcW9n3M
13zb1hQbYNpoeYq57CEYJsX1ZbxrqdYvPt - 63010540658191989085 - 20d45a6a762f783c2bfcdacc86d1a1fb98586ae2 - 36A7268E26CD7795D - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZzX2QGspiNkf5AMbSvQ
13zb1hQbYPRmvqEVTiAJ7e1UjomtnFCJfH - 54958282032736347192 - 20d45a6a762f86c58e47262f14b38ba0fc6cf42a - 2FAB30A53CAFBA438 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZqDBMM4C19xe31Va5ar
13zb1hQbYPS3S2jjfqmYoyaA8Jjn1opW4d - 46877035169548351519 - 20d45a6a762f86e2002a0241f4149a2c96b048f0 - 28A8CAF1F1C6C381F - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZfsPaeVZnvEKViqd9xd
13zb1hQbYXYJXQKuRDHdUuxKL6edZRp95L - 53285710487348575445 - 20d45a6a76304a5cebd28c4ce4b363e9034a57e9 - 2E37CDF5E52B7FCD5 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZoH3bALtf7iDBnVUtDE
13zb1hQbYXpGzFnQqRHpp6MCFfwb28Af2T - 72896968735178121584 - 20d45a6a76305100bf4b15934a8b5cbfa421c6bc - 3F3A60ED7070C6170 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qaBwqas7RnvrvGrbFQK4
13zb1hQbYYiNzeco5mRDJWJ84fyGex88p5 - 72943550970120977500 - 20d45a6a763066a95e37086ddbfb724619585ebb - 3F44B8D22C5A93C5C - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qaBzxieG9UEwhktryLzT
13zb1hQbYZQjVDN1sWfzK24RT5vqm5sLSC - 71934656248129423305 - 20d45a6a7630776f94f4490d49efb8fc111f2c7e - 3E64B3CBB459687C9 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qaAqKejRGLtE3uA7KGXW
13zb1hQbYaS3V1B2rNVsfKwRNXZCSndaxt - 62240297718131037252 - 20d45a6a763090171bb2085804234d6cd930f5a1 - 35FC1F502EBC19444 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZydPKwoFUz8TxTuFwg3
13zb1hQbYeCgB67nYR3cw35dr1muSLn7hd - 67798801360980343580 - 20d45a6a7630eaf8faf86642758a4fa3232be824 - 3ACE5BA9FD680FB1C - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qa643TeuoeyoVaLQMhke
13zb1hQbYfCh4tLsFigCmhazz3epDuCbNQ - 48319096639085843099 - 20d45a6a76310316b604f954c8bbdda490518a7f - 29E8FEA63407B929B - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZhY51Ts4Eg8JAFiaDAM
13zb1hQbYgwZkxQnjCRHojfBPmbKwNcDH8 - 72323466770253861848 - 20d45a6a76312d05410f3f2c035a368ed438f90e - 3EBB091D765BFD3D8 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qaBHPXttYdEA91nSsfCB
13zb1hQbYi7eVzTRTMbhQXLW9Lf4tjK9y9 - 69223021477850718522 - 20d45a6a7631495233503d0a28b2cda6f8c5643f - 3C0A993465A87213A - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qa7hXWgFetfdV3mbkhjz
13zb1hQbYicmXEraYfreCSJJb2nPgPy1Y8 - 50739863439266470124 - 20d45a6a7631556d21157878f342c8884789d650 - 2C02834F7794ED8EC - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZkLN7XEA4eXuDGToCFM
13zb1hQbYkE8CSJE9Dczmvvzmhm1CUdPmN - 44916764761681479414 - 20d45a6a76317c3bb1d3c4402f91b6356d3e8c5f - 26F5867924FCEC6F6 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZdby7CbVSJPg5QiNYZt
13zb1hQbYmXUp2kp1MnkCfm28Yccr1JDZJ - 49186179685162308609 - 20d45a6a76319b8eab500d387da1a1d19c453596 - 2AA9869D2F8A25401 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZiYCeKgWkgpm4GACVjy
13zb1hQbYnjxtCUX5nnowUK6p81Cy4RTNR - 40063177750128182863 - 20d45a6a7631b8db402cd786858d5cdb1fd3f9c4 - 22BFCFFE661B9464F - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZXza2f2MZdRcVaxsm7Q
13zb1hQbYr65coaa35fwkmrDh1SiUa7U2U - 47556563278343707287 - 20d45a6a7632098c30e3686402166a0d082be821 - 293FADA5610101A97 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZgewutd5K1rpGSj9fx5
13zb1hQbYt7Dm4FycZoLJkp6KbZGH4Nszc - 53059098480127906699 - 20d45a6a76323a3dbacc7605f964f61d668faf7d - 2E057C8F2D27E138B - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZo1rQw3fabbtbMnVitQ
13zb1hQbYta7n82gaH6kKBiZdXtEKet4Kz - 51379696827744687905 - 20d45a6a7632456bf85e5687ad15ad81f32e4177 - 2C9095A0B24FC9721 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZm5G6LjvzssU17Deiac
13zb1hQbYtqamAxgXWrvaivH1LR2hFbnyW - 52248453983132922421 - 20d45a6a76324bd9b585e3c0f4f794e020ac8f2a - 2D517CC12CFFB3235 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZn5WEmL3oJCR9jofCUs
13zb1hQbYwABKw7N2QkN2sBsapkiNb5QKm - 44302072124455547399 - 20d45a6a763283ccc9ba6f710d88eee18aa7901b - 266D093DFEFE87207 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZctktRSFm8kPC6B7s2W
13zb1hQbYyKFrt8MJqABBc9qYhjQqor4vf - 67626845178234534785 - 20d45a6a7632b7cb0759ce42c4b8c6a46204a7e2 - 3AA82D1632101FB81 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qa5rWp4AWSeQ629A81T4
13zb1hQbYzjxDxHtxLizTcc4Y4JruUYPe7 - 44246694740411011399 - 20d45a6a7632da2b258158e4308d35933543b999 - 2660BD66FF757D147 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZcq3Z4GsW4XYrfzMu9j
13zb1hQbZ2m1fWDppGDU1vZrXD96gU6s7s - 41185244817163056292 - 20d45a6a76330ad40f0423d58207bc26473d864e - 23B8F61F3D28074A4 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZZHoAY9Y9bGszExd6zx
13zb1hQbZ7drTvxYRWwmswQWW4hgZwMjph - 42019911220101952898 - 20d45a6a76338066bb9a3ec519124f00fdc4163b - 24724B69FA7A0B582 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZaFkkQmqZUpxiEX3SXa
13zb1hQbZ7h14f2RR3E8he367D9DBe3ajX - 42340799662575025650 - 20d45a6a763381b5c164488fbb3b392970cfdad0 - 24B98BCF641C37DF2 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZadGWypcrEnCP4jX6UB
13zb1hQbZ7uFRvwiNetS4mWeiN1CQPN5d9 - 73298960546708798659 - 20d45a6a763386cd1977367af813a8872852b1f0 - 3F93A38433FF33CC3 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qaCQniq2fg3BqiSD75WK
13zb1hQbZ8Q3gsemMLnkQitsGdJrPjQVi1 - 41108554716948110979 - 20d45a6a763392c599ed3914bdfa3b5c217a9527 - 23A7EECB66D669E83 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZZCexUaW44fFd714JEx
13zb1hQbZAoFwgfFDZMYnqpDshGZjJr6Dq - 47446912354920464392 - 20d45a6a7633cca3d326c7f9f020a8e17390d7d1 - 292754B66FC208008 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZgXbY7XLYDuDrp26UzB
13zb1hQbZAzTuretB5jaNU7ConrLPwEoPr - 46688318888855073721 - 20d45a6a7633d14c5a69331557f1c12fcd082300 - 287EE3AAA025DF3B9 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZfejm7SuigQwfWsgn68
13zb1hQbZByoUcmMqU1BbvTpV4uGZtBAC8 - 39970028619426507997 - 20d45a6a7633e921ed2ceed9ee482e0e5c6f8600 - 22AB21142531D2CDD - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZXtKpZNbG3Tv94hUzgm
13zb1hQbZCPBSKqh1W5H1nJcR6XrCr1PQG - 56712421402939884764 - 20d45a6a7633f2d9c5af02e0d3207f4517adb0d3 - 3130AFECA6A7E04DC - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZsEnHg7Wx9pfhx8uQVd
13zb1hQbZDED5RSGFTEwceLsPcSV1gmknC - 55623916971135547896 - 20d45a6a7634073b22575e019fa15535dab17c6f - 303EFD9C6F05B39F8 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZqyofEjKVs6ATaF6QyN
13zb1hQbZHz22BoPi6WomdnDqv9S7W4eWb - 60830966206306538975 - 20d45a6a763479e17eb2e70f300082c6475e311a - 34C330177E6B155DF - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZwzuAn3JWb9UvvLd4L9
13zb1hQbZKJphfDfXNinY3a7c7jgBn9qEL - 71760461253069144487 - 20d45a6a763499ceb603a9bad2f958d507b154ce - 3E3E05F4E735E81A7 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qaAdeJD7EiUs1W6aN9nd
13zb1hQbZKwipzYgbZxf6ojD6489Uvp7ND - 63135733581907222313 - 20d45a6a7634a9254db8f6b39c5633484ca42596 - 36C2F2F2F6F47DF29 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZzfRDGXP36kfd7MTgPh
13zb1hQbZNiYCx1iLvGmqNeFZUy8UF2KFQ - 59109423803581444657 - 20d45a6a7634ebfeb13fc7d054c498aa948ebe77 - 3344EDBC6327DB231 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZv1Uz6yGEnbCr65UUBY
13zb1hQbZPWNeHTyw3AaG5ryiKYjPxyAdg - 46316994679194156202 - 20d45a6a7634ff0c40fff2287dfc6fe357ee6c23 - 282C7054345067CAA - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZfDqsfn6q9nRGAkb1Cg
13zb1hQbZPwbRxZQjysh6kw1GdMP7mgY6s - 51484651588548046457 - 20d45a6a7635098819aa599e708e55167515208b - 2CA7E39D7A8282E79 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZmCJCz3nuzxYW3ZoQLG
13zb1hQbZQxB2Uo9vStqyySebae1nWznZ4 - 62707459898691393621 - 20d45a6a763521e1d4c37892ef85cd8e24cd03e9 - 3663DA68A1C8D9855 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZzAhsuRrGmyN336Qre4
13zb1hQbZYKCT3ZseAEzMeknCrxHdRGN4B - 56318207850861952808 - 20d45a6a7635d363cf974abfabb40a0ad0c393a2 - 30D9277A7593DFF28 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZrnMPxRkBxgdj5rWYep
13zb1hQbZgqJpWZEKh5rKodYgG4tEAuiUm - 42146233785976033142 - 20d45a6a7636a0c8b26b880bdaa3be75271e4ce3 - 248E58053F9AB0F76 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZaQDxB6hqYfP92bj98w
13zb1hQbZhH3MqugYnYJHrJSuvxMhDPzq4 - 39901960523427979431 - 20d45a6a7636ab7b21d1a57d594103ddf086dcbc - 229C03DAFB895A0A7 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZXom92w4keNmMX7aden
13zb1hQbZkEAMBdGCHzhsoYyVpQc9idTVx - 37928688135156917422 - 20d45a6a7636f29cfc16e30973ae5ea6b4793a8c - 20E5DC4E77499E4AE - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZVXU7E6qRdnfVsuDjvn
13zb1hQbZnEmeMRKk4dWoRvS3c3UjhupHM - 67915966895582247278 - 20d45a6a76372315eda44276e018e77c32962769 - 3AE85FC0EAC5E796E - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qa6Bu4DVuoZbytWGnmRs
13zb1hQbZtXa2N9tZDWWnrwv1ecyyaPViW - 37818162477213485699 - 20d45a6a7637baba38d216d75440a4158a510661 - 20CD51A6760510A83 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZVQ4LAjTkUfwa8ZLyWE
13zb1hQbZu5DpBkwxV8xVMQKiu172ZnXZD - 37332141779891591579 - 20d45a6a7637c7e26f1679739d23c9f59f2032ed - 20616692796F5199B - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZUqUT1hobdzF69RsaFZ
13zb1hQbZv8cU8RZ7Jsih7jywZFmUjDfhg - 59503748966032306180 - 20d45a6a7637e167564113280fd1d1f5b06301b9 - 339C7C86B945F7004 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZvTvJzccvf78k8Cbxuf
13zb1hQbZvApRnT7VfASyyaitsiS6hQ8mS - 70197752828550488997 - 20d45a6a7637e2521c4a4b53dcc785bb5a04f359 - 3CE308446206CA3A5 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qa8psjfDazNuCghxVMxQ
13zb1hQbZwHvxzBBNejGtsAn9EP3GcdnzY - 63014719132667385149 - 20d45a6a7637fd631b1858820308c1843888f919 - 36A81412F53A6953D - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZzXJeesJ2Xi4hsvVqYi
13zb1hQbZwaBjkgF2pDKL8cj6vGGoYQ3kM - 69858139391242271699 - 20d45a6a76380424dac4e91b8e5082e06819a046 - 3C979F7A6ECB7FBD3 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qa8S7A1MPgs9JKEgSQJt
13zb1hQbZx5pDaycRAJKCewQwoapXYhqhS - 59939320530308382581 - 20d45a6a76381075d4feb1f6b7760f99bf6da2d5 - 33FD33E733F4F3F75 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZvy82GBicciCVBUWQzy
13zb1hQbZxJoWv4Tg5BEp2Wh6jrHJ3izUQ - 38151524982449520153 - 20d45a6a763815dbf2060244293d14de1cb66192 - 2117571D60A583E19 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZVnQc36yxjhrUDV2PAf
13zb1hQbZzQTg82osBGLewsYb577Hk4MWk - 71636956086031639744 - 20d45a6a7638486e37de7cbf87b2aca95faeb7d4 - 3E2299802EA2C64C0 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qaAVN3rkT1YBYJ9nq29X
13zb1hQba3haK5kdfNjuep2K8vggsX881g - 71692370163003147489 - 20d45a6a763897dfbbdbc937335fcc3e6513d945 - 3E2EE76D21F9DC4E1 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qaAZ5XVtMsEJekK415ia
13zb1hQba4sqbb6QZwYQx5DNVm9UVNFjEe - 69023330083310371733 - 20d45a6a7638b44005ec24ed38bcb2655c0166af - 3BDE421026E3F8395 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qa7U91uQci5qGdZTdp5G
13zb1hQba6j84GRShkeWwU1utueP1Y1nvj - 71238881664467444713 - 20d45a6a7638e0d8ab3a8cf0e7738513deca18c8 - 3DCA3596F1EABA3E9 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qaA2g9PcgZ4vPLqVoCAf
13zb1hQba6yjaeZR74QhL5UWuVTmBBLmVk - 43560962407148933968 - 20d45a6a7638e6eba955cc0fb83a1607331539ba - 25C87A0837041D350 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZc356ZdF921RRbwTwkG
13zb1hQbaMSop4NgeJ6svfvsURwjWvRvmi - 50873275498753923907 - 20d45a6a763a43b5ee0d67822081babbea68342f - 2C2022E8727CF9B43 - KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZkVJtC9HWnC9WwrzJmA
the problem about trying to find a collision is very difficult...
I haven't seen anyone with the first 10 characters of puzzle 66 wallet address "13zb1hQbWV" maybe within this range, the first 10 character might be the solution to the puzzle itself
I have waited over 10 days straight on a 4090 going at 5 billion per second looking for the first 10 character "13zb1hQbWV" but all I always get is very close so the actual range has nothing to do with the characters of the wallet address or the characters of the rmd160 has there is not a single relationship between these
I even went as far as getting the closest difference between each rmd160 first 10 characters I got and I wote this code
Code:
import subprocess
import time
import random
import string
import signal
import sys
import os
import logging
import multiprocessing
# Define a function to save the current state (current_key) to a checkpoint file
def save_checkpoint(current_key, checkpoint_filename):
with open(checkpoint_filename, 'w') as checkpoint_file:
checkpoint_file.write(current_key)
# Define a function to load the current state (current_key) from a checkpoint file
def load_checkpoint(checkpoint_filename):
if os.path.exists(checkpoint_filename):
with open(checkpoint_filename, 'r') as checkpoint_file:
return checkpoint_file.read()
else:
return None
def generate_next_key(current_key):
# Convert the current_key to an integer, add 2385407605810, and convert back to hexadecimal
next_key = hex(int(current_key, 16) + 2385407605810)[2:].zfill(18)
return next_key
def key_search_worker(start_key, end_key):
try:
command = f"KeyHunt-Cuda.exe -g --gpux 2048,512 -m address --coin BTC --range {start_key}:{end_key} 13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so"
subprocess.run(command, shell=True, check=True)
except subprocess.CalledProcessError as e:
logging.error(f"Error in subprocess: {e}")
def main():
checkpoint_filename = "checkpoint.txt" # Specify the checkpoint filename
num_processes = 4 # Adjust as needed
# Load the last saved checkpoint (if any)
current_key = load_checkpoint(checkpoint_filename)
if current_key is None:
current_key = "2058E1E06903F1DCC" # Specify your desired starting key here
try:
while True:
processes = []
for _ in range(num_processes):
# Generate the next key and update current_key
next_key = generate_next_key(current_key)
# Split the key range for each process
start_key = current_key
end_key = next_key
# Save the current state (current_key) to the checkpoint file at regular intervals
if _ % 10 == 0:
save_checkpoint(current_key, checkpoint_filename)
# Create a process to search for keys in the specified range
process = multiprocessing.Process(target=key_search_worker, args=(start_key, end_key))
processes.append(process)
process.start()
# Update current_key
current_key = next_key
# Wait for all processes to complete
for process in processes:
process.join()
except KeyboardInterrupt:
for process in processes:
process.terminate()
process.join()
print("Script terminated by user.")
try:
input("Press Ctrl+C again to exit the script.")
except KeyboardInterrupt:
print("Exiting script.")
sys.exit(0)
if __name__ == "__main__":
logging.basicConfig(filename="key_search.log", level=logging.ERROR)
main()
import time
import random
import string
import signal
import sys
import os
import logging
import multiprocessing
# Define a function to save the current state (current_key) to a checkpoint file
def save_checkpoint(current_key, checkpoint_filename):
with open(checkpoint_filename, 'w') as checkpoint_file:
checkpoint_file.write(current_key)
# Define a function to load the current state (current_key) from a checkpoint file
def load_checkpoint(checkpoint_filename):
if os.path.exists(checkpoint_filename):
with open(checkpoint_filename, 'r') as checkpoint_file:
return checkpoint_file.read()
else:
return None
def generate_next_key(current_key):
# Convert the current_key to an integer, add 2385407605810, and convert back to hexadecimal
next_key = hex(int(current_key, 16) + 2385407605810)[2:].zfill(18)
return next_key
def key_search_worker(start_key, end_key):
try:
command = f"KeyHunt-Cuda.exe -g --gpux 2048,512 -m address --coin BTC --range {start_key}:{end_key} 13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so"
subprocess.run(command, shell=True, check=True)
except subprocess.CalledProcessError as e:
logging.error(f"Error in subprocess: {e}")
def main():
checkpoint_filename = "checkpoint.txt" # Specify the checkpoint filename
num_processes = 4 # Adjust as needed
# Load the last saved checkpoint (if any)
current_key = load_checkpoint(checkpoint_filename)
if current_key is None:
current_key = "2058E1E06903F1DCC" # Specify your desired starting key here
try:
while True:
processes = []
for _ in range(num_processes):
# Generate the next key and update current_key
next_key = generate_next_key(current_key)
# Split the key range for each process
start_key = current_key
end_key = next_key
# Save the current state (current_key) to the checkpoint file at regular intervals
if _ % 10 == 0:
save_checkpoint(current_key, checkpoint_filename)
# Create a process to search for keys in the specified range
process = multiprocessing.Process(target=key_search_worker, args=(start_key, end_key))
processes.append(process)
process.start()
# Update current_key
current_key = next_key
# Wait for all processes to complete
for process in processes:
process.join()
except KeyboardInterrupt:
for process in processes:
process.terminate()
process.join()
print("Script terminated by user.")
try:
input("Press Ctrl+C again to exit the script.")
except KeyboardInterrupt:
print("Exiting script.")
sys.exit(0)
if __name__ == "__main__":
logging.basicConfig(filename="key_search.log", level=logging.ERROR)
main()
it adds the difference to the current key to get the next key and it scans it for the specified time before terminating the code and adding the difference again to the current key but no luck still
so its obvious the private key to puzzle 66 has nothing to do with the distance between the characters of the rmd160 or wallet addresses. it is what it is
[/quote]
PubAddress: 13Zb1HQBWVs2Z7cwTTHnbt4UC8XmZRuoUP
Priv (WIF): p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZuf9gNnoF21yZ7vdxpo
Priv (HEX): 3301962848B29DB4D (66 bit)
PubAddress: 13Zb1HQbwvsF9H25ugdHKQK2N6NWsv3LJM
Priv (WIF): p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZqnubqDyHhuPVYg8B6H
Priv (HEX): 301AE5EA38918C8B3 (66 bit)
PubAddress: 13ZB1hqBWvsLGFeQMpAeg9Q3rzM9ok8MGx
Priv (WIF): p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZum5gwhZVimMiSoVxii
Priv (HEX): 33153B08EFB8FE1D0 (66 bit)
PubAddress: 13zb1HqbWvSBE8YL37m85gYB8JXduPzP9Y
Priv (WIF): p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZv2BKmQjbBkqFByafaA
Priv (HEX): 33473B6DA48F1CC64 (66 bit)
PubAddress: 13Zb1HqbWVsRj3qjfV4azxNegobGLE2Wm8
Priv (WIF): p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qa11qRkheWzW1nYQiXmZ
Priv (HEX): 3706924C7265FF02E (66 bit)
Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
I wrote a python program that adds share function to vbcr,exe and will post it shortly to my github page https://github.com/unclevito2017?tab=repositories
C:\kangaroo\share>python3 share1.py
Enter the starting keyspace value (hex): 33000000000000000
Enter the ending keyspace value (hex): 33100000000000000
Enter the number of shares: 1024
Share 1/1024
Keyspace Range: 33000000000000000 - 330003fffffffffff
VBCr v2.00
Search For: 13zb1hQb [Compressed, Case unsensitive] (Lookup size 4)
Started on: Fri Jul 28 21:06:31 2023
Randomness: New Random Keys Every 30000 Mkeys
Beg Range: 33000000000000000 (66 bit)
End Range: 330003FFFFFFFFFFF (66 bit)
Rng Width: 3FFFFFFFFFFF (46 bit)
CPU Threads: 0
GPU: GPU #0 NVIDIA GeForce RTX 3060 Ti (38x128 cores) Grid(304x128)
Random Key : 3300032C36B217731
Random Key : 33000347613DDB4F2
Random Key : 330001B89CA67D802
Random Key : 330002B31BA29A92F
Random Key : 33000359FB992E95B
Random Key : 330003AC4355F9151
Random Key : 330001A1623BB9310
Random Key : 330002DFA30A6BEEF
Random Key : 3300031D89DB5B65E
[00:00:00:26 Run Time][Total 823.43 MK/s][GPU 823.43 MK/s][Keys 21,118,320,640][Found 0][Rekeys: 0]
PubAddress: 13ZB1HQbi393D7RzEstpR2FcSkqTu6xAQX
Priv (WIF): p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZueg2bGwe7R49cgKvbp
Priv (HEX): 330001EFD51513C96 (66 bit)
[00:00:00:40 Run Time][Total 746.89 MK/s][GPU 746.89 MK/s][Keys 31,597,789,184][Found 1][Rekeys: 0]
Random Key : 33000175F29D8DA0A
Random Key : 3300038D69AB9CBB2
Random Key : 33000319D1C1763AF
Random Key : 330000D16037E4A72
[00:00:01:05 Run Time][Total 753.69 MK/s][GPU 753.69 MK/s][Keys 48,651,829,248][Found 1][Rekeys: 1] ^CShare 2/1024
Keyspace Range: 33000400000000000 - 330007fffffffffff
VBCr v2.00
Search For: 13zb1hQb [Compressed, Case unsensitive] (Lookup size 4)
Started on: Fri Jul 28 21:07:46 2023
Randomness: New Random Keys Every 30000 Mkeys
Beg Range: 33000400000000000 (66 bit)
End Range: 330007FFFFFFFFFFF (66 bit)
Rng Width: 3FFFFFFFFFFF (46 bit)
CPU Threads: 0
GPU: GPU #0 NVIDIA GeForce RTX 3060 Ti (38x128 cores) Grid(304x128)
Random Key : 330005116B52D6FB2
Random Key : 330007D2AB034580A
Random Key : 33000797F1E23CD20
Random Key : 330004B3F6327ED73
Random Key : 330004A99F2B2AEDB
Random Key : 330004490BF7A7A33
Random Key : 330004AFFD1F365C2
Random Key : 3300053A68CE721E3
Random Key : 330007F91D2151A7A
[00:00:00:42 Run Time][Total 775.76 MK/s][GPU 775.76 MK/s][Keys 31,597,789,184][Found 0][Rekeys: 0]
Random Key : 33000772999086FE5
Random Key : 33000761AAC8DD6B0
Random Key : 3300045BB62503EC8
Random Key : 330005F6ADB1C7031
[00:00:01:06 Run Time][Total 686.25 MK/s][GPU 686.25 MK/s][Keys 48,014,295,040][Found 0][Rekeys: 1] ^CShare 3/1024
Keyspace Range: 33000800000000000 - 33000bfffffffffff
VBCr v2.00
Search For: 13zb1hQb [Compressed, Case unsensitive] (Lookup size 4)
Started on: Fri Jul 28 21:09:02 2023
Randomness: New Random Keys Every 30000 Mkeys
Beg Range: 33000800000000000 (66 bit)
End Range: 33000BFFFFFFFFFFF (66 bit)
Rng Width: 3FFFFFFFFFFF (46 bit)
CPU Threads: 0
GPU: GPU #0 NVIDIA GeForce RTX 3060 Ti (38x128 cores) Grid(304x128)
Random Key : 33000A1AC4E60AE41
Random Key : 330008841D93D03CF
Random Key : 33000B14A57F43F7F
Random Key : 33000A1B9C6862643
Random Key : 33000AD3B230C7959
Random Key : 33000A7B9DEFB6727
Random Key : 33000AC5FDE959C8A
Random Key : 330008E1BE64D7094
Random Key : 33000ADA709B5F599
[00:00:00:02 Run Time][Total 868.00 MK/s][GPU 868.00 MK/s][Keys 1,753,219,072][Found 0][Rekeys: 0]
C:\kangaroo\share>python3 share1.py
Enter the starting keyspace value (hex): 33000000000000000
Enter the ending keyspace value (hex): 33100000000000000
Enter the number of shares: 1024
Share 1/1024
Keyspace Range: 33000000000000000 - 330003fffffffffff
VBCr v2.00
Search For: 13zb1hQb [Compressed, Case unsensitive] (Lookup size 4)
Started on: Fri Jul 28 21:06:31 2023
Randomness: New Random Keys Every 30000 Mkeys
Beg Range: 33000000000000000 (66 bit)
End Range: 330003FFFFFFFFFFF (66 bit)
Rng Width: 3FFFFFFFFFFF (46 bit)
CPU Threads: 0
GPU: GPU #0 NVIDIA GeForce RTX 3060 Ti (38x128 cores) Grid(304x128)
Random Key : 3300032C36B217731
Random Key : 33000347613DDB4F2
Random Key : 330001B89CA67D802
Random Key : 330002B31BA29A92F
Random Key : 33000359FB992E95B
Random Key : 330003AC4355F9151
Random Key : 330001A1623BB9310
Random Key : 330002DFA30A6BEEF
Random Key : 3300031D89DB5B65E
[00:00:00:26 Run Time][Total 823.43 MK/s][GPU 823.43 MK/s][Keys 21,118,320,640][Found 0][Rekeys: 0]
PubAddress: 13ZB1HQbi393D7RzEstpR2FcSkqTu6xAQX
Priv (WIF): p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZueg2bGwe7R49cgKvbp
Priv (HEX): 330001EFD51513C96 (66 bit)
[00:00:00:40 Run Time][Total 746.89 MK/s][GPU 746.89 MK/s][Keys 31,597,789,184][Found 1][Rekeys: 0]
Random Key : 33000175F29D8DA0A
Random Key : 3300038D69AB9CBB2
Random Key : 33000319D1C1763AF
Random Key : 330000D16037E4A72
[00:00:01:05 Run Time][Total 753.69 MK/s][GPU 753.69 MK/s][Keys 48,651,829,248][Found 1][Rekeys: 1] ^CShare 2/1024
Keyspace Range: 33000400000000000 - 330007fffffffffff
VBCr v2.00
Search For: 13zb1hQb [Compressed, Case unsensitive] (Lookup size 4)
Started on: Fri Jul 28 21:07:46 2023
Randomness: New Random Keys Every 30000 Mkeys
Beg Range: 33000400000000000 (66 bit)
End Range: 330007FFFFFFFFFFF (66 bit)
Rng Width: 3FFFFFFFFFFF (46 bit)
CPU Threads: 0
GPU: GPU #0 NVIDIA GeForce RTX 3060 Ti (38x128 cores) Grid(304x128)
Random Key : 330005116B52D6FB2
Random Key : 330007D2AB034580A
Random Key : 33000797F1E23CD20
Random Key : 330004B3F6327ED73
Random Key : 330004A99F2B2AEDB
Random Key : 330004490BF7A7A33
Random Key : 330004AFFD1F365C2
Random Key : 3300053A68CE721E3
Random Key : 330007F91D2151A7A
[00:00:00:42 Run Time][Total 775.76 MK/s][GPU 775.76 MK/s][Keys 31,597,789,184][Found 0][Rekeys: 0]
Random Key : 33000772999086FE5
Random Key : 33000761AAC8DD6B0
Random Key : 3300045BB62503EC8
Random Key : 330005F6ADB1C7031
[00:00:01:06 Run Time][Total 686.25 MK/s][GPU 686.25 MK/s][Keys 48,014,295,040][Found 0][Rekeys: 1] ^CShare 3/1024
Keyspace Range: 33000800000000000 - 33000bfffffffffff
VBCr v2.00
Search For: 13zb1hQb [Compressed, Case unsensitive] (Lookup size 4)
Started on: Fri Jul 28 21:09:02 2023
Randomness: New Random Keys Every 30000 Mkeys
Beg Range: 33000800000000000 (66 bit)
End Range: 33000BFFFFFFFFFFF (66 bit)
Rng Width: 3FFFFFFFFFFF (46 bit)
CPU Threads: 0
GPU: GPU #0 NVIDIA GeForce RTX 3060 Ti (38x128 cores) Grid(304x128)
Random Key : 33000A1AC4E60AE41
Random Key : 330008841D93D03CF
Random Key : 33000B14A57F43F7F
Random Key : 33000A1B9C6862643
Random Key : 33000AD3B230C7959
Random Key : 33000A7B9DEFB6727
Random Key : 33000AC5FDE959C8A
Random Key : 330008E1BE64D7094
Random Key : 33000ADA709B5F599
[00:00:00:02 Run Time][Total 868.00 MK/s][GPU 868.00 MK/s][Keys 1,753,219,072][Found 0][Rekeys: 0]
Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
This is my last reply regarding useless speed comparisions:
you simply have to compare the speed of my tool with your prefered tool on your own!!!
MY TOOL IS FOR CPU *NOT* FOR GPU - GPUs ARE FASTER - I KNOW IT - EVERYBODY KNOWS IT!
i just gave you a number for my very slow CPU and only on one core and this is a mobile CPU! This does not say anything about keyrates on your CPU!
if your prefered tool is faster, then use it and be happy with it! On my CPU my tool is faster - is this so hard to understand?
i run competiton tests between my tool and other CPU tools and my tool always found the key faster, so i guess my search logic works somehow better than a simple random search, but you cannot exspect miracles like a 10x speed improvement.
I downloaded them this morning and ran them through the online scanner and they were all clean. Ran the generic on wsl and it worked 1 thread as about 2 m/secomnd it seems to make a file that is eeither a checkpoint or remembers the addresses tried or both. works well but since I paid for a rtx GPU and made a control program so it runs unattended I am going to use that but for CPU users it should be greatyou simply have to compare the speed of my tool with your prefered tool on your own!!!
MY TOOL IS FOR CPU *NOT* FOR GPU - GPUs ARE FASTER - I KNOW IT - EVERYBODY KNOWS IT!
i just gave you a number for my very slow CPU and only on one core and this is a mobile CPU! This does not say anything about keyrates on your CPU!
if your prefered tool is faster, then use it and be happy with it! On my CPU my tool is faster - is this so hard to understand?
Quote
you are talking about an increased chance of searching - how is this statement justified?
only through tests...i run competiton tests between my tool and other CPU tools and my tool always found the key faster, so i guess my search logic works somehow better than a simple random search, but you cannot exspect miracles like a 10x speed improvement.