akm-cli 0.9.17 → 0.9.19-alpha.1

package/dist/scripts/akm-migrate-node.js

@@ -28540,6 +28540,7 @@ function shapeProposalEntry(entry, detail) {
       "confidence",
       "gateDecision",
       "review",
+      "reviewHistory",
       "retirement"
     ]);
   }
@@ -28555,6 +28556,7 @@ function shapeProposalEntry(entry, detail) {
     "gateDecision",
     "payload",
     "review",
+    "reviewHistory",
     "retirement",
     "retiredArchive",
     "promotionSource",
@@ -28619,7 +28621,10 @@ function shapeProposalDiffOutput(result, detail) {
     ref: result.ref,
     isNew: result.isNew,
     unified: result.unified,
-    ...result.targetPath !== undefined ? { targetPath: result.targetPath } : {}
+    ...result.targetPath !== undefined ? { targetPath: result.targetPath } : {},
+    ...result.op !== undefined ? { op: result.op } : {},
+    ...result.retirement !== undefined ? { retirement: result.retirement } : {},
+    ...result.note !== undefined ? { note: result.note } : {}
   };
   if (detail === "full") {
     return { schemaVersion: result.schemaVersion, ...base };
@@ -29041,6 +29046,7 @@ var PASSTHROUGH_COMMANDS = [
   "proposal-accept-batch",
   "proposal-drain",
   "proposal-reject-batch",
+  "proposal-reopen-batch",
   "proposal-revert",
   "registry-add",
   "registry-list",
@@ -29112,6 +29118,14 @@ var proposalRejectShapes = [
   }
 ];
 
+// src/output/shapes/proposal/reopen.ts
+var proposalReopenShapes = [
+  {
+    command: "proposal-reopen",
+    handler: (result, detail) => shapeProposalRejectOutput(result, detail)
+  }
+];
+
 // src/output/shapes/proposal/show.ts
 var proposalShowShapes = [
   {
@@ -29202,6 +29216,7 @@ var BUILT_IN_OUTPUT_SHAPES = [
   ...proposalShowShapes,
   ...proposalAcceptShapes,
   ...proposalRejectShapes,
+  ...proposalReopenShapes,
   ...proposalDiffShapes,
   ...proposalProducerShapes,
   ...envListShapes,
@@ -30423,6 +30438,31 @@ Generate one with \`akm improve <ref>\` or \`akm proposal new <type> <name> --ta
   return lines.join(`
 `).trimEnd();
 }
+function retireVerdictLines(retirement) {
+  const lines = [
+    `retire.label: ${String(retirement.judgeLabel)} (cosine=${String(retirement.cosine)})`,
+    `retire.reason: ${String(retirement.judgeReason)}`
+  ];
+  const continuityRisk = retirement.continuityRisk;
+  if (continuityRisk) {
+    const failingQueries = typeof continuityRisk.failingQueries === "number" ? continuityRisk.failingQueries : 0;
+    const unverifiedQueries = typeof continuityRisk.unverifiedQueries === "number" ? continuityRisk.unverifiedQueries : 0;
+    const summary = [];
+    if (failingQueries > 0) {
+      summary.push(`${failingQueries} of the retired asset's own quer${failingQueries === 1 ? "y" : "ies"} would not have found the successor top 10`);
+    }
+    if (unverifiedQueries > 0) {
+      summary.push(`${unverifiedQueries} quer${unverifiedQueries === 1 ? "y" : "ies"} unverified (search failed or used the keyword-only fallback)`);
+    }
+    lines.push(`retire.continuityRisk: ${summary.join("; ")} — excluded from bulk accept`);
+    const ranks = Array.isArray(continuityRisk.ranks) ? continuityRisk.ranks : [];
+    for (const rank of ranks) {
+      const successorRank = rank.successorRank === null || rank.successorRank === undefined ? "absent from top 10" : `#${String(rank.successorRank)}`;
+      lines.push(`  - "${String(rank.query)}": retired #${String(rank.retiredRank)}, successor ${successorRank}`);
+    }
+  }
+  return lines;
+}
 function formatProposalShowPlain(r) {
   const p = r.proposal;
   const lines = [];
@@ -30458,29 +30498,17 @@ function formatProposalShowPlain(r) {
     if (review.decidedAt)
       lines.push(`review.decidedAt: ${String(review.decidedAt)}`);
   }
+  const history = Array.isArray(p.reviewHistory) ? p.reviewHistory : [];
+  for (const entry of history) {
+    const undone = entry.review;
+    const was = undone ? `${String(undone.outcome ?? "?")}${undone.reason ? `: ${String(undone.reason)}` : ""} (${String(undone.decidedAt ?? "?")})` : "an unrecorded review";
+    const why = entry.reopenReason ? ` (${String(entry.reopenReason)})` : "";
+    lines.push(`reopened: ${String(entry.reopenedAt)}${why}, undoing ${was}`);
+  }
   const retirement = p.retirement;
   if (retirement) {
     lines.push(`retire: ${String(retirement.retiredRef)} -> ${String(retirement.successorRef)}`);
-    lines.push(`retire.label: ${String(retirement.judgeLabel)} (cosine=${String(retirement.cosine)})`);
-    lines.push(`retire.reason: ${String(retirement.judgeReason)}`);
-    const continuityRisk = retirement.continuityRisk;
-    if (continuityRisk) {
-      const failingQueries = typeof continuityRisk.failingQueries === "number" ? continuityRisk.failingQueries : 0;
-      const unverifiedQueries = typeof continuityRisk.unverifiedQueries === "number" ? continuityRisk.unverifiedQueries : 0;
-      const summary = [];
-      if (failingQueries > 0) {
-        summary.push(`${failingQueries} of the retired asset's own quer${failingQueries === 1 ? "y" : "ies"} would not have found the successor top 10`);
-      }
-      if (unverifiedQueries > 0) {
-        summary.push(`${unverifiedQueries} quer${unverifiedQueries === 1 ? "y" : "ies"} unverified (search failed or used the keyword-only fallback)`);
-      }
-      lines.push(`retire.continuityRisk: ${summary.join("; ")} — excluded from bulk accept`);
-      const ranks = Array.isArray(continuityRisk.ranks) ? continuityRisk.ranks : [];
-      for (const rank of ranks) {
-        const successorRank = rank.successorRank === null || rank.successorRank === undefined ? "absent from top 10" : `#${String(rank.successorRank)}`;
-        lines.push(`  - "${String(rank.query)}": retired #${String(rank.retiredRank)}, successor ${successorRank}`);
-      }
-    }
+    lines.push(...retireVerdictLines(retirement));
   }
   const validation = r.validation;
   if (validation) {
@@ -30504,7 +30532,7 @@ function formatProposalShowPlain(r) {
     }
   }
   const payload = p.payload;
-  if (payload && typeof payload.content === "string") {
+  if (!retirement && payload && typeof payload.content === "string") {
     lines.push("");
     lines.push("payload:");
     lines.push(payload.content);
@@ -30519,6 +30547,19 @@ function formatProposalRejectPlain(r) {
   const reason = r.reason ? ` (${String(r.reason)})` : "";
   return `Rejected proposal ${String(r.id)} (${String(r.ref)})${reason}`;
 }
+function formatProposalReopenPlain(r) {
+  const reason = r.reason ? ` (${String(r.reason)})` : "";
+  return `Reopened proposal ${String(r.id)} (${String(r.ref)}) [pending]${reason}`;
+}
+function formatProposalReopenBatchPlain(r) {
+  const results = Array.isArray(r.results) ? r.results : [];
+  const reason = results[0]?.reason ? ` (${String(results[0].reason)})` : "";
+  return [
+    `Reopened ${results.length} proposal(s) [pending]${reason}`,
+    ...results.map((result) => `  ${String(result.id)}  ${String(result.ref)}`)
+  ].join(`
+`);
+}
 function formatProposalDrainPlain(r) {
   const applyMode = String(r.applyMode ?? "queue");
   const promoted = Array.isArray(r.promoted) ? r.promoted : [];
@@ -30548,8 +30589,21 @@ function formatProposalDrainPlain(r) {
 `).trimEnd();
 }
 function formatProposalDiffPlain(r) {
-  const header = r.isNew ? `# proposal ${String(r.id)} (new asset: ${String(r.ref)})` : `# proposal ${String(r.id)} (update: ${String(r.ref)})`;
   const unified = typeof r.unified === "string" ? r.unified : "";
+  if (r.op === "delete") {
+    const retirement = r.retirement;
+    const subject = retirement ? `${String(retirement.retiredRef)} -> ${String(retirement.successorRef)}` : String(r.ref);
+    const lines = [`# proposal ${String(r.id)} (retire: ${subject})`];
+    if (retirement)
+      lines.push(...retireVerdictLines(retirement));
+    if (typeof r.note === "string")
+      lines.push(`note: ${r.note}`);
+    if (unified)
+      lines.push(unified);
+    return lines.join(`
+`);
+  }
+  const header = r.isNew ? `# proposal ${String(r.id)} (new asset: ${String(r.ref)})` : `# proposal ${String(r.id)} (update: ${String(r.ref)})`;
   if (!unified)
     return `${header}
 (no changes)`;
@@ -52064,6 +52118,7 @@ import os6 from "node:os";
 import path44 from "node:path";
 
 // src/storage/sqlite-read-snapshot.ts
+import { spawnSync as spawnSync5 } from "node:child_process";
 import fs36 from "node:fs";
 import os5 from "node:os";
 import path43 from "node:path";
@@ -52108,6 +52163,26 @@ function fingerprintsEqual(left, right) {
   const sameFile = (a, b) => a?.size === b?.size && a?.mtimeNs === b?.mtimeNs && a?.ctimeNs === b?.ctimeNs;
   return sameFile(left.main, right.main) && sameFile(left.wal, right.wal);
 }
+function copyFileOutsideThisProcess(source, destination) {
+  if (process.platform === "win32") {
+    fs36.copyFileSync(source, destination);
+    return;
+  }
+  const result = spawnSync5("cp", ["--", source, destination], {
+    encoding: "utf8",
+    stdio: ["ignore", "ignore", "pipe"]
+  });
+  if (result.error) {
+    throw new SqliteReadSnapshotUnavailableError(`cannot run cp to copy ${source}: ${result.error.message}`);
+  }
+  if (result.status === 0)
+    return;
+  if (fileFingerprint(source) === undefined) {
+    throw Object.assign(new Error(`${source} disappeared while it was being copied`), { code: "ENOENT" });
+  }
+  const reason = result.stderr.trim() || (result.signal ? `killed by ${result.signal}` : `exit status ${result.status}`);
+  throw new Error(`cp could not copy ${source}: ${reason}`);
+}
 function openSqliteReadSnapshot(dbPath) {
   if (!pathExists(dbPath))
     return;
@@ -52123,9 +52198,9 @@ function openSqliteReadSnapshot(dbPath) {
         if (pathExists(`${dbPath}-journal`))
           continue;
         const before = databaseFingerprint(dbPath);
-        fs36.copyFileSync(dbPath, snapshotPath);
+        copyFileOutsideThisProcess(dbPath, snapshotPath);
         if (before.wal)
-          fs36.copyFileSync(`${dbPath}-wal`, `${snapshotPath}-wal`);
+          copyFileOutsideThisProcess(`${dbPath}-wal`, `${snapshotPath}-wal`);
         else
           fs36.rmSync(`${snapshotPath}-wal`, { force: true });
         const after = databaseFingerprint(dbPath);
@@ -52894,6 +52969,8 @@ var proposalFormatters = [
   { command: "proposal-show", handler: (r) => formatProposalShowPlain(r) },
   { command: "proposal-accept", handler: (r) => formatProposalAcceptPlain(r) },
   { command: "proposal-reject", handler: (r) => formatProposalRejectPlain(r) },
+  { command: "proposal-reopen", handler: (r) => formatProposalReopenPlain(r) },
+  { command: "proposal-reopen-batch", handler: (r) => formatProposalReopenBatchPlain(r) },
   { command: "proposal-diff", handler: (r) => formatProposalDiffPlain(r) },
   { command: "proposal-drain", handler: (r) => formatProposalDrainPlain(r) }
 ];

package/dist/scripts/akm-migrate.js

@@ -27868,6 +27868,7 @@ function shapeProposalEntry(entry, detail) {
       "confidence",
       "gateDecision",
       "review",
+      "reviewHistory",
       "retirement"
     ]);
   }
@@ -27883,6 +27884,7 @@ function shapeProposalEntry(entry, detail) {
     "gateDecision",
     "payload",
     "review",
+    "reviewHistory",
     "retirement",
     "retiredArchive",
     "promotionSource",
@@ -27947,7 +27949,10 @@ function shapeProposalDiffOutput(result, detail) {
     ref: result.ref,
     isNew: result.isNew,
     unified: result.unified,
-    ...result.targetPath !== undefined ? { targetPath: result.targetPath } : {}
+    ...result.targetPath !== undefined ? { targetPath: result.targetPath } : {},
+    ...result.op !== undefined ? { op: result.op } : {},
+    ...result.retirement !== undefined ? { retirement: result.retirement } : {},
+    ...result.note !== undefined ? { note: result.note } : {}
   };
   if (detail === "full") {
     return { schemaVersion: result.schemaVersion, ...base };
@@ -28369,6 +28374,7 @@ var PASSTHROUGH_COMMANDS = [
   "proposal-accept-batch",
   "proposal-drain",
   "proposal-reject-batch",
+  "proposal-reopen-batch",
   "proposal-revert",
   "registry-add",
   "registry-list",
@@ -28440,6 +28446,14 @@ var proposalRejectShapes = [
   }
 ];
 
+// src/output/shapes/proposal/reopen.ts
+var proposalReopenShapes = [
+  {
+    command: "proposal-reopen",
+    handler: (result, detail) => shapeProposalRejectOutput(result, detail)
+  }
+];
+
 // src/output/shapes/proposal/show.ts
 var proposalShowShapes = [
   {
@@ -28530,6 +28544,7 @@ var BUILT_IN_OUTPUT_SHAPES = [
   ...proposalShowShapes,
   ...proposalAcceptShapes,
   ...proposalRejectShapes,
+  ...proposalReopenShapes,
   ...proposalDiffShapes,
   ...proposalProducerShapes,
   ...envListShapes,
@@ -29751,6 +29766,31 @@ Generate one with \`akm improve <ref>\` or \`akm proposal new <type> <name> --ta
   return lines.join(`
 `).trimEnd();
 }
+function retireVerdictLines(retirement) {
+  const lines = [
+    `retire.label: ${String(retirement.judgeLabel)} (cosine=${String(retirement.cosine)})`,
+    `retire.reason: ${String(retirement.judgeReason)}`
+  ];
+  const continuityRisk = retirement.continuityRisk;
+  if (continuityRisk) {
+    const failingQueries = typeof continuityRisk.failingQueries === "number" ? continuityRisk.failingQueries : 0;
+    const unverifiedQueries = typeof continuityRisk.unverifiedQueries === "number" ? continuityRisk.unverifiedQueries : 0;
+    const summary = [];
+    if (failingQueries > 0) {
+      summary.push(`${failingQueries} of the retired asset's own quer${failingQueries === 1 ? "y" : "ies"} would not have found the successor top 10`);
+    }
+    if (unverifiedQueries > 0) {
+      summary.push(`${unverifiedQueries} quer${unverifiedQueries === 1 ? "y" : "ies"} unverified (search failed or used the keyword-only fallback)`);
+    }
+    lines.push(`retire.continuityRisk: ${summary.join("; ")} \u2014 excluded from bulk accept`);
+    const ranks = Array.isArray(continuityRisk.ranks) ? continuityRisk.ranks : [];
+    for (const rank of ranks) {
+      const successorRank = rank.successorRank === null || rank.successorRank === undefined ? "absent from top 10" : `#${String(rank.successorRank)}`;
+      lines.push(`  - "${String(rank.query)}": retired #${String(rank.retiredRank)}, successor ${successorRank}`);
+    }
+  }
+  return lines;
+}
 function formatProposalShowPlain(r) {
   const p = r.proposal;
   const lines = [];
@@ -29786,29 +29826,17 @@ function formatProposalShowPlain(r) {
     if (review.decidedAt)
       lines.push(`review.decidedAt: ${String(review.decidedAt)}`);
   }
+  const history = Array.isArray(p.reviewHistory) ? p.reviewHistory : [];
+  for (const entry of history) {
+    const undone = entry.review;
+    const was = undone ? `${String(undone.outcome ?? "?")}${undone.reason ? `: ${String(undone.reason)}` : ""} (${String(undone.decidedAt ?? "?")})` : "an unrecorded review";
+    const why = entry.reopenReason ? ` (${String(entry.reopenReason)})` : "";
+    lines.push(`reopened: ${String(entry.reopenedAt)}${why}, undoing ${was}`);
+  }
   const retirement = p.retirement;
   if (retirement) {
     lines.push(`retire: ${String(retirement.retiredRef)} -> ${String(retirement.successorRef)}`);
-    lines.push(`retire.label: ${String(retirement.judgeLabel)} (cosine=${String(retirement.cosine)})`);
-    lines.push(`retire.reason: ${String(retirement.judgeReason)}`);
-    const continuityRisk = retirement.continuityRisk;
-    if (continuityRisk) {
-      const failingQueries = typeof continuityRisk.failingQueries === "number" ? continuityRisk.failingQueries : 0;
-      const unverifiedQueries = typeof continuityRisk.unverifiedQueries === "number" ? continuityRisk.unverifiedQueries : 0;
-      const summary = [];
-      if (failingQueries > 0) {
-        summary.push(`${failingQueries} of the retired asset's own quer${failingQueries === 1 ? "y" : "ies"} would not have found the successor top 10`);
-      }
-      if (unverifiedQueries > 0) {
-        summary.push(`${unverifiedQueries} quer${unverifiedQueries === 1 ? "y" : "ies"} unverified (search failed or used the keyword-only fallback)`);
-      }
-      lines.push(`retire.continuityRisk: ${summary.join("; ")} \u2014 excluded from bulk accept`);
-      const ranks = Array.isArray(continuityRisk.ranks) ? continuityRisk.ranks : [];
-      for (const rank of ranks) {
-        const successorRank = rank.successorRank === null || rank.successorRank === undefined ? "absent from top 10" : `#${String(rank.successorRank)}`;
-        lines.push(`  - "${String(rank.query)}": retired #${String(rank.retiredRank)}, successor ${successorRank}`);
-      }
-    }
+    lines.push(...retireVerdictLines(retirement));
   }
   const validation = r.validation;
   if (validation) {
@@ -29832,7 +29860,7 @@ function formatProposalShowPlain(r) {
     }
   }
   const payload = p.payload;
-  if (payload && typeof payload.content === "string") {
+  if (!retirement && payload && typeof payload.content === "string") {
     lines.push("");
     lines.push("payload:");
     lines.push(payload.content);
@@ -29847,6 +29875,19 @@ function formatProposalRejectPlain(r) {
   const reason = r.reason ? ` (${String(r.reason)})` : "";
   return `Rejected proposal ${String(r.id)} (${String(r.ref)})${reason}`;
 }
+function formatProposalReopenPlain(r) {
+  const reason = r.reason ? ` (${String(r.reason)})` : "";
+  return `Reopened proposal ${String(r.id)} (${String(r.ref)}) [pending]${reason}`;
+}
+function formatProposalReopenBatchPlain(r) {
+  const results = Array.isArray(r.results) ? r.results : [];
+  const reason = results[0]?.reason ? ` (${String(results[0].reason)})` : "";
+  return [
+    `Reopened ${results.length} proposal(s) [pending]${reason}`,
+    ...results.map((result) => `  ${String(result.id)}  ${String(result.ref)}`)
+  ].join(`
+`);
+}
 function formatProposalDrainPlain(r) {
   const applyMode = String(r.applyMode ?? "queue");
   const promoted = Array.isArray(r.promoted) ? r.promoted : [];
@@ -29876,8 +29917,21 @@ function formatProposalDrainPlain(r) {
 `).trimEnd();
 }
 function formatProposalDiffPlain(r) {
-  const header = r.isNew ? `# proposal ${String(r.id)} (new asset: ${String(r.ref)})` : `# proposal ${String(r.id)} (update: ${String(r.ref)})`;
   const unified = typeof r.unified === "string" ? r.unified : "";
+  if (r.op === "delete") {
+    const retirement = r.retirement;
+    const subject = retirement ? `${String(retirement.retiredRef)} -> ${String(retirement.successorRef)}` : String(r.ref);
+    const lines = [`# proposal ${String(r.id)} (retire: ${subject})`];
+    if (retirement)
+      lines.push(...retireVerdictLines(retirement));
+    if (typeof r.note === "string")
+      lines.push(`note: ${r.note}`);
+    if (unified)
+      lines.push(unified);
+    return lines.join(`
+`);
+  }
+  const header = r.isNew ? `# proposal ${String(r.id)} (new asset: ${String(r.ref)})` : `# proposal ${String(r.id)} (update: ${String(r.ref)})`;
   if (!unified)
     return `${header}
 (no changes)`;
@@ -52059,6 +52113,7 @@ import os6 from "os";
 import path44 from "path";
 
 // src/storage/sqlite-read-snapshot.ts
+import { spawnSync as spawnSync5 } from "child_process";
 import fs36 from "fs";
 import os5 from "os";
 import path43 from "path";
@@ -52103,6 +52158,26 @@ function fingerprintsEqual(left, right) {
   const sameFile = (a, b) => a?.size === b?.size && a?.mtimeNs === b?.mtimeNs && a?.ctimeNs === b?.ctimeNs;
   return sameFile(left.main, right.main) && sameFile(left.wal, right.wal);
 }
+function copyFileOutsideThisProcess(source, destination) {
+  if (process.platform === "win32") {
+    fs36.copyFileSync(source, destination);
+    return;
+  }
+  const result = spawnSync5("cp", ["--", source, destination], {
+    encoding: "utf8",
+    stdio: ["ignore", "ignore", "pipe"]
+  });
+  if (result.error) {
+    throw new SqliteReadSnapshotUnavailableError(`cannot run cp to copy ${source}: ${result.error.message}`);
+  }
+  if (result.status === 0)
+    return;
+  if (fileFingerprint(source) === undefined) {
+    throw Object.assign(new Error(`${source} disappeared while it was being copied`), { code: "ENOENT" });
+  }
+  const reason = result.stderr.trim() || (result.signal ? `killed by ${result.signal}` : `exit status ${result.status}`);
+  throw new Error(`cp could not copy ${source}: ${reason}`);
+}
 function openSqliteReadSnapshot(dbPath) {
   if (!pathExists(dbPath))
     return;
@@ -52118,9 +52193,9 @@ function openSqliteReadSnapshot(dbPath) {
         if (pathExists(`${dbPath}-journal`))
           continue;
         const before = databaseFingerprint(dbPath);
-        fs36.copyFileSync(dbPath, snapshotPath);
+        copyFileOutsideThisProcess(dbPath, snapshotPath);
         if (before.wal)
-          fs36.copyFileSync(`${dbPath}-wal`, `${snapshotPath}-wal`);
+          copyFileOutsideThisProcess(`${dbPath}-wal`, `${snapshotPath}-wal`);
         else
           fs36.rmSync(`${snapshotPath}-wal`, { force: true });
         const after = databaseFingerprint(dbPath);
@@ -52889,6 +52964,8 @@ var proposalFormatters = [
   { command: "proposal-show", handler: (r) => formatProposalShowPlain(r) },
   { command: "proposal-accept", handler: (r) => formatProposalAcceptPlain(r) },
   { command: "proposal-reject", handler: (r) => formatProposalRejectPlain(r) },
+  { command: "proposal-reopen", handler: (r) => formatProposalReopenPlain(r) },
+  { command: "proposal-reopen-batch", handler: (r) => formatProposalReopenBatchPlain(r) },
   { command: "proposal-diff", handler: (r) => formatProposalDiffPlain(r) },
   { command: "proposal-drain", handler: (r) => formatProposalDrainPlain(r) }
 ];

package/dist/storage/repositories/improve-ledger-repository.js

@@ -38,6 +38,33 @@ export const LEDGER_REVISIT_CADENCE_DAYS = 7;
  * eligible again.
  */
 export const PAIR_PASS_LEDGER_SOURCE = "consolidate-pair";
+/**
+ * The consolidate promote pass's ledger source: one row per source memory,
+ * keyed by the memory (`memories/<name>`), not by the knowledge ref the
+ * promotion would create.
+ */
+export const CONSOLIDATE_LEDGER_SOURCE = "consolidate";
+/**
+ * Whether a decision on `(source, outcome)` leaves the ref's next attempt to
+ * its content instead of a clock (#998). An accepted or rejected consolidate
+ * promotion is a verdict on that memory's text; asking the model about the
+ * same text again can only reproduce the proposal (accepted used to be
+ * eligible at once, rejected after 7 days), so the memory waits for an edit.
+ * The clock stays for a row with no recorded hash — one decided before the
+ * hash was recorded — see {@link nextEligibleAt} and {@link isContentDrivenRow}.
+ */
+export function isContentDrivenDecision(source, outcome) {
+    return source === CONSOLIDATE_LEDGER_SOURCE && (outcome === "accepted" || outcome === "rejected");
+}
+/**
+ * Whether this row is held by its content hash: a decided consolidate
+ * promotion that recorded the body it was decided against. Such a row has no
+ * `next_eligible_at`; the caller compares `contentHash` with the asset's
+ * current body hash (the pair pass does the same in `selectInitiators`).
+ */
+export function isContentDrivenRow(row) {
+    return row.contentHash !== null && isContentDrivenDecision(row.source, row.outcome);
+}
 /**
  * Outcomes whose window a fresh signal on the asset (new feedback, a content
  * change) cannot lift. Every other window is a revisit cadence that a signal
@@ -73,12 +100,17 @@ function windowDays(source, outcome) {
 }
 /**
  * The single cadence function: when a `(source, outcome)` recorded at
- * `fromIso` becomes eligible again, or `null` for "immediately".
+ * `fromIso` becomes eligible again, or `null` for "immediately". A decision
+ * that {@link isContentDrivenDecision} holds by content, recorded together
+ * with the body hash it was decided against, starts no clock at all: `null`
+ * here means the hash is the whole test, not that the ref is free to retry.
  */
-export function nextEligibleAt(source, outcome, fromIso) {
+export function nextEligibleAt(source, outcome, fromIso, contentHash) {
     const from = Date.parse(fromIso);
     if (!Number.isFinite(from))
         return null;
+    if (contentHash && isContentDrivenDecision(source, outcome))
+        return null;
     const days = windowDays(source, outcome);
     return days === null ? null : new Date(from + days * MS_PER_DAY).toISOString();
 }
@@ -127,7 +159,7 @@ export function recordImproveLedger(db, input) {
         source: input.source,
         lastAttemptAt: input.at,
         outcome: input.outcome,
-        nextEligibleAt: nextEligibleAt(input.source, input.outcome, input.at),
+        nextEligibleAt: nextEligibleAt(input.source, input.outcome, input.at, input.contentHash),
         proposalId: input.proposalId ?? null,
         detail: trimDetail(input.detail),
         contentHash: input.contentHash ?? null,
@@ -150,14 +182,16 @@ export function recordImproveLedger(db, input) {
  * differ from the ledger key (a distill proposal for `lessons/x` is keyed by
  * its input `memories/x`) — and `last_attempt_at` is kept: the window starts
  * at the decision, the attempt happened when it happened. A proposal no row
- * knows (minted before the ledger existed) gets a row keyed by its own ref.
+ * knows (minted before the ledger existed, or whose row a later `judged_no_action`
+ * overwrote) gets a row keyed by `input.ref`.
  */
 export function recordImproveLedgerDecision(db, input) {
+    const hash = isContentDrivenDecision(input.source, input.outcome) ? input.contentHash : undefined;
     const changes = db
         .prepare(`UPDATE improve_ledger
-       SET outcome = ?, next_eligible_at = ?, detail = ?
+       SET outcome = ?, next_eligible_at = ?, detail = ?, content_hash = COALESCE(?, content_hash)
        WHERE stash_dir = ? AND proposal_id = ?`)
-        .run(input.outcome, nextEligibleAt(input.source, input.outcome, input.at), trimDetail(input.detail), input.stashDir, input.proposalId).changes;
+        .run(input.outcome, nextEligibleAt(input.source, input.outcome, input.at, hash), trimDetail(input.detail), hash ?? null, input.stashDir, input.proposalId).changes;
     if (Number(changes) > 0)
         return;
     recordImproveLedger(db, {
@@ -168,8 +202,33 @@ export function recordImproveLedgerDecision(db, input) {
         at: input.at,
         proposalId: input.proposalId,
         ...(input.detail !== undefined ? { detail: input.detail } : {}),
+        ...(hash !== undefined ? { contentHash: hash } : {}),
     });
 }
+/**
+ * A rejected proposal was reopened (`akm proposal reopen`): put the rows
+ * {@link recordImproveLedgerDecision} found by `proposal_id` back to what the
+ * mint wrote — `proposed`, on the revisit cadence from the reopen, and no
+ * `content_hash` (a mint records none) — so the rejection's hard window stops
+ * reporting (and blocking) a proposal that is pending again.
+ * `last_attempt_at` is kept, as a decision keeps it. A proposal with no such
+ * row (its mint wrote none, or a later attempt took the key over) changes
+ * nothing.
+ */
+export function reopenImproveLedgerDecision(db, input) {
+    db.prepare(`UPDATE improve_ledger
+     SET outcome = 'proposed', next_eligible_at = ?, detail = ?, content_hash = NULL
+     WHERE stash_dir = ? AND proposal_id = ?`).run(nextEligibleAt(input.source, "proposed", input.at), trimDetail(input.detail), input.stashDir, input.proposalId);
+}
+/**
+ * The same reopen for a proposal whose mint deliberately wrote no ledger row (a
+ * retire proposal — see `createRetireProposal`): the row its rejection created
+ * is dropped, returning the ledger to what the mint left. Found by
+ * `proposal_id`, like {@link recordImproveLedgerDecision}.
+ */
+export function forgetImproveLedgerDecision(db, stashDir, proposalId) {
+    db.prepare("DELETE FROM improve_ledger WHERE stash_dir = ? AND proposal_id = ?").run(stashDir, proposalId);
+}
 /**
  * Should-fix 6 (second review round): a read-only or dry-run open never
  * migrates, so it can land on a state.db from before migration 029 added

package/dist/storage/repositories/index-vec-repository.js

@@ -80,9 +80,11 @@ export function upsertEmbedding(db, entryId, embedding, model) {
  * (ties by id): an exact scan of the current model's rows. `distance` is
  * `sqrt(2 * (1 - cosine))`, the L2 distance between the unit-normalised
  * vectors. Rows of another width, left by a model that is no longer current,
- * never match.
+ * never match. With a `scope`, only that bundle's entries of that type are
+ * scanned: the `k` nearest of those, not the `k` nearest of everything filtered
+ * afterwards.
  */
-export function searchVec(db, query, k) {
+export function searchVec(db, query, k, scope) {
     const dim = query.length;
     const q = Float64Array.from(query);
     let queryNorm = 0;
@@ -92,11 +94,13 @@ export function searchVec(db, query, k) {
         return [];
     queryNorm = Math.sqrt(queryNorm);
     const current = modelPredicate(db, currentEmbeddingModel(db));
+    const scoped = scope ? " AND embeddings.id IN (SELECT id FROM entries WHERE type = ? AND bundle_id = ?)" : "";
+    const params = scope ? [...current.params, scope.type, scope.bundleId] : current.params;
     const ids = [];
     const similarities = [];
     const rows = db
-        .prepare(`SELECT id, embedding FROM embeddings WHERE ${current.sql}`)
-        .iterate(...current.params);
+        .prepare(`SELECT id, embedding FROM embeddings WHERE ${current.sql}${scoped}`)
+        .iterate(...params);
     for (const { id, embedding } of rows) {
         if (embedding.byteLength !== dim * 4)
             continue;
@@ -126,14 +130,15 @@ export function searchVec(db, query, k) {
 /**
  * The k nearest neighbours of an already-indexed entry, by its stored vector —
  * no re-embedding, no network. Returns [] when the entry has no stored
- * vector. The entry itself is typically returned with distance ~0; callers
- * filter it out by id.
+ * vector. Unscoped, the entry itself is typically returned with distance ~0;
+ * callers filter it out by id. A `scope` confines the neighbours to one
+ * bundle's entries of one type (see {@link searchVec}).
  */
-export function getNeighborsByEntryId(db, id, k) {
+export function getNeighborsByEntryId(db, id, k, scope) {
     const row = db.prepare("SELECT embedding FROM embeddings WHERE id = ?").get(id);
     if (!row || row.embedding.byteLength % 4 !== 0)
         return [];
-    return searchVec(db, new Float32Array(row.embedding.slice().buffer), k);
+    return searchVec(db, new Float32Array(row.embedding.slice().buffer), k, scope);
 }
 /**
  * Every entry that has no embedding row for `model` (any row when no model is