nx_claim_metric_audit.nx
buildroot/runtime/nx_claim_metric_audit.nx
about
nx_claim_metric_audit.nx -- THE CLAIM-METRIC ALIGNMENT axis of the SOVEREIGN SOTA auditor (2026-07-04).
Operator: the browser-font episode "hit the nail that needs to be added to our state-of-the-art auditing
of our whole ecosystem." That nail: OCR proved LEGIBILITY, but I claimed VISUAL QUALITY -- the metric
measured a DIFFERENT (easier) property than the claim, and it had no reference it could FAIL against.
That is a distinct root flaw from nx_rung_eval's "asserted, not proven": here the property IS proven, but
it is the WRONG property, or proven unfalsifiably. This organ makes that flaw a permanent, liar-killed,
prove-not-assert check, composed into the evaluator system (emits the same EVAL-COORD line).
THE LAW (checkable by scanning the census's own source): a census/gate that emits a QUALITY or EXCEED
CLAIM (parity/exceed/ahead/matched/professional/SOTA/beats...) is GROUNDED only if it ALSO:
(A) REFERENCE -- compares against a REAL EXTERNAL reference (a competitor artifact / ground truth),
not merely its own output; and
(B) CAN-FAIL -- carries a falsifiability control that proves the metric can score BADLY
(a liar-kill / negative control / discrimination check / must-fail case).
Claim WITHOUT (A and B) = UNGROUNDED = a proxy or unfalsifiable claim = the flaw. Reported per-census with
WHICH leg is missing, so it is actionable. LIAR-KILLED: known-grounded censuses must read GROUNDED and a
synthetic claim-with-no-grounding fixture MUST read UNGROUNDED; else the auditor declares ITSELF broken.
license_tier: ORIGINAL expect_exit: 0
dependencies 1 imports · 0 importers
imports: nx_syscalls.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
| 21 | const CMA_MAGIC_1024: i64 = 1024 |
| 22 | const CMA_MAGIC_65536: i64 = 65536 |
| 24 | const CMA_BUF: i64 = 2097152 |
functions
| 37 | func cma_puts(s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} sys_write(1,s,n); return 0 } |
| 38 | func cma_putn(v: i64) -> i64 { if v==0 { sys_write(1,"0" as *u8,1); return 0 } let d: *u8=sys_mmap(24); var m: i64=v; var k: i64=0; while m>0 { d[k]=(48+(m%10)) as u8; m=m/10; k=k+1 } let b: *u8=sys_mmap(24); var i: i64=0; while i<k { b[i]=d[k-1-i]; i=i+1 } sys_write(1,b,k); return 0 } |
| 39 | func cma_slen(s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} return n } |
| 40 | func cma_apps(buf: *u8, pos: i64, s: *u8) -> i64 { var p: i64=pos; var i: i64=0; while s[i]!=(0 as u8) { buf[p]=s[i]; p=p+1; i=i+1 } return p } |
| 41 | func cma_appn(buf: *u8, pos: i64, v: i64) -> i64 { var p: i64=pos; var m: i64=v; if m==0 { buf[p]=48 as u8; return p+1 } let t: *u8=sys_mmap(24); var k: i64=0; while m>0 { t[k]=(48+(m%10)) as u8; m=m/10; k=k+1 } var i: i64=0; while i<k { buf[p]=t[k-1-i]; p=p+1; i=i+1 } return p } |
| 42 | func cma_card(buf: *u8, pos: i64, label: *u8, v: i64, color: *u8) -> i64 |
| 55 | func cma_load(path: *u8, buf: *u8) -> i64 |
| 68 | func cma_has(buf: *u8, len: i64, needle: *u8) -> i64 |
| 81 | func cma_has_claim(buf: *u8, len: i64) -> i64 |
| 97 | func cma_has_reference(buf: *u8, len: i64) -> i64 |
| 134 | func cma_has_canfail(buf: *u8, len: i64) -> i64 |
| 164 | func cma_has_comparison(buf: *u8, len: i64) -> i64 |
| 180 | func cma_audit(path: *u8, name: *u8, buf: *u8) -> i64 called by 1: main calls 6: cma_loadcma_putscma_has_claimcma_has_referencecma_has_canfailcma_has_comparison |
| 233 | func cma_is_eol(c: i64) -> i64 { if c==10 { return 1 } if c==13 { return 1 } return 0 } called by 1: cma_set_has |
| 234 | func cma_set_has(setb: *u8, setlen: i64, name: *u8) -> i64 |
| 254 | func main() -> i64 |