code wiki / _hdl_build / nx_sota_gap_ledger.nx

nx_sota_gap_ledger.nx

buildroot/runtime/_hdl_build/nx_sota_gap_ledger.nx

19506 B210 linesdepth 2pulls 2 transitivereach 0 importersview sourcekind tooltopic sota

docs dependencies structs consts functions

about

nx_sota_gap_ledger.nx -- THE ecosystem-wide SOTA-gap board (operator 2026-07-07: "where we are state of the art and where we gap against state of the art ... from the hardware up, each rung"). One COMPUTED row per capability rung: {rung, name, OUR measured number, the SOTA reference number, unit, higher-better?, sovereignty-floor?, evidence-tag, next rung}. The verdict is COMPUTED from the two numbers (never asserted) -- exactly the nx_deepresearch_census discipline generalized to every level. FLOOR rows (sovereignty/determinism) are separated so "we own it" is NEVER printed as "we beat it". Liar-kill = a fabricated AHEAD on an axis we score 0 on MUST classify BEHIND (T-NEG). Numbers are grounded to real gates/censuses/this-session measurements (evidence tag per row); when a number updates, edit the row + re-run -- the board regenerates, never goes stale. ctx table g: *i64 -- slots 0..8 = the parallel column arrays + count (dodges the multi-static subscript bug). 0 rung[] 1 nm[](ptrs) 2 our[] 3 sota[] 4 unit[](ptrs) 5 hib[] 6 floor[] 7 ev[](ptrs) 8 nxt[](ptrs) 9 n expect_exit: 0 license_tier: ORIGINAL

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

13	const K_MAGIC_4096: i64 = 4096
14	const K_MAGIC_300000: i64 = 300000

functions

16	func lw(s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} sys_write(1,s,n); return 0 } called by 4: ln_lwp led_vstr main calls 1: sys_write
17	func ln_(v: i64) -> i64 { let bb: u8=sys_mmap(28); var m: i64=v; if m<0{ lw("-" as u8); m=0-m } let t: *u8=sys_mmap(28); 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 i: i64=0; while i<k{bb[i]=t[k-1-i];i=i+1} sys_write(1,bb,k); return 0 } called by 1: main calls 3: sys_mmap lw sys_write
19	func lwp(s: u8, w: i64) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} sys_write(1,s,n); var i: i64=n; while i<w { lw(" " as u8); i=i+1 } return 0 } called by 1: main calls 2: sys_write lw
22	func led_add(g: i64, rung: i64, nm: u8, our: i64, sota: i64, unit: u8, hib: i64, floor: i64, ev: u8, nxt: *u8) -> i64 called by 1: main
48	func led_close(our: i64, sota: i64, hib: i64) -> i64 called by 2: led_verdict main
59	func led_verdict(our: i64, sota: i64, hib: i64, floor: i64) -> i64 called by 1: main calls 1: led_close
67	func led_vstr(v: i64) -> i64 called by 1: main calls 1: lw
74	func main() -> i64 calls 8: lw sys_mmap led_add led_verdict led_close ln_+2