Status: IN
`BloomFilter` generates k bit positions via Kirschner-Mitzenmacker double hashing: one MD5 digest is split into two 64-bit values h1 and h2, then positions are computed as `(h1 + i*h2) % m` rather than using k independent hash functions.
Source: entries/2026/05/29/bloom-filter-bloom_filter-BloomFilter.md