2024/03/12 by Bolton Bailey, Or Sattath, Bailey, Bolton +1
Materials Science · #Cryptography and Security (cs.CR) #Electronic and Structural Properties of Oxides #FOS: Computer and information sciences #FOS: Physical sciences #Quantum Physics (quant-ph)
paper · pdf · doi:10.48550/arxiv.2403.08023
openalex publication_date 2024/03/12 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We present a strategy for a single quantum miner with relatively low hashing power, with the same ramifications as a 51% attack. Bitcoin nodes consider the chain with the highest cumulative proof-of-work to be the valid chain. A quantum miner can manipulate the block timestamps to multiply the difficulty by c. The fork-choice rule counts every block with increased difficulty with weight c. By using Grover's algorithm, it is only O(√ c) harder for the quantum miner to mine such blocks. By picking a high enough c, the single quantum miner can create a competing chain with fewer blocks, but more cumulative proof-of-work. The time required is O((1)/(r2)) epochs, where r is the fraction of the block rewards that the quantum miner would have received if they mined honestly. Most proof-of-work cryptocurrencies, including Bitcoin, are vulnerable to our attack. However, it will likely be impossible to execute in forthcoming years, as it requires an extremely fast and fault-tolerant quantum computer.