code wiki / _hdl_build / nx_goalmap_gate.nx

nx_goalmap_gate.nx

buildroot/runtime/_hdl_build/nx_goalmap_gate.nx

13760 B204 linesdepth 6pulls 10 transitivereach 0 importersview sourcekind gate/prooftopic goalmap
docsdependenciesstructsconstsfunctions

about

nx_goalmap_gate.nx -- proves nx_goalmap_lib IN-PROCESS on fixture boards under /tmp/nx_goalmap_gate/ (a fixture tree assembled at SETUP, never shared with a production beat; every path this gate authors is rewritten wholesale each run). Teeth: match by title word, by symbol word, non-match excluded, score counts DISTINCT words, dependency order (dependency before dependent), status OPEN from an _ABSENT_ watch and PRESENT from a present symbol, PRESENT-REJECTED from a planted operator REJECT on the accept- plane, ledger count and last epoch, gap rows with SOURCE probed 1 / BUILT 0 / PROMOTED 0, the scale bound (300 rungs -> out <= budget, clipped announced, count still full), and three neg-controls: no-word-matches returns EMPTY not a guess, a duplicate rung id is REFUSED by name, an unreadable domain returns NO-DOMAIN. Values emitted via gv_kv. license_tier: ORIGINAL No hw writes (Rule 26). expect_exit: 0 PROVENANCE 2026-09-05 rebuild-1: the first fossil (sha dc586dcb, 166,087 B) was DELETED by an admission-REFUSED run of nx_sov_build_run while its build-cache sidecar survived (key 3dac65ef); this line moves the cache key so the rebuild compiles instead of reporting a HIT that materialises nothing (CLAUDE.md 2026-09-04, debt 1787078015 recurrence).

dependencies 5 imports · 0 importers

nx_syscalls.nx nx_sovjson_lib.nx nx_store_seed_lib.nx nx_gate_verdict.nx nx_goalmap_lib.nx nx_goalmap_gate.nx

imports: nx_syscalls.nxnx_sovjson_lib.nxnx_store_seed_lib.nxnx_gate_verdict.nxnx_goalmap_lib.nx

imported by: nobody (leaf or entry point)

structs

none

consts

19const GG_BASE: *u8 = "/tmp/nx_goalmap_gate/"
20const GG_MODE_DIR: i64 = 0x1ed
21const GG_MODE_FILE: i64 = 420
23const GG_BIG: i64 = 262144
24const GG_NL: i64 = 10
25const GG_TAB: i64 = 9
26const GG_SCALE_N: i64 = 300
27const GG_WORDS: i64 = 64

functions

29func gg_wr(path: *u8, buf: *u8, n: i64) -> i64
37func gg_row(b: *u8, o: i64, s: *u8) -> i64 { var p: i64 = sj_cat(b, o, s); b[p] = GG_NL as u8; return p + 1 }
called by 1: gg_setup calls 1: sj_cat
38func gg_tab(b: *u8, o: i64) -> i64 { b[o] = GG_TAB as u8; return o + 1 }
40func gg_has(out: *u8, n: i64, lit: *u8) -> i64 { if gm_find(out, 0, n, lit) >= 0 { return 1 } return 0 }
called by 1: gg_setup calls 1: gm_find
43func gg_int(out: *u8, n: i64, key: *u8) -> i64
called by 1: gg_setup calls 3: gm_findsj_vlensj_atoi_span
53func gg_setup() -> i64
115func main(argc: i64, argv: *i64) -> i64