Protocol workbench

Forked State: Proof Fetch View

A read-only view of one mechanism, outside the article layout.

State explorer

Fetch missing trie nodes for a fork

This is the proof fetch view. Pick remote leaves, request missing storage proof nodes from the main instance, fill the local partial trie, write locally, and recompute the root.

Interaction track

The fork fetches only what it needs

This lab answers one question: which nodes are requested from the main instance before local execution can touch forked state?

01Anchor remote root

The fork starts from the root of the main instance, not from a full local copy.

02Fetch missing proof paths

Selected leaves are only a request until FORK asks the main instance for the missing storage proof nodes.

03Apply local write

Local execution changes only paths that were fetched into the partial trie.

04Recompute fork root

The fork computes a new root from fetched paths and local writes.

One mechanism, two views

This is the proof fetch view

The fork does not copy the whole remote state. It asks the main instance for storage proof nodes, fills only the selected paths, then writes locally.

  1. 01Ask the main instance for proof nodes.
  2. 02Fill missing nodes in the local partial trie.
  3. 03Write locally and compute a new root.
Open structure view
Animated scene

Storage proofs fill the local partial trie

The left side is the main instance. The fork asks for only the proof paths it touches, fills those missing nodes on the right, then writes locally and recomputes the root.

Loading fork scene…