REFACTOR: Addition of StemNodes to capture SuffixExtensions #8
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
Currently, there was branch or leaf nodes (and null). The logic of suffix and extensions was all included in hash visitor. This includes commiting to 1, stem, left values commitment and right values commitment. However, the subcommitments will be useful in proofs. Another reason to refactor is that path-extensions are only allowed at StemNodes, like in the current specifications. Before, path-extensions could be done anywhere. Another feature is support for StoredVerkleTrie. StoredNodes are now behaving correctly and can be retrieved recursively. Finally, minor feature is that put returns the old value, which is helpful for trie-logs Signed-off-by: Thomas Zamojski <[email protected]>
|
dragan2234
pushed a commit
to dragan2234/besu-verkle-trie
that referenced
this pull request
Jan 22, 2024
…ger#8) Currently, there was branch or leaf nodes (and null). The logic of suffix and extensions was all included in hash visitor. This includes commiting to 1, stem, left values commitment and right values commitment. However, the subcommitments will be useful in proofs. Another reason to refactor is that path-extensions are only allowed at StemNodes, like in the current specifications. Before, path-extensions could be done anywhere. Another feature is support for StoredVerkleTrie. StoredNodes are now behaving correctly and can be retrieved recursively. Finally, minor feature is that put returns the old value, which is helpful for trie-logs Signed-off-by: Thomas Zamojski <[email protected]> Signed-off-by: Dragan Pilipovic <[email protected]>
dragan2234
pushed a commit
to dragan2234/besu-verkle-trie
that referenced
this pull request
Jan 22, 2024
…ger#8) Currently, there was branch or leaf nodes (and null). The logic of suffix and extensions was all included in hash visitor. This includes commiting to 1, stem, left values commitment and right values commitment. However, the subcommitments will be useful in proofs. Another reason to refactor is that path-extensions are only allowed at StemNodes, like in the current specifications. Before, path-extensions could be done anywhere. Another feature is support for StoredVerkleTrie. StoredNodes are now behaving correctly and can be retrieved recursively. Finally, minor feature is that put returns the old value, which is helpful for trie-logs Signed-off-by: Thomas Zamojski <[email protected]> Signed-off-by: Dragan Pilipovic <[email protected]>
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.
PR description
This is a major refactoring that solves several problems:
Fixed Issue(s)