code wiki / _hdl_build / nx_capgraph_derive.nx
nx_capgraph_derive.nx
buildroot/runtime/_hdl_build/nx_capgraph_derive.nx
about
nx_capgraph_derive.nx -- builds the LIVE ecosystem capability GRAPH from real sources and ranks rocks.
THIS IS THE PRODUCTION CALLER. nx_capgraph_lib is gate-proven (27/27) but a gated library with no live
caller is, by this ecosystem's own measured law, still the baseline. This organ is what makes the graph
ADOPTED rather than merely GATED.
WHAT IT REPLACES. nx_sota_status emits one FLAT PERMIL per domain (cov=764) and nx_capaxes_derive turns
that into a 6-vector whose evidence axis is hardcoded 0 -- so every domain headlines 0, forever, and the
ranking silently falls back to the coverage claim: the flat percent again. Here the permil is converted
into an ORDINAL LEVEL and then CAPPED BY ITS EVIDENCE CLASS (L6), so a domain claiming cov=1000 out of
the CLAIM-ONLY block lands at TOY, not SOTA -- and when a real gate lands, the level MOVES. That movement
is the forward progress the flat percent could never show.
EVIDENCE CLASS IS READ FROM THE BLOCK THE DOMAIN APPEARS IN, never asserted:
CLAIM-ONLY -> demo evidence (asserts coverage, no executable evidence)
MECH-OK -> gate-nonvacuous (quorum+provenance+freshness hold)
PROVEN -> external-battery (executed gate GREEN + triangulated)
CLAIMED-BUT-RED-> none => UNGROUNDED (doctrine: a dissenting method is WORSE than claim-only,
so it refuses to carry a level at all)
EDGES ARE DECLARED, NEVER INVENTED. Prerequisite edges load from knowledge/status/capgraph_edges.conf
(rows "prereq>dependent"). If that file is absent the graph is reported EDGE-FREE and says so in the
envelope -- it does NOT guess a dependency structure, because an invented edge would fabricate exactly
the kind of authority this organ exists to remove.
nx_capgraph_derive [topN] exit 0 ok | 4 capture-fail
license_tier: ORIGINAL No hw writes (Rule 26). expect_exit: 0
dependencies 1 imports · 0 importers
imports: nx_capgraph_derive_lib.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
| none |
functions
| 30 | func main(argc: i64, argv: *i64) -> i64 |