PHPackages zircote/bloom - PHPackages - PHPackages [Skip to content](#main-content)[PHPackages](/)[Directory](/)[Categories](/categories)[Trending](/trending)[Leaderboard](/leaderboard)[Changelog](/changelog)[Analyze](/analyze)[Collections](/collections)[Log in](/login)[Sign up](/register) 1. [Directory](/) 2. / 3. [Utility & Helpers](/categories/utility) 4. / 5. zircote/bloom ActiveLibrary[Utility & Helpers](/categories/utility) zircote/bloom ============= A PHP/Redis Bloom filter experiment 15203PHPCI passing Since Feb 27Pushed 3mo ago3 watchersCompare [ Source](https://github.com/zircote/Bloom)[ Packagist](https://packagist.org/packages/zircote/bloom)[ RSS](/packages/zircote-bloom/feed)WikiDiscussions master Synced 3w ago READMEChangelogDependenciesVersions (1)Used By (0) Bloom ===== [](#bloom) [![Build Status](https://camo.githubusercontent.com/bd06fd31d74aed17dacc1ecdf51d728090fbcb4c5b9642c81f4f718886a8e7bf/68747470733a2f2f7365637572652e7472617669732d63692e6f72672f7a6972636f74652f426c6f6f6d2e706e67)](http://travis-ci.org/zircote/Bloom) This project has morphed from an attempt of 'pure' php bloom filters to a tool that employs `Redis` and `Rediska` as a storage and interface for a distributed `Bloom Filter`. By utilizing the power of redis' `SETBIT` and `GETBIT` we are able to create a simple, powerful and lightweight bloomfilter. The ability of redis to create a BITSET that is practically endless in size *512MB* the index limitations afforded us is huge. PHP\_INT\_MAX serves well as a line in the sand in this early stage of testing and research. This potentially results in a 3% false positive rate for 10b values given sufficient number of hashing buckets. (I am performing more on these numbers before I get overly confident on these findings.) Read Times on Benchmarks: 0.0011499519820647/s with three key hashing using a word list of 27607 unique strings. Add Times on benchmark tests: 0.0036964981654479/s with three key hashing using a word list of 27607 unique strings. ```