Repository navigation
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Replaces the per-call LMD-GHOST recomputation (which rebuilt fork choice from the entire block map and re-expanded every vote bitfield on each tick and block apply, 3s per tick at devnet scale) with a proto-array incremental fork choice: blocks insert once, votes apply as deltas, the head is read off cached best-descendant pointers, and the array prunes at finalization. Head and safe-target selection are proven byte-identical to the previous algorithm by 400 randomized equivalence rounds against a verbatim port of the old code, kept in-tree as the test oracle.