code wiki / (root) / nx_loop_census.nx

nx_loop_census.nx

buildroot/runtime/nx_loop_census.nx

11797 B132 linesdepth 3pulls 3 transitivereach 0 importersview sourcekind tooltopic loop
docsdependenciesstructsconstsfunctions

about

nx_loop_census.nx -- MEASURE THE ULTIMATE AUTONOMY LOOP (the operator's "god pattern"): is the cycle DO -> TEST+EVIDENCE -> REPORT(gaps) -> RESEARCH -> TRAIN/GROW -> LOG-NEXT -> REPEAT actually CLOSED, or a pile of real-but-uncomposed steps? This is the path OFF super-LLM dependence, so we measure it HONESTLY: each step is graded by PROVING the real implementing organ exists on disk (open it -- never a file-list assertion), and the KEYSTONE question -- does a CONDUCTOR compose them into a self-driving cycle -- is answered by probing for one, not by hoping. Liar-killed: a negative control organ MUST read GAP, else the census declares itself INVALID. Anchored in the family tree (nx_dep_graph reverse-deps/SCC + lineage_id). Composes nothing but nx_syscalls (Rule 15). Expandable: add a lc_step row. license_tier: ORIGINAL genealogy_id: operator-2026-07-03-ultimate-loop + pdca/ooda/scientific-method/recursive-self-improvement lineage_id: nishi_autonomy_loop_census_v1 expect_exit: 0

dependencies 2 imports · 0 importers

nx_syscalls.nx nx_itoa_lib.nx nx_loop_census.nx

imports: nx_syscalls.nxnx_itoa_lib.nx

imported by: nobody (leaf or entry point)

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

main lc_puts sys_write lc_step lc_exists sys_openat_rd sys_close lc_puts ↻ lc_exists ↻ lc_file_has sys_openat_rd ↻ sys_mmap sys_read sys_close ↻ lc_slen lc_comp lc_puts ↻ lc_putn nxi_out nxi_fd sys_mmap ↻ ccz_cat_num sys_write ↻ sys_munmap sys_exit

structs

none

consts

14const LC_BUF: i64 = 1048576

functions

19func lc_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 3: lc_steplc_compmain calls 1: sys_write
24func lc_putn(v: i64) -> i64 { nxi_out(v); return 0 }
called by 1: main calls 1: nxi_out
25func lc_slen(s: *u8) -> i64 { var n: i64 = 0; while s[n] != (0 as u8) { n = n + 1 } return n }
called by 1: lc_file_has
28func lc_exists(path: *u8) -> i64 { let fd: i64 = sys_openat_rd(path); if fd < 0 { return 0 } sys_close(fd); return 1 }
called by 2: lc_stepmain calls 2: sys_openat_rdsys_close
31func lc_file_has(path: *u8, needle: *u8) -> i64
43func lc_step(label: *u8, organ: *u8, note: *u8) -> i64
called by 1: main calls 2: lc_existslc_puts
51func lc_comp(label: *u8, present: i64) -> i64
called by 1: main calls 1: lc_puts
56func main() -> i64