what is the order of magnitude in Address/s that can be achieved by commercial GPUs and an optimized code to solve the puzzles without knows public keys, for example puzzle 66.
The number of address/s should be near 10^15 (Peta-addresses/s) to 10^18 (Exa-addreses/s) to solve such puzzles in seconds. Remember each extra bit increment the difficult twice the previous value.
Whaaat
10^15 addresses/s with a GPU, is it with NVIDIA H100 ?I was proud of a GPU code that can do SHA256 alone at a rate of 10^10 hash/s, so I can't imagine adding full address calculations and at the same time reducing latency 10^5 times.
Hats off to those who solved previous puzzles, at this level it requires state funded resources.
can you send me a DM? can you share your code?