the ordered set of signed provenance nodes inside an envelope - the DAG serialized for transport, which the verifier re-walks node by node, checking bytes against cids and signatures against signers.
The green compartment: the DAG serialized, completeness checkable by dangling digests.
Hand-authored SVG for this glossary, 2026. Shape per the /verify handler; sizes per the paper's evaluation.
Etymology and backstory
bundling is the transport-layer answer to a graph-shaped truth: you cannot ship a pointer structure, so you ship the closure - every node the verification will touch - and let the verifier rebuild the graph. The completeness property matters: a bundle missing a referenced parent is detectably incomplete because the child's link names a cid that is absent.
Ecosystem
git packfiles (the closure of objects a fetch needs), IPFS CAR files (content-addressed archives), NDN's FLIC manifests for segmented objects - the same move at different layers.
In codexproof
verify_bundle in bundle.rs (line 41) is the workhorse - it walks every node, recomputes canonical bytes, checks each against its claimed cid, then checks sub-graph completeness (every link target present or explicitly out of scope). Verification cost is the linear ~27us per node through 512 nodes.