Crypto researchers halve projected quantum threat to Bitcoin and Ethereum

In a recent development that could reshape the security outlook for major blockchain networks, a group of cryptography researchers has published a paper indicating that the anticipated quantum computing threat to Bitcoin and Ethereum may be significantly lower than previously projected. The study, which was shared with CoinDesk, reveals that a combination of human ingenuity and artificial intelligence agents succeeded in surpassing the performance of Google's March‑2024 benchmark on a critical sub‑routine used in Shor’s algorithm, the quantum algorithm famed for its ability to factor large integers and compute discrete logarithms efficiently.

This breakthrough effectively reduces the estimated time frame for a quantum computer capable of compromising the cryptographic foundations of Bitcoin and Ethereum by roughly half. ### Background: Quantum Computing and Blockchain Security Bitcoin and Ethereum, like most cryptocurrencies, rely on elliptic‑curve cryptography (ECC) to secure transaction signatures and wallet addresses. The security of ECC hinges on the difficulty of solving the discrete logarithm problem (DLP) on elliptic curves, a task that is computationally infeasible for classical computers. However, in 1994 Peter Shor introduced an algorithm that, given a sufficiently powerful quantum computer, could solve both integer factorization and the DLP in polynomial time, effectively rendering ECC vulnerable.

The practical concern has been not the existence of Shor’s algorithm itself, but the ability of quantum hardware to execute the algorithm on numbers of the size used in modern cryptocurrencies. To break Bitcoin’s secp256k1 curve, a quantum computer would need to run a version of Shor’s algorithm that can handle a 256‑bit key, which translates to a requirement of millions of logical qubits after error correction.

Estimates over the past few years have placed the timeline for achieving such a capability anywhere from a decade to several decades, depending on the rate of progress in qubit fidelity, error‑correction techniques, and overall system scaling. ### The Core Calculation: Modular Exponentiation At the heart of Shor’s algorithm lies a sub‑routine known as modular exponentiation, which must be performed repeatedly and with extremely high precision. The efficiency of this step directly influences the overall depth and qubit count needed for the full algorithm. In March 2024, a team at Google announced a record‑setting implementation of this sub‑routine on their Sycamore processor, achieving a depth that set a new benchmark for what could be accomplished on near‑term quantum hardware.

The result was widely interpreted as a milestone that nudged the quantum‑break timeline forward. ### New Findings: Humans and AI Beat Google’s Result The paper in question challenges that narrative. Researchers from several institutions, including a collaboration between a leading university cryptography lab and an AI research group, set out to explore whether the modular exponentiation step could be optimized beyond the state‑of‑the‑art implementations.

They employed a two‑pronged approach: 1. **Human‑Driven Optimization**: Expert quantum algorithm designers manually re‑examined the circuit layout, gate synthesis, and qubit routing strategies used in Google’s implementation.

By exploiting symmetries in the arithmetic operations and applying novel gate‑cancellation techniques, they managed to shave a substantial amount of circuit depth. 2. **AI‑Assisted Search**: Concurrently, they trained reinforcement‑learning agents to explore the vast space of possible circuit configurations.

The AI agents were tasked with minimizing a cost function that balanced circuit depth, gate count, and error propagation. Over thousands of simulated runs, the agents discovered unconventional gate sequences that a human designer might overlook.

When the optimized human‑crafted circuit and the AI‑generated circuits were combined, the resulting modular exponentiation routine outperformed Google’s March benchmark by approximately 45 % in terms of depth, while also reducing the total number of two‑qubit gates by a similar margin. Importantly, these improvements were achieved without requiring any additional physical qubits, meaning the same hardware could execute the more efficient algorithm. ### Implications for the Quantum Threat Timeline The significance of this achievement lies in its direct impact on the resource estimates for a quantum attack on ECC.

The original models that projected a 10‑year horizon for a Bitcoin‑breaking quantum computer assumed the modular exponentiation depth reported by Google as a lower bound. By demonstrating that the depth can be reduced by nearly half, the new research effectively halves the number of logical qubits and the overall error‑correction overhead required for Shor’s algorithm to succeed. In practical terms, the revised calculations suggest that a quantum computer capable of breaking Bitcoin’s secp256k1 curve could be built with roughly 1.5 million logical qubits instead of the previously estimated 3 million.

This reduction translates to a shift in the earliest plausible attack window from around 2035 to somewhere in the early 2040s, assuming current rates of hardware improvement continue. ### Broader Context and Future Directions While the headline‑grabbing aspect of the paper is the halving of the quantum attack estimate, the broader message is one of caution and adaptation.

The crypto community has already begun to explore post‑quantum alternatives, such as lattice‑based signatures (e.g., Dilithium) and hash‑based schemes (e.g., XMSS). The new findings reinforce the urgency of these migration efforts but also provide a slightly larger safety margin than previously thought.

Moreover, the methodology employed—leveraging both human expertise and AI‑driven circuit synthesis—opens a new research frontier. It demonstrates that the race to quantum‑resistant cryptography is not solely a hardware battle; software‑level optimizations can dramatically alter the playing field. Future work may focus on applying similar techniques to other components of Shor’s algorithm, such as quantum Fourier transforms, or to entirely different quantum algorithms that could threaten cryptographic primitives. ### What Should Stakeholders Do?

1. **Developers and Protocol Designers**: Continue integrating post‑quantum cryptographic primitives into upcoming protocol upgrades. The reduced urgency does not eliminate the need for transition plans.

2. **Investors and Exchanges**: Monitor the progress of both quantum hardware and algorithmic optimizations. While the immediate risk remains low, a rapid breakthrough could compress the timeline again.

3. **Researchers**: Explore hybrid optimization strategies that combine domain‑specific knowledge with machine‑learning‑based search, as this paper illustrates their synergistic potential. 4. **Regulators**: Encourage standards bodies to adopt flexible frameworks that can accommodate swift cryptographic migrations, ensuring that the financial system remains resilient.

### Conclusion The paper shared with CoinDesk provides a nuanced update to the quantum‑computing threat landscape for Bitcoin and Ethereum. By showing that both human ingenuity and AI can outperform a leading industry benchmark on a core component of Shor’s algorithm, the researchers have effectively reduced the estimated timeline for a quantum attack by about 50 %. This development grants the cryptocurrency ecosystem a modestly larger window to prepare for a post‑quantum world, but it also underscores the importance of continued vigilance, research, and proactive migration to quantum‑resistant cryptographic schemes. The interplay between hardware advancements and algorithmic optimizations will remain a critical factor in determining when, and if, quantum computers become a practical threat to blockchain security.