agent-working-memory 0.17.0 → 0.18.1

package/src/engine/consolidation.ts

@@ -1,899 +1,950 @@
-// Copyright 2026 Robert Winter / Complete Ideas
-// SPDX-License-Identifier: Apache-2.0
-/**
- * Sleep Cycle — offline memory consolidation.
- *
- * Models the brain's consolidation during sleep:
- *   1. Replay — find clusters of semantically similar memories
- *   2. Strengthen — reinforce edges within clusters + access-weighted boost
- *   3. Bridge — create cross-cluster shortcuts between related topic areas
- *   4. Decay — weaken unused edges, prune dead ones
- *   5. Homeostasis — normalize outgoing edge weights to prevent hub explosion
- *   6. Forget — archive/delete memories that were never retrieved (age-gated)
- *   7. Sweep — promote or discard uncertain (staging) memories
- *
- * No artificial "summary nodes" are created. Instead, the associative
- * graph gets denser where knowledge overlaps and sparser where it doesn't.
- * The beam search graph walk in activation.ts naturally propagates through
- * these strengthened pathways.
- *
- * Run between sessions or on a timer (e.g., every few hours).
- */
-
-import { cosineSimilarity } from '../core/embeddings.js';
-import { strengthenAssociation, decayAssociation } from '../core/hebbian.js';
-import type { Engram } from '../types/index.js';
-import type { IEngramStore as EngramStore } from '../storage/store.js';
-import type { ConnectionEngine } from './connections.js';
-import { setConsolidationActive } from '../core/write-telemetry.js';
-
-/** Cosine similarity for initial candidate detection (single-link entry gate) */
-const SIMILARITY_THRESHOLD = 0.65;
-
-/** Minimum pairwise cosine for cluster diameter enforcement.
- * Prevents chaining: a candidate must be this similar to ALL cluster members. */
-const MIN_PAIRWISE_COS = 0.50;
-
-/** Lower threshold for cross-cluster bridge edges */
-const BRIDGE_THRESHOLD = 0.25;
-
-/** Minimum edge weight to form a new connection during replay */
-const INITIAL_EDGE_WEIGHT = 0.3;
-
-/** Boost factor for strengthening existing edges between cluster members */
-const CONSOLIDATION_SIGNAL = 0.5;
-
-/** Max new edges to create per sleep cycle (prevent graph explosion) */
-const MAX_NEW_EDGES_PER_CYCLE = 50;
-
-/** Max bridge edges per cycle (cross-cluster shortcuts) */
-const MAX_BRIDGE_EDGES_PER_CYCLE = 20;
-
-/** Edge weight below which we prune during decay */
-const PRUNE_THRESHOLD = 0.01;
-
-/** Target total outgoing edge weight per node (homeostasis) */
-const HOMEOSTASIS_TARGET = 10.0;
-
-/** Grace period before forgetting curve starts (days) */
-const FORGET_GRACE_DAYS = 7;
-
-/** Consolidation cycles before 0-access memories get archived */
-const FORGET_CYCLE_THRESHOLD = 5;
-
-/** Percentile of edge count distribution used for forgetting protection (0-1) */
-const EDGE_PROTECTION_PERCENTILE = 0.25;
-
-/** Age at which never-retrieved memories get archived (days) */
-const FORGET_ARCHIVE_DAYS = 30;
-
-/** Age at which archived, never-retrieved, unconnected memories get deleted (days) */
-const FORGET_DELETE_DAYS = 90;
-
-/** Cosine similarity above which two low-confidence memories are considered redundant.
- * MiniLM-L6 paraphrases typically score 0.75-0.88 cosine; 0.85 misses most of them.
- * 0.75 catches paraphrases while keeping precision above 0.60 for unrelated facts. */
-const REDUNDANCY_THRESHOLD = 0.75;
-
-/** Max redundant memories to prune per cycle (gradual, not sudden).
- * Raised from 10 to 25 — the eval harness runs multiple cycles anyway,
- * but faster convergence reduces consolidation time for larger pools. */
-const MAX_REDUNDANCY_PRUNE_PER_CYCLE = 25;
-
-/** Max confidence drift per consolidation cycle (prevents runaway) */
-const CONFIDENCE_DRIFT_CAP = 0.03;
-
-/**
- * Content fade — Paper 1 (PLOS Comp Biology, storage degradation).
- * Memories whose content has not been recalled in a long time get coarsened:
- * the content string is trimmed to FADE_KEEP_CHARS with a "[faded]" marker,
- * while concept, tags, and embedding are preserved.
- *
- * Rationale: human memory degrades the detailed surface but retains the gist
- * and the cue-association pathway. The faded engram still surfaces by tag/concept
- * BM25 and by vector similarity (embedding preserved), but the full content body
- * is gone — which is the correct behavior for a memory that has not been useful
- * enough to rehearse in a long time.
- *
- * Fade comes BEFORE archive in the lifecycle (active → fading → archived → deleted),
- * applied only to engrams that have been accessed at least once. Engrams that have
- * never been accessed go straight to archive via the standard forgetting path —
- * they have no surface worth preserving.
- *
- * Env: AWM_FADE_DAYS_SINCE_ACCESS (default 45),
- *      AWM_FADE_KEEP_CHARS (default 150),
- *      AWM_FADE_MIN_CONTENT_LEN (default 250),
- *      AWM_FADE_MAX_PER_CYCLE (default 25).
- */
-const FADE_DAYS_SINCE_ACCESS = Number(process.env.AWM_FADE_DAYS_SINCE_ACCESS ?? 45);
-const FADE_KEEP_CHARS = Number(process.env.AWM_FADE_KEEP_CHARS ?? 150);
-const FADE_MIN_CONTENT_LEN = Number(process.env.AWM_FADE_MIN_CONTENT_LEN ?? 250);
-const FADE_MAX_PER_CYCLE = Number(process.env.AWM_FADE_MAX_PER_CYCLE ?? 25);
-const FADE_PROTECTED_ACCESS_COUNT = 10;
-const FADE_MARKER = '… [faded]';
-const FADE_PROTECTED_CLASSES = new Set(['canonical', 'structural']);
-
-/** Days without recall before confidence starts drifting down */
-const CONFIDENCE_NEGLECT_DAYS = 30;
-
-export interface ConsolidationResult {
-  clustersFound: number;
-  edgesStrengthened: number;
-  edgesCreated: number;
-  bridgesCreated: number;
-  edgesDecayed: number;
-  edgesPruned: number;
-  edgesNormalized: number;
-  memoriesForgotten: number;
-  memoriesArchived: number;
-  memoriesFaded: number;
-  redundancyPruned: number;
-  confidenceAdjusted: number;
-  stagingPromoted: number;
-  stagingDiscarded: number;
-  engramsProcessed: number;
-  synthesesCreated: number;
-}
-
-const MAX_SYNTHESES_PER_CYCLE = 5;
-const MIN_CLUSTER_SIZE_FOR_SYNTHESIS = 3;
-
-/** Shared stopwords for synthesis keyword extraction */
-const SYNTH_STOPWORDS = new Set(['the', 'is', 'a', 'an', 'and', 'or', 'of', 'to', 'in', 'for',
-  'on', 'with', 'that', 'this', 'it', 'was', 'are', 'be', 'has', 'had', 'but', 'not', 'from',
-  'by', 'as', 'at', 'i', 'you', 'we', 'my', 'your', 'can', 'will', 'do', 'did', 'if', 'user',
-  'assistant', 'would', 'like', 'just', 'also', 'about', 'really', 'think', 'know', 'want',
-  'here', 'there', 'some', 'more', 'very', 'been', 'have', 'what', 'when', 'how', 'they']);
-
-export class ConsolidationEngine {
-  private store: EngramStore;
-  private connectionEngine: ConnectionEngine | null;
-
-  /**
-   * Optional `connectionEngine` is drained at the start of each
-   * consolidation pass (v0.8.2). Connection discovery is no longer
-   * triggered per write — the work batches into the existing sleep cycle
-   * so writes return in ~50 ms instead of being pegged by an inline
-   * embed + rerank cycle (~200-500 ms/write under load).
-   */
-  constructor(store: EngramStore, connectionEngine?: ConnectionEngine) {
-    this.store = store;
-    this.connectionEngine = connectionEngine ?? null;
-  }
-
-  /**
-   * Run a full sleep cycle for an agent.
-   *
-   * Phase 0: Connection drain — discover associations for engrams enqueued
-   *           by writes since the last consolidation (v0.8.2)
-   * Phase 1: Replay — find clusters of semantically similar memories
-   * Phase 2: Strengthen — reinforce edges within clusters (access-weighted)
-   * Phase 3: Bridge — create cross-cluster shortcuts
-   * Phase 4: Decay — weaken unused edges, prune dead ones
-   * Phase 5: Homeostasis — normalize outgoing edge weights per node
-   * Phase 5.5: Content fade — coarsen un-recalled engrams (Paper 1)
-   * Phase 6: Forget — archive/delete memories never retrieved (age-gated)
-   * Phase 6.5: Redundancy prune
-   * Phase 6.7: Confidence drift — adjust confidence based on structural signals
-   * Phase 7: Sweep — check staging buffer for resonance
-   */
-  async consolidate(agentId: string): Promise<ConsolidationResult> {
-    // D1 telemetry (2026-07-30): flag the cycle so slow-write reports can
-    // attribute stalls to in-process consolidation. try/finally guarantees
-    // the flag clears even when a phase throws.
-    setConsolidationActive(true, agentId);
-    const tCycleStart = performance.now();
-    try {
-      return await this.consolidateInner(agentId);
-    } finally {
-      setConsolidationActive(false);
-      const ms = Math.round(performance.now() - tCycleStart);
-      if (ms > 5000) {
-        process.stderr.write(`[awm] consolidation cycle for ${agentId} took ${ms}ms\n`);
-      }
-    }
-  }
-
-  private async consolidateInner(agentId: string): Promise<ConsolidationResult> {
-    // --- Phase 0: Connection drain ---
-    // Discover associations for engrams enqueued by writes since the last
-    // consolidation. Per-write inline discovery was removed in v0.8.2
-    // because each findConnections() call runs a full activation cycle
-    // (embed + rerank, ~200-500 ms event-loop block per write).
-    if (this.connectionEngine) {
-      try { await this.connectionEngine.processQueue(); } catch { /* best-effort */ }
-    }
-    const result: ConsolidationResult = {
-      clustersFound: 0,
-      edgesStrengthened: 0,
-      edgesCreated: 0,
-      bridgesCreated: 0,
-      edgesDecayed: 0,
-      edgesPruned: 0,
-      edgesNormalized: 0,
-      memoriesForgotten: 0,
-      memoriesArchived: 0,
-      memoriesFaded: 0,
-      redundancyPruned: 0,
-      confidenceAdjusted: 0,
-      stagingPromoted: 0,
-      stagingDiscarded: 0,
-      engramsProcessed: 0,
-      synthesesCreated: 0,
-    };
-
-    // --- Phase 1: Replay ---
-    // Get all active engrams, backfill missing embeddings
-    const allActive = await this.store.getEngramsByAgent(agentId, 'active');
-    const needsEmbedding = allActive.filter(e => !e.embedding || e.embedding.length === 0);
-    if (needsEmbedding.length > 0) {
-      try {
-        const { embedBatch, getModelId } = await import('../core/embeddings.js');
-        const BATCH_SIZE = 32;
-        const modelId = getModelId?.() ?? 'unknown';
-        for (let b = 0; b < needsEmbedding.length; b += BATCH_SIZE) {
-          const batch = needsEmbedding.slice(b, b + BATCH_SIZE);
-          try {
-            const texts = batch.map(e => `${e.concept} ${e.content}`);
-            const vecs = await embedBatch(texts);
-            for (let j = 0; j < batch.length; j++) {
-              await this.store.updateEmbedding(batch[j].id, vecs[j], modelId);
-              batch[j].embedding = vecs[j];
-            }
-          } catch { /* batch failed, skip — non-fatal */ }
-        }
-        if (needsEmbedding.length > 0) {
-          console.log(`[consolidation] Backfilled ${needsEmbedding.filter(e => e.embedding?.length).length}/${needsEmbedding.length} embeddings (model: ${modelId})`);
-        }
-      } catch { /* embeddings module unavailable */ }
-    }
-    const engrams = allActive.filter(e => e.embedding && e.embedding.length > 0);
-
-    result.engramsProcessed = engrams.length;
-    // Clustering requires at least two engrams to form pairs. Per-engram phases
-    // (fade, forget, confidence drift, staging sweep) still run for singletons —
-    // they don't need a graph.
-    const clusters = engrams.length >= 2 ? this.findClusters(engrams) : [];
-    result.clustersFound = clusters.length;
-
-    // --- Phase 2: Strengthen (access-weighted) ---
-    // Memories that are retrieved more often get stronger consolidation.
-    // This mirrors how the brain preferentially consolidates practiced memories.
-    let newEdges = 0;
-    for (const cluster of clusters) {
-      for (let i = 0; i < cluster.length; i++) {
-        for (let j = i + 1; j < cluster.length; j++) {
-          const a = cluster[i];
-          const b = cluster[j];
-
-          // Access-weighted signal: more retrieved = stronger consolidation
-          const accessFactor = Math.min(
-            1.0,
-            0.3 + 0.7 * Math.log1p(a.accessCount + b.accessCount) / Math.log1p(20),
-          );
-
-          const existing = await this.store.getAssociation(a.id, b.id);
-          if (existing) {
-            const newWeight = strengthenAssociation(
-              existing.weight, CONSOLIDATION_SIGNAL * accessFactor, 0.25,
-            );
-            await this.store.upsertAssociation(
-              a.id, b.id, newWeight, existing.type, existing.confidence,
-            );
-            result.edgesStrengthened++;
-          } else if (newEdges < MAX_NEW_EDGES_PER_CYCLE) {
-            await this.store.upsertAssociation(
-              a.id, b.id, INITIAL_EDGE_WEIGHT * accessFactor, 'connection',
-            );
-            newEdges++;
-            result.edgesCreated++;
-          }
-        }
-      }
-    }
-
-    // --- Phase 2.5: Two types of synthesis ---
-    //
-    // Type A: SESSION SYNTHESIS (perfect recall)
-    //   Groups by shared metadata tags (sid=, proj=, topic=).
-    //   Summarizes what happened in a conversation/project session.
-    //   Helps find specific facts by providing a topical anchor.
-    //
-    // Type B: PATTERN SYNTHESIS (novel recall)
-    //   Uses the existing vector-similarity clusters.
-    //   Finds structural patterns across disparate topics.
-    //   "Debugging X by Y" + "Resolving A by B" → pattern: "conflict → ordering"
-    //   Lower confidence — these are speculative connections, not facts.
-
-    let synthCount = 0;
-
-    // --- Type A: Session synthesis (tag-based grouping) ---
-    // Group engrams by shared session/project tags, NOT vector similarity
-    const tagGroups = new Map<string, Engram[]>();
-    for (const e of engrams) {
-      if (e.tags.includes('synth=true')) continue; // Skip existing syntheses
-      for (const tag of e.tags) {
-        if (tag.startsWith('sid=') || tag.startsWith('proj=') || tag.startsWith('topic=')) {
-          const group = tagGroups.get(tag) ?? [];
-          group.push(e);
-          tagGroups.set(tag, group);
-        }
-      }
-    }
-
-    for (const [tag, group] of tagGroups) {
-      if (group.length < MIN_CLUSTER_SIZE_FOR_SYNTHESIS) continue;
-      if (synthCount >= MAX_SYNTHESES_PER_CYCLE) break;
-
-      // Check if a synthesis for this tag already exists
-      const existing = engrams.find(e =>
-        e.tags.includes('synth=true') && e.tags.includes(tag)
-      );
-      if (existing) continue;
-
-      // Extract key terms from this group
-      const wordCounts = new Map<string, number>();
-      for (const e of group) {
-        const words = e.content.toLowerCase().replace(/[^\w\s]/g, '').split(/\s+/);
-        for (const w of words) {
-          if (w.length > 3 && !SYNTH_STOPWORDS.has(w)) {
-            wordCounts.set(w, (wordCounts.get(w) ?? 0) + 1);
-          }
-        }
-      }
-      const keyTerms = [...wordCounts.entries()]
-        .sort((a, b) => b[1] - a[1])
-        .slice(0, 15)
-        .map(([word]) => word);
-
-      // Extract unique concepts (deduplicated)
-      const concepts = [...new Set(group.map(e => e.concept))];
-
-      const synthContent = [
-        `Session summary (${tag}, ${group.length} turns).`,
-        `Key topics: ${keyTerms.slice(0, 8).join(', ')}.`,
-        `Discussed: ${keyTerms.slice(8).join(', ')}.`,
-      ].join(' ');
-
-      const synthEngram = await this.store.createEngram({
-        agentId,
-        concept: `session: ${tag} (${keyTerms.slice(0, 3).join(', ')})`,
-        content: synthContent,
-        tags: [tag, 'synth=true', 'synth-type=session'],
-        salience: 0.6,
-        confidence: 0.55,
-        memoryType: 'semantic',
-      });
-
-      // Set embedding to group centroid
-      const centroid = this.computeCentroid(group);
-      if (centroid.length > 0) {
-        await this.store.updateEmbedding(synthEngram.id, centroid);
-      }
-
-      // Link to sources
-      for (const source of group.slice(0, 10)) { // Cap links to prevent explosion
-        await this.store.upsertAssociation(synthEngram.id, source.id, 0.4, 'causal');
-      }
-
-      synthCount++;
-      result.synthesesCreated++;
-    }
-
-    // --- Type B: Pattern synthesis (vector-similarity clusters, speculative) ---
-    // Only create these for clusters where members come from DIFFERENT sessions/projects.
-    // This finds cross-domain patterns: "debugging technique A" + "architecture pattern B"
-    for (const cluster of clusters) {
-      if (cluster.length < MIN_CLUSTER_SIZE_FOR_SYNTHESIS) continue;
-      if (synthCount >= MAX_SYNTHESES_PER_CYCLE) break;
-      if (cluster.some(e => e.tags.includes('synth=true'))) continue;
-
-      // Only create pattern synthesis if cluster spans multiple sessions
-      const sessionTags = new Set<string>();
-      for (const e of cluster) {
-        for (const tag of e.tags) {
-          if (tag.startsWith('sid=') || tag.startsWith('proj=')) sessionTags.add(tag);
-        }
-      }
-      if (sessionTags.size < 2) continue; // Same session → skip (Type A handles it)
-
-      const wordCounts = new Map<string, number>();
-      for (const e of cluster) {
-        const words = e.content.toLowerCase().replace(/[^\w\s]/g, '').split(/\s+/);
-        for (const w of words) {
-          if (w.length > 3 && !SYNTH_STOPWORDS.has(w)) {
-            wordCounts.set(w, (wordCounts.get(w) ?? 0) + 1);
-          }
-        }
-      }
-      const keyTerms = [...wordCounts.entries()]
-        .sort((a, b) => b[1] - a[1])
-        .slice(0, 10)
-        .map(([word]) => word);
-
-      const synthContent = [
-        `Pattern across ${sessionTags.size} sessions (${cluster.length} memories).`,
-        `Common themes: ${keyTerms.join(', ')}.`,
-      ].join(' ');
-
-      const synthEngram = await this.store.createEngram({
-        agentId,
-        concept: `pattern: ${keyTerms.slice(0, 3).join(', ')}`,
-        content: synthContent,
-        tags: [...sessionTags, 'synth=true', 'synth-type=pattern'],
-        salience: 0.5,       // Lower — speculative
-        confidence: 0.4,     // Lower — these are hypotheses not facts
-        memoryType: 'semantic',
-      });
-
-      const centroid = this.computeCentroid(cluster);
-      if (centroid.length > 0) {
-        await this.store.updateEmbedding(synthEngram.id, centroid);
-      }
-
-      for (const source of cluster.slice(0, 8)) {
-        await this.store.upsertAssociation(synthEngram.id, source.id, 0.3, 'bridge');
-      }
-
-      synthCount++;
-      result.synthesesCreated++;
-    }
-
-    // --- Phase 3: Direct cross-cluster bridging ---
-    // Find the closest pair of memories between each cluster pair and bridge them.
-    if (clusters.length >= 2) {
-      const MIN_BRIDGE_SIM = 0.15;
-      let bridges = 0;
-      for (let i = 0; i < clusters.length && bridges < MAX_BRIDGE_EDGES_PER_CYCLE; i++) {
-        for (let j = i + 1; j < clusters.length && bridges < MAX_BRIDGE_EDGES_PER_CYCLE; j++) {
-          let bestSim = -1;
-          let bestA: Engram | null = null;
-          let bestB: Engram | null = null;
-          for (const a of clusters[i]) {
-            if (!a.embedding) continue;
-            for (const b of clusters[j]) {
-              if (!b.embedding) continue;
-              const s = cosineSimilarity(a.embedding, b.embedding);
-              if (s > bestSim) { bestSim = s; bestA = a; bestB = b; }
-            }
-          }
-          if (bestA && bestB && bestSim > MIN_BRIDGE_SIM) {
-            const existing = await this.store.getAssociation(bestA.id, bestB.id);
-            if (!existing) {
-              await this.store.upsertAssociation(bestA.id, bestB.id, bestSim, 'bridge');
-              await this.store.upsertAssociation(bestB.id, bestA.id, bestSim, 'bridge');
-              bridges++;
-              result.bridgesCreated++;
-            }
-          }
-        }
-      }
-    }
-
-    // --- Phase 4: Decay (confidence-modulated) ---
-    // High-confidence edges decay slower. This means edges between memories
-    // that received positive feedback are more durable — just like how
-    // practiced memories are more resistant to forgetting in the brain.
-    // Base half-life: 7 days. High-confidence (0.8+) gets up to 30 days.
-    const engramMap = new Map(engrams.map(e => [e.id, e]));
-    const associations = await this.store.getAllAssociations(agentId);
-    for (const assoc of associations) {
-      const daysSince =
-        (Date.now() - assoc.lastActivated.getTime()) / (1000 * 60 * 60 * 24);
-      if (daysSince < 0.5) continue;
-
-      const fromEngram = engramMap.get(assoc.fromEngramId);
-      const toEngram = engramMap.get(assoc.toEngramId);
-      const fromConf = fromEngram?.confidence ?? 0.5;
-      const toConf = toEngram?.confidence ?? 0.5;
-      const maxConf = Math.max(fromConf, toConf);
-      const maxAccess = Math.max(fromEngram?.accessCount ?? 0, toEngram?.accessCount ?? 0);
-      const accessBoost = Math.min(2.0, 1.0 + 0.5 * Math.log1p(maxAccess));
-      const halfLifeDays = Math.min(
-        7 * (1 + 2 * Math.max(0, (maxConf - 0.5) / 0.5)) * accessBoost,
-        42 // Hard cap: 6 weeks max
-      );
-
-      const newWeight = decayAssociation(assoc.weight, daysSince, halfLifeDays);
-      if (newWeight < PRUNE_THRESHOLD) {
-        await this.store.deleteAssociation(assoc.id);
-        result.edgesPruned++;
-      } else if (Math.abs(newWeight - assoc.weight) > 0.001) {
-        await this.store.upsertAssociation(
-          assoc.fromEngramId, assoc.toEngramId,
-          newWeight, assoc.type, assoc.confidence,
-        );
-        result.edgesDecayed++;
-      }
-    }
-
-    // --- Phase 5: Synaptic homeostasis ---
-    // Normalize total outgoing edge weight per node to prevent hub explosion.
-    // Nodes with many strong edges get scaled down so relative weights stay meaningful.
-    const engramIds = new Set(engrams.map(e => e.id));
-    for (const id of engramIds) {
-      const outgoing = await this.store.getOutgoingAssociations(id);
-      const totalWeight = outgoing.reduce((sum, a) => sum + a.weight, 0);
-      if (totalWeight > HOMEOSTASIS_TARGET) {
-        const scale = HOMEOSTASIS_TARGET / totalWeight;
-        for (const edge of outgoing) {
-          const newWeight = edge.weight * scale;
-          if (newWeight < PRUNE_THRESHOLD) {
-            await this.store.deleteAssociation(edge.id);
-            result.edgesPruned++;
-          } else {
-            await this.store.upsertAssociation(
-              edge.fromEngramId, edge.toEngramId,
-              newWeight, edge.type, edge.confidence,
-            );
-          }
-        }
-        result.edgesNormalized++;
-      }
-    }
-
-    // --- Phase 5.5: Content fade (Paper 1: storage degradation) ---
-    // Coarsens engrams that have been accessed before but have gone stale.
-    // Trims content surface area while preserving concept, tags, and embedding so
-    // the engram still participates in BM25 + vector recall — just with less
-    // body to score against. This models how human memory loses surface detail
-    // while retaining cue-association pathways.
-    //
-    // Fade applies only to accessed engrams (the never-accessed ones go straight
-    // to archive via Phase 6). Heavily-used (accessCount >= FADE_PROTECTED_ACCESS_COUNT),
-    // canonical, structural, short-content, and UNFINISHED TASK engrams are excluded.
-    let fadeCount = 0;
-    for (const engram of engrams) {
-      if (fadeCount >= FADE_MAX_PER_CYCLE) break;
-      if (engram.accessCount === 0) continue;
-      if (engram.accessCount >= FADE_PROTECTED_ACCESS_COUNT) continue;
-      if (FADE_PROTECTED_CLASSES.has(engram.memoryClass)) continue;
-      // An unfinished task is a COMMITMENT, not a stale observation, and its body is
-      // where the acceptance criteria, source meeting, file paths and blocking reason
-      // live — the concept is 3-10 words by schema, so fading a task leaves a title
-      // nobody can action. Measured 2026-10-10 on the live store before this guard
-      // existed: 19 task bodies had already been cut to 150 chars, and `blocked` tasks
-      // were hit at 29% (5/17) against 1.2% (3/243) for `open` — ~24x — precisely
-      // BECAUSE a blocked task accrues idle days by definition while it waits on
-      // someone else, which is also when its body matters most. Only 1 of the 19 was
-      // recoverable from any backup. `done` tasks still fade: the work is finished and
-      // the gist suffices. memory_task_add sets salience 0.9 but never memoryClass, so
-      // FADE_PROTECTED_CLASSES above never covers a task.
-      if (engram.taskStatus && engram.taskStatus !== 'done') continue;
-      if (engram.retracted) continue;
-      if (engram.content.length < FADE_MIN_CONTENT_LEN) continue;
-      if (engram.content.endsWith(FADE_MARKER)) continue; // Already faded
-      const daysSinceAccess = (Date.now() - engram.lastAccessed.getTime()) / (1000 * 60 * 60 * 24);
-      if (daysSinceAccess < FADE_DAYS_SINCE_ACCESS) continue;
-
-      const trimmed = engram.content.slice(0, FADE_KEEP_CHARS).trimEnd() + FADE_MARKER;
-      await this.store.updateContent(engram.id, trimmed);
-      await this.store.updateStage(engram.id, 'fading');
-      engram.content = trimmed;
-      engram.stage = 'fading';
-      result.memoriesFaded++;
-      fadeCount++;
-    }
-
-    // --- Phase 6: Forgetting (age-gated) ---
-    // Models how human memory actually works:
-    // - New memories get a grace period (too new to judge)
-    // - Retrieval acts as rehearsal — resets the forgetting clock
-    // - Well-connected memories persist (edges = integration into knowledge)
-    // - Old, isolated, unretrieved memories fade to archive (not deleted)
-    // - Archived memories can still be recovered via deep search
-    // - Only truly orphaned, ancient memories get deleted
-    //
-    // Key insight: outdated memories still have value as historical context.
-    // "We used to use X" helps explain why we now use Y.
-    // Compute edge count percentile for relative protection threshold.
-    // With avg 12 edges/node, an absolute threshold of 3 protects everything.
-    // Use 25th percentile so "weakly connected" is relative to actual graph density.
-    const edgeCounts = await Promise.all(engrams.map(async e => await this.store.countAssociationsFor(e.id)));
-    edgeCounts.sort((a, b) => a - b);
-    const percentileIdx = Math.floor(edgeCounts.length * EDGE_PROTECTION_PERCENTILE);
-    const baseEdgeThreshold = edgeCounts.length > 0 ? edgeCounts[percentileIdx] : 3;
-
-    // Get consolidation cycle count for cycle-based archiving
-    const cycleCount = await this.store.getConsolidationCycleCount(agentId);
-
-    for (const engram of engrams) {
-      // Skip engrams that just transitioned to 'fading' in Phase 5.5 this cycle.
-      // Fade is intended as an intermediate stage between active and archived —
-      // the engram should live in 'fading' for at least one more recall window
-      // before being eligible for archival. Without this guard, a same-cycle
-      // fade-then-archive sequence collapses the active pool to zero (observed
-      // in the stress test scale phase around cycle 90).
-      if (engram.stage !== 'active') continue;
-
-      const ageDays = (Date.now() - engram.createdAt.getTime()) / (1000 * 60 * 60 * 24);
-      if (ageDays < FORGET_GRACE_DAYS) continue; // Grace period — too new to judge
-
-      const edgeCount = await this.store.countAssociationsFor(engram.id);
-
-      // Use relative threshold (percentile-based) instead of absolute.
-      // High-confidence memories need fewer edges to survive.
-      const confReduction = engram.confidence > 0.7
-        ? Math.min(0.6, (engram.confidence - 0.7) * 2)
-        : 0;
-      const edgeProtectionThreshold = Math.max(1, Math.round(baseEdgeThreshold * (1 - confReduction)));
-      if (edgeCount > edgeProtectionThreshold) continue;
-
-      // Cycle-based archive: 0-access memories archived after N cycles
-      // regardless of age. Handles small pools where time thresholds are too generous.
-      if (engram.accessCount === 0 && cycleCount >= FORGET_CYCLE_THRESHOLD) {
-        await this.store.updateStage(engram.id, 'archived');
-        result.memoriesArchived++;
-        continue;
-      }
-
-      // Compute effective forgetting threshold based on memory strength signals.
-      // Rehearsal (access + feedback) extends protection but NEVER makes immortal.
-      // Models a sharp 20-year senior dev: confirmed knowledge persists for months/years.
-      // - Base: FORGET_ARCHIVE_DAYS (30 days)
-      // - Access extends by log-scaled factor: 5 accesses ≈ 2x, 10 ≈ 2.5x
-      // - Confidence modulates up to 4x (0.5→1x, 0.7→2.6x, 0.8→3.4x, 1.0→4x)
-      // - Hard cap: 12x base (360 days) — even the sharpest memory fades after a year
-      const accessFactor = 1 + Math.log1p(engram.accessCount) * 0.6;
-      const confFactor = 1 + 3 * Math.max(0, (engram.confidence - 0.5) / 0.5);
-      const effectiveArchiveDays = Math.min(
-        FORGET_ARCHIVE_DAYS * accessFactor * confFactor,
-        FORGET_ARCHIVE_DAYS * 12,  // Hard cap: 12x base (360 days)
-      );
-
-      const daysSinceAccess = (Date.now() - engram.lastAccessed.getTime()) / (1000 * 60 * 60 * 24);
-
-      if (engram.accessCount === 0 && ageDays > FORGET_ARCHIVE_DAYS) {
-        // Never retrieved, old, weakly connected → archive
-        await this.store.updateStage(engram.id, 'archived');
-        result.memoriesArchived++;
-      } else if (engram.accessCount > 0 && daysSinceAccess > effectiveArchiveDays) {
-        // Accessed before but not recently enough given its strength — archive
-        await this.store.updateStage(engram.id, 'archived');
-        result.memoriesArchived++;
-      }
-    }
-
-    // Check archived memories for deletion — only truly orphaned ancient ones
-    const archived = await this.store.getEngramsByAgent(agentId, 'archived');
-    for (const engram of archived) {
-      const ageDays = (Date.now() - engram.createdAt.getTime()) / (1000 * 60 * 60 * 24);
-      const edgeCount = await this.store.countAssociationsFor(engram.id);
-
-      if (engram.accessCount === 0 && ageDays > FORGET_DELETE_DAYS && edgeCount === 0) {
-        // Very old, never accessed, completely isolated → truly forgotten
-        await this.store.deleteEngram(engram.id);
-        result.memoriesForgotten++;
-      }
-      // Otherwise: stay archived — still searchable, just not in active recall
-    }
-
-    // --- Phase 6.5: Redundancy pruning ---
-    // A senior dev doesn't store 30 nearly-identical memories. When multiple
-    // low-confidence memories are semantically redundant (cosine > 0.85), keep
-    // only the one with highest accessCount + confidence and archive the rest.
-    // This naturally defeats volume-based attacks (narcissistic interference,
-    // spam) while improving signal-to-noise ratio for linked memories.
-    // High-confidence memories (feedback-confirmed) are never pruned — they
-    // represent verified knowledge worth keeping even if similar.
-    // Only consider memories that are both low-confidence AND rarely accessed.
-    // Memories retrieved 3+ times have proven useful — they stay even if similar
-    // to others. This prevents pruning seed memories that match bulk templates.
-    const lowConfEngrams = engrams.filter(e =>
-      e.confidence < 0.6 && e.accessCount < 3 && e.embedding && e.embedding.length > 0);
-    const pruned = new Set<string>();
-    let redundancyCount = 0;
-
-    // Sort by quality: highest accessCount + confidence first (survivors)
-    const sortedLow = [...lowConfEngrams].sort((a, b) =>
-      (b.accessCount + b.confidence * 10) - (a.accessCount + a.confidence * 10));
-
-    for (let i = 0; i < sortedLow.length && redundancyCount < MAX_REDUNDANCY_PRUNE_PER_CYCLE; i++) {
-      if (pruned.has(sortedLow[i].id)) continue;
-      for (let j = i + 1; j < sortedLow.length && redundancyCount < MAX_REDUNDANCY_PRUNE_PER_CYCLE; j++) {
-        if (pruned.has(sortedLow[j].id)) continue;
-        if (!sortedLow[i].embedding || !sortedLow[j].embedding) continue;
-
-        const sim = cosineSimilarity(sortedLow[i].embedding!, sortedLow[j].embedding!);
-        if (sim >= REDUNDANCY_THRESHOLD) {
-          const survivorId = sortedLow[i].id;
-          const prunedId = sortedLow[j].id;
-
-          // Transfer associations from pruned memory to survivor
-          const prunedEdges = await this.store.getAssociationsFor(prunedId);
-          for (const edge of prunedEdges) {
-            const peerId = edge.fromEngramId === prunedId ? edge.toEngramId : edge.fromEngramId;
-            if (peerId === survivorId) continue; // Skip self-loops
-            await this.store.upsertAssociation(survivorId, peerId, edge.weight, edge.type, edge.confidence);
-          }
-
-          // Merge tags from pruned to survivor
-          const survivor = sortedLow[i];
-          const prunedMem = sortedLow[j];
-          const mergedTags = [...new Set([...survivor.tags, ...prunedMem.tags])];
-          if (mergedTags.length > survivor.tags.length) {
-            await this.store.updateTags(survivorId, mergedTags);
-          }
-
-          // Archive the lower-quality duplicate
-          await this.store.updateStage(prunedId, 'archived');
-          pruned.add(prunedId);
-          redundancyCount++;
-        }
-      }
-    }
-    result.redundancyPruned = redundancyCount;
-
-    // --- Phase 6.7: Confidence drift ---
-    // Adjust confidence based on structural signals that emerge from the graph.
-    // This makes confidence evolve over time without explicit feedback calls.
-    //
-    // Three signals:
-    //   1. Well-clustered memories (appeared in 1+ clusters) get a small boost
-    //      — they're integrated into the knowledge graph, likely valuable.
-    //   2. Isolated memories (0 edges after consolidation) get a small penalty
-    //      — nothing connects to them, possibly noise.
-    //   3. Neglected memories (not recalled in 30+ days) drift toward 0.3
-    //      — if the system never needs them, they're probably not important.
-    //
-    // All adjustments are capped at ±0.03 per cycle to prevent runaway.
-    // Confidence is floored at 0.15 (never reaches 0 — retraction handles that).
-    // Confidence is capped at 0.85 (only explicit feedback can push above).
-    const clusteredIds = new Set<string>();
-    for (const cluster of clusters) {
-      for (const e of cluster) clusteredIds.add(e.id);
-    }
-
-    for (const engram of engrams) {
-      let drift = 0;
-      const edgeCount = await this.store.countAssociationsFor(engram.id);
-      const daysSinceAccess = (Date.now() - engram.lastAccessed.getTime()) / (1000 * 60 * 60 * 24);
-
-      // Signal 1: Cluster membership → small boost
-      if (clusteredIds.has(engram.id)) {
-        drift += 0.01;
-      }
-
-      // Signal 2: Zero edges → small penalty
-      if (edgeCount === 0) {
-        drift -= 0.02;
-      }
-
-      // Signal 3: Long neglect → drift toward 0.3
-      if (daysSinceAccess > CONFIDENCE_NEGLECT_DAYS && engram.confidence > 0.3) {
-        drift -= 0.01;
-      }
-
-      // Apply with cap
-      if (Math.abs(drift) > 0.001) {
-        drift = Math.max(-CONFIDENCE_DRIFT_CAP, Math.min(CONFIDENCE_DRIFT_CAP, drift));
-        const newConf = Math.max(0.15, Math.min(0.85, engram.confidence + drift));
-        if (Math.abs(newConf - engram.confidence) > 0.001) {
-          await this.store.updateConfidence(engram.id, newConf);
-          result.confidenceAdjusted++;
-        }
-      }
-    }
-
-    // --- Phase 7: Sweep staging ---
-    const staging = (await this.store.getEngramsByAgent(agentId, 'staging'))
-      .filter(e => e.embedding && e.embedding.length > 0);
-
-    for (const staged of staging) {
-      const ageMs = Date.now() - staged.createdAt.getTime();
-
-      // Check if this staging memory resonates with any active memory
-      let maxSim = 0;
-      for (const active of engrams) {
-        if (!active.embedding || !staged.embedding) continue;
-        const sim = cosineSimilarity(staged.embedding, active.embedding);
-        if (sim > maxSim) maxSim = sim;
-      }
-
-      if (maxSim >= 0.6) {
-        // Resonates — promote to active with low confidence (barely made it)
-        await this.store.updateStage(staged.id, 'active');
-        await this.store.updateConfidence(staged.id, 0.40);
-        result.stagingPromoted++;
-      } else if (ageMs > 24 * 60 * 60 * 1000) {
-        // Over 24h and no resonance — discard
-        await this.store.deleteEngram(staged.id);
-        result.stagingDiscarded++;
-      }
-      // Otherwise: leave in staging, maybe next cycle
-    }
-
-    return result;
-  }
-
-  /**
-   * Find clusters of semantically similar memories.
-   * Greedy agglomerative — each memory belongs to at most one cluster.
-   * Clusters of size 2+ are returned (pairs count — they link).
-   */
-  /**
-   * Diameter-enforced greedy clustering.
-   * Single-link entry (cosine ≥ SIMILARITY_THRESHOLD to any member)
-   * + complete-link diameter (cosine ≥ MIN_PAIRWISE_COS to ALL members).
-   * Prevents chaining where physics→biophysics→cooking = 1 cluster.
-   */
-  private findClusters(engrams: Engram[]): Engram[][] {
-    const n = engrams.length;
-    if (n < 2) return [];
-
-    // Precompute pairwise cosine matrix
-    const sim: number[][] = Array.from({ length: n }, () => Array(n).fill(0));
-    for (let i = 0; i < n; i++) {
-      sim[i][i] = 1;
-      for (let j = i + 1; j < n; j++) {
-        if (!engrams[i].embedding || !engrams[j].embedding) continue;
-        const c = cosineSimilarity(engrams[i].embedding!, engrams[j].embedding!);
-        sim[i][j] = c;
-        sim[j][i] = c;
-      }
-    }
-
-    const unassigned = new Set<number>(Array.from({ length: n }, (_, i) => i));
-    const clusters: Engram[][] = [];
-
-    const sortedIdxs = Array.from({ length: n }, (_, i) => i)
-      .sort((a, b) => engrams[b].accessCount - engrams[a].accessCount);
-
-    for (const seedIdx of sortedIdxs) {
-      if (!unassigned.has(seedIdx)) continue;
-      unassigned.delete(seedIdx);
-
-      const clusterIdxs: number[] = [seedIdx];
-      let added = true;
-
-      while (added) {
-        added = false;
-        for (const candIdx of Array.from(unassigned)) {
-          let links = false;
-          for (const m of clusterIdxs) {
-            if (sim[candIdx][m] >= SIMILARITY_THRESHOLD) { links = true; break; }
-          }
-          if (!links) continue;
-
-          let passesAll = true;
-          for (const m of clusterIdxs) {
-            if (sim[candIdx][m] < MIN_PAIRWISE_COS) { passesAll = false; break; }
-          }
-          if (!passesAll) continue;
-
-          clusterIdxs.push(candIdx);
-          unassigned.delete(candIdx);
-          added = true;
-        }
-      }
-
-      if (clusterIdxs.length >= 2) {
-        clusters.push(clusterIdxs.map(i => engrams[i]));
-      } else {
-        unassigned.add(seedIdx);
-      }
-    }
-
-    return clusters;
-  }
-
-  /**
-   * Compute the centroid (average embedding) of a cluster.
-   */
-  private computeCentroid(cluster: Engram[]): number[] {
-    const withEmbed = cluster.filter(e => e.embedding && e.embedding.length > 0);
-    if (withEmbed.length === 0) return [];
-
-    const dim = withEmbed[0].embedding!.length;
-    const centroid = new Array<number>(dim).fill(0);
-    for (const e of withEmbed) {
-      for (let i = 0; i < dim; i++) {
-        centroid[i] += e.embedding![i];
-      }
-    }
-    for (let i = 0; i < dim; i++) {
-      centroid[i] /= withEmbed.length;
-    }
-    return centroid;
-  }
-}
+// Copyright 2026 Robert Winter / Complete Ideas
+// SPDX-License-Identifier: Apache-2.0
+/**
+ * Sleep Cycle — offline memory consolidation.
+ *
+ * Models the brain's consolidation during sleep:
+ *   1. Replay — find clusters of semantically similar memories
+ *   2. Strengthen — reinforce edges within clusters + access-weighted boost
+ *   3. Bridge — create cross-cluster shortcuts between related topic areas
+ *   4. Decay — weaken unused edges, prune dead ones
+ *   5. Homeostasis — normalize outgoing edge weights to prevent hub explosion
+ *   6. Forget — archive/delete memories that were never retrieved (age-gated)
+ *   7. Sweep — promote or discard uncertain (staging) memories
+ *
+ * No artificial "summary nodes" are created. Instead, the associative
+ * graph gets denser where knowledge overlaps and sparser where it doesn't.
+ * The beam search graph walk in activation.ts naturally propagates through
+ * these strengthened pathways.
+ *
+ * Run between sessions or on a timer (e.g., every few hours).
+ */
+
+import { cosineSimilarity } from '../core/embeddings.js';
+import { strengthenAssociation, decayAssociation } from '../core/hebbian.js';
+import type { Engram } from '../types/index.js';
+import type { IEngramStore as EngramStore } from '../storage/store.js';
+import type { ConnectionEngine } from './connections.js';
+import { setConsolidationActive } from '../core/write-telemetry.js';
+
+/** Cosine similarity for initial candidate detection (single-link entry gate) */
+const SIMILARITY_THRESHOLD = 0.65;
+
+/** Minimum pairwise cosine for cluster diameter enforcement.
+ * Prevents chaining: a candidate must be this similar to ALL cluster members. */
+const MIN_PAIRWISE_COS = 0.50;
+
+/** Lower threshold for cross-cluster bridge edges */
+const BRIDGE_THRESHOLD = 0.25;
+
+/** Minimum edge weight to form a new connection during replay */
+const INITIAL_EDGE_WEIGHT = 0.3;
+
+/** Boost factor for strengthening existing edges between cluster members */
+const CONSOLIDATION_SIGNAL = 0.5;
+
+/** Max new edges to create per sleep cycle (prevent graph explosion) */
+const MAX_NEW_EDGES_PER_CYCLE = 50;
+
+/** Max bridge edges per cycle (cross-cluster shortcuts) */
+const MAX_BRIDGE_EDGES_PER_CYCLE = 20;
+
+/** Edge weight below which we prune during decay */
+const PRUNE_THRESHOLD = 0.01;
+
+/** Target total outgoing edge weight per node (homeostasis) */
+const HOMEOSTASIS_TARGET = 10.0;
+
+/** Grace period before forgetting curve starts (days) */
+const FORGET_GRACE_DAYS = 7;
+
+/** Consolidation cycles before 0-access memories get archived */
+const FORGET_CYCLE_THRESHOLD = 5;
+
+/** Percentile of edge count distribution used for forgetting protection (0-1) */
+const EDGE_PROTECTION_PERCENTILE = 0.25;
+
+/** Age at which never-retrieved memories get archived (days) */
+const FORGET_ARCHIVE_DAYS = 30;
+
+/** Age at which archived, never-retrieved, unconnected memories get deleted (days) */
+const FORGET_DELETE_DAYS = 90;
+
+/** Cosine similarity above which two low-confidence memories are considered redundant.
+ * MiniLM-L6 paraphrases typically score 0.75-0.88 cosine; 0.85 misses most of them.
+ * 0.75 catches paraphrases while keeping precision above 0.60 for unrelated facts. */
+const REDUNDANCY_THRESHOLD = 0.75;
+
+/** Max redundant memories to prune per cycle (gradual, not sudden).
+ * Raised from 10 to 25 — the eval harness runs multiple cycles anyway,
+ * but faster convergence reduces consolidation time for larger pools. */
+const MAX_REDUNDANCY_PRUNE_PER_CYCLE = 25;
+
+/** Max confidence drift per consolidation cycle (prevents runaway) */
+const CONFIDENCE_DRIFT_CAP = 0.03;
+
+/**
+ * Content fade — Paper 1 (PLOS Comp Biology, storage degradation).
+ * Memories whose content has not been recalled in a long time get coarsened:
+ * the content string is trimmed to FADE_KEEP_CHARS with a "[faded]" marker,
+ * while concept, tags, and embedding are preserved.
+ *
+ * Rationale: human memory degrades the detailed surface but retains the gist
+ * and the cue-association pathway. The faded engram still surfaces by tag/concept
+ * BM25 and by vector similarity (embedding preserved), but the full content body
+ * is gone — which is the correct behavior for a memory that has not been useful
+ * enough to rehearse in a long time.
+ *
+ * Fade comes BEFORE archive in the lifecycle (active → fading → archived → deleted),
+ * applied only to engrams that have been accessed at least once. Engrams that have
+ * never been accessed go straight to archive via the standard forgetting path —
+ * they have no surface worth preserving.
+ *
+ * Env: AWM_FADE_DAYS_SINCE_ACCESS (default 45),
+ *      AWM_FADE_KEEP_CHARS (default 150),
+ *      AWM_FADE_MIN_CONTENT_LEN (default 250),
+ *      AWM_FADE_MAX_PER_CYCLE (default 25).
+ */
+const FADE_DAYS_SINCE_ACCESS = Number(process.env.AWM_FADE_DAYS_SINCE_ACCESS ?? 45);
+const FADE_KEEP_CHARS = Number(process.env.AWM_FADE_KEEP_CHARS ?? 150);
+const FADE_MIN_CONTENT_LEN = Number(process.env.AWM_FADE_MIN_CONTENT_LEN ?? 250);
+const FADE_MAX_PER_CYCLE = Number(process.env.AWM_FADE_MAX_PER_CYCLE ?? 25);
+const FADE_PROTECTED_ACCESS_COUNT = 10;
+const FADE_MARKER = '… [faded]';
+const FADE_PROTECTED_CLASSES = new Set(['canonical', 'structural']);
+
+/**
+ * Archive floor for fade-protected classes — one year.
+ *
+ * FADE_PROTECTED_CLASSES was only ever consulted by Phase 5.5 above. Phase 6 below
+ * archives on DISUSE and measured disuse as `accessCount === 0`, which is wrong for a
+ * source-of-truth class for one specific reason: **a rule, requirement or decision that
+ * has not come up YET has accessCount 0 by construction.** Never-needed-so-far and
+ * never-needed are not the same thing, and only the second is a reason to file something
+ * away. Two of the three archive branches below test accessCount with no strength term at
+ * all, so neither the access/confidence clock nor its 12x cap ever applied to them.
+ *
+ * Measured on the live store 2026-10-12 (`work`+`personal`, retracted=0), before this
+ * floor existed: 4,360 canonical engrams archived against 2,058 active, and **2,891 of
+ * the archived (66%) had accessCount 0** — i.e. two thirds were taken by the branches no
+ * strength factor reaches. Of 1,758 archived `procedural` engrams, 1,160 were zero-access.
+ *
+ * Deliberately a floor and not an exemption. `if (FADE_PROTECTED_CLASSES.has(...)) continue`
+ * would be smaller and is the wrong change twice over: it contradicts this block's own
+ * invariant that rehearsal "extends protection but NEVER makes immortal", and it would hold
+ * 3,928 more engrams in a 5,314-engram active pool — a 74% increase in what every recall
+ * scores against, which is a latency change masquerading as a correctness fix. A year of
+ * grace instead of a month costs nothing and keeps the eventual archive real.
+ *
+ * Env: AWM_PROTECTED_ARCHIVE_DAYS (default 365).
+ */
+const PROTECTED_ARCHIVE_DAYS = (() => {
+  // NaN would make every `ageDays > floor` false and protected classes immortal; an
+  // empty string would be 0 and switch the floor off. Either falls back to the default.
+  const v = Number(process.env.AWM_PROTECTED_ARCHIVE_DAYS?.trim() || NaN);
+  return Number.isFinite(v) && v >= 0 ? v : 365;
+})();
+
+/** Days without recall before confidence starts drifting down */
+const CONFIDENCE_NEGLECT_DAYS = 30;
+
+export interface ConsolidationResult {
+  clustersFound: number;
+  edgesStrengthened: number;
+  edgesCreated: number;
+  bridgesCreated: number;
+  edgesDecayed: number;
+  edgesPruned: number;
+  edgesNormalized: number;
+  memoriesForgotten: number;
+  memoriesArchived: number;
+  memoriesFaded: number;
+  redundancyPruned: number;
+  confidenceAdjusted: number;
+  stagingPromoted: number;
+  stagingDiscarded: number;
+  engramsProcessed: number;
+  synthesesCreated: number;
+}
+
+const MAX_SYNTHESES_PER_CYCLE = 5;
+const MIN_CLUSTER_SIZE_FOR_SYNTHESIS = 3;
+
+/** Shared stopwords for synthesis keyword extraction */
+const SYNTH_STOPWORDS = new Set(['the', 'is', 'a', 'an', 'and', 'or', 'of', 'to', 'in', 'for',
+  'on', 'with', 'that', 'this', 'it', 'was', 'are', 'be', 'has', 'had', 'but', 'not', 'from',
+  'by', 'as', 'at', 'i', 'you', 'we', 'my', 'your', 'can', 'will', 'do', 'did', 'if', 'user',
+  'assistant', 'would', 'like', 'just', 'also', 'about', 'really', 'think', 'know', 'want',
+  'here', 'there', 'some', 'more', 'very', 'been', 'have', 'what', 'when', 'how', 'they']);
+
+export class ConsolidationEngine {
+  private store: EngramStore;
+  private connectionEngine: ConnectionEngine | null;
+
+  /**
+   * Optional `connectionEngine` is drained at the start of each
+   * consolidation pass (v0.8.2). Connection discovery is no longer
+   * triggered per write — the work batches into the existing sleep cycle
+   * so writes return in ~50 ms instead of being pegged by an inline
+   * embed + rerank cycle (~200-500 ms/write under load).
+   */
+  constructor(store: EngramStore, connectionEngine?: ConnectionEngine) {
+    this.store = store;
+    this.connectionEngine = connectionEngine ?? null;
+  }
+
+  /**
+   * Run a full sleep cycle for an agent.
+   *
+   * Phase 0: Connection drain — discover associations for engrams enqueued
+   *           by writes since the last consolidation (v0.8.2)
+   * Phase 1: Replay — find clusters of semantically similar memories
+   * Phase 2: Strengthen — reinforce edges within clusters (access-weighted)
+   * Phase 3: Bridge — create cross-cluster shortcuts
+   * Phase 4: Decay — weaken unused edges, prune dead ones
+   * Phase 5: Homeostasis — normalize outgoing edge weights per node
+   * Phase 5.5: Content fade — coarsen un-recalled engrams (Paper 1)
+   * Phase 6: Forget — archive/delete memories never retrieved (age-gated)
+   * Phase 6.5: Redundancy prune
+   * Phase 6.7: Confidence drift — adjust confidence based on structural signals
+   * Phase 7: Sweep — check staging buffer for resonance
+   */
+  async consolidate(agentId: string): Promise<ConsolidationResult> {
+    // D1 telemetry (2026-07-30): flag the cycle so slow-write reports can
+    // attribute stalls to in-process consolidation. try/finally guarantees
+    // the flag clears even when a phase throws.
+    setConsolidationActive(true, agentId);
+    const tCycleStart = performance.now();
+    try {
+      return await this.consolidateInner(agentId);
+    } finally {
+      setConsolidationActive(false);
+      const ms = Math.round(performance.now() - tCycleStart);
+      if (ms > 5000) {
+        process.stderr.write(`[awm] consolidation cycle for ${agentId} took ${ms}ms\n`);
+      }
+    }
+  }
+
+  private async consolidateInner(agentId: string): Promise<ConsolidationResult> {
+    // --- Phase 0: Connection drain ---
+    // Discover associations for engrams enqueued by writes since the last
+    // consolidation. Per-write inline discovery was removed in v0.8.2
+    // because each findConnections() call runs a full activation cycle
+    // (embed + rerank, ~200-500 ms event-loop block per write).
+    if (this.connectionEngine) {
+      try { await this.connectionEngine.processQueue(); } catch { /* best-effort */ }
+    }
+    const result: ConsolidationResult = {
+      clustersFound: 0,
+      edgesStrengthened: 0,
+      edgesCreated: 0,
+      bridgesCreated: 0,
+      edgesDecayed: 0,
+      edgesPruned: 0,
+      edgesNormalized: 0,
+      memoriesForgotten: 0,
+      memoriesArchived: 0,
+      memoriesFaded: 0,
+      redundancyPruned: 0,
+      confidenceAdjusted: 0,
+      stagingPromoted: 0,
+      stagingDiscarded: 0,
+      engramsProcessed: 0,
+      synthesesCreated: 0,
+    };
+
+    // --- Phase 1: Replay ---
+    // Get all active engrams, backfill missing embeddings
+    const allActive = await this.store.getEngramsByAgent(agentId, 'active');
+    const needsEmbedding = allActive.filter(e => !e.embedding || e.embedding.length === 0);
+    if (needsEmbedding.length > 0) {
+      try {
+        const { embedBatch, getModelId } = await import('../core/embeddings.js');
+        const BATCH_SIZE = 32;
+        const modelId = getModelId?.() ?? 'unknown';
+        for (let b = 0; b < needsEmbedding.length; b += BATCH_SIZE) {
+          const batch = needsEmbedding.slice(b, b + BATCH_SIZE);
+          try {
+            const texts = batch.map(e => `${e.concept} ${e.content}`);
+            const vecs = await embedBatch(texts, { lane: 'background' });
+            for (let j = 0; j < batch.length; j++) {
+              await this.store.updateEmbedding(batch[j].id, vecs[j], modelId);
+              batch[j].embedding = vecs[j];
+            }
+          } catch { /* batch failed, skip — non-fatal */ }
+        }
+        if (needsEmbedding.length > 0) {
+          console.log(`[consolidation] Backfilled ${needsEmbedding.filter(e => e.embedding?.length).length}/${needsEmbedding.length} embeddings (model: ${modelId})`);
+        }
+      } catch { /* embeddings module unavailable */ }
+    }
+    const engrams = allActive.filter(e => e.embedding && e.embedding.length > 0);
+
+    result.engramsProcessed = engrams.length;
+    // Clustering requires at least two engrams to form pairs. Per-engram phases
+    // (fade, forget, confidence drift, staging sweep) still run for singletons —
+    // they don't need a graph.
+    const clusters = engrams.length >= 2 ? this.findClusters(engrams) : [];
+    result.clustersFound = clusters.length;
+
+    // --- Phase 2: Strengthen (access-weighted) ---
+    // Memories that are retrieved more often get stronger consolidation.
+    // This mirrors how the brain preferentially consolidates practiced memories.
+    let newEdges = 0;
+    for (const cluster of clusters) {
+      for (let i = 0; i < cluster.length; i++) {
+        for (let j = i + 1; j < cluster.length; j++) {
+          const a = cluster[i];
+          const b = cluster[j];
+
+          // Access-weighted signal: more retrieved = stronger consolidation
+          const accessFactor = Math.min(
+            1.0,
+            0.3 + 0.7 * Math.log1p(a.accessCount + b.accessCount) / Math.log1p(20),
+          );
+
+          const existing = await this.store.getAssociation(a.id, b.id);
+          if (existing) {
+            const newWeight = strengthenAssociation(
+              existing.weight, CONSOLIDATION_SIGNAL * accessFactor, 0.25,
+            );
+            await this.store.upsertAssociation(
+              a.id, b.id, newWeight, existing.type, existing.confidence,
+            );
+            result.edgesStrengthened++;
+          } else if (newEdges < MAX_NEW_EDGES_PER_CYCLE) {
+            await this.store.upsertAssociation(
+              a.id, b.id, INITIAL_EDGE_WEIGHT * accessFactor, 'connection',
+            );
+            newEdges++;
+            result.edgesCreated++;
+          }
+        }
+      }
+    }
+
+    // --- Phase 2.5: Two types of synthesis ---
+    //
+    // Type A: SESSION SYNTHESIS (perfect recall)
+    //   Groups by shared metadata tags (sid=, proj=, topic=).
+    //   Summarizes what happened in a conversation/project session.
+    //   Helps find specific facts by providing a topical anchor.
+    //
+    // Type B: PATTERN SYNTHESIS (novel recall)
+    //   Uses the existing vector-similarity clusters.
+    //   Finds structural patterns across disparate topics.
+    //   "Debugging X by Y" + "Resolving A by B" → pattern: "conflict → ordering"
+    //   Lower confidence — these are speculative connections, not facts.
+
+    let synthCount = 0;
+
+    // --- Type A: Session synthesis (tag-based grouping) ---
+    // Group engrams by shared session/project tags, NOT vector similarity
+    const tagGroups = new Map<string, Engram[]>();
+    for (const e of engrams) {
+      if (e.tags.includes('synth=true')) continue; // Skip existing syntheses
+      for (const tag of e.tags) {
+        if (tag.startsWith('sid=') || tag.startsWith('proj=') || tag.startsWith('topic=')) {
+          const group = tagGroups.get(tag) ?? [];
+          group.push(e);
+          tagGroups.set(tag, group);
+        }
+      }
+    }
+
+    for (const [tag, group] of tagGroups) {
+      if (group.length < MIN_CLUSTER_SIZE_FOR_SYNTHESIS) continue;
+      if (synthCount >= MAX_SYNTHESES_PER_CYCLE) break;
+
+      // Check if a synthesis for this tag already exists
+      const existing = engrams.find(e =>
+        e.tags.includes('synth=true') && e.tags.includes(tag)
+      );
+      if (existing) continue;
+
+      // Extract key terms from this group
+      const wordCounts = new Map<string, number>();
+      for (const e of group) {
+        const words = e.content.toLowerCase().replace(/[^\w\s]/g, '').split(/\s+/);
+        for (const w of words) {
+          if (w.length > 3 && !SYNTH_STOPWORDS.has(w)) {
+            wordCounts.set(w, (wordCounts.get(w) ?? 0) + 1);
+          }
+        }
+      }
+      const keyTerms = [...wordCounts.entries()]
+        .sort((a, b) => b[1] - a[1])
+        .slice(0, 15)
+        .map(([word]) => word);
+
+      // Extract unique concepts (deduplicated)
+      const concepts = [...new Set(group.map(e => e.concept))];
+
+      const synthContent = [
+        `Session summary (${tag}, ${group.length} turns).`,
+        `Key topics: ${keyTerms.slice(0, 8).join(', ')}.`,
+        `Discussed: ${keyTerms.slice(8).join(', ')}.`,
+      ].join(' ');
+
+      const synthEngram = await this.store.createEngram({
+        agentId,
+        concept: `session: ${tag} (${keyTerms.slice(0, 3).join(', ')})`,
+        content: synthContent,
+        tags: [tag, 'synth=true', 'synth-type=session'],
+        salience: 0.6,
+        confidence: 0.55,
+        memoryType: 'semantic',
+      });
+
+      // Set embedding to group centroid
+      const centroid = this.computeCentroid(group);
+      if (centroid.length > 0) {
+        await this.store.updateEmbedding(synthEngram.id, centroid);
+      }
+
+      // Link to sources
+      for (const source of group.slice(0, 10)) { // Cap links to prevent explosion
+        await this.store.upsertAssociation(synthEngram.id, source.id, 0.4, 'causal');
+      }
+
+      synthCount++;
+      result.synthesesCreated++;
+    }
+
+    // --- Type B: Pattern synthesis (vector-similarity clusters, speculative) ---
+    // Only create these for clusters where members come from DIFFERENT sessions/projects.
+    // This finds cross-domain patterns: "debugging technique A" + "architecture pattern B"
+    for (const cluster of clusters) {
+      if (cluster.length < MIN_CLUSTER_SIZE_FOR_SYNTHESIS) continue;
+      if (synthCount >= MAX_SYNTHESES_PER_CYCLE) break;
+      if (cluster.some(e => e.tags.includes('synth=true'))) continue;
+
+      // Only create pattern synthesis if cluster spans multiple sessions
+      const sessionTags = new Set<string>();
+      for (const e of cluster) {
+        for (const tag of e.tags) {
+          if (tag.startsWith('sid=') || tag.startsWith('proj=')) sessionTags.add(tag);
+        }
+      }
+      if (sessionTags.size < 2) continue; // Same session → skip (Type A handles it)
+
+      const wordCounts = new Map<string, number>();
+      for (const e of cluster) {
+        const words = e.content.toLowerCase().replace(/[^\w\s]/g, '').split(/\s+/);
+        for (const w of words) {
+          if (w.length > 3 && !SYNTH_STOPWORDS.has(w)) {
+            wordCounts.set(w, (wordCounts.get(w) ?? 0) + 1);
+          }
+        }
+      }
+      const keyTerms = [...wordCounts.entries()]
+        .sort((a, b) => b[1] - a[1])
+        .slice(0, 10)
+        .map(([word]) => word);
+
+      const synthContent = [
+        `Pattern across ${sessionTags.size} sessions (${cluster.length} memories).`,
+        `Common themes: ${keyTerms.join(', ')}.`,
+      ].join(' ');
+
+      const synthEngram = await this.store.createEngram({
+        agentId,
+        concept: `pattern: ${keyTerms.slice(0, 3).join(', ')}`,
+        content: synthContent,
+        tags: [...sessionTags, 'synth=true', 'synth-type=pattern'],
+        salience: 0.5,       // Lower — speculative
+        confidence: 0.4,     // Lower — these are hypotheses not facts
+        memoryType: 'semantic',
+      });
+
+      const centroid = this.computeCentroid(cluster);
+      if (centroid.length > 0) {
+        await this.store.updateEmbedding(synthEngram.id, centroid);
+      }
+
+      for (const source of cluster.slice(0, 8)) {
+        await this.store.upsertAssociation(synthEngram.id, source.id, 0.3, 'bridge');
+      }
+
+      synthCount++;
+      result.synthesesCreated++;
+    }
+
+    // --- Phase 3: Direct cross-cluster bridging ---
+    // Find the closest pair of memories between each cluster pair and bridge them.
+    if (clusters.length >= 2) {
+      const MIN_BRIDGE_SIM = 0.15;
+      let bridges = 0;
+      for (let i = 0; i < clusters.length && bridges < MAX_BRIDGE_EDGES_PER_CYCLE; i++) {
+        for (let j = i + 1; j < clusters.length && bridges < MAX_BRIDGE_EDGES_PER_CYCLE; j++) {
+          let bestSim = -1;
+          let bestA: Engram | null = null;
+          let bestB: Engram | null = null;
+          for (const a of clusters[i]) {
+            if (!a.embedding) continue;
+            for (const b of clusters[j]) {
+              if (!b.embedding) continue;
+              const s = cosineSimilarity(a.embedding, b.embedding);
+              if (s > bestSim) { bestSim = s; bestA = a; bestB = b; }
+            }
+          }
+          if (bestA && bestB && bestSim > MIN_BRIDGE_SIM) {
+            const existing = await this.store.getAssociation(bestA.id, bestB.id);
+            if (!existing) {
+              await this.store.upsertAssociation(bestA.id, bestB.id, bestSim, 'bridge');
+              await this.store.upsertAssociation(bestB.id, bestA.id, bestSim, 'bridge');
+              bridges++;
+              result.bridgesCreated++;
+            }
+          }
+        }
+      }
+    }
+
+    // --- Phase 4: Decay (confidence-modulated) ---
+    // High-confidence edges decay slower. This means edges between memories
+    // that received positive feedback are more durable — just like how
+    // practiced memories are more resistant to forgetting in the brain.
+    // Base half-life: 7 days. High-confidence (0.8+) gets up to 30 days.
+    const engramMap = new Map(engrams.map(e => [e.id, e]));
+    const associations = await this.store.getAllAssociations(agentId);
+    for (const assoc of associations) {
+      const daysSince =
+        (Date.now() - assoc.lastActivated.getTime()) / (1000 * 60 * 60 * 24);
+      if (daysSince < 0.5) continue;
+
+      const fromEngram = engramMap.get(assoc.fromEngramId);
+      const toEngram = engramMap.get(assoc.toEngramId);
+      const fromConf = fromEngram?.confidence ?? 0.5;
+      const toConf = toEngram?.confidence ?? 0.5;
+      const maxConf = Math.max(fromConf, toConf);
+      const maxAccess = Math.max(fromEngram?.accessCount ?? 0, toEngram?.accessCount ?? 0);
+      const accessBoost = Math.min(2.0, 1.0 + 0.5 * Math.log1p(maxAccess));
+      const halfLifeDays = Math.min(
+        7 * (1 + 2 * Math.max(0, (maxConf - 0.5) / 0.5)) * accessBoost,
+        42 // Hard cap: 6 weeks max
+      );
+
+      const newWeight = decayAssociation(assoc.weight, daysSince, halfLifeDays);
+      if (newWeight < PRUNE_THRESHOLD) {
+        await this.store.deleteAssociation(assoc.id);
+        result.edgesPruned++;
+      } else if (Math.abs(newWeight - assoc.weight) > 0.001) {
+        await this.store.upsertAssociation(
+          assoc.fromEngramId, assoc.toEngramId,
+          newWeight, assoc.type, assoc.confidence,
+        );
+        result.edgesDecayed++;
+      }
+    }
+
+    // --- Phase 5: Synaptic homeostasis ---
+    // Normalize total outgoing edge weight per node to prevent hub explosion.
+    // Nodes with many strong edges get scaled down so relative weights stay meaningful.
+    const engramIds = new Set(engrams.map(e => e.id));
+    for (const id of engramIds) {
+      const outgoing = await this.store.getOutgoingAssociations(id);
+      const totalWeight = outgoing.reduce((sum, a) => sum + a.weight, 0);
+      if (totalWeight > HOMEOSTASIS_TARGET) {
+        const scale = HOMEOSTASIS_TARGET / totalWeight;
+        for (const edge of outgoing) {
+          const newWeight = edge.weight * scale;
+          if (newWeight < PRUNE_THRESHOLD) {
+            await this.store.deleteAssociation(edge.id);
+            result.edgesPruned++;
+          } else {
+            await this.store.upsertAssociation(
+              edge.fromEngramId, edge.toEngramId,
+              newWeight, edge.type, edge.confidence,
+            );
+          }
+        }
+        result.edgesNormalized++;
+      }
+    }
+
+    // --- Phase 5.5: Content fade (Paper 1: storage degradation) ---
+    // Coarsens engrams that have been accessed before but have gone stale.
+    // Trims content surface area while preserving concept, tags, and embedding so
+    // the engram still participates in BM25 + vector recall — just with less
+    // body to score against. This models how human memory loses surface detail
+    // while retaining cue-association pathways.
+    //
+    // Fade applies only to accessed engrams (the never-accessed ones go straight
+    // to archive via Phase 6). Heavily-used (accessCount >= FADE_PROTECTED_ACCESS_COUNT),
+    // canonical, structural, short-content, and UNFINISHED TASK engrams are excluded.
+    let fadeCount = 0;
+    for (const engram of engrams) {
+      if (fadeCount >= FADE_MAX_PER_CYCLE) break;
+      if (engram.accessCount === 0) continue;
+      if (engram.accessCount >= FADE_PROTECTED_ACCESS_COUNT) continue;
+      if (FADE_PROTECTED_CLASSES.has(engram.memoryClass)) continue;
+      // An unfinished task is a COMMITMENT, not a stale observation, and its body is
+      // where the acceptance criteria, source meeting, file paths and blocking reason
+      // live — the concept is 3-10 words by schema, so fading a task leaves a title
+      // nobody can action. Measured 2026-10-10 on the live store before this guard
+      // existed: 19 task bodies had already been cut to 150 chars, and `blocked` tasks
+      // were hit at 29% (5/17) against 1.2% (3/243) for `open` — ~24x — precisely
+      // BECAUSE a blocked task accrues idle days by definition while it waits on
+      // someone else, which is also when its body matters most. Only 1 of the 19 was
+      // recoverable from any backup. `done` tasks still fade: the work is finished and
+      // the gist suffices. memory_task_add sets salience 0.9 but never memoryClass, so
+      // FADE_PROTECTED_CLASSES above never covers a task.
+      if (engram.taskStatus && engram.taskStatus !== 'done') continue;
+      if (engram.retracted) continue;
+      if (engram.content.length < FADE_MIN_CONTENT_LEN) continue;
+      if (engram.content.endsWith(FADE_MARKER)) continue; // Already faded
+      const daysSinceAccess = (Date.now() - engram.lastAccessed.getTime()) / (1000 * 60 * 60 * 24);
+      if (daysSinceAccess < FADE_DAYS_SINCE_ACCESS) continue;
+
+      const trimmed = engram.content.slice(0, FADE_KEEP_CHARS).trimEnd() + FADE_MARKER;
+      await this.store.updateContent(engram.id, trimmed);
+      await this.store.updateStage(engram.id, 'fading');
+      engram.content = trimmed;
+      engram.stage = 'fading';
+      result.memoriesFaded++;
+      fadeCount++;
+    }
+
+    // --- Phase 6: Forgetting (age-gated) ---
+    // Models how human memory actually works:
+    // - New memories get a grace period (too new to judge)
+    // - Retrieval acts as rehearsal — resets the forgetting clock
+    // - Well-connected memories persist (edges = integration into knowledge)
+    // - Old, isolated, unretrieved memories fade to archive (not deleted)
+    // - Archived memories can still be recovered via deep search
+    // - Only truly orphaned, ancient memories get deleted
+    //
+    // Key insight: outdated memories still have value as historical context.
+    // "We used to use X" helps explain why we now use Y.
+    // Compute edge count percentile for relative protection threshold.
+    // With avg 12 edges/node, an absolute threshold of 3 protects everything.
+    // Use 25th percentile so "weakly connected" is relative to actual graph density.
+    const edgeCounts = await Promise.all(engrams.map(async e => await this.store.countAssociationsFor(e.id)));
+    edgeCounts.sort((a, b) => a - b);
+    const percentileIdx = Math.floor(edgeCounts.length * EDGE_PROTECTION_PERCENTILE);
+    const baseEdgeThreshold = edgeCounts.length > 0 ? edgeCounts[percentileIdx] : 3;
+
+    // Get consolidation cycle count for cycle-based archiving
+    const cycleCount = await this.store.getConsolidationCycleCount(agentId);
+
+    for (const engram of engrams) {
+      // Skip engrams that just transitioned to 'fading' in Phase 5.5 this cycle.
+      // Fade is intended as an intermediate stage between active and archived —
+      // the engram should live in 'fading' for at least one more recall window
+      // before being eligible for archival. Without this guard, a same-cycle
+      // fade-then-archive sequence collapses the active pool to zero (observed
+      // in the stress test scale phase around cycle 90).
+      if (engram.stage !== 'active') continue;
+
+      const ageDays = (Date.now() - engram.createdAt.getTime()) / (1000 * 60 * 60 * 24);
+      if (ageDays < FORGET_GRACE_DAYS) continue; // Grace period — too new to judge
+
+      // Source-of-truth classes get a one-year floor on every branch below, because
+      // "not recalled yet" is the normal state of a rule nobody has needed yet.
+      // See PROTECTED_ARCHIVE_DAYS for the measurement this came from.
+      // A superseded engram is not the source of truth any more: its successor is, so it
+      // gets no floor and leaves the active pool on the ordinary clock.
+      const protectedFloorDays = FADE_PROTECTED_CLASSES.has(engram.memoryClass) && !engram.supersededBy
+        ? PROTECTED_ARCHIVE_DAYS
+        : 0;
+
+      const edgeCount = await this.store.countAssociationsFor(engram.id);
+
+      // Use relative threshold (percentile-based) instead of absolute.
+      // High-confidence memories need fewer edges to survive.
+      const confReduction = engram.confidence > 0.7
+        ? Math.min(0.6, (engram.confidence - 0.7) * 2)
+        : 0;
+      const edgeProtectionThreshold = Math.max(1, Math.round(baseEdgeThreshold * (1 - confReduction)));
+      if (edgeCount > edgeProtectionThreshold) continue;
+
+      // Cycle-based archive: 0-access memories archived after N cycles
+      // regardless of age. Handles small pools where time thresholds are too generous.
+      if (engram.accessCount === 0 && cycleCount >= FORGET_CYCLE_THRESHOLD
+          && ageDays > protectedFloorDays) {
+        await this.store.updateStage(engram.id, 'archived');
+        result.memoriesArchived++;
+        continue;
+      }
+
+      // Compute effective forgetting threshold based on memory strength signals.
+      // Rehearsal (access + feedback) extends protection but NEVER makes immortal.
+      // Models a sharp 20-year senior dev: confirmed knowledge persists for months/years.
+      // - Base: FORGET_ARCHIVE_DAYS (30 days)
+      // - Access extends by log-scaled factor: 5 accesses ≈ 2x, 10 ≈ 2.5x
+      // - Confidence modulates up to 4x (0.5→1x, 0.7→2.6x, 0.8→3.4x, 1.0→4x)
+      // - Hard cap: 12x base (360 days) — even the sharpest memory fades after a year
+      const accessFactor = 1 + Math.log1p(engram.accessCount) * 0.6;
+      const confFactor = 1 + 3 * Math.max(0, (engram.confidence - 0.5) / 0.5);
+      const effectiveArchiveDays = Math.min(
+        FORGET_ARCHIVE_DAYS * accessFactor * confFactor,
+        FORGET_ARCHIVE_DAYS * 12,  // Hard cap: 12x base (360 days)
+      );
+
+      const daysSinceAccess = (Date.now() - engram.lastAccessed.getTime()) / (1000 * 60 * 60 * 24);
+
+      if (engram.accessCount === 0 && ageDays > Math.max(FORGET_ARCHIVE_DAYS, protectedFloorDays)) {
+        // Never retrieved, old, weakly connected → archive
+        await this.store.updateStage(engram.id, 'archived');
+        result.memoriesArchived++;
+      } else if (engram.accessCount > 0
+                 && daysSinceAccess > Math.max(effectiveArchiveDays, protectedFloorDays)) {
+        // Accessed before but not recently enough given its strength — archive
+        await this.store.updateStage(engram.id, 'archived');
+        result.memoriesArchived++;
+      }
+    }
+
+    // Check archived memories for deletion — only truly orphaned ancient ones
+    const archived = await this.store.getEngramsByAgent(agentId, 'archived');
+    for (const engram of archived) {
+      const ageDays = (Date.now() - engram.createdAt.getTime()) / (1000 * 60 * 60 * 24);
+      const edgeCount = await this.store.countAssociationsFor(engram.id);
+
+      // A fade-protected class is never deleted. This branch is the only irreversible
+      // step in the whole cycle, and it ran on the same `accessCount === 0` reading of
+      // disuse that PROTECTED_ARCHIVE_DAYS exists to correct — so a canonical decision
+      // nobody had needed yet was eligible for permanent deletion 90 days after an
+      // archive it should not have had. Archiving such an engram is recoverable;
+      // deleting it is not, so the floor is an exemption here rather than a longer clock.
+      if (FADE_PROTECTED_CLASSES.has(engram.memoryClass)) continue;
+
+      if (engram.accessCount === 0 && ageDays > FORGET_DELETE_DAYS && edgeCount === 0) {
+        // Very old, never accessed, completely isolated → truly forgotten
+        await this.store.deleteEngram(engram.id);
+        result.memoriesForgotten++;
+      }
+      // Otherwise: stay archived — still searchable, just not in active recall
+    }
+
+    // --- Phase 6.5: Redundancy pruning ---
+    // A senior dev doesn't store 30 nearly-identical memories. When multiple
+    // low-confidence memories are semantically redundant (cosine > 0.85), keep
+    // only the one with highest accessCount + confidence and archive the rest.
+    // This naturally defeats volume-based attacks (narcissistic interference,
+    // spam) while improving signal-to-noise ratio for linked memories.
+    // High-confidence memories (feedback-confirmed) are never pruned — they
+    // represent verified knowledge worth keeping even if similar.
+    // Only consider memories that are both low-confidence AND rarely accessed.
+    // Memories retrieved 3+ times have proven useful — they stay even if similar
+    // to others. This prevents pruning seed memories that match bulk templates.
+    const lowConfEngrams = engrams.filter(e =>
+      e.confidence < 0.6 && e.accessCount < 3 && e.embedding && e.embedding.length > 0);
+    const pruned = new Set<string>();
+    let redundancyCount = 0;
+
+    // Sort by quality: highest accessCount + confidence first (survivors)
+    const sortedLow = [...lowConfEngrams].sort((a, b) =>
+      (b.accessCount + b.confidence * 10) - (a.accessCount + a.confidence * 10));
+
+    for (let i = 0; i < sortedLow.length && redundancyCount < MAX_REDUNDANCY_PRUNE_PER_CYCLE; i++) {
+      if (pruned.has(sortedLow[i].id)) continue;
+      for (let j = i + 1; j < sortedLow.length && redundancyCount < MAX_REDUNDANCY_PRUNE_PER_CYCLE; j++) {
+        if (pruned.has(sortedLow[j].id)) continue;
+        if (!sortedLow[i].embedding || !sortedLow[j].embedding) continue;
+
+        const sim = cosineSimilarity(sortedLow[i].embedding!, sortedLow[j].embedding!);
+        if (sim >= REDUNDANCY_THRESHOLD) {
+          const survivorId = sortedLow[i].id;
+          const prunedId = sortedLow[j].id;
+
+          // Transfer associations from pruned memory to survivor
+          const prunedEdges = await this.store.getAssociationsFor(prunedId);
+          for (const edge of prunedEdges) {
+            const peerId = edge.fromEngramId === prunedId ? edge.toEngramId : edge.fromEngramId;
+            if (peerId === survivorId) continue; // Skip self-loops
+            await this.store.upsertAssociation(survivorId, peerId, edge.weight, edge.type, edge.confidence);
+          }
+
+          // Merge tags from pruned to survivor
+          const survivor = sortedLow[i];
+          const prunedMem = sortedLow[j];
+          const mergedTags = [...new Set([...survivor.tags, ...prunedMem.tags])];
+          if (mergedTags.length > survivor.tags.length) {
+            await this.store.updateTags(survivorId, mergedTags);
+          }
+
+          // Archive the lower-quality duplicate
+          await this.store.updateStage(prunedId, 'archived');
+          pruned.add(prunedId);
+          redundancyCount++;
+        }
+      }
+    }
+    result.redundancyPruned = redundancyCount;
+
+    // --- Phase 6.7: Confidence drift ---
+    // Adjust confidence based on structural signals that emerge from the graph.
+    // This makes confidence evolve over time without explicit feedback calls.
+    //
+    // Three signals:
+    //   1. Well-clustered memories (appeared in 1+ clusters) get a small boost
+    //      — they're integrated into the knowledge graph, likely valuable.
+    //   2. Isolated memories (0 edges after consolidation) get a small penalty
+    //      — nothing connects to them, possibly noise.
+    //   3. Neglected memories (not recalled in 30+ days) drift toward 0.3
+    //      — if the system never needs them, they're probably not important.
+    //
+    // All adjustments are capped at ±0.03 per cycle to prevent runaway.
+    // Confidence is floored at 0.15 (never reaches 0 — retraction handles that).
+    // Confidence is capped at 0.85 (only explicit feedback can push above).
+    const clusteredIds = new Set<string>();
+    for (const cluster of clusters) {
+      for (const e of cluster) clusteredIds.add(e.id);
+    }
+
+    for (const engram of engrams) {
+      let drift = 0;
+      const edgeCount = await this.store.countAssociationsFor(engram.id);
+      const daysSinceAccess = (Date.now() - engram.lastAccessed.getTime()) / (1000 * 60 * 60 * 24);
+
+      // Signal 1: Cluster membership → small boost
+      if (clusteredIds.has(engram.id)) {
+        drift += 0.01;
+      }
+
+      // Signal 2: Zero edges → small penalty
+      if (edgeCount === 0) {
+        drift -= 0.02;
+      }
+
+      // Signal 3: Long neglect → drift toward 0.3
+      if (daysSinceAccess > CONFIDENCE_NEGLECT_DAYS && engram.confidence > 0.3) {
+        drift -= 0.01;
+      }
+
+      // Apply with cap
+      if (Math.abs(drift) > 0.001) {
+        drift = Math.max(-CONFIDENCE_DRIFT_CAP, Math.min(CONFIDENCE_DRIFT_CAP, drift));
+        const newConf = Math.max(0.15, Math.min(0.85, engram.confidence + drift));
+        if (Math.abs(newConf - engram.confidence) > 0.001) {
+          await this.store.updateConfidence(engram.id, newConf);
+          result.confidenceAdjusted++;
+        }
+      }
+    }
+
+    // --- Phase 7: Sweep staging ---
+    const staging = (await this.store.getEngramsByAgent(agentId, 'staging'))
+      .filter(e => e.embedding && e.embedding.length > 0);
+
+    for (const staged of staging) {
+      const ageMs = Date.now() - staged.createdAt.getTime();
+
+      // Check if this staging memory resonates with any active memory
+      let maxSim = 0;
+      for (const active of engrams) {
+        if (!active.embedding || !staged.embedding) continue;
+        const sim = cosineSimilarity(staged.embedding, active.embedding);
+        if (sim > maxSim) maxSim = sim;
+      }
+
+      if (maxSim >= 0.6) {
+        // Resonates — promote to active with low confidence (barely made it)
+        await this.store.updateStage(staged.id, 'active');
+        await this.store.updateConfidence(staged.id, 0.40);
+        result.stagingPromoted++;
+      } else if (ageMs > 24 * 60 * 60 * 1000) {
+        // Over 24h and no resonance — discard
+        await this.store.deleteEngram(staged.id);
+        result.stagingDiscarded++;
+      }
+      // Otherwise: leave in staging, maybe next cycle
+    }
+
+    return result;
+  }
+
+  /**
+   * Find clusters of semantically similar memories.
+   * Greedy agglomerative — each memory belongs to at most one cluster.
+   * Clusters of size 2+ are returned (pairs count — they link).
+   */
+  /**
+   * Diameter-enforced greedy clustering.
+   * Single-link entry (cosine ≥ SIMILARITY_THRESHOLD to any member)
+   * + complete-link diameter (cosine ≥ MIN_PAIRWISE_COS to ALL members).
+   * Prevents chaining where physics→biophysics→cooking = 1 cluster.
+   */
+  private findClusters(engrams: Engram[]): Engram[][] {
+    const n = engrams.length;
+    if (n < 2) return [];
+
+    // Precompute pairwise cosine matrix
+    const sim: number[][] = Array.from({ length: n }, () => Array(n).fill(0));
+    for (let i = 0; i < n; i++) {
+      sim[i][i] = 1;
+      for (let j = i + 1; j < n; j++) {
+        if (!engrams[i].embedding || !engrams[j].embedding) continue;
+        const c = cosineSimilarity(engrams[i].embedding!, engrams[j].embedding!);
+        sim[i][j] = c;
+        sim[j][i] = c;
+      }
+    }
+
+    const unassigned = new Set<number>(Array.from({ length: n }, (_, i) => i));
+    const clusters: Engram[][] = [];
+
+    const sortedIdxs = Array.from({ length: n }, (_, i) => i)
+      .sort((a, b) => engrams[b].accessCount - engrams[a].accessCount);
+
+    for (const seedIdx of sortedIdxs) {
+      if (!unassigned.has(seedIdx)) continue;
+      unassigned.delete(seedIdx);
+
+      const clusterIdxs: number[] = [seedIdx];
+      let added = true;
+
+      while (added) {
+        added = false;
+        for (const candIdx of Array.from(unassigned)) {
+          let links = false;
+          for (const m of clusterIdxs) {
+            if (sim[candIdx][m] >= SIMILARITY_THRESHOLD) { links = true; break; }
+          }
+          if (!links) continue;
+
+          let passesAll = true;
+          for (const m of clusterIdxs) {
+            if (sim[candIdx][m] < MIN_PAIRWISE_COS) { passesAll = false; break; }
+          }
+          if (!passesAll) continue;
+
+          clusterIdxs.push(candIdx);
+          unassigned.delete(candIdx);
+          added = true;
+        }
+      }
+
+      if (clusterIdxs.length >= 2) {
+        clusters.push(clusterIdxs.map(i => engrams[i]));
+      } else {
+        unassigned.add(seedIdx);
+      }
+    }
+
+    return clusters;
+  }
+
+  /**
+   * Compute the centroid (average embedding) of a cluster.
+   */
+  private computeCentroid(cluster: Engram[]): number[] {
+    const withEmbed = cluster.filter(e => e.embedding && e.embedding.length > 0);
+    if (withEmbed.length === 0) return [];
+
+    const dim = withEmbed[0].embedding!.length;
+    const centroid = new Array<number>(dim).fill(0);
+    for (const e of withEmbed) {
+      for (let i = 0; i < dim; i++) {
+        centroid[i] += e.embedding![i];
+      }
+    }
+    for (let i = 0; i < dim; i++) {
+      centroid[i] /= withEmbed.length;
+    }
+    return centroid;
+  }
+}