Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
Hello everyone. I have published my optimized versions of VanitySearch (CUDA) with speed boost in case anyone is interested 
The "bitcrack" version is specific to the puzzle and allows searching for addresses and prefixes (compressed) within a given range. The speed is about 6900 MKey/s on a 4090 and 8800 MKey/s on 5090.
The second version, on the other hand, performs a standard search for vanity addresses (not just P2PKH compressed) but with the same optimizations in terms of math and CUDA code. Random searches with endomorphisms.
https://github.com/FixedPaul/VanitySearch-Bitcrack
https://github.com/FixedPaul/VanitySearch
The "bitcrack" version is specific to the puzzle and allows searching for addresses and prefixes (compressed) within a given range. The speed is about 6900 MKey/s on a 4090 and 8800 MKey/s on 5090.
The second version, on the other hand, performs a standard search for vanity addresses (not just P2PKH compressed) but with the same optimizations in terms of math and CUDA code. Random searches with endomorphisms.
https://github.com/FixedPaul/VanitySearch-Bitcrack
https://github.com/FixedPaul/VanitySearch
Thanks!
why not multi-gpu?
The "standard" version allows mukti GPUs
The "bitcrack" version does not. since the range size is a power of 2 the number of GPUs must be as well in order not to have overlapping keys. It would also be slightly slower because the threads of one GPU have to wait for the threads of the other to finish, which is a problem if the 2 GPUs do not have the same speed.
It was a choice to keep things simpler and a little more efficient