01
Beyond the nearest test
The test closest to an edited function can prove direct behavior while missing contracts or downstream effects elsewhere in the blast radius. Proof selection asks which evidence is required by the affected architecture, including regression tests, integration boundaries, invariants, security/authority rules, and failure behavior.
02
Graph-aware selection
Ajenda graph tooling can use changed nodes and mapped dependency/test relationships to identify impacted tests and candidate proof obligations. Selective-CI reasoning can then run a targeted proof set rather than treating every test as equally relevant to every change.
03
Completeness constraint
Targeted proof is only as reliable as the represented architecture and mappings that support selection. Completeness auditing and explicit residual findings therefore matter: a selective test set should not be interpreted as exhaustive proof when known graph gaps or unmapped behavior remain.
Evidence boundary
What this entry supports
Graph-aware proof selection is used in Ajenda development/CI. The site describes the mechanism and current capability without claiming that selective proof guarantees complete behavioral coverage.
Related material