AI memory . proof

Can AI memory be faked or backdated?

Yes, easily. Any text-based memory, whether an AI wrote it or you did, can be edited after the fact with nothing to show it happened, including a person quietly rewriting their own history to look more consistent than they actually were. A record only avoids this if the storage itself makes rewriting the past physically impossible, not just against policy.

The problem underneath the question

Ask an AI what it remembers about you, and it answers from whatever text is currently stored, in whatever order it was written. Nothing about that answer proves when each piece was actually entered. A note "written" in January that was really added last week, with the date typed in by hand, looks identical to a note genuinely written in January. Ordinary storage, the kind almost every app uses, has no memory of its own history, only of its current contents.

This matters more than it sounds. A record that claims to show how someone has changed over months is only meaningful if the entries genuinely predate the claim. Otherwise it is just today's story, dressed in old dates.

What a real answer requires

Append-only

New entries can be added. Existing ones cannot be changed or deleted, enforced at the database level, not by a promise.

Dated on write

Every entry is stamped the day it is written, not the day someone later claims it was written.

Independently provable

A structure a third party can check without trusting the company that runs it.

How a transparency log actually proves it

The mechanism that makes the third requirement real is called a transparency log, defined in the IETF standard RFC 6962, originally built to keep website security certificates honest and used here for the same reason: it produces two kinds of mathematical proof. An inclusion proof shows a specific entry is genuinely part of the record. A consistency proof shows the record today is a true continuation of the record from an earlier point, not a quietly edited replacement with the same entry count.

On top of that, the log periodically publishes signed checkpoints, using ES256 signatures, that anyone can verify offline, without asking the company running the log to vouch for itself. If a record were ever silently rewritten, the checkpoints from before and after would not match, and that mismatch is exactly what the proof is built to catch.

The database also physically blocks the operations that would let history be rewritten: UPDATE and DELETE are not permitted on the record at all. Not discouraged. Not logged and reviewed later. Blocked.

Why this matters specifically for AI memory

An AI repeating something back to you fluently does not prove when it became true. It only proves the text exists right now. The only way to know whether a record of a person is genuinely dated, rather than written today and backdated to look older, is to inspect the structure the record is built on, not the content it displays. This is what "non-backfillable" means in practice: not a promise, a property of the storage that can be checked.

This is the property patent application US 64/048,624, filed and pending, is built around: a record of a person that cannot be quietly rewritten to look more continuous, more consistent, or older than it actually is.

Common questions

What does append-only actually mean?
New entries can be added. Existing entries cannot be changed or deleted. This is enforced at the database itself, blocking the UPDATE and DELETE operations outright, so it does not depend on a person or a policy being followed correctly.
What is a transparency log?
A structure defined in the IETF standard RFC 6962 that produces mathematical proof a record was not silently altered: inclusion proofs that a specific entry is really in the log, and consistency proofs that today's log is a true continuation of an earlier one, not a quietly edited replacement. Checkpoints are signed and can be verified offline by anyone, without trusting the company running the log.
Does this stop someone from lying in the first place?
No, and it does not claim to. It stops a written entry from being silently rewritten after the fact to look more consistent than it actually was. What was written stays exactly as written, dated to the day it was written. Whether it was true when written is a separate question this cannot answer.

LUX runs on exactly this kind of record: append-only, dated on write, backed by a public transparency log you can check yourself, not our word for it. See the patent, or watch a record hand off to a new AI in one paste.