code wiki / _hdl_build / nx_adverse_net_gate.nx

nx_adverse_net_gate.nx

buildroot/runtime/_hdl_build/nx_adverse_net_gate.nx

9069 B172 linesdepth 3pulls 8 transitivereach 0 importersview sourcekind gate/proof
docsdependenciesstructsconstsfunctions

about

nx_adverse_net_gate.nx -- THE MEASURED ADVERSE-NETWORK SCORECARD (NET-R6, no-wave). Simulates "a girl on a bad mobile link (high latency + jitter + ~8% loss + reorder) playing with a boy in Texas" and runs the FULL sovereign netcode stack over the trace vs a NAIVE baseline: bandwidth : nx_netquant delta bit-coding vs raw 28-byte frames smoothness : nx_interp + dead-reckoning vs snap-to-latest (zero-order hold) reliability: nx_fec_xor zero-RTT recovery vs best-effort (no recovery) latency : nx_jitterbuf adaptive playout delay -- reported as the HONEST cost (not a "win") WIN is asserted ONLY where measured; the playout-delay latency is reported, not hidden. Built nx_cc_sovereign -> nxasm_x86 (no gcc, no .sh). license_tier: ORIGINAL

dependencies 6 imports · 0 importers

nx_syscalls.nx nx_gate_emit_lib.nx nx_netquant.nx nx_interp.nx nx_jitterbuf.nx nx_fec_xor.nx nx_adverse_net_gate.nx

imports: nx_syscalls.nxnx_gate_emit_lib.nxnx_netquant.nxnx_interp.nxnx_jitterbuf.nxnx_fec_xor.nx

imported by: nobody (leaf or entry point)

call flow from main pre-order; caps 40 nodes / depth 6 declared; ↻ = already shown

main g_puts sys_write sys_mmap pos setx nx_bits_bytes nq_pack_full nx_bw_put nq_yawn nq_pack_delta nx_bw_put ↻ nq_vput nq_zz nq_bitlen nx_bw_put ↻ fcopy lost jit jb_init jb_on_recv jb_playout ip_init ip_push ip_shiftdrop ip_entset ip_time ip_entswap ip_sample_ex ip_time ↻ ip_sample ip_time ↻ ip_field ip_lerp_angle ip_field ↻ g_abs fec_pkt fec_encode_rows fec_pkt ↻ fec_zero

structs

none

consts

none

functions

17func g_abs(v: i64) -> i64 { if v < 0 { return 0 - v } return v }
called by 1: main
19func pos(t: i64) -> i64 { if t <= 1500 { return t / 3 } return 500 - (t - 1500) / 3 }
called by 1: main
21func jit(i: i64) -> i64 { return ((i * 37) % 161) - 80 }
called by 1: main
22func lost(i: i64) -> i64 { if i == 0 { return 0 } if (i * 13) % 12 == 0 { return 1 } return 0 }
called by 1: main
23func setx(f: *i64, x: i64) -> i64 { var j: i64=0; while j<10 { f[j]=0; j=j+1 } f[0]=x; return 0 }
called by 1: main
24func fcopy(d: *i64, s: *i64) -> i64 { var j: i64=0; while j<10 { d[j]=s[j]; j=j+1 } return 0 }
called by 1: main
26func main() -> i64