Partial Patricia Trie: Structure View

Trie builder

Build trie nodes, then create fork

This is the structure view. It shows how fetched proof paths or local inserts become Edge and Binary nodes, then how a fork copies that known partial trie.

Interaction track

Fetched paths become trie nodes

Forked State shows where proof nodes come from. This lab shows how those paths become a compact trie: edges hold shared paths, binary nodes appear at real splits, and roots update from that smaller structure.

01Build first known path

A fetched proof path or inserted key becomes one edge node while no branch point exists yet.

02Split on common prefix

Binary nodes appear only when another fetched or inserted path splits from an existing edge.

03Create fork

Forking copies the partial structure as-is, including nodes that were already fetched from proofs.

04Extend only the fork

Later proof fetches or local inserts grow the forked copy while the base root stays the same.

One mechanism, two views

This is the trie structure view

The fetched proof nodes become Patricia trie structure. First paths become edges, shared prefixes split into binary nodes, and the fork copies what is already known before it changes.

01First known path becomes one edge.
02A real split creates one binary node.
03The fork starts from the known trie copy.

Open proof fetch view

Animated scene

Paths build the partial trie

Click transactions as stand-ins for known proof paths. After you create a fork, new clicks extend only the forked copy.

Loading trie builder…