Dpapp/change the merkle stree structure#516
Draft
danielpapp-trilitech wants to merge 4 commits intomainfrom
Draft
Dpapp/change the merkle stree structure#516danielpapp-trilitech wants to merge 4 commits intomainfrom
danielpapp-trilitech wants to merge 4 commits intomainfrom
Conversation
|
Benchmark results for revision c2070a7:
Full results
Compare the results above with those for the default branch. |
Codecov Report❌ Patch coverage is Additional details and impacted files@@ Coverage Diff @@
## main #516 +/- ##
==========================================
- Coverage 90.93% 90.71% -0.22%
==========================================
Files 110 111 +1
Lines 20070 20395 +325
Branches 20070 20395 +325
==========================================
+ Hits 18250 18502 +252
- Misses 1540 1614 +74
+ Partials 280 279 -1 ☔ View full report in Codecov by Sentry. 🚀 New features to boost your workflow:
|
7410580 to
a88d59c
Compare
5cf4e22 to
15b7bac
Compare
Making the mentioned enum variant a struct for better readability. WIP reafactor(data): Removing impl_modify_map_collect I'm removing the mentioned function because I need to make some modifications to the MerkleTree struct and I need to change how it's serialized and this function is just not lending itself to refactoring. refactor(data): Adding the tailcall crate Added the tailcall trait and moved all former impl_modify_map_collect implementations to recursive From trait implementations.
Added a generic NodeData variable to the Tree data structure and changed the MerkleTree implementation accordingly.
Making the CompressedMerkleTree a specialization of the Tree generic type.
Making the MerkleTree be a type synonym for a Tree<LeafData, NodeData>
15b7bac to
ca3c925
Compare
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.
What
Unifying the tree implementations as specializations of the
Tree<A>generic and adding data to the node variant.Why
We need to store data in the node variants as well, because we would like to include the AVL tree in the proofs and this is a tree that contains the balance factor in the internal nodes so we need a way to store data in the internal nodes.
How
I changed the
Tree<A>into aTree<LeafData, NodeData>type. Made theMerkleProofand theCompressedMerkleProofa specialization of this. Once these changes are in place we should be able to turn the AVL tree and the whole registry in the durable storage into a proof and include it in the PVM.Manually Testing
Regressions
N/A
Tasks for the Author