dsh-continual-evolve 0.3.0 → 0.4.0

package/lib/usage.js

@@ -14,29 +14,44 @@ const USAGE_FILE = "usage.json";
 function usagePath(baseDir) {
     return join(baseDir, "evolve", USAGE_FILE);
 }
-/** Load the usage store from disk; returns an empty store when absent or corrupt. */
+/**
+ * Load the usage store from disk; returns an empty store when absent or
+ * corrupt. Accepts BOTH on-disk shapes:
+ * - legacy (≤0.3.x): a flat `{ "kind:id": count }` map,
+ * - v2: `{ version: 2, counts, lastSession }` with per-session dedup.
+ */
 export function loadUsage(baseDir) {
     const path = usagePath(baseDir);
     try {
         if (!existsSync(path))
-            return { counts: {} };
+            return { counts: {}, lastSession: {} };
         const raw = JSON.parse(readFileSync(path, "utf8"));
         if (typeof raw === "object" && raw !== null && !Array.isArray(raw)) {
-            return { counts: raw };
+            const record = raw;
+            if (record["version"] === 2 && typeof record["counts"] === "object" && record["counts"] !== null) {
+                return {
+                    counts: record["counts"],
+                    lastSession: typeof record["lastSession"] === "object" && record["lastSession"] !== null
+                        ? record["lastSession"]
+                        : {},
+                };
+            }
+            // Legacy flat map: every key is a count.
+            return { counts: raw, lastSession: {} };
         }
-        return { counts: {} };
+        return { counts: {}, lastSession: {} };
     }
     catch {
-        return { counts: {} };
+        return { counts: {}, lastSession: {} };
     }
 }
-/** Persist the usage store atomically. */
+/** Persist the usage store atomically (always the v2 shape). */
 export function saveUsage(baseDir, store) {
     const dir = join(baseDir, "evolve");
     mkdirSync(dir, { recursive: true });
     const path = usagePath(baseDir);
     const tmp = `${path}.${process.pid}.tmp`;
-    writeFileSync(tmp, `${JSON.stringify(store.counts, null, 2)}\n`, "utf8");
+    writeFileSync(tmp, `${JSON.stringify({ version: 2, counts: store.counts, lastSession: store.lastSession ?? {} }, null, 2)}\n`, "utf8");
     renameSync(tmp, path);
 }
 /** Build the usage key for an entry. */
@@ -46,16 +61,32 @@ export function usageKey(kind, id) {
 /**
  * Increment injection counts for the entries that were actually injected.
  * Called after `entriesSectionText` renders the injected block. Keys not
- * present in the store are initialized to 1; existing keys are incremented.
+ * present in the store are initialized to 1.
+ *
+ * Session dedup (2026-08-22): with a sessionId, each key counts AT MOST
+ * ONCE per session — the old per-build counting produced meaningless
+ * numbers (one entry hit 2311× in a week) and hid the real "how many
+ * sessions found this useful" signal that staleness decay needs. Without
+ * a sessionId the call degrades to legacy always-increment behavior.
  */
-export function recordInjection(baseDir, injectedKeys) {
+export function recordInjection(baseDir, injectedKeys, sessionId) {
     if (injectedKeys.length === 0)
         return;
     const store = loadUsage(baseDir);
+    let dirty = false;
     for (const key of injectedKeys) {
+        if (sessionId !== undefined && store.lastSession?.[key] === sessionId) {
+            continue;
+        }
         store.counts[key] = (store.counts[key] ?? 0) + 1;
+        if (store.lastSession && sessionId !== undefined) {
+            store.lastSession[key] = sessionId;
+        }
+        dirty = true;
+    }
+    if (dirty) {
+        saveUsage(baseDir, store);
     }
-    saveUsage(baseDir, store);
 }
 /**
  * Get the injection count for a specific entry. Returns 0 when the entry

package/lib/wrapup-command.d.ts

@@ -4,5 +4,6 @@
 import type { Context } from "@deepseek-ai/cordis";
 import type { CommandInvocation, CommandResult } from "@deepseek-ai/dsh-commands";
 import type { EvolutionEngine } from "./service.js";
-export declare function executeWrapupCommand(ctx: Context, engine: EvolutionEngine, invocation: CommandInvocation): Promise<CommandResult>;
+import { type PromotionPolicy } from "./promotion.js";
+export declare function executeWrapupCommand(ctx: Context, engine: EvolutionEngine, invocation: CommandInvocation, policy?: PromotionPolicy): Promise<CommandResult>;
 //# sourceMappingURL=wrapup-command.d.ts.map

package/lib/wrapup-command.js

@@ -1,9 +1,10 @@
 import { questionServiceOf, requireGlobalApproval } from "./approval.js";
 import { assessLocalEntries, candidateKey, filterPromotable, listLocalCandidates, splitArchiveGuards, splitPromoteBlocked, splitPromoteProposals, wholePromoteProposals } from "./wrapup.js";
+import { DEFAULT_PROMOTION_POLICY } from "./promotion.js";
 function success(text) {
     return { kind: "success", text };
 }
-export async function executeWrapupCommand(ctx, engine, invocation) {
+export async function executeWrapupCommand(ctx, engine, invocation, policy = DEFAULT_PROMOTION_POLICY) {
     const sessionId = invocation.agent.id;
     const localState = engine.load("local", sessionId);
     const globalState = engine.load("global", undefined);
@@ -16,7 +17,7 @@ export async function executeWrapupCommand(ctx, engine, invocation) {
     const byKey = new Map(candidates.map((candidate) => [candidateKey(candidate.kind, candidate.id), candidate]));
     // 2. Partition by action. Deterministic guards re-check the LIVE global
     //    store right before anything lands (state may have changed mid-call).
-    const { promotable, skipped } = filterPromotable(assessment.items, globalState, candidates);
+    const { promotable, skipped } = filterPromotable(assessment.items, globalState, candidates, policy);
     const promoteItems = promotable.filter((item) => item.verdict === "promote");
     const archiveItems = assessment.items.filter((item) => item.verdict === "archive");
     // Split promotion (A-form): archive a mixed entry but promote ONLY the
@@ -33,7 +34,7 @@ export async function executeWrapupCommand(ctx, engine, invocation) {
             splitSkipped.push({ key: item.key, reason: "not in the audited candidate list" });
             continue;
         }
-        const blocked = splitPromoteBlocked(item, globalState, candidate.kind);
+        const blocked = splitPromoteBlocked(item, globalState, candidate.kind, policy);
         if (blocked) {
             splitSkipped.push({ key: item.key, reason: blocked });
             continue;

package/lib/wrapup.d.ts

@@ -21,6 +21,7 @@
 import type { Context } from "@deepseek-ai/cordis";
 import type { Agent } from "@deepseek-ai/dsh-agent";
 import type { HarnessEntry, HarnessState, RefinementKind, RefinementProposal } from "./types.js";
+import { type PromotionPolicy } from "./promotion.js";
 /** What should happen to one local entry at session end. */
 export type WrapupVerdict = "promote" | "archive" | "keep";
 /** A classified local entry: `key` matches one audited candidate exactly. */
@@ -138,9 +139,16 @@ export interface PromotableSplit {
  * Apply-time deterministic guard: re-check every promote verdict against the
  * global store right before it lands. The LLM classification may be stale
  * (a gate ran while assessing) or wrong; this ensures a promote never writes
- * a duplicate global entry. Pure and unit-tested.
+ * a duplicate, project-scoped, or too-thin global entry. Pure and unit-tested.
+ *
+ * Guards (2026-08-22 promotion policy):
+ * - audited candidate list + title coverage (pre-existing),
+ * - project-scoped content markers (absolute paths / session ids) — the
+ *   global store is shared across projects and must stay portable,
+ * - thin content below the policy floor (framing outweighs the fact),
+ * - near-duplicate of an existing global entry by content overlap.
  */
-export declare function filterPromotable(items: readonly WrapupItem[], globalState: HarnessState, candidates: readonly WrapupCandidate[]): PromotableSplit;
+export declare function filterPromotable(items: readonly WrapupItem[], globalState: HarnessState, candidates: readonly WrapupCandidate[], policy?: PromotionPolicy): PromotableSplit;
 export interface ArchiveReviewSplit {
     /** Archives that may proceed silently: topic already covered, no real
      * distillation source, or the archive half of an already-approved split. */
@@ -171,11 +179,12 @@ export declare function needsArchiveReview(item: WrapupItem, candidate: WrapupCa
 export declare function splitArchiveGuards(items: readonly WrapupItem[], candidates: readonly WrapupCandidate[]): ArchiveReviewSplit;
 /**
  * Apply-time guard for a split promotion (archive + promote sub-object):
- * the cleaned title must not duplicate a topic already covered globally. A
- * duplicate split is dropped (the entry still archives plain) rather than
- * half-promoting a redundancy.
+ * the cleaned payload must pass the same promotion policy as a whole
+ * promote — no global coverage duplicate, no project-scoped content, not
+ * too thin, no near-duplicate global entry. A blocked split is dropped (the
+ * entry still archives plain) rather than half-promoting a redundancy.
  */
-export declare function splitPromoteBlocked(item: WrapupItem, globalState: HarnessState, kind: RefinementKind): string | undefined;
+export declare function splitPromoteBlocked(item: WrapupItem, globalState: HarnessState, kind: RefinementKind, policy?: PromotionPolicy): string | undefined;
 /**
  * Shared proposal builders for a WHOLE promotion — used by both the
  * `/evolve wrapup` command and the gate's local-fate dimension so the two

package/lib/wrapup.js

@@ -4,6 +4,7 @@ import { compactText } from "./render.js";
 import { streamText } from "./llm-text.js";
 import { getUsageCount, loadUsage } from "./usage.js";
 import { recencyScore } from "./inject.js";
+import { DEFAULT_PROMOTION_POLICY, mostSimilarGlobalEntry, projectScopedReason } from "./promotion.js";
 export function candidateKey(kind, id) {
     return `${kind}:${id}`;
 }
@@ -158,9 +159,16 @@ export function parseWrapupAssessment(text, candidates) {
  * Apply-time deterministic guard: re-check every promote verdict against the
  * global store right before it lands. The LLM classification may be stale
  * (a gate ran while assessing) or wrong; this ensures a promote never writes
- * a duplicate global entry. Pure and unit-tested.
+ * a duplicate, project-scoped, or too-thin global entry. Pure and unit-tested.
+ *
+ * Guards (2026-08-22 promotion policy):
+ * - audited candidate list + title coverage (pre-existing),
+ * - project-scoped content markers (absolute paths / session ids) — the
+ *   global store is shared across projects and must stay portable,
+ * - thin content below the policy floor (framing outweighs the fact),
+ * - near-duplicate of an existing global entry by content overlap.
  */
-export function filterPromotable(items, globalState, candidates) {
+export function filterPromotable(items, globalState, candidates, policy = DEFAULT_PROMOTION_POLICY) {
     const byKey = new Map(candidates.map((candidate) => [candidateKey(candidate.kind, candidate.id), candidate]));
     const promotable = [];
     const skipped = [];
@@ -176,6 +184,26 @@ export function filterPromotable(items, globalState, candidates) {
             skipped.push({ key: item.key, reason: "already covered globally" });
             continue;
         }
+        const scoped = projectScopedReason(`${candidate.title}\n${candidate.content}`, policy);
+        if (scoped) {
+            skipped.push({ key: item.key, reason: scoped });
+            continue;
+        }
+        if (candidate.content.length < policy.minPromoteChars) {
+            skipped.push({
+                key: item.key,
+                reason: `too thin to promote (${candidate.content.length} < ${policy.minPromoteChars} chars) — keep local or merge`,
+            });
+            continue;
+        }
+        const similar = mostSimilarGlobalEntry(globalState, candidate.kind, candidate.title, candidate.content, policy);
+        if (similar) {
+            skipped.push({
+                key: item.key,
+                reason: `near-duplicate of global ${candidate.kind}:${similar.id} "${similar.title}" (overlap ${similar.score.toFixed(2)}) — update that entry instead`,
+            });
+            continue;
+        }
         promotable.push(item);
     }
     return { promotable, skipped };
@@ -223,16 +251,27 @@ export function splitArchiveGuards(items, candidates) {
 }
 /**
  * Apply-time guard for a split promotion (archive + promote sub-object):
- * the cleaned title must not duplicate a topic already covered globally. A
- * duplicate split is dropped (the entry still archives plain) rather than
- * half-promoting a redundancy.
+ * the cleaned payload must pass the same promotion policy as a whole
+ * promote — no global coverage duplicate, no project-scoped content, not
+ * too thin, no near-duplicate global entry. A blocked split is dropped (the
+ * entry still archives plain) rather than half-promoting a redundancy.
  */
-export function splitPromoteBlocked(item, globalState, kind) {
+export function splitPromoteBlocked(item, globalState, kind, policy = DEFAULT_PROMOTION_POLICY) {
     if (!item.promote)
         return "no split payload";
     if (globalCoverageDetected(globalState, kind, { id: "", title: item.promote.title })) {
         return "split promotion duplicates a globally covered topic";
     }
+    const scoped = projectScopedReason(`${item.promote.title}\n${item.promote.content}`, policy);
+    if (scoped)
+        return `split promotion is ${scoped}`;
+    if (item.promote.content.length < policy.minPromoteChars) {
+        return `split promotion too thin (${item.promote.content.length} < ${policy.minPromoteChars} chars)`;
+    }
+    const similar = mostSimilarGlobalEntry(globalState, kind, item.promote.title, item.promote.content, policy);
+    if (similar) {
+        return `split promotion near-duplicates global ${kind}:${similar.id} "${similar.title}" (overlap ${similar.score.toFixed(2)})`;
+    }
     return undefined;
 }
 /**

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "dsh-continual-evolve",
-  "version": "0.3.0",
+  "version": "0.4.0",
   "description": "Continual self-evolution plugin for DeepSeek Harness: versioned, auditable, rollback-safe harness state (prompt notes, memories, skills, subagent specs) refined from session trajectories.",
   "license": "MIT",
   "repository": {
@@ -50,6 +50,7 @@
     "dev": "tsc -p tsconfig.json --watch",
     "typecheck": "tsc -p tsconfig.json --noEmit",
     "test": "vitest run",
+    "test:coverage": "vitest run --coverage",
     "test:watch": "vitest",
     "lint": "oxlint src test",
     "clean": "rm -rf lib"
@@ -62,14 +63,15 @@
   },
   "devDependencies": {
     "@deepseek-ai/cordis": "^4.0.1",
-    "@deepseek-ai/dsh-agent": "0.1.0-rc.7",
-    "@deepseek-ai/dsh-commands": "0.1.0-rc.7",
-    "@deepseek-ai/dsh-home-paths": "0.1.0-rc.7",
-    "@deepseek-ai/dsh-llm": "0.1.0-rc.7",
-    "@deepseek-ai/dsh-system-prompt": "0.1.0-rc.7",
-    "@deepseek-ai/dsh-tools": "0.1.0-rc.7",
+    "@deepseek-ai/dsh-agent": "0.1.1-rc.2",
+    "@deepseek-ai/dsh-commands": "0.1.1-rc.2",
+    "@deepseek-ai/dsh-home-paths": "0.1.1-rc.2",
+    "@deepseek-ai/dsh-llm": "0.1.1-rc.2",
+    "@deepseek-ai/dsh-system-prompt": "0.1.1-rc.2",
+    "@deepseek-ai/dsh-tools": "0.1.1-rc.2",
     "@deepseek-ai/schemastery": "^3.18.1",
     "@types/node": "^22.10.0",
+    "@vitest/coverage-v8": "^3.2.0",
     "oxlint": "^0.16.0",
     "typescript": "^5.9.0",
     "vitest": "^3.2.0"