Orphaned Block

An orphaned block is a valid block that was produced and broadcast to a blockchain network but did not become part of the main chain, because a competing block at the same block height was adopted instead. Orphaned blocks occur mainly on proof-of-work networks such as Bitcoin, where independent miners race to find each block and two can succeed at nearly the same time. The miner of an orphaned block loses the block reward and fees it would otherwise have earned. Such a block is often just called an orphan.

The term is used loosely. Many developers prefer "stale block" for a valid block that loses the race, and reserve "orphan" for a block whose parent is unknown to a node. On pre-2022 Ethereum, a similar abandoned block could still earn a partial reward as an "uncle" or "ommer". All three ideas concern the same underlying problem: in a decentralised network, information travels at finite speed, so nodes sometimes briefly disagree.

Picture two reporters racing to file the same breaking story. Both send it to the newspaper at almost the same second. Some editors see one version first, some the other. When the next edition is built on top of one version, that one becomes the official record, and the other is spiked, even though it was perfectly accurate.

An orphaned block is the spiked story. Nothing was wrong with it; it simply lost a timing contest. The news it contained, the transactions, usually still appears in the paper, just in a later edition.

1. Simultaneous discovery. Two miners find a valid block for the same height within seconds of each other.
2. Temporary split. Each block spreads through part of the network first, so nodes briefly follow different tips of the chain.
3. Resolution. The next miner to find a block builds on one of the two. Under the fork choice rule, nodes switch to the branch with the most accumulated work.
4. Abandonment. The block on the losing branch is dropped from the active chain and becomes orphaned.

Orphan rates rise when blocks are large or slow to propagate, when block times are short, or when the network is poorly connected. Miners therefore invest in fast relay networks to spread their blocks quickly.

On Bitcoin, stale blocks have become uncommon as block propagation has improved. Techniques such as compact block relay, which sends a short summary of a block instead of every transaction that peers already hold, and dedicated low-latency networks between large miners mean most new blocks reach the bulk of the network within seconds. Proof-of-stake chains with scheduled block proposers see fewer competing blocks for the same reason: only one validator is expected to propose in each slot, so true races are rare, although late or missed proposals still occur.

Transactions in an orphaned block are not lost. Any that were not also included in the winning block return to the mempool and are usually confirmed in a later block. A user may briefly see one confirmation disappear, which is why exchanges and merchants wait for several confirmations before treating a large payment as final. The deeper a block is buried, the less likely it is to be orphaned, a property known as probabilistic finality. When the switch from one branch to another involves more than one block, it is called a chain reorganization, and a deliberately engineered one can enable a double-spend attack.

Ethereum's original proof-of-work design had block times of around 13 to 15 seconds, much shorter than Bitcoin's ten minutes, so stale blocks were common. To avoid penalising miners unfairly and to reduce the advantage of large, well-connected pools, Ethereum let later blocks reference recently orphaned blocks as "uncles", later renamed "ommers" as a gender-neutral term. Uncles earned their miner a reduced reward, and the including miner received a small bonus. Uncle blocks also counted toward the chain's total weight. This mechanism ended when Ethereum moved to proof of stake in September 2022, where blocks are proposed in fixed slots by selected validators and competing blocks are much rarer.

A high orphan rate wastes computing power and slightly weakens security, because the work spent on orphaned blocks does not protect the main chain. It also tends to favour large mining pools, which hear about their own blocks immediately and so lose fewer races. Researchers have shown that a pool could profit by withholding blocks and releasing them strategically to orphan honest miners' work, a strategy called selfish mining. Monitoring orphan and reorganization rates is therefore one way analysts gauge a network's health, alongside its hashrate.