nx_gapledger_gate.nx
buildroot/runtime/nx_gapledger_gate.nx
about
nx_gapledger_gate.nx -- THE GAP LEDGER IS CITED, RECONCILED, AND ITERATION-SAFE.
Subject: knowledge/gapledger.conf (the quantitative gap ledger vs Infinigen and MetaHuman) plus
the pinned mirrors every THEIR-number is quoted from.
WHY THESE TEETH. The ledger exists because a saturating ruler was read as a capability cap (the
89k-triangle "target" that was really the generator's own ceiling). The failure mode this gate
must make impossible is a DIFFERENT one with the same shape: a best-of-breed number that nobody
can trace, quietly becoming a bar. So:
- every THEIR-number must be quoted from a mirror whose BYTES ARE STILL ON DISK (T4/T5);
- the two Infinigen partitions must SUM, COMPUTED HERE from their parts, never restated
(T2/T3) -- a partition that does not reconcile means a number was transcribed, not read;
- numbers we could not source must stay UNSOURCED with NO ratio published (T6);
- the iteration rule (capability level AND score, never score alone) must be present (T7),
because a consumer reading score alone would re-commit the original error.
I/O NOTE: this gate composes sys_read_file, which sizes its buffer FROM THE FILE and cannot
short-read. v1 hand-rolled open/read/close against a GL_CAP constant; the compiler refused it
(sys_open undefined) and the banked law says the same thing louder -- a buffer cap is not a
number to tune, and for a FILE read there is no guess to make. There is no cap in this gate.
dependencies 2 imports · 0 importers
imports: nx_syscalls.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
structs
| none |
consts
| 25 | const GL_CONF: *u8 = "knowledge/gapledger.conf" |
| 26 | const GL_M1: *u8 = "knowledge/fetched/cmp_gapledger_infinigen1_abs.html" |
| 27 | const GL_M2: *u8 = "knowledge/fetched/cmp_gapledger_infinigen1_full.html" |
| 28 | const GL_M3: *u8 = "knowledge/fetched/cmp_gapledger_mh_dna.md" |
functions
| 30 | func gl_slen(s: *u8) -> i64 { var n: i64 = 0; while s[n] != (0 as u8) { n = n + 1 } return n } |
| 34 | func gl_present(path: *u8) -> i64 |
| 44 | func gl_find(buf: *u8, n: i64, ned: *u8) -> i64 |
| 60 | func gl_num(buf: *u8, n: i64, key: *u8) -> i64 |
| 96 | func main(argc: i64, argv: *i64) -> i64 |