论文信息 - Bitcoin Selfish Mining and Dyck Words

Bitcoin Selfish Mining and Dyck Words

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.

Cyril Grunspan | Ricardo Pérez-Marco

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

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

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

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

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

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

[7] 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).