code wiki / _hdl_build / nx_self_sufficiency.nx

nx_self_sufficiency.nx

buildroot/runtime/_hdl_build/nx_self_sufficiency.nx

2693 B50 linesdepth 2pulls 2 transitivereach 1 importersview sourcekind librarytopic self
docsdependenciesstructsconstsfunctions

about

nx_self_sufficiency.nx -- the team models its OWN full-loop self-sufficiency (operator: "what is our map to a self-sufficient full loop, given a target and building with a runner?"). The loop, given a TARGET, is 7 stages: S1 TARGET -- a target/objective arrives (operator, or the Researcher's L0 desire) TEAM S2 SPEC -- Researcher decomposes it to L8 (nx_researcher_spec) TEAM S3 SPACE -- a SEARCH SPACE + verifier exists for it... or a NEW MODULE must be authored TEAM | LLM-GAP S4 AUTHOR -- Builder authors the solution BY SEARCH (bsy_author / bs4_synth / pi_iterate) TEAM S5 VERIFY -- Engineer GATES it with a RUNNER (eng_build_gate / the _run_*.sh harness) TEAM S6 JUDGE -- Referee/Examiner grade OBJECTIVELY (no self-grading) TEAM S7 BANK -- register in the self-model; Teacher tracks acquisition M0->M3 TEAM The loop is FULLY CLOSED (target->bank with NO Claude) when the search space already exists. It is OPEN at exactly ONE stage -- S3, when a brand-NEW module/search-space must be authored: that is the novel-module LLM-gap, the last thing Claude still writes by hand. The MAP to full self-sufficiency = close S3 (the custom Nishi LLM, or the local backup, authors new modules). license_tier: ORIGINAL

dependencies 1 imports · 1 importers

nx_syscalls.nx nx_self_sufficiency.nx nx_self_sufficiency_test.nx

imports: nx_syscalls.nx

imported by: nx_self_sufficiency_test.nx

structs

none

consts

18const SS_TARGET: i64 = 1
19const SS_SPEC: i64 = 2
20const SS_SPACE: i64 = 3
21const SS_AUTHOR: i64 = 4
22const SS_VERIFY: i64 = 5
23const SS_JUDGE: i64 = 6
24const SS_BANK: i64 = 7
25const SS_N: i64 = 7
27const SS_TEAM: i64 = 1
28const SS_LLM: i64 = 2

functions

31func ss_stage_owner(stage: i64, space_exists: i64) -> i64
called by 1: ss_team_stages
37func ss_loop_closed(space_exists: i64) -> i64 { return space_exists }
called by 1: main
40func ss_team_stages(space_exists: i64) -> i64
called by 1: main calls 1: ss_stage_owner
47func ss_open_stage(space_exists: i64) -> i64 { if space_exists == 0 { return SS_SPACE } return 0 - 1 }
50func ss_open_is_novel_module(space_exists: i64) -> i64 { if ss_open_stage(space_exists) == SS_SPACE { return 1 } return 0 }
called by 1: main calls 1: ss_open_stage