Double spend races
From MaRDI portal
Publication:4645331
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.
Recommendations
Cites work
Cited in
(10)- A mean field game approach to bitcoin mining
- A note on optimal double spending attacks
- Determining the number of confirmation blocks in a two-level blockchain with proof-of-proof consensus protocol for different consensus types in mainchain/sidechain to prevent double spend attack. I: PoS in mainchain and PoW in sidechain
- On profitability of Nakamoto double spend
- BLOCKCHAIN DOUBLE-SPEND ATTACK DURATION
- A combinatorial-probabilistic analysis of bitcoin attacks
- Cryptocurrency and double spending history: transactions with zero confirmation
- Fraud risk assessment within blockchain transactions
- Probability of double spend attack for network with non-zero time delay
- Blockchain and cryptocurrencies: economic and financial research
This page was built for publication: Double spend races
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4645331)