ABSTRACT In 2008, Satoshi Nakamoto famously invented bitcoin, and in his (or her, or their, or its) white paper sketched an approximate formula for the probability of a successful double spending attack by a dishonest party. This was corrected by Meni Rosenfeld, who, under more realistic assumptions, gave the exact probability (missing a foundational proof); and another formula (along with foundational proof), in terms of the Incomplete Beta function, was given later by Cyril Grunspan and Ricardo Pérez-Marco, that enabled them to derive an asymptotic formula for that quantity. Using Wilf-Zeilberger algorithmic proof theory, we continue in this vein and present a recurrence equation for the above-mentioned probability of success, that enables a very fast compilation of these probabilities. We next use this recurrence to derive (in algorithmic fashion) higher-order asymptotic formulas, extending the formula of Grunspan and Pérez-Marco who did the leading term. We then study the statistical properties (expectation, variance, etc.) of the duration of a successful attack.
[1]
Charles M. Grinstead,et al.
Introduction to probability
,
1999,
Statistics for the Behavioural Sciences.
[2]
Saulo Alves de Araujo,et al.
Identification of novel keloid biomarkers through Profiling of Tissue Biopsies versus Cell Cultures in Keloid Margin specimens Compared to adjacent Normal Skin
,
2010,
Eplasty.
[3]
Meni Rosenfeld,et al.
Analysis of Hashrate-Based Double Spending
,
2014,
ArXiv.
[4]
Feller William,et al.
An Introduction To Probability Theory And Its Applications
,
1950
.
[5]
Mauro Conti,et al.
A Survey on Security and Privacy Issues of Bitcoin
,
2017,
IEEE Communications Surveys & Tutorials.
[6]
Doron Zeilberger,et al.
The Method of Creative Telescoping
,
1991,
J. Symb. Comput..
[7]
Nancy A. Lynch,et al.
Impossibility of distributed consensus with one faulty process
,
1983,
PODS '83.