Log In
Log In

New Library for 1.89 - Boost.Bloom

Boost.Bloom is a header-only C++ library for efficient probabilistic set membership testing.

It allows you to check whether an element might be in a set, with minimal memory overhead and no false negatives, ideal for high-throughput scenarios like caching, deduplication, and indexing.

The filter is highly space-efficient, and can dramatically reduce the cost of negative lookups in systems where accessing the full data set is expensive.

Repo: https://github.com/boostorg/bloom
Docs: https://boost.org/libs/bloom

Next Post

  • Hub is here
    Link #Bloom
    During Q2 2026 Boost work is summarized: boost::container::hub accepted for Boost 1.92; Boost.Unordered added C++20 range support; Boost.MultiIndex got iterator pointers; Boost.ICL fixed for libc++ v22; Boost.Bloom, Boost.Graph and activities noted.
  • Working on Boost.Bloom roadmap
    Link #Bloom
    In Q3 2025 Boost.Bloom work added branchless subfilters, bulk‑mode ops, and a dynamic filter prototype. Additional tasks covered CMake fixes, reviewing Boost libraries, filing site issues, moving release‑notes to the new website, and promotion on media.
  • Bulk operations in Boost.Bloom
    Link #Bloom
    Bulk insertion and lookup are added to Boost.Bloom in Boost 1.90; position calculations are prefetched and lookup uses a bit‑mask with std::countr_zero to minimise branches, yielding speedups of up to three‑fold depending on filter size and parameters.