code wiki / _hdl_build / nx_pow_challenge_gate.nx
nx_pow_challenge_gate.nx
buildroot/runtime/_hdl_build/nx_pow_challenge_gate.nx
about
nx_pow_challenge_gate.nx -- gate for the L7 DDoS proof-of-work puzzle (nx_pow_challenge). Proves the
leading-zero-bit count, that a solver finds a valid solution which the server verifies, the difficulty
MONOTONICITY (a harder-than-required solution still satisfies an easier check), that a low-difficulty
solution does NOT satisfy a much harder one (cost scales), and the COST ASYMMETRY (a high difficulty is
infeasible to brute within a small budget = the defense). Appends "ACCESSGATE row=nx_pow_challenge ddos-pow
... verdict=PASS" to knowledge/status/access_gate.log on all-pass. license_tier: ORIGINAL
dependencies 2 imports · 0 importers
imports: nx_pow_challenge.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 pw_w(s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} sys_write(1,s,n); return 0 } |
| 11 | func pw_num(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(1,bb,k); return 0 } |
| 12 | func pw_cat(dst: *u8, off: i64, s: *u8) -> i64 { var o: i64=off; var k: i64=0; while s[k]!=(0 as u8){dst[o]=s[k];o=o+1;k=k+1} return o } called by 1: main |
| 13 | func pw_catnum(dst: *u8, off: i64, v: i64) -> i64 { var o: i64=off; let t: *u8=sys_mmap(28); var m: i64=v; if m<0{m=0-m}; 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{dst[o]=t[k-1-i];o=o+1;i=i+1} return o } |
| 14 | func pw_row(id: i64, ok: i64, what: *u8) -> i64 { pw_w("POWROW " as *u8); pw_num(id); pw_w(" " as *u8); if ok==1 { pw_w("PASS " as *u8) } else { pw_w("FAIL " as *u8) } pw_w(what); pw_w("\n" as *u8); return ok } |
| 15 | func pw_slen(s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} return n } called by 1: main |
| 17 | func main() -> i64 |