Table of Links Abstract and I. Introduction A. Quantum Bitcoin Mining B. Our Contribution C. Comparison with Related Works D. Conventions II. Background A. Bitcoin Basics B. Bitcoin Security C. Grover’s Search Algorithm D. Quantum Attacks III. Approach A. Algorithm B. Markov Chain C. Assumptions and Approximations IV. Results A. Probability of Success B. Performance Measures C. Example Application V. Discussion, Acknowledgments, and References D. Quantum Attacks In [4], Aggarwal et al. analyze the effect of quantum computation on the security of Bitcoin. As part of this analysis, they calculate the number of qubits and gate speed a quantum computer would need to dominate the Bitcoin network’s computing power and, as a result, be capable of a 51% attack. Using this analysis, they predict that “it will be some time before quantum computers out compete classical machines for this task and when they do, a single quantum computer will not have majority hashing power.” The analysis accounts for both parallelization of Grover’s search and the overhead from quantum error correction. In [21], Sattath takes a different approach to the determining the implications of quantum computing to Bitcoin security. He shows that the properties of quantum Bitcoin mining lead to security risks even if no single miner dominates the networks computing power. This reduction in security comes from stale blocks. If a quantum miner receives a block midway through performing Grover’s search algorithm, they can perform a measurement of their quantum register, and with probability higher than random guessing, mine a block. This procedure is called aggressive mining, whereas peaceful mining refers to the procedure in which the quantum miner ends their search if they learn of another block. If many quantum miners follow an aggressive procedure, then with higher probability than classically, two blocks are found at nearly the same time by different miners, creating many stale blocks. This result is important because it shows quantum mining poses security risks simply because the process of quantum mining is different than classical mining, not because quantum mining is more effective. Sattath conjectures that if quantum miners must commit to the number of Grover iterations they will apply before measuring, then the stale block rates are minimal. He proposes a change in the Bitcoin protocol that would force quantum miners to decide before they begin mining a block how many Grover iterations they will apply. This change in protocol is incompatible with proposed fixes for insecurities arising from selfish mining techniques [8]. Determining the rate of stale blocks with Sattath’s proposed change is a challenging game theory question. This question is addressed in [17], where Lee et al. analyze a class of games they call quantum races in which multiple quantum capable players compete to solve a computational problem first. In many cases, they confirm Sattath’s conjecture of low stale block rates. Authors:
(1) Robert R. Nerem, Institute for Quantum Science and Technology, University of Calgary, Alberta T2N 1N4, Canada (riley.nerem@gmail.com);
(2) Daya R. Gaur, Department of Mathematics and Computer Science, University of Lethbridge, Alberta T1K 3M4, Canada. This paper is available on arxiv under CC BY 4.0 DEED license. Table of Links Abstract and I. Introduction Abstract and I. Introduction Abstract and I. Introduction A. Quantum Bitcoin Mining A. Quantum Bitcoin Mining B. Our Contribution B. Our Contribution C. Comparison with Related Works C. Comparison with Related Works D. Conventions D. Conventions II. Background II. Background A. Bitcoin Basics A. Bitcoin Basics B. Bitcoin Security B. Bitcoin Security C. Grover’s Search Algorithm C. Grover’s Search Algorithm D. Quantum Attacks D. Quantum Attacks III. Approach III. Approach III. Approach A. Algorithm A. Algorithm B. Markov Chain B. Markov Chain C. Assumptions and Approximations C. Assumptions and Approximations IV. Results IV. Results A. Probability of Success A. Probability of Success B. Performance Measures B. Performance Measures C. Example Application C. Example Application V. Discussion, Acknowledgments, and References V. Discussion, Acknowledgments, and References V. Discussion, Acknowledgments, and References D. Quantum Attacks In [4], Aggarwal et al. analyze the effect of quantum computation on the security of Bitcoin. As part of this analysis, they calculate the number of qubits and gate speed a quantum computer would need to dominate the Bitcoin network’s computing power and, as a result, be capable of a 51% attack. Using this analysis, they predict that “it will be some time before quantum computers out compete classical machines for this task and when they do, a single quantum computer will not have majority hashing power.” The analysis accounts for both parallelization of Grover’s search and the overhead from quantum error correction. In [21], Sattath takes a different approach to the determining the implications of quantum computing to Bitcoin security. He shows that the properties of quantum Bitcoin mining lead to security risks even if no single miner dominates the networks computing power. This reduction in security comes from stale blocks. If a quantum miner receives a block midway through performing Grover’s search algorithm, they can perform a measurement of their quantum register, and with probability higher than random guessing, mine a block. This procedure is called aggressive mining, whereas peaceful mining refers to the procedure in which the quantum miner ends their search if they learn of another block. If many quantum miners follow an aggressive procedure, then with higher probability than classically, two blocks are found at nearly the same time by different miners, creating many stale blocks. This result is important because it shows quantum mining poses security risks simply because the process of quantum mining is different than classical mining, not because quantum mining is more effective. Sattath conjectures that if quantum miners must commit to the number of Grover iterations they will apply before measuring, then the stale block rates are minimal. He proposes a change in the Bitcoin protocol that would force quantum miners to decide before they begin mining a block how many Grover iterations they will apply. This change in protocol is incompatible with proposed fixes for insecurities arising from selfish mining techniques [8]. Determining the rate of stale blocks with Sattath’s proposed change is a challenging game theory question. This question is addressed in [17], where Lee et al. analyze a class of games they call quantum races in which multiple quantum capable players compete to solve a computational problem first. In many cases, they confirm Sattath’s conjecture of low stale block rates. Authors: (1) Robert R. Nerem, Institute for Quantum Science and Technology, University of Calgary, Alberta T2N 1N4, Canada (riley.nerem@gmail.com); (2) Daya R. Gaur, Department of Mathematics and Computer Science, University of Lethbridge, Alberta T1K 3M4, Canada. Authors: Authors: (1) Robert R. Nerem, Institute for Quantum Science and Technology, University of Calgary, Alberta T2N 1N4, Canada (riley.nerem@gmail.com); (2) Daya R. Gaur, Department of Mathematics and Computer Science, University of Lethbridge, Alberta T1K 3M4, Canada. This paper is available on arxiv under CC BY 4.0 DEED license. This paper is available on arxiv under CC BY 4.0 DEED license. available on arxiv available on arxiv

Part of HackerNoon's growing list of open-source research papers, promoting free access to academic material.

The Risks of Quantum Mining: What Bitcoin Users Need to Know

About Author

Comments

TOPICS

THIS ARTICLE WAS FEATURED IN

Related Stories

5 Ways to Measure Privacy Risks in Text Data

The Noonification: 2023 Was the Best Time to Accumulate Crypto (1/1/2024)

The Noonification: The Bitcoin Mining Writing Contest by GoMining (1/14/2024)

The Noonification: A Taxonomy of Inclusiveness (1/11/2024)

08/06/2018: Biggest Stories in the Cryptosphere

The Noonification: Much Ado About Bitcoin Halving (1/6/2024)

5 Ways to Measure Privacy Risks in Text Data

The Noonification: 2023 Was the Best Time to Accumulate Crypto (1/1/2024)

The Noonification: The Bitcoin Mining Writing Contest by GoMining (1/14/2024)

The Noonification: A Taxonomy of Inclusiveness (1/11/2024)

08/06/2018: Biggest Stories in the Cryptosphere

The Noonification: Much Ado About Bitcoin Halving (1/6/2024)

Light-Mode

Classic

Newspaper

Dark-Mode

Neon Noir

Minty

HN StartUps