3 ms·
My understanding is that in the general case you can see a quadratic speedup, so a 256-bit search space would suddenly collapse to what is effectively a 128-bit
by thaumasiotes 5y ago
My understanding is that in the general case you can see a quadratic speedup, so a 256-bit search space would suddenly collapse to what is effectively a 128-bit search space.
Not a big deal by itself.
- tromp 5y agoBitcoin's hashcash PoW is not a 256-bit search problem though. At current difficulty levels, it's closer to an 86-bit problem, so Grover's algorithm reduces that to the equivalent of a 43 bit search space.