code wiki / _hdl_build / nx_practice_curriculum.nx
nx_practice_curriculum.nx
buildroot/runtime/_hdl_build/nx_practice_curriculum.nx
about
nx_practice_curriculum.nx -- the NON-CHEATING PRACTICE LOOP (operator 2026-06-25: "help our tools practice
without cheating to be able to do more than just linear arithmetic but truly grow"). RACI=train (teacher=A
owns the curriculum+mastery; coach=R drills the stuck tier via nx_perf_rehearsal; referee=C is the cheat-proof
grader; engineer=C builds the tools nx_evo_*/nx_nofloat_mlp). The anti-cheat is STRUCTURAL: every tool is
scored ONLY on HELD-OUT examples it never trained on -- so memorizing the train set (the cheat) scores ZERO on
the test, and a tool must GENUINELY GENERALIZE to advance. The curriculum is GRADUATED: T1 linear -> T2
non-linear (|x|), so a linear-only learner MASTERS T1 but is provably STUCK on T2 = the exact "grow beyond
linear" signal the coach drills (the grown tool = a branch/MLP, which the team has: nx_evo_cf / nx_nofloat_mlp4
learns XOR). main() is the self-validating gate. Sovereign: nx_syscalls only. expect_exit: 0 license_tier: ORIGINAL
dependencies 2 imports · 0 importers
imports: nx_syscalls.nxnx_seg_store.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
| none |
functions
| 13 | func pp(s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} sys_write(1,s,n); return 0 } |
| 14 | func pc_cat(dst: *u8, off: i64, s: *u8) -> i64 { var i: i64=0; while s[i]!=(0 as u8){dst[off+i]=s[i];i=i+1} return off+i } called by 1: main |
| 15 | func pn(v: i64) -> i64 { let bb: *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 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 } |
| 19 | func pc_predict(lid: i64, x: i64, tx: *i64, ty: *i64, n: i64) -> i64 called by 1: pc_score |
| 36 | func pc_score(lid: i64, tx: *i64, ty: *i64, n: i64, ex: *i64, ey: *i64, en: i64) -> i64 |
| 46 | func pc_drive(tool: *u8, champ: *u8, target: *u8, seed: *u8) -> i64 |
| 64 | func pc_itoa(v: i64, out: *u8) -> i64 { var m: i64=v; 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{out[i]=t[k-1-i];i=i+1} out[k]=0 as u8; return k } |
| 68 | func pc_coach_drill(tool: *u8, champ: *u8, target: *u8, max_tries: i64, won: *i64) -> i64 |
| 79 | func main() -> i64 |