code wiki / _hdl_build / nx_atlas_graphrec_gate.nx
nx_atlas_graphrec_gate.nx
buildroot/runtime/_hdl_build/nx_atlas_graphrec_gate.nx
about
nx_atlas_graphrec_gate.nx -- proves the RECOMBINATION SCORING, not merely that the organ runs.
WHY IT EXISTS: I shipped nx_atlas_graphrec LIVE (built, promoted, registered, called over /mcp,
committing to the discovery-graph- plane) WITHOUT a gate -- a rule-9 violation of this
ecosystem's own standard, self-caught. Worse, the scoring was inline in main(), so the only way
to exercise it was to run the whole organ against a real 17k-node graph; any gate over that
would have been vacuous. gr_propose was extracted first so these teeth bite the actual decision
logic against SYNTHETIC graphs where the right answer is known by construction.
Each tooth isolates ONE rule, and the two hub rules are separate because they failed
separately: the FIRST live run put nx_syscalls (Ca=14084) into 6 of the top 20 because hubs
were suppressed as WITNESS but not as ENDPOINT. T4 and T5 exist so that cannot come back.
license_tier: ORIGINAL No hw writes (Rule 26). expect_exit: 0
dependencies 2 imports · 0 importers
imports: nx_atlas_graphrec_lib.nxnx_gate.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
| 17 | const GG_NODES: i64 = 2048 |
| 18 | const GG_EDGES: i64 = 8192 |
| 19 | const GG_ARENA: i64 = 262144 |
| 20 | const GG_HASH: i64 = 4096 |
| 25 | const GG_WITNESS_DEG: i64 = 28 |
| 26 | const GG_ENDPOINT_DEG: i64 = 520 |
functions
| 29 | func gg_name(buf: *u8, i: i64) -> i64 called by 1: main |
| 41 | func gg_new() -> *EcoGraph { return eg_new(GG_NODES, GG_EDGES, GG_ARENA, GG_HASH) } |
| 44 | func gg_num(v: i64) -> i64 called by 1: main |
| 58 | func gg_has_pair(ta: *i64, tb: *i64, have: i64, a: i64, b: i64) -> i64 called by 1: main |
| 68 | func main() -> i64 |