code wiki / _hdl_build / nx_sovereignty_audit_gate.nx

nx_sovereignty_audit_gate.nx

buildroot/runtime/_hdl_build/nx_sovereignty_audit_gate.nx

6287 B79 linesdepth 2pulls 2 transitivereach 0 importersview sourcekind gate/prooftopic sovereignty

docs dependencies structs consts functions

about

nx_sovereignty_audit_gate.nx -- proves the Nishi Office suite's ENTIRE .nx dependency graph is sovereign (no python/sh/java/qemu, every import a .nx module) by running the real /tmp/nx_sovereignty_audit.sov.elf, AND proves the auditor is not a rubber stamp via a NEG-CONTROL: nx_engineer.nx genuinely execs /bin/bash, so the auditor MUST flag it (liar-kill). GREEN iff 8/8. Durable knowledge/status/sovereignty_audit_gate.log. Requires /tmp/nx_sovereignty_audit.sov.elf. license_tier: ORIGINAL

dependencies 1 imports · 0 importers

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

8	func g_puts(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
9	func g_num(v: i64) -> i64 { let bb: u8=sys_mmap(28); var m: i64=v; if m<0{m=0-m;sys_write(1,"-" as u8,1)}; let t: *u8=sys_mmap(28); var k: i64=0; if m==0{t[0]=(48 as u8);k=1}; while m>0{t[k]=((48+(m%10)) as u8);m=m/10;k=k+1}; var i: i64=0; while i<k{bb[i]=t[k-1-i];i=i+1}; sys_write(1,bb,k); return 0 } called by 1: main calls 2: sys_mmap sys_write
10	func g_w(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
11	func g_wn(fd: i64, v: i64) -> i64 { let bb: u8=sys_mmap(28); var m: i64=v; if m<0{m=0-m}; let t: u8=sys_mmap(28); var k: i64=0; if m==0{t[0]=(48 as u8);k=1}; while m>0{t[k]=((48+(m%10)) as u8);m=m/10;k=k+1}; var i: i64=0; while i<k{bb[i]=t[k-1-i];i=i+1}; sys_write(fd,bb,k); return 0 } called by 1: main calls 2: sys_mmap sys_write
12	func g_strlen(s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} return n } called by 1: g_contains
13	func g_read(path: u8, buf: u8, cap: i64) -> i64 called by 1: main calls 3: sys_openat_rd sys_read sys_close
19	func g_contains(hay: u8, n: i64, needle: u8) -> i64 called by 1: main calls 1: g_strlen
25	func g_run(elf: u8, args: i64, nargs: i64, out_path: *u8) -> i64 called by 1: main calls 7: sys_fork sys_openat_wr sys_dup3 sys_mmap sys_execve sys_exit+1
38	func main() -> i64 calls 11: g_puts sys_mmap g_run g_read g_num g_contains+5