code wiki / _hdl_build / nx_sensor_gap_census.nx
nx_sensor_gap_census.nx
buildroot/runtime/_hdl_build/nx_sensor_gap_census.nx
about
nx_sensor_gap_census.nx -- THE live 4-axis SENSOR-DEPTH risk map across every gate in runtime/_hdl_build.
Answers the operator's "get the gap in sensors fixed across the nishi environment": for the WHOLE gate
universe, what fraction carries each of the four SENSORS that make a verdict trustworthy --
1 LIAR-KILLER (neg-control / physics-invariant / evidence-grounding) -> can't pass a GAMED number
2 REGRESSION BASE (stored baseline + no-backslide) -> can't SILENTLY backslide
3 HANDOFF TELEMETRY (per-stage quality/bytes/time/fail) -> can LOCALIZE where it breaks
4 EXTERNAL-COMP (named industry oracle: x264/MSU, CUDA/WARP, V8, ...) -> EXTERNALLY judged not self-graded
Per [[feedback-handoff-chain-sota-gate-doctrine]] #1 rule a self-judged verdict is worthless; axis 4 is deepest.
Axis-4 here is a fast per-gate marker scan; the AUTHORITATIVE per-workstream WIRED/UNWIRED status lives in
nx_benchmark_suite_registry -- the two reconcile (this flags coverage; that names the suite).
Matching is CASE-INSENSITIVE (catches CUDA/X264/Baseline) with WORD-boundary mode for short ambiguous tokens
(so "red" does NOT match inside "REQUIRED"/"STRUCTURED" -- a universe-inflation gaming vector, liar-killed below).
This organ is ITSELF liar-killed: POS fixture classifies 5/5, NEG fixture 0/5, a REQUIRED/STRUCTURED neg-control
must NOT register as a verdict-emitter, classification is deterministic, and an UNREADABLE gate is counted BLIND
(never fabricated as covered). It carries a no-backslide regression gate on its OWN coverage
(knowledge/status/sensor_gap_baseline.tsv). It PRINTS the honest risk map REGARDLESS; GREEN = classifier
TRUSTWORTHY and coverage did NOT backslide (GREEN != "coverage good" -- the blind gates ARE the work).
Sovereign nx_cc->nxasm (no gcc, no sh). Run with CWD = nxc2 root. expect_exit: 0 license_tier: ORIGINAL
dependencies 6 imports · 0 importers
imports: syscalls.nxruntime.nxnx_axioms.nxnx_dirent.nxnx_fcntl.nxnx_handoff_gate.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
| 29 | const K_MAGIC_1048576: i64 = 1048576 |
| 30 | const K_MAGIC_16384: i64 = 16384 |
| 31 | const K_MAGIC_1024: i64 = 1024 |
functions
| 34 | func slen(s: *u8) -> i64 { var n: i64 = 0; while s[n] != (0 as u8) { n = n + 1 } return n } |
| 36 | func lc(c: i64) -> i64 { if c >= 65 { if c <= 90 { return c + 32 } } return c } called by 1: find_ci |
| 38 | func is_alnum(c: i64) -> i64 called by 1: find_ci |
| 46 | func streqz(a: *u8, b: *u8) -> i64 called by 1: main |
| 53 | func byte_copy(dst: *u8, src: *u8, n: i64) -> i64 called by 1: main |
| 60 | func find_ci(buf: *u8, lo: i64, hi: i64, ndl: *u8, word: i64) -> i64 |
| 85 | func has_any(buf: *u8, len: i64, set: *i64, modes: *i64, n: i64) -> i64 |
| 95 | func read_gate(path: *u8, buf: *u8, cap: i64) -> i64 |
| 110 | func ends_nx(name: *u8, len: i64) -> i64 called by 1: main |
| 118 | func pct(a: i64, b: i64) -> i64 { if b <= 0 { return 0 } return (100 * a) / b } called by 1: report |
| 120 | func report(tag: *u8, have: i64, univ: i64) -> i64 |
| 129 | func main() -> i64 |