May 3 · 18 min read · TLDR: A Bloom filter is a bit array of m bits + k independent hash functions that sets k bits on insert and checks those same k bits on lookup. If any checked bit is 0, the element is definitely not in the set — false negatives are mathematically imp...
Join discussionApr 5 · 13 min read · TLDR: Probabilistic data structures trade a small, bounded probability of being wrong for orders-of-magnitude better memory efficiency and O(1) speed. Bloom Filters answer "definitely not in this set" in constant time with zero false negatives. Hyper...
Join discussionMar 9 · 13 min read · TLDR TLDR: A Bloom Filter is a bit array + multiple hash functions that answers "Is X in the set?" in $O(1)$ constant space. It can return false positives (say "yes" when the answer is "no") but never false negatives (never says "no" when the answer...
Join discussionJan 27 · 9 min read · The Problem When we have something frequent and at the same time intensive it's just one of the biggest challenges we might face. A good example of that is something like uniqueness validation; we need to add a new email to the database but to do tha...
Join discussion
Oct 31, 2025 · 2 min read · Yup, it came from hours of frustration. I was working on a Scrapy spider that could scrape thousands of products a day, but it was only getting around 90. Websites often update their anti-bot systems, and when they do, a lot of our pipelines break. M...
Join discussion
Oct 14, 2025 · 3 min read · https://tenor.com/view/scam-alert-scam-phishing-hack-fraud-gif-62215083004720289 GIF credits: Tenor Imagine you are building a URL spam filter for a service like Gmail. You have a list of 100 million malicious URLs, and you need to check every sing...
Join discussionOct 5, 2025 · 6 min read · Is this your first time hearing about “Bloom Filter“ ? Then you have reached the best place. I was in the same place when I read BLOOM FILTER for the first time in a youtube thumbnail. This mysterious name got me curious as the name does not give any...
Join discussion
Sep 21, 2025 · 5 min read · What is Bloom Filter? Bloom filter is a space-efficient, probabilistic data structure used for testing whether an element is a member of a set. It can quickly tell us if an item might be in the set or definitely is not. The key point is that it never...
Join discussion
