Calculate proof context efficiently #801
Merged
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
coderofstuff
force-pushed
the
minimize-proof-reiteration
branch
from
7b53396 to
306cef1
Compare
coderofstuff
changed the title
Do this by ensuring that the level_block_at_depth is indeed of sufficient depth (via discrete block counts)
Make a single outer pass to fill the level relations store. When a potentially deep enough root (both in discrete count and blue depth) is found, use it as a root and fill the GD store. This process will minimize the number of retries per level.
coderofstuff
force-pushed
the
minimize-proof-reiteration
branch
from
521789e to
a0135af
Compare
…less than 2M blues means we have reds and thus require future size increase)
…cs blue score does not count the tip so it cancels...)
…elected_parent_header_at_level and reusable reachable_parents_at_level
freshair18
reviewed
Jan 13, 2026
freshair18
reviewed
Jan 13, 2026
freshair18
reviewed
Jan 13, 2026
michaelsutton
force-pushed
the
minimize-proof-reiteration
branch
from
b93589f to
ffaee97
Compare
michaelsutton
previously approved these changes
Jan 13, 2026
michaelsutton
approved these changes
Jan 13, 2026
coderofstuff
commented
Jan 13, 2026
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
3 participants
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.
Make a single outer pass to fill the level relations store. When a potentially deep enough root (both in discrete count and blue depth) is found, use it as a root and fill the GD store.
This process will minimize the number of retries per level.
This solves the issue where producing the proof for higher levels can go upwards of 100 tries. With this change, only exactly one iteration is needed.