claude-mem-lite 2.34.2 → 2.34.4

package/.claude-plugin/marketplace.json

@@ -10,7 +10,7 @@
   "plugins": [
     {
       "name": "claude-mem-lite",
-      "version": "2.34.2",
+      "version": "2.34.4",
       "source": "./",
       "description": "Lightweight persistent memory system for Claude Code — FTS5 search, episode batching, error-triggered recall"
     }

package/.claude-plugin/plugin.json

@@ -1,6 +1,6 @@
 {
   "name": "claude-mem-lite",
-  "version": "2.34.2",
+  "version": "2.34.4",
   "description": "Lightweight persistent memory system for Claude Code — FTS5 search, episode batching, error-triggered recall",
   "author": {
     "name": "sdsrss"

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "claude-mem-lite",
-  "version": "2.34.2",
+  "version": "2.34.4",
   "description": "Lightweight persistent memory system for Claude Code",
   "type": "module",
   "engines": {

package/scripts/prompt-search-utils.mjs

@@ -9,12 +9,23 @@ const CONFIRM_RE = /^(y(es)?|no?|ok|done|go|sure|lgtm|thanks?|ty|继续|确认|
 const SLASH_CMD_RE = /^\//;
 const PURE_OP_RE = /^(git\s+(commit|push|merge)|npm\s+(publish|deploy))\b/i;
 
+/**
+ * CJK-weighted effective length. CJK characters (CJK Unified Ideographs
+ * main + extension A) carry ~3x the semantic token density of Latin
+ * characters — a 5-char Chinese phrase like "优化数据库" encodes roughly
+ * the same information as a 15-char English equivalent. Used by every
+ * length gate downstream of the prompt hook so Latin-calibrated
+ * thresholds (8 / 15) don't falsely reject substantive CJK prompts.
+ */
+export function computeEffectiveLen(text) {
+  if (!text) return 0;
+  const cjkCount = (text.match(/[\u4e00-\u9fff\u3400-\u4dbf]/g) || []).length;
+  return (text.length - cjkCount) + cjkCount * 3;
+}
+
 export function shouldSkip(text) {
   if (!text) return true;
-  // CJK characters carry ~3x semantic weight per char vs Latin
-  const cjkCount = (text.match(/[\u4e00-\u9fff\u3400-\u4dbf]/g) || []).length;
-  const effectiveLen = (text.length - cjkCount) + cjkCount * 3;
-  if (effectiveLen < 8) return true;
+  if (computeEffectiveLen(text) < 8) return true;
   const trimmed = text.trim();
   if (CONFIRM_RE.test(trimmed)) return true;
   if (SLASH_CMD_RE.test(trimmed)) return true;

package/scripts/user-prompt-search.js

@@ -8,7 +8,7 @@ import { sanitizeFtsQuery, relaxFtsQueryToOr, truncate, typeIcon, inferProject,
 import { writeFileSync, readFileSync, existsSync, renameSync } from 'fs';
 import { join } from 'path';
 import Database from 'better-sqlite3';
-import { shouldSkip, detectIntent, shouldSkipByDedup, extractFiles, extractErrorSignature, DEDUP_STALE_MS, matchRegistrySkillName } from './prompt-search-utils.mjs';
+import { shouldSkip, computeEffectiveLen, detectIntent, shouldSkipByDedup, extractFiles, extractErrorSignature, DEDUP_STALE_MS, matchRegistrySkillName } from './prompt-search-utils.mjs';
 
 // ─── Constants ──────────────────────────────────────────────────────────────
 
@@ -16,22 +16,26 @@ const INJECTED_IDS_FILE = join(DB_DIR, 'runtime', `.claude-mem-injected-${inferP
 const MAX_RESULTS = 5;
 const LOOKBACK_MS = 60 * 86400000; // 60 days
 
-// T3 (v2.31): BM25 magnitude threshold. OBS_BM25 (in scoring-sql.mjs) returns the
-// raw bm25() value, which in SQLite FTS5 is always negative — lower = better match.
-// The `relevance` column multiplies that negative bm25 by positive decay / type /
-// importance weights, keeping the sign negative. "Stronger match" therefore means
-// larger magnitude, so we compare against `Math.abs(relevance)`.
+// T3 (v2.31): per-row BM25 magnitude floor. OBS_BM25 (in scoring-sql.mjs)
+// returns the raw bm25() value — negative, smaller = better. Multiplied by
+// decay × type-quality × (0.5+0.5·importance), sign stays negative. We
+// compare against Math.abs(relevance).
 //
-// Empirically (see Task 3 probe in docs/plans/2026-04-14-mem-v2.31-mvp.md):
-//   - OR-fallback single-stem match: |rel| ~ 3e-6
-//   - Multi-term AND match w/ importance+type boost: |rel| ~ 2e-5 .. 5e-5
-// The plan's hinted default (3.5) was a guess that's six orders of magnitude too
-// high for this codebase's scoring expression. 1e-5 suppresses OR-fallback noise
-// while preserving real hits. Env-overridable for tuning without a redeploy.
+// v2.34.3 note: the historic comment claimed |rel| falls in 3e-6..5e-5 range.
+// Re-measured against real data (see v2.34.3 CHANGELOG probe), actual scores
+// span ~6..133 across SIGNAL / META / NOISE prompts — the scoring expression
+// was revised in later versions and this constant was never retuned. 1e-5 now
+// acts as a NULL-rel guard, not a real noise filter. The primary noise gate
+// is TOP_REL_FLOOR below, which drops the whole FTS set when the best match
+// is weak.
 const BM25_MIN_SCORE = Number(process.env.CLAUDE_MEM_UPS_BM25_MIN || 1e-5);
-// Raw-character minimum length for the prompt. Additional to the CJK-weighted
-// `shouldSkip()` effective-length gate; catches medium-short Latin prompts that
-// survive `shouldSkip` but carry too few tokens to justify an FTS lookup.
+// CJK-weighted minimum length for the prompt. Catches medium-short Latin
+// prompts ("run tests", "fix bug now") that survive `shouldSkip`'s weaker 8-unit
+// floor but carry too few tokens to justify an FTS lookup.
+// v2.34.4: applied to `computeEffectiveLen(prompt)`, not raw char count — a
+// 14-char CJK prompt ("优化 hook 性能降低延迟") scores 30 effective units and
+// now reaches FTS, matching shouldSkip's CJK-weighted gate rather than silently
+// failing the raw-char one.
 const PROMPT_MIN_LENGTH = 15;
 
 // v2.33.1: follow-up prompts ("前面那个", "继续 X", "再看看 Y") are short by
@@ -41,6 +45,27 @@ const PROMPT_MIN_LENGTH = 15;
 const FOLLOWUP_PROMPT_MIN_LENGTH = 8;
 const FOLLOWUP_BM25_MIN_SCORE = Number(process.env.CLAUDE_MEM_UPS_BM25_MIN_FOLLOWUP || 5e-6);
 
+// v2.34.3: top-|rel| sanity gate. BM25_MIN_SCORE filters per-row; this floor
+// gates the entire FTS set. Noise prompts ("today's date", "current time")
+// produce OR-fallback leakage where every hit shares one tangential stem and
+// per-row filtering leaves all of them through. When the best match scores
+// below this floor, the whole FTS result set is dropped.
+//
+// Empirical distribution (v2.34.3 probe, 12 prompts):
+//   SIGNAL top-|rel|   60..133
+//   NOISE  top-|rel|   25..48
+//   WEAK-META          6.86..33
+// Default 50 sits in the clean 48→60 gap. Env override for project tuning.
+// Error-signature hits (sigRows) and file-recall (fileRows) bypass this gate —
+// both are precision passes with independent relevance signal.
+//
+// Note: no follow-up halving (unlike PROMPT_MIN_LENGTH / BM25_MIN_SCORE).
+// Those lower the length/per-row bar to let short context-dependent prompts
+// through, but the top-|rel| gap is an absolute distribution separator —
+// lowering it in follow-up mode re-admits the 37..48 noise band that the
+// gate exists to drop.
+const TOP_REL_FLOOR = Number(process.env.CLAUDE_MEM_UPS_TOP_MIN || 50);
+
 function isFollowUpSession() {
   try {
     const raw = readFileSync(INJECTED_IDS_FILE, 'utf8');
@@ -275,7 +300,7 @@ async function main() {
   // short continuations ("前面那个?", "does it work?") depend on prior context.
   const followUp = isFollowUpSession();
   const promptMinLen = followUp ? FOLLOWUP_PROMPT_MIN_LENGTH : PROMPT_MIN_LENGTH;
-  if (promptText.trim().length < promptMinLen) return;
+  if (computeEffectiveLen(promptText.trim()) < promptMinLen) return;
   const bm25Floor = followUp ? FOLLOWUP_BM25_MIN_SCORE : BM25_MIN_SCORE;
 
   let db;
@@ -323,6 +348,16 @@ async function main() {
         typeof r.relevance === 'number' && Math.abs(r.relevance) >= bm25Floor
       );
 
+      // v2.34.3: top-|rel| sanity gate. Per-row filtering above leaves noise
+      // prompts intact when many rows share a weak stem (all in 25..48 range).
+      // If the best remaining FTS match is below the top floor, drop the
+      // whole FTS set — noise prompts should produce no FTS injection.
+      // Query orders by `relevance` ASC; negative values → ftsRows[0] has the
+      // largest magnitude (strongest match) in this scoring expression.
+      if (ftsRows.length > 0 && Math.abs(ftsRows[0].relevance) < TOP_REL_FLOOR) {
+        ftsRows = [];
+      }
+
       // Merge: FTS results first, then file results, deduplicated
       const seen = new Set(ftsRows.map(r => r.id));
       rows = [...ftsRows];