feat: add consolidation accounting for workspace memory promotion

P0 implementation with four waves:

Wave 1: Dedup with accounting
- Add dedupeLongTermEntriesWithAccounting()
- Classify exact duplicate, identity duplicate, topic duplicate

Wave 2: Normalization with accounting
- Add normalizeWorkspaceMemoryWithAccounting()
- Chain redaction → migration → enforceLongTermLimitsWithAccounting

Wave 3: Promotion accounting integration
- Update accountPendingPromotions() to use new accounting API
- Add supersededKeys to classification
- Distinguish promoted / absorbed / superseded / rejected

Wave 4: Integration tests
- End-to-end tests covering full pipeline

Bug fixes:
- Fix active vs superseded boundary (superseded entries no longer block promotion)
- Remove unused rejected_duplicate_lower_quality type
- Defer pending journal safety cap (TODO added)

Tests: 135 passing (up from 115)

Author: sdwolf4103

CHANGELOG.md

@@ -0,0 +1,57 @@
+# Changelog
+
+All notable changes to this project will be documented in this file.
+
+The format is based on [Keep a Changelog](https://keepachangelog.com/en/1.0.0/),
+and this project adheres to [Semantic Versioning](https://semver.org/spec/v2.0.0.html).
+
+## [1.3.0] - 2026-04-27
+
+### Added
+
+- P0 consolidation accounting for workspace memory promotion.
+- Accounting-aware deduplication (`dedupeLongTermEntriesWithAccounting`).
+- Accounting-aware normalization (`normalizeWorkspaceMemoryWithAccounting`).
+- Promotion classification: promoted, absorbed, superseded, rejected.
+- Clear terminal low-value compaction candidates after promotion review.
+
+### Fixed
+
+- Active vs superseded boundary when promoting pending memories (superseded entries no longer block promotion of same-key active memories).
+- Removed unused `rejected_duplicate_lower_quality` type.
+
+### Changed
+
+- Deferred pending journal safety cap implementation (see TODO in `src/pending-journal.ts`).
+- Clarified superseded accounting semantics: P0 emits events only, does not archive newly superseded records.
+
+## [1.2.3] - 2026-04-26
+
+### Fixed
+
+- Account for absorbed pending memories in promotion accounting.
+- Clarify cache epoch semantics and add regression tests.
+
+## [1.2.0] - 2026-04-25
+
+### Added
+
+- Memory quality evaluation fixtures (5 accepted, 7 rejected cases).
+- Compaction prompt examples for better memory extraction.
+- Promotion accounting for pending memories.
+
+## [1.1.0] - 2026-04-24
+
+### Added
+
+- Workspace memory cache optimization with frozen snapshots.
+- Pending journal durability for same-session visibility.
+- Credential redaction always-on.
+
+## [1.0.0] - 2026-04-23
+
+### Added
+
+- Initial release with three-layer memory architecture.
+- Hot session state, workspace memory, pending journal.
+- Memory extraction from user messages and compaction summaries.

package.json

@@ -1,6 +1,6 @@
 {
   "name": "opencode-working-memory",
-  "version": "1.2.3",
+  "version": "1.3.0",
   "description": "Three-layer memory architecture for OpenCode with workspace memory and hot session state",
   "type": "module",
   "main": "index.ts",

src/pending-journal.ts

@@ -44,6 +44,10 @@ function normalizeJournal(
   return workspaceKey(root).then(key => ({
     version: 1,
     workspace: { root, key },
+    // TODO(memory-consolidation follow-up): add the deferred pending journal
+    // safety cap (max entries and old compaction pruning). P0 currently relies
+    // on promotion accounting to clear terminal compaction candidates without
+    // changing journal capacity behavior.
     entries: dedupeByText(Array.isArray(store.entries) ? store.entries : []),
     updatedAt: new Date().toISOString(),
   }));

src/plugin.ts

@@ -34,6 +34,7 @@ import {
 import {
   loadWorkspaceMemory,
   updateWorkspaceMemory,
+  updateWorkspaceMemoryWithAccounting,
   renderWorkspaceMemory,
 } from "./workspace-memory.ts";
 import {
@@ -250,9 +251,13 @@ export const MemoryV2Plugin: Plugin = async (input) => {
 
     let beforeEntries: Awaited<ReturnType<typeof loadWorkspaceMemory>>["entries"] = [];
 
-    const updatedWorkspaceMemory = await updateWorkspaceMemory(directory, workspaceMemory => {
+    const updateResult = await updateWorkspaceMemoryWithAccounting(directory, workspaceMemory => {
       beforeEntries = [...workspaceMemory.entries];
-      const existingKeys = new Set(workspaceMemory.entries.map(memory => memoryKey(memory)));
+      const existingKeys = new Set(
+        workspaceMemory.entries
+          .filter(memory => memory.status !== "superseded")
+          .map(memory => memoryKey(memory)),
+      );
 
       for (const memory of pending) {
         const key = memoryKey(memory);
@@ -268,7 +273,8 @@ export const MemoryV2Plugin: Plugin = async (input) => {
     const accounting = accountPendingPromotions({
       pending,
       before: beforeEntries,
-      after: updatedWorkspaceMemory.entries,
+      after: updateResult.store.entries,
+      events: updateResult.events,
     });
 
     if (sessionID) {

src/promotion-accounting.ts

@@ -1,10 +1,12 @@
 import type { LongTermMemoryEntry } from "./types.ts";
 import { memoryKey } from "./pending-journal.ts";
+import type { MemoryConsolidationEvent } from "./workspace-memory.ts";
 import { workspaceMemoryIdentityKey } from "./workspace-memory.ts";
 
 export type PendingPromotionAccounting = {
   promotedKeys: Set<string>;
   absorbedKeys: Set<string>;
+  supersededKeys: Set<string>;
   rejectedKeys: Set<string>;
   clearableKeys: Set<string>;
 };
@@ -13,13 +15,18 @@ export function accountPendingPromotions(input: {
   pending: LongTermMemoryEntry[];
   before: LongTermMemoryEntry[];
   after: LongTermMemoryEntry[];
+  events?: MemoryConsolidationEvent[];
 }): PendingPromotionAccounting {
-  const beforeExactKeys = new Set(input.before.map(entry => memoryKey(entry)));
-  const afterExactKeys = new Set(input.after.map(entry => memoryKey(entry)));
-  const afterIdentityKeys = new Set(input.after.map(entry => workspaceMemoryIdentityKey(entry)));
+  const beforeActive = input.before.filter(entry => entry.status !== "superseded");
+  const afterActive = input.after.filter(entry => entry.status !== "superseded");
+  const beforeExactKeys = new Set(beforeActive.map(entry => memoryKey(entry)));
+  const afterExactKeys = new Set(afterActive.map(entry => memoryKey(entry)));
+  const afterIdentityKeys = new Set(afterActive.map(entry => workspaceMemoryIdentityKey(entry)));
+  const terminalEventByKey = new Map((input.events ?? []).map(event => [event.memoryKey, event]));
 
   const promotedKeys = new Set<string>();
   const absorbedKeys = new Set<string>();
+  const supersededKeys = new Set<string>();
   const rejectedKeys = new Set<string>();
 
   for (const memory of input.pending) {
@@ -36,6 +43,27 @@ export function accountPendingPromotions(input: {
       continue;
     }
 
+    const terminal = terminalEventByKey.get(key);
+    if (terminal) {
+      if (
+        terminal.reason === "absorbed_exact" ||
+        terminal.reason === "absorbed_identity"
+      ) {
+        absorbedKeys.add(key);
+        continue;
+      }
+
+      if (terminal.reason === "superseded_existing") {
+        supersededKeys.add(key);
+        continue;
+      }
+
+      if (terminal.reason === "rejected_capacity" || terminal.reason === "rejected_stale") {
+        rejectedKeys.add(key);
+        continue;
+      }
+    }
+
     if (afterIdentityKeys.has(identityKey)) {
       absorbedKeys.add(key);
       continue;
@@ -47,7 +75,21 @@ export function accountPendingPromotions(input: {
   return {
     promotedKeys,
     absorbedKeys,
+    supersededKeys,
     rejectedKeys,
-    clearableKeys: new Set([...promotedKeys, ...absorbedKeys]),
+    clearableKeys: new Set([
+      ...promotedKeys,
+      ...absorbedKeys,
+      ...supersededKeys,
+      ...input.pending
+        .filter(memory => {
+          const terminal = terminalEventByKey.get(memoryKey(memory));
+          return memory.source === "compaction" && (
+            terminal?.reason === "rejected_capacity" ||
+            terminal?.reason === "rejected_stale"
+          );
+        })
+        .map(memory => memoryKey(memory)),
+    ]),
   };
 }