A Combinatorial-Probabilistic Analysis of Bitcoin Attacks
arXiv:1808.05255
Abstract
Using Wilf-Zeilberger algorithmic proof theory, we continue pioneering work of Meni Rosenfeld (followed up by interesting work by Cyril Grunspan and Ricardo Perez-Marco) and study the probability and duration of successful bitcoin attacks, but using an equivalent, and much more congenial, formulation as a certain two-phase soccer match.
8 pages; Accompanied by a Maple package and outputs filed obtainable from http://sites.math.rutgers.edu/~zeilberg/mamarim/mamarimhtml/bitcoin.html (Added: proof provenance about the negative binomial distribution.)