code wiki / (root) / nx_ltv_pure_gate.nx

nx_ltv_pure_gate.nx

buildroot/runtime/nx_ltv_pure_gate.nx

7549 B110 linesdepth 8pulls 14 transitivereach 0 importersview sourcekind gate/proof
docsdependenciesstructsconstsfunctions

about

nx_ltv_pure_gate.nx -- INDEPENDENT GATE over the PURE DECISION CORE of nx_ltv_lib. ZERO registry writes: proves the PAdES level ladder and the three-valued verdict independently of storage, so a seg_store stall (debt 1785519597) can never make the rules unverifiable. Because pure evaluation is free, the ladder is swept EXHAUSTIVELY over all 64 component combinations and the verdict over every (level x revoked x before/after expiry) cell, rather than on hand-picked cases. Two invariants are asserted across the whole sweep: the level is MONOTONE (adding a component never lowers it), and a revoked certificate is INVALID at EVERY level -- so no combination anywhere can launder a revocation. license_tier: ORIGINAL No hw writes (Rule 26). expect_exit: 0

dependencies 2 imports · 0 importers

nx_ltv_lib.nx nx_gate_verdict.nx nx_ltv_pure_gate.nx

imports: nx_ltv_lib.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 gv_head gv_puts sys_write gv_check gv_puts ↻ ltv_level_pure ltv_is1 ltv_verify_pure ltv_is1 ↻ ltv_self_contained_pure ltv_verdict_label mt_catcopy ltv_level_label mt_catcopy ↻ ltv_needs_renewal_pure gv_verdict gv_puts ↻ gv_num sys_mmap ↻ sys_write ↻ sys_munmap gv_journal sys_openat_append sys_mmap ↻ gv_catn sys_mmap ↻ sys_munmap ↻ sys_now_realtime_sec sys_mmap ↻ sys_clock_gettime_real gv_cat sys_write ↻ sys_close sys_munmap ↻

structs

none

consts

none

functions

15func main(argc: i64, argv: *i64) -> i64