← Tuesday, October 20, 2026DatabasesDeep dive

One-hash Bloom filters can spare Bluesky millions of database queries per second

calabro.io 6 min read Editor score 7/10

Bloom filters can rule out keys without disk access, and Bluesky uses them to avoid millions of Scylla queries per second. The post explores a one-hash variant with potential lessons for latency-sensitive data systems.

What
Bloom filters are probabilistic set-membership structures that answer “definitely not” or “probably” using little memory.
How
Bluesky loads blocks, mutes and list items into filters; a real-time firehose consumer adds new items.
Why it matters
A roughly 1% positive hit rate lets Bluesky skip database queries 99% of the time, helping it scale and operate cheaply.

Discussion

Discussion is not switched on yet. Use Note above to keep your own thoughts on this story.

Headline, summary, brief and diagram are written by a model from the source's own text; the link, byline and numbers come from the source. Read the original before relying on a claim.

Your note

Private to you. Stored in this browser, and synced to your account when you are signed in.