A Combinatorial-Probabilistic Analysis of Bitcoin Attacks

08/15/2018

∙

by   Evangelos Georgiadis, et al.

∙

0

∙

share

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.