Double spend races

DOI10.1142/S021902491850053XMaRDI QIDQ4645331zbMATH OpenFDO

Authors Cyril Grunspan, Ricardo Pérez-Marco

Publication date 10 January 2019

Published in International Journal of Theoretical and Applied Finance (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1702.02867

zbMATH Keywords

bitcoinblockchaindouble spendminingproof-of-workregularized incomplete beta function

Mathematics Subject Classification ID

Theory of data (68P99) Actuarial science and mathematical finance (91G99)

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

• On profitability of Nakamoto double spend
• A combinatorial-probabilistic analysis of bitcoin attacks
• Fraud risk assessment within blockchain transactions
• A note on optimal double spending attacks
• The Bitcoin backbone protocol with chains of variable difficulty

Cites work

• Asymptotic expansion Of the incomplete beta function for large values Of the first parameter
• Bitcoin and decentralised trust protocols
• scientific article; zbMATH DE number 3349081 (Why is no real title available?)
• Some Elementary Inequalities Relating to the Gamma and Incomplete Gamma Function

Cited in

(15)

• A note on optimal double spending attacks
• Blockchain and cryptocurrencies: economic and financial research
• A combinatorial-probabilistic analysis of bitcoin attacks
• On profitability of Nakamoto double spend
• BLOCKCHAIN DOUBLE-SPEND ATTACK DURATION
• Fraud risk assessment within blockchain transactions
• Probability of double spend attack for network with non-zero time delay
• Cryptocurrency and double spending history: transactions with zero confirmation
• 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
• A mean field game approach to bitcoin mining
• Binomial distribution with delay in analysis and parametrization of Ouroboros Praos proof of stake blockchain protocol
• Trust at scale: the economic limits of cryptocurrencies and blockchains
• Simulating a simplified version of a splitting attack on the blockchain based on the proof-of-stake consensus protocol
• Profit lag and alternate network mining
• 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-spending attack. II: PoW in mainchain/PoS in sidechain

Describes a project that uses

Uses Software

• DLMF

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)