nx_loop_census.nx
buildroot/runtime/nx_loop_census.nx
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
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
structs
| none |
consts
| 14 | const LC_BUF: i64 = 1048576 |
functions
| 19 | func 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 } |
| 24 | func lc_putn(v: i64) -> i64 { nxi_out(v); return 0 } |
| 25 | func 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 |
| 28 | func lc_exists(path: *u8) -> i64 { let fd: i64 = sys_openat_rd(path); if fd < 0 { return 0 } sys_close(fd); return 1 } |
| 31 | func lc_file_has(path: *u8, needle: *u8) -> i64 |
| 43 | func lc_step(label: *u8, organ: *u8, note: *u8) -> i64 |
| 51 | func lc_comp(label: *u8, present: i64) -> i64 |
| 56 | func main() -> i64 |