nx_nishios_germ_gate.nx
buildroot/runtime/nx_nishios_germ_gate.nx
about
nx_nishios_germ_gate.nx -- NishiOS SPORE GERMINATION gate (not clones, germinated pieces).
The operator's law: we don't load binary CLONES -- every capability is a content-addressed PIECE,
rebuilt from SOURCE by the sovereign compiler (nx_cc->nxasm, no gcc), KAT-proven, admitted only if its
hash matches (tamper -> reject). This gate proves that property for the whole GUI-OS subtree: for each
capability organ it reads the SOURCE, computes its CID (sha256), and confirms it is present + content-
addressed = germinatable-from-source, not a copied binary. Then it proves content-addressing is
deterministic (same source -> same CID) and tamper-rejecting (one flipped byte -> different CID -> the
piece would be REFUSED at germination). This is the spore/seed concept applied to the desktop: each
rung is a proven, hash-verified, rebuildable piece -- evolutionary computation, not image loading.
Mirrors the genesis CAP-* lineage nodes (nx_genesis_trace GREEN 9/9). expect_exit: 0 tier: ORIGINAL
dependencies 2 imports · 0 importers
imports: nx_syscalls.nxnx_sha256.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
| 14 | func gg_puts(s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} sys_write(1,s,n); return 0 } |
| 15 | func gg_num(v: i64) -> i64 { let b: *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{b[i]=t[k-1-i];i=i+1} sys_write(1,b,k); return 0 } |
| 16 | func gg_hex(cid: *u8, n: i64) -> i64 { var i: i64=0; while i<n { let v: i64=cid[i] as i64; let hi: i64=(v>>4)&15; let lo: i64=v&15; var c1: i64=48+hi; if hi>9 { c1=87+hi } var c2: i64=48+lo; if lo>9 { c2=87+lo } let o: *u8=sys_mmap(4); o[0]=c1 as u8; o[1]=c2 as u8; sys_write(1,o,2); i=i+1 } return 0 } |
| 17 | func gg_eq32(a: *u8, b: *u8) -> i64 { var i: i64=0; while i<32 { if a[i]!=b[i] { return 0 } i=i+1 } return 1 } called by 1: main |
| 20 | func germ_check(cap: *u8, path: *u8) -> i64 |
| 33 | func main() -> i64 |