Insert
niles.set('user:42', {
  name: 'Alice',
  role: 'admin'
})
→ a3f8c2d1 staged ✓
Verify time
7
microseconds
proof verification
Throughput
13.8k
inserts / sec
Latest commit
a3f8c2d1·8b3d7e2f
c5a1f9e4·3b7d2a91...
Commit #12 1,024 docs
WAL entry #4,892
SET user:42
→ 0xa3f8c2d1b7e9...
fsynced
Proof result
Cryptographically verified
3 Merkle steps 0.007ms
NilesKV

The database that proves itself. Content-addressable, cryptographically sealed, built from scratch.

Try the demo → How it works
scroll
SHA-256 hashingMerkle tree proofsWrite-Ahead LogGit-style commitsContent-addressableOptimistic concurrencyWAL crash recoveryZero native depsBranching supportCryptographic integrity SHA-256 hashingMerkle tree proofsWrite-Ahead LogGit-style commitsContent-addressableOptimistic concurrencyWAL crash recoveryZero native depsBranching supportCryptographic integrity
01  /  Insert

Every document
gets a fingerprint.

Insert any JSON object. NilesKV computes its SHA-256 hash and stores it at the content address. The same document always produces the same address — identical data deduplicates automatically.

02  /  Commit

Every fingerprint
is committed.

A commit folds all stored documents into a binary Merkle tree. The root hash is a single cryptographic fingerprint of the entire database state — computed in 202ms across 1,000 documents.

03  /  Prove

Every commitment
can be verified.

Generate a Merkle inclusion proof for any document. Anyone holding the root hash can verify the proof in 7 microseconds — no database access, no trust required.

Interactive demo

Live API.
Real proofs.

Insert a document, commit a Merkle snapshot, then generate a cryptographic inclusion proof against the running server.

01
Insert Document
POST /insert
02
Commit Snapshot
POST /commit
03
Generate Proof
GET /proof/:id
nileskv response
// awaiting request
Architecture

Every layer
hand-built.

No database engine. No ORM. The Merkle tree, WAL, and commit DAG are each implemented from scratch in Node.js.

01
Content-Addressable Storage
Documents are stored at their SHA-256 content hash. Identical content deduplicates automatically. Storage is immutable by design, enabling full auditability without special access controls.
SHA-256Hash function
02
Merkle Tree Proofs
Every commit builds a binary Merkle tree over all stored documents. Any document produces a cryptographic inclusion proof verifiable by any third party with only the root hash.
O(log n)Proof size
03
Write-Ahead Log
Every mutation is durably appended to the WAL before being applied in memory. On crash recovery the log replays atomically to restore consistent state.
O(1)Durability cost
04
Commit DAG
Commits form a directed acyclic graph. Each node stores a parent hash, Merkle root, timestamp, and message. Full branching support mirrors Git internals.
DAGStructure
05
Optimistic Concurrency Control
Concurrent writes are detected via per-document version vectors. Conflicting updates raise a typed ConcurrencyError rather than silently overwriting. No locks during reads.
OCCConflict model
0
Tests passing
0
Native dependencies
48h
Auto-wipe cycle
30/m
Rate limit per IP