GraphRAG vendors build one shared graph over a company's documents. Lossless builds a
sovereign graph per person — and that single architectural choice unlocks a stack of
advantages that a multi-tenant enterprise graph can't replicate.
Edge · 01
Per-tenant sovereign graph
Your graph is not a partition of a shared database — it is its own entity graph in the
same RLS-protected Postgres as your records. A query in one person's graph cannot, by
construction, traverse into another's: the database engine refuses. Privacy is the
topology, not a policy.
Tech: Entity graph in same Postgres · row-level security · per-tenant Pinecone namespace + GCS bucket
Edge · 02
Every edge carries its provenance
An enterprise graph asserts "A relates to B." Lossless asserts "A relates to B —
here is the email, the statement line, and the parser version that proved it."
Every edge is signed under the Universal Provenance Layer. Walk the graph, and you can
walk the receipts.
Tech: UPL-sealed edges · Ed25519 signatures · source pointer on every relationship
Edge · 03
Identity resolution across 30 sources
The plumber's name on a Gmail receipt, his number in your contacts, his LLC on a Plaid
transaction, his texts in iMessage — Lossless resolves all of them to one Person
node. Without resolution, the graph is just disconnected aliases. Resolution is what makes
it traversable.
Tech: cross-source entity resolution · fuzzy + deterministic matching · merge audit trail
Edge · 04
Bi-temporal by construction
Edges have an occurred-at and a known-at. The graph can answer "who was
my contractor in March" and "what did I know about this account on the day I filed" —
both. Amendments add edges; they never overwrite history. Discovery and audit become
trivial.
Tech: bi-temporal edge model · event-sourced corrections · "as-of" graph replay
Edge · 05
Graph-first retrieval, not vector-first
Most "GraphRAG" is still vector search with a graph re-ranker stapled on. Lossless plans
retrieval on the graph first — traverse the typed edges, then use embeddings to
rank within the result set. Multi-hop questions get multi-hop answers.
Tech: graph-plan → embedding-rank · pgvector for ranking only · O(log n) traversal
Edge · 06
Exposed to every agent you authorize
The graph isn't locked inside one app. Claude, ChatGPT, Gemini, Grok — any agent can
traverse it through MCP + REST, scoped to exactly the edges you permit. Your graph becomes
the shared memory that every assistant queries and none of them owns.
Tech: MCP server + REST · per-scope consent on edge types · every traversal in the audit log