code wiki / (root) / nx_commons_govern_gate.nx

nx_commons_govern_gate.nx

buildroot/runtime/nx_commons_govern_gate.nx

7005 B129 linesdepth 3pulls 4 transitivereach 0 importersview sourcekind gate/prooftopic commons
docsdependenciesstructsconstsfunctions

about

nx_commons_govern_gate.nx -- proves that some rules are not votable, and that this is what stops capture rather than any threshold. T1 is the tooth: a unanimous, fully-quorate, well-formed proposal to raise the 3:1 spread cap to 100:1 must return VOID. It is bite-proven against plain quorum (the nx_council_gate shape, kept in the library as a negative control) which ALLOWS it -- because plain quorum has no answer to "what if they simply vote to remove the protection". Threshold rules lose to money; unamendable ones do not, because there is nothing to buy. license_tier: ORIGINAL expect_exit: 0

dependencies 2 imports · 0 importers

nx_gate_verdict.nx nx_commons_govern.nx nx_commons_govern_gate.nx

imports: nx_gate_verdict.nxnx_commons_govern.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 ↻ cg_decide cg_is_constitutional cg_valid_approvals cg_plain_quorum_decide cg_effective_weight gv_puts ↻ gv_num sys_mmap ↻ sys_write ↻ sys_munmap gv_bite gv_puts ↻ gv_check gv_puts ↻ gv_verdict gv_note_bare_rate gv_bare_rate gv_at gv_obj_has_n gv_at ↻

structs

none

consts

13const GG_N: i64 = 4
14const GG_PROPOSER: i64 = 9
15const GG_TOTAL: i64 = 1000

functions

17func main() -> i64