English

Competing (Semi)-Selfish Miners in Bitcoin

Computer Science and Game Theory 2019-06-12 v1 Cryptography and Security

Abstract

The Bitcoin protocol prescribes certain behavior by the miners who are responsible for maintaining and extending the underlying blockchain; in particular, miners who successfully solve a puzzle, and hence can extend the chain by a block, are supposed to release that block immediately. Eyal and Sirer showed, however, that a selfish miner is incentivized to deviate from the protocol and withhold its blocks under certain conditions. The analysis by Eyal and Sirer, as well as in followup work, considers a \emph{single} deviating miner (who may control a large fraction of the hashing power in the network) interacting with a remaining pool of honest miners. Here, we extend this analysis to the case where there are \emph{multiple} (non-colluding) selfish miners. We find that with multiple strategic miners, specific deviations from honest mining by multiple strategic agents can outperform honest mining, even if individually miners would not be incentivised to be dishonest. This previous point effectively renders the Bitcoin protocol to be less secure than previously thought.

Keywords

Cite

@article{arxiv.1906.04502,
  title  = {Competing (Semi)-Selfish Miners in Bitcoin},
  author = {Francisco J. Marmolejo-Cossío and Eric Brigham and Benjamin Sela and Jonathan Katz},
  journal= {arXiv preprint arXiv:1906.04502},
  year   = {2019}
}

Comments

27 pages, 17 figures

R2 v1 2026-06-23T09:49:59.560Z