distillate 0.7.0 → 0.8.0

package/dist/bloom/index.cjs

@@ -1,6 +1,6 @@
 Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
-const require_serialize = require("../serialize-BIIKUHH6.cjs");
-const require_params = require("../params--8CNXYWu.cjs");
+const require_serialize = require("../serialize-CXnRWItH.cjs");
+const require_params = require("../params-UTZbJ22c.cjs");
 //#region src/core/bitset.ts
 var BitSetRangeError = class extends RangeError {
 	name = "BitSetRangeError";
@@ -33,7 +33,6 @@ var BitSet = class {
 };
 //#endregion
 //#region src/core/sizing.ts
-/** Optimal Bloom-filter sizing: `m` bits and `k` hashes for `n` items at target FPR `epsilon`. */
 function bloomSizing(n, epsilon) {
 	const m = Math.ceil(-n * Math.log(epsilon) / (Math.LN2 * Math.LN2));
 	return {
@@ -44,23 +43,9 @@ function bloomSizing(n, epsilon) {
 //#endregion
 //#region src/bloom/bloom.ts
 const TYPE = 1;
-/** Thrown when an operation requires two filters built with identical parameters. */
 var BloomParamMismatchError = class extends Error {
-	/** Discriminates this error from other `Error`s. */
 	name = "BloomParamMismatchError";
 };
-/**
-* A classic Bloom filter: a space-efficient set with a tunable false-positive
-* rate and zero false negatives.
-*
-* @example
-* ```ts
-* const filter = BloomFilter.create(100_000, 0.01);
-* filter.add("alice");
-* filter.has("alice"); // true
-* filter.has("bob"); // false (or a ~1% false positive)
-* ```
-*/
 var BloomFilter = class BloomFilter {
 	#bits;
 	#m;
@@ -68,40 +53,18 @@ var BloomFilter = class BloomFilter {
 	#seed;
 	#scratch;
 	#n;
-	/**
-	* Creates a filter sized for `n` expected keys at a target false-positive rate.
-	*
-	* @param n - Expected number of keys.
-	* @param epsilon - Target false-positive rate, e.g. `0.01` for 1%.
-	* @returns A new, empty filter.
-	*/
 	static create(n, epsilon) {
 		require_params.assertPositiveInt(n, "n");
 		require_params.assertUint32(n, "n");
 		require_params.assertProbability(epsilon, "epsilon");
 		return BloomFilter.#withN(bloomSizing(n, epsilon), n);
 	}
-	/**
-	* Builds a filter from `keys`, sized for their count at the target
-	* false-positive rate. The ergonomic entry point when the key set is already
-	* in hand; use {@link BloomFilter.create} to size for a count known ahead.
-	*
-	* @param keys - The keys to insert.
-	* @param epsilon - Target false-positive rate, e.g. `0.01` for 1%.
-	* @returns A new filter containing every key.
-	*/
 	static from(keys, epsilon) {
 		const arr = [...keys];
 		const f = BloomFilter.create(Math.max(1, arr.length), epsilon);
 		for (const k of arr) f.add(k);
 		return f;
 	}
-	/**
-	* Restores a filter from its {@link BloomFilter.toBytes} serialization.
-	*
-	* @param bytes - The serialized filter.
-	* @returns The reconstructed filter.
-	*/
 	static fromBytes(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)}`);
@@ -121,10 +84,6 @@ var BloomFilter = class BloomFilter {
 		f.#bits.bytes.set(body.subarray(14));
 		return f;
 	}
-	/**
-	* Constructs a filter from low-level {@link BloomParams}. Prefer
-	* {@link BloomFilter.create} unless restoring a specific configuration.
-	*/
 	constructor({ m, k, seed = 0 }) {
 		require_params.assertPositiveInt(m, "m");
 		require_params.assertUint32(m, "m");
@@ -143,41 +102,24 @@ var BloomFilter = class BloomFilter {
 		f.#n = n;
 		return f;
 	}
-	/** Number of bits in the filter. */
 	get m() {
 		return this.#m;
 	}
-	/** Number of hash probes per key. */
 	get k() {
 		return this.#k;
 	}
-	/** Hash seed. */
 	get seed() {
 		return this.#seed;
 	}
-	/** Number of bits currently set. */
 	get length() {
 		return this.#bits.count();
 	}
-	/** Analytic design bits-per-key `m / n`. */
 	get bitsPerKey() {
 		return this.#m / this.#n;
 	}
-	/**
-	* Estimates the current false-positive rate from the actual fill,
-	* `(length / m) ** k`. This reflects how full the filter is right now, not
-	* the design target; it rises as keys are added.
-	*
-	* @returns The estimated false-positive rate, `0` for an empty filter.
-	*/
 	rate() {
 		return (this.length / this.#m) ** this.#k;
 	}
-	/**
-	* Serializes the filter to a portable little-endian byte layout.
-	*
-	* @returns The serialized filter, readable by {@link BloomFilter.fromBytes}.
-	*/
 	toBytes() {
 		const payload = this.#bits.bytes;
 		return require_serialize.writeFrame({
@@ -192,41 +134,15 @@ var BloomFilter = class BloomFilter {
 			body.set(payload, 14);
 		});
 	}
-	/**
-	* Tests structural equality: `true` when `other` serializes to identical
-	* bytes, meaning identical parameters and set bits.
-	*
-	* @param other - The filter to compare against.
-	* @returns `true` if the two filters are byte-for-byte identical.
-	*/
 	equals(other) {
 		return require_serialize.bytesEqual(this.toBytes(), other.toBytes());
 	}
-	/**
-	* Serializes the filter to a JSON-friendly envelope wrapping the base64 of
-	* {@link BloomFilter.toBytes}.
-	*
-	* @returns The envelope, readable by {@link BloomFilter.fromJSON}.
-	*/
 	toJSON() {
 		return require_serialize.toJSONEnvelope(this.toBytes());
 	}
-	/**
-	* Restores a filter from its {@link BloomFilter.toJSON} envelope.
-	*
-	* @param value - The JSON envelope.
-	* @returns The reconstructed filter.
-	*/
 	static fromJSON(value) {
 		return BloomFilter.fromBytes(require_serialize.fromJSONEnvelope(value));
 	}
-	/**
-	* Returns a new filter containing the union of this filter and `other`.
-	*
-	* @param other - A filter built with identical parameters.
-	* @returns A new filter reporting membership for keys in either input.
-	* @throws {@link BloomParamMismatchError} if the parameters differ.
-	*/
 	union(other) {
 		if (this.#m !== other.#m || this.#k !== other.#k || this.#seed !== other.#seed) throw new BloomParamMismatchError("cannot union Bloom filters whose parameters do not match");
 		const a = this.#bits.bytes;
@@ -241,21 +157,10 @@ var BloomFilter = class BloomFilter {
 		r.#bits.bytes.set(merged);
 		return r;
 	}
-	/**
-	* Adds a key to the set.
-	*
-	* @param key - The key to insert, as a string or bytes.
-	*/
 	add(key) {
 		require_serialize.probeInto(key, this.#k, this.#m, this.#seed, this.#scratch);
 		for (let i = 0; i < this.#k; i++) this.#bits.set(this.#scratch[i] ?? 0);
 	}
-	/**
-	* Tests whether a key is in the set.
-	*
-	* @param key - The key to test.
-	* @returns `true` if present (possibly a false positive); `false` guarantees absence.
-	*/
 	has(key) {
 		require_serialize.probeInto(key, this.#k, this.#m, this.#seed, this.#scratch);
 		for (let i = 0; i < this.#k; i++) if (!this.#bits.get(this.#scratch[i] ?? 0)) return false;
@@ -263,7 +168,13 @@ var BloomFilter = class BloomFilter {
 	}
 };
 //#endregion
+exports.BadMagicError = require_serialize.BadMagicError;
 exports.BloomFilter = BloomFilter;
 exports.BloomParamMismatchError = BloomParamMismatchError;
+exports.ChecksumError = require_serialize.ChecksumError;
 exports.ParamError = require_params.ParamError;
+exports.SerializationError = require_serialize.SerializationError;
+exports.TruncatedError = require_serialize.TruncatedError;
+exports.UnknownHashVariantError = require_serialize.UnknownHashVariantError;
+exports.UnknownVersionError = require_serialize.UnknownVersionError;
 exports.bloomSizing = bloomSizing;

package/dist/bloom/index.d.cts

@@ -1,4 +1,4 @@
-import { n as BytesLike, t as FilterJSON } from "../serialize-DRKh6QOr.cjs";
+import { a as TruncatedError, c as BytesLike, i as SerializationError, n as ChecksumError, o as UnknownHashVariantError, r as FilterJSON, s as UnknownVersionError, t as BadMagicError } from "../serialize-ChyWpB9F.cjs";
 import { t as ParamError } from "../params-DnqJBqLS.cjs";
 //#region src/bloom/bloom.d.ts
 /** Thrown when an operation requires two filters built with identical parameters. */
@@ -139,4 +139,4 @@ interface BloomSizing {
 /** Optimal Bloom-filter sizing: `m` bits and `k` hashes for `n` items at target FPR `epsilon`. */
 declare function bloomSizing(n: number, epsilon: number): BloomSizing;
 //#endregion
-export { BloomFilter, BloomParamMismatchError, type BloomParams, type BloomSizing, type FilterJSON, ParamError, bloomSizing };
+export { BadMagicError, BloomFilter, BloomParamMismatchError, type BloomParams, type BloomSizing, ChecksumError, type FilterJSON, ParamError, SerializationError, TruncatedError, UnknownHashVariantError, UnknownVersionError, bloomSizing };

package/dist/bloom/index.d.ts

@@ -1,4 +1,4 @@
-import { n as BytesLike, t as FilterJSON } from "../serialize-DRKh6QOr.js";
+import { a as TruncatedError, c as BytesLike, i as SerializationError, n as ChecksumError, o as UnknownHashVariantError, r as FilterJSON, s as UnknownVersionError, t as BadMagicError } from "../serialize-ChyWpB9F.js";
 import { t as ParamError } from "../params-DnqJBqLS.js";
 //#region src/bloom/bloom.d.ts
 /** Thrown when an operation requires two filters built with identical parameters. */
@@ -139,4 +139,4 @@ interface BloomSizing {
 /** Optimal Bloom-filter sizing: `m` bits and `k` hashes for `n` items at target FPR `epsilon`. */
 declare function bloomSizing(n: number, epsilon: number): BloomSizing;
 //#endregion
-export { BloomFilter, BloomParamMismatchError, type BloomParams, type BloomSizing, type FilterJSON, ParamError, bloomSizing };
+export { BadMagicError, BloomFilter, BloomParamMismatchError, type BloomParams, type BloomSizing, ChecksumError, type FilterJSON, ParamError, SerializationError, TruncatedError, UnknownHashVariantError, UnknownVersionError, bloomSizing };

package/dist/bloom/index.js

@@ -1,5 +1,5 @@
-import { a as bytesEqual, c as toJSONEnvelope, g as probeInto, i as assertMinBodyLength, l as writeFrame, n as UnknownHashVariantError, o as fromJSONEnvelope, r as assertBodyLength, s as readHeader, t as SerializationError } from "../serialize-BnwtzcMw.js";
-import { a as assertUint16, i as assertProbability, o as assertUint32, r as assertPositiveInt, t as ParamError } from "../params-BrWuBC2A.js";
+import { a as UnknownHashVariantError, b as probeInto, c as assertMinBodyLength, d as readHeader, f as toJSONEnvelope, i as TruncatedError, l as bytesEqual, n as ChecksumError, o as UnknownVersionError, p as writeFrame, r as SerializationError, s as assertBodyLength, t as BadMagicError, u as fromJSONEnvelope } from "../serialize-BqIcsR2J.js";
+import { a as assertUint16, i as assertProbability, o as assertUint32, r as assertPositiveInt, t as ParamError } from "../params-CeajSrwv.js";
 //#region src/core/bitset.ts
 var BitSetRangeError = class extends RangeError {
 	name = "BitSetRangeError";
@@ -32,7 +32,6 @@ var BitSet = class {
 };
 //#endregion
 //#region src/core/sizing.ts
-/** Optimal Bloom-filter sizing: `m` bits and `k` hashes for `n` items at target FPR `epsilon`. */
 function bloomSizing(n, epsilon) {
 	const m = Math.ceil(-n * Math.log(epsilon) / (Math.LN2 * Math.LN2));
 	return {
@@ -43,23 +42,9 @@ function bloomSizing(n, epsilon) {
 //#endregion
 //#region src/bloom/bloom.ts
 const TYPE = 1;
-/** Thrown when an operation requires two filters built with identical parameters. */
 var BloomParamMismatchError = class extends Error {
-	/** Discriminates this error from other `Error`s. */
 	name = "BloomParamMismatchError";
 };
-/**
-* A classic Bloom filter: a space-efficient set with a tunable false-positive
-* rate and zero false negatives.
-*
-* @example
-* ```ts
-* const filter = BloomFilter.create(100_000, 0.01);
-* filter.add("alice");
-* filter.has("alice"); // true
-* filter.has("bob"); // false (or a ~1% false positive)
-* ```
-*/
 var BloomFilter = class BloomFilter {
 	#bits;
 	#m;
@@ -67,40 +52,18 @@ var BloomFilter = class BloomFilter {
 	#seed;
 	#scratch;
 	#n;
-	/**
-	* Creates a filter sized for `n` expected keys at a target false-positive rate.
-	*
-	* @param n - Expected number of keys.
-	* @param epsilon - Target false-positive rate, e.g. `0.01` for 1%.
-	* @returns A new, empty filter.
-	*/
 	static create(n, epsilon) {
 		assertPositiveInt(n, "n");
 		assertUint32(n, "n");
 		assertProbability(epsilon, "epsilon");
 		return BloomFilter.#withN(bloomSizing(n, epsilon), n);
 	}
-	/**
-	* Builds a filter from `keys`, sized for their count at the target
-	* false-positive rate. The ergonomic entry point when the key set is already
-	* in hand; use {@link BloomFilter.create} to size for a count known ahead.
-	*
-	* @param keys - The keys to insert.
-	* @param epsilon - Target false-positive rate, e.g. `0.01` for 1%.
-	* @returns A new filter containing every key.
-	*/
 	static from(keys, epsilon) {
 		const arr = [...keys];
 		const f = BloomFilter.create(Math.max(1, arr.length), epsilon);
 		for (const k of arr) f.add(k);
 		return f;
 	}
-	/**
-	* Restores a filter from its {@link BloomFilter.toBytes} serialization.
-	*
-	* @param bytes - The serialized filter.
-	* @returns The reconstructed filter.
-	*/
 	static fromBytes(bytes) {
 		const { type, flags, body } = readHeader(bytes);
 		if (type !== TYPE) throw new SerializationError(`expected AMQF type ${String(TYPE)}, got ${String(type)}`);
@@ -120,10 +83,6 @@ var BloomFilter = class BloomFilter {
 		f.#bits.bytes.set(body.subarray(14));
 		return f;
 	}
-	/**
-	* Constructs a filter from low-level {@link BloomParams}. Prefer
-	* {@link BloomFilter.create} unless restoring a specific configuration.
-	*/
 	constructor({ m, k, seed = 0 }) {
 		assertPositiveInt(m, "m");
 		assertUint32(m, "m");
@@ -142,41 +101,24 @@ var BloomFilter = class BloomFilter {
 		f.#n = n;
 		return f;
 	}
-	/** Number of bits in the filter. */
 	get m() {
 		return this.#m;
 	}
-	/** Number of hash probes per key. */
 	get k() {
 		return this.#k;
 	}
-	/** Hash seed. */
 	get seed() {
 		return this.#seed;
 	}
-	/** Number of bits currently set. */
 	get length() {
 		return this.#bits.count();
 	}
-	/** Analytic design bits-per-key `m / n`. */
 	get bitsPerKey() {
 		return this.#m / this.#n;
 	}
-	/**
-	* Estimates the current false-positive rate from the actual fill,
-	* `(length / m) ** k`. This reflects how full the filter is right now, not
-	* the design target; it rises as keys are added.
-	*
-	* @returns The estimated false-positive rate, `0` for an empty filter.
-	*/
 	rate() {
 		return (this.length / this.#m) ** this.#k;
 	}
-	/**
-	* Serializes the filter to a portable little-endian byte layout.
-	*
-	* @returns The serialized filter, readable by {@link BloomFilter.fromBytes}.
-	*/
 	toBytes() {
 		const payload = this.#bits.bytes;
 		return writeFrame({
@@ -191,41 +133,15 @@ var BloomFilter = class BloomFilter {
 			body.set(payload, 14);
 		});
 	}
-	/**
-	* Tests structural equality: `true` when `other` serializes to identical
-	* bytes, meaning identical parameters and set bits.
-	*
-	* @param other - The filter to compare against.
-	* @returns `true` if the two filters are byte-for-byte identical.
-	*/
 	equals(other) {
 		return bytesEqual(this.toBytes(), other.toBytes());
 	}
-	/**
-	* Serializes the filter to a JSON-friendly envelope wrapping the base64 of
-	* {@link BloomFilter.toBytes}.
-	*
-	* @returns The envelope, readable by {@link BloomFilter.fromJSON}.
-	*/
 	toJSON() {
 		return toJSONEnvelope(this.toBytes());
 	}
-	/**
-	* Restores a filter from its {@link BloomFilter.toJSON} envelope.
-	*
-	* @param value - The JSON envelope.
-	* @returns The reconstructed filter.
-	*/
 	static fromJSON(value) {
 		return BloomFilter.fromBytes(fromJSONEnvelope(value));
 	}
-	/**
-	* Returns a new filter containing the union of this filter and `other`.
-	*
-	* @param other - A filter built with identical parameters.
-	* @returns A new filter reporting membership for keys in either input.
-	* @throws {@link BloomParamMismatchError} if the parameters differ.
-	*/
 	union(other) {
 		if (this.#m !== other.#m || this.#k !== other.#k || this.#seed !== other.#seed) throw new BloomParamMismatchError("cannot union Bloom filters whose parameters do not match");
 		const a = this.#bits.bytes;
@@ -240,21 +156,10 @@ var BloomFilter = class BloomFilter {
 		r.#bits.bytes.set(merged);
 		return r;
 	}
-	/**
-	* Adds a key to the set.
-	*
-	* @param key - The key to insert, as a string or bytes.
-	*/
 	add(key) {
 		probeInto(key, this.#k, this.#m, this.#seed, this.#scratch);
 		for (let i = 0; i < this.#k; i++) this.#bits.set(this.#scratch[i] ?? 0);
 	}
-	/**
-	* Tests whether a key is in the set.
-	*
-	* @param key - The key to test.
-	* @returns `true` if present (possibly a false positive); `false` guarantees absence.
-	*/
 	has(key) {
 		probeInto(key, this.#k, this.#m, this.#seed, this.#scratch);
 		for (let i = 0; i < this.#k; i++) if (!this.#bits.get(this.#scratch[i] ?? 0)) return false;
@@ -262,4 +167,4 @@ var BloomFilter = class BloomFilter {
 	}
 };
 //#endregion
-export { BloomFilter, BloomParamMismatchError, ParamError, bloomSizing };
+export { BadMagicError, BloomFilter, BloomParamMismatchError, ChecksumError, ParamError, SerializationError, TruncatedError, UnknownHashVariantError, UnknownVersionError, bloomSizing };

package/dist/fuse/index.cjs

@@ -1,12 +1,10 @@
 Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
-const require_serialize = require("../serialize-BIIKUHH6.cjs");
+const require_serialize = require("../serialize-CXnRWItH.cjs");
 //#region src/fuse/fuse.ts
 const ARITY = 3;
 const TYPE_FUSE8 = 3;
 const TYPE_FUSE16 = 4;
-/** Thrown when binary fuse construction fails to converge on the key set. */
 var BinaryFuseBuildError = class extends Error {
-	/** Discriminates this error from other `Error`s. */
 	name = "BinaryFuseBuildError";
 };
 const scratchHash = {
@@ -59,24 +57,10 @@ function computeParams(size) {
 		arrayLength
 	};
 }
-/**
-* Bits stored per key by a binary fuse filter over `n` keys at a fingerprint
-* width, without building one. Counts `n` as distinct keys, since a built
-* filter sizes on its deduped hash count.
-*
-* @param n - Number of distinct keys.
-* @param width - Fingerprint width in bits: `8` for {@link BinaryFuse8}, `16` for {@link BinaryFuse16}.
-* @returns Bits per key (`0` for an empty filter).
-*/
 function fuseBitsPerKey(n, width) {
 	if (n === 0) return 0;
 	return computeParams(n).arrayLength * width / n;
 }
-/**
-* Peel the 3-hypergraph and assign fingerprints so every key's XOR of its 3
-* lanes equals its fingerprint. Retries with a bumped seed on a stall; returns
-* the seed that succeeded.
-*/
 function buildFingerprints(fp, hashes, params, maxAttempts = 100) {
 	const size = hashes.length / 2;
 	const { seg, segMask, segCountLen, arrayLength } = params;
@@ -87,7 +71,7 @@ function buildFingerprints(fp, hashes, params, maxAttempts = 100) {
 	const orderLo = new Uint32Array(size);
 	const orderHi = new Uint32Array(size);
 	const orderIdx = new Uint32Array(size);
-	const pos = /* @__PURE__ */ new Uint32Array(3);
+	const pos = new Uint32Array(3);
 	for (let attempt = 0; attempt < maxAttempts; attempt++) {
 		const seed = attempt;
 		counts.fill(0);
@@ -146,7 +130,7 @@ function buildFingerprints(fp, hashes, params, maxAttempts = 100) {
 }
 function buildState(keys, alloc) {
 	const hashList = [];
-	const seen = /* @__PURE__ */ new Set();
+	const seen = new Set();
 	for (const key of keys) {
 		require_serialize.hash128KeyInto(key, 0, scratchHash);
 		const lo = scratchHash.w0 >>> 0;
@@ -204,10 +188,6 @@ function fuseStateFromBytes(bytes, expectedType) {
 		size
 	};
 }
-/**
-* Shared behavior for the static binary fuse filters: an immutable,
-* space-efficient membership filter built once from a fixed key set.
-*/
 var BinaryFuse = class {
 	#fp;
 	#seed;
@@ -215,7 +195,7 @@ var BinaryFuse = class {
 	#segMask;
 	#segCountLen;
 	#size;
-	#pos = /* @__PURE__ */ new Uint32Array(3);
+	#pos = new Uint32Array(3);
 	constructor(state) {
 		this.#fp = state.fp;
 		this.#seed = state.seed;
@@ -224,23 +204,15 @@ var BinaryFuse = class {
 		this.#segCountLen = state.params.segCountLen;
 		this.#size = state.size;
 	}
-	/** Number of distinct keys the filter was built from. */
 	get size() {
 		return this.#size;
 	}
-	/** Hash seed selected during construction (may differ from 0 after a peel retry). */
 	get seed() {
 		return this.#seed;
 	}
-	/** Actual bits stored per key (`0` for an empty filter). */
 	get bitsPerKey() {
 		return this.#size === 0 ? 0 : this.#fp.byteLength * 8 / this.#size;
 	}
-	/**
-	* Serializes the filter to a portable little-endian byte layout.
-	*
-	* @returns The serialized filter, readable by the matching `fromBytes`.
-	*/
 	toBytes() {
 		const laneBytes = new Uint8Array(this.#fp.buffer, this.#fp.byteOffset, this.#fp.byteLength);
 		return require_serialize.writeFrame({
@@ -255,12 +227,6 @@ var BinaryFuse = class {
 			body.set(laneBytes, 16);
 		});
 	}
-	/**
-	* Tests whether a key is in the set.
-	*
-	* @param key - The key to test.
-	* @returns `true` if present (possibly a false positive); `false` guarantees absence.
-	*/
 	has(key) {
 		if (this.#fp.length === 0) return false;
 		require_serialize.hash128KeyInto(key, 0, scratchHash);
@@ -274,110 +240,43 @@ var BinaryFuse = class {
 		const p2 = this.#pos[2] ?? 0;
 		return ((mlo ^ mhi) & mask) === (((this.#fp[p0] ?? 0) ^ (this.#fp[p1] ?? 0) ^ (this.#fp[p2] ?? 0)) & mask);
 	}
-	/**
-	* Tests structural equality: `true` when `other` serializes to identical
-	* bytes. A {@link BinaryFuse8} and a {@link BinaryFuse16} are never equal,
-	* since their frames carry different type bytes.
-	*
-	* @param other - The filter to compare against.
-	* @returns `true` if the two filters are byte-for-byte identical.
-	*/
 	equals(other) {
 		return require_serialize.bytesEqual(this.toBytes(), other.toBytes());
 	}
-	/**
-	* Serializes the filter to a JSON-friendly envelope wrapping the base64 of
-	* the `toBytes` frame.
-	*
-	* @returns The envelope, readable by the matching `fromJSON`.
-	*/
 	toJSON() {
 		return require_serialize.toJSONEnvelope(this.toBytes());
 	}
 };
-/**
-* A static 8-bit binary fuse filter: built once from a key set, then immutable.
-* The most space-efficient option (~9 bits/key at ~0.39% false-positive rate).
-*
-* @example
-* ```ts
-* const filter = BinaryFuse8.from(["alice", "bob", "carol"]);
-* filter.has("alice"); // true
-* filter.size; // 3
-* ```
-*/
 var BinaryFuse8 = class BinaryFuse8 extends BinaryFuse {
-	/**
-	* Builds a filter from the given keys; duplicates are ignored.
-	*
-	* @param keys - The complete set of keys to store.
-	* @returns A new immutable filter.
-	* @throws {@link BinaryFuseBuildError} if construction fails to converge.
-	*/
 	static from(keys) {
 		return new BinaryFuse8(buildState(keys, (n) => new Uint8Array(n)));
 	}
-	/**
-	* Restores a filter from its {@link BinaryFuse8.toBytes} serialization.
-	*
-	* @param bytes - The serialized filter.
-	* @returns The reconstructed filter.
-	*/
 	static fromBytes(bytes) {
 		return new BinaryFuse8(fuseStateFromBytes(bytes, TYPE_FUSE8));
 	}
-	/**
-	* Restores a filter from its {@link BinaryFuse8.toJSON} envelope.
-	*
-	* @param value - The JSON envelope.
-	* @returns The reconstructed filter.
-	*/
 	static fromJSON(value) {
 		return BinaryFuse8.fromBytes(require_serialize.fromJSONEnvelope(value));
 	}
 };
-/**
-* A static 16-bit binary fuse filter: like {@link BinaryFuse8} but twice the
-* space (~18 bits/key) for a far lower false-positive rate (~1/65536).
-*
-* @example
-* ```ts
-* const filter = BinaryFuse16.from(["alice", "bob", "carol"]);
-* filter.has("alice"); // true
-* ```
-*/
 var BinaryFuse16 = class BinaryFuse16 extends BinaryFuse {
-	/**
-	* Builds a filter from the given keys; duplicates are ignored.
-	*
-	* @param keys - The complete set of keys to store.
-	* @returns A new immutable filter.
-	* @throws {@link BinaryFuseBuildError} if construction fails to converge.
-	*/
 	static from(keys) {
 		return new BinaryFuse16(buildState(keys, (n) => new Uint16Array(n)));
 	}
-	/**
-	* Restores a filter from its {@link BinaryFuse16.toBytes} serialization.
-	*
-	* @param bytes - The serialized filter.
-	* @returns The reconstructed filter.
-	*/
 	static fromBytes(bytes) {
 		return new BinaryFuse16(fuseStateFromBytes(bytes, TYPE_FUSE16));
 	}
-	/**
-	* Restores a filter from its {@link BinaryFuse16.toJSON} envelope.
-	*
-	* @param value - The JSON envelope.
-	* @returns The reconstructed filter.
-	*/
 	static fromJSON(value) {
 		return BinaryFuse16.fromBytes(require_serialize.fromJSONEnvelope(value));
 	}
 };
 //#endregion
+exports.BadMagicError = require_serialize.BadMagicError;
 exports.BinaryFuse16 = BinaryFuse16;
 exports.BinaryFuse8 = BinaryFuse8;
 exports.BinaryFuseBuildError = BinaryFuseBuildError;
+exports.ChecksumError = require_serialize.ChecksumError;
+exports.SerializationError = require_serialize.SerializationError;
+exports.TruncatedError = require_serialize.TruncatedError;
+exports.UnknownHashVariantError = require_serialize.UnknownHashVariantError;
+exports.UnknownVersionError = require_serialize.UnknownVersionError;
 exports.fuseBitsPerKey = fuseBitsPerKey;

package/dist/fuse/index.d.cts

@@ -1,4 +1,4 @@
-import { n as BytesLike, t as FilterJSON } from "../serialize-DRKh6QOr.cjs";
+import { a as TruncatedError, c as BytesLike, i as SerializationError, n as ChecksumError, o as UnknownHashVariantError, r as FilterJSON, s as UnknownVersionError, t as BadMagicError } from "../serialize-ChyWpB9F.cjs";
 //#region src/fuse/fuse.d.ts
 /** Thrown when binary fuse construction fails to converge on the key set. */
 declare class BinaryFuseBuildError extends Error {
@@ -140,4 +140,4 @@ declare class BinaryFuse16 extends BinaryFuse {
   static fromJSON(value: unknown): BinaryFuse16;
 }
 //#endregion
-export { BinaryFuse16, BinaryFuse8, BinaryFuseBuildError, type FilterJSON, fuseBitsPerKey };
+export { BadMagicError, BinaryFuse16, BinaryFuse8, BinaryFuseBuildError, ChecksumError, type FilterJSON, SerializationError, TruncatedError, UnknownHashVariantError, UnknownVersionError, fuseBitsPerKey };

package/dist/fuse/index.d.ts

@@ -1,4 +1,4 @@
-import { n as BytesLike, t as FilterJSON } from "../serialize-DRKh6QOr.js";
+import { a as TruncatedError, c as BytesLike, i as SerializationError, n as ChecksumError, o as UnknownHashVariantError, r as FilterJSON, s as UnknownVersionError, t as BadMagicError } from "../serialize-ChyWpB9F.js";
 //#region src/fuse/fuse.d.ts
 /** Thrown when binary fuse construction fails to converge on the key set. */
 declare class BinaryFuseBuildError extends Error {
@@ -140,4 +140,4 @@ declare class BinaryFuse16 extends BinaryFuse {
   static fromJSON(value: unknown): BinaryFuse16;
 }
 //#endregion
-export { BinaryFuse16, BinaryFuse8, BinaryFuseBuildError, type FilterJSON, fuseBitsPerKey };
+export { BadMagicError, BinaryFuse16, BinaryFuse8, BinaryFuseBuildError, ChecksumError, type FilterJSON, SerializationError, TruncatedError, UnknownHashVariantError, UnknownVersionError, fuseBitsPerKey };