code wiki / _hdl_build / nx_ng_gap.nx
nx_ng_gap.nx
buildroot/runtime/_hdl_build/nx_ng_gap.nx
about
nx_ng_gap.nx -- SOVEREIGN neural-graphics endpoint/missing-generation finder. Sibling of nx_cap_gap_sov
(the no-float-LLM ladder) but seeded with the NEURAL-GRAPHICS ladder (instant-ngp class -> world-model
endpoint, the frontier grafted onto the genealogy by nx_ng_lineage). GROWS THE TEAM: a new gap-finder
capability for the visual/graphics domain, reusing the proven pattern.
HONEST BY CONSTRUCTION (operator's first law + the 2026-06-22 "prior gap-finder was fiction" lesson):
built-status is DERIVED from REAL organ-file existence (org_resolve), never hardcoded. Data lives in the
sovereign content-addressed nx_seg_store (knowledge/store/ngfx_capability), NOT a TSV. Reports the FRONTIER
(deepest contiguous built), the NEXT MISSING GENERATION (the adjacent-possible build), and a RACI hand-off.
GATE w/ neg-control: a real organ classifies BUILT, a fake one MISSING. expect_exit: 0 license_tier: ORIGINAL
dependencies 2 imports · 0 importers
imports: nx_seg_store.nxnx_syscalls.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 NGAP_STORE: *u8 = "knowledge/store/ngfx_capability" |
| 15 | const NSTEPS: i64 = 14 |
functions
| 17 | func cp(s: *u8) -> i64 { var n: i64 = 0; while s[n] != (0 as u8) { n = n + 1 } sys_write(1, s, n); return 0 } |
| 18 | func clen(s: *u8) -> i64 { var n: i64 = 0; while s[n] != (0 as u8) { n = n + 1 } return n } called by 1: sa |
| 19 | func cpn(v: i64) -> i64 |
| 28 | func cstreq(a: *u8, b: *u8) -> i64 { var i: i64 = 0; while a[i] != (0 as u8) { if a[i] != b[i] { return 0 } i = i + 1 } if b[i] != (0 as u8) { return 0 } return 1 } called by 1: org_resolve |
| 29 | func cexists(path: *u8) -> i64 { let fd: i64 = sys_openat_rd(path); if fd < 0 { return 0 } sys_close(fd); return 1 } |
| 30 | func cjoin(pfx: *u8, name: *u8, out: *u8) -> i64 { var o: i64 = 0; var i: i64 = 0; while pfx[i] != (0 as u8) { out[o] = pfx[i]; o = o + 1; i = i + 1 } i = 0; while name[i] != (0 as u8) { out[o] = name[i]; o = o + 1; i = i + 1 } out[o] = 0 as u8; return 0 } called by 1: org_resolve |
| 32 | func org_resolve(name: *u8) -> i64 |
| 40 | func ngap_key(k: i64, out: *u8) -> i64 |
| 46 | func ngap_field(src: *u8, slen: i64, idx: i64, out: *u8) -> i64 called by 1: main |
| 53 | func sa(w: *i64, key: *u8, val: *u8) -> i64 { ss_add(w, 1, key, val, clen(val)); return 0 } |
| 58 | func ngap_seed() -> i64 |
| 78 | func main() -> i64 |