code wiki / _hdl_build / nx_interp_gate.nx
nx_interp_gate.nx
buildroot/runtime/_hdl_build/nx_interp_gate.nx
about
nx_interp_gate.nx -- proves + MEASURES the sovereign snapshot interpolation buffer (nx_interp):
under packet LOSS + REORDERING, render-in-the-past interpolation reconstructs the peer's true path
(loss becomes invisible) while naive snap-to-latest (zero-order hold) staircases. This is what keeps
the bad-mobile-network player smooth.
1) reorder-safe + correct: out-of-order pushes -> time-sorted history; interp ~= truth (loss invisible)
2) EXCEED vs naive (neg-control = zero-order hold): interp max error << naive max error (measured)
3) SMOOTHNESS: interp max per-step jump < naive max per-step jump (measured)
4) yaw shortest-arc: 350deg -> 10deg interpolates through 0 (not the long way)
5) no-data (neg): empty history -> sample returns 0 (no fabricated pose)
6) clamp: before-first -> status 2, at/after-last -> status 3 (hold; extrapolate = NET-R2)
Built nx_cc_sovereign -> nxasm_x86 (no gcc, no .sh). license_tier: ORIGINAL
dependencies 3 imports · 0 importers
imports: nx_syscalls.nxnx_gate_emit_lib.nxnx_interp.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
| 16 | func g_abs(v: i64) -> i64 { if v < 0 { return 0 - v } return v } called by 1: main |
| 18 | func mkf(f: *i64, x: i64) -> i64 { var i: i64=0; while i<10 { f[i]=0; i=i+1 } f[0]=x; return 0 } called by 1: main |
| 20 | func naive_x(times: *i64, nr: i64, rt: i64) -> i64 called by 1: main |
| 27 | func main() -> i64 |