jonnify·bcs /bcs/bus/fence-and-keyspace/the-fence-live

B3.1 · dive 2 — the fence, live

The fence answers through itself.

F3 performs the part's second law on a running wire and lets the proof be self-referential: the read that confirms the fence travels through a connection that could not exist had the fence not held. F4 proves the wire's binary discipline through the queue's own keys.

Source: content/bcs3.1.md, quoting bcs_rung_3_1_check.out; the inherited negative-path evidence is the appendix's frozen record beside content/bcsA.md.

The fence handshake, walked. The boot path on top, the refusal branch below. Select a scenario; the readout walks its committed steps.
boot supervised GET {emq}:version the first command echomq:2.0.0 the fence holds serve the wire opens {:version_fence typed refusal — inherited from the appendix's record
readout · Select a scenario. One path serves, one refuses with a typed error, one re-fences after a supervised restart — all three stand in committed records.
§1

The transcript

bcs_rung_3_1_check.out · verbatim · this dive reads F3 and F4
content/echo_data/runtimes/elixir/bcs_rung_3_1_check.out · verbatimfrozen
F1 map ok -- the part's map: emq:{orders}:pending | emq:{orders}:job:ORD0NgWEfAEJfs | {emq}:version | {emq}:locks -- 17 bytes before the payload
F2 gate ok -- the job position is gated: a fourteen-byte decimal and a fourteen-byte slug both raise before any wire is touched; kind policy waits for the enqueue script
F3 fence ok -- the fence holds on a live wire: GET {emq}:version answers echomq:2.0.0 through the fenced connector itself
F4 binary ok -- binary payloads with embedded CRLF and NUL survive 500/500 round trips through job keys in two pipelines
F5 slot ok -- co-location law: pending, active, meta, and the job row of {orders} all answer slot 105; {fills} answers 4165 -- multi-key scripts stay legal on the clustered day (vector 12739 holds)
PASS 5/5
§2

F3 — the fence on a live wire

content/bcs3.1.md · What · citing content/bcsA.md

F3 performs the part's second law on a running wire and lets the proof be self-referential: GET {emq}:version answers echomq:2.0.0 through the fenced connector itself — the read that confirms the fence travels through a connection that could not exist had the fence not held.

The negative path is inherited, not re-run: the appendix's frozen record holds the typed refusal of a bogus version and the re-fence after supervised restart, and the part's evidence policy reads records rather than repeating them. The appendix's prose carries the three committed facts the walk above draws on: the fence claimed echomq:2.0.0 on a fresh keyspace and refused the planted mismatch with a typed {:version_fence error; the killed connector was supervisor-restarted, re-fenced, and served; and the connector gate ran against live Valkey.

§3

F4 — binary discipline through the queue's own keys

content/bcs3.1.md · What

Payloads will be serialized terms, and serialized terms carry exactly the bytes a line-oriented protocol breaks on. F4 writes five hundred jobs whose bodies embed CRLF and NUL through real job keys and reads them back: binary payloads with embedded CRLF and NUL survive 500/500 round trips through job keys in two pipelines — the length-prefixed bulk strings of the protocol doing exactly the work they were designed for, exercised in the very shapes this part will use.

One payload, two readers. A fixed 12-byte demo value with an embedded CRLF and an embedded NUL — qty=7\r\nfill\0 — addressed to the committed job key. Select a framing; the readout computes what comes back.
readout · Select a framing. The length-prefixed reader takes a declared byte count; the line-oriented reader scans for the first CRLF — only one of them returns the value byte-identical.

The demo value is the page's own fixed dataset; the committed figure is the transcript's — 500/500 round trips through real job keys, in two pipelines.

§4

References

sources · related

Sources

Related