nx_paradigm_fusion_gate.nx
buildroot/runtime/nx_paradigm_fusion_gate.nx
about
nx_paradigm_fusion_gate.nx -- FUSE explorer + verified-self-improvement into the full ugly-hard-real-science
cycle, run honestly AGAINST our own favoured paradigm. Question: reliable long-chain reduction. Popular =
naive float (ceilings on error-prone sums). Unpopular candidates: (a) deterministic-integer (OUR paradigm),
(b) KAHAN compensated summation (a 1965, now-unfashionable float technique). VERIFY all three vs the EXACT
integer reference on an adversarial 1000-term chain (2^24 then 999 ones). Then RECORD THE HONEST RESULT --
which may temper our paradigm: if a 60-year-old float trick closes the accuracy gap, integer's unique moat
is NOT accuracy but bit-exact determinism (narrow), confirming the earlier honest finding. The science is
the honest result, whatever it is. No hw writes (Rule 26). expect_exit: 0 license_tier: ORIGINAL
dependencies 2 imports · 0 importers
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
structs
| none |
consts
| none |
functions
| 12 | func pf_puts(s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} sys_write(1,s,n); return 0 } |
| 13 | func pf_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 } |
| 14 | func absd(a: i64, b: i64) -> i64 { if a>b { return a-b } return b-a } called by 1: main |
| 16 | func main() -> i64 |