Command Palette

Search for a command to run...

Hectal

Bloom filters · from first bit to FAANG-level design

"Definitely not" or "maybe".
Know the maths, the variants, and what breaks.

Bloom filters taught as engineering, not trivia: the false-positive maths and sizing, hashing, a thread-safe versioned implementation, counting, scalable, blocked, cuckoo, quotient, xor and ribbon variants, LSM engines and CDNs, RedisBloom cache-penetration protection, keeping filters fresh with Kafka and CDC, rebuilds, distributed and multi-region filters, observability and security. Every topic works through a real interview problem and the ways it breaks in production, ending with FAANG-style designs and a 50-question revision bank.

Phases
12
Topics
48
Hours
6
Diagrams
22
Exercises
178

By the end you can

What this course makes you able to do

  • Explain false positives and false negatives precisely, and why a correct filter never returns a false negative
  • Size any filter live: derive the FPR formula, compute m and k, and predict saturation past capacity
  • Implement a thread-safe, serialisable, versioned Bloom filter with good hashing
  • Choose between Bloom, counting, scalable, blocked, cuckoo, quotient, xor and ribbon filters, and justify it
  • Design cache penetration protection with a filter, Redis and a database, kept fresh through Kafka or CDC with safe rebuilds
  • Answer staff-level design questions with the full reasoning chain: requirement → error budget → sizing → variant → freshness → failure → trade-offs

Where should I start?

Pick a path for your goal

Fundamentals (0–2 years)

You've heard of Bloom filters and want to truly understand them.

  1. 10 · Probabilistic Foundations
  2. 21 · The Mathematics
  3. 32 · Hash Functions
  4. 43 · Building a Production Filter

Then Phase 6 to use one in front of Redis and a database.