https://github.com/1mb-dev/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/1mb-dev/bloom-sift
bloom-filter hash-function murmur-hash nodejs probabilistic-data-structure set-membership space-efficient typescript
Last synced: 19 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/1mb-dev/bloom-sift
- Owner: 1mb-dev
- License: mit
- Created: 2025-11-19T18:25:22.000Z (4 months ago)
- Default Branch: main
- Last Pushed: 2026-02-15T06:20:22.000Z (28 days ago)
- Last Synced: 2026-02-15T09:55:03.919Z (28 days ago)
- Topics: bloom-filter, hash-function, murmur-hash, nodejs, probabilistic-data-structure, set-membership, space-efficient, typescript
- Language: TypeScript
- Homepage:
- Size: 201 KB
- Stars: 1
- Watchers: 0
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- Changelog: CHANGELOG.md
- Contributing: .github/CONTRIBUTING.md
- License: LICENSE