code wiki / _hdl_build / nx_trust_store_corroborated_test.nx
nx_trust_store_corroborated_test.nx
buildroot/runtime/_hdl_build/nx_trust_store_corroborated_test.nx
about
nx_trust_store_corroborated_test.nx -- proves the spore builds its trust store by corroboration across a set
of candidate roots: only roots that >=K independent sources AGREE on are admitted; disagreement (hearsay) and
poison are rejected. 3 candidate roots, 3 sources each, K=2:
root0: all 3 sources identical -> strength 3 -> ADMIT
root1: all 3 sources DIFFERENT (no agree) -> strength 1 -> REJECT (no corroboration)
root2: 2 sources agree, 1 poisoned -> strength 2 -> ADMIT (poison excluded)
Expected store = {root0, root2}. Exit 0 iff so + soundness holds.
dependencies 2 imports · 0 importers
imports: nx_trust_store_corroborated.nxnx_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
| 11 | func tp(s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} sys_write(1,s,n); return 0 } |
| 12 | func tn(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;k=1}; while m>0{t[k]=48+(m%10);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 } |
| 13 | func fill_root(buf: *u8, len: i64, seed: i64) -> i64 { var i: i64=0; while i<len { buf[i]=((i*7+seed*31+3)&0xff) as u8; i=i+1 } return 0 } called by 1: main |
| 15 | func main() -> i64 |