code wiki / (root) / nx_commons_ledger_gate.nx

nx_commons_ledger_gate.nx

buildroot/runtime/nx_commons_ledger_gate.nx

5327 B105 linesdepth 3pulls 5 transitivereach 0 importersview sourcekind gate/prooftopic commons
docsdependenciesstructsconstsfunctions

about

nx_commons_ledger_gate.nx -- proves the ledger derives what the bench previously had to be TOLD, and measures honestly where the derivation STOPS. The headline result here is a LIMIT, not a win: a 3-cycle sybil ring DEFEATS the flow-through rule. Each member gives onward to someone it never received from, so its onward circulation looks perfect and its retained value is zero. Flow-through catches a 2-cycle (return trips) and is blind to longer cycles. That is measured below, not argued. A RULE THAT CATCHES THE SHAPE YOU IMAGINED IS NOT A RULE THAT CATCHES THE BEHAVIOUR. The ring is still convicted -- by the WITNESS layer, which it cannot satisfy at any cycle length -- so the two layers are complementary and NEITHER IS SUFFICIENT ALONE. Shipping flow-through as a sybil defence on its own would have been a false all-clear. license_tier: ORIGINAL expect_exit: 0

dependencies 3 imports · 0 importers

nx_gate_verdict.nx nx_commons_ledger.nx nx_commons_lib.nx nx_commons_ledger_gate.nx

imports: nx_gate_verdict.nxnx_commons_ledger.nxnx_commons_lib.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 ↻ cl_row_key cl_aggregate sys_mmap ↻ cl_is_dup cl_slot gv_puts ↻ gv_num sys_mmap ↻ sys_write ↻ sys_munmap cl_conserved gv_check gv_puts ↻ nxc_retained nxc_standing nxc_raw_standing nxc_effective_given nxc_retained ↻ gv_verdict gv_note_bare_rate

structs

none

consts

17const LG_N: i64 = 7
18const LG_M: i64 = 6

functions

20func main() -> i64