code wiki / _hdl_build / nx_atlas_gapscan_gate.nx
nx_atlas_gapscan_gate.nx
buildroot/runtime/_hdl_build/nx_atlas_gapscan_gate.nx
about
nx_atlas_gapscan_gate.nx -- gate for graph-native atlas recombination (authored ON nx_gate_verdict per the
migrate-on-touch law). Two graphs, because fixture gates prove CORRECTNESS and never SCALE
([[feedback-scale-law-no-toys-declare-envelopes]] -- the ark-v1 lesson institutionalized):
FIXTURE graph (16 nodes, hand-built so every expectation is unambiguous):
T5 neg-control: a pair with the IDENTICAL score to the positive one but WITH an import edge is NOT
proposed -- the only difference between T5 and T6 is the edge, so this isolates novelty exactly
T6 positive: the unconnected cross-wing maturity-gap pair IS proposed
T7 island (ca=0,ce=0) never proposed T8 _gate scaffolding never proposed
PRODUCTION-SHAPE graph (12000 nodes / ~21000 edges, ~9000 candidates -> the AR_MAXCAND 8192 cap is
deliberately EXCEEDED so the truncation path is exercised, not assumed):
T1 completes at production shape T2 the cap is HIT and DECLARED (no silent truncation)
T3 topk respected T4 scores non-increasing (true top-K, not first-past-the-post)
T9 absent store -> fail-closed nonzero exit
license_tier: ORIGINAL No hw writes (Rule 26). expect_exit: 0
dependencies 6 imports · 0 importers
imports: nx_eco_graph.nxnx_store_seed_lib.nxnx_seg_store.nxnx_deploy_lib.nxnx_gate_verdict.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
| 22 | const RG_CAP: i64 = 1048576 |
| 23 | const RG_PFX: i64 = 128 |
| 24 | const RG_NAME: i64 = 64 |
| 25 | const RG_TAB: i64 = 9 |
| 26 | const RG_NL: i64 = 10 |
| 27 | const RG_ZERO: i64 = 48 |
| 28 | const RG_NINE: i64 = 57 |
| 29 | const RG_B10: i64 = 10 |
| 31 | const RG_FX_NODE: i64 = 640 |
| 32 | const RG_FX_EDGE: i64 = 1400 |
| 33 | const RG_FX_ARENA: i64 = 32768 |
| 34 | const RG_FX_HASH: i64 = 1024 |
| 35 | const RG_FX_GIANT: i64 = 505 |
| 37 | const RG_SC_WINGS: i64 = 60 |
| 38 | const RG_SC_PER: i64 = 200 |
| 39 | const RG_SC_NODE: i64 = 13000 |
| 40 | const RG_SC_EDGE: i64 = 32000 |
| 41 | const RG_SC_ARENA: i64 = 524288 |
| 42 | const RG_SC_HASH: i64 = 32768 |
| 43 | const RG_SC_SKIP: i64 = 4 |
| 44 | const RG_TOPK: i64 = 64 |
functions
| 46 | func rg_slen(s: *u8) -> i64 { var n: i64 = 0; while s[n] != (0 as u8) { n = n + 1 } return n } |
| 47 | func rg_has(q: *u8, n: i64, s: *u8) -> i64 |
| 60 | func rg_mkpfx(dst: *u8, stem: *u8, epoch: i64) -> i64 |
| 67 | func rg_node(g: *EcoGraph, s: *u8) -> i64 { let l: i64 = rg_slen(s); return eg_intern(g, s, l) } |
| 69 | func rg_mkname(dst: *u8, w: i64, j: i64) -> i64 |
| 78 | func rg_rows(q: *u8, n: i64) -> i64 called by 1: main |
| 85 | func rg_desc(q: *u8, n: i64) -> i64 called by 1: main |
| 118 | func main() -> i64 |