code wiki / _hdl_build / nx_vsbest_lib.nx
nx_vsbest_lib.nx
buildroot/runtime/_hdl_build/nx_vsbest_lib.nx
about
nx_vsbest_lib.nx -- THE COMPARATIVE AXIS: admit or refuse a vs-best-in-class claim.
WHY THIS DID NOT EXIST AND WHY THAT MATTERED. nx_maturity_auditor defines level 4 S-CLASS as
TRIANGULATED PARITY vs a named best-in-class and level 5 EXCEED as a triangulated WIN. Those are
CLAIMS ABOUT A COMPARISON -- and there was nowhere to put one. The only thing that could reach
those rungs was permil_to_level awarding them from a COVERAGE PERCENTAGE (capped at PRODUCTION on
2026-07-31). So the board reporting "S-class reached in 0 domains" was never evidence that nothing
is good; it is evidence that THE CLAIM COULD NOT BE MADE HONESTLY. This lib is the missing place.
A claim is ADMISSIBLE only if ALL FOUR hold:
competitor -- a NAMED external artifact (gcc, llvm, qemu, seL4, Vortex 3.0), never "the baseline"
method -- how it was run, stated well enough to be RE-RUN by someone else
evidence -- a READABLE log in which the declared pattern ACTUALLY APPEARS
verdict -- behind | parity | ahead
★★★★★A CLAIM MISSING ANY OF THESE IS REFUSED, NOT DOWNGRADED. An unverifiable comparison is not a
weaker comparison, it is the ABSENCE of one -- the same DANGLING-vs-measured split em_derive_level
enforces for capability evidence, applied to the comparative axis.
★★★★★AND THE COMPARATOR MUST BE NON-EMPTY BY NAME. The corpus already banks the failure this
prevents: a census scored "vs 0 SOTA-src" -- an EMPTY comparator, self-referential, able only to
drift upward. Comparing against nothing is how 1000-permil coverage coexists with PROVEN 0/40.
license_tier: ORIGINAL No hw writes (Rule 26).
dependencies 1 imports · 5 importers
imports: nx_ecomat_lib.nx
imported by: nx_vsbest.nxnx_vsbest_gate.nxnx_vsgap.nxnx_vsretract.nxnx_vsroll_lib.nx
structs
| none |
consts
| 26 | const VB_BEHIND: i64 = 0 |
| 27 | const VB_PARITY: i64 = 1 |
| 28 | const VB_AHEAD: i64 = 2 |
| 31 | const VB_OK: i64 = 0 |
| 32 | const VB_NO_COMPETITOR: i64 = 0 - 1 |
| 33 | const VB_NO_METHOD: i64 = 0 - 2 |
| 34 | const VB_NO_EVIDENCE: i64 = 0 - 3 |
| 35 | const VB_PATTERN_ABSENT: i64 = 0 - 4 |
| 36 | const VB_BAD_VERDICT: i64 = 0 - 5 |
| 37 | const VB_MIN_METHOD_LEN: i64 = 12 |
| 38 | const VB_NO_SCOPE: i64 = 0 - 6 |
| 39 | const VB_SCOPE_NARROWER: i64 = 0 - 7 |
functions
| 50 | func vb_scope_covers(scope: *u8, domain: *u8) -> i64 |
| 57 | func vb_verdict_parse(s: *u8) -> i64 |
| 64 | func vb_verdict_label(v: i64) -> *u8 called by 1: main |
| 73 | func vb_level_for(v: i64) -> i64 called by 1: vb_admit |
| 81 | func vb_competitor_ok(c: *u8) -> i64 |
| 99 | func vb_admit_scoped(competitor: *u8, method: *u8, evlog: *u8, evpat: *u8, verdict: *u8, scope: *u8, domain: *u8, out: *i64) -> i64 |
| 114 | func vb_admit(competitor: *u8, method: *u8, evlog: *u8, evpat: *u8, verdict: *u8, out: *i64) -> i64 called by 2: mainvb_admit_scoped calls 6: vb_competitor_okel_lenvb_verdict_parsess_readallel_containsvb_level_for |
| 135 | func vb_refusal_label(rc: i64) -> *u8 called by 1: main |