code wiki / _hdl_build / nx_ad_h2h_gate.nx
nx_ad_h2h_gate.nx
buildroot/runtime/_hdl_build/nx_ad_h2h_gate.nx
about
nx_ad_h2h_gate.nx -- GATE (runnable) for the measured head-to-head comparators (nx_ad_h2h). Proves
the raw measured values AND that we strictly beat the incumbent baseline on each named axis, AND
that the comparator is a genuine liar-kill (equal/worse -> no beat):
DELIVERY ours third-party-JS=0, incumbent(GPT)=1 -> beat
TRANSPARENCY ours external-seller-domain=0, incumbent=1 -> beat
SIGNUP ours cost-on-miss=$0, incumbent(CPM)>0 -> beat
liar-kill beats_lower(1,1)=0, beats_lower(2,1)=0, beats_lower(0,1)=1
Evidence -> knowledge/status/ad_h2h.log (H2HGATE ... verdict=GREEN). license_tier: ORIGINAL
dependencies 2 imports · 0 importers
imports: nx_ad_h2h.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
| 12 | const HG_LOG: *u8 = "knowledge/status/ad_h2h.log" |
functions
| 14 | func hg_w(fd: i64, s: *u8) -> i64 { var n: i64 = 0; while s[n] != (0 as u8) { n = n + 1 } sys_write(fd, s, n); return 0 } |
| 15 | func hg_wn(fd: i64, v: i64) -> i64 { let bb: *u8 = sys_mmap(28); var m: i64=v; if m<0 {m=0-m; sys_write(fd,"-" 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)) as u8; m=m/10; k=k+1}; var i: i64=0; while i<k {bb[i]=t[k-1-i]; i=i+1}; sys_write(fd, bb, k); return 0 } |
| 17 | func main() -> i64 |