@usewhisper/mcp-server 0.1.0 → 0.3.0

package/dist/chunk-UYWE7HSU.js

@@ -0,0 +1,369 @@
+// src/engine/memory/temporal.ts
+import Anthropic from "@anthropic-ai/sdk";
+var anthropic = new Anthropic({
+  apiKey: process.env.ANTHROPIC_API_KEY || ""
+});
+var TEMPORAL_PARSING_PROMPT = `You are an expert temporal query parser. Extract temporal constraints from user queries.
+
+**Your job:**
+1. Identify if the query has temporal constraints
+2. Extract relative time references (today, yesterday, last week, etc.)
+3. Extract absolute dates if mentioned
+4. Calculate date ranges if applicable
+
+**Relative Terms:**
+- "today" \u2192 filter to documentDate = questionDate
+- "yesterday" \u2192 documentDate = questionDate - 1 day
+- "last week" \u2192 documentDate in range [questionDate - 7 days, questionDate]
+- "last month" \u2192 documentDate in range [questionDate - 30 days, questionDate]
+- "last year" \u2192 documentDate in range [questionDate - 365 days, questionDate]
+- "this week" \u2192 current week
+- "this month" \u2192 current month
+
+**Examples:**
+- "What did I say about vacation yesterday?" \u2192 relative: "yesterday"
+- "Tell me about meetings last week" \u2192 relative: "last_week"
+- "What happened on January 15?" \u2192 absoluteDate: "2024-01-15"
+- "Show me everything from last month" \u2192 relative: "last_month"
+- "What's my favorite color?" \u2192 no temporal constraint`;
+async function parseTemporalQuery(query, questionDate) {
+  const prompt = `${TEMPORAL_PARSING_PROMPT}
+
+**Query:** "${query}"
+**Question asked on:** ${questionDate.toISOString()}
+
+Extract temporal information and return JSON:
+{
+  "hasTemporalConstraint": boolean,
+  "relative": "today|yesterday|last_week|last_month|last_year|this_week|this_month|null",
+  "absoluteDate": "ISO date string or null",
+  "dateRange": { "start": "ISO", "end": "ISO" } or null
+}
+
+Return ONLY the JSON, no other text.`;
+  try {
+    const response = await anthropic.messages.create({
+      model: "claude-haiku-4.5",
+      // Faster model for parsing
+      max_tokens: 512,
+      temperature: 0,
+      messages: [{ role: "user", content: prompt }]
+    });
+    const textContent = response.content.find((c) => c.type === "text");
+    if (!textContent || textContent.type !== "text") {
+      return { hasTemporalConstraint: false };
+    }
+    const text = textContent.text.trim();
+    const jsonMatch = text.match(/```json\n?([\s\S]*?)\n?```/) || text.match(/\{[\s\S]*\}/);
+    const jsonStr = jsonMatch ? jsonMatch[1] || jsonMatch[0] : text;
+    const parsed = JSON.parse(jsonStr);
+    if (parsed.relative) {
+      const range = calculateRelativeDateRange(parsed.relative, questionDate);
+      parsed.dateRange = range;
+      parsed.absoluteDate = range.start;
+    } else if (parsed.absoluteDate) {
+      parsed.absoluteDate = new Date(parsed.absoluteDate);
+    }
+    if (parsed.dateRange) {
+      parsed.dateRange = {
+        start: new Date(parsed.dateRange.start),
+        end: new Date(parsed.dateRange.end)
+      };
+    }
+    return parsed;
+  } catch (error) {
+    console.error("Temporal parsing failed:", error);
+    return { hasTemporalConstraint: false };
+  }
+}
+function calculateRelativeDateRange(relative, from) {
+  const start = new Date(from);
+  const end = new Date(from);
+  switch (relative) {
+    case "today":
+      start.setHours(0, 0, 0, 0);
+      end.setHours(23, 59, 59, 999);
+      break;
+    case "yesterday":
+      start.setDate(start.getDate() - 1);
+      start.setHours(0, 0, 0, 0);
+      end.setDate(end.getDate() - 1);
+      end.setHours(23, 59, 59, 999);
+      break;
+    case "last_week":
+      start.setDate(start.getDate() - 7);
+      start.setHours(0, 0, 0, 0);
+      end.setHours(23, 59, 59, 999);
+      break;
+    case "this_week":
+      const dayOfWeek = start.getDay();
+      const diff = dayOfWeek === 0 ? -6 : 1 - dayOfWeek;
+      start.setDate(start.getDate() + diff);
+      start.setHours(0, 0, 0, 0);
+      end.setHours(23, 59, 59, 999);
+      break;
+    case "last_month":
+      start.setDate(start.getDate() - 30);
+      start.setHours(0, 0, 0, 0);
+      end.setHours(23, 59, 59, 999);
+      break;
+    case "this_month":
+      start.setDate(1);
+      start.setHours(0, 0, 0, 0);
+      end.setHours(23, 59, 59, 999);
+      break;
+    case "last_year":
+      start.setFullYear(start.getFullYear() - 1);
+      start.setHours(0, 0, 0, 0);
+      end.setHours(23, 59, 59, 999);
+      break;
+    default:
+      start.setFullYear(1970);
+      end.setFullYear(2100);
+  }
+  return { start, end };
+}
+async function extractEventDate(memoryContent, documentDate) {
+  const prompt = `Extract the event date from this memory.
+
+**Important distinction:**
+- documentDate: When this was said/written
+- eventDate: When the event actually occurred/will occur
+
+**Memory:** "${memoryContent}"
+**Document Date (when this was said):** ${documentDate.toISOString()}
+
+**Examples:**
+- "User said they have a meeting tomorrow" \u2192 eventDate = documentDate + 1 day
+- "User attended conference on Jan 15" \u2192 eventDate = Jan 15 of appropriate year
+- "User's favorite color is blue" \u2192 eventDate = null (no event, just a fact)
+- "Meeting happened yesterday" \u2192 eventDate = documentDate - 1 day
+
+Return JSON:
+{
+  "hasEvent": boolean,
+  "eventDate": "ISO date string or null",
+  "reasoning": "brief explanation"
+}`;
+  try {
+    const response = await anthropic.messages.create({
+      model: "claude-haiku-4.5",
+      max_tokens: 256,
+      temperature: 0,
+      messages: [{ role: "user", content: prompt }]
+    });
+    const textContent = response.content.find((c) => c.type === "text");
+    if (!textContent || textContent.type !== "text") {
+      return null;
+    }
+    const text = textContent.text.trim();
+    const jsonMatch = text.match(/```json\n?([\s\S]*?)\n?```/) || text.match(/\{[\s\S]*\}/);
+    const jsonStr = jsonMatch ? jsonMatch[1] || jsonMatch[0] : text;
+    const result = JSON.parse(jsonStr);
+    if (result.hasEvent && result.eventDate) {
+      return new Date(result.eventDate);
+    }
+    return null;
+  } catch (error) {
+    console.error("Event date extraction failed:", error);
+    return null;
+  }
+}
+function calculateTemporalRelevance(memoryDate, questionDate, decayFactor = 0.1) {
+  const daysDiff = Math.abs(
+    (questionDate.getTime() - memoryDate.getTime()) / (1e3 * 60 * 60 * 24)
+  );
+  const score = Math.exp(-decayFactor * daysDiff);
+  return score;
+}
+
+// src/engine/memory/relations.ts
+import Anthropic2 from "@anthropic-ai/sdk";
+var anthropic2 = new Anthropic2({
+  apiKey: process.env.ANTHROPIC_API_KEY || ""
+});
+var RELATION_DETECTION_PROMPT = `You are an expert at detecting relationships between memories in a knowledge graph.
+
+**Relation Types:**
+
+1. **updates** - New memory supersedes/replaces old memory (state mutation)
+   Example:
+   - Old: "User's favorite color is blue"
+   - New: "User's favorite color is green"
+   - Relation: updates (green replaces blue)
+
+2. **extends** - New memory adds detail to existing memory without contradiction (refinement)
+   Example:
+   - Old: "John works at Google"
+   - New: "John works at Google as a Senior Engineer"
+   - Relation: extends (adds job title)
+
+3. **derives** - New memory is inferred from existing memory/memories (inference)
+   Example:
+   - Memory 1: "User prefers dark mode"
+   - Memory 2: "User prefers high contrast"
+   - New: "User likely has vision preferences for accessibility"
+   - Relation: derives (inferred from both)
+
+4. **contradicts** - New memory conflicts with existing memory (conflict detection)
+   Example:
+   - Old: "Meeting scheduled for 3pm"
+   - New: "Meeting scheduled for 4pm"
+   - Relation: contradicts (should trigger update)
+
+5. **supports** - New memory provides evidence/support for existing memory
+   Example:
+   - Memory 1: "User is interested in ML"
+   - New: "User enrolled in ML course"
+   - Relation: supports (confirms interest)
+
+**Important:**
+- Only detect relations when there's a clear, meaningful connection
+- Be conservative - if unsure, don't create a relation
+- "updates" should invalidate the old memory (set validUntil)
+- "extends" keeps the old memory valid but adds information
+- "contradicts" should flag for review/resolution`;
+async function detectRelations(newMemory, existingMemories) {
+  if (existingMemories.length === 0) {
+    return [];
+  }
+  const relevantMemories = filterRelevantMemories(newMemory, existingMemories);
+  if (relevantMemories.length === 0) {
+    return [];
+  }
+  const prompt = `${RELATION_DETECTION_PROMPT}
+
+**New memory:**
+"${newMemory.content}"
+Type: ${newMemory.memoryType}
+Entities: ${newMemory.entityMentions.join(", ")}
+
+**Existing memories to check against:**
+${relevantMemories.map((m, i) => `${i}. "${m.content}" (Type: ${m.memoryType}, Date: ${m.documentDate?.toISOString() || "unknown"})`).join("\n")}
+
+Analyze if the new memory relates to any existing memories.
+
+Return a JSON array of relations:
+[{
+  "toMemoryIndex": 0,
+  "relationType": "updates|extends|derives|contradicts|supports",
+  "confidence": 0.0-1.0,
+  "reasoning": "brief explanation why this relation exists"
+}]
+
+Return ONLY the JSON array. If no relations found, return [].`;
+  try {
+    const response = await anthropic2.messages.create({
+      model: "claude-sonnet-4.5",
+      max_tokens: 2048,
+      temperature: 0,
+      messages: [{ role: "user", content: prompt }]
+    });
+    const textContent = response.content.find((c) => c.type === "text");
+    if (!textContent || textContent.type !== "text") {
+      return [];
+    }
+    const text = textContent.text.trim();
+    const jsonMatch = text.match(/```json\n?([\s\S]*?)\n?```/) || text.match(/\[[\s\S]*\]/);
+    const jsonStr = jsonMatch ? jsonMatch[1] || jsonMatch[0] : text;
+    const relations = JSON.parse(jsonStr);
+    if (!Array.isArray(relations)) {
+      return [];
+    }
+    return relations.filter((r) => r.confidence >= 0.7).map((r) => ({
+      toMemoryId: relevantMemories[r.toMemoryIndex].id,
+      relationType: r.relationType,
+      confidence: r.confidence,
+      reasoning: r.reasoning
+    }));
+  } catch (error) {
+    console.error("Relation detection failed:", error);
+    return [];
+  }
+}
+function filterRelevantMemories(newMemory, existingMemories) {
+  return existingMemories.filter((existing) => {
+    const sharedEntities = newMemory.entityMentions.some(
+      (entity) => existing.entityMentions.includes(entity)
+    );
+    if (sharedEntities) {
+      return true;
+    }
+    const newWords = extractKeywords(newMemory.content);
+    const existingWords = extractKeywords(existing.content);
+    const overlap = newWords.filter((w) => existingWords.includes(w));
+    return overlap.length >= 2;
+  });
+}
+function extractKeywords(text) {
+  const stopWords = /* @__PURE__ */ new Set([
+    "the",
+    "a",
+    "an",
+    "is",
+    "are",
+    "was",
+    "were",
+    "be",
+    "been",
+    "being",
+    "have",
+    "has",
+    "had",
+    "do",
+    "does",
+    "did",
+    "will",
+    "would",
+    "could",
+    "should",
+    "may",
+    "might",
+    "must",
+    "can",
+    "to",
+    "of",
+    "in",
+    "for",
+    "on",
+    "at",
+    "by",
+    "from",
+    "with",
+    "about"
+  ]);
+  return text.toLowerCase().split(/\W+/).filter((word) => word.length > 3 && !stopWords.has(word)).slice(0, 10);
+}
+function shouldInvalidateMemory(relationType) {
+  return relationType === "updates" || relationType === "contradicts";
+}
+function buildRelationGraph(relations) {
+  const graph = /* @__PURE__ */ new Map();
+  for (const relation of relations) {
+    if (!graph.has(relation.fromMemoryId)) {
+      graph.set(relation.fromMemoryId, []);
+    }
+    graph.get(relation.fromMemoryId).push({
+      memoryId: relation.toMemoryId,
+      relationType: relation.relationType
+    });
+    if (!graph.has(relation.toMemoryId)) {
+      graph.set(relation.toMemoryId, []);
+    }
+    graph.get(relation.toMemoryId).push({
+      memoryId: relation.fromMemoryId,
+      relationType: `inverse_${relation.relationType}`
+    });
+  }
+  return graph;
+}
+
+export {
+  parseTemporalQuery,
+  extractEventDate,
+  calculateTemporalRelevance,
+  detectRelations,
+  shouldInvalidateMemory,
+  buildRelationGraph
+};
+//# sourceMappingURL=chunk-UYWE7HSU.js.map

package/dist/chunk-UYWE7HSU.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../src/engine/memory/temporal.ts","../../src/engine/memory/relations.ts"],"sourcesContent":["/**\n * SOTA Temporal Reasoning System\n * Handles temporal queries, relative dates, and event timeline reasoning\n * Key differentiator vs competitors (76.69% on LongMemEval temporal reasoning)\n */\n\nimport Anthropic from \"@anthropic-ai/sdk\";\nimport type { TemporalFilter } from \"./types.js\";\n\nconst anthropic = new Anthropic({\n  apiKey: process.env.ANTHROPIC_API_KEY || \"\",\n});\n\nconst TEMPORAL_PARSING_PROMPT = `You are an expert temporal query parser. Extract temporal constraints from user queries.\n\n**Your job:**\n1. Identify if the query has temporal constraints\n2. Extract relative time references (today, yesterday, last week, etc.)\n3. Extract absolute dates if mentioned\n4. Calculate date ranges if applicable\n\n**Relative Terms:**\n- \"today\" → filter to documentDate = questionDate\n- \"yesterday\" → documentDate = questionDate - 1 day\n- \"last week\" → documentDate in range [questionDate - 7 days, questionDate]\n- \"last month\" → documentDate in range [questionDate - 30 days, questionDate]\n- \"last year\" → documentDate in range [questionDate - 365 days, questionDate]\n- \"this week\" → current week\n- \"this month\" → current month\n\n**Examples:**\n- \"What did I say about vacation yesterday?\" → relative: \"yesterday\"\n- \"Tell me about meetings last week\" → relative: \"last_week\"\n- \"What happened on January 15?\" → absoluteDate: \"2024-01-15\"\n- \"Show me everything from last month\" → relative: \"last_month\"\n- \"What's my favorite color?\" → no temporal constraint`;\n\nexport async function parseTemporalQuery(\n  query: string,\n  questionDate: Date\n): Promise<TemporalFilter> {\n  const prompt = `${TEMPORAL_PARSING_PROMPT}\n\n**Query:** \"${query}\"\n**Question asked on:** ${questionDate.toISOString()}\n\nExtract temporal information and return JSON:\n{\n  \"hasTemporalConstraint\": boolean,\n  \"relative\": \"today|yesterday|last_week|last_month|last_year|this_week|this_month|null\",\n  \"absoluteDate\": \"ISO date string or null\",\n  \"dateRange\": { \"start\": \"ISO\", \"end\": \"ISO\" } or null\n}\n\nReturn ONLY the JSON, no other text.`;\n\n  try {\n    const response = await anthropic.messages.create({\n      model: \"claude-haiku-4.5\", // Faster model for parsing\n      max_tokens: 512,\n      temperature: 0.0,\n      messages: [{ role: \"user\", content: prompt }],\n    });\n\n    const textContent = response.content.find((c) => c.type === \"text\");\n    if (!textContent || textContent.type !== \"text\") {\n      return { hasTemporalConstraint: false };\n    }\n\n    const text = textContent.text.trim();\n    const jsonMatch = text.match(/```json\\n?([\\s\\S]*?)\\n?```/) || text.match(/\\{[\\s\\S]*\\}/);\n    const jsonStr = jsonMatch ? (jsonMatch[1] || jsonMatch[0]) : text;\n\n    const parsed = JSON.parse(jsonStr);\n\n    // Convert relative to absolute dates\n    if (parsed.relative) {\n      const range = calculateRelativeDateRange(parsed.relative, questionDate);\n      parsed.dateRange = range;\n      parsed.absoluteDate = range.start;\n    } else if (parsed.absoluteDate) {\n      parsed.absoluteDate = new Date(parsed.absoluteDate);\n    }\n\n    // Convert date strings to Date objects in range\n    if (parsed.dateRange) {\n      parsed.dateRange = {\n        start: new Date(parsed.dateRange.start),\n        end: new Date(parsed.dateRange.end),\n      };\n    }\n\n    return parsed;\n  } catch (error) {\n    console.error(\"Temporal parsing failed:\", error);\n    return { hasTemporalConstraint: false };\n  }\n}\n\n/**\n * Calculate absolute date range from relative term\n */\nexport function calculateRelativeDateRange(\n  relative: string,\n  from: Date\n): { start: Date; end: Date } {\n  const start = new Date(from);\n  const end = new Date(from);\n\n  switch (relative) {\n    case \"today\":\n      start.setHours(0, 0, 0, 0);\n      end.setHours(23, 59, 59, 999);\n      break;\n\n    case \"yesterday\":\n      start.setDate(start.getDate() - 1);\n      start.setHours(0, 0, 0, 0);\n      end.setDate(end.getDate() - 1);\n      end.setHours(23, 59, 59, 999);\n      break;\n\n    case \"last_week\":\n      start.setDate(start.getDate() - 7);\n      start.setHours(0, 0, 0, 0);\n      end.setHours(23, 59, 59, 999);\n      break;\n\n    case \"this_week\":\n      // Start of current week (Monday)\n      const dayOfWeek = start.getDay();\n      const diff = dayOfWeek === 0 ? -6 : 1 - dayOfWeek; // Adjust for Sunday\n      start.setDate(start.getDate() + diff);\n      start.setHours(0, 0, 0, 0);\n      end.setHours(23, 59, 59, 999);\n      break;\n\n    case \"last_month\":\n      start.setDate(start.getDate() - 30);\n      start.setHours(0, 0, 0, 0);\n      end.setHours(23, 59, 59, 999);\n      break;\n\n    case \"this_month\":\n      start.setDate(1);\n      start.setHours(0, 0, 0, 0);\n      end.setHours(23, 59, 59, 999);\n      break;\n\n    case \"last_year\":\n      start.setFullYear(start.getFullYear() - 1);\n      start.setHours(0, 0, 0, 0);\n      end.setHours(23, 59, 59, 999);\n      break;\n\n    default:\n      // Default to no constraint\n      start.setFullYear(1970);\n      end.setFullYear(2100);\n  }\n\n  return { start, end };\n}\n\n/**\n * Extract event date from memory content using LLM\n * Differentiates between documentDate (when said) and eventDate (when occurred)\n */\nexport async function extractEventDate(\n  memoryContent: string,\n  documentDate: Date\n): Promise<Date | null> {\n  const prompt = `Extract the event date from this memory.\n\n**Important distinction:**\n- documentDate: When this was said/written\n- eventDate: When the event actually occurred/will occur\n\n**Memory:** \"${memoryContent}\"\n**Document Date (when this was said):** ${documentDate.toISOString()}\n\n**Examples:**\n- \"User said they have a meeting tomorrow\" → eventDate = documentDate + 1 day\n- \"User attended conference on Jan 15\" → eventDate = Jan 15 of appropriate year\n- \"User's favorite color is blue\" → eventDate = null (no event, just a fact)\n- \"Meeting happened yesterday\" → eventDate = documentDate - 1 day\n\nReturn JSON:\n{\n  \"hasEvent\": boolean,\n  \"eventDate\": \"ISO date string or null\",\n  \"reasoning\": \"brief explanation\"\n}`;\n\n  try {\n    const response = await anthropic.messages.create({\n      model: \"claude-haiku-4.5\",\n      max_tokens: 256,\n      temperature: 0.0,\n      messages: [{ role: \"user\", content: prompt }],\n    });\n\n    const textContent = response.content.find((c) => c.type === \"text\");\n    if (!textContent || textContent.type !== \"text\") {\n      return null;\n    }\n\n    const text = textContent.text.trim();\n    const jsonMatch = text.match(/```json\\n?([\\s\\S]*?)\\n?```/) || text.match(/\\{[\\s\\S]*\\}/);\n    const jsonStr = jsonMatch ? (jsonMatch[1] || jsonMatch[0]) : text;\n\n    const result = JSON.parse(jsonStr);\n\n    if (result.hasEvent && result.eventDate) {\n      return new Date(result.eventDate);\n    }\n\n    return null;\n  } catch (error) {\n    console.error(\"Event date extraction failed:\", error);\n    return null;\n  }\n}\n\n/**\n * Check if a memory is valid at a given point in time\n * Uses validFrom/validUntil for version tracking\n */\nexport function isMemoryValidAt(\n  memory: {\n    validFrom: Date | null;\n    validUntil: Date | null;\n  },\n  atTime: Date\n): boolean {\n  if (!memory.validFrom) {\n    return true; // No validity constraints\n  }\n\n  if (atTime < memory.validFrom) {\n    return false; // Not yet valid\n  }\n\n  if (memory.validUntil && atTime > memory.validUntil) {\n    return false; // No longer valid\n  }\n\n  return true;\n}\n\n/**\n * Get the current version of a memory at a given time\n * Handles knowledge updates and versioning\n */\nexport async function getMemoryVersionAt(\n  memoryId: string,\n  atTime: Date,\n  db: any\n): Promise<any | null> {\n  // Get all versions in the chain\n  const versions = await db.memory.findMany({\n    where: {\n      OR: [\n        { id: memoryId },\n        { supersededBy: memoryId },\n      ],\n    },\n    orderBy: {\n      version: \"asc\",\n    },\n  });\n\n  if (versions.length === 0) {\n    return null;\n  }\n\n  // Find the version valid at the given time\n  for (const version of versions.reverse()) {\n    // Reverse to check newest first\n    if (isMemoryValidAt(version, atTime)) {\n      return version;\n    }\n  }\n\n  return null;\n}\n\n/**\n * Temporal distance scoring\n * Boost recent memories, decay old ones\n */\nexport function calculateTemporalRelevance(\n  memoryDate: Date,\n  questionDate: Date,\n  decayFactor: number = 0.1\n): number {\n  const daysDiff = Math.abs(\n    (questionDate.getTime() - memoryDate.getTime()) / (1000 * 60 * 60 * 24)\n  );\n\n  // Exponential decay: score = e^(-decay * days)\n  const score = Math.exp(-decayFactor * daysDiff);\n\n  return score;\n}\n\n/**\n * Build timeline of events from memories\n * Useful for \"what happened between X and Y\" queries\n */\nexport interface TimelineEvent {\n  date: Date;\n  memory: {\n    id: string;\n    content: string;\n    memoryType: string;\n  };\n}\n\nexport function buildTimeline(\n  memories: Array<{\n    id: string;\n    content: string;\n    memoryType: string;\n    eventDate: Date | null;\n    documentDate: Date | null;\n  }>\n): TimelineEvent[] {\n  const events: TimelineEvent[] = [];\n\n  for (const memory of memories) {\n    const date = memory.eventDate || memory.documentDate;\n    if (date) {\n      events.push({\n        date,\n        memory: {\n          id: memory.id,\n          content: memory.content,\n          memoryType: memory.memoryType,\n        },\n      });\n    }\n  }\n\n  // Sort by date\n  events.sort((a, b) => a.date.getTime() - b.date.getTime());\n\n  return events;\n}\n","/**\n * SOTA Memory Relation Detection\n * Detects relationships between memories (updates, extends, derives, contradicts)\n * Builds knowledge graph for temporal reasoning and version tracking\n */\n\nimport Anthropic from \"@anthropic-ai/sdk\";\nimport type { MemoryRelationship, RelationType } from \"./types.js\";\n\nconst anthropic = new Anthropic({\n  apiKey: process.env.ANTHROPIC_API_KEY || \"\",\n});\n\nconst RELATION_DETECTION_PROMPT = `You are an expert at detecting relationships between memories in a knowledge graph.\n\n**Relation Types:**\n\n1. **updates** - New memory supersedes/replaces old memory (state mutation)\n   Example:\n   - Old: \"User's favorite color is blue\"\n   - New: \"User's favorite color is green\"\n   - Relation: updates (green replaces blue)\n\n2. **extends** - New memory adds detail to existing memory without contradiction (refinement)\n   Example:\n   - Old: \"John works at Google\"\n   - New: \"John works at Google as a Senior Engineer\"\n   - Relation: extends (adds job title)\n\n3. **derives** - New memory is inferred from existing memory/memories (inference)\n   Example:\n   - Memory 1: \"User prefers dark mode\"\n   - Memory 2: \"User prefers high contrast\"\n   - New: \"User likely has vision preferences for accessibility\"\n   - Relation: derives (inferred from both)\n\n4. **contradicts** - New memory conflicts with existing memory (conflict detection)\n   Example:\n   - Old: \"Meeting scheduled for 3pm\"\n   - New: \"Meeting scheduled for 4pm\"\n   - Relation: contradicts (should trigger update)\n\n5. **supports** - New memory provides evidence/support for existing memory\n   Example:\n   - Memory 1: \"User is interested in ML\"\n   - New: \"User enrolled in ML course\"\n   - Relation: supports (confirms interest)\n\n**Important:**\n- Only detect relations when there's a clear, meaningful connection\n- Be conservative - if unsure, don't create a relation\n- \"updates\" should invalidate the old memory (set validUntil)\n- \"extends\" keeps the old memory valid but adds information\n- \"contradicts\" should flag for review/resolution`;\n\nexport async function detectRelations(\n  newMemory: {\n    content: string;\n    memoryType: string;\n    entityMentions: string[];\n  },\n  existingMemories: Array<{\n    id: string;\n    content: string;\n    memoryType: string;\n    entityMentions: string[];\n    documentDate: Date | null;\n  }>\n): Promise<MemoryRelationship[]> {\n  if (existingMemories.length === 0) {\n    return [];\n  }\n\n  // Filter to relevant memories (share entities or topics)\n  const relevantMemories = filterRelevantMemories(newMemory, existingMemories);\n\n  if (relevantMemories.length === 0) {\n    return [];\n  }\n\n  const prompt = `${RELATION_DETECTION_PROMPT}\n\n**New memory:**\n\"${newMemory.content}\"\nType: ${newMemory.memoryType}\nEntities: ${newMemory.entityMentions.join(\", \")}\n\n**Existing memories to check against:**\n${relevantMemories.map((m, i) => `${i}. \"${m.content}\" (Type: ${m.memoryType}, Date: ${m.documentDate?.toISOString() || \"unknown\"})`).join(\"\\n\")}\n\nAnalyze if the new memory relates to any existing memories.\n\nReturn a JSON array of relations:\n[{\n  \"toMemoryIndex\": 0,\n  \"relationType\": \"updates|extends|derives|contradicts|supports\",\n  \"confidence\": 0.0-1.0,\n  \"reasoning\": \"brief explanation why this relation exists\"\n}]\n\nReturn ONLY the JSON array. If no relations found, return [].`;\n\n  try {\n    const response = await anthropic.messages.create({\n      model: \"claude-sonnet-4.5\",\n      max_tokens: 2048,\n      temperature: 0.0,\n      messages: [{ role: \"user\", content: prompt }],\n    });\n\n    const textContent = response.content.find((c) => c.type === \"text\");\n    if (!textContent || textContent.type !== \"text\") {\n      return [];\n    }\n\n    const text = textContent.text.trim();\n    const jsonMatch = text.match(/```json\\n?([\\s\\S]*?)\\n?```/) || text.match(/\\[[\\s\\S]*\\]/);\n    const jsonStr = jsonMatch ? (jsonMatch[1] || jsonMatch[0]) : text;\n\n    const relations = JSON.parse(jsonStr);\n\n    if (!Array.isArray(relations)) {\n      return [];\n    }\n\n    return relations\n      .filter((r: any) => r.confidence >= 0.7) // High confidence threshold\n      .map((r: any) => ({\n        toMemoryId: relevantMemories[r.toMemoryIndex].id,\n        relationType: r.relationType as RelationType,\n        confidence: r.confidence,\n        reasoning: r.reasoning,\n      }));\n  } catch (error) {\n    console.error(\"Relation detection failed:\", error);\n    return [];\n  }\n}\n\n/**\n * Filter memories that are likely related to the new memory\n * Reduces LLM calls and improves accuracy\n */\nfunction filterRelevantMemories(\n  newMemory: {\n    content: string;\n    entityMentions: string[];\n  },\n  existingMemories: Array<{\n    id: string;\n    content: string;\n    entityMentions: string[];\n  }>\n): typeof existingMemories {\n  return existingMemories.filter((existing) => {\n    // Share at least one entity\n    const sharedEntities = newMemory.entityMentions.some((entity) =>\n      existing.entityMentions.includes(entity)\n    );\n\n    if (sharedEntities) {\n      return true;\n    }\n\n    // Share significant keywords (simple keyword overlap)\n    const newWords = extractKeywords(newMemory.content);\n    const existingWords = extractKeywords(existing.content);\n\n    const overlap = newWords.filter((w) => existingWords.includes(w));\n\n    return overlap.length >= 2; // At least 2 shared keywords\n  });\n}\n\n/**\n * Extract keywords from text (simple approach)\n */\nfunction extractKeywords(text: string): string[] {\n  const stopWords = new Set([\n    \"the\",\n    \"a\",\n    \"an\",\n    \"is\",\n    \"are\",\n    \"was\",\n    \"were\",\n    \"be\",\n    \"been\",\n    \"being\",\n    \"have\",\n    \"has\",\n    \"had\",\n    \"do\",\n    \"does\",\n    \"did\",\n    \"will\",\n    \"would\",\n    \"could\",\n    \"should\",\n    \"may\",\n    \"might\",\n    \"must\",\n    \"can\",\n    \"to\",\n    \"of\",\n    \"in\",\n    \"for\",\n    \"on\",\n    \"at\",\n    \"by\",\n    \"from\",\n    \"with\",\n    \"about\",\n  ]);\n\n  return text\n    .toLowerCase()\n    .split(/\\W+/)\n    .filter((word) => word.length > 3 && !stopWords.has(word))\n    .slice(0, 10); // Top 10 keywords\n}\n\n/**\n * Determine if relation should invalidate old memory\n */\nexport function shouldInvalidateMemory(relationType: RelationType): boolean {\n  return relationType === \"updates\" || relationType === \"contradicts\";\n}\n\n/**\n * Build relation graph for traversal\n * Returns adjacency list representation\n */\nexport function buildRelationGraph(\n  relations: Array<{\n    fromMemoryId: string;\n    toMemoryId: string;\n    relationType: string;\n  }>\n): Map<string, Array<{ memoryId: string; relationType: string }>> {\n  const graph = new Map<string, Array<{ memoryId: string; relationType: string }>>();\n\n  for (const relation of relations) {\n    // Forward edge (from → to)\n    if (!graph.has(relation.fromMemoryId)) {\n      graph.set(relation.fromMemoryId, []);\n    }\n    graph.get(relation.fromMemoryId)!.push({\n      memoryId: relation.toMemoryId,\n      relationType: relation.relationType,\n    });\n\n    // Backward edge (to → from) for bidirectional traversal\n    if (!graph.has(relation.toMemoryId)) {\n      graph.set(relation.toMemoryId, []);\n    }\n    graph.get(relation.toMemoryId)!.push({\n      memoryId: relation.fromMemoryId,\n      relationType: `inverse_${relation.relationType}`,\n    });\n  }\n\n  return graph;\n}\n\n/**\n * Get version chain for a memory\n * Follows \"updates\" relations to find all versions\n */\nexport async function getVersionChain(\n  memoryId: string,\n  db: any\n): Promise<Array<{ id: string; version: number; content: string; validFrom: Date; validUntil: Date | null }>> {\n  const versions = [];\n\n  // Get current memory\n  let currentMemory = await db.memory.findUnique({\n    where: { id: memoryId },\n    select: {\n      id: true,\n      content: true,\n      version: true,\n      validFrom: true,\n      validUntil: true,\n      supersededBy: true,\n    },\n  });\n\n  if (!currentMemory) {\n    return [];\n  }\n\n  // Walk backward through supersedes relation\n  const seenIds = new Set<string>();\n  while (currentMemory && !seenIds.has(currentMemory.id)) {\n    seenIds.add(currentMemory.id);\n\n    versions.unshift({\n      id: currentMemory.id,\n      version: currentMemory.version,\n      content: currentMemory.content,\n      validFrom: currentMemory.validFrom!,\n      validUntil: currentMemory.validUntil,\n    });\n\n    // Find previous version\n    const prev = await db.memory.findFirst({\n      where: { supersededBy: currentMemory.id },\n      select: {\n        id: true,\n        content: true,\n        version: true,\n        validFrom: true,\n        validUntil: true,\n        supersededBy: true,\n      },\n    });\n\n    currentMemory = prev;\n  }\n\n  // Walk forward through supersededBy relation\n  currentMemory = await db.memory.findUnique({\n    where: { id: memoryId },\n  });\n\n  while (currentMemory?.supersededBy && !seenIds.has(currentMemory.supersededBy)) {\n    seenIds.add(currentMemory.supersededBy);\n\n    const next = await db.memory.findUnique({\n      where: { id: currentMemory.supersededBy },\n      select: {\n        id: true,\n        content: true,\n        version: true,\n        validFrom: true,\n        validUntil: true,\n        supersededBy: true,\n      },\n    });\n\n    if (next) {\n      versions.push({\n        id: next.id,\n        version: next.version,\n        content: next.content,\n        validFrom: next.validFrom!,\n        validUntil: next.validUntil,\n      });\n\n      currentMemory = next;\n    } else {\n      break;\n    }\n  }\n\n  return versions;\n}\n"],"mappings":";AAMA,OAAO,eAAe;AAGtB,IAAM,YAAY,IAAI,UAAU;AAAA,EAC9B,QAAQ,QAAQ,IAAI,qBAAqB;AAC3C,CAAC;AAED,IAAM,0BAA0B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAwBhC,eAAsB,mBACpB,OACA,cACyB;AACzB,QAAM,SAAS,GAAG,uBAAuB;AAAA;AAAA,cAE7B,KAAK;AAAA,yBACM,aAAa,YAAY,CAAC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAYjD,MAAI;AACF,UAAM,WAAW,MAAM,UAAU,SAAS,OAAO;AAAA,MAC/C,OAAO;AAAA;AAAA,MACP,YAAY;AAAA,MACZ,aAAa;AAAA,MACb,UAAU,CAAC,EAAE,MAAM,QAAQ,SAAS,OAAO,CAAC;AAAA,IAC9C,CAAC;AAED,UAAM,cAAc,SAAS,QAAQ,KAAK,CAAC,MAAM,EAAE,SAAS,MAAM;AAClE,QAAI,CAAC,eAAe,YAAY,SAAS,QAAQ;AAC/C,aAAO,EAAE,uBAAuB,MAAM;AAAA,IACxC;AAEA,UAAM,OAAO,YAAY,KAAK,KAAK;AACnC,UAAM,YAAY,KAAK,MAAM,4BAA4B,KAAK,KAAK,MAAM,aAAa;AACtF,UAAM,UAAU,YAAa,UAAU,CAAC,KAAK,UAAU,CAAC,IAAK;AAE7D,UAAM,SAAS,KAAK,MAAM,OAAO;AAGjC,QAAI,OAAO,UAAU;AACnB,YAAM,QAAQ,2BAA2B,OAAO,UAAU,YAAY;AACtE,aAAO,YAAY;AACnB,aAAO,eAAe,MAAM;AAAA,IAC9B,WAAW,OAAO,cAAc;AAC9B,aAAO,eAAe,IAAI,KAAK,OAAO,YAAY;AAAA,IACpD;AAGA,QAAI,OAAO,WAAW;AACpB,aAAO,YAAY;AAAA,QACjB,OAAO,IAAI,KAAK,OAAO,UAAU,KAAK;AAAA,QACtC,KAAK,IAAI,KAAK,OAAO,UAAU,GAAG;AAAA,MACpC;AAAA,IACF;AAEA,WAAO;AAAA,EACT,SAAS,OAAO;AACd,YAAQ,MAAM,4BAA4B,KAAK;AAC/C,WAAO,EAAE,uBAAuB,MAAM;AAAA,EACxC;AACF;AAKO,SAAS,2BACd,UACA,MAC4B;AAC5B,QAAM,QAAQ,IAAI,KAAK,IAAI;AAC3B,QAAM,MAAM,IAAI,KAAK,IAAI;AAEzB,UAAQ,UAAU;AAAA,IAChB,KAAK;AACH,YAAM,SAAS,GAAG,GAAG,GAAG,CAAC;AACzB,UAAI,SAAS,IAAI,IAAI,IAAI,GAAG;AAC5B;AAAA,IAEF,KAAK;AACH,YAAM,QAAQ,MAAM,QAAQ,IAAI,CAAC;AACjC,YAAM,SAAS,GAAG,GAAG,GAAG,CAAC;AACzB,UAAI,QAAQ,IAAI,QAAQ,IAAI,CAAC;AAC7B,UAAI,SAAS,IAAI,IAAI,IAAI,GAAG;AAC5B;AAAA,IAEF,KAAK;AACH,YAAM,QAAQ,MAAM,QAAQ,IAAI,CAAC;AACjC,YAAM,SAAS,GAAG,GAAG,GAAG,CAAC;AACzB,UAAI,SAAS,IAAI,IAAI,IAAI,GAAG;AAC5B;AAAA,IAEF,KAAK;AAEH,YAAM,YAAY,MAAM,OAAO;AAC/B,YAAM,OAAO,cAAc,IAAI,KAAK,IAAI;AACxC,YAAM,QAAQ,MAAM,QAAQ,IAAI,IAAI;AACpC,YAAM,SAAS,GAAG,GAAG,GAAG,CAAC;AACzB,UAAI,SAAS,IAAI,IAAI,IAAI,GAAG;AAC5B;AAAA,IAEF,KAAK;AACH,YAAM,QAAQ,MAAM,QAAQ,IAAI,EAAE;AAClC,YAAM,SAAS,GAAG,GAAG,GAAG,CAAC;AACzB,UAAI,SAAS,IAAI,IAAI,IAAI,GAAG;AAC5B;AAAA,IAEF,KAAK;AACH,YAAM,QAAQ,CAAC;AACf,YAAM,SAAS,GAAG,GAAG,GAAG,CAAC;AACzB,UAAI,SAAS,IAAI,IAAI,IAAI,GAAG;AAC5B;AAAA,IAEF,KAAK;AACH,YAAM,YAAY,MAAM,YAAY,IAAI,CAAC;AACzC,YAAM,SAAS,GAAG,GAAG,GAAG,CAAC;AACzB,UAAI,SAAS,IAAI,IAAI,IAAI,GAAG;AAC5B;AAAA,IAEF;AAEE,YAAM,YAAY,IAAI;AACtB,UAAI,YAAY,IAAI;AAAA,EACxB;AAEA,SAAO,EAAE,OAAO,IAAI;AACtB;AAMA,eAAsB,iBACpB,eACA,cACsB;AACtB,QAAM,SAAS;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,eAMF,aAAa;AAAA,0CACc,aAAa,YAAY,CAAC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAelE,MAAI;AACF,UAAM,WAAW,MAAM,UAAU,SAAS,OAAO;AAAA,MAC/C,OAAO;AAAA,MACP,YAAY;AAAA,MACZ,aAAa;AAAA,MACb,UAAU,CAAC,EAAE,MAAM,QAAQ,SAAS,OAAO,CAAC;AAAA,IAC9C,CAAC;AAED,UAAM,cAAc,SAAS,QAAQ,KAAK,CAAC,MAAM,EAAE,SAAS,MAAM;AAClE,QAAI,CAAC,eAAe,YAAY,SAAS,QAAQ;AAC/C,aAAO;AAAA,IACT;AAEA,UAAM,OAAO,YAAY,KAAK,KAAK;AACnC,UAAM,YAAY,KAAK,MAAM,4BAA4B,KAAK,KAAK,MAAM,aAAa;AACtF,UAAM,UAAU,YAAa,UAAU,CAAC,KAAK,UAAU,CAAC,IAAK;AAE7D,UAAM,SAAS,KAAK,MAAM,OAAO;AAEjC,QAAI,OAAO,YAAY,OAAO,WAAW;AACvC,aAAO,IAAI,KAAK,OAAO,SAAS;AAAA,IAClC;AAEA,WAAO;AAAA,EACT,SAAS,OAAO;AACd,YAAQ,MAAM,iCAAiC,KAAK;AACpD,WAAO;AAAA,EACT;AACF;AAqEO,SAAS,2BACd,YACA,cACA,cAAsB,KACd;AACR,QAAM,WAAW,KAAK;AAAA,KACnB,aAAa,QAAQ,IAAI,WAAW,QAAQ,MAAM,MAAO,KAAK,KAAK;AAAA,EACtE;AAGA,QAAM,QAAQ,KAAK,IAAI,CAAC,cAAc,QAAQ;AAE9C,SAAO;AACT;;;AC1SA,OAAOA,gBAAe;AAGtB,IAAMC,aAAY,IAAID,WAAU;AAAA,EAC9B,QAAQ,QAAQ,IAAI,qBAAqB;AAC3C,CAAC;AAED,IAAM,4BAA4B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AA0ClC,eAAsB,gBACpB,WAKA,kBAO+B;AAC/B,MAAI,iBAAiB,WAAW,GAAG;AACjC,WAAO,CAAC;AAAA,EACV;AAGA,QAAM,mBAAmB,uBAAuB,WAAW,gBAAgB;AAE3E,MAAI,iBAAiB,WAAW,GAAG;AACjC,WAAO,CAAC;AAAA,EACV;AAEA,QAAM,SAAS,GAAG,yBAAyB;AAAA;AAAA;AAAA,GAG1C,UAAU,OAAO;AAAA,QACZ,UAAU,UAAU;AAAA,YAChB,UAAU,eAAe,KAAK,IAAI,CAAC;AAAA;AAAA;AAAA,EAG7C,iBAAiB,IAAI,CAAC,GAAG,MAAM,GAAG,CAAC,MAAM,EAAE,OAAO,YAAY,EAAE,UAAU,WAAW,EAAE,cAAc,YAAY,KAAK,SAAS,GAAG,EAAE,KAAK,IAAI,CAAC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAc9I,MAAI;AACF,UAAM,WAAW,MAAMC,WAAU,SAAS,OAAO;AAAA,MAC/C,OAAO;AAAA,MACP,YAAY;AAAA,MACZ,aAAa;AAAA,MACb,UAAU,CAAC,EAAE,MAAM,QAAQ,SAAS,OAAO,CAAC;AAAA,IAC9C,CAAC;AAED,UAAM,cAAc,SAAS,QAAQ,KAAK,CAAC,MAAM,EAAE,SAAS,MAAM;AAClE,QAAI,CAAC,eAAe,YAAY,SAAS,QAAQ;AAC/C,aAAO,CAAC;AAAA,IACV;AAEA,UAAM,OAAO,YAAY,KAAK,KAAK;AACnC,UAAM,YAAY,KAAK,MAAM,4BAA4B,KAAK,KAAK,MAAM,aAAa;AACtF,UAAM,UAAU,YAAa,UAAU,CAAC,KAAK,UAAU,CAAC,IAAK;AAE7D,UAAM,YAAY,KAAK,MAAM,OAAO;AAEpC,QAAI,CAAC,MAAM,QAAQ,SAAS,GAAG;AAC7B,aAAO,CAAC;AAAA,IACV;AAEA,WAAO,UACJ,OAAO,CAAC,MAAW,EAAE,cAAc,GAAG,EACtC,IAAI,CAAC,OAAY;AAAA,MAChB,YAAY,iBAAiB,EAAE,aAAa,EAAE;AAAA,MAC9C,cAAc,EAAE;AAAA,MAChB,YAAY,EAAE;AAAA,MACd,WAAW,EAAE;AAAA,IACf,EAAE;AAAA,EACN,SAAS,OAAO;AACd,YAAQ,MAAM,8BAA8B,KAAK;AACjD,WAAO,CAAC;AAAA,EACV;AACF;AAMA,SAAS,uBACP,WAIA,kBAKyB;AACzB,SAAO,iBAAiB,OAAO,CAAC,aAAa;AAE3C,UAAM,iBAAiB,UAAU,eAAe;AAAA,MAAK,CAAC,WACpD,SAAS,eAAe,SAAS,MAAM;AAAA,IACzC;AAEA,QAAI,gBAAgB;AAClB,aAAO;AAAA,IACT;AAGA,UAAM,WAAW,gBAAgB,UAAU,OAAO;AAClD,UAAM,gBAAgB,gBAAgB,SAAS,OAAO;AAEtD,UAAM,UAAU,SAAS,OAAO,CAAC,MAAM,cAAc,SAAS,CAAC,CAAC;AAEhE,WAAO,QAAQ,UAAU;AAAA,EAC3B,CAAC;AACH;AAKA,SAAS,gBAAgB,MAAwB;AAC/C,QAAM,YAAY,oBAAI,IAAI;AAAA,IACxB;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF,CAAC;AAED,SAAO,KACJ,YAAY,EACZ,MAAM,KAAK,EACX,OAAO,CAAC,SAAS,KAAK,SAAS,KAAK,CAAC,UAAU,IAAI,IAAI,CAAC,EACxD,MAAM,GAAG,EAAE;AAChB;AAKO,SAAS,uBAAuB,cAAqC;AAC1E,SAAO,iBAAiB,aAAa,iBAAiB;AACxD;AAMO,SAAS,mBACd,WAKgE;AAChE,QAAM,QAAQ,oBAAI,IAA+D;AAEjF,aAAW,YAAY,WAAW;AAEhC,QAAI,CAAC,MAAM,IAAI,SAAS,YAAY,GAAG;AACrC,YAAM,IAAI,SAAS,cAAc,CAAC,CAAC;AAAA,IACrC;AACA,UAAM,IAAI,SAAS,YAAY,EAAG,KAAK;AAAA,MACrC,UAAU,SAAS;AAAA,MACnB,cAAc,SAAS;AAAA,IACzB,CAAC;AAGD,QAAI,CAAC,MAAM,IAAI,SAAS,UAAU,GAAG;AACnC,YAAM,IAAI,SAAS,YAAY,CAAC,CAAC;AAAA,IACnC;AACA,UAAM,IAAI,SAAS,UAAU,EAAG,KAAK;AAAA,MACnC,UAAU,SAAS;AAAA,MACnB,cAAc,WAAW,SAAS,YAAY;AAAA,IAChD,CAAC;AAAA,EACH;AAEA,SAAO;AACT;","names":["Anthropic","anthropic"]}

package/dist/chunk-X2DL2GWT.js

@@ -0,0 +1,33 @@
+// src/db/index.ts
+import { PrismaClient } from "@prisma/client";
+import { Prisma } from "@prisma/client";
+var globalForPrisma = globalThis;
+var db = globalForPrisma.prisma ?? new PrismaClient();
+var prisma = db;
+if (process.env.NODE_ENV !== "production") {
+  globalForPrisma.prisma = db;
+}
+
+// src/engine/embeddings.ts
+import OpenAI from "openai";
+var openai = new OpenAI({ apiKey: process.env.OPENAI_API_KEY });
+async function embed(texts) {
+  const res = await openai.embeddings.create({
+    model: "text-embedding-3-small",
+    input: texts,
+    dimensions: 1536
+  });
+  return res.data.map((d) => d.embedding);
+}
+async function embedSingle(text) {
+  const [embedding] = await embed([text]);
+  return embedding;
+}
+
+export {
+  db,
+  prisma,
+  embed,
+  embedSingle
+};
+//# sourceMappingURL=chunk-X2DL2GWT.js.map

package/dist/chunk-X2DL2GWT.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../src/db/index.ts","../../src/engine/embeddings.ts"],"sourcesContent":["import { PrismaClient } from \"@prisma/client\";\n\nconst globalForPrisma = globalThis as unknown as {\n  prisma: PrismaClient | undefined;\n};\n\nexport const db = globalForPrisma.prisma ?? new PrismaClient();\nexport const prisma = db; // Alias for compatibility\n\nif (process.env.NODE_ENV !== \"production\") {\n  globalForPrisma.prisma = db;\n}\n\n// Re-export Prisma types for convenience\nexport { Prisma } from \"@prisma/client\";\nexport type {\n  User,\n  Organization,\n  OrganizationMember,\n  Project,\n  Source,\n  Document,\n  Chunk,\n  Embedding,\n  Entity,\n  EntityRelation,\n  Memory,\n  MemoryRelation,\n  Session,\n  Message,\n  ChunkMemory,\n  SyncJob,\n  Webhook,\n  WebhookDelivery,\n  SearchLog,\n  Package,\n  PackageVersion,\n  ResearchSession,\n  ResearchStep,\n  UsageRecord,\n  ApiKey,\n  AuditLog,\n  Integration,\n  Scan,\n  Finding,\n  FixSession,\n} from \"@prisma/client\";\n","import OpenAI from \"openai\";\n\nconst openai = new OpenAI({ apiKey: process.env.OPENAI_API_KEY });\n\nexport async function embed(texts: string[]): Promise<number[][]> {\n  const res = await openai.embeddings.create({\n    model: \"text-embedding-3-small\",\n    input: texts,\n    dimensions: 1536,\n  });\n\n  return res.data.map((d) => d.embedding);\n}\n\nexport async function embedSingle(text: string): Promise<number[]> {\n  const [embedding] = await embed([text]);\n  return embedding;\n}\n"],"mappings":";AAAA,SAAS,oBAAoB;AAc7B,SAAS,cAAc;AAZvB,IAAM,kBAAkB;AAIjB,IAAM,KAAK,gBAAgB,UAAU,IAAI,aAAa;AACtD,IAAM,SAAS;AAEtB,IAAI,QAAQ,IAAI,aAAa,cAAc;AACzC,kBAAgB,SAAS;AAC3B;;;ACXA,OAAO,YAAY;AAEnB,IAAM,SAAS,IAAI,OAAO,EAAE,QAAQ,QAAQ,IAAI,eAAe,CAAC;AAEhE,eAAsB,MAAM,OAAsC;AAChE,QAAM,MAAM,MAAM,OAAO,WAAW,OAAO;AAAA,IACzC,OAAO;AAAA,IACP,OAAO;AAAA,IACP,YAAY;AAAA,EACd,CAAC;AAED,SAAO,IAAI,KAAK,IAAI,CAAC,MAAM,EAAE,SAAS;AACxC;AAEA,eAAsB,YAAY,MAAiC;AACjE,QAAM,CAAC,SAAS,IAAI,MAAM,MAAM,CAAC,IAAI,CAAC;AACtC,SAAO;AACT;","names":[]}