https://github.com/vnykmshr/bloom-sift
Fast Bloom filter using 128-bit MurmurHash3 with double hashing using Kirsch-Mitzenmacher technique. Optimal parameters auto-calculated. Works in Node.js and browsers.
https://github.com/vnykmshr/bloom-sift
bloom-filter hash-function murmur-hash nodejs probabilistic-data-structure set-membership space-efficient typescript
Last synced: 6 days ago
JSON representation
Fast Bloom filter using 128-bit MurmurHash3 with double hashing using Kirsch-Mitzenmacher technique. Optimal parameters auto-calculated. Works in Node.js and browsers.
- Host: GitHub
- URL: https://github.com/vnykmshr/bloom-sift
- Owner: vnykmshr
- License: mit
- Created: 2025-11-19T18:25:22.000Z (3 months ago)
- Default Branch: main
- Last Pushed: 2025-11-20T06:16:18.000Z (3 months ago)
- Last Synced: 2025-11-20T07:19:57.798Z (3 months ago)
- Topics: bloom-filter, hash-function, murmur-hash, nodejs, probabilistic-data-structure, set-membership, space-efficient, typescript
- Language: TypeScript
- Homepage:
- Size: 61.5 KB
- Stars: 0
- Watchers: 0
- Forks: 0
- Open Issues: 0