HackerReposA FIELD GUIDE TO OPEN SOURCE
ProSponsor the shelf♧ 0
← Back to top all-time
hash-anu
snkv
C2026–2026
hash-anu / snkv

snkv

SNKV — a lightweight key-value store focused on simplicity, security and performance file based database , written using sqlite's b-tree directly. Now supports vector HNSW , Join the discussion: https://discord.gg/Wwe9dFy3P

3Distinct people
17Mentions
0Explicit recommenders
80GitHub stars
REPOSITORY AT A GLANCE

What to know before exploring

What it is

SNKV — a lightweight key-value store focused on simplicity, security and performance file based database , written using sqlite's b-tree directly. Now supports vector HNSW , Join the discussion: https://discord.gg/Wwe9dFy3P

GitHub

Where it is used

No documented product use has been verified yet.

What people are saying

No recommendation phrase was found in the indexed comments.

No classified warning is attached to this page. Read the discussions before treating silence as approval.

Also in these discussions

No other repository is repeatedly linked in the same discussions.

This week on Hacker News

Nov 9–Nov 16 UTC · Direct repository links and separately labeled related project stories. Indexed through 11/16/2026, 5:58:53 AM UTC.

No direct repository links were found in the indexed HN discussions over the past seven days. Older discussions are available below.

Mentions over time

HN mentions by week17 dated mentions

Observed mentions: 2026-02-09 11:17:44 UTC to 2026-05-10 08:46:59 UTC. Weeks start Monday, UTC.

012342026-02-09 00:00:00 UTC to 2026-02-16 00:00:00 UTC (exclusive): 3 mentions; 3 submissions, 0 commentsFeb 92026-02-16 00:00:00 UTC to 2026-02-23 00:00:00 UTC (exclusive): 4 mentions; 3 submissions, 1 comments2026-02-23 00:00:00 UTC to 2026-03-02 00:00:00 UTC (exclusive): 4 mentions; 2 submissions, 2 comments2026-03-02 00:00:00 UTC to 2026-03-09 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2026-03-09 00:00:00 UTC to 2026-03-16 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2026-03-16 00:00:00 UTC to 2026-03-23 00:00:00 UTC (exclusive): 1 mentions; 0 submissions, 1 comments2026-03-23 00:00:00 UTC to 2026-03-30 00:00:00 UTC (exclusive): 3 mentions; 0 submissions, 3 commentsMar 232026-03-30 00:00:00 UTC to 2026-04-06 00:00:00 UTC (exclusive): 1 mentions; 1 submissions, 0 comments2026-04-06 00:00:00 UTC to 2026-04-13 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2026-04-13 00:00:00 UTC to 2026-04-20 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2026-04-20 00:00:00 UTC to 2026-04-27 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2026-04-27 00:00:00 UTC to 2026-05-04 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2026-05-04 00:00:00 UTC to 2026-05-11 00:00:00 UTC (exclusive): 1 mentions; 1 submissions, 0 commentsMay 4

Counts come from the repository’s dated source evidence. Index cutoff: 2026-11-02 08:16:59 UTC.

View mention counts and date ranges
UTC ranges include their start and exclude their end. Select a period to filter the source evidence.
PeriodStart (UTC)End (exclusive, UTC)MentionsSubmissionsComments
Feb 92026-02-09 00:00:00 UTC2026-02-16 00:00:00 UTC330
Feb 162026-02-16 00:00:00 UTC2026-02-23 00:00:00 UTC431
Feb 232026-02-23 00:00:00 UTC2026-03-02 00:00:00 UTC422
Mar 22026-03-02 00:00:00 UTC2026-03-09 00:00:00 UTC000
Mar 92026-03-09 00:00:00 UTC2026-03-16 00:00:00 UTC000
Mar 162026-03-16 00:00:00 UTC2026-03-23 00:00:00 UTC101
Mar 232026-03-23 00:00:00 UTC2026-03-30 00:00:00 UTC303
Mar 302026-03-30 00:00:00 UTC2026-04-06 00:00:00 UTC110
Apr 62026-04-06 00:00:00 UTC2026-04-13 00:00:00 UTC000
Apr 132026-04-13 00:00:00 UTC2026-04-20 00:00:00 UTC000
Apr 202026-04-20 00:00:00 UTC2026-04-27 00:00:00 UTC000
Apr 272026-04-27 00:00:00 UTC2026-05-04 00:00:00 UTC000
May 42026-05-04 00:00:00 UTC2026-05-11 00:00:00 UTC110

What Hacker News says

3 sources

Show HN: SNKV benchmark with RocksDB

I have been working on SNKV, a lightweight SQLite's B-tree based key value store focused on predictable performance and low memory usage. I benchmarked SNKV against RocksDB using 1,000,000 records on the same hardware with minimal tuning on both sides. Mixed workload 70 percent reads 20 percent writes 10 percent deletes SNKV 49,119 ops per second RocksDB 43,394 ops per second Random reads 50,000 lookups SNKV 69,174 ops per second RocksDB 54,029 ops per second Sequential scan 1,000,000 records SNKV 1,842,380 ops per second RocksDB 973,795 ops per second Sequential writes 1,000,000 inserts SNKV 122,580 ops per second RocksDB 438,452 ops per second Peak process memory usage SNKV approximately 2 MB RocksDB approximately 20 MB These results reflect architectural tradeoffs. RocksDB performs strongly in sustained write heavy scenarios, while SNK
Read the rest
V performs well in balanced read write workloads and scan heavy use cases. SNKV benchmark source https://github.com/hash-anu/snkv/blob/master/tests/test_benc... RocksDB benchmark source https://github.com/hash-anu/rocksdb-benchmark Feedback on benchmark methodology and configuration fairness is welcome.
2 points · Open discussion

Show HN: SNKV and LiteFS – Distributed KV store with automatic replication

SNKV is a simple key-value store built on SQLite's B-Tree API. I've just integrated it with LiteFS to get distributed replication with zero application changes. The interesting part is how LiteFS works - it sits between your application and SNKV using FUSE, intercepts WAL writes, and streams them to replica nodes. The application just sees a regular filesystem. I'm using Consul for leader election, but LiteFS also supports static configuration. Setup guide with working code: https://github.com/hash-anu/snkv/blob/master/litefs_setup_gu... Verified with 10MB of data replicating correctly across nodes. The guide includes architecture diagrams and both writer/reader programs with full byte-by-byte verification. Would appreciate your feedback.
3 points · Open discussion
hashmakjsn·Feb 9, 2026Submission

Show HN: Developed key value storage using SQLite's b-tree APIs directly

I’ve been experimenting with using SQLite as a key–value store without going through the SQL layer. SQLite’s B-Tree implementation is extremely mature and well-tested, but most access goes through the SQL compiler, VDBE, and query planner. I wanted to see what happens if you bypass all of that and interact directly with the B-Tree APIs. The result is a small prototype KV store that: Uses SQLite’s internal B-Tree interfaces directly Avoids parsing, planning, and VDBE execution Keeps SQLite’s ACID guarantees intact In local benchmarks with mixed read/write workloads, this approach showed noticeably lower overhead compared to equivalent SQL-based access patterns. please let me know if you face any bug, let me know area of improvements that i can add in it.
4 points · Open discussion

MAKE YOURSELF AT HOME

A few shortcuts

/
Search the collection
?
Open this guide
Esc
Close dialogs and navigation

Your saved repositories and interests stay in this browser.