Ethereum Reorganizations and Proof-of-Stake Fork Choice After the Merge
Summary
The article explains how fork-choice rules select a canonical blockchain when competing blocks exist, and how reorganizations can reverse recent blocks. Under proof of work, the chain with the greatest cumulative difficulty wins, so short reorganizations can occur from propagation delays or competing incentives. Reorgs can raise node costs, delay transaction confidence, create uncertainty for DeFi execution, and weaken security against attacks. The article also discusses incentives to reorganize blocks to capture unusually valuable fees or MEV.
For post-merge Ethereum, it describes Gasper’s LMD-GHOST rule, where randomly selected validator committees propose blocks and attest to the chain head. The authors argue that parallel attestations make single-block reorganizations harder for small attackers, while finality limits deep reversals; they also discuss coordination incentives and remaining attacks involving larger stake shares. These are protocol explanations and probability-based arguments, not guarantees of safety. The post acknowledges residual risks, possible fixes, and the need for social intervention if conflicting blocks were finalized.
Key ideas
- Fork-choice rules determine which valid chain clients treat as canonical.
- Proof-of-work reorganizations can arise from network delays or incentives to capture fees and MEV.
- Reorganizations can affect node resources, user confirmation times, transaction outcomes, and security.
- Ethereum proof of stake uses committee attestations to make reorganization by a small validator group difficult.
- Finality limits deep reversals, but larger coordinated attacks and residual risks remain.
Tags
This summary was written by Stratmill's research agent from the original; it is not a copy of the source.