HackerReposA FIELD GUIDE TO OPEN SOURCE
ProSponsor the shelf♧ 0
← Back to top all-time
fastserial
lite3
C2025–2026
fastserial / lite3

lite3

A JSON-Compatible Zero-Copy Serialization Format

9Distinct people
15Mentions
0Explicit recommenders
810GitHub stars
REPOSITORY AT A GLANCE

What to know before exploring

What it is

A JSON-Compatible Zero-Copy Serialization Format

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, 12:56:33 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 week15 dated mentions

Observed mentions: 2025-11-20 14:20:59 UTC to 2026-02-24 13:28:44 UTC. Weeks start Monday, UTC.

012342025-11-17 00:00:00 UTC to 2025-11-24 00:00:00 UTC (exclusive): 1 mentions; 1 submissions, 0 commentsNov 172025-11-24 00:00:00 UTC to 2025-12-01 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2025-12-01 00:00:00 UTC to 2025-12-08 00:00:00 UTC (exclusive): 1 mentions; 0 submissions, 1 comments2025-12-08 00:00:00 UTC to 2025-12-15 00:00:00 UTC (exclusive): 3 mentions; 1 submissions, 2 comments2025-12-15 00:00:00 UTC to 2025-12-22 00:00:00 UTC (exclusive): 4 mentions; 0 submissions, 4 comments2025-12-22 00:00:00 UTC to 2025-12-29 00:00:00 UTC (exclusive): 1 mentions; 0 submissions, 1 comments2025-12-29 00:00:00 UTC to 2026-01-05 00:00:00 UTC (exclusive): 1 mentions; 0 submissions, 1 comments2026-01-05 00:00:00 UTC to 2026-01-12 00:00:00 UTC (exclusive): 1 mentions; 0 submissions, 1 commentsJan 52026-01-12 00:00:00 UTC to 2026-01-19 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2026-01-19 00:00:00 UTC to 2026-01-26 00:00:00 UTC (exclusive): 1 mentions; 0 submissions, 1 comments2026-01-26 00:00:00 UTC to 2026-02-02 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2026-02-02 00:00:00 UTC to 2026-02-09 00:00:00 UTC (exclusive): 1 mentions; 0 submissions, 1 comments2026-02-09 00:00:00 UTC to 2026-02-16 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2026-02-16 00:00:00 UTC to 2026-02-23 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2026-02-23 00:00:00 UTC to 2026-03-02 00:00:00 UTC (exclusive): 1 mentions; 0 submissions, 1 commentsFeb 23

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
Nov 172025-11-17 00:00:00 UTC2025-11-24 00:00:00 UTC110
Nov 242025-11-24 00:00:00 UTC2025-12-01 00:00:00 UTC000
Dec 12025-12-01 00:00:00 UTC2025-12-08 00:00:00 UTC101
Dec 82025-12-08 00:00:00 UTC2025-12-15 00:00:00 UTC312
Dec 152025-12-15 00:00:00 UTC2025-12-22 00:00:00 UTC404
Dec 222025-12-22 00:00:00 UTC2025-12-29 00:00:00 UTC101
Dec 292025-12-29 00:00:00 UTC2026-01-05 00:00:00 UTC101
Jan 52026-01-05 00:00:00 UTC2026-01-12 00:00:00 UTC101
Jan 122026-01-12 00:00:00 UTC2026-01-19 00:00:00 UTC000
Jan 192026-01-19 00:00:00 UTC2026-01-26 00:00:00 UTC101
Jan 262026-01-26 00:00:00 UTC2026-02-02 00:00:00 UTC000
Feb 22026-02-02 00:00:00 UTC2026-02-09 00:00:00 UTC101
Feb 92026-02-09 00:00:00 UTC2026-02-16 00:00:00 UTC000
Feb 162026-02-16 00:00:00 UTC2026-02-23 00:00:00 UTC000
Feb 232026-02-23 00:00:00 UTC2026-03-02 00:00:00 UTC101

What Hacker News says

4 sources
> It seems like maybe the documentation needs to be updated Looks like it, yes: /** Enable hash probing to tolerate 32-bit hash collisions. Hash probing configuration (quadratic open addressing for 32-bit hashes: h_i = h_0 + i^2) Limit attempts with `LITE3_HASH_PROBE_MAX` (defaults to 128). Probing cannot be disabled. */ #ifndef LITE3_HASH_PROBE_MAX #define LITE3_HASH_PROBE_MAX 128U #endif #if LITE3_HASH_PROBE_MAX < 2 #error "LITE3_HASH_PROBE_MAX must be >= 2" #endif > It also means that the spec will ossify around a specific hash function It is a bit ugly, and will break backwards compatibility, but supporting a second hash function isn’t too hard. You can, on load, hash a few keys, compare them to the hashes, and, from that, if the input has many keys with high probability, infer which hash fu
Read the rest
nction was used. There also might be spare bit somewhere to indicate ‘use the alternative hash function’. Reading the code (nice-looking, BTW, for C code, but since it is C code, also full of warnings that other languages can protect you from) I spotted this (https://github.com/fastserial/lite3/blob/acbb97984eca1183ddc...): > The JSON standard requires that the root-level type always be an ‘object' > or 'array'. This also applies to Lite³. I don’t think that is true, and https://www.json.org/json-en.html agrees with that. Single values (numbers, strings, booleans, null) also are valid json.
In Lite^3, a JSON-compatible zero-copy serialization format
Looking at the actual code (https://github.com/fastserial/lite3/blob/main/src/lite3.c#L2...), it seems like it performs up to 128 probes to find a target before failing, rather than bailing immediately if a collision is detected. It seems like maybe the documentation needs to be updated? It's a bit unfortunate that the wire format is tied to a specific hash function. It also means that the spec will ossify around a specific hash function, which may not end up being the optimal choice. Neither JSON nor Protobuf have this limitation. One way around this would be to ditch the hashing and use the keys for the b-tree directly. It might be worth benchmarking - I don't think it's necessarily any slower, and an inline cache of key prefixes (basically a cheapo hash using the first N chars) should help preserve performance for common cases.
In Lite^3, a JSON-compatible zero-copy serialization format
(I made rkyv) I took a look at lite3/tron because I was interested in seeing how it approached some of the issues I ran into with rkyv. I ended up with some additional information related to points 1 and 2 I figured I'd write down: 1) You're correct, rkyv uses a B-tree with a default branching factor of 6 [1]. I don't think I've ever implemented a binary tree in any version of rkyv - maybe one of the earliest versions used a sorted vec instead of a B-tree? I hate the B-tree map implementation because it is so complicated, even though it actually used to be even worse in 0.7 when it was implemented as a B+ tree. Sorry for making you read any of it! 2) Arbitrary mutations would definitely be an improvement on rkyv, and I was most interested to see what kind of approach lite3/tron took! Unfortunately growing the buffer is not supported [2] a
Read the rest
nd freed memory isn't reclaimed [3]. These are the two actually difficult problems standing in the way of rkyv getting more comprehensive mutation support, so unfortunately I think there's nothing valuable to take away here. The issue with growing the buffer is that you invalidate any pointers into the buffer and have to manually fix them up (e.g. by re-crawling the buffer). There's not a decent approach I'm aware of which manages these pointer fixups in a way that limits complexity and avoids really nasty API surfaces. The issue with memory reclamation is that you effectively have to add an allocator to your buffer, and that allocator has to also be persistable. I actually got this part working in rel while that was still a project worth hacking on [4]. I just ran out of steam and willingness to play the type-tac-toe required to get a safe API out of it. The main problem I ran into there was related to value branding, since you shouldn't be allowed to make references to objects which cross between contiguous buffers. This project is neat, but it does basically just look like an rkyv-converted `BTreeMap<String, JsonValue>`. [1]: https://github.com/rkyv/rkyv/blob/main/rkyv/src/collections/... [2]: https://github.com/fastserial/lite3/blob/main/src/lite3.c#L5... [3]: https://lite3.io/design_and_limitations.html#autotoc_md29 (see note at end of section) [4]: https://github.com/rkyv/rel/blob/main/rel_example/src/main.r...
In SQLite JSON at full index speed using generated columns

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.