Bitcoin Selfish Mining and Dyck Words

02/05/2019
by   Cyril Grunspan, et al.
0

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.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset