“We deleted it” leaves a lot unanswered.
Can the record still be read? What later results depend on it? Has its encryption key been destroyed? What about the backup or the copy another system received?
A useful deletion system has to distinguish these questions. So does the evidence it produces.
The problem a structural certificate addresses
8DB's braid work includes a scoped operation for removing an isolated crossing from an encoded mathematical state. It returns the new state and a structured record of the removal. A separate signed erasure statement can identify the subject and the before and after fingerprints without carrying the original content.
The important word is isolated. The documented mechanism admits particular cases where later history does not depend on the crossing within the application's declared representation. Where that dependency exists, the simple excision path refuses. A tombstone or retained dependency must be described as such.
Checking a signed statement requires both signature verification and statement-binding verification. Those checks authenticate the recorded assertion. Validating the actual state change requires the corresponding transition evidence. The standalone algebraic certificate does not independently reconstruct the original history and prove its before/after relationship.
That makes the structure useful before deletion, too. It helps identify which information has become a premise for later records and which removal would affect those records.
A concrete application: agent memory
Suppose an agent stores a source note and later derives a conclusion from it. A request arrives to remove the source note.
There are now two connected records to consider. Hiding the note while leaving the conclusion available may leave the sensitive information in use. Deleting the note also does not make the conclusion independently supported.
A dependency-aware application can identify that relationship, reassess the conclusion and select an operation whose guarantee fits the actual state. If the represented contribution qualifies for the isolated structural operation, the removal and its signed statement can describe that change. If it does not, the application has an explicit boundary to resolve.
This is a use-case example, not a claim that a database certificate removes information from a model's trained weights or every external copy.
Several guarantees, several checks
| Guarantee | What needs to be checked |
|---|---|
| Logical deletion | The declared query and access paths no longer return the record. |
| Structural removal | The permitted transformation and remaining structure satisfy the certificate's verification contract. |
| Cryptographic inaccessibility | The required key paths are unavailable under the declared threat model. |
| Physical sanitization | The relevant media and storage locations have been handled under the specified procedure. |
| Distributed completion | The declared replicas, exports and other covered copies have been accounted for. |
A certificate can be strong evidence for its particular contract. It cannot establish facts about unknown copies or storage outside that contract merely because its signature verifies.
What the braid contributes
The braid supplies interaction structure and a defined transformation. Cryptographic commitments and signatures provide their own integrity and authenticity checks. Key management, retention and replica handling supply other parts of the deletion workflow. A complete application deletion workflow needs to connect and qualify these components; the existence of the primitive alone does not establish that integration.
Keeping those components connected makes it possible to ask a more useful question than whether a delete command returned success: what exactly changed, what was checked, and what remains unresolved?
That is the reason this belongs in a discussion of native database modalities. Structure is useful when it changes the operations an application can perform and the evidence it can retain.
Start with the guarantee you need
Bring one record, its known downstream uses and the precise deletion guarantee your reviewer expects. That gives us something concrete to map to the supported operation and the remaining storage or key-management work.
Discuss an erasure workflow with Ashley.
For related context, read When the Order Changes the Answer, provenance as a query, and the encryption guide.
Updated 14 September 2026. The implemented mechanism described here is scoped to admitted isolated-crossing cases. This update makes clear that certificate verification alone does not prove universal physical deletion or completion across unknown copies.
Continue the technical conversation
Where could this help your work?
Bring a research question, a database workload or an application you want to build. Let’s connect the ideas in this article to an evaluation that matters to your team.
Discuss this work