code wiki / _hdl_build / nx_ad_h2h_gate.nx

nx_ad_h2h_gate.nx

buildroot/runtime/_hdl_build/nx_ad_h2h_gate.nx

3790 B75 linesdepth 7pulls 12 transitivereach 0 importersview sourcekind gate/prooftopic ad
docsdependenciesstructsconstsfunctions

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 3 imports · 0 importers

nx_ad_h2h.nx nx_syscalls.nx nx_gate_verdict.nx nx_ad_h2h_gate.nx

imports: nx_ad_h2h.nxnx_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 h2h_transparency_incumbent h2h_incumbent_unit as_contains as_len as_len ↻ h2h_beats_lower hg_w sys_write hg_wn sys_mmap nxa_die sys_write ↻ sys_exit nxa_lock_take nxa_lock_addr sys_write ↻ nxa_lock_give nxa_lock_addr ↻ nxa_report_overrun sys_write ↻ nxa_dump_printable sys_write ↻ nxa_dump_sizes sys_write ↻ sys_write ↻ sys_openat_append sys_close gv_ctr sys_mmap ↻ gv_verdict gv_note_bare_rate gv_bare_rate gv_at gv_obj_has_n gv_at ↻ gv_puts sys_write ↻ gv_num sys_mmap ↻

structs

none

consts

13const HG_LOG: *u8 = "knowledge/status/ad_h2h.log"

functions

15func 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 }
called by 1: main calls 1: sys_write
16func 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 }
called by 1: main calls 2: sys_mmapsys_write
18func main() -> i64