{"id":68193,"date":"2026-04-06T08:44:10","date_gmt":"2026-04-06T01:44:10","guid":{"rendered":"https:\/\/hbbgroup.net\/bitcoins-1-3-trillion-security-race-key-initiatives-aimed-at-quantum-proofing-the-worlds-largest-blockchain\/"},"modified":"2026-04-06T08:44:10","modified_gmt":"2026-04-06T01:44:10","slug":"bitcoins-1-3-trillion-security-race-key-initiatives-aimed-at-quantum-proofing-the-worlds-largest-blockchain","status":"publish","type":"post","link":"https:\/\/hbbgroup.net\/vi\/bitcoins-1-3-trillion-security-race-key-initiatives-aimed-at-quantum-proofing-the-worlds-largest-blockchain\/","title":{"rendered":"Bitcoin’s $1.3 trillion security race: Key initiatives aimed at quantum-proofing the world’s largest blockchain"},"content":{"rendered":"
\n

Developers are considering ways to quantum-proof the world’s oldest cryptocurrency as the threat of this computing moves beyond a hypothetical. <\/h2>\n

Updated Apr 5, 2026, 12:41 p.m. <\/span>Published Apr 5, 2026, 3:31 a.m. <\/span><\/p>\n

Make <\/svg> preferred on <\/svg><\/a><\/p>\n<\/div>\n

\n

Quantum computers capable of breaking the Bitcoin blockchain do not exist today. Developers, however, are already considering a wave of upgrades to build defenses against the potential threat, and rightfully so, as the threat is no longer hypothetical.<\/p>\n

This week, Google published research<\/a> suggesting that a sufficiently powerful quantum computer could crack Bitcoin’s core cryptography in under nine minutes \u2014 one minute faster than the average Bitcoin block settlement time. Some analysts believe such a threat could become a reality by 2029.<\/p>\n

Stakes are high: About 6.5 million bitcoin tokens<\/a>, worth hundreds of billions of dollars, sit in addresses a quantum computer could directly target. Some of these coins belong to Bitcoin’s pseudonymous creator, Satoshi Nakamoto. Besides, the potential compromise would damage Bitcoin’s core tenets \u2013 “trust the code “and “sound money.”<\/p>\n

Here’s what the threat looks like, along with proposals under consideration to mitigate it.<\/p>\n

Two ways a quantum machine could attack Bitcoin<\/h2>\n

Let’s first understand the vulnerability before discussing the proposals.<\/p>\n

Bitcoin’s security is built on a one-way mathematical relationship. When you create a wallet, a private key and a secret number are generated, from which a public key is derived.<\/p>\n

Spending bitcoin tokens requires proving ownership of a private key, not by revealing it, but by using it to generate a cryptographic signature that the network can verify.<\/p>\n

This system is foolproof because modern computers would take billions of years to break elliptic curve cryptography \u2014 specifically the Elliptic Curve Digital Signature Algorithm (ECDSA) \u2014 to reverse-engineer the private key from the public key. So, the blockchain is said to be computationally impossible to compromise.<\/p>\n

But a future quantum computer can change this one-way street into a two-way street by deriving your private key from the public key and draining your coins.<\/p>\n

The public key is exposed in two ways: From coins sitting idle onchain (the long-exposure attack) or coins in motion or transactions waiting in the memory pool (short-exposure attack).<\/p>\n

Pay-to-public key (P2PK) addresses (used by Satoshi and early miners) and Taproot (P2TR), the current address format activated in 2021, are vulnerable to the long exposure attack. Coins in these addresses do not need to move to reveal their public keys; the exposure has already happened and is readable by anyone on earth, including a future quantum attacker. Roughly 1.7 million BTC sits in old P2PK addresses \u2014 including Satoshi’s coins.<\/p>\n

The short exposure is tied to the mempool \u2014 the waiting room of unconfirmed transactions. While transactions sit there awaiting inclusion in a block, your public key and signature are visible to the entire network.<\/p>\n

A quantum computer could access that data, but it would have only a brief window \u2014 before the transaction is confirmed and buried under additional blocks \u2014 to derive the corresponding private key and act on it.<\/p>\n

Initiatives<\/h2>\n

BIP 360: Removing public key<\/strong><\/h3>\n

As noted earlier, every new Bitcoin address created using Taproot today permanently exposes a public key onchain, giving a future quantum computer a target that never goes away.<\/p>\n

The Bitcoin Improvement Proposal (BIP) 360<\/a> removes the public key permanently embedded on-chain and visible to everyone by introducing a new output type called Pay-to-Merkle-Root (P2MR).<\/p>\n

Recall that a quantum computer studies the public key, reverse-engineers the exact shape of the private key and forges a working copy. If we remove the public key, the attack has nothing to work from. Meanwhile, everything else, including Lightning payments, multi-signature setups and other Bitcoin features, remains the same.<\/p>\n

However, if implemented, this proposal protects only new coins going forward. The 1.7 million BTC already sitting in old exposed addresses is a separate problem, addressed by other proposals below.<\/p>\n

SPHINCS+ \/ SLH-DSA: Hash-based post-quantum signatures<\/strong><\/h3>\n

SPHINCS+<\/a> is a post-quantum signature scheme built on hash functions, avoiding the quantum risks facing elliptic curve cryptography used by Bitcoin. While Shor’s algorithm threatens ECDSA, hash-based designs like SPHINCS+ are not seen as similarly vulnerable.<\/p>\n

The scheme was standardized by the National Institute of Standards and Technology (NIST) in August 2024 as FIPS 205 (SLH-DSA) after years of public review.<\/p>\n

The tradeoff for security is size. While current bitcoin signatures are 64 bytes, SLH-DSA are 8 kilobytes (KB) or more in size. As such, adopting SLH-DSA would sharply increase block space demand and raise transaction fees.<\/p>\n

As a result, proposals such as SHRIMPS (another hash-based post-quantum signature scheme) <\/strong>and SHRINCS have already been introduced<\/a> to reduce signature sizes without sacrificing post-quantum security. Both build on SHPINCS+ while aiming to retain its security guarantees in a more practical, space-efficient form suitable for blockchain use.<\/p>\n

Tadge Dryja’s Commit\/reveal scheme: An emergency brake for the mempool<\/h3>\n

This proposal<\/a>, a soft fork suggested by Lightning Network co-creator Tadge Dryja, aims to protect transactions in the mempool from a future quantum attacker. It does so by separating transaction execution into two phases: Commit and Reveal.<\/p>\n

Imagine informing a counterparty that you will email them, then actually sending an email. The former is the commit phase, and the latter is the reveal.<\/p>\n

On the blockchain, this means you first publish a sealed fingerprint of your intention \u2014 just a hash, which reveals nothing about the transaction. The blockchain timestamps that fingerprint permanently. Later, when you broadcast the actual transaction, your public key becomes visible \u2014 and yes, a quantum computer watching the network could derive your private key from it and forge a competing transaction to steal your funds.<\/p>\n

But that forged transaction is immediately rejected. The network checks: does this spend have a prior commitment registered on-chain? Yours does. The attacker’s does not \u2014 they created it moments ago. Your pre-registered fingerprint is your alibi.<\/p>\n

The issue, however, is the increased cost due to the transaction being broken into two phases. So, it’s described as an interim bridge, practical to deploy while the community works on building quantum defences.<\/p>\n

Hourglass V2: Slowing the spending of old coins<\/h3>\n

Proposed by developer Hunter Beast, Hourglass V2<\/a> targets the quantum vulnerability tied to roughly 1.7 million BTC held in older, already-exposed addresses.<\/p>\n

The proposal accepts that these coins could be stolen in a future quantum attack and seeks to slow the bleeding by limiting sales to one bitcoin per block, to avoid a catastrophic overnight mass liquidation that could crater the market.<\/p>\n

The analogy is a bank run: you cannot stop people from withdrawing, but you can limit the pace of withdrawals to prevent the system from collapsing overnight. The proposal is controversial because even this limited restriction is seen by some in the Bitcoin community as a violation of the principle that no external party can ever interfere with your right to spend your coins.<\/p>\n

Conclusion<\/h2>\n

These proposals are not yet activated, and Bitcoin\u2019s decentralized governance, spanning developers, miners and node operators, means any upgrade is likely to take time to materialize.<\/p>\n

Still, the steady flow of proposals predating this week\u2019s Google report suggests the issue has long been on developers\u2019 radar, which may help temper market concerns.<\/p>\n<\/div>\n

\n

AI Disclaimer: Parts of this article were generated with the assistance from AI tools and reviewed by our editorial team to ensure accuracy and adherence to <\/span>our standards<\/a>. For more information, see <\/span>CoinDesk’s full AI Policy<\/a>.<\/p>\n<\/div>\n

\n

More For You<\/p>\n

<\/p>\n
\"Encryption<\/figure>\n

<\/a><\/p>\n

Most crypto privacy models weaken as blockchain data grows. Encryption-based models like Zcash strengthen. CoinDesk Research maps the five privacy approaches and examines the widening gap.<\/p>\n

\n

Why it matters: <\/p>\n

As blockchain adoption scales, the metadata available to machine learning models scales with it. Obfuscation-based privacy approaches are structurally degrading as a result. This report provides a comprehensive comparison of all five major crypto privacy architectures and a framework for evaluating which models remain durable as AI capabilities improve.<\/p>\n<\/div>\n

View Full Report<\/mask><\/g><\/svg><\/a><\/p>\n<\/div>\n<\/div>\n

\n

More For You<\/p>\n

<\/p>\n
\"(Misha<\/figure>\n

<\/a><\/p>\n

Most simplifies the complex process of quantum computing as “it can be 0 and 1 at the same time.” That is not an explanation for why it threatens Bitcoin. This is. <\/p>\n

\n

What to know: <\/p>\n

\n