claude-mem-lite 6.30.3 → 6.30.5

package/.claude-plugin/marketplace.json

@@ -9,7 +9,7 @@
   "plugins": [
     {
       "name": "claude-mem-lite",
-      "version": "6.30.3",
+      "version": "6.30.5",
       "source": "./",
       "homepage": "https://github.com/sdsrss/claude-mem-lite",
       "description": "Persistent long-term memory for Claude Code via MCP — captures coding decisions, bugfixes, and context across sessions. FTS5 BM25 keyword search with episode batching. Single SQLite DB, no external services. A lighter, lower-cost alternative to claude-mem (episode batching + a smaller model; cost savings are an internal estimate, not a measured benchmark)."

package/.claude-plugin/plugin.json

@@ -1,6 +1,6 @@
 {
   "name": "claude-mem-lite",
-  "version": "6.30.3",
+  "version": "6.30.5",
   "description": "Persistent long-term memory for Claude Code via MCP — captures coding decisions, bugfixes, and context across sessions. FTS5 BM25 keyword search with episode batching. Single SQLite DB, no external services. A lighter, lower-cost alternative to claude-mem (episode batching + a smaller model; cost savings are an internal estimate, not a measured benchmark).",
   "author": {
     "name": "sdsrss"

package/install.mjs

@@ -483,9 +483,8 @@ export async function dbCheckRemedy(dbPath, err) {
   // its copy of the command.
   if (remedy.kind === 'set-aside') {
     return (
-      `No backup snapshot exists beside the database. Once every Claude Code session is closed, ` +
-      `set the broken file aside so a fresh store is created on the next session: ${remedy.command} ` +
-      `— memories in that file are not recoverable without a backup.`
+      `No non-empty backup snapshot exists beside the database. Once every Claude Code session is closed, ` +
+      `set the broken file aside so a fresh store is created on the next session: ${remedy.command}`
     );
   }
   return (

package/lib/db-backup.mjs

@@ -7,7 +7,7 @@
 //
 // MUST be called OUTSIDE any transaction — VACUUM cannot run inside one, which is
 // why the maintenance entry points snapshot before opening their db.transaction().
-import { readdirSync, unlinkSync, statSync } from 'fs';
+import { existsSync, readdirSync, unlinkSync, statSync } from 'fs';
 import { dirname, basename, join } from 'path';
 import { debugLog } from '../utils.mjs';
 
@@ -149,7 +149,20 @@ export function snapshotDb(db, { tag = 'pre-maintain', retain = 3 } = {}) {
     const out = `${dbPath}.${tag}-${stamp}.bak`;
     // Path is internal (db.name from our own config), but escape single quotes
     // defensively since VACUUM INTO takes a string literal, not a bound param.
-    db.exec(`VACUUM INTO '${out.replace(/'/g, "''")}'`);
+    const fresh = !existsSync(out);
+    try {
+      db.exec(`VACUUM INTO '${out.replace(/'/g, "''")}'`);
+    } catch (e) {
+      // A failed VACUUM INTO can leave its target behind: 0 bytes on a damaged store, newer than
+      // every real snapshot, so a restore command named it (D#551). Only a file it created goes.
+      if (fresh)
+        try {
+          unlinkSync(out);
+        } catch {
+          /* never created */
+        }
+      throw e;
+    }
     pruneSnapshots(dbPath, tag, retain);
     enforceBackupBudget(dbPath);
     return out;

package/lib/db-unusable.mjs

@@ -171,46 +171,49 @@ export function dbUnusableRemedy(dbPath, err) {
         `fix that directory first, then look for ${basename(dbPath)}.*.bak beside the database.`,
     };
   }
-  if (schema && snap.snapshots.length === 0) {
+  // A 0-byte `.bak` is what a failed snapshot of a damaged store left before 6.31.0 (D#551),
+  // usually the newest one; it is not a copy of anything.
+  const snapshots = snap.snapshots.filter((s) => s.size > 0);
+  const empty = snap.snapshots.length - snapshots.length;
+  const none =
+    empty > 0
+      ? `No backup snapshot beside the database holds any data (${empty} empty .bak file${empty === 1 ? '' : 's'} skipped).`
+      : 'No backup snapshot exists beside the database.';
+  if (schema && snapshots.length === 0) {
     return {
       kind: 'schema',
       command: '',
       snapshotCount: 0,
-      note: 'No backup snapshot exists beside the database.',
+      note: none,
     };
   }
-  if (snap.snapshots.length === 0) {
+  if (snapshots.length === 0) {
     return {
       kind: 'set-aside',
       command: `${clear} && mv ${shellWord(dbPath)} ${shellWord(`${dbPath}.corrupt`)}`,
       snapshotCount: 0,
-      note:
-        'No backup snapshot exists beside the database. That command sets the broken file ' +
-        'aside so a fresh store is created on the next session — memories in it are not ' +
-        'recoverable without a backup.',
+      note: `${none} That command sets the broken file aside so a fresh store is created on the next session.`,
     };
   }
   // Newest by mtime, ties broken by name (which carries an ISO stamp) so the answer is total
   // rather than dependent on readdir order — the D#9 shape.
-  const newest = snap.snapshots
-    .slice()
-    .sort((a, b) => b.mtimeMs - a.mtimeMs || (a.path < b.path ? 1 : -1))[0];
+  const newest = snapshots.slice().sort((a, b) => b.mtimeMs - a.mtimeMs || (a.path < b.path ? 1 : -1))[0];
   if (schema) {
     return {
       kind: 'schema',
       command: '',
-      snapshotCount: snap.snapshots.length,
+      snapshotCount: snapshots.length,
       note:
-        `${snap.snapshots.length} backup snapshot(s) exist beside it; the newest is ${newest.path}. ` +
+        `${snapshots.length} backup snapshot(s) exist beside it; the newest is ${newest.path}. ` +
         'Restoring one replaces the database file, so copy the broken file aside first.',
     };
   }
   return {
     kind: 'restore',
     command: `${clear} && cp ${shellWord(newest.path)} ${shellWord(dbPath)}`,
-    snapshotCount: snap.snapshots.length,
+    snapshotCount: snapshots.length,
     note:
-      `Restores the newest of ${snap.snapshots.length} backup snapshot(s). Move the broken ` +
+      `Restores the newest of ${snapshots.length} backup snapshot(s). Move the broken ` +
       'file aside first if you want to keep it for inspection.',
   };
 }

package/npm-shrinkwrap.json

@@ -1,12 +1,12 @@
 {
   "name": "claude-mem-lite",
-  "version": "6.30.3",
+  "version": "6.30.5",
   "lockfileVersion": 3,
   "requires": true,
   "packages": {
     "": {
       "name": "claude-mem-lite",
-      "version": "6.30.3",
+      "version": "6.30.5",
       "os": [
         "darwin",
         "linux",
@@ -668,9 +668,9 @@
       "license": "ISC"
     },
     "node_modules/ip-address": {
-      "version": "10.7.2",
-      "resolved": "https://registry.npmjs.org/ip-address/-/ip-address-10.7.2.tgz",
-      "integrity": "sha512-7H/2gFSIitxc0hG3nOI1glS8QLo/EHBFFLk8vEUjXY/xu0AdL8jZ9U1IzO2PUm0d2D/ofQcAifb0g6OBkt8U7w==",
+      "version": "10.7.4",
+      "resolved": "https://registry.npmjs.org/ip-address/-/ip-address-10.7.4.tgz",
+      "integrity": "sha512-DWBMKyeM25D70nrIiTkgQth59/G+naKOTep6huF9j+GmeK3DMD60Zvxg5d5qQnz+38AHgou6ean2LECX+lrKDg==",
       "license": "MIT",
       "engines": {
         "node": ">= 12"

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "claude-mem-lite",
-  "version": "6.30.3",
+  "version": "6.30.5",
   "description": "Persistent long-term memory for Claude Code via MCP — captures coding decisions, bugfixes, and context across sessions. FTS5 BM25 keyword search with episode batching. Single SQLite DB, no external services. A lighter, lower-cost alternative to claude-mem (episode batching + a smaller model; cost savings are an internal estimate, not a measured benchmark).",
   "type": "module",
   "packageManager": "npm@10.9.2",