Overview - What is Kimberlite?
On this page
- Elevator Pitch
- One Principle
- Why Does This Matter?
- How We Guarantee Correctness
- Who Is This For?
- Industries
- Use Cases
- Core Features
- 1. Immutability
- 2. Audit Trail by Default
- 3. Time-Travel Queries
- 4. Multi-Tenancy First
- 5. Cryptographic Guarantees
- 6. Consensus (VSR)
- What Kimberlite Is Not
- Architecture in 30 Seconds
- Key Concepts
- Current Status (v1.0.0)
- Getting Started
- Next Steps
Kimberlite is a compliance-first database for regulated industries.
Elevator Pitch
For: Developers building healthcare, finance, or legal applications Who need: Immutable audit trails and provable correctness Kimberlite is: A database built on append-only logs That: Makes compliance natural rather than bolted-on Unlike: Traditional databases that treat auditing as an afterthought Kimberlite: Makes illegal states impossible to represent
One Principle
Everything in Kimberlite derives from a single architectural principle:
All data is an immutable, ordered log.
All state is a derived view.
Or more precisely:
State = Apply(InitialState, Log)
This isn’t a novel idea. Event sourcing, CQRS, and log-based systems have existed for decades. What’s novel is making this the only way to use the database, optimizing every layer for this model, and targeting compliance-critical workloads.
Why Does This Matter?
Traditional databases:
- Update data in place
- Add audit tables later
- Hope nobody tampers with audit logs
- Pray during regulatory audits
Kimberlite:
- Append events to an immutable log
- Derive state from events
- Cryptographically chain events (tamper-evident)
- Reconstruct any point-in-time state
Result: Compliance is a natural consequence of the architecture, not something you bolt on.
How We Guarantee Correctness
Kimberlite achieves compliance through formal verification—mathematical proofs that guarantee correctness:
6 verification layers:
- Protocol (30 theorems): TLA+, Ivy, Alloy proofs for consensus safety, view changes, recovery
- Cryptography (15 theorems): Coq proofs for SHA-256, BLAKE3, AES-GCM, Ed25519, key hierarchy
- Code (91 proofs): Kani bounded model checking for offset monotonicity, isolation, hash chains
- Types (80+ signatures): Flux refinement types for compile-time safety (ready when Flux stabilizes)
- Compliance (23 frameworks): HIPAA, GDPR, SOC 2, PCI DSS, ISO 27001, FedRAMP and 17 more formally modeled
- Traceability (100%): Every theorem mapped from TLA+ → Rust → VOPR tests
Why this matters: Traditional databases rely on testing, which can’t prove absence of bugs. Kimberlite uses mathematical proofs to guarantee correctness—the same techniques used for space missions and medical devices.
→ Deep dive into formal verification
Who Is This For?
Industries
- Healthcare: Electronic Health Records (EHR), patient portals, clinical trials
- Finance: Transaction ledgers, trade audit trails, regulatory reporting
- Legal: Document management, case history, evidence chain-of-custody
- Government: Public records, regulatory compliance, transparency
Use Cases
Good fit:
- Audit-critical applications
- Systems requiring point-in-time reconstruction
- Multi-tenant SaaS with isolation requirements
- Applications where “what happened and when” matters more than “what’s the current state”
Poor fit:
- High-throughput analytics (use a data warehouse)
- General-purpose CRUD apps (use Postgres)
- Message queuing (use Kafka or RabbitMQ)
- Real-time leaderboards (use Redis)
Core Features
1. Immutability
All data is append-only. Nothing is ever deleted or modified. “Deletion” is a new event that marks data as deleted—the original event remains in the log.
// There is no db.delete() - only append new events
db.append?;
2. Audit Trail by Default
Every write is logged with:
- What changed (command)
- When it changed (timestamp)
- Who changed it (client ID)
- Why it changed (optional reason)
- What happened before (previous state hash)
3. Time-Travel Queries
Query data as it existed at any point in time:
-- What did we know about patient 123 on January 15th?
SELECT * FROM patients AS OF TIMESTAMP '2024-01-15 10:30:00'
WHERE id = 123;
-- What did the database look like 1000 operations ago?
SELECT * FROM patients AS OF POSITION 1000 WHERE region = 'us-east';
4. Multi-Tenancy First
Each tenant’s data is:
- Physically isolated (separate log partitions)
- Separately encrypted (per-tenant keys)
- Regionally constrained (data sovereignty)
- Independently quotaed (storage and throughput limits)
5. Cryptographic Guarantees
- Hash chains: Every event links to the previous event’s hash
- Tamper evidence: Modifying any event breaks all subsequent hashes
- Dual-hash system: SHA-256 for compliance (FIPS-approved), BLAKE3 for performance
6. Consensus (VSR)
Multi-node clusters use Viewstamped Replication (VSR) for fault tolerance:
- f+1 tolerates f failures (3 nodes = 1 failure, 5 nodes = 2 failures)
- Proven protocol: Same as TigerBeetle’s battle-tested consensus
- Deterministic: All replicas process operations in identical order
What Kimberlite Is Not
Kimberlite is intentionally limited in scope:
- Not Postgres: No Postgres wire protocol, no full SQL support
- Not an analytics engine: Use a data warehouse for OLAP workloads
- Not a message queue: Use Kafka if you need pub/sub
- Not a cache: Use Redis for hot-path performance
These limitations exist to maintain simplicity, auditability, and correctness.
Architecture in 30 Seconds
┌──────────────────────────────────────────────────┐
│ Client (SDK) │
├──────────────────────────────────────────────────┤
│ Server (RPC protocol) │
├──────────────────────────────────────────────────┤
│ Consensus (VSR) │
├──────────────────────────────────────────────────┤
│ Kernel (pure state machine: Cmd → State + FX) │
├──────────────────────────────────────────────────┤
│ Append-Only Log (hash-chained, CRC32) │
├──────────────────────────────────────────────────┤
│ Crypto (SHA-256, BLAKE3, AES-256-GCM, Ed25519) │
└──────────────────────────────────────────────────┘
Data flow:
- Client sends command
- Consensus replicates to quorum
- Log durably stores command
- Kernel applies command (pure function)
- Projections materialize state for queries
- Client receives acknowledgment
See Architecture for details.
Key Concepts
- Data Model - Append-only logs and derived projections
- Consensus - How VSR provides fault tolerance
- Compliance - Immutability, audit trails, tamper evidence
- Multi-tenancy - Tenant isolation and data sovereignty
- Pressurecraft - Our coding philosophy
Current Status (v1.0.0)
Kimberlite is production-ready:
Core Infrastructure:
- Append-only storage with CRC32 checksums and torn write protection
- Viewstamped Replication (VSR) consensus
- Cryptographic hash chains (SHA-256, BLAKE3)
- VOPR deterministic simulation testing (46 scenarios, 19 invariants)
Compliance & Security:
- 23 compliance frameworks (HIPAA, GDPR, SOX, PCI-DSS, and 19 more)
- RBAC and ABAC access control
- Field-level data masking
- Automatic audit trails
- Consent management
- Breach notification tracking
Developer Experience:
- Full SQL support (DDL, DML, queries)
- Client SDKs (Python, TypeScript, Rust, Go)
- Interactive REPL
- Migration system
- Multi-tenant isolation
Getting Started
- Start - Get running in 2 minutes
- Python Client - Build with Python
- TypeScript Client - Build with Node.js
- Rust Client - Build with Rust
- Go Client - Build with Go
Next Steps
- Understand the concepts: Read Data Model, Consensus, and Compliance
- Build something: Follow Coding Guides
- Deploy: See Operating Guides
- Dive deep: Explore Internals
TL;DR: Kimberlite is a database where compliance isn’t a feature—it’s the foundation. All data is an immutable log, all state is derived, and correctness is provable.