code wiki / _hdl_build / nx_builder_synth_test.nx

nx_builder_synth_test.nx

buildroot/runtime/_hdl_build/nx_builder_synth_test.nx

3422 B41 linesdepth 4pulls 4 transitivereach 0 importersview sourcekind gate/prooftopic builder

docs dependencies structs consts functions

about

nx_builder_synth_test.nx -- prove the TEAM authored the answer, not Claude. The Builder is handed ONLY the objective (importances + budget) and SEARCHES for the allocation; the Engineer verifies. Two different specs (so it's a general capability, not a one-off): the team must (1) discover an allocation that matches the rate-distortion optimum and beats uniform, and (2) author a DIFFERENT allocation for a DIFFERENT importance profile -- proving it builds solutions, not memorizes one. Exit 0 if the team's searched answers are valid + better on both. license_tier: ORIGINAL

dependencies 2 imports · 0 importers

imports: nx_builder_synth.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

11	func bt_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 2: bt_alloc main calls 1: sys_write
12	func bt_num(v: i64) -> i64 { let bb: u8 = sys_mmap(28); var m: i64=v; if m<0 {m=0-m}; 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 } called by 2: bt_alloc main calls 2: sys_mmap sys_write
13	func bt_alloc(n: i64, b: i64) -> i64 { bt_puts("[" as u8); var i: i64=0; while i<n { bt_num(b[i]); if i<n-1 {bt_puts("," as u8)} i=i+1 } bt_puts("]" as u8); return 0 } called by 1: main calls 2: bt_puts bt_num
15	func main() -> i64 calls 8: bt_puts sys_mmap bsy_author_alloc bt_num bt_alloc imat_weighted_error+2