code wiki / _hdl_build / nx_livemap_fast_gate.nx

nx_livemap_fast_gate.nx

buildroot/runtime/_hdl_build/nx_livemap_fast_gate.nx

7287 B134 linesdepth 4pulls 5 transitivereach 0 importersview sourcekind gate/proof
docsdependenciesstructsconstsfunctions

about

nx_livemap_fast_gate.nx -- prove the LINEAR live-doc map is byte-identical to the quadratic one. ss_open2 already built the authoritative maps at h[1 + 8*ns + s] using the existing O(keys x segments) shadow scan. This gate rebuilds the same maps using the newest-first hash table from nx_livemap_fast and compares EVERY BYTE. Any difference is a correctness failure, not a perf note: these maps decide which documents are visible, so a faster map that is subtly different does not make search quick, it makes search WRONG. Run against the REAL shard, not a fixture. A synthetic 2-segment store would not exercise the shadow logic that only appears with many overlapping segments, and this session already learned that a gate is only as honest as its ugliest input. license_tier: ORIGINAL No hw writes (Rule 26).

dependencies 2 imports · 0 importers

nx_livemap_fast.nx nx_gate_verdict.nx nx_livemap_fast_gate.nx

imports: nx_livemap_fast.nxnx_gate_verdict.nx

imported by: nobody (leaf or entry point)

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

main gv_ctr sys_mmap nxa_die sys_write sys_exit nxa_lock_take nxa_lock_addr sys_write ↻ nxa_lock_give nxa_lock_addr ↻ nxa_report_overrun sys_write ↻ nxa_dump_printable sys_write ↻ nxa_dump_sizes sys_write ↻ gv_head gv_puts sys_write ↻ gv_puts ↻ ss_open2 ss_open3 sys_now_us sys_mmap ↻ sys_clock_gettime_mono sys_mmap ↻ ss_manifest_dyn ss_manifest_file_dyn sys_mmap ↻ ss_cat ss_readall sys_openat_rd sys_lseek sys_mmap ↻ sys_read sys_close sys_munmap ss3_admit ss3_ann

structs

none

consts

none

functions

16func lg_eq(a: i64, b: i64) -> i64 { if a == b { return 1 } return 0 }
called by 1: main
18func main(argc: i64, argv: *i64) -> i64