code wiki / _hdl_build / nx_research_isqrt_gate.nx
nx_research_isqrt_gate.nx
buildroot/runtime/_hdl_build/nx_research_isqrt_gate.nx
about
nx_research_isqrt_gate.nx -- sovereign integer square root: Newton's method ITERATIVELY DISCOVERS floor(sqrt(N)),
and an exact integer bracketing check (r^2 <= N < (r+1)^2) VERIFIES it -- the discover-then-verify pattern, and
a foundational primitive (unblocks 1/r^2 force laws for orbital dynamics). MEASURED: Newton converges in a
handful of iterations where a naive linear scan needs O(sqrt(N)). Liar-kill: a wrong root fails the bracket.
Pure integer, deterministic. GREEN iff 6/6. license_tier: ORIGINAL
dependencies 1 imports · 0 importers
imports: nx_syscalls.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
| 8 | func g_w(s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} sys_write(1,s,n); return 0 } |
| 9 | func g_n(v: i64) -> i64 { var m: i64=v; if m<0{g_w("-");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 i:i64=0; let o:*u8=sys_mmap(24); while i<k{o[i]=t[k-1-i];i=i+1}; sys_write(1,o,k); return 0 } |
| 10 | func g_row(id: *u8, ok: i64, pass: *i64) -> i64 { g_w(" "); g_w(id); g_w(": "); if ok==1 { g_w("OK\n"); pass[0]=pass[0]+1 } else { g_w("FAIL\n") } return 0 } |
| 11 | func xrng(s: *i64) -> i64 { var x: i64=s[0]; x = x ^ (x << 13); x = x ^ (x >> 7); x = x ^ (x << 17); s[0]=x; return x } called by 1: rpos |
| 12 | func rpos(s: *i64) -> i64 { let v: i64 = xrng(s); return v & 0x3FFFFFFFFFFFFFFF } |
| 15 | func isqrt(N: i64, itp: *i64) -> i64 called by 1: main |
| 23 | func isqrt_naive(N: i64, itp: *i64) -> i64 called by 1: main |
| 30 | func bracket_ok(N: i64, r: i64) -> i64 { if r*r>N { return 0 } if (r+1)*(r+1)<=N { return 0 } return 1 } called by 1: main |
| 32 | func main() -> i64 |