Latest “quantum computer breaks the math behind Bitcoin” headlines massively exaggerate risk

Dijital varlık piyasalarında kritik bir gelişme söz konusu. 24, Project Eleven awarded its Q-Day Prize to Giancarlo Lelli, a researcher who used publicly accessible quantum hardware to derive a 15-bit elliptic curve private key from its public key. This is the largest public demonstration to date of the attack class that could one day threaten Bitcoin, Ethereum, and every other system secured by elliptic curve cryptography. The prize was one Bitcoin.

The irony is that a researcher won Bitcoin by breaking a miniature version of the math that protects Bitcoin. A 15-bit key is nowhere near the security of Bitcoin's 256-bit elliptic curve , and no publicly known quantum computer can break real Bitcoin wallets today. The result arrives at a moment when the surrounding context has gotten considerably more serious, with Google cutting its ECDLP-256 resource estimates and setting a 2029 migration deadline in the same month.

Piyasa Dinamikleri

What Lelli actually did Lelli used a variant of Shor's algorithm, a quantum algorithm targeting the elliptic-curve discrete logarithm problem, the mathematical foundation of Bitcoin's signature scheme, to recover a private key from a public key over a search space of 32,767. The Q-Day Prize competition asked entrants to break the largest possible ECC key on a quantum computer, with no classical shortcuts or hybrid tricks. Lelli's 15-bit result was the highest any entrant reached by the deadline, and Project Eleven described it as a 512x jump over Steve Tippeconnic's 6-bit September 2025 demonstration.

The winning machine had roughly 70 qubits, per 's reporting, and an independent panel including researchers from the University of Wisconsin-Madison and qBraid reviewed the submission, according to Project Eleven. The right frame for this result is a toy lock picked using the same family of methods that would one day threaten the vault. The locksmiths improved, and the vault holds for now.

Claim What the article supports Why it matters A quantum computer broke a 15-bit ECC key Project Eleven says Giancarlo Lelli derived a 15-bit elliptic curve private key from its public key using publicly accessible quantum hardware It turns the quantum threat into a concrete public demonstration rather than a purely theoretical warning Bitcoin itself was not hacked The article explicitly says no publicly known quantum computer can break real Bitcoin wallets today This keeps the piece credible and avoids overstating the result The result used the same attack family relevant to Bitcoin Lelli used a variant of Shor’s algorithm targeting the elliptic-curve discrete logarithm problem, which underlies Bitcoin’s signature scheme It connects the toy demo to the real cryptographic risk without claiming equivalence The demo was done under constrained rules The Q-Day Prize required entrants to break the largest possible ECC key on a quantum computer with no classical shortcuts or hybrid tricks It strengthens the significance of the result as a quantum benchmark The result is larger than prior public ECC demonstrations Project Eleven described the 15-bit result as a 512x jump over Steve Tippeconnic’s 6-bit September 2025 demonstration It shows the public demo frontier is advancing The gap to Bitcoin’s 256-bit security remains enormous The article notes that a 15-bit key is nowhere near Bitcoin’s 256-bit elliptic curve security This is the central caveat readers need in order to interpret the story correctly The hardware was still small by real-attack standards The winning machine reportedly had roughly 70 qubits It underlines that the achievement is meaningful as a milestone, not as proof that full-scale attacks are imminent The real story is directional, not catastrophic Public demos are getting bigger, resource estimates are falling, and migration deadlines now have concrete dates The threat is still future tense, but the timeline is getting harder to dismiss The reason this demo lands with more weight than it would have six months ago is Google. 31, Google published new ECDLP-256 resource estimates for circuits using fewer than 1,200 logical qubits and 90 million Toffoli gates, or fewer than 1,450 logical qubits and 70 million Toffoli gates. Google estimated those circuits could execute on a superconducting cryptographically relevant quantum computer with fewer than 500,000 physical qubits, roughly a 20-fold reduction from prior estimates.

Piyasalara Etkisi

25, Google set a 2029 target for its own post-quantum cryptography migration, tying the deadline explicitly to progress in hardware, error correction, and resource estimates. Cloudflare matched that 2029 target on Apr. 7, citing both the Google paper and a Caltech/Oratomic preprint as reasons for acceleration.

That preprint argued that neutral-atom architectures could run Shor's algorithm at cryptographically relevant scales with as few as 10,000 reconfigurable atomic qubits. 9, QuTech noted that at 10,000 qubits , the architecture would still require nearly three years to break a single ECC-256 key, while the more time-efficient 26,000-qubit configuration would bring the runtime to roughly 10 days. Both estimates depend on machines that do not yet exist, and the Caltech/Oratomic work is an unreviewed preprint.

The useful takeaway from those numbers is that some theoretical architectures now place the long-term hardware requirement far below what researchers assumed a year ago. The clocks for public demonstrations are getting shorter, resource estimates are falling, and migration timelines now carry concrete dates. A timeline graphic charts five milestones from Mar.

Kripto piyasaları, bu gelişmenin ardından yakından takip ediliyor. Yatırımcılar, söz konusu haberin fiyatlar üzerindeki olası etkilerini değerlendiriyor.