Add proof generation and verification #4
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
Codecov ReportAll modified and coverable lines are covered by tests ✅
Additional details and impacted files@@ Coverage Diff @@
## oss #4 +/- ##
======================================
Coverage ? 57.84%
======================================
Files ? 11
Lines ? 344
Branches ? 0
======================================
Hits ? 199
Misses ? 145
Partials ? 0 ☔ View full report in Codecov by Sentry. |
0xLucqs
requested changes
Jan 5, 2024
…ic over the hasher
0xLucqs
requested changes
Jan 8, 2024
Merged
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 PR adds the possibility to generate proof that a key/value is or isn't in the trie. The proof is a list of node with their hash and the ones of their children following the same format as Madara.
You can also verify the proof using a new function that will verify if the proof is indeed correct and that it verify if the key/value is (or isn't) in the trie.
I have updated the example in the README.md for usage.