3 ms·
I thought so too, but SHA-256 should apparently be susceptible to Grover's algorithm, which would make mining O(sqrt(N)) instead of O(N). Of course, a practica
by davidgerard 10y ago
I thought so too, but SHA-256 should apparently be susceptible to Grover's algorithm, which would make mining O(sqrt(N)) instead of O(N).
Of course, a practical quantum computer would also likely break public key cryptography, so you could just take other people's coins instead of doing all that tedious hashing.