feat: build trie from Proofs #1369
Open
+320
−13
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
demosdemon
force-pushed
the
brandon.leblanc/proof-trie
branch
2 times, most recently
from
424ee30 to
5610b4c
Compare
demosdemon
force-pushed
the
brandon.leblanc/proof-trie
branch
from
5610b4c to
0c47142
Compare
demosdemon
force-pushed
the
brandon.leblanc/trie-path-iter
branch
from
2446fa7 to
787fe3c
Compare
demosdemon
force-pushed
the
brandon.leblanc/trie-path-iter
branch
from
787fe3c to
30e63e5
Compare
demosdemon
force-pushed
the
brandon.leblanc/proof-trie
branch
from
0c47142 to
f67a1af
Compare
demosdemon
force-pushed
the
brandon.leblanc/trie-path-iter
branch
from
30e63e5 to
8b019d4
Compare
demosdemon
force-pushed
the
brandon.leblanc/proof-trie
branch
from
f67a1af to
a1daa93
Compare
Key proofs are a sequence of trie nodes that follow a linear path through the trie. This means we can reconstruct a narrow view of the trie over that linear path. In this narrow view, each node can refer to another full node or just its hash. This resulting trie can (and will in an upcoming change) be hashed to generate the same root hash. While merging with the key-value tries from #1363 and #1365, we can iteratively verify the hash of each layer and detect early if any node is incomplete. The `Remote` edges can also point outside of the key range. We can use these remote edges to identify holes in our overall trie and continue synchronizing down those paths.
demosdemon
force-pushed
the
brandon.leblanc/proof-trie
branch
from
a1daa93 to
a3246b0
Compare
demosdemon
force-pushed
the
brandon.leblanc/trie-path-iter
branch
from
8b019d4 to
1136cc1
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.
Key proofs are a sequence of trie nodes that follow a linear path through the trie. This means we can reconstruct a narrow view of the trie over that linear path. In this narrow view, each node can refer to another full node or just its hash.
This resulting trie can (and will in an upcoming change) be hashed to generate the same root hash. While merging with the key-value tries from #1363 and #1365, we can iteratively verify the hash of each layer and detect early if any node is incomplete.
The
Remoteedges can also point outside of the key range. We can use these remote edges to identify holes in our overall trie and continue synchronizing down those paths.