distillate 0.13.0 → 0.14.1

package/README.md

@@ -42,20 +42,22 @@ Every push runs a CI smoke matrix that imports the built package on Node 22/24,
 
 Each structure ships as its own subpath, so you only bundle what you import.
 
-| Import                | Structure      | Answers            | Use for                                                  |
-| --------------------- | -------------- | ------------------ | -------------------------------------------------------- |
-| `distillate/bloom`    | Classic Bloom  | seen this key?     | Familiar default, migration from `bloom-filters`         |
-| `distillate/scalable` | Scalable Bloom | seen this key?     | Key count unknown or growing; keeps its FPR bound        |
-| `distillate/blocked`  | Blocked Bloom  | seen this key?     | Faster lookups and a lower FPR for a small space premium |
-| `distillate/fuse`     | Binary Fuse    | seen this key?     | Static set built once and queried a lot; least space     |
-| `distillate/cuckoo`   | Cuckoo         | seen this key?     | Keys come and go; the one filter with delete             |
-| `distillate/hll`      | HyperLogLog    | how many distinct? | Counting distinct users, IPs, or keys in fixed space     |
-| `distillate/countmin` | Count-Min      | how many times?    | Counting events per key in fixed space                   |
+| Import                | Structure      | Answers             | Use for                                                  |
+| --------------------- | -------------- | ------------------- | -------------------------------------------------------- |
+| `distillate/bloom`    | Classic Bloom  | seen this key?      | Familiar default, migration from `bloom-filters`         |
+| `distillate/scalable` | Scalable Bloom | seen this key?      | Key count unknown or growing; keeps its FPR bound        |
+| `distillate/blocked`  | Blocked Bloom  | seen this key?      | Faster lookups and a lower FPR for a small space premium |
+| `distillate/fuse`     | Binary Fuse    | seen this key?      | Static set built once and queried a lot; least space     |
+| `distillate/cuckoo`   | Cuckoo         | seen this key?      | Keys come and go; the one filter with delete             |
+| `distillate/hll`      | HyperLogLog    | how many distinct?  | Counting distinct users, IPs, or keys in fixed space     |
+| `distillate/countmin` | Count-Min      | how many times?     | Counting events per key in fixed space                   |
+| `distillate/topk`     | Top-K          | which are heaviest? | Finding the most frequent keys in fixed space            |
 
 The filters are mutable except Binary Fuse, which is built once from the whole
-key set. HyperLogLog and Count-Min are sketches rather than filters: neither
-reports whether it saw any particular key. HyperLogLog counts distinct keys,
-Count-Min counts how often each key appeared.
+key set. HyperLogLog, Count-Min and Top-K are sketches rather than filters:
+none reports whether it saw any particular key. HyperLogLog counts distinct
+keys, Count-Min counts how often each key appeared, and Top-K reports which
+keys appeared most.
 
 ### Classic Bloom (`distillate/bloom`)
 
@@ -189,6 +191,30 @@ hits.union(other).count("/login"); // 7
 
 Also: `equals`, `toBytes` / `fromBytes`, `toJSON` / `fromJSON`, `error()`, `epsilon`, `delta`, `width`, `depth`, `countMinSizing(epsilon, delta)`, and a low-level `new CountMinSketch({ width, depth, seed })`.
 
+### Top-K (`distillate/topk`)
+
+A **sketch** that lists the keys seen most often, in a table fixed by the error you ask for rather than by how many keys arrive. A key it holds never reads below its true count, and any key heavier than `error()` is guaranteed to be held. Full API and the bound: [Top-K guide](https://distillate.akxp.net/guides/topk/).
+
+```ts
+import { TopK } from "distillate/topk";
+
+const routes = TopK.create(0.01); // error factor
+routes.add("/login", 5);
+routes.add("/signup", 2);
+routes.add("/about");
+
+const decoder = new TextDecoder();
+routes
+  .top(2)
+  .map((e) => decoder.decode(e.key))
+  .join(); // "/login,/signup"
+routes.count("/login"); // 5
+```
+
+Keys come back as `Uint8Array`, exactly as recorded, so a serialized Top-K sketch holds your keys verbatim, unlike every other frame here. `union` combines sketches soundly but, unlike Count-Min's, not byte for byte as one sketch fed both streams.
+
+Also: `equals`, `toBytes` / `fromBytes`, `toJSON` / `fromJSON`, `total`, `error()`, `epsilon`, `capacity`, `topKSizing(epsilon)`, and a low-level `new TopK({ capacity, seed })`.
+
 ## Performance
 
 Classic Bloom head-to-head at a **matched 1% false-positive rate** over the same 100k keys, measured by identical code (cross-library harness, node v24.14.1, Apple M5):

package/dist/blocked/index.cjs

@@ -1,5 +1,5 @@
 Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
-const require_hasher = require("../hasher-MhY7aQ8F.cjs");
+const require_hasher = require("../hasher-DPXmP7SH.cjs");
 const require_serialize = require("../serialize-CHikZ4GH.cjs");
 const require_params = require("../params-UTZbJ22c.cjs");
 //#region src/blocked/blocked.ts

package/dist/blocked/index.js

@@ -1,4 +1,4 @@
-import { a as hash32x2Into, u as reduce } from "../hasher-3Cyn7Yg-.js";
+import { a as hash32x2Into, u as reduce } from "../hasher-DOdmZ-LI.js";
 import { a as TruncatedError, c as assertBodyLength, d as bytesEqual, f as fromJSONEnvelope, g as writeFrame, h as toJSONEnvelope, i as SerializationError, l as assertMinBodyLength, m as readHeader, n as ChecksumError, o as UnknownHashVariantError, r as ReservedBitsError, s as UnknownVersionError, t as BadMagicError, u as assertParamsPadding } from "../serialize-CMSYFym-.js";
 import { i as assertProbability, n as assertPositiveFinite, o as assertUint32, r as assertPositiveInt, t as ParamError } from "../params-CeajSrwv.js";
 //#region src/blocked/blocked.ts

package/dist/bloom/index.cjs

@@ -1,9 +1,8 @@
 Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
-const require_bitset = require("../bitset-QYGqxnEf.cjs");
-const require_hasher = require("../hasher-MhY7aQ8F.cjs");
+const require_sizing = require("../sizing-Ch0SDdza.cjs");
+const require_hasher = require("../hasher-DPXmP7SH.cjs");
 const require_serialize = require("../serialize-CHikZ4GH.cjs");
 const require_params = require("../params-UTZbJ22c.cjs");
-const require_sizing = require("../sizing-R1pwbzjC.cjs");
 //#region src/bloom/bloom.ts
 const TYPE = 1;
 const PARAMS_SIZE = 16;
@@ -64,7 +63,7 @@ var BloomFilter = class BloomFilter {
 			require_params.assertPositiveInt(n, "n");
 			require_params.assertUint32(n, "n");
 		}
-		this.#bits = new require_bitset.BitSet(m);
+		this.#bits = new require_sizing.BitSet(m);
 		this.#m = m;
 		this.#k = k;
 		this.#seed = seed;

package/dist/bloom/index.d.cts

@@ -1,7 +1,6 @@
 import { t as BytesLike } from "../bytes-DCuYtUVS.cjs";
 import { a as ReservedBitsError, c as UnknownHashVariantError, l as UnknownVersionError, n as ChecksumError, o as SerializationError, r as FilterJSON, s as TruncatedError, t as BadMagicError } from "../serialize--xR6vGSW.cjs";
 import { t as ParamError } from "../params-DnqJBqLS.cjs";
-import { i as bloomSizing, t as BloomSizing } from "../sizing-BmKfHf_V.cjs";
 //#region src/bloom/bloom.d.ts
 /** Thrown when an operation requires two filters built with identical parameters. */
 export declare class BloomParamMismatchError extends Error {
@@ -144,4 +143,15 @@ export declare class BloomFilter {
   has(key: BytesLike): boolean;
 }
 //#endregion
-export { BadMagicError, type BloomParams, type BloomSizing, ChecksumError, type FilterJSON, ParamError, ReservedBitsError, SerializationError, TruncatedError, UnknownHashVariantError, UnknownVersionError, bloomSizing };
+//#region src/core/sizing.d.ts
+/** Bloom filter geometry: the `BloomParams` fields a sizing solve determines. */
+interface BloomSizing {
+  /** Number of bits in the filter. */
+  m: number;
+  /** Number of hash probes per key. */
+  k: number;
+}
+/** Optimal Bloom-filter sizing: `m` bits and `k` hashes for `n` items at target FPR `epsilon`. */
+export declare function bloomSizing(n: number, epsilon: number): BloomSizing;
+//#endregion
+export { BadMagicError, type BloomParams, type BloomSizing, ChecksumError, type FilterJSON, ParamError, ReservedBitsError, SerializationError, TruncatedError, UnknownHashVariantError, UnknownVersionError };

package/dist/bloom/index.d.ts

@@ -1,7 +1,6 @@
 import { t as BytesLike } from "../bytes-DCuYtUVS.js";
 import { a as ReservedBitsError, c as UnknownHashVariantError, l as UnknownVersionError, n as ChecksumError, o as SerializationError, r as FilterJSON, s as TruncatedError, t as BadMagicError } from "../serialize--xR6vGSW.js";
 import { t as ParamError } from "../params-DnqJBqLS.js";
-import { i as bloomSizing, t as BloomSizing } from "../sizing-BmKfHf_V.js";
 //#region src/bloom/bloom.d.ts
 /** Thrown when an operation requires two filters built with identical parameters. */
 export declare class BloomParamMismatchError extends Error {
@@ -144,4 +143,15 @@ export declare class BloomFilter {
   has(key: BytesLike): boolean;
 }
 //#endregion
-export { BadMagicError, type BloomParams, type BloomSizing, ChecksumError, type FilterJSON, ParamError, ReservedBitsError, SerializationError, TruncatedError, UnknownHashVariantError, UnknownVersionError, bloomSizing };
+//#region src/core/sizing.d.ts
+/** Bloom filter geometry: the `BloomParams` fields a sizing solve determines. */
+interface BloomSizing {
+  /** Number of bits in the filter. */
+  m: number;
+  /** Number of hash probes per key. */
+  k: number;
+}
+/** Optimal Bloom-filter sizing: `m` bits and `k` hashes for `n` items at target FPR `epsilon`. */
+export declare function bloomSizing(n: number, epsilon: number): BloomSizing;
+//#endregion
+export { BadMagicError, type BloomParams, type BloomSizing, ChecksumError, type FilterJSON, ParamError, ReservedBitsError, SerializationError, TruncatedError, UnknownHashVariantError, UnknownVersionError };

package/dist/bloom/index.js

@@ -1,8 +1,7 @@
-import { t as BitSet } from "../bitset-Cf2jwRJX.js";
-import { c as probeInto } from "../hasher-3Cyn7Yg-.js";
+import { n as BitSet, t as bloomSizing } from "../sizing-zxCBlyhO.js";
+import { c as probeInto } from "../hasher-DOdmZ-LI.js";
 import { a as TruncatedError, c as assertBodyLength, d as bytesEqual, f as fromJSONEnvelope, g as writeFrame, h as toJSONEnvelope, i as SerializationError, l as assertMinBodyLength, m as readHeader, n as ChecksumError, o as UnknownHashVariantError, r as ReservedBitsError, s as UnknownVersionError, t as BadMagicError, u as assertParamsPadding } from "../serialize-CMSYFym-.js";
 import { a as assertUint16, i as assertProbability, o as assertUint32, r as assertPositiveInt, t as ParamError } from "../params-CeajSrwv.js";
-import { t as bloomSizing } from "../sizing-D3-_7pdP.js";
 //#region src/bloom/bloom.ts
 const TYPE = 1;
 const PARAMS_SIZE = 16;

package/dist/bytes-Be7tq1F7.js

@@ -0,0 +1,9 @@
+//#region src/core/bytes.ts
+const encoder = new TextEncoder();
+function normalize(input) {
+	if (typeof input === "string") return encoder.encode(input);
+	if (input instanceof Uint8Array) return input;
+	return new Uint8Array(input);
+}
+//#endregion
+export { normalize as t };

package/dist/bytes-D2duG1jq.cjs

@@ -0,0 +1,14 @@
+//#region src/core/bytes.ts
+const encoder = new TextEncoder();
+function normalize(input) {
+	if (typeof input === "string") return encoder.encode(input);
+	if (input instanceof Uint8Array) return input;
+	return new Uint8Array(input);
+}
+//#endregion
+Object.defineProperty(exports, "normalize", {
+	enumerable: true,
+	get: function() {
+		return normalize;
+	}
+});

package/dist/countmin/index.cjs

@@ -1,8 +1,17 @@
 Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
-const require_hasher = require("../hasher-MhY7aQ8F.cjs");
+const require_hasher = require("../hasher-DPXmP7SH.cjs");
 const require_serialize = require("../serialize-CHikZ4GH.cjs");
 const require_params = require("../params-UTZbJ22c.cjs");
-const require_sizing = require("../sizing-R1pwbzjC.cjs");
+//#region src/countmin/sizing.ts
+function countMinSizing(epsilon, delta) {
+	require_params.assertProbability(epsilon, "epsilon");
+	require_params.assertProbability(delta, "delta");
+	return {
+		width: Math.ceil(Math.E / epsilon),
+		depth: Math.ceil(Math.log(1 / delta))
+	};
+}
+//#endregion
 //#region src/countmin/countmin.ts
 const TYPE = 8;
 const PARAMS_SIZE = 16;
@@ -37,7 +46,7 @@ var CountMinSketch = class CountMinSketch {
 	static create(epsilon, delta, options = {}) {
 		return new CountMinSketch({
 			...options,
-			...require_sizing.countMinSizing(epsilon, delta)
+			...countMinSizing(epsilon, delta)
 		});
 	}
 	static from(keys, epsilon, delta, options = {}) {
@@ -191,4 +200,4 @@ exports.SerializationError = require_serialize.SerializationError;
 exports.TruncatedError = require_serialize.TruncatedError;
 exports.UnknownHashVariantError = require_serialize.UnknownHashVariantError;
 exports.UnknownVersionError = require_serialize.UnknownVersionError;
-exports.countMinSizing = require_sizing.countMinSizing;
+exports.countMinSizing = countMinSizing;

package/dist/countmin/index.d.cts

@@ -1,7 +1,6 @@
 import { t as BytesLike } from "../bytes-DCuYtUVS.cjs";
 import { a as ReservedBitsError, c as UnknownHashVariantError, l as UnknownVersionError, n as ChecksumError, o as SerializationError, r as FilterJSON, s as TruncatedError, t as BadMagicError } from "../serialize--xR6vGSW.cjs";
 import { t as ParamError } from "../params-DnqJBqLS.cjs";
-import { a as countMinSizing, n as CountMinSizing } from "../sizing-BmKfHf_V.cjs";
 //#region src/countmin/countmin.d.ts
 /** Thrown when an operation requires two sketches built with identical parameters. */
 export declare class CountMinParamMismatchError extends Error {
@@ -175,4 +174,18 @@ export declare class CountMinSketch {
   count(key: BytesLike): number;
 }
 //#endregion
-export { BadMagicError, ChecksumError, type CountMinOptions, type CountMinParams, type CountMinSizing, type FilterJSON, ParamError, ReservedBitsError, SerializationError, TruncatedError, UnknownHashVariantError, UnknownVersionError, countMinSizing };
+//#region src/countmin/sizing.d.ts
+/** Count-Min geometry: the `CountMinParams` fields a sizing solve determines. */
+interface CountMinSizing {
+  /** Counters per row. */
+  width: number;
+  /** Number of rows, one probe each. */
+  depth: number;
+}
+/**
+ * Count-Min sizing: `width` columns and `depth` rows for an estimate at most
+ * `epsilon * total` above the true count, with probability `1 - delta`.
+ */
+export declare function countMinSizing(epsilon: number, delta: number): CountMinSizing;
+//#endregion
+export { BadMagicError, ChecksumError, type CountMinOptions, type CountMinParams, type CountMinSizing, type FilterJSON, ParamError, ReservedBitsError, SerializationError, TruncatedError, UnknownHashVariantError, UnknownVersionError };

package/dist/countmin/index.d.ts

@@ -1,7 +1,6 @@
 import { t as BytesLike } from "../bytes-DCuYtUVS.js";
 import { a as ReservedBitsError, c as UnknownHashVariantError, l as UnknownVersionError, n as ChecksumError, o as SerializationError, r as FilterJSON, s as TruncatedError, t as BadMagicError } from "../serialize--xR6vGSW.js";
 import { t as ParamError } from "../params-DnqJBqLS.js";
-import { a as countMinSizing, n as CountMinSizing } from "../sizing-BmKfHf_V.js";
 //#region src/countmin/countmin.d.ts
 /** Thrown when an operation requires two sketches built with identical parameters. */
 export declare class CountMinParamMismatchError extends Error {
@@ -175,4 +174,18 @@ export declare class CountMinSketch {
   count(key: BytesLike): number;
 }
 //#endregion
-export { BadMagicError, ChecksumError, type CountMinOptions, type CountMinParams, type CountMinSizing, type FilterJSON, ParamError, ReservedBitsError, SerializationError, TruncatedError, UnknownHashVariantError, UnknownVersionError, countMinSizing };
+//#region src/countmin/sizing.d.ts
+/** Count-Min geometry: the `CountMinParams` fields a sizing solve determines. */
+interface CountMinSizing {
+  /** Counters per row. */
+  width: number;
+  /** Number of rows, one probe each. */
+  depth: number;
+}
+/**
+ * Count-Min sizing: `width` columns and `depth` rows for an estimate at most
+ * `epsilon * total` above the true count, with probability `1 - delta`.
+ */
+export declare function countMinSizing(epsilon: number, delta: number): CountMinSizing;
+//#endregion
+export { BadMagicError, ChecksumError, type CountMinOptions, type CountMinParams, type CountMinSizing, type FilterJSON, ParamError, ReservedBitsError, SerializationError, TruncatedError, UnknownHashVariantError, UnknownVersionError };

package/dist/countmin/index.js

@@ -1,7 +1,16 @@
-import { a as hash32x2Into, s as probeAt } from "../hasher-3Cyn7Yg-.js";
+import { a as hash32x2Into, s as probeAt } from "../hasher-DOdmZ-LI.js";
 import { a as TruncatedError, c as assertBodyLength, d as bytesEqual, f as fromJSONEnvelope, g as writeFrame, h as toJSONEnvelope, i as SerializationError, l as assertMinBodyLength, m as readHeader, n as ChecksumError, o as UnknownHashVariantError, r as ReservedBitsError, s as UnknownVersionError, t as BadMagicError, u as assertParamsPadding } from "../serialize-CMSYFym-.js";
-import { o as assertUint32, r as assertPositiveInt, t as ParamError } from "../params-CeajSrwv.js";
-import { n as countMinSizing } from "../sizing-D3-_7pdP.js";
+import { i as assertProbability, o as assertUint32, r as assertPositiveInt, t as ParamError } from "../params-CeajSrwv.js";
+//#region src/countmin/sizing.ts
+function countMinSizing(epsilon, delta) {
+	assertProbability(epsilon, "epsilon");
+	assertProbability(delta, "delta");
+	return {
+		width: Math.ceil(Math.E / epsilon),
+		depth: Math.ceil(Math.log(1 / delta))
+	};
+}
+//#endregion
 //#region src/countmin/countmin.ts
 const TYPE = 8;
 const PARAMS_SIZE = 16;

package/dist/cuckoo/index.cjs

@@ -1,7 +1,8 @@
 Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
-const require_hasher = require("../hasher-MhY7aQ8F.cjs");
+const require_hasher = require("../hasher-DPXmP7SH.cjs");
 const require_serialize = require("../serialize-CHikZ4GH.cjs");
 const require_params = require("../params-UTZbJ22c.cjs");
+const require_distinct = require("../distinct-Ck5PKuCS.cjs");
 function cuckooSizing(n, epsilon) {
 	require_params.assertProbability(epsilon, "epsilon");
 	const f = Math.max(4, Math.ceil(Math.log2(8 / epsilon)));
@@ -54,17 +55,21 @@ var CuckooFilter = class CuckooFilter {
 		});
 	}
 	static from(keys, epsilon, options = {}) {
-		const seen = new Set();
-		const distinct = [];
+		const distinct = new require_distinct.DistinctHashes(4);
 		for (const key of keys) {
 			require_hasher.hash128KeyInto(key, options.seed ?? 0, HASH);
-			const id = `${String(HASH.w0)},${String(HASH.w1)},${String(HASH.w2)},${String(HASH.w3)}`;
-			if (seen.has(id)) continue;
-			seen.add(id);
-			distinct.push(key);
+			distinct.add(HASH);
+		}
+		const f = CuckooFilter.create(Math.max(1, distinct.size), epsilon, options);
+		const words = distinct.words;
+		for (let at = 0; at < words.length; at += 4) {
+			HASH.w0 = words[at] ?? 0;
+			HASH.w1 = words[at + 1] ?? 0;
+			HASH.w2 = words[at + 2] ?? 0;
+			HASH.w3 = words[at + 3] ?? 0;
+			f.#derive();
+			f.#insert();
 		}
-		const f = CuckooFilter.create(Math.max(1, distinct.length), epsilon, options);
-		for (const k of distinct) f.add(k);
 		return f;
 	}
 	static fromBytes(bytes) {
@@ -134,6 +139,9 @@ var CuckooFilter = class CuckooFilter {
 	}
 	add(key) {
 		this.#hash(key);
+		this.#insert();
+	}
+	#insert() {
 		if (this.#replace(this.#i1, 0, this.#fp) || this.#replace(this.#i2, 0, this.#fp)) {
 			this.#count++;
 			return;
@@ -202,6 +210,9 @@ var CuckooFilter = class CuckooFilter {
 	}
 	#hash(key) {
 		require_hasher.hash128KeyInto(key, this.#seed, HASH);
+		this.#derive();
+	}
+	#derive() {
 		this.#fp = HASH.w1 >>> 32 - this.#f || 1;
 		this.#i1 = require_hasher.reduce(HASH.w0, this.#buckets);
 		this.#i2 = this.#alt(this.#i1, this.#fp);

package/dist/cuckoo/index.js

@@ -1,6 +1,7 @@
-import { i as hash128KeyInto, u as reduce } from "../hasher-3Cyn7Yg-.js";
+import { i as hash128KeyInto, u as reduce } from "../hasher-DOdmZ-LI.js";
 import { a as TruncatedError, c as assertBodyLength, d as bytesEqual, f as fromJSONEnvelope, g as writeFrame, h as toJSONEnvelope, i as SerializationError, l as assertMinBodyLength, m as readHeader, n as ChecksumError, o as UnknownHashVariantError, r as ReservedBitsError, s as UnknownVersionError, t as BadMagicError, u as assertParamsPadding } from "../serialize-CMSYFym-.js";
 import { i as assertProbability, o as assertUint32, r as assertPositiveInt, t as ParamError } from "../params-CeajSrwv.js";
+import { t as DistinctHashes } from "../distinct-BhxDB8mW.js";
 function cuckooSizing(n, epsilon) {
 	assertProbability(epsilon, "epsilon");
 	const f = Math.max(4, Math.ceil(Math.log2(8 / epsilon)));
@@ -53,17 +54,21 @@ var CuckooFilter = class CuckooFilter {
 		});
 	}
 	static from(keys, epsilon, options = {}) {
-		const seen = new Set();
-		const distinct = [];
+		const distinct = new DistinctHashes(4);
 		for (const key of keys) {
 			hash128KeyInto(key, options.seed ?? 0, HASH);
-			const id = `${String(HASH.w0)},${String(HASH.w1)},${String(HASH.w2)},${String(HASH.w3)}`;
-			if (seen.has(id)) continue;
-			seen.add(id);
-			distinct.push(key);
+			distinct.add(HASH);
+		}
+		const f = CuckooFilter.create(Math.max(1, distinct.size), epsilon, options);
+		const words = distinct.words;
+		for (let at = 0; at < words.length; at += 4) {
+			HASH.w0 = words[at] ?? 0;
+			HASH.w1 = words[at + 1] ?? 0;
+			HASH.w2 = words[at + 2] ?? 0;
+			HASH.w3 = words[at + 3] ?? 0;
+			f.#derive();
+			f.#insert();
 		}
-		const f = CuckooFilter.create(Math.max(1, distinct.length), epsilon, options);
-		for (const k of distinct) f.add(k);
 		return f;
 	}
 	static fromBytes(bytes) {
@@ -133,6 +138,9 @@ var CuckooFilter = class CuckooFilter {
 	}
 	add(key) {
 		this.#hash(key);
+		this.#insert();
+	}
+	#insert() {
 		if (this.#replace(this.#i1, 0, this.#fp) || this.#replace(this.#i2, 0, this.#fp)) {
 			this.#count++;
 			return;
@@ -201,6 +209,9 @@ var CuckooFilter = class CuckooFilter {
 	}
 	#hash(key) {
 		hash128KeyInto(key, this.#seed, HASH);
+		this.#derive();
+	}
+	#derive() {
 		this.#fp = HASH.w1 >>> 32 - this.#f || 1;
 		this.#i1 = reduce(HASH.w0, this.#buckets);
 		this.#i2 = this.#alt(this.#i1, this.#fp);

package/dist/distinct-BhxDB8mW.js

@@ -0,0 +1,61 @@
+//#region src/core/distinct.ts
+const START = 1024;
+var DistinctHashes = class {
+	#width;
+	#words;
+	#table = new Int32Array(2 * START);
+	#size = 0;
+	constructor(width) {
+		this.#width = width;
+		this.#words = new Uint32Array(START * width);
+	}
+	get size() {
+		return this.#size;
+	}
+	get words() {
+		return this.#words.subarray(0, this.#size * this.#width);
+	}
+	add(hash) {
+		const width = this.#width;
+		const w0 = hash.w0 >>> 0;
+		const w1 = hash.w1 >>> 0;
+		const w2 = hash.w2 >>> 0;
+		const w3 = hash.w3 >>> 0;
+		if ((this.#size + 1) * width > this.#words.length) this.#grow();
+		const words = this.#words;
+		const mask = this.#table.length - 1;
+		let slot = w0 & mask;
+		for (;;) {
+			const held = this.#table[slot] ?? 0;
+			if (held === 0) break;
+			const at = (held - 1) * width;
+			if (words[at] === w0 && words[at + 1] === w1 && (width === 2 || words[at + 2] === w2 && words[at + 3] === w3)) return false;
+			slot = slot + 1 & mask;
+		}
+		const at = this.#size * width;
+		words[at] = w0;
+		words[at + 1] = w1;
+		if (width === 4) {
+			words[at + 2] = w2;
+			words[at + 3] = w3;
+		}
+		this.#size++;
+		this.#table[slot] = this.#size;
+		return true;
+	}
+	#grow() {
+		const words = new Uint32Array(this.#words.length * 2);
+		words.set(this.#words);
+		this.#words = words;
+		this.#table = new Int32Array(this.#table.length * 2);
+		for (let i = 0; i < this.#size; i++) this.#place(i);
+	}
+	#place(i) {
+		const mask = this.#table.length - 1;
+		let slot = (this.#words[i * this.#width] ?? 0) & mask;
+		while ((this.#table[slot] ?? 0) !== 0) slot = slot + 1 & mask;
+		this.#table[slot] = i + 1;
+	}
+};
+//#endregion
+export { DistinctHashes as t };

package/dist/distinct-Ck5PKuCS.cjs

@@ -0,0 +1,66 @@
+//#region src/core/distinct.ts
+const START = 1024;
+var DistinctHashes = class {
+	#width;
+	#words;
+	#table = new Int32Array(2 * START);
+	#size = 0;
+	constructor(width) {
+		this.#width = width;
+		this.#words = new Uint32Array(START * width);
+	}
+	get size() {
+		return this.#size;
+	}
+	get words() {
+		return this.#words.subarray(0, this.#size * this.#width);
+	}
+	add(hash) {
+		const width = this.#width;
+		const w0 = hash.w0 >>> 0;
+		const w1 = hash.w1 >>> 0;
+		const w2 = hash.w2 >>> 0;
+		const w3 = hash.w3 >>> 0;
+		if ((this.#size + 1) * width > this.#words.length) this.#grow();
+		const words = this.#words;
+		const mask = this.#table.length - 1;
+		let slot = w0 & mask;
+		for (;;) {
+			const held = this.#table[slot] ?? 0;
+			if (held === 0) break;
+			const at = (held - 1) * width;
+			if (words[at] === w0 && words[at + 1] === w1 && (width === 2 || words[at + 2] === w2 && words[at + 3] === w3)) return false;
+			slot = slot + 1 & mask;
+		}
+		const at = this.#size * width;
+		words[at] = w0;
+		words[at + 1] = w1;
+		if (width === 4) {
+			words[at + 2] = w2;
+			words[at + 3] = w3;
+		}
+		this.#size++;
+		this.#table[slot] = this.#size;
+		return true;
+	}
+	#grow() {
+		const words = new Uint32Array(this.#words.length * 2);
+		words.set(this.#words);
+		this.#words = words;
+		this.#table = new Int32Array(this.#table.length * 2);
+		for (let i = 0; i < this.#size; i++) this.#place(i);
+	}
+	#place(i) {
+		const mask = this.#table.length - 1;
+		let slot = (this.#words[i * this.#width] ?? 0) & mask;
+		while ((this.#table[slot] ?? 0) !== 0) slot = slot + 1 & mask;
+		this.#table[slot] = i + 1;
+	}
+};
+//#endregion
+Object.defineProperty(exports, "DistinctHashes", {
+	enumerable: true,
+	get: function() {
+		return DistinctHashes;
+	}
+});

package/dist/fuse/index.cjs

@@ -1,6 +1,7 @@
 Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
-const require_hasher = require("../hasher-MhY7aQ8F.cjs");
+const require_hasher = require("../hasher-DPXmP7SH.cjs");
 const require_serialize = require("../serialize-CHikZ4GH.cjs");
+const require_distinct = require("../distinct-Ck5PKuCS.cjs");
 //#region src/fuse/fuse.ts
 const ARITY = 3;
 const TYPE_FUSE8 = 3;
@@ -131,18 +132,12 @@ function buildFingerprints(fp, hashes, params, maxAttempts = 100) {
 	throw new BinaryFuseBuildError("binary fuse construction failed");
 }
 function buildState(keys, alloc) {
-	const hashList = [];
-	const seen = new Set();
+	const distinct = new require_distinct.DistinctHashes(2);
 	for (const key of keys) {
 		require_hasher.hash128KeyInto(key, 0, scratchHash);
-		const lo = scratchHash.w0 >>> 0;
-		const hi = scratchHash.w1 >>> 0;
-		const id = `${String(lo)},${String(hi)}`;
-		if (seen.has(id)) continue;
-		seen.add(id);
-		hashList.push(lo, hi);
+		distinct.add(scratchHash);
 	}
-	const size = hashList.length / 2;
+	const size = distinct.size;
 	const params = computeParams(size);
 	if (size === 0) return {
 		fp: alloc(0),
@@ -150,7 +145,7 @@ function buildState(keys, alloc) {
 		params,
 		size: 0
 	};
-	const hashes = Uint32Array.from(hashList);
+	const hashes = distinct.words;
 	const fp = alloc(params.arrayLength);
 	return {
 		fp,

package/dist/fuse/index.js

@@ -1,5 +1,6 @@
-import { i as hash128KeyInto, n as RLO, o as mul64, r as fmix64, t as RHI } from "../hasher-3Cyn7Yg-.js";
+import { i as hash128KeyInto, n as RLO, o as mul64, r as fmix64, t as RHI } from "../hasher-DOdmZ-LI.js";
 import { a as TruncatedError, c as assertBodyLength, d as bytesEqual, f as fromJSONEnvelope, g as writeFrame, h as toJSONEnvelope, i as SerializationError, l as assertMinBodyLength, m as readHeader, n as ChecksumError, o as UnknownHashVariantError, r as ReservedBitsError, s as UnknownVersionError, t as BadMagicError } from "../serialize-CMSYFym-.js";
+import { t as DistinctHashes } from "../distinct-BhxDB8mW.js";
 //#region src/fuse/fuse.ts
 const ARITY = 3;
 const TYPE_FUSE8 = 3;
@@ -130,18 +131,12 @@ function buildFingerprints(fp, hashes, params, maxAttempts = 100) {
 	throw new BinaryFuseBuildError("binary fuse construction failed");
 }
 function buildState(keys, alloc) {
-	const hashList = [];
-	const seen = new Set();
+	const distinct = new DistinctHashes(2);
 	for (const key of keys) {
 		hash128KeyInto(key, 0, scratchHash);
-		const lo = scratchHash.w0 >>> 0;
-		const hi = scratchHash.w1 >>> 0;
-		const id = `${String(lo)},${String(hi)}`;
-		if (seen.has(id)) continue;
-		seen.add(id);
-		hashList.push(lo, hi);
+		distinct.add(scratchHash);
 	}
-	const size = hashList.length / 2;
+	const size = distinct.size;
 	const params = computeParams(size);
 	if (size === 0) return {
 		fp: alloc(0),
@@ -149,7 +144,7 @@ function buildState(keys, alloc) {
 		params,
 		size: 0
 	};
-	const hashes = Uint32Array.from(hashList);
+	const hashes = distinct.words;
 	const fp = alloc(params.arrayLength);
 	return {
 		fp,

package/dist/{hasher-3Cyn7Yg-.js → hasher-DOdmZ-LI.js}

@@ -1,11 +1,4 @@
-//#region src/core/bytes.ts
-const encoder = new TextEncoder();
-function normalize(input) {
-	if (typeof input === "string") return encoder.encode(input);
-	if (input instanceof Uint8Array) return input;
-	return new Uint8Array(input);
-}
-//#endregion
+import { t as normalize } from "./bytes-Be7tq1F7.js";
 //#region src/core/hasher.ts
 let RLO = 0;
 let RHI = 0;