<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0">
  <channel>
    <title>PyPI recent updates for bloom-filter-hash</title>
    <link>https://pypi.org/project/bloom-filter-hash/</link>
    <description>Recent updates to the Python Package Index for bloom-filter-hash</description>
    <language>en</language>    <item>
      <title>0.1.4</title>
      <link>https://pypi.org/project/bloom-filter-hash/0.1.4/</link>
      <description>Using Bloom Filters, can we greatly reduce the number of password combinations to brute force</description>
      <pubDate>Fri, 21 Aug 2026 16:08:37 GMT</pubDate>
    </item>    <item>
      <title>0.1.3</title>
      <link>https://pypi.org/project/bloom-filter-hash/0.1.3/</link>
      <description>Using Bloom Filters, can we greatly reduce the number of password combinations to brute force</description>
      <pubDate>Fri, 14 Aug 2026 19:37:43 GMT</pubDate>
    </item>    <item>
      <title>0.1.2</title>
      <link>https://pypi.org/project/bloom-filter-hash/0.1.2/</link>
      <description>Using Bloom Filters, can we greatly reduce the number of password combinations to brute force</description>
      <pubDate>Mon, 10 Aug 2026 18:51:25 GMT</pubDate>
    </item>    <item>
      <title>0.1.1</title>
      <link>https://pypi.org/project/bloom-filter-hash/0.1.1/</link>
      <description>Using Bloom Filters, can we greatly reduce the number of password combinations to brute force</description>
      <pubDate>Sun, 09 Aug 2026 12:12:07 GMT</pubDate>
    </item>    <item>
      <title>0.1.0</title>
      <link>https://pypi.org/project/bloom-filter-hash/0.1.0/</link>
      <description>Using Bloom Filters, can we greatly reduce the number of password combinations to brute force</description>
      <pubDate>Sat, 01 Aug 2026 12:26:35 GMT</pubDate>
    </item>  </channel>
</rss>