code wiki / _hdl_build / nx_atlas_gapscan_gate.nx

nx_atlas_gapscan_gate.nx

buildroot/runtime/_hdl_build/nx_atlas_gapscan_gate.nx

12014 B303 linesdepth 5pulls 11 transitivereach 0 importersview sourcekind gate/prooftopic atlas
docsdependenciesstructsconstsfunctions

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

nx_eco_graph.nx nx_store_seed_lib.nx nx_seg_store.nx nx_deploy_lib.nx nx_gate_verdict.nx nx_syscalls.nx nx_atlas_gapscan_gate.nx

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

main gv_ctr sys_mmap gv_head gv_puts sys_write sys_now_realtime_sec sys_mmap ↻ sys_clock_gettime_real sys_mmap ↻ rg_mkpfx ss_cat ss_catn sys_mmap ↻ eg_new sys_mmap ↻ rg_node rg_slen eg_intern eg_hash eg_name_eq ss_cat ↻ ss_catn ↻ eg_add_edge gv_check gv_puts ↻ eg_finalize sys_mmap ↻ eg_save sys_mmap ↻ sov_put_ints sov_put ss_begin ss_begin_cap sys_mmap ↻ ss_add ss_add2 ss_w32 ss_len ss_commit

structs

none

consts

22const RG_CAP: i64 = 1048576
23const RG_PFX: i64 = 128
24const RG_NAME: i64 = 64
25const RG_TAB: i64 = 9
26const RG_NL: i64 = 10
27const RG_ZERO: i64 = 48
28const RG_NINE: i64 = 57
29const RG_B10: i64 = 10
31const RG_FX_NODE: i64 = 640
32const RG_FX_EDGE: i64 = 1400
33const RG_FX_ARENA: i64 = 32768
34const RG_FX_HASH: i64 = 1024
35const RG_FX_GIANT: i64 = 505
37const RG_SC_WINGS: i64 = 60
38const RG_SC_PER: i64 = 200
39const RG_SC_NODE: i64 = 13000
40const RG_SC_EDGE: i64 = 32000
41const RG_SC_ARENA: i64 = 524288
42const RG_SC_HASH: i64 = 32768
43const RG_SC_SKIP: i64 = 4
44const RG_TOPK: i64 = 64

functions

46func rg_slen(s: *u8) -> i64 { var n: i64 = 0; while s[n] != (0 as u8) { n = n + 1 } return n }
called by 2: rg_hasrg_node
47func rg_has(q: *u8, n: i64, s: *u8) -> i64
called by 1: main calls 1: rg_slen
60func rg_mkpfx(dst: *u8, stem: *u8, epoch: i64) -> i64
called by 1: main calls 2: ss_catss_catn
67func rg_node(g: *EcoGraph, s: *u8) -> i64 { let l: i64 = rg_slen(s); return eg_intern(g, s, l) }
called by 1: main calls 2: rg_sleneg_intern
69func rg_mkname(dst: *u8, w: i64, j: i64) -> i64
called by 1: main calls 2: ss_catss_catn
78func rg_rows(q: *u8, n: i64) -> i64
called by 1: main
85func rg_desc(q: *u8, n: i64) -> i64
called by 1: main
118func main() -> i64