You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
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.
The text was updated successfully, but these errors were encountered:
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.
The text was updated successfully, but these errors were encountered: