Change RootSet approach to getRootAt #119
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
k1rill-fedoseev
approved these changes
Dec 27, 2022
|
Will be merged as soon as #116 is closed. |
This was referenced Jan 2, 2023
akolotov
added a commit
that referenced
this pull request
Jan 16, 2023
This merge contains the following set of changes: - Change RootSet approach to getRootAt (#119) - Introduction of support id (#121) - New endpoint to get the relayer version (#122) - Pause workers on insufficient balance error (#123) - Add HTTPS URL validation (#124) - RPC sync check introduction to switch to fallback RPCs (#128) - Fix missing configuration variables (#130) - Fix events block range (#134)
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.
Changes:
RootSetstorage and use newgetRootAtmethod instead. It calculates Merkle Tree root at any given past index in one bottom-top tree traversal. As tree height is only 48, this should not slow down corresponding validation checks while greatly simplifying current algorithm logic.