I have designed my own version in Sagemath + Python for find public key when we only knows "hash160 ripemd".
this is another solution but is not fast. and even when you will find , you only find one of 2**96 possibilites
Well all I can see is just talking, if you have a tool efficient in finding collisions then share it so we can judge it's performance, though I wonder why would you increase your search range like that? You'd probably never find a collision but searching in 66 bit range you will definitely find the key.
ok.
brute forcing private keys of a btc ddress may take less than public keys but some codes need to work with pubkeys...
for example , keyhunt in bsgs mode, works faster than other tools in this case.
so this tool has an input file or single pubkey to work on it and find the privatekey .
Now for these puzzles (that have no output transactions) we have no pubkeys and we can not use bgsg mode of keyhunt.
is this correct ??
All the low range keys such as 65, 70, 75, 80, 85, 90 could be found fairly easily, e.g, if you had the public key for #66, it would take a minute considering you had a good gear using kangaroo, that's why they are all solved, now the biggest challenge next in line is #130, which will be solved probably in a few month from now.
Also note that when you are brute forcing to find rmd160, you are performing a sha256 + an rmd160 hashing with each iteration, so you'd get much less speed, but when you have a public key you can search much faster. But none of the existing tools are good enough, they are practically useless for high ranges.
Kangaroo and bsgs only work with public keys, both useless now.
Bitcrack vanitygen can search for address/rmd160, both useless now.
Don't waste time on addresses/rmd160, instead work on public key division.😉
hello Sir, I'm noob..just question how to find pub key? I just know to get that we must derivative from base58 => Ripe160 => sha256, I dont know if any method to find pubkey.. thank in advance