nx_chat_store_gate.nx
buildroot/runtime/nx_chat_store_gate.nx
about
nx_chat_store_gate.nx -- REFEREE for C1 (nx_chat_store, contract cs_store_forward). END-TO-END:
writes its own fixture conf (store_root pointed at /tmp/csgate/ so production planes are never
touched -- a gate must not share its fixture with a production beat), forks the PROMOTED elf per
verb, and reads every answer back from the store through the organ itself.
It proves the DONE-RULE pre-declared in comms.plan before the organ existed:
"a message sent to an offline member is delivered on reconnect byte-identical and in order;
history survives room close; additive-only with soft-delete; REFUSES loudly at its conf-named
size budget instead of silently dropping."
Process-survival is structural here: EVERY verb is its own fork, so anything T6 replays was
written by an earlier, already-dead process. NEGATIVE CONTROLS: reopen, regress, budget-msgs,
budget-bytes, body-too-big, room-absent (absent is not empty), bad-kind, double-delete.
Fixture rooms are epoch-suffixed so every run is fresh (idempotent gate law) and live in /tmp.
license_tier: ORIGINAL expect_exit: 0
dependencies 3 imports · 0 importers
imports: nx_syscalls.nxnx_tool_run.nxnx_gate_verdict.nx
imported by: nobody (leaf or entry point)
call flow from main pre-order; caps 40 nodes / depth 6 declared; ↻ = already shown
structs
| none |
consts
| 17 | const CSG_CAP: i64 = 65536 |
functions
| 18 | func csg_len(s: *u8) -> i64 { var n: i64 = 0; while s[n] != (0 as u8) { n = n + 1 } return n } |
| 19 | func csg_write(path: *u8, s: *u8) -> i64 |
| 28 | func csg_read(path: *u8, buf: *u8, cap: i64) -> i64 |
| 36 | func csg_count(buf: *u8, n: i64, needle: *u8) -> i64 |
| 49 | func csg_find(buf: *u8, n: i64, needle: *u8) -> i64 |
| 64 | func csg_seghex(room: *u8, needle: *u8, buf: *u8, cap: i64) -> i64 |
| 81 | func main(argc: i64, argv: *i64) -> i64 |