APPEND-ONLY LOGS
Append-only
event logs
A log that can be edited in place can be rewritten silently. An append-only log grows in one direction: new events are added, earlier events stay. The past remains available because nothing in the log erases it.
THE PROBLEM
Mutable history rewrites the past
When a record can be edited in place, an audit trail becomes a story that can be revised. A reviewer cannot tell, from the record alone, whether what they read is what was recorded or what someone later preferred.
Evidence needs a history that accumulates instead of mutating. That is what an append-only log provides.
HOW THE LOG WORKS
A sequence that only grows
PHIROK's append-only core is a write-ahead log (WAL): new evidence is appended as events, and earlier records stay available as later events are added. New events extend the history instead of rewriting the past.
The history is hash-linked: each record references the previous hash, so the sequence itself carries tamper evidence. A reviewer can follow the recorded lineage from any event to what came before it.
CORRECTIONS
A correction is a new record
In an append-only log, a correction does not erase the original. Corrections belong in new records with traceable relationships to what came before.
The original stays readable, the correction stays linked to it, and a reviewer sees both: what was first recorded, and what superseded it. Nothing is silently replaced.
WHAT THE LOG GIVES PHIROK
Retained events, reconstructable state
Because events are retained, earlier states remain available for inspection, and retained events support reconstruction of recorded state — the basis of deterministic replay.
Tenant scope is part of the record: evidence stays inside the workspace it belongs to, and the log is read through the same authenticated boundaries as everything else.
LIMITS
What append-only does not promise
Append-only is not absolute preservation. Storage can still fail, and a log is only as durable as the system that keeps it: hardware failures, invalid input and scheduling bugs are not eliminated, and backups and recovery procedures are still needed.
It is not resistance to any manipulation. A hash-linked chain detects changes against a trusted reference held elsewhere; it does not make rewriting impossible for someone who controls the whole log and its references.
And it is not truth: a faithfully appended record can still contain wrong content. The log preserves what was recorded, including mistakes — which is exactly why corrections arrive as new, linked records.
RELATED GUIDES
Continue with another guide
YOUR NEXT DECISION
Build with memory.
Stand behind the evidence.
Give consequential AI a history you can inspect.
