On profitability of selfish mining
arXiv:1805.08281
Abstract
We review the so called selfish mining strategy in the Bitcoin network and compare its profitability to honest mining.We build a rigorous profitability model for repetition games. The time analysis of the attack has been ignored in the previous literature based on a Markov model,but is critical. Using martingale's techniques and Doob Stopping Time Theorem we compute the expected duration of attack cycles. We discover a remarkable property of the bitcoin network: no strategy is more profitable than the honest strategy before a difficulty adjustment. So selfish mining can only become profitable afterwards, thus it is an attack on the difficulty adjustment algorithm. We propose an improvement of Bitcoin protocol making it immune to selfish mining attacks. We also study miner's attraction to selfish mining pools. We calculate the expected duration time before profit for the selfish miner, a computation that is out of reach by the previous Markov models.
Added 2 more sections and pictures. 20 pages, 4 figures
References in corpus (1)
Cited by in corpus (9)
- Agent-Based Simulations of Blockchain protocols illustrated via Kadena's Chainweb
- On Profitability of Nakamoto double spend
- On Profitability of Trailing Mining
- On profitability of stubborn mining
- On the profitability of selfish blockchain mining under consideration of ruin
- A New Theoretical Framework of Pyramid Markov Processes for Blockchain Selfish Mining
- Bitcoin Selfish Mining and Dyck Words
- The Convergence Rates of Blockchain Mining Games: A Markovian Approach
- Security Analysis of Distributed Ledgers and Blockchains through Agent-based Simulation