Project Eleven, a post-quantum startup, awarded 1 BTC (approximately $78,000) to independent researcher Giancarlo Lelli on April 24, 2026, for cracking a 15-bit elliptic curve cryptography (ECC) key on a publicly accessible IBM quantum computer. The company hailed it as the largest public demonstration of its kind, but Bitcoin developers and cryptographers quickly dismissed it, showing that the quantum hardware added no meaningful value—the result can be replicated with random noise.
The Event: 1 BTC Prize and 15-Bit ECC Break
Project Eleven, backed by Coinbase Ventures, Castle Island Ventures, Variant, and Balaji Srinivasan, designed the prize to measure quantum attacks on ECC for key sizes between 1 and 25 bits. Lelli implemented a two-register variant of Shor’s algorithm on IBM Heron r2 processors (ibm_torino and ibm_fez), targeting elliptic curves similar to Bitcoin’s secp256k1. He successfully recovered a 15-bit ECC private key, a 512-fold increase in search-space complexity over a previous 6-bit break by Steve Tippeconnic in September 2025. CEO Alex Pruden framed it as evidence that quantum attacks no longer require national labs or proprietary hardware.
Developer Rebuttal: Replicable with Random Bits
Bitcoin core developers and cryptographers immediately challenged the result. Former Bitcoin Core maintainer Jonas Schnelli analyzed Lelli’s submission and found that the IBM circuit—running approximately 98,000 gates with about 99.5% fidelity—produced outputs statistically indistinguishable from random coin flips. Schnelli reproduced the entire key recovery in about 20 lines of Python using pure random bits, with no quantum hardware involved. His conclusion: “The quantum computer added no detectable signal over classical randomness.”
Coinkite founder Rodolfo Novak labeled Project Eleven’s claims as “theater,” stating on X that “the private key is classically solved before the quantum circuit even runs” and that the system “isn’t finding anything — it’s being told the answer.” He added that the results rely on “a classical verify filter.” Novak concluded that while “the quantum threat to Bitcoin is real but distant, today’s demos are classical computations wearing quantum costumes.”
Researcher Yuval Adam independently confirmed the finding by replacing Lelli’s IBM quantum backend with /dev/urandom, Linux’s classical random number generator, and recovering the same target key. The 15-bit curve has a search space of only 32,767 possible private keys—small enough that a classical verifier checking candidates against the public key finds a match through near-random sampling at high probability. Bitcoin proponent Jimmy Song described the quantum computer as performing the same function as /dev/urandom. The X account TFTC noted in a widely read thread that every public Shor’s algorithm demonstration on ECC to date relies on classical pre-computation that effectively encodes the answer into the circuit before quantum hardware runs.
Project Eleven’s Response: Incremental Progress, Not Q-Day
In a follow-up thread, CEO Alex Pruden acknowledged that the result was not “Q-Day” and that NISQ-era experiments routinely depend on classical assistance. However, he argued the demo still represented incremental, reproducible progress on accessible public hardware and that post-quantum migration planning remains a reasonable long-term priority. Pruden stated: “Bottom line: This is incremental progress in a noisy, early field — not Q-Day. It highlights why we track resource reductions and why post-quantum migration planning matters for long-term security. Skepticism is healthy; moving goalposts isn’t. Happy to discuss the technical details or share the repo/judges’ feedback.”
The Gap: From 15 Bits to 256 Bits—a 2^241 Chasm
The distance between Lelli’s result and any practical threat to Bitcoin is enormous. Bitcoin’s secp256k1 curve operates at 256-bit security. The jump from 15 bits to 256 bits represents a factor of 2^241 in computational difficulty. Even the most optimistic recent research, including an April 2026 Google paper, estimates that breaking 256-bit ECC would require fewer than 500,000 physical qubits—a threshold far beyond current quantum hardware capabilities.
This episode illustrates a persistent tension in quantum computing coverage: incremental hardware milestones generate headlines, but the engineering gap between toy-scale demonstrations and production cryptographic systems remains vast with no near-term solution. Bitcoin’s security model depends on that gap, and developers say it remains intact.