Suzuka State Sync Verification #468
Replies: 1 comment
-
Currently, the settlement written on L1 contains: In Aptos, a state proof is primarily a list of The state proof is generated after each block execution. Only the latest state proof is kept in memory. The database stores the state proof at the beginning / end of each epoch; otherwise, only the most recent one is retained. From the L1 settlement, the state proof cannot be calculated, and the only way to retrieve a state proof at a specific height is to execute all blocks up to that height. Therefore, through the gossip network, the only state root that can currently be requested is that of the most recently executed block. Requesting over gossip would require implementing a specific protocol to ensure the requester receives one and only one response from another node. If we have an ID for the state root, a more efficient method would be to query a single node directly. |
Beta Was this translation helpful? Give feedback.
Uh oh!
There was an error while loading. Please reload this page.
-
Summary
Let's use this PR to clarify some outstanding concerns for Suzuka p2p state sync verification.
The basic premise is described in rfc-24:
What remains to marry this up with #398 and accept or reject tickets?
Beta Was this translation helpful? Give feedback.
All reactions