mcp-researchpowerpack 6.0.15 → 6.0.16

package/README.md

@@ -11,7 +11,7 @@ Built on [mcp-use](https://github.com/nicepkg/mcp-use). No stdio, HTTP only.
 | tool | what it does | needs |
 |------|-------------|-------|
 | `start-research` | returns a goal-tailored brief: `primary_branch` (reddit / web / both), exact `first_call_sequence`, 25–50 keyword seeds, iteration hints, gaps to watch, stop criteria. Call FIRST every session. | `LLM_API_KEY` + `LLM_BASE_URL` + `LLM_MODEL` for non-degraded brief generation (optional) |
-| `web-search` | parallel Google search, up to 50 queries per call, parallel-callable across turns. `scope: "web" \| "reddit" \| "both"` — reddit mode filters to post permalinks. Returns tiered markdown (HIGHLY_RELEVANT / MAYBE_RELEVANT / OTHER) + grounded synthesis + gaps + refine suggestions. | `SERPER_API_KEY` |
+| `web-search` | parallel Google search, up to 50 queries per call, parallel-callable across turns. `scope: "web" \| "reddit" \| "both"` — reddit mode filters to post permalinks. Queries should be retrieval probes, not topic labels: rewrite vague phrases into source-aware searches with anchors such as `site:`, exact quoted terms, versions, error text, package names, or community filters. Returns tiered markdown (HIGHLY_RELEVANT / MAYBE_RELEVANT / OTHER) + grounded synthesis + gaps + refine suggestions. | `SERPER_API_KEY` |
 | `scrape-links` | fetch URLs in parallel with per-URL LLM extraction. Auto-detects `reddit.com/r/.../comments/` permalinks and routes them through the Reddit API (threaded post + comments); PDF / DOCX / PPTX / XLSX URLs route through Jina Reader; non-reddit, non-document web URLs flow through Scrape.do. Parallel-callable. | `SCRAPEDO_API_KEY` for web URLs (+ `REDDIT_CLIENT_ID` / `REDDIT_CLIENT_SECRET` for reddit URLs; optional `JINA_API_KEY` for higher document limits) |
 
 Also exposes `/health` and `health://status`.
@@ -20,6 +20,8 @@ Also exposes `/health` and `health://status`.
 
 Call `start-research` once at the beginning of each session with your goal. The server returns a brief that tells the agent exactly which tool to call first (reddit-first for sentiment/migration, web-first for spec/bug/pricing, both when opinion-heavy AND needs official sources), what keyword seeds to fire, and when to stop.
 
+For search fan-out, use bad → better rewrite thinking before calling `web-search`: turn broad phrases like `<feature> support`, `<product> pricing`, `<library> bug fix`, or `<tool> reviews` into source-aware probes such as `site:<official-docs-domain> "<feature>" "<platform-or-version>"`, `site:<vendor-domain> "<product>" pricing "enterprise" OR "free tier"`, `"<exact error text>" "<library-or-package>" "<version>" site:github.com`, or `site:reddit.com/r/<community>/comments "<tool>" "migration" OR "regression"`.
+
 Pair the server with the [`run-research`](https://github.com/yigitkonur/skills-by-yigitkonur/tree/main/skills/run-research) skill for the full agentic playbook:
 
 ```bash

package/dist/mcp-use.json

@@ -1,7 +1,7 @@
 {
   "includeInspector": false,
-  "buildTime": "2026-04-30T16:01:54.172Z",
-  "buildId": "c60363f4704d5b35",
+  "buildTime": "2026-04-30T20:36:35.153Z",
+  "buildId": "7cde881e8eedd617",
   "entryPoint": "dist/index.js",
   "widgets": {}
 }

package/dist/src/schemas/start-research.js

@@ -1,7 +1,7 @@
 import { z } from "zod";
 const startResearchParamsSchema = z.object({
   goal: z.string().min(1, { message: "start-research: goal cannot be empty" }).optional().describe(
-    'Research goal for this session. When provided AND the LLM planner (LLM_API_KEY) is available, the server returns a goal-tailored brief: classified goal type (spec | bug | migration | sentiment | pricing | security | synthesis | product_launch), a `primary_branch` recommendation (reddit for sentiment/migration; web for spec/bug/pricing; both when opinion-heavy AND needs official sources), the exact `first_call_sequence` of web-search + scrape-links calls to fire, 25\u201350 keyword seeds for the first `web-search` call, iteration hints, gaps to watch, and stop criteria. No goal \u2192 the generic 3-tool playbook (no tailored brief). Write the goal as you would to a human researcher \u2014 one or two sentences, specific about what "done" looks like.'
+    'Research goal for this session. When provided AND the LLM planner (LLM_API_KEY) is available, the server returns a goal-tailored brief: classified goal type (spec | bug | migration | sentiment | pricing | security | synthesis | product_launch), a `primary_branch` recommendation (reddit for sentiment/migration; web for spec/bug/pricing; both when opinion-heavy AND needs official sources), the exact `first_call_sequence` of web-search + scrape-links calls to fire, 25\u201350 keyword seeds for the first `web-search` call, iteration hints, gaps to watch, and stop criteria. The goal also sets the post-sort relevance target, so state the evidence you need and what "done" means. No goal \u2192 the generic 3-tool playbook (no tailored brief). Write the goal as you would to a human researcher \u2014 one or two sentences, specific about what "done" looks like.'
   ),
   include_playbook: z.boolean().default(false).describe(
     "Include the full 3-tool research playbook (toolbelt overview, the loop, output discipline). Default false \u2014 when the LLM planner is offline the server emits a compact stub that already names the 3 tools and the loop. Pass true only if the agent needs the verbose tactic reference, or to override the degraded-mode shrink."

package/dist/src/schemas/start-research.js.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../../src/schemas/start-research.ts"],
-  "sourcesContent": ["import { z } from 'zod';\n\nexport const startResearchParamsSchema = z.object({\n  goal: z\n    .string()\n    .min(1, { message: 'start-research: goal cannot be empty' })\n    .optional()\n    .describe(\n      'Research goal for this session. When provided AND the LLM planner (LLM_API_KEY) is available, the server returns a goal-tailored brief: classified goal type (spec | bug | migration | sentiment | pricing | security | synthesis | product_launch), a `primary_branch` recommendation (reddit for sentiment/migration; web for spec/bug/pricing; both when opinion-heavy AND needs official sources), the exact `first_call_sequence` of web-search + scrape-links calls to fire, 25\u201350 keyword seeds for the first `web-search` call, iteration hints, gaps to watch, and stop criteria. No goal \u2192 the generic 3-tool playbook (no tailored brief). Write the goal as you would to a human researcher \u2014 one or two sentences, specific about what \"done\" looks like.',\n    ),\n  include_playbook: z\n    .boolean()\n    .default(false)\n    .describe(\n      'Include the full 3-tool research playbook (toolbelt overview, the loop, output discipline). Default false \u2014 when the LLM planner is offline the server emits a compact stub that already names the 3 tools and the loop. Pass true only if the agent needs the verbose tactic reference, or to override the degraded-mode shrink.',\n    ),\n}).strict();\n\nexport type StartResearchParams = z.infer<typeof startResearchParamsSchema>;\n\n// `start-research` is text-only: the tool registration deliberately omits\n// `outputSchema`, and successful calls omit `structuredContent`.\nexport type StartResearchOutput = Record<string, never>;\n"],
+  "sourcesContent": ["import { z } from 'zod';\n\nexport const startResearchParamsSchema = z.object({\n  goal: z\n    .string()\n    .min(1, { message: 'start-research: goal cannot be empty' })\n    .optional()\n    .describe(\n      'Research goal for this session. When provided AND the LLM planner (LLM_API_KEY) is available, the server returns a goal-tailored brief: classified goal type (spec | bug | migration | sentiment | pricing | security | synthesis | product_launch), a `primary_branch` recommendation (reddit for sentiment/migration; web for spec/bug/pricing; both when opinion-heavy AND needs official sources), the exact `first_call_sequence` of web-search + scrape-links calls to fire, 25\u201350 keyword seeds for the first `web-search` call, iteration hints, gaps to watch, and stop criteria. The goal also sets the post-sort relevance target, so state the evidence you need and what \"done\" means. No goal \u2192 the generic 3-tool playbook (no tailored brief). Write the goal as you would to a human researcher \u2014 one or two sentences, specific about what \"done\" looks like.',\n    ),\n  include_playbook: z\n    .boolean()\n    .default(false)\n    .describe(\n      'Include the full 3-tool research playbook (toolbelt overview, the loop, output discipline). Default false \u2014 when the LLM planner is offline the server emits a compact stub that already names the 3 tools and the loop. Pass true only if the agent needs the verbose tactic reference, or to override the degraded-mode shrink.',\n    ),\n}).strict();\n\nexport type StartResearchParams = z.infer<typeof startResearchParamsSchema>;\n\n// `start-research` is text-only: the tool registration deliberately omits\n// `outputSchema`, and successful calls omit `structuredContent`.\nexport type StartResearchOutput = Record<string, never>;\n"],
   "mappings": "AAAA,SAAS,SAAS;AAEX,MAAM,4BAA4B,EAAE,OAAO;AAAA,EAChD,MAAM,EACH,OAAO,EACP,IAAI,GAAG,EAAE,SAAS,uCAAuC,CAAC,EAC1D,SAAS,EACT;AAAA,IACC;AAAA,EACF;AAAA,EACF,kBAAkB,EACf,QAAQ,EACR,QAAQ,KAAK,EACb;AAAA,IACC;AAAA,EACF;AACJ,CAAC,EAAE,OAAO;",
   "names": []
 }

package/dist/src/schemas/web-search.js

@@ -1,12 +1,28 @@
 import { z } from "zod";
+const QUERY_REWRITE_PAIR_EXAMPLES = [
+  'Bad: `<feature> support` \u2192 Better: `site:<official-docs-domain> "<feature>" "<platform-or-version>"`',
+  'Bad: `<product> pricing` \u2192 Better: `site:<vendor-domain> "<product>" pricing "enterprise" OR "free tier"`',
+  'Bad: `<library> bug fix` \u2192 Better: `"<exact error text>" "<library-or-package>" "<version>" site:github.com`',
+  'Bad: `<tool> reviews` \u2192 Better: `site:reddit.com/r/<community>/comments "<tool>" "migration" OR "regression"`'
+];
+const QUERY_REWRITE_PAIR_GUIDANCE = [
+  "Write Google retrieval probes, not topic labels.",
+  "For each broad idea, rewrite it into a query that names the evidence source class, discriminating anchor terms, and one useful operator when possible.",
+  "Use rewrite-pair thinking before searching:",
+  ...QUERY_REWRITE_PAIR_EXAMPLES,
+  "Do not repeat the same noun phrase with adjectives changed; fan out by source type and evidence need."
+];
+const QUERY_REWRITE_PAIR_GUIDANCE_TEXT = QUERY_REWRITE_PAIR_GUIDANCE.join(" ");
 const webSearchParamsSchema = z.object({
   queries: z.array(
-    z.string().min(1, { message: "web-search: Query cannot be empty" }).describe("A single Google search query. Each query runs as a separate parallel search. Use operators (site:, quotes, verbatim version numbers) to sharpen retrieval.")
+    z.string().min(1, { message: "web-search: Query cannot be empty" }).describe(
+      `A single Google search query. Each query runs as a separate parallel search. ${QUERY_REWRITE_PAIR_GUIDANCE_TEXT}`
+    )
   ).min(1, { message: "web-search: At least 1 query required" }).describe(
-    "Search queries to run in parallel via Google. Think of these as **concept groups** \u2014 clusters of semantically distinct facets of your research goal, each probing a DIFFERENT angle (official spec, implementation, failures, comparison, sentiment, changelog, CVE, pricing). Fire all groups in ONE call as a flat array. Overlapping queries waste budget; orthogonal facets multiply coverage. A narrow bug needs 10\u201320 queries across 2\u20133 facets; a comparison needs 25\u201335 across 4\u20136 facets; open-ended synthesis needs 40\u201380 across 8+ facets."
+    `Search queries to run in parallel via Google. ${QUERY_REWRITE_PAIR_GUIDANCE_TEXT} Think of queries as **concept groups** \u2014 clusters of semantically distinct facets of your research goal, each probing a DIFFERENT angle (official spec, implementation, failures, comparison, sentiment, changelog, CVE, pricing). Fire all groups in ONE call as a flat array. Overlapping queries waste budget; orthogonal facets multiply coverage. A narrow bug needs 10\u201320 queries across 2\u20133 facets; a comparison needs 25\u201335 across 4\u20136 facets; open-ended synthesis needs 40\u201380 across 8+ facets.`
   ),
   extract: z.string().min(1, { message: "web-search: extract cannot be empty" }).describe(
-    'Semantic instruction for the relevance classifier \u2014 what "relevant" means for THIS goal. Drives tiering (HIGHLY_RELEVANT / MAYBE_RELEVANT / OTHER), synthesis, gap analysis, and refine-query suggestions. Be specific: "OAuth 2.1 support in TypeScript MCP frameworks \u2014 runnable code, not marketing", not "MCP OAuth". The classifier uses this to choose a source-of-truth rubric (vendor_doc for spec, github for bugs, reddit/blog for migration/sentiment, cve_databases for security).'
+    'Semantic instruction for the relevance classifier \u2014 what "relevant" means for THIS goal. This is the post-sort target, so name the evidence you need and the source-of-truth expectation: e.g. official docs/release notes for specs, issue/PR/error text for bugs, Reddit/HN/blogs for lived experience, vendor pricing pages for pricing, CVE databases for security. Drives tiering (HIGHLY_RELEVANT / MAYBE_RELEVANT / OTHER), synthesis, gap analysis, and refine-query suggestions. Be specific: "OAuth 2.1 support in TypeScript MCP frameworks \u2014 runnable code, not marketing", not "MCP OAuth".'
   ),
   raw: z.boolean().default(false).describe("Skip LLM classification and return the raw ranked URL list. Use when you need unprocessed results."),
   scope: z.enum(["web", "reddit", "both"]).default("web").describe(
@@ -67,6 +83,9 @@ const webSearchOutputSchema = z.object({
   }).strict()
 }).strict();
 export {
+  QUERY_REWRITE_PAIR_EXAMPLES,
+  QUERY_REWRITE_PAIR_GUIDANCE,
+  QUERY_REWRITE_PAIR_GUIDANCE_TEXT,
   webSearchOutputSchema,
   webSearchParamsSchema
 };

package/dist/src/schemas/web-search.js.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../../src/schemas/web-search.ts"],
-  "sourcesContent": ["import { z } from 'zod';\n\nexport const webSearchParamsSchema = z.object({\n  queries: z\n    .array(\n      z.string()\n        .min(1, { message: 'web-search: Query cannot be empty' })\n        .describe('A single Google search query. Each query runs as a separate parallel search. Use operators (site:, quotes, verbatim version numbers) to sharpen retrieval.'),\n    )\n    .min(1, { message: 'web-search: At least 1 query required' })\n    .describe(\n      'Search queries to run in parallel via Google. Think of these as **concept groups** \u2014 clusters of semantically distinct facets of your research goal, each probing a DIFFERENT angle (official spec, implementation, failures, comparison, sentiment, changelog, CVE, pricing). Fire all groups in ONE call as a flat array. Overlapping queries waste budget; orthogonal facets multiply coverage. A narrow bug needs 10\u201320 queries across 2\u20133 facets; a comparison needs 25\u201335 across 4\u20136 facets; open-ended synthesis needs 40\u201380 across 8+ facets.',\n    ),\n  extract: z\n    .string()\n    .min(1, { message: 'web-search: extract cannot be empty' })\n    .describe(\n      'Semantic instruction for the relevance classifier \u2014 what \"relevant\" means for THIS goal. Drives tiering (HIGHLY_RELEVANT / MAYBE_RELEVANT / OTHER), synthesis, gap analysis, and refine-query suggestions. Be specific: \"OAuth 2.1 support in TypeScript MCP frameworks \u2014 runnable code, not marketing\", not \"MCP OAuth\". The classifier uses this to choose a source-of-truth rubric (vendor_doc for spec, github for bugs, reddit/blog for migration/sentiment, cve_databases for security).',\n    ),\n  raw: z\n    .boolean()\n    .default(false)\n    .describe('Skip LLM classification and return the raw ranked URL list. Use when you need unprocessed results.'),\n  scope: z\n    .enum(['web', 'reddit', 'both'])\n    .default('web')\n    .describe(\n      'Search scope. \"web\" (default) = open web, no augmentation. \"reddit\" = server appends `site:reddit.com` to every query and filters results to post permalinks (`/r/.+/comments/[a-z0-9]+/`); subreddit homepages are dropped. \"both\" = runs every query twice (open web + reddit-scoped), merges the result set, and tags each row with its source. Use \"reddit\" for sentiment/migration/lived-experience research; use \"both\" when you want one call to cover both branches.',\n    ),\n  verbose: z\n    .boolean()\n    .default(false)\n    .describe(\n      'Include the per-row scoring/coverage metadata, the trailing Signals block, and the CONSENSUS labels even when they carry little signal (single-query hits, threshold of 1). Default false \u2014 most agents do not need this and it costs ~1.5KB per call on a typical 3-query fan-out.',\n    ),\n}).strict();\n\nexport type WebSearchParams = z.infer<typeof webSearchParamsSchema>;\n\nexport const webSearchOutputSchema = z.object({\n  content: z\n    .string()\n    .describe(\n      'Rendered search report, including ranked URLs, classification synthesis, gaps, and follow-up searches. Duplicates the MCP content text for clients that only expose structuredContent.',\n    ),\n  results: z\n    .array(z.object({\n      rank: z.number().int().positive().describe('1-based rank in the merged ranking.'),\n      url: z.string().describe('Result URL.'),\n      title: z.string().describe('Page title from the result.'),\n      snippet: z.string().describe('Search snippet from the result.'),\n      source_type: z\n        .enum(['reddit', 'github', 'docs', 'blog', 'paper', 'qa', 'cve', 'news', 'video', 'web'])\n        .describe(\n          'Heuristic source kind from the URL. When the LLM classifier is online its tag overrides this.',\n        ),\n      score: z.number().describe('Composite CTR-weighted score, normalized to 100.'),\n      seen_in: z.number().int().nonnegative().describe('Number of input queries this URL appeared in.'),\n      best_position: z.number().int().nonnegative().describe('Best (lowest) SERP position observed.'),\n    }))\n    .optional()\n    .describe('Per-result structured payload \u2014 same data the markdown table renders, machine-readable.'),\n  metadata: z.object({\n    total_items: z.number().int().nonnegative().describe('Number of queries executed.'),\n    successful: z.number().int().nonnegative().describe('Queries that returned results.'),\n    failed: z.number().int().nonnegative().describe('Queries that failed.'),\n    execution_time_ms: z.number().int().nonnegative().describe('Wall clock time in milliseconds.'),\n    llm_classified: z.boolean().describe('Whether LLM classification was applied.'),\n    llm_error: z.string().optional().describe('LLM error if classification failed and fell back to raw.'),\n    scope: z.enum(['web', 'reddit', 'both']).optional().describe('Search scope used.'),\n    coverage_summary: z\n      .array(z.object({\n        query: z.string().describe('The search query.'),\n        result_count: z.number().int().nonnegative().describe('Results returned for this query.'),\n        top_url: z.string().optional().describe('Domain of the top result.'),\n      }))\n      .optional()\n      .describe('Per-query result counts and top URLs.'),\n    low_yield_queries: z\n      .array(z.string())\n      .optional()\n      .describe('Queries that produced 0-1 results.'),\n    query_rewrites: z\n      .array(z.object({\n        original: z.string().describe('The query as the agent submitted it.'),\n        rewritten: z.string().describe('The query as dispatched to Google after Phase A normalization.'),\n        rules: z.array(z.string()).describe('Rule ids applied (A1=operator-char de-quote, A2=path/URL de-quote, A3=phrase-AND collapse).'),\n      }))\n      .optional()\n      .describe('Pre-dispatch query rewrites \u2014 Phase A normalizations (operator-char and path/URL de-quote, phrase-AND \u2192 anchor + OR collapse).'),\n    retried_queries: z\n      .array(z.object({\n        original: z.string().describe('The query as dispatched (post-Phase-A) that returned 0 results.'),\n        retried_with: z.string().describe('The relaxed form retried after the empty initial response.'),\n        rules: z.array(z.string()).describe('Rule ids applied (B1=strip all quotes, B2=drop site: filter).'),\n        recovered_results: z.number().int().nonnegative().describe('How many hits the retry produced; 0 means the retry also failed.'),\n      }))\n      .optional()\n      .describe('On-empty retries \u2014 Phase B relaxations applied after the initial Serper batch returned 0 results for a query.'),\n    retry_error: z\n      .object({\n        phase: z.literal('relax-retry').describe('Retry phase that failed after the initial batch succeeded.'),\n        code: z.string().describe('Structured error code from the retry batch.'),\n        message: z.string().describe('Provider error message from the retry batch.'),\n        retryable: z.boolean().describe('Whether the retry-batch provider failure is retryable.'),\n        statusCode: z.number().int().optional().describe('Provider status code when available.'),\n      })\n      .optional()\n      .describe('Non-fatal failure from the relaxed retry batch; initial search results were preserved.'),\n  }).strict(),\n}).strict();\n\nexport type WebSearchOutput = z.infer<typeof webSearchOutputSchema>;\n"],
-  "mappings": "AAAA,SAAS,SAAS;AAEX,MAAM,wBAAwB,EAAE,OAAO;AAAA,EAC5C,SAAS,EACN;AAAA,IACC,EAAE,OAAO,EACN,IAAI,GAAG,EAAE,SAAS,oCAAoC,CAAC,EACvD,SAAS,4JAA4J;AAAA,EAC1K,EACC,IAAI,GAAG,EAAE,SAAS,wCAAwC,CAAC,EAC3D;AAAA,IACC;AAAA,EACF;AAAA,EACF,SAAS,EACN,OAAO,EACP,IAAI,GAAG,EAAE,SAAS,sCAAsC,CAAC,EACzD;AAAA,IACC;AAAA,EACF;AAAA,EACF,KAAK,EACF,QAAQ,EACR,QAAQ,KAAK,EACb,SAAS,oGAAoG;AAAA,EAChH,OAAO,EACJ,KAAK,CAAC,OAAO,UAAU,MAAM,CAAC,EAC9B,QAAQ,KAAK,EACb;AAAA,IACC;AAAA,EACF;AAAA,EACF,SAAS,EACN,QAAQ,EACR,QAAQ,KAAK,EACb;AAAA,IACC;AAAA,EACF;AACJ,CAAC,EAAE,OAAO;AAIH,MAAM,wBAAwB,EAAE,OAAO;AAAA,EAC5C,SAAS,EACN,OAAO,EACP;AAAA,IACC;AAAA,EACF;AAAA,EACF,SAAS,EACN,MAAM,EAAE,OAAO;AAAA,IACd,MAAM,EAAE,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,SAAS,qCAAqC;AAAA,IAChF,KAAK,EAAE,OAAO,EAAE,SAAS,aAAa;AAAA,IACtC,OAAO,EAAE,OAAO,EAAE,SAAS,6BAA6B;AAAA,IACxD,SAAS,EAAE,OAAO,EAAE,SAAS,iCAAiC;AAAA,IAC9D,aAAa,EACV,KAAK,CAAC,UAAU,UAAU,QAAQ,QAAQ,SAAS,MAAM,OAAO,QAAQ,SAAS,KAAK,CAAC,EACvF;AAAA,MACC;AAAA,IACF;AAAA,IACF,OAAO,EAAE,OAAO,EAAE,SAAS,kDAAkD;AAAA,IAC7E,SAAS,EAAE,OAAO,EAAE,IAAI,EAAE,YAAY,EAAE,SAAS,+CAA+C;AAAA,IAChG,eAAe,EAAE,OAAO,EAAE,IAAI,EAAE,YAAY,EAAE,SAAS,uCAAuC;AAAA,EAChG,CAAC,CAAC,EACD,SAAS,EACT,SAAS,8FAAyF;AAAA,EACrG,UAAU,EAAE,OAAO;AAAA,IACjB,aAAa,EAAE,OAAO,EAAE,IAAI,EAAE,YAAY,EAAE,SAAS,6BAA6B;AAAA,IAClF,YAAY,EAAE,OAAO,EAAE,IAAI,EAAE,YAAY,EAAE,SAAS,gCAAgC;AAAA,IACpF,QAAQ,EAAE,OAAO,EAAE,IAAI,EAAE,YAAY,EAAE,SAAS,sBAAsB;AAAA,IACtE,mBAAmB,EAAE,OAAO,EAAE,IAAI,EAAE,YAAY,EAAE,SAAS,kCAAkC;AAAA,IAC7F,gBAAgB,EAAE,QAAQ,EAAE,SAAS,yCAAyC;AAAA,IAC9E,WAAW,EAAE,OAAO,EAAE,SAAS,EAAE,SAAS,0DAA0D;AAAA,IACpG,OAAO,EAAE,KAAK,CAAC,OAAO,UAAU,MAAM,CAAC,EAAE,SAAS,EAAE,SAAS,oBAAoB;AAAA,IACjF,kBAAkB,EACf,MAAM,EAAE,OAAO;AAAA,MACd,OAAO,EAAE,OAAO,EAAE,SAAS,mBAAmB;AAAA,MAC9C,cAAc,EAAE,OAAO,EAAE,IAAI,EAAE,YAAY,EAAE,SAAS,kCAAkC;AAAA,MACxF,SAAS,EAAE,OAAO,EAAE,SAAS,EAAE,SAAS,2BAA2B;AAAA,IACrE,CAAC,CAAC,EACD,SAAS,EACT,SAAS,uCAAuC;AAAA,IACnD,mBAAmB,EAChB,MAAM,EAAE,OAAO,CAAC,EAChB,SAAS,EACT,SAAS,oCAAoC;AAAA,IAChD,gBAAgB,EACb,MAAM,EAAE,OAAO;AAAA,MACd,UAAU,EAAE,OAAO,EAAE,SAAS,sCAAsC;AAAA,MACpE,WAAW,EAAE,OAAO,EAAE,SAAS,gEAAgE;AAAA,MAC/F,OAAO,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,SAAS,6FAA6F;AAAA,IACnI,CAAC,CAAC,EACD,SAAS,EACT,SAAS,0IAAgI;AAAA,IAC5I,iBAAiB,EACd,MAAM,EAAE,OAAO;AAAA,MACd,UAAU,EAAE,OAAO,EAAE,SAAS,iEAAiE;AAAA,MAC/F,cAAc,EAAE,OAAO,EAAE,SAAS,4DAA4D;AAAA,MAC9F,OAAO,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,SAAS,+DAA+D;AAAA,MACnG,mBAAmB,EAAE,OAAO,EAAE,IAAI,EAAE,YAAY,EAAE,SAAS,kEAAkE;AAAA,IAC/H,CAAC,CAAC,EACD,SAAS,EACT,SAAS,oHAA+G;AAAA,IAC3H,aAAa,EACV,OAAO;AAAA,MACN,OAAO,EAAE,QAAQ,aAAa,EAAE,SAAS,4DAA4D;AAAA,MACrG,MAAM,EAAE,OAAO,EAAE,SAAS,6CAA6C;AAAA,MACvE,SAAS,EAAE,OAAO,EAAE,SAAS,8CAA8C;AAAA,MAC3E,WAAW,EAAE,QAAQ,EAAE,SAAS,wDAAwD;AAAA,MACxF,YAAY,EAAE,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,SAAS,sCAAsC;AAAA,IACzF,CAAC,EACA,SAAS,EACT,SAAS,wFAAwF;AAAA,EACtG,CAAC,EAAE,OAAO;AACZ,CAAC,EAAE,OAAO;",
+  "sourcesContent": ["import { z } from 'zod';\n\nexport const QUERY_REWRITE_PAIR_EXAMPLES = [\n  'Bad: `<feature> support` \u2192 Better: `site:<official-docs-domain> \"<feature>\" \"<platform-or-version>\"`',\n  'Bad: `<product> pricing` \u2192 Better: `site:<vendor-domain> \"<product>\" pricing \"enterprise\" OR \"free tier\"`',\n  'Bad: `<library> bug fix` \u2192 Better: `\"<exact error text>\" \"<library-or-package>\" \"<version>\" site:github.com`',\n  'Bad: `<tool> reviews` \u2192 Better: `site:reddit.com/r/<community>/comments \"<tool>\" \"migration\" OR \"regression\"`',\n] as const;\n\nexport const QUERY_REWRITE_PAIR_GUIDANCE = [\n  'Write Google retrieval probes, not topic labels.',\n  'For each broad idea, rewrite it into a query that names the evidence source class, discriminating anchor terms, and one useful operator when possible.',\n  'Use rewrite-pair thinking before searching:',\n  ...QUERY_REWRITE_PAIR_EXAMPLES,\n  'Do not repeat the same noun phrase with adjectives changed; fan out by source type and evidence need.',\n] as const;\n\nexport const QUERY_REWRITE_PAIR_GUIDANCE_TEXT = QUERY_REWRITE_PAIR_GUIDANCE.join(' ');\n\nexport const webSearchParamsSchema = z.object({\n  queries: z\n    .array(\n      z.string()\n        .min(1, { message: 'web-search: Query cannot be empty' })\n        .describe(\n          `A single Google search query. Each query runs as a separate parallel search. ${QUERY_REWRITE_PAIR_GUIDANCE_TEXT}`,\n        ),\n    )\n    .min(1, { message: 'web-search: At least 1 query required' })\n    .describe(\n      `Search queries to run in parallel via Google. ${QUERY_REWRITE_PAIR_GUIDANCE_TEXT} Think of queries as **concept groups** \u2014 clusters of semantically distinct facets of your research goal, each probing a DIFFERENT angle (official spec, implementation, failures, comparison, sentiment, changelog, CVE, pricing). Fire all groups in ONE call as a flat array. Overlapping queries waste budget; orthogonal facets multiply coverage. A narrow bug needs 10\u201320 queries across 2\u20133 facets; a comparison needs 25\u201335 across 4\u20136 facets; open-ended synthesis needs 40\u201380 across 8+ facets.`,\n    ),\n  extract: z\n    .string()\n    .min(1, { message: 'web-search: extract cannot be empty' })\n    .describe(\n      'Semantic instruction for the relevance classifier \u2014 what \"relevant\" means for THIS goal. This is the post-sort target, so name the evidence you need and the source-of-truth expectation: e.g. official docs/release notes for specs, issue/PR/error text for bugs, Reddit/HN/blogs for lived experience, vendor pricing pages for pricing, CVE databases for security. Drives tiering (HIGHLY_RELEVANT / MAYBE_RELEVANT / OTHER), synthesis, gap analysis, and refine-query suggestions. Be specific: \"OAuth 2.1 support in TypeScript MCP frameworks \u2014 runnable code, not marketing\", not \"MCP OAuth\".',\n    ),\n  raw: z\n    .boolean()\n    .default(false)\n    .describe('Skip LLM classification and return the raw ranked URL list. Use when you need unprocessed results.'),\n  scope: z\n    .enum(['web', 'reddit', 'both'])\n    .default('web')\n    .describe(\n      'Search scope. \"web\" (default) = open web, no augmentation. \"reddit\" = server appends `site:reddit.com` to every query and filters results to post permalinks (`/r/.+/comments/[a-z0-9]+/`); subreddit homepages are dropped. \"both\" = runs every query twice (open web + reddit-scoped), merges the result set, and tags each row with its source. Use \"reddit\" for sentiment/migration/lived-experience research; use \"both\" when you want one call to cover both branches.',\n    ),\n  verbose: z\n    .boolean()\n    .default(false)\n    .describe(\n      'Include the per-row scoring/coverage metadata, the trailing Signals block, and the CONSENSUS labels even when they carry little signal (single-query hits, threshold of 1). Default false \u2014 most agents do not need this and it costs ~1.5KB per call on a typical 3-query fan-out.',\n    ),\n}).strict();\n\nexport type WebSearchParams = z.infer<typeof webSearchParamsSchema>;\n\nexport const webSearchOutputSchema = z.object({\n  content: z\n    .string()\n    .describe(\n      'Rendered search report, including ranked URLs, classification synthesis, gaps, and follow-up searches. Duplicates the MCP content text for clients that only expose structuredContent.',\n    ),\n  results: z\n    .array(z.object({\n      rank: z.number().int().positive().describe('1-based rank in the merged ranking.'),\n      url: z.string().describe('Result URL.'),\n      title: z.string().describe('Page title from the result.'),\n      snippet: z.string().describe('Search snippet from the result.'),\n      source_type: z\n        .enum(['reddit', 'github', 'docs', 'blog', 'paper', 'qa', 'cve', 'news', 'video', 'web'])\n        .describe(\n          'Heuristic source kind from the URL. When the LLM classifier is online its tag overrides this.',\n        ),\n      score: z.number().describe('Composite CTR-weighted score, normalized to 100.'),\n      seen_in: z.number().int().nonnegative().describe('Number of input queries this URL appeared in.'),\n      best_position: z.number().int().nonnegative().describe('Best (lowest) SERP position observed.'),\n    }))\n    .optional()\n    .describe('Per-result structured payload \u2014 same data the markdown table renders, machine-readable.'),\n  metadata: z.object({\n    total_items: z.number().int().nonnegative().describe('Number of queries executed.'),\n    successful: z.number().int().nonnegative().describe('Queries that returned results.'),\n    failed: z.number().int().nonnegative().describe('Queries that failed.'),\n    execution_time_ms: z.number().int().nonnegative().describe('Wall clock time in milliseconds.'),\n    llm_classified: z.boolean().describe('Whether LLM classification was applied.'),\n    llm_error: z.string().optional().describe('LLM error if classification failed and fell back to raw.'),\n    scope: z.enum(['web', 'reddit', 'both']).optional().describe('Search scope used.'),\n    coverage_summary: z\n      .array(z.object({\n        query: z.string().describe('The search query.'),\n        result_count: z.number().int().nonnegative().describe('Results returned for this query.'),\n        top_url: z.string().optional().describe('Domain of the top result.'),\n      }))\n      .optional()\n      .describe('Per-query result counts and top URLs.'),\n    low_yield_queries: z\n      .array(z.string())\n      .optional()\n      .describe('Queries that produced 0-1 results.'),\n    query_rewrites: z\n      .array(z.object({\n        original: z.string().describe('The query as the agent submitted it.'),\n        rewritten: z.string().describe('The query as dispatched to Google after Phase A normalization.'),\n        rules: z.array(z.string()).describe('Rule ids applied (A1=operator-char de-quote, A2=path/URL de-quote, A3=phrase-AND collapse).'),\n      }))\n      .optional()\n      .describe('Pre-dispatch query rewrites \u2014 Phase A normalizations (operator-char and path/URL de-quote, phrase-AND \u2192 anchor + OR collapse).'),\n    retried_queries: z\n      .array(z.object({\n        original: z.string().describe('The query as dispatched (post-Phase-A) that returned 0 results.'),\n        retried_with: z.string().describe('The relaxed form retried after the empty initial response.'),\n        rules: z.array(z.string()).describe('Rule ids applied (B1=strip all quotes, B2=drop site: filter).'),\n        recovered_results: z.number().int().nonnegative().describe('How many hits the retry produced; 0 means the retry also failed.'),\n      }))\n      .optional()\n      .describe('On-empty retries \u2014 Phase B relaxations applied after the initial Serper batch returned 0 results for a query.'),\n    retry_error: z\n      .object({\n        phase: z.literal('relax-retry').describe('Retry phase that failed after the initial batch succeeded.'),\n        code: z.string().describe('Structured error code from the retry batch.'),\n        message: z.string().describe('Provider error message from the retry batch.'),\n        retryable: z.boolean().describe('Whether the retry-batch provider failure is retryable.'),\n        statusCode: z.number().int().optional().describe('Provider status code when available.'),\n      })\n      .optional()\n      .describe('Non-fatal failure from the relaxed retry batch; initial search results were preserved.'),\n  }).strict(),\n}).strict();\n\nexport type WebSearchOutput = z.infer<typeof webSearchOutputSchema>;\n"],
+  "mappings": "AAAA,SAAS,SAAS;AAEX,MAAM,8BAA8B;AAAA,EACzC;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAEO,MAAM,8BAA8B;AAAA,EACzC;AAAA,EACA;AAAA,EACA;AAAA,EACA,GAAG;AAAA,EACH;AACF;AAEO,MAAM,mCAAmC,4BAA4B,KAAK,GAAG;AAE7E,MAAM,wBAAwB,EAAE,OAAO;AAAA,EAC5C,SAAS,EACN;AAAA,IACC,EAAE,OAAO,EACN,IAAI,GAAG,EAAE,SAAS,oCAAoC,CAAC,EACvD;AAAA,MACC,gFAAgF,gCAAgC;AAAA,IAClH;AAAA,EACJ,EACC,IAAI,GAAG,EAAE,SAAS,wCAAwC,CAAC,EAC3D;AAAA,IACC,iDAAiD,gCAAgC;AAAA,EACnF;AAAA,EACF,SAAS,EACN,OAAO,EACP,IAAI,GAAG,EAAE,SAAS,sCAAsC,CAAC,EACzD;AAAA,IACC;AAAA,EACF;AAAA,EACF,KAAK,EACF,QAAQ,EACR,QAAQ,KAAK,EACb,SAAS,oGAAoG;AAAA,EAChH,OAAO,EACJ,KAAK,CAAC,OAAO,UAAU,MAAM,CAAC,EAC9B,QAAQ,KAAK,EACb;AAAA,IACC;AAAA,EACF;AAAA,EACF,SAAS,EACN,QAAQ,EACR,QAAQ,KAAK,EACb;AAAA,IACC;AAAA,EACF;AACJ,CAAC,EAAE,OAAO;AAIH,MAAM,wBAAwB,EAAE,OAAO;AAAA,EAC5C,SAAS,EACN,OAAO,EACP;AAAA,IACC;AAAA,EACF;AAAA,EACF,SAAS,EACN,MAAM,EAAE,OAAO;AAAA,IACd,MAAM,EAAE,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,SAAS,qCAAqC;AAAA,IAChF,KAAK,EAAE,OAAO,EAAE,SAAS,aAAa;AAAA,IACtC,OAAO,EAAE,OAAO,EAAE,SAAS,6BAA6B;AAAA,IACxD,SAAS,EAAE,OAAO,EAAE,SAAS,iCAAiC;AAAA,IAC9D,aAAa,EACV,KAAK,CAAC,UAAU,UAAU,QAAQ,QAAQ,SAAS,MAAM,OAAO,QAAQ,SAAS,KAAK,CAAC,EACvF;AAAA,MACC;AAAA,IACF;AAAA,IACF,OAAO,EAAE,OAAO,EAAE,SAAS,kDAAkD;AAAA,IAC7E,SAAS,EAAE,OAAO,EAAE,IAAI,EAAE,YAAY,EAAE,SAAS,+CAA+C;AAAA,IAChG,eAAe,EAAE,OAAO,EAAE,IAAI,EAAE,YAAY,EAAE,SAAS,uCAAuC;AAAA,EAChG,CAAC,CAAC,EACD,SAAS,EACT,SAAS,8FAAyF;AAAA,EACrG,UAAU,EAAE,OAAO;AAAA,IACjB,aAAa,EAAE,OAAO,EAAE,IAAI,EAAE,YAAY,EAAE,SAAS,6BAA6B;AAAA,IAClF,YAAY,EAAE,OAAO,EAAE,IAAI,EAAE,YAAY,EAAE,SAAS,gCAAgC;AAAA,IACpF,QAAQ,EAAE,OAAO,EAAE,IAAI,EAAE,YAAY,EAAE,SAAS,sBAAsB;AAAA,IACtE,mBAAmB,EAAE,OAAO,EAAE,IAAI,EAAE,YAAY,EAAE,SAAS,kCAAkC;AAAA,IAC7F,gBAAgB,EAAE,QAAQ,EAAE,SAAS,yCAAyC;AAAA,IAC9E,WAAW,EAAE,OAAO,EAAE,SAAS,EAAE,SAAS,0DAA0D;AAAA,IACpG,OAAO,EAAE,KAAK,CAAC,OAAO,UAAU,MAAM,CAAC,EAAE,SAAS,EAAE,SAAS,oBAAoB;AAAA,IACjF,kBAAkB,EACf,MAAM,EAAE,OAAO;AAAA,MACd,OAAO,EAAE,OAAO,EAAE,SAAS,mBAAmB;AAAA,MAC9C,cAAc,EAAE,OAAO,EAAE,IAAI,EAAE,YAAY,EAAE,SAAS,kCAAkC;AAAA,MACxF,SAAS,EAAE,OAAO,EAAE,SAAS,EAAE,SAAS,2BAA2B;AAAA,IACrE,CAAC,CAAC,EACD,SAAS,EACT,SAAS,uCAAuC;AAAA,IACnD,mBAAmB,EAChB,MAAM,EAAE,OAAO,CAAC,EAChB,SAAS,EACT,SAAS,oCAAoC;AAAA,IAChD,gBAAgB,EACb,MAAM,EAAE,OAAO;AAAA,MACd,UAAU,EAAE,OAAO,EAAE,SAAS,sCAAsC;AAAA,MACpE,WAAW,EAAE,OAAO,EAAE,SAAS,gEAAgE;AAAA,MAC/F,OAAO,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,SAAS,6FAA6F;AAAA,IACnI,CAAC,CAAC,EACD,SAAS,EACT,SAAS,0IAAgI;AAAA,IAC5I,iBAAiB,EACd,MAAM,EAAE,OAAO;AAAA,MACd,UAAU,EAAE,OAAO,EAAE,SAAS,iEAAiE;AAAA,MAC/F,cAAc,EAAE,OAAO,EAAE,SAAS,4DAA4D;AAAA,MAC9F,OAAO,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,SAAS,+DAA+D;AAAA,MACnG,mBAAmB,EAAE,OAAO,EAAE,IAAI,EAAE,YAAY,EAAE,SAAS,kEAAkE;AAAA,IAC/H,CAAC,CAAC,EACD,SAAS,EACT,SAAS,oHAA+G;AAAA,IAC3H,aAAa,EACV,OAAO;AAAA,MACN,OAAO,EAAE,QAAQ,aAAa,EAAE,SAAS,4DAA4D;AAAA,MACrG,MAAM,EAAE,OAAO,EAAE,SAAS,6CAA6C;AAAA,MACvE,SAAS,EAAE,OAAO,EAAE,SAAS,8CAA8C;AAAA,MAC3E,WAAW,EAAE,QAAQ,EAAE,SAAS,wDAAwD;AAAA,MACxF,YAAY,EAAE,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,SAAS,sCAAsC;AAAA,IACzF,CAAC,EACA,SAAS,EACT,SAAS,wFAAwF;AAAA,EACtG,CAAC,EAAE,OAAO;AACZ,CAAC,EAAE,OAAO;",
   "names": []
 }

package/dist/src/services/llm-processor.js

@@ -1,5 +1,6 @@
 import OpenAI from "openai";
 import { LLM_EXTRACTION, getCapabilities } from "../config/index.js";
+import { QUERY_REWRITE_PAIR_GUIDANCE_TEXT } from "../schemas/web-search.js";
 import {
   classifyError,
   sleep,
@@ -690,7 +691,10 @@ first_call_sequence:
 
 keyword_seeds:
 - 25\u201350 total. Narrow bug \u2192 fewer. Open synthesis \u2192 more.
-- Use operators where helpful (site:, quotes, verbatim version numbers).
+- Write Google retrieval probes, not topic labels.
+- For each broad idea, first do a bad \u2192 better rewrite in your head: replace a vague phrase with a query that names the evidence source class, discriminating anchor terms, and one useful operator when possible.
+- ${QUERY_REWRITE_PAIR_GUIDANCE_TEXT}
+- Use operators where helpful (site:, quotes, verbatim version numbers, exact error text, package names, release/version strings).
 - DIVERSE facets \u2014 same noun-phrase cannot repeat across seeds with adjectives-only variation.
 - Do NOT invent vendor names you are uncertain exist.
 - For \`site:<domain>\` filters, ONLY use domains you are highly confident are real. Safe choices: \`github.com\`, \`stackoverflow.com\`, \`reddit.com\`, \`news.ycombinator.com\`, \`arxiv.org\`, \`nvd.nist.gov\`, \`pypi.org\`, \`npmjs.com\`, plus any canonical homepage/docs domain explicitly spelled out in the goal itself (e.g. goal names "Cursor" \u2192 \`cursor.com\`/\`docs.cursor.com\` is acceptable). If you don't know the product's real docs domain, leave the query open (no \`site:\`) instead of guessing.

package/dist/src/services/llm-processor.js.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../../src/services/llm-processor.ts"],
-  "sourcesContent": ["/**\n * LLM Processor for content extraction\n * Uses any OpenAI-compatible endpoint. Reasoning effort is always 'low'.\n * Primary model exhausts its retries first; fallback model (LLM_FALLBACK_MODEL) then\n * gets up to FALLBACK_RETRY_COUNT additional attempts before the call fails.\n * NEVER throws \u2014 always returns a valid result.\n */\n\nimport OpenAI from 'openai';\nimport { LLM_EXTRACTION, getCapabilities } from '../config/index.js';\nimport {\n  classifyError,\n  sleep,\n  ErrorCode,\n  withStallProtection,\n  type StructuredError,\n} from '../utils/errors.js';\nimport { mcpLog } from '../utils/logger.js';\n\n/** Maximum input characters for LLM processing (~125k tokens, sized for the larger fallback model) */\nconst MAX_LLM_INPUT_CHARS = 500_000 as const;\n\n/**\n * Maximum input characters for the primary model when it has a smaller context window.\n * Used when an input would exceed the mini model's limits so the call goes straight to fallback\n * instead of burning retries on guaranteed context_length_exceeded errors.\n */\nconst MAX_PRIMARY_MODEL_INPUT_CHARS = 100_000 as const;\n\n/** LLM client timeout in milliseconds */\nconst LLM_CLIENT_TIMEOUT_MS = 600_000 as const;\n\n/** Jitter factor for exponential backoff */\nconst BACKOFF_JITTER_FACTOR = 0.3 as const;\n\n/** Stall detection timeout \u2014 abort if no response in this time */\nconst LLM_STALL_TIMEOUT_MS = 75_000 as const;\n\n/** Hard request deadline for LLM calls */\nconst LLM_REQUEST_DEADLINE_MS = 150_000 as const;\n\n// ============================================================================\n// LLM health tracking \u2014 surfaced via health://status so capability-aware\n// clients can branch on degraded mode without parsing per-call footers.\n// ============================================================================\n\ntype LLMHealthKind = 'planner' | 'extractor';\n\nexport interface LLMHealthSnapshot {\n  readonly lastPlannerOk: boolean;\n  readonly lastExtractorOk: boolean;\n  readonly lastPlannerCheckedAt: string | null;\n  readonly lastExtractorCheckedAt: string | null;\n  readonly lastPlannerError: string | null;\n  readonly lastExtractorError: string | null;\n  readonly plannerConfigured: boolean;\n  readonly extractorConfigured: boolean;\n  /** Failures since the last success. Reset to 0 on `markLLMSuccess`. */\n  readonly consecutivePlannerFailures: number;\n  readonly consecutiveExtractorFailures: number;\n}\n\nconst llmHealth = {\n  lastPlannerOk: false,\n  lastExtractorOk: false,\n  lastPlannerCheckedAt: null as string | null,\n  lastExtractorCheckedAt: null as string | null,\n  lastPlannerError: null as string | null,\n  lastExtractorError: null as string | null,\n  consecutivePlannerFailures: 0,\n  consecutiveExtractorFailures: 0,\n};\n\nexport function markLLMSuccess(kind: LLMHealthKind): void {\n  const ts = new Date().toISOString();\n  if (kind === 'planner') {\n    llmHealth.lastPlannerOk = true;\n    llmHealth.lastPlannerCheckedAt = ts;\n    llmHealth.lastPlannerError = null;\n    llmHealth.consecutivePlannerFailures = 0;\n  } else {\n    llmHealth.lastExtractorOk = true;\n    llmHealth.lastExtractorCheckedAt = ts;\n    llmHealth.lastExtractorError = null;\n    llmHealth.consecutiveExtractorFailures = 0;\n  }\n}\n\nexport function markLLMFailure(kind: LLMHealthKind, err: unknown): void {\n  const ts = new Date().toISOString();\n  const message = err instanceof Error ? err.message : String(err ?? 'unknown error');\n  if (kind === 'planner') {\n    llmHealth.lastPlannerOk = false;\n    llmHealth.lastPlannerCheckedAt = ts;\n    llmHealth.lastPlannerError = message;\n    llmHealth.consecutivePlannerFailures += 1;\n  } else {\n    llmHealth.lastExtractorOk = false;\n    llmHealth.lastExtractorCheckedAt = ts;\n    llmHealth.lastExtractorError = message;\n    llmHealth.consecutiveExtractorFailures += 1;\n  }\n}\n\nexport function getLLMHealth(): LLMHealthSnapshot {\n  const cap = getCapabilities();\n  return {\n    lastPlannerOk: llmHealth.lastPlannerOk,\n    lastExtractorOk: llmHealth.lastExtractorOk,\n    lastPlannerCheckedAt: llmHealth.lastPlannerCheckedAt,\n    lastExtractorCheckedAt: llmHealth.lastExtractorCheckedAt,\n    lastPlannerError: llmHealth.lastPlannerError,\n    lastExtractorError: llmHealth.lastExtractorError,\n    // Static capability \u2014 based on env presence at boot. Runtime health (above)\n    // tells whether the last attempt actually succeeded.\n    plannerConfigured: cap.llmExtraction,\n    extractorConfigured: cap.llmExtraction,\n    consecutivePlannerFailures: llmHealth.consecutivePlannerFailures,\n    consecutiveExtractorFailures: llmHealth.consecutiveExtractorFailures,\n  };\n}\n\n/** Test-only \u2014 reset state between tests. Not exported from index. */\nexport function _resetLLMHealthForTests(): void {\n  llmHealth.lastPlannerOk = false;\n  llmHealth.lastExtractorOk = false;\n  llmHealth.lastPlannerCheckedAt = null;\n  llmHealth.lastExtractorCheckedAt = null;\n  llmHealth.lastPlannerError = null;\n  llmHealth.lastExtractorError = null;\n  llmHealth.consecutivePlannerFailures = 0;\n  llmHealth.consecutiveExtractorFailures = 0;\n}\n\ninterface ProcessingConfig {\n  readonly enabled: boolean;\n  readonly extract: string | undefined;\n  readonly url?: string;\n}\n\ninterface LLMResult {\n  readonly content: string;\n  readonly processed: boolean;\n  readonly error?: string;\n  readonly errorDetails?: StructuredError;\n}\n\n// LLM-specific retry configuration\nconst LLM_RETRY_CONFIG = {\n  maxRetries: 2,\n  baseDelayMs: 1000,\n  maxDelayMs: 5000,\n} as const;\n\n/** Number of additional attempts using the fallback model after primary exhausts. */\nconst FALLBACK_RETRY_COUNT = 3 as const;\n\n// OpenAI-compatible retryable error codes (using Set for type-safe lookup)\nconst RETRYABLE_LLM_ERROR_CODES = new Set([\n  'rate_limit_exceeded',\n  'server_error',\n  'timeout',\n  'service_unavailable',\n]);\n\n/** Type guard for errors with an HTTP status code */\nfunction hasStatus(error: unknown): error is { status: number } {\n  return (\n    typeof error === 'object' &&\n    error !== null &&\n    'status' in error &&\n    typeof (error as Record<string, unknown>).status === 'number'\n  );\n}\n\nlet llmClient: OpenAI | null = null;\n\ninterface ChatCompletionTextResponse {\n  readonly choices?: ReadonlyArray<{\n    readonly message?: {\n      readonly content?: string | null;\n    } | null;\n  } | null>;\n}\n\nexport interface OpenAITextGenerator {\n  readonly chat: {\n    readonly completions: {\n      readonly create: (\n        body: OpenAI.ChatCompletionCreateParamsNonStreaming,\n        options: { readonly signal?: AbortSignal; readonly timeout: number },\n      ) => Promise<ChatCompletionTextResponse>;\n    };\n  };\n}\n\ninterface LLMTextSuccess {\n  readonly content: string;\n  readonly model: string;\n}\n\ninterface LLMTextEmptyFailure {\n  readonly content: null;\n  readonly model: string;\n  readonly error: string;\n  readonly failureKind: 'empty';\n}\n\ninterface LLMTextProviderFailure {\n  readonly content: null;\n  readonly model: string;\n  readonly error: string;\n  readonly failureKind: 'provider';\n  readonly errorCause: unknown;\n}\n\ntype LLMTextFailure = LLMTextEmptyFailure | LLMTextProviderFailure;\n\nexport type LLMTextResponse = LLMTextSuccess | LLMTextFailure;\n\nexport function createLLMProcessor(): OpenAI | null {\n  if (!getCapabilities().llmExtraction) return null;\n\n  if (!llmClient) {\n    llmClient = new OpenAI({\n      baseURL: LLM_EXTRACTION.BASE_URL,\n      apiKey: LLM_EXTRACTION.API_KEY,\n      timeout: LLM_CLIENT_TIMEOUT_MS,\n      maxRetries: 0,\n      defaultHeaders: { 'X-Title': 'mcp-research-powerpack' },\n    });\n    mcpLog('info', `LLM extraction configured (model: ${LLM_EXTRACTION.MODEL}, baseURL: ${LLM_EXTRACTION.BASE_URL})`, 'llm');\n  }\n  return llmClient;\n}\n\nfunction buildChatRequestBody(model: string, prompt: string): Record<string, unknown> {\n  return {\n    model,\n    messages: [{ role: 'user', content: prompt }],\n    reasoning_effort: 'low',\n  };\n}\n\nfunction normalizeProviderError(err: unknown, message: string): unknown {\n  if (typeof err === 'object' && err !== null) return err;\n  return new Error(message);\n}\n\nfunction getProviderFailure(response: LLMTextResponse): unknown | null {\n  if (response.content !== null || response.failureKind !== 'provider') return null;\n  return response.errorCause;\n}\n\nfunction emptyLLMExtractionResult(content: string): LLMResult {\n  return {\n    content,\n    processed: false,\n    error: 'LLM returned empty response',\n    errorDetails: {\n      code: ErrorCode.INTERNAL_ERROR,\n      message: 'LLM returned empty response',\n      retryable: false,\n    },\n  };\n}\n\nexport async function requestText(\n  processor: OpenAITextGenerator,\n  prompt: string,\n  operationLabel: string,\n  signal?: AbortSignal,\n  modelOverride?: string,\n): Promise<LLMTextResponse> {\n  const model = modelOverride || LLM_EXTRACTION.MODEL;\n\n  try {\n    const response = await withStallProtection(\n      (stallSignal) => processor.chat.completions.create(\n        buildChatRequestBody(model, prompt) as unknown as OpenAI.ChatCompletionCreateParamsNonStreaming,\n        {\n          signal: signal ? AbortSignal.any([stallSignal, signal]) : stallSignal,\n          timeout: LLM_REQUEST_DEADLINE_MS,\n        },\n      ),\n      LLM_STALL_TIMEOUT_MS,\n      3,\n      `${operationLabel} (${model})`,\n    );\n\n    const content = response.choices?.[0]?.message?.content?.trim();\n    if (content) {\n      return { content, model };\n    }\n\n    const err = `Empty response from model ${model}`;\n    mcpLog('warning', `${operationLabel} returned empty content for model ${model}`, 'llm');\n    return { content: null, model, error: err, failureKind: 'empty' };\n  } catch (err: unknown) {\n    const message = err instanceof Error ? err.message : String(err);\n    mcpLog('warning', `${operationLabel} failed for model ${model}: ${message}`, 'llm');\n    return {\n      content: null,\n      model,\n      error: message,\n      failureKind: 'provider',\n      errorCause: normalizeProviderError(err, message),\n    };\n  }\n}\n\n/**\n * Single LLM call with automatic fallback model.\n * Tries the primary model once; if it fails and LLM_FALLBACK_MODEL is set,\n * retries up to FALLBACK_RETRY_COUNT times on the fallback model.\n * Used for single-shot calls (classify, brief, refine queries).\n */\nexport async function requestTextWithFallback(\n  processor: OpenAITextGenerator,\n  prompt: string,\n  operationLabel: string,\n  signal?: AbortSignal,\n): Promise<LLMTextResponse> {\n  const primary = await requestText(processor, prompt, operationLabel, signal);\n  if (primary.content !== null) return primary;\n\n  const fallbackModel = LLM_EXTRACTION.FALLBACK_MODEL;\n  if (!fallbackModel) return primary;\n\n  mcpLog('warning', `Primary model failed, switching to fallback ${fallbackModel}`, 'llm');\n\n  let lastFailure: LLMTextFailure = primary;\n  for (let attempt = 0; attempt < FALLBACK_RETRY_COUNT; attempt++) {\n    if (attempt > 0) {\n      const delayMs = calculateLLMBackoff(attempt - 1);\n      mcpLog('warning', `Fallback retry ${attempt}/${FALLBACK_RETRY_COUNT - 1} in ${delayMs}ms`, 'llm');\n      try { await sleep(delayMs, signal); } catch { break; }\n    }\n    const result = await requestText(processor, prompt, `${operationLabel} [fallback]`, signal, fallbackModel);\n    if (result.content !== null) return result;\n    lastFailure = result;\n  }\n\n  return lastFailure;\n}\n\n/**\n * Check if an LLM error is retryable\n */\nfunction isRetryableLLMError(error: unknown): boolean {\n  if (!error || typeof error !== 'object') return false;\n\n  // Stall/timeout protection errors - always retry these\n  const stallCode = (error as { code?: string })?.code;\n  if (stallCode === 'ESTALLED' || stallCode === 'ETIMEDOUT') {\n    return true;\n  }\n\n  // Check HTTP status codes\n  if (hasStatus(error)) {\n    if (error.status === 429 || error.status === 500 || error.status === 502 || error.status === 503 || error.status === 504) {\n      return true;\n    }\n  }\n\n  // Check error codes from the OpenAI-compatible endpoint\n  const record = error as Record<string, unknown>;\n  const code = typeof record.code === 'string' ? record.code : undefined;\n  const nested =\n    typeof record.error === 'object' && record.error !== null\n      ? (record.error as Record<string, unknown>)\n      : null;\n  const errorCode =\n    code ??\n    (nested && typeof nested.code === 'string' ? nested.code : undefined) ??\n    (nested && typeof nested.type === 'string' ? nested.type : undefined);\n  if (errorCode && RETRYABLE_LLM_ERROR_CODES.has(errorCode)) {\n    return true;\n  }\n\n  // Check message for common patterns\n  const message = typeof record.message === 'string' ? record.message.toLowerCase() : '';\n  if (\n    message.includes('rate limit') ||\n    message.includes('timeout') ||\n    message.includes('timed out') ||\n    message.includes('service unavailable') ||\n    message.includes('server error') ||\n    message.includes('connection') ||\n    message.includes('econnreset')\n  ) {\n    return true;\n  }\n\n  return false;\n}\n\n/**\n * Detect \"the prompt is too long for this model\" errors.\n * These are NOT retryable on the same model \u2014 we should skip remaining primary retries\n * and go straight to the fallback model (which has a larger context window).\n */\nfunction isContextWindowError(error: unknown): boolean {\n  if (!error || typeof error !== 'object') return false;\n\n  const record = error as Record<string, unknown>;\n  const nested =\n    typeof record.error === 'object' && record.error !== null\n      ? (record.error as Record<string, unknown>)\n      : null;\n\n  const code = typeof record.code === 'string' ? record.code : undefined;\n  const nestedCode = nested && typeof nested.code === 'string' ? nested.code : undefined;\n  if (code === 'context_length_exceeded' || nestedCode === 'context_length_exceeded') {\n    return true;\n  }\n\n  const messages: string[] = [];\n  if (typeof record.message === 'string') messages.push(record.message);\n  if (nested && typeof nested.message === 'string') messages.push(nested.message);\n  const combined = messages.join(' ').toLowerCase();\n  return (\n    combined.includes('context length') ||\n    combined.includes('context window') ||\n    combined.includes('maximum context') ||\n    combined.includes('maximum tokens') ||\n    combined.includes('token limit') ||\n    combined.includes('too many tokens') ||\n    combined.includes('prompt is too long') ||\n    combined.includes('reduce the length')\n  );\n}\n\n/**\n * Calculate backoff delay with jitter for LLM retries\n */\nfunction calculateLLMBackoff(attempt: number): number {\n  const exponentialDelay = LLM_RETRY_CONFIG.baseDelayMs * Math.pow(2, attempt);\n  const jitter = Math.random() * BACKOFF_JITTER_FACTOR * exponentialDelay;\n  return Math.min(exponentialDelay + jitter, LLM_RETRY_CONFIG.maxDelayMs);\n}\n\n/**\n * Process content with LLM extraction\n * NEVER throws - always returns a valid LLMResult\n * Implements retry logic with exponential backoff for transient failures\n */\nexport async function processContentWithLLM(\n  content: string,\n  config: ProcessingConfig,\n  processor?: OpenAITextGenerator | null,\n  signal?: AbortSignal\n): Promise<LLMResult> {\n  // Early returns for invalid/skip conditions\n  if (!config.enabled) {\n    return { content, processed: false };\n  }\n\n  if (!processor) {\n    return {\n      content,\n      processed: false,\n      error: 'LLM processor not available (LLM_API_KEY, LLM_BASE_URL, and LLM_MODEL must all be set)',\n      errorDetails: {\n        code: ErrorCode.AUTH_ERROR,\n        message: 'LLM processor not available',\n        retryable: false,\n      },\n    };\n  }\n\n  if (!content?.trim()) {\n    return { content: content || '', processed: false, error: 'Empty content provided' };\n  }\n\n  // Truncate extremely long content to avoid blowing past even the fallback model's context.\n  const truncatedContent = content.length > MAX_LLM_INPUT_CHARS\n    ? content.substring(0, MAX_LLM_INPUT_CHARS) + '\\n\\n[Content truncated due to length]'\n    : content;\n\n  // If the prompt would exceed the primary (mini) model's smaller context window,\n  // skip it entirely and go straight to the fallback model. Saves burning retries\n  // on guaranteed context_length_exceeded errors.\n  const skipPrimaryForSize =\n    truncatedContent.length > MAX_PRIMARY_MODEL_INPUT_CHARS && !!LLM_EXTRACTION.FALLBACK_MODEL;\n\n  // Sanitize URL before sending to LLM: drop query string and fragment\n  // so signed URLs, session tokens, auth params, or tracking hashes never\n  // land in a third-party LLM prompt. Keep origin + path for page-type classification.\n  const safeUrl = (() => {\n    if (!config.url) return undefined;\n    try {\n      const u = new URL(config.url);\n      return `${u.origin}${u.pathname}`;\n    } catch {\n      return undefined;\n    }\n  })();\n  const urlLine = safeUrl ? `PAGE URL: ${safeUrl}\\n\\n` : '';\n\n  const prompt = config.extract\n    ? `You are a factual extractor for a research agent. Extract ONLY the information that matches the instruction below. Do not summarize, interpret, or editorialize.\n\n${urlLine}EXTRACTION INSTRUCTION: ${config.extract}\n\nSTEP 1 \u2014 Classify this page. Look at the URL if present, plus structural cues (code blocks, table patterns, comment threads, marketing copy). Pick ONE:\n\\`docs | changelog | github-readme | github-thread | reddit | hackernews | forum | blog | marketing | announcement | qa | cve | paper | release-notes | other\\`\n\nSTEP 2 \u2014 Adjust emphasis by page type:\n- docs / changelog / github-readme / release-notes \u2192 API signatures, version numbers, flags, exact config keys, code blocks. Copy verbatim. Preserve tables as tables.\n- github-thread \u2192 weight MAINTAINER comments (label \"[maintainer]\") over drive-by commenters. Preserve stacktraces verbatim. Capture chronological resolution \u2014 what was decided and when. Link the accepted-fix commit/PR if referenced.\n- reddit / hackernews / forum \u2192 lived experience. Quote verbatim with attribution (\"u/foo wrote: \u2026\" or \"user <name>\"). Prioritize replies with stack details, specific failure stories, or replies that contradict the OP. Record overall sentiment distribution as one bullet if clear skew (\"~70% agree / ~20% dissent / rest off-topic\"). Drop context-free opinions (\"this sucks\") from Matches.\n- blog \u2192 prioritize concrete reproductions, code, measurements. If the author makes a claim without evidence, mark \"[unsourced claim]\".\n- marketing / announcement \u2192 pricing tiers, feature matrices verbatim, free-tier quotas, enterprise contact. Preserve tables as tables. Treat roadmap/future-tense claims skeptically \u2014 note them as \"[announced, not shipped]\" when framing is future-tense.\n- qa (stackoverflow) \u2192 accepted answer's code + high-voted disagreements. Always note the answer date \u2014 SO rots.\n- cve \u2192 CVSS vector verbatim, CWE, CPE ranges, affected versions, fix version, references. Each with its label.\n- paper \u2192 claim, method, dataset, benchmark numbers, comparison baseline. Preserve numeric deltas verbatim.\n\nSTEP 3 \u2014 Emit markdown with these sections, in order:\n\n## Source\n- URL: <verbatim if visible, else \"unknown\">\n- Page type: <the type you picked>\n- Page date: <verbatim if visible, else \"not visible\">\n- Author / maintainer (if identifiable): <verbatim>\n\n## Matches\nOne bullet per distinct piece of matching info:\n- **<short label>** \u2014 the information. Quote VERBATIM for: numbers, versions, dates, API names, prices, error messages, stacktraces, CVSS vectors, benchmark scores, command flags, proper nouns, and people's words. Backticks for code/identifiers. Preserve tables.\n\n## Not found\nEvery part of the extraction instruction this page did NOT answer. Be explicit. Example: \"Enterprise pricing contact \u2014 not present on this page.\"\n\n## Follow-up signals\nShort bullets \u2014 NEW angles this page surfaced that the agent should investigate. Include: new terms, unexpected vendor names, contradicting claims, referenced-but-unscraped URLs. Copy URLs VERBATIM from the source; if only anchor text is visible, write \"anchor: <text> (URL not in scraped content)\". Skip this section if nothing new surfaced. Do NOT invent.\n\n## Contradictions\n(Include this section only if the page contains internally contradictory claims.) Bullet each contradiction with both sides quoted verbatim.\n\n## Truncation\n(Include only if content appears cut mid-element.) \"Content cut mid-<table row / code block / comment / paragraph>; extraction may be incomplete for <section>.\"\n\nRULES:\n- Never paraphrase numbers, versions, code, or quoted text.\n- If an instruction item is not answered, it goes in \"Not found\" \u2014 do NOT invent an answer to please the caller.\n- Preserve code blocks, command examples, tables exactly.\n- Do NOT add commentary or recommendations outside \"Follow-up signals\".\n- Page language \u2260 English: quote verbatim in the original language AND provide a parenthetical gloss in English.\n- Page appears gated (login wall, paywall, JS-render-empty shell) or near-empty: BEFORE dismissing the page, look for ANY visible text \u2014 og:title, og:description, meta description, headline, author name, nav labels, teaser/preview sentences, visible comment snippets. If ANY such text exists, extract it as usual under \\`## Source\\` + \\`## Matches\\`, and list the blocked facets under \\`## Not found\\`. Prefix the first \\`## Matches\\` bullet with \\`**[partial \u2014 <reason>]**\\` so the caller knows the body is gated (reasons: \\`login-wall | paywall | JS-render-empty | truncated-before-relevant-section\\`). ONLY when there is NO visible extractable text at all (< 50 words AND no og:* AND no headline AND no preview), return exactly one line:\n  \\`## Matches\\\\n_Page did not load: <reason>_\\`\n  Valid reasons: \\`404 | login-wall | paywall | JS-render-empty | non-text-asset | truncated-before-relevant-section\\`.\n\nContent:\n${truncatedContent}`\n    : `Clean the following page content: drop navigation, ads, cookie banners, footers, author bios, related-article lists. Preserve headings, paragraphs, code blocks, tables, and inline links as \\`[text](url)\\`. Do NOT summarize \u2014 preserve the full body.\n\n${urlLine}Content:\n${truncatedContent}`;\n\n  let lastError: StructuredError | undefined;\n\n  // Phase 1: primary model with up to LLM_RETRY_CONFIG.maxRetries retries.\n  // Skip entirely when the input is too big for the primary's context window.\n  if (skipPrimaryForSize) {\n    mcpLog(\n      'info',\n      `Input ${truncatedContent.length} chars exceeds primary model cap (${MAX_PRIMARY_MODEL_INPUT_CHARS}); routing directly to fallback`,\n      'llm',\n    );\n  } else {\n    for (let attempt = 0; attempt <= LLM_RETRY_CONFIG.maxRetries; attempt++) {\n      try {\n        if (attempt === 0) {\n          mcpLog('info', `Starting extraction with ${LLM_EXTRACTION.MODEL}`, 'llm');\n        } else {\n          mcpLog('warning', `Retry attempt ${attempt}/${LLM_RETRY_CONFIG.maxRetries}`, 'llm');\n        }\n\n        const response = await requestText(processor, prompt, 'LLM extraction', signal);\n\n        if (response.content !== null) {\n          mcpLog('info', `Successfully extracted ${response.content.length} characters`, 'llm');\n          markLLMSuccess('extractor');\n          return { content: response.content, processed: true };\n        }\n\n        const providerFailure = getProviderFailure(response);\n        if (providerFailure) {\n          throw providerFailure;\n        }\n\n        // Empty response \u2014 not retryable\n        mcpLog('warning', 'Received empty response from LLM', 'llm');\n        markLLMFailure('extractor', 'LLM returned empty response');\n        return emptyLLMExtractionResult(content);\n\n      } catch (err: unknown) {\n        lastError = classifyError(err);\n        const status = hasStatus(err) ? err.status : undefined;\n        const code = typeof err === 'object' && err !== null && 'code' in err\n          ? String((err as Record<string, unknown>).code)\n          : undefined;\n        const ctxErr = isContextWindowError(err);\n        mcpLog('error', `Error (attempt ${attempt + 1}): ${lastError.message} [status=${status}, code=${code}, retryable=${isRetryableLLMError(err)}, context_window=${ctxErr}]`, 'llm');\n\n        // Context window errors are not retryable on the same model \u2014 jump to fallback.\n        if (ctxErr) {\n          mcpLog('warning', 'Context window exceeded on primary \u2014 skipping remaining retries, routing to fallback', 'llm');\n          break;\n        }\n\n        if (isRetryableLLMError(err) && attempt < LLM_RETRY_CONFIG.maxRetries) {\n          const delayMs = calculateLLMBackoff(attempt);\n          mcpLog('warning', `Retrying in ${delayMs}ms...`, 'llm');\n          try { await sleep(delayMs, signal); } catch { break; }\n          continue;\n        }\n        break;\n      }\n    }\n  }\n\n  // Phase 2: fallback model \u2014 FALLBACK_RETRY_COUNT attempts before giving up\n  const fallbackModel = LLM_EXTRACTION.FALLBACK_MODEL;\n  if (fallbackModel) {\n    mcpLog('warning', `Primary exhausted, switching to fallback ${fallbackModel}`, 'llm');\n    for (let attempt = 0; attempt < FALLBACK_RETRY_COUNT; attempt++) {\n      if (attempt > 0) {\n        const delayMs = calculateLLMBackoff(attempt - 1);\n        mcpLog('warning', `Fallback retry ${attempt}/${FALLBACK_RETRY_COUNT - 1} in ${delayMs}ms`, 'llm');\n        try { await sleep(delayMs, signal); } catch { break; }\n      }\n      try {\n        const response = await requestText(processor, prompt, 'LLM extraction [fallback]', signal, fallbackModel);\n        if (response.content !== null) {\n          mcpLog('info', `Fallback extracted ${response.content.length} characters`, 'llm');\n          markLLMSuccess('extractor');\n          return { content: response.content, processed: true };\n        }\n\n        const providerFailure = getProviderFailure(response);\n        if (providerFailure) {\n          throw providerFailure;\n        }\n\n        mcpLog('warning', 'Fallback returned empty response', 'llm');\n        markLLMFailure('extractor', 'LLM returned empty response');\n        return emptyLLMExtractionResult(content);\n      } catch (err: unknown) {\n        lastError = classifyError(err);\n        mcpLog('error', `Fallback error (attempt ${attempt + 1}): ${lastError.message}`, 'llm');\n      }\n    }\n  }\n\n  const errorMessage = lastError?.message || 'Unknown LLM error';\n  mcpLog('error', `All attempts failed: ${errorMessage}. Returning original content.`, 'llm');\n  markLLMFailure('extractor', errorMessage);\n\n  return {\n    content,\n    processed: false,\n    error: `LLM extraction failed: ${errorMessage}`,\n    errorDetails: lastError || {\n      code: ErrorCode.UNKNOWN_ERROR,\n      message: errorMessage,\n      retryable: false,\n    },\n  };\n}\n\n// ============================================================================\n// Web-Search Result Classification\n// ============================================================================\n\n/** Maximum URLs to send to the LLM for classification */\nconst MAX_CLASSIFICATION_URLS = 50 as const;\n\n/** Classification tiers */\ntype ClassificationTier = 'HIGHLY_RELEVANT' | 'MAYBE_RELEVANT' | 'OTHER';\n\nexport interface ClassificationEntry {\n  readonly rank: number;\n  readonly tier: ClassificationTier;\n  readonly source_type?: string;\n  readonly reason?: string;\n}\n\nexport interface ClassificationGap {\n  readonly id: number;\n  readonly description: string;\n}\n\nexport interface ClassificationResult {\n  readonly title: string;\n  readonly synthesis: string;\n  readonly results: ClassificationEntry[];\n  readonly refine_queries?: Array<{\n    readonly query: string;\n    readonly rationale: string;\n    readonly gap_id?: number;\n  }>;\n  readonly confidence?: 'high' | 'medium' | 'low';\n  readonly confidence_reason?: string;\n  readonly gaps?: ClassificationGap[];\n}\n\nexport interface RefineQuerySuggestion {\n  readonly query: string;\n  readonly rationale: string;\n  readonly gap_id?: number;\n  readonly gap_description?: string;\n}\n\n/**\n * Classify web-search results by relevance to an objective using the LLM.\n * Sends only titles, snippets, and domain names \u2014 does NOT fetch URLs.\n * Returns null on failure (caller should fall back to raw output).\n */\nexport async function classifySearchResults(\n  rankedUrls: ReadonlyArray<{\n    readonly rank: number;\n    readonly url: string;\n    readonly title: string;\n    readonly snippet: string;\n    readonly frequency: number;\n    readonly queries: string[];\n  }>,\n  objective: string,\n  totalQueries: number,\n  processor: OpenAI,\n  previousQueries: readonly string[] = [],\n): Promise<{ result: ClassificationResult | null; error?: string }> {\n  const urlsToClassify = rankedUrls.slice(0, MAX_CLASSIFICATION_URLS);\n\n  // Descending static weights fed to the LLM. Higher-ranked URLs get a bigger\n  // weight so the classifier biases HIGHLY_RELEVANT toward them. The weights\n  // here are a shown-to-LLM summary, not the internal CTR ranking (which\n  // still runs in url-aggregator.ts). Rank 11+ all bucket to w=1.\n  const STATIC_WEIGHTS = [30, 20, 15, 10, 8, 6, 5, 4, 3, 2] as const;\n  const weightForRank = (rank: number): number => STATIC_WEIGHTS[rank - 1] ?? 1;\n\n  // Build compressed result list \u2014 weight + title + domain + snippet (truncated)\n  const lines: string[] = [];\n  for (const url of urlsToClassify) {\n    let domain: string;\n    try {\n      domain = new URL(url.url).hostname.replace(/^www\\./, '');\n    } catch {\n      domain = url.url;\n    }\n    const snippet = url.snippet.length > 120\n      ? url.snippet.slice(0, 117) + '...'\n      : url.snippet;\n    lines.push(`[${url.rank}] w=${weightForRank(url.rank)} ${url.title} \u2014 ${domain} \u2014 ${snippet}`);\n  }\n\n  const prevQueriesBlock = previousQueries.length > 0\n    ? previousQueries.map((q) => `- ${q}`).join('\\n')\n    : '- (none provided)';\n  const today = new Date().toISOString().slice(0, 10);\n\n  const prompt = `You are the relevance filter for a research agent. Classify each search result below against the objective and produce a structured analysis.\n\nOBJECTIVE: ${objective}\nTODAY: ${today}\n\nPREVIOUS QUERIES (already run \u2014 do NOT paraphrase in refine_queries):\n${prevQueriesBlock}\n\nReturn ONLY a JSON object (no markdown, no code fences):\n\n{\n  \"title\": \"2\u20138 word label for this RESULT CLUSTER (not the objective)\",\n  \"synthesis\": \"3\u20135 sentences grounded in the results. Every non-trivial claim cites a rank in [brackets], e.g. '[3] documents the flag; [7][12] report it is broken on macOS.' A synthesis with zero citations is invalid.\",\n  \"confidence\": \"high | medium | low\",\n  \"confidence_reason\": \"one sentence \u2014 why\",\n  \"gaps\": [\n    { \"id\": 0, \"description\": \"specific, actionable thing the current results do NOT answer \u2014 not 'more info needed'\" }\n  ],\n  \"refine_queries\": [\n    { \"query\": \"concrete next search\", \"gap_id\": 0, \"rationale\": \"\u226412 words\" }\n  ],\n  \"results\": [\n    {\n      \"rank\": 1,\n      \"tier\": \"HIGHLY_RELEVANT | MAYBE_RELEVANT | OTHER\",\n      \"source_type\": \"vendor_doc | github | reddit | hackernews | blog | news | marketing | stackoverflow | cve | paper | release_notes | aggregator | other\",\n      \"reason\": \"\u226412 words citing the snippet cue that drove the tier\"\n    }\n  ]\n}\n\nWEIGHT SCHEME: each row is prefixed with a weight (w=N). Higher weight means the URL ranked better across input queries \u2014 prefer HIGHLY_RELEVANT for high-weight rows when content matches the objective. Weight alone never justifies HIGHLY_RELEVANT; snippet cues still drive the decision.\n\nSOURCE-OF-TRUTH RUBRIC (the \"primary source\" is goal-dependent \u2014 infer goal type from the objective):\n- spec / API / config questions \u2192 vendor_doc, github (README, RFC), release_notes are primary\n- bug / failure-mode questions \u2192 github (issue/PR), stackoverflow are primary\n- migration / sentiment / lived-experience \u2192 reddit, hackernews, blog are primary; docs are secondary\n- pricing / commercial \u2192 marketing (the vendor's own pricing page IS the primary source, but treat feature lists skeptically)\n- security / CVE \u2192 cve databases, distro security trackers (nvd.nist.gov, security-tracker.debian.org, ubuntu.com/security) are primary\n- synthesis / open-ended \u2192 blend; no single type is primary\n- product launch \u2192 vendor_doc + news + marketing for the launch itself; blogs + reddit for independent verification\n\nFRESHNESS: proportional to topic velocity. For a week-old release, demote anything older than 30 days. For general tech questions, demote older than 18 months. For stable protocols (HTTP, TCP, POSIX), don't demote by age.\n\nCONFIDENCE:\n- high = \u22653 HIGHLY_RELEVANT results from INDEPENDENT domains agree on the core answer\n- medium = \u22652 HIGHLY_RELEVANT exist but disagree or share a domain; OR a single authoritative primary source answers it\n- low = otherwise; snippet-only judgments cap at medium\n\nREFINE QUERIES \u2014 each MUST differ from every previousQuery by:\n- a new operator (site:, quotes, verbatim version number), OR\n- a domain-specific noun ABSENT from every prior query\nAdding a year alone does NOT count as differentiation.\nEach refine_query MUST reference a specific gap_id from the gaps array above.\nProduce 4\u20138 refine_queries total. Cover: (a) a primary-source probe, (b) a temporal sharpener, (c) a failure-mode or comparison probe, (d) at least one new-term probe seeded by a specific result's snippet.\n\nRULES:\n- Classify ALL ${urlsToClassify.length} results. Do not skip or collapse any.\n- Use only the three tier values.\n- Judge from title + domain + snippet only. Do NOT invent facts not present in the snippet.\n- If ALL results are OTHER: synthesis = \"\", confidence = \"low\", and \\`gaps\\` must explicitly state why the current queries missed the target.\n- Casing: tier = UPPERCASE_WITH_UNDERSCORES, confidence = lowercase.\n\nSEARCH RESULTS (${urlsToClassify.length} URLs from ${totalQueries} queries):\n${lines.join('\\n')}`;\n\n  try {\n    mcpLog('info', `Classifying ${urlsToClassify.length} URLs against objective`, 'llm');\n\n    const response = await requestTextWithFallback(\n      processor,\n      prompt,\n      'Search classification',\n    );\n\n    if (response.content === null) {\n      const errMsg = response.error ?? 'LLM returned empty classification response';\n      markLLMFailure('planner', errMsg);\n      return { result: null, error: errMsg };\n    }\n\n    // Strip markdown code fences if present\n    const cleaned = response.content.replace(/^```(?:json)?\\s*\\n?/m, '').replace(/\\n?```\\s*$/m, '').trim();\n    const parsed = JSON.parse(cleaned) as ClassificationResult;\n\n    // Validate the response shape.\n    // Note: synthesis is typed not truthy \u2014 the prompt explicitly instructs an empty string\n    // for the all-OTHER case, and we must not reject that.\n    if (!parsed.title || typeof parsed.synthesis !== 'string' || !Array.isArray(parsed.results)) {\n      const errMsg = 'LLM response missing required fields (title, synthesis, results)';\n      markLLMFailure('planner', errMsg);\n      return { result: null, error: errMsg };\n    }\n\n    mcpLog('info', `Classification complete: ${parsed.results.filter(r => r.tier === 'HIGHLY_RELEVANT').length} highly relevant`, 'llm');\n    markLLMSuccess('planner');\n    return { result: parsed };\n  } catch (err: unknown) {\n    const message = err instanceof Error ? err.message : String(err);\n    mcpLog('error', `Classification failed: ${message}`, 'llm');\n    markLLMFailure('planner', message);\n    return { result: null, error: `Classification failed: ${message}` };\n  }\n}\n\nexport async function suggestRefineQueriesForRawMode(\n  rankedUrls: ReadonlyArray<{\n    readonly rank: number;\n    readonly url: string;\n    readonly title: string;\n  }>,\n  objective: string,\n  originalQueries: readonly string[],\n  processor: OpenAI,\n): Promise<{ result: RefineQuerySuggestion[]; error?: string }> {\n  const urlsToSummarize = rankedUrls.slice(0, 12);\n  const lines = urlsToSummarize.map((url) => {\n    let domain: string;\n    try {\n      domain = new URL(url.url).hostname.replace(/^www\\./, '');\n    } catch {\n      domain = url.url;\n    }\n    return `[${url.rank}] ${url.title} \u2014 ${domain}`;\n  });\n\n  const prompt = `You are generating follow-up search queries for an agent using raw web-search results.\n\nReturn ONLY a JSON object (no markdown, no code fences):\n{\n  \"refine_queries\": [\n    { \"query\": \"next search query\", \"gap_description\": \"what gap this closes\", \"rationale\": \"\u226412 words on why\" }\n  ]\n}\n\nOBJECTIVE: ${objective}\n\nPREVIOUS QUERIES (already run \u2014 do NOT paraphrase):\n${originalQueries.map((query) => `- ${query}`).join('\\n')}\n\nTOP RESULT TITLES (to seed new-term probes):\n${lines.join('\\n')}\n\nRULES:\n- Produce 4\u20136 diverse follow-ups. Cover: (a) a primary-source probe (site:, RFC, vendor docs); (b) a temporal sharpener (changelog, version number); (c) a failure-mode or comparison probe; (d) at least one new-term probe seeded by a specific result title.\n- Each query MUST differ from every previousQuery by either a new operator (site:, quotes, a verbatim version number) OR a domain-specific noun absent from every prior query. Adding a year alone does NOT count.\n- Each refine_query MUST include a \\`gap_description\\` naming what the current results don't answer.\n- Do not include URLs.\n- Keep rationales \u226412 words.`;\n\n  try {\n    const response = await requestTextWithFallback(\n      processor,\n      prompt,\n      'Raw-mode refine query generation',\n    );\n\n    if (response.content === null) {\n      const errMsg = response.error ?? 'LLM returned empty raw-mode refine query response';\n      markLLMFailure('planner', errMsg);\n      return { result: [], error: errMsg };\n    }\n\n    const cleaned = response.content.replace(/^```(?:json)?\\s*\\n?/m, '').replace(/\\n?```\\s*$/m, '').trim();\n    const parsed = JSON.parse(cleaned) as { refine_queries?: RefineQuerySuggestion[] };\n\n    markLLMSuccess('planner');\n    return { result: Array.isArray(parsed.refine_queries) ? parsed.refine_queries : [] };\n  } catch (err: unknown) {\n    const message = err instanceof Error ? err.message : String(err);\n    mcpLog('error', `Raw-mode refine query generation failed: ${message}`, 'llm');\n    markLLMFailure('planner', message);\n    return { result: [], error: message };\n  }\n}\n\n// ============================================================================\n// Research Brief \u2014 goal-aware orientation (called by start-research)\n// ============================================================================\n\nexport type PrimaryBranch = 'reddit' | 'web' | 'both';\n\nexport interface ResearchBriefStep {\n  readonly tool: 'web-search' | 'scrape-links';\n  readonly reason: string;\n}\n\nexport interface ResearchBrief {\n  readonly goal_class: string;\n  readonly goal_class_reason: string;\n  readonly primary_branch: PrimaryBranch;\n  readonly primary_branch_reason: string;\n  readonly freshness_window: string;\n  readonly first_call_sequence: readonly ResearchBriefStep[];\n  readonly keyword_seeds: readonly string[];\n  readonly iteration_hints: readonly string[];\n  readonly gaps_to_watch: readonly string[];\n  readonly stop_criteria: readonly string[];\n}\n\nconst VALID_GOAL_CLASSES = new Set([\n  'spec', 'bug', 'migration', 'sentiment', 'pricing', 'security',\n  'synthesis', 'product_launch', 'other',\n]);\n\nconst VALID_FRESHNESS = new Set(['days', 'weeks', 'months', 'years']);\nconst VALID_BRANCHES = new Set<PrimaryBranch>(['reddit', 'web', 'both']);\nconst VALID_STEP_TOOLS = new Set(['web-search', 'scrape-links']);\n\nfunction isStringArray(value: unknown): value is string[] {\n  return Array.isArray(value) && value.every((v) => typeof v === 'string');\n}\n\nfunction isStepArray(value: unknown): value is ResearchBriefStep[] {\n  return Array.isArray(value) && value.every((s) => {\n    if (typeof s !== 'object' || s === null) return false;\n    const tool = (s as Record<string, unknown>).tool;\n    const reason = (s as Record<string, unknown>).reason;\n    return typeof tool === 'string'\n      && VALID_STEP_TOOLS.has(tool)\n      && typeof reason === 'string'\n      && reason.trim().length > 0;\n  });\n}\n\nexport function parseResearchBrief(raw: string): ResearchBrief | null {\n  try {\n    const cleaned = raw.replace(/^```(?:json)?\\s*\\n?/m, '').replace(/\\n?```\\s*$/m, '').trim();\n    const parsed = JSON.parse(cleaned) as Record<string, unknown>;\n\n    const goal_class = typeof parsed.goal_class === 'string' ? parsed.goal_class : null;\n    if (!goal_class || !VALID_GOAL_CLASSES.has(goal_class)) return null;\n\n    const freshness_window = typeof parsed.freshness_window === 'string' ? parsed.freshness_window : null;\n    if (!freshness_window || !VALID_FRESHNESS.has(freshness_window)) return null;\n\n    const primary_branch = parsed.primary_branch;\n    if (typeof primary_branch !== 'string' || !VALID_BRANCHES.has(primary_branch as PrimaryBranch)) return null;\n\n    if (!isStepArray(parsed.first_call_sequence) || parsed.first_call_sequence.length === 0) return null;\n    if (!isStringArray(parsed.keyword_seeds) || parsed.keyword_seeds.length === 0) return null;\n\n    return {\n      goal_class,\n      goal_class_reason: typeof parsed.goal_class_reason === 'string' ? parsed.goal_class_reason : '',\n      primary_branch: primary_branch as PrimaryBranch,\n      primary_branch_reason: typeof parsed.primary_branch_reason === 'string' ? parsed.primary_branch_reason : '',\n      freshness_window,\n      first_call_sequence: parsed.first_call_sequence,\n      keyword_seeds: parsed.keyword_seeds.filter((s) => s.trim().length > 0),\n      iteration_hints: isStringArray(parsed.iteration_hints) ? parsed.iteration_hints : [],\n      gaps_to_watch: isStringArray(parsed.gaps_to_watch) ? parsed.gaps_to_watch : [],\n      stop_criteria: isStringArray(parsed.stop_criteria) ? parsed.stop_criteria : [],\n    };\n  } catch {\n    return null;\n  }\n}\n\nexport async function generateResearchBrief(\n  goal: string,\n  processor: OpenAI,\n  signal?: AbortSignal,\n): Promise<ResearchBrief | null> {\n  const today = new Date().toISOString().slice(0, 10);\n\n  const prompt = `You are a research planner. An agent is about to run a multi-pass research loop on the goal below using 3 tools:\n\n  - web-search: fan-out Google, scope: web|reddit|both, up to 50 queries per call, parallel-callable (multiple calls per turn)\n  - scrape-links: fetch URLs in parallel, auto-detects reddit.com post permalinks \u2192 Reddit API (threaded post+comments); all other URLs \u2192 HTTP scraper; parallel-callable\n\nProduce a tailored JSON brief.\n\nGOAL: ${goal}\nTODAY: ${today}\n\nReturn ONLY a JSON object (no markdown, no code fences):\n\n{\n  \"goal_class\": \"spec | bug | migration | sentiment | pricing | security | synthesis | product_launch | other\",\n  \"goal_class_reason\": \"one sentence \u2014 why this class\",\n  \"primary_branch\": \"reddit | web | both\",\n  \"primary_branch_reason\": \"one sentence \u2014 why this branch leads\",\n  \"freshness_window\": \"days | weeks | months | years\",\n  \"first_call_sequence\": [\n    { \"tool\": \"web-search | scrape-links\", \"reason\": \"what this call establishes for the agent\" }\n  ],\n  \"keyword_seeds\": [\"25\u201350 concrete Google queries \u2014 flat list, to be fired in the first web-search call\"],\n  \"iteration_hints\": [\"2\u20135 pointers on which harvested terms / follow-up signals to watch for after pass 1\"],\n  \"gaps_to_watch\": [\"2\u20135 concrete questions the agent MUST verify or the answer is incomplete\"],\n  \"stop_criteria\": [\"2\u20134 checkable conditions \u2014 all must hold before the agent declares done\"]\n}\n\nRULES:\n\nprimary_branch:\n- \"reddit\"  \u2192 sentiment / migration / lived-experience / community-consensus goals. Leads with scope:\"reddit\" web-search.\n- \"web\"     \u2192 spec / bug / pricing / CVE / API / primary-source goals. Leads with scope:\"web\" web-search.\n- \"both\"    \u2192 opinion-heavy AND needs official sources (e.g. product launch + practitioner reception).\n\nfirst_call_sequence:\n- 1\u20133 steps.\n- reddit-first: step 1 = web-search (caller sets scope:\"reddit\"), step 2 = scrape-links on best post permalinks.\n- web-first:    step 1 = web-search (scope:\"web\"), step 2 = scrape-links on HIGHLY_RELEVANT URLs.\n- both:         step 1 = two parallel web-search calls (one scope:\"reddit\", one scope:\"web\"), step 2 = merged scrape-links.\n\nkeyword_seeds:\n- 25\u201350 total. Narrow bug \u2192 fewer. Open synthesis \u2192 more.\n- Use operators where helpful (site:, quotes, verbatim version numbers).\n- DIVERSE facets \u2014 same noun-phrase cannot repeat across seeds with adjectives-only variation.\n- Do NOT invent vendor names you are uncertain exist.\n- For \\`site:<domain>\\` filters, ONLY use domains you are highly confident are real. Safe choices: \\`github.com\\`, \\`stackoverflow.com\\`, \\`reddit.com\\`, \\`news.ycombinator.com\\`, \\`arxiv.org\\`, \\`nvd.nist.gov\\`, \\`pypi.org\\`, \\`npmjs.com\\`, plus any canonical homepage/docs domain explicitly spelled out in the goal itself (e.g. goal names \"Cursor\" \u2192 \\`cursor.com\\`/\\`docs.cursor.com\\` is acceptable). If you don't know the product's real docs domain, leave the query open (no \\`site:\\`) instead of guessing.\n\nfreshness_window:\n- If the goal mentions a recent release / date / version, use \"days\" or \"weeks\".\n- Stable protocols / APIs \u2192 \"months\" or \"years\".`;\n\n  try {\n    const response = await requestTextWithFallback(\n      processor,\n      prompt,\n      'Research brief generation',\n      signal,\n    );\n\n    if (response.content === null) {\n      mcpLog('warning', `Research brief generation returned no content: ${response.error ?? 'unknown'}`, 'llm');\n      markLLMFailure('planner', response.error ?? 'empty response');\n      return null;\n    }\n\n    const brief = parseResearchBrief(response.content);\n    if (!brief) {\n      mcpLog('warning', 'Research brief JSON parse or shape validation failed', 'llm');\n      markLLMFailure('planner', 'brief parse/validation failed');\n      return null;\n    }\n\n    markLLMSuccess('planner');\n    return brief;\n  } catch (err: unknown) {\n    const message = err instanceof Error ? err.message : String(err);\n    mcpLog('warning', `Research brief generation failed: ${message}`, 'llm');\n    markLLMFailure('planner', message);\n    return null;\n  }\n}\n\nexport function renderResearchBrief(brief: ResearchBrief): string {\n  const lines: string[] = [];\n\n  lines.push('## Your research brief (goal-tailored)');\n  lines.push('');\n  lines.push(`**Goal class**: \\`${brief.goal_class}\\` \u2014 ${brief.goal_class_reason}`);\n  lines.push(`**Primary branch**: \\`${brief.primary_branch}\\` \u2014 ${brief.primary_branch_reason}`);\n  lines.push(`**Freshness**: \\`${brief.freshness_window}\\``);\n  lines.push('');\n\n  if (brief.first_call_sequence.length > 0) {\n    lines.push('### First-call sequence');\n    brief.first_call_sequence.forEach((step, i) => {\n      lines.push(`${i + 1}. \\`${step.tool}\\` \u2014 ${step.reason}`);\n    });\n    lines.push('');\n  }\n\n  if (brief.keyword_seeds.length > 0) {\n    lines.push(`### Keyword seeds (${brief.keyword_seeds.length}) \u2014 fire these in your first \\`web-search\\` call as a flat \\`queries\\` array`);\n    for (const seed of brief.keyword_seeds) {\n      lines.push(`- ${seed}`);\n    }\n    lines.push('');\n  }\n\n  if (brief.iteration_hints.length > 0) {\n    lines.push('### Iteration hints (harvest new terms from scrape extracts\\' `## Follow-up signals`)');\n    for (const hint of brief.iteration_hints) lines.push(`- ${hint}`);\n    lines.push('');\n  }\n\n  if (brief.gaps_to_watch.length > 0) {\n    lines.push('### Gaps to watch');\n    for (const gap of brief.gaps_to_watch) lines.push(`- ${gap}`);\n    lines.push('');\n  }\n\n  if (brief.stop_criteria.length > 0) {\n    lines.push('### Stop criteria');\n    for (const c of brief.stop_criteria) lines.push(`- ${c}`);\n    lines.push('');\n  }\n\n  lines.push('---');\n  lines.push('');\n  lines.push('Fire `first_call_sequence` now. After each `scrape-links`, harvest new terms from `## Follow-up signals` and build your next `web-search` round. Stop when every gap is closed.');\n\n  return lines.join('\\n');\n}\n"],
-  "mappings": "AAQA,OAAO,YAAY;AACnB,SAAS,gBAAgB,uBAAuB;AAChD;AAAA,EACE;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,OAEK;AACP,SAAS,cAAc;AAGvB,MAAM,sBAAsB;AAO5B,MAAM,gCAAgC;AAGtC,MAAM,wBAAwB;AAG9B,MAAM,wBAAwB;AAG9B,MAAM,uBAAuB;AAG7B,MAAM,0BAA0B;AAuBhC,MAAM,YAAY;AAAA,EAChB,eAAe;AAAA,EACf,iBAAiB;AAAA,EACjB,sBAAsB;AAAA,EACtB,wBAAwB;AAAA,EACxB,kBAAkB;AAAA,EAClB,oBAAoB;AAAA,EACpB,4BAA4B;AAAA,EAC5B,8BAA8B;AAChC;AAEO,SAAS,eAAe,MAA2B;AACxD,QAAM,MAAK,oBAAI,KAAK,GAAE,YAAY;AAClC,MAAI,SAAS,WAAW;AACtB,cAAU,gBAAgB;AAC1B,cAAU,uBAAuB;AACjC,cAAU,mBAAmB;AAC7B,cAAU,6BAA6B;AAAA,EACzC,OAAO;AACL,cAAU,kBAAkB;AAC5B,cAAU,yBAAyB;AACnC,cAAU,qBAAqB;AAC/B,cAAU,+BAA+B;AAAA,EAC3C;AACF;AAEO,SAAS,eAAe,MAAqB,KAAoB;AACtE,QAAM,MAAK,oBAAI,KAAK,GAAE,YAAY;AAClC,QAAM,UAAU,eAAe,QAAQ,IAAI,UAAU,OAAO,OAAO,eAAe;AAClF,MAAI,SAAS,WAAW;AACtB,cAAU,gBAAgB;AAC1B,cAAU,uBAAuB;AACjC,cAAU,mBAAmB;AAC7B,cAAU,8BAA8B;AAAA,EAC1C,OAAO;AACL,cAAU,kBAAkB;AAC5B,cAAU,yBAAyB;AACnC,cAAU,qBAAqB;AAC/B,cAAU,gCAAgC;AAAA,EAC5C;AACF;AAEO,SAAS,eAAkC;AAChD,QAAM,MAAM,gBAAgB;AAC5B,SAAO;AAAA,IACL,eAAe,UAAU;AAAA,IACzB,iBAAiB,UAAU;AAAA,IAC3B,sBAAsB,UAAU;AAAA,IAChC,wBAAwB,UAAU;AAAA,IAClC,kBAAkB,UAAU;AAAA,IAC5B,oBAAoB,UAAU;AAAA;AAAA;AAAA,IAG9B,mBAAmB,IAAI;AAAA,IACvB,qBAAqB,IAAI;AAAA,IACzB,4BAA4B,UAAU;AAAA,IACtC,8BAA8B,UAAU;AAAA,EAC1C;AACF;AAGO,SAAS,0BAAgC;AAC9C,YAAU,gBAAgB;AAC1B,YAAU,kBAAkB;AAC5B,YAAU,uBAAuB;AACjC,YAAU,yBAAyB;AACnC,YAAU,mBAAmB;AAC7B,YAAU,qBAAqB;AAC/B,YAAU,6BAA6B;AACvC,YAAU,+BAA+B;AAC3C;AAgBA,MAAM,mBAAmB;AAAA,EACvB,YAAY;AAAA,EACZ,aAAa;AAAA,EACb,YAAY;AACd;AAGA,MAAM,uBAAuB;AAG7B,MAAM,4BAA4B,oBAAI,IAAI;AAAA,EACxC;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AAGD,SAAS,UAAU,OAA6C;AAC9D,SACE,OAAO,UAAU,YACjB,UAAU,QACV,YAAY,SACZ,OAAQ,MAAkC,WAAW;AAEzD;AAEA,IAAI,YAA2B;AA6CxB,SAAS,qBAAoC;AAClD,MAAI,CAAC,gBAAgB,EAAE,cAAe,QAAO;AAE7C,MAAI,CAAC,WAAW;AACd,gBAAY,IAAI,OAAO;AAAA,MACrB,SAAS,eAAe;AAAA,MACxB,QAAQ,eAAe;AAAA,MACvB,SAAS;AAAA,MACT,YAAY;AAAA,MACZ,gBAAgB,EAAE,WAAW,yBAAyB;AAAA,IACxD,CAAC;AACD,WAAO,QAAQ,qCAAqC,eAAe,KAAK,cAAc,eAAe,QAAQ,KAAK,KAAK;AAAA,EACzH;AACA,SAAO;AACT;AAEA,SAAS,qBAAqB,OAAe,QAAyC;AACpF,SAAO;AAAA,IACL;AAAA,IACA,UAAU,CAAC,EAAE,MAAM,QAAQ,SAAS,OAAO,CAAC;AAAA,IAC5C,kBAAkB;AAAA,EACpB;AACF;AAEA,SAAS,uBAAuB,KAAc,SAA0B;AACtE,MAAI,OAAO,QAAQ,YAAY,QAAQ,KAAM,QAAO;AACpD,SAAO,IAAI,MAAM,OAAO;AAC1B;AAEA,SAAS,mBAAmB,UAA2C;AACrE,MAAI,SAAS,YAAY,QAAQ,SAAS,gBAAgB,WAAY,QAAO;AAC7E,SAAO,SAAS;AAClB;AAEA,SAAS,yBAAyB,SAA4B;AAC5D,SAAO;AAAA,IACL;AAAA,IACA,WAAW;AAAA,IACX,OAAO;AAAA,IACP,cAAc;AAAA,MACZ,MAAM,UAAU;AAAA,MAChB,SAAS;AAAA,MACT,WAAW;AAAA,IACb;AAAA,EACF;AACF;AAEA,eAAsB,YACpB,WACA,QACA,gBACA,QACA,eAC0B;AAC1B,QAAM,QAAQ,iBAAiB,eAAe;AAE9C,MAAI;AACF,UAAM,WAAW,MAAM;AAAA,MACrB,CAAC,gBAAgB,UAAU,KAAK,YAAY;AAAA,QAC1C,qBAAqB,OAAO,MAAM;AAAA,QAClC;AAAA,UACE,QAAQ,SAAS,YAAY,IAAI,CAAC,aAAa,MAAM,CAAC,IAAI;AAAA,UAC1D,SAAS;AAAA,QACX;AAAA,MACF;AAAA,MACA;AAAA,MACA;AAAA,MACA,GAAG,cAAc,KAAK,KAAK;AAAA,IAC7B;AAEA,UAAM,UAAU,SAAS,UAAU,CAAC,GAAG,SAAS,SAAS,KAAK;AAC9D,QAAI,SAAS;AACX,aAAO,EAAE,SAAS,MAAM;AAAA,IAC1B;AAEA,UAAM,MAAM,6BAA6B,KAAK;AAC9C,WAAO,WAAW,GAAG,cAAc,qCAAqC,KAAK,IAAI,KAAK;AACtF,WAAO,EAAE,SAAS,MAAM,OAAO,OAAO,KAAK,aAAa,QAAQ;AAAA,EAClE,SAAS,KAAc;AACrB,UAAM,UAAU,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG;AAC/D,WAAO,WAAW,GAAG,cAAc,qBAAqB,KAAK,KAAK,OAAO,IAAI,KAAK;AAClF,WAAO;AAAA,MACL,SAAS;AAAA,MACT;AAAA,MACA,OAAO;AAAA,MACP,aAAa;AAAA,MACb,YAAY,uBAAuB,KAAK,OAAO;AAAA,IACjD;AAAA,EACF;AACF;AAQA,eAAsB,wBACpB,WACA,QACA,gBACA,QAC0B;AAC1B,QAAM,UAAU,MAAM,YAAY,WAAW,QAAQ,gBAAgB,MAAM;AAC3E,MAAI,QAAQ,YAAY,KAAM,QAAO;AAErC,QAAM,gBAAgB,eAAe;AACrC,MAAI,CAAC,cAAe,QAAO;AAE3B,SAAO,WAAW,+CAA+C,aAAa,IAAI,KAAK;AAEvF,MAAI,cAA8B;AAClC,WAAS,UAAU,GAAG,UAAU,sBAAsB,WAAW;AAC/D,QAAI,UAAU,GAAG;AACf,YAAM,UAAU,oBAAoB,UAAU,CAAC;AAC/C,aAAO,WAAW,kBAAkB,OAAO,IAAI,uBAAuB,CAAC,OAAO,OAAO,MAAM,KAAK;AAChG,UAAI;AAAE,cAAM,MAAM,SAAS,MAAM;AAAA,MAAG,QAAQ;AAAE;AAAA,MAAO;AAAA,IACvD;AACA,UAAM,SAAS,MAAM,YAAY,WAAW,QAAQ,GAAG,cAAc,eAAe,QAAQ,aAAa;AACzG,QAAI,OAAO,YAAY,KAAM,QAAO;AACpC,kBAAc;AAAA,EAChB;AAEA,SAAO;AACT;AAKA,SAAS,oBAAoB,OAAyB;AACpD,MAAI,CAAC,SAAS,OAAO,UAAU,SAAU,QAAO;AAGhD,QAAM,YAAa,OAA6B;AAChD,MAAI,cAAc,cAAc,cAAc,aAAa;AACzD,WAAO;AAAA,EACT;AAGA,MAAI,UAAU,KAAK,GAAG;AACpB,QAAI,MAAM,WAAW,OAAO,MAAM,WAAW,OAAO,MAAM,WAAW,OAAO,MAAM,WAAW,OAAO,MAAM,WAAW,KAAK;AACxH,aAAO;AAAA,IACT;AAAA,EACF;AAGA,QAAM,SAAS;AACf,QAAM,OAAO,OAAO,OAAO,SAAS,WAAW,OAAO,OAAO;AAC7D,QAAM,SACJ,OAAO,OAAO,UAAU,YAAY,OAAO,UAAU,OAChD,OAAO,QACR;AACN,QAAM,YACJ,SACC,UAAU,OAAO,OAAO,SAAS,WAAW,OAAO,OAAO,YAC1D,UAAU,OAAO,OAAO,SAAS,WAAW,OAAO,OAAO;AAC7D,MAAI,aAAa,0BAA0B,IAAI,SAAS,GAAG;AACzD,WAAO;AAAA,EACT;AAGA,QAAM,UAAU,OAAO,OAAO,YAAY,WAAW,OAAO,QAAQ,YAAY,IAAI;AACpF,MACE,QAAQ,SAAS,YAAY,KAC7B,QAAQ,SAAS,SAAS,KAC1B,QAAQ,SAAS,WAAW,KAC5B,QAAQ,SAAS,qBAAqB,KACtC,QAAQ,SAAS,cAAc,KAC/B,QAAQ,SAAS,YAAY,KAC7B,QAAQ,SAAS,YAAY,GAC7B;AACA,WAAO;AAAA,EACT;AAEA,SAAO;AACT;AAOA,SAAS,qBAAqB,OAAyB;AACrD,MAAI,CAAC,SAAS,OAAO,UAAU,SAAU,QAAO;AAEhD,QAAM,SAAS;AACf,QAAM,SACJ,OAAO,OAAO,UAAU,YAAY,OAAO,UAAU,OAChD,OAAO,QACR;AAEN,QAAM,OAAO,OAAO,OAAO,SAAS,WAAW,OAAO,OAAO;AAC7D,QAAM,aAAa,UAAU,OAAO,OAAO,SAAS,WAAW,OAAO,OAAO;AAC7E,MAAI,SAAS,6BAA6B,eAAe,2BAA2B;AAClF,WAAO;AAAA,EACT;AAEA,QAAM,WAAqB,CAAC;AAC5B,MAAI,OAAO,OAAO,YAAY,SAAU,UAAS,KAAK,OAAO,OAAO;AACpE,MAAI,UAAU,OAAO,OAAO,YAAY,SAAU,UAAS,KAAK,OAAO,OAAO;AAC9E,QAAM,WAAW,SAAS,KAAK,GAAG,EAAE,YAAY;AAChD,SACE,SAAS,SAAS,gBAAgB,KAClC,SAAS,SAAS,gBAAgB,KAClC,SAAS,SAAS,iBAAiB,KACnC,SAAS,SAAS,gBAAgB,KAClC,SAAS,SAAS,aAAa,KAC/B,SAAS,SAAS,iBAAiB,KACnC,SAAS,SAAS,oBAAoB,KACtC,SAAS,SAAS,mBAAmB;AAEzC;AAKA,SAAS,oBAAoB,SAAyB;AACpD,QAAM,mBAAmB,iBAAiB,cAAc,KAAK,IAAI,GAAG,OAAO;AAC3E,QAAM,SAAS,KAAK,OAAO,IAAI,wBAAwB;AACvD,SAAO,KAAK,IAAI,mBAAmB,QAAQ,iBAAiB,UAAU;AACxE;AAOA,eAAsB,sBACpB,SACA,QACA,WACA,QACoB;AAEpB,MAAI,CAAC,OAAO,SAAS;AACnB,WAAO,EAAE,SAAS,WAAW,MAAM;AAAA,EACrC;AAEA,MAAI,CAAC,WAAW;AACd,WAAO;AAAA,MACL;AAAA,MACA,WAAW;AAAA,MACX,OAAO;AAAA,MACP,cAAc;AAAA,QACZ,MAAM,UAAU;AAAA,QAChB,SAAS;AAAA,QACT,WAAW;AAAA,MACb;AAAA,IACF;AAAA,EACF;AAEA,MAAI,CAAC,SAAS,KAAK,GAAG;AACpB,WAAO,EAAE,SAAS,WAAW,IAAI,WAAW,OAAO,OAAO,yBAAyB;AAAA,EACrF;AAGA,QAAM,mBAAmB,QAAQ,SAAS,sBACtC,QAAQ,UAAU,GAAG,mBAAmB,IAAI,0CAC5C;AAKJ,QAAM,qBACJ,iBAAiB,SAAS,iCAAiC,CAAC,CAAC,eAAe;AAK9E,QAAM,WAAW,MAAM;AACrB,QAAI,CAAC,OAAO,IAAK,QAAO;AACxB,QAAI;AACF,YAAM,IAAI,IAAI,IAAI,OAAO,GAAG;AAC5B,aAAO,GAAG,EAAE,MAAM,GAAG,EAAE,QAAQ;AAAA,IACjC,QAAQ;AACN,aAAO;AAAA,IACT;AAAA,EACF,GAAG;AACH,QAAM,UAAU,UAAU,aAAa,OAAO;AAAA;AAAA,IAAS;AAEvD,QAAM,SAAS,OAAO,UAClB;AAAA;AAAA,EAEJ,OAAO,2BAA2B,OAAO,OAAO;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;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAkDhD,gBAAgB,KACZ;AAAA;AAAA,EAEJ,OAAO;AAAA,EACP,gBAAgB;AAEhB,MAAI;AAIJ,MAAI,oBAAoB;AACtB;AAAA,MACE;AAAA,MACA,SAAS,iBAAiB,MAAM,qCAAqC,6BAA6B;AAAA,MAClG;AAAA,IACF;AAAA,EACF,OAAO;AACL,aAAS,UAAU,GAAG,WAAW,iBAAiB,YAAY,WAAW;AACvE,UAAI;AACF,YAAI,YAAY,GAAG;AACjB,iBAAO,QAAQ,4BAA4B,eAAe,KAAK,IAAI,KAAK;AAAA,QAC1E,OAAO;AACL,iBAAO,WAAW,iBAAiB,OAAO,IAAI,iBAAiB,UAAU,IAAI,KAAK;AAAA,QACpF;AAEA,cAAM,WAAW,MAAM,YAAY,WAAW,QAAQ,kBAAkB,MAAM;AAE9E,YAAI,SAAS,YAAY,MAAM;AAC7B,iBAAO,QAAQ,0BAA0B,SAAS,QAAQ,MAAM,eAAe,KAAK;AACpF,yBAAe,WAAW;AAC1B,iBAAO,EAAE,SAAS,SAAS,SAAS,WAAW,KAAK;AAAA,QACtD;AAEA,cAAM,kBAAkB,mBAAmB,QAAQ;AACnD,YAAI,iBAAiB;AACnB,gBAAM;AAAA,QACR;AAGA,eAAO,WAAW,oCAAoC,KAAK;AAC3D,uBAAe,aAAa,6BAA6B;AACzD,eAAO,yBAAyB,OAAO;AAAA,MAEzC,SAAS,KAAc;AACrB,oBAAY,cAAc,GAAG;AAC7B,cAAM,SAAS,UAAU,GAAG,IAAI,IAAI,SAAS;AAC7C,cAAM,OAAO,OAAO,QAAQ,YAAY,QAAQ,QAAQ,UAAU,MAC9D,OAAQ,IAAgC,IAAI,IAC5C;AACJ,cAAM,SAAS,qBAAqB,GAAG;AACvC,eAAO,SAAS,kBAAkB,UAAU,CAAC,MAAM,UAAU,OAAO,YAAY,MAAM,UAAU,IAAI,eAAe,oBAAoB,GAAG,CAAC,oBAAoB,MAAM,KAAK,KAAK;AAG/K,YAAI,QAAQ;AACV,iBAAO,WAAW,6FAAwF,KAAK;AAC/G;AAAA,QACF;AAEA,YAAI,oBAAoB,GAAG,KAAK,UAAU,iBAAiB,YAAY;AACrE,gBAAM,UAAU,oBAAoB,OAAO;AAC3C,iBAAO,WAAW,eAAe,OAAO,SAAS,KAAK;AACtD,cAAI;AAAE,kBAAM,MAAM,SAAS,MAAM;AAAA,UAAG,QAAQ;AAAE;AAAA,UAAO;AACrD;AAAA,QACF;AACA;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAGA,QAAM,gBAAgB,eAAe;AACrC,MAAI,eAAe;AACjB,WAAO,WAAW,4CAA4C,aAAa,IAAI,KAAK;AACpF,aAAS,UAAU,GAAG,UAAU,sBAAsB,WAAW;AAC/D,UAAI,UAAU,GAAG;AACf,cAAM,UAAU,oBAAoB,UAAU,CAAC;AAC/C,eAAO,WAAW,kBAAkB,OAAO,IAAI,uBAAuB,CAAC,OAAO,OAAO,MAAM,KAAK;AAChG,YAAI;AAAE,gBAAM,MAAM,SAAS,MAAM;AAAA,QAAG,QAAQ;AAAE;AAAA,QAAO;AAAA,MACvD;AACA,UAAI;AACF,cAAM,WAAW,MAAM,YAAY,WAAW,QAAQ,6BAA6B,QAAQ,aAAa;AACxG,YAAI,SAAS,YAAY,MAAM;AAC7B,iBAAO,QAAQ,sBAAsB,SAAS,QAAQ,MAAM,eAAe,KAAK;AAChF,yBAAe,WAAW;AAC1B,iBAAO,EAAE,SAAS,SAAS,SAAS,WAAW,KAAK;AAAA,QACtD;AAEA,cAAM,kBAAkB,mBAAmB,QAAQ;AACnD,YAAI,iBAAiB;AACnB,gBAAM;AAAA,QACR;AAEA,eAAO,WAAW,oCAAoC,KAAK;AAC3D,uBAAe,aAAa,6BAA6B;AACzD,eAAO,yBAAyB,OAAO;AAAA,MACzC,SAAS,KAAc;AACrB,oBAAY,cAAc,GAAG;AAC7B,eAAO,SAAS,2BAA2B,UAAU,CAAC,MAAM,UAAU,OAAO,IAAI,KAAK;AAAA,MACxF;AAAA,IACF;AAAA,EACF;AAEA,QAAM,eAAe,WAAW,WAAW;AAC3C,SAAO,SAAS,wBAAwB,YAAY,iCAAiC,KAAK;AAC1F,iBAAe,aAAa,YAAY;AAExC,SAAO;AAAA,IACL;AAAA,IACA,WAAW;AAAA,IACX,OAAO,0BAA0B,YAAY;AAAA,IAC7C,cAAc,aAAa;AAAA,MACzB,MAAM,UAAU;AAAA,MAChB,SAAS;AAAA,MACT,WAAW;AAAA,IACb;AAAA,EACF;AACF;AAOA,MAAM,0BAA0B;AA2ChC,eAAsB,sBACpB,YAQA,WACA,cACA,WACA,kBAAqC,CAAC,GAC4B;AAClE,QAAM,iBAAiB,WAAW,MAAM,GAAG,uBAAuB;AAMlE,QAAM,iBAAiB,CAAC,IAAI,IAAI,IAAI,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;AACxD,QAAM,gBAAgB,CAAC,SAAyB,eAAe,OAAO,CAAC,KAAK;AAG5E,QAAM,QAAkB,CAAC;AACzB,aAAW,OAAO,gBAAgB;AAChC,QAAI;AACJ,QAAI;AACF,eAAS,IAAI,IAAI,IAAI,GAAG,EAAE,SAAS,QAAQ,UAAU,EAAE;AAAA,IACzD,QAAQ;AACN,eAAS,IAAI;AAAA,IACf;AACA,UAAM,UAAU,IAAI,QAAQ,SAAS,MACjC,IAAI,QAAQ,MAAM,GAAG,GAAG,IAAI,QAC5B,IAAI;AACR,UAAM,KAAK,IAAI,IAAI,IAAI,OAAO,cAAc,IAAI,IAAI,CAAC,IAAI,IAAI,KAAK,WAAM,MAAM,WAAM,OAAO,EAAE;AAAA,EAC/F;AAEA,QAAM,mBAAmB,gBAAgB,SAAS,IAC9C,gBAAgB,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,EAAE,KAAK,IAAI,IAC9C;AACJ,QAAM,SAAQ,oBAAI,KAAK,GAAE,YAAY,EAAE,MAAM,GAAG,EAAE;AAElD,QAAM,SAAS;AAAA;AAAA,aAEJ,SAAS;AAAA,SACb,KAAK;AAAA;AAAA;AAAA,EAGZ,gBAAgB;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;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,iBAmDD,eAAe,MAAM;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,kBAMpB,eAAe,MAAM,cAAc,YAAY;AAAA,EAC/D,MAAM,KAAK,IAAI,CAAC;AAEhB,MAAI;AACF,WAAO,QAAQ,eAAe,eAAe,MAAM,2BAA2B,KAAK;AAEnF,UAAM,WAAW,MAAM;AAAA,MACrB;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAEA,QAAI,SAAS,YAAY,MAAM;AAC7B,YAAM,SAAS,SAAS,SAAS;AACjC,qBAAe,WAAW,MAAM;AAChC,aAAO,EAAE,QAAQ,MAAM,OAAO,OAAO;AAAA,IACvC;AAGA,UAAM,UAAU,SAAS,QAAQ,QAAQ,wBAAwB,EAAE,EAAE,QAAQ,eAAe,EAAE,EAAE,KAAK;AACrG,UAAM,SAAS,KAAK,MAAM,OAAO;AAKjC,QAAI,CAAC,OAAO,SAAS,OAAO,OAAO,cAAc,YAAY,CAAC,MAAM,QAAQ,OAAO,OAAO,GAAG;AAC3F,YAAM,SAAS;AACf,qBAAe,WAAW,MAAM;AAChC,aAAO,EAAE,QAAQ,MAAM,OAAO,OAAO;AAAA,IACvC;AAEA,WAAO,QAAQ,4BAA4B,OAAO,QAAQ,OAAO,OAAK,EAAE,SAAS,iBAAiB,EAAE,MAAM,oBAAoB,KAAK;AACnI,mBAAe,SAAS;AACxB,WAAO,EAAE,QAAQ,OAAO;AAAA,EAC1B,SAAS,KAAc;AACrB,UAAM,UAAU,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG;AAC/D,WAAO,SAAS,0BAA0B,OAAO,IAAI,KAAK;AAC1D,mBAAe,WAAW,OAAO;AACjC,WAAO,EAAE,QAAQ,MAAM,OAAO,0BAA0B,OAAO,GAAG;AAAA,EACpE;AACF;AAEA,eAAsB,+BACpB,YAKA,WACA,iBACA,WAC8D;AAC9D,QAAM,kBAAkB,WAAW,MAAM,GAAG,EAAE;AAC9C,QAAM,QAAQ,gBAAgB,IAAI,CAAC,QAAQ;AACzC,QAAI;AACJ,QAAI;AACF,eAAS,IAAI,IAAI,IAAI,GAAG,EAAE,SAAS,QAAQ,UAAU,EAAE;AAAA,IACzD,QAAQ;AACN,eAAS,IAAI;AAAA,IACf;AACA,WAAO,IAAI,IAAI,IAAI,KAAK,IAAI,KAAK,WAAM,MAAM;AAAA,EAC/C,CAAC;AAED,QAAM,SAAS;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,aASJ,SAAS;AAAA;AAAA;AAAA,EAGpB,gBAAgB,IAAI,CAAC,UAAU,KAAK,KAAK,EAAE,EAAE,KAAK,IAAI,CAAC;AAAA;AAAA;AAAA,EAGvD,MAAM,KAAK,IAAI,CAAC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAShB,MAAI;AACF,UAAM,WAAW,MAAM;AAAA,MACrB;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAEA,QAAI,SAAS,YAAY,MAAM;AAC7B,YAAM,SAAS,SAAS,SAAS;AACjC,qBAAe,WAAW,MAAM;AAChC,aAAO,EAAE,QAAQ,CAAC,GAAG,OAAO,OAAO;AAAA,IACrC;AAEA,UAAM,UAAU,SAAS,QAAQ,QAAQ,wBAAwB,EAAE,EAAE,QAAQ,eAAe,EAAE,EAAE,KAAK;AACrG,UAAM,SAAS,KAAK,MAAM,OAAO;AAEjC,mBAAe,SAAS;AACxB,WAAO,EAAE,QAAQ,MAAM,QAAQ,OAAO,cAAc,IAAI,OAAO,iBAAiB,CAAC,EAAE;AAAA,EACrF,SAAS,KAAc;AACrB,UAAM,UAAU,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG;AAC/D,WAAO,SAAS,4CAA4C,OAAO,IAAI,KAAK;AAC5E,mBAAe,WAAW,OAAO;AACjC,WAAO,EAAE,QAAQ,CAAC,GAAG,OAAO,QAAQ;AAAA,EACtC;AACF;AA0BA,MAAM,qBAAqB,oBAAI,IAAI;AAAA,EACjC;AAAA,EAAQ;AAAA,EAAO;AAAA,EAAa;AAAA,EAAa;AAAA,EAAW;AAAA,EACpD;AAAA,EAAa;AAAA,EAAkB;AACjC,CAAC;AAED,MAAM,kBAAkB,oBAAI,IAAI,CAAC,QAAQ,SAAS,UAAU,OAAO,CAAC;AACpE,MAAM,iBAAiB,oBAAI,IAAmB,CAAC,UAAU,OAAO,MAAM,CAAC;AACvE,MAAM,mBAAmB,oBAAI,IAAI,CAAC,cAAc,cAAc,CAAC;AAE/D,SAAS,cAAc,OAAmC;AACxD,SAAO,MAAM,QAAQ,KAAK,KAAK,MAAM,MAAM,CAAC,MAAM,OAAO,MAAM,QAAQ;AACzE;AAEA,SAAS,YAAY,OAA8C;AACjE,SAAO,MAAM,QAAQ,KAAK,KAAK,MAAM,MAAM,CAAC,MAAM;AAChD,QAAI,OAAO,MAAM,YAAY,MAAM,KAAM,QAAO;AAChD,UAAM,OAAQ,EAA8B;AAC5C,UAAM,SAAU,EAA8B;AAC9C,WAAO,OAAO,SAAS,YAClB,iBAAiB,IAAI,IAAI,KACzB,OAAO,WAAW,YAClB,OAAO,KAAK,EAAE,SAAS;AAAA,EAC9B,CAAC;AACH;AAEO,SAAS,mBAAmB,KAAmC;AACpE,MAAI;AACF,UAAM,UAAU,IAAI,QAAQ,wBAAwB,EAAE,EAAE,QAAQ,eAAe,EAAE,EAAE,KAAK;AACxF,UAAM,SAAS,KAAK,MAAM,OAAO;AAEjC,UAAM,aAAa,OAAO,OAAO,eAAe,WAAW,OAAO,aAAa;AAC/E,QAAI,CAAC,cAAc,CAAC,mBAAmB,IAAI,UAAU,EAAG,QAAO;AAE/D,UAAM,mBAAmB,OAAO,OAAO,qBAAqB,WAAW,OAAO,mBAAmB;AACjG,QAAI,CAAC,oBAAoB,CAAC,gBAAgB,IAAI,gBAAgB,EAAG,QAAO;AAExE,UAAM,iBAAiB,OAAO;AAC9B,QAAI,OAAO,mBAAmB,YAAY,CAAC,eAAe,IAAI,cAA+B,EAAG,QAAO;AAEvG,QAAI,CAAC,YAAY,OAAO,mBAAmB,KAAK,OAAO,oBAAoB,WAAW,EAAG,QAAO;AAChG,QAAI,CAAC,cAAc,OAAO,aAAa,KAAK,OAAO,cAAc,WAAW,EAAG,QAAO;AAEtF,WAAO;AAAA,MACL;AAAA,MACA,mBAAmB,OAAO,OAAO,sBAAsB,WAAW,OAAO,oBAAoB;AAAA,MAC7F;AAAA,MACA,uBAAuB,OAAO,OAAO,0BAA0B,WAAW,OAAO,wBAAwB;AAAA,MACzG;AAAA,MACA,qBAAqB,OAAO;AAAA,MAC5B,eAAe,OAAO,cAAc,OAAO,CAAC,MAAM,EAAE,KAAK,EAAE,SAAS,CAAC;AAAA,MACrE,iBAAiB,cAAc,OAAO,eAAe,IAAI,OAAO,kBAAkB,CAAC;AAAA,MACnF,eAAe,cAAc,OAAO,aAAa,IAAI,OAAO,gBAAgB,CAAC;AAAA,MAC7E,eAAe,cAAc,OAAO,aAAa,IAAI,OAAO,gBAAgB,CAAC;AAAA,IAC/E;AAAA,EACF,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAEA,eAAsB,sBACpB,MACA,WACA,QAC+B;AAC/B,QAAM,SAAQ,oBAAI,KAAK,GAAE,YAAY,EAAE,MAAM,GAAG,EAAE;AAElD,QAAM,SAAS;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,QAOT,IAAI;AAAA,SACH,KAAK;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;AAAA;AA2CZ,MAAI;AACF,UAAM,WAAW,MAAM;AAAA,MACrB;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAEA,QAAI,SAAS,YAAY,MAAM;AAC7B,aAAO,WAAW,kDAAkD,SAAS,SAAS,SAAS,IAAI,KAAK;AACxG,qBAAe,WAAW,SAAS,SAAS,gBAAgB;AAC5D,aAAO;AAAA,IACT;AAEA,UAAM,QAAQ,mBAAmB,SAAS,OAAO;AACjD,QAAI,CAAC,OAAO;AACV,aAAO,WAAW,wDAAwD,KAAK;AAC/E,qBAAe,WAAW,+BAA+B;AACzD,aAAO;AAAA,IACT;AAEA,mBAAe,SAAS;AACxB,WAAO;AAAA,EACT,SAAS,KAAc;AACrB,UAAM,UAAU,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG;AAC/D,WAAO,WAAW,qCAAqC,OAAO,IAAI,KAAK;AACvE,mBAAe,WAAW,OAAO;AACjC,WAAO;AAAA,EACT;AACF;AAEO,SAAS,oBAAoB,OAA8B;AAChE,QAAM,QAAkB,CAAC;AAEzB,QAAM,KAAK,wCAAwC;AACnD,QAAM,KAAK,EAAE;AACb,QAAM,KAAK,qBAAqB,MAAM,UAAU,aAAQ,MAAM,iBAAiB,EAAE;AACjF,QAAM,KAAK,yBAAyB,MAAM,cAAc,aAAQ,MAAM,qBAAqB,EAAE;AAC7F,QAAM,KAAK,oBAAoB,MAAM,gBAAgB,IAAI;AACzD,QAAM,KAAK,EAAE;AAEb,MAAI,MAAM,oBAAoB,SAAS,GAAG;AACxC,UAAM,KAAK,yBAAyB;AACpC,UAAM,oBAAoB,QAAQ,CAAC,MAAM,MAAM;AAC7C,YAAM,KAAK,GAAG,IAAI,CAAC,OAAO,KAAK,IAAI,aAAQ,KAAK,MAAM,EAAE;AAAA,IAC1D,CAAC;AACD,UAAM,KAAK,EAAE;AAAA,EACf;AAEA,MAAI,MAAM,cAAc,SAAS,GAAG;AAClC,UAAM,KAAK,sBAAsB,MAAM,cAAc,MAAM,mFAA8E;AACzI,eAAW,QAAQ,MAAM,eAAe;AACtC,YAAM,KAAK,KAAK,IAAI,EAAE;AAAA,IACxB;AACA,UAAM,KAAK,EAAE;AAAA,EACf;AAEA,MAAI,MAAM,gBAAgB,SAAS,GAAG;AACpC,UAAM,KAAK,sFAAuF;AAClG,eAAW,QAAQ,MAAM,gBAAiB,OAAM,KAAK,KAAK,IAAI,EAAE;AAChE,UAAM,KAAK,EAAE;AAAA,EACf;AAEA,MAAI,MAAM,cAAc,SAAS,GAAG;AAClC,UAAM,KAAK,mBAAmB;AAC9B,eAAW,OAAO,MAAM,cAAe,OAAM,KAAK,KAAK,GAAG,EAAE;AAC5D,UAAM,KAAK,EAAE;AAAA,EACf;AAEA,MAAI,MAAM,cAAc,SAAS,GAAG;AAClC,UAAM,KAAK,mBAAmB;AAC9B,eAAW,KAAK,MAAM,cAAe,OAAM,KAAK,KAAK,CAAC,EAAE;AACxD,UAAM,KAAK,EAAE;AAAA,EACf;AAEA,QAAM,KAAK,KAAK;AAChB,QAAM,KAAK,EAAE;AACb,QAAM,KAAK,iLAAiL;AAE5L,SAAO,MAAM,KAAK,IAAI;AACxB;",
+  "sourcesContent": ["/**\n * LLM Processor for content extraction\n * Uses any OpenAI-compatible endpoint. Reasoning effort is always 'low'.\n * Primary model exhausts its retries first; fallback model (LLM_FALLBACK_MODEL) then\n * gets up to FALLBACK_RETRY_COUNT additional attempts before the call fails.\n * NEVER throws \u2014 always returns a valid result.\n */\n\nimport OpenAI from 'openai';\nimport { LLM_EXTRACTION, getCapabilities } from '../config/index.js';\nimport { QUERY_REWRITE_PAIR_GUIDANCE_TEXT } from '../schemas/web-search.js';\nimport {\n  classifyError,\n  sleep,\n  ErrorCode,\n  withStallProtection,\n  type StructuredError,\n} from '../utils/errors.js';\nimport { mcpLog } from '../utils/logger.js';\n\n/** Maximum input characters for LLM processing (~125k tokens, sized for the larger fallback model) */\nconst MAX_LLM_INPUT_CHARS = 500_000 as const;\n\n/**\n * Maximum input characters for the primary model when it has a smaller context window.\n * Used when an input would exceed the mini model's limits so the call goes straight to fallback\n * instead of burning retries on guaranteed context_length_exceeded errors.\n */\nconst MAX_PRIMARY_MODEL_INPUT_CHARS = 100_000 as const;\n\n/** LLM client timeout in milliseconds */\nconst LLM_CLIENT_TIMEOUT_MS = 600_000 as const;\n\n/** Jitter factor for exponential backoff */\nconst BACKOFF_JITTER_FACTOR = 0.3 as const;\n\n/** Stall detection timeout \u2014 abort if no response in this time */\nconst LLM_STALL_TIMEOUT_MS = 75_000 as const;\n\n/** Hard request deadline for LLM calls */\nconst LLM_REQUEST_DEADLINE_MS = 150_000 as const;\n\n// ============================================================================\n// LLM health tracking \u2014 surfaced via health://status so capability-aware\n// clients can branch on degraded mode without parsing per-call footers.\n// ============================================================================\n\ntype LLMHealthKind = 'planner' | 'extractor';\n\nexport interface LLMHealthSnapshot {\n  readonly lastPlannerOk: boolean;\n  readonly lastExtractorOk: boolean;\n  readonly lastPlannerCheckedAt: string | null;\n  readonly lastExtractorCheckedAt: string | null;\n  readonly lastPlannerError: string | null;\n  readonly lastExtractorError: string | null;\n  readonly plannerConfigured: boolean;\n  readonly extractorConfigured: boolean;\n  /** Failures since the last success. Reset to 0 on `markLLMSuccess`. */\n  readonly consecutivePlannerFailures: number;\n  readonly consecutiveExtractorFailures: number;\n}\n\nconst llmHealth = {\n  lastPlannerOk: false,\n  lastExtractorOk: false,\n  lastPlannerCheckedAt: null as string | null,\n  lastExtractorCheckedAt: null as string | null,\n  lastPlannerError: null as string | null,\n  lastExtractorError: null as string | null,\n  consecutivePlannerFailures: 0,\n  consecutiveExtractorFailures: 0,\n};\n\nexport function markLLMSuccess(kind: LLMHealthKind): void {\n  const ts = new Date().toISOString();\n  if (kind === 'planner') {\n    llmHealth.lastPlannerOk = true;\n    llmHealth.lastPlannerCheckedAt = ts;\n    llmHealth.lastPlannerError = null;\n    llmHealth.consecutivePlannerFailures = 0;\n  } else {\n    llmHealth.lastExtractorOk = true;\n    llmHealth.lastExtractorCheckedAt = ts;\n    llmHealth.lastExtractorError = null;\n    llmHealth.consecutiveExtractorFailures = 0;\n  }\n}\n\nexport function markLLMFailure(kind: LLMHealthKind, err: unknown): void {\n  const ts = new Date().toISOString();\n  const message = err instanceof Error ? err.message : String(err ?? 'unknown error');\n  if (kind === 'planner') {\n    llmHealth.lastPlannerOk = false;\n    llmHealth.lastPlannerCheckedAt = ts;\n    llmHealth.lastPlannerError = message;\n    llmHealth.consecutivePlannerFailures += 1;\n  } else {\n    llmHealth.lastExtractorOk = false;\n    llmHealth.lastExtractorCheckedAt = ts;\n    llmHealth.lastExtractorError = message;\n    llmHealth.consecutiveExtractorFailures += 1;\n  }\n}\n\nexport function getLLMHealth(): LLMHealthSnapshot {\n  const cap = getCapabilities();\n  return {\n    lastPlannerOk: llmHealth.lastPlannerOk,\n    lastExtractorOk: llmHealth.lastExtractorOk,\n    lastPlannerCheckedAt: llmHealth.lastPlannerCheckedAt,\n    lastExtractorCheckedAt: llmHealth.lastExtractorCheckedAt,\n    lastPlannerError: llmHealth.lastPlannerError,\n    lastExtractorError: llmHealth.lastExtractorError,\n    // Static capability \u2014 based on env presence at boot. Runtime health (above)\n    // tells whether the last attempt actually succeeded.\n    plannerConfigured: cap.llmExtraction,\n    extractorConfigured: cap.llmExtraction,\n    consecutivePlannerFailures: llmHealth.consecutivePlannerFailures,\n    consecutiveExtractorFailures: llmHealth.consecutiveExtractorFailures,\n  };\n}\n\n/** Test-only \u2014 reset state between tests. Not exported from index. */\nexport function _resetLLMHealthForTests(): void {\n  llmHealth.lastPlannerOk = false;\n  llmHealth.lastExtractorOk = false;\n  llmHealth.lastPlannerCheckedAt = null;\n  llmHealth.lastExtractorCheckedAt = null;\n  llmHealth.lastPlannerError = null;\n  llmHealth.lastExtractorError = null;\n  llmHealth.consecutivePlannerFailures = 0;\n  llmHealth.consecutiveExtractorFailures = 0;\n}\n\ninterface ProcessingConfig {\n  readonly enabled: boolean;\n  readonly extract: string | undefined;\n  readonly url?: string;\n}\n\ninterface LLMResult {\n  readonly content: string;\n  readonly processed: boolean;\n  readonly error?: string;\n  readonly errorDetails?: StructuredError;\n}\n\n// LLM-specific retry configuration\nconst LLM_RETRY_CONFIG = {\n  maxRetries: 2,\n  baseDelayMs: 1000,\n  maxDelayMs: 5000,\n} as const;\n\n/** Number of additional attempts using the fallback model after primary exhausts. */\nconst FALLBACK_RETRY_COUNT = 3 as const;\n\n// OpenAI-compatible retryable error codes (using Set for type-safe lookup)\nconst RETRYABLE_LLM_ERROR_CODES = new Set([\n  'rate_limit_exceeded',\n  'server_error',\n  'timeout',\n  'service_unavailable',\n]);\n\n/** Type guard for errors with an HTTP status code */\nfunction hasStatus(error: unknown): error is { status: number } {\n  return (\n    typeof error === 'object' &&\n    error !== null &&\n    'status' in error &&\n    typeof (error as Record<string, unknown>).status === 'number'\n  );\n}\n\nlet llmClient: OpenAI | null = null;\n\ninterface ChatCompletionTextResponse {\n  readonly choices?: ReadonlyArray<{\n    readonly message?: {\n      readonly content?: string | null;\n    } | null;\n  } | null>;\n}\n\nexport interface OpenAITextGenerator {\n  readonly chat: {\n    readonly completions: {\n      readonly create: (\n        body: OpenAI.ChatCompletionCreateParamsNonStreaming,\n        options: { readonly signal?: AbortSignal; readonly timeout: number },\n      ) => Promise<ChatCompletionTextResponse>;\n    };\n  };\n}\n\ninterface LLMTextSuccess {\n  readonly content: string;\n  readonly model: string;\n}\n\ninterface LLMTextEmptyFailure {\n  readonly content: null;\n  readonly model: string;\n  readonly error: string;\n  readonly failureKind: 'empty';\n}\n\ninterface LLMTextProviderFailure {\n  readonly content: null;\n  readonly model: string;\n  readonly error: string;\n  readonly failureKind: 'provider';\n  readonly errorCause: unknown;\n}\n\ntype LLMTextFailure = LLMTextEmptyFailure | LLMTextProviderFailure;\n\nexport type LLMTextResponse = LLMTextSuccess | LLMTextFailure;\n\nexport function createLLMProcessor(): OpenAI | null {\n  if (!getCapabilities().llmExtraction) return null;\n\n  if (!llmClient) {\n    llmClient = new OpenAI({\n      baseURL: LLM_EXTRACTION.BASE_URL,\n      apiKey: LLM_EXTRACTION.API_KEY,\n      timeout: LLM_CLIENT_TIMEOUT_MS,\n      maxRetries: 0,\n      defaultHeaders: { 'X-Title': 'mcp-research-powerpack' },\n    });\n    mcpLog('info', `LLM extraction configured (model: ${LLM_EXTRACTION.MODEL}, baseURL: ${LLM_EXTRACTION.BASE_URL})`, 'llm');\n  }\n  return llmClient;\n}\n\nfunction buildChatRequestBody(model: string, prompt: string): Record<string, unknown> {\n  return {\n    model,\n    messages: [{ role: 'user', content: prompt }],\n    reasoning_effort: 'low',\n  };\n}\n\nfunction normalizeProviderError(err: unknown, message: string): unknown {\n  if (typeof err === 'object' && err !== null) return err;\n  return new Error(message);\n}\n\nfunction getProviderFailure(response: LLMTextResponse): unknown | null {\n  if (response.content !== null || response.failureKind !== 'provider') return null;\n  return response.errorCause;\n}\n\nfunction emptyLLMExtractionResult(content: string): LLMResult {\n  return {\n    content,\n    processed: false,\n    error: 'LLM returned empty response',\n    errorDetails: {\n      code: ErrorCode.INTERNAL_ERROR,\n      message: 'LLM returned empty response',\n      retryable: false,\n    },\n  };\n}\n\nexport async function requestText(\n  processor: OpenAITextGenerator,\n  prompt: string,\n  operationLabel: string,\n  signal?: AbortSignal,\n  modelOverride?: string,\n): Promise<LLMTextResponse> {\n  const model = modelOverride || LLM_EXTRACTION.MODEL;\n\n  try {\n    const response = await withStallProtection(\n      (stallSignal) => processor.chat.completions.create(\n        buildChatRequestBody(model, prompt) as unknown as OpenAI.ChatCompletionCreateParamsNonStreaming,\n        {\n          signal: signal ? AbortSignal.any([stallSignal, signal]) : stallSignal,\n          timeout: LLM_REQUEST_DEADLINE_MS,\n        },\n      ),\n      LLM_STALL_TIMEOUT_MS,\n      3,\n      `${operationLabel} (${model})`,\n    );\n\n    const content = response.choices?.[0]?.message?.content?.trim();\n    if (content) {\n      return { content, model };\n    }\n\n    const err = `Empty response from model ${model}`;\n    mcpLog('warning', `${operationLabel} returned empty content for model ${model}`, 'llm');\n    return { content: null, model, error: err, failureKind: 'empty' };\n  } catch (err: unknown) {\n    const message = err instanceof Error ? err.message : String(err);\n    mcpLog('warning', `${operationLabel} failed for model ${model}: ${message}`, 'llm');\n    return {\n      content: null,\n      model,\n      error: message,\n      failureKind: 'provider',\n      errorCause: normalizeProviderError(err, message),\n    };\n  }\n}\n\n/**\n * Single LLM call with automatic fallback model.\n * Tries the primary model once; if it fails and LLM_FALLBACK_MODEL is set,\n * retries up to FALLBACK_RETRY_COUNT times on the fallback model.\n * Used for single-shot calls (classify, brief, refine queries).\n */\nexport async function requestTextWithFallback(\n  processor: OpenAITextGenerator,\n  prompt: string,\n  operationLabel: string,\n  signal?: AbortSignal,\n): Promise<LLMTextResponse> {\n  const primary = await requestText(processor, prompt, operationLabel, signal);\n  if (primary.content !== null) return primary;\n\n  const fallbackModel = LLM_EXTRACTION.FALLBACK_MODEL;\n  if (!fallbackModel) return primary;\n\n  mcpLog('warning', `Primary model failed, switching to fallback ${fallbackModel}`, 'llm');\n\n  let lastFailure: LLMTextFailure = primary;\n  for (let attempt = 0; attempt < FALLBACK_RETRY_COUNT; attempt++) {\n    if (attempt > 0) {\n      const delayMs = calculateLLMBackoff(attempt - 1);\n      mcpLog('warning', `Fallback retry ${attempt}/${FALLBACK_RETRY_COUNT - 1} in ${delayMs}ms`, 'llm');\n      try { await sleep(delayMs, signal); } catch { break; }\n    }\n    const result = await requestText(processor, prompt, `${operationLabel} [fallback]`, signal, fallbackModel);\n    if (result.content !== null) return result;\n    lastFailure = result;\n  }\n\n  return lastFailure;\n}\n\n/**\n * Check if an LLM error is retryable\n */\nfunction isRetryableLLMError(error: unknown): boolean {\n  if (!error || typeof error !== 'object') return false;\n\n  // Stall/timeout protection errors - always retry these\n  const stallCode = (error as { code?: string })?.code;\n  if (stallCode === 'ESTALLED' || stallCode === 'ETIMEDOUT') {\n    return true;\n  }\n\n  // Check HTTP status codes\n  if (hasStatus(error)) {\n    if (error.status === 429 || error.status === 500 || error.status === 502 || error.status === 503 || error.status === 504) {\n      return true;\n    }\n  }\n\n  // Check error codes from the OpenAI-compatible endpoint\n  const record = error as Record<string, unknown>;\n  const code = typeof record.code === 'string' ? record.code : undefined;\n  const nested =\n    typeof record.error === 'object' && record.error !== null\n      ? (record.error as Record<string, unknown>)\n      : null;\n  const errorCode =\n    code ??\n    (nested && typeof nested.code === 'string' ? nested.code : undefined) ??\n    (nested && typeof nested.type === 'string' ? nested.type : undefined);\n  if (errorCode && RETRYABLE_LLM_ERROR_CODES.has(errorCode)) {\n    return true;\n  }\n\n  // Check message for common patterns\n  const message = typeof record.message === 'string' ? record.message.toLowerCase() : '';\n  if (\n    message.includes('rate limit') ||\n    message.includes('timeout') ||\n    message.includes('timed out') ||\n    message.includes('service unavailable') ||\n    message.includes('server error') ||\n    message.includes('connection') ||\n    message.includes('econnreset')\n  ) {\n    return true;\n  }\n\n  return false;\n}\n\n/**\n * Detect \"the prompt is too long for this model\" errors.\n * These are NOT retryable on the same model \u2014 we should skip remaining primary retries\n * and go straight to the fallback model (which has a larger context window).\n */\nfunction isContextWindowError(error: unknown): boolean {\n  if (!error || typeof error !== 'object') return false;\n\n  const record = error as Record<string, unknown>;\n  const nested =\n    typeof record.error === 'object' && record.error !== null\n      ? (record.error as Record<string, unknown>)\n      : null;\n\n  const code = typeof record.code === 'string' ? record.code : undefined;\n  const nestedCode = nested && typeof nested.code === 'string' ? nested.code : undefined;\n  if (code === 'context_length_exceeded' || nestedCode === 'context_length_exceeded') {\n    return true;\n  }\n\n  const messages: string[] = [];\n  if (typeof record.message === 'string') messages.push(record.message);\n  if (nested && typeof nested.message === 'string') messages.push(nested.message);\n  const combined = messages.join(' ').toLowerCase();\n  return (\n    combined.includes('context length') ||\n    combined.includes('context window') ||\n    combined.includes('maximum context') ||\n    combined.includes('maximum tokens') ||\n    combined.includes('token limit') ||\n    combined.includes('too many tokens') ||\n    combined.includes('prompt is too long') ||\n    combined.includes('reduce the length')\n  );\n}\n\n/**\n * Calculate backoff delay with jitter for LLM retries\n */\nfunction calculateLLMBackoff(attempt: number): number {\n  const exponentialDelay = LLM_RETRY_CONFIG.baseDelayMs * Math.pow(2, attempt);\n  const jitter = Math.random() * BACKOFF_JITTER_FACTOR * exponentialDelay;\n  return Math.min(exponentialDelay + jitter, LLM_RETRY_CONFIG.maxDelayMs);\n}\n\n/**\n * Process content with LLM extraction\n * NEVER throws - always returns a valid LLMResult\n * Implements retry logic with exponential backoff for transient failures\n */\nexport async function processContentWithLLM(\n  content: string,\n  config: ProcessingConfig,\n  processor?: OpenAITextGenerator | null,\n  signal?: AbortSignal\n): Promise<LLMResult> {\n  // Early returns for invalid/skip conditions\n  if (!config.enabled) {\n    return { content, processed: false };\n  }\n\n  if (!processor) {\n    return {\n      content,\n      processed: false,\n      error: 'LLM processor not available (LLM_API_KEY, LLM_BASE_URL, and LLM_MODEL must all be set)',\n      errorDetails: {\n        code: ErrorCode.AUTH_ERROR,\n        message: 'LLM processor not available',\n        retryable: false,\n      },\n    };\n  }\n\n  if (!content?.trim()) {\n    return { content: content || '', processed: false, error: 'Empty content provided' };\n  }\n\n  // Truncate extremely long content to avoid blowing past even the fallback model's context.\n  const truncatedContent = content.length > MAX_LLM_INPUT_CHARS\n    ? content.substring(0, MAX_LLM_INPUT_CHARS) + '\\n\\n[Content truncated due to length]'\n    : content;\n\n  // If the prompt would exceed the primary (mini) model's smaller context window,\n  // skip it entirely and go straight to the fallback model. Saves burning retries\n  // on guaranteed context_length_exceeded errors.\n  const skipPrimaryForSize =\n    truncatedContent.length > MAX_PRIMARY_MODEL_INPUT_CHARS && !!LLM_EXTRACTION.FALLBACK_MODEL;\n\n  // Sanitize URL before sending to LLM: drop query string and fragment\n  // so signed URLs, session tokens, auth params, or tracking hashes never\n  // land in a third-party LLM prompt. Keep origin + path for page-type classification.\n  const safeUrl = (() => {\n    if (!config.url) return undefined;\n    try {\n      const u = new URL(config.url);\n      return `${u.origin}${u.pathname}`;\n    } catch {\n      return undefined;\n    }\n  })();\n  const urlLine = safeUrl ? `PAGE URL: ${safeUrl}\\n\\n` : '';\n\n  const prompt = config.extract\n    ? `You are a factual extractor for a research agent. Extract ONLY the information that matches the instruction below. Do not summarize, interpret, or editorialize.\n\n${urlLine}EXTRACTION INSTRUCTION: ${config.extract}\n\nSTEP 1 \u2014 Classify this page. Look at the URL if present, plus structural cues (code blocks, table patterns, comment threads, marketing copy). Pick ONE:\n\\`docs | changelog | github-readme | github-thread | reddit | hackernews | forum | blog | marketing | announcement | qa | cve | paper | release-notes | other\\`\n\nSTEP 2 \u2014 Adjust emphasis by page type:\n- docs / changelog / github-readme / release-notes \u2192 API signatures, version numbers, flags, exact config keys, code blocks. Copy verbatim. Preserve tables as tables.\n- github-thread \u2192 weight MAINTAINER comments (label \"[maintainer]\") over drive-by commenters. Preserve stacktraces verbatim. Capture chronological resolution \u2014 what was decided and when. Link the accepted-fix commit/PR if referenced.\n- reddit / hackernews / forum \u2192 lived experience. Quote verbatim with attribution (\"u/foo wrote: \u2026\" or \"user <name>\"). Prioritize replies with stack details, specific failure stories, or replies that contradict the OP. Record overall sentiment distribution as one bullet if clear skew (\"~70% agree / ~20% dissent / rest off-topic\"). Drop context-free opinions (\"this sucks\") from Matches.\n- blog \u2192 prioritize concrete reproductions, code, measurements. If the author makes a claim without evidence, mark \"[unsourced claim]\".\n- marketing / announcement \u2192 pricing tiers, feature matrices verbatim, free-tier quotas, enterprise contact. Preserve tables as tables. Treat roadmap/future-tense claims skeptically \u2014 note them as \"[announced, not shipped]\" when framing is future-tense.\n- qa (stackoverflow) \u2192 accepted answer's code + high-voted disagreements. Always note the answer date \u2014 SO rots.\n- cve \u2192 CVSS vector verbatim, CWE, CPE ranges, affected versions, fix version, references. Each with its label.\n- paper \u2192 claim, method, dataset, benchmark numbers, comparison baseline. Preserve numeric deltas verbatim.\n\nSTEP 3 \u2014 Emit markdown with these sections, in order:\n\n## Source\n- URL: <verbatim if visible, else \"unknown\">\n- Page type: <the type you picked>\n- Page date: <verbatim if visible, else \"not visible\">\n- Author / maintainer (if identifiable): <verbatim>\n\n## Matches\nOne bullet per distinct piece of matching info:\n- **<short label>** \u2014 the information. Quote VERBATIM for: numbers, versions, dates, API names, prices, error messages, stacktraces, CVSS vectors, benchmark scores, command flags, proper nouns, and people's words. Backticks for code/identifiers. Preserve tables.\n\n## Not found\nEvery part of the extraction instruction this page did NOT answer. Be explicit. Example: \"Enterprise pricing contact \u2014 not present on this page.\"\n\n## Follow-up signals\nShort bullets \u2014 NEW angles this page surfaced that the agent should investigate. Include: new terms, unexpected vendor names, contradicting claims, referenced-but-unscraped URLs. Copy URLs VERBATIM from the source; if only anchor text is visible, write \"anchor: <text> (URL not in scraped content)\". Skip this section if nothing new surfaced. Do NOT invent.\n\n## Contradictions\n(Include this section only if the page contains internally contradictory claims.) Bullet each contradiction with both sides quoted verbatim.\n\n## Truncation\n(Include only if content appears cut mid-element.) \"Content cut mid-<table row / code block / comment / paragraph>; extraction may be incomplete for <section>.\"\n\nRULES:\n- Never paraphrase numbers, versions, code, or quoted text.\n- If an instruction item is not answered, it goes in \"Not found\" \u2014 do NOT invent an answer to please the caller.\n- Preserve code blocks, command examples, tables exactly.\n- Do NOT add commentary or recommendations outside \"Follow-up signals\".\n- Page language \u2260 English: quote verbatim in the original language AND provide a parenthetical gloss in English.\n- Page appears gated (login wall, paywall, JS-render-empty shell) or near-empty: BEFORE dismissing the page, look for ANY visible text \u2014 og:title, og:description, meta description, headline, author name, nav labels, teaser/preview sentences, visible comment snippets. If ANY such text exists, extract it as usual under \\`## Source\\` + \\`## Matches\\`, and list the blocked facets under \\`## Not found\\`. Prefix the first \\`## Matches\\` bullet with \\`**[partial \u2014 <reason>]**\\` so the caller knows the body is gated (reasons: \\`login-wall | paywall | JS-render-empty | truncated-before-relevant-section\\`). ONLY when there is NO visible extractable text at all (< 50 words AND no og:* AND no headline AND no preview), return exactly one line:\n  \\`## Matches\\\\n_Page did not load: <reason>_\\`\n  Valid reasons: \\`404 | login-wall | paywall | JS-render-empty | non-text-asset | truncated-before-relevant-section\\`.\n\nContent:\n${truncatedContent}`\n    : `Clean the following page content: drop navigation, ads, cookie banners, footers, author bios, related-article lists. Preserve headings, paragraphs, code blocks, tables, and inline links as \\`[text](url)\\`. Do NOT summarize \u2014 preserve the full body.\n\n${urlLine}Content:\n${truncatedContent}`;\n\n  let lastError: StructuredError | undefined;\n\n  // Phase 1: primary model with up to LLM_RETRY_CONFIG.maxRetries retries.\n  // Skip entirely when the input is too big for the primary's context window.\n  if (skipPrimaryForSize) {\n    mcpLog(\n      'info',\n      `Input ${truncatedContent.length} chars exceeds primary model cap (${MAX_PRIMARY_MODEL_INPUT_CHARS}); routing directly to fallback`,\n      'llm',\n    );\n  } else {\n    for (let attempt = 0; attempt <= LLM_RETRY_CONFIG.maxRetries; attempt++) {\n      try {\n        if (attempt === 0) {\n          mcpLog('info', `Starting extraction with ${LLM_EXTRACTION.MODEL}`, 'llm');\n        } else {\n          mcpLog('warning', `Retry attempt ${attempt}/${LLM_RETRY_CONFIG.maxRetries}`, 'llm');\n        }\n\n        const response = await requestText(processor, prompt, 'LLM extraction', signal);\n\n        if (response.content !== null) {\n          mcpLog('info', `Successfully extracted ${response.content.length} characters`, 'llm');\n          markLLMSuccess('extractor');\n          return { content: response.content, processed: true };\n        }\n\n        const providerFailure = getProviderFailure(response);\n        if (providerFailure) {\n          throw providerFailure;\n        }\n\n        // Empty response \u2014 not retryable\n        mcpLog('warning', 'Received empty response from LLM', 'llm');\n        markLLMFailure('extractor', 'LLM returned empty response');\n        return emptyLLMExtractionResult(content);\n\n      } catch (err: unknown) {\n        lastError = classifyError(err);\n        const status = hasStatus(err) ? err.status : undefined;\n        const code = typeof err === 'object' && err !== null && 'code' in err\n          ? String((err as Record<string, unknown>).code)\n          : undefined;\n        const ctxErr = isContextWindowError(err);\n        mcpLog('error', `Error (attempt ${attempt + 1}): ${lastError.message} [status=${status}, code=${code}, retryable=${isRetryableLLMError(err)}, context_window=${ctxErr}]`, 'llm');\n\n        // Context window errors are not retryable on the same model \u2014 jump to fallback.\n        if (ctxErr) {\n          mcpLog('warning', 'Context window exceeded on primary \u2014 skipping remaining retries, routing to fallback', 'llm');\n          break;\n        }\n\n        if (isRetryableLLMError(err) && attempt < LLM_RETRY_CONFIG.maxRetries) {\n          const delayMs = calculateLLMBackoff(attempt);\n          mcpLog('warning', `Retrying in ${delayMs}ms...`, 'llm');\n          try { await sleep(delayMs, signal); } catch { break; }\n          continue;\n        }\n        break;\n      }\n    }\n  }\n\n  // Phase 2: fallback model \u2014 FALLBACK_RETRY_COUNT attempts before giving up\n  const fallbackModel = LLM_EXTRACTION.FALLBACK_MODEL;\n  if (fallbackModel) {\n    mcpLog('warning', `Primary exhausted, switching to fallback ${fallbackModel}`, 'llm');\n    for (let attempt = 0; attempt < FALLBACK_RETRY_COUNT; attempt++) {\n      if (attempt > 0) {\n        const delayMs = calculateLLMBackoff(attempt - 1);\n        mcpLog('warning', `Fallback retry ${attempt}/${FALLBACK_RETRY_COUNT - 1} in ${delayMs}ms`, 'llm');\n        try { await sleep(delayMs, signal); } catch { break; }\n      }\n      try {\n        const response = await requestText(processor, prompt, 'LLM extraction [fallback]', signal, fallbackModel);\n        if (response.content !== null) {\n          mcpLog('info', `Fallback extracted ${response.content.length} characters`, 'llm');\n          markLLMSuccess('extractor');\n          return { content: response.content, processed: true };\n        }\n\n        const providerFailure = getProviderFailure(response);\n        if (providerFailure) {\n          throw providerFailure;\n        }\n\n        mcpLog('warning', 'Fallback returned empty response', 'llm');\n        markLLMFailure('extractor', 'LLM returned empty response');\n        return emptyLLMExtractionResult(content);\n      } catch (err: unknown) {\n        lastError = classifyError(err);\n        mcpLog('error', `Fallback error (attempt ${attempt + 1}): ${lastError.message}`, 'llm');\n      }\n    }\n  }\n\n  const errorMessage = lastError?.message || 'Unknown LLM error';\n  mcpLog('error', `All attempts failed: ${errorMessage}. Returning original content.`, 'llm');\n  markLLMFailure('extractor', errorMessage);\n\n  return {\n    content,\n    processed: false,\n    error: `LLM extraction failed: ${errorMessage}`,\n    errorDetails: lastError || {\n      code: ErrorCode.UNKNOWN_ERROR,\n      message: errorMessage,\n      retryable: false,\n    },\n  };\n}\n\n// ============================================================================\n// Web-Search Result Classification\n// ============================================================================\n\n/** Maximum URLs to send to the LLM for classification */\nconst MAX_CLASSIFICATION_URLS = 50 as const;\n\n/** Classification tiers */\ntype ClassificationTier = 'HIGHLY_RELEVANT' | 'MAYBE_RELEVANT' | 'OTHER';\n\nexport interface ClassificationEntry {\n  readonly rank: number;\n  readonly tier: ClassificationTier;\n  readonly source_type?: string;\n  readonly reason?: string;\n}\n\nexport interface ClassificationGap {\n  readonly id: number;\n  readonly description: string;\n}\n\nexport interface ClassificationResult {\n  readonly title: string;\n  readonly synthesis: string;\n  readonly results: ClassificationEntry[];\n  readonly refine_queries?: Array<{\n    readonly query: string;\n    readonly rationale: string;\n    readonly gap_id?: number;\n  }>;\n  readonly confidence?: 'high' | 'medium' | 'low';\n  readonly confidence_reason?: string;\n  readonly gaps?: ClassificationGap[];\n}\n\nexport interface RefineQuerySuggestion {\n  readonly query: string;\n  readonly rationale: string;\n  readonly gap_id?: number;\n  readonly gap_description?: string;\n}\n\n/**\n * Classify web-search results by relevance to an objective using the LLM.\n * Sends only titles, snippets, and domain names \u2014 does NOT fetch URLs.\n * Returns null on failure (caller should fall back to raw output).\n */\nexport async function classifySearchResults(\n  rankedUrls: ReadonlyArray<{\n    readonly rank: number;\n    readonly url: string;\n    readonly title: string;\n    readonly snippet: string;\n    readonly frequency: number;\n    readonly queries: string[];\n  }>,\n  objective: string,\n  totalQueries: number,\n  processor: OpenAI,\n  previousQueries: readonly string[] = [],\n): Promise<{ result: ClassificationResult | null; error?: string }> {\n  const urlsToClassify = rankedUrls.slice(0, MAX_CLASSIFICATION_URLS);\n\n  // Descending static weights fed to the LLM. Higher-ranked URLs get a bigger\n  // weight so the classifier biases HIGHLY_RELEVANT toward them. The weights\n  // here are a shown-to-LLM summary, not the internal CTR ranking (which\n  // still runs in url-aggregator.ts). Rank 11+ all bucket to w=1.\n  const STATIC_WEIGHTS = [30, 20, 15, 10, 8, 6, 5, 4, 3, 2] as const;\n  const weightForRank = (rank: number): number => STATIC_WEIGHTS[rank - 1] ?? 1;\n\n  // Build compressed result list \u2014 weight + title + domain + snippet (truncated)\n  const lines: string[] = [];\n  for (const url of urlsToClassify) {\n    let domain: string;\n    try {\n      domain = new URL(url.url).hostname.replace(/^www\\./, '');\n    } catch {\n      domain = url.url;\n    }\n    const snippet = url.snippet.length > 120\n      ? url.snippet.slice(0, 117) + '...'\n      : url.snippet;\n    lines.push(`[${url.rank}] w=${weightForRank(url.rank)} ${url.title} \u2014 ${domain} \u2014 ${snippet}`);\n  }\n\n  const prevQueriesBlock = previousQueries.length > 0\n    ? previousQueries.map((q) => `- ${q}`).join('\\n')\n    : '- (none provided)';\n  const today = new Date().toISOString().slice(0, 10);\n\n  const prompt = `You are the relevance filter for a research agent. Classify each search result below against the objective and produce a structured analysis.\n\nOBJECTIVE: ${objective}\nTODAY: ${today}\n\nPREVIOUS QUERIES (already run \u2014 do NOT paraphrase in refine_queries):\n${prevQueriesBlock}\n\nReturn ONLY a JSON object (no markdown, no code fences):\n\n{\n  \"title\": \"2\u20138 word label for this RESULT CLUSTER (not the objective)\",\n  \"synthesis\": \"3\u20135 sentences grounded in the results. Every non-trivial claim cites a rank in [brackets], e.g. '[3] documents the flag; [7][12] report it is broken on macOS.' A synthesis with zero citations is invalid.\",\n  \"confidence\": \"high | medium | low\",\n  \"confidence_reason\": \"one sentence \u2014 why\",\n  \"gaps\": [\n    { \"id\": 0, \"description\": \"specific, actionable thing the current results do NOT answer \u2014 not 'more info needed'\" }\n  ],\n  \"refine_queries\": [\n    { \"query\": \"concrete next search\", \"gap_id\": 0, \"rationale\": \"\u226412 words\" }\n  ],\n  \"results\": [\n    {\n      \"rank\": 1,\n      \"tier\": \"HIGHLY_RELEVANT | MAYBE_RELEVANT | OTHER\",\n      \"source_type\": \"vendor_doc | github | reddit | hackernews | blog | news | marketing | stackoverflow | cve | paper | release_notes | aggregator | other\",\n      \"reason\": \"\u226412 words citing the snippet cue that drove the tier\"\n    }\n  ]\n}\n\nWEIGHT SCHEME: each row is prefixed with a weight (w=N). Higher weight means the URL ranked better across input queries \u2014 prefer HIGHLY_RELEVANT for high-weight rows when content matches the objective. Weight alone never justifies HIGHLY_RELEVANT; snippet cues still drive the decision.\n\nSOURCE-OF-TRUTH RUBRIC (the \"primary source\" is goal-dependent \u2014 infer goal type from the objective):\n- spec / API / config questions \u2192 vendor_doc, github (README, RFC), release_notes are primary\n- bug / failure-mode questions \u2192 github (issue/PR), stackoverflow are primary\n- migration / sentiment / lived-experience \u2192 reddit, hackernews, blog are primary; docs are secondary\n- pricing / commercial \u2192 marketing (the vendor's own pricing page IS the primary source, but treat feature lists skeptically)\n- security / CVE \u2192 cve databases, distro security trackers (nvd.nist.gov, security-tracker.debian.org, ubuntu.com/security) are primary\n- synthesis / open-ended \u2192 blend; no single type is primary\n- product launch \u2192 vendor_doc + news + marketing for the launch itself; blogs + reddit for independent verification\n\nFRESHNESS: proportional to topic velocity. For a week-old release, demote anything older than 30 days. For general tech questions, demote older than 18 months. For stable protocols (HTTP, TCP, POSIX), don't demote by age.\n\nCONFIDENCE:\n- high = \u22653 HIGHLY_RELEVANT results from INDEPENDENT domains agree on the core answer\n- medium = \u22652 HIGHLY_RELEVANT exist but disagree or share a domain; OR a single authoritative primary source answers it\n- low = otherwise; snippet-only judgments cap at medium\n\nREFINE QUERIES \u2014 each MUST differ from every previousQuery by:\n- a new operator (site:, quotes, verbatim version number), OR\n- a domain-specific noun ABSENT from every prior query\nAdding a year alone does NOT count as differentiation.\nEach refine_query MUST reference a specific gap_id from the gaps array above.\nProduce 4\u20138 refine_queries total. Cover: (a) a primary-source probe, (b) a temporal sharpener, (c) a failure-mode or comparison probe, (d) at least one new-term probe seeded by a specific result's snippet.\n\nRULES:\n- Classify ALL ${urlsToClassify.length} results. Do not skip or collapse any.\n- Use only the three tier values.\n- Judge from title + domain + snippet only. Do NOT invent facts not present in the snippet.\n- If ALL results are OTHER: synthesis = \"\", confidence = \"low\", and \\`gaps\\` must explicitly state why the current queries missed the target.\n- Casing: tier = UPPERCASE_WITH_UNDERSCORES, confidence = lowercase.\n\nSEARCH RESULTS (${urlsToClassify.length} URLs from ${totalQueries} queries):\n${lines.join('\\n')}`;\n\n  try {\n    mcpLog('info', `Classifying ${urlsToClassify.length} URLs against objective`, 'llm');\n\n    const response = await requestTextWithFallback(\n      processor,\n      prompt,\n      'Search classification',\n    );\n\n    if (response.content === null) {\n      const errMsg = response.error ?? 'LLM returned empty classification response';\n      markLLMFailure('planner', errMsg);\n      return { result: null, error: errMsg };\n    }\n\n    // Strip markdown code fences if present\n    const cleaned = response.content.replace(/^```(?:json)?\\s*\\n?/m, '').replace(/\\n?```\\s*$/m, '').trim();\n    const parsed = JSON.parse(cleaned) as ClassificationResult;\n\n    // Validate the response shape.\n    // Note: synthesis is typed not truthy \u2014 the prompt explicitly instructs an empty string\n    // for the all-OTHER case, and we must not reject that.\n    if (!parsed.title || typeof parsed.synthesis !== 'string' || !Array.isArray(parsed.results)) {\n      const errMsg = 'LLM response missing required fields (title, synthesis, results)';\n      markLLMFailure('planner', errMsg);\n      return { result: null, error: errMsg };\n    }\n\n    mcpLog('info', `Classification complete: ${parsed.results.filter(r => r.tier === 'HIGHLY_RELEVANT').length} highly relevant`, 'llm');\n    markLLMSuccess('planner');\n    return { result: parsed };\n  } catch (err: unknown) {\n    const message = err instanceof Error ? err.message : String(err);\n    mcpLog('error', `Classification failed: ${message}`, 'llm');\n    markLLMFailure('planner', message);\n    return { result: null, error: `Classification failed: ${message}` };\n  }\n}\n\nexport async function suggestRefineQueriesForRawMode(\n  rankedUrls: ReadonlyArray<{\n    readonly rank: number;\n    readonly url: string;\n    readonly title: string;\n  }>,\n  objective: string,\n  originalQueries: readonly string[],\n  processor: OpenAI,\n): Promise<{ result: RefineQuerySuggestion[]; error?: string }> {\n  const urlsToSummarize = rankedUrls.slice(0, 12);\n  const lines = urlsToSummarize.map((url) => {\n    let domain: string;\n    try {\n      domain = new URL(url.url).hostname.replace(/^www\\./, '');\n    } catch {\n      domain = url.url;\n    }\n    return `[${url.rank}] ${url.title} \u2014 ${domain}`;\n  });\n\n  const prompt = `You are generating follow-up search queries for an agent using raw web-search results.\n\nReturn ONLY a JSON object (no markdown, no code fences):\n{\n  \"refine_queries\": [\n    { \"query\": \"next search query\", \"gap_description\": \"what gap this closes\", \"rationale\": \"\u226412 words on why\" }\n  ]\n}\n\nOBJECTIVE: ${objective}\n\nPREVIOUS QUERIES (already run \u2014 do NOT paraphrase):\n${originalQueries.map((query) => `- ${query}`).join('\\n')}\n\nTOP RESULT TITLES (to seed new-term probes):\n${lines.join('\\n')}\n\nRULES:\n- Produce 4\u20136 diverse follow-ups. Cover: (a) a primary-source probe (site:, RFC, vendor docs); (b) a temporal sharpener (changelog, version number); (c) a failure-mode or comparison probe; (d) at least one new-term probe seeded by a specific result title.\n- Each query MUST differ from every previousQuery by either a new operator (site:, quotes, a verbatim version number) OR a domain-specific noun absent from every prior query. Adding a year alone does NOT count.\n- Each refine_query MUST include a \\`gap_description\\` naming what the current results don't answer.\n- Do not include URLs.\n- Keep rationales \u226412 words.`;\n\n  try {\n    const response = await requestTextWithFallback(\n      processor,\n      prompt,\n      'Raw-mode refine query generation',\n    );\n\n    if (response.content === null) {\n      const errMsg = response.error ?? 'LLM returned empty raw-mode refine query response';\n      markLLMFailure('planner', errMsg);\n      return { result: [], error: errMsg };\n    }\n\n    const cleaned = response.content.replace(/^```(?:json)?\\s*\\n?/m, '').replace(/\\n?```\\s*$/m, '').trim();\n    const parsed = JSON.parse(cleaned) as { refine_queries?: RefineQuerySuggestion[] };\n\n    markLLMSuccess('planner');\n    return { result: Array.isArray(parsed.refine_queries) ? parsed.refine_queries : [] };\n  } catch (err: unknown) {\n    const message = err instanceof Error ? err.message : String(err);\n    mcpLog('error', `Raw-mode refine query generation failed: ${message}`, 'llm');\n    markLLMFailure('planner', message);\n    return { result: [], error: message };\n  }\n}\n\n// ============================================================================\n// Research Brief \u2014 goal-aware orientation (called by start-research)\n// ============================================================================\n\nexport type PrimaryBranch = 'reddit' | 'web' | 'both';\n\nexport interface ResearchBriefStep {\n  readonly tool: 'web-search' | 'scrape-links';\n  readonly reason: string;\n}\n\nexport interface ResearchBrief {\n  readonly goal_class: string;\n  readonly goal_class_reason: string;\n  readonly primary_branch: PrimaryBranch;\n  readonly primary_branch_reason: string;\n  readonly freshness_window: string;\n  readonly first_call_sequence: readonly ResearchBriefStep[];\n  readonly keyword_seeds: readonly string[];\n  readonly iteration_hints: readonly string[];\n  readonly gaps_to_watch: readonly string[];\n  readonly stop_criteria: readonly string[];\n}\n\nconst VALID_GOAL_CLASSES = new Set([\n  'spec', 'bug', 'migration', 'sentiment', 'pricing', 'security',\n  'synthesis', 'product_launch', 'other',\n]);\n\nconst VALID_FRESHNESS = new Set(['days', 'weeks', 'months', 'years']);\nconst VALID_BRANCHES = new Set<PrimaryBranch>(['reddit', 'web', 'both']);\nconst VALID_STEP_TOOLS = new Set(['web-search', 'scrape-links']);\n\nfunction isStringArray(value: unknown): value is string[] {\n  return Array.isArray(value) && value.every((v) => typeof v === 'string');\n}\n\nfunction isStepArray(value: unknown): value is ResearchBriefStep[] {\n  return Array.isArray(value) && value.every((s) => {\n    if (typeof s !== 'object' || s === null) return false;\n    const tool = (s as Record<string, unknown>).tool;\n    const reason = (s as Record<string, unknown>).reason;\n    return typeof tool === 'string'\n      && VALID_STEP_TOOLS.has(tool)\n      && typeof reason === 'string'\n      && reason.trim().length > 0;\n  });\n}\n\nexport function parseResearchBrief(raw: string): ResearchBrief | null {\n  try {\n    const cleaned = raw.replace(/^```(?:json)?\\s*\\n?/m, '').replace(/\\n?```\\s*$/m, '').trim();\n    const parsed = JSON.parse(cleaned) as Record<string, unknown>;\n\n    const goal_class = typeof parsed.goal_class === 'string' ? parsed.goal_class : null;\n    if (!goal_class || !VALID_GOAL_CLASSES.has(goal_class)) return null;\n\n    const freshness_window = typeof parsed.freshness_window === 'string' ? parsed.freshness_window : null;\n    if (!freshness_window || !VALID_FRESHNESS.has(freshness_window)) return null;\n\n    const primary_branch = parsed.primary_branch;\n    if (typeof primary_branch !== 'string' || !VALID_BRANCHES.has(primary_branch as PrimaryBranch)) return null;\n\n    if (!isStepArray(parsed.first_call_sequence) || parsed.first_call_sequence.length === 0) return null;\n    if (!isStringArray(parsed.keyword_seeds) || parsed.keyword_seeds.length === 0) return null;\n\n    return {\n      goal_class,\n      goal_class_reason: typeof parsed.goal_class_reason === 'string' ? parsed.goal_class_reason : '',\n      primary_branch: primary_branch as PrimaryBranch,\n      primary_branch_reason: typeof parsed.primary_branch_reason === 'string' ? parsed.primary_branch_reason : '',\n      freshness_window,\n      first_call_sequence: parsed.first_call_sequence,\n      keyword_seeds: parsed.keyword_seeds.filter((s) => s.trim().length > 0),\n      iteration_hints: isStringArray(parsed.iteration_hints) ? parsed.iteration_hints : [],\n      gaps_to_watch: isStringArray(parsed.gaps_to_watch) ? parsed.gaps_to_watch : [],\n      stop_criteria: isStringArray(parsed.stop_criteria) ? parsed.stop_criteria : [],\n    };\n  } catch {\n    return null;\n  }\n}\n\nexport async function generateResearchBrief(\n  goal: string,\n  processor: OpenAI,\n  signal?: AbortSignal,\n): Promise<ResearchBrief | null> {\n  const today = new Date().toISOString().slice(0, 10);\n\n  const prompt = `You are a research planner. An agent is about to run a multi-pass research loop on the goal below using 3 tools:\n\n  - web-search: fan-out Google, scope: web|reddit|both, up to 50 queries per call, parallel-callable (multiple calls per turn)\n  - scrape-links: fetch URLs in parallel, auto-detects reddit.com post permalinks \u2192 Reddit API (threaded post+comments); all other URLs \u2192 HTTP scraper; parallel-callable\n\nProduce a tailored JSON brief.\n\nGOAL: ${goal}\nTODAY: ${today}\n\nReturn ONLY a JSON object (no markdown, no code fences):\n\n{\n  \"goal_class\": \"spec | bug | migration | sentiment | pricing | security | synthesis | product_launch | other\",\n  \"goal_class_reason\": \"one sentence \u2014 why this class\",\n  \"primary_branch\": \"reddit | web | both\",\n  \"primary_branch_reason\": \"one sentence \u2014 why this branch leads\",\n  \"freshness_window\": \"days | weeks | months | years\",\n  \"first_call_sequence\": [\n    { \"tool\": \"web-search | scrape-links\", \"reason\": \"what this call establishes for the agent\" }\n  ],\n  \"keyword_seeds\": [\"25\u201350 concrete Google queries \u2014 flat list, to be fired in the first web-search call\"],\n  \"iteration_hints\": [\"2\u20135 pointers on which harvested terms / follow-up signals to watch for after pass 1\"],\n  \"gaps_to_watch\": [\"2\u20135 concrete questions the agent MUST verify or the answer is incomplete\"],\n  \"stop_criteria\": [\"2\u20134 checkable conditions \u2014 all must hold before the agent declares done\"]\n}\n\nRULES:\n\nprimary_branch:\n- \"reddit\"  \u2192 sentiment / migration / lived-experience / community-consensus goals. Leads with scope:\"reddit\" web-search.\n- \"web\"     \u2192 spec / bug / pricing / CVE / API / primary-source goals. Leads with scope:\"web\" web-search.\n- \"both\"    \u2192 opinion-heavy AND needs official sources (e.g. product launch + practitioner reception).\n\nfirst_call_sequence:\n- 1\u20133 steps.\n- reddit-first: step 1 = web-search (caller sets scope:\"reddit\"), step 2 = scrape-links on best post permalinks.\n- web-first:    step 1 = web-search (scope:\"web\"), step 2 = scrape-links on HIGHLY_RELEVANT URLs.\n- both:         step 1 = two parallel web-search calls (one scope:\"reddit\", one scope:\"web\"), step 2 = merged scrape-links.\n\nkeyword_seeds:\n- 25\u201350 total. Narrow bug \u2192 fewer. Open synthesis \u2192 more.\n- Write Google retrieval probes, not topic labels.\n- For each broad idea, first do a bad \u2192 better rewrite in your head: replace a vague phrase with a query that names the evidence source class, discriminating anchor terms, and one useful operator when possible.\n- ${QUERY_REWRITE_PAIR_GUIDANCE_TEXT}\n- Use operators where helpful (site:, quotes, verbatim version numbers, exact error text, package names, release/version strings).\n- DIVERSE facets \u2014 same noun-phrase cannot repeat across seeds with adjectives-only variation.\n- Do NOT invent vendor names you are uncertain exist.\n- For \\`site:<domain>\\` filters, ONLY use domains you are highly confident are real. Safe choices: \\`github.com\\`, \\`stackoverflow.com\\`, \\`reddit.com\\`, \\`news.ycombinator.com\\`, \\`arxiv.org\\`, \\`nvd.nist.gov\\`, \\`pypi.org\\`, \\`npmjs.com\\`, plus any canonical homepage/docs domain explicitly spelled out in the goal itself (e.g. goal names \"Cursor\" \u2192 \\`cursor.com\\`/\\`docs.cursor.com\\` is acceptable). If you don't know the product's real docs domain, leave the query open (no \\`site:\\`) instead of guessing.\n\nfreshness_window:\n- If the goal mentions a recent release / date / version, use \"days\" or \"weeks\".\n- Stable protocols / APIs \u2192 \"months\" or \"years\".`;\n\n  try {\n    const response = await requestTextWithFallback(\n      processor,\n      prompt,\n      'Research brief generation',\n      signal,\n    );\n\n    if (response.content === null) {\n      mcpLog('warning', `Research brief generation returned no content: ${response.error ?? 'unknown'}`, 'llm');\n      markLLMFailure('planner', response.error ?? 'empty response');\n      return null;\n    }\n\n    const brief = parseResearchBrief(response.content);\n    if (!brief) {\n      mcpLog('warning', 'Research brief JSON parse or shape validation failed', 'llm');\n      markLLMFailure('planner', 'brief parse/validation failed');\n      return null;\n    }\n\n    markLLMSuccess('planner');\n    return brief;\n  } catch (err: unknown) {\n    const message = err instanceof Error ? err.message : String(err);\n    mcpLog('warning', `Research brief generation failed: ${message}`, 'llm');\n    markLLMFailure('planner', message);\n    return null;\n  }\n}\n\nexport function renderResearchBrief(brief: ResearchBrief): string {\n  const lines: string[] = [];\n\n  lines.push('## Your research brief (goal-tailored)');\n  lines.push('');\n  lines.push(`**Goal class**: \\`${brief.goal_class}\\` \u2014 ${brief.goal_class_reason}`);\n  lines.push(`**Primary branch**: \\`${brief.primary_branch}\\` \u2014 ${brief.primary_branch_reason}`);\n  lines.push(`**Freshness**: \\`${brief.freshness_window}\\``);\n  lines.push('');\n\n  if (brief.first_call_sequence.length > 0) {\n    lines.push('### First-call sequence');\n    brief.first_call_sequence.forEach((step, i) => {\n      lines.push(`${i + 1}. \\`${step.tool}\\` \u2014 ${step.reason}`);\n    });\n    lines.push('');\n  }\n\n  if (brief.keyword_seeds.length > 0) {\n    lines.push(`### Keyword seeds (${brief.keyword_seeds.length}) \u2014 fire these in your first \\`web-search\\` call as a flat \\`queries\\` array`);\n    for (const seed of brief.keyword_seeds) {\n      lines.push(`- ${seed}`);\n    }\n    lines.push('');\n  }\n\n  if (brief.iteration_hints.length > 0) {\n    lines.push('### Iteration hints (harvest new terms from scrape extracts\\' `## Follow-up signals`)');\n    for (const hint of brief.iteration_hints) lines.push(`- ${hint}`);\n    lines.push('');\n  }\n\n  if (brief.gaps_to_watch.length > 0) {\n    lines.push('### Gaps to watch');\n    for (const gap of brief.gaps_to_watch) lines.push(`- ${gap}`);\n    lines.push('');\n  }\n\n  if (brief.stop_criteria.length > 0) {\n    lines.push('### Stop criteria');\n    for (const c of brief.stop_criteria) lines.push(`- ${c}`);\n    lines.push('');\n  }\n\n  lines.push('---');\n  lines.push('');\n  lines.push('Fire `first_call_sequence` now. After each `scrape-links`, harvest new terms from `## Follow-up signals` and build your next `web-search` round. Stop when every gap is closed.');\n\n  return lines.join('\\n');\n}\n"],
+  "mappings": "AAQA,OAAO,YAAY;AACnB,SAAS,gBAAgB,uBAAuB;AAChD,SAAS,wCAAwC;AACjD;AAAA,EACE;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,OAEK;AACP,SAAS,cAAc;AAGvB,MAAM,sBAAsB;AAO5B,MAAM,gCAAgC;AAGtC,MAAM,wBAAwB;AAG9B,MAAM,wBAAwB;AAG9B,MAAM,uBAAuB;AAG7B,MAAM,0BAA0B;AAuBhC,MAAM,YAAY;AAAA,EAChB,eAAe;AAAA,EACf,iBAAiB;AAAA,EACjB,sBAAsB;AAAA,EACtB,wBAAwB;AAAA,EACxB,kBAAkB;AAAA,EAClB,oBAAoB;AAAA,EACpB,4BAA4B;AAAA,EAC5B,8BAA8B;AAChC;AAEO,SAAS,eAAe,MAA2B;AACxD,QAAM,MAAK,oBAAI,KAAK,GAAE,YAAY;AAClC,MAAI,SAAS,WAAW;AACtB,cAAU,gBAAgB;AAC1B,cAAU,uBAAuB;AACjC,cAAU,mBAAmB;AAC7B,cAAU,6BAA6B;AAAA,EACzC,OAAO;AACL,cAAU,kBAAkB;AAC5B,cAAU,yBAAyB;AACnC,cAAU,qBAAqB;AAC/B,cAAU,+BAA+B;AAAA,EAC3C;AACF;AAEO,SAAS,eAAe,MAAqB,KAAoB;AACtE,QAAM,MAAK,oBAAI,KAAK,GAAE,YAAY;AAClC,QAAM,UAAU,eAAe,QAAQ,IAAI,UAAU,OAAO,OAAO,eAAe;AAClF,MAAI,SAAS,WAAW;AACtB,cAAU,gBAAgB;AAC1B,cAAU,uBAAuB;AACjC,cAAU,mBAAmB;AAC7B,cAAU,8BAA8B;AAAA,EAC1C,OAAO;AACL,cAAU,kBAAkB;AAC5B,cAAU,yBAAyB;AACnC,cAAU,qBAAqB;AAC/B,cAAU,gCAAgC;AAAA,EAC5C;AACF;AAEO,SAAS,eAAkC;AAChD,QAAM,MAAM,gBAAgB;AAC5B,SAAO;AAAA,IACL,eAAe,UAAU;AAAA,IACzB,iBAAiB,UAAU;AAAA,IAC3B,sBAAsB,UAAU;AAAA,IAChC,wBAAwB,UAAU;AAAA,IAClC,kBAAkB,UAAU;AAAA,IAC5B,oBAAoB,UAAU;AAAA;AAAA;AAAA,IAG9B,mBAAmB,IAAI;AAAA,IACvB,qBAAqB,IAAI;AAAA,IACzB,4BAA4B,UAAU;AAAA,IACtC,8BAA8B,UAAU;AAAA,EAC1C;AACF;AAGO,SAAS,0BAAgC;AAC9C,YAAU,gBAAgB;AAC1B,YAAU,kBAAkB;AAC5B,YAAU,uBAAuB;AACjC,YAAU,yBAAyB;AACnC,YAAU,mBAAmB;AAC7B,YAAU,qBAAqB;AAC/B,YAAU,6BAA6B;AACvC,YAAU,+BAA+B;AAC3C;AAgBA,MAAM,mBAAmB;AAAA,EACvB,YAAY;AAAA,EACZ,aAAa;AAAA,EACb,YAAY;AACd;AAGA,MAAM,uBAAuB;AAG7B,MAAM,4BAA4B,oBAAI,IAAI;AAAA,EACxC;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AAGD,SAAS,UAAU,OAA6C;AAC9D,SACE,OAAO,UAAU,YACjB,UAAU,QACV,YAAY,SACZ,OAAQ,MAAkC,WAAW;AAEzD;AAEA,IAAI,YAA2B;AA6CxB,SAAS,qBAAoC;AAClD,MAAI,CAAC,gBAAgB,EAAE,cAAe,QAAO;AAE7C,MAAI,CAAC,WAAW;AACd,gBAAY,IAAI,OAAO;AAAA,MACrB,SAAS,eAAe;AAAA,MACxB,QAAQ,eAAe;AAAA,MACvB,SAAS;AAAA,MACT,YAAY;AAAA,MACZ,gBAAgB,EAAE,WAAW,yBAAyB;AAAA,IACxD,CAAC;AACD,WAAO,QAAQ,qCAAqC,eAAe,KAAK,cAAc,eAAe,QAAQ,KAAK,KAAK;AAAA,EACzH;AACA,SAAO;AACT;AAEA,SAAS,qBAAqB,OAAe,QAAyC;AACpF,SAAO;AAAA,IACL;AAAA,IACA,UAAU,CAAC,EAAE,MAAM,QAAQ,SAAS,OAAO,CAAC;AAAA,IAC5C,kBAAkB;AAAA,EACpB;AACF;AAEA,SAAS,uBAAuB,KAAc,SAA0B;AACtE,MAAI,OAAO,QAAQ,YAAY,QAAQ,KAAM,QAAO;AACpD,SAAO,IAAI,MAAM,OAAO;AAC1B;AAEA,SAAS,mBAAmB,UAA2C;AACrE,MAAI,SAAS,YAAY,QAAQ,SAAS,gBAAgB,WAAY,QAAO;AAC7E,SAAO,SAAS;AAClB;AAEA,SAAS,yBAAyB,SAA4B;AAC5D,SAAO;AAAA,IACL;AAAA,IACA,WAAW;AAAA,IACX,OAAO;AAAA,IACP,cAAc;AAAA,MACZ,MAAM,UAAU;AAAA,MAChB,SAAS;AAAA,MACT,WAAW;AAAA,IACb;AAAA,EACF;AACF;AAEA,eAAsB,YACpB,WACA,QACA,gBACA,QACA,eAC0B;AAC1B,QAAM,QAAQ,iBAAiB,eAAe;AAE9C,MAAI;AACF,UAAM,WAAW,MAAM;AAAA,MACrB,CAAC,gBAAgB,UAAU,KAAK,YAAY;AAAA,QAC1C,qBAAqB,OAAO,MAAM;AAAA,QAClC;AAAA,UACE,QAAQ,SAAS,YAAY,IAAI,CAAC,aAAa,MAAM,CAAC,IAAI;AAAA,UAC1D,SAAS;AAAA,QACX;AAAA,MACF;AAAA,MACA;AAAA,MACA;AAAA,MACA,GAAG,cAAc,KAAK,KAAK;AAAA,IAC7B;AAEA,UAAM,UAAU,SAAS,UAAU,CAAC,GAAG,SAAS,SAAS,KAAK;AAC9D,QAAI,SAAS;AACX,aAAO,EAAE,SAAS,MAAM;AAAA,IAC1B;AAEA,UAAM,MAAM,6BAA6B,KAAK;AAC9C,WAAO,WAAW,GAAG,cAAc,qCAAqC,KAAK,IAAI,KAAK;AACtF,WAAO,EAAE,SAAS,MAAM,OAAO,OAAO,KAAK,aAAa,QAAQ;AAAA,EAClE,SAAS,KAAc;AACrB,UAAM,UAAU,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG;AAC/D,WAAO,WAAW,GAAG,cAAc,qBAAqB,KAAK,KAAK,OAAO,IAAI,KAAK;AAClF,WAAO;AAAA,MACL,SAAS;AAAA,MACT;AAAA,MACA,OAAO;AAAA,MACP,aAAa;AAAA,MACb,YAAY,uBAAuB,KAAK,OAAO;AAAA,IACjD;AAAA,EACF;AACF;AAQA,eAAsB,wBACpB,WACA,QACA,gBACA,QAC0B;AAC1B,QAAM,UAAU,MAAM,YAAY,WAAW,QAAQ,gBAAgB,MAAM;AAC3E,MAAI,QAAQ,YAAY,KAAM,QAAO;AAErC,QAAM,gBAAgB,eAAe;AACrC,MAAI,CAAC,cAAe,QAAO;AAE3B,SAAO,WAAW,+CAA+C,aAAa,IAAI,KAAK;AAEvF,MAAI,cAA8B;AAClC,WAAS,UAAU,GAAG,UAAU,sBAAsB,WAAW;AAC/D,QAAI,UAAU,GAAG;AACf,YAAM,UAAU,oBAAoB,UAAU,CAAC;AAC/C,aAAO,WAAW,kBAAkB,OAAO,IAAI,uBAAuB,CAAC,OAAO,OAAO,MAAM,KAAK;AAChG,UAAI;AAAE,cAAM,MAAM,SAAS,MAAM;AAAA,MAAG,QAAQ;AAAE;AAAA,MAAO;AAAA,IACvD;AACA,UAAM,SAAS,MAAM,YAAY,WAAW,QAAQ,GAAG,cAAc,eAAe,QAAQ,aAAa;AACzG,QAAI,OAAO,YAAY,KAAM,QAAO;AACpC,kBAAc;AAAA,EAChB;AAEA,SAAO;AACT;AAKA,SAAS,oBAAoB,OAAyB;AACpD,MAAI,CAAC,SAAS,OAAO,UAAU,SAAU,QAAO;AAGhD,QAAM,YAAa,OAA6B;AAChD,MAAI,cAAc,cAAc,cAAc,aAAa;AACzD,WAAO;AAAA,EACT;AAGA,MAAI,UAAU,KAAK,GAAG;AACpB,QAAI,MAAM,WAAW,OAAO,MAAM,WAAW,OAAO,MAAM,WAAW,OAAO,MAAM,WAAW,OAAO,MAAM,WAAW,KAAK;AACxH,aAAO;AAAA,IACT;AAAA,EACF;AAGA,QAAM,SAAS;AACf,QAAM,OAAO,OAAO,OAAO,SAAS,WAAW,OAAO,OAAO;AAC7D,QAAM,SACJ,OAAO,OAAO,UAAU,YAAY,OAAO,UAAU,OAChD,OAAO,QACR;AACN,QAAM,YACJ,SACC,UAAU,OAAO,OAAO,SAAS,WAAW,OAAO,OAAO,YAC1D,UAAU,OAAO,OAAO,SAAS,WAAW,OAAO,OAAO;AAC7D,MAAI,aAAa,0BAA0B,IAAI,SAAS,GAAG;AACzD,WAAO;AAAA,EACT;AAGA,QAAM,UAAU,OAAO,OAAO,YAAY,WAAW,OAAO,QAAQ,YAAY,IAAI;AACpF,MACE,QAAQ,SAAS,YAAY,KAC7B,QAAQ,SAAS,SAAS,KAC1B,QAAQ,SAAS,WAAW,KAC5B,QAAQ,SAAS,qBAAqB,KACtC,QAAQ,SAAS,cAAc,KAC/B,QAAQ,SAAS,YAAY,KAC7B,QAAQ,SAAS,YAAY,GAC7B;AACA,WAAO;AAAA,EACT;AAEA,SAAO;AACT;AAOA,SAAS,qBAAqB,OAAyB;AACrD,MAAI,CAAC,SAAS,OAAO,UAAU,SAAU,QAAO;AAEhD,QAAM,SAAS;AACf,QAAM,SACJ,OAAO,OAAO,UAAU,YAAY,OAAO,UAAU,OAChD,OAAO,QACR;AAEN,QAAM,OAAO,OAAO,OAAO,SAAS,WAAW,OAAO,OAAO;AAC7D,QAAM,aAAa,UAAU,OAAO,OAAO,SAAS,WAAW,OAAO,OAAO;AAC7E,MAAI,SAAS,6BAA6B,eAAe,2BAA2B;AAClF,WAAO;AAAA,EACT;AAEA,QAAM,WAAqB,CAAC;AAC5B,MAAI,OAAO,OAAO,YAAY,SAAU,UAAS,KAAK,OAAO,OAAO;AACpE,MAAI,UAAU,OAAO,OAAO,YAAY,SAAU,UAAS,KAAK,OAAO,OAAO;AAC9E,QAAM,WAAW,SAAS,KAAK,GAAG,EAAE,YAAY;AAChD,SACE,SAAS,SAAS,gBAAgB,KAClC,SAAS,SAAS,gBAAgB,KAClC,SAAS,SAAS,iBAAiB,KACnC,SAAS,SAAS,gBAAgB,KAClC,SAAS,SAAS,aAAa,KAC/B,SAAS,SAAS,iBAAiB,KACnC,SAAS,SAAS,oBAAoB,KACtC,SAAS,SAAS,mBAAmB;AAEzC;AAKA,SAAS,oBAAoB,SAAyB;AACpD,QAAM,mBAAmB,iBAAiB,cAAc,KAAK,IAAI,GAAG,OAAO;AAC3E,QAAM,SAAS,KAAK,OAAO,IAAI,wBAAwB;AACvD,SAAO,KAAK,IAAI,mBAAmB,QAAQ,iBAAiB,UAAU;AACxE;AAOA,eAAsB,sBACpB,SACA,QACA,WACA,QACoB;AAEpB,MAAI,CAAC,OAAO,SAAS;AACnB,WAAO,EAAE,SAAS,WAAW,MAAM;AAAA,EACrC;AAEA,MAAI,CAAC,WAAW;AACd,WAAO;AAAA,MACL;AAAA,MACA,WAAW;AAAA,MACX,OAAO;AAAA,MACP,cAAc;AAAA,QACZ,MAAM,UAAU;AAAA,QAChB,SAAS;AAAA,QACT,WAAW;AAAA,MACb;AAAA,IACF;AAAA,EACF;AAEA,MAAI,CAAC,SAAS,KAAK,GAAG;AACpB,WAAO,EAAE,SAAS,WAAW,IAAI,WAAW,OAAO,OAAO,yBAAyB;AAAA,EACrF;AAGA,QAAM,mBAAmB,QAAQ,SAAS,sBACtC,QAAQ,UAAU,GAAG,mBAAmB,IAAI,0CAC5C;AAKJ,QAAM,qBACJ,iBAAiB,SAAS,iCAAiC,CAAC,CAAC,eAAe;AAK9E,QAAM,WAAW,MAAM;AACrB,QAAI,CAAC,OAAO,IAAK,QAAO;AACxB,QAAI;AACF,YAAM,IAAI,IAAI,IAAI,OAAO,GAAG;AAC5B,aAAO,GAAG,EAAE,MAAM,GAAG,EAAE,QAAQ;AAAA,IACjC,QAAQ;AACN,aAAO;AAAA,IACT;AAAA,EACF,GAAG;AACH,QAAM,UAAU,UAAU,aAAa,OAAO;AAAA;AAAA,IAAS;AAEvD,QAAM,SAAS,OAAO,UAClB;AAAA;AAAA,EAEJ,OAAO,2BAA2B,OAAO,OAAO;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;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAkDhD,gBAAgB,KACZ;AAAA;AAAA,EAEJ,OAAO;AAAA,EACP,gBAAgB;AAEhB,MAAI;AAIJ,MAAI,oBAAoB;AACtB;AAAA,MACE;AAAA,MACA,SAAS,iBAAiB,MAAM,qCAAqC,6BAA6B;AAAA,MAClG;AAAA,IACF;AAAA,EACF,OAAO;AACL,aAAS,UAAU,GAAG,WAAW,iBAAiB,YAAY,WAAW;AACvE,UAAI;AACF,YAAI,YAAY,GAAG;AACjB,iBAAO,QAAQ,4BAA4B,eAAe,KAAK,IAAI,KAAK;AAAA,QAC1E,OAAO;AACL,iBAAO,WAAW,iBAAiB,OAAO,IAAI,iBAAiB,UAAU,IAAI,KAAK;AAAA,QACpF;AAEA,cAAM,WAAW,MAAM,YAAY,WAAW,QAAQ,kBAAkB,MAAM;AAE9E,YAAI,SAAS,YAAY,MAAM;AAC7B,iBAAO,QAAQ,0BAA0B,SAAS,QAAQ,MAAM,eAAe,KAAK;AACpF,yBAAe,WAAW;AAC1B,iBAAO,EAAE,SAAS,SAAS,SAAS,WAAW,KAAK;AAAA,QACtD;AAEA,cAAM,kBAAkB,mBAAmB,QAAQ;AACnD,YAAI,iBAAiB;AACnB,gBAAM;AAAA,QACR;AAGA,eAAO,WAAW,oCAAoC,KAAK;AAC3D,uBAAe,aAAa,6BAA6B;AACzD,eAAO,yBAAyB,OAAO;AAAA,MAEzC,SAAS,KAAc;AACrB,oBAAY,cAAc,GAAG;AAC7B,cAAM,SAAS,UAAU,GAAG,IAAI,IAAI,SAAS;AAC7C,cAAM,OAAO,OAAO,QAAQ,YAAY,QAAQ,QAAQ,UAAU,MAC9D,OAAQ,IAAgC,IAAI,IAC5C;AACJ,cAAM,SAAS,qBAAqB,GAAG;AACvC,eAAO,SAAS,kBAAkB,UAAU,CAAC,MAAM,UAAU,OAAO,YAAY,MAAM,UAAU,IAAI,eAAe,oBAAoB,GAAG,CAAC,oBAAoB,MAAM,KAAK,KAAK;AAG/K,YAAI,QAAQ;AACV,iBAAO,WAAW,6FAAwF,KAAK;AAC/G;AAAA,QACF;AAEA,YAAI,oBAAoB,GAAG,KAAK,UAAU,iBAAiB,YAAY;AACrE,gBAAM,UAAU,oBAAoB,OAAO;AAC3C,iBAAO,WAAW,eAAe,OAAO,SAAS,KAAK;AACtD,cAAI;AAAE,kBAAM,MAAM,SAAS,MAAM;AAAA,UAAG,QAAQ;AAAE;AAAA,UAAO;AACrD;AAAA,QACF;AACA;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAGA,QAAM,gBAAgB,eAAe;AACrC,MAAI,eAAe;AACjB,WAAO,WAAW,4CAA4C,aAAa,IAAI,KAAK;AACpF,aAAS,UAAU,GAAG,UAAU,sBAAsB,WAAW;AAC/D,UAAI,UAAU,GAAG;AACf,cAAM,UAAU,oBAAoB,UAAU,CAAC;AAC/C,eAAO,WAAW,kBAAkB,OAAO,IAAI,uBAAuB,CAAC,OAAO,OAAO,MAAM,KAAK;AAChG,YAAI;AAAE,gBAAM,MAAM,SAAS,MAAM;AAAA,QAAG,QAAQ;AAAE;AAAA,QAAO;AAAA,MACvD;AACA,UAAI;AACF,cAAM,WAAW,MAAM,YAAY,WAAW,QAAQ,6BAA6B,QAAQ,aAAa;AACxG,YAAI,SAAS,YAAY,MAAM;AAC7B,iBAAO,QAAQ,sBAAsB,SAAS,QAAQ,MAAM,eAAe,KAAK;AAChF,yBAAe,WAAW;AAC1B,iBAAO,EAAE,SAAS,SAAS,SAAS,WAAW,KAAK;AAAA,QACtD;AAEA,cAAM,kBAAkB,mBAAmB,QAAQ;AACnD,YAAI,iBAAiB;AACnB,gBAAM;AAAA,QACR;AAEA,eAAO,WAAW,oCAAoC,KAAK;AAC3D,uBAAe,aAAa,6BAA6B;AACzD,eAAO,yBAAyB,OAAO;AAAA,MACzC,SAAS,KAAc;AACrB,oBAAY,cAAc,GAAG;AAC7B,eAAO,SAAS,2BAA2B,UAAU,CAAC,MAAM,UAAU,OAAO,IAAI,KAAK;AAAA,MACxF;AAAA,IACF;AAAA,EACF;AAEA,QAAM,eAAe,WAAW,WAAW;AAC3C,SAAO,SAAS,wBAAwB,YAAY,iCAAiC,KAAK;AAC1F,iBAAe,aAAa,YAAY;AAExC,SAAO;AAAA,IACL;AAAA,IACA,WAAW;AAAA,IACX,OAAO,0BAA0B,YAAY;AAAA,IAC7C,cAAc,aAAa;AAAA,MACzB,MAAM,UAAU;AAAA,MAChB,SAAS;AAAA,MACT,WAAW;AAAA,IACb;AAAA,EACF;AACF;AAOA,MAAM,0BAA0B;AA2ChC,eAAsB,sBACpB,YAQA,WACA,cACA,WACA,kBAAqC,CAAC,GAC4B;AAClE,QAAM,iBAAiB,WAAW,MAAM,GAAG,uBAAuB;AAMlE,QAAM,iBAAiB,CAAC,IAAI,IAAI,IAAI,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;AACxD,QAAM,gBAAgB,CAAC,SAAyB,eAAe,OAAO,CAAC,KAAK;AAG5E,QAAM,QAAkB,CAAC;AACzB,aAAW,OAAO,gBAAgB;AAChC,QAAI;AACJ,QAAI;AACF,eAAS,IAAI,IAAI,IAAI,GAAG,EAAE,SAAS,QAAQ,UAAU,EAAE;AAAA,IACzD,QAAQ;AACN,eAAS,IAAI;AAAA,IACf;AACA,UAAM,UAAU,IAAI,QAAQ,SAAS,MACjC,IAAI,QAAQ,MAAM,GAAG,GAAG,IAAI,QAC5B,IAAI;AACR,UAAM,KAAK,IAAI,IAAI,IAAI,OAAO,cAAc,IAAI,IAAI,CAAC,IAAI,IAAI,KAAK,WAAM,MAAM,WAAM,OAAO,EAAE;AAAA,EAC/F;AAEA,QAAM,mBAAmB,gBAAgB,SAAS,IAC9C,gBAAgB,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,EAAE,KAAK,IAAI,IAC9C;AACJ,QAAM,SAAQ,oBAAI,KAAK,GAAE,YAAY,EAAE,MAAM,GAAG,EAAE;AAElD,QAAM,SAAS;AAAA;AAAA,aAEJ,SAAS;AAAA,SACb,KAAK;AAAA;AAAA;AAAA,EAGZ,gBAAgB;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;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,iBAmDD,eAAe,MAAM;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,kBAMpB,eAAe,MAAM,cAAc,YAAY;AAAA,EAC/D,MAAM,KAAK,IAAI,CAAC;AAEhB,MAAI;AACF,WAAO,QAAQ,eAAe,eAAe,MAAM,2BAA2B,KAAK;AAEnF,UAAM,WAAW,MAAM;AAAA,MACrB;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAEA,QAAI,SAAS,YAAY,MAAM;AAC7B,YAAM,SAAS,SAAS,SAAS;AACjC,qBAAe,WAAW,MAAM;AAChC,aAAO,EAAE,QAAQ,MAAM,OAAO,OAAO;AAAA,IACvC;AAGA,UAAM,UAAU,SAAS,QAAQ,QAAQ,wBAAwB,EAAE,EAAE,QAAQ,eAAe,EAAE,EAAE,KAAK;AACrG,UAAM,SAAS,KAAK,MAAM,OAAO;AAKjC,QAAI,CAAC,OAAO,SAAS,OAAO,OAAO,cAAc,YAAY,CAAC,MAAM,QAAQ,OAAO,OAAO,GAAG;AAC3F,YAAM,SAAS;AACf,qBAAe,WAAW,MAAM;AAChC,aAAO,EAAE,QAAQ,MAAM,OAAO,OAAO;AAAA,IACvC;AAEA,WAAO,QAAQ,4BAA4B,OAAO,QAAQ,OAAO,OAAK,EAAE,SAAS,iBAAiB,EAAE,MAAM,oBAAoB,KAAK;AACnI,mBAAe,SAAS;AACxB,WAAO,EAAE,QAAQ,OAAO;AAAA,EAC1B,SAAS,KAAc;AACrB,UAAM,UAAU,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG;AAC/D,WAAO,SAAS,0BAA0B,OAAO,IAAI,KAAK;AAC1D,mBAAe,WAAW,OAAO;AACjC,WAAO,EAAE,QAAQ,MAAM,OAAO,0BAA0B,OAAO,GAAG;AAAA,EACpE;AACF;AAEA,eAAsB,+BACpB,YAKA,WACA,iBACA,WAC8D;AAC9D,QAAM,kBAAkB,WAAW,MAAM,GAAG,EAAE;AAC9C,QAAM,QAAQ,gBAAgB,IAAI,CAAC,QAAQ;AACzC,QAAI;AACJ,QAAI;AACF,eAAS,IAAI,IAAI,IAAI,GAAG,EAAE,SAAS,QAAQ,UAAU,EAAE;AAAA,IACzD,QAAQ;AACN,eAAS,IAAI;AAAA,IACf;AACA,WAAO,IAAI,IAAI,IAAI,KAAK,IAAI,KAAK,WAAM,MAAM;AAAA,EAC/C,CAAC;AAED,QAAM,SAAS;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,aASJ,SAAS;AAAA;AAAA;AAAA,EAGpB,gBAAgB,IAAI,CAAC,UAAU,KAAK,KAAK,EAAE,EAAE,KAAK,IAAI,CAAC;AAAA;AAAA;AAAA,EAGvD,MAAM,KAAK,IAAI,CAAC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAShB,MAAI;AACF,UAAM,WAAW,MAAM;AAAA,MACrB;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAEA,QAAI,SAAS,YAAY,MAAM;AAC7B,YAAM,SAAS,SAAS,SAAS;AACjC,qBAAe,WAAW,MAAM;AAChC,aAAO,EAAE,QAAQ,CAAC,GAAG,OAAO,OAAO;AAAA,IACrC;AAEA,UAAM,UAAU,SAAS,QAAQ,QAAQ,wBAAwB,EAAE,EAAE,QAAQ,eAAe,EAAE,EAAE,KAAK;AACrG,UAAM,SAAS,KAAK,MAAM,OAAO;AAEjC,mBAAe,SAAS;AACxB,WAAO,EAAE,QAAQ,MAAM,QAAQ,OAAO,cAAc,IAAI,OAAO,iBAAiB,CAAC,EAAE;AAAA,EACrF,SAAS,KAAc;AACrB,UAAM,UAAU,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG;AAC/D,WAAO,SAAS,4CAA4C,OAAO,IAAI,KAAK;AAC5E,mBAAe,WAAW,OAAO;AACjC,WAAO,EAAE,QAAQ,CAAC,GAAG,OAAO,QAAQ;AAAA,EACtC;AACF;AA0BA,MAAM,qBAAqB,oBAAI,IAAI;AAAA,EACjC;AAAA,EAAQ;AAAA,EAAO;AAAA,EAAa;AAAA,EAAa;AAAA,EAAW;AAAA,EACpD;AAAA,EAAa;AAAA,EAAkB;AACjC,CAAC;AAED,MAAM,kBAAkB,oBAAI,IAAI,CAAC,QAAQ,SAAS,UAAU,OAAO,CAAC;AACpE,MAAM,iBAAiB,oBAAI,IAAmB,CAAC,UAAU,OAAO,MAAM,CAAC;AACvE,MAAM,mBAAmB,oBAAI,IAAI,CAAC,cAAc,cAAc,CAAC;AAE/D,SAAS,cAAc,OAAmC;AACxD,SAAO,MAAM,QAAQ,KAAK,KAAK,MAAM,MAAM,CAAC,MAAM,OAAO,MAAM,QAAQ;AACzE;AAEA,SAAS,YAAY,OAA8C;AACjE,SAAO,MAAM,QAAQ,KAAK,KAAK,MAAM,MAAM,CAAC,MAAM;AAChD,QAAI,OAAO,MAAM,YAAY,MAAM,KAAM,QAAO;AAChD,UAAM,OAAQ,EAA8B;AAC5C,UAAM,SAAU,EAA8B;AAC9C,WAAO,OAAO,SAAS,YAClB,iBAAiB,IAAI,IAAI,KACzB,OAAO,WAAW,YAClB,OAAO,KAAK,EAAE,SAAS;AAAA,EAC9B,CAAC;AACH;AAEO,SAAS,mBAAmB,KAAmC;AACpE,MAAI;AACF,UAAM,UAAU,IAAI,QAAQ,wBAAwB,EAAE,EAAE,QAAQ,eAAe,EAAE,EAAE,KAAK;AACxF,UAAM,SAAS,KAAK,MAAM,OAAO;AAEjC,UAAM,aAAa,OAAO,OAAO,eAAe,WAAW,OAAO,aAAa;AAC/E,QAAI,CAAC,cAAc,CAAC,mBAAmB,IAAI,UAAU,EAAG,QAAO;AAE/D,UAAM,mBAAmB,OAAO,OAAO,qBAAqB,WAAW,OAAO,mBAAmB;AACjG,QAAI,CAAC,oBAAoB,CAAC,gBAAgB,IAAI,gBAAgB,EAAG,QAAO;AAExE,UAAM,iBAAiB,OAAO;AAC9B,QAAI,OAAO,mBAAmB,YAAY,CAAC,eAAe,IAAI,cAA+B,EAAG,QAAO;AAEvG,QAAI,CAAC,YAAY,OAAO,mBAAmB,KAAK,OAAO,oBAAoB,WAAW,EAAG,QAAO;AAChG,QAAI,CAAC,cAAc,OAAO,aAAa,KAAK,OAAO,cAAc,WAAW,EAAG,QAAO;AAEtF,WAAO;AAAA,MACL;AAAA,MACA,mBAAmB,OAAO,OAAO,sBAAsB,WAAW,OAAO,oBAAoB;AAAA,MAC7F;AAAA,MACA,uBAAuB,OAAO,OAAO,0BAA0B,WAAW,OAAO,wBAAwB;AAAA,MACzG;AAAA,MACA,qBAAqB,OAAO;AAAA,MAC5B,eAAe,OAAO,cAAc,OAAO,CAAC,MAAM,EAAE,KAAK,EAAE,SAAS,CAAC;AAAA,MACrE,iBAAiB,cAAc,OAAO,eAAe,IAAI,OAAO,kBAAkB,CAAC;AAAA,MACnF,eAAe,cAAc,OAAO,aAAa,IAAI,OAAO,gBAAgB,CAAC;AAAA,MAC7E,eAAe,cAAc,OAAO,aAAa,IAAI,OAAO,gBAAgB,CAAC;AAAA,IAC/E;AAAA,EACF,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAEA,eAAsB,sBACpB,MACA,WACA,QAC+B;AAC/B,QAAM,SAAQ,oBAAI,KAAK,GAAE,YAAY,EAAE,MAAM,GAAG,EAAE;AAElD,QAAM,SAAS;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,QAOT,IAAI;AAAA,SACH,KAAK;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,IAoCV,gCAAgC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAUlC,MAAI;AACF,UAAM,WAAW,MAAM;AAAA,MACrB;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAEA,QAAI,SAAS,YAAY,MAAM;AAC7B,aAAO,WAAW,kDAAkD,SAAS,SAAS,SAAS,IAAI,KAAK;AACxG,qBAAe,WAAW,SAAS,SAAS,gBAAgB;AAC5D,aAAO;AAAA,IACT;AAEA,UAAM,QAAQ,mBAAmB,SAAS,OAAO;AACjD,QAAI,CAAC,OAAO;AACV,aAAO,WAAW,wDAAwD,KAAK;AAC/E,qBAAe,WAAW,+BAA+B;AACzD,aAAO;AAAA,IACT;AAEA,mBAAe,SAAS;AACxB,WAAO;AAAA,EACT,SAAS,KAAc;AACrB,UAAM,UAAU,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG;AAC/D,WAAO,WAAW,qCAAqC,OAAO,IAAI,KAAK;AACvE,mBAAe,WAAW,OAAO;AACjC,WAAO;AAAA,EACT;AACF;AAEO,SAAS,oBAAoB,OAA8B;AAChE,QAAM,QAAkB,CAAC;AAEzB,QAAM,KAAK,wCAAwC;AACnD,QAAM,KAAK,EAAE;AACb,QAAM,KAAK,qBAAqB,MAAM,UAAU,aAAQ,MAAM,iBAAiB,EAAE;AACjF,QAAM,KAAK,yBAAyB,MAAM,cAAc,aAAQ,MAAM,qBAAqB,EAAE;AAC7F,QAAM,KAAK,oBAAoB,MAAM,gBAAgB,IAAI;AACzD,QAAM,KAAK,EAAE;AAEb,MAAI,MAAM,oBAAoB,SAAS,GAAG;AACxC,UAAM,KAAK,yBAAyB;AACpC,UAAM,oBAAoB,QAAQ,CAAC,MAAM,MAAM;AAC7C,YAAM,KAAK,GAAG,IAAI,CAAC,OAAO,KAAK,IAAI,aAAQ,KAAK,MAAM,EAAE;AAAA,IAC1D,CAAC;AACD,UAAM,KAAK,EAAE;AAAA,EACf;AAEA,MAAI,MAAM,cAAc,SAAS,GAAG;AAClC,UAAM,KAAK,sBAAsB,MAAM,cAAc,MAAM,mFAA8E;AACzI,eAAW,QAAQ,MAAM,eAAe;AACtC,YAAM,KAAK,KAAK,IAAI,EAAE;AAAA,IACxB;AACA,UAAM,KAAK,EAAE;AAAA,EACf;AAEA,MAAI,MAAM,gBAAgB,SAAS,GAAG;AACpC,UAAM,KAAK,sFAAuF;AAClG,eAAW,QAAQ,MAAM,gBAAiB,OAAM,KAAK,KAAK,IAAI,EAAE;AAChE,UAAM,KAAK,EAAE;AAAA,EACf;AAEA,MAAI,MAAM,cAAc,SAAS,GAAG;AAClC,UAAM,KAAK,mBAAmB;AAC9B,eAAW,OAAO,MAAM,cAAe,OAAM,KAAK,KAAK,GAAG,EAAE;AAC5D,UAAM,KAAK,EAAE;AAAA,EACf;AAEA,MAAI,MAAM,cAAc,SAAS,GAAG;AAClC,UAAM,KAAK,mBAAmB;AAC9B,eAAW,KAAK,MAAM,cAAe,OAAM,KAAK,KAAK,CAAC,EAAE;AACxD,UAAM,KAAK,EAAE;AAAA,EACf;AAEA,QAAM,KAAK,KAAK;AAChB,QAAM,KAAK,EAAE;AACb,QAAM,KAAK,iLAAiL;AAE5L,SAAO,MAAM,KAAK,IAAI;AACxB;",
   "names": []
 }

package/dist/src/tools/search.js

@@ -1,5 +1,6 @@
 import { getCapabilities, getMissingEnvMessage } from "../config/index.js";
 import {
+  QUERY_REWRITE_PAIR_GUIDANCE_TEXT,
   webSearchOutputSchema,
   webSearchParamsSchema
 } from "../schemas/web-search.js";
@@ -573,7 +574,7 @@ function registerWebSearchTool(server) {
     {
       name: "web-search",
       title: "Web Search",
-      description: 'Fan out Google queries in parallel. One call carries up to 50 queries in a flat `queries` array \u2014 pack diverse facets (not paraphrases) into a single call. Call me AGGRESSIVELY across a session: 2\u20134 rounds is normal, 1 is underuse. After each pass, read `gaps[]` + `refine_queries[]` and fire another round with the new terms. Safe to call multiple times in parallel in the same turn for orthogonal subtopics. `scope`: `"reddit"` (server appends `site:reddit.com` + filters to post permalinks \u2014 use for sentiment / migration / lived experience), `"web"` default (spec / bug / pricing / CVE / API), `"both"` (fan each query across both \u2014 use when opinion-heavy AND needs official sources). Returns a tiered Markdown report (HIGHLY_RELEVANT / MAYBE_RELEVANT / OTHER) + grounded synthesis with `[rank]` citations + `## Gaps` + `## Suggested follow-up searches` tied to gap ids. Set `raw=true` to skip classification.',
+      description: `Fan out Google queries in parallel. One call carries up to 50 queries in a flat \`queries\` array \u2014 pack diverse facets (not paraphrases) into a single call. ${QUERY_REWRITE_PAIR_GUIDANCE_TEXT} Call me AGGRESSIVELY across a session: 2\u20134 rounds is normal, 1 is underuse. After each pass, read \`gaps[]\` + \`refine_queries[]\` and fire another round with the new terms. Safe to call multiple times in parallel in the same turn for orthogonal subtopics. \`scope\`: \`"reddit"\` (server appends \`site:reddit.com\` + filters to post permalinks \u2014 use for sentiment / migration / lived experience), \`"web"\` default (spec / bug / pricing / CVE / API), \`"both"\` (fan each query across both \u2014 use when opinion-heavy AND needs official sources). Returns a tiered Markdown report (HIGHLY_RELEVANT / MAYBE_RELEVANT / OTHER) + grounded synthesis with \`[rank]\` citations + \`## Gaps\` + \`## Suggested follow-up searches\` tied to gap ids. Set \`raw=true\` to skip classification.`,
       schema: webSearchParamsSchema,
       outputSchema: webSearchOutputSchema,
       annotations: {

package/dist/src/tools/search.js.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../../src/tools/search.ts"],
-  "sourcesContent": ["/**\n * Web Search Tool Handler\n * NEVER throws - always returns structured response for graceful degradation\n */\n\nimport type { MCPServer } from 'mcp-use/server';\n\nimport { getCapabilities, getMissingEnvMessage } from '../config/index.js';\nimport {\n  webSearchOutputSchema,\n  webSearchParamsSchema,\n  type WebSearchParams,\n  type WebSearchOutput,\n} from '../schemas/web-search.js';\nimport { SearchClient, type MultipleSearchResponse } from '../clients/search.js';\nimport {\n  aggregateAndRank,\n  generateUnifiedOutput,\n} from '../utils/url-aggregator.js';\nimport {\n  createLLMProcessor,\n  classifySearchResults,\n  suggestRefineQueriesForRawMode,\n  type ClassificationEntry,\n  type ClassificationResult,\n  type RefineQuerySuggestion,\n} from '../services/llm-processor.js';\nimport { classifyError, type StructuredError } from '../utils/errors.js';\nimport { classifySourceByUrl } from '../utils/source-type.js';\nimport {\n  mcpLog,\n  formatError,\n  formatDuration,\n} from './utils.js';\nimport {\n  createToolReporter,\n  NOOP_REPORTER,\n  toolFailure,\n  toolSuccess,\n  toToolResponse,\n  type ToolExecutionResult,\n  type ToolReporter,\n} from './mcp-helpers.js';\nimport { sanitizeSuggestion } from '../utils/sanitize.js';\nimport {\n  normalizeQueryForDispatch,\n  relaxQueryForRetry,\n} from '../utils/query-relax.js';\n\n// --- Internal types ---\n\ninterface SearchAggregation {\n  readonly rankedUrls: ReturnType<typeof aggregateAndRank>['rankedUrls'];\n  readonly totalUniqueUrls: number;\n  readonly frequencyThreshold: number;\n  readonly thresholdNote?: string;\n}\n\nexport type SearchResponse = MultipleSearchResponse;\nexport type SearchExecutor = (queries: string[]) => Promise<SearchResponse>;\n\ntype SearchFailurePhase = 'initial' | 'relax-retry';\ntype SearchResultScope = 'web' | 'reddit';\n\n// --- Helpers ---\n\n/** Reddit post permalink: /r/{sub}/comments/{id}/ \u2014 drops subreddit\n *  homepages, /rising, /new, /top, etc. so only post URLs reach the agent.\n *  See mcp-revisions/tool-surface/02-extend-web-search-with-reddit-scope.md. */\nconst REDDIT_POST_PERMALINK = /\\/r\\/[^/]+\\/comments\\/[a-z0-9]+\\//i;\nconst REDDIT_HOST = /(?:^|\\.)reddit\\.com$/i;\n\ninterface ScopedQuery {\n  query: string;\n  resultScope: SearchResultScope;\n  dropSiteOnRetry: boolean;\n}\n\nfunction redditScopedQuery(query: string): string {\n  return /\\bsite:reddit\\.com\\b/i.test(query) ? query : `${query} site:reddit.com`;\n}\n\nfunction buildScopedQueries(queries: string[], scope: 'web' | 'reddit' | 'both'): ScopedQuery[] {\n  if (scope === 'web') {\n    return queries.map((query) => ({ query, resultScope: 'web', dropSiteOnRetry: true }));\n  }\n\n  const reddited = queries.map((q) =>\n    ({ query: redditScopedQuery(q), resultScope: 'reddit' as const, dropSiteOnRetry: false }),\n  );\n\n  if (scope === 'reddit') return reddited;\n\n  return [\n    ...queries.map((query) => ({ query, resultScope: 'web' as const, dropSiteOnRetry: true })),\n    ...reddited,\n  ];\n}\n\nasync function executeSearches(queries: string[]): Promise<SearchResponse> {\n  const client = new SearchClient();\n  return client.searchMultiple(queries);\n}\n\ninterface QueryRewriteRecord {\n  original: string;\n  rewritten: string;\n  rules: string[];\n}\n\ninterface RetriedQueryRecord {\n  original: string;\n  retried_with: string;\n  rules: string[];\n  recovered_results: number;\n}\n\n/** Run Serper, then for each query that returned 0 results build a relaxed\n *  retry (Phase B) and reissue them in a single second batch. Replace the\n *  empty slot with the retry's results when the retry recovered \u22651 hit, but\n *  keep the original query string in the slot so downstream aggregation and\n *  follow-up rendering stay consistent. */\nasync function executeWithRelaxRetry(\n  dispatched: string[],\n  reporter: ToolReporter,\n  searchExecutor: SearchExecutor = executeSearches,\n  retryOptions: { readonly dropSiteOnRetry?: readonly boolean[] } = {},\n): Promise<{\n  response: SearchResponse;\n  retried: RetriedQueryRecord[];\n  failurePhase?: SearchFailurePhase;\n  retryError?: StructuredError;\n}> {\n  const initial = await searchExecutor(dispatched);\n\n  if (initial.error) {\n    return { response: initial, retried: [], failurePhase: 'initial' };\n  }\n\n  const emptyIndices = initial.searches\n    .map((s, i) => (s.results.length === 0 ? i : -1))\n    .filter((i) => i !== -1);\n\n  if (emptyIndices.length === 0) {\n    return { response: initial, retried: [] };\n  }\n\n  interface Plan { index: number; original: string; relaxed: string; rules: string[] }\n  const plans: Plan[] = [];\n  for (const idx of emptyIndices) {\n    const dq = dispatched[idx];\n    if (typeof dq !== 'string') continue;\n    const r = relaxQueryForRetry(dq, { dropSite: retryOptions.dropSiteOnRetry?.[idx] ?? true });\n    if (r.changed && r.rewritten !== dq) {\n      plans.push({ index: idx, original: dq, relaxed: r.rewritten, rules: [...r.rules] });\n    }\n  }\n\n  if (plans.length === 0) {\n    return { response: initial, retried: [] };\n  }\n\n  mcpLog(\n    'info',\n    `${plans.length}/${emptyIndices.length} empty-result queries eligible for relaxation retry`,\n    'search',\n  );\n  await reporter.log(\n    'info',\n    `${plans.length} queries returned 0 results; retrying with relaxation`,\n  );\n\n  const retryResp = await searchExecutor(plans.map((p) => p.relaxed));\n  const retried: RetriedQueryRecord[] = [];\n  const retryByIndex = new Map<number, SearchResponse['searches'][number]>();\n\n  plans.forEach((plan, i) => {\n    const r = retryResp.searches[i];\n    if (r) retryByIndex.set(plan.index, r);\n    retried.push({\n      original: plan.original,\n      retried_with: plan.relaxed,\n      rules: plan.rules,\n      recovered_results: r?.results.length ?? 0,\n    });\n  });\n\n  if (retryResp.error) {\n    mcpLog(\n      'warning',\n      `Relaxed retry batch failed; preserving initial search results: ${retryResp.error.message}`,\n      'search',\n    );\n    await reporter.log(\n      'warning',\n      `search_relax_retry_failed: ${retryResp.error.message}`,\n    );\n    return {\n      response: initial,\n      retried,\n      retryError: retryResp.error,\n    };\n  }\n\n  const mergedSearches = initial.searches.map((s, idx) => {\n    const r = retryByIndex.get(idx);\n    if (r && r.results.length > 0) {\n      return { ...r, query: s.query };\n    }\n    return s;\n  });\n\n  return {\n    response: { ...initial, searches: mergedSearches },\n    retried,\n  };\n}\n\nfunction filterScopedSearches(\n  response: SearchResponse,\n  scope: 'web' | 'reddit' | 'both',\n  resultScopes: readonly SearchResultScope[] = [],\n): SearchResponse {\n  if (scope === 'web') return response;\n  const filtered = response.searches.map((search, index) => {\n    const resultScope = resultScopes[index] ?? (scope === 'reddit' ? 'reddit' : 'web');\n    return {\n      ...search,\n      results: search.results.filter((r) => {\n        let host: string;\n        try { host = new URL(r.link).hostname; } catch { return true; }\n        if (resultScope === 'reddit') {\n          return REDDIT_HOST.test(host) && REDDIT_POST_PERMALINK.test(r.link);\n        }\n        // Web-side results pass through; reddit URLs still must be post permalinks.\n        if (!REDDIT_HOST.test(host)) return true;\n        return REDDIT_POST_PERMALINK.test(r.link);\n      }),\n    };\n  });\n  return { ...response, searches: filtered };\n}\n\nfunction processResults(response: SearchResponse): {\n  aggregation: SearchAggregation;\n} {\n  const aggregation = aggregateAndRank(response.searches, 5);\n  return { aggregation };\n}\n\n// --- Raw output (traditional unified ranked list) ---\n\nfunction buildRawOutput(\n  queries: string[],\n  aggregation: SearchAggregation,\n  searches: SearchResponse['searches'],\n  verbose: boolean = false,\n): string {\n  return generateUnifiedOutput(\n    aggregation.rankedUrls, queries, searches,\n    aggregation.totalUniqueUrls,\n    aggregation.frequencyThreshold, aggregation.thresholdNote,\n    verbose,\n  );\n}\n\nfunction buildSignalsSection(\n  aggregation: SearchAggregation,\n  searches: SearchResponse['searches'],\n  totalQueries: number,\n): string {\n  const coverageCount = searches.filter((search) => search.results.length >= 3).length;\n  const lowYield = searches\n    .filter((search) => search.results.length <= 1)\n    .map((search) => `\"${search.query}\"`);\n  const consensusCount = aggregation.rankedUrls.filter((url) => url.isConsensus).length;\n\n  const lines = [\n    '**Signals**',\n    `- Coverage: ${coverageCount}/${totalQueries} queries returned \u22653 results`,\n    `- Consensus URLs: ${consensusCount}`,\n  ];\n\n  if (lowYield.length > 0) {\n    lines.push(`- Low-yield: ${lowYield.join(', ')}`);\n  }\n\n  return lines.join('\\n');\n}\n\nexport function buildSuggestedFollowUpsSection(\n  refineQueries: Array<{ query: string; rationale?: string; gap_id?: number; gap_description?: string }> | undefined,\n): string {\n  if (!refineQueries || refineQueries.length === 0) {\n    return '';\n  }\n\n  const lines = ['## Suggested follow-up searches', ''];\n\n  for (const item of refineQueries) {\n    const query = sanitizeSuggestion(item.query ?? '');\n    if (!query) continue;\n    const rationale = sanitizeSuggestion(item.rationale ?? '');\n    const gapTag = typeof item.gap_id === 'number'\n      ? ` _(closes gap [${item.gap_id}])_`\n      : item.gap_description\n        ? ` _(${sanitizeSuggestion(item.gap_description)})_`\n        : '';\n    lines.push(rationale\n      ? `- ${query} \u2014 ${rationale}${gapTag}`\n      : `- ${query}${gapTag}`,\n    );\n  }\n\n  return lines.length === 2 ? '' : lines.join('\\n');\n}\n\nexport function appendSignalsAndFollowUps(\n  markdown: string,\n  signalsSection: string,\n  refineQueries: RefineQuerySuggestion[] | undefined,\n  options: { includeSignals?: boolean } = {},\n): string {\n  const includeSignals = options.includeSignals ?? false;\n  const sections = [markdown];\n  if (includeSignals && signalsSection) {\n    sections.push('', '---', signalsSection);\n  }\n  const followUps = buildSuggestedFollowUpsSection(refineQueries);\n  if (followUps) {\n    sections.push('', followUps);\n  }\n  return sections.join('\\n');\n}\n\n// --- \"Start here\" section ---\n//\n// Surfaces the best 3-5 URLs at the top of the classified response so an agent\n// skimming the first screen sees them before tier tables. Deterministic: uses\n// existing `tier` + `rank` + `reason` from the classifier, no extra LLM call.\n//\n// Algorithm: take HIGHLY_RELEVANT by rank up to MAX_START_HERE; if fewer than\n// MIN_START_HERE, pad from top MAYBE_RELEVANT; skip entirely if no entries\n// above OTHER.\n\nconst MIN_START_HERE = 3;\nconst MAX_START_HERE = 5;\n\n/** Minimal structural shape \u2014 avoids coupling to private `RankedUrl` type. */\ninterface StartHereCandidate {\n  readonly rank: number;\n  readonly url: string;\n  readonly title: string;\n}\n\ninterface StartHereTiers {\n  readonly high: readonly StartHereCandidate[];\n  readonly maybe: readonly StartHereCandidate[];\n}\n\nexport function buildStartHereSection(\n  tiers: StartHereTiers,\n  entryByRank: Map<number, ClassificationEntry>,\n  opts: { min?: number; max?: number } = {},\n): string {\n  const min = opts.min ?? MIN_START_HERE;\n  const max = opts.max ?? MAX_START_HERE;\n\n  const picks: Array<{ candidate: StartHereCandidate; tier: 'HIGHLY_RELEVANT' | 'MAYBE_RELEVANT' }> = [];\n\n  for (const candidate of tiers.high) {\n    if (picks.length >= max) break;\n    picks.push({ candidate, tier: 'HIGHLY_RELEVANT' });\n  }\n\n  if (picks.length < min) {\n    const target = Math.min(min, max);\n    for (const candidate of tiers.maybe) {\n      if (picks.length >= target) break;\n      picks.push({ candidate, tier: 'MAYBE_RELEVANT' });\n    }\n  }\n\n  if (picks.length === 0) return '';\n\n  const lines: string[] = [];\n  lines.push('## Start here \u2014 best candidates for your extract');\n  picks.forEach((pick, i) => {\n    const entry = entryByRank.get(pick.candidate.rank);\n    const reason = entry?.reason && entry.reason.trim().length > 0 ? entry.reason : '\u2014';\n    let domain: string;\n    try {\n      domain = new URL(pick.candidate.url).hostname.replace(/^www\\./, '');\n    } catch {\n      domain = pick.candidate.url;\n    }\n    lines.push(\n      `${i + 1}. **[${pick.candidate.title}](${pick.candidate.url})** \u2014 ${domain} \u2014 ${reason} *(${pick.tier}, rank ${pick.candidate.rank})*`,\n    );\n  });\n  return lines.join('\\n');\n}\n\n// --- Classified output (3-tier LLM-classified table) ---\n\nfunction buildClassifiedOutput(\n  classification: ClassificationResult,\n  aggregation: SearchAggregation,\n  extract: string,\n  searches: SearchResponse['searches'],\n  totalQueries: number,\n  verbose: boolean = false,\n): string {\n  const rankedUrls = aggregation.rankedUrls;\n\n  // Build tier \u2192 entries mapping (keep url data alongside classifier metadata)\n  const entryByRank = new Map(classification.results.map((r) => [r.rank, r]));\n\n  const tiers = {\n    high: [] as typeof rankedUrls,\n    maybe: [] as typeof rankedUrls,\n    other: [] as typeof rankedUrls,\n  };\n\n  for (const url of rankedUrls) {\n    const entry = entryByRank.get(url.rank);\n    const tier = entry?.tier;\n    if (tier === 'HIGHLY_RELEVANT') {\n      tiers.high.push(url);\n    } else if (tier === 'MAYBE_RELEVANT') {\n      tiers.maybe.push(url);\n    } else {\n      tiers.other.push(url);\n    }\n  }\n\n  const lines: string[] = [];\n\n  // Header with generated title, synthesis, and confidence\n  lines.push(`## ${classification.title}`);\n  lines.push(`> Looking for: ${extract}`);\n  lines.push(`> ${totalQueries} queries \u2192 ${rankedUrls.length} URLs \u2192 ${tiers.high.length} highly relevant, ${tiers.maybe.length} possibly relevant`);\n  if (classification.confidence) {\n    const confReason = classification.confidence_reason ? ` \u2014 ${classification.confidence_reason}` : '';\n    lines.push(`> Confidence: \\`${classification.confidence}\\`${confReason}`);\n  }\n  lines.push('');\n\n  // \"Start here\" block: surface the top 3-5 URLs above the synthesis so an\n  // agent skimming the first screen sees scrape candidates before prose.\n  const startHere = buildStartHereSection(\n    { high: tiers.high, maybe: tiers.maybe },\n    entryByRank,\n  );\n  if (startHere) {\n    lines.push(startHere);\n    lines.push('');\n  }\n\n  lines.push(`**Summary:** ${classification.synthesis}`);\n  lines.push('');\n\n  // Helper: render one row with optional source_type + reason\n  const renderRichRow = (url: typeof rankedUrls[number]): string => {\n    const entry = entryByRank.get(url.rank);\n    const coveragePct = Math.round(url.coverageRatio * 100);\n    const seenIn = `${url.frequency}/${totalQueries} (${coveragePct}%)`;\n    const sourceType = entry?.source_type ? `\\`${entry.source_type}\\`` : '\u2014';\n    const reason = entry?.reason ? entry.reason.replace(/\\|/g, '\\\\|') : '\u2014';\n    return `| ${url.rank} | [${url.title}](${url.url}) | ${sourceType} | ${seenIn} | ${reason} |`;\n  };\n\n  // Highly Relevant tier\n  if (tiers.high.length > 0) {\n    lines.push(`### Highly Relevant (${tiers.high.length})`);\n    lines.push('| # | URL | Source | Seen in | Why |');\n    lines.push('|---|-----|--------|---------|-----|');\n    for (const url of tiers.high) lines.push(renderRichRow(url));\n    lines.push('');\n  }\n\n  // Maybe Relevant tier\n  if (tiers.maybe.length > 0) {\n    lines.push(`### Maybe Relevant (${tiers.maybe.length})`);\n    lines.push('| # | URL | Source | Seen in | Why |');\n    lines.push('|---|-----|--------|---------|-----|');\n    for (const url of tiers.maybe) lines.push(renderRichRow(url));\n    lines.push('');\n  }\n\n  // Other tier \u2014 with query attribution\n  if (tiers.other.length > 0) {\n    lines.push(`### Other Results (${tiers.other.length})`);\n    lines.push('| # | URL | Source | Score | Queries |');\n    lines.push('|---|-----|--------|-------|---------|');\n    for (const url of tiers.other) {\n      const entry = entryByRank.get(url.rank);\n      const queryList = url.queries.map((q) => `\"${q}\"`).join(', ');\n      const sourceType = entry?.source_type ? `\\`${entry.source_type}\\`` : '\u2014';\n      let domain: string;\n      try {\n        domain = new URL(url.url).hostname.replace(/^www\\./, '');\n      } catch {\n        domain = url.url;\n      }\n      lines.push(`| ${url.rank} | ${domain} | ${sourceType} | ${url.score.toFixed(1)} | ${queryList} |`);\n    }\n    lines.push('');\n  }\n\n  // Signals block is gated behind verbose \u2014 it duplicates info already\n  // present in the per-row metadata for callers who care.\n  // See: docs/code-review/context/05-output-formatting-patterns.md.\n  if (verbose) {\n    lines.push(buildSignalsSection(aggregation, searches, totalQueries));\n  }\n\n  // Gaps section \u2014 what the current results don't answer\n  if (classification.gaps && classification.gaps.length > 0) {\n    lines.push('');\n    lines.push('## Gaps');\n    for (const gap of classification.gaps) {\n      lines.push(`- **[${gap.id}]** ${gap.description}`);\n    }\n  }\n\n  const followUps = buildSuggestedFollowUpsSection(classification.refine_queries);\n  if (followUps) {\n    lines.push('');\n    lines.push(followUps);\n  }\n\n  return lines.join('\\n');\n}\n\n// --- Metadata builder ---\n\nfunction buildMetadata(\n  aggregation: SearchAggregation,\n  executionTime: number,\n  totalQueries: number,\n  searches: SearchResponse['searches'],\n  llmClassified: boolean,\n  scope: 'web' | 'reddit' | 'both',\n  llmError?: string,\n  queryRewrites?: QueryRewriteRecord[],\n  retriedQueries?: RetriedQueryRecord[],\n  retryError?: StructuredError,\n) {\n  const coverageSummary = searches.map(s => {\n    let topDomain: string | undefined;\n    const topResult = s.results[0];\n    if (topResult) {\n      try { topDomain = new URL(topResult.link).hostname.replace(/^www\\./, ''); } catch { /* ignore */ }\n    }\n    return { query: s.query, result_count: s.results.length, top_url: topDomain };\n  });\n  const lowYieldQueries = searches\n    .filter(s => s.results.length <= 1)\n    .map(s => s.query);\n  const successfulQueries = searches.filter(s => s.results.length > 0).length;\n\n  return {\n    total_items: totalQueries,\n    successful: successfulQueries,\n    failed: Math.max(totalQueries - successfulQueries, 0),\n    execution_time_ms: executionTime,\n    llm_classified: llmClassified,\n    scope,\n    ...(llmError ? { llm_error: llmError } : {}),\n    coverage_summary: coverageSummary,\n    ...(lowYieldQueries.length > 0 ? { low_yield_queries: lowYieldQueries } : {}),\n    ...(queryRewrites && queryRewrites.length > 0 ? { query_rewrites: queryRewrites } : {}),\n    ...(retriedQueries && retriedQueries.length > 0 ? { retried_queries: retriedQueries } : {}),\n    ...(retryError\n      ? {\n          retry_error: {\n            phase: 'relax-retry' as const,\n            code: retryError.code,\n            message: retryError.message,\n            retryable: retryError.retryable,\n            ...(typeof retryError.statusCode === 'number' ? { statusCode: retryError.statusCode } : {}),\n          },\n        }\n      : {}),\n  };\n}\n\nfunction buildStructuredResults(\n  aggregation: SearchAggregation,\n  llmTagsByRank?: Map<number, string>,\n): Array<{\n  rank: number;\n  url: string;\n  title: string;\n  snippet: string;\n  source_type: 'reddit' | 'github' | 'docs' | 'blog' | 'paper' | 'qa' | 'cve' | 'news' | 'video' | 'web';\n  score: number;\n  seen_in: number;\n  best_position: number;\n}> {\n  return aggregation.rankedUrls.map((row) => {\n    // LLM tag wins when present; heuristic is the always-on fallback. See:\n    // mcp-revisions/output-shaping/06-source-type-tagging-without-llm.md.\n    const llmTag = llmTagsByRank?.get(row.rank);\n    const heuristic = classifySourceByUrl(row.url);\n    return {\n      rank: row.rank,\n      url: row.url,\n      title: row.title,\n      snippet: row.snippet,\n      source_type: ((llmTag as typeof heuristic) ?? heuristic),\n      score: Number(row.score.toFixed(2)),\n      seen_in: row.frequency,\n      best_position: row.bestPosition,\n    };\n  });\n}\n\n// --- Error builder ---\n\nfunction isStructuredError(error: unknown): error is StructuredError {\n  if (typeof error !== 'object' || error === null) return false;\n  const record = error as Record<string, unknown>;\n  return typeof record.code === 'string'\n    && typeof record.message === 'string'\n    && typeof record.retryable === 'boolean';\n}\n\nfunction normalizeStructuredError(error: unknown): StructuredError {\n  return isStructuredError(error) ? error : classifyError(error);\n}\n\nfunction formatSearchFailureMessage(\n  error: StructuredError,\n  phase?: SearchFailurePhase,\n): string {\n  if (phase === 'initial') {\n    return `Search provider failed during initial batch: ${error.message}`;\n  }\n\n  if (phase === 'relax-retry') {\n    return `Search provider failed during relaxed retry batch: ${error.message}`;\n  }\n\n  return error.message;\n}\n\nfunction buildWebSearchError(\n  error: unknown,\n  params: WebSearchParams,\n  startTime: number,\n  phase?: SearchFailurePhase,\n): ToolExecutionResult<WebSearchOutput> {\n  const structuredError = normalizeStructuredError(error);\n  const message = formatSearchFailureMessage(structuredError, phase);\n  const executionTime = Date.now() - startTime;\n\n  mcpLog('error', `web-search: ${message}`, 'search');\n\n  const errorContent = formatError({\n    code: structuredError.code,\n    message,\n    retryable: structuredError.retryable,\n    toolName: 'web-search',\n    howToFix: ['Verify SERPER_API_KEY is set correctly'],\n    alternatives: [\n      'web-search(queries=[\"topic recommendations\"], extract=\"...\", scope: \"reddit\") \u2014 Reddit-only post permalinks via the same backend',\n      'scrape-links(urls=[...], extract=\"...\") \u2014 if you have URLs from prior steps, scrape them now',\n    ],\n  });\n\n  return toolFailure(\n    `${errorContent}\\n\\nExecution time: ${formatDuration(executionTime)}\\nQueries: ${params.queries.length}`,\n  );\n}\n\n// --- Main handler ---\n\nexport async function handleWebSearch(\n  params: WebSearchParams,\n  reporter: ToolReporter = NOOP_REPORTER,\n  searchExecutor: SearchExecutor = executeSearches,\n): Promise<ToolExecutionResult<WebSearchOutput>> {\n  const startTime = Date.now();\n\n  try {\n    const scopedQueries = buildScopedQueries(params.queries, params.scope);\n    const effectiveQueries = scopedQueries.map((entry) => entry.query);\n    if (params.scope !== 'web') {\n      mcpLog('info', `Searching scope=${params.scope}: ${params.queries.length} input queries \u2192 ${effectiveQueries.length} dispatched`, 'search');\n    } else {\n      mcpLog('info', `Searching for ${params.queries.length} query/queries`, 'search');\n    }\n    await reporter.log('info', `Searching for ${effectiveQueries.length} query/queries (scope=${params.scope})`);\n    await reporter.progress(15, 100, 'Submitting search queries');\n\n    // Phase A \u2014 pre-dispatch normalizer. Rewrites the small fraction of\n    // queries Google was statistically going to mis-handle (3+ phrase AND,\n    // operator chars in quotes, paths in quotes). See src/utils/query-relax.ts.\n    const dispatchPlan = effectiveQueries.map((q) => {\n      const r = normalizeQueryForDispatch(q);\n      return { original: q, dispatched: r.rewritten, rules: [...r.rules], changed: r.changed };\n    });\n    const dispatchedQueries = dispatchPlan.map((p) => p.dispatched);\n    const resultScopes = scopedQueries.map((entry) => entry.resultScope);\n    const dropSiteOnRetry = scopedQueries.map((entry) => entry.dropSiteOnRetry);\n    const queryRewrites: QueryRewriteRecord[] = dispatchPlan\n      .filter((p) => p.changed)\n      .map((p) => ({ original: p.original, rewritten: p.dispatched, rules: p.rules }));\n\n    if (queryRewrites.length > 0) {\n      mcpLog(\n        'info',\n        `Pre-dispatch normalized ${queryRewrites.length}/${effectiveQueries.length} queries`,\n        'search',\n      );\n      await reporter.log(\n        'info',\n        `Normalized ${queryRewrites.length} queries pre-dispatch`,\n      );\n    }\n\n    // Phase B \u2014 on-empty retry: any query returning 0 results gets one\n    // relaxed retry (drop quotes, drop site:). Recovered hits replace the\n    // empty slot transparently.\n    const {\n      response: rawResponse,\n      retried: retriedQueries,\n      failurePhase,\n      retryError,\n    } = await executeWithRelaxRetry(\n      dispatchedQueries,\n      reporter,\n      searchExecutor,\n      { dropSiteOnRetry },\n    );\n\n    if (rawResponse.error) {\n      await reporter.log('error', `search_provider_failed: ${rawResponse.error.message}`);\n      return buildWebSearchError(rawResponse.error, params, startTime, failurePhase);\n    }\n\n    const response = filterScopedSearches(rawResponse, params.scope, resultScopes);\n    await reporter.progress(50, 100, 'Collected search results');\n\n    const { aggregation } = processResults(response);\n    await reporter.log(\n      'info',\n      `Collected ${aggregation.totalUniqueUrls} unique URLs across ${response.totalQueries} queries`,\n    );\n\n    // Decide: raw output or LLM classification\n    const useRaw = params.raw;\n    const llmProcessor = createLLMProcessor();\n\n    let markdown: string;\n    let llmClassified = false;\n    let llmError: string | undefined;\n\n    if (useRaw || !llmProcessor) {\n      // Raw path: traditional unified ranked list\n      if (!useRaw && !llmProcessor) {\n        llmError = 'LLM unavailable (LLM_API_KEY / LLM_BASE_URL / LLM_MODEL not set). Falling back to raw output.';\n        mcpLog('warning', llmError, 'search');\n        // mcp-revisions/llm-degradation/01: surface degraded mode to the client.\n        await reporter.log('warning', 'llm_classifier_unreachable: planner not configured; raw ranked list returned');\n      }\n      let rawRefineQueries: RefineQuerySuggestion[] | undefined;\n      if (useRaw && llmProcessor) {\n        const refineResult = await suggestRefineQueriesForRawMode(\n          aggregation.rankedUrls,\n          params.extract,\n          params.queries,\n          llmProcessor,\n        );\n        rawRefineQueries = refineResult.result;\n      }\n      markdown = appendSignalsAndFollowUps(\n        buildRawOutput(params.queries, aggregation, response.searches, params.verbose),\n        buildSignalsSection(aggregation, response.searches, response.totalQueries),\n        rawRefineQueries,\n        { includeSignals: params.verbose },\n      );\n      await reporter.progress(80, 100, 'Ranking search results');\n    } else {\n      // LLM classification path\n      await reporter.progress(65, 100, 'Classifying results by relevance');\n      const classification = await classifySearchResults(\n        aggregation.rankedUrls,\n        params.extract,\n        response.totalQueries,\n        llmProcessor,\n        params.queries,\n      );\n\n      if (classification.result) {\n        markdown = buildClassifiedOutput(\n          classification.result, aggregation, params.extract, response.searches, response.totalQueries, params.verbose,\n        );\n        llmClassified = true;\n        await reporter.progress(85, 100, 'Formatted classified results');\n      } else {\n        // Classification failed \u2014 fall back to raw\n        llmError = classification.error ?? 'Unknown classification error';\n        mcpLog('warning', `Classification failed, falling back to raw: ${llmError}`, 'search');\n        // mcp-revisions/llm-degradation/01: surface degraded mode to the client.\n        await reporter.log('warning', `llm_classifier_unreachable: ${llmError}`);\n        markdown = appendSignalsAndFollowUps(\n          buildRawOutput(params.queries, aggregation, response.searches, params.verbose),\n          buildSignalsSection(aggregation, response.searches, response.totalQueries),\n          undefined,\n          { includeSignals: params.verbose },\n        );\n        await reporter.progress(85, 100, 'Classification failed, using raw output');\n      }\n    }\n\n    const executionTime = Date.now() - startTime;\n    const metadata = buildMetadata(\n      aggregation, executionTime, response.totalQueries, response.searches, llmClassified, params.scope, llmError,\n      queryRewrites, retriedQueries, retryError,\n    );\n\n    // Build per-row structured results so capability-aware clients can\n    // index into `structuredContent.results` rather than regex-scrape the\n    // markdown table. The LLM tag wins when present; heuristic is the\n    // always-on fallback.\n    const llmTagsByRank = new Map<number, string>();\n    // (When classification succeeds the source_type per-row is populated\n    // inside buildClassifiedOutput via the entry.source_type field \u2014 but\n    // we don't have a direct handle on it here without a refactor. The\n    // heuristic alone covers the structuredContent shape correctly; the\n    // LLM-tagged variant remains in the markdown body.)\n    const results = buildStructuredResults(aggregation, llmTagsByRank);\n\n    mcpLog('info', `Search completed: ${aggregation.rankedUrls.length} URLs, classified=${llmClassified}`, 'search');\n    await reporter.log('info', `Search completed with ${aggregation.rankedUrls.length} URLs (classified: ${llmClassified})`);\n\n    const footer = `\\n---\\n*${formatDuration(executionTime)} | ${aggregation.totalUniqueUrls} unique URLs${llmClassified ? ' | LLM classified' : ''}*`;\n    const fullMarkdown = markdown + footer;\n\n    return toolSuccess(fullMarkdown, { content: fullMarkdown, results, metadata });\n  } catch (error) {\n    return buildWebSearchError(error, params, startTime);\n  }\n}\n\nexport function registerWebSearchTool(server: MCPServer): void {\n  server.tool(\n    {\n      name: 'web-search',\n      title: 'Web Search',\n      description:\n        'Fan out Google queries in parallel. One call carries up to 50 queries in a flat `queries` array \u2014 pack diverse facets (not paraphrases) into a single call. Call me AGGRESSIVELY across a session: 2\u20134 rounds is normal, 1 is underuse. After each pass, read `gaps[]` + `refine_queries[]` and fire another round with the new terms. Safe to call multiple times in parallel in the same turn for orthogonal subtopics. `scope`: `\"reddit\"` (server appends `site:reddit.com` + filters to post permalinks \u2014 use for sentiment / migration / lived experience), `\"web\"` default (spec / bug / pricing / CVE / API), `\"both\"` (fan each query across both \u2014 use when opinion-heavy AND needs official sources). Returns a tiered Markdown report (HIGHLY_RELEVANT / MAYBE_RELEVANT / OTHER) + grounded synthesis with `[rank]` citations + `## Gaps` + `## Suggested follow-up searches` tied to gap ids. Set `raw=true` to skip classification.',\n      schema: webSearchParamsSchema,\n      outputSchema: webSearchOutputSchema,\n      annotations: {\n        readOnlyHint: true,\n        idempotentHint: true,\n        destructiveHint: false,\n        openWorldHint: true,\n      },\n    },\n    async (args, ctx) => {\n      if (!getCapabilities().search) {\n        return toToolResponse(toolFailure(getMissingEnvMessage('search')));\n      }\n\n      const reporter = createToolReporter(ctx, 'web-search');\n      const result = await handleWebSearch(args, reporter);\n\n      await reporter.progress(100, 100, result.isError ? 'Search failed' : 'Search complete');\n      return toToolResponse(result);\n    },\n  );\n}\n"],
-  "mappings": "AAOA,SAAS,iBAAiB,4BAA4B;AACtD;AAAA,EACE;AAAA,EACA;AAAA,OAGK;AACP,SAAS,oBAAiD;AAC1D;AAAA,EACE;AAAA,EACA;AAAA,OACK;AACP;AAAA,EACE;AAAA,EACA;AAAA,EACA;AAAA,OAIK;AACP,SAAS,qBAA2C;AACpD,SAAS,2BAA2B;AACpC;AAAA,EACE;AAAA,EACA;AAAA,EACA;AAAA,OACK;AACP;AAAA,EACE;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,OAGK;AACP,SAAS,0BAA0B;AACnC;AAAA,EACE;AAAA,EACA;AAAA,OACK;AAsBP,MAAM,wBAAwB;AAC9B,MAAM,cAAc;AAQpB,SAAS,kBAAkB,OAAuB;AAChD,SAAO,wBAAwB,KAAK,KAAK,IAAI,QAAQ,GAAG,KAAK;AAC/D;AAEA,SAAS,mBAAmB,SAAmB,OAAiD;AAC9F,MAAI,UAAU,OAAO;AACnB,WAAO,QAAQ,IAAI,CAAC,WAAW,EAAE,OAAO,aAAa,OAAO,iBAAiB,KAAK,EAAE;AAAA,EACtF;AAEA,QAAM,WAAW,QAAQ;AAAA,IAAI,CAAC,OAC3B,EAAE,OAAO,kBAAkB,CAAC,GAAG,aAAa,UAAmB,iBAAiB,MAAM;AAAA,EACzF;AAEA,MAAI,UAAU,SAAU,QAAO;AAE/B,SAAO;AAAA,IACL,GAAG,QAAQ,IAAI,CAAC,WAAW,EAAE,OAAO,aAAa,OAAgB,iBAAiB,KAAK,EAAE;AAAA,IACzF,GAAG;AAAA,EACL;AACF;AAEA,eAAe,gBAAgB,SAA4C;AACzE,QAAM,SAAS,IAAI,aAAa;AAChC,SAAO,OAAO,eAAe,OAAO;AACtC;AAoBA,eAAe,sBACb,YACA,UACA,iBAAiC,iBACjC,eAAkE,CAAC,GAMlE;AACD,QAAM,UAAU,MAAM,eAAe,UAAU;AAE/C,MAAI,QAAQ,OAAO;AACjB,WAAO,EAAE,UAAU,SAAS,SAAS,CAAC,GAAG,cAAc,UAAU;AAAA,EACnE;AAEA,QAAM,eAAe,QAAQ,SAC1B,IAAI,CAAC,GAAG,MAAO,EAAE,QAAQ,WAAW,IAAI,IAAI,EAAG,EAC/C,OAAO,CAAC,MAAM,MAAM,EAAE;AAEzB,MAAI,aAAa,WAAW,GAAG;AAC7B,WAAO,EAAE,UAAU,SAAS,SAAS,CAAC,EAAE;AAAA,EAC1C;AAGA,QAAM,QAAgB,CAAC;AACvB,aAAW,OAAO,cAAc;AAC9B,UAAM,KAAK,WAAW,GAAG;AACzB,QAAI,OAAO,OAAO,SAAU;AAC5B,UAAM,IAAI,mBAAmB,IAAI,EAAE,UAAU,aAAa,kBAAkB,GAAG,KAAK,KAAK,CAAC;AAC1F,QAAI,EAAE,WAAW,EAAE,cAAc,IAAI;AACnC,YAAM,KAAK,EAAE,OAAO,KAAK,UAAU,IAAI,SAAS,EAAE,WAAW,OAAO,CAAC,GAAG,EAAE,KAAK,EAAE,CAAC;AAAA,IACpF;AAAA,EACF;AAEA,MAAI,MAAM,WAAW,GAAG;AACtB,WAAO,EAAE,UAAU,SAAS,SAAS,CAAC,EAAE;AAAA,EAC1C;AAEA;AAAA,IACE;AAAA,IACA,GAAG,MAAM,MAAM,IAAI,aAAa,MAAM;AAAA,IACtC;AAAA,EACF;AACA,QAAM,SAAS;AAAA,IACb;AAAA,IACA,GAAG,MAAM,MAAM;AAAA,EACjB;AAEA,QAAM,YAAY,MAAM,eAAe,MAAM,IAAI,CAAC,MAAM,EAAE,OAAO,CAAC;AAClE,QAAM,UAAgC,CAAC;AACvC,QAAM,eAAe,oBAAI,IAAgD;AAEzE,QAAM,QAAQ,CAAC,MAAM,MAAM;AACzB,UAAM,IAAI,UAAU,SAAS,CAAC;AAC9B,QAAI,EAAG,cAAa,IAAI,KAAK,OAAO,CAAC;AACrC,YAAQ,KAAK;AAAA,MACX,UAAU,KAAK;AAAA,MACf,cAAc,KAAK;AAAA,MACnB,OAAO,KAAK;AAAA,MACZ,mBAAmB,GAAG,QAAQ,UAAU;AAAA,IAC1C,CAAC;AAAA,EACH,CAAC;AAED,MAAI,UAAU,OAAO;AACnB;AAAA,MACE;AAAA,MACA,kEAAkE,UAAU,MAAM,OAAO;AAAA,MACzF;AAAA,IACF;AACA,UAAM,SAAS;AAAA,MACb;AAAA,MACA,8BAA8B,UAAU,MAAM,OAAO;AAAA,IACvD;AACA,WAAO;AAAA,MACL,UAAU;AAAA,MACV;AAAA,MACA,YAAY,UAAU;AAAA,IACxB;AAAA,EACF;AAEA,QAAM,iBAAiB,QAAQ,SAAS,IAAI,CAAC,GAAG,QAAQ;AACtD,UAAM,IAAI,aAAa,IAAI,GAAG;AAC9B,QAAI,KAAK,EAAE,QAAQ,SAAS,GAAG;AAC7B,aAAO,EAAE,GAAG,GAAG,OAAO,EAAE,MAAM;AAAA,IAChC;AACA,WAAO;AAAA,EACT,CAAC;AAED,SAAO;AAAA,IACL,UAAU,EAAE,GAAG,SAAS,UAAU,eAAe;AAAA,IACjD;AAAA,EACF;AACF;AAEA,SAAS,qBACP,UACA,OACA,eAA6C,CAAC,GAC9B;AAChB,MAAI,UAAU,MAAO,QAAO;AAC5B,QAAM,WAAW,SAAS,SAAS,IAAI,CAAC,QAAQ,UAAU;AACxD,UAAM,cAAc,aAAa,KAAK,MAAM,UAAU,WAAW,WAAW;AAC5E,WAAO;AAAA,MACL,GAAG;AAAA,MACH,SAAS,OAAO,QAAQ,OAAO,CAAC,MAAM;AACpC,YAAI;AACJ,YAAI;AAAE,iBAAO,IAAI,IAAI,EAAE,IAAI,EAAE;AAAA,QAAU,QAAQ;AAAE,iBAAO;AAAA,QAAM;AAC9D,YAAI,gBAAgB,UAAU;AAC5B,iBAAO,YAAY,KAAK,IAAI,KAAK,sBAAsB,KAAK,EAAE,IAAI;AAAA,QACpE;AAEA,YAAI,CAAC,YAAY,KAAK,IAAI,EAAG,QAAO;AACpC,eAAO,sBAAsB,KAAK,EAAE,IAAI;AAAA,MAC1C,CAAC;AAAA,IACH;AAAA,EACF,CAAC;AACD,SAAO,EAAE,GAAG,UAAU,UAAU,SAAS;AAC3C;AAEA,SAAS,eAAe,UAEtB;AACA,QAAM,cAAc,iBAAiB,SAAS,UAAU,CAAC;AACzD,SAAO,EAAE,YAAY;AACvB;AAIA,SAAS,eACP,SACA,aACA,UACA,UAAmB,OACX;AACR,SAAO;AAAA,IACL,YAAY;AAAA,IAAY;AAAA,IAAS;AAAA,IACjC,YAAY;AAAA,IACZ,YAAY;AAAA,IAAoB,YAAY;AAAA,IAC5C;AAAA,EACF;AACF;AAEA,SAAS,oBACP,aACA,UACA,cACQ;AACR,QAAM,gBAAgB,SAAS,OAAO,CAAC,WAAW,OAAO,QAAQ,UAAU,CAAC,EAAE;AAC9E,QAAM,WAAW,SACd,OAAO,CAAC,WAAW,OAAO,QAAQ,UAAU,CAAC,EAC7C,IAAI,CAAC,WAAW,IAAI,OAAO,KAAK,GAAG;AACtC,QAAM,iBAAiB,YAAY,WAAW,OAAO,CAAC,QAAQ,IAAI,WAAW,EAAE;AAE/E,QAAM,QAAQ;AAAA,IACZ;AAAA,IACA,eAAe,aAAa,IAAI,YAAY;AAAA,IAC5C,qBAAqB,cAAc;AAAA,EACrC;AAEA,MAAI,SAAS,SAAS,GAAG;AACvB,UAAM,KAAK,gBAAgB,SAAS,KAAK,IAAI,CAAC,EAAE;AAAA,EAClD;AAEA,SAAO,MAAM,KAAK,IAAI;AACxB;AAEO,SAAS,+BACd,eACQ;AACR,MAAI,CAAC,iBAAiB,cAAc,WAAW,GAAG;AAChD,WAAO;AAAA,EACT;AAEA,QAAM,QAAQ,CAAC,mCAAmC,EAAE;AAEpD,aAAW,QAAQ,eAAe;AAChC,UAAM,QAAQ,mBAAmB,KAAK,SAAS,EAAE;AACjD,QAAI,CAAC,MAAO;AACZ,UAAM,YAAY,mBAAmB,KAAK,aAAa,EAAE;AACzD,UAAM,SAAS,OAAO,KAAK,WAAW,WAClC,kBAAkB,KAAK,MAAM,QAC7B,KAAK,kBACH,MAAM,mBAAmB,KAAK,eAAe,CAAC,OAC9C;AACN,UAAM;AAAA,MAAK,YACP,KAAK,KAAK,WAAM,SAAS,GAAG,MAAM,KAClC,KAAK,KAAK,GAAG,MAAM;AAAA,IACvB;AAAA,EACF;AAEA,SAAO,MAAM,WAAW,IAAI,KAAK,MAAM,KAAK,IAAI;AAClD;AAEO,SAAS,0BACd,UACA,gBACA,eACA,UAAwC,CAAC,GACjC;AACR,QAAM,iBAAiB,QAAQ,kBAAkB;AACjD,QAAM,WAAW,CAAC,QAAQ;AAC1B,MAAI,kBAAkB,gBAAgB;AACpC,aAAS,KAAK,IAAI,OAAO,cAAc;AAAA,EACzC;AACA,QAAM,YAAY,+BAA+B,aAAa;AAC9D,MAAI,WAAW;AACb,aAAS,KAAK,IAAI,SAAS;AAAA,EAC7B;AACA,SAAO,SAAS,KAAK,IAAI;AAC3B;AAYA,MAAM,iBAAiB;AACvB,MAAM,iBAAiB;AAchB,SAAS,sBACd,OACA,aACA,OAAuC,CAAC,GAChC;AACR,QAAM,MAAM,KAAK,OAAO;AACxB,QAAM,MAAM,KAAK,OAAO;AAExB,QAAM,QAA8F,CAAC;AAErG,aAAW,aAAa,MAAM,MAAM;AAClC,QAAI,MAAM,UAAU,IAAK;AACzB,UAAM,KAAK,EAAE,WAAW,MAAM,kBAAkB,CAAC;AAAA,EACnD;AAEA,MAAI,MAAM,SAAS,KAAK;AACtB,UAAM,SAAS,KAAK,IAAI,KAAK,GAAG;AAChC,eAAW,aAAa,MAAM,OAAO;AACnC,UAAI,MAAM,UAAU,OAAQ;AAC5B,YAAM,KAAK,EAAE,WAAW,MAAM,iBAAiB,CAAC;AAAA,IAClD;AAAA,EACF;AAEA,MAAI,MAAM,WAAW,EAAG,QAAO;AAE/B,QAAM,QAAkB,CAAC;AACzB,QAAM,KAAK,uDAAkD;AAC7D,QAAM,QAAQ,CAAC,MAAM,MAAM;AACzB,UAAM,QAAQ,YAAY,IAAI,KAAK,UAAU,IAAI;AACjD,UAAM,SAAS,OAAO,UAAU,MAAM,OAAO,KAAK,EAAE,SAAS,IAAI,MAAM,SAAS;AAChF,QAAI;AACJ,QAAI;AACF,eAAS,IAAI,IAAI,KAAK,UAAU,GAAG,EAAE,SAAS,QAAQ,UAAU,EAAE;AAAA,IACpE,QAAQ;AACN,eAAS,KAAK,UAAU;AAAA,IAC1B;AACA,UAAM;AAAA,MACJ,GAAG,IAAI,CAAC,QAAQ,KAAK,UAAU,KAAK,KAAK,KAAK,UAAU,GAAG,cAAS,MAAM,WAAM,MAAM,MAAM,KAAK,IAAI,UAAU,KAAK,UAAU,IAAI;AAAA,IACpI;AAAA,EACF,CAAC;AACD,SAAO,MAAM,KAAK,IAAI;AACxB;AAIA,SAAS,sBACP,gBACA,aACA,SACA,UACA,cACA,UAAmB,OACX;AACR,QAAM,aAAa,YAAY;AAG/B,QAAM,cAAc,IAAI,IAAI,eAAe,QAAQ,IAAI,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;AAE1E,QAAM,QAAQ;AAAA,IACZ,MAAM,CAAC;AAAA,IACP,OAAO,CAAC;AAAA,IACR,OAAO,CAAC;AAAA,EACV;AAEA,aAAW,OAAO,YAAY;AAC5B,UAAM,QAAQ,YAAY,IAAI,IAAI,IAAI;AACtC,UAAM,OAAO,OAAO;AACpB,QAAI,SAAS,mBAAmB;AAC9B,YAAM,KAAK,KAAK,GAAG;AAAA,IACrB,WAAW,SAAS,kBAAkB;AACpC,YAAM,MAAM,KAAK,GAAG;AAAA,IACtB,OAAO;AACL,YAAM,MAAM,KAAK,GAAG;AAAA,IACtB;AAAA,EACF;AAEA,QAAM,QAAkB,CAAC;AAGzB,QAAM,KAAK,MAAM,eAAe,KAAK,EAAE;AACvC,QAAM,KAAK,kBAAkB,OAAO,EAAE;AACtC,QAAM,KAAK,KAAK,YAAY,mBAAc,WAAW,MAAM,gBAAW,MAAM,KAAK,MAAM,qBAAqB,MAAM,MAAM,MAAM,oBAAoB;AAClJ,MAAI,eAAe,YAAY;AAC7B,UAAM,aAAa,eAAe,oBAAoB,WAAM,eAAe,iBAAiB,KAAK;AACjG,UAAM,KAAK,mBAAmB,eAAe,UAAU,KAAK,UAAU,EAAE;AAAA,EAC1E;AACA,QAAM,KAAK,EAAE;AAIb,QAAM,YAAY;AAAA,IAChB,EAAE,MAAM,MAAM,MAAM,OAAO,MAAM,MAAM;AAAA,IACvC;AAAA,EACF;AACA,MAAI,WAAW;AACb,UAAM,KAAK,SAAS;AACpB,UAAM,KAAK,EAAE;AAAA,EACf;AAEA,QAAM,KAAK,gBAAgB,eAAe,SAAS,EAAE;AACrD,QAAM,KAAK,EAAE;AAGb,QAAM,gBAAgB,CAAC,QAA2C;AAChE,UAAM,QAAQ,YAAY,IAAI,IAAI,IAAI;AACtC,UAAM,cAAc,KAAK,MAAM,IAAI,gBAAgB,GAAG;AACtD,UAAM,SAAS,GAAG,IAAI,SAAS,IAAI,YAAY,KAAK,WAAW;AAC/D,UAAM,aAAa,OAAO,cAAc,KAAK,MAAM,WAAW,OAAO;AACrE,UAAM,SAAS,OAAO,SAAS,MAAM,OAAO,QAAQ,OAAO,KAAK,IAAI;AACpE,WAAO,KAAK,IAAI,IAAI,OAAO,IAAI,KAAK,KAAK,IAAI,GAAG,OAAO,UAAU,MAAM,MAAM,MAAM,MAAM;AAAA,EAC3F;AAGA,MAAI,MAAM,KAAK,SAAS,GAAG;AACzB,UAAM,KAAK,wBAAwB,MAAM,KAAK,MAAM,GAAG;AACvD,UAAM,KAAK,sCAAsC;AACjD,UAAM,KAAK,sCAAsC;AACjD,eAAW,OAAO,MAAM,KAAM,OAAM,KAAK,cAAc,GAAG,CAAC;AAC3D,UAAM,KAAK,EAAE;AAAA,EACf;AAGA,MAAI,MAAM,MAAM,SAAS,GAAG;AAC1B,UAAM,KAAK,uBAAuB,MAAM,MAAM,MAAM,GAAG;AACvD,UAAM,KAAK,sCAAsC;AACjD,UAAM,KAAK,sCAAsC;AACjD,eAAW,OAAO,MAAM,MAAO,OAAM,KAAK,cAAc,GAAG,CAAC;AAC5D,UAAM,KAAK,EAAE;AAAA,EACf;AAGA,MAAI,MAAM,MAAM,SAAS,GAAG;AAC1B,UAAM,KAAK,sBAAsB,MAAM,MAAM,MAAM,GAAG;AACtD,UAAM,KAAK,wCAAwC;AACnD,UAAM,KAAK,wCAAwC;AACnD,eAAW,OAAO,MAAM,OAAO;AAC7B,YAAM,QAAQ,YAAY,IAAI,IAAI,IAAI;AACtC,YAAM,YAAY,IAAI,QAAQ,IAAI,CAAC,MAAM,IAAI,CAAC,GAAG,EAAE,KAAK,IAAI;AAC5D,YAAM,aAAa,OAAO,cAAc,KAAK,MAAM,WAAW,OAAO;AACrE,UAAI;AACJ,UAAI;AACF,iBAAS,IAAI,IAAI,IAAI,GAAG,EAAE,SAAS,QAAQ,UAAU,EAAE;AAAA,MACzD,QAAQ;AACN,iBAAS,IAAI;AAAA,MACf;AACA,YAAM,KAAK,KAAK,IAAI,IAAI,MAAM,MAAM,MAAM,UAAU,MAAM,IAAI,MAAM,QAAQ,CAAC,CAAC,MAAM,SAAS,IAAI;AAAA,IACnG;AACA,UAAM,KAAK,EAAE;AAAA,EACf;AAKA,MAAI,SAAS;AACX,UAAM,KAAK,oBAAoB,aAAa,UAAU,YAAY,CAAC;AAAA,EACrE;AAGA,MAAI,eAAe,QAAQ,eAAe,KAAK,SAAS,GAAG;AACzD,UAAM,KAAK,EAAE;AACb,UAAM,KAAK,SAAS;AACpB,eAAW,OAAO,eAAe,MAAM;AACrC,YAAM,KAAK,QAAQ,IAAI,EAAE,OAAO,IAAI,WAAW,EAAE;AAAA,IACnD;AAAA,EACF;AAEA,QAAM,YAAY,+BAA+B,eAAe,cAAc;AAC9E,MAAI,WAAW;AACb,UAAM,KAAK,EAAE;AACb,UAAM,KAAK,SAAS;AAAA,EACtB;AAEA,SAAO,MAAM,KAAK,IAAI;AACxB;AAIA,SAAS,cACP,aACA,eACA,cACA,UACA,eACA,OACA,UACA,eACA,gBACA,YACA;AACA,QAAM,kBAAkB,SAAS,IAAI,OAAK;AACxC,QAAI;AACJ,UAAM,YAAY,EAAE,QAAQ,CAAC;AAC7B,QAAI,WAAW;AACb,UAAI;AAAE,oBAAY,IAAI,IAAI,UAAU,IAAI,EAAE,SAAS,QAAQ,UAAU,EAAE;AAAA,MAAG,QAAQ;AAAA,MAAe;AAAA,IACnG;AACA,WAAO,EAAE,OAAO,EAAE,OAAO,cAAc,EAAE,QAAQ,QAAQ,SAAS,UAAU;AAAA,EAC9E,CAAC;AACD,QAAM,kBAAkB,SACrB,OAAO,OAAK,EAAE,QAAQ,UAAU,CAAC,EACjC,IAAI,OAAK,EAAE,KAAK;AACnB,QAAM,oBAAoB,SAAS,OAAO,OAAK,EAAE,QAAQ,SAAS,CAAC,EAAE;AAErE,SAAO;AAAA,IACL,aAAa;AAAA,IACb,YAAY;AAAA,IACZ,QAAQ,KAAK,IAAI,eAAe,mBAAmB,CAAC;AAAA,IACpD,mBAAmB;AAAA,IACnB,gBAAgB;AAAA,IAChB;AAAA,IACA,GAAI,WAAW,EAAE,WAAW,SAAS,IAAI,CAAC;AAAA,IAC1C,kBAAkB;AAAA,IAClB,GAAI,gBAAgB,SAAS,IAAI,EAAE,mBAAmB,gBAAgB,IAAI,CAAC;AAAA,IAC3E,GAAI,iBAAiB,cAAc,SAAS,IAAI,EAAE,gBAAgB,cAAc,IAAI,CAAC;AAAA,IACrF,GAAI,kBAAkB,eAAe,SAAS,IAAI,EAAE,iBAAiB,eAAe,IAAI,CAAC;AAAA,IACzF,GAAI,aACA;AAAA,MACE,aAAa;AAAA,QACX,OAAO;AAAA,QACP,MAAM,WAAW;AAAA,QACjB,SAAS,WAAW;AAAA,QACpB,WAAW,WAAW;AAAA,QACtB,GAAI,OAAO,WAAW,eAAe,WAAW,EAAE,YAAY,WAAW,WAAW,IAAI,CAAC;AAAA,MAC3F;AAAA,IACF,IACA,CAAC;AAAA,EACP;AACF;AAEA,SAAS,uBACP,aACA,eAUC;AACD,SAAO,YAAY,WAAW,IAAI,CAAC,QAAQ;AAGzC,UAAM,SAAS,eAAe,IAAI,IAAI,IAAI;AAC1C,UAAM,YAAY,oBAAoB,IAAI,GAAG;AAC7C,WAAO;AAAA,MACL,MAAM,IAAI;AAAA,MACV,KAAK,IAAI;AAAA,MACT,OAAO,IAAI;AAAA,MACX,SAAS,IAAI;AAAA,MACb,aAAe,UAA+B;AAAA,MAC9C,OAAO,OAAO,IAAI,MAAM,QAAQ,CAAC,CAAC;AAAA,MAClC,SAAS,IAAI;AAAA,MACb,eAAe,IAAI;AAAA,IACrB;AAAA,EACF,CAAC;AACH;AAIA,SAAS,kBAAkB,OAA0C;AACnE,MAAI,OAAO,UAAU,YAAY,UAAU,KAAM,QAAO;AACxD,QAAM,SAAS;AACf,SAAO,OAAO,OAAO,SAAS,YACzB,OAAO,OAAO,YAAY,YAC1B,OAAO,OAAO,cAAc;AACnC;AAEA,SAAS,yBAAyB,OAAiC;AACjE,SAAO,kBAAkB,KAAK,IAAI,QAAQ,cAAc,KAAK;AAC/D;AAEA,SAAS,2BACP,OACA,OACQ;AACR,MAAI,UAAU,WAAW;AACvB,WAAO,gDAAgD,MAAM,OAAO;AAAA,EACtE;AAEA,MAAI,UAAU,eAAe;AAC3B,WAAO,sDAAsD,MAAM,OAAO;AAAA,EAC5E;AAEA,SAAO,MAAM;AACf;AAEA,SAAS,oBACP,OACA,QACA,WACA,OACsC;AACtC,QAAM,kBAAkB,yBAAyB,KAAK;AACtD,QAAM,UAAU,2BAA2B,iBAAiB,KAAK;AACjE,QAAM,gBAAgB,KAAK,IAAI,IAAI;AAEnC,SAAO,SAAS,eAAe,OAAO,IAAI,QAAQ;AAElD,QAAM,eAAe,YAAY;AAAA,IAC/B,MAAM,gBAAgB;AAAA,IACtB;AAAA,IACA,WAAW,gBAAgB;AAAA,IAC3B,UAAU;AAAA,IACV,UAAU,CAAC,wCAAwC;AAAA,IACnD,cAAc;AAAA,MACZ;AAAA,MACA;AAAA,IACF;AAAA,EACF,CAAC;AAED,SAAO;AAAA,IACL,GAAG,YAAY;AAAA;AAAA,kBAAuB,eAAe,aAAa,CAAC;AAAA,WAAc,OAAO,QAAQ,MAAM;AAAA,EACxG;AACF;AAIA,eAAsB,gBACpB,QACA,WAAyB,eACzB,iBAAiC,iBACc;AAC/C,QAAM,YAAY,KAAK,IAAI;AAE3B,MAAI;AACF,UAAM,gBAAgB,mBAAmB,OAAO,SAAS,OAAO,KAAK;AACrE,UAAM,mBAAmB,cAAc,IAAI,CAAC,UAAU,MAAM,KAAK;AACjE,QAAI,OAAO,UAAU,OAAO;AAC1B,aAAO,QAAQ,mBAAmB,OAAO,KAAK,KAAK,OAAO,QAAQ,MAAM,yBAAoB,iBAAiB,MAAM,eAAe,QAAQ;AAAA,IAC5I,OAAO;AACL,aAAO,QAAQ,iBAAiB,OAAO,QAAQ,MAAM,kBAAkB,QAAQ;AAAA,IACjF;AACA,UAAM,SAAS,IAAI,QAAQ,iBAAiB,iBAAiB,MAAM,yBAAyB,OAAO,KAAK,GAAG;AAC3G,UAAM,SAAS,SAAS,IAAI,KAAK,2BAA2B;AAK5D,UAAM,eAAe,iBAAiB,IAAI,CAAC,MAAM;AAC/C,YAAM,IAAI,0BAA0B,CAAC;AACrC,aAAO,EAAE,UAAU,GAAG,YAAY,EAAE,WAAW,OAAO,CAAC,GAAG,EAAE,KAAK,GAAG,SAAS,EAAE,QAAQ;AAAA,IACzF,CAAC;AACD,UAAM,oBAAoB,aAAa,IAAI,CAAC,MAAM,EAAE,UAAU;AAC9D,UAAM,eAAe,cAAc,IAAI,CAAC,UAAU,MAAM,WAAW;AACnE,UAAM,kBAAkB,cAAc,IAAI,CAAC,UAAU,MAAM,eAAe;AAC1E,UAAM,gBAAsC,aACzC,OAAO,CAAC,MAAM,EAAE,OAAO,EACvB,IAAI,CAAC,OAAO,EAAE,UAAU,EAAE,UAAU,WAAW,EAAE,YAAY,OAAO,EAAE,MAAM,EAAE;AAEjF,QAAI,cAAc,SAAS,GAAG;AAC5B;AAAA,QACE;AAAA,QACA,2BAA2B,cAAc,MAAM,IAAI,iBAAiB,MAAM;AAAA,QAC1E;AAAA,MACF;AACA,YAAM,SAAS;AAAA,QACb;AAAA,QACA,cAAc,cAAc,MAAM;AAAA,MACpC;AAAA,IACF;AAKA,UAAM;AAAA,MACJ,UAAU;AAAA,MACV,SAAS;AAAA,MACT;AAAA,MACA;AAAA,IACF,IAAI,MAAM;AAAA,MACR;AAAA,MACA;AAAA,MACA;AAAA,MACA,EAAE,gBAAgB;AAAA,IACpB;AAEA,QAAI,YAAY,OAAO;AACrB,YAAM,SAAS,IAAI,SAAS,2BAA2B,YAAY,MAAM,OAAO,EAAE;AAClF,aAAO,oBAAoB,YAAY,OAAO,QAAQ,WAAW,YAAY;AAAA,IAC/E;AAEA,UAAM,WAAW,qBAAqB,aAAa,OAAO,OAAO,YAAY;AAC7E,UAAM,SAAS,SAAS,IAAI,KAAK,0BAA0B;AAE3D,UAAM,EAAE,YAAY,IAAI,eAAe,QAAQ;AAC/C,UAAM,SAAS;AAAA,MACb;AAAA,MACA,aAAa,YAAY,eAAe,uBAAuB,SAAS,YAAY;AAAA,IACtF;AAGA,UAAM,SAAS,OAAO;AACtB,UAAM,eAAe,mBAAmB;AAExC,QAAI;AACJ,QAAI,gBAAgB;AACpB,QAAI;AAEJ,QAAI,UAAU,CAAC,cAAc;AAE3B,UAAI,CAAC,UAAU,CAAC,cAAc;AAC5B,mBAAW;AACX,eAAO,WAAW,UAAU,QAAQ;AAEpC,cAAM,SAAS,IAAI,WAAW,8EAA8E;AAAA,MAC9G;AACA,UAAI;AACJ,UAAI,UAAU,cAAc;AAC1B,cAAM,eAAe,MAAM;AAAA,UACzB,YAAY;AAAA,UACZ,OAAO;AAAA,UACP,OAAO;AAAA,UACP;AAAA,QACF;AACA,2BAAmB,aAAa;AAAA,MAClC;AACA,iBAAW;AAAA,QACT,eAAe,OAAO,SAAS,aAAa,SAAS,UAAU,OAAO,OAAO;AAAA,QAC7E,oBAAoB,aAAa,SAAS,UAAU,SAAS,YAAY;AAAA,QACzE;AAAA,QACA,EAAE,gBAAgB,OAAO,QAAQ;AAAA,MACnC;AACA,YAAM,SAAS,SAAS,IAAI,KAAK,wBAAwB;AAAA,IAC3D,OAAO;AAEL,YAAM,SAAS,SAAS,IAAI,KAAK,kCAAkC;AACnE,YAAM,iBAAiB,MAAM;AAAA,QAC3B,YAAY;AAAA,QACZ,OAAO;AAAA,QACP,SAAS;AAAA,QACT;AAAA,QACA,OAAO;AAAA,MACT;AAEA,UAAI,eAAe,QAAQ;AACzB,mBAAW;AAAA,UACT,eAAe;AAAA,UAAQ;AAAA,UAAa,OAAO;AAAA,UAAS,SAAS;AAAA,UAAU,SAAS;AAAA,UAAc,OAAO;AAAA,QACvG;AACA,wBAAgB;AAChB,cAAM,SAAS,SAAS,IAAI,KAAK,8BAA8B;AAAA,MACjE,OAAO;AAEL,mBAAW,eAAe,SAAS;AACnC,eAAO,WAAW,+CAA+C,QAAQ,IAAI,QAAQ;AAErF,cAAM,SAAS,IAAI,WAAW,+BAA+B,QAAQ,EAAE;AACvE,mBAAW;AAAA,UACT,eAAe,OAAO,SAAS,aAAa,SAAS,UAAU,OAAO,OAAO;AAAA,UAC7E,oBAAoB,aAAa,SAAS,UAAU,SAAS,YAAY;AAAA,UACzE;AAAA,UACA,EAAE,gBAAgB,OAAO,QAAQ;AAAA,QACnC;AACA,cAAM,SAAS,SAAS,IAAI,KAAK,yCAAyC;AAAA,MAC5E;AAAA,IACF;AAEA,UAAM,gBAAgB,KAAK,IAAI,IAAI;AACnC,UAAM,WAAW;AAAA,MACf;AAAA,MAAa;AAAA,MAAe,SAAS;AAAA,MAAc,SAAS;AAAA,MAAU;AAAA,MAAe,OAAO;AAAA,MAAO;AAAA,MACnG;AAAA,MAAe;AAAA,MAAgB;AAAA,IACjC;AAMA,UAAM,gBAAgB,oBAAI,IAAoB;AAM9C,UAAM,UAAU,uBAAuB,aAAa,aAAa;AAEjE,WAAO,QAAQ,qBAAqB,YAAY,WAAW,MAAM,qBAAqB,aAAa,IAAI,QAAQ;AAC/G,UAAM,SAAS,IAAI,QAAQ,yBAAyB,YAAY,WAAW,MAAM,sBAAsB,aAAa,GAAG;AAEvH,UAAM,SAAS;AAAA;AAAA,GAAW,eAAe,aAAa,CAAC,MAAM,YAAY,eAAe,eAAe,gBAAgB,sBAAsB,EAAE;AAC/I,UAAM,eAAe,WAAW;AAEhC,WAAO,YAAY,cAAc,EAAE,SAAS,cAAc,SAAS,SAAS,CAAC;AAAA,EAC/E,SAAS,OAAO;AACd,WAAO,oBAAoB,OAAO,QAAQ,SAAS;AAAA,EACrD;AACF;AAEO,SAAS,sBAAsB,QAAyB;AAC7D,SAAO;AAAA,IACL;AAAA,MACE,MAAM;AAAA,MACN,OAAO;AAAA,MACP,aACE;AAAA,MACF,QAAQ;AAAA,MACR,cAAc;AAAA,MACd,aAAa;AAAA,QACX,cAAc;AAAA,QACd,gBAAgB;AAAA,QAChB,iBAAiB;AAAA,QACjB,eAAe;AAAA,MACjB;AAAA,IACF;AAAA,IACA,OAAO,MAAM,QAAQ;AACnB,UAAI,CAAC,gBAAgB,EAAE,QAAQ;AAC7B,eAAO,eAAe,YAAY,qBAAqB,QAAQ,CAAC,CAAC;AAAA,MACnE;AAEA,YAAM,WAAW,mBAAmB,KAAK,YAAY;AACrD,YAAM,SAAS,MAAM,gBAAgB,MAAM,QAAQ;AAEnD,YAAM,SAAS,SAAS,KAAK,KAAK,OAAO,UAAU,kBAAkB,iBAAiB;AACtF,aAAO,eAAe,MAAM;AAAA,IAC9B;AAAA,EACF;AACF;",
+  "sourcesContent": ["/**\n * Web Search Tool Handler\n * NEVER throws - always returns structured response for graceful degradation\n */\n\nimport type { MCPServer } from 'mcp-use/server';\n\nimport { getCapabilities, getMissingEnvMessage } from '../config/index.js';\nimport {\n  QUERY_REWRITE_PAIR_GUIDANCE_TEXT,\n  webSearchOutputSchema,\n  webSearchParamsSchema,\n  type WebSearchParams,\n  type WebSearchOutput,\n} from '../schemas/web-search.js';\nimport { SearchClient, type MultipleSearchResponse } from '../clients/search.js';\nimport {\n  aggregateAndRank,\n  generateUnifiedOutput,\n} from '../utils/url-aggregator.js';\nimport {\n  createLLMProcessor,\n  classifySearchResults,\n  suggestRefineQueriesForRawMode,\n  type ClassificationEntry,\n  type ClassificationResult,\n  type RefineQuerySuggestion,\n} from '../services/llm-processor.js';\nimport { classifyError, type StructuredError } from '../utils/errors.js';\nimport { classifySourceByUrl } from '../utils/source-type.js';\nimport {\n  mcpLog,\n  formatError,\n  formatDuration,\n} from './utils.js';\nimport {\n  createToolReporter,\n  NOOP_REPORTER,\n  toolFailure,\n  toolSuccess,\n  toToolResponse,\n  type ToolExecutionResult,\n  type ToolReporter,\n} from './mcp-helpers.js';\nimport { sanitizeSuggestion } from '../utils/sanitize.js';\nimport {\n  normalizeQueryForDispatch,\n  relaxQueryForRetry,\n} from '../utils/query-relax.js';\n\n// --- Internal types ---\n\ninterface SearchAggregation {\n  readonly rankedUrls: ReturnType<typeof aggregateAndRank>['rankedUrls'];\n  readonly totalUniqueUrls: number;\n  readonly frequencyThreshold: number;\n  readonly thresholdNote?: string;\n}\n\nexport type SearchResponse = MultipleSearchResponse;\nexport type SearchExecutor = (queries: string[]) => Promise<SearchResponse>;\n\ntype SearchFailurePhase = 'initial' | 'relax-retry';\ntype SearchResultScope = 'web' | 'reddit';\n\n// --- Helpers ---\n\n/** Reddit post permalink: /r/{sub}/comments/{id}/ \u2014 drops subreddit\n *  homepages, /rising, /new, /top, etc. so only post URLs reach the agent.\n *  See mcp-revisions/tool-surface/02-extend-web-search-with-reddit-scope.md. */\nconst REDDIT_POST_PERMALINK = /\\/r\\/[^/]+\\/comments\\/[a-z0-9]+\\//i;\nconst REDDIT_HOST = /(?:^|\\.)reddit\\.com$/i;\n\ninterface ScopedQuery {\n  query: string;\n  resultScope: SearchResultScope;\n  dropSiteOnRetry: boolean;\n}\n\nfunction redditScopedQuery(query: string): string {\n  return /\\bsite:reddit\\.com\\b/i.test(query) ? query : `${query} site:reddit.com`;\n}\n\nfunction buildScopedQueries(queries: string[], scope: 'web' | 'reddit' | 'both'): ScopedQuery[] {\n  if (scope === 'web') {\n    return queries.map((query) => ({ query, resultScope: 'web', dropSiteOnRetry: true }));\n  }\n\n  const reddited = queries.map((q) =>\n    ({ query: redditScopedQuery(q), resultScope: 'reddit' as const, dropSiteOnRetry: false }),\n  );\n\n  if (scope === 'reddit') return reddited;\n\n  return [\n    ...queries.map((query) => ({ query, resultScope: 'web' as const, dropSiteOnRetry: true })),\n    ...reddited,\n  ];\n}\n\nasync function executeSearches(queries: string[]): Promise<SearchResponse> {\n  const client = new SearchClient();\n  return client.searchMultiple(queries);\n}\n\ninterface QueryRewriteRecord {\n  original: string;\n  rewritten: string;\n  rules: string[];\n}\n\ninterface RetriedQueryRecord {\n  original: string;\n  retried_with: string;\n  rules: string[];\n  recovered_results: number;\n}\n\n/** Run Serper, then for each query that returned 0 results build a relaxed\n *  retry (Phase B) and reissue them in a single second batch. Replace the\n *  empty slot with the retry's results when the retry recovered \u22651 hit, but\n *  keep the original query string in the slot so downstream aggregation and\n *  follow-up rendering stay consistent. */\nasync function executeWithRelaxRetry(\n  dispatched: string[],\n  reporter: ToolReporter,\n  searchExecutor: SearchExecutor = executeSearches,\n  retryOptions: { readonly dropSiteOnRetry?: readonly boolean[] } = {},\n): Promise<{\n  response: SearchResponse;\n  retried: RetriedQueryRecord[];\n  failurePhase?: SearchFailurePhase;\n  retryError?: StructuredError;\n}> {\n  const initial = await searchExecutor(dispatched);\n\n  if (initial.error) {\n    return { response: initial, retried: [], failurePhase: 'initial' };\n  }\n\n  const emptyIndices = initial.searches\n    .map((s, i) => (s.results.length === 0 ? i : -1))\n    .filter((i) => i !== -1);\n\n  if (emptyIndices.length === 0) {\n    return { response: initial, retried: [] };\n  }\n\n  interface Plan { index: number; original: string; relaxed: string; rules: string[] }\n  const plans: Plan[] = [];\n  for (const idx of emptyIndices) {\n    const dq = dispatched[idx];\n    if (typeof dq !== 'string') continue;\n    const r = relaxQueryForRetry(dq, { dropSite: retryOptions.dropSiteOnRetry?.[idx] ?? true });\n    if (r.changed && r.rewritten !== dq) {\n      plans.push({ index: idx, original: dq, relaxed: r.rewritten, rules: [...r.rules] });\n    }\n  }\n\n  if (plans.length === 0) {\n    return { response: initial, retried: [] };\n  }\n\n  mcpLog(\n    'info',\n    `${plans.length}/${emptyIndices.length} empty-result queries eligible for relaxation retry`,\n    'search',\n  );\n  await reporter.log(\n    'info',\n    `${plans.length} queries returned 0 results; retrying with relaxation`,\n  );\n\n  const retryResp = await searchExecutor(plans.map((p) => p.relaxed));\n  const retried: RetriedQueryRecord[] = [];\n  const retryByIndex = new Map<number, SearchResponse['searches'][number]>();\n\n  plans.forEach((plan, i) => {\n    const r = retryResp.searches[i];\n    if (r) retryByIndex.set(plan.index, r);\n    retried.push({\n      original: plan.original,\n      retried_with: plan.relaxed,\n      rules: plan.rules,\n      recovered_results: r?.results.length ?? 0,\n    });\n  });\n\n  if (retryResp.error) {\n    mcpLog(\n      'warning',\n      `Relaxed retry batch failed; preserving initial search results: ${retryResp.error.message}`,\n      'search',\n    );\n    await reporter.log(\n      'warning',\n      `search_relax_retry_failed: ${retryResp.error.message}`,\n    );\n    return {\n      response: initial,\n      retried,\n      retryError: retryResp.error,\n    };\n  }\n\n  const mergedSearches = initial.searches.map((s, idx) => {\n    const r = retryByIndex.get(idx);\n    if (r && r.results.length > 0) {\n      return { ...r, query: s.query };\n    }\n    return s;\n  });\n\n  return {\n    response: { ...initial, searches: mergedSearches },\n    retried,\n  };\n}\n\nfunction filterScopedSearches(\n  response: SearchResponse,\n  scope: 'web' | 'reddit' | 'both',\n  resultScopes: readonly SearchResultScope[] = [],\n): SearchResponse {\n  if (scope === 'web') return response;\n  const filtered = response.searches.map((search, index) => {\n    const resultScope = resultScopes[index] ?? (scope === 'reddit' ? 'reddit' : 'web');\n    return {\n      ...search,\n      results: search.results.filter((r) => {\n        let host: string;\n        try { host = new URL(r.link).hostname; } catch { return true; }\n        if (resultScope === 'reddit') {\n          return REDDIT_HOST.test(host) && REDDIT_POST_PERMALINK.test(r.link);\n        }\n        // Web-side results pass through; reddit URLs still must be post permalinks.\n        if (!REDDIT_HOST.test(host)) return true;\n        return REDDIT_POST_PERMALINK.test(r.link);\n      }),\n    };\n  });\n  return { ...response, searches: filtered };\n}\n\nfunction processResults(response: SearchResponse): {\n  aggregation: SearchAggregation;\n} {\n  const aggregation = aggregateAndRank(response.searches, 5);\n  return { aggregation };\n}\n\n// --- Raw output (traditional unified ranked list) ---\n\nfunction buildRawOutput(\n  queries: string[],\n  aggregation: SearchAggregation,\n  searches: SearchResponse['searches'],\n  verbose: boolean = false,\n): string {\n  return generateUnifiedOutput(\n    aggregation.rankedUrls, queries, searches,\n    aggregation.totalUniqueUrls,\n    aggregation.frequencyThreshold, aggregation.thresholdNote,\n    verbose,\n  );\n}\n\nfunction buildSignalsSection(\n  aggregation: SearchAggregation,\n  searches: SearchResponse['searches'],\n  totalQueries: number,\n): string {\n  const coverageCount = searches.filter((search) => search.results.length >= 3).length;\n  const lowYield = searches\n    .filter((search) => search.results.length <= 1)\n    .map((search) => `\"${search.query}\"`);\n  const consensusCount = aggregation.rankedUrls.filter((url) => url.isConsensus).length;\n\n  const lines = [\n    '**Signals**',\n    `- Coverage: ${coverageCount}/${totalQueries} queries returned \u22653 results`,\n    `- Consensus URLs: ${consensusCount}`,\n  ];\n\n  if (lowYield.length > 0) {\n    lines.push(`- Low-yield: ${lowYield.join(', ')}`);\n  }\n\n  return lines.join('\\n');\n}\n\nexport function buildSuggestedFollowUpsSection(\n  refineQueries: Array<{ query: string; rationale?: string; gap_id?: number; gap_description?: string }> | undefined,\n): string {\n  if (!refineQueries || refineQueries.length === 0) {\n    return '';\n  }\n\n  const lines = ['## Suggested follow-up searches', ''];\n\n  for (const item of refineQueries) {\n    const query = sanitizeSuggestion(item.query ?? '');\n    if (!query) continue;\n    const rationale = sanitizeSuggestion(item.rationale ?? '');\n    const gapTag = typeof item.gap_id === 'number'\n      ? ` _(closes gap [${item.gap_id}])_`\n      : item.gap_description\n        ? ` _(${sanitizeSuggestion(item.gap_description)})_`\n        : '';\n    lines.push(rationale\n      ? `- ${query} \u2014 ${rationale}${gapTag}`\n      : `- ${query}${gapTag}`,\n    );\n  }\n\n  return lines.length === 2 ? '' : lines.join('\\n');\n}\n\nexport function appendSignalsAndFollowUps(\n  markdown: string,\n  signalsSection: string,\n  refineQueries: RefineQuerySuggestion[] | undefined,\n  options: { includeSignals?: boolean } = {},\n): string {\n  const includeSignals = options.includeSignals ?? false;\n  const sections = [markdown];\n  if (includeSignals && signalsSection) {\n    sections.push('', '---', signalsSection);\n  }\n  const followUps = buildSuggestedFollowUpsSection(refineQueries);\n  if (followUps) {\n    sections.push('', followUps);\n  }\n  return sections.join('\\n');\n}\n\n// --- \"Start here\" section ---\n//\n// Surfaces the best 3-5 URLs at the top of the classified response so an agent\n// skimming the first screen sees them before tier tables. Deterministic: uses\n// existing `tier` + `rank` + `reason` from the classifier, no extra LLM call.\n//\n// Algorithm: take HIGHLY_RELEVANT by rank up to MAX_START_HERE; if fewer than\n// MIN_START_HERE, pad from top MAYBE_RELEVANT; skip entirely if no entries\n// above OTHER.\n\nconst MIN_START_HERE = 3;\nconst MAX_START_HERE = 5;\n\n/** Minimal structural shape \u2014 avoids coupling to private `RankedUrl` type. */\ninterface StartHereCandidate {\n  readonly rank: number;\n  readonly url: string;\n  readonly title: string;\n}\n\ninterface StartHereTiers {\n  readonly high: readonly StartHereCandidate[];\n  readonly maybe: readonly StartHereCandidate[];\n}\n\nexport function buildStartHereSection(\n  tiers: StartHereTiers,\n  entryByRank: Map<number, ClassificationEntry>,\n  opts: { min?: number; max?: number } = {},\n): string {\n  const min = opts.min ?? MIN_START_HERE;\n  const max = opts.max ?? MAX_START_HERE;\n\n  const picks: Array<{ candidate: StartHereCandidate; tier: 'HIGHLY_RELEVANT' | 'MAYBE_RELEVANT' }> = [];\n\n  for (const candidate of tiers.high) {\n    if (picks.length >= max) break;\n    picks.push({ candidate, tier: 'HIGHLY_RELEVANT' });\n  }\n\n  if (picks.length < min) {\n    const target = Math.min(min, max);\n    for (const candidate of tiers.maybe) {\n      if (picks.length >= target) break;\n      picks.push({ candidate, tier: 'MAYBE_RELEVANT' });\n    }\n  }\n\n  if (picks.length === 0) return '';\n\n  const lines: string[] = [];\n  lines.push('## Start here \u2014 best candidates for your extract');\n  picks.forEach((pick, i) => {\n    const entry = entryByRank.get(pick.candidate.rank);\n    const reason = entry?.reason && entry.reason.trim().length > 0 ? entry.reason : '\u2014';\n    let domain: string;\n    try {\n      domain = new URL(pick.candidate.url).hostname.replace(/^www\\./, '');\n    } catch {\n      domain = pick.candidate.url;\n    }\n    lines.push(\n      `${i + 1}. **[${pick.candidate.title}](${pick.candidate.url})** \u2014 ${domain} \u2014 ${reason} *(${pick.tier}, rank ${pick.candidate.rank})*`,\n    );\n  });\n  return lines.join('\\n');\n}\n\n// --- Classified output (3-tier LLM-classified table) ---\n\nfunction buildClassifiedOutput(\n  classification: ClassificationResult,\n  aggregation: SearchAggregation,\n  extract: string,\n  searches: SearchResponse['searches'],\n  totalQueries: number,\n  verbose: boolean = false,\n): string {\n  const rankedUrls = aggregation.rankedUrls;\n\n  // Build tier \u2192 entries mapping (keep url data alongside classifier metadata)\n  const entryByRank = new Map(classification.results.map((r) => [r.rank, r]));\n\n  const tiers = {\n    high: [] as typeof rankedUrls,\n    maybe: [] as typeof rankedUrls,\n    other: [] as typeof rankedUrls,\n  };\n\n  for (const url of rankedUrls) {\n    const entry = entryByRank.get(url.rank);\n    const tier = entry?.tier;\n    if (tier === 'HIGHLY_RELEVANT') {\n      tiers.high.push(url);\n    } else if (tier === 'MAYBE_RELEVANT') {\n      tiers.maybe.push(url);\n    } else {\n      tiers.other.push(url);\n    }\n  }\n\n  const lines: string[] = [];\n\n  // Header with generated title, synthesis, and confidence\n  lines.push(`## ${classification.title}`);\n  lines.push(`> Looking for: ${extract}`);\n  lines.push(`> ${totalQueries} queries \u2192 ${rankedUrls.length} URLs \u2192 ${tiers.high.length} highly relevant, ${tiers.maybe.length} possibly relevant`);\n  if (classification.confidence) {\n    const confReason = classification.confidence_reason ? ` \u2014 ${classification.confidence_reason}` : '';\n    lines.push(`> Confidence: \\`${classification.confidence}\\`${confReason}`);\n  }\n  lines.push('');\n\n  // \"Start here\" block: surface the top 3-5 URLs above the synthesis so an\n  // agent skimming the first screen sees scrape candidates before prose.\n  const startHere = buildStartHereSection(\n    { high: tiers.high, maybe: tiers.maybe },\n    entryByRank,\n  );\n  if (startHere) {\n    lines.push(startHere);\n    lines.push('');\n  }\n\n  lines.push(`**Summary:** ${classification.synthesis}`);\n  lines.push('');\n\n  // Helper: render one row with optional source_type + reason\n  const renderRichRow = (url: typeof rankedUrls[number]): string => {\n    const entry = entryByRank.get(url.rank);\n    const coveragePct = Math.round(url.coverageRatio * 100);\n    const seenIn = `${url.frequency}/${totalQueries} (${coveragePct}%)`;\n    const sourceType = entry?.source_type ? `\\`${entry.source_type}\\`` : '\u2014';\n    const reason = entry?.reason ? entry.reason.replace(/\\|/g, '\\\\|') : '\u2014';\n    return `| ${url.rank} | [${url.title}](${url.url}) | ${sourceType} | ${seenIn} | ${reason} |`;\n  };\n\n  // Highly Relevant tier\n  if (tiers.high.length > 0) {\n    lines.push(`### Highly Relevant (${tiers.high.length})`);\n    lines.push('| # | URL | Source | Seen in | Why |');\n    lines.push('|---|-----|--------|---------|-----|');\n    for (const url of tiers.high) lines.push(renderRichRow(url));\n    lines.push('');\n  }\n\n  // Maybe Relevant tier\n  if (tiers.maybe.length > 0) {\n    lines.push(`### Maybe Relevant (${tiers.maybe.length})`);\n    lines.push('| # | URL | Source | Seen in | Why |');\n    lines.push('|---|-----|--------|---------|-----|');\n    for (const url of tiers.maybe) lines.push(renderRichRow(url));\n    lines.push('');\n  }\n\n  // Other tier \u2014 with query attribution\n  if (tiers.other.length > 0) {\n    lines.push(`### Other Results (${tiers.other.length})`);\n    lines.push('| # | URL | Source | Score | Queries |');\n    lines.push('|---|-----|--------|-------|---------|');\n    for (const url of tiers.other) {\n      const entry = entryByRank.get(url.rank);\n      const queryList = url.queries.map((q) => `\"${q}\"`).join(', ');\n      const sourceType = entry?.source_type ? `\\`${entry.source_type}\\`` : '\u2014';\n      let domain: string;\n      try {\n        domain = new URL(url.url).hostname.replace(/^www\\./, '');\n      } catch {\n        domain = url.url;\n      }\n      lines.push(`| ${url.rank} | ${domain} | ${sourceType} | ${url.score.toFixed(1)} | ${queryList} |`);\n    }\n    lines.push('');\n  }\n\n  // Signals block is gated behind verbose \u2014 it duplicates info already\n  // present in the per-row metadata for callers who care.\n  // See: docs/code-review/context/05-output-formatting-patterns.md.\n  if (verbose) {\n    lines.push(buildSignalsSection(aggregation, searches, totalQueries));\n  }\n\n  // Gaps section \u2014 what the current results don't answer\n  if (classification.gaps && classification.gaps.length > 0) {\n    lines.push('');\n    lines.push('## Gaps');\n    for (const gap of classification.gaps) {\n      lines.push(`- **[${gap.id}]** ${gap.description}`);\n    }\n  }\n\n  const followUps = buildSuggestedFollowUpsSection(classification.refine_queries);\n  if (followUps) {\n    lines.push('');\n    lines.push(followUps);\n  }\n\n  return lines.join('\\n');\n}\n\n// --- Metadata builder ---\n\nfunction buildMetadata(\n  aggregation: SearchAggregation,\n  executionTime: number,\n  totalQueries: number,\n  searches: SearchResponse['searches'],\n  llmClassified: boolean,\n  scope: 'web' | 'reddit' | 'both',\n  llmError?: string,\n  queryRewrites?: QueryRewriteRecord[],\n  retriedQueries?: RetriedQueryRecord[],\n  retryError?: StructuredError,\n) {\n  const coverageSummary = searches.map(s => {\n    let topDomain: string | undefined;\n    const topResult = s.results[0];\n    if (topResult) {\n      try { topDomain = new URL(topResult.link).hostname.replace(/^www\\./, ''); } catch { /* ignore */ }\n    }\n    return { query: s.query, result_count: s.results.length, top_url: topDomain };\n  });\n  const lowYieldQueries = searches\n    .filter(s => s.results.length <= 1)\n    .map(s => s.query);\n  const successfulQueries = searches.filter(s => s.results.length > 0).length;\n\n  return {\n    total_items: totalQueries,\n    successful: successfulQueries,\n    failed: Math.max(totalQueries - successfulQueries, 0),\n    execution_time_ms: executionTime,\n    llm_classified: llmClassified,\n    scope,\n    ...(llmError ? { llm_error: llmError } : {}),\n    coverage_summary: coverageSummary,\n    ...(lowYieldQueries.length > 0 ? { low_yield_queries: lowYieldQueries } : {}),\n    ...(queryRewrites && queryRewrites.length > 0 ? { query_rewrites: queryRewrites } : {}),\n    ...(retriedQueries && retriedQueries.length > 0 ? { retried_queries: retriedQueries } : {}),\n    ...(retryError\n      ? {\n          retry_error: {\n            phase: 'relax-retry' as const,\n            code: retryError.code,\n            message: retryError.message,\n            retryable: retryError.retryable,\n            ...(typeof retryError.statusCode === 'number' ? { statusCode: retryError.statusCode } : {}),\n          },\n        }\n      : {}),\n  };\n}\n\nfunction buildStructuredResults(\n  aggregation: SearchAggregation,\n  llmTagsByRank?: Map<number, string>,\n): Array<{\n  rank: number;\n  url: string;\n  title: string;\n  snippet: string;\n  source_type: 'reddit' | 'github' | 'docs' | 'blog' | 'paper' | 'qa' | 'cve' | 'news' | 'video' | 'web';\n  score: number;\n  seen_in: number;\n  best_position: number;\n}> {\n  return aggregation.rankedUrls.map((row) => {\n    // LLM tag wins when present; heuristic is the always-on fallback. See:\n    // mcp-revisions/output-shaping/06-source-type-tagging-without-llm.md.\n    const llmTag = llmTagsByRank?.get(row.rank);\n    const heuristic = classifySourceByUrl(row.url);\n    return {\n      rank: row.rank,\n      url: row.url,\n      title: row.title,\n      snippet: row.snippet,\n      source_type: ((llmTag as typeof heuristic) ?? heuristic),\n      score: Number(row.score.toFixed(2)),\n      seen_in: row.frequency,\n      best_position: row.bestPosition,\n    };\n  });\n}\n\n// --- Error builder ---\n\nfunction isStructuredError(error: unknown): error is StructuredError {\n  if (typeof error !== 'object' || error === null) return false;\n  const record = error as Record<string, unknown>;\n  return typeof record.code === 'string'\n    && typeof record.message === 'string'\n    && typeof record.retryable === 'boolean';\n}\n\nfunction normalizeStructuredError(error: unknown): StructuredError {\n  return isStructuredError(error) ? error : classifyError(error);\n}\n\nfunction formatSearchFailureMessage(\n  error: StructuredError,\n  phase?: SearchFailurePhase,\n): string {\n  if (phase === 'initial') {\n    return `Search provider failed during initial batch: ${error.message}`;\n  }\n\n  if (phase === 'relax-retry') {\n    return `Search provider failed during relaxed retry batch: ${error.message}`;\n  }\n\n  return error.message;\n}\n\nfunction buildWebSearchError(\n  error: unknown,\n  params: WebSearchParams,\n  startTime: number,\n  phase?: SearchFailurePhase,\n): ToolExecutionResult<WebSearchOutput> {\n  const structuredError = normalizeStructuredError(error);\n  const message = formatSearchFailureMessage(structuredError, phase);\n  const executionTime = Date.now() - startTime;\n\n  mcpLog('error', `web-search: ${message}`, 'search');\n\n  const errorContent = formatError({\n    code: structuredError.code,\n    message,\n    retryable: structuredError.retryable,\n    toolName: 'web-search',\n    howToFix: ['Verify SERPER_API_KEY is set correctly'],\n    alternatives: [\n      'web-search(queries=[\"topic recommendations\"], extract=\"...\", scope: \"reddit\") \u2014 Reddit-only post permalinks via the same backend',\n      'scrape-links(urls=[...], extract=\"...\") \u2014 if you have URLs from prior steps, scrape them now',\n    ],\n  });\n\n  return toolFailure(\n    `${errorContent}\\n\\nExecution time: ${formatDuration(executionTime)}\\nQueries: ${params.queries.length}`,\n  );\n}\n\n// --- Main handler ---\n\nexport async function handleWebSearch(\n  params: WebSearchParams,\n  reporter: ToolReporter = NOOP_REPORTER,\n  searchExecutor: SearchExecutor = executeSearches,\n): Promise<ToolExecutionResult<WebSearchOutput>> {\n  const startTime = Date.now();\n\n  try {\n    const scopedQueries = buildScopedQueries(params.queries, params.scope);\n    const effectiveQueries = scopedQueries.map((entry) => entry.query);\n    if (params.scope !== 'web') {\n      mcpLog('info', `Searching scope=${params.scope}: ${params.queries.length} input queries \u2192 ${effectiveQueries.length} dispatched`, 'search');\n    } else {\n      mcpLog('info', `Searching for ${params.queries.length} query/queries`, 'search');\n    }\n    await reporter.log('info', `Searching for ${effectiveQueries.length} query/queries (scope=${params.scope})`);\n    await reporter.progress(15, 100, 'Submitting search queries');\n\n    // Phase A \u2014 pre-dispatch normalizer. Rewrites the small fraction of\n    // queries Google was statistically going to mis-handle (3+ phrase AND,\n    // operator chars in quotes, paths in quotes). See src/utils/query-relax.ts.\n    const dispatchPlan = effectiveQueries.map((q) => {\n      const r = normalizeQueryForDispatch(q);\n      return { original: q, dispatched: r.rewritten, rules: [...r.rules], changed: r.changed };\n    });\n    const dispatchedQueries = dispatchPlan.map((p) => p.dispatched);\n    const resultScopes = scopedQueries.map((entry) => entry.resultScope);\n    const dropSiteOnRetry = scopedQueries.map((entry) => entry.dropSiteOnRetry);\n    const queryRewrites: QueryRewriteRecord[] = dispatchPlan\n      .filter((p) => p.changed)\n      .map((p) => ({ original: p.original, rewritten: p.dispatched, rules: p.rules }));\n\n    if (queryRewrites.length > 0) {\n      mcpLog(\n        'info',\n        `Pre-dispatch normalized ${queryRewrites.length}/${effectiveQueries.length} queries`,\n        'search',\n      );\n      await reporter.log(\n        'info',\n        `Normalized ${queryRewrites.length} queries pre-dispatch`,\n      );\n    }\n\n    // Phase B \u2014 on-empty retry: any query returning 0 results gets one\n    // relaxed retry (drop quotes, drop site:). Recovered hits replace the\n    // empty slot transparently.\n    const {\n      response: rawResponse,\n      retried: retriedQueries,\n      failurePhase,\n      retryError,\n    } = await executeWithRelaxRetry(\n      dispatchedQueries,\n      reporter,\n      searchExecutor,\n      { dropSiteOnRetry },\n    );\n\n    if (rawResponse.error) {\n      await reporter.log('error', `search_provider_failed: ${rawResponse.error.message}`);\n      return buildWebSearchError(rawResponse.error, params, startTime, failurePhase);\n    }\n\n    const response = filterScopedSearches(rawResponse, params.scope, resultScopes);\n    await reporter.progress(50, 100, 'Collected search results');\n\n    const { aggregation } = processResults(response);\n    await reporter.log(\n      'info',\n      `Collected ${aggregation.totalUniqueUrls} unique URLs across ${response.totalQueries} queries`,\n    );\n\n    // Decide: raw output or LLM classification\n    const useRaw = params.raw;\n    const llmProcessor = createLLMProcessor();\n\n    let markdown: string;\n    let llmClassified = false;\n    let llmError: string | undefined;\n\n    if (useRaw || !llmProcessor) {\n      // Raw path: traditional unified ranked list\n      if (!useRaw && !llmProcessor) {\n        llmError = 'LLM unavailable (LLM_API_KEY / LLM_BASE_URL / LLM_MODEL not set). Falling back to raw output.';\n        mcpLog('warning', llmError, 'search');\n        // mcp-revisions/llm-degradation/01: surface degraded mode to the client.\n        await reporter.log('warning', 'llm_classifier_unreachable: planner not configured; raw ranked list returned');\n      }\n      let rawRefineQueries: RefineQuerySuggestion[] | undefined;\n      if (useRaw && llmProcessor) {\n        const refineResult = await suggestRefineQueriesForRawMode(\n          aggregation.rankedUrls,\n          params.extract,\n          params.queries,\n          llmProcessor,\n        );\n        rawRefineQueries = refineResult.result;\n      }\n      markdown = appendSignalsAndFollowUps(\n        buildRawOutput(params.queries, aggregation, response.searches, params.verbose),\n        buildSignalsSection(aggregation, response.searches, response.totalQueries),\n        rawRefineQueries,\n        { includeSignals: params.verbose },\n      );\n      await reporter.progress(80, 100, 'Ranking search results');\n    } else {\n      // LLM classification path\n      await reporter.progress(65, 100, 'Classifying results by relevance');\n      const classification = await classifySearchResults(\n        aggregation.rankedUrls,\n        params.extract,\n        response.totalQueries,\n        llmProcessor,\n        params.queries,\n      );\n\n      if (classification.result) {\n        markdown = buildClassifiedOutput(\n          classification.result, aggregation, params.extract, response.searches, response.totalQueries, params.verbose,\n        );\n        llmClassified = true;\n        await reporter.progress(85, 100, 'Formatted classified results');\n      } else {\n        // Classification failed \u2014 fall back to raw\n        llmError = classification.error ?? 'Unknown classification error';\n        mcpLog('warning', `Classification failed, falling back to raw: ${llmError}`, 'search');\n        // mcp-revisions/llm-degradation/01: surface degraded mode to the client.\n        await reporter.log('warning', `llm_classifier_unreachable: ${llmError}`);\n        markdown = appendSignalsAndFollowUps(\n          buildRawOutput(params.queries, aggregation, response.searches, params.verbose),\n          buildSignalsSection(aggregation, response.searches, response.totalQueries),\n          undefined,\n          { includeSignals: params.verbose },\n        );\n        await reporter.progress(85, 100, 'Classification failed, using raw output');\n      }\n    }\n\n    const executionTime = Date.now() - startTime;\n    const metadata = buildMetadata(\n      aggregation, executionTime, response.totalQueries, response.searches, llmClassified, params.scope, llmError,\n      queryRewrites, retriedQueries, retryError,\n    );\n\n    // Build per-row structured results so capability-aware clients can\n    // index into `structuredContent.results` rather than regex-scrape the\n    // markdown table. The LLM tag wins when present; heuristic is the\n    // always-on fallback.\n    const llmTagsByRank = new Map<number, string>();\n    // (When classification succeeds the source_type per-row is populated\n    // inside buildClassifiedOutput via the entry.source_type field \u2014 but\n    // we don't have a direct handle on it here without a refactor. The\n    // heuristic alone covers the structuredContent shape correctly; the\n    // LLM-tagged variant remains in the markdown body.)\n    const results = buildStructuredResults(aggregation, llmTagsByRank);\n\n    mcpLog('info', `Search completed: ${aggregation.rankedUrls.length} URLs, classified=${llmClassified}`, 'search');\n    await reporter.log('info', `Search completed with ${aggregation.rankedUrls.length} URLs (classified: ${llmClassified})`);\n\n    const footer = `\\n---\\n*${formatDuration(executionTime)} | ${aggregation.totalUniqueUrls} unique URLs${llmClassified ? ' | LLM classified' : ''}*`;\n    const fullMarkdown = markdown + footer;\n\n    return toolSuccess(fullMarkdown, { content: fullMarkdown, results, metadata });\n  } catch (error) {\n    return buildWebSearchError(error, params, startTime);\n  }\n}\n\nexport function registerWebSearchTool(server: MCPServer): void {\n  server.tool(\n    {\n      name: 'web-search',\n      title: 'Web Search',\n      description:\n        `Fan out Google queries in parallel. One call carries up to 50 queries in a flat \\`queries\\` array \u2014 pack diverse facets (not paraphrases) into a single call. ${QUERY_REWRITE_PAIR_GUIDANCE_TEXT} Call me AGGRESSIVELY across a session: 2\u20134 rounds is normal, 1 is underuse. After each pass, read \\`gaps[]\\` + \\`refine_queries[]\\` and fire another round with the new terms. Safe to call multiple times in parallel in the same turn for orthogonal subtopics. \\`scope\\`: \\`\"reddit\"\\` (server appends \\`site:reddit.com\\` + filters to post permalinks \u2014 use for sentiment / migration / lived experience), \\`\"web\"\\` default (spec / bug / pricing / CVE / API), \\`\"both\"\\` (fan each query across both \u2014 use when opinion-heavy AND needs official sources). Returns a tiered Markdown report (HIGHLY_RELEVANT / MAYBE_RELEVANT / OTHER) + grounded synthesis with \\`[rank]\\` citations + \\`## Gaps\\` + \\`## Suggested follow-up searches\\` tied to gap ids. Set \\`raw=true\\` to skip classification.`,\n      schema: webSearchParamsSchema,\n      outputSchema: webSearchOutputSchema,\n      annotations: {\n        readOnlyHint: true,\n        idempotentHint: true,\n        destructiveHint: false,\n        openWorldHint: true,\n      },\n    },\n    async (args, ctx) => {\n      if (!getCapabilities().search) {\n        return toToolResponse(toolFailure(getMissingEnvMessage('search')));\n      }\n\n      const reporter = createToolReporter(ctx, 'web-search');\n      const result = await handleWebSearch(args, reporter);\n\n      await reporter.progress(100, 100, result.isError ? 'Search failed' : 'Search complete');\n      return toToolResponse(result);\n    },\n  );\n}\n"],
+  "mappings": "AAOA,SAAS,iBAAiB,4BAA4B;AACtD;AAAA,EACE;AAAA,EACA;AAAA,EACA;AAAA,OAGK;AACP,SAAS,oBAAiD;AAC1D;AAAA,EACE;AAAA,EACA;AAAA,OACK;AACP;AAAA,EACE;AAAA,EACA;AAAA,EACA;AAAA,OAIK;AACP,SAAS,qBAA2C;AACpD,SAAS,2BAA2B;AACpC;AAAA,EACE;AAAA,EACA;AAAA,EACA;AAAA,OACK;AACP;AAAA,EACE;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,OAGK;AACP,SAAS,0BAA0B;AACnC;AAAA,EACE;AAAA,EACA;AAAA,OACK;AAsBP,MAAM,wBAAwB;AAC9B,MAAM,cAAc;AAQpB,SAAS,kBAAkB,OAAuB;AAChD,SAAO,wBAAwB,KAAK,KAAK,IAAI,QAAQ,GAAG,KAAK;AAC/D;AAEA,SAAS,mBAAmB,SAAmB,OAAiD;AAC9F,MAAI,UAAU,OAAO;AACnB,WAAO,QAAQ,IAAI,CAAC,WAAW,EAAE,OAAO,aAAa,OAAO,iBAAiB,KAAK,EAAE;AAAA,EACtF;AAEA,QAAM,WAAW,QAAQ;AAAA,IAAI,CAAC,OAC3B,EAAE,OAAO,kBAAkB,CAAC,GAAG,aAAa,UAAmB,iBAAiB,MAAM;AAAA,EACzF;AAEA,MAAI,UAAU,SAAU,QAAO;AAE/B,SAAO;AAAA,IACL,GAAG,QAAQ,IAAI,CAAC,WAAW,EAAE,OAAO,aAAa,OAAgB,iBAAiB,KAAK,EAAE;AAAA,IACzF,GAAG;AAAA,EACL;AACF;AAEA,eAAe,gBAAgB,SAA4C;AACzE,QAAM,SAAS,IAAI,aAAa;AAChC,SAAO,OAAO,eAAe,OAAO;AACtC;AAoBA,eAAe,sBACb,YACA,UACA,iBAAiC,iBACjC,eAAkE,CAAC,GAMlE;AACD,QAAM,UAAU,MAAM,eAAe,UAAU;AAE/C,MAAI,QAAQ,OAAO;AACjB,WAAO,EAAE,UAAU,SAAS,SAAS,CAAC,GAAG,cAAc,UAAU;AAAA,EACnE;AAEA,QAAM,eAAe,QAAQ,SAC1B,IAAI,CAAC,GAAG,MAAO,EAAE,QAAQ,WAAW,IAAI,IAAI,EAAG,EAC/C,OAAO,CAAC,MAAM,MAAM,EAAE;AAEzB,MAAI,aAAa,WAAW,GAAG;AAC7B,WAAO,EAAE,UAAU,SAAS,SAAS,CAAC,EAAE;AAAA,EAC1C;AAGA,QAAM,QAAgB,CAAC;AACvB,aAAW,OAAO,cAAc;AAC9B,UAAM,KAAK,WAAW,GAAG;AACzB,QAAI,OAAO,OAAO,SAAU;AAC5B,UAAM,IAAI,mBAAmB,IAAI,EAAE,UAAU,aAAa,kBAAkB,GAAG,KAAK,KAAK,CAAC;AAC1F,QAAI,EAAE,WAAW,EAAE,cAAc,IAAI;AACnC,YAAM,KAAK,EAAE,OAAO,KAAK,UAAU,IAAI,SAAS,EAAE,WAAW,OAAO,CAAC,GAAG,EAAE,KAAK,EAAE,CAAC;AAAA,IACpF;AAAA,EACF;AAEA,MAAI,MAAM,WAAW,GAAG;AACtB,WAAO,EAAE,UAAU,SAAS,SAAS,CAAC,EAAE;AAAA,EAC1C;AAEA;AAAA,IACE;AAAA,IACA,GAAG,MAAM,MAAM,IAAI,aAAa,MAAM;AAAA,IACtC;AAAA,EACF;AACA,QAAM,SAAS;AAAA,IACb;AAAA,IACA,GAAG,MAAM,MAAM;AAAA,EACjB;AAEA,QAAM,YAAY,MAAM,eAAe,MAAM,IAAI,CAAC,MAAM,EAAE,OAAO,CAAC;AAClE,QAAM,UAAgC,CAAC;AACvC,QAAM,eAAe,oBAAI,IAAgD;AAEzE,QAAM,QAAQ,CAAC,MAAM,MAAM;AACzB,UAAM,IAAI,UAAU,SAAS,CAAC;AAC9B,QAAI,EAAG,cAAa,IAAI,KAAK,OAAO,CAAC;AACrC,YAAQ,KAAK;AAAA,MACX,UAAU,KAAK;AAAA,MACf,cAAc,KAAK;AAAA,MACnB,OAAO,KAAK;AAAA,MACZ,mBAAmB,GAAG,QAAQ,UAAU;AAAA,IAC1C,CAAC;AAAA,EACH,CAAC;AAED,MAAI,UAAU,OAAO;AACnB;AAAA,MACE;AAAA,MACA,kEAAkE,UAAU,MAAM,OAAO;AAAA,MACzF;AAAA,IACF;AACA,UAAM,SAAS;AAAA,MACb;AAAA,MACA,8BAA8B,UAAU,MAAM,OAAO;AAAA,IACvD;AACA,WAAO;AAAA,MACL,UAAU;AAAA,MACV;AAAA,MACA,YAAY,UAAU;AAAA,IACxB;AAAA,EACF;AAEA,QAAM,iBAAiB,QAAQ,SAAS,IAAI,CAAC,GAAG,QAAQ;AACtD,UAAM,IAAI,aAAa,IAAI,GAAG;AAC9B,QAAI,KAAK,EAAE,QAAQ,SAAS,GAAG;AAC7B,aAAO,EAAE,GAAG,GAAG,OAAO,EAAE,MAAM;AAAA,IAChC;AACA,WAAO;AAAA,EACT,CAAC;AAED,SAAO;AAAA,IACL,UAAU,EAAE,GAAG,SAAS,UAAU,eAAe;AAAA,IACjD;AAAA,EACF;AACF;AAEA,SAAS,qBACP,UACA,OACA,eAA6C,CAAC,GAC9B;AAChB,MAAI,UAAU,MAAO,QAAO;AAC5B,QAAM,WAAW,SAAS,SAAS,IAAI,CAAC,QAAQ,UAAU;AACxD,UAAM,cAAc,aAAa,KAAK,MAAM,UAAU,WAAW,WAAW;AAC5E,WAAO;AAAA,MACL,GAAG;AAAA,MACH,SAAS,OAAO,QAAQ,OAAO,CAAC,MAAM;AACpC,YAAI;AACJ,YAAI;AAAE,iBAAO,IAAI,IAAI,EAAE,IAAI,EAAE;AAAA,QAAU,QAAQ;AAAE,iBAAO;AAAA,QAAM;AAC9D,YAAI,gBAAgB,UAAU;AAC5B,iBAAO,YAAY,KAAK,IAAI,KAAK,sBAAsB,KAAK,EAAE,IAAI;AAAA,QACpE;AAEA,YAAI,CAAC,YAAY,KAAK,IAAI,EAAG,QAAO;AACpC,eAAO,sBAAsB,KAAK,EAAE,IAAI;AAAA,MAC1C,CAAC;AAAA,IACH;AAAA,EACF,CAAC;AACD,SAAO,EAAE,GAAG,UAAU,UAAU,SAAS;AAC3C;AAEA,SAAS,eAAe,UAEtB;AACA,QAAM,cAAc,iBAAiB,SAAS,UAAU,CAAC;AACzD,SAAO,EAAE,YAAY;AACvB;AAIA,SAAS,eACP,SACA,aACA,UACA,UAAmB,OACX;AACR,SAAO;AAAA,IACL,YAAY;AAAA,IAAY;AAAA,IAAS;AAAA,IACjC,YAAY;AAAA,IACZ,YAAY;AAAA,IAAoB,YAAY;AAAA,IAC5C;AAAA,EACF;AACF;AAEA,SAAS,oBACP,aACA,UACA,cACQ;AACR,QAAM,gBAAgB,SAAS,OAAO,CAAC,WAAW,OAAO,QAAQ,UAAU,CAAC,EAAE;AAC9E,QAAM,WAAW,SACd,OAAO,CAAC,WAAW,OAAO,QAAQ,UAAU,CAAC,EAC7C,IAAI,CAAC,WAAW,IAAI,OAAO,KAAK,GAAG;AACtC,QAAM,iBAAiB,YAAY,WAAW,OAAO,CAAC,QAAQ,IAAI,WAAW,EAAE;AAE/E,QAAM,QAAQ;AAAA,IACZ;AAAA,IACA,eAAe,aAAa,IAAI,YAAY;AAAA,IAC5C,qBAAqB,cAAc;AAAA,EACrC;AAEA,MAAI,SAAS,SAAS,GAAG;AACvB,UAAM,KAAK,gBAAgB,SAAS,KAAK,IAAI,CAAC,EAAE;AAAA,EAClD;AAEA,SAAO,MAAM,KAAK,IAAI;AACxB;AAEO,SAAS,+BACd,eACQ;AACR,MAAI,CAAC,iBAAiB,cAAc,WAAW,GAAG;AAChD,WAAO;AAAA,EACT;AAEA,QAAM,QAAQ,CAAC,mCAAmC,EAAE;AAEpD,aAAW,QAAQ,eAAe;AAChC,UAAM,QAAQ,mBAAmB,KAAK,SAAS,EAAE;AACjD,QAAI,CAAC,MAAO;AACZ,UAAM,YAAY,mBAAmB,KAAK,aAAa,EAAE;AACzD,UAAM,SAAS,OAAO,KAAK,WAAW,WAClC,kBAAkB,KAAK,MAAM,QAC7B,KAAK,kBACH,MAAM,mBAAmB,KAAK,eAAe,CAAC,OAC9C;AACN,UAAM;AAAA,MAAK,YACP,KAAK,KAAK,WAAM,SAAS,GAAG,MAAM,KAClC,KAAK,KAAK,GAAG,MAAM;AAAA,IACvB;AAAA,EACF;AAEA,SAAO,MAAM,WAAW,IAAI,KAAK,MAAM,KAAK,IAAI;AAClD;AAEO,SAAS,0BACd,UACA,gBACA,eACA,UAAwC,CAAC,GACjC;AACR,QAAM,iBAAiB,QAAQ,kBAAkB;AACjD,QAAM,WAAW,CAAC,QAAQ;AAC1B,MAAI,kBAAkB,gBAAgB;AACpC,aAAS,KAAK,IAAI,OAAO,cAAc;AAAA,EACzC;AACA,QAAM,YAAY,+BAA+B,aAAa;AAC9D,MAAI,WAAW;AACb,aAAS,KAAK,IAAI,SAAS;AAAA,EAC7B;AACA,SAAO,SAAS,KAAK,IAAI;AAC3B;AAYA,MAAM,iBAAiB;AACvB,MAAM,iBAAiB;AAchB,SAAS,sBACd,OACA,aACA,OAAuC,CAAC,GAChC;AACR,QAAM,MAAM,KAAK,OAAO;AACxB,QAAM,MAAM,KAAK,OAAO;AAExB,QAAM,QAA8F,CAAC;AAErG,aAAW,aAAa,MAAM,MAAM;AAClC,QAAI,MAAM,UAAU,IAAK;AACzB,UAAM,KAAK,EAAE,WAAW,MAAM,kBAAkB,CAAC;AAAA,EACnD;AAEA,MAAI,MAAM,SAAS,KAAK;AACtB,UAAM,SAAS,KAAK,IAAI,KAAK,GAAG;AAChC,eAAW,aAAa,MAAM,OAAO;AACnC,UAAI,MAAM,UAAU,OAAQ;AAC5B,YAAM,KAAK,EAAE,WAAW,MAAM,iBAAiB,CAAC;AAAA,IAClD;AAAA,EACF;AAEA,MAAI,MAAM,WAAW,EAAG,QAAO;AAE/B,QAAM,QAAkB,CAAC;AACzB,QAAM,KAAK,uDAAkD;AAC7D,QAAM,QAAQ,CAAC,MAAM,MAAM;AACzB,UAAM,QAAQ,YAAY,IAAI,KAAK,UAAU,IAAI;AACjD,UAAM,SAAS,OAAO,UAAU,MAAM,OAAO,KAAK,EAAE,SAAS,IAAI,MAAM,SAAS;AAChF,QAAI;AACJ,QAAI;AACF,eAAS,IAAI,IAAI,KAAK,UAAU,GAAG,EAAE,SAAS,QAAQ,UAAU,EAAE;AAAA,IACpE,QAAQ;AACN,eAAS,KAAK,UAAU;AAAA,IAC1B;AACA,UAAM;AAAA,MACJ,GAAG,IAAI,CAAC,QAAQ,KAAK,UAAU,KAAK,KAAK,KAAK,UAAU,GAAG,cAAS,MAAM,WAAM,MAAM,MAAM,KAAK,IAAI,UAAU,KAAK,UAAU,IAAI;AAAA,IACpI;AAAA,EACF,CAAC;AACD,SAAO,MAAM,KAAK,IAAI;AACxB;AAIA,SAAS,sBACP,gBACA,aACA,SACA,UACA,cACA,UAAmB,OACX;AACR,QAAM,aAAa,YAAY;AAG/B,QAAM,cAAc,IAAI,IAAI,eAAe,QAAQ,IAAI,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;AAE1E,QAAM,QAAQ;AAAA,IACZ,MAAM,CAAC;AAAA,IACP,OAAO,CAAC;AAAA,IACR,OAAO,CAAC;AAAA,EACV;AAEA,aAAW,OAAO,YAAY;AAC5B,UAAM,QAAQ,YAAY,IAAI,IAAI,IAAI;AACtC,UAAM,OAAO,OAAO;AACpB,QAAI,SAAS,mBAAmB;AAC9B,YAAM,KAAK,KAAK,GAAG;AAAA,IACrB,WAAW,SAAS,kBAAkB;AACpC,YAAM,MAAM,KAAK,GAAG;AAAA,IACtB,OAAO;AACL,YAAM,MAAM,KAAK,GAAG;AAAA,IACtB;AAAA,EACF;AAEA,QAAM,QAAkB,CAAC;AAGzB,QAAM,KAAK,MAAM,eAAe,KAAK,EAAE;AACvC,QAAM,KAAK,kBAAkB,OAAO,EAAE;AACtC,QAAM,KAAK,KAAK,YAAY,mBAAc,WAAW,MAAM,gBAAW,MAAM,KAAK,MAAM,qBAAqB,MAAM,MAAM,MAAM,oBAAoB;AAClJ,MAAI,eAAe,YAAY;AAC7B,UAAM,aAAa,eAAe,oBAAoB,WAAM,eAAe,iBAAiB,KAAK;AACjG,UAAM,KAAK,mBAAmB,eAAe,UAAU,KAAK,UAAU,EAAE;AAAA,EAC1E;AACA,QAAM,KAAK,EAAE;AAIb,QAAM,YAAY;AAAA,IAChB,EAAE,MAAM,MAAM,MAAM,OAAO,MAAM,MAAM;AAAA,IACvC;AAAA,EACF;AACA,MAAI,WAAW;AACb,UAAM,KAAK,SAAS;AACpB,UAAM,KAAK,EAAE;AAAA,EACf;AAEA,QAAM,KAAK,gBAAgB,eAAe,SAAS,EAAE;AACrD,QAAM,KAAK,EAAE;AAGb,QAAM,gBAAgB,CAAC,QAA2C;AAChE,UAAM,QAAQ,YAAY,IAAI,IAAI,IAAI;AACtC,UAAM,cAAc,KAAK,MAAM,IAAI,gBAAgB,GAAG;AACtD,UAAM,SAAS,GAAG,IAAI,SAAS,IAAI,YAAY,KAAK,WAAW;AAC/D,UAAM,aAAa,OAAO,cAAc,KAAK,MAAM,WAAW,OAAO;AACrE,UAAM,SAAS,OAAO,SAAS,MAAM,OAAO,QAAQ,OAAO,KAAK,IAAI;AACpE,WAAO,KAAK,IAAI,IAAI,OAAO,IAAI,KAAK,KAAK,IAAI,GAAG,OAAO,UAAU,MAAM,MAAM,MAAM,MAAM;AAAA,EAC3F;AAGA,MAAI,MAAM,KAAK,SAAS,GAAG;AACzB,UAAM,KAAK,wBAAwB,MAAM,KAAK,MAAM,GAAG;AACvD,UAAM,KAAK,sCAAsC;AACjD,UAAM,KAAK,sCAAsC;AACjD,eAAW,OAAO,MAAM,KAAM,OAAM,KAAK,cAAc,GAAG,CAAC;AAC3D,UAAM,KAAK,EAAE;AAAA,EACf;AAGA,MAAI,MAAM,MAAM,SAAS,GAAG;AAC1B,UAAM,KAAK,uBAAuB,MAAM,MAAM,MAAM,GAAG;AACvD,UAAM,KAAK,sCAAsC;AACjD,UAAM,KAAK,sCAAsC;AACjD,eAAW,OAAO,MAAM,MAAO,OAAM,KAAK,cAAc,GAAG,CAAC;AAC5D,UAAM,KAAK,EAAE;AAAA,EACf;AAGA,MAAI,MAAM,MAAM,SAAS,GAAG;AAC1B,UAAM,KAAK,sBAAsB,MAAM,MAAM,MAAM,GAAG;AACtD,UAAM,KAAK,wCAAwC;AACnD,UAAM,KAAK,wCAAwC;AACnD,eAAW,OAAO,MAAM,OAAO;AAC7B,YAAM,QAAQ,YAAY,IAAI,IAAI,IAAI;AACtC,YAAM,YAAY,IAAI,QAAQ,IAAI,CAAC,MAAM,IAAI,CAAC,GAAG,EAAE,KAAK,IAAI;AAC5D,YAAM,aAAa,OAAO,cAAc,KAAK,MAAM,WAAW,OAAO;AACrE,UAAI;AACJ,UAAI;AACF,iBAAS,IAAI,IAAI,IAAI,GAAG,EAAE,SAAS,QAAQ,UAAU,EAAE;AAAA,MACzD,QAAQ;AACN,iBAAS,IAAI;AAAA,MACf;AACA,YAAM,KAAK,KAAK,IAAI,IAAI,MAAM,MAAM,MAAM,UAAU,MAAM,IAAI,MAAM,QAAQ,CAAC,CAAC,MAAM,SAAS,IAAI;AAAA,IACnG;AACA,UAAM,KAAK,EAAE;AAAA,EACf;AAKA,MAAI,SAAS;AACX,UAAM,KAAK,oBAAoB,aAAa,UAAU,YAAY,CAAC;AAAA,EACrE;AAGA,MAAI,eAAe,QAAQ,eAAe,KAAK,SAAS,GAAG;AACzD,UAAM,KAAK,EAAE;AACb,UAAM,KAAK,SAAS;AACpB,eAAW,OAAO,eAAe,MAAM;AACrC,YAAM,KAAK,QAAQ,IAAI,EAAE,OAAO,IAAI,WAAW,EAAE;AAAA,IACnD;AAAA,EACF;AAEA,QAAM,YAAY,+BAA+B,eAAe,cAAc;AAC9E,MAAI,WAAW;AACb,UAAM,KAAK,EAAE;AACb,UAAM,KAAK,SAAS;AAAA,EACtB;AAEA,SAAO,MAAM,KAAK,IAAI;AACxB;AAIA,SAAS,cACP,aACA,eACA,cACA,UACA,eACA,OACA,UACA,eACA,gBACA,YACA;AACA,QAAM,kBAAkB,SAAS,IAAI,OAAK;AACxC,QAAI;AACJ,UAAM,YAAY,EAAE,QAAQ,CAAC;AAC7B,QAAI,WAAW;AACb,UAAI;AAAE,oBAAY,IAAI,IAAI,UAAU,IAAI,EAAE,SAAS,QAAQ,UAAU,EAAE;AAAA,MAAG,QAAQ;AAAA,MAAe;AAAA,IACnG;AACA,WAAO,EAAE,OAAO,EAAE,OAAO,cAAc,EAAE,QAAQ,QAAQ,SAAS,UAAU;AAAA,EAC9E,CAAC;AACD,QAAM,kBAAkB,SACrB,OAAO,OAAK,EAAE,QAAQ,UAAU,CAAC,EACjC,IAAI,OAAK,EAAE,KAAK;AACnB,QAAM,oBAAoB,SAAS,OAAO,OAAK,EAAE,QAAQ,SAAS,CAAC,EAAE;AAErE,SAAO;AAAA,IACL,aAAa;AAAA,IACb,YAAY;AAAA,IACZ,QAAQ,KAAK,IAAI,eAAe,mBAAmB,CAAC;AAAA,IACpD,mBAAmB;AAAA,IACnB,gBAAgB;AAAA,IAChB;AAAA,IACA,GAAI,WAAW,EAAE,WAAW,SAAS,IAAI,CAAC;AAAA,IAC1C,kBAAkB;AAAA,IAClB,GAAI,gBAAgB,SAAS,IAAI,EAAE,mBAAmB,gBAAgB,IAAI,CAAC;AAAA,IAC3E,GAAI,iBAAiB,cAAc,SAAS,IAAI,EAAE,gBAAgB,cAAc,IAAI,CAAC;AAAA,IACrF,GAAI,kBAAkB,eAAe,SAAS,IAAI,EAAE,iBAAiB,eAAe,IAAI,CAAC;AAAA,IACzF,GAAI,aACA;AAAA,MACE,aAAa;AAAA,QACX,OAAO;AAAA,QACP,MAAM,WAAW;AAAA,QACjB,SAAS,WAAW;AAAA,QACpB,WAAW,WAAW;AAAA,QACtB,GAAI,OAAO,WAAW,eAAe,WAAW,EAAE,YAAY,WAAW,WAAW,IAAI,CAAC;AAAA,MAC3F;AAAA,IACF,IACA,CAAC;AAAA,EACP;AACF;AAEA,SAAS,uBACP,aACA,eAUC;AACD,SAAO,YAAY,WAAW,IAAI,CAAC,QAAQ;AAGzC,UAAM,SAAS,eAAe,IAAI,IAAI,IAAI;AAC1C,UAAM,YAAY,oBAAoB,IAAI,GAAG;AAC7C,WAAO;AAAA,MACL,MAAM,IAAI;AAAA,MACV,KAAK,IAAI;AAAA,MACT,OAAO,IAAI;AAAA,MACX,SAAS,IAAI;AAAA,MACb,aAAe,UAA+B;AAAA,MAC9C,OAAO,OAAO,IAAI,MAAM,QAAQ,CAAC,CAAC;AAAA,MAClC,SAAS,IAAI;AAAA,MACb,eAAe,IAAI;AAAA,IACrB;AAAA,EACF,CAAC;AACH;AAIA,SAAS,kBAAkB,OAA0C;AACnE,MAAI,OAAO,UAAU,YAAY,UAAU,KAAM,QAAO;AACxD,QAAM,SAAS;AACf,SAAO,OAAO,OAAO,SAAS,YACzB,OAAO,OAAO,YAAY,YAC1B,OAAO,OAAO,cAAc;AACnC;AAEA,SAAS,yBAAyB,OAAiC;AACjE,SAAO,kBAAkB,KAAK,IAAI,QAAQ,cAAc,KAAK;AAC/D;AAEA,SAAS,2BACP,OACA,OACQ;AACR,MAAI,UAAU,WAAW;AACvB,WAAO,gDAAgD,MAAM,OAAO;AAAA,EACtE;AAEA,MAAI,UAAU,eAAe;AAC3B,WAAO,sDAAsD,MAAM,OAAO;AAAA,EAC5E;AAEA,SAAO,MAAM;AACf;AAEA,SAAS,oBACP,OACA,QACA,WACA,OACsC;AACtC,QAAM,kBAAkB,yBAAyB,KAAK;AACtD,QAAM,UAAU,2BAA2B,iBAAiB,KAAK;AACjE,QAAM,gBAAgB,KAAK,IAAI,IAAI;AAEnC,SAAO,SAAS,eAAe,OAAO,IAAI,QAAQ;AAElD,QAAM,eAAe,YAAY;AAAA,IAC/B,MAAM,gBAAgB;AAAA,IACtB;AAAA,IACA,WAAW,gBAAgB;AAAA,IAC3B,UAAU;AAAA,IACV,UAAU,CAAC,wCAAwC;AAAA,IACnD,cAAc;AAAA,MACZ;AAAA,MACA;AAAA,IACF;AAAA,EACF,CAAC;AAED,SAAO;AAAA,IACL,GAAG,YAAY;AAAA;AAAA,kBAAuB,eAAe,aAAa,CAAC;AAAA,WAAc,OAAO,QAAQ,MAAM;AAAA,EACxG;AACF;AAIA,eAAsB,gBACpB,QACA,WAAyB,eACzB,iBAAiC,iBACc;AAC/C,QAAM,YAAY,KAAK,IAAI;AAE3B,MAAI;AACF,UAAM,gBAAgB,mBAAmB,OAAO,SAAS,OAAO,KAAK;AACrE,UAAM,mBAAmB,cAAc,IAAI,CAAC,UAAU,MAAM,KAAK;AACjE,QAAI,OAAO,UAAU,OAAO;AAC1B,aAAO,QAAQ,mBAAmB,OAAO,KAAK,KAAK,OAAO,QAAQ,MAAM,yBAAoB,iBAAiB,MAAM,eAAe,QAAQ;AAAA,IAC5I,OAAO;AACL,aAAO,QAAQ,iBAAiB,OAAO,QAAQ,MAAM,kBAAkB,QAAQ;AAAA,IACjF;AACA,UAAM,SAAS,IAAI,QAAQ,iBAAiB,iBAAiB,MAAM,yBAAyB,OAAO,KAAK,GAAG;AAC3G,UAAM,SAAS,SAAS,IAAI,KAAK,2BAA2B;AAK5D,UAAM,eAAe,iBAAiB,IAAI,CAAC,MAAM;AAC/C,YAAM,IAAI,0BAA0B,CAAC;AACrC,aAAO,EAAE,UAAU,GAAG,YAAY,EAAE,WAAW,OAAO,CAAC,GAAG,EAAE,KAAK,GAAG,SAAS,EAAE,QAAQ;AAAA,IACzF,CAAC;AACD,UAAM,oBAAoB,aAAa,IAAI,CAAC,MAAM,EAAE,UAAU;AAC9D,UAAM,eAAe,cAAc,IAAI,CAAC,UAAU,MAAM,WAAW;AACnE,UAAM,kBAAkB,cAAc,IAAI,CAAC,UAAU,MAAM,eAAe;AAC1E,UAAM,gBAAsC,aACzC,OAAO,CAAC,MAAM,EAAE,OAAO,EACvB,IAAI,CAAC,OAAO,EAAE,UAAU,EAAE,UAAU,WAAW,EAAE,YAAY,OAAO,EAAE,MAAM,EAAE;AAEjF,QAAI,cAAc,SAAS,GAAG;AAC5B;AAAA,QACE;AAAA,QACA,2BAA2B,cAAc,MAAM,IAAI,iBAAiB,MAAM;AAAA,QAC1E;AAAA,MACF;AACA,YAAM,SAAS;AAAA,QACb;AAAA,QACA,cAAc,cAAc,MAAM;AAAA,MACpC;AAAA,IACF;AAKA,UAAM;AAAA,MACJ,UAAU;AAAA,MACV,SAAS;AAAA,MACT;AAAA,MACA;AAAA,IACF,IAAI,MAAM;AAAA,MACR;AAAA,MACA;AAAA,MACA;AAAA,MACA,EAAE,gBAAgB;AAAA,IACpB;AAEA,QAAI,YAAY,OAAO;AACrB,YAAM,SAAS,IAAI,SAAS,2BAA2B,YAAY,MAAM,OAAO,EAAE;AAClF,aAAO,oBAAoB,YAAY,OAAO,QAAQ,WAAW,YAAY;AAAA,IAC/E;AAEA,UAAM,WAAW,qBAAqB,aAAa,OAAO,OAAO,YAAY;AAC7E,UAAM,SAAS,SAAS,IAAI,KAAK,0BAA0B;AAE3D,UAAM,EAAE,YAAY,IAAI,eAAe,QAAQ;AAC/C,UAAM,SAAS;AAAA,MACb;AAAA,MACA,aAAa,YAAY,eAAe,uBAAuB,SAAS,YAAY;AAAA,IACtF;AAGA,UAAM,SAAS,OAAO;AACtB,UAAM,eAAe,mBAAmB;AAExC,QAAI;AACJ,QAAI,gBAAgB;AACpB,QAAI;AAEJ,QAAI,UAAU,CAAC,cAAc;AAE3B,UAAI,CAAC,UAAU,CAAC,cAAc;AAC5B,mBAAW;AACX,eAAO,WAAW,UAAU,QAAQ;AAEpC,cAAM,SAAS,IAAI,WAAW,8EAA8E;AAAA,MAC9G;AACA,UAAI;AACJ,UAAI,UAAU,cAAc;AAC1B,cAAM,eAAe,MAAM;AAAA,UACzB,YAAY;AAAA,UACZ,OAAO;AAAA,UACP,OAAO;AAAA,UACP;AAAA,QACF;AACA,2BAAmB,aAAa;AAAA,MAClC;AACA,iBAAW;AAAA,QACT,eAAe,OAAO,SAAS,aAAa,SAAS,UAAU,OAAO,OAAO;AAAA,QAC7E,oBAAoB,aAAa,SAAS,UAAU,SAAS,YAAY;AAAA,QACzE;AAAA,QACA,EAAE,gBAAgB,OAAO,QAAQ;AAAA,MACnC;AACA,YAAM,SAAS,SAAS,IAAI,KAAK,wBAAwB;AAAA,IAC3D,OAAO;AAEL,YAAM,SAAS,SAAS,IAAI,KAAK,kCAAkC;AACnE,YAAM,iBAAiB,MAAM;AAAA,QAC3B,YAAY;AAAA,QACZ,OAAO;AAAA,QACP,SAAS;AAAA,QACT;AAAA,QACA,OAAO;AAAA,MACT;AAEA,UAAI,eAAe,QAAQ;AACzB,mBAAW;AAAA,UACT,eAAe;AAAA,UAAQ;AAAA,UAAa,OAAO;AAAA,UAAS,SAAS;AAAA,UAAU,SAAS;AAAA,UAAc,OAAO;AAAA,QACvG;AACA,wBAAgB;AAChB,cAAM,SAAS,SAAS,IAAI,KAAK,8BAA8B;AAAA,MACjE,OAAO;AAEL,mBAAW,eAAe,SAAS;AACnC,eAAO,WAAW,+CAA+C,QAAQ,IAAI,QAAQ;AAErF,cAAM,SAAS,IAAI,WAAW,+BAA+B,QAAQ,EAAE;AACvE,mBAAW;AAAA,UACT,eAAe,OAAO,SAAS,aAAa,SAAS,UAAU,OAAO,OAAO;AAAA,UAC7E,oBAAoB,aAAa,SAAS,UAAU,SAAS,YAAY;AAAA,UACzE;AAAA,UACA,EAAE,gBAAgB,OAAO,QAAQ;AAAA,QACnC;AACA,cAAM,SAAS,SAAS,IAAI,KAAK,yCAAyC;AAAA,MAC5E;AAAA,IACF;AAEA,UAAM,gBAAgB,KAAK,IAAI,IAAI;AACnC,UAAM,WAAW;AAAA,MACf;AAAA,MAAa;AAAA,MAAe,SAAS;AAAA,MAAc,SAAS;AAAA,MAAU;AAAA,MAAe,OAAO;AAAA,MAAO;AAAA,MACnG;AAAA,MAAe;AAAA,MAAgB;AAAA,IACjC;AAMA,UAAM,gBAAgB,oBAAI,IAAoB;AAM9C,UAAM,UAAU,uBAAuB,aAAa,aAAa;AAEjE,WAAO,QAAQ,qBAAqB,YAAY,WAAW,MAAM,qBAAqB,aAAa,IAAI,QAAQ;AAC/G,UAAM,SAAS,IAAI,QAAQ,yBAAyB,YAAY,WAAW,MAAM,sBAAsB,aAAa,GAAG;AAEvH,UAAM,SAAS;AAAA;AAAA,GAAW,eAAe,aAAa,CAAC,MAAM,YAAY,eAAe,eAAe,gBAAgB,sBAAsB,EAAE;AAC/I,UAAM,eAAe,WAAW;AAEhC,WAAO,YAAY,cAAc,EAAE,SAAS,cAAc,SAAS,SAAS,CAAC;AAAA,EAC/E,SAAS,OAAO;AACd,WAAO,oBAAoB,OAAO,QAAQ,SAAS;AAAA,EACrD;AACF;AAEO,SAAS,sBAAsB,QAAyB;AAC7D,SAAO;AAAA,IACL;AAAA,MACE,MAAM;AAAA,MACN,OAAO;AAAA,MACP,aACE,sKAAiK,gCAAgC;AAAA,MACnM,QAAQ;AAAA,MACR,cAAc;AAAA,MACd,aAAa;AAAA,QACX,cAAc;AAAA,QACd,gBAAgB;AAAA,QAChB,iBAAiB;AAAA,QACjB,eAAe;AAAA,MACjB;AAAA,IACF;AAAA,IACA,OAAO,MAAM,QAAQ;AACnB,UAAI,CAAC,gBAAgB,EAAE,QAAQ;AAC7B,eAAO,eAAe,YAAY,qBAAqB,QAAQ,CAAC,CAAC;AAAA,MACnE;AAEA,YAAM,WAAW,mBAAmB,KAAK,YAAY;AACrD,YAAM,SAAS,MAAM,gBAAgB,MAAM,QAAQ;AAEnD,YAAM,SAAS,SAAS,KAAK,KAAK,OAAO,UAAU,kBAAkB,iBAAiB;AACtF,aAAO,eAAe,MAAM;AAAA,IAC9B;AAAA,EACF;AACF;",
   "names": []
 }

package/dist/src/tools/start-research.js

@@ -1,6 +1,7 @@
 import {
   startResearchParamsSchema
 } from "../schemas/start-research.js";
+import { QUERY_REWRITE_PAIR_GUIDANCE_TEXT } from "../schemas/web-search.js";
 import {
   createLLMProcessor,
   generateResearchBrief,
@@ -45,6 +46,8 @@ function buildStaticScaffolding(goal, opts = {}) {
     '- `"web"` (default) \u2192 open web. Use for spec / bug / pricing / CVE / API / primary-source hunts.',
     '- `"both"` \u2192 fans each query across both. Use when the topic is opinion-heavy AND needs official sources.',
     "",
+    `**Query rewrite discipline** \u2014 ${QUERY_REWRITE_PAIR_GUIDANCE_TEXT}`,
+    "",
     "**3. `scrape-links`** \u2014 fetch URLs in parallel and run per-URL LLM extraction. **Auto-detects** `reddit.com/r/.../comments/` permalinks and routes them through the Reddit API (threaded post + comments); everything else flows through the HTTP scraper. Mix Reddit + web URLs freely \u2014 both branches run concurrently. **Parallel-safe**: prefer multiple `scrape-links` calls with contextually grouped URLs over one giant mixed batch. Each page returns `## Source`, `## Matches` (verbatim facts), `## Not found` (explicit gaps this page did NOT answer), `## Follow-up signals` (new terms + referenced-but-unscraped URLs that seed your next `web-search` round). Describe extraction SHAPE in `extract`, facets separated by `|`: `root cause | affected versions | fix | workarounds | timeline`.",
     "",
     "## The loop",
@@ -164,7 +167,7 @@ function registerStartResearchTool(server) {
     {
       name: "start-research",
       title: "Start Research Session",
-      description: "Call this FIRST every research session. Provide a `goal`; I return a goal-tailored brief naming (a) `primary_branch` (reddit for sentiment/migration, web for spec/bug/pricing, both when opinion-heavy AND needs official sources), (b) the exact `first_call_sequence` of web-search + scrape-links calls to fire, (c) 25\u201350 keyword seeds for your first `web-search` call, (d) iteration hints, (e) gaps to watch, (f) stop criteria. No goal? You still get the generic 3-tool playbook. Other tools work without calling this, but you will use them worse.",
+      description: `Call this FIRST every research session. Provide a \`goal\`; I return a goal-tailored brief naming (a) \`primary_branch\` (reddit for sentiment/migration, web for spec/bug/pricing, both when opinion-heavy AND needs official sources), (b) the exact \`first_call_sequence\` of web-search + scrape-links calls to fire, (c) 25\u201350 keyword seeds for your first \`web-search\` call, (d) iteration hints, (e) gaps to watch, (f) stop criteria. ${QUERY_REWRITE_PAIR_GUIDANCE_TEXT} No goal? You still get the generic 3-tool playbook. Other tools work without calling this, but you will use them worse.`,
       schema: startResearchParamsSchema,
       annotations: {
         readOnlyHint: true,

package/dist/src/tools/start-research.js.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../../src/tools/start-research.ts"],
-  "sourcesContent": ["import type { MCPServer } from 'mcp-use/server';\n\nimport {\n  startResearchParamsSchema,\n  type StartResearchOutput,\n  type StartResearchParams,\n} from '../schemas/start-research.js';\nimport {\n  createLLMProcessor,\n  generateResearchBrief,\n  getLLMHealth,\n  renderResearchBrief,\n  type LLMHealthSnapshot,\n} from '../services/llm-processor.js';\nimport { classifyError } from '../utils/errors.js';\nimport { mcpLog } from '../utils/logger.js';\nimport { toolFailure, toolSuccess, toToolResponse, type ToolExecutionResult } from './mcp-helpers.js';\nimport { formatError } from './utils.js';\n\nconst SKILL_INSTALL_HINT = [\n  '> \uD83D\uDCA1 **Pair this server with the `run-research` skill** for the full agentic playbook',\n  '> (single-agent loop, multi-agent orchestrator, mission-prompt templates, output discipline).',\n  '> Install once per machine \u2014 the skill is what teaches the agent how to spend these tools well:',\n  '>',\n  '> ```bash',\n  '> npx -y skills add -y -g https://github.com/yigitkonur/skills-by-yigitkonur --skill /run-research',\n  '> ```',\n  '>',\n  '> Already installed? Skip this \u2014 the skill auto-loads on relevant prompts. The full pack',\n  '> ships ~50 sibling skills: `npx -y skills add -y -g https://github.com/yigitkonur/skills-by-yigitkonur`.',\n].join('\\n');\n\n/**\n * Full research-loop playbook. Teaches the 3-tool mental model\n * (start-research, web-search, scrape-links), the aggressive multi-call\n * discipline, parallel-callability, and the cite-from-scrape rule.\n *\n * Emitted when the LLM planner is healthy OR `include_playbook: true`.\n */\nexport function buildStaticScaffolding(goal?: string, opts: { plannerAvailable?: boolean } = {}): string {\n  const plannerAvailable = opts.plannerAvailable ?? true;\n  const focusLine = goal\n    ? `> Focus for this session: ${goal}`\n    : '> Focus for this session: not yet specified \u2014 set one on the next pass';\n\n  const classifierLoopStep = plannerAvailable\n    ? '3. Read the classifier output: `synthesis` (citations in `[rank]`), `gaps[]` (with ids), `refine_queries[]` (follow-ups tied to gap ids).'\n    : '3. Classifier output is NOT available (LLM planner offline). `web-search` returns a raw ranked list \u2014 synthesize the terrain yourself from titles + snippets.';\n\n  return [\n    SKILL_INSTALL_HINT,\n    '',\n    '# Research session started',\n    '',\n    focusLine,\n    '',\n    'You are running a research LOOP, not answering from memory. Training data is stale; the web is authoritative for anything dated, versioned, priced, or contested. Every non-trivial claim in your final answer must be traceable to a `scrape-links` excerpt you read. Never cite a URL from a `web-search` snippet alone.',\n    '',\n    '## The 3 tools',\n    '',\n    '**1. `start-research`** \u2014 you just called me. I plan this session and return the brief below. Call me again only if the goal materially shifts.',\n    '',\n    '**2. `web-search`** \u2014 fan out Google queries in parallel. One call carries **up to 50 queries** in a flat `queries` array. Call me **aggressively** \u2014 2\u20134 rounds per session is normal, not 1. After each pass, read `gaps[]` and `refine_queries[]` and fire another round with the harvested terms. **Parallel-safe**: run multiple `web-search` calls in the same turn for orthogonal subtopics (e.g. one call for \"spec\" queries, one call for \"sentiment\" queries). `scope` values:',\n    '- `\"reddit\"` \u2192 server appends `site:reddit.com` and filters to post permalinks. Use for sentiment / migration / lived experience.',\n    '- `\"web\"` (default) \u2192 open web. Use for spec / bug / pricing / CVE / API / primary-source hunts.',\n    '- `\"both\"` \u2192 fans each query across both. Use when the topic is opinion-heavy AND needs official sources.',\n    '',\n    '**3. `scrape-links`** \u2014 fetch URLs in parallel and run per-URL LLM extraction. **Auto-detects** `reddit.com/r/.../comments/` permalinks and routes them through the Reddit API (threaded post + comments); everything else flows through the HTTP scraper. Mix Reddit + web URLs freely \u2014 both branches run concurrently. **Parallel-safe**: prefer multiple `scrape-links` calls with contextually grouped URLs over one giant mixed batch. Each page returns `## Source`, `## Matches` (verbatim facts), `## Not found` (explicit gaps this page did NOT answer), `## Follow-up signals` (new terms + referenced-but-unscraped URLs that seed your next `web-search` round). Describe extraction SHAPE in `extract`, facets separated by `|`: `root cause | affected versions | fix | workarounds | timeline`.',\n    '',\n    '## The loop',\n    '',\n    '1. Read the brief below (if present). Note `primary_branch`, `keyword_seeds`, `gaps_to_watch`, `stop_criteria`.',\n    '2. Fire `first_call_sequence` in order. For `primary_branch: reddit`, lead with `web-search scope:\"reddit\"` \u2192 `scrape-links` on the best post permalinks. For `web`, lead with `web-search scope:\"web\"` \u2192 `scrape-links` on HIGHLY_RELEVANT URLs. For `both`, issue two parallel `web-search` calls (one per scope) in the same turn, then one merged `scrape-links`.',\n    classifierLoopStep,\n    '4. Scrape every HIGHLY_RELEVANT plus the 2\u20133 best MAYBE_RELEVANT. Group URLs into parallel `scrape-links` calls when contexts differ (e.g. one call for docs, one for reddit threads).',\n    '5. Harvest from each scrape extract\\'s `## Follow-up signals` \u2014 new terms, version numbers, vendor names, failure modes, referenced URLs. These seed your next `web-search` round.',\n    '6. Fire the next `web-search` round with the harvested terms plus any `refine_queries[]` the classifier suggested. Do NOT paraphrase queries already run \u2014 the classifier tracks them.',\n    '7. **Stop** when every `gaps_to_watch` item is closed AND the last `web-search` pass surfaced no new terms, OR when you have completed 4 full passes. State remaining gaps explicitly if you hit the cap.',\n    '',\n    '## Output discipline',\n    '',\n    '- Cite URL (or Reddit permalink) for every non-trivial claim \u2014 only from a `scrape-links` excerpt you read.',\n    '- Quote verbatim: numbers, versions, API names, prices, error messages, stacktraces, people\\'s words.',\n    '- Separate documented facts from inferred conclusions explicitly.',\n    '- Include the scrape date for time-sensitive claims.',\n    '- If you could not verify something, say so \u2014 do not paper over gaps.',\n    '- Never cite a URL from a search snippet alone.',\n    '',\n    '## Post-cutoff discipline',\n    '',\n    'For anything released / changed after your training cutoff \u2014 new products, versions, prices, benchmarks \u2014 treat your own query suggestions as hypotheses until a scraped first-party page confirms them. Include `site:<vendor-domain>` queries in your first `web-search` call when the goal names a vendor or product.',\n  ].join('\\n');\n}\n\n/**\n * Compact stub emitted when the LLM planner is offline AND the caller did\n * not opt into the full playbook. Names the 3 tools, the loop, parallel-safety,\n * Reddit branch, and cite-from-scrape \u2014 enough to keep an agent moving.\n */\nexport function buildDegradedStub(goal?: string): string {\n  const focusLine = goal\n    ? `> Focus for this session: ${goal}`\n    : '> Focus for this session: not specified \u2014 set one on the next pass.';\n  return [\n    SKILL_INSTALL_HINT,\n    '',\n    '# Research session started (LLM planner offline \u2014 compact stub)',\n    '',\n    focusLine,\n    '',\n    '**3 tools**: `start-research` (plans), `web-search` (Google fan-out, up to 50 queries/call, `scope: web|reddit|both`), `scrape-links` (fetch URLs in parallel, auto-detects `reddit.com/r/.../comments/` permalinks \u2192 Reddit API; all other URLs \u2192 HTTP scraper). All three are **parallel-callable** \u2014 fire multiple in the same turn when subtopics are orthogonal.',\n    '',\n    '**Loop**: `web-search` \u2192 `scrape-links` \u2192 read `## Follow-up signals` \u2192 harvest new terms \u2192 next `web-search` round \u2192 stop when gaps close OR after 4 passes. Call `web-search` aggressively (2\u20134 rounds, not 1).',\n    '',\n    '**Reddit branch**: use `web-search scope:\"reddit\"` for sentiment / migration / lived experience. Skip for CVE / API spec / pricing. Reddit permalinks go straight into `scrape-links` for threaded post + comments.',\n    '',\n    '**Cite**: every non-trivial claim must trace to a `scrape-links` excerpt, never a search snippet. Quote verbatim for numbers, versions, stacktraces, people\\'s words.',\n    '',\n    'Pass `include_playbook: true` to `start-research` for the full tactic reference.',\n  ].join('\\n');\n}\n\n/**\n * Backward-compat alias \u2014 older call sites import `buildOrientation` directly.\n */\nexport const buildOrientation = buildStaticScaffolding;\n\n// ============================================================================\n// Planner-offline gate.\n//\n// The problem we are guarding against: a single transient LLM failure (one bad\n// 429, one malformed JSON response from the classifier) used to poison the\n// gate forever and force every subsequent `start-research` call into the\n// compact stub \u2014 even when env was fine and the next call would have\n// succeeded. That created a deadlock where the very tool that could reset\n// the health flag was the tool being blocked.\n//\n// The safer semantics implemented here:\n//  1. If env is not configured, we are offline. Hard stop.\n//  2. Otherwise, require **two consecutive failures** before gating (one\n//     blip is tolerated).\n//  3. Even then, the gate only holds for PLANNER_FAILURE_TTL_MS after the\n//     most recent failure. After that window we give the planner another\n//     chance regardless of the counter \u2014 if it is still broken the next\n//     call's failure will re-arm the gate.\n//  4. Any success resets the counter to 0, so the gate opens immediately\n//     on recovery.\n// ============================================================================\n\n/** Minimum consecutive failures before the gate closes. */\nexport const PLANNER_FAILURE_THRESHOLD = 2;\n\n/** How long a recent failure burst keeps the gate closed, in ms. */\nexport const PLANNER_FAILURE_TTL_MS = 60_000;\n\ntype PlannerGateHealth = Pick<\n  LLMHealthSnapshot,\n  'plannerConfigured' | 'consecutivePlannerFailures' | 'lastPlannerCheckedAt'\n>;\n\n/**\n * Pure predicate \u2014 returns true when the planner should be treated as\n * offline for the purposes of `start-research`. Kept exported and\n * dependency-free so tests can drive it without touching the LLM.\n */\nexport function isPlannerKnownOffline(\n  health: PlannerGateHealth,\n  nowMs: number = Date.now(),\n): boolean {\n  if (!health.plannerConfigured) {\n    return true;\n  }\n  if (health.consecutivePlannerFailures < PLANNER_FAILURE_THRESHOLD) {\n    return false;\n  }\n  if (health.lastPlannerCheckedAt === null) {\n    return false;\n  }\n  const lastMs = Date.parse(health.lastPlannerCheckedAt);\n  if (Number.isNaN(lastMs)) {\n    return false;\n  }\n  return nowMs - lastMs < PLANNER_FAILURE_TTL_MS;\n}\n\nasync function buildGoalAwareBrief(\n  goal: string,\n  signal?: AbortSignal,\n): Promise<string> {\n  const processor = createLLMProcessor();\n  if (!processor) {\n    mcpLog('info', 'start-research: LLM unavailable, returning static orientation only', 'start-research');\n    return '';\n  }\n\n  const brief = await generateResearchBrief(goal, processor, signal);\n  if (!brief) {\n    mcpLog('warning', 'start-research: brief generation failed, returning static orientation only', 'start-research');\n    return '';\n  }\n\n  return renderResearchBrief(brief);\n}\n\nasync function handleStartResearch(\n  params: StartResearchParams,\n  signal?: AbortSignal,\n): Promise<ToolExecutionResult<StartResearchOutput>> {\n  try {\n    const llmHealth = getLLMHealth();\n    const plannerKnownOffline = isPlannerKnownOffline(llmHealth);\n\n    if (plannerKnownOffline && !params.include_playbook) {\n      const stub = buildDegradedStub(params.goal);\n      return toolSuccess(stub);\n    }\n\n    const scaffolding = buildStaticScaffolding(params.goal, {\n      plannerAvailable: !plannerKnownOffline,\n    });\n\n    let brief = '';\n    if (params.goal) {\n      brief = await buildGoalAwareBrief(params.goal, signal);\n    }\n\n    const briefFallbackNote = params.goal && !brief\n      ? '\\n\\n---\\n\\n> _Goal-tailored brief unavailable: LLM planner is not configured or failed this call. The static playbook above still applies; you can proceed with it, or retry `start-research` after verifying `LLM_API_KEY`._'\n      : '';\n\n    const content = brief\n      ? `${scaffolding}\\n\\n---\\n\\n${brief}`\n      : `${scaffolding}${briefFallbackNote}`;\n\n    return toolSuccess(content);\n  } catch (err: unknown) {\n    const structuredError = classifyError(err);\n    mcpLog('error', `start-research: ${structuredError.message}`, 'start-research');\n    return toolFailure(\n      formatError({\n        code: structuredError.code,\n        message: structuredError.message,\n        retryable: structuredError.retryable,\n        toolName: 'start-research',\n        howToFix: ['Retry start-research. If the failure persists, verify LLM_API_KEY / LLM_BASE_URL / LLM_MODEL.'],\n      }),\n    );\n  }\n}\n\nexport function registerStartResearchTool(server: MCPServer): void {\n  server.tool(\n    {\n      name: 'start-research',\n      title: 'Start Research Session',\n      description:\n        'Call this FIRST every research session. Provide a `goal`; I return a goal-tailored brief naming (a) `primary_branch` (reddit for sentiment/migration, web for spec/bug/pricing, both when opinion-heavy AND needs official sources), (b) the exact `first_call_sequence` of web-search + scrape-links calls to fire, (c) 25\u201350 keyword seeds for your first `web-search` call, (d) iteration hints, (e) gaps to watch, (f) stop criteria. No goal? You still get the generic 3-tool playbook. Other tools work without calling this, but you will use them worse.',\n      schema: startResearchParamsSchema,\n      annotations: {\n        readOnlyHint: true,\n        idempotentHint: true,\n        destructiveHint: false,\n        openWorldHint: false,\n      },\n    },\n    async (args) => toToolResponse(await handleStartResearch(args)),\n  );\n}\n"],
-  "mappings": "AAEA;AAAA,EACE;AAAA,OAGK;AACP;AAAA,EACE;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,OAEK;AACP,SAAS,qBAAqB;AAC9B,SAAS,cAAc;AACvB,SAAS,aAAa,aAAa,sBAAgD;AACnF,SAAS,mBAAmB;AAE5B,MAAM,qBAAqB;AAAA,EACzB;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,EAAE,KAAK,IAAI;AASJ,SAAS,uBAAuB,MAAe,OAAuC,CAAC,GAAW;AACvG,QAAM,mBAAmB,KAAK,oBAAoB;AAClD,QAAM,YAAY,OACd,6BAA6B,IAAI,KACjC;AAEJ,QAAM,qBAAqB,mBACvB,8IACA;AAEJ,SAAO;AAAA,IACL;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,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF,EAAE,KAAK,IAAI;AACb;AAOO,SAAS,kBAAkB,MAAuB;AACvD,QAAM,YAAY,OACd,6BAA6B,IAAI,KACjC;AACJ,SAAO;AAAA,IACL;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,EAAE,KAAK,IAAI;AACb;AAKO,MAAM,mBAAmB;AAyBzB,MAAM,4BAA4B;AAGlC,MAAM,yBAAyB;AAY/B,SAAS,sBACd,QACA,QAAgB,KAAK,IAAI,GAChB;AACT,MAAI,CAAC,OAAO,mBAAmB;AAC7B,WAAO;AAAA,EACT;AACA,MAAI,OAAO,6BAA6B,2BAA2B;AACjE,WAAO;AAAA,EACT;AACA,MAAI,OAAO,yBAAyB,MAAM;AACxC,WAAO;AAAA,EACT;AACA,QAAM,SAAS,KAAK,MAAM,OAAO,oBAAoB;AACrD,MAAI,OAAO,MAAM,MAAM,GAAG;AACxB,WAAO;AAAA,EACT;AACA,SAAO,QAAQ,SAAS;AAC1B;AAEA,eAAe,oBACb,MACA,QACiB;AACjB,QAAM,YAAY,mBAAmB;AACrC,MAAI,CAAC,WAAW;AACd,WAAO,QAAQ,sEAAsE,gBAAgB;AACrG,WAAO;AAAA,EACT;AAEA,QAAM,QAAQ,MAAM,sBAAsB,MAAM,WAAW,MAAM;AACjE,MAAI,CAAC,OAAO;AACV,WAAO,WAAW,8EAA8E,gBAAgB;AAChH,WAAO;AAAA,EACT;AAEA,SAAO,oBAAoB,KAAK;AAClC;AAEA,eAAe,oBACb,QACA,QACmD;AACnD,MAAI;AACF,UAAM,YAAY,aAAa;AAC/B,UAAM,sBAAsB,sBAAsB,SAAS;AAE3D,QAAI,uBAAuB,CAAC,OAAO,kBAAkB;AACnD,YAAM,OAAO,kBAAkB,OAAO,IAAI;AAC1C,aAAO,YAAY,IAAI;AAAA,IACzB;AAEA,UAAM,cAAc,uBAAuB,OAAO,MAAM;AAAA,MACtD,kBAAkB,CAAC;AAAA,IACrB,CAAC;AAED,QAAI,QAAQ;AACZ,QAAI,OAAO,MAAM;AACf,cAAQ,MAAM,oBAAoB,OAAO,MAAM,MAAM;AAAA,IACvD;AAEA,UAAM,oBAAoB,OAAO,QAAQ,CAAC,QACtC,kOACA;AAEJ,UAAM,UAAU,QACZ,GAAG,WAAW;AAAA;AAAA;AAAA;AAAA,EAAc,KAAK,KACjC,GAAG,WAAW,GAAG,iBAAiB;AAEtC,WAAO,YAAY,OAAO;AAAA,EAC5B,SAAS,KAAc;AACrB,UAAM,kBAAkB,cAAc,GAAG;AACzC,WAAO,SAAS,mBAAmB,gBAAgB,OAAO,IAAI,gBAAgB;AAC9E,WAAO;AAAA,MACL,YAAY;AAAA,QACV,MAAM,gBAAgB;AAAA,QACtB,SAAS,gBAAgB;AAAA,QACzB,WAAW,gBAAgB;AAAA,QAC3B,UAAU;AAAA,QACV,UAAU,CAAC,+FAA+F;AAAA,MAC5G,CAAC;AAAA,IACH;AAAA,EACF;AACF;AAEO,SAAS,0BAA0B,QAAyB;AACjE,SAAO;AAAA,IACL;AAAA,MACE,MAAM;AAAA,MACN,OAAO;AAAA,MACP,aACE;AAAA,MACF,QAAQ;AAAA,MACR,aAAa;AAAA,QACX,cAAc;AAAA,QACd,gBAAgB;AAAA,QAChB,iBAAiB;AAAA,QACjB,eAAe;AAAA,MACjB;AAAA,IACF;AAAA,IACA,OAAO,SAAS,eAAe,MAAM,oBAAoB,IAAI,CAAC;AAAA,EAChE;AACF;",
+  "sourcesContent": ["import type { MCPServer } from 'mcp-use/server';\n\nimport {\n  startResearchParamsSchema,\n  type StartResearchOutput,\n  type StartResearchParams,\n} from '../schemas/start-research.js';\nimport { QUERY_REWRITE_PAIR_GUIDANCE_TEXT } from '../schemas/web-search.js';\nimport {\n  createLLMProcessor,\n  generateResearchBrief,\n  getLLMHealth,\n  renderResearchBrief,\n  type LLMHealthSnapshot,\n} from '../services/llm-processor.js';\nimport { classifyError } from '../utils/errors.js';\nimport { mcpLog } from '../utils/logger.js';\nimport { toolFailure, toolSuccess, toToolResponse, type ToolExecutionResult } from './mcp-helpers.js';\nimport { formatError } from './utils.js';\n\nconst SKILL_INSTALL_HINT = [\n  '> \uD83D\uDCA1 **Pair this server with the `run-research` skill** for the full agentic playbook',\n  '> (single-agent loop, multi-agent orchestrator, mission-prompt templates, output discipline).',\n  '> Install once per machine \u2014 the skill is what teaches the agent how to spend these tools well:',\n  '>',\n  '> ```bash',\n  '> npx -y skills add -y -g https://github.com/yigitkonur/skills-by-yigitkonur --skill /run-research',\n  '> ```',\n  '>',\n  '> Already installed? Skip this \u2014 the skill auto-loads on relevant prompts. The full pack',\n  '> ships ~50 sibling skills: `npx -y skills add -y -g https://github.com/yigitkonur/skills-by-yigitkonur`.',\n].join('\\n');\n\n/**\n * Full research-loop playbook. Teaches the 3-tool mental model\n * (start-research, web-search, scrape-links), the aggressive multi-call\n * discipline, parallel-callability, and the cite-from-scrape rule.\n *\n * Emitted when the LLM planner is healthy OR `include_playbook: true`.\n */\nexport function buildStaticScaffolding(goal?: string, opts: { plannerAvailable?: boolean } = {}): string {\n  const plannerAvailable = opts.plannerAvailable ?? true;\n  const focusLine = goal\n    ? `> Focus for this session: ${goal}`\n    : '> Focus for this session: not yet specified \u2014 set one on the next pass';\n\n  const classifierLoopStep = plannerAvailable\n    ? '3. Read the classifier output: `synthesis` (citations in `[rank]`), `gaps[]` (with ids), `refine_queries[]` (follow-ups tied to gap ids).'\n    : '3. Classifier output is NOT available (LLM planner offline). `web-search` returns a raw ranked list \u2014 synthesize the terrain yourself from titles + snippets.';\n\n  return [\n    SKILL_INSTALL_HINT,\n    '',\n    '# Research session started',\n    '',\n    focusLine,\n    '',\n    'You are running a research LOOP, not answering from memory. Training data is stale; the web is authoritative for anything dated, versioned, priced, or contested. Every non-trivial claim in your final answer must be traceable to a `scrape-links` excerpt you read. Never cite a URL from a `web-search` snippet alone.',\n    '',\n    '## The 3 tools',\n    '',\n    '**1. `start-research`** \u2014 you just called me. I plan this session and return the brief below. Call me again only if the goal materially shifts.',\n    '',\n    '**2. `web-search`** \u2014 fan out Google queries in parallel. One call carries **up to 50 queries** in a flat `queries` array. Call me **aggressively** \u2014 2\u20134 rounds per session is normal, not 1. After each pass, read `gaps[]` and `refine_queries[]` and fire another round with the harvested terms. **Parallel-safe**: run multiple `web-search` calls in the same turn for orthogonal subtopics (e.g. one call for \"spec\" queries, one call for \"sentiment\" queries). `scope` values:',\n    '- `\"reddit\"` \u2192 server appends `site:reddit.com` and filters to post permalinks. Use for sentiment / migration / lived experience.',\n    '- `\"web\"` (default) \u2192 open web. Use for spec / bug / pricing / CVE / API / primary-source hunts.',\n    '- `\"both\"` \u2192 fans each query across both. Use when the topic is opinion-heavy AND needs official sources.',\n    '',\n    `**Query rewrite discipline** \u2014 ${QUERY_REWRITE_PAIR_GUIDANCE_TEXT}`,\n    '',\n    '**3. `scrape-links`** \u2014 fetch URLs in parallel and run per-URL LLM extraction. **Auto-detects** `reddit.com/r/.../comments/` permalinks and routes them through the Reddit API (threaded post + comments); everything else flows through the HTTP scraper. Mix Reddit + web URLs freely \u2014 both branches run concurrently. **Parallel-safe**: prefer multiple `scrape-links` calls with contextually grouped URLs over one giant mixed batch. Each page returns `## Source`, `## Matches` (verbatim facts), `## Not found` (explicit gaps this page did NOT answer), `## Follow-up signals` (new terms + referenced-but-unscraped URLs that seed your next `web-search` round). Describe extraction SHAPE in `extract`, facets separated by `|`: `root cause | affected versions | fix | workarounds | timeline`.',\n    '',\n    '## The loop',\n    '',\n    '1. Read the brief below (if present). Note `primary_branch`, `keyword_seeds`, `gaps_to_watch`, `stop_criteria`.',\n    '2. Fire `first_call_sequence` in order. For `primary_branch: reddit`, lead with `web-search scope:\"reddit\"` \u2192 `scrape-links` on the best post permalinks. For `web`, lead with `web-search scope:\"web\"` \u2192 `scrape-links` on HIGHLY_RELEVANT URLs. For `both`, issue two parallel `web-search` calls (one per scope) in the same turn, then one merged `scrape-links`.',\n    classifierLoopStep,\n    '4. Scrape every HIGHLY_RELEVANT plus the 2\u20133 best MAYBE_RELEVANT. Group URLs into parallel `scrape-links` calls when contexts differ (e.g. one call for docs, one for reddit threads).',\n    '5. Harvest from each scrape extract\\'s `## Follow-up signals` \u2014 new terms, version numbers, vendor names, failure modes, referenced URLs. These seed your next `web-search` round.',\n    '6. Fire the next `web-search` round with the harvested terms plus any `refine_queries[]` the classifier suggested. Do NOT paraphrase queries already run \u2014 the classifier tracks them.',\n    '7. **Stop** when every `gaps_to_watch` item is closed AND the last `web-search` pass surfaced no new terms, OR when you have completed 4 full passes. State remaining gaps explicitly if you hit the cap.',\n    '',\n    '## Output discipline',\n    '',\n    '- Cite URL (or Reddit permalink) for every non-trivial claim \u2014 only from a `scrape-links` excerpt you read.',\n    '- Quote verbatim: numbers, versions, API names, prices, error messages, stacktraces, people\\'s words.',\n    '- Separate documented facts from inferred conclusions explicitly.',\n    '- Include the scrape date for time-sensitive claims.',\n    '- If you could not verify something, say so \u2014 do not paper over gaps.',\n    '- Never cite a URL from a search snippet alone.',\n    '',\n    '## Post-cutoff discipline',\n    '',\n    'For anything released / changed after your training cutoff \u2014 new products, versions, prices, benchmarks \u2014 treat your own query suggestions as hypotheses until a scraped first-party page confirms them. Include `site:<vendor-domain>` queries in your first `web-search` call when the goal names a vendor or product.',\n  ].join('\\n');\n}\n\n/**\n * Compact stub emitted when the LLM planner is offline AND the caller did\n * not opt into the full playbook. Names the 3 tools, the loop, parallel-safety,\n * Reddit branch, and cite-from-scrape \u2014 enough to keep an agent moving.\n */\nexport function buildDegradedStub(goal?: string): string {\n  const focusLine = goal\n    ? `> Focus for this session: ${goal}`\n    : '> Focus for this session: not specified \u2014 set one on the next pass.';\n  return [\n    SKILL_INSTALL_HINT,\n    '',\n    '# Research session started (LLM planner offline \u2014 compact stub)',\n    '',\n    focusLine,\n    '',\n    '**3 tools**: `start-research` (plans), `web-search` (Google fan-out, up to 50 queries/call, `scope: web|reddit|both`), `scrape-links` (fetch URLs in parallel, auto-detects `reddit.com/r/.../comments/` permalinks \u2192 Reddit API; all other URLs \u2192 HTTP scraper). All three are **parallel-callable** \u2014 fire multiple in the same turn when subtopics are orthogonal.',\n    '',\n    '**Loop**: `web-search` \u2192 `scrape-links` \u2192 read `## Follow-up signals` \u2192 harvest new terms \u2192 next `web-search` round \u2192 stop when gaps close OR after 4 passes. Call `web-search` aggressively (2\u20134 rounds, not 1).',\n    '',\n    '**Reddit branch**: use `web-search scope:\"reddit\"` for sentiment / migration / lived experience. Skip for CVE / API spec / pricing. Reddit permalinks go straight into `scrape-links` for threaded post + comments.',\n    '',\n    '**Cite**: every non-trivial claim must trace to a `scrape-links` excerpt, never a search snippet. Quote verbatim for numbers, versions, stacktraces, people\\'s words.',\n    '',\n    'Pass `include_playbook: true` to `start-research` for the full tactic reference.',\n  ].join('\\n');\n}\n\n/**\n * Backward-compat alias \u2014 older call sites import `buildOrientation` directly.\n */\nexport const buildOrientation = buildStaticScaffolding;\n\n// ============================================================================\n// Planner-offline gate.\n//\n// The problem we are guarding against: a single transient LLM failure (one bad\n// 429, one malformed JSON response from the classifier) used to poison the\n// gate forever and force every subsequent `start-research` call into the\n// compact stub \u2014 even when env was fine and the next call would have\n// succeeded. That created a deadlock where the very tool that could reset\n// the health flag was the tool being blocked.\n//\n// The safer semantics implemented here:\n//  1. If env is not configured, we are offline. Hard stop.\n//  2. Otherwise, require **two consecutive failures** before gating (one\n//     blip is tolerated).\n//  3. Even then, the gate only holds for PLANNER_FAILURE_TTL_MS after the\n//     most recent failure. After that window we give the planner another\n//     chance regardless of the counter \u2014 if it is still broken the next\n//     call's failure will re-arm the gate.\n//  4. Any success resets the counter to 0, so the gate opens immediately\n//     on recovery.\n// ============================================================================\n\n/** Minimum consecutive failures before the gate closes. */\nexport const PLANNER_FAILURE_THRESHOLD = 2;\n\n/** How long a recent failure burst keeps the gate closed, in ms. */\nexport const PLANNER_FAILURE_TTL_MS = 60_000;\n\ntype PlannerGateHealth = Pick<\n  LLMHealthSnapshot,\n  'plannerConfigured' | 'consecutivePlannerFailures' | 'lastPlannerCheckedAt'\n>;\n\n/**\n * Pure predicate \u2014 returns true when the planner should be treated as\n * offline for the purposes of `start-research`. Kept exported and\n * dependency-free so tests can drive it without touching the LLM.\n */\nexport function isPlannerKnownOffline(\n  health: PlannerGateHealth,\n  nowMs: number = Date.now(),\n): boolean {\n  if (!health.plannerConfigured) {\n    return true;\n  }\n  if (health.consecutivePlannerFailures < PLANNER_FAILURE_THRESHOLD) {\n    return false;\n  }\n  if (health.lastPlannerCheckedAt === null) {\n    return false;\n  }\n  const lastMs = Date.parse(health.lastPlannerCheckedAt);\n  if (Number.isNaN(lastMs)) {\n    return false;\n  }\n  return nowMs - lastMs < PLANNER_FAILURE_TTL_MS;\n}\n\nasync function buildGoalAwareBrief(\n  goal: string,\n  signal?: AbortSignal,\n): Promise<string> {\n  const processor = createLLMProcessor();\n  if (!processor) {\n    mcpLog('info', 'start-research: LLM unavailable, returning static orientation only', 'start-research');\n    return '';\n  }\n\n  const brief = await generateResearchBrief(goal, processor, signal);\n  if (!brief) {\n    mcpLog('warning', 'start-research: brief generation failed, returning static orientation only', 'start-research');\n    return '';\n  }\n\n  return renderResearchBrief(brief);\n}\n\nasync function handleStartResearch(\n  params: StartResearchParams,\n  signal?: AbortSignal,\n): Promise<ToolExecutionResult<StartResearchOutput>> {\n  try {\n    const llmHealth = getLLMHealth();\n    const plannerKnownOffline = isPlannerKnownOffline(llmHealth);\n\n    if (plannerKnownOffline && !params.include_playbook) {\n      const stub = buildDegradedStub(params.goal);\n      return toolSuccess(stub);\n    }\n\n    const scaffolding = buildStaticScaffolding(params.goal, {\n      plannerAvailable: !plannerKnownOffline,\n    });\n\n    let brief = '';\n    if (params.goal) {\n      brief = await buildGoalAwareBrief(params.goal, signal);\n    }\n\n    const briefFallbackNote = params.goal && !brief\n      ? '\\n\\n---\\n\\n> _Goal-tailored brief unavailable: LLM planner is not configured or failed this call. The static playbook above still applies; you can proceed with it, or retry `start-research` after verifying `LLM_API_KEY`._'\n      : '';\n\n    const content = brief\n      ? `${scaffolding}\\n\\n---\\n\\n${brief}`\n      : `${scaffolding}${briefFallbackNote}`;\n\n    return toolSuccess(content);\n  } catch (err: unknown) {\n    const structuredError = classifyError(err);\n    mcpLog('error', `start-research: ${structuredError.message}`, 'start-research');\n    return toolFailure(\n      formatError({\n        code: structuredError.code,\n        message: structuredError.message,\n        retryable: structuredError.retryable,\n        toolName: 'start-research',\n        howToFix: ['Retry start-research. If the failure persists, verify LLM_API_KEY / LLM_BASE_URL / LLM_MODEL.'],\n      }),\n    );\n  }\n}\n\nexport function registerStartResearchTool(server: MCPServer): void {\n  server.tool(\n    {\n      name: 'start-research',\n      title: 'Start Research Session',\n      description:\n        `Call this FIRST every research session. Provide a \\`goal\\`; I return a goal-tailored brief naming (a) \\`primary_branch\\` (reddit for sentiment/migration, web for spec/bug/pricing, both when opinion-heavy AND needs official sources), (b) the exact \\`first_call_sequence\\` of web-search + scrape-links calls to fire, (c) 25\u201350 keyword seeds for your first \\`web-search\\` call, (d) iteration hints, (e) gaps to watch, (f) stop criteria. ${QUERY_REWRITE_PAIR_GUIDANCE_TEXT} No goal? You still get the generic 3-tool playbook. Other tools work without calling this, but you will use them worse.`,\n      schema: startResearchParamsSchema,\n      annotations: {\n        readOnlyHint: true,\n        idempotentHint: true,\n        destructiveHint: false,\n        openWorldHint: false,\n      },\n    },\n    async (args) => toToolResponse(await handleStartResearch(args)),\n  );\n}\n"],
+  "mappings": "AAEA;AAAA,EACE;AAAA,OAGK;AACP,SAAS,wCAAwC;AACjD;AAAA,EACE;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,OAEK;AACP,SAAS,qBAAqB;AAC9B,SAAS,cAAc;AACvB,SAAS,aAAa,aAAa,sBAAgD;AACnF,SAAS,mBAAmB;AAE5B,MAAM,qBAAqB;AAAA,EACzB;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,EAAE,KAAK,IAAI;AASJ,SAAS,uBAAuB,MAAe,OAAuC,CAAC,GAAW;AACvG,QAAM,mBAAmB,KAAK,oBAAoB;AAClD,QAAM,YAAY,OACd,6BAA6B,IAAI,KACjC;AAEJ,QAAM,qBAAqB,mBACvB,8IACA;AAEJ,SAAO;AAAA,IACL;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,uCAAkC,gCAAgC;AAAA,IAClE;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,EAAE,KAAK,IAAI;AACb;AAOO,SAAS,kBAAkB,MAAuB;AACvD,QAAM,YAAY,OACd,6BAA6B,IAAI,KACjC;AACJ,SAAO;AAAA,IACL;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,EAAE,KAAK,IAAI;AACb;AAKO,MAAM,mBAAmB;AAyBzB,MAAM,4BAA4B;AAGlC,MAAM,yBAAyB;AAY/B,SAAS,sBACd,QACA,QAAgB,KAAK,IAAI,GAChB;AACT,MAAI,CAAC,OAAO,mBAAmB;AAC7B,WAAO;AAAA,EACT;AACA,MAAI,OAAO,6BAA6B,2BAA2B;AACjE,WAAO;AAAA,EACT;AACA,MAAI,OAAO,yBAAyB,MAAM;AACxC,WAAO;AAAA,EACT;AACA,QAAM,SAAS,KAAK,MAAM,OAAO,oBAAoB;AACrD,MAAI,OAAO,MAAM,MAAM,GAAG;AACxB,WAAO;AAAA,EACT;AACA,SAAO,QAAQ,SAAS;AAC1B;AAEA,eAAe,oBACb,MACA,QACiB;AACjB,QAAM,YAAY,mBAAmB;AACrC,MAAI,CAAC,WAAW;AACd,WAAO,QAAQ,sEAAsE,gBAAgB;AACrG,WAAO;AAAA,EACT;AAEA,QAAM,QAAQ,MAAM,sBAAsB,MAAM,WAAW,MAAM;AACjE,MAAI,CAAC,OAAO;AACV,WAAO,WAAW,8EAA8E,gBAAgB;AAChH,WAAO;AAAA,EACT;AAEA,SAAO,oBAAoB,KAAK;AAClC;AAEA,eAAe,oBACb,QACA,QACmD;AACnD,MAAI;AACF,UAAM,YAAY,aAAa;AAC/B,UAAM,sBAAsB,sBAAsB,SAAS;AAE3D,QAAI,uBAAuB,CAAC,OAAO,kBAAkB;AACnD,YAAM,OAAO,kBAAkB,OAAO,IAAI;AAC1C,aAAO,YAAY,IAAI;AAAA,IACzB;AAEA,UAAM,cAAc,uBAAuB,OAAO,MAAM;AAAA,MACtD,kBAAkB,CAAC;AAAA,IACrB,CAAC;AAED,QAAI,QAAQ;AACZ,QAAI,OAAO,MAAM;AACf,cAAQ,MAAM,oBAAoB,OAAO,MAAM,MAAM;AAAA,IACvD;AAEA,UAAM,oBAAoB,OAAO,QAAQ,CAAC,QACtC,kOACA;AAEJ,UAAM,UAAU,QACZ,GAAG,WAAW;AAAA;AAAA;AAAA;AAAA,EAAc,KAAK,KACjC,GAAG,WAAW,GAAG,iBAAiB;AAEtC,WAAO,YAAY,OAAO;AAAA,EAC5B,SAAS,KAAc;AACrB,UAAM,kBAAkB,cAAc,GAAG;AACzC,WAAO,SAAS,mBAAmB,gBAAgB,OAAO,IAAI,gBAAgB;AAC9E,WAAO;AAAA,MACL,YAAY;AAAA,QACV,MAAM,gBAAgB;AAAA,QACtB,SAAS,gBAAgB;AAAA,QACzB,WAAW,gBAAgB;AAAA,QAC3B,UAAU;AAAA,QACV,UAAU,CAAC,+FAA+F;AAAA,MAC5G,CAAC;AAAA,IACH;AAAA,EACF;AACF;AAEO,SAAS,0BAA0B,QAAyB;AACjE,SAAO;AAAA,IACL;AAAA,MACE,MAAM;AAAA,MACN,OAAO;AAAA,MACP,aACE,0bAAqb,gCAAgC;AAAA,MACvd,QAAQ;AAAA,MACR,aAAa;AAAA,QACX,cAAc;AAAA,QACd,gBAAgB;AAAA,QAChB,iBAAiB;AAAA,QACjB,eAAe;AAAA,MACjB;AAAA,IACF;AAAA,IACA,OAAO,SAAS,eAAe,MAAM,oBAAoB,IAAI,CAAC;AAAA,EAChE;AACF;",
   "names": []
 }

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "mcp-researchpowerpack",
-  "version": "6.0.15",
+  "version": "6.0.16",
   "description": "HTTP-first MCP research server: start-research (goal-tailored brief), web-search (with Reddit scope), scrape-links (auto-detects Reddit URLs) — built on mcp-use.",
   "type": "module",
   "main": "dist/index.js",