[runtime]: pharos-verifier - derive the MSU root slot offset from the key#917
Merged
Conversation
dharjeezy
changed the title
Wizdave97
approved these changes
May 28, 2026
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
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
2 participants
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.
The Pharos SPV walk read the MSU root child slot at the prover supplied
next_begin_offset, which let a prover point a proof at an unrelated MSU subtree and forge non existence proofs. The verifier now derives the slot offset from the key itself askey[last] * 32(the 20 byte address for account proofs, address concatenated with the storage key for storage proofs) and rejects the proof when the prover offset does not match. This runs through the shared walk, so existence, membership and non existence proofs, including sibling chains, are all covered.