code wiki / _hdl_build / nx_prove_all.nx

nx_prove_all.nx

buildroot/runtime/_hdl_build/nx_prove_all.nx

4642 B75 linesdepth 3pulls 3 transitivereach 0 importersview sourcekind tool

docs dependencies structs consts functions

about

nx_prove_all.nx -- ONE COMMAND RE-PROVES THE CLAIM SET (operator 2026-06-09: "build all this capabilities WITH PROVABILITY"). A claim is only as good as the cost of re-checking it; this orchestrator re-runs every standing grader through the sovereign runner (nx_cc->nxasm->run, no gcc) and writes one durable PROOF line: critic counter-grade, role scorecard, claude-use meter, site quality gate. Add a grader = add a row (data-driven, law #11). Exit 0 iff every grader passes -- "the ecosystem's claims hold" becomes a single re-runnable fact, not a narrative. license_tier: ORIGINAL (orchestration spine = the proven brn_run fork/execve/wait4 pattern)

dependencies 2 imports · 0 importers

imports: nx_syscalls.nxnx_itoa_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

10	func _p(s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} sys_write(1,s,n); return 0 } called by 1: main calls 1: sys_write
15	func _pn(v: i64) -> i64 { nxi_out(v); return 0 } called by 1: main calls 1: nxi_out
16	func _fp(fd: i64, s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} sys_write(fd,s,n); return 0 } called by 1: main calls 1: sys_write
21	func _fn(fd: i64, v: i64) -> i64 { nxi_fd(fd, v); return 0 } called by 1: main calls 1: nxi_fd
22	func pa_run(module: *u8) -> i64 called by 1: main calls 5: sys_fork sys_mmap sys_execve sys_exit sys_wait4
40	func pa_module(id: i64) -> *u8 called by 1: main
53	func main() -> i64 calls 10: _p pa_module pa_run _pn sys_openat_append _fp+4