code wiki / _hdl_build / nx_vsbest_gate.nx

nx_vsbest_gate.nx

buildroot/runtime/_hdl_build/nx_vsbest_gate.nx

6650 B77 linesdepth 5pulls 7 transitivereach 0 importersview sourcekind gate/proof
docsdependenciesstructsconstsfunctions

about

nx_vsbest_gate.nx -- proves the comparative axis REFUSES every unearned claim. This gate is mostly NEG-CONTROLS on purpose. The whole value of the comparative axis is what it REFUSES: if it admits a claim with no competitor, no method, or unreadable evidence, it becomes the same laundering path permil_to_level was. T1 is the only positive tooth; T2-T8 are the ways a claim can be hollow, and each must be refused with its OWN code so the caller learns WHICH leg failed rather than getting a bare no. T9 is the anti-Goodhart tooth: a `behind` verdict must earn NOTHING above PRODUCTION. Losing to the best in class is not a comparative achievement, and a scale that rewarded merely HAVING run a comparison would be gameable by running easy ones. license_tier: ORIGINAL No hw writes (Rule 26).

dependencies 2 imports · 0 importers

nx_vsbest_lib.nx nx_gate_verdict.nx nx_vsbest_gate.nx

imports: nx_vsbest_lib.nxnx_gate_verdict.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 vb_admit vb_competitor_ok el_streq el_len vb_verdict_parse el_streq ↻ ss_readall sys_openat_rd sys_lseek sys_mmap ↻ sys_read sys_close el_contains el_len ↻ el_match vb_level_for vg_eq gv_check gv_puts ↻ vb_admit_scoped vb_admit ↻ vb_scope_covers el_streq ↻ gv_verdict gv_puts ↻ gv_num sys_mmap ↻ sys_write ↻ sys_munmap gv_journal sys_openat_append sys_mmap ↻ gv_catn sys_mmap ↻

structs

none

consts

none

functions

16func vg_eq(a: i64, b: i64) -> i64 { if a == b { return 1 } return 0 }
called by 1: main
18func main(argc: i64, argv: *i64) -> i64