echd — Echo on Encore · E0.4 · dive
One Frame, Walked
Follow one fourteen-byte identity from mint to surface and watch the law hold at every seam — the id crosses, a message about it crosses, and the object graph never does.
echd speaks in the present tense over a build ladder. Every module, verb, key, and port named on this page is real; the composition into one standing platform is the vision the ladder builds.
The dive
echd.course.md §4.4 · the BCS lawTake one branded id and walk it across the whole frame. It is named at the substrate, where the app mints a 14-byte identity (E1). It is gated at the seam, admitted only on its 3-letter namespace (E2). It is carried by the bus as a branded JOB, claimed on a lease against the server clock (E3). It is answered by the memory in twenty-nine bytes — the id:version message that invalidates one cached row (E4). It is booked by the record under an RVL ledger key, paired and signed in one transaction (E5). And it is resolved on the surface, every response stamped with its plane and its as_of (E6). Six tiers, one identity, and at every boundary the same two facts hold: the id crosses, and a message about the id crosses — never an object graph.
This walkthrough is the BCS law told as a story. The law states that encapsulation boundaries are drawn around systems, not objects, and that the only values crossing a boundary are identities and messages about identities. The walk makes it literal: the id is minted once, at the consistent core where the ledger books it, and carried unchanged to cache, log, and surface — recorded once, read in many places. Each tier makes its own CAP trade — the ledger blocks, the cache answers, the surface stamps — yet they compose into one system not because they coordinate but because they share one identity. The frame is not a stack of layers propping each other up; it is a set of peers joined by a single thread, and the walk is proof the thread never frays.
The id, walked
hover a stageJOB, claimed on a lease against the server clock; the memory answers it in twenty-nine bytes — the id:version message that deletes one L1 row on invalidation. The payload stays home; only the name and its version travel.RVL ledger key in one Repo.transaction, row locked FOR UPDATE, paired with a signed entry and made exactly-once by a partial unique index. This is the consistent core where the id is minted and its history is sealed.plane — which rung of the ladder replied — and its as_of — how fresh that reply is. The identity that entered at the substrate leaves at the window, its staleness disclosed.Hover or focus a stage to read it; click to pin. Without scripting, all five read in sequence.
What crosses, and what cannot
echd.course.md §4.4 · the BCS lawThe walk is worth pausing on because it doubles as an audit. At every seam, take the accounting: what actually moves? The id moves — fourteen bytes, the same fourteen from mint to surface. A message about the id moves — as a JOB reference the worker redeems for its payload, as a 29-byte id:version invalidation the store pushes over client tracking, as an RVL key in the ledger, as a plane + as_of stamp on the response. And what never moves: the owner's :private table, the object graph, an embedded id list. Each system keeps its store to itself and hands out only names, so the wire is always narrow — identities and small messages, never a serialized world.
That narrowness is the whole reason the frame can hold tiers with opposite CAP trades and remain one system. If the ledger's rows, the cache's tables, and the surface's views had to be shipped between tiers, their guarantees would have to be reconciled — and reconciling a consistency-first store with an availability-first one is exactly the impossibility the chapter opened on. Because only the id crosses, no such reconciliation is ever attempted: each tier answers for its own segment, on its own trade, and the id is the sole thing they agree on — that this is the same entity. The walkthrough, then, is not a tour of features; it is the demonstration that the platform's segmentation is safe, because its boundaries carry names, not graphs.
The rule
one line to carryThe thread rule — one identity crosses every boundary; at each seam only the id and a message about it pass, never the object graph. Minted once at the consistent core and carried unchanged to cache, log, and surface, the branded id is the single value every tier agrees on — which is why tiers with opposite trades compose into one system instead of one contradiction.
Doors
the thread, followedThe Branded Component System
The law this walk demonstrates: boundaries around systems, identities across them, the object graph never on the wire.
the law, stated — the walk is its proof; this is its text.
/echd/flyingE7 — The Mesh, Flying
The capstone that replays this walk at full depth — one id across tunnel, app, bus, memory, record, and surface.
the same thread, flying — the overview's walk, taken end to end.
References
sources · relatedSources
- Gilbert & Lynch (2012) — Perspectives on the CAP Theorem§4.4 — segmentation, and the open question of keeping the parts one system
Related
- E0.4 — One Frame, Standingthe module this dive turns
- E2 — The Seamthe identity the walk follows, at its source
- where-each-chapter-livesthe next move: the frame as the course's floor plan