blockchain, indexers: generate root summaries #250
Merged
Conversation
This file contains 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
kcalvinalvin
changed the title
kcalvinalvin
force-pushed
the
2025-02-03-add-root-summary-state
branch
from
281e109 to
9030232
Compare
Root summaries are now generated at the last 50,000 block interval and is stored in the summaries flat file state. If the summaries are not availble on start, the summaries are generated.
kcalvinalvin
force-pushed
the
2025-02-03-add-root-summary-state
branch
from
9030232 to
b2b65f4
Compare
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.
Root summaries are the utreexo accumulator of each of the roots at each block.
The roots at each block are hashed and they become the leaves of this accumulator.
This allows for committing the root summary into the binary so that peers may be able
to serve the proof and the roots at a given block.
The root summaries are generated every 50,000 blocks and the proofs are backwards
compatible as no leaves are removed from the accumulator. The new proofs will just have
extra hashes appended to the end which the requesting node can safely ignore.