Cyril Grunspan creator text xx 2019 monographic ng

print

The main goal of this article is to present a direct approach for the formula giving the long-term apparent hashrates of Selfish Mining strategies using only elementary probabilities and combinatorics, more precisely, Dyck words. We can avoid computing stationary probabilities on Markov chain, nor stopping times for Poisson processes as in previous analysis. We do apply these techniques to other block withholding strategies in Bitcoin, and then, we consider also selfish mining in Ethereum. Open access — freely available to read. https://arxiv.org/pdf/1904.07675v1 https://arxiv.org/pdf/1904.07675v1 Open access — freely available to read. 250101 20260901030338.0