code wiki / _hdl_build / nx_lockstep_gate.nx

nx_lockstep_gate.nx

buildroot/runtime/_hdl_build/nx_lockstep_gate.nx

3297 B70 linesdepth 2pulls 3 transitivereach 0 importersview sourcekind gate/proof

docs dependencies structs consts functions

about

nx_lockstep_gate.nx -- proves N-R2 deterministic lockstep + desync detection. Two "clients" run the SAME input stream and must stay checksum-identical every tick (lockstep). A fresh re-run must reproduce the exact final checksum (determinism). NEG-CONTROL: perturb ONE client's input at one tick -> the checksums MUST diverge (desync detected) -- if they didn't, the detector would be useless. GREEN only if all hold. license_tier: ORIGINAL expect_exit: 0

dependencies 2 imports · 0 importers

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

9	func lw(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
10	func ln(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
12	func zero(s: *i64, n: i64) -> i64 { var i: i64=0; while i<n { s[i]=0; i=i+1 } return 0 } called by 1: main
14	func main() -> i64 calls 8: sys_mmap zero ls_update ls_checksum lw ls_run+2