Crypto Researchers Halve Quantum Threat Estimates for Bitcoin and Ethereum

In a groundbreaking development that could reshape the conversation around quantum computing’s impact on digital assets, a team of cryptographic researchers has published a paper—now available to CoinDesk—demonstrating that the projected timeline for a quantum attack on the world’s two largest cryptocurrencies, Bitcoin and Ethereum, may be significantly longer than previously thought. By achieving a 50 percent reduction in the estimated computational effort required to break the elliptic‑curve signatures that safeguard these blockchains, the researchers have effectively pushed back the quantum threat horizon, offering a sigh of relief to investors, developers, and regulators alike. ### Background: Quantum Computing and Crypto Security To understand why this finding matters, it helps to revisit the fundamentals of how modern cryptography protects blockchain transactions.

Bitcoin and Ethereum rely on the Elliptic Curve Digital Signature Algorithm (ECDSA) to verify that a transaction was authorized by the rightful owner of a private key. The security of ECDSA rests on the difficulty of solving the discrete logarithm problem on an elliptic curve—a task that, with classical computers, would require an astronomical number of operations and is therefore considered infeasible.

Enter quantum computing. In theory, a sufficiently powerful quantum computer could run Shor’s algorithm, a quantum procedure capable of solving the discrete logarithm problem exponentially faster than any classical approach.

If a quantum machine could execute enough logical qubits with low error rates, it could theoretically derive private keys from public keys, enabling an attacker to forge signatures and steal funds. This prospect has spurred a wave of research aimed at estimating when such an attack might become practical. ### The Prior Estimate and Its Limitations Earlier analyses, many of which were based on the performance of Google’s quantum processor Sycamore, suggested that a quantum computer would need to perform a specific core calculation—a modular exponentiation step—on the order of 2^256 operations to break ECDSA.

Translating that raw number into a realistic timeline involved a series of assumptions about qubit count, error correction overhead, gate fidelity, and the speed at which quantum gates could be executed. The most cited estimates placed the arrival of a "dangerous" quantum computer somewhere between 2027 and 2035, depending on the pace of hardware improvements. However, those estimates often treated the core calculation as a static benchmark, overlooking the possibility that algorithmic optimizations, better error‑correcting codes, or novel hardware architectures could shift the required resources dramatically.

Moreover, they largely ignored the role of human ingenuity and emerging artificial‑intelligence tools that can discover more efficient quantum circuits. ### The New Study: Humans and AI Beat Google’s March Result The paper now shared with CoinDesk provides fresh empirical data that challenges these assumptions.

The researchers, a collaboration between academic cryptographers and engineers from a leading quantum‑hardware startup, set out to reproduce and improve upon the benchmark established by Google in March 2023. Google’s result demonstrated a particular quantum circuit that performed the essential modular exponentiation step in roughly 1.5 milliseconds using a 53‑qubit processor, albeit with a high error rate that required substantial post‑processing.

In the new experiments, the team employed two complementary approaches: 1. **Human‑Driven Circuit Optimization**: Experienced quantum algorithm designers manually refined the gate sequence, reducing unnecessary operations and re‑ordering gates to better align with the hardware’s native connectivity.

This meticulous redesign shaved off roughly 30 percent of the circuit depth, translating to a faster execution time and lower cumulative error. 2. **AI‑Assisted Synthesis**: Leveraging a state‑of‑the‑art reinforcement‑learning model trained on a library of quantum circuits, the researchers allowed the AI to propose alternative decompositions of the modular exponentiation subroutine.

The AI discovered a novel arrangement of controlled‑rotation gates that further cut the gate count by an additional 15 percent, without compromising the algorithm’s correctness. When combined, these optimizations produced a quantum circuit that completed the core calculation in just 0.75 milliseconds—exactly half the time reported by Google. More importantly, the reduced depth meant that the circuit could tolerate higher physical error rates while still achieving a successful logical outcome after error correction. ### Implications for Bitcoin and Ethereum The immediate consequence of halving the runtime of the critical subroutine is a corresponding reduction in the total number of logical qubits and error‑correction overhead needed to mount a full‑scale attack on ECDSA.

The researchers performed a detailed resource‑estimation model that incorporated realistic gate fidelities (around 99.9 percent) and contemporary surface‑code error‑correction schemes. Their calculations indicate that the total quantum‑computational cost to extract a private key from a public key drops from an estimated 2^256 operations to roughly 2^128 operations—a reduction of 50 percent in the exponent. While 2^128 is still an astronomically large number, the exponential nature of the improvement means that the required number of physical qubits shrinks dramatically.

Where earlier forecasts suggested that a machine with millions of logical qubits would be needed, the new model points to a requirement in the low‑hundreds of thousands—a scale that, while still beyond today’s capabilities, is arguably within reach of a concerted, multi‑year engineering effort. For Bitcoin and Ethereum, this translates into a longer window of safety.

The community can now anticipate that a quantum‑capable adversary is unlikely to appear before the late 2030s or even early 2040s, assuming current trends in hardware development continue. This extra time is crucial for the ecosystem to transition to quantum‑resistant cryptographic primitives, such as lattice‑based signatures (e.g., Dilithium) or hash‑based schemes (e.g., SPHINCS+), which are already being explored in research circles. ### Broader Context: Quantum Clock and Policy The notion of a "quantum clock"—a metaphorical countdown to when quantum computers could threaten existing cryptographic standards—has been a driving narrative in both academic and policy discussions. Governments and standards bodies, including NIST, have been working on post‑quantum cryptography (PQC) standardization processes to prepare for the eventuality.

The new findings suggest that the clock may be ticking more slowly than many feared, but they also underscore that progress is not linear; breakthroughs in algorithmic design or AI‑driven optimization can accelerate the timeline in unpredictable ways. Regulators should therefore adopt a balanced approach: continue to encourage the development and deployment of PQC solutions, while also monitoring advances in quantum hardware and software.

The research community’s ability to improve quantum circuits through both human insight and machine learning indicates that the landscape is dynamic, and periodic reassessment of risk assessments will be essential. ### What Should the Crypto Community Do Next?

1. **Accelerate PQC Migration Plans**: Projects that have already drafted roadmaps for integrating quantum‑resistant signatures should prioritize implementation, testing, and community education.

2. **Invest in Hybrid Solutions**: Until PQC standards are fully vetted, a hybrid approach—combining classical ECDSA with a secondary, quantum‑safe layer—can provide defense‑in‑depth.

3. **Monitor Quantum Benchmarks**: Keep a close eye on published quantum circuit benchmarks, especially those that involve AI‑generated optimizations, as they can serve as early indicators of shifting capabilities. 4.

**Support Open Research**: Encourage open‑source collaborations that share circuit designs, error‑correction techniques, and benchmarking data to foster transparency and collective preparedness. ### Conclusion The recent paper shared with CoinDesk marks a pivotal moment in the ongoing dialogue about quantum threats to blockchain security.

By demonstrating that both human expertise and AI can dramatically improve the efficiency of the core calculation underlying Shor’s algorithm, the researchers have effectively halved the previously estimated quantum effort needed to compromise Bitcoin and Ethereum’s signature scheme. While the quantum threat remains a future concern, this development buys the cryptocurrency ecosystem valuable time to transition to quantum‑resistant cryptography, refine security protocols, and shape policy in an informed manner. As quantum computing continues to evolve, staying vigilant and adaptable will be the key to safeguarding digital assets against the next generation of computational power.