Patent pendingProvisional filed February 26, 2026

The inventions behind Edwin

Edwin's provisional patent application covers nine inventions for AI memory you can check: telling true from merely confident, a change from a contradiction, and a settled fact from one that needs another look. Here is each one in plain English, with the experiment behind it.

Filed: February 26, 2026
Inventor: Alexander Snyder
9 independent, 15 dependent claims
At a glance — our summary, not the filed text

The application describes a personal knowledge base that more than one AI model keeps checking. Its nine independent claims cover a confidence score that separates how well a fact was analyzed from whether it is true; health zones for facts; fact-checks that bring in related facts; checking related facts as a group; scheduling reviews by how much the models disagree; telling an update from a contradiction using dates; one loop that joins these together; encrypted, signed snapshots the user owns; and scheduled challenges of facts the system relies on. Fifteen dependent claims add detail, including fact-checks backed by web sources (7a).

Filed as: System and Method for Epistemic Knowledge Management with Multi-Model Verification, Temporal Intelligence, and Decentralized Data Sovereignty.

Five problems the filing addresses

AI memory has to know more than what was said. It has to know what's true, what changed, and what still holds up. The filing names five problems and answers each one. A longer walk-through: five ways AI memory fails, and how Edwin answers each.

Confidence isn't truth

AI models sound sure even when they're wrong. On 200 FEVER fact-checking claims, one model reported confidence of 0.95 or higher on 97.5% of them, including the ones it got wrong.

97.5% of 200 claims scored 0.95 or higher

Some contradictions hide in pairs

Facts can agree two at a time and still contradict each other as a group. Comparing facts in pairs found none of five planted multi-fact contradictions.

0 of 5 found by pairwise checks · Feb 2026

A change looks like a conflict

When a price or a role changes, memory without dates sees two facts that disagree. In our internal test without source dates, only 23 of 50 updates were classified correctly.

23 of 50 without dates · 50 of 50 with

Checkers drift toward agreeing

When several AI models check one another, they can slide into rubber-stamping. The filing treats disagreement as a resource: it schedules work by it and monitors it against a 15% floor.

15% minimum disagreement, monitored

Memory should belong to its owner

Your knowledge base should be portable, encrypted under your own key, and provably yours, so it can be restored wherever you choose.

Encrypted · signed · restorable

The nine inventions

Numbered as in the filing. Open a claim for a plain-English summary and the experiment that supports it.

Our summary, not the filed text

Claim 1

Facts are trusted for being true, not for sounding sure

Independent. Filed as: Effective Confidence — Dual-Score Architecture
Our summary, not the filed text
effective confidence = composite confidence × veracity score

Every fact gets two scores. The first measures how well it was analyzed: two or more AI models assess it and their confidence is combined. The second is a separate fact-check that asks a simpler question: is this likely true? Multiplying the two gives an effective confidence. Facts that fail the fact-check (below 0.2) are blocked, and uncertain ones (0.2 to 0.4) are capped at 0.4. The result decides what ranks first, what enters the trusted context the AI reads first, and what gets archived. The filing's example: a well-analyzed false claim (0.85 × 0.2) lands at 0.17 and stays out of the trusted context.

Supporting experimentFeb 2026 · 50 test facts

Accuracy of the trusted context rose from 56% without the fact-check to 88% with it; 19 of 20 false facts were caught.

More on the formula: how the effective-confidence score is computed.

Claim 2

Every fact has a health status: settled, contested or new

Independent. Filed as: Epistemic Zone Classification
Our summary, not the filed text

Instead of a single confidence number, each fact is sorted into one of three zones: coherent (settled), contested (disputed or weakly supported) or frontier (too new to judge). A fixed rule order decides the zone from four signals: how much the AI models disagree about the fact, whether it is linked to a contradicting fact, its fact-check score, and how many times it has been reviewed. The zones then guide daily briefings, what gets reviewed next and the labels people see, so “this is contested” and “this is settled” can be said in plain words.

Claim 3

New facts are checked against what's already known

Independent. Filed as: Graph-Grounded Verification
Our summary, not the filed text

When a new fact arrives, the system gathers the existing facts most likely to conflict with it: facts already in dispute on the topic, confident facts in the same category, and its direct neighbors in the knowledge graph. They go into the fact-check alongside the new fact, so the model judges it against what is already known rather than in isolation.

Supporting experimentFeb 2026 · 15 planted contradictions

With the knowledge-graph context, 10 of 15 planted contradictions were caught; checking each fact on its own caught 9.

Claim 4

Catch contradictions that only appear when facts are read together

Independent. Filed as: Cluster Coherence Checking
Our summary, not the filed text

“Alice manages Project X,” “Alice isn't in management” and “Project X needs a management sponsor” look fine two at a time, but not together. The system groups three to five closely linked facts and asks a language model to check them as a set, then labels anything it finds as temporal, numerical, semantic or cross-referential. One check per group can replace or supplement comparing every pair.

Supporting experimentFeb 2026 · 5 planted contradictions

Comparing facts in pairs found none of five multi-fact contradictions; the cluster check, followed by the review cycles it informs, found 4 of 5.

Claim 5

Checking effort goes where the AI models disagree

Independent. Filed as: Divergence-Driven Enrichment Routing
Our summary, not the filed text

Each fact gets a priority from how often it is used, how long since it was reviewed, how connected it is and whether it is flagged for a contradiction. That priority is tripled when the AI models sharply disagree about the fact and halved when they firmly agree. Every batch also includes at least one brand-new fact, so new knowledge is never crowded out by established facts.

Supporting experimentBefore filing · 200 FEVER claims, 6 models

The main model and a local model rarely got the same claims wrong (error overlap: Jaccard 0.114), so their disagreement points to facts worth a closer look.

Claim 6

A change is recorded as an update, not an error

Independent. Filed as: Temporal Update Detection
Our summary, not the filed text

Every fact carries two dates: when it was true in the world and when the system learned it. When two facts seem to clash, both dates go to the model, which can answer contradiction, update, consistent or unrelated. An update links the newer fact to the one it replaces, and the older fact stays on record with its date. A budget that went from $500K to $750K is history, not a conflict.

Supporting experimentInternal test · Feb 2026

With source dates, Edwin classified 50 of 50 updates correctly; without them, 23 of 50.

Claim 7

Each check feeds the next, in one continuous loop

Independent, system-level. Filed as: Closed-Loop Epistemic Integration
Our summary, not the filed text

Claims 1 to 6 and 9, joined into one cycle. The knowledge graph shapes verification, and verification reshapes the graph. Disagreement between the models decides what gets reviewed next, and review uncovers new links. Dates keep facts current, zones track the health of the whole, and scheduled challenges send weak facts back for another look. Each part uses the others' outputs.

Supporting experimentFeb 2026 · 10 planted contradictions

The full system caught 8 of 10 planted contradictions; a plain memory store caught none.

Claim 8

Your memory, encrypted under your key and restorable by you

Independent. Filed as: Data Sovereignty via Decentralized Storage
Our summary, not the filed text

A snapshot of the knowledge base is stripped of personal details such as names, emails and phone numbers, encrypted under a key the user controls (AES-256-GCM), signed to prove where it came from (Ed25519), and stored on decentralized storage (the Walrus protocol on Sui). To restore it, the user downloads the snapshot, verifies the signature, decrypts it and rebuilds the knowledge base.

Supporting experimentFeb 2026 · one round trip

A 132.5 KB snapshot was encrypted, signed, uploaded in 7.5 seconds and restored with every fact and link identical.

More on this layer: what our sovereignty layer does.

Claim 9

Old facts are challenged on a schedule, not trusted forever

Independent. Filed as: Sleep Consolidation with Counterfactual Challenge
Our summary, not the filed text

Like the brain consolidating memories during sleep, the system regularly revisits facts it has come to rely on (the filed default is every six hours). A language model is asked to argue against each one, with its related facts in view, and to score how vulnerable it is. Facts that don't hold up are demoted, facts that do are kept, and every decision is logged with the model, the score and the reasoning.

Supporting experimentFeb 25, 2026 · real meeting data

Two sweeps challenged 7 mature facts drawn from meeting transcripts: 6 were demoted and 1 held up.

Dependent claims

Fifteen dependent claims add detail to the nine above.

Claim 7a

Fact-checks backed by web sources you can follow

Dependent on Claim 7. Filed as: Evidence-Grounded Veracity via Web Search
Our summary, not the filed text

During the fact-check, a model with web search looks for evidence. The source links are saved with the fact, and the evidence-backed score replaces the unbacked one. Searches are rate-limited, with a fallback to the standard check, and web evidence is used only for checking, never to add knowledge, so the system's own outputs can't feed its checks.

The other fourteen — our summary, not the filed text
  • 1aThe 0.2 and 0.4 fact-check thresholds, tuned on public FEVER fact-checking data.
  • 1bA ranking formula for the trusted context: how often a fact is used, its links, effective confidence and recency.
  • 1cA third model breaks the tie when two models confidently disagree.
  • 2aZones set review priority: contested facts before coherent ones, frontier facts first for verification.
  • 3aThree sources for the verification context: contradicting, corroborating and neighboring facts.
  • 4aGroups of two to five facts, and four contradiction types.
  • 5aAt least one new, unverified fact in every review batch.
  • 5bAdjustable disagreement thresholds, with normal priority in between.
  • 6aTwo dates per fact: when it was true, and when the system learned it.
  • 6bAn update links the newer fact as the replacement and keeps the older fact for history.
  • 7bA failover chain of verifier models, so checking continues when one provider is down.
  • 7cA rolling monitor that warns if the models start agreeing too readily (default floor: 15% disagreement).
  • 8aRemoval of names, emails, phone numbers, addresses and Social Security numbers before external storage.
  • 9aThe challenge shows the facts linked to it as supporting, contradicting, related or replacing.

Results are from our own experiments; the full record, including what didn't work, is on /research.

Questions about what is implemented today: ask us.

Built on measurement

The filing was written from our own experiments. A selection of what they showed:

50 of 50
Updates classified correctly with source dates (23 of 50 without)
Internal test · Feb 2026 · Claim 6
56% → 88%
Trusted-context accuracy, without and with the fact-check
50 test facts · Feb 2026 · Claim 1
8 of 10
Planted contradictions caught by the full system (plain store: 0)
Feb 2026 · Claim 7
4 of 5
Multi-fact contradictions found by the cluster check and review cycles (pairwise: 0)
Feb 2026 · Claim 4
7.5 s
To upload a 132.5 KB encrypted, signed snapshot, restored identical
Feb 2026 · Claim 8
22
Experiments cited in the filing
Provisional application · Feb 26, 2026

The harness and spend ledger are available on request. Methods and later results are in our research record.

From experiment to filing, and after

The filing was written from the February experiments. Each later milestone carries its own date.

February 2026Experiments

The experiments behind the filing

The fact-check test (Feb 17), the FEVER fact-checking runs (Feb 19–22), the temporal test and the consolidation sweep on real meeting data (Feb 25).

February 26, 2026Patent pending

Provisional application filed

Nine independent and fifteen dependent claims. Inventor: Alexander Snyder.

April 2026Experiment

Contradiction checks without false alarms

Zero false alarms on a 150-pair test, catching 68 of 100 real contradictions (internal test).

August 2026Benchmark

A fraction of the cost to ask

On the STALE benchmark, Edwin answered from about 0.3% of the tokens of pasting the whole history in, at the same overall accuracy (n=180, self-run). The August 2026 run.

October 2026Benchmark

Labels that make the AI more accurate

Checking facts and showing the AI each memory's label, such as Survived challenge or Disputed, raised accuracy 5.8 points on the STALE benchmark (pre-registered). The October 2026 run.

February 26, 2027Next

Non-provisional application due

The provisional's twelve-month window closes.

Memory you can check, patent pending.

Edwin is in private development. Email us and we'll tell you when it opens.

Provisional application filed 2026-02-26 · United States · Inventor: Alexander Snyder