code wiki / _hdl_build / nx_hr_bot_behavior_gate.nx
nx_hr_bot_behavior_gate.nx
buildroot/runtime/_hdl_build/nx_hr_bot_behavior_gate.nx
about
nx_hr_bot_behavior_gate.nx -- referee for the PRIVACY-PRESERVING BEHAVIORAL bot evaluator. PROVES: a human-like
profile is ALLOWed; a naive bot is BLOCKed; a SOPHISTICATED bot (spoofed/consistent env, NO honeypot trip) is
STILL BLOCKed by behavior alone (failed cost-challenge + no real interaction entropy) -- the whole point; an
ambiguous profile is CHALLENGEd (never hard-block a possible human); honeypot + threshold mapping + the cost
monotonicity hold. The evaluator takes ZERO identity inputs (privacy by construction). GREEN iff every row matches.
Prints verdict=GREEN to STDOUT + returns the exit code. Durable -> knowledge/status/hr_bot_behavior_gate.log.
license_tier: ORIGINAL
dependencies 3 imports · 0 importers
imports: nx_hr_bot_behavior.nxnx_g_puts_lib.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
| 12 | func g_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 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{bb[i]=t[k-1-i];i=i+1}; sys_write(1,bb,k); return 0 } |
| 13 | func g_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 g_wn(fd: i64, v: i64) -> i64 { let bb: *u8=sys_mmap(28); var m: i64=v; if m<0{m=0-m}; 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{bb[i]=t[k-1-i];i=i+1}; sys_write(fd,bb,k); return 0 } |
| 15 | func chk(got: i64, want: i64, label: *u8) -> i64 |
| 21 | func main() -> i64 |