code wiki / _hdl_build / nx_self_sufficiency_test.nx
nx_self_sufficiency_test.nx
buildroot/runtime/_hdl_build/nx_self_sufficiency_test.nx
about
nx_self_sufficiency_test.nx -- honest map of the full loop. Two cases:
(A) target whose SEARCH SPACE ALREADY EXISTS (e.g. "synthesize circuit for truth-table T", or
"reduce matrix M") -> the loop is FULLY CLOSED: target->spec->author->RUN->judge->bank with no
Claude. All 7 stages team-owned. THIS is the self-sufficient loop, and it works today.
(B) target needing a BRAND-NEW module/search-space -> OPEN at S3 only (novel-module authoring = the
LLM-gap Claude still writes by hand). 6/7 team-owned. The map to full self-sufficiency = close S3.
Exit 0 on 6/6. license_tier: ORIGINAL
dependencies 2 imports · 0 importers
imports: nx_self_sufficiency.nxnx_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
| none |
functions
| 12 | func st_puts(s: *u8) -> i64 { var n: i64 = 0; while s[n] != (0 as u8) { n = n + 1 } sys_write(1, s, n); return 0 } |
| 13 | func st_num(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;k=1}; while m>0 {t[k]=48+(m%10); 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 } |
| 15 | func main() -> i64 |