code wiki / _hdl_build / nx_sota_ledger.nx

nx_sota_ledger.nx

buildroot/runtime/_hdl_build/nx_sota_ledger.nx

4980 B71 linesdepth 2pulls 2 transitivereach 0 importersview sourcekind tooltopic sota
docsdependenciesstructsconstsfunctions

about

nx_sota_ledger.nx -- the SPINE of the positive SOTA loop: a sovereign acceptance ledger that makes "grow to SOTA and STAY there" mechanical + poison-resistant. Each capability carries its MEASURED position vs the real incumbent (score permille, 1000 = matches incumbent, >1000 = exceeds). A candidate is ACCEPTED only if it is (a) verified CORRECT and (b) score STRICTLY BETTER than the current best; regressions and incorrect (poisoned) submissions are REJECTED and the prior best is kept (rollback). Seeded with 2026-07 honest gaps (all measured vs the tool, not self-graded). Neg-controls prove the gate bites. This governs the crew's iterations so no change lands unless it truly advances SOTA -- the anti-Claude-heavy, anti-attack loop the operator described.

dependencies 1 imports · 0 importers

nx_syscalls.nx nx_sota_ledger.nx

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

main sys_mmap puts sys_write putn sys_mmap ↻ sys_write ↻

structs

none

consts

9const K_MAGIC_1505: i64 = 1505
10const K_MAGIC_5171: i64 = 5171
11const K_MAGIC_2080: i64 = 2080
12const K_MAGIC_2200: i64 = 2200
13const NC: i64 = 4

functions

15func puts(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 1: main calls 1: sys_write
16func putn(v: i64) -> i64 { let b: *u8=sys_mmap(28); var m: i64=v; if m<0{m=0-m;sys_write(1,"-" as *u8,1)}; let t: *u8=sys_mmap(28); var k: i64=0; if m==0{t[0]=48;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{b[i]=t[k-1-i];i=i+1}; sys_write(1,b,k); return 0 }
called by 1: main calls 2: sys_mmapsys_write
18func main() -> i64