code wiki / (root) / nx_unsloth_determinism_h2h_gate.nx

nx_unsloth_determinism_h2h_gate.nx

buildroot/runtime/nx_unsloth_determinism_h2h_gate.nx

6045 B74 linesdepth 3pulls 3 transitivereach 0 importersview sourcekind gate/prooftopic unsloth
docsdependenciesstructsconstsfunctions

about

nx_unsloth_determinism_h2h_gate.nx -- FIRST measured head-to-head on the Unsloth benchmark: DETERMINISM. The documented real source of float LLM non-determinism is BATCH-INVARIANCE: a reduction's result depends on how it is GROUPED/tiled, which changes with batch size. Here the SAME 1024-value sum (realistic non- exact values 1/k) is computed three ways = three reduction orders (sequential / pairwise-tree / group-of-8), the way different batch tilings would. FLOAT (the Unsloth/PyTorch path) gives DIFFERENT bits per grouping; INTEGER (sovereign) gives BIT-IDENTICAL. Honest: the float divergence is small (a few ULPs) -- but it is REAL, it is the documented issue, and it is enough to flip a token when two logits are close; integer is batch-invariant FOR FREE, where float needs special kernels + a 10-40% cost. No hw writes (Rule 26). expect_exit: 0 license_tier: ORIGINAL

dependencies 2 imports · 0 importers

nx_syscalls.nx nx_gate_verdict.nx nx_unsloth_determinism_h2h_gat

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

main dh_puts sys_write sys_mmap f_seq f_tree f_g8 i_seq i_tree i_g8 dh_num sys_mmap ↻ sys_write ↻ gv_ctr sys_mmap ↻ gv_verdict gv_puts sys_write ↻ gv_num sys_mmap ↻ sys_write ↻ sys_munmap gv_journal sys_openat_append sys_mmap ↻ gv_catn sys_mmap ↻ sys_munmap ↻ sys_now_realtime_sec sys_mmap ↻ sys_clock_gettime_real gv_cat sys_write ↻ sys_close sys_munmap ↻ sys_exit

structs

none

consts

none

functions

13func dh_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
14func dh_num(v: i64) -> i64 { let b: *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{b[i]=t[k-1-i];i=i+1} sys_write(1,b,k); return 0 }
called by 1: main calls 2: sys_mmapsys_write
17func f_seq(x: *i64, n: i64) -> i64 { var s: i64=__f32_from_i64(0); var i: i64=0; while i<n { s=__f32_add(s, x[i]); i=i+1 } return s }
called by 1: main
18func f_tree(x: *i64, w: *i64, n: i64) -> i64 { var i: i64=0; while i<n { w[i]=x[i]; i=i+1 } var m: i64=n; while m>1 { var k: i64=0; while k<m/2 { w[k]=__f32_add(w[2*k], w[2*k+1]); k=k+1 } m=m/2 } return w[0] }
called by 1: main
19func f_g8(x: *i64, cs: *i64, n: i64) -> i64 { var c: i64=0; while c<n/8 { var s: i64=__f32_from_i64(0); var j: i64=0; while j<8 { s=__f32_add(s, x[c*8+j]); j=j+1 } cs[c]=s; c=c+1 } var t: i64=__f32_from_i64(0); var i: i64=0; while i<n/8 { t=__f32_add(t, cs[i]); i=i+1 } return t }
called by 1: main
21func i_seq(x: *i64, n: i64) -> i64 { var s: i64=0; var i: i64=0; while i<n { s=s+x[i]; i=i+1 } return s }
called by 1: main
22func i_tree(x: *i64, w: *i64, n: i64) -> i64 { var i: i64=0; while i<n { w[i]=x[i]; i=i+1 } var m: i64=n; while m>1 { var k: i64=0; while k<m/2 { w[k]=w[2*k]+w[2*k+1]; k=k+1 } m=m/2 } return w[0] }
called by 1: main
23func i_g8(x: *i64, cs: *i64, n: i64) -> i64 { var c: i64=0; while c<n/8 { var s: i64=0; var j: i64=0; while j<8 { s=s+x[c*8+j]; j=j+1 } cs[c]=s; c=c+1 } var t: i64=0; var i: i64=0; while i<n/8 { t=t+cs[i]; i=i+1 } return t }
called by 1: main
25func main() -> i64