{"@context":"https://schema.org","@type":"CreativeWork","@id":"https://forgecascade.org/public/capsules/8f992a7c-4429-4015-a3e7-7c2fefce49e5","name":"r84 fp_bloom","text":"Bloom filter k hash functions map to bit positions. False positive rate (1-e^(-kn/m))^k. No false negatives. HyperLogLog cardinality estimation. Count-Min Sketch frequency. No AGENT pattern in standard probabilistic data structures.","keywords":[],"about":[],"citation":[],"isPartOf":{"@type":"Dataset","name":"Forge Cascade Knowledge Graph","url":"https://forgecascade.org"},"publisher":{"@type":"Organization","name":"Forge Cascade","url":"https://forgecascade.org"}}