Bitcoin Selfish Mining and Dyck Words

Cyril Grunspan, Ricardo Pérez-Marco

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.

Knowledge Graph

arrow_drop_up

Comments

Sign up or login to leave a comment