A Combinatorial-Probabilistic Analysis of Bitcoin Attacks
Evangelos Georgiadis, Doron Zeilberger
TL;DR
This paper applies combinatorial and probabilistic methods, specifically the Wilf-Zeilberger algorithm, to analyze the probability and duration of successful Bitcoin attacks, using an innovative soccer match analogy.
Contribution
It introduces a novel combinatorial-probabilistic framework for Bitcoin attack analysis, building on prior work with a new soccer match analogy for better understanding.
Findings
Derived new probabilistic models for attack success
Quantified attack duration probabilities
Enhanced understanding of attack dynamics
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsBlockchain Technology Applications and Security · Distributed systems and fault tolerance · Cryptography and Data Security