code wiki / _hdl_build / nx_team_selfsufficient_test.nx

nx_team_selfsufficient_test.nx

buildroot/runtime/_hdl_build/nx_team_selfsufficient_test.nx

5402 B117 linesdepth 3pulls 4 transitivereach 0 importersview sourcekind gate/prooftopic team
docsdependenciesstructsconstsfunctions

about

nx_team_selfsufficient_test.nx -- the team runs the WHOLE cycle itself and builds ON its own output. Self-sufficiency = no human in the per-task loop AND the bank feeds future work (it grows UP, not just sideways). PHASE 1 (autonomous backlog): for each goal -> GENERATE (synth from examples) -> VERIFY (held-out) -> GOVERN (crew council) -> BANK into a reusable library. PHASE 2 (build on itself): COMPOSE two BANKED primitives into a NEW capability the team was never given -- 2x . x^2 = 2*x^2 -- and verify it. The team extended itself from what it had banked. I wrote no program and ran no step by hand here; the loop generated, proved, governed, banked, and composed. Known answer: backlog all banked, the composite verified, library grew by the backlog + 1 -> exit 0.

dependencies 2 imports · 0 importers

nx_synth.nx nx_crew_council.nx nx_team_selfsufficient_test.nx

imports: nx_synth.nxnx_crew_council.nx

imported by: nobody (leaf or entry point)

call flow from main pre-order; caps 40 nodes / depth 6 declared; ↻ = already shown

main ts_puts ts_target synth_find sys_mmap synth_matches synth_eval synth_eval ↻ cc_set cc_council ts_num ts_lib_eval synth_eval ↻

structs

none

consts

none

functions

18func ts_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 1: main
19func ts_num(v: i64) -> i64
called by 1: main
29func ts_target(id: i64, x: i64) -> i64
called by 1: main
36func ts_lib_eval(lib_op: *i64, lib_a: *i64, lib_b: *i64, lib_L: *i64, k: i64, x: i64) -> i64
called by 1: main calls 1: synth_eval
41func main() -> i64