<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:dc="http://purl.org/dc/elements/1.1/">
  <channel>
    <title>DEV Community: Hardik Gupta</title>
    <description>The latest articles on DEV Community by Hardik Gupta (@strykerinside).</description>
    <link>https://dev.to/strykerinside</link>
    <image>
      <url>https://media2.dev.to/dynamic/image/width=90,height=90,fit=cover,gravity=auto,format=auto/https:%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F1970389%2F0b6d0feb-50f8-4f39-8efa-c07262158454.png</url>
      <title>DEV Community: Hardik Gupta</title>
      <link>https://dev.to/strykerinside</link>
    </image>
    <atom:link rel="self" type="application/rss+xml" href="https://dev.to/feed/strykerinside"/>
    <language>en</language>
    <item>
      <title>Bloom Filters for AI Agents: The Small Cache Trick That Saved My Retrieval Pipeline</title>
      <dc:creator>Hardik Gupta</dc:creator>
      <pubDate>Fri, 17 Apr 2026 18:07:16 +0000</pubDate>
      <link>https://dev.to/strykerinside/bloom-filters-for-ai-agents-the-small-cache-trick-that-saved-my-retrieval-pipeline-5cd4</link>
      <guid>https://dev.to/strykerinside/bloom-filters-for-ai-agents-the-small-cache-trick-that-saved-my-retrieval-pipeline-5cd4</guid>
      <description>&lt;p&gt;Bloom filters felt like a purely academic data structure - until an agent pipeline started repeating work. At that point, they became immediately practical.&lt;/p&gt;




&lt;h2&gt;
  
  
  Problem
&lt;/h2&gt;

&lt;p&gt;The system needed a fast, low-cost way to check whether something had &lt;em&gt;probably&lt;/em&gt; been seen before.&lt;/p&gt;

&lt;p&gt;Not certainty. A strong enough signal to avoid redundant work.&lt;/p&gt;




&lt;h2&gt;
  
  
  Failure Mode
&lt;/h2&gt;

&lt;p&gt;The agent repeatedly:&lt;/p&gt;

&lt;ul&gt;
&lt;li&gt;revisited identical document IDs
&lt;/li&gt;
&lt;li&gt;re-triggered the same tool calls
&lt;/li&gt;
&lt;li&gt;reprocessed items already handled minutes earlier
&lt;/li&gt;
&lt;/ul&gt;

&lt;p&gt;This created:&lt;/p&gt;

&lt;ul&gt;
&lt;li&gt;unnecessary latency
&lt;/li&gt;
&lt;li&gt;increased compute cost
&lt;/li&gt;
&lt;li&gt;degraded pipeline efficiency
&lt;/li&gt;
&lt;/ul&gt;

&lt;p&gt;A lightweight pre-check layer was required.&lt;/p&gt;




&lt;h2&gt;
  
  
  Approach
&lt;/h2&gt;

&lt;p&gt;Introduce a Bloom filter as a front-line gate:&lt;/p&gt;

&lt;ul&gt;
&lt;li&gt;If &lt;strong&gt;definitely new&lt;/strong&gt; → process
&lt;/li&gt;
&lt;li&gt;If &lt;strong&gt;possibly seen&lt;/strong&gt; → verify via authoritative store
&lt;/li&gt;
&lt;/ul&gt;

&lt;p&gt;Properties leveraged:&lt;/p&gt;

&lt;ul&gt;
&lt;li&gt;No false negatives
&lt;/li&gt;
&lt;li&gt;Acceptable false positives
&lt;/li&gt;
&lt;/ul&gt;




&lt;h2&gt;
  
  
  Mental Model
&lt;/h2&gt;

&lt;p&gt;&lt;a href="https://media2.dev.to/dynamic/image/width=800%2Cheight=%2Cfit=scale-down%2Cgravity=auto%2Cformat=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F6eg9ewz6rgb6i5nbh56y.png" class="article-body-image-wrapper"&gt;&lt;img src="https://media2.dev.to/dynamic/image/width=800%2Cheight=%2Cfit=scale-down%2Cgravity=auto%2Cformat=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F6eg9ewz6rgb6i5nbh56y.png" alt=" " width="800" height="450"&gt;&lt;/a&gt;&lt;/p&gt;

&lt;p&gt;A Bloom filter consists of:&lt;/p&gt;

&lt;ul&gt;
&lt;li&gt;a fixed-size bit array
&lt;/li&gt;
&lt;li&gt;multiple hash functions
&lt;/li&gt;
&lt;li&gt;a probabilistic membership check
&lt;/li&gt;
&lt;/ul&gt;

&lt;p&gt;&lt;strong&gt;Insert&lt;/strong&gt;&lt;/p&gt;

&lt;ul&gt;
&lt;li&gt;hash value multiple times
&lt;/li&gt;
&lt;li&gt;set corresponding bits to &lt;code&gt;1&lt;/code&gt;
&lt;/li&gt;
&lt;/ul&gt;

&lt;p&gt;&lt;strong&gt;Query&lt;/strong&gt;&lt;/p&gt;

&lt;ul&gt;
&lt;li&gt;if any bit is &lt;code&gt;0&lt;/code&gt; → &lt;strong&gt;definitely not present&lt;/strong&gt;
&lt;/li&gt;
&lt;li&gt;if all bits are &lt;code&gt;1&lt;/code&gt; → &lt;strong&gt;possibly present&lt;/strong&gt;
&lt;/li&gt;
&lt;/ul&gt;




&lt;h2&gt;
  
  
  Implementation
&lt;/h2&gt;



&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight typescript"&gt;&lt;code&gt;&lt;span class="kd"&gt;class&lt;/span&gt; &lt;span class="nc"&gt;BloomFilter&lt;/span&gt; &lt;span class="p"&gt;{&lt;/span&gt;
  &lt;span class="k"&gt;private&lt;/span&gt; &lt;span class="nx"&gt;bits&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="k"&gt;new&lt;/span&gt; &lt;span class="nc"&gt;Uint8Array&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="mi"&gt;2048&lt;/span&gt;&lt;span class="p"&gt;);&lt;/span&gt;
  &lt;span class="k"&gt;private&lt;/span&gt; &lt;span class="k"&gt;readonly&lt;/span&gt; &lt;span class="nx"&gt;seeds&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="p"&gt;[&lt;/span&gt;&lt;span class="mi"&gt;17&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="mi"&gt;31&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="mi"&gt;53&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="mi"&gt;73&lt;/span&gt;&lt;span class="p"&gt;];&lt;/span&gt;

  &lt;span class="k"&gt;private&lt;/span&gt; &lt;span class="nf"&gt;hash&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="nx"&gt;value&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="kr"&gt;string&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="nx"&gt;seed&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="kr"&gt;number&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt; &lt;span class="p"&gt;{&lt;/span&gt;
    &lt;span class="kd"&gt;let&lt;/span&gt; &lt;span class="nx"&gt;hash&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="nx"&gt;seed&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt;
    &lt;span class="k"&gt;for &lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="kd"&gt;let&lt;/span&gt; &lt;span class="nx"&gt;i&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="mi"&gt;0&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt; &lt;span class="nx"&gt;i&lt;/span&gt; &lt;span class="o"&gt;&amp;lt;&lt;/span&gt; &lt;span class="nx"&gt;value&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nx"&gt;length&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt; &lt;span class="nx"&gt;i&lt;/span&gt;&lt;span class="o"&gt;++&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt; &lt;span class="p"&gt;{&lt;/span&gt;
      &lt;span class="nx"&gt;hash&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="nx"&gt;hash&lt;/span&gt; &lt;span class="o"&gt;*&lt;/span&gt; &lt;span class="mi"&gt;33&lt;/span&gt; &lt;span class="o"&gt;+&lt;/span&gt; &lt;span class="nx"&gt;value&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nf"&gt;charCodeAt&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="nx"&gt;i&lt;/span&gt;&lt;span class="p"&gt;))&lt;/span&gt; &lt;span class="o"&gt;%&lt;/span&gt; &lt;span class="k"&gt;this&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nx"&gt;bits&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nx"&gt;length&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt;
    &lt;span class="p"&gt;}&lt;/span&gt;
    &lt;span class="k"&gt;return&lt;/span&gt; &lt;span class="nx"&gt;hash&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt;
  &lt;span class="p"&gt;}&lt;/span&gt;

  &lt;span class="nf"&gt;add&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="nx"&gt;value&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="kr"&gt;string&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt; &lt;span class="p"&gt;{&lt;/span&gt;
    &lt;span class="k"&gt;for &lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="kd"&gt;const&lt;/span&gt; &lt;span class="nx"&gt;seed&lt;/span&gt; &lt;span class="k"&gt;of&lt;/span&gt; &lt;span class="k"&gt;this&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nx"&gt;seeds&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt; &lt;span class="p"&gt;{&lt;/span&gt;
      &lt;span class="k"&gt;this&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nx"&gt;bits&lt;/span&gt;&lt;span class="p"&gt;[&lt;/span&gt;&lt;span class="k"&gt;this&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nf"&gt;hash&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="nx"&gt;value&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="nx"&gt;seed&lt;/span&gt;&lt;span class="p"&gt;)]&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="mi"&gt;1&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt;
    &lt;span class="p"&gt;}&lt;/span&gt;
  &lt;span class="p"&gt;}&lt;/span&gt;

  &lt;span class="nf"&gt;has&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="nx"&gt;value&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="kr"&gt;string&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt; &lt;span class="p"&gt;{&lt;/span&gt;
    &lt;span class="k"&gt;return&lt;/span&gt; &lt;span class="k"&gt;this&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nx"&gt;seeds&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nf"&gt;every&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;
      &lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="nx"&gt;seed&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt; &lt;span class="o"&gt;=&amp;gt;&lt;/span&gt; &lt;span class="k"&gt;this&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nx"&gt;bits&lt;/span&gt;&lt;span class="p"&gt;[&lt;/span&gt;&lt;span class="k"&gt;this&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nf"&gt;hash&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="nx"&gt;value&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="nx"&gt;seed&lt;/span&gt;&lt;span class="p"&gt;)]&lt;/span&gt; &lt;span class="o"&gt;===&lt;/span&gt; &lt;span class="mi"&gt;1&lt;/span&gt;
    &lt;span class="p"&gt;);&lt;/span&gt;
  &lt;span class="p"&gt;}&lt;/span&gt;
&lt;span class="p"&gt;}&lt;/span&gt;
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;h2&gt;
  
  
  Where It Fit in My Agent Stack
&lt;/h2&gt;

&lt;p&gt;&lt;a href="https://media2.dev.to/dynamic/image/width=800%2Cheight=%2Cfit=scale-down%2Cgravity=auto%2Cformat=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fup9994eu4ioovnpetu03.png" class="article-body-image-wrapper"&gt;&lt;img src="https://media2.dev.to/dynamic/image/width=800%2Cheight=%2Cfit=scale-down%2Cgravity=auto%2Cformat=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fup9994eu4ioovnpetu03.png" alt=" " width="800" height="533"&gt;&lt;/a&gt;&lt;/p&gt;

&lt;p&gt;I ended up using Bloom filters in three key places:&lt;/p&gt;

&lt;h3&gt;
  
  
  1. Event Deduplication
&lt;/h3&gt;

&lt;p&gt;Before the agent processes anything, I filter out repeated inputs. This alone removed a lot of noise.&lt;/p&gt;

&lt;h3&gt;
  
  
  2. Retrieval Optimization
&lt;/h3&gt;

&lt;p&gt;While scanning candidate documents, I skip anything that has likely been seen before. This reduced unnecessary lookups.&lt;/p&gt;

&lt;h3&gt;
  
  
  3. Tool Call Short-Circuiting
&lt;/h3&gt;

&lt;p&gt;This was the biggest win.&lt;/p&gt;

&lt;p&gt;Agents tend to repeat tool calls when context becomes messy. A Bloom filter doesn’t fix reasoning, but it stops the system from wasting cycles on the same targets again and again.&lt;/p&gt;




&lt;h2&gt;
  
  
  The Tradeoff I Respect
&lt;/h2&gt;

&lt;p&gt;&lt;a href="https://media2.dev.to/dynamic/image/width=800%2Cheight=%2Cfit=scale-down%2Cgravity=auto%2Cformat=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fywqjczdqhbgwjon46z15.png" class="article-body-image-wrapper"&gt;&lt;img src="https://media2.dev.to/dynamic/image/width=800%2Cheight=%2Cfit=scale-down%2Cgravity=auto%2Cformat=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fywqjczdqhbgwjon46z15.png" alt=" " width="800" height="533"&gt;&lt;/a&gt;&lt;/p&gt;

&lt;p&gt;I don’t use Bloom filters when I need certainty.&lt;/p&gt;

&lt;p&gt;I use them when I need:&lt;/p&gt;

&lt;ul&gt;
&lt;li&gt;speed
&lt;/li&gt;
&lt;li&gt;low memory usage
&lt;/li&gt;
&lt;li&gt;a fast first-pass filter
&lt;/li&gt;
&lt;/ul&gt;

&lt;p&gt;They are not a source of truth.&lt;/p&gt;

&lt;p&gt;They are a guardrail.&lt;/p&gt;




&lt;h2&gt;
  
  
  Final Take
&lt;/h2&gt;

&lt;p&gt;Bloom filters work best as a front-line defense against wasted effort.&lt;/p&gt;

&lt;p&gt;They don’t fix reasoning.&lt;br&gt;&lt;br&gt;
They don’t improve intelligence.  &lt;/p&gt;

&lt;p&gt;What they do is enforce discipline in the system - quietly, efficiently, and at scale.&lt;/p&gt;

&lt;p&gt;In agent pipelines, that’s often exactly what is missing.&lt;/p&gt;




&lt;h2&gt;
  
  
  Discussion
&lt;/h2&gt;

&lt;p&gt;How do you handle deduplication in your AI workflows?&lt;/p&gt;

&lt;ul&gt;
&lt;li&gt;Redis / Postgres with exact checks?
&lt;/li&gt;
&lt;li&gt;Probabilistic structures like Bloom or Cuckoo filters?
&lt;/li&gt;
&lt;li&gt;Something hybrid?&lt;/li&gt;
&lt;/ul&gt;

</description>
      <category>bloomfilter</category>
      <category>agents</category>
      <category>typescript</category>
      <category>performance</category>
    </item>
  </channel>
</rss>
