Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Quantum Layer Separation in Original Bitcoin: Authorization, Proof-of-Work, Residual State, and Ordering

PARTH MAURIA SAXENA

Published Jun 12, 2026• 0 citations
Publisher

Abstract

This paper argues that quantum risk in original Bitcoin is layer-specific rather than protocol-uniform. Using the November 2008 pre-release witness as its primary corpus, it separates authorization, proof-of-work, residual-state accounting, and timechain ordering. The clearest Shor-sensitive surface is authorization, where public-key signatures govern spending authority. Proof-of-work belongs to a different problem class: hash-target search, where Grover-class advantage changes search economics without becoming key recovery. Residual spendable state and accepted ordering are not themselves cryptographic secrets, though they may be affected indirectly if authorization or proof-of-work assumptions change. The paper does not claim that original Bitcoin is quantum-proof or provide a production post-quantum migration design. It argues instead that migration discussion should begin only after the protocol layers have been separated.

DOI
10.5281/zenodo.20671182

Related papers

SoK: The Atomic Cryptographic Substrate of Blockchains: A Post-Quantum Vulnerability and Migration Analysis

PARTH MAURIA SAXENA

Public debate on the quantum threat to blockchains—and much of the survey literature—is dominated by chain-level claims that mislocate the risk. We relocate the problem to the level at which an algorithm actually acts, showing that the post-quantum fate of any chain decomposes into three layers: which hardness assumption secures its signatures (Shor-vulnerable discrete-log/factoring, hash, or lattice); that assumption's status under the physically-realizable computational model (classical BPP vs quantum BQP); and the physical floor beneath it—unstructured-search lower bounds and serial-depth constraints, not a claim of unconditional security. At ground zero, the abelian-hidden-subgroup atom is efficiently broken under BQP (Shor), while no efficient BQP break is known for hash or lattice; hash security rests on the most conservative, best-tested conjecture; discrete-log rests on exploitable algebraic structure; and lattice assumptions, though buttressed by worst-case reductions unevenly across the lattice family, carry a much shorter cryptanalytic record. We locate the vulnerability in a single object—the exposed public key—and formalize compromise as a conjunction of exposure, feasibility, and non-revocation. Under a floor assumption (generic, unstructured search stays infeasible) this factors into four conjuncts answering to four distinct authorities—mathematics, the ledger, engineering, and the owner or protocol—with feasibility entailing brokenness. Each per-asset cryptanalytic defense we survey denies the primary one of these four conjuncts—an accounting identity over the four predicates (some defenses touch more than one; we classify by the primary), not a claim of exhaustiveness over an open-ended literature. We give an exposure taxonomy checked against the reference implementations and a first-party, reproducible measurement of the full Bitcoin UTXO set (block 957,269, July 2026): 1.93M BTC (≈9.6% of supply) carries a standing exposed public key—the defensible, structurally unambiguous figure—rising to 5–7M BTC (25–35%) once key-reuse is included, the range's width set by the P2SH/P2WSH script-hash upper bound. This decomposes exactly along the taxonomy's structural-versus-operational axis and quantifies Taproot's hidden-key regression (a directional shift on the exposure axis, minor by value); current resource estimates and a CRQC timeline; and a per-chain migration survey. A recurring result: account and governance architectures migrate most easily while immutable/UTXO chains are hardest—the property prized as a security virtue is the migration handicap. No unconditional security exists; all verdicts are contingent on unproven conjectures and the assumption that BQP is the physical ceiling of computation.

•Jul 15, 2026•0 citations

Toward Protocol-Level Quantum Safety in Bitcoin: A Formal, Adversarial, and Invariant-Driven Model

Mayckon Giovani

This work presents a formal, state-machine-based treatment of protocol-level quantum safety in Bitcoin under quantum polynomial-time (QPT) adversaries. We model Bitcoin as a deterministic state transition system over the UTXO set and define authorization as a game-based property. We introduce a set of invariants including authorization integrity, no double-spend, and deterministic validation, and formally prove their preservation under valid state transitions. We provide a reduction showing that any unauthorized spend implies either a break of EUF-CMA security of the signature scheme or a violation of hash-based binding properties, in both the classical and quantum random oracle model (QROM), without relying on oracle reprogramming or rewinding techniques. The model explicitly incorporates adversarial network conditions, including mempool observation, transaction reordering, and chain reorganizations, and proves that such capabilities do not enable unauthorized state transitions. We formalize a consensus-semantic equivalence relation over transactions via a normalization function, ensuring that validation and state transitions are invariant under representation-level differences. Additionally, we analyze identifier integrity under quantum collision search (BHT) and provide system-level bounds relative to the active UTXO set. Finally, we prove a no-free-migration result: under purely cryptographic authorization, no transformation of the current UTXO set can simultaneously preserve both safety (no unauthorized spend under quantum adversaries) and liveness (all coins remain spendable), making migration trade-offs unavoidable. This work aims to distinguish between localized constructions and system-wide security guarantees, and to provide a formal foundation for evaluating quantum safety claims at the protocol level.

•Apr 9, 2026•0 citations

Quantum Horizon: An evaluation of quantum computing as a threat to Bitcoin and Ethereum

Iosif M. Gershteyn, Jacob A. Alber

Quantum computing poses a real, broad-based, but bounded and substantially mitigable threat to Bitcoin and Ethereum. We separate the two quantum algorithms that public discussion routinely conflates: Shor's algorithm breaks the elliptic-curve signatures (ECDSA over secp256k1, BLS over BLS12-381) that authorize spending, whereas Grover's algorithm does not meaningfully threaten proof-of-work mining, which is protected by a merely quadratic speedup, fault-tolerant per-operation costs, a square-root parallelization wall, and difficulty adjustment. Folding hardware scaling, the falling resource requirement, a fault-tolerance readiness lag, and expert surveys into a single Monte-Carlo forecast yields a wide, bimodal arrival distribution for a cryptographically relevant quantum computer: about a one-in-six chance by 2035, near 30% by 2040, and about 60% by 2050. Exposure is concentrated and mostly migratable: of Bitcoin's roughly six million quantum-exposed coins only about 2.3 million are irreducibly at risk, while 50 to 65% of Ether sits at key-revealed accounts that can adopt post-quantum signatures. A timely migration beats even an optimistic 2035 machine, so the binding constraint is governance, not technology. A survey of the top twenty cryptocurrencies finds none fully post-quantum. Reproducible models accompany every quantitative claim.

quant-pharXiv:2606.14484•Jun 15, 2026•0 citations

A Systematic Mapping of Quantum Threats and Defenses for Blockchain

Kanokpon Mettasat, Efat Fathalla, Mohamed Azab

Quantum computing poses distinct risks to blockchain security: Shor’s algorithm threatens signatures associated with exposed public keys, while Grover’s algorithm reduces the security margin of hash-based mechanisms. This systematic mapping study examines quantum-resistant blockchain defenses and the evidence supporting their practical use. A total of 387 peer-reviewed primary studies published between 2018 and 2026 were identified through IEEE Xplore, the MDPI journal collection, and citation searching, and classified by contribution type and evidence maturity. The findings show that post-quantum cryptographic constructions dominate the literature (56.1%), followed by quantum-native designs (26.6%) and hybrid migration approaches (13.7%). Despite substantial research on these defenses, only 16.0% of the studies report real-platform laboratory experiments, and 1.3% reach public-testnet evaluation. Hybrid migration studies demonstrate greater progress toward platform-level evaluation than other defense categories, but practical validation remains limited. These findings highlight the gap between proposed quantum-resistant mechanisms and their evaluation under realistic blockchain conditions, emphasizing the need for reproducible system-level testing and migration strategies addressing interoperability, governance, and operational continuity.

Computers•Oct 22, 2026•0 citations

Quantum Attacks on Bitcoin, and How to Protect Against Them

Divesh Aggarwal, Gavin K. Brennen, Troy Lee +2 more

The key cryptographic protocols used to secure the internet and financial transactions of today are all susceptible to attack by the development of a sufficiently large quantum computer. One particular area at risk is cryptocurrencies, a market currently worth over 100 billion USD. We investigate the risk posed to Bitcoin, and other cryptocurrencies, by attacks using quantum computers. We find that the proof-of-work used by Bitcoin is relatively resistant to substantial speedup by quantum computers in the next 10 years, mainly because specialized ASIC miners are extremely fast compared to the estimated clock speed of near-term quantum computers. On the other hand, the elliptic curve signature scheme used by Bitcoin is much more at risk, and could be completely broken by a quantum computer as early as 2027, by the most optimistic estimates. We analyze an alternative proof-of-work called Momentum, based on finding collisions in a hash function, that is even more resistant to speedup by a quantum computer. We also review the available post-quantum signature schemes to see which one would best meet the security and efficiency requirements of blockchain applications.

arXiv:1710.10377•Ledger•Oct 17, 2018•282 citations

Bitcoin Is Quantum Resistant

Logan Ross

Bitcoin has two cryptographic layers. SHA-256 secures mining and the hash chain — it has no periodicity, no rhythm, nothing for the quantum Fourier transform to detect. ECDSA secures signatures — it has rhythm, and Shor's algorithm breaks it. The foundation is quantum resistant. The signatures are not — but signatures are a software upgrade. The hash rate is not. Bitcoin is a shadow-mirror coupling: single hash (shadow, local, independent) coupled to blockchain (mirror, global, irreducible) through proof of work, with a self-regulating coupling constant κ ≈ 128,748 measured across 2,906 days and 12 orders of magnitude. Extended construction from Shadow & Mirror: Complementarity of Computation and Consciousness (Ross, 2026).

•Mar 29, 2026•0 citations
This paper argues that quantum risk in original Bitcoin is layer-specific rather than protocol-uniform. Using the November 2008 pre-release witness as its primary corpus, it separates authorization, proof-of-work, residual-state accounting, and timechain ordering. The clearest Shor-sensitive surface is authorization, where public-key signatures govern spending authority. Proof-of-work belongs to a different problem class: hash-target search, where Grover-class advantage changes search economics without becoming key recovery. Residual spendable state and accepted ordering are not themselves cryptographic secrets, though they may be affected indirectly if authorization or proof-of-work assumptions change. The paper does not claim that original Bitcoin is quantum-proof or provide a production post-quantum migration design. It argues instead that migration discussion should begin only after the protocol layers have been separated.
Public debate on the quantum threat to blockchains—and much of the survey literature—is dominated by chain-level claims that mislocate the risk. We relocate the problem to the level at which an algorithm actually acts, showing that the post-quantum fate of any chain decomposes into three layers: which hardness assumption secures its signatures (Shor-vulnerable discrete-log/factoring, hash, or lattice); that assumption's status under the physically-realizable computational model (classical BPP vs quantum BQP); and the physical floor beneath it—unstructured-search lower bounds and serial-depth constraints, not a claim of unconditional security. At ground zero, the abelian-hidden-subgroup atom is efficiently broken under BQP (Shor), while no efficient BQP break is known for hash or lattice; hash security rests on the most conservative, best-tested conjecture; discrete-log rests on exploitable algebraic structure; and lattice assumptions, though buttressed by worst-case reductions unevenly across the lattice family, carry a much shorter cryptanalytic record. We locate the vulnerability in a single object—the exposed public key—and formalize compromise as a conjunction of exposure, feasibility, and non-revocation. Under a floor assumption (generic, unstructured search stays infeasible) this factors into four conjuncts answering to four distinct authorities—mathematics, the ledger, engineering, and the owner or protocol—with feasibility entailing brokenness. Each per-asset cryptanalytic defense we survey denies the primary one of these four conjuncts—an accounting identity over the four predicates (some defenses touch more than one; we classify by the primary), not a claim of exhaustiveness over an open-ended literature. We give an exposure taxonomy checked against the reference implementations and a first-party, reproducible measurement of the full Bitcoin UTXO set (block 957,269, July 2026): 1.93M BTC (≈9.6% of supply) carries a standing exposed public key—the defensible, structurally unambiguous figure—rising to 5–7M BTC (25–35%) once key-reuse is included, the range's width set by the P2SH/P2WSH script-hash upper bound. This decomposes exactly along the taxonomy's structural-versus-operational axis and quantifies Taproot's hidden-key regression (a directional shift on the exposure axis, minor by value); current resource estimates and a CRQC timeline; and a per-chain migration survey. A recurring result: account and governance architectures migrate most easily while immutable/UTXO chains are hardest—the property prized as a security virtue is the migration handicap. No unconditional security exists; all verdicts are contingent on unproven conjectures and the assumption that BQP is the physical ceiling of computation.
This work presents a formal, state-machine-based treatment of protocol-level quantum safety in Bitcoin under quantum polynomial-time (QPT) adversaries. We model Bitcoin as a deterministic state transition system over the UTXO set and define authorization as a game-based property. We introduce a set of invariants including authorization integrity, no double-spend, and deterministic validation, and formally prove their preservation under valid state transitions. We provide a reduction showing that any unauthorized spend implies either a break of EUF-CMA security of the signature scheme or a violation of hash-based binding properties, in both the classical and quantum random oracle model (QROM), without relying on oracle reprogramming or rewinding techniques. The model explicitly incorporates adversarial network conditions, including mempool observation, transaction reordering, and chain reorganizations, and proves that such capabilities do not enable unauthorized state transitions. We formalize a consensus-semantic equivalence relation over transactions via a normalization function, ensuring that validation and state transitions are invariant under representation-level differences. Additionally, we analyze identifier integrity under quantum collision search (BHT) and provide system-level bounds relative to the active UTXO set. Finally, we prove a no-free-migration result: under purely cryptographic authorization, no transformation of the current UTXO set can simultaneously preserve both safety (no unauthorized spend under quantum adversaries) and liveness (all coins remain spendable), making migration trade-offs unavoidable. This work aims to distinguish between localized constructions and system-wide security guarantees, and to provide a formal foundation for evaluating quantum safety claims at the protocol level.
Quantum computing poses a real, broad-based, but bounded and substantially mitigable threat to Bitcoin and Ethereum. We separate the two quantum algorithms that public discussion routinely conflates: Shor's algorithm breaks the elliptic-curve signatures (ECDSA over secp256k1, BLS over BLS12-381) that authorize spending, whereas Grover's algorithm does not meaningfully threaten proof-of-work mining, which is protected by a merely quadratic speedup, fault-tolerant per-operation costs, a square-root parallelization wall, and difficulty adjustment. Folding hardware scaling, the falling resource requirement, a fault-tolerance readiness lag, and expert surveys into a single Monte-Carlo forecast yields a wide, bimodal arrival distribution for a cryptographically relevant quantum computer: about a one-in-six chance by 2035, near 30% by 2040, and about 60% by 2050. Exposure is concentrated and mostly migratable: of Bitcoin's roughly six million quantum-exposed coins only about 2.3 million are irreducibly at risk, while 50 to 65% of Ether sits at key-revealed accounts that can adopt post-quantum signatures. A timely migration beats even an optimistic 2035 machine, so the binding constraint is governance, not technology. A survey of the top twenty cryptocurrencies finds none fully post-quantum. Reproducible models accompany every quantitative claim.
Quantum computing poses distinct risks to blockchain security: Shor’s algorithm threatens signatures associated with exposed public keys, while Grover’s algorithm reduces the security margin of hash-based mechanisms. This systematic mapping study examines quantum-resistant blockchain defenses and the evidence supporting their practical use. A total of 387 peer-reviewed primary studies published between 2018 and 2026 were identified through IEEE Xplore, the MDPI journal collection, and citation searching, and classified by contribution type and evidence maturity. The findings show that post-quantum cryptographic constructions dominate the literature (56.1%), followed by quantum-native designs (26.6%) and hybrid migration approaches (13.7%). Despite substantial research on these defenses, only 16.0% of the studies report real-platform laboratory experiments, and 1.3% reach public-testnet evaluation. Hybrid migration studies demonstrate greater progress toward platform-level evaluation than other defense categories, but practical validation remains limited. These findings highlight the gap between proposed quantum-resistant mechanisms and their evaluation under realistic blockchain conditions, emphasizing the need for reproducible system-level testing and migration strategies addressing interoperability, governance, and operational continuity.
The key cryptographic protocols used to secure the internet and financial transactions of today are all susceptible to attack by the development of a sufficiently large quantum computer. One particular area at risk is cryptocurrencies, a market currently worth over 100 billion USD. We investigate the risk posed to Bitcoin, and other cryptocurrencies, by attacks using quantum computers. We find that the proof-of-work used by Bitcoin is relatively resistant to substantial speedup by quantum computers in the next 10 years, mainly because specialized ASIC miners are extremely fast compared to the estimated clock speed of near-term quantum computers. On the other hand, the elliptic curve signature scheme used by Bitcoin is much more at risk, and could be completely broken by a quantum computer as early as 2027, by the most optimistic estimates. We analyze an alternative proof-of-work called Momentum, based on finding collisions in a hash function, that is even more resistant to speedup by a quantum computer. We also review the available post-quantum signature schemes to see which one would best meet the security and efficiency requirements of blockchain applications.
Bitcoin has two cryptographic layers. SHA-256 secures mining and the hash chain — it has no periodicity, no rhythm, nothing for the quantum Fourier transform to detect. ECDSA secures signatures — it has rhythm, and Shor's algorithm breaks it. The foundation is quantum resistant. The signatures are not — but signatures are a software upgrade. The hash rate is not. Bitcoin is a shadow-mirror coupling: single hash (shadow, local, independent) coupled to blockchain (mirror, global, irreducible) through proof of work, with a self-regulating coupling constant κ ≈ 128,748 measured across 2,906 days and 12 orders of magnitude. Extended construction from Shadow & Mirror: Complementarity of Computation and Consciousness (Ross, 2026).