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