feat: add hashed key-value trie implementation #1365
Merged
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/trie-node-trait
branch
from
7947e5b to
945becd
Compare
demosdemon
force-pushed
the
brandon.leblanc/hashable-kvp-trie
branch
from
0c736bb to
6d3d794
Compare
demosdemon
added a commit
that referenced
this pull request
Oct 15, 2025
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
added a commit
that referenced
this pull request
Oct 15, 2025
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
added a commit
that referenced
this pull request
Oct 17, 2025
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/hashable-kvp-trie
branch
from
6d3d794 to
47e37cd
Compare
demosdemon
force-pushed
the
brandon.leblanc/trie-node-trait
branch
from
945becd to
c726158
Compare
rkuris
approved these changes
Oct 24, 2025
demosdemon
force-pushed
the
brandon.leblanc/trie-node-trait
branch
from
c726158 to
cec42cb
Compare
demosdemon
force-pushed
the
brandon.leblanc/hashable-kvp-trie
branch
from
47e37cd to
1c94590
Compare
demosdemon
added a commit
that referenced
this pull request
Oct 29, 2025
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
added a commit
that referenced
this pull request
Oct 29, 2025
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/hashable-kvp-trie
branch
from
80c5288 to
7d9a19c
Compare
demosdemon
force-pushed
the
brandon.leblanc/trie-node-trait
branch
from
cec42cb to
07d7fa5
Compare
This expands on the previously added key-value trie by adding a hashed variant and mechanism to convert from unhashed to hashed.
demosdemon
force-pushed
the
brandon.leblanc/hashable-kvp-trie
branch
from
7d9a19c to
ed1fdda
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.
This expands on the previously added key-value trie by adding a hashed variant and mechanism to convert from unhashed to hashed.