{"id":"bloom-filter-double-hashing","text":"`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.","truth_value":"IN","source":"entries/2026/05/29/bloom-filter-bloom_filter-BloomFilter.md","source_url":"","source_hash":"","justifications":[],"dependents":[],"metadata":{},"explanation":{"steps":[{"node":"bloom-filter-double-hashing","truth_value":"IN","reason":"premise"}]}}