Has anyone tried this approach? The count of powers of 2 as sum?
If you can see the count of the powers of 2 are increasing.
I wrote a small script to try this but if someone can make multy gpu Windows/Linux program with that approach to try it.
in the script 2^65 is always present and random randint to try combinations of powers of 2 from 28 to 36 (27,35 in the script) counts in random for the puzzle #66.
I think it is basically the same but consuming more resources, if I wanted to try my luck I would do something like this in C, it is more likely that the pub starts with "03". I would omit the ones that start with "02".
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()