IBM Quantum Breakthrough on ECC Key Raises Eyebrows in Bitcoin Community

On April 24, 2026, an independent researcher named Giancarlo Lelli was awarded a 1 BTC prize from Project Eleven for successfully cracking a 15-bit elliptic curve cryptography (ECC) key using IBM’s quantum hardware. This achievement has been heralded by the startup as a significant public demonstration in the field of quantum computing.

Project Eleven claimed this accomplishment represented a remarkable increase in complexity compared to a previous 6-bit ECC key break executed on IBM technology in September 2025. Their CEO, Alex Pruden, suggested that this breakthrough indicated that quantum attacks on ECC no longer necessitate the resources of national labs or exclusive hardware.

TRUSTED PARTNER

5.0 ★★★★★

Review and Opinions →

🔥 Bonus 2.400 $

Bonus Instant + 150 FS 🏆

Open an account

The 1 BTC prize, valued at approximately $78,000, was intended to provide a reproducible public assessment of quantum attacks concerning ECC keys ranging from 1 to 25 bits in size. Lelli’s work, which includes his code and execution records, is accessible to the public on GitHub.

Leveraging Shor’s algorithm, Lelli executed his work on multiple IBM Heron r2 processors. Despite the project’s ambitious framing, Bitcoin developers quickly dismissed the findings, arguing that the quantum output produced no real advantage over classical computation methods.

In a thorough examination, former Bitcoin Core maintainer Jonas Schnelli noted that Lelli’s results were statistically indistinguishable from random noise. He replicated the key recovery process using simple Python code that utilized random bits, decidedly without any quantum computing involvement. Schnelli’s findings suggested that the quantum computer failed to provide any measurable benefit over classical routines.

Critics, including Coinkite founder Rodolfo Novak, have expressed concerns about the transparency of Project Eleven’s claims. Novak argued that the quantum circuit did not uncover results independently but instead was reliant on prior classical computations that determined the outcome in advance. He labeled the demonstration as misleading, characterizing it as a theatrical display rather than a true quantum breakthrough.

Additionally, researcher Yuval Adam supported these criticisms by substituting Lelli’s quantum backend with a classical random number generator, achieving the same key recovery results. He highlighted that the 15-bit key contained a manageable search space, making classical verification feasible without necessitating quantum resources.

TRUSTED PARTNER

3.9 ★★★☆☆

Review and Opinions →

🔥 Bonus 1.400 $

Bonus Instant + 225 FS 🏆

Open an account

Bitcoin advocate Jimmy Song underscored that the quantum computer functioned similarly to classical random number generators, reinforcing the argument that quantum methods currently lack a practical edge in such scenarios.

Despite the controversies surrounding the prize and its implications, Pruden acknowledged that the breakthrough should not be interpreted as a definitive quantum leap. He emphasized that while this result does not signal the impending threat to Bitcoin, it does highlight the importance of ongoing research in designing secure cryptographic systems moving forward.

The considerable divide between Lelli’s achievement and any actual risk to Bitcoin’s security architecture remains clear. The secp256k1 curve used in Bitcoin operates on a 256-bit security level, translating to a staggering computational challenge of 2^241 to breach. Current technology is not poised to surmount this gap anytime soon.

This incident illustrates the ongoing dialogue within the quantum computing space, where significant milestones can generate excitement, yet the chasm between experimental demonstrations and practical applications for secure cryptography persists. The integrity of Bitcoin’s security model relies heavily upon this unresolved gap.