Software EngineeringConsistent Hashing: Adding Nodes Without Losing the CacheAdd one server to a cache cluster and the usual approach moves 89% of the cached data. Consistent hashing moves 12%. How it works, built and measured.Aug 27, 2026 · 9 min readRead
Software EngineeringBloom Filters: Skipping Lookups That Can Only MissSkip slow lookups for things that were never stored: a Bloom filter answers "definitely not here" for a million keys in 1.14 MiB instead of 88 MB.Aug 20, 2026 · 9 min readRead
Software EngineeringLRU Caches: Constant-Time Eviction for Real SystemsWhen a cache fills up, something has to go. An LRU cache drops whatever was used longest ago, instantly. How to build one, and when to pick another rule.Aug 9, 2026 · 6 min readRead