Status: IN
`BloomFilter` computes `bit_count` as `ceil(-n * ln(p) / ln(2)^2)` and `hash_count` as `round((m/n) * ln(2))`, matching the standard optimal formulas from Bloom filter literature
Source: entries/2026/05/29/bloom-filter-test_bloom_filter.md