AI 中文总结
研究两台量子计算机比特币矿工竞争挖矿对网络51%攻击阈值的影响,扩展博弈论框架计算收益矩阵,确定最优量子挖矿策略,其对攻击阈值影响可忽略,结果有助于评估量子挖矿威胁。
AI 中文摘要
我们研究了两台专门为量子比特币挖矿配备量子计算机的矿工,在相互竞争以率先挖出一个区块的情况下,对比特币网络51%攻击阈值的影响。我们扩展了现有的比特币挖矿博弈论框架并计算了收益矩阵。从这些矩阵中,我们确定了两个非勾结且激进的量子矿工在经典比特币网络中多次寻找有效区块机会下的最优量子挖矿策略。我们表明这些策略对51%攻击阈值影响可忽略不计。我们工作的新颖之处在于包含激进量子挖矿策略以及在确定最优策略时允许量子矿工在测量未产生有效区块时重新搜索的现实方法。我们的结果对于评估基于工作量证明的加密货币(如比特币)的量子挖矿威胁很重要。
英文摘要
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
Comments53 pages, 17 figures. Code available at https://github.com/zachmanson/quantumraces