code wiki / _hdl_build / nx_self_build_cycle_test.nx
nx_self_build_cycle_test.nx
buildroot/runtime/_hdl_build/nx_self_build_cycle_test.nx
about
nx_self_build_cycle_test.nx -- THE CAPSTONE: a full autonomous SELF-BUILD CYCLE,
governed. The loop builds a capability itself, with the crew as checks & balances:
GENERATOR proposes a rewrite rule as DATA (one of the eqsat identities)
|
VERIFIER PROVES it sound over ALL inputs (nx_rs_certify_unary, x in [0,2^W))
| -- a real 1:1 gate-sim proof, not a claim
COUNCIL gates it 3 -> 2 -> 1 (Engineer=proven? + Genealogist + Racing ->
| Warden + Archivist -> Conductor) -- nx_crew_council
ABSORB admit iff the council clears it; an UNSOUND candidate is caught by
the Verifier (Engineer leg) and REFUSED -- never admitted.
This is the loop building itself under governance (M2: Claude supervises, the
loop does the work). The Generator authors, the Verifier proves, the crew
governs, the ecosystem grows -- no LLM, no human in the inner loop.
Known answer: 7 candidates authored -> 6 ADMITTED (sound rules) + 1 REFUSED
(mul_pow2 at the k>=W boundary, proven UNSOUND -> Engineer refuses). exit 0.
dependencies 2 imports · 0 importers
imports: nx_rule_soundness.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
structs
| none |
consts
| 23 | const SBC_W: i64 = 8 |
functions
| 25 | func sbc_putn(v: i64) -> i64 called by 1: main |
| 35 | func sbc_prove_unary(rule: i64, vals: *i64, cells: *NxGsimCell, g: *NxGsim, |
| 50 | func sbc_prove_mulpow2(k: i64) -> i64 |
| 61 | func sbc_cycle(a: *CrewAction, why: *i64, name: *u8, sound: i64) -> i64 |
| 72 | func main() -> i64 |