Selfish Mining and Dyck Words in Bitcoin and Ethereum Networks

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.

[1]  Cyril Grunspan,et al.  On profitability of selfish mining , 2018, ArXiv.

[2]  Alf Zugenmaier,et al.  The Impact of Uncle Rewards on Selfish Mining in Ethereum , 2018, 2018 IEEE European Symposium on Security and Privacy Workshops (EuroS&PW).

[3]  T. Koshy.  Catalan Numbers with Applications , 2008 .

[4]  Satoshi Nakamoto.  Bitcoin : A Peer-to-Peer Electronic Cash System , 2009 .

[5]  Kartik Nayak,et al.  Stubborn Mining: Generalizing Selfish Mining and Combining with an Eclipse Attack , 2016, 2016 IEEE European Symposium on Security and Privacy (EuroS&P).

[6]  Emin Gün Sirer,et al.  Majority Is Not Enough: Bitcoin Mining Is Vulnerable , 2013, Financial Cryptography.

[7]  Cyril Grunspan,et al.  On profitability of stubborn mining , 2018, ArXiv.

[8]  Aviv Zohar,et al.  Secure High-Rate Transaction Processing in Bitcoin , 2015, Financial Cryptography.

[9]  Cyril Grunspan,et al.  On Profitability of Trailing Mining , 2018, ArXiv.

[10]  Cyril Grunspan,et al.  Selfish Mining in Ethereum , 2019, ArXiv.