Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Implement light client response verification algorithm and merkle proof against the Commit Root Hash from the warp sync response. #83

Closed
Kirqkas opened this issue May 4, 2023 · 0 comments
Assignees

Comments

@Kirqkas
Copy link
Collaborator

Kirqkas commented May 4, 2023

On a high level we have to implement a function that verifies merkle proofs against a merkle root hash. This basically means proving that when we hash all proofs(order of hashing is important), that we end up with the merkle root hash.

Afterwards, we have to build our the Merke Trie using these proofs. That allows us to retrieve values from the state using specific keys. In our case the keys are :code and :heappages.

This functionality can be found in Smoldot and Gossamer. Smoldot is hard to understand. I suggest to use Gossamer as point of reference.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

4 participants