v1v2 (latest)
A Combinatorial-Probabilistic Analysis of Bitcoin Attacks

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.
View on arXivComments on this paper