Orphan Block

How It Works

Bitcoin mining is a decentralized race. Occasionally, two miners find valid blocks at nearly the same time. Both blocks are valid, both reference the same parent block, but they contain different sets of transactions. The network temporarily splits — some nodes see one block first, others see the competing block. This ambiguity resolves naturally: whichever block has the next block mined on top of it first becomes part of the longest chain, and the other becomes a stale (orphan) block.

Transactions in the orphaned block are not lost. Most of them will also exist in the winning block, since both miners were drawing from the same mempool. Any transactions that were in the orphaned block but not in the winning block return to the mempool and can be included in future blocks. However, for that brief period, those transactions lost their confirmation.

Orphan blocks are relatively rare — occurring maybe a few times per month — because the Bitcoin network is well-connected and blocks propagate quickly. The compact block relay protocol (BIP152) significantly reduced orphan rates by making block propagation faster. For users, the practical implication is simple: do not treat 1 confirmation as absolute finality for large amounts. Each additional confirmation exponentially reduces the probability that a reorganization could reverse your transaction.

Key Points

• Valid blocks not included in the longest chain — typically from near-simultaneous mining
• Network resolves competing blocks by extending whichever chain grows fastest
• Transactions from orphaned blocks return to the mempool for re-inclusion
• Relatively rare due to fast block propagation and compact block relay
• Reinforces why multiple confirmations are important for transaction finality