Autor:	Georgiadis, Evangelos, Zeilberger, Doron
Rok vydání:	2018
Předmět:	Mathematics - Combinatorics Computer Science - Cryptography and Security
Druh dokumentu:	Working Paper
Popis:	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. Comment: 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.)
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/1808.05255 Zobrazit plný text záznamu View this record from Arxiv