最新的“量子计算机打破了比特币背后的数学”头条极大地夸大了风险

On Apr. 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. 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 Decrypt'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 Gian