v1.5.0  ·  Open Source  ·  Node.js

The database
that proves itself.

Content-addressable storage with cryptographic Merkle proofs and Write-Ahead Log durability. Built from scratch in Node.js.

Try the demo View source
Scroll
MERKLE TREE PROOFS
WRITE-AHEAD LOG
SHA-256 HASHING
GIT-STYLE COMMITS
CONTENT-ADDRESSABLE
OPTIMISTIC CONCURRENCY
CRYPTOGRAPHIC INTEGRITY
WAL CRASH RECOVERY
ZERO NATIVE DEPS
BRANCHING SUPPORT
MERKLE TREE PROOFS
WRITE-AHEAD LOG
SHA-256 HASHING
GIT-STYLE COMMITS
CONTENT-ADDRESSABLE
OPTIMISTIC CONCURRENCY
CRYPTOGRAPHIC INTEGRITY
WAL CRASH RECOVERY
ZERO NATIVE DEPS
BRANCHING SUPPORT
Step 01

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.

Step 02

Every fingerprint
is committed.

A commit hashes all stored documents into a Merkle tree. The root hash is a single fingerprint of the entire database state at that moment.

Step 03

Every commitment
can be verified.

Generate a Merkle inclusion proof for any document. Anyone with the root hash can verify the proof independently. No access to the database required.

Interactive Demo

Real server.
Real proofs.

Insert a document, commit a Merkle snapshot, then generate a cryptographic inclusion proof against the live API.

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

Every layer
hand-built.

⚡
Content-Addressable Storage
Documents live at their SHA-256 hash address. Identical content deduplicates automatically. Storage is immutable by design.
SHA-256
Content hash
🌳
Merkle Tree Proofs
Every commit builds a complete Merkle tree. Any document produces a cryptographic inclusion proof, independently verifiable by anyone.
O(log n)
Proof generation
📋
Write-Ahead Log
Every mutation is appended to the WAL before being applied. On crash recovery the log replays to restore consistent state, zero data loss.
O(1)
Durability cost
🔗
Commit DAG
Commits form a directed acyclic graph. Each stores a parent hash, Merkle root, and message. Full branching support with attached and detached HEAD.
🔒
Optimistic Concurrency
Concurrent writes are detected via version vectors. Conflicting updates raise a typed ConcurrencyError. No silent data loss, ever.
✅
175 Integration Tests
Crash recovery, OCC conflicts, proof verification, branch edge cases. Every code path covered with real disk, real hashes, real assertions.
0
Tests passing
0
Tests passing
0
Native deps
48h
Auto-wipe cycle
30/m
Rate limit / IP