nx_companion_rel_gate.nx
buildroot/runtime/nx_companion_rel_gate.nx
about
nx_companion_rel_gate.nx -- GATE for R1d (nx_companion_rel): relationship state evolves correctly and safely.
Proves: (T1) round-trip; (T2) facts APPEND additively (a new fact never erases a prior one); (T3) trust is
CLAMPED to 0..100 at both ends (never-brick numeric bound); (T4) a mutation preserves the other fields
(read-modify-write is lossless); (T5) the projected context carries stage + facts; (T6) neg -- unknown
(persona,user) yields empty context; (T7) ISOLATION -- one persona's relationship with a user is independent
of another persona's. Timestamp-fresh /tmp store -> deterministic re-runs. license_tier: ORIGINAL expect_exit: 0
dependencies 2 imports · 0 importers
imports: nx_companion_rel.nxnx_gate_verdict.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 rw(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 |
| 11 | func rn(v: i64) -> i64 { let bb: *u8=sys_mmap(28); var m: i64=v; if m<0{sys_write(1,"-" as *u8,1);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(1,bb,k); return 0 } called by 1: main |
| 12 | func r_streq(a: *u8, b: *u8) -> i64 { var i: i64=0; while a[i]!=(0 as u8){ if a[i]!=b[i]{return 0} i=i+1 } if b[i]!=(0 as u8){return 0} return 1 } called by 1: main |
| 13 | func r_find(hay: *u8, hlen: i64, needle: *u8) -> i64 called by 1: main |
| 21 | func r_slen(s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} return n } called by 1: main |
| 23 | func main() -> i64 |