B0 · Orientation — the Branded Component System course
Encapsulation boundaries are drawn around systems, not objects. The only values that cross are identities, and messages about identities. And identity is a contract — the 14-byte branded snowflake: typed by its namespace, ordered by its mint time, placed by its hash, identical in meaning across five runtimes against one canon.
The course teaches the BCS manuscript Part for Part. Every figure on every page is quoted verbatim from a committed output — a frozen transcript, a normative vector, a bench record. The worked project is a trading system; the bus between its systems is EchoMQ 2.0, backed by Valkey.
USRzzzzzzzzzzz → range · usr0KHTOWnGLuC → namespace
· USR0KHTOWnGLu → length · USR0KHTOWnGL!C → charset
(content/vectors.json, rejects).Clause one
A system is the unit that encapsulates: a property store, the code allowed to touch it, and a boundary everything else stays behind. Ownership is total or it is not ownership; a sweep over somebody else’s table is a data race wearing a method’s clothing.
failure retired · the reach-through — a change to one system’s representation breaks code in another system’s file.
Clause two
A message may say generate an image for this id with this prompt; it may never carry the entity itself, a pointer to it, or a live structure entangled with one. An identity is the one value that copies freely without forking truth, because it names state rather than carrying it.
failure retired · the traveling object — the entity, handle, or pointer that escapes its owner.
Clause three
The value everything crosses on cannot be the weakest value in the program. The contract gives identity four load-bearing properties — namespace, order, placement, canon — and each one retires a failure that otherwise reappears as bespoke machinery, system by system.
failures retired · the silent join · the second clock · the routing table · the dialect
The composition: clause one makes the crossings enumerable → clause two makes every crossing typeable → clause three makes the typing checkable before anything runs. Three clauses, one law — the inter-system architecture verified by the type checker, the schema compiler, and the storage domain.
typed
The namespace rides in the first three bytes and in the type parameter. The wrong-table join dies at compile time, at the schema layer, and at the storage domain — before runtime.
ordered
String order is mint order — the order theorem. A table keyed by branded id is already a timeline; a feed is a descending sort; a time window is two synthetic cursors.
placed
hash32 is placement any holder computes identically: the same function routes a CHAMP slot, a cache shard, and a hash partition — arithmetic, not a directory service.
canonical
One Rust source, one C reference, one vector file, a conformance suite per runtime. Which language a system is in becomes a deployment detail.
Every manuscript chapter that narrates built work is backed by a rung: an executable check script and a frozen transcript, committed beside the prose. The course inherits the ethic — a number that is not in a committed output does not appear on a page. Three samples:
encode("USR", 274557032793636864) = "USR0KHTOWnGLuC"
hash32(274557032793636864) = 234878118 ← Elixir, Rust, C, TypeScript, wasm, Go, SQL agree
base62(2^63 − 1) = "AzL8n0Y58m7" ← MAX_PAYLOAD, the range gate’s ceiling
fence claimed echomq:2.0.0 ← typed, fatal on mismatch sequential INCR 29456 ops/s pipelined SET 454483 ops/s ← fifteen times the sequential figure, same socket pipelined EVALSHA 161192 ops/s ← declared-keys law at speed script_loads 1 ← exactly one NOSCRIPT load 10000-command pipeline returned 1..10000 in order gate record PASS 8/8
gate · private-ETS property store · supervisor six gates refuse the architecture’s canonical crimes on stage gate record PASS 6/6
The law, the id anatomy, the evidence ethic, the map — and the course’s design exemplar.
B1Part I — the conceptual floor: the law, the contract read as architecture, the storage economics, time inside the name.
B2Part II — the reference implementation: systems as OTP applications, property stores, CHAMP, archetypes, relations.
B3Part III — owned wire, declared keys, jobs as entities, the state machine in Lua, the connector.
B4Part IV — the near-cache: branded keys, local speed, coherence by mint time.
Part V — the runtime that proves the canon needs no linking.
Part VI — the brand in the type system, and Rust paying its way through V8.
Part VII — machines, the local replica, FLAME ephemeral execution, observability.
Part VIII — the capstone assembly: the Disruptor-seat ring and the single-writer Decider, the journal and the ledger, strategies as deciders, the scale-out by the audited hash.
The course mirrors a book being written in this repository. B1–B3 build over written Parts (Part III is in progress); the manuscript plans Parts IV–VIII. A chapter card becomes a link when its pages ship — and not before.
The bus B3 narrates, taught rung by rung: the emq:{q}: keyspace, the Lua inventory, conformance on Valkey.
/redis-patternsThe substrate patterns under the bus: sorted sets, atomic Lua moves, locks, streams — the judgement layer.
/elixirThe Portal engine, and the umbrella where echo_data — the production identity library — lives.
Sources
Related