LMD-GHOST
Ethereum's fork-choice rule: starting at the last justified checkpoint, repeatedly descend into the child subtree with the greatest weight of validators' latest attestations (Latest Message Driven, Greediest Heaviest Observed SubTree). Counting votes on entire subtrees rather than single chains makes short forks resolve quickly even with high latency.
This Concept is waiting for its first lesson!
Ethereum's fork-choice rule: starting at the last justified checkpoint, repeatedly descend into the child subtree with the greatest weight of validators' latest attestations (Latest Message Driven, Greediest Heaviest Observed SubTree). Counting votes on entire subtrees rather than single chains makes short forks resolve quickly even with high latency.
Are you a teacher? Sign in to start contributing.
Sign In