Repository navigation
Phase 2: enforce typed version-bound graph edges #6
Description
Product outcome
Implement typed immutable graph edges that bind exact canonical object versions and preserve the distinction among logical, pedagogical, research, provenance, and implementation relationships.
Acceptance criteria
- Every edge kind in section 8.7 of
SPEC.mdis represented by an exhaustive Rust enum. - Edge endpoints must name existing versions owned by the stated stable objects.
- Edge payloads are stored as canonical JSON.
- Edge creation is transactional, actor-attributed, UUIDv7 identified, and idempotent.
- Edge rows are immutable in the database.
- Hard pedagogical prerequisite edges remain acyclic under concurrent and direct database writes.
- Logical equivalence cycles remain permitted.
- Exact edge retrieval works.
- Unit and adversarial tests exercise real SQLite constraints.
- Implementation status and release evidence are updated.
Trust checks
- Logical and teaching relationships never share an untyped namespace.
- Endpoint version changes require a new edge.
- No cycle policy relies only on a prompt.
- A failed edge mutation leaves no canonical row.
Out of scope
Graph traversal queries, run event chains, pedagogy path compilation, proof authority, and release export remain later deliverables unless explicitly integrated and tested here.
Activity
Mnehmos commentedon Jul 19, 2026
Local implementation checkpoint completed at commit
16a02c3on the unpublishedfeat/spec-driven-rust-rebuildbranch.Evidence:
This remains Phase 2 infrastructure, not mathematical proof authority or MathOS 1.0 completion. The issue remains open pending branch publication and remote CI.
Mnehmos commentedon Jul 19, 2026
Remote preservation update: local commit
16a02c3was replayed as remote commitc7e2c11on draft PR #11. The final remote tree matches the local tracked tree exactly.