@danielsimonjr/mathts-parallel 0.3.4 → 0.5.0

package/dist/index.js

@@ -1,4 +1,5 @@
 // src/ComputePool.ts
+import { pairwiseSum, norm2, pairwiseDot, scaledDistance } from "@danielsimonjr/mathts-core";
 import {
   MathWorkerPool,
   Transfer
@@ -365,6 +366,11 @@ var DEFAULT_THRESHOLD_BY_OP = {
   // to the global threshold; benchmarked memory-bound (0.09–1.19×, occasional noise
   // spikes but no persistent win) → 'never'.
   norm: "never",
+  // ACCURACY NOTE: `dot`/`distance` staying 'never' is also what keeps them stable. The
+  // sequential fallbacks use core's pairwiseDot / scaledDistance, but the worker kernels
+  // (dotChunk / distanceChunk in workerpool) still accumulate naively. Do NOT tune these off
+  // 'never' without giving those kernels the same pairwise/scaled accumulation first, or large
+  // inputs — the regime where O(n)·ε is worst — would silently revert to naive accuracy.
   dot: "never",
   // Added 2026-07-02 (WS-2): `min`/`max` are now `OpName`s (added to the union) so
   // they're tunable. Same memory-bound reduction profile as sum/mean/norm above →
@@ -614,9 +620,7 @@ var ComputePool = class {
    */
   async sum(data) {
     if (!this.shouldParallelize(data.length, "sum")) {
-      let s = 0;
-      for (let i = 0; i < data.length; i++) s += data[i];
-      return this.seqResult(s);
+      return this.seqResult(pairwiseSum(data));
     }
     return toParallelResult(await this.workerPool.sum(data));
   }
@@ -637,9 +641,7 @@ var ComputePool = class {
   async dot(a, b) {
     if (!this.shouldParallelize(a.length, "dot")) {
       if (a.length !== b.length) throw new Error("dot: vectors must have the same length");
-      let s = 0;
-      for (let i = 0; i < a.length; i++) s += a[i] * b[i];
-      return this.seqResult(s);
+      return this.seqResult(pairwiseDot(a, b));
     }
     return toParallelResult(await this.workerPool.dot(a, b));
   }
@@ -755,9 +757,7 @@ var ComputePool = class {
    */
   async norm(data) {
     if (!this.shouldParallelize(data.length, "norm")) {
-      let s = 0;
-      for (let i = 0; i < data.length; i++) s += data[i] * data[i];
-      return this.seqResult(Math.sqrt(s));
+      return this.seqResult(norm2(data));
     }
     return toParallelResult(await this.workerPool.norm(data));
   }
@@ -767,9 +767,7 @@ var ComputePool = class {
   async distance(a, b) {
     if (!this.shouldParallelize(a.length, "distance")) {
       if (a.length !== b.length) throw new Error("distance: vectors must have the same length");
-      let s = 0;
-      for (let i = 0; i < a.length; i++) s += (a[i] - b[i]) ** 2;
-      return this.seqResult(Math.sqrt(s));
+      return this.seqResult(scaledDistance(a, b));
     }
     return toParallelResult(await this.workerPool.distance(a, b));
   }

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@danielsimonjr/mathts-parallel",
-  "version": "0.3.4",
+  "version": "0.5.0",
   "description": "WebWorker parallelization for MathTS computations",
   "author": "Daniel Simon Jr.",
   "license": "MIT",
@@ -31,7 +31,8 @@
     "build:prod": "tsup src/index.ts src/matrix.worker.ts --format esm --dts --clean --minify --treeshake"
   },
   "dependencies": {
-    "@danielsimonjr/mathts-workerpool": "^0.2.1"
+    "@danielsimonjr/mathts-workerpool": "^0.2.1",
+    "@danielsimonjr/mathts-core": "^0.8.0"
   },
   "devDependencies": {
     "@types/node": "^25.5.2",