Definition
Selfish Mining is a strategy in which a miner who finds a block keeps it secret instead of broadcasting it immediately, mining privately on top of the hidden block to build a lead and then releasing it strategically to make honest miners waste work on a chain that gets discarded.
Also known as: block-withholding attack (strategic variant), selfish-mine strategy.
How the strategy works
Bitcoin’s longest-chain rule says the chain with the most accumulated proof-of-work wins. Normally, when you find a valid block you broadcast it instantly so the network can build on it and you collect the block reward. A selfish miner does the opposite: they sit on the new block, keep it private, and quietly start mining the next one. If they get ahead, they hold a secret chain longer than the public one.
When the honest network finally finds and broadcasts a block, the selfish miner releases their hidden chain. Because their secret chain is longer (or strategically timed to tie), the honest block becomes an orphan block and the work behind it is thrown away. The selfish miner ends up claiming a larger share of rewards than their raw hashrate alone would justify, because they have tricked competitors into burning energy on a doomed fork.
Why propagation timing is the whole game
Selfish mining only works because blocks take time to travel across the peer-to-peer network. That propagation delay is the window an attacker exploits. Pool infrastructure fights this every day for honest reasons: D-Central’s research into open-source pool software (CKPool) notes that new blocks must be detected in under a second via block-notify hooks or ZMQ to minimize stale work. A selfish miner weaponizes the same latency, deliberately delaying their broadcast to maximize the chance that honest blocks get orphaned.
The economics are unforgiving on the honest side. Pool payout research confirms that orphaned blocks are simply not paid, no matter how much electricity went into finding them. That is exactly the loss a selfish-mining adversary tries to inflict on everyone else while protecting their own private chain from the same fate.
How realistic is it on Bitcoin today?
The original academic models suggested a selfish miner controlling well under half the network could come out ahead, with the threshold sometimes cited at roughly a third of total hashrate under favorable network conditions. In practice it has never been observed succeeding on Bitcoin’s mainnet. It requires sustained, concentrated hashrate, excellent network positioning, and a willingness to forfeit honest rewards while building the secret lead — and the gambit is publicly detectable once orphan rates spike. It is a milder cousin of the 51-percent attack: instead of overpowering the chain outright, it games the rules at the margins. The Vault does not record any confirmed real-world Bitcoin instance, so treat the specific profitability thresholds as theory, not settled fact.
Why a home miner should care
If you run an ASIC at home or point a Bitaxe at a mining pool, you are an honest participant whose interests are protected by keeping hashrate decentralized. Selfish mining is fundamentally an attack that only pays off when one entity hoards a large fraction of the network. Every watt you run on your own gear, every block you try to find through solo mining, and every choice to point at a smaller open-source pool rather than the largest one makes this class of attack harder. That is the same decentralization logic behind the open hardware in the Bitaxe hub — spreading hashrate across many independent operators is itself a defense.
You do not need to fear selfish mining as an operator; you need to understand that the security of your rewards depends on no single miner or pool controlling too much. Running your own node, choosing where your shares go, and supporting a diverse set of pools are the practical, sovereign answers. Keeping the network’s hashrate broad is one more layer decentralized.
Related terms: Orphan Block, 51-Percent Attack, Longest Chain Rule, Propagation Delay, Stale Block, Mining Pool
In Simple Terms
A strategy of withholding mined blocks to gain advantage over honest miners. Theoretical but rarely observed.
Selfish Mining is a strategy in which a miner who finds a block keeps it secret instead of broadcasting it immediately, mining privately on top of the hidden block to build a lead and then releasing it strategically to make honest miners waste work on a chain that gets discarded.
Also known as: block-withholding attack (strategic variant), selfish-mine strategy.
How the strategy works
Bitcoin's longest-chain rule says the chain with the most accumulated proof-of-work wins. Normally, when you find a valid block you broadcast it instantly so the network can build on it and you collect the block reward. A selfish miner does the opposite: they sit on the new block, keep it private, and quietly start mining the next one. If they get ahead, they hold a secret chain longer than the public one.
When the honest network finally finds and broadcasts a block, the selfish miner releases their hidden chain. Because their secret chain is longer (or strategically timed to tie), the honest block becomes an orphan block and the work behind it is thrown away. The selfish miner ends up claiming a larger share of rewards than their raw hashrate alone would justify, because they have tricked competitors into burning energy on a doomed fork.
Why propagation timing is the whole game
Selfish mining only works because blocks take time to travel across the peer-to-peer network. That propagation delay is the window an attacker exploits. Pool infrastructure fights this every day for honest reasons: D-Central's research into open-source pool software (CKPool) notes that new blocks must be detected in under a second via block-notify hooks or ZMQ to minimize stale work. A selfish miner weaponizes the same latency, deliberately delaying their broadcast to maximize the chance that honest blocks get orphaned.
The economics are unforgiving on the honest side. Pool payout research confirms that orphaned blocks are simply not paid, no matter how much electricity went into finding them. That is exactly the loss a selfish-mining adversary tries to inflict on everyone else while protecting their own private chain from the same fate.
How realistic is it on Bitcoin today?
The original academic models suggested a selfish miner controlling well under half the network could come out ahead, with the threshold sometimes cited at roughly a third of total hashrate under favorable network conditions. In practice it has never been observed succeeding on Bitcoin's mainnet. It requires sustained, concentrated hashrate, excellent network positioning, and a willingness to forfeit honest rewards while building the secret lead — and the gambit is publicly detectable once orphan rates spike. It is a milder cousin of the 51-percent attack: instead of overpowering the chain outright, it games the rules at the margins. The Vault does not record any confirmed real-world Bitcoin instance, so treat the specific profitability thresholds as theory, not settled fact.
Why a home miner should care
If you run an ASIC at home or point a Bitaxe at a mining pool, you are an honest participant whose interests are protected by keeping hashrate decentralized. Selfish mining is fundamentally an attack that only pays off when one entity hoards a large fraction of the network. Every watt you run on your own gear, every block you try to find through solo mining, and every choice to point at a smaller open-source pool rather than the largest one makes this class of attack harder. That is the same decentralization logic behind the open hardware in the Bitaxe hub — spreading hashrate across many independent operators is itself a defense.
You do not need to fear selfish mining as an operator; you need to understand that the security of your rewards depends on no single miner or pool controlling too much. Running your own node, choosing where your shares go, and supporting a diverse set of pools are the practical, sovereign answers. Keeping the network's hashrate broad is one more layer decentralized.
Related terms: Orphan Block, 51-Percent Attack, Longest Chain Rule, Propagation Delay, Stale Block, Mining Pool