HackerPapers

arXiv:1808.05255math.CO

A Combinatorial-Probabilistic Analysis of Bitcoin Attacks

Evangelos Georgiadis, Doron Zeilberger

HN submission. Found in a submission link or body. Submitters do not count as commenters in the main ranking; a submission is not an endorsement.

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.

arXiv comments
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.)
Journal reference
DOI
Subjects
math.COCombinatorics cs.CRCryptography and Security

On Hacker News

No comments linking this paper were found in the collected sources. Found in 1 HN submission from Aug 2018 to Aug 2018. Open submission discussions.

Comments linking this paper, per year.

Discussed in comments0 threads

No comments linking this paper were found in the collected sources. Open submission discussions.

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.