Abstract
Nakamoto doublespend strategy, described in Bitcoin foundational article, leads to total ruin with positive probability. The simplest strategy that avoids this risk incorporates a stopping threshold when success is unlikely. We compute the exact profitability and the minimal double spend that is profitable for this strategy. For a given amount of the transaction, we determine the minimal number of confirmations to be requested by the recipient that makes the double-spend strategy non-profitable. This number of confirmations is only 1 or 2 for average transactions and for a small relative hashrate of the attacker. This is substantially lower than the original Nakamoto number, which is about six confirmations and is widely used. Nakamoto analysis is only based on the success probability of the attack instead of on a profitability analysis that we carry out.
Publisher
Cambridge University Press (CUP)
Subject
Industrial and Manufacturing Engineering,Management Science and Operations Research,Statistics, Probability and Uncertainty,Statistics and Probability
Reference20 articles.
1. 18. Rosenfeld, M. (2014). Analysis of hashrate-based double spending, arXiv:1402.2009v1.
2. 2. Bissias, G. , Levine, B.N. , Ozisik, A.P. , & Andresen, G. (2016). An analysis of attacks on blockchain consensus, arXiv:1610.07985.
3. A combinatorial-probabilistic analysis of bitcoin attacks
4. Conditional Expectation of the Duration in the Classical Ruin Problem
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献