00991nam a2200169 a 4500 20260901030338.0 250101s2019 xx o 000 0 eng d Cyril Grunspan Selfish Mining and Dyck Words in Bitcoin and Ethereum Networks arXiv 2019 text online resource 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 Read the full paper (PDF) ERES 656 656 0 0 0 3 CYB MAIN MAIN SCICOMP 2026-09-01 0 YGE000917 2026-09-01 03:03:38 https://arxiv.org/pdf/1904.07675v1 2026-09-01 PAPER