A claimed quantum computing breakthrough targeting Bitcoin’s cryptography is facing immediate scrutiny from analysts. Tests suggest the method demonstrates no quantum advantage and can be replicated using random data, behaving like a classical brute-force attack. The demonstration used a 15-bit key, a scale vastly smaller than Bitcoin’s real-world 256-bit security, highlighting a significant gap between the claim and practical threats to the network.
Analysts have cast doubt on a recent claim of a quantum breakthrough against Bitcoin’s encryption. On-chain analyst Checkmate rejected the assertion in a social media post.
“Its nonsense, the quantum part can be swapped for a random number generator and get the same results,” Checkmate stated. He added that the process awarded a prize for classical brute force, which Bitcoin’s design inherently protects against.
Independent developer Yuval Adam replicated the procedure by substituting quantum system calls with random bytes. His test achieved the same key recovery results as the original claim, indicating no unique quantum advantage.
Adam explained the technique relies on a probabilistic, trial-and-error process. With enough random guesses, a valid key will eventually be found, mirroring a traditional brute-force search.
The demonstration was based on finding a 15-bit elliptic curve key. This limited scope, with only 32,767 possible combinations, is trivially searchable by standard computers and does not reflect Bitcoin’s security reality.
Bitcoin utilizes 256-bit cryptography, presenting a vastly more complex challenge. The disconnect renders the demonstration’s relevance to real-world Bitcoin security minimal.
The cryptocurrency industry continues to research quantum computing’s long-term implications. Proposals for quantum-resistant formats, such as BIP-360 and BIP-361, represent ongoing development efforts to address future theoretical risks.
