Skip to main content
This page is the engine crate map, not the getting-started path. You run one nika binary; it already contains the CLI, the Session, nika serve, nika mcp, nika lsp and nika dap. The TypeScript SDK is not a crate: it is the npm package @supernovae-st/nika, in its own repository. At v the engine is a Rust workspace of crates across the layers L0, L0.5, L1, L1.5, L2, L3 and L4. are admitted past the twelve admission gates; are pre-admission (). Pre-admission crates are in the released binary, the Session, the terminal workspace and nika serve among them, while they work toward the gates. The workspace cap is crates (ADR-037). In the 0.124 line, work stays focused on maintenance, security and the media capabilities workflows need, with no new crate planned.
Layer model and enforcement: Layers. Admission process: Admission. The source of truth is the [workspace.metadata.diamond] table of the engine’s Cargo.toml at v0.123.0.

The map

Green: admitted (twelve gates green). Amber: pre-admission, shipping in the binary. Each arrow is a real dependency at v0.123.0, a few of many: every workspace dependency points down a layer or stays within one, and check-layering.sh fails the build on an upward one.

Layer by layer

There is no L5 crate: the public executable is built from nika-cli (ADR-135).

Memory and retrieval

Two memory crates are in the 0.123.0 workspace: nika-bm25 (lexical scoring, admitted) and nika-store (signed writes and verified recall, pre-admission). The other retrieval crates of the original design (vector index, rank fusion, reranking, spaced repetition, reasoning) are names, not planned work: there is no orchestrator crate and no whole-subsystem gate.

Admission history

The original plan (decision Q5) admitted the L0 foundation first, then one verb per round (infer, exec, invoke, agent), then the effects and the runtime, then the interfaces. Part of it was never built: there is no nika-binding or nika-transform crate, because templates live in nika-tmpl, expressions in nika-cel and transformation is jq (L0 decisions).
The admission rounds are the historical order of the Diamond rewrite. Each admission was one atomic commit; no admission round is planned in the 0.124 line.

See also

Live state

The version, the engine commit and the catalog, read from the binary.

Layer registry

The layers, the mechanical sort test and the enforcement scripts.

Twelve-gate admission

How a crate earns its seat in the workspace.

L0 foundation decisions

The early decisions and what became of them.