code wiki / _hdl_build / nx_cost_oracle_test.nx

nx_cost_oracle_test.nx

buildroot/runtime/_hdl_build/nx_cost_oracle_test.nx

3565 B45 linesdepth 3pulls 3 transitivereach 0 importersview sourcekind gate/prooftopic cost

docs dependencies structs consts functions

about

nx_cost_oracle_test.nx -- judging speed on emulated time is biased; a counted invariant is fair. Two programs A (3 insns) and B (5 insns). Wall-clock across 3 runs is noisy and FLIPS the winner (A: [10,12,9], B: [8,15,11] -> run0 B faster, run2 A faster); instruction count is 3 vs 5 EVERY run. The cost oracle REJECTS a wall-clock verdict and renders a stable verdict on instruction count. Exit 0 on 7/7. license_tier: ORIGINAL

dependencies 2 imports · 0 importers

imports: nx_cost_oracle.nxnx_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

10	func ct_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
11	func ct_num(v: i64) -> i64 { let bb: 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;k=1}; while m>0 {t[k]=48+(m%10); m=m/10; k=k+1}; var i: i64=0; while i<k {bb[i]=t[k-1-i]; i=i+1}; sys_write(1, bb, k); return 0 } called by 1: main calls 2: sys_mmap sys_write
13	func main() -> i64 calls 8: ct_puts sys_mmap co_reproducible co_wallclock_flips co_fair_verdict ct_num+2