agent-working-memory 0.7.17 → 0.8.5

package/dist/engine/eviction.d.ts

@@ -7,7 +7,7 @@
  *   3. Prune weakest edges when per-engram cap exceeded
  *   4. Decay unused association weights over time
  */
-import type { EngramStore } from '../storage/sqlite.js';
+import type { IEngramStore as EngramStore } from '../storage/store.js';
 import type { AgentConfig } from '../types/agent.js';
 export declare class EvictionEngine {
     private store;
@@ -16,14 +16,14 @@ export declare class EvictionEngine {
      * Check capacity budgets and evict if needed.
      * Returns count of evicted engrams.
      */
-    enforceCapacity(agentId: string, config: AgentConfig): {
+    enforceCapacity(agentId: string, config: AgentConfig): Promise<{
         evicted: number;
         edgesPruned: number;
-    };
+    }>;
     /**
      * Decay all association weights based on time since last activation.
      * Run periodically (e.g., daily).
      */
-    decayEdges(agentId: string, halfLifeDays?: number): number;
+    decayEdges(agentId: string, halfLifeDays?: number): Promise<number>;
 }
 //# sourceMappingURL=eviction.d.ts.map

package/dist/engine/eviction.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"eviction.d.ts","sourceRoot":"","sources":["../../src/engine/eviction.ts"],"names":[],"mappings":"AAEA;;;;;;;;GAQG;AAEH,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,sBAAsB,CAAC;AACxD,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AAGrD,qBAAa,cAAc;IACzB,OAAO,CAAC,KAAK,CAAc;gBAEf,KAAK,EAAE,WAAW;IAI9B;;;OAGG;IACH,eAAe,CAAC,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,WAAW,GAAG;QAAE,OAAO,EAAE,MAAM,CAAC;QAAC,WAAW,EAAE,MAAM,CAAA;KAAE;IA8C/F;;;OAGG;IACH,UAAU,CAAC,OAAO,EAAE,MAAM,EAAE,YAAY,GAAE,MAAU,GAAG,MAAM;CAuB9D"}
+{"version":3,"file":"eviction.d.ts","sourceRoot":"","sources":["../../src/engine/eviction.ts"],"names":[],"mappings":"AAEA;;;;;;;;GAQG;AAEH,OAAO,KAAK,EAAE,YAAY,IAAI,WAAW,EAAE,MAAM,qBAAqB,CAAC;AACvE,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AAGrD,qBAAa,cAAc;IACzB,OAAO,CAAC,KAAK,CAAc;gBAEf,KAAK,EAAE,WAAW;IAI9B;;;OAGG;IACG,eAAe,CAAC,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,WAAW,GAAG,OAAO,CAAC;QAAE,OAAO,EAAE,MAAM,CAAC;QAAC,WAAW,EAAE,MAAM,CAAA;KAAE,CAAC;IA8C9G;;;OAGG;IACG,UAAU,CAAC,OAAO,EAAE,MAAM,EAAE,YAAY,GAAE,MAAU,GAAG,OAAO,CAAC,MAAM,CAAC;CAuB7E"}

package/dist/engine/eviction.js

@@ -19,39 +19,39 @@ export class EvictionEngine {
      * Check capacity budgets and evict if needed.
      * Returns count of evicted engrams.
      */
-    enforceCapacity(agentId, config) {
+    async enforceCapacity(agentId, config) {
         let evicted = 0;
         let edgesPruned = 0;
         // Active engram budget
-        const activeCount = this.store.getActiveCount(agentId);
+        const activeCount = await this.store.getActiveCount(agentId);
         if (activeCount > config.maxActiveEngrams) {
             const excess = activeCount - config.maxActiveEngrams;
-            const candidates = this.store.getEvictionCandidates(agentId, excess);
+            const candidates = await this.store.getEvictionCandidates(agentId, excess);
             for (const engram of candidates) {
-                this.store.updateStage(engram.id, 'archived');
+                await this.store.updateStage(engram.id, 'archived');
                 evicted++;
             }
         }
         // Staging budget
-        const stagingCount = this.store.getStagingCount(agentId);
+        const stagingCount = await this.store.getStagingCount(agentId);
         if (stagingCount > config.maxStagingEngrams) {
-            const expired = this.store.getExpiredStaging();
+            const expired = await this.store.getExpiredStaging();
             for (const engram of expired) {
-                this.store.deleteEngram(engram.id);
+                await this.store.deleteEngram(engram.id);
                 evicted++;
             }
         }
         // Edge pruning — cap per engram
-        const engrams = this.store.getEngramsByAgent(agentId, 'active');
+        const engrams = await this.store.getEngramsByAgent(agentId, 'active');
         for (const engram of engrams) {
-            const edgeCount = this.store.countAssociationsFor(engram.id);
+            const edgeCount = await this.store.countAssociationsFor(engram.id);
             if (edgeCount > config.maxEdgesPerEngram) {
                 // Remove weakest edges until under cap
                 let toRemove = edgeCount - config.maxEdgesPerEngram;
                 while (toRemove > 0) {
-                    const weakest = this.store.getWeakestAssociation(engram.id);
+                    const weakest = await this.store.getWeakestAssociation(engram.id);
                     if (weakest) {
-                        this.store.deleteAssociation(weakest.id);
+                        await this.store.deleteAssociation(weakest.id);
                         edgesPruned++;
                     }
                     toRemove--;
@@ -64,8 +64,8 @@ export class EvictionEngine {
      * Decay all association weights based on time since last activation.
      * Run periodically (e.g., daily).
      */
-    decayEdges(agentId, halfLifeDays = 7) {
-        const associations = this.store.getAllAssociations(agentId);
+    async decayEdges(agentId, halfLifeDays = 7) {
+        const associations = await this.store.getAllAssociations(agentId);
         let decayed = 0;
         for (const assoc of associations) {
             const daysSince = (Date.now() - assoc.lastActivated.getTime()) / (1000 * 60 * 60 * 24);
@@ -74,11 +74,11 @@ export class EvictionEngine {
             const newWeight = decayAssociation(assoc.weight, daysSince, halfLifeDays);
             if (newWeight < 0.01) {
                 // Below minimum useful weight — prune
-                this.store.deleteAssociation(assoc.id);
+                await this.store.deleteAssociation(assoc.id);
                 decayed++;
             }
             else if (Math.abs(newWeight - assoc.weight) > 0.001) {
-                this.store.upsertAssociation(assoc.fromEngramId, assoc.toEngramId, newWeight, assoc.type, assoc.confidence);
+                await this.store.upsertAssociation(assoc.fromEngramId, assoc.toEngramId, newWeight, assoc.type, assoc.confidence);
                 decayed++;
             }
         }

package/dist/engine/eviction.js.map

@@ -1 +1 @@
-{"version":3,"file":"eviction.js","sourceRoot":"","sources":["../../src/engine/eviction.ts"],"names":[],"mappings":"AAAA,gDAAgD;AAChD,sCAAsC;AACtC;;;;;;;;GAQG;AAIH,OAAO,EAAE,gBAAgB,EAAE,MAAM,oBAAoB,CAAC;AAEtD,MAAM,OAAO,cAAc;IACjB,KAAK,CAAc;IAE3B,YAAY,KAAkB;QAC5B,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;IACrB,CAAC;IAED;;;OAGG;IACH,eAAe,CAAC,OAAe,EAAE,MAAmB;QAClD,IAAI,OAAO,GAAG,CAAC,CAAC;QAChB,IAAI,WAAW,GAAG,CAAC,CAAC;QAEpB,uBAAuB;QACvB,MAAM,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC;QACvD,IAAI,WAAW,GAAG,MAAM,CAAC,gBAAgB,EAAE,CAAC;YAC1C,MAAM,MAAM,GAAG,WAAW,GAAG,MAAM,CAAC,gBAAgB,CAAC;YACrD,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,qBAAqB,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;YACrE,KAAK,MAAM,MAAM,IAAI,UAAU,EAAE,CAAC;gBAChC,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,MAAM,CAAC,EAAE,EAAE,UAAU,CAAC,CAAC;gBAC9C,OAAO,EAAE,CAAC;YACZ,CAAC;QACH,CAAC;QAED,iBAAiB;QACjB,MAAM,YAAY,GAAG,IAAI,CAAC,KAAK,CAAC,eAAe,CAAC,OAAO,CAAC,CAAC;QACzD,IAAI,YAAY,GAAG,MAAM,CAAC,iBAAiB,EAAE,CAAC;YAC5C,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,iBAAiB,EAAE,CAAC;YAC/C,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;gBAC7B,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;gBACnC,OAAO,EAAE,CAAC;YACZ,CAAC;QACH,CAAC;QAED,gCAAgC;QAChC,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,iBAAiB,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;QAChE,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC7B,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,oBAAoB,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;YAC7D,IAAI,SAAS,GAAG,MAAM,CAAC,iBAAiB,EAAE,CAAC;gBACzC,uCAAuC;gBACvC,IAAI,QAAQ,GAAG,SAAS,GAAG,MAAM,CAAC,iBAAiB,CAAC;gBACpD,OAAO,QAAQ,GAAG,CAAC,EAAE,CAAC;oBACpB,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,qBAAqB,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;oBAC5D,IAAI,OAAO,EAAE,CAAC;wBACZ,IAAI,CAAC,KAAK,CAAC,iBAAiB,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;wBACzC,WAAW,EAAE,CAAC;oBAChB,CAAC;oBACD,QAAQ,EAAE,CAAC;gBACb,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,EAAE,OAAO,EAAE,WAAW,EAAE,CAAC;IAClC,CAAC;IAED;;;OAGG;IACH,UAAU,CAAC,OAAe,EAAE,eAAuB,CAAC;QAClD,MAAM,YAAY,GAAG,IAAI,CAAC,KAAK,CAAC,kBAAkB,CAAC,OAAO,CAAC,CAAC;QAC5D,IAAI,OAAO,GAAG,CAAC,CAAC;QAEhB,KAAK,MAAM,KAAK,IAAI,YAAY,EAAE,CAAC;YACjC,MAAM,SAAS,GAAG,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,KAAK,CAAC,aAAa,CAAC,OAAO,EAAE,CAAC,GAAG,CAAC,IAAI,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC;YACvF,IAAI,SAAS,GAAG,GAAG;gBAAE,SAAS,CAAC,0BAA0B;YAEzD,MAAM,SAAS,GAAG,gBAAgB,CAAC,KAAK,CAAC,MAAM,EAAE,SAAS,EAAE,YAAY,CAAC,CAAC;YAC1E,IAAI,SAAS,GAAG,IAAI,EAAE,CAAC;gBACrB,sCAAsC;gBACtC,IAAI,CAAC,KAAK,CAAC,iBAAiB,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;gBACvC,OAAO,EAAE,CAAC;YACZ,CAAC;iBAAM,IAAI,IAAI,CAAC,GAAG,CAAC,SAAS,GAAG,KAAK,CAAC,MAAM,CAAC,GAAG,KAAK,EAAE,CAAC;gBACtD,IAAI,CAAC,KAAK,CAAC,iBAAiB,CAC1B,KAAK,CAAC,YAAY,EAAE,KAAK,CAAC,UAAU,EAAE,SAAS,EAAE,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,UAAU,CAC9E,CAAC;gBACF,OAAO,EAAE,CAAC;YACZ,CAAC;QACH,CAAC;QAED,OAAO,OAAO,CAAC;IACjB,CAAC;CACF"}
+{"version":3,"file":"eviction.js","sourceRoot":"","sources":["../../src/engine/eviction.ts"],"names":[],"mappings":"AAAA,gDAAgD;AAChD,sCAAsC;AACtC;;;;;;;;GAQG;AAIH,OAAO,EAAE,gBAAgB,EAAE,MAAM,oBAAoB,CAAC;AAEtD,MAAM,OAAO,cAAc;IACjB,KAAK,CAAc;IAE3B,YAAY,KAAkB;QAC5B,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;IACrB,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,eAAe,CAAC,OAAe,EAAE,MAAmB;QACxD,IAAI,OAAO,GAAG,CAAC,CAAC;QAChB,IAAI,WAAW,GAAG,CAAC,CAAC;QAEpB,uBAAuB;QACvB,MAAM,WAAW,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC;QAC7D,IAAI,WAAW,GAAG,MAAM,CAAC,gBAAgB,EAAE,CAAC;YAC1C,MAAM,MAAM,GAAG,WAAW,GAAG,MAAM,CAAC,gBAAgB,CAAC;YACrD,MAAM,UAAU,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,qBAAqB,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;YAC3E,KAAK,MAAM,MAAM,IAAI,UAAU,EAAE,CAAC;gBAChC,MAAM,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,MAAM,CAAC,EAAE,EAAE,UAAU,CAAC,CAAC;gBACpD,OAAO,EAAE,CAAC;YACZ,CAAC;QACH,CAAC;QAED,iBAAiB;QACjB,MAAM,YAAY,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,eAAe,CAAC,OAAO,CAAC,CAAC;QAC/D,IAAI,YAAY,GAAG,MAAM,CAAC,iBAAiB,EAAE,CAAC;YAC5C,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,iBAAiB,EAAE,CAAC;YACrD,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;gBAC7B,MAAM,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;gBACzC,OAAO,EAAE,CAAC;YACZ,CAAC;QACH,CAAC;QAED,gCAAgC;QAChC,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,iBAAiB,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;QACtE,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC7B,MAAM,SAAS,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,oBAAoB,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;YACnE,IAAI,SAAS,GAAG,MAAM,CAAC,iBAAiB,EAAE,CAAC;gBACzC,uCAAuC;gBACvC,IAAI,QAAQ,GAAG,SAAS,GAAG,MAAM,CAAC,iBAAiB,CAAC;gBACpD,OAAO,QAAQ,GAAG,CAAC,EAAE,CAAC;oBACpB,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,qBAAqB,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;oBAClE,IAAI,OAAO,EAAE,CAAC;wBACZ,MAAM,IAAI,CAAC,KAAK,CAAC,iBAAiB,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;wBAC/C,WAAW,EAAE,CAAC;oBAChB,CAAC;oBACD,QAAQ,EAAE,CAAC;gBACb,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,EAAE,OAAO,EAAE,WAAW,EAAE,CAAC;IAClC,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,UAAU,CAAC,OAAe,EAAE,eAAuB,CAAC;QACxD,MAAM,YAAY,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,kBAAkB,CAAC,OAAO,CAAC,CAAC;QAClE,IAAI,OAAO,GAAG,CAAC,CAAC;QAEhB,KAAK,MAAM,KAAK,IAAI,YAAY,EAAE,CAAC;YACjC,MAAM,SAAS,GAAG,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,KAAK,CAAC,aAAa,CAAC,OAAO,EAAE,CAAC,GAAG,CAAC,IAAI,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC;YACvF,IAAI,SAAS,GAAG,GAAG;gBAAE,SAAS,CAAC,0BAA0B;YAEzD,MAAM,SAAS,GAAG,gBAAgB,CAAC,KAAK,CAAC,MAAM,EAAE,SAAS,EAAE,YAAY,CAAC,CAAC;YAC1E,IAAI,SAAS,GAAG,IAAI,EAAE,CAAC;gBACrB,sCAAsC;gBACtC,MAAM,IAAI,CAAC,KAAK,CAAC,iBAAiB,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;gBAC7C,OAAO,EAAE,CAAC;YACZ,CAAC;iBAAM,IAAI,IAAI,CAAC,GAAG,CAAC,SAAS,GAAG,KAAK,CAAC,MAAM,CAAC,GAAG,KAAK,EAAE,CAAC;gBACtD,MAAM,IAAI,CAAC,KAAK,CAAC,iBAAiB,CAChC,KAAK,CAAC,YAAY,EAAE,KAAK,CAAC,UAAU,EAAE,SAAS,EAAE,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,UAAU,CAC9E,CAAC;gBACF,OAAO,EAAE,CAAC;YACZ,CAAC;QACH,CAAC;QAED,OAAO,OAAO,CAAC;IACjB,CAAC;CACF"}

package/dist/engine/retraction.d.ts

@@ -9,23 +9,111 @@
  *   2. An invalidation association is created
  *   3. Optionally, a counter-engram with correct info is created
  *   4. Confidence of associated engrams is reduced (contamination check)
+ *
+ * AWM 0.8.5 — Coherence-weighted propagation (2026-05-26)
+ * --------------------------------------------------------
+ * The Continued Influence Effect (Carrillo et al., ICCM 2025) shows that
+ * misinformation persists in human cognition because it lives inside a
+ * *coherent narrative*, not as an isolated fact. Correcting one chunk doesn't
+ * displace the narrative unless the correction also propagates through the
+ * connected structure.
+ *
+ * Translation: when we retract an engram, we compute a `cohesion` score for
+ * its 2-hop neighborhood and use it to amplify or dampen the contamination
+ * penalty on neighbors:
+ *
+ *   - Dense narrative cluster (high internal-edge density + shared tags)
+ *     → penalty amplified (~1.5×). The whole cluster shares the wrong story.
+ *
+ *   - Isolated engram (sparse edges, divergent tags)
+ *     → penalty dampened (~0.5×). No narrative to disrupt.
+ *
+ *   - Cross-domain bridge (low cohesion across an edge)
+ *     → bridge weight reduced but far-side neighbors barely affected.
+ *
+ * Cohesion is computed at retract time (no schema/consolidation changes).
+ * Cost: bounded by MAX_AFFECTED (20 nodes) × one batched `getAssociationsForBatch`
+ * call — typically 10-25ms.
  */
-import type { EngramStore } from '../storage/sqlite.js';
-import type { Retraction } from '../types/index.js';
+import type { IEngramStore as EngramStore } from '../storage/store.js';
+import type { Retraction, Engram } from '../types/index.js';
+/** Result of cohesion analysis on a 2-hop neighborhood. */
+export interface NeighborhoodCohesion {
+    /** internal_edges / (internal_edges + external_edges) across the subgraph. [0, 1] */
+    graphDensity: number;
+    /** mean jaccard(source.tags, neighbor.tags) across non-source subgraph members. [0, 1] */
+    tagOverlap: number;
+    /** Combined cohesion in [0, 1] — graphDensity blended with tagOverlap bonus. */
+    score: number;
+    /** How many engrams the cohesion was computed over (excluding the source). */
+    subgraphSize: number;
+}
 export declare class RetractionEngine {
     private store;
     constructor(store: EngramStore);
     /**
      * Retract a memory — mark it invalid and optionally create a correction.
      */
-    retract(retraction: Retraction): {
+    retract(retraction: Retraction): Promise<{
         retractedId: string;
         correctionId: string | null;
         associatesAffected: number;
-    };
+        cohesion: NeighborhoodCohesion;
+        narrativeEdgesInherited: number;
+    }>;
+    /**
+     * Counter-narrative replacement helper.
+     *
+     * When a correction engram is created to replace a retracted memory, the
+     * correction inherits the retracted's strong-edge neighbors. This implements
+     * the "narrative replacement" mechanism the Continued Influence Effect paper
+     * argues is necessary for corrections to take hold: people don't drop
+     * misinformation when only one chunk is corrected; the surrounding context
+     * has to be reconnected to the new correct fact.
+     *
+     * Rules:
+     *   - Inherit only edges where weight >= NARRATIVE_INHERIT_MIN (0.4). Weak
+     *     edges aren't really part of the narrative.
+     *   - Skip edge types with special semantics: `invalidation` (the link
+     *     between retracted and correction itself), `causal` (specific cause
+     *     relationships, not narrative cohesion), `temporal` (chronological
+     *     sequence, not story structure).
+     *   - Skip neighbors that are themselves retracted — no point connecting
+     *     a correction to other wrong memories.
+     *   - Inherited edge weight = original × 0.7 (reduced — the correction
+     *     experienced this context only indirectly, through the retracted memory).
+     *   - Cap at NARRATIVE_INHERIT_MAX (10) edges, sorted by weight desc, to
+     *     bound the blast radius on highly-connected hubs.
+     *
+     * Returns the number of edges actually inherited.
+     */
+    private static readonly NARRATIVE_INHERIT_MIN;
+    private static readonly NARRATIVE_INHERIT_MAX;
+    private static readonly NARRATIVE_INHERIT_WEIGHT_SCALE;
+    private static readonly NARRATIVE_INHERIT_SKIP_TYPES;
+    inheritNarrativeEdges(retractedId: string, correctionId: string): Promise<number>;
+    /**
+     * Compute the narrative cohesion of `source`'s neighborhood within `depth` hops.
+     *
+     * Cohesion combines two signals:
+     *   - **Graph density**: How tightly interconnected are the neighbors?
+     *     internal_edges / (internal_edges + external_edges) across the subgraph.
+     *   - **Tag overlap**: How much do the neighbors share semantic tags with the source?
+     *     mean jaccard(source.tags, neighbor.tags).
+     *
+     * Both signals contribute on a [0, 1] scale; the combined score is
+     * `density × (1 + tagOverlap)` clamped to [0, 1]. A score of 0.5 is the
+     * "neutral" point where retraction penalty is unchanged from the legacy
+     * formula.
+     *
+     * Cost: O(subgraphSize × avg_degree) BFS + 1 batched fetch. Bounded by
+     * MAX_AFFECTED (20). Typical: ~10-25ms.
+     */
+    computeNeighborhoodCohesion(source: Engram, depth?: number): Promise<NeighborhoodCohesion>;
     /**
      * Reduce confidence of engrams associated with a retracted engram.
-     * Propagates up to maxDepth hops with decaying penalty (50% per hop).
+     * Propagates up to maxDepth hops with decaying penalty (50% per hop) and
+     * cohesion-weighted amplification.
      * Capped at MAX_AFFECTED to prevent cascading through the graph.
      */
     private static readonly MAX_AFFECTED;

package/dist/engine/retraction.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"retraction.d.ts","sourceRoot":"","sources":["../../src/engine/retraction.ts"],"names":[],"mappings":"AAEA;;;;;;;;;;;GAWG;AAEH,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,sBAAsB,CAAC;AACxD,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC;AAEpD,qBAAa,gBAAgB;IAC3B,OAAO,CAAC,KAAK,CAAc;gBAEf,KAAK,EAAE,WAAW;IAI9B;;OAEG;IACH,OAAO,CAAC,UAAU,EAAE,UAAU,GAAG;QAAE,WAAW,EAAE,MAAM,CAAC;QAAC,YAAY,EAAE,MAAM,GAAG,IAAI,CAAC;QAAC,kBAAkB,EAAE,MAAM,CAAA;KAAE;IAyCjH;;;;OAIG;IACH,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,YAAY,CAAM;IAE1C,OAAO,CAAC,4BAA4B;CAuCrC"}
+{"version":3,"file":"retraction.d.ts","sourceRoot":"","sources":["../../src/engine/retraction.ts"],"names":[],"mappings":"AAEA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAoCG;AAEH,OAAO,KAAK,EAAE,YAAY,IAAI,WAAW,EAAE,MAAM,qBAAqB,CAAC;AACvE,OAAO,KAAK,EAAE,UAAU,EAAe,MAAM,EAAE,MAAM,mBAAmB,CAAC;AAEzE,2DAA2D;AAC3D,MAAM,WAAW,oBAAoB;IACnC,qFAAqF;IACrF,YAAY,EAAE,MAAM,CAAC;IACrB,0FAA0F;IAC1F,UAAU,EAAE,MAAM,CAAC;IACnB,gFAAgF;IAChF,KAAK,EAAE,MAAM,CAAC;IACd,8EAA8E;IAC9E,YAAY,EAAE,MAAM,CAAC;CACtB;AAED,qBAAa,gBAAgB;IAC3B,OAAO,CAAC,KAAK,CAAc;gBAEf,KAAK,EAAE,WAAW;IAI9B;;OAEG;IACG,OAAO,CAAC,UAAU,EAAE,UAAU,GAAG,OAAO,CAAC;QAC7C,WAAW,EAAE,MAAM,CAAC;QACpB,YAAY,EAAE,MAAM,GAAG,IAAI,CAAC;QAC5B,kBAAkB,EAAE,MAAM,CAAC;QAC3B,QAAQ,EAAE,oBAAoB,CAAC;QAC/B,uBAAuB,EAAE,MAAM,CAAC;KACjC,CAAC;IAwDF;;;;;;;;;;;;;;;;;;;;;;;;;OAyBG;IACH,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,qBAAqB,CAAO;IACpD,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,qBAAqB,CAAM;IACnD,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,8BAA8B,CAAO;IAC7D,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,4BAA4B,CAEjD;IAEG,qBAAqB,CAAC,WAAW,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC;IAuCvF;;;;;;;;;;;;;;;;OAgBG;IACG,2BAA2B,CAC/B,MAAM,EAAE,MAAM,EACd,KAAK,GAAE,MAAU,GAChB,OAAO,CAAC,oBAAoB,CAAC;IA2FhC;;;;;OAKG;IACH,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,YAAY,CAAM;YAE5B,4BAA4B;CA+C3C"}

package/dist/engine/retraction.js

@@ -11,6 +11,31 @@
  *   2. An invalidation association is created
  *   3. Optionally, a counter-engram with correct info is created
  *   4. Confidence of associated engrams is reduced (contamination check)
+ *
+ * AWM 0.8.5 — Coherence-weighted propagation (2026-05-26)
+ * --------------------------------------------------------
+ * The Continued Influence Effect (Carrillo et al., ICCM 2025) shows that
+ * misinformation persists in human cognition because it lives inside a
+ * *coherent narrative*, not as an isolated fact. Correcting one chunk doesn't
+ * displace the narrative unless the correction also propagates through the
+ * connected structure.
+ *
+ * Translation: when we retract an engram, we compute a `cohesion` score for
+ * its 2-hop neighborhood and use it to amplify or dampen the contamination
+ * penalty on neighbors:
+ *
+ *   - Dense narrative cluster (high internal-edge density + shared tags)
+ *     → penalty amplified (~1.5×). The whole cluster shares the wrong story.
+ *
+ *   - Isolated engram (sparse edges, divergent tags)
+ *     → penalty dampened (~0.5×). No narrative to disrupt.
+ *
+ *   - Cross-domain bridge (low cohesion across an edge)
+ *     → bridge weight reduced but far-side neighbors barely affected.
+ *
+ * Cohesion is computed at retract time (no schema/consolidation changes).
+ * Cost: bounded by MAX_AFFECTED (20 nodes) × one batched `getAssociationsForBatch`
+ * call — typically 10-25ms.
  */
 export class RetractionEngine {
     store;
@@ -20,17 +45,18 @@ export class RetractionEngine {
     /**
      * Retract a memory — mark it invalid and optionally create a correction.
      */
-    retract(retraction) {
-        const target = this.store.getEngram(retraction.targetEngramId);
+    async retract(retraction) {
+        const target = await this.store.getEngram(retraction.targetEngramId);
         if (!target) {
             throw new Error(`Engram ${retraction.targetEngramId} not found`);
         }
         // Mark the original as retracted
-        this.store.retractEngram(target.id, null);
+        await this.store.retractEngram(target.id, null);
         let correctionId = null;
+        let narrativeEdgesInherited = 0;
         // Create counter-engram if correction content provided
         if (retraction.counterContent) {
-            const correction = this.store.createEngram({
+            const correction = await this.store.createEngram({
                 agentId: retraction.agentId,
                 concept: `correction:${target.concept}`,
                 content: retraction.counterContent,
@@ -41,29 +67,219 @@ export class RetractionEngine {
             });
             correctionId = correction.id;
             // Create invalidation link
-            this.store.upsertAssociation(correction.id, target.id, 1.0, 'invalidation', 1.0);
+            await this.store.upsertAssociation(correction.id, target.id, 1.0, 'invalidation', 1.0);
             // Update retracted_by to point to correction
-            this.store.retractEngram(target.id, correction.id);
+            await this.store.retractEngram(target.id, correction.id);
+            // Counter-narrative replacement (Carrillo et al ICCM 2025):
+            // The correction must take over the retracted memory's narrative position,
+            // not just contradict it. Inherit edges from the retracted's strong
+            // neighbors so the correction lives in the same context that the wrong
+            // memory occupied.
+            narrativeEdgesInherited = await this.inheritNarrativeEdges(target.id, correction.id);
+        }
+        // Compute cohesion of the target's neighborhood. A dense/cohesive
+        // neighborhood means the retracted memory was part of a coherent
+        // narrative; we propagate the contamination penalty more aggressively.
+        const cohesion = await this.computeNeighborhoodCohesion(target, 2);
+        // Reduce confidence of associated engrams (contamination spread).
+        // Depth 2 with cohesion-weighted penalty, capped at MAX_AFFECTED nodes.
+        const associatesAffected = await this.propagateConfidenceReduction(target.id, 0.1, 2, cohesion.score);
+        return { retractedId: target.id, correctionId, associatesAffected, cohesion, narrativeEdgesInherited };
+    }
+    /**
+     * Counter-narrative replacement helper.
+     *
+     * When a correction engram is created to replace a retracted memory, the
+     * correction inherits the retracted's strong-edge neighbors. This implements
+     * the "narrative replacement" mechanism the Continued Influence Effect paper
+     * argues is necessary for corrections to take hold: people don't drop
+     * misinformation when only one chunk is corrected; the surrounding context
+     * has to be reconnected to the new correct fact.
+     *
+     * Rules:
+     *   - Inherit only edges where weight >= NARRATIVE_INHERIT_MIN (0.4). Weak
+     *     edges aren't really part of the narrative.
+     *   - Skip edge types with special semantics: `invalidation` (the link
+     *     between retracted and correction itself), `causal` (specific cause
+     *     relationships, not narrative cohesion), `temporal` (chronological
+     *     sequence, not story structure).
+     *   - Skip neighbors that are themselves retracted — no point connecting
+     *     a correction to other wrong memories.
+     *   - Inherited edge weight = original × 0.7 (reduced — the correction
+     *     experienced this context only indirectly, through the retracted memory).
+     *   - Cap at NARRATIVE_INHERIT_MAX (10) edges, sorted by weight desc, to
+     *     bound the blast radius on highly-connected hubs.
+     *
+     * Returns the number of edges actually inherited.
+     */
+    static NARRATIVE_INHERIT_MIN = 0.4;
+    static NARRATIVE_INHERIT_MAX = 10;
+    static NARRATIVE_INHERIT_WEIGHT_SCALE = 0.7;
+    static NARRATIVE_INHERIT_SKIP_TYPES = new Set([
+        'invalidation', 'causal', 'temporal',
+    ]);
+    async inheritNarrativeEdges(retractedId, correctionId) {
+        const associations = await this.store.getAssociationsFor(retractedId);
+        // Filter to inheritable edges
+        const candidates = [];
+        for (const assoc of associations) {
+            if (RetractionEngine.NARRATIVE_INHERIT_SKIP_TYPES.has(assoc.type))
+                continue;
+            if (assoc.weight < RetractionEngine.NARRATIVE_INHERIT_MIN)
+                continue;
+            const neighborId = assoc.fromEngramId === retractedId ? assoc.toEngramId : assoc.fromEngramId;
+            if (neighborId === correctionId)
+                continue; // don't self-loop
+            candidates.push({ neighborId, weight: assoc.weight, confidence: assoc.confidence, type: assoc.type });
+        }
+        // Sort by weight desc, take top N
+        candidates.sort((a, b) => b.weight - a.weight);
+        const top = candidates.slice(0, RetractionEngine.NARRATIVE_INHERIT_MAX);
+        if (top.length === 0)
+            return 0;
+        // Filter out retracted neighbors (would inherit edges to wrong memories)
+        const neighborEngrams = await this.store.getEngramsByIds(top.map(c => c.neighborId));
+        const neighborMap = new Map(neighborEngrams.map(e => [e.id, e]));
+        let inherited = 0;
+        for (const c of top) {
+            const neighbor = neighborMap.get(c.neighborId);
+            if (!neighbor || neighbor.retracted)
+                continue;
+            const newWeight = c.weight * RetractionEngine.NARRATIVE_INHERIT_WEIGHT_SCALE;
+            await this.store.upsertAssociation(correctionId, c.neighborId, newWeight, 'connection', // Reuse existing type; semantically these ARE connections from the correction's perspective.
+            c.confidence);
+            inherited++;
+        }
+        return inherited;
+    }
+    /**
+     * Compute the narrative cohesion of `source`'s neighborhood within `depth` hops.
+     *
+     * Cohesion combines two signals:
+     *   - **Graph density**: How tightly interconnected are the neighbors?
+     *     internal_edges / (internal_edges + external_edges) across the subgraph.
+     *   - **Tag overlap**: How much do the neighbors share semantic tags with the source?
+     *     mean jaccard(source.tags, neighbor.tags).
+     *
+     * Both signals contribute on a [0, 1] scale; the combined score is
+     * `density × (1 + tagOverlap)` clamped to [0, 1]. A score of 0.5 is the
+     * "neutral" point where retraction penalty is unchanged from the legacy
+     * formula.
+     *
+     * Cost: O(subgraphSize × avg_degree) BFS + 1 batched fetch. Bounded by
+     * MAX_AFFECTED (20). Typical: ~10-25ms.
+     */
+    async computeNeighborhoodCohesion(source, depth = 2) {
+        // BFS to collect the subgraph nodes
+        const subgraphIds = new Set([source.id]);
+        let frontier = [source.id];
+        for (let d = 0; d < depth; d++) {
+            const next = [];
+            // Batch-fetch associations for the current frontier
+            const assocs = await this.store.getAssociationsForBatch(frontier);
+            for (const id of frontier) {
+                const list = assocs.get(id) ?? [];
+                for (const a of list) {
+                    if (a.type === 'invalidation')
+                        continue;
+                    const neighbor = a.fromEngramId === id ? a.toEngramId : a.fromEngramId;
+                    if (subgraphIds.has(neighbor))
+                        continue;
+                    if (subgraphIds.size >= RetractionEngine.MAX_AFFECTED)
+                        break;
+                    subgraphIds.add(neighbor);
+                    next.push(neighbor);
+                }
+                if (subgraphIds.size >= RetractionEngine.MAX_AFFECTED)
+                    break;
+            }
+            if (next.length === 0)
+                break;
+            frontier = next;
+        }
+        const subgraphSize = subgraphIds.size - 1; // exclude source
+        if (subgraphSize === 0) {
+            // No neighbors at all — fully isolated engram.
+            return { graphDensity: 0, tagOverlap: 0, score: 0, subgraphSize: 0 };
+        }
+        // Fetch all subgraph members' associations in one batch.
+        const allIds = Array.from(subgraphIds);
+        const allAssocs = await this.store.getAssociationsForBatch(allIds);
+        // Count internal vs external edges across the subgraph.
+        let internalEdges = 0;
+        let externalEdges = 0;
+        const seenEdge = new Set(); // de-dupe (each edge appears twice in BFS by endpoint)
+        for (const id of allIds) {
+            const list = allAssocs.get(id) ?? [];
+            for (const a of list) {
+                if (a.type === 'invalidation')
+                    continue;
+                // Canonical edge key (alphabetical) for de-duping
+                const key = a.fromEngramId < a.toEngramId
+                    ? `${a.fromEngramId}|${a.toEngramId}`
+                    : `${a.toEngramId}|${a.fromEngramId}`;
+                if (seenEdge.has(key))
+                    continue;
+                seenEdge.add(key);
+                const internal = subgraphIds.has(a.fromEngramId) && subgraphIds.has(a.toEngramId);
+                if (internal)
+                    internalEdges++;
+                else
+                    externalEdges++;
+            }
+        }
+        const totalEdges = internalEdges + externalEdges;
+        const graphDensity = totalEdges > 0 ? internalEdges / totalEdges : 0;
+        // Compute tag overlap (source vs each subgraph member).
+        const sourceTags = new Set(source.tags ?? []);
+        let tagOverlapSum = 0;
+        let tagOverlapCount = 0;
+        if (sourceTags.size > 0) {
+            // Fetch all subgraph engrams to read tags
+            const neighborIds = allIds.filter(id => id !== source.id);
+            const engrams = await this.store.getEngramsByIds(neighborIds);
+            for (const e of engrams) {
+                const neighborTags = new Set(e.tags ?? []);
+                if (neighborTags.size === 0)
+                    continue;
+                const intersection = [...sourceTags].filter(t => neighborTags.has(t)).length;
+                const union = sourceTags.size + neighborTags.size - intersection;
+                const jaccard = union > 0 ? intersection / union : 0;
+                tagOverlapSum += jaccard;
+                tagOverlapCount++;
+            }
         }
-        // Reduce confidence of associated engrams (contamination spread)
-        // Depth 2 with 50% decay per hop, capped at 20 total affected nodes
-        const associatesAffected = this.propagateConfidenceReduction(target.id, 0.1, 2);
-        return { retractedId: target.id, correctionId, associatesAffected };
+        const tagOverlap = tagOverlapCount > 0 ? tagOverlapSum / tagOverlapCount : 0;
+        // Combine: graph density × tag-modulated weight. Density alone saturates
+        // quickly in small subgraphs (everything is internal); tag overlap is the
+        // signal that distinguishes a genuine narrative from an incidental cluster.
+        //   score = density * (0.5 + 0.5 * tagOverlap)
+        //   - max (density=1, tagOverlap=1)  → 1.0  (canonical narrative)
+        //   - hub  (density=1, tagOverlap=0) → 0.5  (structurally connected but no shared story)
+        //   - half (density=0.5, tagOverlap=0.5) → 0.375
+        //   - zero (density=0)               → 0    (no neighborhood)
+        const rawScore = graphDensity * (0.5 + 0.5 * tagOverlap);
+        const score = Math.max(0, Math.min(1, rawScore));
+        return { graphDensity, tagOverlap, score, subgraphSize };
     }
     /**
      * Reduce confidence of engrams associated with a retracted engram.
-     * Propagates up to maxDepth hops with decaying penalty (50% per hop).
+     * Propagates up to maxDepth hops with decaying penalty (50% per hop) and
+     * cohesion-weighted amplification.
      * Capped at MAX_AFFECTED to prevent cascading through the graph.
      */
     static MAX_AFFECTED = 20;
-    propagateConfidenceReduction(engramId, penalty, maxDepth, currentDepth = 0, visited = new Set()) {
+    async propagateConfidenceReduction(engramId, penalty, maxDepth, cohesionScore, currentDepth = 0, visited = new Set()) {
         if (currentDepth >= maxDepth)
             return 0;
         if (visited.size >= RetractionEngine.MAX_AFFECTED)
             return 0;
         visited.add(engramId);
+        // Cohesion multiplier: 0.5 (isolated) → 1.5 (densely coherent narrative).
+        // At cohesion=0.5 (neutral), multiplier=1.0, preserving legacy behavior.
+        const cohesionMultiplier = 0.5 + cohesionScore;
         let affected = 0;
-        const associations = this.store.getAssociationsFor(engramId);
+        const associations = await this.store.getAssociationsFor(engramId);
         for (const assoc of associations) {
             if (assoc.type === 'invalidation')
                 continue; // Don't penalize corrections
@@ -74,17 +290,20 @@ export class RetractionEngine {
                 : assoc.fromEngramId;
             if (visited.has(neighborId))
                 continue;
-            const neighbor = this.store.getEngram(neighborId);
+            const neighbor = await this.store.getEngram(neighborId);
             if (!neighbor || neighbor.retracted)
                 continue;
-            // Scale penalty by association weight and decay per hop (50% per depth level)
+            // Scale penalty by association weight, depth decay (50% per hop),
+            // and cohesion multiplier (narrative-aware amplification).
             const depthDecay = Math.pow(0.5, currentDepth);
-            const scaledPenalty = penalty * assoc.weight * depthDecay;
+            const scaledPenalty = penalty * assoc.weight * depthDecay * cohesionMultiplier;
             const newConfidence = Math.max(0.1, neighbor.confidence - scaledPenalty);
-            this.store.updateConfidence(neighborId, newConfidence);
+            await this.store.updateConfidence(neighborId, newConfidence);
             affected++;
-            // Recurse to next depth
-            affected += this.propagateConfidenceReduction(neighborId, penalty, maxDepth, currentDepth + 1, visited);
+            // Recurse to next depth — cohesion is computed once at the source
+            // and applied uniformly through the propagation. Recomputing per-hop
+            // would be expensive and could cause oscillation.
+            affected += await this.propagateConfidenceReduction(neighborId, penalty, maxDepth, cohesionScore, currentDepth + 1, visited);
         }
         return affected;
     }

package/dist/engine/retraction.js.map

@@ -1 +1 @@
-{"version":3,"file":"retraction.js","sourceRoot":"","sources":["../../src/engine/retraction.ts"],"names":[],"mappings":"AAAA,gDAAgD;AAChD,sCAAsC;AACtC;;;;;;;;;;;GAWG;AAKH,MAAM,OAAO,gBAAgB;IACnB,KAAK,CAAc;IAE3B,YAAY,KAAkB;QAC5B,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;IACrB,CAAC;IAED;;OAEG;IACH,OAAO,CAAC,UAAsB;QAC5B,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,UAAU,CAAC,cAAc,CAAC,CAAC;QAC/D,IAAI,CAAC,MAAM,EAAE,CAAC;YACZ,MAAM,IAAI,KAAK,CAAC,UAAU,UAAU,CAAC,cAAc,YAAY,CAAC,CAAC;QACnE,CAAC;QAED,iCAAiC;QACjC,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QAE1C,IAAI,YAAY,GAAkB,IAAI,CAAC;QAEvC,uDAAuD;QACvD,IAAI,UAAU,CAAC,cAAc,EAAE,CAAC;YAC9B,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC;gBACzC,OAAO,EAAE,UAAU,CAAC,OAAO;gBAC3B,OAAO,EAAE,cAAc,MAAM,CAAC,OAAO,EAAE;gBACvC,OAAO,EAAE,UAAU,CAAC,cAAc;gBAClC,IAAI,EAAE,CAAC,GAAG,MAAM,CAAC,IAAI,EAAE,YAAY,EAAE,YAAY,CAAC;gBAClD,QAAQ,EAAE,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,QAAQ,EAAE,GAAG,CAAC,EAAE,8CAA8C;gBACxF,UAAU,EAAE,GAAG;gBACf,WAAW,EAAE,CAAC,uBAAuB,EAAE,eAAe,MAAM,CAAC,EAAE,EAAE,CAAC;aACnE,CAAC,CAAC;YAEH,YAAY,GAAG,UAAU,CAAC,EAAE,CAAC;YAE7B,2BAA2B;YAC3B,IAAI,CAAC,KAAK,CAAC,iBAAiB,CAC1B,UAAU,CAAC,EAAE,EAAE,MAAM,CAAC,EAAE,EAAE,GAAG,EAAE,cAAc,EAAE,GAAG,CACnD,CAAC;YAEF,6CAA6C;YAC7C,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,MAAM,CAAC,EAAE,EAAE,UAAU,CAAC,EAAE,CAAC,CAAC;QACrD,CAAC;QAED,iEAAiE;QACjE,oEAAoE;QACpE,MAAM,kBAAkB,GAAG,IAAI,CAAC,4BAA4B,CAAC,MAAM,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;QAEhF,OAAO,EAAE,WAAW,EAAE,MAAM,CAAC,EAAE,EAAE,YAAY,EAAE,kBAAkB,EAAE,CAAC;IACtE,CAAC;IAED;;;;OAIG;IACK,MAAM,CAAU,YAAY,GAAG,EAAE,CAAC;IAElC,4BAA4B,CAClC,QAAgB,EAChB,OAAe,EACf,QAAgB,EAChB,eAAuB,CAAC,EACxB,UAAuB,IAAI,GAAG,EAAE;QAEhC,IAAI,YAAY,IAAI,QAAQ;YAAE,OAAO,CAAC,CAAC;QACvC,IAAI,OAAO,CAAC,IAAI,IAAI,gBAAgB,CAAC,YAAY;YAAE,OAAO,CAAC,CAAC;QAC5D,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QAEtB,IAAI,QAAQ,GAAG,CAAC,CAAC;QACjB,MAAM,YAAY,GAAG,IAAI,CAAC,KAAK,CAAC,kBAAkB,CAAC,QAAQ,CAAC,CAAC;QAC7D,KAAK,MAAM,KAAK,IAAI,YAAY,EAAE,CAAC;YACjC,IAAI,KAAK,CAAC,IAAI,KAAK,cAAc;gBAAE,SAAS,CAAC,6BAA6B;YAC1E,IAAI,OAAO,CAAC,IAAI,IAAI,gBAAgB,CAAC,YAAY;gBAAE,MAAM;YAEzD,MAAM,UAAU,GAAG,KAAK,CAAC,YAAY,KAAK,QAAQ;gBAChD,CAAC,CAAC,KAAK,CAAC,UAAU;gBAClB,CAAC,CAAC,KAAK,CAAC,YAAY,CAAC;YACvB,IAAI,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC;gBAAE,SAAS;YAEtC,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC;YAClD,IAAI,CAAC,QAAQ,IAAI,QAAQ,CAAC,SAAS;gBAAE,SAAS;YAE9C,8EAA8E;YAC9E,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,YAAY,CAAC,CAAC;YAC/C,MAAM,aAAa,GAAG,OAAO,GAAG,KAAK,CAAC,MAAM,GAAG,UAAU,CAAC;YAC1D,MAAM,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,QAAQ,CAAC,UAAU,GAAG,aAAa,CAAC,CAAC;YACzE,IAAI,CAAC,KAAK,CAAC,gBAAgB,CAAC,UAAU,EAAE,aAAa,CAAC,CAAC;YACvD,QAAQ,EAAE,CAAC;YAEX,wBAAwB;YACxB,QAAQ,IAAI,IAAI,CAAC,4BAA4B,CAC3C,UAAU,EAAE,OAAO,EAAE,QAAQ,EAAE,YAAY,GAAG,CAAC,EAAE,OAAO,CACzD,CAAC;QACJ,CAAC;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC"}
+{"version":3,"file":"retraction.js","sourceRoot":"","sources":["../../src/engine/retraction.ts"],"names":[],"mappings":"AAAA,gDAAgD;AAChD,sCAAsC;AACtC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAoCG;AAiBH,MAAM,OAAO,gBAAgB;IACnB,KAAK,CAAc;IAE3B,YAAY,KAAkB;QAC5B,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;IACrB,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,OAAO,CAAC,UAAsB;QAOlC,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,UAAU,CAAC,cAAc,CAAC,CAAC;QACrE,IAAI,CAAC,MAAM,EAAE,CAAC;YACZ,MAAM,IAAI,KAAK,CAAC,UAAU,UAAU,CAAC,cAAc,YAAY,CAAC,CAAC;QACnE,CAAC;QAED,iCAAiC;QACjC,MAAM,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QAEhD,IAAI,YAAY,GAAkB,IAAI,CAAC;QACvC,IAAI,uBAAuB,GAAG,CAAC,CAAC;QAEhC,uDAAuD;QACvD,IAAI,UAAU,CAAC,cAAc,EAAE,CAAC;YAC9B,MAAM,UAAU,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC;gBAC/C,OAAO,EAAE,UAAU,CAAC,OAAO;gBAC3B,OAAO,EAAE,cAAc,MAAM,CAAC,OAAO,EAAE;gBACvC,OAAO,EAAE,UAAU,CAAC,cAAc;gBAClC,IAAI,EAAE,CAAC,GAAG,MAAM,CAAC,IAAI,EAAE,YAAY,EAAE,YAAY,CAAC;gBAClD,QAAQ,EAAE,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,QAAQ,EAAE,GAAG,CAAC,EAAE,8CAA8C;gBACxF,UAAU,EAAE,GAAG;gBACf,WAAW,EAAE,CAAC,uBAAuB,EAAE,eAAe,MAAM,CAAC,EAAE,EAAE,CAAC;aACnE,CAAC,CAAC;YAEH,YAAY,GAAG,UAAU,CAAC,EAAE,CAAC;YAE7B,2BAA2B;YAC3B,MAAM,IAAI,CAAC,KAAK,CAAC,iBAAiB,CAChC,UAAU,CAAC,EAAE,EAAE,MAAM,CAAC,EAAE,EAAE,GAAG,EAAE,cAAc,EAAE,GAAG,CACnD,CAAC;YAEF,6CAA6C;YAC7C,MAAM,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,MAAM,CAAC,EAAE,EAAE,UAAU,CAAC,EAAE,CAAC,CAAC;YAEzD,4DAA4D;YAC5D,2EAA2E;YAC3E,oEAAoE;YACpE,uEAAuE;YACvE,mBAAmB;YACnB,uBAAuB,GAAG,MAAM,IAAI,CAAC,qBAAqB,CAAC,MAAM,CAAC,EAAE,EAAE,UAAU,CAAC,EAAE,CAAC,CAAC;QACvF,CAAC;QAED,kEAAkE;QAClE,iEAAiE;QACjE,uEAAuE;QACvE,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,2BAA2B,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QAEnE,kEAAkE;QAClE,wEAAwE;QACxE,MAAM,kBAAkB,GAAG,MAAM,IAAI,CAAC,4BAA4B,CAChE,MAAM,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,QAAQ,CAAC,KAAK,CAClC,CAAC;QAEF,OAAO,EAAE,WAAW,EAAE,MAAM,CAAC,EAAE,EAAE,YAAY,EAAE,kBAAkB,EAAE,QAAQ,EAAE,uBAAuB,EAAE,CAAC;IACzG,CAAC;IAED;;;;;;;;;;;;;;;;;;;;;;;;;OAyBG;IACK,MAAM,CAAU,qBAAqB,GAAG,GAAG,CAAC;IAC5C,MAAM,CAAU,qBAAqB,GAAG,EAAE,CAAC;IAC3C,MAAM,CAAU,8BAA8B,GAAG,GAAG,CAAC;IACrD,MAAM,CAAU,4BAA4B,GAAG,IAAI,GAAG,CAAC;QAC7D,cAAc,EAAE,QAAQ,EAAE,UAAU;KACrC,CAAC,CAAC;IAEH,KAAK,CAAC,qBAAqB,CAAC,WAAmB,EAAE,YAAoB;QACnE,MAAM,YAAY,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,kBAAkB,CAAC,WAAW,CAAC,CAAC;QAEtE,8BAA8B;QAC9B,MAAM,UAAU,GAAoF,EAAE,CAAC;QACvG,KAAK,MAAM,KAAK,IAAI,YAAY,EAAE,CAAC;YACjC,IAAI,gBAAgB,CAAC,4BAA4B,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC;gBAAE,SAAS;YAC5E,IAAI,KAAK,CAAC,MAAM,GAAG,gBAAgB,CAAC,qBAAqB;gBAAE,SAAS;YACpE,MAAM,UAAU,GAAG,KAAK,CAAC,YAAY,KAAK,WAAW,CAAC,CAAC,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,KAAK,CAAC,YAAY,CAAC;YAC9F,IAAI,UAAU,KAAK,YAAY;gBAAE,SAAS,CAAC,kBAAkB;YAC7D,UAAU,CAAC,IAAI,CAAC,EAAE,UAAU,EAAE,MAAM,EAAE,KAAK,CAAC,MAAM,EAAE,UAAU,EAAE,KAAK,CAAC,UAAU,EAAE,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;QACxG,CAAC;QAED,kCAAkC;QAClC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC;QAC/C,MAAM,GAAG,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,gBAAgB,CAAC,qBAAqB,CAAC,CAAC;QACxE,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,CAAC,CAAC;QAE/B,yEAAyE;QACzE,MAAM,eAAe,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,eAAe,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC;QACrF,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAEjE,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,KAAK,MAAM,CAAC,IAAI,GAAG,EAAE,CAAC;YACpB,MAAM,QAAQ,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;YAC/C,IAAI,CAAC,QAAQ,IAAI,QAAQ,CAAC,SAAS;gBAAE,SAAS;YAC9C,MAAM,SAAS,GAAG,CAAC,CAAC,MAAM,GAAG,gBAAgB,CAAC,8BAA8B,CAAC;YAC7E,MAAM,IAAI,CAAC,KAAK,CAAC,iBAAiB,CAChC,YAAY,EACZ,CAAC,CAAC,UAAU,EACZ,SAAS,EACT,YAAY,EAAE,6FAA6F;YAC3G,CAAC,CAAC,UAAU,CACb,CAAC;YACF,SAAS,EAAE,CAAC;QACd,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;;;;;;;;;;;;;;;OAgBG;IACH,KAAK,CAAC,2BAA2B,CAC/B,MAAc,EACd,QAAgB,CAAC;QAEjB,oCAAoC;QACpC,MAAM,WAAW,GAAG,IAAI,GAAG,CAAS,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;QACjD,IAAI,QAAQ,GAAa,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QACrC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YAC/B,MAAM,IAAI,GAAa,EAAE,CAAC;YAC1B,oDAAoD;YACpD,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,uBAAuB,CAAC,QAAQ,CAAC,CAAC;YAClE,KAAK,MAAM,EAAE,IAAI,QAAQ,EAAE,CAAC;gBAC1B,MAAM,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;gBAClC,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;oBACrB,IAAI,CAAC,CAAC,IAAI,KAAK,cAAc;wBAAE,SAAS;oBACxC,MAAM,QAAQ,GAAG,CAAC,CAAC,YAAY,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC;oBACvE,IAAI,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAC;wBAAE,SAAS;oBACxC,IAAI,WAAW,CAAC,IAAI,IAAI,gBAAgB,CAAC,YAAY;wBAAE,MAAM;oBAC7D,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;oBAC1B,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;gBACtB,CAAC;gBACD,IAAI,WAAW,CAAC,IAAI,IAAI,gBAAgB,CAAC,YAAY;oBAAE,MAAM;YAC/D,CAAC;YACD,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;gBAAE,MAAM;YAC7B,QAAQ,GAAG,IAAI,CAAC;QAClB,CAAC;QAED,MAAM,YAAY,GAAG,WAAW,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,iBAAiB;QAE5D,IAAI,YAAY,KAAK,CAAC,EAAE,CAAC;YACvB,+CAA+C;YAC/C,OAAO,EAAE,YAAY,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,YAAY,EAAE,CAAC,EAAE,CAAC;QACvE,CAAC;QAED,yDAAyD;QACzD,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;QACvC,MAAM,SAAS,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,uBAAuB,CAAC,MAAM,CAAC,CAAC;QAEnE,wDAAwD;QACxD,IAAI,aAAa,GAAG,CAAC,CAAC;QACtB,IAAI,aAAa,GAAG,CAAC,CAAC;QACtB,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC,CAAC,uDAAuD;QAC3F,KAAK,MAAM,EAAE,IAAI,MAAM,EAAE,CAAC;YACxB,MAAM,IAAI,GAAG,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;YACrC,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;gBACrB,IAAI,CAAC,CAAC,IAAI,KAAK,cAAc;oBAAE,SAAS;gBACxC,kDAAkD;gBAClD,MAAM,GAAG,GAAG,CAAC,CAAC,YAAY,GAAG,CAAC,CAAC,UAAU;oBACvC,CAAC,CAAC,GAAG,CAAC,CAAC,YAAY,IAAI,CAAC,CAAC,UAAU,EAAE;oBACrC,CAAC,CAAC,GAAG,CAAC,CAAC,UAAU,IAAI,CAAC,CAAC,YAAY,EAAE,CAAC;gBACxC,IAAI,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC;oBAAE,SAAS;gBAChC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBAClB,MAAM,QAAQ,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,YAAY,CAAC,IAAI,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;gBAClF,IAAI,QAAQ;oBAAE,aAAa,EAAE,CAAC;;oBACzB,aAAa,EAAE,CAAC;YACvB,CAAC;QACH,CAAC;QACD,MAAM,UAAU,GAAG,aAAa,GAAG,aAAa,CAAC;QACjD,MAAM,YAAY,GAAG,UAAU,GAAG,CAAC,CAAC,CAAC,CAAC,aAAa,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;QAErE,wDAAwD;QACxD,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC;QAC9C,IAAI,aAAa,GAAG,CAAC,CAAC;QACtB,IAAI,eAAe,GAAG,CAAC,CAAC;QACxB,IAAI,UAAU,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;YACxB,0CAA0C;YAC1C,MAAM,WAAW,GAAG,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,KAAK,MAAM,CAAC,EAAE,CAAC,CAAC;YAC1D,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,eAAe,CAAC,WAAW,CAAC,CAAC;YAC9D,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;gBACxB,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC;gBAC3C,IAAI,YAAY,CAAC,IAAI,KAAK,CAAC;oBAAE,SAAS;gBACtC,MAAM,YAAY,GAAG,CAAC,GAAG,UAAU,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;gBAC7E,MAAM,KAAK,GAAG,UAAU,CAAC,IAAI,GAAG,YAAY,CAAC,IAAI,GAAG,YAAY,CAAC;gBACjE,MAAM,OAAO,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,YAAY,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;gBACrD,aAAa,IAAI,OAAO,CAAC;gBACzB,eAAe,EAAE,CAAC;YACpB,CAAC;QACH,CAAC;QACD,MAAM,UAAU,GAAG,eAAe,GAAG,CAAC,CAAC,CAAC,CAAC,aAAa,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC;QAE7E,yEAAyE;QACzE,0EAA0E;QAC1E,4EAA4E;QAC5E,+CAA+C;QAC/C,kEAAkE;QAClE,yFAAyF;QACzF,iDAAiD;QACjD,8DAA8D;QAC9D,MAAM,QAAQ,GAAG,YAAY,GAAG,CAAC,GAAG,GAAG,GAAG,GAAG,UAAU,CAAC,CAAC;QACzD,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC;QAEjD,OAAO,EAAE,YAAY,EAAE,UAAU,EAAE,KAAK,EAAE,YAAY,EAAE,CAAC;IAC3D,CAAC;IAED;;;;;OAKG;IACK,MAAM,CAAU,YAAY,GAAG,EAAE,CAAC;IAElC,KAAK,CAAC,4BAA4B,CACxC,QAAgB,EAChB,OAAe,EACf,QAAgB,EAChB,aAAqB,EACrB,eAAuB,CAAC,EACxB,UAAuB,IAAI,GAAG,EAAE;QAEhC,IAAI,YAAY,IAAI,QAAQ;YAAE,OAAO,CAAC,CAAC;QACvC,IAAI,OAAO,CAAC,IAAI,IAAI,gBAAgB,CAAC,YAAY;YAAE,OAAO,CAAC,CAAC;QAC5D,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QAEtB,0EAA0E;QAC1E,yEAAyE;QACzE,MAAM,kBAAkB,GAAG,GAAG,GAAG,aAAa,CAAC;QAE/C,IAAI,QAAQ,GAAG,CAAC,CAAC;QACjB,MAAM,YAAY,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,kBAAkB,CAAC,QAAQ,CAAC,CAAC;QACnE,KAAK,MAAM,KAAK,IAAI,YAAY,EAAE,CAAC;YACjC,IAAI,KAAK,CAAC,IAAI,KAAK,cAAc;gBAAE,SAAS,CAAC,6BAA6B;YAC1E,IAAI,OAAO,CAAC,IAAI,IAAI,gBAAgB,CAAC,YAAY;gBAAE,MAAM;YAEzD,MAAM,UAAU,GAAG,KAAK,CAAC,YAAY,KAAK,QAAQ;gBAChD,CAAC,CAAC,KAAK,CAAC,UAAU;gBAClB,CAAC,CAAC,KAAK,CAAC,YAAY,CAAC;YACvB,IAAI,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC;gBAAE,SAAS;YAEtC,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC;YACxD,IAAI,CAAC,QAAQ,IAAI,QAAQ,CAAC,SAAS;gBAAE,SAAS;YAE9C,kEAAkE;YAClE,2DAA2D;YAC3D,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,YAAY,CAAC,CAAC;YAC/C,MAAM,aAAa,GAAG,OAAO,GAAG,KAAK,CAAC,MAAM,GAAG,UAAU,GAAG,kBAAkB,CAAC;YAC/E,MAAM,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,QAAQ,CAAC,UAAU,GAAG,aAAa,CAAC,CAAC;YACzE,MAAM,IAAI,CAAC,KAAK,CAAC,gBAAgB,CAAC,UAAU,EAAE,aAAa,CAAC,CAAC;YAC7D,QAAQ,EAAE,CAAC;YAEX,kEAAkE;YAClE,qEAAqE;YACrE,kDAAkD;YAClD,QAAQ,IAAI,MAAM,IAAI,CAAC,4BAA4B,CACjD,UAAU,EAAE,OAAO,EAAE,QAAQ,EAAE,aAAa,EAAE,YAAY,GAAG,CAAC,EAAE,OAAO,CACxE,CAAC;QACJ,CAAC;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC"}

package/dist/engine/staging.d.ts

@@ -10,7 +10,7 @@
  * Modeled on hippocampal consolidation — provisional encoding
  * that only persists if reactivated.
  */
-import type { EngramStore } from '../storage/sqlite.js';
+import type { IEngramStore as EngramStore } from '../storage/store.js';
 import type { ActivationEngine } from './activation.js';
 export declare class StagingBuffer {
     private store;

package/dist/engine/staging.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"staging.d.ts","sourceRoot":"","sources":["../../src/engine/staging.ts"],"names":[],"mappings":"AAEA;;;;;;;;;;;GAWG;AAEH,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,sBAAsB,CAAC;AACxD,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,iBAAiB,CAAC;AAExD,qBAAa,aAAa;IACxB,OAAO,CAAC,KAAK,CAAc;IAC3B,OAAO,CAAC,MAAM,CAAmB;IACjC,OAAO,CAAC,aAAa,CAA+C;gBAExD,KAAK,EAAE,WAAW,EAAE,MAAM,EAAE,gBAAgB;IAKxD;;OAEG;IACH,KAAK,CAAC,UAAU,GAAE,MAAe,GAAG,IAAI;IAIxC,IAAI,IAAI,IAAI;IAOZ;;OAEG;IACG,KAAK,IAAI,OAAO,CAAC;QAAE,QAAQ,EAAE,MAAM,EAAE,CAAC;QAAC,SAAS,EAAE,MAAM,EAAE,CAAA;KAAE,CAAC;CA4BpE"}
+{"version":3,"file":"staging.d.ts","sourceRoot":"","sources":["../../src/engine/staging.ts"],"names":[],"mappings":"AAEA;;;;;;;;;;;GAWG;AAEH,OAAO,KAAK,EAAE,YAAY,IAAI,WAAW,EAAE,MAAM,qBAAqB,CAAC;AACvE,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,iBAAiB,CAAC;AAExD,qBAAa,aAAa;IACxB,OAAO,CAAC,KAAK,CAAc;IAC3B,OAAO,CAAC,MAAM,CAAmB;IACjC,OAAO,CAAC,aAAa,CAA+C;gBAExD,KAAK,EAAE,WAAW,EAAE,MAAM,EAAE,gBAAgB;IAKxD;;OAEG;IACH,KAAK,CAAC,UAAU,GAAE,MAAe,GAAG,IAAI;IAIxC,IAAI,IAAI,IAAI;IAOZ;;OAEG;IACG,KAAK,IAAI,OAAO,CAAC;QAAE,QAAQ,EAAE,MAAM,EAAE,CAAC;QAAC,SAAS,EAAE,MAAM,EAAE,CAAA;KAAE,CAAC;CA4BpE"}

package/dist/engine/staging.js

@@ -38,7 +38,7 @@ export class StagingBuffer {
     async sweep() {
         const promoted = [];
         const discarded = [];
-        const expired = this.store.getExpiredStaging();
+        const expired = await this.store.getExpiredStaging();
         for (const engram of expired) {
             // Check if this engram resonates with active memory
             const results = await this.engine.activate({
@@ -50,12 +50,12 @@ export class StagingBuffer {
             });
             if (results.length > 0) {
                 // Resonance found — promote to active
-                this.store.updateStage(engram.id, 'active');
+                await this.store.updateStage(engram.id, 'active');
                 promoted.push(engram.id);
             }
             else {
                 // No resonance — discard
-                this.store.deleteEngram(engram.id);
+                await this.store.deleteEngram(engram.id);
                 discarded.push(engram.id);
             }
         }

package/dist/engine/staging.js.map

@@ -1 +1 @@
-{"version":3,"file":"staging.js","sourceRoot":"","sources":["../../src/engine/staging.ts"],"names":[],"mappings":"AAAA,gDAAgD;AAChD,sCAAsC;AACtC;;;;;;;;;;;GAWG;AAKH,MAAM,OAAO,aAAa;IAChB,KAAK,CAAc;IACnB,MAAM,CAAmB;IACzB,aAAa,GAA0C,IAAI,CAAC;IAEpE,YAAY,KAAkB,EAAE,MAAwB;QACtD,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;IACvB,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,aAAqB,MAAM;QAC/B,IAAI,CAAC,aAAa,GAAG,WAAW,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,KAAK,EAAE,EAAE,UAAU,CAAC,CAAC;IACnE,CAAC;IAED,IAAI;QACF,IAAI,IAAI,CAAC,aAAa,EAAE,CAAC;YACvB,aAAa,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;YAClC,IAAI,CAAC,aAAa,GAAG,IAAI,CAAC;QAC5B,CAAC;IACH,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,KAAK;QACT,MAAM,QAAQ,GAAa,EAAE,CAAC;QAC9B,MAAM,SAAS,GAAa,EAAE,CAAC;QAE/B,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,iBAAiB,EAAE,CAAC;QAC/C,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC7B,oDAAoD;YACpD,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC;gBACzC,OAAO,EAAE,MAAM,CAAC,OAAO;gBACvB,OAAO,EAAE,GAAG,MAAM,CAAC,OAAO,IAAI,MAAM,CAAC,OAAO,EAAE;gBAC9C,KAAK,EAAE,CAAC;gBACR,QAAQ,EAAE,GAAG;gBACb,QAAQ,EAAE,IAAI;aACf,CAAC,CAAC;YAEH,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACvB,sCAAsC;gBACtC,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,MAAM,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC;gBAC5C,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;YAC3B,CAAC;iBAAM,CAAC;gBACN,yBAAyB;gBACzB,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;gBACnC,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;YAC5B,CAAC;QACH,CAAC;QAED,OAAO,EAAE,QAAQ,EAAE,SAAS,EAAE,CAAC;IACjC,CAAC;CACF"}
+{"version":3,"file":"staging.js","sourceRoot":"","sources":["../../src/engine/staging.ts"],"names":[],"mappings":"AAAA,gDAAgD;AAChD,sCAAsC;AACtC;;;;;;;;;;;GAWG;AAKH,MAAM,OAAO,aAAa;IAChB,KAAK,CAAc;IACnB,MAAM,CAAmB;IACzB,aAAa,GAA0C,IAAI,CAAC;IAEpE,YAAY,KAAkB,EAAE,MAAwB;QACtD,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;IACvB,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,aAAqB,MAAM;QAC/B,IAAI,CAAC,aAAa,GAAG,WAAW,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,KAAK,EAAE,EAAE,UAAU,CAAC,CAAC;IACnE,CAAC;IAED,IAAI;QACF,IAAI,IAAI,CAAC,aAAa,EAAE,CAAC;YACvB,aAAa,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;YAClC,IAAI,CAAC,aAAa,GAAG,IAAI,CAAC;QAC5B,CAAC;IACH,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,KAAK;QACT,MAAM,QAAQ,GAAa,EAAE,CAAC;QAC9B,MAAM,SAAS,GAAa,EAAE,CAAC;QAE/B,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,iBAAiB,EAAE,CAAC;QACrD,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC7B,oDAAoD;YACpD,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC;gBACzC,OAAO,EAAE,MAAM,CAAC,OAAO;gBACvB,OAAO,EAAE,GAAG,MAAM,CAAC,OAAO,IAAI,MAAM,CAAC,OAAO,EAAE;gBAC9C,KAAK,EAAE,CAAC;gBACR,QAAQ,EAAE,GAAG;gBACb,QAAQ,EAAE,IAAI;aACf,CAAC,CAAC;YAEH,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACvB,sCAAsC;gBACtC,MAAM,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,MAAM,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC;gBAClD,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;YAC3B,CAAC;iBAAM,CAAC;gBACN,yBAAyB;gBACzB,MAAM,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;gBACzC,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;YAC5B,CAAC;QACH,CAAC;QAED,OAAO,EAAE,QAAQ,EAAE,SAAS,EAAE,CAAC;IACjC,CAAC;CACF"}