code wiki / _hdl_build / nx_fullcap_audit.nx
nx_fullcap_audit.nx
buildroot/runtime/_hdl_build/nx_fullcap_audit.nx
about
nx_fullcap_audit.nx -- HONEST full-capability audit (operator: "make sure we have full everything, no partials...
TRULY full modern, June 2026") + the small-model TRAINING cost evidence (grounded st_*.raw). NO-WAVE: this does
NOT fake partials to full -- it states, for each PARTIAL, the EXACT remaining work + whether it is software-
reachable or needs real hardware (guarded never-brick). Then the real cost evidence to train a small model.
T1 (honest) the audit names the 7 real PARTIALs and does NOT claim 100% complete.
T2 the cost evidence is grounded (nanoGPT + llm.c READMEs really fetched).
T3 each partial is categorized software-reachable vs needs-real-hardware (an actionable path to full).
expect_exit: 0 Sovereign: nx_syscalls.
dependencies 2 imports · 0 importers
imports: nx_syscalls.nxnx_g_puts_lib.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
| 12 | func g_pn(v: i64) -> i64 { let b: *u8=sys_mmap(28); var x: i64=v; if x==0{b[0]=48;sys_write(1,b,1);return 0} var d: i64=0; var y: i64=x; while y>0{d=d+1;y=y/10} var i: i64=d-1; y=x; while i>=0{b[i]=(48+(y%10)) as u8;y=y/10;i=i-1} sys_write(1,b,d); return 0 } |
| 13 | func ck(name: *u8, c: i64) -> i64 { if c==1 { g_puts(" PASS " as *u8) } else { g_puts(" FAIL " as *u8) } g_puts(name); g_puts("\n" as *u8); return c } |
| 14 | func have(path: *u8) -> i64 { let fd: i64=sys_openat_rd(path); if fd<0 { return 0 } sys_close(fd); return 1 } |
| 16 | func main() -> i64 |