Skip to content
8BraidCreators of
8DB

Engineering note · Implemented channel · Source tests reviewed · No independent protocol audit claimed

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.

Published
Reading time3 minutes
Topological data modelPost-quantum cryptographyKey derivationNative modalities

A system can record a history and encrypt a message. We have also been exploring a closer connection: using the represented history as part of the context that determines the message key.

8DB includes a braid-conditioned cryptographic channel that does this. It combines a cryptographic shared secret with a normalized braid representation and a protocol epoch, which identifies the current step in the channel's key schedule.

The interesting part is what the braid contributes. It gives the context a structure with defined equivalences, rather than treating every possible serialization of a history as unrelated bytes.

Same meaning, matching context

Imagine two participants following a declared interaction protocol. They hold the shared keying material and have reached the same epoch. Their histories may be expressed differently while representing the same braid under the protocol's rules.

The implementation normalizes that braid structure before using it in key derivation. Equivalent representations at the same epoch can therefore produce matching key context. A meaningful structural difference can produce a mismatch instead.

The code includes tests for equivalence, differing crossing structure, key agreement and authenticated message round trips. This article describes a source review of those controls, not a newly executed test campaign or an independent security audit. The channel is implemented; integration with the live transport's rekey path remains follow-up work.

Where this could be useful

Coordinated workflows. Explore whether participants have reached compatible protocol states before exchanging a protected message. The application must still authenticate the participants and define which interactions count.

Interaction-aware channels. Bind a channel's key context to selected changes in a shared process, so the represented interaction history participates in the cryptographic operation.

Protocol testing. Construct two histories that should be equivalent and another that should differ. Check that the resulting key contexts behave accordingly. That makes the modelling rule observable.

These are application directions for the implemented channel, not claims that complete custody, clearing or authorization systems have been qualified by these tests.

What supplies the cryptographic protection

The implementation uses ML-KEM-1024 for shared-secret establishment. ML-KEM is the key-encapsulation mechanism specified in NIST FIPS 203. Key derivation uses HKDF, and the message path uses AES-GCM-SIV.

The braid supplies structured context. This is not a claim that braid algebra alone supplies cryptographic hardness, that a public history becomes a secret, or that a change in a braid revokes a participant who still holds all required keying material.

The current implementation retains the shared secret, so this description also makes no claim of forward secrecy or recovery after compromise. Those require a separate key lifecycle and protocol argument. Using standardized components does not make their composition a validated cryptographic module.

Why a database company is working on this

Native data structures can become inputs to useful operations across a system. Here, topology is used in a key schedule. In another path, an isolated structural change participates in an erasure-certificate workflow. Those mechanisms have different guarantees, even though both involve braids.

This is one capability within 8DB's broader data architecture, alongside spatial data, tensors, graphs, documents and order lattices. The opportunity is to connect those structures to the questions and controls an application actually needs.

Talk to Ashley about a protocol example. A useful starting point is the interaction history, the equivalences you intend to allow and the behavior that should change when the history differs.

For the wider security architecture and its stated configurations, see the 8DB encryption guide.

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 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.

4 min readNative operators · Reviewed implementation scope · Application examplesRead 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