Strategies for quantum-enabled Bitcoin miners

AI summary

Overview

Research area: Quantum computing and cryptocurrency security — specifically game theory applied to quantum Bitcoin mining and the 51% attack threshold of Proof-of-Work networks.

Technical level: Advanced. The paper assumes familiarity with Grover's algorithm, quantum search, Nash equilibria and mixed-strategy game theory, and Bitcoin protocol internals (block headers, nonces, Merkle roots, difficulty targets).

Scope (one sentence): The paper extends an existing game-theoretic model of quantum Bitcoin mining to two non-colluding, aggressive quantum miners with multiple measurement opportunities, computes their optimal strategies, and assesses how those strategies shift the network's 51% attack threshold.

What This Paper Is About

Bitcoin's security rests on the assumption that no group can afford to control most of the network's hashing power. Grover's algorithm offers a theoretical quadratic speedup for the underlying hash search, and Sattath's "aggressive quantum mining strategy" can raise the rate of temporary forks, which classically lowers the cost of a 51% attack. Prior work modeled quantum miners under narrow assumptions — a peaceful strategy and exactly one quantum computation per race. This paper asks what happens when two quantum miners hidden in an otherwise classical network compete against each other, may perform many quantum measurements between blocks, may restart their search after a failed measurement, and play optimally.

Key Contributions

1. A broader adversarial model of quantum mining. The authors generalize the game-theoretic framework of Lee et al. so that a quantum miner can perform up to c quantum computations and spend up to an arbitrary budget κ of Grover iterations across those computations, replacing the earlier restriction of c = 1 and κ = k_opt (the iteration count that maximizes single-search success probability for partially inverting SHA-256).

2. Inclusion of the Aggressive Quantum Mining Strategy (AQMS). Sattath's aggressive strategy is built directly into the payoff-matrix construction, alongside the Peaceful Quantum Mining Strategy (PQMS), rather than being excluded from the model.

3. A restart-realistic treatment of quantum search. Rather than assuming a measurement must succeed, the model permits the quantum miners to restart their search when a measurement fails to yield a valid block, which the authors identify as the realistic case and as a point of departure from prior work.

4. Equilibrium computation plus network simulation. Optimal strategies are computed as Nash equilibria of the two-player game via the Lemke-Howson algorithm and then simulated inside a model of the Bitcoin network to quantify the resulting stale rate and 51% attack threshold.

Main Findings

• Negligible change to the 51% attack threshold. The paper's headline result is that the optimal quantum mining strategies determined under the extended model have a negligible effect on the 51% attack threshold. Specific threshold values are not reported in the available text of this paper (the numerical results in §IV fall outside the supplied content).

• Optimal strategies are derived from payoff matrices, not assumed. The optimal strategies for two non-colluding, aggressive quantum miners are obtained as Nash equilibria — strategy profiles in which neither miner can increase its expected payoff by deviating alone — computed with the Lemke-Howson algorithm, which returns an exact equilibrium for two-player games.

• Aggressive mining is treated as a fork-rate lever. The paper frames the aggressive quantum mining strategy as a mechanism that increases the rate of temporary forks in the blockchain, and notes that classically a higher fork rate is a known security issue because it decreases the cost of a successful 51% attack.

• Restart opportunities matter for the model, not for the attack threshold. Allowing multiple quantum computations and restarts is presented as the main novelty relative to prior work (which fixed c = 1 and κ = k_opt), yet the resulting equilibria still leave the attack threshold essentially unchanged.

• Fork statistics are characterized probabilistically. The simulation framework records blocks mined and forks observed per simulated day and derives stale-rate percentiles (95th and 99th), the empirical probability that the stale rate exceeds 1/3 on any given day, and an empirical detection probability for spotting quantum miners against a null hypothesis of no quantum miners. The numeric values of these quantities are not reported in the supplied text.

Methodology in Plain English

The authors treat mining as a two-player game between Alice and Bob, two quantum miners embedded in a network where everyone else mines classically.

1. Formalize the search. Bitcoin mining is posed as a bounded search problem: with the block header fixed except for the 32-bit nonce, a miner must find a nonce such that the double SHA-256 hash of the header falls below the difficulty target. Classically this is brute force over 2^32 nonces; a quantum miner instead applies Grover's algorithm, whose success probability depends on how many iterations k it uses.

2. Define each player's options. A pure strategy is a specification of how many Grover iterations the miner performs for each of its measurements. With up to c measurement opportunities and a total iteration budget κ, the strategy set S_0^c is large, so the authors work with a sampled subset of iteration counts (n_q samples) to keep the payoff matrices computable.

3. Build payoff matrices. For each measurement opportunity, payoff matrices are assembled from the outcomes of the players' Grover measurements, including the aggressive-strategy matrices and the possibility that a player's earlier measurements failed (tracked through cumulative failure probabilities). Alice's and Bob's matrices are indexed by row and column strategy indices.

4. Solve for equilibria. The Lemke-Howson algorithm is applied to the resulting two-player game to obtain exact Nash equilibria, i.e., the mixed strategies that constitute the optimal quantum mining strategies.

5. Simulate the network. Those equilibrium strategies are then deployed in a Bitcoin network simulation over n_s simulated days, counting blocks and forks per day, converting fork counts into a stale rate, and comparing against the classical baseline. Detection statistics (p-values per simulated day under the null hypothesis that no quantum miners are present) test whether the presence of quantum miners would be observable.

6. Relate forks to attack cost. Finally, the stale rate is connected back to the 51% attack threshold, and the paper sets out to identify the conditions under which a 51% attack becomes feasible in the presence of quantum miners.

Why This Matters

Impact on research. Prior studies established that Grover's algorithm could in principle lower the cost of a 51% attack, but only under narrow adversarial models. This paper closes the gap by modeling behavior that reflects how quantum mining would actually be performed — repeated measurements, failed-measurement restarts, and aggressive forking — and shows the practical threat to the attack threshold is negligible. It also connects the quantum-mining literature to the broader quantum-threat literature (for example Kiktenko et al. on signatures and hashing, Babbush et al. on Shor-based attacks on Bitcoin's signature scheme, and Dallaire-Demers and BTQ Technologies on the extraordinary power requirements of quantum mining).

Real-world applications.

• Assessing whether Proof-of-Work cryptocurrencies need protocol changes in anticipation of scalable quantum computers.
• Informing mining operators and pools about whether investing in quantum mining hardware would confer a strategic advantage.
• Designing network monitoring that could detect quantum miners, using the detection-probability analysis and per-day p-values against the no-quantum-miner null hypothesis.
• Estimating how fork/stale rates would shift if quantum miners were present, which bears on reward calculations and orphan-block economics.

Industry relevance. Mining pools, ASIC manufacturers, blockchain security firms and cryptocurrency exchanges all depend on assumptions about hashrate concentration and attack costs. The result that optimal quantum strategies barely move the 51% threshold is directly relevant to how urgently the industry should treat quantum mining — as distinct from quantum attacks on elliptic-curve signatures, which the paper cites as a separate and more resource-efficient threat.

Future Directions

• More than two quantum miners, and collusion. The model assumes exactly two non-colluding, aggressive quantum miners; extending to larger populations of quantum miners, or to miners that coordinate, is a natural and open extension.
• Combining with other strategic behaviors. The paper situates aggressive quantum mining alongside selfish mining as a deliberate fork-generating strategy; analyzing quantum versions of selfish mining and related withholding strategies remains open.
• Refining cost and resource estimates. The threat assessment here is about the attack threshold, not about the energy and hardware cost of quantum mining, which Dallaire-Demers and BTQ Technologies argue is extraordinary; integrating those resource constraints into the payoff structure would sharpen the practical threat picture.
• Beyond Bitcoin. Because the result is framed as relevant to any Proof-of-Work cryptocurrency, applying the same equilibrium-plus-simulation pipeline to other PoW chains and other hash functions used for mining is a direct next step.

Target Audience

Quantum computing and quantum-algorithms researchers interested in cryptographic applications; blockchain security analysts and protocol designers evaluating quantum risk to Proof-of-Work consensus; game theorists working on equilibrium analysis of mining and consensus games; and technically sophisticated members of the mining and cryptocurrency industry who need to distinguish quantum mining threats from quantum signature-breaking threats.

Authors’ abstract

We study the impact that two miners equipped with quantum computers purpose-built for quantum Bitcoin mining will have on the 51% attack threshold of the Bitcoin network, given that the miners are playing a competitive game against each other to be the first to mine a block. We extend an existing game-theoretic framework for Bitcoin mining and compute the resultant payoff matrices. From these payoff matrices, we determine optimal quantum mining strategies for two non-colluding and aggressive quantum miners with multiple opportunities at finding a valid block in an otherwise classical Bitcoin network. We show that these optimal quantum mining strategies have a negligible effect on the 51% attack threshold. The novelty of our work is the inclusion of the Aggressive Quantum Mining Strategy and the realistic approach of allowing the quantum miners to restart their search if their measurements do not yield a valid block when determining the optimal quantum mining strategies. Our result is important for evaluating quantum-mining threats on cryptocurrencies based on Proof-of-Work, e.g. Bitcoin