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
To re-execute a part of stf in zk-prover, we can't load the whole tree in memory, we'll need to find the minimal sub-tree that's enough for the stf execution.
Solution
for example to prove the execution of a range of blocks [a, b]:
load memiavl tree at version a-1.
replay the range of blocks [a, b], and mark the touched nodes (both read and write) whose version < a.
export those marked nodes.
The text was updated successfully, but these errors were encountered:
Context
To re-execute a part of stf in zk-prover, we can't load the whole tree in memory, we'll need to find the minimal sub-tree that's enough for the stf execution.
Solution
for example to prove the execution of a range of blocks
[a, b]
:a-1
.[a, b]
, and mark the touched nodes (both read and write) whose version< a
.The text was updated successfully, but these errors were encountered: