effect-browser-human-strokes 0.0.0-reserved.0 → 0.3.0-beta.10

package/LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2026 chris
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

package/LICENSE-data

@@ -0,0 +1,28 @@
+BOUN Mouse Dynamics Dataset — derived stroke recordings
+
+Original authors: Metehan Yıldırım, Arjen Aykan Kılıç, Emin Anarım
+Dataset version: 2, published 26 March 2021
+Source: https://data.mendeley.com/datasets/w6cxr8yc7p/2
+DOI: https://doi.org/10.17632/w6cxr8yc7p.2
+
+The data in data/strokes.bin.br is licensed under the Creative Commons Attribution
+4.0 International License (CC BY 4.0).
+License: https://creativecommons.org/licenses/by/4.0/
+Legal code: https://creativecommons.org/licenses/by/4.0/legalcode
+
+You may share and adapt the data, including commercially, subject to the license,
+including appropriate credit, a link to the license, and an indication of changes.
+No endorsement by the original authors is implied.
+
+Modifications in this distribution:
+- Selected browsing click strokes from three source participants.
+- Trimmed the initial two percent of traveled distance and repeated ending positions.
+- Excluded strokes shorter than 30 pixels, with fewer than four retained samples,
+  with nonpositive duration, or with duration of 5 seconds or more.
+- Made coordinates and times relative to each first retained sample.
+- Preserved all retained sample times and integer coordinates exactly using a
+  BOUN v1 binary delta format with 1/4096-millisecond residuals and Brotli compression.
+- Omitted participant identifiers and unrelated records.
+
+The software implementing the codec and motion layer is separately licensed under
+the MIT License in LICENSE. This notice applies to the bundled data.

package/README.md

@@ -1,5 +1,60 @@
 # effect-browser-human-strokes
 
-Namespace-only bootstrap for npm trusted publishing from [mannyc2/effect-agent-browserbase](https://github.com/mannyc2/effect-agent-browserbase).
+Optional recorded pointer motion for `effect-browser`: a pointer planner, for a presenter, over a
+bundled library of 32,130 human strokes. It does not change typing, pauses or input policy.
 
-This package contains no SDK, executable code, scripts, data, or dependencies. Wait for the qualified SDK release before installing.
+```sh
+npm install effect-browser-human-strokes@beta effect-browser@beta effect playwright-core
+```
+
+```ts
+import { Effect } from "effect";
+import * as HumanStrokes from "effect-browser-human-strokes";
+import { Browser } from "effect-browser/Browser";
+import * as Chromium from "effect-browser/Chromium";
+import * as Presentation from "effect-browser/Presentation";
+
+const program = Effect.gen(function* () {
+  const presenter = yield* Presentation.make({ motion: yield* HumanStrokes.motion });
+  const page = yield* (yield* Browser).newPage("https://example.com");
+
+  yield* presenter.view(page).hover({ x: 400, y: 300 });
+}).pipe(Effect.scoped, Effect.provide(Chromium.layer()));
+```
+
+`HumanStrokes.motion` reads, decompresses and validates its fixed package asset, and is the
+planner as a value, which a presenter takes: nothing else reads it, so it cannot be misplaced.
+Loading failures are typed `DataError` values. There is no download, file-path option or configuration
+step. Decompression runs on Node's thread pool rather than the event loop, and the built planner
+keeps only the validated payload. Each plan decodes only its selected stroke. The single Brotli
+asset is 3,152,464 bytes; the validated payload is 10,411,952 bytes. The core browser package
+does not include this data.
+
+Selection draws uniformly among strokes whose endpoint distances differ by less than 0.15 in
+absolute log ratio, or chooses the nearest absolute distance when none qualify. The selected
+geometry is rotated, scaled and randomly mirrored, with an exact final destination. Distances
+below two pixels use an immediate endpoint. Original sample times, including fractional
+milliseconds and equal-time samples, are retained. No resampling or time scaling is applied.
+
+The library contains 2,604,684 points, with at most 1,604 samples and less than 5,000 milliseconds
+per stroke. Humanization describes presentation behavior; this package makes no identity,
+anti-detection or universal realism claim.
+
+## Data attribution
+
+The bundled data derives from the **BOUN Mouse Dynamics Dataset**, version 2, by
+**Metehan Yıldırım, Arjen Aykan Kılıç and Emin Anarım**, published 26 March 2021:
+
+- Dataset and license: https://data.mendeley.com/datasets/w6cxr8yc7p/2
+- DOI: https://doi.org/10.17632/w6cxr8yc7p.2
+- License: Creative Commons Attribution 4.0 International,
+  https://creativecommons.org/licenses/by/4.0/
+
+Changes: browsing click strokes from three source participants were selected; the initial
+two percent of traveled distance and repeated ending positions were trimmed; strokes shorter
+than 30 pixels or lasting 5 seconds or more were excluded. Coordinates and times were made
+relative to the first retained sample. Integer-coordinate deltas and exact 1/4096-millisecond
+time residuals were encoded and Brotli-compressed. Participant identifiers and unrelated
+records are not included. These are transformed recordings, not original dataset files.
+
+Code is MIT-licensed. The derived data remains CC BY 4.0; see `LICENSE-data`.

package/dist/index.d.mts

@@ -0,0 +1,19 @@
+import { Effect, Result, Schema } from "effect";
+import * as Motion from "effect-browser/Motion";
+//#region src/internal/strokes.d.ts
+declare const DataError_base: Schema.Class<DataError, Schema.TaggedStruct<"HumanStrokesDataError", {
+  readonly reason: Schema.Literals<readonly ["Read", "Compression", "Format"]>;
+  readonly detail: Schema.String;
+}>, import("effect/Cause").YieldableError>;
+/** The fixed bundled recording could not be read or validated. */
+export declare class DataError extends DataError_base {}
+//#endregion
+//#region src/HumanStrokes.d.ts
+/**
+ * The recorded strokes as a pointer planner, for a presenter:
+ * `Presentation.make({ motion: yield* HumanStrokes.motion })`. Loading reads, decompresses and
+ * validates the package's own asset, with no network or path options, and fails `DataError`.
+ */
+export declare const motion: Effect.Effect<Motion.Service, DataError>;
+//#endregion
+//# sourceMappingURL=index.d.mts.map

package/dist/index.mjs

@@ -0,0 +1,218 @@
+import { readFile } from "node:fs/promises";
+import { Effect, Random, Result, Schema } from "effect";
+import { promisify } from "node:util";
+import { brotliDecompress } from "node:zlib";
+import * as Motion from "effect-browser/Motion";
+//#region src/internal/strokes.ts
+/** The fixed bundled recording could not be read or validated. */
+var DataError = class extends Schema.TaggedError()("HumanStrokesDataError", {
+	reason: Schema.Literals([
+		"Read",
+		"Compression",
+		"Format"
+	]),
+	detail: Schema.String
+}) {};
+const rawBytes = 10411952;
+const strokeCount = 32130;
+const ticks = 4096;
+const decompress = promisify(brotliDecompress);
+/** Inflate on the thread pool, bounded to the payload size, without blocking the event loop. */
+const inflate = (compressed) => Effect.tryPromise({
+	try: () => decompress(compressed, { maxOutputLength: rawBytes }),
+	catch: () => new DataError({
+		reason: "Compression",
+		detail: "The bundled human-stroke asset could not be decompressed."
+	})
+});
+var Reader = class {
+	offset;
+	invalid = false;
+	bytes;
+	constructor(bytes, offset = 0) {
+		this.bytes = bytes;
+		this.offset = offset;
+	}
+	unsigned() {
+		let value = 0;
+		let multiplier = 1;
+		for (let byteIndex = 0; byteIndex < 5; byteIndex++) {
+			const byte = this.bytes[this.offset++];
+			if (byte === void 0) {
+				this.invalid = true;
+				return 0;
+			}
+			value += (byte & 127) * multiplier;
+			if (byte < 128) {
+				if (value > 4294967295 || byteIndex > 0 && byte === 0) this.invalid = true;
+				return value;
+			}
+			multiplier *= 128;
+		}
+		this.invalid = true;
+		return 0;
+	}
+	signed() {
+		const value = this.unsigned();
+		return value % 2 === 0 ? value / 2 : -(value + 1) / 2;
+	}
+};
+const bad = (detail) => Result.fail(new DataError({
+	reason: "Format",
+	detail
+}));
+/** Validate each bounded record once, retaining only offsets and selection metadata. */
+const index = (bytes) => {
+	if (bytes.length !== 10411952 || bytes[0] !== 66 || bytes[1] !== 79 || bytes[2] !== 85 || bytes[3] !== 78 || bytes[4] !== 1) return bad("The bundled stroke header or byte count is invalid.");
+	const reader = new Reader(bytes, 5);
+	if (reader.unsigned() !== ticks || reader.unsigned() !== 32130) return bad("The bundled stroke precision or record count is invalid.");
+	const records = [];
+	let points = 0;
+	for (let ordinal = 0; ordinal < strokeCount; ordinal++) {
+		const length = reader.unsigned() + 1;
+		if (reader.invalid || length < 4 || length > Motion.maximumSamples) return bad("A stroke exceeds the supported sample count.");
+		points += length;
+		if (points > 2604684) return bad("The bundled point count is invalid.");
+		const offset = reader.offset;
+		const times = new Float64Array(length);
+		let whole = 0;
+		for (let sample = 1; sample < length; sample++) {
+			whole += reader.signed();
+			times[sample] = whole;
+		}
+		let dx = 0;
+		let dy = 0;
+		for (let sample = 1; sample < length; sample++) dx += reader.signed();
+		for (let sample = 1; sample < length; sample++) dy += reader.signed();
+		let previous = 0;
+		for (let sample = 1; sample < length; sample++) {
+			const residual = reader.signed();
+			const time = (times[sample] ?? 0) + residual / ticks;
+			if (Math.abs(residual) > ticks / 2 || time < previous || time > Motion.maximumDurationMillis) return bad("A stroke has invalid or decreasing sample times.");
+			previous = time;
+		}
+		const distance = Math.hypot(dx, dy);
+		if (reader.invalid || distance < 30 || previous <= 0) return bad("A stroke has an invalid displacement or duration.");
+		records.push({
+			offset,
+			length,
+			dx,
+			dy,
+			distance,
+			duration: previous
+		});
+	}
+	const first = records[0];
+	if (reader.invalid || reader.offset !== bytes.length || points !== 2604684 || first === void 0) return bad("The bundled stroke payload has an invalid extent.");
+	return Result.succeed({
+		bytes,
+		records,
+		first,
+		points
+	});
+};
+/** The index establishes these record boundaries; only the selected coordinates are expanded. */
+const decode = (data, record) => {
+	const reader = new Reader(data.bytes, record.offset);
+	const times = new Float64Array(record.length);
+	const xs = new Float64Array(record.length);
+	const ys = new Float64Array(record.length);
+	let value = 0;
+	for (let sample = 1; sample < record.length; sample++) {
+		value += reader.signed();
+		times[sample] = value;
+	}
+	value = 0;
+	for (let sample = 1; sample < record.length; sample++) {
+		value += reader.signed();
+		xs[sample] = value;
+	}
+	value = 0;
+	for (let sample = 1; sample < record.length; sample++) {
+		value += reader.signed();
+		ys[sample] = value;
+	}
+	const samples = [{
+		x: 0,
+		y: 0,
+		afterMillis: 0
+	}];
+	for (let sample = 1; sample < record.length; sample++) samples.push({
+		x: xs[sample] ?? 0,
+		y: ys[sample] ?? 0,
+		afterMillis: (times[sample] ?? 0) + reader.signed() / ticks
+	});
+	return samples;
+};
+/** Match the measured selection rule: random nearby distance, otherwise nearest absolute distance. */
+const select = (data, distance, choice) => {
+	const candidates = [];
+	let closest = data.first;
+	for (const record of data.records) {
+		if (Math.abs(Math.log(record.distance / distance)) < .15) candidates.push(record);
+		if (record.distance <= distance && closest.distance <= distance ? record.distance > closest.distance : record.distance >= distance && closest.distance >= distance ? record.distance < closest.distance : Math.abs(record.distance - distance) < Math.abs(closest.distance - distance)) closest = record;
+	}
+	return candidates[Math.floor(choice * candidates.length)] ?? closest;
+};
+/** Rotate/scale the recorded geometry, optionally mirroring across its own movement axis. */
+const retarget = (data, record, from, to, mirror) => {
+	const source = decode(data, record);
+	const sourceX = record.dx / record.distance;
+	const sourceY = record.dy / record.distance;
+	const scale = Math.max(1, Math.abs(from.x), Math.abs(from.y), Math.abs(to.x), Math.abs(to.y));
+	const startX = from.x / scale;
+	const startY = from.y / scale;
+	const deltaX = to.x / scale - startX;
+	const deltaY = to.y / scale - startY;
+	const coordinate = (value) => Math.round(Math.max(-Number.MAX_VALUE, Math.min(Number.MAX_VALUE, value * scale)));
+	return source.map((sample, ordinal) => {
+		if (ordinal === 0) return {
+			...from,
+			afterMillis: sample.afterMillis
+		};
+		if (ordinal === source.length - 1) return {
+			...to,
+			afterMillis: sample.afterMillis
+		};
+		const along = (sample.x * sourceX + sample.y * sourceY) / record.distance;
+		const lateral = (-sample.x * sourceY + sample.y * sourceX) / record.distance * (mirror ? -1 : 1);
+		return {
+			x: coordinate(startX + deltaX * along - deltaY * lateral),
+			y: coordinate(startY + deltaY * along + deltaX * lateral),
+			afterMillis: sample.afterMillis
+		};
+	});
+};
+//#endregion
+//#region src/HumanStrokes.ts
+const read = Effect.tryPromise({
+	try: (signal) => readFile(new URL("../data/strokes.bin.br", import.meta.url), { signal }),
+	catch: () => new DataError({
+		reason: "Read",
+		detail: "The bundled human-stroke asset could not be read."
+	})
+});
+/**
+* The recorded strokes as a pointer planner, for a presenter:
+* `Presentation.make({ motion: yield* HumanStrokes.motion })`. Loading reads, decompresses and
+* validates the package's own asset, with no network or path options, and fails `DataError`.
+*/
+const motion = Effect.gen(function* () {
+	const decoded = index(yield* Effect.flatMap(read, inflate));
+	if (Result.isFailure(decoded)) return yield* decoded.failure;
+	const data = decoded.success;
+	return { plan: Effect.fnUntraced(function* (from, to) {
+		const scale = Math.max(1, Math.abs(from.x), Math.abs(from.y), Math.abs(to.x), Math.abs(to.y));
+		const distance = Math.hypot(to.x / scale - from.x / scale, to.y / scale - from.y / scale) * scale;
+		if (distance < 2) return [{
+			...to,
+			afterMillis: 0
+		}];
+		const record = select(data, distance, yield* Random.next);
+		return retarget(data, record, from, to, (yield* Random.next) < .5);
+	}) };
+});
+//#endregion
+export { DataError, motion };
+
+//# sourceMappingURL=index.mjs.map

package/dist/index.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.mjs","names":[],"sources":["../src/internal/strokes.ts","../src/HumanStrokes.ts"],"sourcesContent":["import { promisify } from \"node:util\";\nimport { brotliDecompress } from \"node:zlib\";\n\nimport { Effect, Result, Schema } from \"effect\";\nimport * as Motion from \"effect-browser/Motion\";\n\n/** The fixed bundled recording could not be read or validated. */\nexport class DataError extends Schema.TaggedError<DataError>()(\"HumanStrokesDataError\", {\n  reason: Schema.Literals([\"Read\", \"Compression\", \"Format\"]),\n  detail: Schema.String,\n}) {}\n\nexport const rawBytes = 10_411_952;\nexport const strokeCount = 32_130;\nexport const pointCount = 2_604_684;\nconst ticks = 4096;\nconst decompress = promisify(brotliDecompress);\n\n/** Inflate on the thread pool, bounded to the payload size, without blocking the event loop. */\nexport const inflate = (compressed: Uint8Array) =>\n  Effect.tryPromise({\n    try: () => decompress(compressed, { maxOutputLength: rawBytes }),\n    catch: () =>\n      new DataError({\n        reason: \"Compression\",\n        detail: \"The bundled human-stroke asset could not be decompressed.\",\n      }),\n  });\n\nexport interface Record {\n  readonly offset: number;\n  readonly length: number;\n  readonly dx: number;\n  readonly dy: number;\n  readonly distance: number;\n  readonly duration: number;\n}\n\nexport interface Index {\n  readonly bytes: Uint8Array;\n  readonly records: ReadonlyArray<Record>;\n  readonly first: Record;\n  readonly points: number;\n}\n\n// The private binary codec keeps original fractional milliseconds. Rounding them to integer\n// milliseconds would change 880,905 sample times, despite saving less than a megabyte on disk.\nclass Reader {\n  offset: number;\n  invalid = false;\n  readonly bytes: Uint8Array;\n\n  constructor(bytes: Uint8Array, offset = 0) {\n    this.bytes = bytes;\n    this.offset = offset;\n  }\n\n  unsigned(): number {\n    let value = 0;\n    let multiplier = 1;\n\n    for (let byteIndex = 0; byteIndex < 5; byteIndex++) {\n      const byte = this.bytes[this.offset++];\n\n      if (byte === undefined) {\n        this.invalid = true;\n\n        return 0;\n      }\n      value += (byte & 127) * multiplier;\n      if (byte < 128) {\n        if (value > 0xffffffff || (byteIndex > 0 && byte === 0)) this.invalid = true;\n\n        return value;\n      }\n      multiplier *= 128;\n    }\n    this.invalid = true;\n\n    return 0;\n  }\n\n  signed(): number {\n    const value = this.unsigned();\n\n    return value % 2 === 0 ? value / 2 : -(value + 1) / 2;\n  }\n}\n\nconst bad = (detail: string) => Result.fail(new DataError({ reason: \"Format\", detail }));\n\n/** Validate each bounded record once, retaining only offsets and selection metadata. */\nexport const index = (bytes: Uint8Array): Result.Result<Index, DataError> => {\n  if (\n    bytes.length !== rawBytes ||\n    bytes[0] !== 66 ||\n    bytes[1] !== 79 ||\n    bytes[2] !== 85 ||\n    bytes[3] !== 78 ||\n    bytes[4] !== 1\n  )\n    return bad(\"The bundled stroke header or byte count is invalid.\");\n\n  const reader = new Reader(bytes, 5);\n\n  if (reader.unsigned() !== ticks || reader.unsigned() !== strokeCount)\n    return bad(\"The bundled stroke precision or record count is invalid.\");\n  const records: Array<Record> = [];\n  let points = 0;\n\n  for (let ordinal = 0; ordinal < strokeCount; ordinal++) {\n    const intervals = reader.unsigned();\n    const length = intervals + 1;\n\n    if (reader.invalid || length < 4 || length > Motion.maximumSamples)\n      return bad(\"A stroke exceeds the supported sample count.\");\n    points += length;\n    if (points > pointCount) return bad(\"The bundled point count is invalid.\");\n    const offset = reader.offset;\n    const times = new Float64Array(length);\n    let whole = 0;\n\n    for (let sample = 1; sample < length; sample++) {\n      whole += reader.signed();\n      times[sample] = whole;\n    }\n    let dx = 0;\n    let dy = 0;\n\n    for (let sample = 1; sample < length; sample++) dx += reader.signed();\n    for (let sample = 1; sample < length; sample++) dy += reader.signed();\n    let previous = 0;\n\n    for (let sample = 1; sample < length; sample++) {\n      const residual = reader.signed();\n      const time = (times[sample] ?? 0) + residual / ticks;\n\n      if (Math.abs(residual) > ticks / 2 || time < previous || time > Motion.maximumDurationMillis)\n        return bad(\"A stroke has invalid or decreasing sample times.\");\n      previous = time;\n    }\n    const distance = Math.hypot(dx, dy);\n\n    if (reader.invalid || distance < 30 || previous <= 0)\n      return bad(\"A stroke has an invalid displacement or duration.\");\n    records.push({ offset, length, dx, dy, distance, duration: previous });\n  }\n  const first = records[0];\n\n  if (\n    reader.invalid ||\n    reader.offset !== bytes.length ||\n    points !== pointCount ||\n    first === undefined\n  )\n    return bad(\"The bundled stroke payload has an invalid extent.\");\n\n  return Result.succeed({ bytes, records, first, points });\n};\n\n/** The index establishes these record boundaries; only the selected coordinates are expanded. */\nexport const decode = (data: Index, record: Record): ReadonlyArray<Motion.Sample> => {\n  const reader = new Reader(data.bytes, record.offset);\n  const times = new Float64Array(record.length);\n  const xs = new Float64Array(record.length);\n  const ys = new Float64Array(record.length);\n  let value = 0;\n\n  for (let sample = 1; sample < record.length; sample++) {\n    value += reader.signed();\n    times[sample] = value;\n  }\n  value = 0;\n  for (let sample = 1; sample < record.length; sample++) {\n    value += reader.signed();\n    xs[sample] = value;\n  }\n  value = 0;\n  for (let sample = 1; sample < record.length; sample++) {\n    value += reader.signed();\n    ys[sample] = value;\n  }\n  const samples: Array<Motion.Sample> = [{ x: 0, y: 0, afterMillis: 0 }];\n\n  for (let sample = 1; sample < record.length; sample++)\n    samples.push({\n      x: xs[sample] ?? 0,\n      y: ys[sample] ?? 0,\n      afterMillis: (times[sample] ?? 0) + reader.signed() / ticks,\n    });\n\n  return samples;\n};\n\n/** Match the measured selection rule: random nearby distance, otherwise nearest absolute distance. */\nexport const select = (data: Index, distance: number, choice: number): Record => {\n  const candidates: Array<Record> = [];\n  let closest = data.first;\n\n  for (const record of data.records) {\n    if (Math.abs(Math.log(record.distance / distance)) < 0.15) candidates.push(record);\n\n    const nearer =\n      record.distance <= distance && closest.distance <= distance\n        ? record.distance > closest.distance\n        : record.distance >= distance && closest.distance >= distance\n          ? record.distance < closest.distance\n          : Math.abs(record.distance - distance) < Math.abs(closest.distance - distance);\n\n    if (nearer) closest = record;\n  }\n\n  return candidates[Math.floor(choice * candidates.length)] ?? closest;\n};\n\n/** Rotate/scale the recorded geometry, optionally mirroring across its own movement axis. */\nexport const retarget = (\n  data: Index,\n  record: Record,\n  from: Motion.Point,\n  to: Motion.Point,\n  mirror: boolean,\n): ReadonlyArray<Motion.Sample> => {\n  const source = decode(data, record);\n  const sourceX = record.dx / record.distance;\n  const sourceY = record.dy / record.distance;\n  // Normalize before subtraction so large finite coordinates cannot overflow the displacement.\n  const scale = Math.max(1, Math.abs(from.x), Math.abs(from.y), Math.abs(to.x), Math.abs(to.y));\n  const startX = from.x / scale;\n  const startY = from.y / scale;\n  const deltaX = to.x / scale - startX;\n  const deltaY = to.y / scale - startY;\n\n  const coordinate = (value: number) =>\n    Math.round(Math.max(-Number.MAX_VALUE, Math.min(Number.MAX_VALUE, value * scale)));\n\n  return source.map((sample, ordinal) => {\n    if (ordinal === 0) return { ...from, afterMillis: sample.afterMillis };\n    if (ordinal === source.length - 1) return { ...to, afterMillis: sample.afterMillis };\n    const along = (sample.x * sourceX + sample.y * sourceY) / record.distance;\n\n    const lateral =\n      ((-sample.x * sourceY + sample.y * sourceX) / record.distance) * (mirror ? -1 : 1);\n\n    return {\n      x: coordinate(startX + deltaX * along - deltaY * lateral),\n      y: coordinate(startY + deltaY * along + deltaX * lateral),\n      afterMillis: sample.afterMillis,\n    };\n  });\n};\n","// This Node-only loader owns one fixed package asset without adding a platform dependency or\n// requiring a caller filesystem service.\n// @effect-diagnostics-next-line nodeBuiltinImport:off -- reads only its own package's asset\nimport { readFile } from \"node:fs/promises\";\n\nimport { Effect, Random, Result } from \"effect\";\nimport type * as Motion from \"effect-browser/Motion\";\n\nimport { DataError, index, inflate, retarget, select } from \"./internal/strokes.ts\";\n\nconst read = Effect.tryPromise({\n  try: (signal) => readFile(new URL(\"../data/strokes.bin.br\", import.meta.url), { signal }),\n  catch: () =>\n    new DataError({\n      reason: \"Read\",\n      detail: \"The bundled human-stroke asset could not be read.\",\n    }),\n});\n\n/**\n * The recorded strokes as a pointer planner, for a presenter:\n * `Presentation.make({ motion: yield* HumanStrokes.motion })`. Loading reads, decompresses and\n * validates the package's own asset, with no network or path options, and fails `DataError`.\n */\nexport const motion: Effect.Effect<Motion.Service, DataError> = Effect.gen(function* () {\n  // No binding here holds the compressed asset, so the planner's closure keeps only the payload.\n  const decoded = index(yield* Effect.flatMap(read, inflate));\n\n  if (Result.isFailure(decoded)) return yield* decoded.failure;\n  const data = decoded.success;\n\n  const plan: Motion.Service[\"plan\"] = Effect.fnUntraced(function* (from, to) {\n    const scale = Math.max(1, Math.abs(from.x), Math.abs(from.y), Math.abs(to.x), Math.abs(to.y));\n\n    const distance =\n      Math.hypot(to.x / scale - from.x / scale, to.y / scale - from.y / scale) * scale;\n\n    if (distance < 2) return [{ ...to, afterMillis: 0 }];\n    const record = select(data, distance, yield* Random.next);\n\n    return retarget(data, record, from, to, (yield* Random.next) < 0.5);\n  });\n\n  return { plan } satisfies Motion.Service;\n});\n"],"mappings":";;;;;;;AAOA,IAAa,YAAb,cAA+B,OAAO,YAAuB,CAAC,CAAC,yBAAyB;CACtF,QAAQ,OAAO,SAAS;EAAC;EAAQ;EAAe;CAAQ,CAAC;CACzD,QAAQ,OAAO;AACjB,CAAC,CAAC,CAAC,CAAC;AAEJ,MAAa,WAAW;AACxB,MAAa,cAAc;AAE3B,MAAM,QAAQ;AACd,MAAM,aAAa,UAAU,gBAAgB;;AAG7C,MAAa,WAAW,eACtB,OAAO,WAAW;CAChB,WAAW,WAAW,YAAY,EAAE,iBAAiB,SAAS,CAAC;CAC/D,aACE,IAAI,UAAU;EACZ,QAAQ;EACR,QAAQ;CACV,CAAC;AACL,CAAC;AAoBH,IAAM,SAAN,MAAa;CACX;CACA,UAAU;CACV;CAEA,YAAY,OAAmB,SAAS,GAAG;EACzC,KAAK,QAAQ;EACb,KAAK,SAAS;CAChB;CAEA,WAAmB;EACjB,IAAI,QAAQ;EACZ,IAAI,aAAa;EAEjB,KAAK,IAAI,YAAY,GAAG,YAAY,GAAG,aAAa;GAClD,MAAM,OAAO,KAAK,MAAM,KAAK;GAE7B,IAAI,SAAS,KAAA,GAAW;IACtB,KAAK,UAAU;IAEf,OAAO;GACT;GACA,UAAU,OAAO,OAAO;GACxB,IAAI,OAAO,KAAK;IACd,IAAI,QAAQ,cAAe,YAAY,KAAK,SAAS,GAAI,KAAK,UAAU;IAExE,OAAO;GACT;GACA,cAAc;EAChB;EACA,KAAK,UAAU;EAEf,OAAO;CACT;CAEA,SAAiB;EACf,MAAM,QAAQ,KAAK,SAAS;EAE5B,OAAO,QAAQ,MAAM,IAAI,QAAQ,IAAI,EAAE,QAAQ,KAAK;CACtD;AACF;AAEA,MAAM,OAAO,WAAmB,OAAO,KAAK,IAAI,UAAU;CAAE,QAAQ;CAAU;AAAO,CAAC,CAAC;;AAGvF,MAAa,SAAS,UAAuD;CAC3E,IACE,MAAM,WAAA,YACN,MAAM,OAAO,MACb,MAAM,OAAO,MACb,MAAM,OAAO,MACb,MAAM,OAAO,MACb,MAAM,OAAO,GAEb,OAAO,IAAI,qDAAqD;CAElE,MAAM,SAAS,IAAI,OAAO,OAAO,CAAC;CAElC,IAAI,OAAO,SAAS,MAAM,SAAS,OAAO,SAAS,MAAA,OACjD,OAAO,IAAI,0DAA0D;CACvE,MAAM,UAAyB,CAAC;CAChC,IAAI,SAAS;CAEb,KAAK,IAAI,UAAU,GAAG,UAAU,aAAa,WAAW;EAEtD,MAAM,SADY,OAAO,SACF,IAAI;EAE3B,IAAI,OAAO,WAAW,SAAS,KAAK,SAAS,OAAO,gBAClD,OAAO,IAAI,8CAA8C;EAC3D,UAAU;EACV,IAAI,SAAA,SAAqB,OAAO,IAAI,qCAAqC;EACzE,MAAM,SAAS,OAAO;EACtB,MAAM,QAAQ,IAAI,aAAa,MAAM;EACrC,IAAI,QAAQ;EAEZ,KAAK,IAAI,SAAS,GAAG,SAAS,QAAQ,UAAU;GAC9C,SAAS,OAAO,OAAO;GACvB,MAAM,UAAU;EAClB;EACA,IAAI,KAAK;EACT,IAAI,KAAK;EAET,KAAK,IAAI,SAAS,GAAG,SAAS,QAAQ,UAAU,MAAM,OAAO,OAAO;EACpE,KAAK,IAAI,SAAS,GAAG,SAAS,QAAQ,UAAU,MAAM,OAAO,OAAO;EACpE,IAAI,WAAW;EAEf,KAAK,IAAI,SAAS,GAAG,SAAS,QAAQ,UAAU;GAC9C,MAAM,WAAW,OAAO,OAAO;GAC/B,MAAM,QAAQ,MAAM,WAAW,KAAK,WAAW;GAE/C,IAAI,KAAK,IAAI,QAAQ,IAAI,QAAQ,KAAK,OAAO,YAAY,OAAO,OAAO,uBACrE,OAAO,IAAI,kDAAkD;GAC/D,WAAW;EACb;EACA,MAAM,WAAW,KAAK,MAAM,IAAI,EAAE;EAElC,IAAI,OAAO,WAAW,WAAW,MAAM,YAAY,GACjD,OAAO,IAAI,mDAAmD;EAChE,QAAQ,KAAK;GAAE;GAAQ;GAAQ;GAAI;GAAI;GAAU,UAAU;EAAS,CAAC;CACvE;CACA,MAAM,QAAQ,QAAQ;CAEtB,IACE,OAAO,WACP,OAAO,WAAW,MAAM,UACxB,WAAA,WACA,UAAU,KAAA,GAEV,OAAO,IAAI,mDAAmD;CAEhE,OAAO,OAAO,QAAQ;EAAE;EAAO;EAAS;EAAO;CAAO,CAAC;AACzD;;AAGA,MAAa,UAAU,MAAa,WAAiD;CACnF,MAAM,SAAS,IAAI,OAAO,KAAK,OAAO,OAAO,MAAM;CACnD,MAAM,QAAQ,IAAI,aAAa,OAAO,MAAM;CAC5C,MAAM,KAAK,IAAI,aAAa,OAAO,MAAM;CACzC,MAAM,KAAK,IAAI,aAAa,OAAO,MAAM;CACzC,IAAI,QAAQ;CAEZ,KAAK,IAAI,SAAS,GAAG,SAAS,OAAO,QAAQ,UAAU;EACrD,SAAS,OAAO,OAAO;EACvB,MAAM,UAAU;CAClB;CACA,QAAQ;CACR,KAAK,IAAI,SAAS,GAAG,SAAS,OAAO,QAAQ,UAAU;EACrD,SAAS,OAAO,OAAO;EACvB,GAAG,UAAU;CACf;CACA,QAAQ;CACR,KAAK,IAAI,SAAS,GAAG,SAAS,OAAO,QAAQ,UAAU;EACrD,SAAS,OAAO,OAAO;EACvB,GAAG,UAAU;CACf;CACA,MAAM,UAAgC,CAAC;EAAE,GAAG;EAAG,GAAG;EAAG,aAAa;CAAE,CAAC;CAErE,KAAK,IAAI,SAAS,GAAG,SAAS,OAAO,QAAQ,UAC3C,QAAQ,KAAK;EACX,GAAG,GAAG,WAAW;EACjB,GAAG,GAAG,WAAW;EACjB,cAAc,MAAM,WAAW,KAAK,OAAO,OAAO,IAAI;CACxD,CAAC;CAEH,OAAO;AACT;;AAGA,MAAa,UAAU,MAAa,UAAkB,WAA2B;CAC/E,MAAM,aAA4B,CAAC;CACnC,IAAI,UAAU,KAAK;CAEnB,KAAK,MAAM,UAAU,KAAK,SAAS;EACjC,IAAI,KAAK,IAAI,KAAK,IAAI,OAAO,WAAW,QAAQ,CAAC,IAAI,KAAM,WAAW,KAAK,MAAM;EASjF,IANE,OAAO,YAAY,YAAY,QAAQ,YAAY,WAC/C,OAAO,WAAW,QAAQ,WAC1B,OAAO,YAAY,YAAY,QAAQ,YAAY,WACjD,OAAO,WAAW,QAAQ,WAC1B,KAAK,IAAI,OAAO,WAAW,QAAQ,IAAI,KAAK,IAAI,QAAQ,WAAW,QAAQ,GAEvE,UAAU;CACxB;CAEA,OAAO,WAAW,KAAK,MAAM,SAAS,WAAW,MAAM,MAAM;AAC/D;;AAGA,MAAa,YACX,MACA,QACA,MACA,IACA,WACiC;CACjC,MAAM,SAAS,OAAO,MAAM,MAAM;CAClC,MAAM,UAAU,OAAO,KAAK,OAAO;CACnC,MAAM,UAAU,OAAO,KAAK,OAAO;CAEnC,MAAM,QAAQ,KAAK,IAAI,GAAG,KAAK,IAAI,KAAK,CAAC,GAAG,KAAK,IAAI,KAAK,CAAC,GAAG,KAAK,IAAI,GAAG,CAAC,GAAG,KAAK,IAAI,GAAG,CAAC,CAAC;CAC5F,MAAM,SAAS,KAAK,IAAI;CACxB,MAAM,SAAS,KAAK,IAAI;CACxB,MAAM,SAAS,GAAG,IAAI,QAAQ;CAC9B,MAAM,SAAS,GAAG,IAAI,QAAQ;CAE9B,MAAM,cAAc,UAClB,KAAK,MAAM,KAAK,IAAI,CAAC,OAAO,WAAW,KAAK,IAAI,OAAO,WAAW,QAAQ,KAAK,CAAC,CAAC;CAEnF,OAAO,OAAO,KAAK,QAAQ,YAAY;EACrC,IAAI,YAAY,GAAG,OAAO;GAAE,GAAG;GAAM,aAAa,OAAO;EAAY;EACrE,IAAI,YAAY,OAAO,SAAS,GAAG,OAAO;GAAE,GAAG;GAAI,aAAa,OAAO;EAAY;EACnF,MAAM,SAAS,OAAO,IAAI,UAAU,OAAO,IAAI,WAAW,OAAO;EAEjE,MAAM,WACF,CAAC,OAAO,IAAI,UAAU,OAAO,IAAI,WAAW,OAAO,YAAa,SAAS,KAAK;EAElF,OAAO;GACL,GAAG,WAAW,SAAS,SAAS,QAAQ,SAAS,OAAO;GACxD,GAAG,WAAW,SAAS,SAAS,QAAQ,SAAS,OAAO;GACxD,aAAa,OAAO;EACtB;CACF,CAAC;AACH;;;AChPA,MAAM,OAAO,OAAO,WAAW;CAC7B,MAAM,WAAW,SAAS,IAAI,IAAI,0BAA0B,YAAY,GAAG,GAAG,EAAE,OAAO,CAAC;CACxF,aACE,IAAI,UAAU;EACZ,QAAQ;EACR,QAAQ;CACV,CAAC;AACL,CAAC;;;;;;AAOD,MAAa,SAAmD,OAAO,IAAI,aAAa;CAEtF,MAAM,UAAU,MAAM,OAAO,OAAO,QAAQ,MAAM,OAAO,CAAC;CAE1D,IAAI,OAAO,UAAU,OAAO,GAAG,OAAO,OAAO,QAAQ;CACrD,MAAM,OAAO,QAAQ;CAcrB,OAAO,EAAE,MAZ4B,OAAO,WAAW,WAAW,MAAM,IAAI;EAC1E,MAAM,QAAQ,KAAK,IAAI,GAAG,KAAK,IAAI,KAAK,CAAC,GAAG,KAAK,IAAI,KAAK,CAAC,GAAG,KAAK,IAAI,GAAG,CAAC,GAAG,KAAK,IAAI,GAAG,CAAC,CAAC;EAE5F,MAAM,WACJ,KAAK,MAAM,GAAG,IAAI,QAAQ,KAAK,IAAI,OAAO,GAAG,IAAI,QAAQ,KAAK,IAAI,KAAK,IAAI;EAE7E,IAAI,WAAW,GAAG,OAAO,CAAC;GAAE,GAAG;GAAI,aAAa;EAAE,CAAC;EACnD,MAAM,SAAS,OAAO,MAAM,UAAU,OAAO,OAAO,IAAI;EAExD,OAAO,SAAS,MAAM,QAAQ,MAAM,KAAK,OAAO,OAAO,QAAQ,EAAG;CACpE,CAEY,EAAE;AAChB,CAAC"}

package/package.json

@@ -1,17 +1,53 @@
 {
   "name": "effect-browser-human-strokes",
-  "version": "0.0.0-reserved.0",
-  "description": "Namespace bootstrap only; wait for the first qualified SDK release.",
-  "license": "MIT",
+  "version": "0.3.0-beta.10",
+  "description": "Optional recorded human pointer motion for effect-browser.",
+  "license": "(MIT AND CC-BY-4.0)",
   "repository": {
     "type": "git",
-    "url": "git+https://github.com/mannyc2/effect-agent-browserbase.git"
+    "url": "git+https://github.com/mannyc2/effect-agent-browserbase.git",
+    "directory": "packages/human-strokes"
   },
   "files": [
-    "README.md"
+    "dist",
+    "src",
+    "data",
+    "LICENSE",
+    "LICENSE-data"
   ],
+  "type": "module",
+  "sideEffects": [],
+  "exports": {
+    ".": {
+      "@effect-browser/source": "./src/index.ts",
+      "types": "./dist/index.d.mts",
+      "default": "./dist/index.mjs"
+    }
+  },
   "publishConfig": {
-    "access": "public",
-    "provenance": false
+    "access": "public"
+  },
+  "scripts": {
+    "build": "vp pack",
+    "check": "tsc --noEmit -p tsconfig.json",
+    "test": "vp test --run"
+  },
+  "devDependencies": {
+    "@effect/vitest": "4.0.0",
+    "@types/node": "26.1.2",
+    "effect": "4.0.0",
+    "effect-browser": "0.3.0-beta.10",
+    "playwright-core": "1.63.0",
+    "typescript": "7.0.2",
+    "vite": "npm:@voidzero-dev/vite-plus-core@1.1.0",
+    "vite-plus": "1.1.0",
+    "vitest": "5.0.3"
+  },
+  "peerDependencies": {
+    "effect": "~4.0.0",
+    "effect-browser": "^0.3.0-beta.10"
+  },
+  "engines": {
+    "node": "^22.18.0 || >=24.11.0"
   }
 }

package/src/HumanStrokes.ts

@@ -0,0 +1,45 @@
+// This Node-only loader owns one fixed package asset without adding a platform dependency or
+// requiring a caller filesystem service.
+// @effect-diagnostics-next-line nodeBuiltinImport:off -- reads only its own package's asset
+import { readFile } from "node:fs/promises";
+
+import { Effect, Random, Result } from "effect";
+import type * as Motion from "effect-browser/Motion";
+
+import { DataError, index, inflate, retarget, select } from "./internal/strokes.ts";
+
+const read = Effect.tryPromise({
+  try: (signal) => readFile(new URL("../data/strokes.bin.br", import.meta.url), { signal }),
+  catch: () =>
+    new DataError({
+      reason: "Read",
+      detail: "The bundled human-stroke asset could not be read.",
+    }),
+});
+
+/**
+ * The recorded strokes as a pointer planner, for a presenter:
+ * `Presentation.make({ motion: yield* HumanStrokes.motion })`. Loading reads, decompresses and
+ * validates the package's own asset, with no network or path options, and fails `DataError`.
+ */
+export const motion: Effect.Effect<Motion.Service, DataError> = Effect.gen(function* () {
+  // No binding here holds the compressed asset, so the planner's closure keeps only the payload.
+  const decoded = index(yield* Effect.flatMap(read, inflate));
+
+  if (Result.isFailure(decoded)) return yield* decoded.failure;
+  const data = decoded.success;
+
+  const plan: Motion.Service["plan"] = Effect.fnUntraced(function* (from, to) {
+    const scale = Math.max(1, Math.abs(from.x), Math.abs(from.y), Math.abs(to.x), Math.abs(to.y));
+
+    const distance =
+      Math.hypot(to.x / scale - from.x / scale, to.y / scale - from.y / scale) * scale;
+
+    if (distance < 2) return [{ ...to, afterMillis: 0 }];
+    const record = select(data, distance, yield* Random.next);
+
+    return retarget(data, record, from, to, (yield* Random.next) < 0.5);
+  });
+
+  return { plan } satisfies Motion.Service;
+});

package/src/index.ts

@@ -0,0 +1,2 @@
+export { motion } from "./HumanStrokes.ts";
+export { DataError } from "./internal/strokes.ts";

package/src/internal/strokes.ts

@@ -0,0 +1,251 @@
+import { promisify } from "node:util";
+import { brotliDecompress } from "node:zlib";
+
+import { Effect, Result, Schema } from "effect";
+import * as Motion from "effect-browser/Motion";
+
+/** The fixed bundled recording could not be read or validated. */
+export class DataError extends Schema.TaggedError<DataError>()("HumanStrokesDataError", {
+  reason: Schema.Literals(["Read", "Compression", "Format"]),
+  detail: Schema.String,
+}) {}
+
+export const rawBytes = 10_411_952;
+export const strokeCount = 32_130;
+export const pointCount = 2_604_684;
+const ticks = 4096;
+const decompress = promisify(brotliDecompress);
+
+/** Inflate on the thread pool, bounded to the payload size, without blocking the event loop. */
+export const inflate = (compressed: Uint8Array) =>
+  Effect.tryPromise({
+    try: () => decompress(compressed, { maxOutputLength: rawBytes }),
+    catch: () =>
+      new DataError({
+        reason: "Compression",
+        detail: "The bundled human-stroke asset could not be decompressed.",
+      }),
+  });
+
+export interface Record {
+  readonly offset: number;
+  readonly length: number;
+  readonly dx: number;
+  readonly dy: number;
+  readonly distance: number;
+  readonly duration: number;
+}
+
+export interface Index {
+  readonly bytes: Uint8Array;
+  readonly records: ReadonlyArray<Record>;
+  readonly first: Record;
+  readonly points: number;
+}
+
+// The private binary codec keeps original fractional milliseconds. Rounding them to integer
+// milliseconds would change 880,905 sample times, despite saving less than a megabyte on disk.
+class Reader {
+  offset: number;
+  invalid = false;
+  readonly bytes: Uint8Array;
+
+  constructor(bytes: Uint8Array, offset = 0) {
+    this.bytes = bytes;
+    this.offset = offset;
+  }
+
+  unsigned(): number {
+    let value = 0;
+    let multiplier = 1;
+
+    for (let byteIndex = 0; byteIndex < 5; byteIndex++) {
+      const byte = this.bytes[this.offset++];
+
+      if (byte === undefined) {
+        this.invalid = true;
+
+        return 0;
+      }
+      value += (byte & 127) * multiplier;
+      if (byte < 128) {
+        if (value > 0xffffffff || (byteIndex > 0 && byte === 0)) this.invalid = true;
+
+        return value;
+      }
+      multiplier *= 128;
+    }
+    this.invalid = true;
+
+    return 0;
+  }
+
+  signed(): number {
+    const value = this.unsigned();
+
+    return value % 2 === 0 ? value / 2 : -(value + 1) / 2;
+  }
+}
+
+const bad = (detail: string) => Result.fail(new DataError({ reason: "Format", detail }));
+
+/** Validate each bounded record once, retaining only offsets and selection metadata. */
+export const index = (bytes: Uint8Array): Result.Result<Index, DataError> => {
+  if (
+    bytes.length !== rawBytes ||
+    bytes[0] !== 66 ||
+    bytes[1] !== 79 ||
+    bytes[2] !== 85 ||
+    bytes[3] !== 78 ||
+    bytes[4] !== 1
+  )
+    return bad("The bundled stroke header or byte count is invalid.");
+
+  const reader = new Reader(bytes, 5);
+
+  if (reader.unsigned() !== ticks || reader.unsigned() !== strokeCount)
+    return bad("The bundled stroke precision or record count is invalid.");
+  const records: Array<Record> = [];
+  let points = 0;
+
+  for (let ordinal = 0; ordinal < strokeCount; ordinal++) {
+    const intervals = reader.unsigned();
+    const length = intervals + 1;
+
+    if (reader.invalid || length < 4 || length > Motion.maximumSamples)
+      return bad("A stroke exceeds the supported sample count.");
+    points += length;
+    if (points > pointCount) return bad("The bundled point count is invalid.");
+    const offset = reader.offset;
+    const times = new Float64Array(length);
+    let whole = 0;
+
+    for (let sample = 1; sample < length; sample++) {
+      whole += reader.signed();
+      times[sample] = whole;
+    }
+    let dx = 0;
+    let dy = 0;
+
+    for (let sample = 1; sample < length; sample++) dx += reader.signed();
+    for (let sample = 1; sample < length; sample++) dy += reader.signed();
+    let previous = 0;
+
+    for (let sample = 1; sample < length; sample++) {
+      const residual = reader.signed();
+      const time = (times[sample] ?? 0) + residual / ticks;
+
+      if (Math.abs(residual) > ticks / 2 || time < previous || time > Motion.maximumDurationMillis)
+        return bad("A stroke has invalid or decreasing sample times.");
+      previous = time;
+    }
+    const distance = Math.hypot(dx, dy);
+
+    if (reader.invalid || distance < 30 || previous <= 0)
+      return bad("A stroke has an invalid displacement or duration.");
+    records.push({ offset, length, dx, dy, distance, duration: previous });
+  }
+  const first = records[0];
+
+  if (
+    reader.invalid ||
+    reader.offset !== bytes.length ||
+    points !== pointCount ||
+    first === undefined
+  )
+    return bad("The bundled stroke payload has an invalid extent.");
+
+  return Result.succeed({ bytes, records, first, points });
+};
+
+/** The index establishes these record boundaries; only the selected coordinates are expanded. */
+export const decode = (data: Index, record: Record): ReadonlyArray<Motion.Sample> => {
+  const reader = new Reader(data.bytes, record.offset);
+  const times = new Float64Array(record.length);
+  const xs = new Float64Array(record.length);
+  const ys = new Float64Array(record.length);
+  let value = 0;
+
+  for (let sample = 1; sample < record.length; sample++) {
+    value += reader.signed();
+    times[sample] = value;
+  }
+  value = 0;
+  for (let sample = 1; sample < record.length; sample++) {
+    value += reader.signed();
+    xs[sample] = value;
+  }
+  value = 0;
+  for (let sample = 1; sample < record.length; sample++) {
+    value += reader.signed();
+    ys[sample] = value;
+  }
+  const samples: Array<Motion.Sample> = [{ x: 0, y: 0, afterMillis: 0 }];
+
+  for (let sample = 1; sample < record.length; sample++)
+    samples.push({
+      x: xs[sample] ?? 0,
+      y: ys[sample] ?? 0,
+      afterMillis: (times[sample] ?? 0) + reader.signed() / ticks,
+    });
+
+  return samples;
+};
+
+/** Match the measured selection rule: random nearby distance, otherwise nearest absolute distance. */
+export const select = (data: Index, distance: number, choice: number): Record => {
+  const candidates: Array<Record> = [];
+  let closest = data.first;
+
+  for (const record of data.records) {
+    if (Math.abs(Math.log(record.distance / distance)) < 0.15) candidates.push(record);
+
+    const nearer =
+      record.distance <= distance && closest.distance <= distance
+        ? record.distance > closest.distance
+        : record.distance >= distance && closest.distance >= distance
+          ? record.distance < closest.distance
+          : Math.abs(record.distance - distance) < Math.abs(closest.distance - distance);
+
+    if (nearer) closest = record;
+  }
+
+  return candidates[Math.floor(choice * candidates.length)] ?? closest;
+};
+
+/** Rotate/scale the recorded geometry, optionally mirroring across its own movement axis. */
+export const retarget = (
+  data: Index,
+  record: Record,
+  from: Motion.Point,
+  to: Motion.Point,
+  mirror: boolean,
+): ReadonlyArray<Motion.Sample> => {
+  const source = decode(data, record);
+  const sourceX = record.dx / record.distance;
+  const sourceY = record.dy / record.distance;
+  // Normalize before subtraction so large finite coordinates cannot overflow the displacement.
+  const scale = Math.max(1, Math.abs(from.x), Math.abs(from.y), Math.abs(to.x), Math.abs(to.y));
+  const startX = from.x / scale;
+  const startY = from.y / scale;
+  const deltaX = to.x / scale - startX;
+  const deltaY = to.y / scale - startY;
+
+  const coordinate = (value: number) =>
+    Math.round(Math.max(-Number.MAX_VALUE, Math.min(Number.MAX_VALUE, value * scale)));
+
+  return source.map((sample, ordinal) => {
+    if (ordinal === 0) return { ...from, afterMillis: sample.afterMillis };
+    if (ordinal === source.length - 1) return { ...to, afterMillis: sample.afterMillis };
+    const along = (sample.x * sourceX + sample.y * sourceY) / record.distance;
+
+    const lateral =
+      ((-sample.x * sourceY + sample.y * sourceX) / record.distance) * (mirror ? -1 : 1);
+
+    return {
+      x: coordinate(startX + deltaX * along - deltaY * lateral),
+      y: coordinate(startY + deltaY * along + deltaX * lateral),
+      afterMillis: sample.afterMillis,
+    };
+  });
+};