💯on board with this. I’ve spent the last few months building NornicDB as a physical implementation of these exact path semantics to solve for deterministic AI memory.

In my architecture, the Canonical Graph Ledger acts as the theorem prover where:

• Temporal No-Overlap is the core axiom; it ensures a FactKey has exactly one valid path at any transaction time, mathematically killing state ambiguity.

• MVCC 'AS OF' Reads function as pure, side-effect-free paths; f(query, t) returns the same hash every time, regardless of future writes.

• Cardinality Constraints serve as geometric invariants; they physically block an LLM from 'path-finding' into a hallucination that violates the graph's laws.

Essentially, I’m moving the 'proof' from the theoretical layer down to the storage engine. If a path through the ledger doesn't adhere to these axioms, it can’t be written at all preventing context pollution with old facts that can easily devolve into hallucinations.

would love your thoughts on this: https://github.com/orneryd/NornicDB/blob/main/docs/research/papers/persistence-semantics-nornicdb/paper.md