Module bloom 

Compact Bloom filter for per-file BM25 term pruning (Phase F).

Uses k=4 independent hash probes derived from two FNV-64 seeds (double-hashing trick: h_i(x) = h1(x) + i*h2(x) mod m). No external hash dep — FNV-64 is trivially inlined.

Serialization: 8-byte little-endian num_bits header + bit words (u64, LE).

Structs

BloomFilter

Probabilistic set membership test for string terms.