distillate 0.1.1 → 0.2.0

package/README.md

@@ -92,6 +92,19 @@ const precise = BinaryFuse16.from(["alice", "bob", "carol"]);
 
 Also: `toBytes` / `fromBytes`. No `add` / `delete`; rebuild `from` the new set to change membership.
 
+## Performance
+
+Classic Bloom head-to-head at a **matched 1% false-positive rate** over the same 100k keys, measured by identical code (Node, Apple M5):
+
+| Classic Bloom  | bits/key | measured FPR | `has` throughput |
+| -------------- | -------- | ------------ | ---------------- |
+| **distillate** | 9.59     | 1.03%        | ~7.0 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.
+
+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).
+
 ## Docs
 
 Design notes, the structure decision matrix, hashing, and the binary format live in [`docs/`](./docs):
@@ -99,6 +112,8 @@ Design notes, the structure decision matrix, hashing, and the binary format live
 - [overview](./docs/overview.md): what and why
 - [structures](./docs/structures.md): decision matrix and the full lineup
 - [architecture](./docs/architecture.md), [hashing](./docs/hashing.md), [serialization](./docs/serialization.md)
+- [versioning](./docs/versioning.md): SemVer policy and supported-runtime baseline
+- [API reference](./docs/api): generated from TSDoc (per entry point)
 
 ## License
 

package/dist/blocked/index.cjs

@@ -1,5 +1,6 @@
 Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
 const require_serialize = require("../serialize-CHHDM4TQ.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);
@@ -9,15 +10,22 @@ const scratchHash = {
 	h2lo: 0,
 	h2hi: 0
 };
-/**
-* Split-block probe: derive one block index and 8 single-bit lane masks for
-* `key`. Writes lane word indices into `outWords` and their masks into
-* `outBits` (both length 8, caller-owned so no per-call allocation). A block is
-* 256 bits = 8 contiguous 32-bit lanes; word `block*8 + i` gets one bit set.
-*/
+/** Thrown when an operation requires two filters built with identical parameters. */
 var BlockedBloomParamMismatchError = class extends Error {
+	/** Discriminates this error from other `Error`s. */
 	name = "BlockedBloomParamMismatchError";
 };
+/**
+* A blocked (split-block) Bloom filter: confines every lookup to a single cache
+* line, trading ~20-30% more space for cache-friendly throughput.
+*
+* @example
+* ```ts
+* const filter = BlockedBloomFilter.create(100_000, 0.01);
+* filter.add("alice");
+* filter.has("alice"); // true
+* ```
+*/
 var BlockedBloomFilter = class BlockedBloomFilter {
 	#lanes;
 	#numBlocks;
@@ -30,7 +38,16 @@ var BlockedBloomFilter = class BlockedBloomFilter {
 		[3, 16.9],
 		[4, 26.4]
 	];
+	/**
+	* 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.assertProbability(epsilon, "epsilon");
 		const t = Math.log10(1 / epsilon);
 		const a = BlockedBloomFilter.#ANCHORS;
 		let seg = a.findIndex((p) => t <= p[0]);
@@ -39,19 +56,33 @@ var BlockedBloomFilter = class BlockedBloomFilter {
 		const [t1, b1] = a[seg] ?? [0, 0];
 		const bitsPerKey = b0 + (b1 - b0) / (t1 - t0) * (t - t0);
 		return new BlockedBloomFilter({
-			bitsPerKey: Math.ceil(bitsPerKey),
+			bitsPerKey: Math.max(1, Math.ceil(bitsPerKey)),
 			capacity: n
 		});
 	}
+	/**
+	* Constructs a filter from low-level {@link BlockedBloomParams}. Prefer
+	* {@link BlockedBloomFilter.create} unless restoring a specific configuration.
+	*/
 	constructor({ bitsPerKey, capacity, seed = 0 }) {
+		require_params.assertPositiveFinite(bitsPerKey, "bitsPerKey");
+		require_params.assertPositiveInt(capacity, "capacity");
+		require_params.assertUint32(seed, "seed");
 		this.#numBlocks = Math.max(1, Math.ceil(bitsPerKey * capacity / 256));
 		this.#lanes = new Uint32Array(this.#numBlocks * 8);
 		this.#seed = seed;
 		this.#n = capacity;
 	}
+	/** Actual bits allocated per key (`total bits / capacity`). */
 	get bitsPerKey() {
 		return this.#numBlocks * 256 / this.#n;
 	}
+	/**
+	* Restores a filter from its {@link BlockedBloomFilter.toBytes} serialization.
+	*
+	* @param bytes - The serialized filter.
+	* @returns The reconstructed filter.
+	*/
 	static fromBytes(bytes) {
 		const { body } = require_serialize.readHeader(bytes);
 		const dv = new DataView(body.buffer, body.byteOffset, body.byteLength);
@@ -67,6 +98,11 @@ var BlockedBloomFilter = class BlockedBloomFilter {
 		new Uint8Array(f.#lanes.buffer).set(body.subarray(12));
 		return f;
 	}
+	/**
+	* Serializes the filter to a portable little-endian byte layout.
+	*
+	* @returns The serialized filter, readable by {@link BlockedBloomFilter.fromBytes}.
+	*/
 	toBytes() {
 		const lanes = new Uint8Array(this.#lanes.buffer, this.#lanes.byteOffset, this.#lanes.byteLength);
 		const body = new Uint8Array(12 + lanes.length);
@@ -81,6 +117,13 @@ var BlockedBloomFilter = class BlockedBloomFilter {
 			flags: 0
 		}, body);
 	}
+	/**
+	* 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 BlockedBloomParamMismatchError} if the parameters differ.
+	*/
 	union(other) {
 		if (this.#numBlocks !== other.#numBlocks || this.#seed !== other.#seed) throw new BlockedBloomParamMismatchError("cannot union blocked Bloom filters whose parameters do not match");
 		const r = new BlockedBloomFilter({
@@ -91,6 +134,11 @@ var BlockedBloomFilter = class BlockedBloomFilter {
 		for (let i = 0; i < this.#lanes.length; i++) r.#lanes[i] = (this.#lanes[i] ?? 0) | (other.#lanes[i] ?? 0);
 		return r;
 	}
+	/**
+	* Adds a key to the set.
+	*
+	* @param key - The key to insert, as a string or bytes.
+	*/
 	add(key) {
 		fillBlock(key, this.#numBlocks, this.#seed, this.#words, this.#bits);
 		for (let i = 0; i < 8; i++) {
@@ -98,6 +146,12 @@ var BlockedBloomFilter = class BlockedBloomFilter {
 			this.#lanes[w] = (this.#lanes[w] ?? 0) | (this.#bits[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) {
 		fillBlock(key, this.#numBlocks, this.#seed, this.#words, this.#bits);
 		for (let i = 0; i < 8; i++) {
@@ -120,3 +174,4 @@ function fillBlock(key, numBlocks, seed, outWords, outBits) {
 //#endregion
 exports.BlockedBloomFilter = BlockedBloomFilter;
 exports.BlockedBloomParamMismatchError = BlockedBloomParamMismatchError;
+exports.ParamError = require_params.ParamError;

package/dist/blocked/index.d.cts

@@ -1,29 +1,82 @@
 import { t as BytesLike } from "../bytes-DCuYtUVS.cjs";
+import { t as ParamError } from "../params-DnqJBqLS.cjs";
 //#region src/blocked/blocked.d.ts
-/**
- * Split-block probe: derive one block index and 8 single-bit lane masks for
- * `key`. Writes lane word indices into `outWords` and their masks into
- * `outBits` (both length 8, caller-owned so no per-call allocation). A block is
- * 256 bits = 8 contiguous 32-bit lanes; word `block*8 + i` gets one bit set.
- */
+/** Thrown when an operation requires two filters built with identical parameters. */
 declare class BlockedBloomParamMismatchError extends Error {
+  /** Discriminates this error from other `Error`s. */
   override readonly name = "BlockedBloomParamMismatchError";
 }
+/** Low-level blocked Bloom filter parameters. */
 interface BlockedBloomParams {
+  /** Bits allocated per key; higher lowers the false-positive rate. */
   bitsPerKey: number;
+  /** Expected number of keys. */
   capacity: number;
+  /** Hash seed; defaults to `0`. */
   seed?: number;
 }
+/**
+ * A blocked (split-block) Bloom filter: confines every lookup to a single cache
+ * line, trading ~20-30% more space for cache-friendly throughput.
+ *
+ * @example
+ * ```ts
+ * const filter = BlockedBloomFilter.create(100_000, 0.01);
+ * filter.add("alice");
+ * filter.has("alice"); // true
+ * ```
+ */
 declare class BlockedBloomFilter {
   #private;
+  /**
+   * 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: number, epsilon: number): BlockedBloomFilter;
+  /**
+   * Constructs a filter from low-level {@link BlockedBloomParams}. Prefer
+   * {@link BlockedBloomFilter.create} unless restoring a specific configuration.
+   */
   constructor({ bitsPerKey, capacity, seed }: BlockedBloomParams);
+  /** Actual bits allocated per key (`total bits / capacity`). */
   get bitsPerKey(): number;
+  /**
+   * Restores a filter from its {@link BlockedBloomFilter.toBytes} serialization.
+   *
+   * @param bytes - The serialized filter.
+   * @returns The reconstructed filter.
+   */
   static fromBytes(bytes: Uint8Array): BlockedBloomFilter;
+  /**
+   * Serializes the filter to a portable little-endian byte layout.
+   *
+   * @returns The serialized filter, readable by {@link BlockedBloomFilter.fromBytes}.
+   */
   toBytes(): Uint8Array;
+  /**
+   * 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 BlockedBloomParamMismatchError} if the parameters differ.
+   */
   union(other: BlockedBloomFilter): BlockedBloomFilter;
+  /**
+   * Adds a key to the set.
+   *
+   * @param key - The key to insert, as a string or bytes.
+   */
   add(key: BytesLike): void;
+  /**
+   * 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: BytesLike): boolean;
 }
 //#endregion
-export { BlockedBloomFilter, BlockedBloomParamMismatchError, type BlockedBloomParams };
+export { BlockedBloomFilter, BlockedBloomParamMismatchError, type BlockedBloomParams, ParamError };

package/dist/blocked/index.d.ts

@@ -1,29 +1,82 @@
 import { t as BytesLike } from "../bytes-DCuYtUVS.js";
+import { t as ParamError } from "../params-DnqJBqLS.js";
 //#region src/blocked/blocked.d.ts
-/**
- * Split-block probe: derive one block index and 8 single-bit lane masks for
- * `key`. Writes lane word indices into `outWords` and their masks into
- * `outBits` (both length 8, caller-owned so no per-call allocation). A block is
- * 256 bits = 8 contiguous 32-bit lanes; word `block*8 + i` gets one bit set.
- */
+/** Thrown when an operation requires two filters built with identical parameters. */
 declare class BlockedBloomParamMismatchError extends Error {
+  /** Discriminates this error from other `Error`s. */
   override readonly name = "BlockedBloomParamMismatchError";
 }
+/** Low-level blocked Bloom filter parameters. */
 interface BlockedBloomParams {
+  /** Bits allocated per key; higher lowers the false-positive rate. */
   bitsPerKey: number;
+  /** Expected number of keys. */
   capacity: number;
+  /** Hash seed; defaults to `0`. */
   seed?: number;
 }
+/**
+ * A blocked (split-block) Bloom filter: confines every lookup to a single cache
+ * line, trading ~20-30% more space for cache-friendly throughput.
+ *
+ * @example
+ * ```ts
+ * const filter = BlockedBloomFilter.create(100_000, 0.01);
+ * filter.add("alice");
+ * filter.has("alice"); // true
+ * ```
+ */
 declare class BlockedBloomFilter {
   #private;
+  /**
+   * 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: number, epsilon: number): BlockedBloomFilter;
+  /**
+   * Constructs a filter from low-level {@link BlockedBloomParams}. Prefer
+   * {@link BlockedBloomFilter.create} unless restoring a specific configuration.
+   */
   constructor({ bitsPerKey, capacity, seed }: BlockedBloomParams);
+  /** Actual bits allocated per key (`total bits / capacity`). */
   get bitsPerKey(): number;
+  /**
+   * Restores a filter from its {@link BlockedBloomFilter.toBytes} serialization.
+   *
+   * @param bytes - The serialized filter.
+   * @returns The reconstructed filter.
+   */
   static fromBytes(bytes: Uint8Array): BlockedBloomFilter;
+  /**
+   * Serializes the filter to a portable little-endian byte layout.
+   *
+   * @returns The serialized filter, readable by {@link BlockedBloomFilter.fromBytes}.
+   */
   toBytes(): Uint8Array;
+  /**
+   * 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 BlockedBloomParamMismatchError} if the parameters differ.
+   */
   union(other: BlockedBloomFilter): BlockedBloomFilter;
+  /**
+   * Adds a key to the set.
+   *
+   * @param key - The key to insert, as a string or bytes.
+   */
   add(key: BytesLike): void;
+  /**
+   * 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: BytesLike): boolean;
 }
 //#endregion
-export { BlockedBloomFilter, BlockedBloomParamMismatchError, type BlockedBloomParams };
+export { BlockedBloomFilter, BlockedBloomParamMismatchError, type BlockedBloomParams, ParamError };

package/dist/blocked/index.js

@@ -1,4 +1,5 @@
 import { i as hash128KeyInto, n as readHeader, o as reduce, r as writeHeader } from "../serialize-5XQ5y_R-.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);
@@ -8,15 +9,22 @@ const scratchHash = {
 	h2lo: 0,
 	h2hi: 0
 };
-/**
-* Split-block probe: derive one block index and 8 single-bit lane masks for
-* `key`. Writes lane word indices into `outWords` and their masks into
-* `outBits` (both length 8, caller-owned so no per-call allocation). A block is
-* 256 bits = 8 contiguous 32-bit lanes; word `block*8 + i` gets one bit set.
-*/
+/** Thrown when an operation requires two filters built with identical parameters. */
 var BlockedBloomParamMismatchError = class extends Error {
+	/** Discriminates this error from other `Error`s. */
 	name = "BlockedBloomParamMismatchError";
 };
+/**
+* A blocked (split-block) Bloom filter: confines every lookup to a single cache
+* line, trading ~20-30% more space for cache-friendly throughput.
+*
+* @example
+* ```ts
+* const filter = BlockedBloomFilter.create(100_000, 0.01);
+* filter.add("alice");
+* filter.has("alice"); // true
+* ```
+*/
 var BlockedBloomFilter = class BlockedBloomFilter {
 	#lanes;
 	#numBlocks;
@@ -29,7 +37,16 @@ var BlockedBloomFilter = class BlockedBloomFilter {
 		[3, 16.9],
 		[4, 26.4]
 	];
+	/**
+	* 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");
+		assertProbability(epsilon, "epsilon");
 		const t = Math.log10(1 / epsilon);
 		const a = BlockedBloomFilter.#ANCHORS;
 		let seg = a.findIndex((p) => t <= p[0]);
@@ -38,19 +55,33 @@ var BlockedBloomFilter = class BlockedBloomFilter {
 		const [t1, b1] = a[seg] ?? [0, 0];
 		const bitsPerKey = b0 + (b1 - b0) / (t1 - t0) * (t - t0);
 		return new BlockedBloomFilter({
-			bitsPerKey: Math.ceil(bitsPerKey),
+			bitsPerKey: Math.max(1, Math.ceil(bitsPerKey)),
 			capacity: n
 		});
 	}
+	/**
+	* Constructs a filter from low-level {@link BlockedBloomParams}. Prefer
+	* {@link BlockedBloomFilter.create} unless restoring a specific configuration.
+	*/
 	constructor({ bitsPerKey, capacity, seed = 0 }) {
+		assertPositiveFinite(bitsPerKey, "bitsPerKey");
+		assertPositiveInt(capacity, "capacity");
+		assertUint32(seed, "seed");
 		this.#numBlocks = Math.max(1, Math.ceil(bitsPerKey * capacity / 256));
 		this.#lanes = new Uint32Array(this.#numBlocks * 8);
 		this.#seed = seed;
 		this.#n = capacity;
 	}
+	/** Actual bits allocated per key (`total bits / capacity`). */
 	get bitsPerKey() {
 		return this.#numBlocks * 256 / this.#n;
 	}
+	/**
+	* Restores a filter from its {@link BlockedBloomFilter.toBytes} serialization.
+	*
+	* @param bytes - The serialized filter.
+	* @returns The reconstructed filter.
+	*/
 	static fromBytes(bytes) {
 		const { body } = readHeader(bytes);
 		const dv = new DataView(body.buffer, body.byteOffset, body.byteLength);
@@ -66,6 +97,11 @@ var BlockedBloomFilter = class BlockedBloomFilter {
 		new Uint8Array(f.#lanes.buffer).set(body.subarray(12));
 		return f;
 	}
+	/**
+	* Serializes the filter to a portable little-endian byte layout.
+	*
+	* @returns The serialized filter, readable by {@link BlockedBloomFilter.fromBytes}.
+	*/
 	toBytes() {
 		const lanes = new Uint8Array(this.#lanes.buffer, this.#lanes.byteOffset, this.#lanes.byteLength);
 		const body = new Uint8Array(12 + lanes.length);
@@ -80,6 +116,13 @@ var BlockedBloomFilter = class BlockedBloomFilter {
 			flags: 0
 		}, body);
 	}
+	/**
+	* 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 BlockedBloomParamMismatchError} if the parameters differ.
+	*/
 	union(other) {
 		if (this.#numBlocks !== other.#numBlocks || this.#seed !== other.#seed) throw new BlockedBloomParamMismatchError("cannot union blocked Bloom filters whose parameters do not match");
 		const r = new BlockedBloomFilter({
@@ -90,6 +133,11 @@ var BlockedBloomFilter = class BlockedBloomFilter {
 		for (let i = 0; i < this.#lanes.length; i++) r.#lanes[i] = (this.#lanes[i] ?? 0) | (other.#lanes[i] ?? 0);
 		return r;
 	}
+	/**
+	* Adds a key to the set.
+	*
+	* @param key - The key to insert, as a string or bytes.
+	*/
 	add(key) {
 		fillBlock(key, this.#numBlocks, this.#seed, this.#words, this.#bits);
 		for (let i = 0; i < 8; i++) {
@@ -97,6 +145,12 @@ var BlockedBloomFilter = class BlockedBloomFilter {
 			this.#lanes[w] = (this.#lanes[w] ?? 0) | (this.#bits[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) {
 		fillBlock(key, this.#numBlocks, this.#seed, this.#words, this.#bits);
 		for (let i = 0; i < 8; i++) {
@@ -117,4 +171,4 @@ function fillBlock(key, numBlocks, seed, outWords, outBits) {
 	}
 }
 //#endregion
-export { BlockedBloomFilter, BlockedBloomParamMismatchError };
+export { BlockedBloomFilter, BlockedBloomParamMismatchError, ParamError };

package/dist/bloom/index.cjs

@@ -1,5 +1,6 @@
 Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
 const require_serialize = require("../serialize-CHHDM4TQ.cjs");
+const require_params = require("../params-J8p3bKq5.cjs");
 //#region src/core/bitset.ts
 var BitSetRangeError = class extends RangeError {
 	name = "BitSetRangeError";
@@ -48,9 +49,23 @@ function optimal(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;
@@ -58,11 +73,26 @@ 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.assertProbability(epsilon, "epsilon");
 		const f = new BloomFilter(optimal(n, epsilon));
 		f.#n = n;
 		return f;
 	}
+	/**
+	* Restores a filter from its {@link BloomFilter.toBytes} serialization.
+	*
+	* @param bytes - The serialized filter.
+	* @returns The reconstructed filter.
+	*/
 	static fromBytes(bytes) {
 		const { body } = require_serialize.readHeader(bytes);
 		const dv = new DataView(body.buffer, body.byteOffset, body.byteLength);
@@ -77,7 +107,14 @@ var BloomFilter = class BloomFilter {
 		f.#bits.bytes.set(body.subarray(9));
 		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.assertPositiveInt(k, "k");
+		require_params.assertUint32(seed, "seed");
 		this.#bits = new BitSet(m);
 		this.#m = m;
 		this.#k = k;
@@ -89,6 +126,11 @@ var BloomFilter = class BloomFilter {
 	get bitsPerKey() {
 		return this.#m / this.#n;
 	}
+	/**
+	* 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;
 		const body = new Uint8Array(9 + payload.length);
@@ -103,6 +145,13 @@ var BloomFilter = class BloomFilter {
 			flags: 0
 		}, body);
 	}
+	/**
+	* 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;
@@ -117,10 +166,21 @@ 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;
@@ -130,3 +190,4 @@ var BloomFilter = class BloomFilter {
 //#endregion
 exports.BloomFilter = BloomFilter;
 exports.BloomParamMismatchError = BloomParamMismatchError;
+exports.ParamError = require_params.ParamError;