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§
- Homology
Summary - Summary of 1-skeleton homological invariants for a
HarbouredCsrView.
Constants§
- OP_
BELNAP_ BOTH - Belnap 4-valued paraconsistent
Both(⊤contradiction) opcode byte inNQuin::predicate[0..7].
Functions§
- check_
acyclic_ insert - Non-recursive zero-heap reachability gate verifying that inserting
u -> vintoviewdoes not introduce a directed cycle (v -*-> u). - verify_
geometry_ complex_ homology - Verify that the host Geometry Complex’s stamped
euler_characteristicequals its cellular alternating sum $\chi = N_0 - N_1 + N_2 - N_3$. - verify_
graph_ invariants - Verify all active
TopologyInvariantsoncsrand compute itsHomologySummary($\chi, \beta_0, \beta_1$, root count, sink count) with zero heap allocation.