mcp-researchpowerpack 3.9.4 → 4.3.0

package/dist/src/utils/url-aggregator.js

@@ -0,0 +1,227 @@
+import { CTR_WEIGHTS } from "../config/index.js";
+const WEB_CONSENSUS_THRESHOLD = 3;
+const MIN_BEYOND_TOP10_WEIGHT = 0;
+const BEYOND_TOP10_DECAY = 0.5;
+const BEYOND_TOP10_BASE = 10;
+const DEFAULT_MIN_CONSENSUS_URLS = 5;
+const HIGH_CONSENSUS_THRESHOLD = 4;
+const MAX_ALT_SNIPPETS = 3;
+const MAX_CONSISTENCY_PENALTY = 0.15;
+const CONSISTENCY_STDDEV_SCALE = 5;
+function computePositionStats(positions) {
+  if (positions.length <= 1) {
+    return { mean: positions[0] ?? 0, stdDev: 0, consistencyMultiplier: 1 };
+  }
+  const mean = positions.reduce((a, b) => a + b, 0) / positions.length;
+  const variance = positions.reduce((sum, p) => sum + (p - mean) ** 2, 0) / (positions.length - 1);
+  const stdDev = Math.sqrt(variance);
+  const consistencyMultiplier = 1 - MAX_CONSISTENCY_PENALTY * Math.min(stdDev / CONSISTENCY_STDDEV_SCALE, 1);
+  return { mean, stdDev, consistencyMultiplier };
+}
+function getCtrWeight(position) {
+  if (position >= 1 && position <= 10) {
+    return CTR_WEIGHTS[position] ?? 0;
+  }
+  return Math.max(MIN_BEYOND_TOP10_WEIGHT, BEYOND_TOP10_BASE - (position - BEYOND_TOP10_BASE) * BEYOND_TOP10_DECAY);
+}
+function aggregateResults(searches) {
+  const urlMap = /* @__PURE__ */ new Map();
+  for (const search of searches) {
+    for (const result of search.results) {
+      const normalizedUrl = normalizeUrl(result.link);
+      const existing = urlMap.get(normalizedUrl);
+      if (existing) {
+        existing.frequency += 1;
+        existing.positions.push(result.position);
+        existing.queries.push(search.query);
+        const prevBest = existing.bestPosition;
+        existing.bestPosition = Math.min(existing.bestPosition, result.position);
+        existing.totalScore += getCtrWeight(result.position);
+        if (result.snippet && existing.allSnippets.length < MAX_ALT_SNIPPETS && !existing.allSnippets.some((s) => s === result.snippet)) {
+          existing.allSnippets.push(result.snippet);
+        }
+        if (result.position < prevBest) {
+          existing.title = result.title;
+          existing.snippet = result.snippet;
+        }
+      } else {
+        urlMap.set(normalizedUrl, {
+          url: result.link,
+          title: result.title,
+          snippet: result.snippet,
+          allSnippets: result.snippet ? [result.snippet] : [],
+          frequency: 1,
+          positions: [result.position],
+          queries: [search.query],
+          bestPosition: result.position,
+          totalScore: getCtrWeight(result.position)
+        });
+      }
+    }
+  }
+  return urlMap;
+}
+function normalizeUrl(url) {
+  try {
+    const parsed = new URL(url);
+    let host = parsed.hostname.replace(/^www\./, "");
+    let path = parsed.pathname.replace(/\/$/, "") || "/";
+    return `${host}${path}${parsed.search}`.toLowerCase();
+  } catch {
+    return url.toLowerCase().replace(/\/$/, "");
+  }
+}
+function countByFrequency(urlMap, minFrequency) {
+  let count = 0;
+  for (const url of urlMap.values()) {
+    if (url.frequency >= minFrequency) count++;
+  }
+  return count;
+}
+function calculateWeightedScores(urls, consensusThreshold, totalQueries) {
+  if (urls.length === 0) return [];
+  const scored = urls.map((url) => {
+    const stats = computePositionStats(url.positions);
+    const compositeScore = url.totalScore * stats.consistencyMultiplier;
+    return { url, compositeScore, stats };
+  });
+  scored.sort((a, b) => b.compositeScore - a.compositeScore);
+  const maxScore = scored[0].compositeScore;
+  return scored.map(({ url, compositeScore, stats }, index) => ({
+    url: url.url,
+    title: url.title,
+    snippet: url.snippet,
+    allSnippets: url.allSnippets,
+    rank: index + 1,
+    score: maxScore > 0 ? compositeScore / maxScore * 100 : 0,
+    frequency: url.frequency,
+    positions: url.positions,
+    queries: url.queries,
+    bestPosition: url.bestPosition,
+    isConsensus: url.frequency >= consensusThreshold,
+    coverageRatio: totalQueries > 0 ? url.frequency / totalQueries : 0,
+    positionStdDev: stats.stdDev,
+    consistencyMultiplier: stats.consistencyMultiplier
+  }));
+}
+const COVERAGE_TABLE_MAX_ROWS = 20;
+function consistencyLabel(stdDev, frequency) {
+  if (frequency <= 1) return "n/a";
+  if (stdDev < 1.5) return "high";
+  if (stdDev < 3.5) return "medium";
+  return "variable";
+}
+function generateUnifiedOutput(rankedUrls, allQueries, queryResults, totalUniqueUrls, frequencyThreshold, thresholdNote, verbose = false) {
+  const lines = [];
+  const consensusCount = rankedUrls.filter((u) => u.isConsensus).length;
+  lines.push(`## Web Search Results (${allQueries.length} queries, ${totalUniqueUrls} unique URLs)`);
+  lines.push("");
+  if (thresholdNote) {
+    lines.push(`> ${thresholdNote}`);
+    lines.push("");
+  }
+  const consensusActive = frequencyThreshold > 1;
+  for (const url of rankedUrls) {
+    const consensusTag = consensusActive && url.frequency >= HIGH_CONSENSUS_THRESHOLD ? " CONSENSUS+++" : consensusActive && url.isConsensus ? " CONSENSUS" : "";
+    const coveragePct = Math.round(url.coverageRatio * 100);
+    const consistency = consistencyLabel(url.positionStdDev, url.frequency);
+    lines.push(`**${url.rank}. [${url.title}](${url.url})**${consensusTag}`);
+    const showRowMetadata = verbose || allQueries.length > 1 && url.frequency > 1 || allQueries.length === 1;
+    if (showRowMetadata) {
+      const parts = [
+        `Score: ${url.score.toFixed(1)}`,
+        `Seen in: ${url.frequency}/${allQueries.length} queries (${coveragePct}%)`,
+        `Best pos: #${url.bestPosition}`
+      ];
+      if (url.frequency > 1) {
+        parts.push(`Consistency: ${consistency}`);
+      }
+      lines.push(parts.join(" | "));
+    }
+    if (url.queries.length > 1 || verbose) {
+      lines.push(`Queries: ${url.queries.map((q) => `"${q}"`).join(", ")}`);
+    }
+    lines.push(`> ${url.snippet}`);
+    if (url.allSnippets.length > 1) {
+      const alts = url.allSnippets.filter((s) => s !== url.snippet).slice(0, 3).map((s) => s.length > 100 ? s.slice(0, 97) + "..." : s);
+      if (alts.length > 0) {
+        lines.push(`Alt: ${alts.map((s) => `"${s}"`).join(" | ")}`);
+      }
+    }
+    lines.push("");
+  }
+  lines.push("---");
+  if (allQueries.length <= COVERAGE_TABLE_MAX_ROWS) {
+    lines.push("### Query Coverage");
+    lines.push("| Query | Results | Top URL | Top Pos |");
+    lines.push("|---------|---------|---------|---------|");
+    for (const search of queryResults) {
+      const topResult = search.results[0];
+      let topDomain = "";
+      if (topResult) {
+        try {
+          topDomain = new URL(topResult.link).hostname.replace(/^www\./, "");
+        } catch {
+          topDomain = topResult.link;
+        }
+      }
+      lines.push(`| "${search.query}" | ${search.results.length} | ${topDomain || "\u2014"} | ${topResult ? `#${topResult.position}` : "\u2014"} |`);
+    }
+    lines.push("");
+  } else {
+    const goodCount = queryResults.filter((s) => s.results.length >= 3).length;
+    lines.push(`### Query Coverage: ${goodCount}/${allQueries.length} queries returned 3+ results`);
+    lines.push("");
+  }
+  const lowYield = queryResults.filter((s) => s.results.length <= 1);
+  if (lowYield.length > 0) {
+    lines.push(`**Low-yield queries** (0-1 results): ${lowYield.map((s) => `\`${s.query}\``).join(", ")}`);
+    lines.push("");
+  }
+  const allRelated = /* @__PURE__ */ new Set();
+  for (const search of queryResults) {
+    if (search.related) {
+      for (const r of search.related) {
+        allRelated.add(r);
+      }
+    }
+  }
+  if (allRelated.size > 0) {
+    const related = [...allRelated].slice(0, 10);
+    lines.push(`**Related searches:** ${related.map((r) => `\`${r}\``).join(", ")}`);
+    lines.push("");
+  }
+  return lines.join("\n");
+}
+function aggregateAndRank(searches, minConsensusUrls = DEFAULT_MIN_CONSENSUS_URLS) {
+  const urlMap = aggregateResults(searches);
+  const totalUniqueUrls = urlMap.size;
+  const totalQueries = searches.length;
+  const thresholds = [3, 2, 1];
+  let usedThreshold = 1;
+  let thresholdNote;
+  for (const threshold of thresholds) {
+    const count = countByFrequency(urlMap, threshold);
+    if (count >= minConsensusUrls || threshold === 1) {
+      usedThreshold = threshold;
+      if (threshold < 3) {
+        thresholdNote = `Note: Consensus threshold set to \u2265${threshold} due to result diversity.`;
+      }
+      break;
+    }
+  }
+  const allUrls = [...urlMap.values()];
+  const rankedUrls = calculateWeightedScores(allUrls, usedThreshold, totalQueries);
+  return {
+    rankedUrls,
+    totalUniqueUrls,
+    totalQueries,
+    frequencyThreshold: usedThreshold,
+    thresholdNote
+  };
+}
+export {
+  aggregateAndRank,
+  generateUnifiedOutput
+};
+//# sourceMappingURL=url-aggregator.js.map

package/dist/src/utils/url-aggregator.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../../src/utils/url-aggregator.ts"],
+  "sourcesContent": ["/**\n * URL Aggregator Utility\n * Aggregates search results across multiple queries, calculates CTR-weighted scores,\n * and generates consensus-based rankings.\n */\n\nimport { CTR_WEIGHTS } from '../config/index.js';\nimport type { QuerySearchResult } from '../clients/search.js';\n\n/** Minimum frequency for web search consensus marking */\nconst WEB_CONSENSUS_THRESHOLD = 3 as const;\n\n\n/** Minimum weight assigned to positions beyond top 10 */\nconst MIN_BEYOND_TOP10_WEIGHT = 0 as const;\n\n/** Weight decay per position beyond top 10 */\nconst BEYOND_TOP10_DECAY = 0.5 as const;\n\n/** Base position for beyond-top-10 weight calculation */\nconst BEYOND_TOP10_BASE = 10 as const;\n\n/** Default minimum consensus URLs before lowering threshold (web search) */\nconst DEFAULT_MIN_CONSENSUS_URLS = 5 as const;\n\n/** High consensus frequency threshold for enhanced output labeling */\nconst HIGH_CONSENSUS_THRESHOLD = 4 as const;\n\n/** Maximum number of alternative snippets to retain per URL */\nconst MAX_ALT_SNIPPETS = 3 as const;\n\n/** Consistency penalty cap \u2014 bounds the impact of position variance */\nconst MAX_CONSISTENCY_PENALTY = 0.15 as const;\n\n/** Standard deviation normalizer \u2014 stdDev of 5+ gets full penalty */\nconst CONSISTENCY_STDDEV_SCALE = 5 as const;\n\n/**\n * Aggregated URL data structure\n */\ninterface AggregatedUrl {\n  readonly url: string;\n  title: string;\n  snippet: string;\n  readonly allSnippets: string[];\n  frequency: number;\n  readonly positions: number[];\n  readonly queries: string[];\n  bestPosition: number;\n  totalScore: number;\n}\n\n/**\n * Compute position statistics for consistency scoring\n */\nfunction computePositionStats(positions: number[]): { mean: number; stdDev: number; consistencyMultiplier: number } {\n  if (positions.length <= 1) {\n    return { mean: positions[0] ?? 0, stdDev: 0, consistencyMultiplier: 1.0 };\n  }\n  const mean = positions.reduce((a, b) => a + b, 0) / positions.length;\n  const variance = positions.reduce((sum, p) => sum + (p - mean) ** 2, 0) / (positions.length - 1);\n  const stdDev = Math.sqrt(variance);\n  const consistencyMultiplier = 1.0 - MAX_CONSISTENCY_PENALTY * Math.min(stdDev / CONSISTENCY_STDDEV_SCALE, 1.0);\n  return { mean, stdDev, consistencyMultiplier };\n}\n\n/**\n * Ranked URL with normalized score and enriched signals\n */\ninterface RankedUrl {\n  readonly url: string;\n  readonly title: string;\n  readonly snippet: string;\n  readonly allSnippets: string[];\n  readonly rank: number;\n  readonly score: number;\n  readonly frequency: number;\n  readonly positions: number[];\n  readonly queries: string[];\n  readonly bestPosition: number;\n  readonly isConsensus: boolean;\n  readonly coverageRatio: number;\n  readonly positionStdDev: number;\n  readonly consistencyMultiplier: number;\n}\n\n/**\n * Aggregation result containing all processed data\n */\ninterface AggregationResult {\n  readonly rankedUrls: RankedUrl[];\n  readonly totalUniqueUrls: number;\n  readonly totalQueries: number;\n  readonly frequencyThreshold: number;\n  readonly thresholdNote?: string;\n}\n\n/**\n * Get CTR weight for a position (1-10)\n * Positions beyond 10 get minimal weight\n */\nfunction getCtrWeight(position: number): number {\n  if (position >= 1 && position <= 10) {\n    return CTR_WEIGHTS[position] ?? 0;\n  }\n  // Positions beyond 10 get diminishing returns\n  return Math.max(MIN_BEYOND_TOP10_WEIGHT, BEYOND_TOP10_BASE - (position - BEYOND_TOP10_BASE) * BEYOND_TOP10_DECAY);\n}\n\n/**\n * Aggregate results from multiple searches\n * Flattens all results, deduplicates by URL, and tracks frequency/positions\n */\nfunction aggregateResults(searches: QuerySearchResult[]): Map<string, AggregatedUrl> {\n  const urlMap = new Map<string, AggregatedUrl>();\n\n  for (const search of searches) {\n    for (const result of search.results) {\n      const normalizedUrl = normalizeUrl(result.link);\n      const existing = urlMap.get(normalizedUrl);\n\n      if (existing) {\n        existing.frequency += 1;\n        existing.positions.push(result.position);\n        existing.queries.push(search.query);\n        const prevBest = existing.bestPosition;\n        existing.bestPosition = Math.min(existing.bestPosition, result.position);\n        existing.totalScore += getCtrWeight(result.position);\n        // Collect distinct snippets (up to MAX_ALT_SNIPPETS)\n        if (\n          result.snippet &&\n          existing.allSnippets.length < MAX_ALT_SNIPPETS &&\n          !existing.allSnippets.some(s => s === result.snippet)\n        ) {\n          existing.allSnippets.push(result.snippet);\n        }\n        // Keep best title/snippet (from highest ranking position)\n        if (result.position < prevBest) {\n          existing.title = result.title;\n          existing.snippet = result.snippet;\n        }\n      } else {\n        urlMap.set(normalizedUrl, {\n          url: result.link,\n          title: result.title,\n          snippet: result.snippet,\n          allSnippets: result.snippet ? [result.snippet] : [],\n          frequency: 1,\n          positions: [result.position],\n          queries: [search.query],\n          bestPosition: result.position,\n          totalScore: getCtrWeight(result.position),\n        });\n      }\n    }\n  }\n\n  return urlMap;\n}\n\n/**\n * Normalize URL for deduplication\n * Removes trailing slashes, www prefix, and normalizes protocol\n */\nfunction normalizeUrl(url: string): string {\n  try {\n    const parsed = new URL(url);\n    let host = parsed.hostname.replace(/^www\\./, '');\n    let path = parsed.pathname.replace(/\\/$/, '') || '/';\n    return `${host}${path}${parsed.search}`.toLowerCase();\n  } catch {\n    return url.toLowerCase().replace(/\\/$/, '');\n  }\n}\n\n/**\n * Count URLs meeting a frequency threshold\n */\nfunction countByFrequency(\n  urlMap: Map<string, AggregatedUrl>,\n  minFrequency: number\n): number {\n  let count = 0;\n  for (const url of urlMap.values()) {\n    if (url.frequency >= minFrequency) count++;\n  }\n  return count;\n}\n\n/**\n * Calculate weighted scores with consistency multiplier, normalize to 100.0.\n * Returns ALL URLs sorted by composite score with rank assignments and consensus marking.\n */\nfunction calculateWeightedScores(urls: AggregatedUrl[], consensusThreshold: number, totalQueries: number): RankedUrl[] {\n  if (urls.length === 0) return [];\n\n  // Compute composite scores (base CTR \u00D7 consistency multiplier)\n  const scored = urls.map(url => {\n    const stats = computePositionStats(url.positions);\n    const compositeScore = url.totalScore * stats.consistencyMultiplier;\n    return { url, compositeScore, stats };\n  });\n\n  // Sort by composite score descending\n  scored.sort((a, b) => b.compositeScore - a.compositeScore);\n\n  // Find max for normalization\n  const maxScore = scored[0]!.compositeScore;\n\n  // Map to ranked URLs with all signals\n  return scored.map(({ url, compositeScore, stats }, index) => ({\n    url: url.url,\n    title: url.title,\n    snippet: url.snippet,\n    allSnippets: url.allSnippets,\n    rank: index + 1,\n    score: maxScore > 0 ? (compositeScore / maxScore) * 100 : 0,\n    frequency: url.frequency,\n    positions: url.positions,\n    queries: url.queries,\n    bestPosition: url.bestPosition,\n    isConsensus: url.frequency >= consensusThreshold,\n    coverageRatio: totalQueries > 0 ? url.frequency / totalQueries : 0,\n    positionStdDev: stats.stdDev,\n    consistencyMultiplier: stats.consistencyMultiplier,\n  }));\n}\n\n/** Maximum queries to show in the coverage table before collapsing */\nconst COVERAGE_TABLE_MAX_ROWS = 20 as const;\n\n/**\n * Consistency label based on position standard deviation\n */\nfunction consistencyLabel(stdDev: number, frequency: number): string {\n  if (frequency <= 1) return 'n/a';\n  if (stdDev < 1.5) return 'high';\n  if (stdDev < 3.5) return 'medium';\n  return 'variable';\n}\n\n/**\n * Generate a unified output where every URL appears exactly once.\n * Replaces the old generateEnhancedOutput + per-query section combo.\n */\nexport function generateUnifiedOutput(\n  rankedUrls: RankedUrl[],\n  allQueries: string[],\n  queryResults: QuerySearchResult[],\n  totalUniqueUrls: number,\n  frequencyThreshold: number,\n  thresholdNote?: string,\n  verbose: boolean = false,\n): string {\n  const lines: string[] = [];\n  const consensusCount = rankedUrls.filter(u => u.isConsensus).length;\n\n  // Header\n  lines.push(`## Web Search Results (${allQueries.length} queries, ${totalUniqueUrls} unique URLs)`);\n  lines.push('');\n  if (thresholdNote) {\n    lines.push(`> ${thresholdNote}`);\n    lines.push('');\n  }\n\n  // Ranked URL list \u2014 every URL exactly once.\n  //\n  // Per-row metadata is gated:\n  // - CONSENSUS labels only appear when the effective threshold is >1 (a\n  //   threshold of 1 means *every* row gets the label, so it carries no\n  //   signal). See: docs/code-review/context/02-current-tool-surface.md.\n  // - The Score/Seen/Consistency line is suppressed for rows that were\n  //   seen in exactly one query in a multi-query call (Seen=1/N is common\n  //   and Consistency is always \"n/a\" in that case).\n  // - Verbose mode restores both for callers that explicitly want them.\n  const consensusActive = frequencyThreshold > 1;\n\n  for (const url of rankedUrls) {\n    const consensusTag = consensusActive && url.frequency >= HIGH_CONSENSUS_THRESHOLD\n      ? ' CONSENSUS+++'\n      : consensusActive && url.isConsensus\n        ? ' CONSENSUS'\n        : '';\n    const coveragePct = Math.round(url.coverageRatio * 100);\n    const consistency = consistencyLabel(url.positionStdDev, url.frequency);\n\n    lines.push(`**${url.rank}. [${url.title}](${url.url})**${consensusTag}`);\n\n    const showRowMetadata = verbose\n      || (allQueries.length > 1 && url.frequency > 1)\n      || allQueries.length === 1;\n    if (showRowMetadata) {\n      const parts = [\n        `Score: ${url.score.toFixed(1)}`,\n        `Seen in: ${url.frequency}/${allQueries.length} queries (${coveragePct}%)`,\n        `Best pos: #${url.bestPosition}`,\n      ];\n      if (url.frequency > 1) {\n        parts.push(`Consistency: ${consistency}`);\n      }\n      lines.push(parts.join(' | '));\n    }\n    if (url.queries.length > 1 || verbose) {\n      lines.push(`Queries: ${url.queries.map(q => `\"${q}\"`).join(', ')}`);\n    }\n    lines.push(`> ${url.snippet}`);\n\n    // Alt snippets (if multiple distinct snippets were collected)\n    if (url.allSnippets.length > 1) {\n      const alts = url.allSnippets\n        .filter(s => s !== url.snippet)\n        .slice(0, 3)\n        .map(s => s.length > 100 ? s.slice(0, 97) + '...' : s);\n      if (alts.length > 0) {\n        lines.push(`Alt: ${alts.map(s => `\"${s}\"`).join(' | ')}`);\n      }\n    }\n\n    lines.push('');\n  }\n\n  // Keyword coverage section\n  lines.push('---');\n\n  if (allQueries.length <= COVERAGE_TABLE_MAX_ROWS) {\n    // Full table for \u226420 queries\n    lines.push('### Query Coverage');\n    lines.push('| Query | Results | Top URL | Top Pos |');\n    lines.push('|---------|---------|---------|---------|');\n\n    for (const search of queryResults) {\n      const topResult = search.results[0];\n      let topDomain = '';\n      if (topResult) {\n        try {\n          topDomain = new URL(topResult.link).hostname.replace(/^www\\./, '');\n        } catch {\n          topDomain = topResult.link;\n        }\n      }\n      lines.push(`| \"${search.query}\" | ${search.results.length} | ${topDomain || '\u2014'} | ${topResult ? `#${topResult.position}` : '\u2014'} |`);\n    }\n    lines.push('');\n  } else {\n    // Collapsed summary for >20 queries\n    const goodCount = queryResults.filter(s => s.results.length >= 3).length;\n    lines.push(`### Query Coverage: ${goodCount}/${allQueries.length} queries returned 3+ results`);\n    lines.push('');\n  }\n\n  // Low-yield queries\n  const lowYield = queryResults.filter(s => s.results.length <= 1);\n  if (lowYield.length > 0) {\n    lines.push(`**Low-yield queries** (0-1 results): ${lowYield.map(s => `\\`${s.query}\\``).join(', ')}`);\n    lines.push('');\n  }\n\n  // Related searches (merged and deduplicated)\n  const allRelated = new Set<string>();\n  for (const search of queryResults) {\n    if (search.related) {\n      for (const r of search.related) {\n        allRelated.add(r);\n      }\n    }\n  }\n  if (allRelated.size > 0) {\n    const related = [...allRelated].slice(0, 10);\n    lines.push(`**Related searches:** ${related.map(r => `\\`${r}\\``).join(', ')}`);\n    lines.push('');\n  }\n\n  return lines.join('\\n');\n}\n\n/**\n * Full aggregation pipeline \u2014 returns ALL URLs ranked by CTR score.\n * Determines a consensus threshold (\u22653, \u22652, or \u22651) for labeling, but never\n * drops URLs below the threshold. Every collected URL appears in the output.\n */\nexport function aggregateAndRank(\n  searches: QuerySearchResult[],\n  minConsensusUrls: number = DEFAULT_MIN_CONSENSUS_URLS\n): AggregationResult {\n  const urlMap = aggregateResults(searches);\n  const totalUniqueUrls = urlMap.size;\n  const totalQueries = searches.length;\n\n  // Determine consensus threshold for labeling (not filtering)\n  const thresholds = [3, 2, 1];\n  let usedThreshold = 1;\n  let thresholdNote: string | undefined;\n\n  for (const threshold of thresholds) {\n    const count = countByFrequency(urlMap, threshold);\n    if (count >= minConsensusUrls || threshold === 1) {\n      usedThreshold = threshold;\n      if (threshold < 3) {\n        thresholdNote = `Note: Consensus threshold set to \u2265${threshold} due to result diversity.`;\n      }\n      break;\n    }\n  }\n\n  // Rank ALL URLs, marking consensus based on determined threshold\n  const allUrls = [...urlMap.values()];\n  const rankedUrls = calculateWeightedScores(allUrls, usedThreshold, totalQueries);\n\n  return {\n    rankedUrls,\n    totalUniqueUrls,\n    totalQueries,\n    frequencyThreshold: usedThreshold,\n    thresholdNote,\n  };\n}\n\n"],
+  "mappings": "AAMA,SAAS,mBAAmB;AAI5B,MAAM,0BAA0B;AAIhC,MAAM,0BAA0B;AAGhC,MAAM,qBAAqB;AAG3B,MAAM,oBAAoB;AAG1B,MAAM,6BAA6B;AAGnC,MAAM,2BAA2B;AAGjC,MAAM,mBAAmB;AAGzB,MAAM,0BAA0B;AAGhC,MAAM,2BAA2B;AAoBjC,SAAS,qBAAqB,WAAsF;AAClH,MAAI,UAAU,UAAU,GAAG;AACzB,WAAO,EAAE,MAAM,UAAU,CAAC,KAAK,GAAG,QAAQ,GAAG,uBAAuB,EAAI;AAAA,EAC1E;AACA,QAAM,OAAO,UAAU,OAAO,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI,UAAU;AAC9D,QAAM,WAAW,UAAU,OAAO,CAAC,KAAK,MAAM,OAAO,IAAI,SAAS,GAAG,CAAC,KAAK,UAAU,SAAS;AAC9F,QAAM,SAAS,KAAK,KAAK,QAAQ;AACjC,QAAM,wBAAwB,IAAM,0BAA0B,KAAK,IAAI,SAAS,0BAA0B,CAAG;AAC7G,SAAO,EAAE,MAAM,QAAQ,sBAAsB;AAC/C;AAqCA,SAAS,aAAa,UAA0B;AAC9C,MAAI,YAAY,KAAK,YAAY,IAAI;AACnC,WAAO,YAAY,QAAQ,KAAK;AAAA,EAClC;AAEA,SAAO,KAAK,IAAI,yBAAyB,qBAAqB,WAAW,qBAAqB,kBAAkB;AAClH;AAMA,SAAS,iBAAiB,UAA2D;AACnF,QAAM,SAAS,oBAAI,IAA2B;AAE9C,aAAW,UAAU,UAAU;AAC7B,eAAW,UAAU,OAAO,SAAS;AACnC,YAAM,gBAAgB,aAAa,OAAO,IAAI;AAC9C,YAAM,WAAW,OAAO,IAAI,aAAa;AAEzC,UAAI,UAAU;AACZ,iBAAS,aAAa;AACtB,iBAAS,UAAU,KAAK,OAAO,QAAQ;AACvC,iBAAS,QAAQ,KAAK,OAAO,KAAK;AAClC,cAAM,WAAW,SAAS;AAC1B,iBAAS,eAAe,KAAK,IAAI,SAAS,cAAc,OAAO,QAAQ;AACvE,iBAAS,cAAc,aAAa,OAAO,QAAQ;AAEnD,YACE,OAAO,WACP,SAAS,YAAY,SAAS,oBAC9B,CAAC,SAAS,YAAY,KAAK,OAAK,MAAM,OAAO,OAAO,GACpD;AACA,mBAAS,YAAY,KAAK,OAAO,OAAO;AAAA,QAC1C;AAEA,YAAI,OAAO,WAAW,UAAU;AAC9B,mBAAS,QAAQ,OAAO;AACxB,mBAAS,UAAU,OAAO;AAAA,QAC5B;AAAA,MACF,OAAO;AACL,eAAO,IAAI,eAAe;AAAA,UACxB,KAAK,OAAO;AAAA,UACZ,OAAO,OAAO;AAAA,UACd,SAAS,OAAO;AAAA,UAChB,aAAa,OAAO,UAAU,CAAC,OAAO,OAAO,IAAI,CAAC;AAAA,UAClD,WAAW;AAAA,UACX,WAAW,CAAC,OAAO,QAAQ;AAAA,UAC3B,SAAS,CAAC,OAAO,KAAK;AAAA,UACtB,cAAc,OAAO;AAAA,UACrB,YAAY,aAAa,OAAO,QAAQ;AAAA,QAC1C,CAAC;AAAA,MACH;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AACT;AAMA,SAAS,aAAa,KAAqB;AACzC,MAAI;AACF,UAAM,SAAS,IAAI,IAAI,GAAG;AAC1B,QAAI,OAAO,OAAO,SAAS,QAAQ,UAAU,EAAE;AAC/C,QAAI,OAAO,OAAO,SAAS,QAAQ,OAAO,EAAE,KAAK;AACjD,WAAO,GAAG,IAAI,GAAG,IAAI,GAAG,OAAO,MAAM,GAAG,YAAY;AAAA,EACtD,QAAQ;AACN,WAAO,IAAI,YAAY,EAAE,QAAQ,OAAO,EAAE;AAAA,EAC5C;AACF;AAKA,SAAS,iBACP,QACA,cACQ;AACR,MAAI,QAAQ;AACZ,aAAW,OAAO,OAAO,OAAO,GAAG;AACjC,QAAI,IAAI,aAAa,aAAc;AAAA,EACrC;AACA,SAAO;AACT;AAMA,SAAS,wBAAwB,MAAuB,oBAA4B,cAAmC;AACrH,MAAI,KAAK,WAAW,EAAG,QAAO,CAAC;AAG/B,QAAM,SAAS,KAAK,IAAI,SAAO;AAC7B,UAAM,QAAQ,qBAAqB,IAAI,SAAS;AAChD,UAAM,iBAAiB,IAAI,aAAa,MAAM;AAC9C,WAAO,EAAE,KAAK,gBAAgB,MAAM;AAAA,EACtC,CAAC;AAGD,SAAO,KAAK,CAAC,GAAG,MAAM,EAAE,iBAAiB,EAAE,cAAc;AAGzD,QAAM,WAAW,OAAO,CAAC,EAAG;AAG5B,SAAO,OAAO,IAAI,CAAC,EAAE,KAAK,gBAAgB,MAAM,GAAG,WAAW;AAAA,IAC5D,KAAK,IAAI;AAAA,IACT,OAAO,IAAI;AAAA,IACX,SAAS,IAAI;AAAA,IACb,aAAa,IAAI;AAAA,IACjB,MAAM,QAAQ;AAAA,IACd,OAAO,WAAW,IAAK,iBAAiB,WAAY,MAAM;AAAA,IAC1D,WAAW,IAAI;AAAA,IACf,WAAW,IAAI;AAAA,IACf,SAAS,IAAI;AAAA,IACb,cAAc,IAAI;AAAA,IAClB,aAAa,IAAI,aAAa;AAAA,IAC9B,eAAe,eAAe,IAAI,IAAI,YAAY,eAAe;AAAA,IACjE,gBAAgB,MAAM;AAAA,IACtB,uBAAuB,MAAM;AAAA,EAC/B,EAAE;AACJ;AAGA,MAAM,0BAA0B;AAKhC,SAAS,iBAAiB,QAAgB,WAA2B;AACnE,MAAI,aAAa,EAAG,QAAO;AAC3B,MAAI,SAAS,IAAK,QAAO;AACzB,MAAI,SAAS,IAAK,QAAO;AACzB,SAAO;AACT;AAMO,SAAS,sBACd,YACA,YACA,cACA,iBACA,oBACA,eACA,UAAmB,OACX;AACR,QAAM,QAAkB,CAAC;AACzB,QAAM,iBAAiB,WAAW,OAAO,OAAK,EAAE,WAAW,EAAE;AAG7D,QAAM,KAAK,0BAA0B,WAAW,MAAM,aAAa,eAAe,eAAe;AACjG,QAAM,KAAK,EAAE;AACb,MAAI,eAAe;AACjB,UAAM,KAAK,KAAK,aAAa,EAAE;AAC/B,UAAM,KAAK,EAAE;AAAA,EACf;AAYA,QAAM,kBAAkB,qBAAqB;AAE7C,aAAW,OAAO,YAAY;AAC5B,UAAM,eAAe,mBAAmB,IAAI,aAAa,2BACrD,kBACA,mBAAmB,IAAI,cACrB,eACA;AACN,UAAM,cAAc,KAAK,MAAM,IAAI,gBAAgB,GAAG;AACtD,UAAM,cAAc,iBAAiB,IAAI,gBAAgB,IAAI,SAAS;AAEtE,UAAM,KAAK,KAAK,IAAI,IAAI,MAAM,IAAI,KAAK,KAAK,IAAI,GAAG,MAAM,YAAY,EAAE;AAEvE,UAAM,kBAAkB,WAClB,WAAW,SAAS,KAAK,IAAI,YAAY,KAC1C,WAAW,WAAW;AAC3B,QAAI,iBAAiB;AACnB,YAAM,QAAQ;AAAA,QACZ,UAAU,IAAI,MAAM,QAAQ,CAAC,CAAC;AAAA,QAC9B,YAAY,IAAI,SAAS,IAAI,WAAW,MAAM,aAAa,WAAW;AAAA,QACtE,cAAc,IAAI,YAAY;AAAA,MAChC;AACA,UAAI,IAAI,YAAY,GAAG;AACrB,cAAM,KAAK,gBAAgB,WAAW,EAAE;AAAA,MAC1C;AACA,YAAM,KAAK,MAAM,KAAK,KAAK,CAAC;AAAA,IAC9B;AACA,QAAI,IAAI,QAAQ,SAAS,KAAK,SAAS;AACrC,YAAM,KAAK,YAAY,IAAI,QAAQ,IAAI,OAAK,IAAI,CAAC,GAAG,EAAE,KAAK,IAAI,CAAC,EAAE;AAAA,IACpE;AACA,UAAM,KAAK,KAAK,IAAI,OAAO,EAAE;AAG7B,QAAI,IAAI,YAAY,SAAS,GAAG;AAC9B,YAAM,OAAO,IAAI,YACd,OAAO,OAAK,MAAM,IAAI,OAAO,EAC7B,MAAM,GAAG,CAAC,EACV,IAAI,OAAK,EAAE,SAAS,MAAM,EAAE,MAAM,GAAG,EAAE,IAAI,QAAQ,CAAC;AACvD,UAAI,KAAK,SAAS,GAAG;AACnB,cAAM,KAAK,QAAQ,KAAK,IAAI,OAAK,IAAI,CAAC,GAAG,EAAE,KAAK,KAAK,CAAC,EAAE;AAAA,MAC1D;AAAA,IACF;AAEA,UAAM,KAAK,EAAE;AAAA,EACf;AAGA,QAAM,KAAK,KAAK;AAEhB,MAAI,WAAW,UAAU,yBAAyB;AAEhD,UAAM,KAAK,oBAAoB;AAC/B,UAAM,KAAK,yCAAyC;AACpD,UAAM,KAAK,2CAA2C;AAEtD,eAAW,UAAU,cAAc;AACjC,YAAM,YAAY,OAAO,QAAQ,CAAC;AAClC,UAAI,YAAY;AAChB,UAAI,WAAW;AACb,YAAI;AACF,sBAAY,IAAI,IAAI,UAAU,IAAI,EAAE,SAAS,QAAQ,UAAU,EAAE;AAAA,QACnE,QAAQ;AACN,sBAAY,UAAU;AAAA,QACxB;AAAA,MACF;AACA,YAAM,KAAK,MAAM,OAAO,KAAK,OAAO,OAAO,QAAQ,MAAM,MAAM,aAAa,QAAG,MAAM,YAAY,IAAI,UAAU,QAAQ,KAAK,QAAG,IAAI;AAAA,IACrI;AACA,UAAM,KAAK,EAAE;AAAA,EACf,OAAO;AAEL,UAAM,YAAY,aAAa,OAAO,OAAK,EAAE,QAAQ,UAAU,CAAC,EAAE;AAClE,UAAM,KAAK,uBAAuB,SAAS,IAAI,WAAW,MAAM,8BAA8B;AAC9F,UAAM,KAAK,EAAE;AAAA,EACf;AAGA,QAAM,WAAW,aAAa,OAAO,OAAK,EAAE,QAAQ,UAAU,CAAC;AAC/D,MAAI,SAAS,SAAS,GAAG;AACvB,UAAM,KAAK,wCAAwC,SAAS,IAAI,OAAK,KAAK,EAAE,KAAK,IAAI,EAAE,KAAK,IAAI,CAAC,EAAE;AACnG,UAAM,KAAK,EAAE;AAAA,EACf;AAGA,QAAM,aAAa,oBAAI,IAAY;AACnC,aAAW,UAAU,cAAc;AACjC,QAAI,OAAO,SAAS;AAClB,iBAAW,KAAK,OAAO,SAAS;AAC9B,mBAAW,IAAI,CAAC;AAAA,MAClB;AAAA,IACF;AAAA,EACF;AACA,MAAI,WAAW,OAAO,GAAG;AACvB,UAAM,UAAU,CAAC,GAAG,UAAU,EAAE,MAAM,GAAG,EAAE;AAC3C,UAAM,KAAK,yBAAyB,QAAQ,IAAI,OAAK,KAAK,CAAC,IAAI,EAAE,KAAK,IAAI,CAAC,EAAE;AAC7E,UAAM,KAAK,EAAE;AAAA,EACf;AAEA,SAAO,MAAM,KAAK,IAAI;AACxB;AAOO,SAAS,iBACd,UACA,mBAA2B,4BACR;AACnB,QAAM,SAAS,iBAAiB,QAAQ;AACxC,QAAM,kBAAkB,OAAO;AAC/B,QAAM,eAAe,SAAS;AAG9B,QAAM,aAAa,CAAC,GAAG,GAAG,CAAC;AAC3B,MAAI,gBAAgB;AACpB,MAAI;AAEJ,aAAW,aAAa,YAAY;AAClC,UAAM,QAAQ,iBAAiB,QAAQ,SAAS;AAChD,QAAI,SAAS,oBAAoB,cAAc,GAAG;AAChD,sBAAgB;AAChB,UAAI,YAAY,GAAG;AACjB,wBAAgB,0CAAqC,SAAS;AAAA,MAChE;AACA;AAAA,IACF;AAAA,EACF;AAGA,QAAM,UAAU,CAAC,GAAG,OAAO,OAAO,CAAC;AACnC,QAAM,aAAa,wBAAwB,SAAS,eAAe,YAAY;AAE/E,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA,oBAAoB;AAAA,IACpB;AAAA,EACF;AACF;",
+  "names": []
+}

package/dist/src/utils/workflow-key.js

@@ -0,0 +1,14 @@
+function buildWorkflowKey(ctx) {
+  const caller = ctx.client.user();
+  if (caller?.subject && caller.conversationId) {
+    return `chatgpt:${caller.subject}:${caller.conversationId}`;
+  }
+  if (caller?.conversationId) {
+    return `conversation:${caller.conversationId}`;
+  }
+  return `session:${ctx.session.sessionId}`;
+}
+export {
+  buildWorkflowKey
+};
+//# sourceMappingURL=workflow-key.js.map

package/dist/src/utils/workflow-key.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../../src/utils/workflow-key.ts"],
+  "sourcesContent": ["export interface WorkflowCaller {\n  subject?: string;\n  conversationId?: string;\n}\n\nexport interface WorkflowKeyContext {\n  session: { sessionId: string };\n  client: {\n    user(): WorkflowCaller | undefined;\n  };\n}\n\nexport function buildWorkflowKey(ctx: WorkflowKeyContext): string {\n  const caller = ctx.client.user();\n\n  if (caller?.subject && caller.conversationId) {\n    return `chatgpt:${caller.subject}:${caller.conversationId}`;\n  }\n\n  if (caller?.conversationId) {\n    return `conversation:${caller.conversationId}`;\n  }\n\n  return `session:${ctx.session.sessionId}`;\n}\n"],
+  "mappings": "AAYO,SAAS,iBAAiB,KAAiC;AAChE,QAAM,SAAS,IAAI,OAAO,KAAK;AAE/B,MAAI,QAAQ,WAAW,OAAO,gBAAgB;AAC5C,WAAO,WAAW,OAAO,OAAO,IAAI,OAAO,cAAc;AAAA,EAC3D;AAEA,MAAI,QAAQ,gBAAgB;AAC1B,WAAO,gBAAgB,OAAO,cAAc;AAAA,EAC9C;AAEA,SAAO,WAAW,IAAI,QAAQ,SAAS;AACzC;",
+  "names": []
+}

package/dist/src/version.js

@@ -0,0 +1,32 @@
+import { createRequire } from "module";
+import { fileURLToPath } from "url";
+import { dirname, join } from "path";
+const DEFAULT_PACKAGE_INFO = {
+  version: "3.9.5",
+  name: "mcp-researchpowerpack-http",
+  description: "Research Powerpack MCP Server"
+};
+let packageJson = { ...DEFAULT_PACKAGE_INFO };
+try {
+  if (typeof import.meta.url === "string" && import.meta.url.startsWith("file:")) {
+    const _require = createRequire(import.meta.url);
+    const _dirname = dirname(fileURLToPath(import.meta.url));
+    try {
+      packageJson = _require(join(_dirname, "..", "package.json"));
+    } catch {
+      packageJson = _require(join(_dirname, "..", "..", "package.json"));
+    }
+  }
+} catch {
+}
+const VERSION = packageJson.version;
+const PACKAGE_NAME = packageJson.name;
+const PACKAGE_DESCRIPTION = packageJson.description;
+const USER_AGENT_VERSION = `${PACKAGE_NAME}/${VERSION}`;
+export {
+  PACKAGE_DESCRIPTION,
+  PACKAGE_NAME,
+  USER_AGENT_VERSION,
+  VERSION
+};
+//# sourceMappingURL=version.js.map

package/dist/src/version.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../src/version.ts"],
+  "sourcesContent": ["/**\n * Version Module - Single Source of Truth\n * \n * This module reads package metadata from package.json at runtime and keeps a\n * fallback copy for environments where package.json cannot be resolved.\n * \n * Usage:\n *   import { VERSION, PACKAGE_NAME } from './version.js';\n */\n\nimport { createRequire } from 'module';\nimport { fileURLToPath } from 'url';\nimport { dirname, join } from 'path';\n\n// Defaults used if package.json cannot be loaded at runtime.\nconst DEFAULT_PACKAGE_INFO = {\n  version: '3.9.5',\n  name: 'mcp-researchpowerpack-http',\n  description: 'Research Powerpack MCP Server',\n} as const;\n\nlet packageJson: { version: string; name: string; description: string } = { ...DEFAULT_PACKAGE_INFO };\n\ntry {\n  if (typeof import.meta.url === 'string' && import.meta.url.startsWith('file:')) {\n    const _require = createRequire(import.meta.url);\n    const _dirname = dirname(fileURLToPath(import.meta.url));\n    try {\n      packageJson = _require(join(_dirname, '..', 'package.json'));\n    } catch {\n      packageJson = _require(join(_dirname, '..', '..', 'package.json'));\n    }\n  }\n} catch {\n  // Keep hardcoded defaults when package.json is unavailable\n}\n\n/**\n * Package version from package.json\n * This is the single source of truth for versioning\n */\nexport const VERSION: string = packageJson.version;\n\n/**\n * Package name from package.json\n */\nexport const PACKAGE_NAME: string = packageJson.name;\n\n/**\n * Package description from package.json\n */\nexport const PACKAGE_DESCRIPTION: string = packageJson.description;\n\n/**\n * Formatted version string for user agents and logging\n * Example: \"mcp-researchpowerpack-http/3.2.0\"\n */\nexport const USER_AGENT_VERSION: string = `${PACKAGE_NAME}/${VERSION}`;\n\n// VERSION_INFO removed - unused, individual exports sufficient\n"],
+  "mappings": "AAUA,SAAS,qBAAqB;AAC9B,SAAS,qBAAqB;AAC9B,SAAS,SAAS,YAAY;AAG9B,MAAM,uBAAuB;AAAA,EAC3B,SAAS;AAAA,EACT,MAAM;AAAA,EACN,aAAa;AACf;AAEA,IAAI,cAAsE,EAAE,GAAG,qBAAqB;AAEpG,IAAI;AACF,MAAI,OAAO,YAAY,QAAQ,YAAY,YAAY,IAAI,WAAW,OAAO,GAAG;AAC9E,UAAM,WAAW,cAAc,YAAY,GAAG;AAC9C,UAAM,WAAW,QAAQ,cAAc,YAAY,GAAG,CAAC;AACvD,QAAI;AACF,oBAAc,SAAS,KAAK,UAAU,MAAM,cAAc,CAAC;AAAA,IAC7D,QAAQ;AACN,oBAAc,SAAS,KAAK,UAAU,MAAM,MAAM,cAAc,CAAC;AAAA,IACnE;AAAA,EACF;AACF,QAAQ;AAER;AAMO,MAAM,UAAkB,YAAY;AAKpC,MAAM,eAAuB,YAAY;AAKzC,MAAM,sBAA8B,YAAY;AAMhD,MAAM,qBAA6B,GAAG,YAAY,IAAI,OAAO;",
+  "names": []
+}

package/package.json

@@ -1,15 +1,17 @@
 {
   "name": "mcp-researchpowerpack",
-  "version": "3.9.4",
-  "description": "The ultimate research MCP toolkit: Reddit mining, web search with CTR aggregation, AI-powered deep research, and intelligent web scraping - all in one modular package",
+  "version": "4.3.0",
+  "description": "HTTP-first MCP research server: web-search (with Reddit scope), scrape-links (chrome-stripped), get-reddit-post — built on mcp-use, deployed at research.yigitkonur.com/mcp.",
   "type": "module",
   "main": "dist/index.js",
   "bin": {
-    "mcp-research-powerpack": "dist/index.js",
-    "research-powerpack-mcp": "dist/index.js"
+    "mcp-researchpowerpack": "dist/index.js",
+    "mcp-researchpowerpack-http": "dist/index.js",
+    "mcp-research-powerpack-http": "dist/index.js"
   },
   "files": [
-    "dist"
+    "dist",
+    "!dist/tests"
   ],
   "keywords": [
     "mcp",
@@ -19,54 +21,57 @@
     "search",
     "ai",
     "model-context-protocol",
-    "deep-research",
     "web-scraping",
     "claude",
     "anthropic",
     "openrouter",
     "scraping",
-    "research-powerpack"
+    "research-powerpack",
+    "http-mcp"
   ],
   "author": "Yiğit Konur <yigit35@gmail.com>",
   "license": "MIT",
   "repository": {
     "type": "git",
-    "url": "git+https://github.com/yigitkonur/mcp-research-powerpack.git"
+    "url": "git+https://github.com/yigitkonur/mcp-researchpowerpack.git"
   },
-  "homepage": "https://github.com/yigitkonur/mcp-research-powerpack#readme",
+  "homepage": "https://github.com/yigitkonur/mcp-researchpowerpack#readme",
   "bugs": {
-    "url": "https://github.com/yigitkonur/mcp-research-powerpack/issues"
+    "url": "https://github.com/yigitkonur/mcp-researchpowerpack/issues"
   },
   "dependencies": {
-    "@modelcontextprotocol/sdk": "^1.18.1",
-    "agents": "^0.3.10",
+    "@mozilla/readability": "^0.6.0",
+    "jsdom": "^29.0.2",
+    "mcp-use": "1.22.0",
     "openai": "^4.77.0",
+    "redis": "^5.11.0",
     "turndown": "^7.2.2",
-    "yaml": "^2.7.0",
-    "zod": "^3.24.1",
-    "zod-to-json-schema": "^3.24.1"
+    "zod": "^4.3.6"
   },
   "devDependencies": {
+    "@mcp-use/cli": "2.20.0",
+    "@types/jsdom": "^28.0.1",
     "@types/node": "^22.0.0",
     "@types/turndown": "^5.0.6",
-    "dotenv": "^17.2.3",
     "tsx": "^4.19.0",
-    "typescript": "^5.6.0",
-    "wrangler": "^4.63.0"
+    "typescript": "^5.6.0"
   },
   "engines": {
-    "node": ">=20.0.0"
+    "node": "^20.19.0 || >=22.12.0"
+  },
+  "publishConfig": {
+    "access": "public"
   },
   "scripts": {
-    "build": "tsc && cp -r src/config/yaml dist/config/",
-    "dev": "tsx src/index.ts",
-    "start": "node dist/index.js",
+    "build": "mcp-use build",
+    "dev": "mcp-use dev",
+    "start": "mcp-use start",
+    "deploy": "mcp-use deploy",
+    "inspect": "npx @mcp-use/inspector --url http://localhost:3000/mcp",
     "typecheck": "tsc --noEmit",
-    "test:web-search": "tsx tests/test-web-search.ts",
-    "test:reddit-search": "tsx tests/test-reddit-search.ts",
-    "test:scrape-links": "tsx tests/test-scrape-links.ts",
-    "test:deep-research": "tsx tests/test-deep-research.ts",
-    "test:all": "pnpm test:web-search && pnpm test:reddit-search && pnpm test:scrape-links && pnpm test:deep-research",
-    "test:check": "tsx tests/check-setup.ts"
+    "test": "pnpm test:unit && pnpm test:http",
+    "test:unit": "tsx --test tests/**/*.test.ts",
+    "test:http": "tsx tests/http-server.ts",
+    "test:evals": "tsx tests/agent-behavior.ts"
   }
 }

package/dist/clients/reddit.d.ts

@@ -1,69 +0,0 @@
-/**
- * Reddit OAuth API Client
- * Fetches posts and comments sorted by score (most upvoted first)
- * Implements robust error handling that NEVER crashes
- */
-interface Post {
-    readonly title: string;
-    readonly author: string;
-    readonly subreddit: string;
-    readonly body: string;
-    readonly score: number;
-    readonly commentCount: number;
-    readonly url: string;
-    readonly created: Date;
-    readonly flair?: string;
-    readonly isNsfw: boolean;
-    readonly isPinned: boolean;
-}
-export interface Comment {
-    readonly author: string;
-    readonly body: string;
-    readonly score: number;
-    readonly depth: number;
-    readonly isOP: boolean;
-}
-export interface PostResult {
-    readonly post: Post;
-    readonly comments: Comment[];
-    readonly allocatedComments: number;
-    readonly actualComments: number;
-}
-interface BatchPostResult {
-    readonly results: Map<string, PostResult | Error>;
-    readonly batchesProcessed: number;
-    readonly totalPosts: number;
-    readonly rateLimitHits: number;
-    readonly commentAllocation: CommentAllocation;
-}
-interface CommentAllocation {
-    readonly totalBudget: number;
-    readonly perPostBase: number;
-    readonly perPostCapped: number;
-    redistributed: boolean;
-}
-export declare function calculateCommentAllocation(postCount: number): CommentAllocation;
-export declare class RedditClient {
-    private clientId;
-    private clientSecret;
-    private userAgent;
-    constructor(clientId: string, clientSecret: string);
-    /**
-     * Authenticate with Reddit API with retry logic
-     * Uses module-level token cache and promise deduplication to prevent
-     * concurrent auth calls from firing multiple token requests
-     * Returns null on failure instead of throwing
-     */
-    private auth;
-    private performAuth;
-    private parseUrl;
-    /**
-     * Get a single Reddit post with comments
-     * Returns PostResult or throws Error (for use with Promise.allSettled)
-     */
-    getPost(url: string, maxComments?: number): Promise<PostResult>;
-    getPosts(urls: string[], maxComments?: number): Promise<Map<string, PostResult | Error>>;
-    batchGetPosts(urls: string[], maxCommentsOverride?: number, fetchComments?: boolean, onBatchComplete?: (batchNum: number, totalBatches: number, processed: number) => void): Promise<BatchPostResult>;
-}
-export {};
-//# sourceMappingURL=reddit.d.ts.map

package/dist/clients/reddit.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"reddit.d.ts","sourceRoot":"","sources":["../../src/clients/reddit.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAuBH,UAAU,IAAI;IACZ,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,YAAY,EAAE,MAAM,CAAC;IAC9B,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAC;IACrB,QAAQ,CAAC,OAAO,EAAE,IAAI,CAAC;IACvB,QAAQ,CAAC,KAAK,CAAC,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,MAAM,EAAE,OAAO,CAAC;IACzB,QAAQ,CAAC,QAAQ,EAAE,OAAO,CAAC;CAC5B;AAED,MAAM,WAAW,OAAO;IACtB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAC;CACxB;AAED,MAAM,WAAW,UAAU;IACzB,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC;IACpB,QAAQ,CAAC,QAAQ,EAAE,OAAO,EAAE,CAAC;IAC7B,QAAQ,CAAC,iBAAiB,EAAE,MAAM,CAAC;IACnC,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAC;CACjC;AAED,UAAU,eAAe;IACvB,QAAQ,CAAC,OAAO,EAAE,GAAG,CAAC,MAAM,EAAE,UAAU,GAAG,KAAK,CAAC,CAAC;IAClD,QAAQ,CAAC,gBAAgB,EAAE,MAAM,CAAC;IAClC,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B,QAAQ,CAAC,aAAa,EAAE,MAAM,CAAC;IAC/B,QAAQ,CAAC,iBAAiB,EAAE,iBAAiB,CAAC;CAC/C;AAED,UAAU,iBAAiB;IACzB,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;IAC7B,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;IAC7B,QAAQ,CAAC,aAAa,EAAE,MAAM,CAAC;IAC/B,aAAa,EAAE,OAAO,CAAC;CACxB;AA4CD,wBAAgB,0BAA0B,CAAC,SAAS,EAAE,MAAM,GAAG,iBAAiB,CAK/E;AAgOD,qBAAa,YAAY;IAGX,OAAO,CAAC,QAAQ;IAAU,OAAO,CAAC,YAAY;IAF1D,OAAO,CAAC,SAAS,CAA6D;gBAE1D,QAAQ,EAAE,MAAM,EAAU,YAAY,EAAE,MAAM;IAElE;;;;;OAKG;YACW,IAAI;YAmBJ,WAAW;IAmEzB,OAAO,CAAC,QAAQ;IAKhB;;;OAGG;IACG,OAAO,CAAC,GAAG,EAAE,MAAM,EAAE,WAAW,SAAM,GAAG,OAAO,CAAC,UAAU,CAAC;IAkD5D,QAAQ,CAAC,IAAI,EAAE,MAAM,EAAE,EAAE,WAAW,SAAM,GAAG,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,UAAU,GAAG,KAAK,CAAC,CAAC;IAYrF,aAAa,CACjB,IAAI,EAAE,MAAM,EAAE,EACd,mBAAmB,CAAC,EAAE,MAAM,EAC5B,aAAa,UAAO,EACpB,eAAe,CAAC,EAAE,CAAC,QAAQ,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,KAAK,IAAI,GACpF,OAAO,CAAC,eAAe,CAAC;CA2C5B"}