Features built to
explain every byte.

Explore the six core engineering breakthroughs behind KOLMOS — from autonomous explanation ladders and cryptographic WASM covenants to multi-wire drop-in database compatibility.

Standard Protocols & Direct Connectors

PostgreSQL
MySQL
MongoDB
Cloudflare R2
Apache DataFusion
Apache Arrow
1.66× – 2.12×
Smaller than Parquet-zstd
Measured on real benchmarks
194K – 329K
Rows ingested per second
lineitem / taxi / events
3 Rungs
Explanation ladder depth
Literal → Formula → Prototype
blake3
Cryptographic chunk hash
Zero silent data corruption
Deep Technical Dive

Six core pillars of
intelligent storage.

Click any capability below to explore how KOLMOS rethinks compression, query processing, sandboxed covenants, and cloud data architecture.

Core BreakthroughMODULE 01

Explanation Ladder

Instead of storing raw byte blocks and hoping compression handles it, KOLMOS asks: 'what is the smallest program that regenerates this data, byte-for-byte?' Three rungs compete on an MDL cost formula; the engine continuously chooses the cheapest explanation.

Architectural Guarantees
Rung 0 (Literal): zstd + trained dictionary baseline — predictable write latency
Rung 1 (Formula): Auto-discovers affine, sequence, template, and date derivations
Rung 2 (Prototype): Bounded k-medoids clustering + per-member delta encoding
Background workers (re_explain / re_cluster) continuously optimize cold segments
MDL Cost Model: bytes(program) + bytes(residual) + compute + risk
Saves 1.66× to 2.12× physical storage over optimized Parquet-zstd
kolmos explain-report --json
$ kolmos --root ./store explain-report --json
{
  "table": "telemetry_events",
  "total_segments": 12,
  "rung_distribution": {
    "rung0_literal": 3,
    "rung1_formula": 6,   // e.g. adjusted_price = base_price * 1.18 + 5.0
    "rung2_prototype": 3  // k-medoids cluster prototypes + member deltas
  },
  "raw_size_bytes": 104857600,
  "stored_size_bytes": 18907660,
  "compression_vs_parquet": "2.119x smaller"
}
Autonomous Optimization

Three explanation rungs.
The cheapest program wins.

Every segment begins on Rung 0 for instantaneous write availability. Background workers continuously evaluate Rung 1 and Rung 2 alternatives, executing zero-downtime atomic swaps whenever a cheaper representation is discovered.

Minimum Description Length (MDL) Cost Model
cost = bytes(program) + bytes(residual) + λ·compute + μ·risk
00
Baseline Baseline

Rung 0 — Literal

zstd compression paired with per-corpus dictionary training. Every segment lands here first on ingest to ensure instant, predictable write latency.

Compression Benchmark
1.66× vs Parquet-zstd
0ms latency penalty
01
re_explain worker

Rung 1 — Formula

Autonomous formula mining detects linear combinations, sequences, string templates, and date offsets. Replaces gigabytes of numbers with a concise AST and small exception delta.

Compression Benchmark
+13% to 22% additional savings
~204ms per segment
02
re_cluster worker

Rung 2 — Prototype

Bounded k-medoids clustering discovers representative prototypes across segments. Stores members as prototype references plus field-level delta exceptions.

Compression Benchmark
Up to 35% cluster reduction
~521ms per segment
Real Benchmark Datasets — 200,000 Rows Per Segment
TPC-H lineitem (500K rows)
1.656× smaller
7.67 MB KSF1 vs 12.7 MB Parquet-zstd
NYC taxi trip (200K rows)
1.892× smaller
re_explain saved additional 13%
Clickstream events (500K rows)
2.119× smaller
re_cluster saved additional 22%
End-to-End Pipeline

Three phases.
Zero compromise.

KOLMOS unifies ingestion, autonomous background optimization, and standard DataFusion SQL querying into an append-only, crash-safe data pipeline.

01Write & Ingest Path

Fast Append & Batched Ingestion

Data enters through batch connectors (PG/MySQL/Mongo/Parquet) or row-level DML into the local WAL write-buffer; batches accumulate to ~200K rows for explanation.

Fast Append Ingest
$ kolmos ingest sample.parquet --table orders
 
Validation … Schema fingerprint verified (blake3)
Segmenter … Partitioned into 200,000-row chunks
Rung 0 … zstd + trained dictionary encoded
CAS Commit … FastCDC chunked & deduped to store
Truth Log … Atomic HEAD swap verified
 
✓ 500,000 rows · 12.7 MB Parquet → 7.67 MB KSF1 (1.66x reduction)
02Autonomous Optimization

Background Explanation Ladder

Dedicated background workers (running strictly on a dedicated ComputePool, never on Tokio workers) evaluate cold segments against the MDL cost model. If Rung 1 or 2 wins, it executes a zero-downtime swap.

Continuous Compression
[re_explain] analyzing segment: orders/seg_04a9f
 
Formula Candidate 1: price = quantity * unit_price
Exceptions: 0 rows (100% exact match)
Cost Model: bytes(program)=48B + bytes(residual)=0B
Decision: WINNER — Rung 1 replaces Rung 0
 
[catalog] SwapSegment commit executed atomically
✓ Segment footprint reduced by an additional 22.4%
03Read & Query Path

DataFusion SQL & WASM Decode

SQL queries hit Apache DataFusion. Header min/max statistics prune non-matching segments before fetch. Matching segments decode through the sandboxed WASM covenant into Arrow memory buffers.

ANSI SQL Execution
SELECT region, SUM(total_amount)
FROM orders
WHERE created_at >= '2024-01-01'
GROUP BY region;
 
Optimizer: 8 of 12 segments pruned via header min/max stats
Execution: 4 segments decoded via wasmtime covenant sandbox
Format : Zero-copy Arrow batches streamed into aggregations
 
✓ 1,420 rows returned · MVCC snapshot-pinned read
Drop-in Replacement

Connect existing apps with
zero code changes.

KOLMOS speaks the native wire protocols of the databases you already run. Your ORMs, analytics dashboards, and application drivers connect transparently.

🐘Native Wire

PostgreSQL Wire Protocol

Live (Read) / Phase B (DML)

Connect seamlessly with psql, pgAdmin, Prisma, SQLAlchemy, Metabase, Grafana, and any PostgreSQL client driver. Speaks pgwire natively with full ANSI SQL support.

Verified Tools & Drivers
psql CLIPrisma ORMTypeORMMetabaseGrafanaTablePlusDBeaver
🐬Native Wire

MySQL Wire Protocol

Coming · Phase C

Minimal high-performance server supporting handshake, auth, and COM_QUERY routing into DataFusion and WAL DML. Direct drop-in for PHP/Laravel, WordPress, and Node mysql2.

Verified Tools & Drivers
mysql2Laravel EloquentWordPressSequelizePHP PDOPyMySQL
🍃Native Wire

MongoDB Wire Protocol

Coming · Phase C

Wire protocol supporting OP_MSG, SCRAM authentication, find, insert, update, and delete commands. Reuses native BSON mappings for zero-overhead document workflows.

Verified Tools & Drivers
MongoosePyMongoMongoDB CompassMotorNative BSON Drivers
Rigorous Evaluation

How KOLMOS stacks up.

An honest architectural comparison across storage efficiency, self-documenting data, cryptographic covenants, and query execution characteristics.

Architectural DimensionKOLMOS EngineApache ParquetPostgreSQLClickHouseSnowflake
Storage Footprint vs Parquet-zstd1.66× – 2.12× smaller1.0× (Baseline)3.5× – 6.0× larger~1.2× smaller~1.15× smaller
Self-Documenting Explanation EngineBuilt-in (Formulas & Prototypes)NoneNoneNoneNone
Cryptographic Decode CovenantWASM bytecode hash-pinnedFormat spec dependentEngine binary dependentEngine binary dependentProprietary cloud locked
Cloudflare R2 & Object Storage NativeCAS chunks + Conditional PUTFilesystem abstractionBlock storage (EBS) onlyS3 disks supportManaged S3/GCS
Wire Protocol Drop-in SupportPostgreSQL, MySQL, MongoDBFile format onlyPG onlyHTTP + Native TCPJDBC / ODBC / REST
Live Database Incremental IngestPG + MySQL + MongoDB built-inRequires external ETL (Spark)Source databaseKafka / S3 enginesFivetran / Snowpipe ($$)
Full Scan Speed (Honest Evaluation)1.6× – 8× slower than ParquetFastest analytical baselineSlow on large scansUltra-fast vectorizedFast cloud warehouse

* Note: KOLMOS is designed for massive storage reduction and self-documenting data; analytical full scans are 1.6×–8× slower than uncompressed Parquet scans.

Ready to store the
explanation of your data?

Start experiencing 1.66×–2.12× storage reduction with bit-exact recovery on your PostgreSQL, MySQL, or MongoDB workloads today.