💡 The Plain-English Definition
An orphan block — more accurately called a stale block — is a valid Bitcoin block that gets rejected not because it breaks any rules, but because another valid block was found at the same height first and the network built on that one instead. The miner who found the orphan loses their block reward.
🤔 But Why Though?
Bitcoin’s network spans the globe, and blocks take time to propagate. When a miner finds a valid block, they broadcast it to the network — but there’s a window of seconds to minutes before all nodes receive it. If another miner finds a different valid block at the same block height during this window (before news of the first block reaches them), the network temporarily has two competing valid chains. Every node that received block A first will extend chain A; every node that received block B first will extend chain B. This fork resolves when the next block is found — whichever chain gets the next block becomes the longest, and the network converges on it. The losing block becomes an orphan: technically valid, but permanently excluded from the main chain. Its transactions return to the mempool (Bitcoin’s waiting room for unconfirmed transactions) to be included in a future block. The miner who found it gets nothing — all that proof-of-work (energy-intensive computational effort) was spent for zero reward.
Orphan blocks happen roughly once every 100 blocks under normal conditions — about once a week. Compact block relay (the network optimisation that sends short transaction identifiers instead of full block data, dramatically reducing propagation time) significantly reduced the orphan rate by making block propagation faster. The higher the hash rate (total computing power in the network) and the faster block propagation, the lower the orphan rate — because less time passes between blocks, reducing the window during which two miners might find blocks simultaneously.
🌍 The Real-World Analogy
Think of orphan blocks like two runners in a race who cross a finish line simultaneously. Both ran the correct race, both times are valid. But only one can officially win — the one whose time was fractionally faster (whose block reached most of the network first). The other runner’s effort was real and their time was valid, but they walk away without the medal. In Bitcoin, the orphaned miner walked away without the block reward — real work, no reward.
⚡ So What?
Orphan blocks explain why multiple confirmations matter for high-value transactions: a transaction confirmed in a block that later becomes orphaned is temporarily reversed — those transactions return to the mempool and must be reconfirmed in a subsequent block. With each additional confirmation, the probability of reversal decreases exponentially. For everyday transactions, one or two confirmations is more than sufficient. For very large irreversible transfers, waiting for six or more ensures the block is deeply enough in the chain that orphaning is effectively impossible.