The **bloom‑filters** package provides a TypeScript/JavaScript library of space‑efficient probabilistic data structures—classic, partitioned, scalable and counting Bloom filters, cuckoo filters, HyperLogLog, Count‑Min Sketch, Top‑K, MinHash, invertible Bloom filters and XOR‑filters—built on fast non‑cryptographic xxHash functions. It’s aimed at developers who need fast, memory‑light approximate set‑membership, cardinality, frequency‑ranking or similarity‑estimation utilities for Node.js or browser applications.
How the donated funds are distributed
Kivach works on the Obyte network, and therefore you can track all donations.