Double spend races

Abstract

We correct the double spend race analysis given in Nakamoto's foundational Bitcoin article and give a closed-form formula for the probability of success of a double spend attack using the Regularized Incomplete Beta Function. We give a proof of the exponential decay on the number of confirmations, often cited in the literature, and find an asymptotic formula. Larger number of confirmations are necessary compared to those given by Nakamoto. We also compute the probability conditional to the known validation time of the blocks. This provides a finer risk analysis than the classical one.

35 pages, 5 figures, 7 tables. Final published version

References in corpus (2)

• Analysis of Hashrate-Based Double Spending
• Bitcoin and Decentralized Trust Protocols

Cited by in corpus (9)

• Attract More Miners to Join in Blochchain Construction for Internet of Things
• On profitability of selfish mining
• On Profitability of Nakamoto double spend
• On Profitability of Trailing Mining
• On Cyber Risk Management of Blockchain Networks: A Game Theoretic Approach
• On profitability of stubborn mining
• Ant Routing scalability for the Lightning Network
• A Mean Field Game Analysis of Consensus Protocol Design
• A Logic of Blockchain Updates