code wiki / _hdl_build / nx_ad_reach_gate.nx
nx_ad_reach_gate.nx
buildroot/runtime/_hdl_build/nx_ad_reach_gate.nx
about
nx_ad_reach_gate.nx -- GATE (runnable) for HONEST BILLABLE REACH (nx_ad_reach). Proves the charge
basis is ONLY genuinely-seen humans, on a baked funnel + the store-resident bot rules:
funnel : served=95 -> viewable=70 -> billable=50 (bot, unseen, under-dwell all stripped)
liar-kill: a VIEWABLE BOT is NOT billable; an UNSEEN human is NOT billable; a seen human IS
honesty: billable < viewable < served (we never charge for the gap = "no fake impressions")
Evidence -> knowledge/status/ad_reach.log (REACHGATE ... verdict=GREEN). license_tier: ORIGINAL
dependencies 3 imports · 0 importers
imports: nx_ad_reach.nxnx_ad_store.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
| 11 | const RG_LOG: *u8 = "knowledge/status/ad_reach.log" |
functions
| 13 | func rg_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 } |
| 14 | func rg_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 } |
| 16 | func main() -> i64 |