💡 The Plain-English Definition
Selfish mining is a theoretical attack strategy where a mining pool holds back newly found blocks — mining in private on a longer chain — then releases them at a chosen moment to invalidate competitors’ work and claim more than its fair share of block rewards.
🤔 But Why Though?
Standard mining is honest: when you find a valid block, you broadcast it right away. That lets the whole network build on your block, and you collect your reward. Selfish mining breaks from this. When you find a block, you keep it secret and immediately start mining the next one on your own private chain. If you find a second block before the honest network finds its next, you now have a two-block lead. Release both at once, and the honest network’s latest block (if it found one) becomes an orphan block — a valid block rejected because a longer chain now exists — while your two-block chain is accepted. You’ve earned two block rewards, and the honest miners earned nothing for their last block.
Researchers Ittay Eyal and Emin Gün Sirer showed in 2013 that a pool with more than roughly 33% of the total hash rate — the total computing power aimed at mining — could profit from selfish mining, even allowing for the risk that its private chain gets overtaken before release. Below 33% the strategy loses money; above it, selfish miners can earn more than their fair share while cutting into honest miners’ revenue. That creates a centralisation pressure, where rational miners join the selfish pool just to avoid being its victims.
So why hasn’t this happened at scale? A few reasons. Keeping the secret chain completely private within a pool is difficult and invites defectors. The strategy is detectable through network analysis. And the reputational damage of being caught would likely trigger a mass exodus of participants. Still, several pools run near or above the 33% threshold from time to time — so it’s a real concern worth monitoring, even though it hasn’t been actively exploited.
🌍 The Real-World Analogy
Think of selfish mining like a student in an exam who secretly works ahead but waits to hand anything in until they see a classmate finishing — then rushes to submit a “better” paper at the last moment, wiping out the classmate’s effort. The honest student did real work and gets credit for none of it. The cheating student’s advantage grows the more often, and the faster, they can pull this off.
⚡ So What?
Selfish mining shows that Bitcoin’s security relies not just on the hash-rate majority being honest, but on that majority acting as many individual, self-interested players rather than one coordinated strategic bloc. It’s useful for judging mining-pool concentration: when any single pool consistently nears or passes 30% of global hash rate, the theoretical conditions for selfish mining start to matter. Stratum V2 — the next-generation mining protocol that lets individual miners choose their own transactions — partly helps, by reducing pool-operator control and making it harder to coordinate this kind of attack within a pool.
