The Composition
Engine.
Composition requires Decomposition. Five deterministic phases from bytes to a cryptographically-sealed, navigable Holograph. Every step reversible. Every output content-addressed.
Five deterministic phases.
From bytes to sealed Holograph. Every step reversible. Every output content-addressed.
Composition Pipeline
Five phases of transformation from raw input to sealed holograph
Phase 1: Parse
>20 MiB/sTokenize and syntactic analysis
Phase 2: Decompose
O(n log n)Hierarchical structure extraction
Phase 3: Frame Build
K-way mergeComposition layer assembly
Phase 4: Holograph Build
342K pts/secPoint tree + declaration forest
Phase 5: Ground Seal
blake3Cryptographic commitment
Parse
Tokenize and syntactic analysis
Decompose
Hierarchical structure extraction
Frame Build
Composition layer assembly
Holograph Build
Point tree + declaration forest
Ground Seal
Cryptographic commitment
Bytes → Traces. Linear DFS walk. Bandwidth-limited. Each .kant file yields sorted traces.
Traces → Decomposed. Sort-dominated. Per-layer depth tracking. Immutable sequences ready for merge.
Binary heap k-way merge across all layers. Boundary unification. Declarations Forest created.
BpTree + succinct indices. ~2.92 µs/pt. Navigation primitives: 16–75ns lookup.
blake3(WHERE + WHAT + WHO). Cryptographic proof. Immutable provenance chain.
Location × Content.
Two Orthogonal Axes
The composition occurs at the intersection of points and declarations
Points Tree
X-Axis
Location-based organization of composed points through k-way merge.
Declarations Forest
Y-Axis
Content-driven shape determinism across declaration layers.
The Holograph emerges at the intersection of both axes, creating a deterministic, sealed composition
X-Axis: The Points Tree
Location
A hierarchy of named points. Every point has identity (its key) and position (its path).
Built via k-way merge: imagine k decks of pre-sorted cards. Flip top cards, pick minimum, emit, advance. When the same card appears in multiple decks, advance all. Record which layers contributed.
O(n) with k-heads bound. Linear scaling regardless of source count.
Answers: Does Layer L have a trace at Point P?
Y-Axis: The Declarations Forest
Content
What each point contains. The vertical stack of contributing layers.
Shape determinism: tree structure is fully determined at compile time. No runtime allocation for structural decisions.
Resolution is encapsulated. Each declaration knows its own shape. The engine replays, never interprets.
Answers: Which layers contributed to this field value?
X tells you WHERE. Y tells you WHAT. Together they produce the Holograph — a fully resolved, navigable, cryptographically sealed composition.
A key is not just a label.
Naming convention IS the type system. Format determines identity. Type determines structure. Structure creates a Point. The declaration tree is fully determined at compile time.
Boundaries and Cascading Composition
Boundaries establish scope. Everything inside a Boundary inherits its context.
Cascading search: nearest Boundary → up tree → Root Boundary → first match wins.
Points are seekers. Empty points actively look up the tree for providers (Space, Meaning, Value).
When a match is found, the entire subtree is injected. Resolution is always subtree injection.
Stack. Merge. Emit.
Frame Stacking
Multiple .kant files compose via k-way merge into layered Frames.
Base Schema → Project Baseline → Environment Overlay → Final Context
Last-wins semantics. Every layer's contribution tracked via bitmask.
K-Way Merge
The card game: k pre-sorted decks → binary heap → pick minimum → emit → advance matching.
O(n) total work
Streaming Emission
Zero-allocation pipeline. Walk shape → merge on-fly → emit immediately.
No heap bottleneck
BpTree (Balanced Parenthesis) encodes full hierarchy. Navigation without pointer chasing.
Succinct Data Structures
Balanced Parenthesis encoding. Full tree topology in 2n bits. Parent, child, sibling in O(1).
Versioned vectors tracking layer contributions. Bit-level granularity for merge provenance.
Constant-time navigation over compressed structure. 16–75ns for any structural query.
The artifact is the proof.
The Principal Chain
Identity is composite, not singular.
Each layer adds context. A tool call carries all four.
Ground = blake3(WHERE + WHAT + WHO)
The Black Box Audit
Every operation is audit-logged in an encrypted, append-only ledger.
ChaCha20-Poly1305 encryption. Hash-linked entries. Tamper-evident.
You can prove what happened without revealing operational details.
No external audit service. The proof travels with the data.
Signals, Not Booleans
No booleans in Kantext. Signals are normalized floats in [-1.0, 1.0].
Named Markers give semantic meaning to positions on the gradient.
Information-preserving: a signal of 0.7 carries more context than true.
Moving from information-destroying binary constraints to fuzzy, contextual logic.
Every number is from Criterion.rs.
Pure Rust Core
Zero unsafe in the composition engine. No GC pauses. Predictable latency. Compiles to native, WASM, and soon Python (via PyO3).
Embarrassingly parallel after X-axis merge with rayon::par_iter() — zero locks.
Busbar Integration
Kantext is the composition engine at the heart of Busbar, the declarative systems platform.
Busbar adds execution planes, WASM module hosting, and the MCP Gateway — all grounded in Kantext compositions.
Linear scaling. No cliff. Target: 1M points/sec, sub-100ms latency.
Compose in your browser.
Try the Holograph playground. Build deterministic compositions. Seal them cryptographically.