@massa-ai/core 1.2.1

package/dist/services/synapse/plasticity/compress.d.ts

@@ -0,0 +1,64 @@
+/**
+ * Compress — selective compression of mid-importance, aging memories.
+ *
+ * Pure orchestration. The LLM call itself is injected as a callback so this
+ * module has zero IO dependencies and is easy to unit-test. Marked experimental:
+ * default `enabled: false` in config.
+ *
+ * Algorithm:
+ *   1. Filter candidates by importance band and age (memories worth keeping
+ *      but not worth storing in full).
+ *   2. Call `summarize` (callback) to produce a condensed string. The caller
+ *      can plug in any LLM provider (Ollama, OpenAI, etc.).
+ *   3. Return a CompressUpdate per memory describing the payload that the
+ *      caller should persist (originalHash, parentId, new content, etc.).
+ *
+ * Compression preserves the original via parentId, so it is reversible at
+ * the data layer. Synapse itself never mutates the DB.
+ */
+export interface CompressionCandidate {
+    id: string;
+    content: string;
+    importance: number;
+    /** ms since epoch */
+    createdAt: number;
+}
+export interface CompressConfig {
+    enabled: boolean;
+    /** Min importance for a candidate to be considered (must exceed). */
+    minImportance: number;
+    /** Max importance — strongest memories are left intact. */
+    maxImportance: number;
+    /** Min age in ms for compression to apply. */
+    minAgeMs: number;
+    /** Skip candidates whose content is already short. */
+    minContentLength: number;
+    /** Batch limit per cycle to avoid hot-pathing the LLM. */
+    maxBatchSize: number;
+}
+export interface CompressUpdate {
+    id: string;
+    newContent: string;
+    parentId: string;
+    originalHash: string;
+    /** Token reduction estimate (chars proxy if no tokenizer available). */
+    charsBefore: number;
+    charsAfter: number;
+}
+export type SummarizeFn = (input: {
+    id: string;
+    content: string;
+}) => Promise<string>;
+/**
+ * Filter candidates that match the compression criteria. Pure, no IO.
+ */
+export declare function selectCompressionCandidates(memories: CompressionCandidate[], config: CompressConfig, now?: number): CompressionCandidate[];
+/**
+ * Compress a batch using the provided summarize callback. Returns the
+ * updates that should be persisted by the caller. Summaries shorter than
+ * 50% of the original are kept as a basic quality gate; longer summaries
+ * are dropped because they would not produce token savings.
+ */
+export declare function compressBatch(candidates: CompressionCandidate[], summarize: SummarizeFn, config: CompressConfig): Promise<CompressUpdate[]>;
+export declare const DEFAULT_COMPRESS_CONFIG: CompressConfig;
+//# sourceMappingURL=compress.d.ts.map

package/dist/services/synapse/plasticity/compress.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"compress.d.ts","sourceRoot":"","sources":["../../../../src/services/synapse/plasticity/compress.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAEH,MAAM,WAAW,oBAAoB;IACnC,EAAE,EAAE,MAAM,CAAC;IACX,OAAO,EAAE,MAAM,CAAC;IAChB,UAAU,EAAE,MAAM,CAAC;IACnB,qBAAqB;IACrB,SAAS,EAAE,MAAM,CAAC;CACnB;AAED,MAAM,WAAW,cAAc;IAC7B,OAAO,EAAE,OAAO,CAAC;IACjB,qEAAqE;IACrE,aAAa,EAAE,MAAM,CAAC;IACtB,2DAA2D;IAC3D,aAAa,EAAE,MAAM,CAAC;IACtB,8CAA8C;IAC9C,QAAQ,EAAE,MAAM,CAAC;IACjB,sDAAsD;IACtD,gBAAgB,EAAE,MAAM,CAAC;IACzB,0DAA0D;IAC1D,YAAY,EAAE,MAAM,CAAC;CACtB;AAED,MAAM,WAAW,cAAc;IAC7B,EAAE,EAAE,MAAM,CAAC;IACX,UAAU,EAAE,MAAM,CAAC;IACnB,QAAQ,EAAE,MAAM,CAAC;IACjB,YAAY,EAAE,MAAM,CAAC;IACrB,wEAAwE;IACxE,WAAW,EAAE,MAAM,CAAC;IACpB,UAAU,EAAE,MAAM,CAAC;CACpB;AAED,MAAM,MAAM,WAAW,GAAG,CAAC,KAAK,EAAE;IAChC,EAAE,EAAE,MAAM,CAAC;IACX,OAAO,EAAE,MAAM,CAAC;CACjB,KAAK,OAAO,CAAC,MAAM,CAAC,CAAC;AAWtB;;GAEG;AACH,wBAAgB,2BAA2B,CACzC,QAAQ,EAAE,oBAAoB,EAAE,EAChC,MAAM,EAAE,cAAc,EACtB,GAAG,GAAE,MAAmB,GACvB,oBAAoB,EAAE,CAWxB;AAED;;;;;GAKG;AACH,wBAAsB,aAAa,CACjC,UAAU,EAAE,oBAAoB,EAAE,EAClC,SAAS,EAAE,WAAW,EACtB,MAAM,EAAE,cAAc,GACrB,OAAO,CAAC,cAAc,EAAE,CAAC,CAyB3B;AAED,eAAO,MAAM,uBAAuB,EAAE,cAOrC,CAAC"}

package/dist/services/synapse/plasticity/compress.js

@@ -0,0 +1,82 @@
+/**
+ * Compress — selective compression of mid-importance, aging memories.
+ *
+ * Pure orchestration. The LLM call itself is injected as a callback so this
+ * module has zero IO dependencies and is easy to unit-test. Marked experimental:
+ * default `enabled: false` in config.
+ *
+ * Algorithm:
+ *   1. Filter candidates by importance band and age (memories worth keeping
+ *      but not worth storing in full).
+ *   2. Call `summarize` (callback) to produce a condensed string. The caller
+ *      can plug in any LLM provider (Ollama, OpenAI, etc.).
+ *   3. Return a CompressUpdate per memory describing the payload that the
+ *      caller should persist (originalHash, parentId, new content, etc.).
+ *
+ * Compression preserves the original via parentId, so it is reversible at
+ * the data layer. Synapse itself never mutates the DB.
+ */
+function fnv1a(input) {
+    let h = 0x811c9dc5;
+    for (let i = 0; i < input.length; i++) {
+        h ^= input.charCodeAt(i);
+        h = (h + ((h << 1) + (h << 4) + (h << 7) + (h << 8) + (h << 24))) >>> 0;
+    }
+    return h.toString(16);
+}
+/**
+ * Filter candidates that match the compression criteria. Pure, no IO.
+ */
+export function selectCompressionCandidates(memories, config, now = Date.now()) {
+    if (!config.enabled)
+        return [];
+    return memories
+        .filter((m) => m.importance > config.minImportance &&
+        m.importance < config.maxImportance &&
+        now - m.createdAt >= config.minAgeMs &&
+        m.content.length >= config.minContentLength)
+        .slice(0, config.maxBatchSize);
+}
+/**
+ * Compress a batch using the provided summarize callback. Returns the
+ * updates that should be persisted by the caller. Summaries shorter than
+ * 50% of the original are kept as a basic quality gate; longer summaries
+ * are dropped because they would not produce token savings.
+ */
+export async function compressBatch(candidates, summarize, config) {
+    if (!config.enabled || candidates.length === 0)
+        return [];
+    const updates = [];
+    for (const c of candidates) {
+        try {
+            const newContent = await summarize({ id: c.id, content: c.content });
+            if (!newContent || newContent.length === 0)
+                continue;
+            if (newContent.length >= c.content.length * 0.5)
+                continue; // quality gate
+            updates.push({
+                id: c.id,
+                newContent,
+                parentId: c.id,
+                originalHash: fnv1a(c.content),
+                charsBefore: c.content.length,
+                charsAfter: newContent.length,
+            });
+        }
+        catch {
+            // Skip individual failures; never let a single summarize call abort
+            // the rest of the batch.
+            continue;
+        }
+    }
+    return updates;
+}
+export const DEFAULT_COMPRESS_CONFIG = {
+    enabled: false, // experimental — opt-in
+    minImportance: 0.3,
+    maxImportance: 0.5,
+    minAgeMs: 14 * 24 * 60 * 60 * 1000, // 14 days
+    minContentLength: 200,
+    maxBatchSize: 50,
+};
+//# sourceMappingURL=compress.js.map

package/dist/services/synapse/plasticity/compress.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"compress.js","sourceRoot":"","sources":["../../../../src/services/synapse/plasticity/compress.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAuCH,SAAS,KAAK,CAAC,KAAa;IAC1B,IAAI,CAAC,GAAG,UAAU,CAAC;IACnB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,CAAC,IAAI,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QACzB,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;IAC1E,CAAC;IACD,OAAO,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;AACxB,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,2BAA2B,CACzC,QAAgC,EAChC,MAAsB,EACtB,MAAc,IAAI,CAAC,GAAG,EAAE;IAExB,IAAI,CAAC,MAAM,CAAC,OAAO;QAAE,OAAO,EAAE,CAAC;IAC/B,OAAO,QAAQ;SACZ,MAAM,CACL,CAAC,CAAC,EAAE,EAAE,CACJ,CAAC,CAAC,UAAU,GAAG,MAAM,CAAC,aAAa;QACnC,CAAC,CAAC,UAAU,GAAG,MAAM,CAAC,aAAa;QACnC,GAAG,GAAG,CAAC,CAAC,SAAS,IAAI,MAAM,CAAC,QAAQ;QACpC,CAAC,CAAC,OAAO,CAAC,MAAM,IAAI,MAAM,CAAC,gBAAgB,CAC9C;SACA,KAAK,CAAC,CAAC,EAAE,MAAM,CAAC,YAAY,CAAC,CAAC;AACnC,CAAC;AAED;;;;;GAKG;AACH,MAAM,CAAC,KAAK,UAAU,aAAa,CACjC,UAAkC,EAClC,SAAsB,EACtB,MAAsB;IAEtB,IAAI,CAAC,MAAM,CAAC,OAAO,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAC1D,MAAM,OAAO,GAAqB,EAAE,CAAC;IAErC,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;QAC3B,IAAI,CAAC;YACH,MAAM,UAAU,GAAG,MAAM,SAAS,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,OAAO,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC;YACrE,IAAI,CAAC,UAAU,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC;gBAAE,SAAS;YACrD,IAAI,UAAU,CAAC,MAAM,IAAI,CAAC,CAAC,OAAO,CAAC,MAAM,GAAG,GAAG;gBAAE,SAAS,CAAC,eAAe;YAC1E,OAAO,CAAC,IAAI,CAAC;gBACX,EAAE,EAAE,CAAC,CAAC,EAAE;gBACR,UAAU;gBACV,QAAQ,EAAE,CAAC,CAAC,EAAE;gBACd,YAAY,EAAE,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC;gBAC9B,WAAW,EAAE,CAAC,CAAC,OAAO,CAAC,MAAM;gBAC7B,UAAU,EAAE,UAAU,CAAC,MAAM;aAC9B,CAAC,CAAC;QACL,CAAC;QAAC,MAAM,CAAC;YACP,oEAAoE;YACpE,yBAAyB;YACzB,SAAS;QACX,CAAC;IACH,CAAC;IAED,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,MAAM,CAAC,MAAM,uBAAuB,GAAmB;IACrD,OAAO,EAAE,KAAK,EAAE,wBAAwB;IACxC,aAAa,EAAE,GAAG;IAClB,aAAa,EAAE,GAAG;IAClB,QAAQ,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI,EAAE,UAAU;IAC9C,gBAAgB,EAAE,GAAG;IACrB,YAAY,EAAE,EAAE;CACjB,CAAC"}

package/dist/services/synapse/plasticity/embedding-evolution.d.ts

@@ -0,0 +1,42 @@
+/**
+ * Embedding Evolution — synaptic plasticity for retrieval space.
+ *
+ * Pure math. Given an original embedding and a small set of recent query
+ * embeddings that produced this memory, returns a blended embedding that
+ * "migrates" the memory toward the semantic space where it is actually
+ * being looked up.
+ *
+ * Quality guard: if the centroid of recent queries diverges too far from
+ * the original embedding (cosine < drift threshold), the blend is skipped
+ * to avoid destabilizing memories that get used in genuinely different
+ * contexts. The caller decides what to do in that case (split, tag, etc.).
+ *
+ * Default `enabled: false` — experimental.
+ */
+export interface EmbeddingEvolutionConfig {
+    enabled: boolean;
+    /** Minimum query embeddings required to compute a blend. */
+    minSamples: number;
+    /** Blend weight on the original embedding. */
+    originalWeight: number;
+    /** Blend weight on the centroid of recent queries. */
+    centroidWeight: number;
+    /** Skip the update if cosine(original, centroid) is below this. */
+    driftThreshold: number;
+}
+export interface EvolutionInput {
+    id: string;
+    original: number[] | Float32Array;
+    queryEmbeddings: Array<number[] | Float32Array>;
+}
+export interface EvolutionUpdate {
+    id: string;
+    blended: number[];
+    driftCosine: number;
+}
+/**
+ * Compute blended embeddings for a batch. Caller persists them.
+ */
+export declare function evolveEmbeddings(inputs: EvolutionInput[], config: EmbeddingEvolutionConfig): EvolutionUpdate[];
+export declare const DEFAULT_EMBEDDING_EVOLUTION_CONFIG: EmbeddingEvolutionConfig;
+//# sourceMappingURL=embedding-evolution.d.ts.map

package/dist/services/synapse/plasticity/embedding-evolution.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"embedding-evolution.d.ts","sourceRoot":"","sources":["../../../../src/services/synapse/plasticity/embedding-evolution.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAEH,MAAM,WAAW,wBAAwB;IACvC,OAAO,EAAE,OAAO,CAAC;IACjB,4DAA4D;IAC5D,UAAU,EAAE,MAAM,CAAC;IACnB,8CAA8C;IAC9C,cAAc,EAAE,MAAM,CAAC;IACvB,sDAAsD;IACtD,cAAc,EAAE,MAAM,CAAC;IACvB,mEAAmE;IACnE,cAAc,EAAE,MAAM,CAAC;CACxB;AAED,MAAM,WAAW,cAAc;IAC7B,EAAE,EAAE,MAAM,CAAC;IACX,QAAQ,EAAE,MAAM,EAAE,GAAG,YAAY,CAAC;IAClC,eAAe,EAAE,KAAK,CAAC,MAAM,EAAE,GAAG,YAAY,CAAC,CAAC;CACjD;AAED,MAAM,WAAW,eAAe;IAC9B,EAAE,EAAE,MAAM,CAAC;IACX,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,WAAW,EAAE,MAAM,CAAC;CACrB;AAyCD;;GAEG;AACH,wBAAgB,gBAAgB,CAC9B,MAAM,EAAE,cAAc,EAAE,EACxB,MAAM,EAAE,wBAAwB,GAC/B,eAAe,EAAE,CAsBnB;AAED,eAAO,MAAM,kCAAkC,EAAE,wBAMhD,CAAC"}

package/dist/services/synapse/plasticity/embedding-evolution.js

@@ -0,0 +1,81 @@
+/**
+ * Embedding Evolution — synaptic plasticity for retrieval space.
+ *
+ * Pure math. Given an original embedding and a small set of recent query
+ * embeddings that produced this memory, returns a blended embedding that
+ * "migrates" the memory toward the semantic space where it is actually
+ * being looked up.
+ *
+ * Quality guard: if the centroid of recent queries diverges too far from
+ * the original embedding (cosine < drift threshold), the blend is skipped
+ * to avoid destabilizing memories that get used in genuinely different
+ * contexts. The caller decides what to do in that case (split, tag, etc.).
+ *
+ * Default `enabled: false` — experimental.
+ */
+function cosine(a, b) {
+    if (a.length !== b.length)
+        return 0;
+    let dot = 0;
+    let na = 0;
+    let nb = 0;
+    for (let i = 0; i < a.length; i++) {
+        const av = a[i];
+        const bv = b[i];
+        dot += av * bv;
+        na += av * av;
+        nb += bv * bv;
+    }
+    if (na === 0 || nb === 0)
+        return 0;
+    return dot / (Math.sqrt(na) * Math.sqrt(nb));
+}
+function centroidOf(vectors) {
+    if (vectors.length === 0)
+        return [];
+    const dim = vectors[0].length;
+    const out = new Array(dim).fill(0);
+    for (const v of vectors) {
+        for (let i = 0; i < dim; i++)
+            out[i] += v[i];
+    }
+    for (let i = 0; i < dim; i++)
+        out[i] /= vectors.length;
+    return out;
+}
+function blend(a, b, wa, wb) {
+    const dim = a.length;
+    const out = new Array(dim);
+    for (let i = 0; i < dim; i++)
+        out[i] = wa * a[i] + wb * b[i];
+    return out;
+}
+/**
+ * Compute blended embeddings for a batch. Caller persists them.
+ */
+export function evolveEmbeddings(inputs, config) {
+    if (!config.enabled || inputs.length === 0)
+        return [];
+    const updates = [];
+    for (const input of inputs) {
+        if (input.queryEmbeddings.length < config.minSamples)
+            continue;
+        if (input.queryEmbeddings.some((q) => q.length !== input.original.length))
+            continue;
+        const centroid = centroidOf(input.queryEmbeddings);
+        const drift = cosine(input.original, centroid);
+        if (drift < config.driftThreshold)
+            continue;
+        const blended = blend(input.original, centroid, config.originalWeight, config.centroidWeight);
+        updates.push({ id: input.id, blended, driftCosine: drift });
+    }
+    return updates;
+}
+export const DEFAULT_EMBEDDING_EVOLUTION_CONFIG = {
+    enabled: false, // experimental — opt-in
+    minSamples: 5,
+    originalWeight: 0.7,
+    centroidWeight: 0.3,
+    driftThreshold: 0.5,
+};
+//# sourceMappingURL=embedding-evolution.js.map

package/dist/services/synapse/plasticity/embedding-evolution.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"embedding-evolution.js","sourceRoot":"","sources":["../../../../src/services/synapse/plasticity/embedding-evolution.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AA0BH,SAAS,MAAM,CAAC,CAA0B,EAAE,CAA0B;IACpE,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM;QAAE,OAAO,CAAC,CAAC;IACpC,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAClC,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAChB,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAChB,GAAG,IAAI,EAAE,GAAG,EAAE,CAAC;QACf,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC;QACd,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC;IAChB,CAAC;IACD,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IACnC,OAAO,GAAG,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;AAC/C,CAAC;AAED,SAAS,UAAU,CAAC,OAAuC;IACzD,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IACpC,MAAM,GAAG,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;IAC9B,MAAM,GAAG,GAAG,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACnC,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE;YAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/C,CAAC;IACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE;QAAE,GAAG,CAAC,CAAC,CAAC,IAAI,OAAO,CAAC,MAAM,CAAC;IACvD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAS,KAAK,CACZ,CAA0B,EAC1B,CAA0B,EAC1B,EAAU,EACV,EAAU;IAEV,MAAM,GAAG,GAAG,CAAC,CAAC,MAAM,CAAC;IACrB,MAAM,GAAG,GAAG,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC;IAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE;QAAE,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7D,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,gBAAgB,CAC9B,MAAwB,EACxB,MAAgC;IAEhC,IAAI,CAAC,MAAM,CAAC,OAAO,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IACtD,MAAM,OAAO,GAAsB,EAAE,CAAC;IAEtC,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,IAAI,KAAK,CAAC,eAAe,CAAC,MAAM,GAAG,MAAM,CAAC,UAAU;YAAE,SAAS;QAC/D,IAAI,KAAK,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC;YAAE,SAAS;QAEpF,MAAM,QAAQ,GAAG,UAAU,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC;QACnD,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;QAC/C,IAAI,KAAK,GAAG,MAAM,CAAC,cAAc;YAAE,SAAS;QAE5C,MAAM,OAAO,GAAG,KAAK,CACnB,KAAK,CAAC,QAAQ,EACd,QAAQ,EACR,MAAM,CAAC,cAAc,EACrB,MAAM,CAAC,cAAc,CACtB,CAAC;QACF,OAAO,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,KAAK,CAAC,EAAE,EAAE,OAAO,EAAE,WAAW,EAAE,KAAK,EAAE,CAAC,CAAC;IAC9D,CAAC;IAED,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,MAAM,CAAC,MAAM,kCAAkC,GAA6B;IAC1E,OAAO,EAAE,KAAK,EAAE,wBAAwB;IACxC,UAAU,EAAE,CAAC;IACb,cAAc,EAAE,GAAG;IACnB,cAAc,EAAE,GAAG;IACnB,cAAc,EAAE,GAAG;CACpB,CAAC"}

package/dist/services/synapse/plasticity/index.d.ts

@@ -0,0 +1,4 @@
+export { computeStrengthenUpdates, DEFAULT_STRENGTHEN_CONFIG, type StrengthenConfig, type StrengthenUpdate, type MemoryUsageStats, } from "./strengthen.js";
+export { selectCompressionCandidates, compressBatch, DEFAULT_COMPRESS_CONFIG, type CompressConfig, type CompressUpdate, type CompressionCandidate, type SummarizeFn, } from "./compress.js";
+export { evolveEmbeddings, DEFAULT_EMBEDDING_EVOLUTION_CONFIG, type EmbeddingEvolutionConfig, type EvolutionInput, type EvolutionUpdate, } from "./embedding-evolution.js";
+//# sourceMappingURL=index.d.ts.map

package/dist/services/synapse/plasticity/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../src/services/synapse/plasticity/index.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,wBAAwB,EACxB,yBAAyB,EACzB,KAAK,gBAAgB,EACrB,KAAK,gBAAgB,EACrB,KAAK,gBAAgB,GACtB,MAAM,iBAAiB,CAAC;AAEzB,OAAO,EACL,2BAA2B,EAC3B,aAAa,EACb,uBAAuB,EACvB,KAAK,cAAc,EACnB,KAAK,cAAc,EACnB,KAAK,oBAAoB,EACzB,KAAK,WAAW,GACjB,MAAM,eAAe,CAAC;AAEvB,OAAO,EACL,gBAAgB,EAChB,kCAAkC,EAClC,KAAK,wBAAwB,EAC7B,KAAK,cAAc,EACnB,KAAK,eAAe,GACrB,MAAM,0BAA0B,CAAC"}

package/dist/services/synapse/plasticity/index.js

@@ -0,0 +1,4 @@
+export { computeStrengthenUpdates, DEFAULT_STRENGTHEN_CONFIG, } from "./strengthen.js";
+export { selectCompressionCandidates, compressBatch, DEFAULT_COMPRESS_CONFIG, } from "./compress.js";
+export { evolveEmbeddings, DEFAULT_EMBEDDING_EVOLUTION_CONFIG, } from "./embedding-evolution.js";
+//# sourceMappingURL=index.js.map

package/dist/services/synapse/plasticity/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../src/services/synapse/plasticity/index.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,wBAAwB,EACxB,yBAAyB,GAI1B,MAAM,iBAAiB,CAAC;AAEzB,OAAO,EACL,2BAA2B,EAC3B,aAAa,EACb,uBAAuB,GAKxB,MAAM,eAAe,CAAC;AAEvB,OAAO,EACL,gBAAgB,EAChB,kCAAkC,GAInC,MAAM,0BAA0B,CAAC"}

package/dist/services/synapse/plasticity/strengthen.d.ts

@@ -0,0 +1,45 @@
+/**
+ * Strengthen — neuroplasticity for memory importance.
+ *
+ * Pure analysis function. Computes the *delta* that should be added to a
+ * memory's importance based on usage signals over a window. The caller
+ * (typically MemoryConsolidationJob) applies the deltas via the DB layer;
+ * Synapse never writes directly.
+ *
+ * Signals (configurable):
+ *   - frequentAccessBoost: bonus when access_count in the last window ≥ threshold
+ *   - graphEdgeBoost:      bonus per edge above an edge-count threshold
+ *   - referencedByDecision: bonus when this memory is referenced by a decision
+ *
+ * Cap: per-cycle delta is clamped to `maxDelta` to prevent runaway inflation
+ * from automated query loops.
+ */
+export interface MemoryUsageStats {
+    id: string;
+    importance: number;
+    accessCount: number;
+    /** Access count over the last evaluation window (e.g., 24h). */
+    recentAccessCount: number;
+    /** Number of outgoing MemoryEdges from this memory. */
+    edgeCount: number;
+    /** True if any decision-type memory references this one. */
+    referencedByDecision?: boolean;
+}
+export interface StrengthenConfig {
+    enabled: boolean;
+    recentAccessThreshold: number;
+    frequentAccessBoost: number;
+    edgeCountThreshold: number;
+    graphEdgeBoost: number;
+    decisionReferenceBoost: number;
+    maxDelta: number;
+    importanceCap: number;
+}
+export interface StrengthenUpdate {
+    id: string;
+    delta: number;
+    newImportance: number;
+}
+export declare function computeStrengthenUpdates(stats: MemoryUsageStats[], config: StrengthenConfig): StrengthenUpdate[];
+export declare const DEFAULT_STRENGTHEN_CONFIG: StrengthenConfig;
+//# sourceMappingURL=strengthen.d.ts.map

package/dist/services/synapse/plasticity/strengthen.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"strengthen.d.ts","sourceRoot":"","sources":["../../../../src/services/synapse/plasticity/strengthen.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAEH,MAAM,WAAW,gBAAgB;IAC/B,EAAE,EAAE,MAAM,CAAC;IACX,UAAU,EAAE,MAAM,CAAC;IACnB,WAAW,EAAE,MAAM,CAAC;IACpB,gEAAgE;IAChE,iBAAiB,EAAE,MAAM,CAAC;IAC1B,uDAAuD;IACvD,SAAS,EAAE,MAAM,CAAC;IAClB,4DAA4D;IAC5D,oBAAoB,CAAC,EAAE,OAAO,CAAC;CAChC;AAED,MAAM,WAAW,gBAAgB;IAC/B,OAAO,EAAE,OAAO,CAAC;IACjB,qBAAqB,EAAE,MAAM,CAAC;IAC9B,mBAAmB,EAAE,MAAM,CAAC;IAC5B,kBAAkB,EAAE,MAAM,CAAC;IAC3B,cAAc,EAAE,MAAM,CAAC;IACvB,sBAAsB,EAAE,MAAM,CAAC;IAC/B,QAAQ,EAAE,MAAM,CAAC;IACjB,aAAa,EAAE,MAAM,CAAC;CACvB;AAED,MAAM,WAAW,gBAAgB;IAC/B,EAAE,EAAE,MAAM,CAAC;IACX,KAAK,EAAE,MAAM,CAAC;IACd,aAAa,EAAE,MAAM,CAAC;CACvB;AAqBD,wBAAgB,wBAAwB,CACtC,KAAK,EAAE,gBAAgB,EAAE,EACzB,MAAM,EAAE,gBAAgB,GACvB,gBAAgB,EAAE,CA2BpB;AAED,eAAO,MAAM,yBAAyB,EAAE,gBASvC,CAAC"}

package/dist/services/synapse/plasticity/strengthen.js

@@ -0,0 +1,69 @@
+/**
+ * Strengthen — neuroplasticity for memory importance.
+ *
+ * Pure analysis function. Computes the *delta* that should be added to a
+ * memory's importance based on usage signals over a window. The caller
+ * (typically MemoryConsolidationJob) applies the deltas via the DB layer;
+ * Synapse never writes directly.
+ *
+ * Signals (configurable):
+ *   - frequentAccessBoost: bonus when access_count in the last window ≥ threshold
+ *   - graphEdgeBoost:      bonus per edge above an edge-count threshold
+ *   - referencedByDecision: bonus when this memory is referenced by a decision
+ *
+ * Cap: per-cycle delta is clamped to `maxDelta` to prevent runaway inflation
+ * from automated query loops.
+ */
+/**
+ * Smooth sigmoid-style ramp instead of a binary threshold.
+ *
+ * IMP-13: the old behavior was a cliff — recentAccessCount=2 gave 0 boost,
+ * 3 gave the full boost. That creates artificial discontinuities where one
+ * extra access tips a memory over the line. The ramp returns 0 below 50%
+ * of the threshold, smoothly grows to `boost` at the threshold, and
+ * saturates softly above (diminishing returns up to 1.5× boost).
+ */
+function rampedBoost(value, threshold, boost) {
+    if (threshold <= 0 || value <= 0)
+        return 0;
+    const ratio = value / threshold;
+    if (ratio < 0.5)
+        return 0;
+    if (ratio <= 1)
+        return boost * (ratio - 0.5) * 2; // linear 0..boost
+    // Saturating: diminishing returns above threshold, capped at 1.5× boost.
+    const over = Math.min(ratio - 1, 1);
+    return boost * (1 + 0.5 * over);
+}
+export function computeStrengthenUpdates(stats, config) {
+    if (!config.enabled || stats.length === 0)
+        return [];
+    const updates = [];
+    for (const s of stats) {
+        let delta = 0;
+        delta += rampedBoost(s.recentAccessCount, config.recentAccessThreshold, config.frequentAccessBoost);
+        delta += rampedBoost(s.edgeCount, config.edgeCountThreshold, config.graphEdgeBoost);
+        if (s.referencedByDecision) {
+            delta += config.decisionReferenceBoost;
+        }
+        if (delta <= 0)
+            continue;
+        const capped = Math.min(delta, config.maxDelta);
+        const newImportance = Math.min(config.importanceCap, s.importance + capped);
+        if (newImportance > s.importance) {
+            updates.push({ id: s.id, delta: newImportance - s.importance, newImportance });
+        }
+    }
+    return updates;
+}
+export const DEFAULT_STRENGTHEN_CONFIG = {
+    enabled: true,
+    recentAccessThreshold: 3,
+    frequentAccessBoost: 0.05,
+    edgeCountThreshold: 3,
+    graphEdgeBoost: 0.03,
+    decisionReferenceBoost: 0.08,
+    maxDelta: 0.1,
+    importanceCap: 1.0,
+};
+//# sourceMappingURL=strengthen.js.map

package/dist/services/synapse/plasticity/strengthen.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"strengthen.js","sourceRoot":"","sources":["../../../../src/services/synapse/plasticity/strengthen.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AA+BH;;;;;;;;GAQG;AACH,SAAS,WAAW,CAAC,KAAa,EAAE,SAAiB,EAAE,KAAa;IAClE,IAAI,SAAS,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC;QAAE,OAAO,CAAC,CAAC;IAC3C,MAAM,KAAK,GAAG,KAAK,GAAG,SAAS,CAAC;IAChC,IAAI,KAAK,GAAG,GAAG;QAAE,OAAO,CAAC,CAAC;IAC1B,IAAI,KAAK,IAAI,CAAC;QAAE,OAAO,KAAK,GAAG,CAAC,KAAK,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,kBAAkB;IACpE,yEAAyE;IACzE,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;IACpC,OAAO,KAAK,GAAG,CAAC,CAAC,GAAG,GAAG,GAAG,IAAI,CAAC,CAAC;AAClC,CAAC;AAED,MAAM,UAAU,wBAAwB,CACtC,KAAyB,EACzB,MAAwB;IAExB,IAAI,CAAC,MAAM,CAAC,OAAO,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IACrD,MAAM,OAAO,GAAuB,EAAE,CAAC;IAEvC,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,IAAI,WAAW,CAClB,CAAC,CAAC,iBAAiB,EACnB,MAAM,CAAC,qBAAqB,EAC5B,MAAM,CAAC,mBAAmB,CAC3B,CAAC;QACF,KAAK,IAAI,WAAW,CAClB,CAAC,CAAC,SAAS,EACX,MAAM,CAAC,kBAAkB,EACzB,MAAM,CAAC,cAAc,CACtB,CAAC;QACF,IAAI,CAAC,CAAC,oBAAoB,EAAE,CAAC;YAC3B,KAAK,IAAI,MAAM,CAAC,sBAAsB,CAAC;QACzC,CAAC;QACD,IAAI,KAAK,IAAI,CAAC;YAAE,SAAS;QACzB,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,MAAM,CAAC,QAAQ,CAAC,CAAC;QAChD,MAAM,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,aAAa,EAAE,CAAC,CAAC,UAAU,GAAG,MAAM,CAAC,CAAC;QAC5E,IAAI,aAAa,GAAG,CAAC,CAAC,UAAU,EAAE,CAAC;YACjC,OAAO,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,KAAK,EAAE,aAAa,GAAG,CAAC,CAAC,UAAU,EAAE,aAAa,EAAE,CAAC,CAAC;QACjF,CAAC;IACH,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,MAAM,CAAC,MAAM,yBAAyB,GAAqB;IACzD,OAAO,EAAE,IAAI;IACb,qBAAqB,EAAE,CAAC;IACxB,mBAAmB,EAAE,IAAI;IACzB,kBAAkB,EAAE,CAAC;IACrB,cAAc,EAAE,IAAI;IACpB,sBAAsB,EAAE,IAAI;IAC5B,QAAQ,EAAE,GAAG;IACb,aAAa,EAAE,GAAG;CACnB,CAAC"}

package/dist/services/synapse/prefetch/index.d.ts

@@ -0,0 +1,2 @@
+export { buildPrefetchPlan, executePrefetch, extractTopics, DEFAULT_PREFETCH_CONFIG, type PrefetchConfig, type PrefetchInput, type PrefetchPlan, type PrefetchEntry, } from "./prefetch.js";
+//# sourceMappingURL=index.d.ts.map

package/dist/services/synapse/prefetch/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../src/services/synapse/prefetch/index.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,iBAAiB,EACjB,eAAe,EACf,aAAa,EACb,uBAAuB,EACvB,KAAK,cAAc,EACnB,KAAK,aAAa,EAClB,KAAK,YAAY,EACjB,KAAK,aAAa,GACnB,MAAM,eAAe,CAAC"}

package/dist/services/synapse/prefetch/index.js

@@ -0,0 +1,2 @@
+export { buildPrefetchPlan, executePrefetch, extractTopics, DEFAULT_PREFETCH_CONFIG, } from "./prefetch.js";
+//# sourceMappingURL=index.js.map

package/dist/services/synapse/prefetch/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../src/services/synapse/prefetch/index.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,iBAAiB,EACjB,eAAe,EACf,aAAa,EACb,uBAAuB,GAKxB,MAAM,eAAe,CAAC"}

package/dist/services/synapse/prefetch/prefetch.d.ts

@@ -0,0 +1,75 @@
+/**
+ * Predictive Prefetch — anticipatory attention.
+ *
+ * Helpers for warming a session's working-memory buffer before the agent
+ * asks. Strategy is intentionally simple here so the consumer (a tool
+ * handler, an IDE plugin) controls scheduling and the actual DB calls:
+ *
+ *   1. extractTopics(filePath, symbols)
+ *        Builds a topic phrase from a file path and (optionally) its symbol
+ *        definitions. The phrase is used as a search query for related
+ *        memories.
+ *
+ *   2. buildPrefetchPlan(input, config)
+ *        Decides what to fetch (chains, minImportance, maxResults). The
+ *        consumer executes the search and primes the buffer with whatever
+ *        is returned.
+ *
+ * Default `enabled: false` — experimental until we have telemetry on
+ * which patterns actually win.
+ */
+export interface PrefetchConfig {
+    enabled: boolean;
+    /** Maximum number of memories to warm-load per file open. */
+    maxResults: number;
+    /** Minimum importance of memories to consider for prefetch. */
+    minImportance: number;
+    /** Memory chains (Memory.type values) to query. */
+    chains: string[];
+}
+export interface PrefetchInput {
+    filePath: string;
+    symbols?: Array<{
+        name: string;
+    }>;
+}
+export interface PrefetchPlan {
+    enabled: boolean;
+    query: string;
+    chains: string[];
+    minImportance: number;
+    maxResults: number;
+    /** Hint to the buffer layer: how much TTL to apply (shorter than query TTL). */
+    ttlMs: number;
+}
+/**
+ * Pull human-readable tokens out of a path + optional symbol names.
+ * "src/auth/middleware.ts" + [{name: "verifyJwt"}] -> ["auth", "middleware", "verify", "jwt"]
+ */
+export declare function extractTopics(input: PrefetchInput): string[];
+export declare function buildPrefetchPlan(input: PrefetchInput, config: PrefetchConfig): PrefetchPlan;
+/**
+ * Result entries the caller provides for priming. Same shape as
+ * `WorkingMemoryBuffer.prime` consumes, kept loose so the consumer doesn't
+ * need to depend on SearchResult in its own code path.
+ */
+export interface PrefetchEntry {
+    id: string;
+    content: string;
+    score?: number;
+    metadata?: Record<string, unknown>;
+}
+/**
+ * Plan + execute: given a session and a function that knows how to fetch
+ * related memories, build the plan and prime the session's buffer with the
+ * returned entries. Returns a summary the caller can log or return as the
+ * API response. Errors are swallowed (fire-and-forget semantics).
+ */
+export declare function executePrefetch(input: PrefetchInput, fetchEntries: (plan: PrefetchPlan) => Promise<PrefetchEntry[]>, primeFn: (entries: PrefetchEntry[]) => number, config?: PrefetchConfig): Promise<{
+    enabled: boolean;
+    query: string;
+    primed: number;
+    skippedReason?: string;
+}>;
+export declare const DEFAULT_PREFETCH_CONFIG: PrefetchConfig;
+//# sourceMappingURL=prefetch.d.ts.map

package/dist/services/synapse/prefetch/prefetch.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"prefetch.d.ts","sourceRoot":"","sources":["../../../../src/services/synapse/prefetch/prefetch.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;GAmBG;AAEH,MAAM,WAAW,cAAc;IAC7B,OAAO,EAAE,OAAO,CAAC;IACjB,6DAA6D;IAC7D,UAAU,EAAE,MAAM,CAAC;IACnB,+DAA+D;IAC/D,aAAa,EAAE,MAAM,CAAC;IACtB,mDAAmD;IACnD,MAAM,EAAE,MAAM,EAAE,CAAC;CAClB;AAED,MAAM,WAAW,aAAa;IAC5B,QAAQ,EAAE,MAAM,CAAC;IACjB,OAAO,CAAC,EAAE,KAAK,CAAC;QAAE,IAAI,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;CACnC;AAED,MAAM,WAAW,YAAY;IAC3B,OAAO,EAAE,OAAO,CAAC;IACjB,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,MAAM,EAAE,CAAC;IACjB,aAAa,EAAE,MAAM,CAAC;IACtB,UAAU,EAAE,MAAM,CAAC;IACnB,gFAAgF;IAChF,KAAK,EAAE,MAAM,CAAC;CACf;AAsBD;;;GAGG;AACH,wBAAgB,aAAa,CAAC,KAAK,EAAE,aAAa,GAAG,MAAM,EAAE,CAqB5D;AAED,wBAAgB,iBAAiB,CAC/B,KAAK,EAAE,aAAa,EACpB,MAAM,EAAE,cAAc,GACrB,YAAY,CAUd;AAED;;;;GAIG;AACH,MAAM,WAAW,aAAa;IAC5B,EAAE,EAAE,MAAM,CAAC;IACX,OAAO,EAAE,MAAM,CAAC;IAChB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,QAAQ,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;CACpC;AAED;;;;;GAKG;AACH,wBAAsB,eAAe,CACnC,KAAK,EAAE,aAAa,EACpB,YAAY,EAAE,CAAC,IAAI,EAAE,YAAY,KAAK,OAAO,CAAC,aAAa,EAAE,CAAC,EAC9D,OAAO,EAAE,CAAC,OAAO,EAAE,aAAa,EAAE,KAAK,MAAM,EAC7C,MAAM,GAAE,cAAwC,GAC/C,OAAO,CAAC;IAAE,OAAO,EAAE,OAAO,CAAC;IAAC,KAAK,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,MAAM,CAAC;IAAC,aAAa,CAAC,EAAE,MAAM,CAAA;CAAE,CAAC,CAoBtF;AAED,eAAO,MAAM,uBAAuB,EAAE,cAKrC,CAAC"}

package/dist/services/synapse/prefetch/prefetch.js

@@ -0,0 +1,111 @@
+/**
+ * Predictive Prefetch — anticipatory attention.
+ *
+ * Helpers for warming a session's working-memory buffer before the agent
+ * asks. Strategy is intentionally simple here so the consumer (a tool
+ * handler, an IDE plugin) controls scheduling and the actual DB calls:
+ *
+ *   1. extractTopics(filePath, symbols)
+ *        Builds a topic phrase from a file path and (optionally) its symbol
+ *        definitions. The phrase is used as a search query for related
+ *        memories.
+ *
+ *   2. buildPrefetchPlan(input, config)
+ *        Decides what to fetch (chains, minImportance, maxResults). The
+ *        consumer executes the search and primes the buffer with whatever
+ *        is returned.
+ *
+ * Default `enabled: false` — experimental until we have telemetry on
+ * which patterns actually win.
+ */
+const SEGMENT_RE = /[A-Za-z0-9]+/g;
+const STOP = new Set([
+    "src",
+    "lib",
+    "test",
+    "tests",
+    "spec",
+    "index",
+    "main",
+    "ts",
+    "tsx",
+    "js",
+    "jsx",
+    "py",
+    "rs",
+    "go",
+    "java",
+    "dart",
+]);
+/**
+ * Pull human-readable tokens out of a path + optional symbol names.
+ * "src/auth/middleware.ts" + [{name: "verifyJwt"}] -> ["auth", "middleware", "verify", "jwt"]
+ */
+export function extractTopics(input) {
+    const out = [];
+    const seen = new Set();
+    const addToken = (raw) => {
+        for (const part of raw.split(/(?=[A-Z])/)) {
+            const lower = part.toLowerCase();
+            const cleaned = lower.match(SEGMENT_RE)?.join("") ?? "";
+            if (cleaned.length < 3 || STOP.has(cleaned) || seen.has(cleaned))
+                continue;
+            seen.add(cleaned);
+            out.push(cleaned);
+        }
+    };
+    for (const match of input.filePath.matchAll(SEGMENT_RE)) {
+        addToken(match[0]);
+    }
+    if (input.symbols) {
+        for (const s of input.symbols)
+            addToken(s.name);
+    }
+    return out;
+}
+export function buildPrefetchPlan(input, config) {
+    const topics = extractTopics(input);
+    return {
+        enabled: config.enabled && topics.length > 0,
+        query: topics.join(" "),
+        chains: config.chains,
+        minImportance: config.minImportance,
+        maxResults: config.maxResults,
+        ttlMs: 5 * 60 * 1000,
+    };
+}
+/**
+ * Plan + execute: given a session and a function that knows how to fetch
+ * related memories, build the plan and prime the session's buffer with the
+ * returned entries. Returns a summary the caller can log or return as the
+ * API response. Errors are swallowed (fire-and-forget semantics).
+ */
+export async function executePrefetch(input, fetchEntries, primeFn, config = DEFAULT_PREFETCH_CONFIG) {
+    const plan = buildPrefetchPlan(input, config);
+    if (!plan.enabled) {
+        return { enabled: false, query: plan.query, primed: 0, skippedReason: "no-topics-or-disabled" };
+    }
+    try {
+        const entries = await fetchEntries(plan);
+        if (entries.length === 0) {
+            return { enabled: true, query: plan.query, primed: 0, skippedReason: "no-matches" };
+        }
+        const primed = primeFn(entries);
+        return { enabled: true, query: plan.query, primed };
+    }
+    catch (err) {
+        return {
+            enabled: true,
+            query: plan.query,
+            primed: 0,
+            skippedReason: `fetch-error: ${err instanceof Error ? err.message : String(err)}`,
+        };
+    }
+}
+export const DEFAULT_PREFETCH_CONFIG = {
+    enabled: false, // experimental — opt-in
+    maxResults: 10,
+    minImportance: 0.5,
+    chains: ["decision", "pattern", "code"],
+};
+//# sourceMappingURL=prefetch.js.map

package/dist/services/synapse/prefetch/prefetch.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"prefetch.js","sourceRoot":"","sources":["../../../../src/services/synapse/prefetch/prefetch.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;GAmBG;AA2BH,MAAM,UAAU,GAAG,eAAe,CAAC;AACnC,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC;IACnB,KAAK;IACL,KAAK;IACL,MAAM;IACN,OAAO;IACP,MAAM;IACN,OAAO;IACP,MAAM;IACN,IAAI;IACJ,KAAK;IACL,IAAI;IACJ,KAAK;IACL,IAAI;IACJ,IAAI;IACJ,IAAI;IACJ,MAAM;IACN,MAAM;CACP,CAAC,CAAC;AAEH;;;GAGG;AACH,MAAM,UAAU,aAAa,CAAC,KAAoB;IAChD,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAE/B,MAAM,QAAQ,GAAG,CAAC,GAAW,EAAE,EAAE;QAC/B,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,KAAK,CAAC,WAAW,CAAC,EAAE,CAAC;YAC1C,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;YACjC,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,CAAC,UAAU,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;YACxD,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC;gBAAE,SAAS;YAC3E,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YAClB,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACpB,CAAC;IACH,CAAC,CAAC;IAEF,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,QAAQ,CAAC,QAAQ,CAAC,UAAU,CAAC,EAAE,CAAC;QACxD,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IACrB,CAAC;IACD,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC;QAClB,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,OAAO;YAAE,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IAClD,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,MAAM,UAAU,iBAAiB,CAC/B,KAAoB,EACpB,MAAsB;IAEtB,MAAM,MAAM,GAAG,aAAa,CAAC,KAAK,CAAC,CAAC;IACpC,OAAO;QACL,OAAO,EAAE,MAAM,CAAC,OAAO,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC;QAC5C,KAAK,EAAE,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC;QACvB,MAAM,EAAE,MAAM,CAAC,MAAM;QACrB,aAAa,EAAE,MAAM,CAAC,aAAa;QACnC,UAAU,EAAE,MAAM,CAAC,UAAU;QAC7B,KAAK,EAAE,CAAC,GAAG,EAAE,GAAG,IAAI;KACrB,CAAC;AACJ,CAAC;AAcD;;;;;GAKG;AACH,MAAM,CAAC,KAAK,UAAU,eAAe,CACnC,KAAoB,EACpB,YAA8D,EAC9D,OAA6C,EAC7C,SAAyB,uBAAuB;IAEhD,MAAM,IAAI,GAAG,iBAAiB,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;IAC9C,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC;QAClB,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,MAAM,EAAE,CAAC,EAAE,aAAa,EAAE,uBAAuB,EAAE,CAAC;IAClG,CAAC;IACD,IAAI,CAAC;QACH,MAAM,OAAO,GAAG,MAAM,YAAY,CAAC,IAAI,CAAC,CAAC;QACzC,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACzB,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,MAAM,EAAE,CAAC,EAAE,aAAa,EAAE,YAAY,EAAE,CAAC;QACtF,CAAC;QACD,MAAM,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC;QAChC,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,MAAM,EAAE,CAAC;IACtD,CAAC;IAAC,OAAO,GAAG,EAAE,CAAC;QACb,OAAO;YACL,OAAO,EAAE,IAAI;YACb,KAAK,EAAE,IAAI,CAAC,KAAK;YACjB,MAAM,EAAE,CAAC;YACT,aAAa,EAAE,gBAAgB,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE;SAClF,CAAC;IACJ,CAAC;AACH,CAAC;AAED,MAAM,CAAC,MAAM,uBAAuB,GAAmB;IACrD,OAAO,EAAE,KAAK,EAAE,wBAAwB;IACxC,UAAU,EAAE,EAAE;IACd,aAAa,EAAE,GAAG;IAClB,MAAM,EAAE,CAAC,UAAU,EAAE,SAAS,EAAE,MAAM,CAAC;CACxC,CAAC"}