Introduce the durable-data boundary for large content-addressed values without allowing local runtime traversals to force a remote graph walk.
Scope:
- Represent lazy CID-backed values as an opaque, barrier-inert handle.
- Expose explicit materialization through an effect or capability rather than transparent collection traversal.
- Guarantee that local ownership, authority, export, and certification walks treat the handle as O(1).
- Specify the relationship between canonical encoding, content hashing, block retrieval, caching, and Bitswap.
- Add tests proving a local value containing a huge durable handle never traverses or fetches the underlying DAG during ordinary local operations.
Depends on value-domain certification work.
Out of scope: transparent lazy collections, portable callable serialization, and a process-local GC.
Introduce the durable-data boundary for large content-addressed values without allowing local runtime traversals to force a remote graph walk.
Scope:
Depends on value-domain certification work.
Out of scope: transparent lazy collections, portable callable serialization, and a process-local GC.