nx_ivvcensus.nx
buildroot/runtime/nx_ivvcensus.nx
about
nx_ivvcensus.nx -- derive the IV+V registry from the WHOLE estate instead of a hand-picked sample.
WHY. nx_ivvbeat shipped verifying FOUR gates. buildroot/runtime holds ~1,850 *_gate.nx organs and
knowledge/status holds 363 verdict logs, 233 of them carrying a judgeable anchor. Four rows is 0.2%
coverage that nobody ever justified -- the registry was a sample masquerading as a roster.
(STAR)A HAND-WRITTEN ROSTER IS A SAMPLE WHOSE SIZE NOBODY CHOSE; IT IS NOT SMALL BECAUSE SOMEONE
DECIDED IT SHOULD BE, IT IS SMALL BECAUSE SOMEONE STOPPED TYPING.
METHOD -- MATCH A KNOWN GOOD, THEN GENERALISE. The marker for each gate is not invented here; it is
read out of that gate's OWN log, which is the only place its success string is recorded as fact. Where
the log shows a "passed N/M" shape the HIGHEST M ever observed becomes the tooth floor, so a gate is
held to the best it has ever demonstrated rather than to a number someone typed once.
(STAR)THE STRONGEST FLOOR YOU CAN SET WITHOUT GUESSING IS THE BEST THE THING HAS ALREADY PROVEN.
SCOPE DISCIPLINE -- THIS PROPOSES, IT DOES NOT SEED. Every candidate row is written to a proposal file
and nothing touches the live ivvreg- plane. A census that silently rewrote the registry would make the
beat verify a roster nobody had read.
NEVER-BRICK (Rule 26, ABSOLUTE and NOT waivable by any blast-radius instruction): this organ EXECUTES
NOTHING. It reads logs and tests for file existence. The firmware-axis gates (uefi/boot/efi/cmos/fw)
are additionally flagged so that whoever seeds the registry must decide about them deliberately rather
than inherit them in a bulk paste.
license_tier: ORIGINAL No hw writes. Executes nothing. Writes ONE proposal file.
dependencies 3 imports · 0 importers
imports: nx_syscalls.nxnx_store_seed_lib.nxnx_guarded_run.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
| 28 | const IC_DIRBUF: i64 = 262144 |
| 29 | const IC_TAIL: i64 = 16384 |
| 30 | const IC_OUTCAP: i64 = 1048576 |
| 31 | const IC_NAMECAP: i64 = 512 |
| 32 | const IC_MODE: i64 = 0x1a4 |
| 33 | const IC_SEEK_END: i64 = 2 |
| 34 | const IC_SEEK_SET: i64 = 0 |
| 36 | const IC_PROBE_MS: i64 = 20000 |
| 37 | const IC_PROBE_BUDGET_MS: i64 = 900000 |
functions
| 39 | func ic_len(s: *u8) -> i64 { var n: i64 = 0; while s[n] != (0 as u8) { n = n + 1 } return n } |
| 40 | func ic_puts(s: *u8) -> i64 { sys_write(1, s, ic_len(s)); return 0 } |
| 41 | func ic_putn(v: i64) -> i64 |
| 50 | func ic_cat(b: *u8, o: i64, s: *u8) -> i64 { var i: i64 = 0; while s[i] != (0 as u8) { b[o+i] = s[i]; i = i + 1 } return o + i } called by 1: main |
| 51 | func ic_num(b: *u8, o: i64, v: i64) -> i64 |
| 59 | func ic_isdig(c: u8) -> i64 { if c < (48 as u8) { return 0 } if c > (57 as u8) { return 0 } return 1 } called by 1: ic_best_total |
| 61 | func ic_opendir(p: *u8) -> i64 { return __syscall(257, 0-100, p as i64, 0x10000, 0, 0, 0) } called by 1: main |
| 62 | func ic_getdents(fd: i64, b: *u8, cap: i64) -> i64 { return __syscall(217, fd, b as i64, cap, 0, 0, 0) } called by 1: main |
| 63 | func ic_lseek(fd: i64, off: i64, wh: i64) -> i64 { return __syscall(8, fd, off, wh, 0, 0, 0) } called by 1: main |
| 65 | func ic_ends(s: *u8, suf: *u8) -> i64 |
| 73 | func ic_exists(p: *u8) -> i64 |
| 79 | func ic_find_n(hay: *u8, n: i64, from: i64, needle: *u8) -> i64 |
| 94 | func ic_best_total(buf: *u8, n: i64) -> i64 |
| 132 | func main() -> i64 |