@usewhisper/mcp-server 0.1.0 → 0.3.0

package/dist/oracle-J47QCSEW.js

@@ -0,0 +1,263 @@
+import {
+  db,
+  embedSingle
+} from "./chunk-3WGYBAYR.js";
+import {
+  Anthropic
+} from "./chunk-H3HSKH2P.js";
+import "./chunk-QGM4M3NI.js";
+
+// ../src/engine/oracle.ts
+var anthropic = new Anthropic({
+  apiKey: process.env.ANTHROPIC_API_KEY || ""
+});
+var MAX_DOCUMENT_CHUNKS = 500;
+async function buildDocumentTree(documentId) {
+  const document = await db.document.findUnique({
+    where: { id: documentId },
+    include: {
+      chunks: {
+        orderBy: { chunkOrder: "asc" },
+        take: MAX_DOCUMENT_CHUNKS
+      }
+    }
+  });
+  if (!document) {
+    throw new Error("Document not found");
+  }
+  const root = {
+    id: document.id,
+    content: document.title,
+    type: "document",
+    children: [],
+    metadata: document.metadata
+  };
+  const sectionMap = /* @__PURE__ */ new Map();
+  for (const chunk of document.chunks) {
+    const sectionPath = chunk.metadata?.sectionPath || chunk.sectionPath || "root";
+    if (!sectionMap.has(sectionPath)) {
+      const sectionNode = {
+        id: `${documentId}::${sectionPath}`,
+        content: sectionPath,
+        type: "section",
+        children: [],
+        metadata: { path: sectionPath }
+      };
+      sectionMap.set(sectionPath, sectionNode);
+      root.children.push(sectionNode);
+    }
+    const section = sectionMap.get(sectionPath);
+    section.children.push({
+      id: chunk.id,
+      content: chunk.content,
+      type: "chunk",
+      children: [],
+      metadata: chunk.metadata,
+      embedding: chunk.embedding
+    });
+  }
+  return {
+    root,
+    depth: calculateDepth(root),
+    nodeCount: countNodes(root)
+  };
+}
+function calculateDepth(node) {
+  if (node.children.length === 0) return 1;
+  return 1 + Math.max(...node.children.map(calculateDepth));
+}
+function countNodes(node) {
+  return 1 + node.children.reduce((sum, child) => sum + countNodes(child), 0);
+}
+async function oracleSearch(params) {
+  const { query, projectId, topK = 5, maxDepth = 3 } = params;
+  console.log(`\u{1F52E} Oracle search: "${query}"`);
+  const queryEmbedding = await embedSingle(query);
+  const documents = await db.document.findMany({
+    where: { projectId },
+    take: 10
+  });
+  const results = [];
+  for (const doc of documents) {
+    const tree = await buildDocumentTree(doc.id);
+    const traversalResults = await guidedTraversal({
+      tree,
+      query,
+      queryEmbedding,
+      maxDepth,
+      topK
+    });
+    results.push(...traversalResults);
+  }
+  results.sort((a, b) => b.relevance - a.relevance);
+  return results.slice(0, topK);
+}
+async function guidedTraversal(params) {
+  const {
+    tree,
+    query,
+    queryEmbedding,
+    maxDepth,
+    topK,
+    currentNode = tree.root,
+    currentDepth = 0,
+    path = ""
+  } = params;
+  const results = [];
+  if (currentDepth >= maxDepth) {
+    return results;
+  }
+  if (currentNode.type === "chunk") {
+    const relevance = currentNode.embedding ? cosineSimilarity(queryEmbedding, currentNode.embedding) : 0;
+    if (relevance > 0.3) {
+      results.push({
+        content: currentNode.content,
+        path,
+        relevance
+      });
+    }
+    return results;
+  }
+  const childScores = await Promise.all(
+    currentNode.children.map(async (child) => {
+      const score = await scoreNode(child, query, queryEmbedding);
+      return { child, score };
+    })
+  );
+  childScores.sort((a, b) => b.score - a.score);
+  const topChildren = childScores.slice(0, Math.min(3, childScores.length));
+  for (const { child, score } of topChildren) {
+    if (score > 0.2) {
+      const childPath = path ? `${path} > ${child.content.substring(0, 30)}` : child.content;
+      const childResults = await guidedTraversal({
+        tree,
+        query,
+        queryEmbedding,
+        maxDepth,
+        topK,
+        currentNode: child,
+        currentDepth: currentDepth + 1,
+        path: childPath
+      });
+      results.push(...childResults);
+    }
+  }
+  return results;
+}
+async function scoreNode(node, query, queryEmbedding) {
+  if (node.embedding) {
+    return cosineSimilarity(queryEmbedding, node.embedding);
+  }
+  const queryWords = query.toLowerCase().split(/\s+/);
+  const nodeWords = node.content.toLowerCase().split(/\s+/);
+  const overlap = queryWords.filter((w) => nodeWords.includes(w)).length;
+  return overlap / queryWords.length;
+}
+function cosineSimilarity(a, b) {
+  if (a.length !== b.length) return 0;
+  let dotProduct = 0;
+  let normA = 0;
+  let normB = 0;
+  for (let i = 0; i < a.length; i++) {
+    dotProduct += a[i] * b[i];
+    normA += a[i] * a[i];
+    normB += b[i] * b[i];
+  }
+  return dotProduct / (Math.sqrt(normA) * Math.sqrt(normB));
+}
+async function oracleResearch(params) {
+  const { question, projectId, maxSteps = 5 } = params;
+  const steps = [];
+  let currentQuery = question;
+  for (let step = 1; step <= maxSteps; step++) {
+    console.log(`\u{1F52E} Oracle step ${step}: ${currentQuery}`);
+    const results = await oracleSearch({
+      query: currentQuery,
+      projectId,
+      topK: 5
+    });
+    const reasoning = await reasonAboutResults(currentQuery, results, question);
+    steps.push({
+      step,
+      query: currentQuery,
+      results,
+      reasoning: reasoning.thought
+    });
+    if (reasoning.hasAnswer) {
+      return {
+        answer: reasoning.answer,
+        steps
+      };
+    }
+    currentQuery = reasoning.nextQuery || question;
+  }
+  const finalAnswer = await synthesizeAnswer(question, steps);
+  return {
+    answer: finalAnswer,
+    steps
+  };
+}
+async function reasonAboutResults(query, results, originalQuestion) {
+  const prompt = `You are analyzing search results to answer a question.
+
+**Original question:** ${originalQuestion}
+**Current query:** ${query}
+
+**Search results:**
+${results.map((r, i) => `${i + 1}. ${r.content} (relevance: ${r.relevance.toFixed(2)})`).join("\n")}
+
+Analyze these results:
+1. Do they answer the original question?
+2. What information is still missing?
+3. What should be the next search query?
+
+Return JSON:
+{
+  "thought": "your analysis",
+  "hasAnswer": true or false,
+  "answer": "the answer if you have it" or null,
+  "nextQuery": "next search query" or null
+}`;
+  const response = await anthropic.messages.create({
+    model: "claude-sonnet-4-5-20250929",
+    // Fixed: was "claude-sonnet-4.5" (wrong format)
+    max_tokens: 1024,
+    temperature: 0,
+    messages: [{ role: "user", content: prompt }]
+  });
+  const text = response.content.find((c) => c.type === "text");
+  if (!text || text.type !== "text") {
+    return {
+      thought: "Analysis failed",
+      hasAnswer: false
+    };
+  }
+  const jsonMatch = text.text.match(/```json\n?([\s\S]*?)\n?```/) || text.text.match(/\{[\s\S]*\}/);
+  const jsonStr = jsonMatch ? jsonMatch[1] || jsonMatch[0] : text.text;
+  return JSON.parse(jsonStr);
+}
+async function synthesizeAnswer(question, steps) {
+  const prompt = `Synthesize a final answer from multiple research steps.
+
+**Question:** ${question}
+
+**Research steps:**
+${steps.map((s) => `Step ${s.step}: ${s.query}
+  ${s.reasoning}`).join("\n\n")}
+
+Provide a comprehensive answer based on all the information gathered.`;
+  const response = await anthropic.messages.create({
+    model: "claude-sonnet-4-5-20250929",
+    // Fixed: was "claude-sonnet-4.5" (wrong format)
+    max_tokens: 2048,
+    temperature: 0,
+    messages: [{ role: "user", content: prompt }]
+  });
+  const text = response.content.find((c) => c.type === "text");
+  return text && text.type === "text" ? text.text : "Unable to synthesize answer";
+}
+export {
+  buildDocumentTree,
+  oracleResearch,
+  oracleSearch
+};

package/dist/oracle-MDP5MZRC.js

@@ -0,0 +1,257 @@
+import {
+  db,
+  embedSingle
+} from "./chunk-X2DL2GWT.js";
+
+// src/engine/oracle.ts
+import Anthropic from "@anthropic-ai/sdk";
+var anthropic = new Anthropic({
+  apiKey: process.env.ANTHROPIC_API_KEY || ""
+});
+async function buildDocumentTree(documentId) {
+  const document = await db.document.findUnique({
+    where: { id: documentId },
+    include: {
+      chunks: {
+        orderBy: { chunkOrder: "asc" }
+      }
+    }
+  });
+  if (!document) {
+    throw new Error("Document not found");
+  }
+  const root = {
+    id: document.id,
+    content: document.title,
+    type: "document",
+    children: [],
+    metadata: document.metadata
+  };
+  const sectionMap = /* @__PURE__ */ new Map();
+  for (const chunk of document.chunks) {
+    const sectionPath = chunk.metadata?.sectionPath || chunk.sectionPath || "root";
+    if (!sectionMap.has(sectionPath)) {
+      const sectionNode = {
+        id: `${documentId}::${sectionPath}`,
+        content: sectionPath,
+        type: "section",
+        children: [],
+        metadata: { path: sectionPath }
+      };
+      sectionMap.set(sectionPath, sectionNode);
+      root.children.push(sectionNode);
+    }
+    const section = sectionMap.get(sectionPath);
+    section.children.push({
+      id: chunk.id,
+      content: chunk.content,
+      type: "chunk",
+      children: [],
+      metadata: chunk.metadata,
+      embedding: chunk.embedding
+    });
+  }
+  return {
+    root,
+    depth: calculateDepth(root),
+    nodeCount: countNodes(root)
+  };
+}
+function calculateDepth(node) {
+  if (node.children.length === 0) return 1;
+  return 1 + Math.max(...node.children.map(calculateDepth));
+}
+function countNodes(node) {
+  return 1 + node.children.reduce((sum, child) => sum + countNodes(child), 0);
+}
+async function oracleSearch(params) {
+  const { query, projectId, topK = 5, maxDepth = 3 } = params;
+  console.log(`\u{1F52E} Oracle search: "${query}"`);
+  const queryEmbedding = await embedSingle(query);
+  const documents = await db.document.findMany({
+    where: { projectId },
+    take: 10
+  });
+  const results = [];
+  for (const doc of documents) {
+    const tree = await buildDocumentTree(doc.id);
+    const traversalResults = await guidedTraversal({
+      tree,
+      query,
+      queryEmbedding,
+      maxDepth,
+      topK
+    });
+    results.push(...traversalResults);
+  }
+  results.sort((a, b) => b.relevance - a.relevance);
+  return results.slice(0, topK);
+}
+async function guidedTraversal(params) {
+  const {
+    tree,
+    query,
+    queryEmbedding,
+    maxDepth,
+    topK,
+    currentNode = tree.root,
+    currentDepth = 0,
+    path = ""
+  } = params;
+  const results = [];
+  if (currentDepth >= maxDepth) {
+    return results;
+  }
+  if (currentNode.type === "chunk") {
+    const relevance = currentNode.embedding ? cosineSimilarity(queryEmbedding, currentNode.embedding) : 0;
+    if (relevance > 0.3) {
+      results.push({
+        content: currentNode.content,
+        path,
+        relevance
+      });
+    }
+    return results;
+  }
+  const childScores = await Promise.all(
+    currentNode.children.map(async (child) => {
+      const score = await scoreNode(child, query, queryEmbedding);
+      return { child, score };
+    })
+  );
+  childScores.sort((a, b) => b.score - a.score);
+  const topChildren = childScores.slice(0, Math.min(3, childScores.length));
+  for (const { child, score } of topChildren) {
+    if (score > 0.2) {
+      const childPath = path ? `${path} > ${child.content.substring(0, 30)}` : child.content;
+      const childResults = await guidedTraversal({
+        tree,
+        query,
+        queryEmbedding,
+        maxDepth,
+        topK,
+        currentNode: child,
+        currentDepth: currentDepth + 1,
+        path: childPath
+      });
+      results.push(...childResults);
+    }
+  }
+  return results;
+}
+async function scoreNode(node, query, queryEmbedding) {
+  if (node.embedding) {
+    return cosineSimilarity(queryEmbedding, node.embedding);
+  }
+  const queryWords = query.toLowerCase().split(/\s+/);
+  const nodeWords = node.content.toLowerCase().split(/\s+/);
+  const overlap = queryWords.filter((w) => nodeWords.includes(w)).length;
+  return overlap / queryWords.length;
+}
+function cosineSimilarity(a, b) {
+  if (a.length !== b.length) return 0;
+  let dotProduct = 0;
+  let normA = 0;
+  let normB = 0;
+  for (let i = 0; i < a.length; i++) {
+    dotProduct += a[i] * b[i];
+    normA += a[i] * a[i];
+    normB += b[i] * b[i];
+  }
+  return dotProduct / (Math.sqrt(normA) * Math.sqrt(normB));
+}
+async function oracleResearch(params) {
+  const { question, projectId, maxSteps = 5 } = params;
+  const steps = [];
+  let currentQuery = question;
+  for (let step = 1; step <= maxSteps; step++) {
+    console.log(`\u{1F52E} Oracle step ${step}: ${currentQuery}`);
+    const results = await oracleSearch({
+      query: currentQuery,
+      projectId,
+      topK: 5
+    });
+    const reasoning = await reasonAboutResults(currentQuery, results, question);
+    steps.push({
+      step,
+      query: currentQuery,
+      results,
+      reasoning: reasoning.thought
+    });
+    if (reasoning.hasAnswer) {
+      return {
+        answer: reasoning.answer,
+        steps
+      };
+    }
+    currentQuery = reasoning.nextQuery || question;
+  }
+  const finalAnswer = await synthesizeAnswer(question, steps);
+  return {
+    answer: finalAnswer,
+    steps
+  };
+}
+async function reasonAboutResults(query, results, originalQuestion) {
+  const prompt = `You are analyzing search results to answer a question.
+
+**Original question:** ${originalQuestion}
+**Current query:** ${query}
+
+**Search results:**
+${results.map((r, i) => `${i + 1}. ${r.content} (relevance: ${r.relevance.toFixed(2)})`).join("\n")}
+
+Analyze these results:
+1. Do they answer the original question?
+2. What information is still missing?
+3. What should be the next search query?
+
+Return JSON:
+{
+  "thought": "your analysis",
+  "hasAnswer": true or false,
+  "answer": "the answer if you have it" or null,
+  "nextQuery": "next search query" or null
+}`;
+  const response = await anthropic.messages.create({
+    model: "claude-sonnet-4.5",
+    max_tokens: 1024,
+    temperature: 0,
+    messages: [{ role: "user", content: prompt }]
+  });
+  const text = response.content.find((c) => c.type === "text");
+  if (!text || text.type !== "text") {
+    return {
+      thought: "Analysis failed",
+      hasAnswer: false
+    };
+  }
+  const jsonMatch = text.text.match(/```json\n?([\s\S]*?)\n?```/) || text.text.match(/\{[\s\S]*\}/);
+  const jsonStr = jsonMatch ? jsonMatch[1] || jsonMatch[0] : text.text;
+  return JSON.parse(jsonStr);
+}
+async function synthesizeAnswer(question, steps) {
+  const prompt = `Synthesize a final answer from multiple research steps.
+
+**Question:** ${question}
+
+**Research steps:**
+${steps.map((s) => `Step ${s.step}: ${s.query}
+  ${s.reasoning}`).join("\n\n")}
+
+Provide a comprehensive answer based on all the information gathered.`;
+  const response = await anthropic.messages.create({
+    model: "claude-sonnet-4.5",
+    max_tokens: 2048,
+    temperature: 0,
+    messages: [{ role: "user", content: prompt }]
+  });
+  const text = response.content.find((c) => c.type === "text");
+  return text && text.type === "text" ? text.text : "Unable to synthesize answer";
+}
+export {
+  buildDocumentTree,
+  oracleResearch,
+  oracleSearch
+};
+//# sourceMappingURL=oracle-MDP5MZRC.js.map

package/dist/oracle-MDP5MZRC.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../src/engine/oracle.ts"],"sourcesContent":["/**\n * Oracle Research Mode - Tree-guided hybrid search\n * Like Nia's Oracle feature - SOTA search for complex queries\n */\n\nimport Anthropic from \"@anthropic-ai/sdk\";\nimport { db } from \"../db/index.js\";\nimport { embedSingle } from \"./embeddings.js\";\n\nconst anthropic = new Anthropic({\n  apiKey: process.env.ANTHROPIC_API_KEY || \"\",\n});\n\ninterface DocumentTree {\n  root: TreeNode;\n  depth: number;\n  nodeCount: number;\n}\n\ninterface TreeNode {\n  id: string;\n  content: string;\n  type: \"document\" | \"section\" | \"chunk\";\n  children: TreeNode[];\n  metadata: Record<string, any>;\n  embedding?: number[];\n}\n\n/**\n * Build hierarchical document tree\n */\nexport async function buildDocumentTree(documentId: string): Promise<DocumentTree> {\n  const document = await db.document.findUnique({\n    where: { id: documentId },\n    include: {\n      chunks: {\n        orderBy: { chunkOrder: \"asc\" },\n      },\n    },\n  });\n\n  if (!document) {\n    throw new Error(\"Document not found\");\n  }\n\n  // Build tree structure\n  const root: TreeNode = {\n    id: document.id,\n    content: document.title,\n    type: \"document\",\n    children: [],\n    metadata: document.metadata as Record<string, any>,\n  };\n\n  // Group chunks by section path\n  const sectionMap = new Map<string, TreeNode>();\n\n  for (const chunk of document.chunks) {\n    const sectionPath = (chunk.metadata as any)?.sectionPath || chunk.sectionPath || \"root\";\n\n    // Get or create section node\n    if (!sectionMap.has(sectionPath)) {\n      const sectionNode: TreeNode = {\n        id: `${documentId}::${sectionPath}`,\n        content: sectionPath,\n        type: \"section\",\n        children: [],\n        metadata: { path: sectionPath },\n      };\n      sectionMap.set(sectionPath, sectionNode);\n      root.children.push(sectionNode);\n    }\n\n    // Add chunk to section\n    const section = sectionMap.get(sectionPath)!;\n    section.children.push({\n      id: chunk.id,\n      content: chunk.content,\n      type: \"chunk\",\n      children: [],\n      metadata: chunk.metadata as Record<string, any>,\n      embedding: chunk.embedding as any,\n    });\n  }\n\n  return {\n    root,\n    depth: calculateDepth(root),\n    nodeCount: countNodes(root),\n  };\n}\n\nfunction calculateDepth(node: TreeNode): number {\n  if (node.children.length === 0) return 1;\n  return 1 + Math.max(...node.children.map(calculateDepth));\n}\n\nfunction countNodes(node: TreeNode): number {\n  return 1 + node.children.reduce((sum, child) => sum + countNodes(child), 0);\n}\n\n/**\n * Oracle search - Tree-guided retrieval\n */\nexport async function oracleSearch(params: {\n  query: string;\n  projectId: string;\n  topK?: number;\n  maxDepth?: number;\n}): Promise<Array<{ content: string; path: string; relevance: number }>> {\n  const { query, projectId, topK = 5, maxDepth = 3 } = params;\n\n  console.log(`🔮 Oracle search: \"${query}\"`);\n\n  // Step 1: Embed query\n  const queryEmbedding = await embedSingle(query);\n\n  // Step 2: Find relevant documents\n  const documents = await db.document.findMany({\n    where: { projectId },\n    take: 10,\n  });\n\n  const results: Array<{ content: string; path: string; relevance: number }> = [];\n\n  // Step 3: For each document, traverse tree\n  for (const doc of documents) {\n    const tree = await buildDocumentTree(doc.id);\n\n    // Guided traversal\n    const traversalResults = await guidedTraversal({\n      tree,\n      query,\n      queryEmbedding,\n      maxDepth,\n      topK,\n    });\n\n    results.push(...traversalResults);\n  }\n\n  // Step 4: Sort by relevance and return top K\n  results.sort((a, b) => b.relevance - a.relevance);\n\n  return results.slice(0, topK);\n}\n\n/**\n * Guided tree traversal - intelligently navigate document structure\n */\nasync function guidedTraversal(params: {\n  tree: DocumentTree;\n  query: string;\n  queryEmbedding: number[];\n  maxDepth: number;\n  topK: number;\n  currentNode?: TreeNode;\n  currentDepth?: number;\n  path?: string;\n}): Promise<Array<{ content: string; path: string; relevance: number }>> {\n  const {\n    tree,\n    query,\n    queryEmbedding,\n    maxDepth,\n    topK,\n    currentNode = tree.root,\n    currentDepth = 0,\n    path = \"\",\n  } = params;\n\n  const results: Array<{ content: string; path: string; relevance: number }> = [];\n\n  // Stop if max depth reached\n  if (currentDepth >= maxDepth) {\n    return results;\n  }\n\n  // Leaf node - calculate relevance\n  if (currentNode.type === \"chunk\") {\n    const relevance = currentNode.embedding\n      ? cosineSimilarity(queryEmbedding, currentNode.embedding)\n      : 0;\n\n    if (relevance > 0.3) {\n      // Threshold\n      results.push({\n        content: currentNode.content,\n        path,\n        relevance,\n      });\n    }\n\n    return results;\n  }\n\n  // Internal node - decide which children to explore\n  const childScores = await Promise.all(\n    currentNode.children.map(async (child) => {\n      // Score child based on content relevance\n      const score = await scoreNode(child, query, queryEmbedding);\n      return { child, score };\n    })\n  );\n\n  // Sort by score and explore top children\n  childScores.sort((a, b) => b.score - a.score);\n  const topChildren = childScores.slice(0, Math.min(3, childScores.length)); // Explore top 3\n\n  for (const { child, score } of topChildren) {\n    if (score > 0.2) {\n      // Threshold for exploration\n      const childPath = path ? `${path} > ${child.content.substring(0, 30)}` : child.content;\n\n      const childResults = await guidedTraversal({\n        tree,\n        query,\n        queryEmbedding,\n        maxDepth,\n        topK,\n        currentNode: child,\n        currentDepth: currentDepth + 1,\n        path: childPath,\n      });\n\n      results.push(...childResults);\n    }\n  }\n\n  return results;\n}\n\n/**\n * Score a tree node for relevance\n */\nasync function scoreNode(\n  node: TreeNode,\n  query: string,\n  queryEmbedding: number[]\n): Promise<number> {\n  // If node has embedding, use it\n  if (node.embedding) {\n    return cosineSimilarity(queryEmbedding, node.embedding);\n  }\n\n  // Otherwise, use simple keyword matching\n  const queryWords = query.toLowerCase().split(/\\s+/);\n  const nodeWords = node.content.toLowerCase().split(/\\s+/);\n\n  const overlap = queryWords.filter((w) => nodeWords.includes(w)).length;\n  return overlap / queryWords.length;\n}\n\n/**\n * Cosine similarity between two vectors\n */\nfunction cosineSimilarity(a: number[], b: number[]): number {\n  if (a.length !== b.length) return 0;\n\n  let dotProduct = 0;\n  let normA = 0;\n  let normB = 0;\n\n  for (let i = 0; i < a.length; i++) {\n    dotProduct += a[i] * b[i];\n    normA += a[i] * a[i];\n    normB += b[i] * b[i];\n  }\n\n  return dotProduct / (Math.sqrt(normA) * Math.sqrt(normB));\n}\n\n/**\n * Oracle research - Multi-step reasoning\n */\nexport async function oracleResearch(params: {\n  question: string;\n  projectId: string;\n  maxSteps?: number;\n}): Promise<{\n  answer: string;\n  steps: Array<{\n    step: number;\n    query: string;\n    results: any[];\n    reasoning: string;\n  }>;\n}> {\n  const { question, projectId, maxSteps = 5 } = params;\n\n  const steps: any[] = [];\n  let currentQuery = question;\n\n  for (let step = 1; step <= maxSteps; step++) {\n    console.log(`🔮 Oracle step ${step}: ${currentQuery}`);\n\n    // Search\n    const results = await oracleSearch({\n      query: currentQuery,\n      projectId,\n      topK: 5,\n    });\n\n    // Reason about results\n    const reasoning = await reasonAboutResults(currentQuery, results, question);\n\n    steps.push({\n      step,\n      query: currentQuery,\n      results,\n      reasoning: reasoning.thought,\n    });\n\n    // If we have enough information, stop\n    if (reasoning.hasAnswer) {\n      return {\n        answer: reasoning.answer,\n        steps,\n      };\n    }\n\n    // Generate next query\n    currentQuery = reasoning.nextQuery || question;\n  }\n\n  // Final synthesis\n  const finalAnswer = await synthesizeAnswer(question, steps);\n\n  return {\n    answer: finalAnswer,\n    steps,\n  };\n}\n\n/**\n * Reason about search results using LLM\n */\nasync function reasonAboutResults(\n  query: string,\n  results: any[],\n  originalQuestion: string\n): Promise<{\n  thought: string;\n  hasAnswer: boolean;\n  answer?: string;\n  nextQuery?: string;\n}> {\n  const prompt = `You are analyzing search results to answer a question.\n\n**Original question:** ${originalQuestion}\n**Current query:** ${query}\n\n**Search results:**\n${results.map((r, i) => `${i + 1}. ${r.content} (relevance: ${r.relevance.toFixed(2)})`).join(\"\\n\")}\n\nAnalyze these results:\n1. Do they answer the original question?\n2. What information is still missing?\n3. What should be the next search query?\n\nReturn JSON:\n{\n  \"thought\": \"your analysis\",\n  \"hasAnswer\": true or false,\n  \"answer\": \"the answer if you have it\" or null,\n  \"nextQuery\": \"next search query\" or null\n}`;\n\n  const response = await anthropic.messages.create({\n    model: \"claude-sonnet-4.5\",\n    max_tokens: 1024,\n    temperature: 0.0,\n    messages: [{ role: \"user\", content: prompt }],\n  });\n\n  const text = response.content.find((c) => c.type === \"text\");\n  if (!text || text.type !== \"text\") {\n    return {\n      thought: \"Analysis failed\",\n      hasAnswer: false,\n    };\n  }\n\n  const jsonMatch = text.text.match(/```json\\n?([\\s\\S]*?)\\n?```/) || text.text.match(/\\{[\\s\\S]*\\}/);\n  const jsonStr = jsonMatch ? (jsonMatch[1] || jsonMatch[0]) : text.text;\n\n  return JSON.parse(jsonStr);\n}\n\n/**\n * Synthesize final answer from all steps\n */\nasync function synthesizeAnswer(question: string, steps: any[]): Promise<string> {\n  const prompt = `Synthesize a final answer from multiple research steps.\n\n**Question:** ${question}\n\n**Research steps:**\n${steps.map((s) => `Step ${s.step}: ${s.query}\\n  ${s.reasoning}`).join(\"\\n\\n\")}\n\nProvide a comprehensive answer based on all the information gathered.`;\n\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 text = response.content.find((c) => c.type === \"text\");\n  return text && text.type === \"text\" ? text.text : \"Unable to synthesize answer\";\n}\n"],"mappings":";;;;;;AAKA,OAAO,eAAe;AAItB,IAAM,YAAY,IAAI,UAAU;AAAA,EAC9B,QAAQ,QAAQ,IAAI,qBAAqB;AAC3C,CAAC;AAoBD,eAAsB,kBAAkB,YAA2C;AACjF,QAAM,WAAW,MAAM,GAAG,SAAS,WAAW;AAAA,IAC5C,OAAO,EAAE,IAAI,WAAW;AAAA,IACxB,SAAS;AAAA,MACP,QAAQ;AAAA,QACN,SAAS,EAAE,YAAY,MAAM;AAAA,MAC/B;AAAA,IACF;AAAA,EACF,CAAC;AAED,MAAI,CAAC,UAAU;AACb,UAAM,IAAI,MAAM,oBAAoB;AAAA,EACtC;AAGA,QAAM,OAAiB;AAAA,IACrB,IAAI,SAAS;AAAA,IACb,SAAS,SAAS;AAAA,IAClB,MAAM;AAAA,IACN,UAAU,CAAC;AAAA,IACX,UAAU,SAAS;AAAA,EACrB;AAGA,QAAM,aAAa,oBAAI,IAAsB;AAE7C,aAAW,SAAS,SAAS,QAAQ;AACnC,UAAM,cAAe,MAAM,UAAkB,eAAe,MAAM,eAAe;AAGjF,QAAI,CAAC,WAAW,IAAI,WAAW,GAAG;AAChC,YAAM,cAAwB;AAAA,QAC5B,IAAI,GAAG,UAAU,KAAK,WAAW;AAAA,QACjC,SAAS;AAAA,QACT,MAAM;AAAA,QACN,UAAU,CAAC;AAAA,QACX,UAAU,EAAE,MAAM,YAAY;AAAA,MAChC;AACA,iBAAW,IAAI,aAAa,WAAW;AACvC,WAAK,SAAS,KAAK,WAAW;AAAA,IAChC;AAGA,UAAM,UAAU,WAAW,IAAI,WAAW;AAC1C,YAAQ,SAAS,KAAK;AAAA,MACpB,IAAI,MAAM;AAAA,MACV,SAAS,MAAM;AAAA,MACf,MAAM;AAAA,MACN,UAAU,CAAC;AAAA,MACX,UAAU,MAAM;AAAA,MAChB,WAAW,MAAM;AAAA,IACnB,CAAC;AAAA,EACH;AAEA,SAAO;AAAA,IACL;AAAA,IACA,OAAO,eAAe,IAAI;AAAA,IAC1B,WAAW,WAAW,IAAI;AAAA,EAC5B;AACF;AAEA,SAAS,eAAe,MAAwB;AAC9C,MAAI,KAAK,SAAS,WAAW,EAAG,QAAO;AACvC,SAAO,IAAI,KAAK,IAAI,GAAG,KAAK,SAAS,IAAI,cAAc,CAAC;AAC1D;AAEA,SAAS,WAAW,MAAwB;AAC1C,SAAO,IAAI,KAAK,SAAS,OAAO,CAAC,KAAK,UAAU,MAAM,WAAW,KAAK,GAAG,CAAC;AAC5E;AAKA,eAAsB,aAAa,QAKsC;AACvE,QAAM,EAAE,OAAO,WAAW,OAAO,GAAG,WAAW,EAAE,IAAI;AAErD,UAAQ,IAAI,6BAAsB,KAAK,GAAG;AAG1C,QAAM,iBAAiB,MAAM,YAAY,KAAK;AAG9C,QAAM,YAAY,MAAM,GAAG,SAAS,SAAS;AAAA,IAC3C,OAAO,EAAE,UAAU;AAAA,IACnB,MAAM;AAAA,EACR,CAAC;AAED,QAAM,UAAuE,CAAC;AAG9E,aAAW,OAAO,WAAW;AAC3B,UAAM,OAAO,MAAM,kBAAkB,IAAI,EAAE;AAG3C,UAAM,mBAAmB,MAAM,gBAAgB;AAAA,MAC7C;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF,CAAC;AAED,YAAQ,KAAK,GAAG,gBAAgB;AAAA,EAClC;AAGA,UAAQ,KAAK,CAAC,GAAG,MAAM,EAAE,YAAY,EAAE,SAAS;AAEhD,SAAO,QAAQ,MAAM,GAAG,IAAI;AAC9B;AAKA,eAAe,gBAAgB,QAS0C;AACvE,QAAM;AAAA,IACJ;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,cAAc,KAAK;AAAA,IACnB,eAAe;AAAA,IACf,OAAO;AAAA,EACT,IAAI;AAEJ,QAAM,UAAuE,CAAC;AAG9E,MAAI,gBAAgB,UAAU;AAC5B,WAAO;AAAA,EACT;AAGA,MAAI,YAAY,SAAS,SAAS;AAChC,UAAM,YAAY,YAAY,YAC1B,iBAAiB,gBAAgB,YAAY,SAAS,IACtD;AAEJ,QAAI,YAAY,KAAK;AAEnB,cAAQ,KAAK;AAAA,QACX,SAAS,YAAY;AAAA,QACrB;AAAA,QACA;AAAA,MACF,CAAC;AAAA,IACH;AAEA,WAAO;AAAA,EACT;AAGA,QAAM,cAAc,MAAM,QAAQ;AAAA,IAChC,YAAY,SAAS,IAAI,OAAO,UAAU;AAExC,YAAM,QAAQ,MAAM,UAAU,OAAO,OAAO,cAAc;AAC1D,aAAO,EAAE,OAAO,MAAM;AAAA,IACxB,CAAC;AAAA,EACH;AAGA,cAAY,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK;AAC5C,QAAM,cAAc,YAAY,MAAM,GAAG,KAAK,IAAI,GAAG,YAAY,MAAM,CAAC;AAExE,aAAW,EAAE,OAAO,MAAM,KAAK,aAAa;AAC1C,QAAI,QAAQ,KAAK;AAEf,YAAM,YAAY,OAAO,GAAG,IAAI,MAAM,MAAM,QAAQ,UAAU,GAAG,EAAE,CAAC,KAAK,MAAM;AAE/E,YAAM,eAAe,MAAM,gBAAgB;AAAA,QACzC;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA,aAAa;AAAA,QACb,cAAc,eAAe;AAAA,QAC7B,MAAM;AAAA,MACR,CAAC;AAED,cAAQ,KAAK,GAAG,YAAY;AAAA,IAC9B;AAAA,EACF;AAEA,SAAO;AACT;AAKA,eAAe,UACb,MACA,OACA,gBACiB;AAEjB,MAAI,KAAK,WAAW;AAClB,WAAO,iBAAiB,gBAAgB,KAAK,SAAS;AAAA,EACxD;AAGA,QAAM,aAAa,MAAM,YAAY,EAAE,MAAM,KAAK;AAClD,QAAM,YAAY,KAAK,QAAQ,YAAY,EAAE,MAAM,KAAK;AAExD,QAAM,UAAU,WAAW,OAAO,CAAC,MAAM,UAAU,SAAS,CAAC,CAAC,EAAE;AAChE,SAAO,UAAU,WAAW;AAC9B;AAKA,SAAS,iBAAiB,GAAa,GAAqB;AAC1D,MAAI,EAAE,WAAW,EAAE,OAAQ,QAAO;AAElC,MAAI,aAAa;AACjB,MAAI,QAAQ;AACZ,MAAI,QAAQ;AAEZ,WAAS,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK;AACjC,kBAAc,EAAE,CAAC,IAAI,EAAE,CAAC;AACxB,aAAS,EAAE,CAAC,IAAI,EAAE,CAAC;AACnB,aAAS,EAAE,CAAC,IAAI,EAAE,CAAC;AAAA,EACrB;AAEA,SAAO,cAAc,KAAK,KAAK,KAAK,IAAI,KAAK,KAAK,KAAK;AACzD;AAKA,eAAsB,eAAe,QAYlC;AACD,QAAM,EAAE,UAAU,WAAW,WAAW,EAAE,IAAI;AAE9C,QAAM,QAAe,CAAC;AACtB,MAAI,eAAe;AAEnB,WAAS,OAAO,GAAG,QAAQ,UAAU,QAAQ;AAC3C,YAAQ,IAAI,yBAAkB,IAAI,KAAK,YAAY,EAAE;AAGrD,UAAM,UAAU,MAAM,aAAa;AAAA,MACjC,OAAO;AAAA,MACP;AAAA,MACA,MAAM;AAAA,IACR,CAAC;AAGD,UAAM,YAAY,MAAM,mBAAmB,cAAc,SAAS,QAAQ;AAE1E,UAAM,KAAK;AAAA,MACT;AAAA,MACA,OAAO;AAAA,MACP;AAAA,MACA,WAAW,UAAU;AAAA,IACvB,CAAC;AAGD,QAAI,UAAU,WAAW;AACvB,aAAO;AAAA,QACL,QAAQ,UAAU;AAAA,QAClB;AAAA,MACF;AAAA,IACF;AAGA,mBAAe,UAAU,aAAa;AAAA,EACxC;AAGA,QAAM,cAAc,MAAM,iBAAiB,UAAU,KAAK;AAE1D,SAAO;AAAA,IACL,QAAQ;AAAA,IACR;AAAA,EACF;AACF;AAKA,eAAe,mBACb,OACA,SACA,kBAMC;AACD,QAAM,SAAS;AAAA;AAAA,yBAEQ,gBAAgB;AAAA,qBACpB,KAAK;AAAA;AAAA;AAAA,EAGxB,QAAQ,IAAI,CAAC,GAAG,MAAM,GAAG,IAAI,CAAC,KAAK,EAAE,OAAO,gBAAgB,EAAE,UAAU,QAAQ,CAAC,CAAC,GAAG,EAAE,KAAK,IAAI,CAAC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAejG,QAAM,WAAW,MAAM,UAAU,SAAS,OAAO;AAAA,IAC/C,OAAO;AAAA,IACP,YAAY;AAAA,IACZ,aAAa;AAAA,IACb,UAAU,CAAC,EAAE,MAAM,QAAQ,SAAS,OAAO,CAAC;AAAA,EAC9C,CAAC;AAED,QAAM,OAAO,SAAS,QAAQ,KAAK,CAAC,MAAM,EAAE,SAAS,MAAM;AAC3D,MAAI,CAAC,QAAQ,KAAK,SAAS,QAAQ;AACjC,WAAO;AAAA,MACL,SAAS;AAAA,MACT,WAAW;AAAA,IACb;AAAA,EACF;AAEA,QAAM,YAAY,KAAK,KAAK,MAAM,4BAA4B,KAAK,KAAK,KAAK,MAAM,aAAa;AAChG,QAAM,UAAU,YAAa,UAAU,CAAC,KAAK,UAAU,CAAC,IAAK,KAAK;AAElE,SAAO,KAAK,MAAM,OAAO;AAC3B;AAKA,eAAe,iBAAiB,UAAkB,OAA+B;AAC/E,QAAM,SAAS;AAAA;AAAA,gBAED,QAAQ;AAAA;AAAA;AAAA,EAGtB,MAAM,IAAI,CAAC,MAAM,QAAQ,EAAE,IAAI,KAAK,EAAE,KAAK;AAAA,IAAO,EAAE,SAAS,EAAE,EAAE,KAAK,MAAM,CAAC;AAAA;AAAA;AAI7E,QAAM,WAAW,MAAM,UAAU,SAAS,OAAO;AAAA,IAC/C,OAAO;AAAA,IACP,YAAY;AAAA,IACZ,aAAa;AAAA,IACb,UAAU,CAAC,EAAE,MAAM,QAAQ,SAAS,OAAO,CAAC;AAAA,EAC9C,CAAC;AAED,QAAM,OAAO,SAAS,QAAQ,KAAK,CAAC,MAAM,EAAE,SAAS,MAAM;AAC3D,SAAO,QAAQ,KAAK,SAAS,SAAS,KAAK,OAAO;AACpD;","names":[]}

package/dist/search-BLVHWLWC.js

@@ -0,0 +1,14 @@
+import {
+  getSessionMemories,
+  getUserProfile,
+  searchMemories
+} from "./chunk-B3VWOHUA.js";
+import "./chunk-5KIJNY6Z.js";
+import "./chunk-3WGYBAYR.js";
+import "./chunk-H3HSKH2P.js";
+import "./chunk-QGM4M3NI.js";
+export {
+  getSessionMemories,
+  getUserProfile,
+  searchMemories
+};

package/dist/search-CZ5NYL5B.js

@@ -0,0 +1,13 @@
+import {
+  getSessionMemories,
+  getUserProfile,
+  searchMemories
+} from "./chunk-OBLI4FE4.js";
+import "./chunk-UYWE7HSU.js";
+import "./chunk-X2DL2GWT.js";
+export {
+  getSessionMemories,
+  getUserProfile,
+  searchMemories
+};
+//# sourceMappingURL=search-CZ5NYL5B.js.map

package/dist/search-CZ5NYL5B.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":[],"sourcesContent":[],"mappings":"","names":[]}

package/dist/search-EG6TYWWW.js

@@ -0,0 +1,13 @@
+import {
+  getSessionMemories,
+  getUserProfile,
+  searchMemories
+} from "./chunk-T7KMSTWP.js";
+import "./chunk-5KBZQHDL.js";
+import "./chunk-3WGYBAYR.js";
+import "./chunk-QGM4M3NI.js";
+export {
+  getSessionMemories,
+  getUserProfile,
+  searchMemories
+};

package/dist/search-I22QQA7T.js

@@ -0,0 +1,13 @@
+import {
+  getSessionMemories,
+  getUserProfile,
+  searchMemories
+} from "./chunk-PPGYJJED.js";
+import "./chunk-LMEYV4JD.js";
+import "./chunk-3WGYBAYR.js";
+import "./chunk-QGM4M3NI.js";
+export {
+  getSessionMemories,
+  getUserProfile,
+  searchMemories
+};

package/dist/search-T7H5G6DW.js

@@ -0,0 +1,13 @@
+import {
+  getSessionMemories,
+  getUserProfile,
+  searchMemories
+} from "./chunk-TWEIYHI6.js";
+import "./chunk-5KBZQHDL.js";
+import "./chunk-MEFLJ4PV.js";
+import "./chunk-QGM4M3NI.js";
+export {
+  getSessionMemories,
+  getUserProfile,
+  searchMemories
+};

package/dist/server.d.ts

@@ -0,0 +1,2 @@
+
+export {  }