grepmax 0.17.17 → 0.17.18

package/dist/lib/search/searcher.js

@@ -621,16 +621,25 @@ class Searcher {
             const FUSED_WEIGHT = Number.isFinite(envBlend) && envBlend >= 0 ? envBlend : 0.5;
             if (queryPooled && topCandidates.length > STAGE2_K) {
                 const cosineScores = topCandidates.map((doc) => {
-                    if (!doc.pooled_colbert_48d)
+                    const docVec = doc.pooled_colbert_48d;
+                    // Reject missing or short vectors. Also treat an all-zero vector as
+                    // "no pooled signal" rather than a genuine cosine of 0 — chunks indexed
+                    // before the pooled-IPC fix (orchestrator.ts) stored all-zero padding,
+                    // and on a mixed index those must sort below chunks that carry real
+                    // pooled vectors, not tie with orthogonal ones.
+                    if (!docVec || docVec.length < queryPooled.length)
                         return -1;
                     // Manual cosine sim since we don't have helper here easily
                     // Assuming vectors are normalized (which they should be from orchestrator)
                     let dot = 0;
-                    const docVec = doc.pooled_colbert_48d;
+                    let nonZero = false;
                     for (let i = 0; i < queryPooled.length; i++) {
-                        dot += queryPooled[i] * (docVec[i] || 0);
+                        const c = docVec[i] || 0;
+                        if (c !== 0)
+                            nonZero = true;
+                        dot += queryPooled[i] * c;
                     }
-                    return dot;
+                    return nonZero ? dot : -1;
                 });
                 // Sort by cosine score and keep top N
                 const withScore = topCandidates.map((doc, i) => ({

package/dist/lib/workers/orchestrator.js

@@ -287,7 +287,15 @@ class WorkerOrchestrator {
                     colbert: new Int8Array(),
                     scale: 1,
                 };
-                return Object.assign(Object.assign({}, chunk), { vector: hybrid.dense, colbert: Buffer.from(hybrid.colbert), colbert_scale: hybrid.scale, pooled_colbert_48d: hybrid.pooled_colbert_48d, doc_token_ids: hybrid.token_ids });
+                return Object.assign(Object.assign({}, chunk), { vector: hybrid.dense, colbert: Buffer.from(hybrid.colbert), colbert_scale: hybrid.scale, 
+                    // Convert the pooled Float32Array to a plain number[] so it survives
+                    // the JSON IPC hop to the parent (process-child.ts → pool.ts). A typed
+                    // array JSON-serializes to a length-less {"0":..} object, which then
+                    // Array.from()s to [] on insert and pads to 48 zeros — silently making
+                    // the stage-1 cosine prefilter a no-op (searcher.ts:732).
+                    pooled_colbert_48d: hybrid.pooled_colbert_48d
+                        ? Array.from(hybrid.pooled_colbert_48d)
+                        : undefined, doc_token_ids: hybrid.token_ids });
             });
             onProgress === null || onProgress === void 0 ? void 0 : onProgress();
             (0, logger_1.debug)("orch", `processFile done: ${input.path} ${vectors.length} vectors ${(performance.now() - fileStart).toFixed(0)}ms`);

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "grepmax",
-  "version": "0.17.17",
+  "version": "0.17.18",
   "author": "Robert Owens <78518764+reowens@users.noreply.github.com>",
   "homepage": "https://github.com/reowens/grepmax",
   "bugs": {

package/plugins/grepmax/.claude-plugin/plugin.json

@@ -1,6 +1,6 @@
 {
   "name": "grepmax",
-  "version": "0.17.17",
+  "version": "0.17.18",
   "description": "Semantic code search for Claude Code. Automatically indexes your project and provides intelligent search capabilities.",
   "author": {
     "name": "Robert Owens",