code wiki / (root) / nx_unsloth_toolcall_h2h_gate.nx

nx_unsloth_toolcall_h2h_gate.nx

buildroot/runtime/nx_unsloth_toolcall_h2h_gate.nx

5707 B73 linesdepth 3pulls 3 transitivereach 0 importersview sourcekind gate/prooftopic unsloth
docsdependenciesstructsconstsfunctions

about

nx_unsloth_toolcall_h2h_gate.nx -- turn the tool-calling PARITY line into a MEASURED win on the one honest axis: VERIFIED + SOVEREIGN tool execution. Standard LLM tool-calling (Unsloth/agents) runs Python/Bash and TRUSTS the output (unchecked, needs the runtime). The Nishi pattern: each tool is a sovereign organ whose output is GATE-VERIFIED against its property (verifier-with-teeth) before being trusted. Simulate flaky tool executions: UNVERIFIED dispatch accepts the wrong results; VERIFIED dispatch CATCHES them. Measured. HONEST regime: this wins for VERIFIABLE tools (math/logic/data); concede the breadth of a Python tool ecosystem (can do anything, unverified). 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_toolcall_h2h_gate.n

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 tc_puts sys_write sys_mmap isqrt is_prime v_sqrt v_prime is_prime ↻ tc_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

11func tc_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
12func tc_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
13func isqrt(v: i64) -> i64 { if v<=0 { return 0 } if v<4 { return 1 } var x: i64=v; var y: i64=(x+1)>>1; var go: i64=1; while go==1 { if y<x { x=y; y=(x+v/x)>>1 } else { go=0 } } return x }
called by 1: main
14func is_prime(n: i64) -> i64 { if n<2 { return 0 } var d: i64=2; while d*d<=n { if (n%d)==0 { return 0 } d=d+1 } return 1 }
called by 2: v_primemain
16func v_sqrt(n: i64, s: i64) -> i64 { if s*s>n { return 0 } if (s+1)*(s+1)<=n { return 0 } return 1 }
called by 1: main
17func v_prime(n: i64, claim: i64) -> i64 { let truth: i64=is_prime(n); if claim==truth { return 1 } return 0 }
called by 1: main calls 1: is_prime
19func main() -> i64
calls 10: tc_putssys_mmapisqrtis_primev_sqrtv_prime+4