What happens to blockchain, DeFi, stablecoins, and digital payments infrastructure when quantum computing reaches cryptographically relevant scale — and is post-quantum migration realistic on the required timeline

If Quantum Computers Get Powerful Enough, Can Digital Money Survive — and Can Anyone Fix It in Time?

May 24, 2026 | 120 nodes · 393 edges

↓ .md ↓ .db Take this into your AI — the full analysis + graph as markdown, ready to paste into ChatGPT, Claude, Gemini or any AI.

Based on analysis of a 120-node, 393-edge knowledge graph mapping the relationships between quantum computing development, cryptographic vulnerabilities, blockchain governance, and payment infrastructure migration timelines.

The Lock-and-Key Problem

Most digital money — whether it’s Bitcoin, Ethereum, bank transfers, or stablecoins like Tether — relies on a type of math-based lock called ECDSA. Think of it like a combination safe: it’s easy to lock, but essentially impossible to open without the right combination. This is true today because no computer is fast enough to crack it.

Quantum computers work differently from regular computers. A sufficiently powerful quantum computer running something called Shor’s Algorithm could, in theory, crack these locks. Not in millions of years — potentially in hours. The question the graph tries to answer is: what happens to the financial system if and when that becomes possible, and is there a realistic path to swapping out the locks before it does?

The graph models 120 concepts and 393 relationships between them — things like specific quantum computing milestones, cryptographic vulnerabilities, regulatory frameworks, and proposed solutions. What emerges is a picture that is neither “everything is fine” nor “everything will collapse.” It is more specific than either of those: certain things are likely to fail, certain other things are better positioned than most people assume, and one physical bottleneck blocks almost everything else.

Two Clocks Running at the Same Time

Imagine you have two clocks on the wall. One counts down to when quantum computers become dangerous. The other counts down to when our financial systems can finish replacing their locks. Mosca’s Inequality is the name researchers give to the uncomfortable observation that if the first clock hits zero before the second one does, you have a problem.

IBM has publicly stated that it expects to have a cryptographically significant quantum computer — one powerful enough to threaten real-world encryption — by around 2029. This specific milestone appears in the graph as a hub with 18 connections to other concepts: it triggers migration races, it creates deadlines for regulators, it anchors threat timelines. But the graph assigns it a relatively low confidence weight (5.9 out of 10), encoding that while this timeline is structurally load-bearing, it is also genuinely uncertain. If IBM’s roadmap slips, many of the urgency calculations change.

The second clock — the migration clock — is the harder problem. And the graph identifies exactly where it is stuck.

The Bottleneck Nobody Talks About

The single most important blocking node in the graph is something called the Payment Infrastructure HSM Certification Gap. HSMs — Hardware Security Modules — are physical devices that banks, payment networks, and financial institutions use to store and process cryptographic keys. They are certified by government standards bodies to confirm they are secure.

Here is the problem: every major migration path in the graph runs through this gap. SWIFT (the network that moves money between banks internationally), Fedwire (the US Federal Reserve’s payment system), CBDCs (government digital currencies), and the entire chain of institutional payment infrastructure all need HSMs that support the new quantum-resistant encryption algorithms. Those certifications do not yet exist at scale. No migration path in the graph bypasses this node — and the graph does not contain a named solution node that resolves it. The gap is structurally present and structurally unresolved.

Think of it like this: every bank vault in the world needs a new type of lock. The blueprints for the new locks exist. But the locks have not been inspected and certified as secure yet. Until they are, you cannot install them. And until you install them, the vaults remain vulnerable.

Why Bitcoin Has a Harder Problem Than Your Bank

Banks are centralized. One organization makes decisions, updates systems, and can be compelled by regulators to comply with new standards. If the government says “install new locks by this date,” banks have to comply.

Bitcoin has no such decision-maker. It is governed by rough consensus among developers, miners, node operators, and users — all of whom must agree to upgrade before any change happens. The graph encodes this as Bitcoin BIP-361 Governance Crisis, which is the second most connected concept in the entire graph, with 29 relationships and a weight of 9 out of 10.

What is notable is not just that this governance crisis exists — it is that almost everything makes it worse. The graph shows that when other blockchains successfully migrate to quantum-resistant cryptography (which Algorand has already begun doing), this simultaneously proves migration is technically possible and increases the competitive disadvantage for Bitcoin, which has not. External success does not resolve the internal governance problem; it highlights it.

The graph also encodes a counterintuitive finding about Bitcoin’s most recent address format. Taproot (called P2TR) is Bitcoin’s newest and most recommended address type. But unlike older Bitcoin addresses, which only expose the public key at the moment of spending — giving a very brief window of quantum vulnerability — Taproot addresses expose the public key at the moment of receiving funds. Every Taproot address is therefore a permanently exposed lock waiting to be cracked when the quantum computers are ready. The graph encodes adoption of the “improved” format as amplifying rather than reducing quantum vulnerability.

The Thief Who Doesn’t Need to Break In Today

One finding the graph makes concrete is the Harvest-Now-Decrypt-Later attack. A sufficiently well-resourced actor — a nation-state intelligence agency, for example — does not need a quantum computer today to benefit from quantum computing tomorrow. They can intercept and store encrypted communications and transactions now, and decrypt them later once quantum computers are capable enough.

Applied to blockchain: years of transaction data, wallet addresses, and public keys are permanently recorded on public ledgers. They are not going anywhere. Once a capable quantum computer exists, that historical data becomes readable. The locks on old safes, currently impractical to crack, become openable retroactively. This is why researchers argue the migration clock may need to start earlier than the threat clock: by the time the threat is real, the data is already compromised.

The Central Bank Advantage Nobody Expected

One of the more counterintuitive findings the graph encodes is that the feature of central bank digital currencies (CBDCs) that makes them politically controversial — centralized control — is the same feature that makes them better positioned for quantum migration than decentralized crypto.

When a central bank issues a digital currency, it controls the keys. There is no coordination problem across thousands of independent participants. When the migration needs to happen, it can happen. The graph encodes this as a structural inversion: the same centralization that critics argue is a liability in normal times is an asset during a cryptographic migration emergency.

This does not mean CBDCs are currently safe — they face the same underlying cryptographic vulnerabilities as everything else. But it means they are better positioned to fix those vulnerabilities on a mandated timeline.

The Safe That You Can Only Reach Through the Danger Zone

There is one blockchain in the graph that has never used ECDSA at all: QRL, which uses a different cryptographic approach (XMSS) that is already quantum-resistant. In the model, QRL is the safest harbor.

The catch is that to move assets into QRL, you have to use cross-chain bridges — software that lets you transfer value between different blockchains. The graph identifies cross-chain bridges as the single most concentrated ECDSA attack surface in all of crypto. The safe harbor exists, but the only road into it runs directly through the highest-risk territory.

Why Doing Nothing Is Collectively Rational and Collectively Disastrous

The graph encodes what economists call a coordination failure using a feedback loop it calls the First-Mover Penalty. The logic works like this: if you migrate first, you absorb all the costs and disruption of migration, while latecomers wait to see if it works. This creates a rational incentive to wait. But if everyone waits, nobody migrates. And if nobody migrates when quantum computers arrive, the collective cost is catastrophic.

This is structurally similar to a game where the prize for moving first is that everyone else is now even less likely to move — because the first mover’s success proves it is possible, increasing the competitive disadvantage for those who have not done it yet, while simultaneously demonstrating that migration is survivable, reducing the argument that it is technically too difficult.

The graph shows this loop is currently being amplified by more forces than are constraining it. The amplifiers — competitive disincentives, regulatory vacuums, collective action problems — currently outnumber the constrainers — voluntary market responses and early-mover examples.

Bottom Line

The graph encodes five structural observations that are not obvious from surface-level coverage of the topic:

The HSM certification gap is the actual bottleneck, not the cryptographic theory. The math for quantum-resistant encryption is largely settled. The standards exist. What does not exist at scale is the certified physical hardware that financial institutions require. Until that gap closes, almost no major institutional migration can complete, regardless of regulatory deadlines.

IBM’s 2029 roadmap is structurally load-bearing but epistemically uncertain. Many migration timelines, threat deadlines, and competitive pressures in the graph derive from IBM’s stated roadmap. Its low confidence weight (5.9) encodes that the graph treats this timeline as the best available proxy for “when does quantum become dangerous” while recognizing it may be wrong in either direction.

Bitcoin’s governance problem and technical solutions are developing in parallel without converging. Other blockchains are demonstrating that quantum migration is technically feasible. Bitcoin’s governance problem is simultaneously becoming more entrenched, not less. The graph does not encode a scenario where these two trends resolve into a successful Bitcoin migration.

Centralized financial systems have a structural migration advantage over decentralized ones. This is not an argument for centralization in general — it is a specific observation about who can execute a coordinated, mandated cryptographic migration under a deadline. The graph encodes a likely two-tier outcome: government-mandated systems migrate; voluntary systems face a coordination problem with no obvious resolution mechanism.

The first-mover penalty and the regulatory vacuum are mutually reinforcing. The absence of a regulatory mandate makes being first costly. The first-mover cost reduces pressure for a mandate. The graph encodes this as a self-sustaining loop with no internal break — the only external force that could interrupt it is a demonstrated quantum attack that converts theoretical risk into observable harm.

What the graph does not encode is a confident timeline prediction. The CRQC arrival date is genuinely uncertain. The HSM certification pace is unknown. The Bitcoin governance trajectory is unresolved. What the graph does encode, clearly and repeatedly, is which problems are structural and which are contingent — and the structural problems are the ones that would persist even if every other assumption improved.

Structural Analysis: Quantum Computing and Blockchain/Payments Infrastructure

Key Findings

1. A bifurcated threat architecture converges on a single governance node. The graph encodes two structurally distinct threat types: cryptographic (Shor’s Algorithm ECC Attack Mechanism → ECDSA Blockchain Exposure Surface) and sociotechnical (coordination failures, regulatory vacuums). These converge at Bitcoin BIP-361 Governance Crisis (29 connections, w=9), which is simultaneously a target of technical attack vectors, a recipient of coordination failure amplifiers, and a node that multiple solution paths explicitly absent_in or contradicts. The governance node’s weight matches the primary attack node (Cryptographically Relevant Quantum Computer, w=9), encoding them as co-equal structural risks.

2. The HSM certification gap is the critical path item for all major migration timelines. Payment Infrastructure HSM Certification Gap (22 connections, w=7.5) receives blocking edges from NIST PQC Standards, SwiftNet 8.0, CBDC migration, Fedwire remediation, BIS Project Leap 2, SWIFT migration, G7 roadmap, Mosca’s Inequality, and FALCON implementation — simultaneously. No major institutional PQC migration path in the graph bypasses this node. It is the convergence point for physical infrastructure constraints across every domain modeled.

3. The solution landscape is structurally asymmetric with threat landscape. Threat nodes cluster at higher weights (Shor’s at 8.5, CRQC at 9, ECDSA Exposure at 8, Harvest-Now at 8) than most solution nodes (NIST PQC Standards at 8, Ethereum Account Abstraction at 8.5, Crypto-Agility Architecture at 7.5–8.5). The primary exceptions are zk-STARK Hash-Based Quantum Resistance (w=8, multiple outbound hedges_against and enables edges) and Ethereum Account Abstraction PQC Migration (w=8.5). This asymmetry is consistent across the graph rather than being an artifact of any single cluster.

4. IBM Quantum Starling 2029 Roadmap is the lowest-weight high-centrality node. At 18 connections but w=5.9, IBM Quantum Starling 2029 Roadmap is structurally the most anomalous hub node. Its connections are predominantly outbound deadline constraints and threat triggers (IBM Starling 2029 Blockchain Migration Race, Bitcoin BIP-361 Governance Crisis, BLS12-381 Staking Layer Quantum Attack, Ethereum Account Abstraction PQC Migration, etc.), but its weight encodes it as less inherently certain than the mechanisms it triggers. This asymmetry — high structural influence, low epistemic weight — marks it as the timeline uncertainty anchor.

5. Positive first-mover events amplify the penalty for non-movers. Algorand Falcon Live Deployment --[triggers, w=7.5]--> Quantum Migration First-Mover Penalty. Successful migration by one actor directly increases the competitive pressure on non-migrating actors. This creates a structural dynamic where early adoption accelerates the urgency of the problem for laggards, rather than demonstrating that migration is feasible and tractable (even though it also --[contradicts]--> Bitcoin BIP-361 Governance Crisis).

Feedback Loops

Loop 1: The First-Mover Penalty Amplification Loop (5 nodes, all reinforcing)

Quantum Migration First-Mover Penalty
  --[amplifies, w=8.5]--> PQC Regulatory Vacuum for Crypto
  --[enables, w=8]--> Harvest-Now-Decrypt-Later Attack
  --[amplifies, w=8]--> Fedwire Quantum Cascade Risk
  --[triggers, w=8]--> Saxo Bank Q-Day Market Cascade Scenario
  --[amplifies, w=8]--> Quantum Migration First-Mover Penalty

This is a reinforcing loop: each iteration of competitive delay increases the systemic cost of the next round of delay. The loop runs through the regulatory vacuum (no mandate → no migration), to active threat accumulation (harvesting), to cascading institutional failure, and back to increased competitive disincentive.

Loop 2: The Regulatory Vacuum Tight Loop (2 nodes, bidirectional)

PQFIF Crypto Regulatory Vacuum
  --[enables, w=8.5]--> Quantum Migration First-Mover Penalty
  --[depends_on, w=7]--> PQFIF Crypto Regulatory Vacuum

The First-Mover Penalty both depends on and enables the regulatory vacuum. The absence of mandate creates the first-mover disincentive; the first-mover disincentive removes pressure for mandate creation. This is an explicit mutual reinforcement encoded in two edges of opposite direction between the same pair of nodes.

Loop 3: ECDSA Exposure Harvesting Loop (4 nodes)

ECDSA Blockchain Exposure Surface
  --[amplifies, w=9]--> Harvest-Now-Decrypt-Later Attack
  --[depends_on, w=8.5]--> Cryptographically Relevant Quantum Computer
  --[enables, w=9.5]--> Shor's Algorithm ECC Attack Mechanism
  --[exploits, w=9.5]--> ECDSA Blockchain Exposure Surface

The ECDSA exposure motivates current harvesting; harvesting’s eventual utility depends on CRQC; CRQC enables Shor’s; Shor’s exploits ECDSA. The loop is not “self-sustaining” in the traditional sense (it requires an external CRQC development input), but once CRQC is achieved, harvested data retroactively closes the loop.

Loop 4: Coordination Failure Co-Activation Loop (3 nodes, partly via Hebbian edges)

Cryptographically Relevant Quantum Computer
  --[co_activated, w=0.5]--> Quantum Migration Systemic Coordination Failure
  --[amplifies, w=8.3]--> Harvest-Now-Decrypt-Later Attack
  --[depends_on, w=8.5]--> Cryptographically Relevant Quantum Computer

The coordination failure co-activation edge (Hebbian learning, w=0.5) reflects that these concepts are frequently recalled together. The high-weight outbound edges from Coordination Failure and the depends_on edge back to CRQC close this loop at lower structural confidence than Loops 1–3.

Loop 5: Stablecoin Cascade Amplification (5 nodes)

DeFi Liquidity Pool Quantum Drain
  --[amplifies, w=8.5]--> Stablecoin Admin Key Quantum Attack
  --[amplifies, w=8.5]--> Tether USDT Offshore Quantum Reserve Risk
  --[triggers, w=8]--> Saxo Bank Q-Day Market Cascade Scenario
  --[amplifies, w=8]--> Quantum Migration First-Mover Penalty
  --[amplifies, w=8.5]--> PQC Regulatory Vacuum for Crypto
  --[undermines, w=8]--> DeFi Liquidity Pool Quantum Drain

The PQC Regulatory Vacuum --[undermines]--> DeFi Liquidity Pool Quantum Drain closes this loop by encoding that absence of regulation actively weakens DeFi’s ability to address the quantum drain vulnerability.

Non-Obvious Connections

1. CBDC centralization as a migration advantage TradFi PQC Mandate Advantage Over Crypto --[inverts, w=8.5]--> CBDC Quantum Vulnerability and CBDC Centralization PQC Migration Advantage --[inversely_correlates, w=7]--> CBDC Quantum Vulnerability. The property that makes CBDCs organizationally controversial (centralized control with no key distribution problem across participants) is the same property that enables faster PQC migration. The graph encodes this not as coincidence but as structural inversion: the liability in one frame is an asset in the other.

2. MPC custody amplifies the attack it is deployed to prevent MPC Custody Quantum False-Safety Trap --[amplifies, w=8.5]--> Stablecoin Admin Key Quantum Attack. MPC threshold signatures are a common institutional crypto custody security measure. The graph encodes them as amplifying rather than mitigating the primary stablecoin quantum attack vector, because MPC schemes built on ECDSA carry the same ECDSA exposure surface.

3. zk-STARK quantum resistance is conditional on Grover’s infeasibility zk-STARK Hash-Based Quantum Resistance --[depends_on, w=8]--> Grover Algorithm SHA-256 Non-Threat. zk-STARK’s quantum resistance rests on hash function security, which Grover’s algorithm attacks at O(√N) complexity. The graph encodes this as a structural dependency: zk-STARK is quantum-resistant given that Grover’s remains computationally infeasible at scale. This conditionality is not prominently surfaced elsewhere.

4. SIDH’s catastrophic failure strengthens the overall solution architecture SIDH Catastrophic Break as PQC Meta-Risk --[triggers, w=8]--> Cryptographic Agility Architecture and --[undermines, w=7.5]--> NIST Post-Quantum Cryptography Standards. The 2022 laptop-level break of SIDH both weakens confidence in NIST’s selection process and motivates adoption of crypto-agility (ability to swap schemes). The same event has opposite structural effects depending on which downstream node is considered.

5. Algorand deployment increases the penalty it disproves Algorand Falcon Live Deployment --[triggers, w=7.5]--> Quantum Migration First-Mover Penalty and --[contradicts, w=8]--> Bitcoin BIP-361 Governance Crisis. Algorand’s successful PQC migration simultaneously disproves the “technically impossible” objection to migration and increases the competitive disadvantage for chains that have not migrated. It is both a demonstration of feasibility and an accelerant of urgency for non-movers.

6. QRL’s safe haven is accessible only through the infrastructure it hedges against QRL XMSS Safe-Haven Bridge Paradox --[depends_on, w=8]--> Cross-Chain Bridge Quantum Attack Surface. QRL is the only public blockchain with zero ECDSA exposure, but any actor seeking to migrate assets into QRL must use cross-chain bridges, which the graph encodes as “THE SINGLE MOST CONCENTRATED ECDSA TARGET IN ALL OF CRYPTO.” The safe haven is structurally reachable only through the primary attack surface.

7. Taproot (Bitcoin’s newest address format) is worst for quantum security Taproot P2TR Quantum Exposure Paradox --[amplifies, w=8.5]--> ECDSA Blockchain Exposure Surface. Taproot/P2TR is Bitcoin’s most recently recommended address format, but unlike P2PKH which only exposes public keys when spending (giving a brief window), P2TR exposes public keys at receipt. The graph encodes user adoption of the “improved” format as amplifying quantum vulnerability.

Central Mechanisms

Cryptographically Relevant Quantum Computer (34 connections, w=9) Functions as the system’s universal trigger. All attack chains terminate in it as a prerequisite (Harvest-Now depends_on it; Stablecoin Admin Key Attack triggered_by it; BLS12-381 Attack depends_on Fault-Tolerant Quantum Computing which enables it). All defenses are calibrated against it as the threat horizon. The node’s gatekeeper is Quantum Error Correction Threshold (which gates CRQC), making that threshold the deepest upstream variable in the entire graph. The node’s 34 connections are split between inbound technical prerequisites (Quantum Error Correction Threshold, IBM roadmap, Google roadmap, Jiuzhang distinction) and outbound attack enablers.

Bitcoin BIP-361 Governance Crisis (29 connections, w=9) The most connected non-infrastructure, non-mechanism node. It receives from: IBM 2029 Roadmap (triggers), Mosca’s Inequality (constrains), Lightning Network HTLC Attack (undermines), Quantum Migration First-Mover Penalty (amplifies), Taproot Paradox (amplifies), Project Eleven (amplifies), Collective Action Impossibility (constrains), Satoshi Coins Dilemma (contains), Bitcoin ETF Time Bomb (amplifies). It is contradicted by: Algorand Falcon deployment, Algorand Falcon mainnet, Solana FALCON plan, XRPL roadmap, zk-STARK (bypasses it), Ethereum Account Abstraction (contrasts with it). Its attempts_to_fix edge to ECDSA Blockchain Exposure Surface is the only outbound constructive edge. All other outbound edges are absent relationships (Crypto-Agility as Quantum Survival Architecture --[absent_in]-->) or downstream effects.

Quantum Migration First-Mover Penalty (25 connections, w=7.5) The economic amplifier. It receives from coordination failures and regulatory vacuums and outputs to more regulatory vacuum and governance crises. Its role is to translate individual rational inaction into collective systemic risk. Key structural feature: it is simultaneously constrained by (G7 roadmap, Mastercard doctrine, Hybrid bridge, Solana FALCON plan) and amplified by (PQFIF vacuum, Collective Action Impossibility, MPC False Safety trap, Saxo Scenario). The constraining edges represent voluntary/market responses; the amplifying edges represent structural/systemic forces. The amplifying edges currently outnumber the constraining edges.

NIST Post-Quantum Cryptography Standards (23 connections, w=8) The solution convergence point. Every technical migration path eventually implements, depends on, or is blocked relative to NIST PQC Standards. Key structural tension: it is both the foundation for all solutions (Ethereum, Algorand, QRL, SwiftNet, CBDC, NSM-10 mandate) and has a known vulnerability via SIDH Catastrophic Break --[undermines]--> it. The XMSS statefulness trap constrains it for certain use cases. Its blocked_by edge to HSM Certification Gap means that even having the standards does not guarantee deployment.

Payment Infrastructure HSM Certification Gap (22 connections, w=7.5) A physical infrastructure node that functions as the bottleneck for the entire TradFi migration stack. Notable: it has almost no outbound edges that enable anything — it is primarily a blocker. Its connections are dominated by inbound blocked_by, constrains, compounds, and depends_on edges from solution nodes. The G7 CEG roadmap and Mosca’s Inequality constrain it, but the graph does not encode a resolution path for HSM certification as a named node — the gap is structurally present but its solution is unresolved.

Tensions and Open Questions

Tension 1: Tether vs. Circle as stablecoin quantum strategy Tether Ardoino Lost-Coins Recirculation Thesis --[contrasts_with, w=8.5]--> Circle Arc Quantum-Native L1 Strategy. Tether’s position (quantum-vulnerable coins will simply be recirculated into circulation, net effect neutral) is encoded as amplifying both Stablecoin Admin Key Quantum Attack and Satoshi Coins Quantum Freeze Dilemma. Circle’s position is encoded as hedging against the attack. The graph does not adjudicate which model of stablecoin quantum impact is correct; both positions exist simultaneously with their downstream effects modeled separately.

Tension 2: CBDC quantum vulnerability vs. CBDC migration advantage Two competing node-level claims coexist: CBDC Quantum Vulnerability (CBDCs are threatened) and CBDC Centralization PQC Migration Advantage (CBDCs can migrate faster). These are connected via CBDC Centralization PQC Migration Advantage --[inversely_correlates, w=7]--> CBDC Quantum Vulnerability and TradFi PQC Mandate Advantage Over Crypto --[inverts, w=8.5]--> CBDC Quantum Vulnerability. The graph encodes this as a temporal tension: CBDCs are currently vulnerable but structurally better positioned to remediate. The resolution depends on migration timelines relative to CRQC timelines.

Tension 3: IBM 2029 weight vs. IBM 2029 centrality IBM Quantum Starling 2029 Roadmap is the lowest-weight hub node (w=5.9) but the 10th most connected (18 connections). The graph encodes the timeline as structurally load-bearing (many things depend on it) but epistemically uncertain (low weight). This is unresolved: if IBM’s 2029 roadmap slips, many of the deadline-dependent migration race edges lose their temporal anchor, but the graph doesn’t model a “timeline slippage” scenario explicitly.

Tension 4: PQC migration as technically feasible vs. governmentally impossible Algorand Falcon PQC Production Proof --[demonstrates, w=8.5]--> Crypto-Agility Architecture and --[contradicts, w=8]--> Bitcoin BIP-361 Governance Crisis. The same period that demonstrates PQC migration is feasible (Algorand mainnet, Solana FALCON plan, XRPL roadmap) contains the encoding of Bitcoin’s governance crisis as high-weight (9) and multiply reinforced. The technical feasibility proof and the governance impossibility coexist without resolving into a single prediction.

Tension 5: Hybrid ECDSA-PQC introduces the vulnerabilities it bridges ML-KEM Implementation Side-Channel Attack Surface --[amplifies, w=7]--> Hybrid ECDSA-PQC Dual Signature Bridge. The primary migration mechanism (hybrid signatures) is itself amplified as an attack surface by ML-KEM’s side-channel vulnerability. The bridge is simultaneously the migration path and a new attack vector. The graph encodes this without resolving which effect dominates.

Open Question 1: What resolves HSM certification gap? The HSM Certification Gap blocks the most migration paths of any single node, but no node in the graph encodes a resolution path. G7 CEG roadmap and Mosca’s Inequality constrain it; NSM-10 drives demand against it; but no node resolves or supersedes it.

Open Question 2: What is the actual CRQC timeline? Jiuzhang 4.0 Boson Sampling vs Gate-Model CRQC Distinction constrains both CRQC and Fault-Tolerant Quantum Computing, encoding that China’s photonic supremacy claims are architecturally distinct from gate-model CRQCs (which enable Shor’s). But the graph does not encode a node for when or whether gate-model CRQCs will arrive — IBM’s roadmap is the closest proxy, but its low weight (5.9) encodes uncertainty.

Open Question 3: Is QRL’s safe-haven viable given bridge dependence? QRL XMSS Safe-Haven Bridge Paradox encodes that QRL’s quantum safety is undermined by bridge infrastructure — but the graph does not encode a resolution. Whether QRL gains traction as a safe haven before Q-Day, or whether bridge vulnerability neutralizes it, is unresolved.

Hypotheses

H1: The HSM certification gap will determine whether any major payment system migrates before CRQC. The graph encodes HSM Certification Gap as blocking NIST standards adoption for CBDC, SwiftNet, Fedwire, and SWIFT simultaneously. If the gap is not resolved independently of CRQC timelines, Mosca’s Inequality will be violated for all major payment systems — the migration time (Y) will exceed the remaining time to CRQC (Z) even if migration begins immediately. Testable indicator: pace of HSM PQC certification approvals by FIPS against IBM/Google roadmap milestones.

H2: Governance-incapable blockchains will bifurcate into “quantum-frozen” and “hard-forked” variants rather than migrating. Bitcoin BIP-361 Governance Crisis is multiply reinforced (29 connections, w=9) with no high-weight outbound constructive edge except attempts_to_fix ECDSA exposure. Meanwhile, Algorand’s production PQC proof contradicts the governance crisis but does not resolve it. The structural prediction is that governance-resistant chains will split: a fork implementing PQC and the original chain remaining on ECDSA. Testable: track BIP-361 adoption rate vs. first proof-of-concept quantum attack on Bitcoin public keys.

H3: Stablecoin admin key attacks will precede wallet attacks as the first economically significant quantum threat. Stablecoin Admin Key Quantum Attack (w=8.5) is encoded as requiring fewer attacker resources than wallet attacks because it targets one key to compromise system-wide assets. The graph shows a concentrated attack chain: Shor’s → admin key → Tether reserve risk → Saxo scenario → systemic cascade. By contrast, individual wallet attacks require enumerating exposed public keys and attacking high-value targets one at a time. Testable: at what CRQC qubit scale does the admin-key attack become feasible vs. the individually-targeted wallet attack.

H4: Nations with sovereign CBDC programs will have quantum-secure payment infrastructure before most private crypto. TradFi PQC Mandate Advantage Over Crypto combined with CBDC Centralization PQC Migration Advantage and NSM-10 Federal PQC Mandate Cascade encode a structural divergence: regulated, centralized payment systems face mandatory migration timelines; decentralized crypto faces voluntary market pressure with first-mover penalties. The WEF Quantum Financial Two-Tier Divide node explicitly encodes the resulting inequality. Testable: compare PQC deployment timelines for CBDC pilots (e.g., mBridge, e-CNY, digital euro) against voluntary PQC adoption on public blockchains.

H5: The first demonstrated quantum reduction of a live blockchain key will activate the Bitcoin ETF regulatory cascade. Bitcoin ETF Quantum Regulatory Time Bomb --[depends_on, w=8.5]--> MPC Custody Quantum False-Safety Trap and --[amplifies, w=8]--> Bitcoin BIP-361 Governance Crisis with NSM-10 Federal PQC Mandate Cascade --[amplifies, w=7.5]--> Bitcoin ETF Quantum Regulatory Time Bomb. The graph encodes a latent regulatory trigger: ETF custodians using MPC on ECDSA, when confronted with a demonstrated quantum attack on ECDSA, would face fiduciary liability questions that convert quantum risk from a technical concern to a regulated disclosure/remediation requirement. Testable: SEC/CFTC language on quantum risk in ETF product filings over the next 24 months.

H6: Bitcoin’s quantum migration probability decreases monotonically with time. The graph does not encode a scenario where Bitcoin BIP-361 Governance Crisis self-resolves. Its amplifiers (First-Mover Penalty, Taproot Paradox, Project Eleven report, Mosca’s Inequality, Collective Action Impossibility) accumulate over time; its countervailing edges are all from external actors (Algorand, Solana, XRPL) demonstrating alternatives, not from internal governance evolution. Testable: track BIP-361 specification progress rate against the number of high-value Taproot addresses exposed. A governance crisis that grows while the technical problem deepens has no equilibrium resolution in this model.