Skip to main content

Module invariants

Module invariants 

Source
Expand description

Non-recursive, zero-heap topological, modal, and homological invariant verifiers.

Tier-1 Zero-Heap (AGENTS.md §0 & §0-A): all graph traversals, reachability checks, cycle detectors, and Betti/Euler calculators operate strictly on caller-supplied visited_bits: &mut [u64] and work_queue: &mut [u32] slices without recursion or heap allocation.

Structs§

HomologySummary
Summary of 1-skeleton homological invariants for a HarbouredCsrView.

Constants§

OP_BELNAP_BOTH
Belnap 4-valued paraconsistent Both (⊤ contradiction) opcode byte in NQuin::predicate[0..7].

Functions§

check_acyclic_insert
Non-recursive zero-heap reachability gate verifying that inserting u -> v into view does not introduce a directed cycle (v -*-> u).
verify_geometry_complex_homology
Verify that the host Geometry Complex’s stamped euler_characteristic equals its cellular alternating sum $\chi = N_0 - N_1 + N_2 - N_3$.
verify_graph_invariants
Verify all active TopologyInvariants on csr and compute its HomologySummary ($\chi, \beta_0, \beta_1$, root count, sink count) with zero heap allocation.