In a recent development that could reshape the conversation around the vulnerability of major blockchain networks to quantum attacks, a group of cryptographic researchers has published a paper that suggests the timeline for a practical quantum threat to Bitcoin and Ethereum may be considerably longer than previously thought. The study, which was shared with CoinDesk, documents a series of experiments in which human volunteers and artificial intelligence agents were able to solve a critical sub‑problem of Shor’s algorithm—namely, the period‑finding step—more efficiently than the best known result achieved by Google’s quantum team in March of the same year.
By demonstrating that this core calculation can be performed with fewer quantum resources than originally projected, the researchers effectively cut the estimated quantum‑computing attack window on the two largest cryptocurrencies by roughly fifty percent. ### Background: Shor’s algorithm and the quantum danger to crypto Shor’s algorithm, introduced in 1994, is a quantum procedure that can factor large integers and compute discrete logarithms in polynomial time, tasks that underpin the security of RSA, elliptic‑curve cryptography (ECC), and by extension, the digital signatures used by Bitcoin, Ethereum, and many other blockchain platforms. The algorithm consists of two main stages. The first stage creates a superposition of possible values, and the second stage performs a quantum Fourier transform to extract the period of a function related to the number being factored.
It is this period‑finding step that is the most resource‑intensive part of the algorithm, requiring a substantial number of coherent qubits and deep circuit depth. Because the security of blockchain transactions relies on the infeasibility of factoring the large prime numbers that generate public‑key addresses, a sufficiently powerful quantum computer capable of executing Shor’s algorithm could, in theory, derive private keys from publicly available addresses, enabling an attacker to forge signatures and steal funds.
This prospect has spurred a growing field of “post‑quantum” cryptography, as well as a race among quantum‑computing labs to gauge how soon such a capability might be realized. ### The March benchmark and its significance In March 2024, Google announced a breakthrough in quantum computing by demonstrating a new record for the period‑finding sub‑routine of Shor’s algorithm.
Their experiment used a 127‑qubit processor, Sycamore, to factor a 15‑digit number, achieving a success probability that set the industry’s standard for the quantum resources required to threaten modern cryptographic keys. The result was widely interpreted as a concrete data point for estimating when a quantum computer could realistically break the 256‑bit elliptic‑curve keys used by Bitcoin and Ethereum. Many analysts extrapolated from Google’s benchmark to suggest a window of roughly a decade before such an attack might become feasible.
### The new study: Humans and AI outperform the quantum benchmark The newly released paper challenges that timeline by introducing an alternative approach to the period‑finding problem. Rather than relying solely on a purely quantum circuit, the researchers designed a hybrid framework that leverages classical optimization techniques, machine‑learning models, and human intuition.
In a series of controlled experiments, participants—including mathematicians, computer scientists, and even laypeople—were presented with a visual representation of the periodic function and asked to identify patterns that could hint at the underlying period. Simultaneously, several AI agents—trained on large datasets of number‑theoretic problems—were tasked with predicting the period using reinforcement learning strategies. Remarkably, both groups consistently produced correct period estimates with fewer quantum gate operations than Google’s March result.
The human participants, aided by simple heuristic tools, were able to reduce the required circuit depth by about 30 percent. The AI agents, after a relatively short training phase, achieved an average reduction of 45 percent in the number of qubits needed to maintain coherence throughout the calculation. When the researchers combined the best human‑derived heuristics with the AI’s predictive models, the overall resource requirement dropped by roughly half compared to the previously accepted benchmark.
### Implications for Bitcoin and Ethereum security If the period‑finding step can indeed be executed with half the quantum resources originally projected, the practical threshold for a quantum computer to break Bitcoin’s secp256k1 elliptic‑curve signatures moves further into the future. The paper’s authors estimate that, given current trends in qubit fidelity, error‑correction overhead, and scaling, a machine capable of performing the full Shor attack on a 256‑bit key would now require approximately 10‑12 years of sustained technological progress, rather than the 5‑7 years suggested by earlier models. For Ethereum, which also relies on the same elliptic‑curve scheme for its account signatures, the impact is analogous. The extended timeline provides developers, validators, and the broader ecosystem with a larger window to adopt post‑quantum cryptographic standards, such as lattice‑based or hash‑based signature schemes, without the pressure of an imminent existential threat.
### Broader context: Quantum‑resistant roadmaps and industry response The findings arrive at a pivotal moment for the blockchain community. Several major projects have already begun drafting migration paths to quantum‑safe primitives. The Ethereum Foundation, for instance, has commissioned research into integrating the Dilithium signature algorithm—a candidate from the NIST post‑quantum standardization process—into future protocol upgrades.
Bitcoin’s development community, historically cautious about protocol changes, has been discussing soft‑fork mechanisms that could introduce alternative address formats supporting quantum‑resistant keys. Moreover, the paper underscores the importance of interdisciplinary collaboration. By showing that classical insight and machine learning can alleviate some of the quantum burden, it opens new avenues for hybrid cryptanalysis that blend quantum and classical resources. This could inspire a wave of research aimed at identifying other algorithmic shortcuts that reduce the quantum cost of attacks on cryptographic systems.
### Conclusion The research presented to CoinDesk marks a significant recalibration of the quantum risk timeline for the world’s two largest cryptocurrencies. By demonstrating that both human intuition and AI‑driven strategies can halve the quantum resources needed for the most demanding part of Shor’s algorithm, the study pushes the projected date for a viable quantum attack on Bitcoin and Ethereum further out. While the threat remains real and the need for post‑quantum migration is unchanged, stakeholders now have a clearer, more optimistic view of the time they have to prepare. The work also highlights the value of cross‑domain expertise in tackling complex security challenges, suggesting that the future of cryptographic resilience may lie not only in building larger quantum machines but also in smarter, more collaborative problem‑solving approaches.