agent-working-memory 0.6.0 → 0.7.0

package/dist/core/hebbian.d.ts

@@ -15,7 +15,16 @@
 export declare function strengthenAssociation(currentWeight: number, signal?: number, rate?: number): number;
 /**
  * Weaken an association weight due to lack of co-activation.
- * Called periodically by the connection engine.
+ * Uses power-law decay (DASH model) instead of exponential.
+ * Power law has a longer tail — old but valuable associations
+ * don't vanish as aggressively as exponential decay.
+ *
+ * DASH: weight = initial × (1 + t/scale)^(-exponent)
+ * vs exponential: weight = initial × 0.5^(t/halfLife)
+ *
+ * At 7 days: power-law retains ~58% vs exponential 50%
+ * At 30 days: power-law retains ~32% vs exponential 6%
+ * At 90 days: power-law retains ~20% vs exponential 0.02%
  */
 export declare function decayAssociation(currentWeight: number, daysSinceActivation: number, halfLife?: number): number;
 /**
@@ -35,4 +44,19 @@ export declare class CoActivationBuffer {
     getCoActivatedPairs(windowMs?: number): [string, string][];
     clear(): void;
 }
+export declare class ValidationGatedBuffer {
+    private pending;
+    /** Record co-activated pairs as pending (awaiting feedback validation) */
+    addPending(engramIds: string[], pairs: [string, string][]): void;
+    /**
+     * Resolve pending updates for an engram that received feedback.
+     * Returns pairs to strengthen (positive) or weaken (negative).
+     */
+    resolveFeedback(engramId: string, useful: boolean): {
+        pairs: [string, string][];
+        signal: number;
+    };
+    /** Get count of pending updates (for stats) */
+    get pendingCount(): number;
+}
 //# sourceMappingURL=hebbian.d.ts.map

package/dist/core/hebbian.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"hebbian.d.ts","sourceRoot":"","sources":["../../src/core/hebbian.ts"],"names":[],"mappings":"AAEA;;;;;;;;;;GAUG;AAKH;;GAEG;AACH,wBAAgB,qBAAqB,CACnC,aAAa,EAAE,MAAM,EACrB,MAAM,GAAE,MAAY,EACpB,IAAI,GAAE,MAAa,GAClB,MAAM,CAIR;AAED;;;GAGG;AACH,wBAAgB,gBAAgB,CAC9B,aAAa,EAAE,MAAM,EACrB,mBAAmB,EAAE,MAAM,EAC3B,QAAQ,GAAE,MAAY,GACrB,MAAM,CAGR;AAED;;;;GAIG;AACH,qBAAa,kBAAkB;IAC7B,OAAO,CAAC,MAAM,CAAiD;IAC/D,OAAO,CAAC,OAAO,CAAS;gBAEZ,OAAO,GAAE,MAAW;IAIhC,IAAI,CAAC,QAAQ,EAAE,MAAM,GAAG,IAAI;IAO5B,SAAS,CAAC,SAAS,EAAE,MAAM,EAAE,GAAG,IAAI;IAMpC;;OAEG;IACH,mBAAmB,CAAC,QAAQ,GAAE,MAAa,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE;IAiBhE,KAAK,IAAI,IAAI;CAGd"}
+{"version":3,"file":"hebbian.d.ts","sourceRoot":"","sources":["../../src/core/hebbian.ts"],"names":[],"mappings":"AAEA;;;;;;;;;;GAUG;AAKH;;GAEG;AACH,wBAAgB,qBAAqB,CACnC,aAAa,EAAE,MAAM,EACrB,MAAM,GAAE,MAAY,EACpB,IAAI,GAAE,MAAa,GAClB,MAAM,CAIR;AAED;;;;;;;;;;;;GAYG;AACH,wBAAgB,gBAAgB,CAC9B,aAAa,EAAE,MAAM,EACrB,mBAAmB,EAAE,MAAM,EAC3B,QAAQ,GAAE,MAAY,GACrB,MAAM,CAKR;AAED;;;;GAIG;AACH,qBAAa,kBAAkB;IAC7B,OAAO,CAAC,MAAM,CAAiD;IAC/D,OAAO,CAAC,OAAO,CAAS;gBAEZ,OAAO,GAAE,MAAW;IAIhC,IAAI,CAAC,QAAQ,EAAE,MAAM,GAAG,IAAI;IAO5B,SAAS,CAAC,SAAS,EAAE,MAAM,EAAE,GAAG,IAAI;IAMpC;;OAEG;IACH,mBAAmB,CAAC,QAAQ,GAAE,MAAa,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE;IAiBhE,KAAK,IAAI,IAAI;CAGd;AAsBD,qBAAa,qBAAqB;IAChC,OAAO,CAAC,OAAO,CAA8B;IAE7C,0EAA0E;IAC1E,UAAU,CAAC,SAAS,EAAE,MAAM,EAAE,EAAE,KAAK,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,GAAG,IAAI;IAOhE;;;OAGG;IACH,eAAe,CAAC,QAAQ,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,GAAG;QAAE,KAAK,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,CAAC;QAAC,MAAM,EAAE,MAAM,CAAA;KAAE;IA+BjG,+CAA+C;IAC/C,IAAI,YAAY,IAAI,MAAM,CAAgC;CAC3D"}

package/dist/core/hebbian.js

@@ -23,11 +23,22 @@ export function strengthenAssociation(currentWeight, signal = 1.0, rate = 0.25)
 }
 /**
  * Weaken an association weight due to lack of co-activation.
- * Called periodically by the connection engine.
+ * Uses power-law decay (DASH model) instead of exponential.
+ * Power law has a longer tail — old but valuable associations
+ * don't vanish as aggressively as exponential decay.
+ *
+ * DASH: weight = initial × (1 + t/scale)^(-exponent)
+ * vs exponential: weight = initial × 0.5^(t/halfLife)
+ *
+ * At 7 days: power-law retains ~58% vs exponential 50%
+ * At 30 days: power-law retains ~32% vs exponential 6%
+ * At 90 days: power-law retains ~20% vs exponential 0.02%
  */
-export function decayAssociation(currentWeight, daysSinceActivation, halfLife = 7.0 // days
+export function decayAssociation(currentWeight, daysSinceActivation, halfLife = 7.0 // scale parameter (days)
 ) {
-    const decayFactor = Math.pow(0.5, daysSinceActivation / halfLife);
+    // Power-law decay: (1 + t/scale)^(-exponent)
+    const exponent = 0.8; // Controls steepness — 0.8 gives a good balance
+    const decayFactor = Math.pow(1 + daysSinceActivation / halfLife, -exponent);
     return Math.max(currentWeight * decayFactor, MIN_WEIGHT);
 }
 /**
@@ -73,4 +84,61 @@ export class CoActivationBuffer {
         this.buffer = [];
     }
 }
+/**
+ * Validation-gated Hebbian buffer (Kairos-inspired).
+ *
+ * Instead of strengthening associations immediately on co-activation,
+ * pairs are held pending until feedback arrives. This prevents hub toxicity
+ * from noisy co-retrieval — edges only strengthen when the retrieval was
+ * actually useful.
+ *
+ * - Positive feedback → strengthen the pending pairs
+ * - Negative feedback → slightly weaken them
+ * - No feedback within GATE_TIMEOUT_MS → discard (neutral)
+ */
+const GATE_TIMEOUT_MS = 60_000; // 60 seconds to receive feedback
+export class ValidationGatedBuffer {
+    pending = [];
+    /** Record co-activated pairs as pending (awaiting feedback validation) */
+    addPending(engramIds, pairs) {
+        this.pending.push({ pairs, engramIds, timestamp: Date.now() });
+        // Evict expired entries
+        const cutoff = Date.now() - GATE_TIMEOUT_MS;
+        this.pending = this.pending.filter(p => p.timestamp > cutoff);
+    }
+    /**
+     * Resolve pending updates for an engram that received feedback.
+     * Returns pairs to strengthen (positive) or weaken (negative).
+     */
+    resolveFeedback(engramId, useful) {
+        const cutoff = Date.now() - GATE_TIMEOUT_MS;
+        const matching = [];
+        // Find all pending updates that include this engram and are still within the gate window
+        this.pending = this.pending.filter(p => {
+            if (p.timestamp < cutoff)
+                return false; // expired
+            if (p.engramIds.includes(engramId)) {
+                matching.push(...p.pairs);
+                return false; // consumed
+            }
+            return true; // keep
+        });
+        // Deduplicate pairs
+        const seen = new Set();
+        const unique = [];
+        for (const [a, b] of matching) {
+            const key = a < b ? `${a}:${b}` : `${b}:${a}`;
+            if (!seen.has(key)) {
+                seen.add(key);
+                unique.push([a, b]);
+            }
+        }
+        return {
+            pairs: unique,
+            signal: useful ? 1.0 : -0.3, // positive = full strengthen, negative = slight weaken
+        };
+    }
+    /** Get count of pending updates (for stats) */
+    get pendingCount() { return this.pending.length; }
+}
 //# sourceMappingURL=hebbian.js.map

package/dist/core/hebbian.js.map

@@ -1 +1 @@
-{"version":3,"file":"hebbian.js","sourceRoot":"","sources":["../../src/core/hebbian.ts"],"names":[],"mappings":"AAAA,gDAAgD;AAChD,sCAAsC;AACtC;;;;;;;;;;GAUG;AAEH,MAAM,UAAU,GAAG,KAAK,CAAC;AACzB,MAAM,UAAU,GAAG,GAAG,CAAC,CAAE,2CAA2C;AAEpE;;GAEG;AACH,MAAM,UAAU,qBAAqB,CACnC,aAAqB,EACrB,SAAiB,GAAG,EACpB,OAAe,IAAI;IAEnB,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,aAAa,EAAE,UAAU,CAAC,CAAC,CAAC;IAC3D,MAAM,MAAM,GAAG,IAAI,GAAG,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC;IAClD,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,UAAU,CAAC,CAAC;AAChD,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,gBAAgB,CAC9B,aAAqB,EACrB,mBAA2B,EAC3B,WAAmB,GAAG,CAAC,OAAO;;IAE9B,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,mBAAmB,GAAG,QAAQ,CAAC,CAAC;IAClE,OAAO,IAAI,CAAC,GAAG,CAAC,aAAa,GAAG,WAAW,EAAE,UAAU,CAAC,CAAC;AAC3D,CAAC;AAED;;;;GAIG;AACH,MAAM,OAAO,kBAAkB;IACrB,MAAM,GAA8C,EAAE,CAAC;IACvD,OAAO,CAAS;IAExB,YAAY,UAAkB,EAAE;QAC9B,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;IACzB,CAAC;IAED,IAAI,CAAC,QAAgB;QACnB,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,SAAS,EAAE,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;QACtD,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,IAAI,CAAC,OAAO,EAAE,CAAC;YACtC,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC;QACtB,CAAC;IACH,CAAC;IAED,SAAS,CAAC,SAAmB;QAC3B,KAAK,MAAM,EAAE,IAAI,SAAS,EAAE,CAAC;YAC3B,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAChB,CAAC;IACH,CAAC;IAED;;OAEG;IACH,mBAAmB,CAAC,WAAmB,IAAI;QACzC,MAAM,KAAK,GAAuB,EAAE,CAAC;QACrC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5C,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAChD,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACzB,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACzB,IACE,CAAC,CAAC,QAAQ,KAAK,CAAC,CAAC,QAAQ;oBACzB,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC,SAAS,CAAC,IAAI,QAAQ,EAC/C,CAAC;oBACD,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;gBACvC,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED,KAAK;QACH,IAAI,CAAC,MAAM,GAAG,EAAE,CAAC;IACnB,CAAC;CACF"}
+{"version":3,"file":"hebbian.js","sourceRoot":"","sources":["../../src/core/hebbian.ts"],"names":[],"mappings":"AAAA,gDAAgD;AAChD,sCAAsC;AACtC;;;;;;;;;;GAUG;AAEH,MAAM,UAAU,GAAG,KAAK,CAAC;AACzB,MAAM,UAAU,GAAG,GAAG,CAAC,CAAE,2CAA2C;AAEpE;;GAEG;AACH,MAAM,UAAU,qBAAqB,CACnC,aAAqB,EACrB,SAAiB,GAAG,EACpB,OAAe,IAAI;IAEnB,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,aAAa,EAAE,UAAU,CAAC,CAAC,CAAC;IAC3D,MAAM,MAAM,GAAG,IAAI,GAAG,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC;IAClD,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,UAAU,CAAC,CAAC;AAChD,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,gBAAgB,CAC9B,aAAqB,EACrB,mBAA2B,EAC3B,WAAmB,GAAG,CAAC,yBAAyB;;IAEhD,6CAA6C;IAC7C,MAAM,QAAQ,GAAG,GAAG,CAAC,CAAC,gDAAgD;IACtE,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,mBAAmB,GAAG,QAAQ,EAAE,CAAC,QAAQ,CAAC,CAAC;IAC5E,OAAO,IAAI,CAAC,GAAG,CAAC,aAAa,GAAG,WAAW,EAAE,UAAU,CAAC,CAAC;AAC3D,CAAC;AAED;;;;GAIG;AACH,MAAM,OAAO,kBAAkB;IACrB,MAAM,GAA8C,EAAE,CAAC;IACvD,OAAO,CAAS;IAExB,YAAY,UAAkB,EAAE;QAC9B,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;IACzB,CAAC;IAED,IAAI,CAAC,QAAgB;QACnB,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,SAAS,EAAE,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;QACtD,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,IAAI,CAAC,OAAO,EAAE,CAAC;YACtC,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC;QACtB,CAAC;IACH,CAAC;IAED,SAAS,CAAC,SAAmB;QAC3B,KAAK,MAAM,EAAE,IAAI,SAAS,EAAE,CAAC;YAC3B,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAChB,CAAC;IACH,CAAC;IAED;;OAEG;IACH,mBAAmB,CAAC,WAAmB,IAAI;QACzC,MAAM,KAAK,GAAuB,EAAE,CAAC;QACrC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5C,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAChD,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACzB,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACzB,IACE,CAAC,CAAC,QAAQ,KAAK,CAAC,CAAC,QAAQ;oBACzB,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC,SAAS,CAAC,IAAI,QAAQ,EAC/C,CAAC;oBACD,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;gBACvC,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED,KAAK;QACH,IAAI,CAAC,MAAM,GAAG,EAAE,CAAC;IACnB,CAAC;CACF;AAED;;;;;;;;;;;GAWG;AACH,MAAM,eAAe,GAAG,MAAM,CAAC,CAAC,iCAAiC;AAQjE,MAAM,OAAO,qBAAqB;IACxB,OAAO,GAA2B,EAAE,CAAC;IAE7C,0EAA0E;IAC1E,UAAU,CAAC,SAAmB,EAAE,KAAyB;QACvD,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,SAAS,EAAE,SAAS,EAAE,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;QAC/D,wBAAwB;QACxB,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,eAAe,CAAC;QAC5C,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,SAAS,GAAG,MAAM,CAAC,CAAC;IAChE,CAAC;IAED;;;OAGG;IACH,eAAe,CAAC,QAAgB,EAAE,MAAe;QAC/C,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,eAAe,CAAC;QAC5C,MAAM,QAAQ,GAAuB,EAAE,CAAC;QAExC,yFAAyF;QACzF,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE;YACrC,IAAI,CAAC,CAAC,SAAS,GAAG,MAAM;gBAAE,OAAO,KAAK,CAAC,CAAC,UAAU;YAClD,IAAI,CAAC,CAAC,SAAS,CAAC,QAAQ,CAAC,QAAQ,CAAC,EAAE,CAAC;gBACnC,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;gBAC1B,OAAO,KAAK,CAAC,CAAC,WAAW;YAC3B,CAAC;YACD,OAAO,IAAI,CAAC,CAAC,OAAO;QACtB,CAAC,CAAC,CAAC;QAEH,oBAAoB;QACpB,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;QAC/B,MAAM,MAAM,GAAuB,EAAE,CAAC;QACtC,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,QAAQ,EAAE,CAAC;YAC9B,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YAC9C,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBACnB,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBACd,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YACtB,CAAC;QACH,CAAC;QAED,OAAO;YACL,KAAK,EAAE,MAAM;YACb,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,uDAAuD;SACrF,CAAC;IACJ,CAAC;IAED,+CAA+C;IAC/C,IAAI,YAAY,KAAa,OAAO,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC;CAC3D"}

package/dist/engine/activation.d.ts

@@ -16,23 +16,41 @@
  *
  * Logs activation events for eval metrics.
  */
+import { ValidationGatedBuffer } from '../core/hebbian.js';
 import type { ActivationResult, ActivationQuery } from '../types/index.js';
 import type { EngramStore } from '../storage/sqlite.js';
 export declare class ActivationEngine {
     private store;
     private coActivationBuffer;
+    readonly validationGate: ValidationGatedBuffer;
     constructor(store: EngramStore);
     /**
      * Activate — retrieve the most cognitively relevant engrams for a context.
      */
     activate(query: ActivationQuery): Promise<ActivationResult[]>;
     /**
-     * Beam search graph walk — replaces naive BFS.
-     * Scores paths (not just nodes), uses query-dependent edge filtering,
-     * and supports deeper exploration with focused beams.
+     * Multi-graph traversal (MAGMA-inspired).
+     *
+     * Instead of one beam search over all edge types, runs independent traversals
+     * per graph type with specialized scoring, then fuses the boosts.
+     *
+     * Four sub-graphs:
+     * - Semantic (connection + hebbian edges) → standard weight-based walk
+     * - Temporal (temporal edges) → recency-weighted (favor recent connections)
+     * - Causal (causal edges) → full weight walk (causal links are high-value)
+     * - Entity (bridge edges) → entity-tag-weighted walk
+     *
+     * Each sub-graph contributes independently to the final graph boost,
+     * weighted by configurable per-graph weights.
      */
+    private static readonly GRAPH_WEIGHTS;
     private graphWalk;
-    private updateHebbianWeights;
+    /**
+     * Resolve validation-gated Hebbian update for a specific engram.
+     * Called by memory_feedback — only strengthens when retrieval was useful.
+     * This prevents hub toxicity from noisy co-retrieval (Kairos-inspired).
+     */
+    resolveHebbianFeedback(engramId: string, useful: boolean): number;
     private explain;
 }
 //# sourceMappingURL=activation.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"activation.d.ts","sourceRoot":"","sources":["../../src/engine/activation.ts"],"names":[],"mappings":"AAEA;;;;;;;;;;;;;;;;;GAiBG;AAQH,OAAO,KAAK,EACF,gBAAgB,EAAE,eAAe,EAC1C,MAAM,mBAAmB,CAAC;AAC3B,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,sBAAsB,CAAC;AAoIxD,qBAAa,gBAAgB;IAC3B,OAAO,CAAC,KAAK,CAAc;IAC3B,OAAO,CAAC,kBAAkB,CAAqB;gBAEnC,KAAK,EAAE,WAAW;IAK9B;;OAEG;IACG,QAAQ,CAAC,KAAK,EAAE,eAAe,GAAG,OAAO,CAAC,gBAAgB,EAAE,CAAC;IA2dnE;;;;OAIG;IACH,OAAO,CAAC,SAAS;IAwEjB,OAAO,CAAC,oBAAoB;IAiB5B,OAAO,CAAC,OAAO;CAchB"}
+{"version":3,"file":"activation.d.ts","sourceRoot":"","sources":["../../src/engine/activation.ts"],"names":[],"mappings":"AAEA;;;;;;;;;;;;;;;;;GAiBG;AAIH,OAAO,EAA6C,qBAAqB,EAAE,MAAM,oBAAoB,CAAC;AAItG,OAAO,KAAK,EACF,gBAAgB,EAAE,eAAe,EAC1C,MAAM,mBAAmB,CAAC;AAC3B,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,sBAAsB,CAAC;AAoIxD,qBAAa,gBAAgB;IAC3B,OAAO,CAAC,KAAK,CAAc;IAC3B,OAAO,CAAC,kBAAkB,CAAqB;IAC/C,QAAQ,CAAC,cAAc,EAAE,qBAAqB,CAAC;gBAEnC,KAAK,EAAE,WAAW;IAM9B;;OAEG;IACG,QAAQ,CAAC,KAAK,EAAE,eAAe,GAAG,OAAO,CAAC,gBAAgB,EAAE,CAAC;IAifnE;;;;;;;;;;;;;;OAcG;IACH,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,aAAa,CAKnC;IAEF,OAAO,CAAC,SAAS;IA+FjB;;;;OAIG;IACH,sBAAsB,CAAC,QAAQ,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,GAAG,MAAM;IAwBjE,OAAO,CAAC,OAAO;CAchB"}

package/dist/engine/activation.js

@@ -20,7 +20,7 @@
  */
 import { randomUUID } from 'node:crypto';
 import { baseLevelActivation, softplus } from '../core/decay.js';
-import { strengthenAssociation, CoActivationBuffer } from '../core/hebbian.js';
+import { strengthenAssociation, CoActivationBuffer, ValidationGatedBuffer } from '../core/hebbian.js';
 import { embed, cosineSimilarity } from '../core/embeddings.js';
 import { rerank } from '../core/reranker.js';
 import { expandQuery } from '../core/query-expander.js';
@@ -150,9 +150,11 @@ function jaccard(a, b) {
 export class ActivationEngine {
     store;
     coActivationBuffer;
+    validationGate;
     constructor(store) {
         this.store = store;
         this.coActivationBuffer = new CoActivationBuffer(50);
+        this.validationGate = new ValidationGatedBuffer();
     }
     /**
      * Activate — retrieve the most cognitively relevant engrams for a context.
@@ -165,14 +167,17 @@ export class ActivationEngine {
         const useExpansion = query.useExpansion ?? true;
         const abstentionThreshold = query.abstentionThreshold ?? 0;
         const adaptive = resolveAdaptiveParams(query);
+        // Resolve workspace scope: if workspace is set, search across all agents in that workspace
+        const agentIds = query.workspace
+            ? this.store.getWorkspaceAgentIds(query.agentId, query.workspace)
+            : [query.agentId];
+        const isWorkspaceScoped = agentIds.length > 1;
         // Phase -1: Coref expansion — if query has pronouns, append recent entity names
-        // Helps conversational recall where "she/he/they/it" refers to a named entity.
         let queryContext = query.context;
         const pronounPattern = /\b(she|he|they|her|his|him|their|it|that|this|there)\b/i;
         if (pronounPattern.test(queryContext)) {
-            // Pull recent entity names from the agent's most-accessed memories
             try {
-                const recentEntities = this.store.getEngramsByAgent(query.agentId, 'active')
+                const recentEntities = this.store.getEngramsByAgents(agentIds, 'active')
                     .sort((a, b) => b.accessCount - a.accessCount)
                     .slice(0, 10)
                     .flatMap(e => e.tags.filter(t => t.length >= 3 && !/^(session-|low-|D\d)/.test(t)))
@@ -187,11 +192,19 @@ export class ActivationEngine {
         // Phase 0: Query expansion — add related terms to improve BM25 recall
         let searchContext = queryContext;
         if (useExpansion) {
+            let timer;
             try {
-                searchContext = await expandQuery(query.context);
+                searchContext = await Promise.race([
+                    expandQuery(query.context),
+                    new Promise((_, reject) => { timer = setTimeout(() => reject(new Error('expansion timeout')), 5000); }),
+                ]);
             }
             catch {
-                // Expansion unavailable — use original query
+                // Expansion unavailable or timed out — use original query
+            }
+            finally {
+                if (timer)
+                    clearTimeout(timer);
             }
         }
         // Phase 1: Embed query for vector similarity (uses coref-expanded context)
@@ -206,9 +219,9 @@ export class ActivationEngine {
         // Two-pass BM25: (1) keyword-stripped query for precision, (2) expanded query for recall.
         const keywordQuery = Array.from(tokenize(query.context)).join(' ');
         const bm25Keyword = keywordQuery.length > 2
-            ? this.store.searchBM25WithRank(query.agentId, keywordQuery, limit * 3)
+            ? this.store.searchBM25WithRankMultiAgent(agentIds, keywordQuery, limit * 3)
             : [];
-        const bm25Expanded = this.store.searchBM25WithRank(query.agentId, searchContext, limit * 3);
+        const bm25Expanded = this.store.searchBM25WithRankMultiAgent(agentIds, searchContext, limit * 3);
         // Merge: take the best BM25 score per engram from either pass
         const bm25ScoreMap = new Map();
         const bm25EngramMap = new Map();
@@ -222,7 +235,7 @@ export class ActivationEngine {
         const bm25Ranked = Array.from(bm25EngramMap.entries()).map(([id, engram]) => ({
             engram, bm25Score: bm25ScoreMap.get(id) ?? 0,
         }));
-        const allActive = this.store.getEngramsByAgent(query.agentId, query.includeStaging ? undefined : 'active', query.includeRetracted ?? false);
+        const allActive = this.store.getEngramsByAgents(agentIds, query.includeStaging ? undefined : 'active', query.includeRetracted ?? false);
         // Merge candidates (deduplicate)
         const candidateMap = new Map();
         for (const r of bm25Ranked)
@@ -354,7 +367,7 @@ export class ActivationEngine {
             // Take top 5 feedback terms and re-search
             const extraTerms = Array.from(feedbackTerms).slice(0, 5).join(' ');
             if (extraTerms) {
-                const feedbackBM25 = this.store.searchBM25WithRank(query.agentId, `${searchContext} ${extraTerms}`, limit * 2);
+                const feedbackBM25 = this.store.searchBM25WithRankMultiAgent(agentIds, `${searchContext} ${extraTerms}`, limit * 2);
                 for (const r of feedbackBM25) {
                     if (!candidateMap.has(r.engram.id)) {
                         candidateMap.set(r.engram.id, r.engram);
@@ -472,7 +485,12 @@ export class ActivationEngine {
         if (useReranker && rerankPool.length > 0) {
             try {
                 const passages = rerankPool.map(r => `${r.engram.concept}: ${r.engram.content}`);
-                const rerankResults = await rerank(query.context, passages);
+                let rerankTimer;
+                const rerankResults = await Promise.race([
+                    rerank(query.context, passages),
+                    new Promise((_, reject) => { rerankTimer = setTimeout(() => reject(new Error('reranker timeout')), 10000); }),
+                ]).finally(() => { if (rerankTimer)
+                    clearTimeout(rerankTimer); });
                 // Adaptive reranker blend (Codex recommendation):
                 // When BM25/text signals are strong, trust them more; when weak, lean on reranker.
                 const bm25Max = Math.max(...rerankPool.map(r => r.phaseScores.textMatch));
@@ -558,13 +576,24 @@ export class ActivationEngine {
             associations: r.associations,
         }));
         const activatedIds = results.map(r => r.engram.id);
-        // Side effects: touch, co-activate, Hebbian update (skip for internal/system calls)
+        // Side effects: touch, co-activate, defer Hebbian to validation gate (skip for internal/system calls)
         if (!query.internal) {
             for (const id of activatedIds) {
                 this.store.touchEngram(id);
             }
             this.coActivationBuffer.pushBatch(activatedIds);
-            this.updateHebbianWeights();
+            // Validation-gated Hebbian: defer strengthening until feedback arrives
+            const pairs = this.coActivationBuffer.getCoActivatedPairs(10_000);
+            const seen = new Set();
+            const uniquePairs = [];
+            for (const [a, b] of pairs) {
+                const key = a < b ? `${a}:${b}` : `${b}:${a}`;
+                if (!seen.has(key)) {
+                    seen.add(key);
+                    uniquePairs.push([a, b]);
+                }
+            }
+            this.validationGate.addPending(activatedIds, uniquePairs);
             // Log activation event for eval
             const latencyMs = performance.now() - startTime;
             this.store.logActivationEvent({
@@ -581,83 +610,130 @@ export class ActivationEngine {
         return results;
     }
     /**
-     * Beam search graph walk — replaces naive BFS.
-     * Scores paths (not just nodes), uses query-dependent edge filtering,
-     * and supports deeper exploration with focused beams.
+     * Multi-graph traversal (MAGMA-inspired).
+     *
+     * Instead of one beam search over all edge types, runs independent traversals
+     * per graph type with specialized scoring, then fuses the boosts.
+     *
+     * Four sub-graphs:
+     * - Semantic (connection + hebbian edges) → standard weight-based walk
+     * - Temporal (temporal edges) → recency-weighted (favor recent connections)
+     * - Causal (causal edges) → full weight walk (causal links are high-value)
+     * - Entity (bridge edges) → entity-tag-weighted walk
+     *
+     * Each sub-graph contributes independently to the final graph boost,
+     * weighted by configurable per-graph weights.
      */
+    static GRAPH_WEIGHTS = {
+        semantic: 0.40, // connection + hebbian
+        temporal: 0.20, // temporal edges
+        causal: 0.25, // causal edges (high-value signal)
+        entity: 0.15, // bridge edges
+    };
     graphWalk(scored, maxDepth, hopPenalty, beamWidth = 15) {
         const scoreMap = new Map(scored.map(s => [s.engram.id, s]));
         const MAX_TOTAL_BOOST = 0.25;
-        const BEAM_WIDTH = beamWidth;
-        // Seed the beam with high-scoring, text-relevant items
-        const beam = scored
-            .filter(item => item.phaseScores.textMatch >= 0.15)
-            .sort((a, b) => b.score - a.score)
-            .slice(0, BEAM_WIDTH);
-        // Track which engrams have been explored (avoid cycles)
-        const explored = new Set();
-        for (let depth = 0; depth < maxDepth; depth++) {
-            const nextBeam = [];
-            for (const item of beam) {
-                if (explored.has(item.engram.id))
-                    continue;
-                explored.add(item.engram.id);
-                // Get associations — for depth > 0, fetch from store if not in scored set
-                const associations = item.associations.length > 0
-                    ? item.associations
-                    : this.store.getAssociationsFor(item.engram.id);
-                for (const assoc of associations) {
-                    const neighborId = assoc.fromEngramId === item.engram.id
-                        ? assoc.toEngramId
-                        : assoc.fromEngramId;
-                    if (explored.has(neighborId))
-                        continue;
-                    const neighbor = scoreMap.get(neighborId);
-                    if (!neighbor)
-                        continue;
-                    // Query-dependent edge filtering: neighbor must have SOME relevance
-                    // (textMatch > 0.05 for deeper hops, relaxed from 0.1)
-                    const relevanceFloor = depth === 0 ? 0.1 : 0.05;
-                    if (neighbor.phaseScores.textMatch < relevanceFloor)
-                        continue;
-                    // Skip if neighbor already at boost cap
-                    if (neighbor.phaseScores.graphBoost >= MAX_TOTAL_BOOST)
+        // Define which edge types belong to each sub-graph
+        const graphTypes = {
+            semantic: ['connection', 'hebbian'],
+            temporal: ['temporal'],
+            causal: ['causal'],
+            entity: ['bridge'],
+        };
+        // Run independent traversals per sub-graph, accumulate boosts
+        const boostAccum = new Map(); // engramId → total boost
+        for (const [graphName, edgeTypes] of Object.entries(graphTypes)) {
+            const graphWeight = ActivationEngine.GRAPH_WEIGHTS[graphName];
+            const subBeamWidth = Math.max(3, Math.ceil(beamWidth * graphWeight));
+            // Seed beam
+            const beam = scored
+                .filter(item => item.phaseScores.textMatch >= 0.15)
+                .sort((a, b) => b.score - a.score)
+                .slice(0, subBeamWidth);
+            const explored = new Set();
+            for (let depth = 0; depth < maxDepth; depth++) {
+                const nextBeam = [];
+                for (const item of beam) {
+                    if (explored.has(item.engram.id))
                         continue;
-                    // Path score: source score * edge weight * hop penalty^(depth+1)
-                    const normalizedWeight = Math.min(assoc.weight, 5.0) / 5.0;
-                    const pathScore = item.score * normalizedWeight * Math.pow(hopPenalty, depth + 1);
-                    const boost = Math.min(pathScore, 0.15, MAX_TOTAL_BOOST - neighbor.phaseScores.graphBoost);
-                    if (boost > 0.001) {
-                        neighbor.score += boost;
-                        neighbor.phaseScores.graphBoost += boost;
-                        nextBeam.push(neighbor);
+                    explored.add(item.engram.id);
+                    const associations = item.associations.length > 0
+                        ? item.associations
+                        : this.store.getAssociationsFor(item.engram.id);
+                    // Filter to only edges of this sub-graph type
+                    const relevantEdges = associations.filter(a => edgeTypes.includes(a.type));
+                    for (const assoc of relevantEdges) {
+                        const neighborId = assoc.fromEngramId === item.engram.id
+                            ? assoc.toEngramId
+                            : assoc.fromEngramId;
+                        if (explored.has(neighborId))
+                            continue;
+                        const neighbor = scoreMap.get(neighborId);
+                        if (!neighbor)
+                            continue;
+                        const relevanceFloor = depth === 0 ? 0.1 : 0.05;
+                        if (neighbor.phaseScores.textMatch < relevanceFloor)
+                            continue;
+                        // Path score with graph-type-specific weighting
+                        const normalizedWeight = Math.min(assoc.weight, 5.0) / 5.0;
+                        let pathScore = item.score * normalizedWeight * Math.pow(hopPenalty, depth + 1);
+                        // Causal edges get a 2x boost — they represent verified reasoning chains
+                        if (graphName === 'causal')
+                            pathScore *= 2.0;
+                        // Weight by sub-graph importance
+                        const boost = Math.min(pathScore * graphWeight, 0.15);
+                        if (boost > 0.001) {
+                            boostAccum.set(neighborId, (boostAccum.get(neighborId) ?? 0) + boost);
+                            nextBeam.push(neighbor);
+                        }
                     }
                 }
+                if (nextBeam.length === 0)
+                    break;
+                beam.length = 0;
+                beam.push(...nextBeam
+                    .sort((a, b) => b.score - a.score)
+                    .slice(0, subBeamWidth));
+            }
+        }
+        // Apply fused boosts to scored items
+        for (const [engramId, totalBoost] of boostAccum) {
+            const item = scoreMap.get(engramId);
+            if (!item)
+                continue;
+            const capped = Math.min(totalBoost, MAX_TOTAL_BOOST - item.phaseScores.graphBoost);
+            if (capped > 0.001) {
+                item.score += capped;
+                item.phaseScores.graphBoost += capped;
             }
-            // Prune beam for next depth level
-            if (nextBeam.length === 0)
-                break;
-            beam.length = 0;
-            beam.push(...nextBeam
-                .sort((a, b) => b.score - a.score)
-                .slice(0, BEAM_WIDTH));
         }
     }
-    updateHebbianWeights() {
-        const pairs = this.coActivationBuffer.getCoActivatedPairs(10_000);
-        // Deduplicate pairs to prevent repeated strengthening
-        const seen = new Set();
+    /**
+     * Resolve validation-gated Hebbian update for a specific engram.
+     * Called by memory_feedback — only strengthens when retrieval was useful.
+     * This prevents hub toxicity from noisy co-retrieval (Kairos-inspired).
+     */
+    resolveHebbianFeedback(engramId, useful) {
+        const { pairs, signal } = this.validationGate.resolveFeedback(engramId, useful);
+        let updated = 0;
         for (const [a, b] of pairs) {
-            const key = a < b ? `${a}:${b}` : `${b}:${a}`;
-            if (seen.has(key))
-                continue;
-            seen.add(key);
             const existing = this.store.getAssociation(a, b) ?? this.store.getAssociation(b, a);
             const currentWeight = existing?.weight ?? 0.1;
-            const newWeight = strengthenAssociation(currentWeight);
-            this.store.upsertAssociation(a, b, newWeight, 'hebbian');
-            this.store.upsertAssociation(b, a, newWeight, 'hebbian');
+            if (signal > 0) {
+                // Positive feedback → strengthen
+                const newWeight = strengthenAssociation(currentWeight, signal);
+                this.store.upsertAssociation(a, b, newWeight, 'hebbian');
+                this.store.upsertAssociation(b, a, newWeight, 'hebbian');
+            }
+            else {
+                // Negative feedback → slight weakening (decay by signal magnitude)
+                const newWeight = Math.max(0.001, currentWeight * (1 + signal)); // signal is -0.3
+                this.store.upsertAssociation(a, b, newWeight, 'hebbian');
+                this.store.upsertAssociation(b, a, newWeight, 'hebbian');
+            }
+            updated++;
         }
+        return updated;
     }
     explain(phases, engram, associations) {
         const parts = [];