Bijou64: A variable-length integer encoding
Bijou64 is a new variable-length integer encoding developed for the Subduction CRDT sync protocol. It was created to address a signature-verification bug and unexpectedly offers improved performance compared to the common LEB128 encoding. The design ensures that each integer has a unique representation, eliminating issues related to canonicality in binary protocols.
- ▪Bijou64 was developed to fix a subtle signature-verification bug in the Subduction CRDT sync protocol.
- ▪It runs faster than the more common LEB128 encoding due to its unique design constraints.
- ▪Bijou64 ensures that each integer can only be represented in one way, preventing issues with canonicality in binary protocols.
Hacker News (Newest) files mainly under programming. We currently carry 5,306 of its stories.
Story provenance
Source · retrieval · rights · ranking — open for full record
inspect →
Story provenance
Attribution is not the same as permission. This drawer separates discovery metadata, excerpts, WeSearch-generated summaries, reuse status, and whether the publisher receives the visit. Nothing here claims a legal grant the publisher has not made.
Record
| Original publisher | Inkandswitch |
| Canonical URL | https://www.inkandswitch.com/tangents/bijou64/ |
| Publication time | Fri, 29 May 2026 15:03:32 +0000 |
| Retrieval time | 2026-05-29T15:20:02.083Z |
| Last seen | 2026-05-29T15:20:02.083Z |
| Headline source | Publisher (no WeSearch rewrite) |
| Excerpt source | publisher body |
| Excerpt method | First ~120 words (~800 chars) of extracted publisher body, fair-use limited. |
| Summary | WeSearch · cerebras-chat (WeSearch summarizer) |
| Summary source text | contentText |
| Citation coverage | Summary is a WeSearch-generated derivative; primary citation is the original publisher URL. |
| Cluster | b8TH-kQ89019 |
| Cluster logic | Grouped by semantic title/content similarity across sources within a rolling window. Same-publisher template collisions are excluded from coverage comparison. |
| Ranking reason | Story pages are not engagement-ranked. Hub feeds use recency, with optional source-diversified chronological ordering (cap consecutive stories per source). No personalized ranking. |
| Publisher visit | Yes — open original |
| Substitutes article? | No — link-out required for full text |
Rights status (four layers)
WeSearch handling by dimension
| Indexing | May the item be indexed (stored, ranked, made findable)? | Allowed |
| Snippet | May a short excerpt of the publisher's text be shown? | Allowed |
| AI summary | May WeSearch generate its own short summary of the article? | Limited |
| Retrieval / RAG | May the content be exposed for third-party retrieval-augmented generation? | Not asserted |
| Model training | May the content be used to train AI models? | Not asserted |
| Commercial reuse | May the content be reused commercially? | Not permitted |
Basis: Derived from the published RSS/Atom feed. Contact: [email protected]. Reviewed: 2026-07-24.
Opening excerpt (first ~120 words) tap to expand
April 2026 Brooklyn Zelenka It’s nice when you work on security and accidentally get some performance for free. This is the story of a small encoding called bijou64 — a variable-length integer (varint) encoding that we developed for the Subduction CRDT sync protocol. It was intended to fix a subtle signature-verification bug by making each number only representable a single way. It turned out to also run a few times faster than the more common varint LEB128. That “bijou” is French for “small jewel” is a happy coincidence 💎 We didn’t set out to write a fast varint, but it turns out that our design constraints made for an encoding that has to do less work. The Problem Many binary protocols need a compact way to encode integers that are usually small but occasionally large.
…
Excerpt limited to ~120 words for fair-use compliance. The full article is at Inkandswitch.
Discussion
0 commentsMore from Inkandswitch
