OpenSentience.orgUnboxed PatternsConclusion · after 32 chapters

Front matter, at the back

Conclusion — what the patterns compose into

Thirty-two records, thirteen of them witnessed, twelve anti-patterns, six surfaces to animate them on, and one question the book set out to test: are the familiar architectures compositions of these patterns, or are the patterns a reading of them?

Three verbs, three artifacts

The stack this book is drawn from has three verbs and each pattern page shows all three. WRL describes: a world is a topology of durable identities joined by textured routes, and its meaning is a hash. TRVM reduces: a run of a sealed world is a Film that replays exactly, with a cost that names its strategy. The governance kernel decides: feasible, then permitted, then best, over a floor composition cannot weaken, with a certificate on every verdict.

On a pattern page those three appear as the WRL world beside the animation, the witness with its execution identity, and the counterexample that must be refused. Where a page has all three the pattern is WITNESSED. Where it has two, or one, or a prose note in place of a world, the page says which, and the label was derived by a build rather than typed by an author.

What the ladder says about a pattern

The eight rungs of the kernel are not the five families of this book, and the plan refuses the mapping on purpose: the rungs govern one decision — may this proceed, and is it best — while the families sort invariants by what they quantify over. What the ladder does say is which rung each pattern's refusal lives on. Refusing Join refuses on the alethic floor: a composition that violates a compose law cannot happen. Capability-Bounded Composition and Carrier Confinement refuse on the deontic rung: it can happen and may not. Evidence Before Claim and Refusal Gate refuse on the epistemic rung: we do not know enough to say. Progress Over Utilization and Progress-Aware Placement are the axiological gradient, best, and they are only reachable once the floor has spoken.

That is the admission principle the book took from its own review: a pattern states a local obligation, and satisfying it implies no global adequacy unless a theorem or a composition rule says so. The ladder is where such rules live.

The Worldware Factory as a derived architecture

Part VI asked whether familiar architectures derive from these patterns, and set a criterion: a composition of Parts I to V that seals, passes conformance, and reproduces the architecture's defining behaviour on agreed vectors. The first architecture to try is the one this stack already builds and calls the Worldware Factory: parallelize the work, prove the assemblies, formalize the joins, and let every station state the rung it has actually reached.

Read against the catalog, a station is an active locus with a mailbox and a carrier it does not own — Active Locus, Dormant But Alive, Locus Is Not Its Carrier. An assembly is an artifact whose identity is a seal and whose views are projections — Identity Is a Seal, Projection Not Duplication. A join is the refusing join, and the station's word for its evidence is the ledger's — Evidence Before Claim, Three-Valued Outcome for what an attempt at the world returns. The rung each station states is the one thing no pattern supplies: it is measured, and this catalog's own labels are an instance of that measurement.

Whether that reading is a derivation is exactly Part VI's open question. The honest position is that the factory page and this catalog were written from the same doctrine by the same people, so agreement between them is evidence of consistency, not of derivation. A derivation needs a WRL world of a station that seals, a Film of a join that refuses, and vectors a second implementation agrees on. None of those exists yet, and the plan lists them.

What the book found by being built

The plan's first draft summed its own labels to thirty-two over a thirty-row table. A summary file said the WRL suite had 890 checks when the suite passed 924. A counterexample marker turned out to be a failure string. A page that ran its witness threw because a probe had loaded the suite once already. Two lanes hold two standings for one law and neither cites the other. Five concepts the book needed had no name in the tree, and three of them still do not.

None of these is an aside. They are the reason every count on these pages is derived, every witness carries the hash of the bytes it ran on, every scene is labelled an illustration, and every chapter without evidence says so in its own prose. A pattern language that cannot be wrong about its own pages has no business telling anyone how to compose software.

What is still open

Six rulings, listed in the plan: the bare word locus in the subtitle; whether PROPOSED patterns may be named at all (this book has three and has, in practice, decided yes); print intent; a licence for the prose; a placement criterion for the five families; and a pinning policy for the two evidence repositories that have no origin. One law with two standings. A world boundary with no definition. A data layer at the spec rung behind one unruled question about where confidentiality comes from. Heredity specified and unwitnessed: the engine runs and has nothing to run on.

And the thing this conclusion cannot do: run a Film. The animations on these pages replay scene data, not sealed worlds, because reduction lives in TRVM and not in the browser. The day a page replays a Film, the picture becomes a witness and the edition becomes a hash. That is the next thing to build, and it is written down.

The chain — thirty-two fragments, one world

Each chapter contributed a fragment; the cumulative world was sealed after every one and checked to contain everything before it. Two chapters contributed the empty world and moved no id. The whole chain seals to sem-8fe22e0e468a46b82bce215f83cf0ee2f622cc5a94e952cdefca8e6dadd19bc2: 111 objects, 101 edges.

#chapterfragment seals tochain seals toobjects / edges
1Active Locussem-61ff2ac8fba36791…sem-61ff2ac8fba36791…3 / 2
2Record at a Boundarysem-49b97d6fb3786d8d…sem-530dc1a3e5ad1d19…4 / 3
3Locus Is Not Its Carriersem-e0d0aa48334d29ba…sem-cbc58d7b3cb6bf9a…9 / 8
4Identity Is a Sealsem-0738b04e54f45448…sem-9e5f93837672264d…12 / 11
5Continuity Through Reconstructionsem-bf7bdf27dbc86cfc…sem-f19a7a71ee9dc9b6…15 / 14
6Refusing Joinsem-92c126f2445a3b61…sem-be30c93f61ed401c…17 / 16
7Shared Observablesem-b1c7c86b18527894…sem-1a5ac07a8ea81036…20 / 19
8Semantic Membranesem-0a213fb326446d64…sem-8dbfe20bce2ff725…24 / 23
9Capability-Bounded Compositionsem-42e37b3bdb01acf9…sem-f6fa4a4715246112…28 / 27
10Carrier Confinementsem-ee08d1c837f35760…sem-14361f945ede4619…30 / 29
11Projection, Not Duplicationsem-7e9b02088e689d96…sem-42597d2b8f062a22…34 / 33
12Refusable Divergencesem-a2734400042b9cdb…sem-8ae9abf1764308bf…37 / 36
13Progress Over Utilizationsem-203ebe6c904f39e6…sem-65eebc48160508bc…45 / 42
14Dormant But Alivesem-f0998ba567e37b23…sem-1c7111f4db352d49…48 / 44
15Carrier Multiplexingsem-f6b2fd2004e277f5…sem-5600ca5f6490f64d…57 / 53
16Progress-Aware Placementsem-d9c7da8547beecaf…sem-d1eacd09cc312a58…62 / 57
17Proven Quiescencesem-3f0d499f7e69fc20…sem-ea73561d17a864cf…66 / 60
18Three-Valued Outcomesem-db31df29ee2f684e…sem-1247b4e08baaf67f…71 / 65
19Orthogonal Persistencesem-2f7cb882544ba87c…sem-f9b5f214740e3305…74 / 67
20Three Sizes of Worldsem-2ca883ccac604098…sem-ee97f22c94ad2b4e…76 / 68
21World Boundarysem-b5bdc908d2ce549a…sem-ee97f22c94ad2b4e…76 / 68
22Meaning Is a Hashsem-c66fd7afc7b435c9…sem-c592c564b68bf8e4…78 / 69
23Exact Replaysem-bccd2ab7d2bba016…sem-57d2e3599c2eac7a…82 / 72
24Cross-Machine Skill Replaysem-581521f1adf94e0d…sem-fcc13008b16ec8dc…87 / 77
25Confidentiality Under Content Addressingsem-b5bdc908d2ce549a…sem-fcc13008b16ec8dc…87 / 77
26Established, Not Knownsem-c1bc7910128802b8…sem-00fb7b692dc62f57…90 / 80
27State Does Not Grant Authoritysem-0ab417c00718d1f4…sem-e6779c4ebcb2ddcb…93 / 83
28Evidence Before Claimsem-b1b88c7dbc3335cd…sem-93035fc9c81c15f3…97 / 87
29Refusal Gatesem-17af9a11c5b42eba…sem-8c80e9196256af42…100 / 90
30Intervention Provenancesem-28af0fc6bf2e128c…sem-3a8432458a2c00cd…103 / 93
31Descent Is Not Dependencesem-2b6d00a2564ddb76…sem-7d698bd68aba8e4e…108 / 98
32Understanding Boundarysem-d55eddde7b7de757…sem-8fe22e0e468a46b8…111 / 101

The circuit board

How to read this board

Five kinds of object, two kinds of wire, and one band per Part of the book. Signal flows left to right: it starts at a clock, travels through relays, and ends at a door — or turns a spinner, which drives an orb. Nothing below is the book's own vocabulary; each line is quoted from where the definition lives.

shapeisand so
a clock; the only source of signalEvery signal on the board starts at one of these. Nothing else can make one.
a pass-through, so signal can travelOne arrives, any number leave — a relay that fans out is the board's router.
a sink; signal arrives and stopsIt latches what reached it and passes nothing on. A door is where a path ends.
rotation: takes signal, drives a poseThe only object on the board that holds a value a claim can rewrite — and only if its config says configurable.
the thing that gets movedIt is driven, never driving: an orb is what you watch to see whether anything happened.
not a WRL role — the book's own drawing of the receipts in the epoch's FilmIt counts what the run admitted, and turns red on a Rejected outcome.
SignalWiresignal: a sig_out to a sig_inLegal from a Pulser or Relay, into a Relay, Door or Spinner. This is how the board moves.
SocketControlcontrol: a socket to a poseLegal only from a Spinner into an Orb. At most one may land on any input port — fan-in is a typed refusal.

Hover any object for what it is, which chapter put it there, and every field of its line in that epoch's Film — split into what it is doing now and how it was built. Click to pin the readout, then click a wired name to follow the signal. The field definitions come from TRVM/forge/film.py (the emitter), TRVM/forge/forge_state.py (nf, derived from the decoded counter and never from t), TRVM/forge/lower_e2a.py (the commit/react law), TRVM/FORGE_SEMANTIC_IR_v1_MEASURE.md §1.3; the shapes from WRL/learn.html and WRL/docs/spec/README.md. The build refuses if a Film emits a field this key does not explain.

The whole world as a network: one band per Part, signal flowing left to right from the root clock and the other clock domains, through relays that fan out (the routers) into spinners (state), orbs (observation) and doors (the switches that latch when a signal reaches them). 101 wires, 77 of them signal, 40 relays, 17 doors, 9 clocks. Hover an object — or click the board and walk it with the arrow keys — and a readout gives its role, its Part, every field of its line in the Film for the epoch on screen, and which signals and socket controls reach it and which it reaches. Before you press Step there is no epoch yet, and the readout says so rather than showing you a state it does not have.

Reduced whole by TRVM's forge in 4027.3s on PX13 — 23 epochs, 23 distinct film hashes; the forge's id equals the seal above. Reduced by the reference reducer (pure Python); parity with the other reducer not run for this world.

compute surfaceI · The LocusII · CompositionIII · ProgressIV · Persistence and WorldV · Agencyal_locus · Spinneral_locusspinneral_view · Orbal_vieworbal_world · Pulseral_worldpulsercb_fixed · Spinnercb_fixedspinnercb_gate · Doorcb_gatedoorcb_in · Relaycb_inrelaycb_view · Orbcb_vieworbcc_carrier · Doorcc_carrierdoorcc_grant · Relaycc_grantrelaycm_in · Relaycm_inrelaycm_locus0 · Doorcm_locus0doorcm_locus1 · Doorcm_locus1doorcm_locus2 · Doorcm_locus2doorcm_locus3 · Doorcm_locus3doorcm_slot0 · Relaycm_slot0relaycm_slot1 · Relaycm_slot1relaycm_slot2 · Relaycm_slot2relaycm_slot3 · Relaycm_slot3relayct_in · Relayct_inrelayct_locus · Spinnerct_locusspinnerct_view · Orbct_vieworbcx_in · Relaycx_inrelaycx_machine0 · Relaycx_machine0relaycx_machine1 · Relaycx_machine1relaycx_replay0 · Doorcx_replay0doorcx_replay1 · Doorcx_replay1doordb_clock · Pulserdb_clockpulserdb_locus · Spinnerdb_locusspinnerdb_view · Orbdb_vieworbdd_child · Spinnerdd_childspinnerdd_cv · Orbdd_cvorbdd_in · Relaydd_inrelaydd_parent · Spinnerdd_parentspinnerdd_pv · Orbdd_pvorbec_in · Relayec_inrelayec_ledger · Doorec_ledgerdoorec_subject · Spinnerec_subjectspinnerec_witness · Orbec_witnessorben_act · Dooren_actdooren_established · Relayen_establishedrelayen_in · Relayen_inrelayer_a · Relayer_arelayer_b · Relayer_brelayer_clock · Pulserer_clockpulserer_player · Doorer_playerdoorip_in · Relayip_inrelayip_view · Orbip_vieworbip_world · Spinnerip_worldspinneris_id · Orbis_idorbis_in · Relayis_inrelayis_seal · Spinneris_sealspinnerlc_core · Relaylc_corerelaylc_locus · Spinnerlc_locusspinnerlc_machine · Relaylc_machinerelaylc_thread · Relaylc_threadrelaylc_view · Orblc_vieworbmh_clock · Pulsermh_clockpulsermh_gate · Doormh_gatedoorop_clock · Pulserop_clockpulserop_locus · Spinnerop_locusspinnerop_view · Orbop_vieworbpj_artifact · Spinnerpj_artifactspinnerpj_in · Relaypj_inrelaypj_view_a · Orbpj_view_aorbpj_view_b · Orbpj_view_borbpp_homeA · Relaypp_homeArelaypp_homeB · Relaypp_homeBrelaypp_in · Relaypp_inrelaypp_locus · Spinnerpp_locusspinnerpp_view · Orbpp_vieworbpq_a · Relaypq_arelaypq_b · Relaypq_brelaypq_clock · Pulserpq_clockpulserpq_done · Doorpq_donedoorpu_admitted · Orbpu_admittedorbpu_busy · Pulserpu_busypulserpu_hop0 · Relaypu_hop0relaypu_hop1 · Relaypu_hop1relaypu_hop2 · Relaypu_hop2relaypu_locus · Spinnerpu_locusspinnerpu_progress · Pulserpu_progresspulserpu_sink · Doorpu_sinkdoorrb_record · Orbrb_recordorbrd_in · Relayrd_inrelayrd_real · Spinnerrd_realspinnerrd_view · Orbrd_vieworbrg_in · Relayrg_inrelayrg_page · Doorrg_pagedoorrg_sufficiency · Relayrg_sufficiencyrelayrj_join · Doorrj_joindoorrj_r · Relayrj_rrelaysd_in · Relaysd_inrelaysd_state · Spinnersd_statespinnersd_view · Orbsd_vieworbsm_in · Relaysm_inrelaysm_inside · Spinnersm_insidespinnersm_outside_a · Orbsm_outside_aorbsm_outside_b · Orbsm_outside_borbso_in · Relayso_inrelayso_pose · Orbso_poseorbso_rotor · Spinnerso_rotorspinnerts_root · Doorts_rootdoorts_version · Pulserts_versionpulsertv_a · Orbtv_aorbtv_b · Orbtv_borbtv_fixed · Spinnertv_fixedspinnertv_in · Relaytv_inrelaytv_open · Spinnertv_openspinnerub_in · Relayub_inrelayub_locus · Spinnerub_locusspinnerub_view · Orbub_vieworb

The same film, chapter by chapter

compute surfacesigsigsigsigsigsigsigsigsigsigsigsigsigsigsigsigsigsigsigsigsigsigsigsigsigsigsigsigsigsigsigsigsigsigsigsigsigsigsigsigsigsigsigsigsigsigsigsigsigsigsigsigsigsigsigsigsigsigsigsigsigsigsigsigsigsigsigsigsigsigsigsigsigsigsigsigsigsocketsocketsocketsocketsocketsocketsocketsocketsocketsocketsocketsocketsocketsocketsocketsocketsocketsocketsocketsocketsocketsocketsocketsocketal_locus · Spinneral_locusspinneral_view · Orbal_vieworbal_world · Pulseral_worldpulsercb_fixed · Spinnercb_fixedspinnercb_gate · Doorcb_gatedoorcb_in · Relaycb_inrelaycb_view · Orbcb_vieworbcc_carrier · Doorcc_carrierdoorcc_grant · Relaycc_grantrelaycm_in · Relaycm_inrelaycm_locus0 · Doorcm_locus0doorcm_locus1 · Doorcm_locus1doorcm_locus2 · Doorcm_locus2doorcm_locus3 · Doorcm_locus3doorcm_slot0 · Relaycm_slot0relaycm_slot1 · Relaycm_slot1relaycm_slot2 · Relaycm_slot2relaycm_slot3 · Relaycm_slot3relayct_in · Relayct_inrelayct_locus · Spinnerct_locusspinnerct_view · Orbct_vieworbcx_in · Relaycx_inrelaycx_machine0 · Relaycx_machine0relaycx_machine1 · Relaycx_machine1relaycx_replay0 · Doorcx_replay0doorcx_replay1 · Doorcx_replay1doordb_clock · Pulserdb_clockpulserdb_locus · Spinnerdb_locusspinnerdb_view · Orbdb_vieworbdd_child · Spinnerdd_childspinnerdd_cv · Orbdd_cvorbdd_in · Relaydd_inrelaydd_parent · Spinnerdd_parentspinnerdd_pv · Orbdd_pvorbec_in · Relayec_inrelayec_ledger · Doorec_ledgerdoorec_subject · Spinnerec_subjectspinnerec_witness · Orbec_witnessorben_act · Dooren_actdooren_established · Relayen_establishedrelayen_in · Relayen_inrelayer_a · Relayer_arelayer_b · Relayer_brelayer_clock · Pulserer_clockpulserer_player · Doorer_playerdoorip_in · Relayip_inrelayip_view · Orbip_vieworbip_world · Spinnerip_worldspinneris_id · Orbis_idorbis_in · Relayis_inrelayis_seal · Spinneris_sealspinnerlc_core · Relaylc_corerelaylc_locus · Spinnerlc_locusspinnerlc_machine · Relaylc_machinerelaylc_thread · Relaylc_threadrelaylc_view · Orblc_vieworbmh_clock · Pulsermh_clockpulsermh_gate · Doormh_gatedoorop_clock · Pulserop_clockpulserop_locus · Spinnerop_locusspinnerop_view · Orbop_vieworbpj_artifact · Spinnerpj_artifactspinnerpj_in · Relaypj_inrelaypj_view_a · Orbpj_view_aorbpj_view_b · Orbpj_view_borbpp_homeA · Relaypp_homeArelaypp_homeB · Relaypp_homeBrelaypp_in · Relaypp_inrelaypp_locus · Spinnerpp_locusspinnerpp_view · Orbpp_vieworbpq_a · Relaypq_arelaypq_b · Relaypq_brelaypq_clock · Pulserpq_clockpulserpq_done · Doorpq_donedoorpu_admitted · Orbpu_admittedorbpu_busy · Pulserpu_busypulserpu_hop0 · Relaypu_hop0relaypu_hop1 · Relaypu_hop1relaypu_hop2 · Relaypu_hop2relaypu_locus · Spinnerpu_locusspinnerpu_progress · Pulserpu_progresspulserpu_sink · Doorpu_sinkdoorrb_record · Orbrb_recordorbrd_in · Relayrd_inrelayrd_real · Spinnerrd_realspinnerrd_view · Orbrd_vieworbrg_in · Relayrg_inrelayrg_page · Doorrg_pagedoorrg_sufficiency · Relayrg_sufficiencyrelayrj_join · Doorrj_joindoorrj_r · Relayrj_rrelaysd_in · Relaysd_inrelaysd_state · Spinnersd_statespinnersd_view · Orbsd_vieworbsm_in · Relaysm_inrelaysm_inside · Spinnersm_insidespinnersm_outside_a · Orbsm_outside_aorbsm_outside_b · Orbsm_outside_borbso_in · Relayso_inrelayso_pose · Orbso_poseorbso_rotor · Spinnerso_rotorspinnerts_root · Doorts_rootdoorts_version · Pulserts_versionpulsertv_a · Orbtv_aorbtv_b · Orbtv_borbtv_fixed · Spinnertv_fixedspinnertv_in · Relaytv_inrelaytv_open · Spinnertv_openspinnerub_in · Relayub_inrelayub_locus · Spinnerub_locusspinnerub_view · Orbub_vieworb
The whole world, as WRL (355 lines)
profile forge.world.core.v1

; ACTIVE LOCUS — where state, authority, observation and continuity couple. al_world is the book's ROOT
; CLOCK: the world's transition relation. al_locus carries state (a rotor), holds authority (configurable:
; it ACCEPTS runtime writes), al_view is what can be observed of it. Every later chapter is wired,
; directly or through routers, to this clock or to one of the book's other clock domains.
[pulser:al_world](every 1){sig_out}
[spinner:al_locus](w=16, n=8, rotor=quarter_turn_z, configurable){sig_in, socket}
[orb:al_view]{pose}

[al_world] --sig--> [al_locus]
[al_locus] --socket--> [al_view]

; RECORD AT A BOUNDARY — a record is a projection taken at a boundary; it never acts. rb_record has NO
; controller here: in the chain it is fed by chapter 1's locus. A pose is a record of a rotor at the socket.
[orb:rb_record]{pose}

; the record records chapter 1's locus, at the socket boundary — fan-out from one socket is unrestricted
[al_locus] --socket--> [rb_record]

; LOCUS IS NOT ITS CARRIER — one signal through three carriers; the locus's state is unchanged by which relay
; carried it. lc_thread is this chapter's ENTRY (open port); thread → core → machine are relays: replaceable
; embodiments — and, in the chain, ROUTERS other chapters draw from.
[relay:lc_thread]{sig_in, sig_out}
[relay:lc_core]{sig_in, sig_out}
[relay:lc_machine]{sig_in, sig_out}
[spinner:lc_locus](w=16, n=8, rotor=quarter_turn_z){sig_in, socket}
[orb:lc_view]{pose}

[lc_thread] --sig--> [lc_core]
[lc_core] --sig--> [lc_machine]
[lc_machine] --sig--> [lc_locus]
[lc_locus] --socket--> [lc_view]

; the root clock drives the carrier chain
[al_world] --sig--> [lc_thread]

; IDENTITY IS A SEAL — the named rotor `identity` is the unit; the world's id is the hash of this text's
; canonical form. is_in is the entry; in the chain it is fed by the machine router of chapter 3.
[relay:is_in]{sig_in, sig_out}
[spinner:is_seal](w=16, n=8, rotor=identity){sig_in, socket}
[orb:is_id]{pose}

[is_in] --sig--> [is_seal]
[is_seal] --socket--> [is_id]

[lc_machine] --sig--> [is_in]

; CONTINUITY THROUGH RECONSTRUCTION — a configurable locus whose state is RE-ESTABLISHED by a claim at
; epoch 2 (SetRotor, receipt Applied). ct_in is the entry; in the chain the core router of chapter 3 feeds it.
[relay:ct_in]{sig_in, sig_out}
[spinner:ct_locus](w=16, n=8, rotor=quarter_turn_z, configurable){sig_in, socket}
[orb:ct_view]{pose}

[ct_in] --sig--> [ct_locus]
[ct_locus] --socket--> [ct_view]

[lc_core] --sig--> [ct_in]

; REFUSING JOIN — a Door admits exactly one signal wire. rj_r is the entry AND Part II's router: in the chain
; it is fed by the machine router and feeds the composition chapters. The refused variant is beside this.
[relay:rj_r]{sig_in, sig_out}
[door:rj_join]{sig_in}

[rj_r] --sig--> [rj_join]

[lc_machine] --sig--> [rj_r]

; SHARED OBSERVABLE — the rotor determines the pose and is in the Film; a numeric fault on the orb is seeded
; as INITIAL runtime state and healed by ResetFault at epoch 3. so_in is the entry, fed by Part II's router.
[relay:so_in]{sig_in, sig_out}
[spinner:so_rotor](w=16, n=8, rotor=quarter_turn_z, configurable){sig_in, socket}
[orb:so_pose]{pose}

[so_in] --sig--> [so_rotor]
[so_rotor] --socket--> [so_pose]

[rj_r] --sig--> [so_in]

; SEMANTIC MEMBRANE — one rotor, two projections: the membrane exposes the pose and nothing of the rotor's
; representation. Fan-out from a socket is unrestricted. sm_in is the entry.
[relay:sm_in]{sig_in, sig_out}
[spinner:sm_inside](w=16, n=8, rotor=quarter_turn_z){sig_in, socket}
[orb:sm_outside_a]{pose}
[orb:sm_outside_b]{pose}

[sm_in] --sig--> [sm_inside]
[sm_inside] --socket--> {[sm_outside_a], [sm_outside_b]}

[rj_r] --sig--> [sm_in]

; CAPABILITY-BOUNDED COMPOSITION — cb_fixed is feasible to write to and NOT permitted (no `configurable`):
; the claim at epoch 1 is Rejected(not_configurable). cb_in fans out to the spinner and to the gate (a Door).
[relay:cb_in]{sig_in, sig_out}
[spinner:cb_fixed](w=16, n=8, rotor=quarter_turn_z){sig_in, socket}
[orb:cb_view]{pose}
[door:cb_gate]{sig_in}

[cb_in] --sig--> {[cb_fixed], [cb_gate]}
[cb_fixed] --socket--> [cb_view]

[rj_r] --sig--> [cb_in]

; CARRIER CONFINEMENT — the carrier (a Door) opens only through the grant (a relay); nothing else can reach
; its one input port. cc_grant is the entry and a router: chapters 11 and 12 draw from it.
[relay:cc_grant]{sig_in, sig_out}
[door:cc_carrier]{sig_in}

[cc_grant] --sig--> [cc_carrier]

[cb_in] --sig--> [cc_grant]

; PROJECTION, NOT DUPLICATION — pj_view_a and pj_view_b are both derived from pj_artifact through
; SocketControl; neither is a copy. pj_in is the entry, fed by the grant router.
[relay:pj_in]{sig_in, sig_out}
[spinner:pj_artifact](w=16, n=8, rotor=quarter_turn_z){sig_in, socket}
[orb:pj_view_a]{pose}
[orb:pj_view_b]{pose}

[pj_in] --sig--> [pj_artifact]
[pj_artifact] --socket--> {[pj_view_a], [pj_view_b]}

[cc_grant] --sig--> [pj_in]

; REFUSABLE DIVERGENCE — a claim naming a target the world does not have is Rejected(unknown_spinner) by
; name, with a receipt. rd_in is the entry, fed by the grant router.
[relay:rd_in]{sig_in, sig_out}
[spinner:rd_real](w=16, n=8, rotor=quarter_turn_z, configurable){sig_in, socket}
[orb:rd_view]{pose}

[rd_in] --sig--> [rd_real]
[rd_real] --socket--> [rd_view]

[cc_grant] --sig--> [rd_in]

; PROGRESS OVER UTILIZATION — TWO CLOCK DOMAINS: pu_busy fires every epoch into three relays that only
; relocate the signal; pu_progress fires every 2 and turns a rotor. Busy is not the same as admitted.
; pu_hop1 is also Part III's router in the chain.
[pulser:pu_busy](every 1){sig_out}
[relay:pu_hop*3]{sig_in, sig_out}
[door:pu_sink]{sig_in}
[pulser:pu_progress](every 2){sig_out}
[spinner:pu_locus](w=16, n=8, rotor=quarter_turn_z){sig_in, socket}
[orb:pu_admitted]{pose}

[pu_busy] --sig--> [pu_hop0]
[pu_hop0] --sig--> [pu_hop1]
[pu_hop1] --sig--> [pu_hop2]
[pu_hop2] --sig--> [pu_sink]
[pu_progress] --sig--> [pu_locus]
[pu_locus] --socket--> [pu_admitted]

; DORMANT BUT ALIVE — its OWN clock domain, with phase 3: the locus receives nothing for three epochs and is
; fully defined the whole time; at epoch 4 it turns. Dormant is a placement fact, not a liveness fact.
[pulser:db_clock](every 4, phase 3){sig_out}
[spinner:db_locus](w=16, n=8, rotor=quarter_turn_z){sig_in, socket}
[orb:db_view]{pose}

[db_clock] --sig--> [db_locus]
[db_locus] --socket--> [db_view]

; CARRIER MULTIPLEXING — the floor's signal arrives at cm_in (a router) and fans out to four slots (relays),
; each carrying to a locus (a Door that opens when its signal arrives). Replication `*4` is the language's own.
[relay:cm_in]{sig_in, sig_out}
[relay:cm_slot*4]{sig_in, sig_out}
[door:cm_locus*4]{sig_in}

[cm_in] --sig--> {[cm_slot0], [cm_slot1], [cm_slot2], [cm_slot3]}
[cm_slot0] --sig--> [cm_locus0]
[cm_slot1] --sig--> [cm_locus1]
[cm_slot2] --sig--> [cm_locus2]
[cm_slot3] --sig--> [cm_locus3]

; the busy clock's second hop is the floor's router
[pu_hop1] --sig--> [cm_in]

; PROGRESS-AWARE PLACEMENT — two homes (relays); the locus is placed on pp_homeB, where the signal reaches
; it. pp_homeA has nothing resident and nothing arrives: the fair home, idle. pp_in is the entry.
[relay:pp_in]{sig_in, sig_out}
[relay:pp_homeA]{sig_in, sig_out}
[relay:pp_homeB]{sig_in, sig_out}
[spinner:pp_locus](w=16, n=8, rotor=quarter_turn_z){sig_in, socket}
[orb:pp_view]{pose}

[pp_in] --sig--> [pp_homeB]
[pp_homeB] --sig--> [pp_locus]
[pp_locus] --socket--> [pp_view]

; slot 0 of the multiplexer routes to home B
[cm_slot0] --sig--> [pp_in]

; PROVEN QUIESCENCE — its OWN clock domain: pq_clock fires ONCE at epoch 2 and is then done; the signal is
; still travelling through two relays and opens the Door later. The pulser's silence is not completion.
; pq_b is a router: chapter 18 draws from the quiescence chain's last relay.
[pulser:pq_clock](once at 2){sig_out}
[relay:pq_a]{sig_in, sig_out}
[relay:pq_b]{sig_in, sig_out}
[door:pq_done]{sig_in}

[pq_clock] --sig--> [pq_a]
[pq_a] --sig--> [pq_b]
[pq_b] --sig--> [pq_done]

; THREE-VALUED OUTCOME — two claims in one batch: one Applied (tv_open is configurable), one Rejected
; (tv_fixed is not). The third value has no forge counterpart: a Film is total. tv_in is the entry.
[relay:tv_in]{sig_in, sig_out}
[spinner:tv_open](w=16, n=8, rotor=quarter_turn_z, configurable){sig_in, socket}
[spinner:tv_fixed](w=16, n=8, rotor=quarter_turn_z){sig_in, socket}
[orb:tv_a]{pose}
[orb:tv_b]{pose}

[tv_in] --sig--> {[tv_open], [tv_fixed]}
[tv_open] --socket--> [tv_a]
[tv_fixed] --socket--> [tv_b]

; the once-clock's chain, after it has gone quiet, is what this chapter's attempts ride on
[pq_b] --sig--> [tv_in]

; ORTHOGONAL PERSISTENCE — its OWN slow clock domain (every 3): the rotor persists between ticks without the
; locus asking to be saved; where the state physically lives between epochs is the runtime's business.
[pulser:op_clock](every 3){sig_out}
[spinner:op_locus](w=16, n=8, rotor=quarter_turn_z){sig_in, socket}
[orb:op_view]{pose}

[op_clock] --sig--> [op_locus]
[op_locus] --socket--> [op_view]

; THREE SIZES OF WORLD — this fragment is a WRL GRAPH (the smallest size). ts_version fires ONCE at epoch 3:
; a version is a root taken at an instant. The chain so far is the graph; its seal is a wrl_head.
[pulser:ts_version](once at 3){sig_out}
[door:ts_root]{sig_in}

[ts_version] --sig--> [ts_root]

; WORLD BOUNDARY — GAP. Nothing in the tree defines the boundary, so this fragment declares nothing: the
; EMPTY WORLD, which WRL seals. The chain's id does not move here — this comment is not meaning.

; MEANING IS A HASH — its OWN clock domain and a door; the variant beside this changes `every 3` to `every 4`
; and seals to a different id. There is no version number to consult.
[pulser:mh_clock](every 3){sig_out}
[door:mh_gate]{sig_in}

[mh_clock] --sig--> [mh_gate]

; EXACT REPLAY — its OWN clock domain into a relay chain and a Door; the runner reduces this world TWICE and
; the build refuses unless both runs produce identical Film hashes. er_a is Part V's router in the chain.
[pulser:er_clock](every 2){sig_out}
[relay:er_a]{sig_in, sig_out}
[relay:er_b]{sig_in, sig_out}
[door:er_player]{sig_in}

[er_clock] --sig--> [er_a]
[er_a] --sig--> [er_b]
[er_b] --sig--> [er_player]

; CROSS-MACHINE SKILL REPLAY — one signal, two machines (replicated relays), two doors that open at the same
; epoch. cx_in is the entry; the machines are `*2`; cx_machine0 routes on to Part V.
[relay:cx_in]{sig_in, sig_out}
[relay:cx_machine*2]{sig_in, sig_out}
[door:cx_replay*2]{sig_in}

[cx_in] --sig--> {[cx_machine0], [cx_machine1]}
[cx_machine0] --sig--> [cx_replay0]
[cx_machine1] --sig--> [cx_replay1]

[er_a] --sig--> [cx_in]

; CONFIDENTIALITY UNDER CONTENT ADDRESSING — OPEN. The ruling is about keys, not topology. This fragment is
; the empty world: nothing is declared until studbook §10.2 is ruled.

; ESTABLISHED, NOT KNOWN — an observation (en_in) passes through en_established before it can act on the
; Door. en_established is Part V's router: chapters 27 and 28 draw from it.
[relay:en_in]{sig_in, sig_out}
[relay:en_established]{sig_in, sig_out}
[door:en_act]{sig_in}

[en_in] --sig--> [en_established]
[en_established] --sig--> [en_act]

[cx_machine0] --sig--> [en_in]

; STATE DOES NOT GRANT AUTHORITY — sd_state has state (a rotor) and no grant (not configurable). The claim at
; epoch 1 is Rejected(not_configurable). sd_in is the entry, fed by the established router.
[relay:sd_in]{sig_in, sig_out}
[spinner:sd_state](w=16, n=8, rotor=quarter_turn_z){sig_in, socket}
[orb:sd_view]{pose}

[sd_in] --sig--> [sd_state]
[sd_state] --socket--> [sd_view]

[en_established] --sig--> [sd_in]

; EVIDENCE BEFORE CLAIM — a claim at epoch 2 becomes a receipt with an outcome, in the Film, before anything
; downstream may cite it. ec_in is the entry and a router (chapter 29 draws from it); ec_ledger is a Door
; with an open port the chain feeds from the root clock.
[relay:ec_in]{sig_in, sig_out}
[spinner:ec_subject](w=16, n=8, rotor=quarter_turn_z, configurable){sig_in, socket}
[orb:ec_witness]{pose}
[door:ec_ledger]{sig_in}

[ec_in] --sig--> [ec_subject]
[ec_subject] --socket--> [ec_witness]

[en_established] --sig--> [ec_in]
; the ledger is fed by chapter 1's root clock: the same transition relation, one wire, one port
[al_world] --sig--> [ec_ledger]

; REFUSAL GATE — the page is a Door; material must pass rg_sufficiency (a relay, and a router) to open it.
; rg_in is the entry, fed by the evidence router.
[relay:rg_in]{sig_in, sig_out}
[relay:rg_sufficiency]{sig_in, sig_out}
[door:rg_page]{sig_in}

[rg_in] --sig--> [rg_sufficiency]
[rg_sufficiency] --sig--> [rg_page]

[ec_in] --sig--> [rg_in]

; INTERVENTION PROVENANCE — two writers (w=7, w=9) intervene on the same locus; every receipt names its writer
; and sequence. ip_in is the entry, fed by the sufficiency router.
[relay:ip_in]{sig_in, sig_out}
[spinner:ip_world](w=16, n=8, rotor=quarter_turn_z, configurable){sig_in, socket}
[orb:ip_view]{pose}

[ip_in] --sig--> [ip_world]
[ip_world] --socket--> [ip_view]

[rg_sufficiency] --sig--> [ip_in]

; DESCENT IS NOT DEPENDENCE — dd_child is fed by the same router as dd_parent (it descended from the same
; world). A claim sets the parent's rotor at epoch 2; the child's rotor does not move. dd_in is the entry.
[relay:dd_in]{sig_in, sig_out}
[spinner:dd_parent](w=16, n=8, rotor=quarter_turn_z, configurable){sig_in, socket}
[spinner:dd_child](w=16, n=8, rotor=quarter_turn_z, configurable){sig_in, socket}
[orb:dd_pv]{pose}
[orb:dd_cv]{pose}

[dd_in] --sig--> {[dd_parent], [dd_child]}
[dd_parent] --socket--> [dd_pv]
[dd_child] --socket--> [dd_cv]

[rg_sufficiency] --sig--> [dd_in]

; UNDERSTANDING BOUNDARY — two writers claim the same locus in one batch; both are Applied and the later
; canonical wins; the Film's `recognition:` lines are the register between observed and believed. ub_in is
; the entry — the last module on the board, fed by the descent router.
[relay:ub_in]{sig_in, sig_out}
[spinner:ub_locus](w=16, n=8, rotor=quarter_turn_z, configurable){sig_in, socket}
[orb:ub_view]{pose}

[ub_in] --sig--> [ub_locus]
[ub_locus] --socket--> [ub_view]

[dd_in] --sig--> [ub_in]

The numbers this page is allowed to quote

32 records · 13 WITNESSED · 14 STATED · 3 PROPOSED · 12 anti-patterns · 1 WRL worlds sealed at build and 3 refused by design · 0 worlds with a Film reduced by TRVM's forge (0 epochs) — every one derived by build.mjs, none typed.

67 prior-art relations are recorded, each with what it shares and where it differs, and 2 of them are marked NOT SEARCHED — named in this tree by someone who never opened the source. Every record also states what it does not establish. 0 of 32 have been reproduced outside this tree, which is the rung above everything on this page and the one nothing here has reached.

Of the 8 counterexamples that point at a file, 1 resolves a law id against the suite's own index, 1 is scoped to its law's declaration without an index to resolve against, and 6 check only that a string is present. A string being present proves a file mentions something, not that it refuses anything — and this catalog has now twice cited a law's failure message as evidence that the failure does not happen, the second time in a record that carried no law id and so never reached the check written for the first. Each page says which of the three it has.