code wiki / _hdl_build / nx_random_gate.nx

nx_random_gate.nx

buildroot/runtime/_hdl_build/nx_random_gate.nx

3999 B91 linesdepth 4pulls 4 transitivereach 0 importersview sourcekind gate/proof
docsdependenciesstructsconstsfunctions

about

nx_random_gate.nx -- GATE for nx_random (xoshiro256++ PRNG). Flagged by the HONESTY SYSTEM 2026-07-16: reach=554 organs (fuzzing, sampling, hash-key randomization) with ZERO direct validation. A PRNG is deterministic BY CONTRACT -- so the gate proves: same-seed reproducibility, seed sensitivity, bound respect, bit balance (stuck-stream killer), fill correctness. license_tier: ORIGINAL expect_exit:0

dependencies 2 imports · 0 importers

nx_syscalls.nx nx_random.nx nx_random_gate.nx

imports: nx_syscalls.nxnx_random.nx

imported by: nobody (leaf or entry point)

call flow from main pre-order; caps 40 nodes / depth 6 declared; ↻ = already shown

main nx_rng_new nx_rng_splitmix nx_rng_next nx_rng_rotl qw sys_write nx_rng_below nx_rng_next ↻ pop64 qn sys_mmap sys_write ↻ sys_mmap ↻ nx_rng_fill nx_rng_next ↻

structs

none

consts

none

functions

8func qw(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
9func qn(v: i64) -> i64 { let b:*u8=sys_mmap(24); var m:i64=v; if m<0{sys_write(1,"-" as *u8,1);m=0-m} let t:*u8=sys_mmap(24); 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 j:i64=0; while j<k{b[j]=t[k-1-j];j=j+1} sys_write(1,b,k); return 0 }
called by 1: main calls 2: sys_mmapsys_write
11func pop64(v: i64) -> i64
called by 1: main
20func main() -> i64
calls 8: nx_rng_newnx_rng_nextqwnx_rng_belowpop64qn+2