Another Brute Forcer for Puzzle #66 based on CUDA
MoonWalker is a software based on Bitcrack and VanitySearch, this tool is made to search by brute force bitcoin private keys using full CUDA calculation and search for hash160 sufix to speed up calculations.
I made it specifically to search bitcoin puzzle addresses.
This initial public version is limited from 1 to 63 bit range
test it with small ranges first ! may contain bugs !
https://github.com/ivansantosbom/MoonWalker
Benchmarks are welcome !
why is the source code closed?
because is not public.
actually I'm running it to find #66 but I will release a version to other people try their luck too soon
If the project is closed-source, why do you need to limit the range in bits? After all, #64 has already been found, so there is no point in trying to stop people from finding the key again.
Hopefully the 63 bits is not an architectural limitation like a similar one in brichard19's bitcrack (It supports only 32-bit mode, so finding keys has a significant performance penalty).
you're right, actually I'm using __int128_t this is enought to find all "possible" puzzles under #128 by brute force.
I limited the range just for benchmarks purpose and to show to the community that this tool is in average 5x faster than bitcrack / vanity search.
The actual version now is ported to linux to people test it on vast.ai or WSL etc.
I'm still thinking about release a version to people look for #66