distillate 0.4.0 → 0.5.0

package/README.md

@@ -43,7 +43,7 @@ Each structure ships as its own subpath, so you only bundle what you import.
 | Import               | Structure     | Mutable? | Use for                                              |
 | -------------------- | ------------- | -------- | ---------------------------------------------------- |
 | `distillate/bloom`   | Classic Bloom | yes      | Familiar default, migration from `bloom-filters`     |
-| `distillate/blocked` | Blocked Bloom | yes      | Streaming inserts, speed-first, cache-friendly       |
+| `distillate/blocked` | Blocked Bloom | yes      | Very large sets that outgrow CPU cache (10M+ keys)   |
 | `distillate/fuse`    | Binary Fuse   | no       | Static set built once and queried a lot; least space |
 
 ### Classic Bloom (`distillate/bloom`)
@@ -72,7 +72,7 @@ filter.add("alice");
 filter.has("alice"); // true
 ```
 
-Same surface as Classic Bloom (`add` / `has` / `union` / `toBytes` / `fromBytes` / `bitsPerKey`). Confines every lookup to one cache line, trading ~20-30% more space for cache-friendly throughput.
+Same surface as Classic Bloom (`add` / `has` / `union` / `toBytes` / `fromBytes` / `bitsPerKey`). Confines every lookup to a single cache line, which only pays off once the filter outgrows CPU cache. At typical sizes it matches Classic; for very large sets (tens of millions of keys, past L2/L3) it runs about 1.4x Classic's lookup throughput, at the cost of ~20-30% more space. Prefer Classic unless you are memory-bound at scale.
 
 ### Binary Fuse (`distillate/fuse`)
 
@@ -98,10 +98,10 @@ Classic Bloom head-to-head at a **matched 1% false-positive rate** over the same
 
 | Classic Bloom  | bits/key | measured FPR | `has` throughput |
 | -------------- | -------- | ------------ | ---------------- |
-| **distillate** | 9.59     | 1.03%        | ~7.0 M ops/s     |
+| **distillate** | 9.59     | 1.03%        | ~16 M ops/s      |
 | bloom-filters  | 9.59     | 0.99%        | ~0.29 M ops/s    |
 
-Same space, same accuracy, **~24x the lookup throughput** of [`bloom-filters`](https://www.npmjs.com/package/bloom-filters) (the package distillate replaces), while hashing UTF-8 bytes with MurmurHash3 so filters stay portable and cross-language readable.
+Same space, same accuracy, **~56x the lookup throughput** of [`bloom-filters`](https://www.npmjs.com/package/bloom-filters) (the package distillate replaces), while hashing UTF-8 bytes with MurmurHash3 so filters stay portable and cross-language readable.
 
 These are a point-in-time snapshot on one machine. The full report (blocked/fuse, 1M capacity, the `bloomfilter` micro-package) and exactly how it is measured live in the [distillate-bench](https://github.com/akshay-xp/distillate-bench) repo: [RESULTS.md](https://github.com/akshay-xp/distillate-bench/blob/main/RESULTS.md), [METHODOLOGY.md](https://github.com/akshay-xp/distillate-bench/blob/main/METHODOLOGY.md).
 

package/dist/blocked/index.cjs

@@ -1,15 +1,10 @@
 Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
-const require_serialize = require("../serialize-DPdiySxq.cjs");
+const require_serialize = require("../serialize-fa-pEUGq.cjs");
 const require_params = require("../params-J8p3bKq5.cjs");
 //#region src/blocked/blocked.ts
 const TYPE = 2;
 const SALT = Uint32Array.of(1203114875, 1150766481, 2284105051, 2729912477, 1884591559, 770785867, 2667333959, 1550580529);
-const scratchHash = {
-	h1lo: 0,
-	h1hi: 0,
-	h2lo: 0,
-	h2hi: 0
-};
+const scratch2 = /* @__PURE__ */ new Uint32Array(2);
 /** Thrown when an operation requires two filters built with identical parameters. */
 var BlockedBloomParamMismatchError = class extends Error {
 	/** Discriminates this error from other `Error`s. */
@@ -104,8 +99,9 @@ var BlockedBloomFilter = class BlockedBloomFilter {
 	* @returns The reconstructed filter.
 	*/
 	static fromBytes(bytes) {
-		const { type, body } = require_serialize.readHeader(bytes);
+		const { type, flags, body } = require_serialize.readHeader(bytes);
 		if (type !== TYPE) throw new require_serialize.SerializationError(`expected AMQF type ${String(TYPE)}, got ${String(type)}`);
+		if ((flags & 15) !== 1) throw new require_serialize.UnknownHashVariantError(`unsupported hash variant ${String(flags & 15)}`);
 		require_serialize.assertMinBodyLength(body.length, 12, "blocked");
 		const dv = new DataView(body.buffer, body.byteOffset, body.byteLength);
 		const numBlocks = dv.getUint32(0, true);
@@ -137,7 +133,7 @@ var BlockedBloomFilter = class BlockedBloomFilter {
 		return require_serialize.writeHeader({
 			version: 2,
 			type: TYPE,
-			flags: 0
+			flags: 1
 		}, body);
 	}
 	/**
@@ -185,9 +181,9 @@ var BlockedBloomFilter = class BlockedBloomFilter {
 	}
 };
 function fillBlock(key, numBlocks, seed, outWords, outBits) {
-	require_serialize.hash128KeyInto(key, seed, scratchHash);
-	const block = require_serialize.reduce((scratchHash.h1lo ^ scratchHash.h1hi) >>> 0, numBlocks);
-	const x = (scratchHash.h2lo ^ scratchHash.h2hi) >>> 0;
+	require_serialize.hash32x2Into(key, seed, scratch2);
+	const block = require_serialize.reduce(scratch2[0] ?? 0, numBlocks);
+	const x = scratch2[1] ?? 0;
 	const base = block * 8;
 	for (let i = 0; i < 8; i++) {
 		outWords[i] = base + i;

package/dist/blocked/index.js

@@ -1,14 +1,9 @@
-import { a as writeHeader, c as reduce, i as readHeader, n as assertBodyLength, o as hash128KeyInto, r as assertMinBodyLength, t as SerializationError } from "../serialize-DkkBKDT0.js";
+import { a as readHeader, d as hash32x2Into, i as assertMinBodyLength, m as reduce, n as UnknownHashVariantError, o as writeHeader, r as assertBodyLength, t as SerializationError } from "../serialize-BQ2UzZqq.js";
 import { a as assertUint32, i as assertProbability, n as assertPositiveFinite, r as assertPositiveInt, t as ParamError } from "../params-ChTRNxM9.js";
 //#region src/blocked/blocked.ts
 const TYPE = 2;
 const SALT = Uint32Array.of(1203114875, 1150766481, 2284105051, 2729912477, 1884591559, 770785867, 2667333959, 1550580529);
-const scratchHash = {
-	h1lo: 0,
-	h1hi: 0,
-	h2lo: 0,
-	h2hi: 0
-};
+const scratch2 = /* @__PURE__ */ new Uint32Array(2);
 /** Thrown when an operation requires two filters built with identical parameters. */
 var BlockedBloomParamMismatchError = class extends Error {
 	/** Discriminates this error from other `Error`s. */
@@ -103,8 +98,9 @@ var BlockedBloomFilter = class BlockedBloomFilter {
 	* @returns The reconstructed filter.
 	*/
 	static fromBytes(bytes) {
-		const { type, body } = readHeader(bytes);
+		const { type, flags, body } = readHeader(bytes);
 		if (type !== TYPE) throw new SerializationError(`expected AMQF type ${String(TYPE)}, got ${String(type)}`);
+		if ((flags & 15) !== 1) throw new UnknownHashVariantError(`unsupported hash variant ${String(flags & 15)}`);
 		assertMinBodyLength(body.length, 12, "blocked");
 		const dv = new DataView(body.buffer, body.byteOffset, body.byteLength);
 		const numBlocks = dv.getUint32(0, true);
@@ -136,7 +132,7 @@ var BlockedBloomFilter = class BlockedBloomFilter {
 		return writeHeader({
 			version: 2,
 			type: TYPE,
-			flags: 0
+			flags: 1
 		}, body);
 	}
 	/**
@@ -184,9 +180,9 @@ var BlockedBloomFilter = class BlockedBloomFilter {
 	}
 };
 function fillBlock(key, numBlocks, seed, outWords, outBits) {
-	hash128KeyInto(key, seed, scratchHash);
-	const block = reduce((scratchHash.h1lo ^ scratchHash.h1hi) >>> 0, numBlocks);
-	const x = (scratchHash.h2lo ^ scratchHash.h2hi) >>> 0;
+	hash32x2Into(key, seed, scratch2);
+	const block = reduce(scratch2[0] ?? 0, numBlocks);
+	const x = scratch2[1] ?? 0;
 	const base = block * 8;
 	for (let i = 0; i < 8; i++) {
 		outWords[i] = base + i;

package/dist/bloom/index.cjs

@@ -1,5 +1,5 @@
 Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
-const require_serialize = require("../serialize-DPdiySxq.cjs");
+const require_serialize = require("../serialize-fa-pEUGq.cjs");
 const require_params = require("../params-J8p3bKq5.cjs");
 //#region src/core/bitset.ts
 var BitSetRangeError = class extends RangeError {
@@ -94,8 +94,9 @@ var BloomFilter = class BloomFilter {
 	* @returns The reconstructed filter.
 	*/
 	static fromBytes(bytes) {
-		const { type, body } = require_serialize.readHeader(bytes);
+		const { type, flags, body } = require_serialize.readHeader(bytes);
 		if (type !== TYPE) throw new require_serialize.SerializationError(`expected AMQF type ${String(TYPE)}, got ${String(type)}`);
+		if ((flags & 15) !== 1) throw new require_serialize.UnknownHashVariantError(`unsupported hash variant ${String(flags & 15)}`);
 		require_serialize.assertMinBodyLength(body.length, 14, "bloom");
 		const dv = new DataView(body.buffer, body.byteOffset, body.byteLength);
 		const m = dv.getUint32(0, true);
@@ -174,7 +175,7 @@ var BloomFilter = class BloomFilter {
 		return require_serialize.writeHeader({
 			version: 2,
 			type: TYPE,
-			flags: 0
+			flags: 1
 		}, body);
 	}
 	/**

package/dist/bloom/index.js

@@ -1,4 +1,4 @@
-import { a as writeHeader, i as readHeader, n as assertBodyLength, r as assertMinBodyLength, s as probeInto, t as SerializationError } from "../serialize-DkkBKDT0.js";
+import { a as readHeader, i as assertMinBodyLength, n as UnknownHashVariantError, o as writeHeader, p as probeInto, r as assertBodyLength, t as SerializationError } from "../serialize-BQ2UzZqq.js";
 import { a as assertUint32, i as assertProbability, r as assertPositiveInt, t as ParamError } from "../params-ChTRNxM9.js";
 //#region src/core/bitset.ts
 var BitSetRangeError = class extends RangeError {
@@ -93,8 +93,9 @@ var BloomFilter = class BloomFilter {
 	* @returns The reconstructed filter.
 	*/
 	static fromBytes(bytes) {
-		const { type, body } = readHeader(bytes);
+		const { type, flags, body } = readHeader(bytes);
 		if (type !== TYPE) throw new SerializationError(`expected AMQF type ${String(TYPE)}, got ${String(type)}`);
+		if ((flags & 15) !== 1) throw new UnknownHashVariantError(`unsupported hash variant ${String(flags & 15)}`);
 		assertMinBodyLength(body.length, 14, "bloom");
 		const dv = new DataView(body.buffer, body.byteOffset, body.byteLength);
 		const m = dv.getUint32(0, true);
@@ -173,7 +174,7 @@ var BloomFilter = class BloomFilter {
 		return writeHeader({
 			version: 2,
 			type: TYPE,
-			flags: 0
+			flags: 1
 		}, body);
 	}
 	/**

package/dist/fuse/index.cjs

@@ -1,5 +1,5 @@
 Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
-const require_serialize = require("../serialize-DPdiySxq.cjs");
+const require_serialize = require("../serialize-fa-pEUGq.cjs");
 //#region src/fuse/fuse.ts
 const ARITY = 3;
 const TYPE_FUSE8 = 3;
@@ -9,71 +9,23 @@ var BinaryFuseBuildError = class extends Error {
 	/** Discriminates this error from other `Error`s. */
 	name = "BinaryFuseBuildError";
 };
-let RLO = 0;
-let RHI = 0;
 const scratchHash = {
 	h1lo: 0,
 	h1hi: 0,
 	h2lo: 0,
 	h2hi: 0
 };
-function mul64(alo, ahi, blo, bhi) {
-	const a0 = alo & 65535;
-	const a1 = alo >>> 16;
-	const a2 = ahi & 65535;
-	const a3 = ahi >>> 16;
-	const b0 = blo & 65535;
-	const b1 = blo >>> 16;
-	const b2 = bhi & 65535;
-	const b3 = bhi >>> 16;
-	let c0 = a0 * b0;
-	let c1 = c0 >>> 16;
-	c0 &= 65535;
-	c1 += a1 * b0;
-	let c2 = c1 >>> 16;
-	c1 &= 65535;
-	c1 += a0 * b1;
-	c2 += c1 >>> 16;
-	c1 &= 65535;
-	c2 += a2 * b0;
-	let c3 = c2 >>> 16;
-	c2 &= 65535;
-	c2 += a1 * b1;
-	c3 += c2 >>> 16;
-	c2 &= 65535;
-	c2 += a0 * b2;
-	c3 += c2 >>> 16;
-	c2 &= 65535;
-	c3 += a3 * b0 + a2 * b1 + a1 * b2 + a0 * b3;
-	c3 &= 65535;
-	RLO = (c1 << 16 | c0) >>> 0;
-	RHI = (c3 << 16 | c2) >>> 0;
-}
-function fmix64(lo, hi) {
-	let l = (lo ^ hi >>> 1) >>> 0;
-	let h = hi;
-	mul64(l, h, 3981806797, 4283543511);
-	l = RLO;
-	h = RHI;
-	l = (l ^ h >>> 1) >>> 0;
-	mul64(l, h, 444984403, 3301882366);
-	l = RLO;
-	h = RHI;
-	l = (l ^ h >>> 1) >>> 0;
-	RLO = l;
-	RHI = h;
-}
 function mixSeed(lo, hi, seed) {
 	const l = (lo >>> 0) + (seed >>> 0);
 	const carry = l > 4294967295 ? 1 : 0;
-	fmix64(l >>> 0, hi + carry >>> 0);
+	require_serialize.fmix64(l >>> 0, hi + carry >>> 0);
 }
 function mulhi64(lo, hi, n) {
-	mul64(hi, 0, n, 0);
-	const aLo = RLO;
-	const aHi = RHI;
-	mul64(lo, 0, n, 0);
-	const bHi = RHI;
+	require_serialize.mul64(hi, 0, n, 0);
+	const aLo = require_serialize.RLO;
+	const aHi = require_serialize.RHI;
+	require_serialize.mul64(lo, 0, n, 0);
+	const bHi = require_serialize.RHI;
 	return aHi + ((aLo >>> 0) + (bHi >>> 0) > 4294967295 ? 1 : 0) >>> 0;
 }
 function positionsInto(mlo, mhi, seg, segMask, segCountLen, out) {
@@ -130,8 +82,8 @@ function buildFingerprints(fp, hashes, params, maxAttempts = 100) {
 		xorHi.fill(0);
 		for (let i = 0; i < size; i++) {
 			mixSeed(hashes[2 * i] ?? 0, hashes[2 * i + 1] ?? 0, seed);
-			const mlo = RLO;
-			const mhi = RHI;
+			const mlo = require_serialize.RLO;
+			const mhi = require_serialize.RHI;
 			positionsInto(mlo, mhi, seg, segMask, segCountLen, pos);
 			for (let j = 0; j < 3; j++) {
 				const p = pos[j] ?? 0;
@@ -294,8 +246,8 @@ var BinaryFuse = class {
 		if (this.#fp.length === 0) return false;
 		require_serialize.hash128KeyInto(key, 0, scratchHash);
 		mixSeed(scratchHash.h1lo >>> 0, scratchHash.h1hi >>> 0, this.#seed);
-		const mlo = RLO;
-		const mhi = RHI;
+		const mlo = require_serialize.RLO;
+		const mhi = require_serialize.RHI;
 		positionsInto(mlo, mhi, this.#seg, this.#segMask, this.#segCountLen, this.#pos);
 		const mask = fpMask(this.#fp);
 		const p0 = this.#pos[0] ?? 0;

package/dist/fuse/index.js

@@ -1,4 +1,4 @@
-import { a as writeHeader, i as readHeader, n as assertBodyLength, o as hash128KeyInto, r as assertMinBodyLength, t as SerializationError } from "../serialize-DkkBKDT0.js";
+import { a as readHeader, c as RLO, f as mul64, i as assertMinBodyLength, l as fmix64, o as writeHeader, r as assertBodyLength, s as RHI, t as SerializationError, u as hash128KeyInto } from "../serialize-BQ2UzZqq.js";
 //#region src/fuse/fuse.ts
 const ARITY = 3;
 const TYPE_FUSE8 = 3;
@@ -8,60 +8,12 @@ var BinaryFuseBuildError = class extends Error {
 	/** Discriminates this error from other `Error`s. */
 	name = "BinaryFuseBuildError";
 };
-let RLO = 0;
-let RHI = 0;
 const scratchHash = {
 	h1lo: 0,
 	h1hi: 0,
 	h2lo: 0,
 	h2hi: 0
 };
-function mul64(alo, ahi, blo, bhi) {
-	const a0 = alo & 65535;
-	const a1 = alo >>> 16;
-	const a2 = ahi & 65535;
-	const a3 = ahi >>> 16;
-	const b0 = blo & 65535;
-	const b1 = blo >>> 16;
-	const b2 = bhi & 65535;
-	const b3 = bhi >>> 16;
-	let c0 = a0 * b0;
-	let c1 = c0 >>> 16;
-	c0 &= 65535;
-	c1 += a1 * b0;
-	let c2 = c1 >>> 16;
-	c1 &= 65535;
-	c1 += a0 * b1;
-	c2 += c1 >>> 16;
-	c1 &= 65535;
-	c2 += a2 * b0;
-	let c3 = c2 >>> 16;
-	c2 &= 65535;
-	c2 += a1 * b1;
-	c3 += c2 >>> 16;
-	c2 &= 65535;
-	c2 += a0 * b2;
-	c3 += c2 >>> 16;
-	c2 &= 65535;
-	c3 += a3 * b0 + a2 * b1 + a1 * b2 + a0 * b3;
-	c3 &= 65535;
-	RLO = (c1 << 16 | c0) >>> 0;
-	RHI = (c3 << 16 | c2) >>> 0;
-}
-function fmix64(lo, hi) {
-	let l = (lo ^ hi >>> 1) >>> 0;
-	let h = hi;
-	mul64(l, h, 3981806797, 4283543511);
-	l = RLO;
-	h = RHI;
-	l = (l ^ h >>> 1) >>> 0;
-	mul64(l, h, 444984403, 3301882366);
-	l = RLO;
-	h = RHI;
-	l = (l ^ h >>> 1) >>> 0;
-	RLO = l;
-	RHI = h;
-}
 function mixSeed(lo, hi, seed) {
 	const l = (lo >>> 0) + (seed >>> 0);
 	const carry = l > 4294967295 ? 1 : 0;

package/dist/index.cjs

@@ -2,6 +2,6 @@ Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
 //#endregion
 //#region src/index.ts
 /** The installed `distillate` package version. */
-const VERSION = "0.4.0";
+const VERSION = "0.5.0";
 //#endregion
 exports.VERSION = VERSION;

package/dist/index.js

@@ -1,6 +1,6 @@
 //#endregion
 //#region src/index.ts
 /** The installed `distillate` package version. */
-const VERSION = "0.4.0";
+const VERSION = "0.5.0";
 //#endregion
 export { VERSION };

package/dist/{serialize-DPdiySxq.cjs → serialize-BQ2UzZqq.js}

@@ -81,6 +81,37 @@ function fmix64(lo, hi) {
 	RLO = l;
 	RHI = h;
 }
+function murmur32(bytes, seed, len = bytes.length) {
+	let h = seed >>> 0;
+	const n = len & -4;
+	for (let i = 0; i < n; i += 4) {
+		let k = ((bytes[i] ?? 0) | (bytes[i + 1] ?? 0) << 8 | (bytes[i + 2] ?? 0) << 16 | (bytes[i + 3] ?? 0) << 24) >>> 0;
+		k = Math.imul(k, 3432918353);
+		k = (k << 15 | k >>> 17) >>> 0;
+		k = Math.imul(k, 461845907);
+		h = (h ^ k) >>> 0;
+		h = (h << 13 | h >>> 19) >>> 0;
+		h = Math.imul(h, 5) + 3864292196 >>> 0;
+	}
+	let k1 = 0;
+	const rem = len & 3;
+	if (rem >= 3) k1 ^= (bytes[n + 2] ?? 0) << 16;
+	if (rem >= 2) k1 ^= (bytes[n + 1] ?? 0) << 8;
+	if (rem >= 1) {
+		k1 ^= bytes[n] ?? 0;
+		k1 = Math.imul(k1 >>> 0, 3432918353);
+		k1 = (k1 << 15 | k1 >>> 17) >>> 0;
+		k1 = Math.imul(k1, 461845907);
+		h = (h ^ k1) >>> 0;
+	}
+	h = (h ^ len) >>> 0;
+	h ^= h >>> 16;
+	h = Math.imul(h, 2246822507);
+	h ^= h >>> 13;
+	h = Math.imul(h, 3266489909);
+	h ^= h >>> 16;
+	return h >>> 0;
+}
 function computeLanes(bytes, seed, len) {
 	const nblocks = len >>> 4;
 	let h1lo = seed >>> 0;
@@ -186,16 +217,22 @@ function computeLanes(bytes, seed, len) {
 }
 const keyEncoder = new TextEncoder();
 let keyBuf = /* @__PURE__ */ new Uint8Array(256);
-function keyToLanes(key, seed) {
+let encBytes = keyBuf;
+let encLen = 0;
+function encodeKey(key) {
 	if (typeof key === "string") {
 		const cap = key.length * 3;
 		if (keyBuf.length < cap) keyBuf = new Uint8Array(cap);
-		const { written } = keyEncoder.encodeInto(key, keyBuf);
-		computeLanes(keyBuf, seed, written);
+		encLen = keyEncoder.encodeInto(key, keyBuf).written;
+		encBytes = keyBuf;
 		return;
 	}
-	const bytes = normalize(key);
-	computeLanes(bytes, seed, bytes.length);
+	encBytes = normalize(key);
+	encLen = encBytes.length;
+}
+function keyToLanes(key, seed) {
+	encodeKey(key);
+	computeLanes(encBytes, seed, encLen);
 }
 function hash128KeyInto(key, seed, out) {
 	keyToLanes(key, seed);
@@ -221,10 +258,16 @@ function reduce(x, range) {
 * Kirsch-Mitzenmacher enhanced double hashing `g_i = h1 + i*h2 + i^2`
 * (the RocksDB `+i^2` fix), reduced into range with Lemire multiply-shift.
 */
+const SEED2 = 2654435761;
+function hash32x2Into(key, seed, out) {
+	encodeKey(key);
+	out[0] = murmur32(encBytes, seed, encLen);
+	out[1] = murmur32(encBytes, (seed ^ SEED2) >>> 0, encLen);
+}
 function probeInto(key, count, range, seed, out) {
-	keyToLanes(key, seed);
-	const a = (LANES.h1lo ^ LANES.h1hi) >>> 0;
-	const b = (LANES.h2lo ^ LANES.h2hi) >>> 0;
+	encodeKey(key);
+	const a = murmur32(encBytes, seed, encLen);
+	const b = murmur32(encBytes, (seed ^ SEED2) >>> 0, encLen);
 	for (let i = 0; i < count; i++) out[i] = reduce(a + Math.imul(i, b) + i * i >>> 0, range);
 }
 //#endregion
@@ -274,6 +317,9 @@ var BadMagicError = class extends SerializationError {
 var UnknownVersionError = class extends SerializationError {
 	name = "UnknownVersionError";
 };
+var UnknownHashVariantError = class extends SerializationError {
+	name = "UnknownHashVariantError";
+};
 var ChecksumError = class extends SerializationError {
 	name = "ChecksumError";
 };
@@ -305,51 +351,4 @@ function readHeader(frame) {
 	};
 }
 //#endregion
-Object.defineProperty(exports, "SerializationError", {
-	enumerable: true,
-	get: function() {
-		return SerializationError;
-	}
-});
-Object.defineProperty(exports, "assertBodyLength", {
-	enumerable: true,
-	get: function() {
-		return assertBodyLength;
-	}
-});
-Object.defineProperty(exports, "assertMinBodyLength", {
-	enumerable: true,
-	get: function() {
-		return assertMinBodyLength;
-	}
-});
-Object.defineProperty(exports, "hash128KeyInto", {
-	enumerable: true,
-	get: function() {
-		return hash128KeyInto;
-	}
-});
-Object.defineProperty(exports, "probeInto", {
-	enumerable: true,
-	get: function() {
-		return probeInto;
-	}
-});
-Object.defineProperty(exports, "readHeader", {
-	enumerable: true,
-	get: function() {
-		return readHeader;
-	}
-});
-Object.defineProperty(exports, "reduce", {
-	enumerable: true,
-	get: function() {
-		return reduce;
-	}
-});
-Object.defineProperty(exports, "writeHeader", {
-	enumerable: true,
-	get: function() {
-		return writeHeader;
-	}
-});
+export { readHeader as a, RLO as c, hash32x2Into as d, mul64 as f, assertMinBodyLength as i, fmix64 as l, reduce as m, UnknownHashVariantError as n, writeHeader as o, probeInto as p, assertBodyLength as r, RHI as s, SerializationError as t, hash128KeyInto as u };

package/dist/{serialize-DkkBKDT0.js → serialize-fa-pEUGq.cjs}

@@ -81,6 +81,37 @@ function fmix64(lo, hi) {
 	RLO = l;
 	RHI = h;
 }
+function murmur32(bytes, seed, len = bytes.length) {
+	let h = seed >>> 0;
+	const n = len & -4;
+	for (let i = 0; i < n; i += 4) {
+		let k = ((bytes[i] ?? 0) | (bytes[i + 1] ?? 0) << 8 | (bytes[i + 2] ?? 0) << 16 | (bytes[i + 3] ?? 0) << 24) >>> 0;
+		k = Math.imul(k, 3432918353);
+		k = (k << 15 | k >>> 17) >>> 0;
+		k = Math.imul(k, 461845907);
+		h = (h ^ k) >>> 0;
+		h = (h << 13 | h >>> 19) >>> 0;
+		h = Math.imul(h, 5) + 3864292196 >>> 0;
+	}
+	let k1 = 0;
+	const rem = len & 3;
+	if (rem >= 3) k1 ^= (bytes[n + 2] ?? 0) << 16;
+	if (rem >= 2) k1 ^= (bytes[n + 1] ?? 0) << 8;
+	if (rem >= 1) {
+		k1 ^= bytes[n] ?? 0;
+		k1 = Math.imul(k1 >>> 0, 3432918353);
+		k1 = (k1 << 15 | k1 >>> 17) >>> 0;
+		k1 = Math.imul(k1, 461845907);
+		h = (h ^ k1) >>> 0;
+	}
+	h = (h ^ len) >>> 0;
+	h ^= h >>> 16;
+	h = Math.imul(h, 2246822507);
+	h ^= h >>> 13;
+	h = Math.imul(h, 3266489909);
+	h ^= h >>> 16;
+	return h >>> 0;
+}
 function computeLanes(bytes, seed, len) {
 	const nblocks = len >>> 4;
 	let h1lo = seed >>> 0;
@@ -186,16 +217,22 @@ function computeLanes(bytes, seed, len) {
 }
 const keyEncoder = new TextEncoder();
 let keyBuf = /* @__PURE__ */ new Uint8Array(256);
-function keyToLanes(key, seed) {
+let encBytes = keyBuf;
+let encLen = 0;
+function encodeKey(key) {
 	if (typeof key === "string") {
 		const cap = key.length * 3;
 		if (keyBuf.length < cap) keyBuf = new Uint8Array(cap);
-		const { written } = keyEncoder.encodeInto(key, keyBuf);
-		computeLanes(keyBuf, seed, written);
+		encLen = keyEncoder.encodeInto(key, keyBuf).written;
+		encBytes = keyBuf;
 		return;
 	}
-	const bytes = normalize(key);
-	computeLanes(bytes, seed, bytes.length);
+	encBytes = normalize(key);
+	encLen = encBytes.length;
+}
+function keyToLanes(key, seed) {
+	encodeKey(key);
+	computeLanes(encBytes, seed, encLen);
 }
 function hash128KeyInto(key, seed, out) {
 	keyToLanes(key, seed);
@@ -221,10 +258,16 @@ function reduce(x, range) {
 * Kirsch-Mitzenmacher enhanced double hashing `g_i = h1 + i*h2 + i^2`
 * (the RocksDB `+i^2` fix), reduced into range with Lemire multiply-shift.
 */
+const SEED2 = 2654435761;
+function hash32x2Into(key, seed, out) {
+	encodeKey(key);
+	out[0] = murmur32(encBytes, seed, encLen);
+	out[1] = murmur32(encBytes, (seed ^ SEED2) >>> 0, encLen);
+}
 function probeInto(key, count, range, seed, out) {
-	keyToLanes(key, seed);
-	const a = (LANES.h1lo ^ LANES.h1hi) >>> 0;
-	const b = (LANES.h2lo ^ LANES.h2hi) >>> 0;
+	encodeKey(key);
+	const a = murmur32(encBytes, seed, encLen);
+	const b = murmur32(encBytes, (seed ^ SEED2) >>> 0, encLen);
 	for (let i = 0; i < count; i++) out[i] = reduce(a + Math.imul(i, b) + i * i >>> 0, range);
 }
 //#endregion
@@ -274,6 +317,9 @@ var BadMagicError = class extends SerializationError {
 var UnknownVersionError = class extends SerializationError {
 	name = "UnknownVersionError";
 };
+var UnknownHashVariantError = class extends SerializationError {
+	name = "UnknownHashVariantError";
+};
 var ChecksumError = class extends SerializationError {
 	name = "ChecksumError";
 };
@@ -305,4 +351,87 @@ function readHeader(frame) {
 	};
 }
 //#endregion
-export { writeHeader as a, reduce as c, readHeader as i, assertBodyLength as n, hash128KeyInto as o, assertMinBodyLength as r, probeInto as s, SerializationError as t };
+Object.defineProperty(exports, "RHI", {
+	enumerable: true,
+	get: function() {
+		return RHI;
+	}
+});
+Object.defineProperty(exports, "RLO", {
+	enumerable: true,
+	get: function() {
+		return RLO;
+	}
+});
+Object.defineProperty(exports, "SerializationError", {
+	enumerable: true,
+	get: function() {
+		return SerializationError;
+	}
+});
+Object.defineProperty(exports, "UnknownHashVariantError", {
+	enumerable: true,
+	get: function() {
+		return UnknownHashVariantError;
+	}
+});
+Object.defineProperty(exports, "assertBodyLength", {
+	enumerable: true,
+	get: function() {
+		return assertBodyLength;
+	}
+});
+Object.defineProperty(exports, "assertMinBodyLength", {
+	enumerable: true,
+	get: function() {
+		return assertMinBodyLength;
+	}
+});
+Object.defineProperty(exports, "fmix64", {
+	enumerable: true,
+	get: function() {
+		return fmix64;
+	}
+});
+Object.defineProperty(exports, "hash128KeyInto", {
+	enumerable: true,
+	get: function() {
+		return hash128KeyInto;
+	}
+});
+Object.defineProperty(exports, "hash32x2Into", {
+	enumerable: true,
+	get: function() {
+		return hash32x2Into;
+	}
+});
+Object.defineProperty(exports, "mul64", {
+	enumerable: true,
+	get: function() {
+		return mul64;
+	}
+});
+Object.defineProperty(exports, "probeInto", {
+	enumerable: true,
+	get: function() {
+		return probeInto;
+	}
+});
+Object.defineProperty(exports, "readHeader", {
+	enumerable: true,
+	get: function() {
+		return readHeader;
+	}
+});
+Object.defineProperty(exports, "reduce", {
+	enumerable: true,
+	get: function() {
+		return reduce;
+	}
+});
+Object.defineProperty(exports, "writeHeader", {
+	enumerable: true,
+	get: function() {
+		return writeHeader;
+	}
+});

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "distillate",
-  "version": "0.4.0",
+  "version": "0.5.0",
   "description": "Probabilistic data structures for JavaScript. Space-efficient, approximate-membership filters (Bloom, Blocked Bloom, Binary Fuse) with tunable error and a portable binary format; zero dependencies, universal.",
   "keywords": [
     "bloom-filter",