A Combinatorial-Probabilistic Analysis of Bitcoin Attacks

By Evangelos Georgiadis and Doron Zeilberger

.pdf   .ps   .tex

[Appeared in Journal of Difference Equations and its Applications, volume 25, issue 1 (2019), 56-63.]

First Written: Aug. 15, 2018;
Last update of this webpage: Nov. 23, 2018.

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.

Added Sept. 7, 2018: watch the lecture:

  • vimeo: part 1   part 2     (videotaped and uploaded by Mingjia Yang).
  • youtube: part 1   part 2    
    ( uploaded by Edinah Gnang).

  • Added Nov. 4, 2018: Read Version 2
    Added Nov. 11, 2018: Read Version 3

    Maple packages

    Sample Input and Output for Bitcoin.txt

    Articles of Doron Zeilberger

    Doron Zeilberger's Home Page