Skip to content
8BraidCreators of
8DB

Engineering note · Native operators · Reviewed implementation scope · Application examples

When the Order Changes the Answer

The same participants and final state can describe very different histories. Native braids give ordered interactions a structure of their own in 8DB.

Published
Updated
Reading time4 minutes
Topological data modelPath-dependent dataBraidQLProvenance orderingNative modalities

An approval granted before an action can authorize it. The same approval granted afterward tells a different story. A list containing both events is not enough to explain what happened.

That is an everyday reason to care about a fairly unusual database structure: a topological braid.

We are building 8DB for applications that need to retain more of the meaning in their data. Sometimes that meaning is a relationship. Sometimes it is geometry or uncertainty. Sometimes it is the way several histories interact.

What the braid keeps

A braid has strands and ordered crossings. In a data model, the application defines what those strands and crossings mean. They might represent interacting signals or participants in a sequence of handoffs.

Some changes in crossing order preserve the same braid under its mathematical rules. Others change it. That gives the application a way to distinguish meaningful differences from the specific reorderings its model treats as equivalent.

The mapping matters. A timestamp does not automatically establish causality, and a braid does not automatically establish that an action was valid. Domain rules still decide what the represented history means.

Three useful applications

Compare interacting signals. 8DB's time-series work computes rank-braid signatures from stored signals. These describe the sequence in which signals cross in relative rank. The signature provides a different view from their individual values or averages, while retaining the connection to the source series.

Inspect custody and approval histories. An application can represent selected handoffs and interactions explicitly, then compare histories under a declared ordering contract. Bring two histories with the same participants and final state, but a difference that should matter. Also bring a reordering that should leave the interpretation unchanged. Together, those make a useful modelling test.

Record a permitted structural removal. Our erasure work uses a narrowly scoped operation on an isolated crossing and produces evidence of that change. Dependencies can prevent a clean removal. This is a separate question from whether a backup or exported copy still exists. Read what the certificate establishes.

The signal path is an implemented example. Custody and approval are application patterns that need their own domain mapping and acceptance tests.

Why put this in the database?

Tables, event logs and graphs can preserve ordered histories when they are modelled appropriately. A native braid representation gives the ordering structure its own types and operators within the same system as the source records.

That reduces the need for every application to invent its own representation, compare opaque payloads and reconstruct the relationship to the original evidence. A signal, a braid signature and an inspection report can remain connected while answering different questions.

This is the larger idea behind 8DB's native modalities. The database can retain structures that an application would otherwise have to manage around it.

What is implemented

The implementation review for this update covers native braid encoding, strand operations, topology matching, projections and storage codecs. Reopen tests exercise specific representations under test authorization. The time-series rank-braid path computes signatures from stored signals.

Durable semantic-identity ingestion remains gated while its encoding profile is corrected. Query coverage is operator-specific. A screening fingerprint is not a collision-free identity, and a derived graph or vector view need not reconstruct the original braid.

Braid algebra also does not, by itself, confer post-quantum security. Data representations, cryptographic protocols and erasure guarantees have distinct contracts. See the encryption guide for the protection mechanisms described on this site.

Bring us a history that matters

The most useful starting point is a pair of histories that end alike but should produce different answers. Add the source events and the rules that determine which reorderings are harmless.

Send Ashley the example. We can use it to define the representation, the operation and the checks that would make the result useful to your team.

Updated 14 September 2026 following an implementation review. This version replaces broader claims about query-language exclusivity and universal braid ingestion with the supported scope.

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

Continue reading

The next layer of the argument.

Engineering note

One Protected Substrate

When the History Becomes Part of the Key

8DB includes a cryptographic channel that brings braid structure into key derivation. It is a concrete example of a native data model doing more than storing information.

3 min readImplemented channel · Source tests reviewed · No independent protocol audit claimedRead article
Research

One Protected Substrate

When the Answer Is More Than Yes or No

A BioTwin research prototype used 8DB's lattice operators to examine eight competing explanations. The useful result was knowing what each possible observation could settle, and what it could not.

4 min readRecorded local software qualification · Authored hypotheses · No biological validationRead article
Engineering note

One Protected Substrate

Replace Six Databases With One Sealed Store: One Migration, One Governance Model, No Seams Left to Breach

The modern data platform is a relational store, a document store, a vector index, a graph database, an object store and a search engine, stitched together by pipelines and secured by six access models. Every seam is a place where governance, provenance and protection quietly disagree, and every audit finding about a leaked record eventually traces to one. Here is the case for one substrate, written for the sceptic, with the acceptance criteria any consolidation claim should have to meet and what 8DB has demonstrated against them.

6 min readTested data shapes · Architecture argument · Performance claims withheldRead article