code wiki / _hdl_build / nx_vmvres_gate.nx

nx_vmvres_gate.nx

buildroot/runtime/_hdl_build/nx_vmvres_gate.nx

3667 B82 linesdepth 3pulls 7 transitivereach 0 importersview sourcekind gate/proof
docsdependenciesstructsconstsfunctions

about

nx_vmvres_gate.nx -- proves MV prediction + efficient residual coding TOGETHER slash the MV bitrate, and round-trips exactly. Same realistic pan field as nx_vmvpred_gate; codes the predicted residuals with mvr_put (1-bit zero-flag), reads them back (exact), and compares the total against absolute varint coding -- the 65% magnitude win now lands in the total because the common 0-residual costs 1 bit not 5.

dependencies 4 imports · 0 importers

nx_syscalls.nx nx_gate_emit_lib.nx nx_vmvpred.nx nx_vmvres.nx nx_vmvres_gate.nx

imports: nx_syscalls.nxnx_gate_emit_lib.nxnx_vmvpred.nxnx_vmvres.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 mvp_predict mvp_median vbits ve_blen ve_zze mvr_put nx_bw_put ve_vput ve_zze ↻ ve_blen ↻ nx_bw_put ↻ mvr_get nx_br_get ve_vval nx_br_get ↻ ve_zzd mvr_len nx_br_get ↻ ve_vlen nx_br_get ↻ g_pn sys_mmap ↻ sys_write ↻ g_check g_puts ↻ sys_exit

structs

none

consts

none

functions

10func vbits(v: i64) -> i64 { return 5 + ve_blen(ve_zze(v)) }
called by 1: main calls 2: ve_blenve_zze
12func main() -> i64
calls 10: g_putssys_mmapmvp_predictvbitsmvr_putmvr_get+4