A space that grows past 50 MiB splits into branches by content hash, so every leaf stays small and no node has to hold a monolith. Pour content in and watch the tree deepen — the threshold and the hash placement are the real SPEC_08 code in WebAssembly.
Each unit of content is placed by its hash. The page builds the items and hands them to
swimchain_core::fracture::fracture, which applies the real 50 MiB
threshold and the real bit-by-bit hash placement
(BranchPath) the node uses.
Under the threshold, everything sits in one root branch. Cross it and the space deepens one level: each item re-places by the next bit of its hash into a Left or Right child, halving the load. Keep pouring and it keeps splitting — a balanced binary tree of branches, each capped near 50 MiB. Because placement is a pure function of the hash, every node computes the identical tree from chain data alone, with no coordinator.
This is the storage-layer sibling of behavioral branching. See also how forks reconcile in the fork-choice sim, or the protocol page.