{"id":"bloom-hashes-positions-not-unique","text":"The `k` positions returned by `_hashes` are not guaranteed distinct — duplicate positions can occur when `m` is small relative to `k`, and all callers (add, contains, remove) tolerate this via idempotent bit/counter operations","truth_value":"IN","source":"entries/2026/05/29/bloom-filter-bloom_filter-_hashes.md","source_url":"","source_hash":"","justifications":[],"dependents":[],"metadata":{},"explanation":{"steps":[{"node":"bloom-hashes-positions-not-unique","truth_value":"IN","reason":"premise"}]}}