prism-mcp-server 8.0.0 → 8.0.1

package/dist/storage/sqlite.js

@@ -1642,7 +1642,7 @@ export class SqliteStorage {
             if (missingIds.length > 0) {
                 const placeholders = missingIds.map(() => '?').join(',');
                 const missingQuery = `
-          SELECT id, project, summary, session_date, decisions, files_changed
+          SELECT id, project, summary, session_date, decisions, files_changed, keywords, is_rollup, importance, last_accessed_at
           FROM session_ledger
           WHERE id IN (${placeholders}) AND deleted_at IS NULL AND user_id = ?
         `;
@@ -1655,6 +1655,9 @@ export class SqliteStorage {
                         session_date: row.session_date,
                         decisions: this.parseJsonColumn(row.decisions),
                         files_changed: this.parseJsonColumn(row.files_changed),
+                        is_rollup: Boolean(row.is_rollup),
+                        importance: Number(row.importance) || 0,
+                        last_accessed_at: row.last_accessed_at || null,
                         similarity: 0.0,
                     });
                 }
@@ -1666,6 +1669,7 @@ export class SqliteStorage {
                     const normEnergy = normalizeActivationEnergy(r.activationEnergy);
                     node.activationScore = normEnergy;
                     node.rawActivationEnergy = r.activationEnergy;
+                    node.isDiscovered = r.isDiscovered;
                     // Hybrid blend: 70% original match relevance, 30% structural energy
                     node.hybridScore = (node.similarity * 0.7) + (normEnergy * 0.3);
                     finalResults.push(node);

package/dist/storage/supabase.js

@@ -374,7 +374,7 @@ export class SupabaseStorage {
                         id: `in.(${missingIds.join(",")})`,
                         user_id: `eq.${userId}`,
                         deleted_at: "is.null",
-                        select: "id,project,summary,session_date,decisions,files_changed",
+                        select: "id,project,summary,session_date,decisions,files_changed,is_rollup,importance,last_accessed_at",
                     });
                     for (const row of (Array.isArray(rows) ? rows : [])) {
                         fullNodeMap.set(row.id, {
@@ -384,6 +384,9 @@ export class SupabaseStorage {
                             session_date: row.session_date,
                             decisions: Array.isArray(row.decisions) ? row.decisions : [],
                             files_changed: Array.isArray(row.files_changed) ? row.files_changed : [],
+                            is_rollup: Boolean(row.is_rollup),
+                            importance: Number(row.importance) || 0,
+                            last_accessed_at: row.last_accessed_at || null,
                             similarity: 0.0,
                         });
                     }
@@ -400,6 +403,7 @@ export class SupabaseStorage {
                     const normEnergy = normalizeActivationEnergy(r.activationEnergy);
                     node.activationScore = normEnergy;
                     node.rawActivationEnergy = r.activationEnergy;
+                    node.isDiscovered = r.isDiscovered;
                     // Hybrid blend: 70% original match relevance, 30% structural energy
                     node.hybridScore = (node.similarity * 0.7) + (normEnergy * 0.3);
                     finalResults.push(node);

package/dist/tools/graphHandlers.js

@@ -146,67 +146,9 @@ export async function knowledgeSearchHandler(args) {
         });
         contentBlocks.push(traceToContentBlock(trace));
     }
-    // ── v6.0 Phase 3: 1-Hop Graph Expansion ──────────────────
-    // Same pattern as sessionSearchMemoryHandler:
-    // Traverse outbound links from direct hits to find associated memories.
-    // Graph-expanded results are BONUS — don't consume limit slots.
-    try {
-        // Extract IDs from the knowledge search results
-        const directIds = new Set();
-        if (data.results && Array.isArray(data.results)) {
-            for (const entry of data.results) {
-                if (entry?.id)
-                    directIds.add(entry.id);
-            }
-        }
-        if (directIds.size > 0) {
-            const enrichedIds = new Set();
-            const maxGraphResults = Math.min(limit, 10);
-            for (const directId of directIds) {
-                if (enrichedIds.size >= maxGraphResults)
-                    break;
-                const links = await storage.getLinksFrom(directId, PRISM_USER_ID, 0.3, 5);
-                for (const link of links) {
-                    if (!directIds.has(link.target_id) && !enrichedIds.has(link.target_id)) {
-                        enrichedIds.add(link.target_id);
-                        if (enrichedIds.size >= maxGraphResults)
-                            break;
-                    }
-                }
-            }
-            if (enrichedIds.size > 0) {
-                const enrichedEntries = await storage.getLedgerEntries({
-                    user_id: `eq.${PRISM_USER_ID}`,
-                    ids: [...enrichedIds],
-                    select: "id,summary,project,created_at",
-                });
-                if (enrichedEntries.length > 0) {
-                    const graphFormatted = enrichedEntries.map((e) => `[🔗] ${e.created_at?.split("T")[0] || "unknown"} — ${e.project || "unknown"}\n` +
-                        `  Summary: ${e.summary}`).join("\n");
-                    contentBlocks[0] = {
-                        type: "text",
-                        text: contentBlocks[0].text +
-                            `\n\n🔗 Graph-connected memories (${enrichedEntries.length} via 1-hop expansion):\n\n${graphFormatted}`,
-                    };
-                    // Fire-and-forget: reinforce traversed links
-                    for (const directId of directIds) {
-                        storage.getLinksFrom(directId, PRISM_USER_ID, 0.3, 5)
-                            .then(links => {
-                            for (const link of links) {
-                                if (enrichedIds.has(link.target_id)) {
-                                    storage.reinforceLink(directId, link.target_id, link.link_type).catch(() => { });
-                                }
-                            }
-                        })
-                            .catch(() => { });
-                    }
-                }
-            }
-        }
-    }
-    catch (graphErr) {
-        debugLog(`[knowledge_search] Graph expansion failed (non-fatal): ${graphErr instanceof Error ? graphErr.message : String(graphErr)}`);
-    }
+    // v8.0: Legacy v6.0 1-Hop Graph Expansion has been removed.
+    // The Synapse Engine now handles multi-hop traversal at the storage layer,
+    // integrating discovered nodes into the main ranked result array.
     return { content: contentBlocks, isError: false };
 }
 export async function knowledgeForgetHandler(args) {
@@ -437,9 +379,12 @@ export async function sessionSearchMemoryHandler(args) {
                     // They should decay 50% slower than raw episodic chatter to retain long-term context.
                     const decayRate = r.is_rollup ? PRISM_ACTR_DECAY * 0.5 : PRISM_ACTR_DECAY;
                     const Bi = baseLevelActivation(timestamps, now, decayRate);
-                    // S_i: Structural activation energy from Synapse logic 
+                    // S_i: Normalized structural activation energy from Synapse logic 
                     // (computed during applySynapse in storage layer)
-                    const Si = (typeof r.rawActivationEnergy === 'number') ? r.rawActivationEnergy : 0;
+                    // v8.0: Use normalized 0-1 activationScore, NOT unbounded rawActivationEnergy.
+                    // Raw energy can reach 15+ for hub nodes, which saturates the sigmoid
+                    // and erases Bi (recency/frequency) from the composite score.
+                    const Si = (typeof r.activationScore === 'number') ? r.activationScore : 0;
                     // Composite retrieval score
                     const composite = compositeRetrievalScore(typeof r.similarity === "number" ? r.similarity : 0, Bi + Si, PRISM_ACTR_WEIGHT_SIMILARITY, PRISM_ACTR_WEIGHT_ACTIVATION, PRISM_ACTR_SIGMOID_MIDPOINT, PRISM_ACTR_SIGMOID_STEEPNESS);
                     // Attach to result for re-sorting and display
@@ -510,7 +455,9 @@ export async function sessionSearchMemoryHandler(args) {
             const actrStr = r._actr_composite !== undefined
                 ? `  ACT-R: composite=${r._actr_composite.toFixed(3)} (B=${r._actr_Bi?.toFixed(2)}, S=${r._actr_Si?.toFixed(3)})\n`
                 : "";
-            return `[${i + 1}] ${simScore} similar — ${r.session_date || "unknown date"}\n` +
+            // v8.0: Tag nodes discovered via Synapse multi-hop traversal
+            const synapseTag = r.isDiscovered ? " [🌐 Synapse]" : "";
+            return `[${i + 1}] ${simScore} similar${synapseTag} — ${r.session_date || "unknown date"}\n` +
                 `  Project: ${r.project}\n` +
                 `  Summary: ${r.summary}\n` +
                 importanceStr +
@@ -551,62 +498,9 @@ export async function sessionSearchMemoryHandler(args) {
             });
             contentBlocks.push(traceToContentBlock(trace));
         }
-        // ── v6.0 Phase 3: 1-Hop Graph Expansion ──────────────────
-        // After direct hits, traverse outbound links from each result to
-        // find associated memories. Graph-expanded results are BONUS — they
-        // don't consume limit slots. Hard-capped at `limit` additional results
-        // to protect LLM context windows.
-        //
-        // Fire-and-forget: errors degrade gracefully to just direct hits.
-        try {
-            const directIds = new Set(results.map((r) => r.id).filter(Boolean));
-            const enrichedIds = new Set();
-            const maxGraphResults = Math.min(limit, 10); // Hard cap
-            for (const directId of directIds) {
-                if (enrichedIds.size >= maxGraphResults)
-                    break;
-                const links = await storage.getLinksFrom(directId, PRISM_USER_ID, 0.3, 5);
-                for (const link of links) {
-                    if (!directIds.has(link.target_id) && !enrichedIds.has(link.target_id)) {
-                        enrichedIds.add(link.target_id);
-                        if (enrichedIds.size >= maxGraphResults)
-                            break;
-                    }
-                }
-            }
-            if (enrichedIds.size > 0) {
-                // Fetch the actual entries for enriched IDs
-                const enrichedEntries = await storage.getLedgerEntries({
-                    user_id: `eq.${PRISM_USER_ID}`,
-                    ids: [...enrichedIds],
-                    select: "id,summary,project,created_at",
-                });
-                if (enrichedEntries.length > 0) {
-                    const graphFormatted = enrichedEntries.map((e) => `[🔗] ${e.created_at?.split("T")[0] || "unknown"} — ${e.project || "unknown"}\n` +
-                        `  Summary: ${e.summary}`).join("\n");
-                    contentBlocks[0] = {
-                        type: "text",
-                        text: contentBlocks[0].text +
-                            `\n\n🔗 Graph-connected memories (${enrichedEntries.length} via 1-hop expansion):\n\n${graphFormatted}`,
-                    };
-                    // Fire-and-forget: reinforce traversed links
-                    for (const directId of directIds) {
-                        storage.getLinksFrom(directId, PRISM_USER_ID, 0.3, 5)
-                            .then(links => {
-                            for (const link of links) {
-                                if (enrichedIds.has(link.target_id)) {
-                                    storage.reinforceLink(directId, link.target_id, link.link_type).catch(() => { });
-                                }
-                            }
-                        })
-                            .catch(() => { });
-                    }
-                }
-            }
-        }
-        catch (graphErr) {
-            debugLog(`[session_search_memory] Graph expansion failed (non-fatal): ${graphErr instanceof Error ? graphErr.message : String(graphErr)}`);
-        }
+        // v8.0: Legacy v6.0 1-Hop Graph Expansion has been removed.
+        // The Synapse Engine now handles multi-hop traversal at the storage layer,
+        // integrating discovered nodes into the main ranked result array.
         return { content: contentBlocks, isError: false };
     }
     catch (err) {

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "prism-mcp-server",
-  "version": "8.0.0",
+  "version": "8.0.1",
   "mcpName": "io.github.dcostenco/prism-mcp",
   "description": "The Mind Palace for AI Agents — a true Cognitive Architecture with Hebbian learning (episodic→semantic consolidation), ACT-R spreading activation (multi-hop causal reasoning), uncertainty-aware rejection gates (agents that know when they don't know), adversarial evaluation (anti-sycophancy), fail-closed Dark Factory pipelines, persistent memory (SQLite/Supabase), multi-agent Hivemind, time travel & visual dashboard. Zero-config local mode.",
   "module": "index.ts",