code wiki / _hdl_build / nx_sota_status.nx
nx_sota_status.nx
buildroot/runtime/_hdl_build/nx_sota_status.nx
about
nx_sota_status.nx -- THE HONESTY GATE, cross-domain (operator 2026-07-16: "an evidence repository ... that
can clearly tell us where we are as far as compare gaps ... where there is debt ... where there are unique
capabilities and where we stand as far as state of the art"). Reads EVERY knowledge/compare/<d>.matrix (the
real, liar-killed evidence) + checks whether each domain has EXECUTABLE evidence (<d>.gates) vs claim-only,
and emits ONE fresh status: per-domain SOTA standing, the UNIQUE moat (nishiExceed rows), the frontier GAPS
(_ABSENT_ rows), and -- the meta-honesty number -- the EVIDENCE-BACKING ratio (executable-proven / total).
Fresh by construction: computed live at run time (spin it up = current truth). Stamps sys_now_realtime.
Usage: nx_sota_status (CWD = nxc2 root) license_tier: ORIGINAL expect_exit:0
dependencies 4 imports · 0 importers
imports: nx_syscalls.nxnx_estate_path.nxnx_evidence_verdict.nxnx_evattest.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
| 14 | const SS_MAXD: i64 = 128 |
| 19 | const SS_DEF_TTL_SEC: i64 = 604800 |
| 20 | const SS_DEF_MIN_CLASSES: i64 = 2 |
| 21 | const SS_DEF_REQ_HUMAN: i64 = 1 |
functions
| 23 | func sw(s: *u8) -> i64 { var n:i64=0; while s[n]!=(0 as u8){n=n+1} sys_write(1,s,n); return 0 } |
| 24 | func sn(v: i64) -> i64 { let b:*u8=sys_mmap(24); var m:i64=v; if m<0{sys_write(1,"-" as *u8,1);m=0-m} let t:*u8=sys_mmap(24); var k:i64=0; if m==0{t[0]=48 as u8;k=1} while m>0{t[k]=(48+(m%10)) as u8;m=m/10;k=k+1} var j:i64=0; while j<k{b[j]=t[k-1-j];j=j+1} sys_write(1,b,k); return 0 } |
| 25 | func swn(base: *u8, off: i64, len: i64) -> i64 { sys_write(1, ((base as i64)+off) as *u8, len); return 0 } |
| 26 | func ss_wf(fd: i64, s: *u8) -> i64 { var n:i64=0; while s[n]!=(0 as u8){n=n+1} sys_write(fd,s,n); return 0 } |
| 27 | func ss_wnf(fd: i64, v: i64) -> i64 { let t:*u8=sys_mmap(28); var m:i64=v; var k:i64=0; if m==0{t[0]=48 as u8;k=1} while m>0{t[k]=(48+(m%10)) as u8;m=m/10;k=k+1} let b:*u8=sys_mmap(28); var i:i64=0; while i<k{b[i]=t[k-1-i];i=i+1} sys_write(fd,b,k); return 0 } |
| 30 | func ends_matrix(name: *u8) -> i64 called by 1: main |
| 40 | func classify(buf: *u8, s: i64, e: i64) -> i64 called by 1: main |
| 73 | func file_exists(path: *u8) -> i64 |
| 79 | func ss_has(buf: *u8, n: i64, needle: *u8, nl: i64) -> i64 |
| 97 | func ss_parse_num_after(buf: *u8, n: i64, key: *u8, kl: i64) -> i64 |
| 119 | func ss_parse_tok_len(buf: *u8, n: i64, key: *u8, kl: i64) -> i64 called by 1: ss_stamp_load |
| 146 | func ss_conf_num(key: *u8, kl: i64, defval: i64) -> i64 |
| 166 | func ss_row_has(buf: *u8, s: i64, e: i64, needle: *u8) -> i64 called by 1: ss_class_load |
| 180 | func ss_class_load(arena: *u8, doff: i64, domlen: i64, now: i64, ttl: i64, r: *i64) -> i64 |
| 278 | func ss_stamp_load(arena: *u8, doff: i64, domlen: i64, r: *i64) -> i64 |
| 320 | func main(argc: i64, argv: *i64) -> i64 |