code wiki / _hdl_build / nx_estate_inventory_gate.nx

nx_estate_inventory_gate.nx

buildroot/runtime/_hdl_build/nx_estate_inventory_gate.nx

8319 B103 linesdepth 2pulls 2 transitivereach 0 importersview sourcekind gate/prooftopic estate

docs dependencies structs consts functions

about

nx_estate_inventory_gate.nx -- proves the estate inventory's CONFLICT-REDUCING storage properties by driving the REAL /tmp/nx_estate_inventory.sov.elf over a fresh store: NEVER-LOSE : put 3 assets -> get each back faithfully (the beneficiary survives a round-trip) SINGLE TRUTH : update an asset -> get returns the NEW value, not the old (one authoritative current state) AUDIT TRAIL : history shows BOTH the old AND new versions (immutable; old never destroyed) -> the executor + heirs see the complete, tamper-evident change record = less to dispute FULL INVENTORY : list enumerates EVERY asset (the whole will), each at its CURRENT state, DEDUPED (an asset edited twice appears once) -> the executor sees the complete estate at a glance GREEN iff 10/10. Durable knowledge/status/estate_inventory_gate.log. 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

12	func e_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
13	func e_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
14	func e_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
15	func e_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
16	func e_strlen(s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} return n } called by 1: e_contains
17	func e_read_small(path: u8, buf: u8, cap: i64) -> i64 called by 1: main calls 3: sys_openat_rd sys_read sys_close
23	func e_contains(hay: u8, n: i64, needle: u8) -> i64 called by 1: main calls 1: e_strlen
30	func e_run(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
43	func main() -> i64 calls 11: e_puts sys_mmap e_run e_read_small e_contains e_num+5