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 bockwithholding strategies in Bitcoin, and then, we consider also selfish mining in Ethereum.
@InProceedings{grunspan_et_al:OASIcs.Tokenomics.2019.11, author = {Grunspan, Cyril and P\'{e}rez-Marco, Ricardo}, title = {{Selfish Mining and Dyck Words in Bitcoin and Ethereum Networks}}, booktitle = {International Conference on Blockchain Economics, Security and Protocols (Tokenomics 2019)}, pages = {11:1--11:10}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-95977-108-5}, ISSN = {2190-6807}, year = {2020}, volume = {71}, editor = {Danos, Vincent and Herlihy, Maurice and Potop-Butucaru, Maria and Prat, Julien and Tucci-Piergiovanni, Sara}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.Tokenomics.2019.11}, URN = {urn:nbn:de:0030-drops-119755}, doi = {10.4230/OASIcs.Tokenomics.2019.11}, annote = {Keywords: Bitcoin, Blockchain, Ethereum, Proof-of-Work, Selfish Mining, Stubborn Mining, Apparent Hashrate, Revenue Ratio, Catalan Distributions, Dyck Words, Random Walk} }
Feedback for Dagstuhl Publishing