npm package discovery and stats viewer.

Discover Tips

  • General search

    [free text search, go nuts!]

  • Package details

    pkg:[package-name]

  • User packages

    @[username]

Sponsor

Optimize Toolset

I’ve always been into building performant and accessible sites, but lately I’ve been taking it extremely seriously. So much so that I’ve been building a tool to help me optimize and monitor the sites that I build to make sure that I’m making an attempt to offer the best experience to those who visit them. If you’re into performant, accessible and SEO friendly sites, you might like it too! You can check it out at Optimize Toolset.

About

Hi, 👋, I’m Ryan Hefner  and I built this site for me, and you! The goal of this site was to provide an easy way for me to check the stats on my npm packages, both for prioritizing issues and updates, and to give me a little kick in the pants to keep up on stuff.

As I was building it, I realized that I was actually using the tool to build the tool, and figured I might as well put this out there and hopefully others will find it to be a fast and useful way to search and browse npm packages as I have.

If you’re interested in other things I’m working on, follow me on Twitter or check out the open source projects I’ve been publishing on GitHub.

I am also working on a Twitter bot for this site to tweet the most popular, newest, random packages from npm. Please follow that account now and it will start sending out packages soon–ish.

Open Software & Tools

This site wouldn’t be possible without the immense generosity and tireless efforts from the people who make contributions to the world and share their work via open source initiatives. Thank you 🙏

© 2026 – Pkg Stats / Ryan Hefner

@warfighter77806/bloom-filter

v1.0.0

Published

A fast and efficient Bloom filter implementation with TypeScript support.

Readme

@warfighter77806/bloom-filter

A high-performance, lightweight Bloom filter implementation for Node.js and the browser, written in TypeScript.

Features

  • 🚀 Fast: Uses optimized hashing and bitwise operations.
  • 📦 Lightweight: Zero dependencies.
  • 🛡️ Type-safe: Built with TypeScript.
  • 🔧 Customizable: Set your expected item count and desired false positive rate.
  • 💾 Serializable: Easily export/import filter state via JSON.

Installation

npm install @warfighter77806/bloom-filter

Usage

Basic Example

import { BloomFilter } from '@warfighter77806/bloom-filter';

// Create a filter for 10,000 expected items and a 1% false positive rate
const filter = new BloomFilter(10000, 0.01);

// Add items
filter.add('user-123');
filter.add('user-456');

// Check items
console.log(filter.has('user-123')); // true
console.log(filter.has('user-789')); // false (definitely not in set)

Serialization

const filter = new BloomFilter(1000);
filter.add('secret-key');

// Export to JSON
const data = filter.toJSON();

// Restore from JSON
const restoredFilter = BloomFilter.fromJSON(data);
console.log(restoredFilter.has('secret-key')); // true

How it Works

A Bloom filter is a space-efficient probabilistic data structure used to test whether an element is a member of a set.

  • False Negatives: Impossible.
  • False Positives: Possible, but the rate can be controlled.

This implementation uses the Kirsch-Mitzenmacher optimization to generate multiple hash values from two base hashes, reducing the computational overhead.

API

new BloomFilter(expectedItems: number, falsePositiveRate?: number)

  • expectedItems: The number of items you expect to add.
  • falsePositiveRate: (Default: 0.01) The desired probability of false positives.

add(item: string): void

Adds a string to the filter.

has(item: string): boolean

Returns false if the item is definitely not in the set, and true if it might be.

toJSON()

Returns a serializable representation of the filter.

static fromJSON(data: any): BloomFilter

Creates a new filter instance from a serialized state.

License

MIT