2019/02/05 by Cyril Grunspan, Ricardo Pérez-Marco, Grunspan, Cyril +1
Computer Science · #60G40 #68M01 #91A60 #Blockchain Technology Applications and Security #Combinatorics (math.CO) #Cryptography and Data Security #Cryptography and Security (cs.CR) #FOS: Computer and information sciences #FOS: Mathematics #Optimization and Search Problems #Probability (math.PR)
paper · pdf · doi:10.48550/arxiv.1902.01513
openalex publication_date 2019/02/05 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We give a straightforward proof for the formula giving the long-term apparent hashrate of the Selfish Mining strategy in Bitcoin using only elementary probabilities and combinatorics, and more precisely, Dyck words. There is no need to compute stationary probabilities on Markov chain nor stopping times for Poisson processes as it was previously done. We consider also several other block withholding strategies.