How Does a Blockchain Resolve Temporary Forks Caused by Network Latency?

A blockchain resolves temporary forks, often caused by network latency where two miners find a block nearly simultaneously, through the "longest chain rule." Nodes temporarily hold both competing blocks. Once a subsequent block is mined and appended to one of the chains, that chain becomes the longer, valid chain.

All nodes then abandon the shorter chain (the orphaned block) and converge on the longer chain. This process ensures eventual consistency across the network.

Which Type of Commonality (Horizontal or Vertical) Is More Commonly Accepted by US Courts?
What Is the “Longest Chain Rule” in a PoW System?
How Does ‘Nakamoto Consensus’ Enforce the Longest Chain Rule?
What Is an “Orphan Block” and How Is It Resolved by the Network?
How Does the “Longest Chain Rule” Resolve Discrepancies between Full Nodes?
How Does the Longest Chain Rule Prevent Double-Spending in PoW?
What Is a “Stale Block” and How Does It Relate to the Longest Chain Rule?
How Does the Longest Chain Rule Protect the Network?

Glossar