The guarantees live in machinery the model does not control: an anchor it cannot forge, a key it cannot obtain, a gate it cannot talk past. Hover any underlined term for a plain-language definition.
Integrity & audit
Every ingest, question, retrieval and answer is written to an append-only spinespine — The main append-only chain that ties the whole system's history together; every side record commits up into it, giving one tamper-evident timeline. Because there is a single trusted writer on the customer's own box, there are no forks or competing branches. of signed, hash-chained blocks, with per-compartment sidechainssidechain — A separate append-only chain for a specific compartment or record type (knowledge, audit, governance), each independently verifiable and committed up into the spine. It lets one compartment's whole history be audited in isolation, without seeing the others. committing in by Merkle rootmerkle-root — A cryptographic summary hash computed over many items, such that changing any one item changes the root. It lets you prove a record belongs to a sealed set, and detect any tampering, without re-reading everything.. Alter one block and verification says so. The root can be anchoredexternal-anchor — Committing the chain's summary hash to a ledger outside the box, so that a fingerprint once published there cannot be un-published — even by someone who owns the box and its keys. It defeats the strongest adversary, who could otherwise rewrite the whole local history consistently. to an outside ledger so it cannot be quietly rewritten.
Tamper with one block and the whole chain says so. Each block carries the previous one’s fingerprint, so altering block 4 breaks every link after it — you cannot quietly rewrite history, only visibly destroy it. When that happens the system stops serving rather than serve something it cannot vouch for. You can browse the real chain on the live demo — the diagram illustrates the mechanism, it is not a live view of a running system.
An adjudicator that must clear every claim before it is kept
○Planned
Every claim — a rung of the ladder, a step of reasoning, a crossing between domains, and the answer she is about to serve — is submitted with its own evidence to an adjudicator that runs as its own supervised process. Independent oracles run in parallel, their verdicts compose, and the resulting proof is sealed to an audit chain. It carries its own evidence rather than querying the stores, so it can never be starved by the thing it is gating.
The judge writes proofs, never knowledge
○Planned
An always-on adjudicator runs as its own supervised process. It records its verdicts and their proofs to an audit chain and can never write to the knowledge graph.
Provenance chains — a spine, five sidechains, externally anchored
○Planned
A genesis spine with five sidechains, each carrying one domain of events, anchored externally so that tampering is detectable by a third party. Sealing happens at a real boundary rather than on a timer, verification runs before anchoring rather than after, and a reference resolves to a version-qualified address so an auditor can tell exactly which revision of a fact was cited.
What she infers is quarantined from what the company records
○Planned
What she infers from conversations and research is kept in a separate store and is never answered from. It reaches the company record through exactly one gate, which re-derives the claim from documents alone before it may cross.
Security & access
Access is a latticelattice — A model where a reader may see a document only if they satisfy several conditions at once: they out-rank its sensitivity level, hold every one of its compartments, and clear every caveat. It is stronger than a simple "is this person on the list" check., not a list: a reader must out-rank the level, hold every compartmentcompartment — A category — usually a project or department — that partitions knowledge into a separately-keyed area. A reader must hold that compartment to be handed the key for anything filed under it., and clear every caveatcaveat — A restriction that rides on top of a document regardless of which team owns it — for example "insider information" or "contains patient data." Caveats are never inherited by seniority and each one is enforced by its own key path. — evaluated at key-wrapkey-wrap — Wrapping means encrypting a content key to a specific person's public key, so only that person can unwrap and use it. Mnemosyne decides who is allowed a wrapped key at this moment — which is why "no clearance means no key means no readable data" is enforced by cryptography, not by a screen filter. time, so need-to-knowneed-to-know — The principle that clearance to a topic is granted only to those who genuinely require it, and is never inherited automatically by rank. Mnemosyne's own CEO deliberately holds neither insider-information nor personal-data access. is cryptographic, not a display filter. Data at rest is sealed with envelope encryptionenvelope-encryption — The standard pattern where data is encrypted with a per-content key, and that key is itself encrypted (wrapped) to each authorized identity. It lets the system verify and store data without any one master key sitting in the open..
Seniority does not grant need-to-know. Levels inherit; compartments and caveats never do — so the CEO out-ranks the document and is still refused. Because the test runs when the key is wrapped, the boundary is cryptographic, not a display filter: no domination, no key, no plaintext. You can watch this exact behaviour on the live demo — the diagram illustrates the mechanism, it is not a live view of a running system.
Compartmented access control — a lattice, not a filter
◇Research
Clearance is evaluated per node, at the point keys are wrapped, so access is enforced by cryptography rather than by filtering results after the fact.
An independent watcher that co-signs
◇Research
A Stage-3 concept: an independent process that observes the system and co-signs its records, isolated structurally rather than by policy, and able to verify before signing without needing any decryption rights.
Cognition — grounding & the gate
Answers pass an out-of-modelout-of-model — A guarantee enforced by cryptography and by immutable records, not by the model's cooperation — so a compromised or fooled model cannot bypass it. Security lives in the anchor and the key, not in the model's obedience. gate: every claim must dereferencedereference — Resolving a statement to the specific anchored source and quoted span that backs it. If a claim cannot be dereferenced to a cleared, anchored source, it is blocked rather than shown. to an anchored, cleared source or it is blocked as a fabrication. Retrieval compoundscompounding — The effect where a fact stated across several sources accrues independent corroboration, so its confidence honestly rises over time — unlike retrieval, which re-derives a raw answer from scratch each query. Mnemosyne measures this compounding directly. because sources are curated oncecurate-once — The approach of doing the work of verifying and interlinking sources once, into a graph that persists and compounds, rather than re-fetching raw chunks on every question. It is the mechanism behind knowledge that improves with use. into a graph rather than re-fetched every query.
No anchor, no answer. The model proposes; it does not decide. Because the checks run outside it, talking the model into something does not move them — a claim it cannot ground, or that you are not cleared for, simply never leaves. Grounding and clearance are live today; the third check is the one we are still strengthening, and we would rather show you that than draw three green ticks. This illustrates the mechanism — it is not a live view of a running system.Pay once to curate. Recall cheaply and provably. Retrieval tools re-derive an answer from raw chunks on every query, so nothing gets better with use and nothing is checkable afterwards. We curate your sources once into a linked graph, so a fact stated in three documents accrues three independent observations — which is what lets confidence rise for real rather than by assertion. This illustrates the mechanism — it is not a live view of a running system.
Multi-granular recall — a door at every rung
○Planned
Retrieval enters the graph at the granularity the question needs, and a pinned fact is answered by structural traversal rather than by ranking. The document is never a retrieval unit.
Usage is evidence, never a ranking
○Planned
A spec-wide invariant forbids recency-and-frequency — popularity — from acting as a retrieval ranking signal anywhere in the system. Usage is recorded and may serve as evidence about a fact, but it may never decide which fact is returned. In an organisation this is the difference between a system that surfaces what everyone already knows and one that surfaces what actually answers the question.
Each store doing the job it is best at
○Planned
Where every node and every edge physically lives across three stores — a graph store, a vector index, and a columnar store — assigned by what each is best at, up the ladder. The isolated inference domain sits alongside the standard graph rather than inside it.
Judge-bounded reasoning with emergent depth
○Planned
She keeps reasoning while an impasse remains and stops when the judge has run out of objections and every part of the question is answered or honestly declared unanswerable. How long she thinks is learned, not configured.
A truthful I-don't-know is a first-class answer
○Planned
When the corpus cannot answer, she says so and records the gap as a question the company has asked, weighted by how often it is asked. Over time that becomes a map of what the organisation does not have written down anywhere.
An answer declares what it could not read
○Planned
Documents become answerable one at a time rather than in one batch, so she is useful before a large corpus has finished loading. That creates a state a plain answer cannot express: "I don't find X" is false when X is still in the queue, and worse than a refusal because it closes the question. Every outcome therefore carries a qualifier naming what had not yet been read.
Prose in, trackable deliverables out
○Planned
The reasoning loop answers one question well. Planning decides which questions there are, what each one owes the person who asked, in what order, and who does it. A plan never enters the corpus — it is the shape of the work, not knowledge about the company.
Learning
The system improves with use through oracleoracle — A component that produces a verifiable verdict about a claim (for example, "this source really does contain this number"), independent of the language model. The core principle is that the model is never allowed to grade its own work.-verified reinforcement — behind a hard firewallfirewall — A hard architectural separation ensuring the self-learning layer can improve ranking and suggestions but can never decide to release an uncleared fact. It is exactly what lets the system use powerful learning and still make its security claim.: learning can tune ranking, never the security gate.
A learner that holds no facts in its weights
○Planned
A single learning substrate that every learning part of the system plugs into. It learns this company's relation grammar and its productive paths while the facts themselves stay in the graph and are fetched, with a citation, at answer time. Not one fact lives in a weight — so a model that is stolen, copied or compromised carries no company knowledge with it.
She improves while nobody is asking
○Planned
Self-learning loops do the work beyond answering: keeping memory consistent, filling what she does not know, and refining her own policies. The division is a hard rule — a routine that runs while answering is deterministic and never learned; a routine that learns runs only when idle. There is no third kind, so learning can never make a live answer unpredictable.
Ingestion
How standard files become sealed, clearance-tagged knowledge.
Atom extraction — the only thing the model authors
○Planned
At ingest the model proposes ATOMS and nothing else — five kinds (numerical, lexical, boolean, logical, temporal), each a single indivisible value. A deterministic check verifies every atom against the span it was cited from and rejects what does not anchor. Everything above an atom is built by the system, not the model. This is the hard line the whole architecture is organised around: it is what lets the system be audited, because the parts a model cannot be held to account for are the parts a model never wrote.
Every rung above atoms is built by symbolic workers with embeddings used as a representation service, never as a decision-maker. Each rung dedups by identity and carries an occurrence weight. Because the assembly is deterministic it is reproducible: a disputed conclusion can be walked back down the ladder to the documents that produced it.
Non-orphan guarantee — no fact can be stranded
○Planned
Every membership link is bidirectional and tested; a derived view is invalid unless its atoms resolve. Recovery is a first-class routine, not a repair script run by hand after someone notices.
Per-subject grounded synthesis
○Planned
A readable per-subject page in which every claim traces to a concept and is checked by dereference plus entailment before it may appear. Never free composition.
Two domains — what documents prove, and what conversation suggests
○Planned
Two kinds of knowledge deserve two kinds of trust. Company documents are verified and answerable. Meeting minutes, chat threads and conversation transcripts are useful to reason over and unsafe to answer from: they are unverified, contradictory, and an attack surface. They live in a separate domain she may reason across and may never quote as fact. Mk1 had nowhere to put the second kind, so it either excluded it — losing the company's real, current context — or admitted it, losing the audit trail.
Deployment
Run it yourself (on-premon-prem — Short for "on-premises" — running on infrastructure the customer owns and controls, rather than a shared cloud service. It is the default sovereign deployment., air-gapair-gap — A configuration physically or logically disconnected from outside networks, so exfiltrated data would have nowhere to go. The honest trade-off is that an air-gapped deployment cannot use a frontier cloud model.-capable) or let us operate it with zero-accesszero-access — The goal for the managed tier: the operator holds the infrastructure but never the plaintext, because your key unlocks the data only inside protected hardware the host cannot see into. Trust moves to a hardware measurement, not to our promise.confidential computingconfidential-computing — A hardware feature where a virtual machine's memory is encrypted by the CPU itself, so even the operator, the hypervisor, or a cloud insider cannot read what runs inside. It is how the managed tier aims to keep the operator out of the plaintext..
One door for every capability
○Planned
The single door between the system and everything outside her own memory. Each capability is a plug: registered here, invoked here, budgeted here, and logged here. Deciding which capability to use is a reasoning act and happens elsewhere — this layer may refuse a call on budget or availability, and may never select one. The separation is what makes the log of what she reached for outside herself complete and trustworthy.
Skills — procedures with a goal, not just tool calls
○Planned
Procedural knowledge: a goal, a declared set of capabilities with how to use each, scripts that run in a sandbox, and evidence or an artefact as the result. A skill is not a decision about truth — the adjudicator does that — and never writes knowledge itself. Skills cannot be installed at runtime, which is a security property rather than a limitation.
A workspace that is scratch, and provably so
○Planned
The execution substrate every file capability resolves under, with both scopes, the sandbox's guarantees, a recorded egress trail, and a defined answer for what a run becomes as evidence. An artefact enters content-addressed storage when it is created; approval sets its domain, not its existence.
On your hardware, or on ours — with the same key column
○Planned
The same binary, the same cryptosystem, the same chains. On-prem, the customer runs the host. Managed, we run the host — and the keys column is identical, which is the entire product claim. Managed therefore has to contain one extra adversary: us, or anyone who compromises our cloud, our hypervisor, or one of our employees. Updates in managed are applied blue-green and re-attested rather than in place. The mode is a signed field in the licence, never a flag someone can set.
Access decided before the bytes are rendered
○Planned
One invariant chose the whole front-end stack: every access decision is made server-side, before bytes are rendered. An application that fetches data and hides the rows a user may not see has already sent them, and the employee can open developer tools. Rendering where the data lives is the posture, not a preference — and it means there is exactly one place a clearance decision can be made later.
A licensed install, re-validated for years afterwards
○Planned
The installer is the first thing that runs and the only thing that runs before there is a body: not supervised, holding no resources, with nowhere to cascade an error to, because at the moment it runs none of that exists yet. The licence is verified once to decide whether to install, and re-checked at runtime for the years afterwards through two checks with deliberately different trust properties.