nx_sota_ledger.nx source

1// nx_sota_ledger.nx -- the SPINE of the positive SOTA loop: a sovereign acceptance ledger that makes "grow to 2// SOTA and STAY there" mechanical + poison-resistant. Each capability carries its MEASURED position vs the real 3// incumbent (score permille, 1000 = matches incumbent, >1000 = exceeds). A candidate is ACCEPTED only if it is 4// (a) verified CORRECT and (b) score STRICTLY BETTER than the current best; regressions and incorrect (poisoned) 5// submissions are REJECTED and the prior best is kept (rollback). Seeded with 2026-07 honest gaps (all measured 6// vs the tool, not self-graded). Neg-controls prove the gate bites. This governs the crew's iterations so no 7// change lands unless it truly advances SOTA -- the anti-Claude-heavy, anti-attack loop the operator described. 8import "nx_syscalls.nx" 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 14 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 } 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 } 17 18func main() -> i64 { 19 // capability best-score ledger (permille of incumbent; 1000 = MATCH SOTA) 20 let score: *i64 = sys_mmap(NC*8) as *i64 21 // seed = this session's HONEST measured positions vs the real tool 22 score[0] = 291 // codegen: nx_cc fannkuch 5.17s vs gcc-O2 1.51s -> K_MAGIC_1505/K_MAGIC_5171*1000 23 score[1] = 245 // gemm-fp16: mine 18.9 TFLOP vs cuBLAS 77.0 24 score[2] = 298 // gemm-fp8: mine 76 TOP/s vs cuBLASLt 254.7 25 score[3] = 945 // lm-bpc: mine 2.20 BPC vs nanoGPT-char 2.08 (lower=better -> K_MAGIC_2080/K_MAGIC_2200*1000) 26 puts("=== SOTA acceptance ledger (seed = measured-vs-incumbent, honest) ===\n" as *u8) 27 puts(" cap0 codegen(vs gcc)=" as *u8); putn(score[0]) 28 puts(" cap1 fp16(vs cuBLAS)=" as *u8); putn(score[1]) 29 puts(" cap2 fp8(vs cuBLASLt)=" as *u8); putn(score[2]) 30 puts(" cap3 lm(vs nanoGPT)=" as *u8); putn(score[3]) 31 puts(" (1000 = matches SOTA; every seed < 1000 = the debt we must eat)\n" as *u8) 32 33 // ---- the acceptance rule (the whole spine) ---- 34 // ACCEPT candidate iff correct==1 AND newscore > best ; else REJECT (keep prior = rollback). 35 var passes: i64 = 0 36 var tests: i64 = 0 37 38 // T1: a REAL improvement (regalloc lifts codegen 291 -> 640, still correct) -> ACCEPT 39 tests = tests + 1 40 { let cand: i64 = 640; let correct: i64 = 1; let best: i64 = score[0] 41 var accept: i64 = 0; if correct == 1 { if cand > best { accept = 1 } } 42 puts(" T1 codegen 291->640 correct -> " as *u8) 43 if accept == 1 { score[0] = cand; puts("ACCEPT (new best 640)\n" as *u8); passes = passes + 1 } else { puts("reject (BUG: real gain rejected)\n" as *u8) } 44 } 45 // T2: a REGRESSION (a later change drops codegen 640 -> 500) -> REJECT, keep 640 (rollback) 46 tests = tests + 1 47 { let cand: i64 = 500; let correct: i64 = 1; let best: i64 = score[0] 48 var accept: i64 = 0; if correct == 1 { if cand > best { accept = 1 } } 49 puts(" T2 codegen 640->500 regress -> " as *u8) 50 if accept == 0 { puts("REJECT, keep 640 (rollback) -- neg-control BITES\n" as *u8); passes = passes + 1 } else { score[0]=cand; puts("accept (BUG: regression landed)\n" as *u8) } 51 } 52 // T3: a POISONED candidate (claims codegen 900 but result INCORRECT) -> REJECT 53 tests = tests + 1 54 { let cand: i64 = 900; let correct: i64 = 0; let best: i64 = score[0] 55 var accept: i64 = 0; if correct == 1 { if cand > best { accept = 1 } } 56 puts(" T3 codegen ->900 but INCORRECT-> " as *u8) 57 if accept == 0 { puts("REJECT (poison/attack blocked by correctness gate) -- neg-control BITES\n" as *u8); passes = passes + 1 } else { puts("accept (BUG: poison landed)\n" as *u8) } 58 } 59 // T4: SOTA reached (fp8 candidate 298 -> 1010, correct = EXCEEDS cuBLASLt) -> ACCEPT + flag SOTA 60 tests = tests + 1 61 { let cand: i64 = 1010; let correct: i64 = 1; let best: i64 = score[2] 62 var accept: i64 = 0; if correct == 1 { if cand > best { accept = 1 } } 63 puts(" T4 fp8 298->1010 correct -> " as *u8) 64 if accept == 1 { score[2]=cand; puts("ACCEPT" as *u8); if cand >= 1000 { puts(" + SOTA-MATCH/EXCEED FLAGGED" as *u8) } puts("\n" as *u8); passes = passes + 1 } else { puts("reject (BUG)\n" as *u8) } 65 } 66 67 puts(" => gate correct on " as *u8); putn(passes); puts(" / " as *u8); putn(tests) 68 puts(" (accepts real gains, rejects regressions + poison, flags SOTA)\n" as *u8) 69 if passes == tests { puts(" verdict=GREEN: the SOTA loop spine works -- only verified-better candidates land; the ledger never regresses.\n" as *u8) } else { puts(" verdict=RED\n" as *u8) } 70 return 0 71}