Quote from: citb0in on Today at 09:05:28 AM

Quote from: mcdouglasx on November 24, 2023, 06:50:37 PM

Quote from: nomachine on November 22, 2023, 09:34:10 PM

Quote from: mcdouglasx on November 21, 2023, 04:58:29 PM

Code:

import secp256k1 as ice
import random

print("scaning pub 03...")

target = "13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so"

start= 50000000000000000000
end= 70000000000000000000
while True:

   A0 = random.randint(start, end)
   A1 = ice.scalar_multiplication(A0)
   B0 = ice.to_cpub(A1.hex())

   if B0.startswith("03"):
   A2 = ice.pubkey_to_address(0,1, A1)
   print(A2)
   if target in A2:
   print("venga rata")
   data = open("Win.txt","a")
   data.write(str(A0)+" = "+A2+"\n")
   data.close()

Same script, but with concurrent.futures.

Code:

import concurrent.futures
import sys
import os
import time
import secp256k1 as ice
import random
import multiprocessing

os.system("clear");t = time.ctime();sys.stdout.write(f"\033[?25l")
sys.stdout.write(f"\033[01;33m[+] {t}\n")

def generate_key():
start = 36893488147419103231
end = 73786976294838206463

A0 = random.randint(start, end)
A1 = ice.scalar_multiplication(A0)
B0 = ice.to_cpub(A1.hex())

if B0.startswith("03"):
A2 = ice.pubkey_to_address(0, 1, A1)
message = "[+] {}".format(A2);messages = [];messages.append(message);output = ''.join(messages) + "\r";sys.stdout.write(output);sys.stdout.flush()
return A0, A2
else:
return None, None

def main():
target = "13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so"

num_cores = multiprocessing.cpu_count()

with concurrent.futures.ProcessPoolExecutor(max_workers=num_cores) as executor:
while True:
futures = [executor.submit(generate_key) for _ in range(num_cores)]

for future in concurrent.futures.as_completed(futures):
A0, A2 = future.result()

if A2 and target in A2:
print("venga rata")
with open("Win.txt", "a") as data:
data.write(f"{A0} = {A2}\n")
break

if __name__ == "__main__":
main()

You can imagine how this works on a 128 Core machine Grin

I use Python for testing or when speed is not required, C is better when it comes to speed, I am currently working on a method that allows you to find a key in bit30 in less than 10 seconds, really this part is not the curious one, the curious thing My script has a speed of 2048keys/s, how does it manage to find a key in that range in such a short time with that speed? There is a mathematical trick involved in it, I'm starting to write it in C, to focus on the puzzle 130, once I finish it, if this does not pose a security risk for bitcoin I will make it free.

those scripts (both) don't work as expected on my side. I tested with puzzle 30, even with 15 which should be cracked in fractions of seconds.

Puzzle 15
address = 1QCbW9HWnwQWiQqVo5exhAnmfqKRrCRsvW
start = 16384
end = 32768

Puzzle 30
address = 1LHtnpd8nU5VHEMkG2TMYYNUjjLc992bps
start = 536870912
end = 1073741824

no hit at all

You have to change if B0.startswith("03"): to if B0.startswith("02"):
It might get better Wink