Bitbloom

A no_std minimal Bloom filter for memory-constrained environment.

Example

Add bitbloom to Cargo.toml:

[dependencies]
bitbloom = "0.1.0"

use bitbloom::Bloom;
use rand_pcg::Pcg64Mcg;
use rand_core::SeedableRng;

// Create a deterministic RNG
let mut rng = Pcg64Mcg::seed_from_u64(42);

// Create a Bloom filter for 1000 items with 1% false positive rate
let mut bloom = Bloom::new_with_rng(1000, 0.01, &mut rng);

// Insert items
bloom.set(&"hello");
bloom.set(&"world");

// Query membership
assert!(bloom.contain(&"hello"));
assert!(!bloom.contain(&"unknown"));

References

• Optimal number of bit and hash function
• Less Hashing, Same Performance:Building a Better Bloom Filter