code wiki / _hdl_build / nx_capsweep_gate.nx
nx_capsweep_gate.nx
buildroot/runtime/_hdl_build/nx_capsweep_gate.nx
about
nx_capsweep_gate.nx -- teeth over nx_capsweep_lib. IN-PROCESS, with every fixture assembled IN MEMORY.
WHY IN-PROCESS AND WHY NO FIXTURE FILES: a gate that forks the deployed elf measures whatever artifact
happens to be installed, and a gate that writes scratch under knowledge/store shares its fixture with a
production beat -- the estate has measured both defects. Every function under test here is PURE over a
caller-supplied buffer, so the fixtures are built in RAM, nothing is written anywhere, and a mutation
reaches every rule instead of stopping at a fork boundary.
THE TOOTH THAT MATTERS IS T14 and it was named by a sibling seat reviewing this organ: hide a unit that IS
on the surface and assert the on-surface count FALLS. Every other tooth here proves the arithmetic is
self-consistent, and a partition can reconcile perfectly while the classifier reads the wrong column.
★A RECONCILING PARTITION IS EVIDENCE THE ARITHMETIC IS CONSISTENT, NEVER THAT THE CLASSIFIER IS RIGHT.
dependencies 3 imports · 0 importers
imports: nx_syscalls.nxnx_gate_verdict.nxnx_capsweep_lib.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
| 18 | const CG_BUF: i64 = 65536 |
| 19 | const CG_SMALLCAP: i64 = 2 // a deliberately tiny table, so the truncation tooth can actually fill it |
functions
| 21 | func cg_put(b: *u8, at: i64, s: *u8) -> i64 |
| 30 | func cg_row(b: *u8, at: i64, name: *u8, surf: *u8) -> i64 |
| 45 | func cg_count_on_surface(surf: *i64, n: i64) -> i64 called by 1: main |
| 55 | func main() -> i64 |