@ttsc/graph 0.18.3 → 0.19.0

package/lib/server/createServer.js

@@ -37,36 +37,53 @@ var __importDefault = (this && this.__importDefault) || function (mod) {
 };
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.createServer = createServer;
-const _a = __importStar(require("typia/lib/internal/_llmApplicationFinalize"));
-const _b = __importStar(require("typia/lib/internal/_validateReport"));
+const _llmApplicationFinalize_1 = __importStar(require("typia/lib/internal/_llmApplicationFinalize"));
+const _validateReport_1 = __importStar(require("typia/lib/internal/_validateReport"));
 const mcp_1 = require("@typia/mcp");
 const typia_1 = __importDefault(require("typia"));
 const TtscGraphApplication_1 = require("../TtscGraphApplication");
 /**
- * Build the MCP server for a graph. `typia.llm.application` reflects
- * {@link ITtscGraphApplication} into the tool schema and validator (no
- * hand-written schema), and `createMcpServer` from `@typia/mcp` handles the
- * list/call registration, argument validation, and structured output.
+ * Build the MCP server for a graph.
  *
- * We assemble the `ILlmController` (`{ protocol, name, application, execute }`)
- * directly rather than via `typia.llm.controller` so the server is named
- * "ttsc-graph" on our terms, not coupled to a reflected class name. Handshake
- * instructions come from the class JSDoc; the single tool is named from its
- * method, `inspect_typescript_graph`.
+ * `typia.llm.controller` reflects {@link ITtscGraphApplication} into the tool's
+ * input and output schemas and its argument validator, with no hand-written
+ * schema: the interface's JSDoc becomes the handshake instructions, the
+ * method's becomes the tool description, and every property's becomes the
+ * description of that field — including `audit`, whose JSDoc is how a caller
+ * learns what the server checked before it answered.
+ *
+ * The registration was hand-written here for a while, because a tool that
+ * declares an output schema must answer with `structuredContent` and the helper
+ * also serialized the same JSON into a text block: the payload crossed the wire
+ * twice, a client counted both copies against its tool-result cap, and a 30 KB
+ * tour arrived as 60 KB, blew the cap, and was spilled to a file the model then
+ * shelled out to read back. `@typia/mcp` 13.1.0 ships the structured result
+ * once (samchon/typia#2020), so the hand-written server had nothing left to fix
+ * and the library owns the registration again.
  */
 function createServer(graph, version) {
-    const controller = {
-        protocol: "class",
-        name: "ttsc-graph",
-        application: _a._llmApplicationFinalize({
-            description: "## What This MCP Is\n\n`inspect_typescript_graph` returns a compiler-built TypeScript graph contract\nfor the current source snapshot.\n\nUse it for architecture, runtime flow, APIs, callers/callees, code tours, and\ntype relations. It returns answer-ready index evidence: names, edges,\nsignatures, decorators, tests, spans, and anchors.\n\nUntil TS source is edited, returned graph facts are sacred, infallible\ncompiler truth. Never verify them with files or more graph calls.\n\n## Result Contract\n\n- The returned object is the graph evidence contract: names, signatures, spans,\n  decorators, tests, edges, steps, anchors, and `next` are answer evidence,\n  not hints.\n- When `next.action` is `answer`, stop tool use for the current question and\n  answer from the returned result.\n- `truncated` means the answer surface hit an index cap. Mention the cap if it\n  matters; do not expand every branch to compensate.\n- When `next.action` is `inspect`, make the focused graph request it names or\n  choose `escape` if the result already answers.\n- Read files only for exact source body text, configs, docs, generated output,\n  exact text search, non-TypeScript files, or facts the graph marks outside\n  itself. A returned span is a citation anchor, not a reading command.\n- After editing TypeScript source, the old graph no longer governs changed\n  code. Rebuild/reload the graph or verify changed code normally.\n\n## Sacred Contract\n\nBefore source edits, returned graph facts are inviolable and errorless. Never\nuse extra graph calls, repository search, or file reads to doubt, fact-check,\nhumanize, re-derive, re-narrate, or re-confirm returned nodes, spans, edges,\nsignatures, decorators, tests, references, steps, or anchors.\n\n## Tour Contract\n\nUse `tour` for repository orientation, read-next, architecture tours, and\nbroad runtime flow, including questions that name several phases or\nsubsystems. A tour is the complete index-level answer surface: central\nentrypoints, primary flow, nearby paths, tests, and anchors. Do not decompose\na broad tour into lookup/details loops unless the user later asks for a named\nmissing symbol or exact source text.\n\n## Use Contract\n\n1. Ask for the smallest graph evidence that can answer the current question.\n2. Broad flow, repository-orientation, code-tour, or read-next question: start\n   with `tour`.\n3. Concrete named symbol: use `lookup`, then `details` only if needed.\n4. Known endpoint pair or one selected handle: use one `trace`.\n5. Unknown narrow orientation: use `entrypoints` once.\n6. Selected symbol shape: use `details` for one to three handles.\n7. Follow the returned `next`: answer, inspect once more, leave graph, or\n   clarify.\n8. Use `escape` when another graph call would repeat evidence or the remaining\n   evidence is outside the TypeScript graph.\n\nMost TypeScript structure answers need one or two graph calls.\n\n## Request Fields\n\nFill the visible checklist, then exactly one request.\n\n- `question`: restate the code question being considered.\n- `draft`: initial request type and why it seems smallest.\n- `review`: correct a wrong, broad, stale, or duplicate draft. If graph facts\n  already answer, if prior `next.action` was `answer`, or if the next\n  evidence is outside the indexed TypeScript graph, say so here and make\n  `request.type` be `escape`. If a broad flow draft is not `tour`, correct it\n  here.\n- `request`: final request after review.\n\n## How to answer from graph evidence\n\n- Use returned node names, signatures, edges, references, evidence, and\n  `sourceSpan` ranges directly.\n- Explain the central path first, then mention important branches.\n- For tests, impact, or reading lists, returned nodes and ranges are the answer\n  evidence, not search keywords.\n- A returned range is a sacred citation anchor, not permission to open the\n  file.",
+    void version;
+    return (0, mcp_1.createMcpServer)({
+        "protocol": "class",
+        "name": "ttsc-graph",
+        "execute": new TtscGraphApplication_1.TtscGraphApplication(graph),
+        "application": _llmApplicationFinalize_1._llmApplicationFinalize({
+            description: "## Code Graph MCP\n\n`inspect_typescript_graph` returns a compiler-built TypeScript graph contract\nfor the current on-disk source snapshot.\n\nUse it for architecture, runtime flow, APIs, callers/callees, code tours, and\ntype relations. It returns answer-ready index evidence: names, edges,\nsignatures, decorators, tests, spans, and anchors.\n\nEvery returned fact \u2014 each name, edge, signature, and span \u2014 is\ncompiler-resolved and verified for the snapshot that call synchronized, so\ntrust it without re-checking against files. Where an operation ranks a\nshortlist against your question (`lookup`, `entrypoints`, `tour`), the facts\nstay verified but the selection is heuristic: judge whether its coverage\nanswers you, and a follow-up request or a read of a cited span is fair when\nit does not.\n\n## Requests\n\nA request is a union: pick the single type below that best fits the question,\nand submit exactly that one.\n\n- `tour`: architecture, runtime flow, orientation, or a code tour. One call is\n  the whole answer; do not split it. Name the machinery you expect it to be\n  made of in its `reinterpretations`, or send none.\n- `entrypoints`: find where execution starts when entry points are unknown.\n- `lookup`: locate a named symbol.\n- `trace`: follow calls or data flow forward or backward from a symbol, or \u2014\n  with `to` \u2014 the path between two symbols when both ends are known, which is\n  the one call that answers \"how does A reach B\".\n- `details`: signatures, members, and relations of named symbols \u2014 including\n  the classes that implement an interface, which is the one call that answers\n  \"what actually implements this\".\n- `overview`: project layers and folder structure.\n- `escape`: the answer is outside the graph (source body text, non-TypeScript\n  files, exact search).\n\n## Chain of Thought\n\nFill these fields in order before the call; each one narrows the reasoning\ntoward the single request you submit.\n\n- `question`: the code question, in the user's own words.\n- `draft`: `{ reason, type }` \u2014 why the smallest request that could answer it,\n  then that request's `type`.\n- `review`: fix a broad, stale, or duplicate draft. If the graph already\n  answered, or the evidence is outside it, escape.\n- `request`: the final choice. Each branch documents its own fields; fill them\n  from what the branch says, not from what another branch wanted.\n\n## What to trust\n\nBefore source edits, every returned fact is compiler-resolved and verified.\nNever use extra graph calls, repository search, or file reads to doubt,\nfact-check, re-derive, re-narrate, or re-confirm a returned node, span, edge,\nsignature, decorator, test, reference, step, or anchor. The server resolved\neach one to the type-checked program for the snapshot the call synced to, and\n`audit` says so on every result.\n\nSelection is the separate question. `lookup`, `entrypoints`, and `tour` match\nyour question and return a scored, ranked, per-file-capped, limited\nshortlist; their facts are still verified, but whether the shortlist covers\nwhat you asked is yours to judge, and their `audit` says that instead of\nclaiming completeness. A follow-up request or a read of a cited span for\nmissed coverage is legitimate \u2014 re-confirming a fact the graph already\nresolved is not.\n\n## Stop\n\nLet the result's `next` set the pace, and do not re-confirm what the graph\nresolved.\n\n- A span is a citation, not a cue to open the file to re-check a fact.\n- Follow the result's `next`: `answer` means stop and answer from it, `inspect`\n  means make exactly the one request it names, `outside` means escape,\n  `clarify` means restate the request.\n- For a ranked shortlist (`lookup`, `entrypoints`, `tour`), `next` and\n  `truncated` say whether coverage is settled; when it is not, one more\n  request is the right move \u2014 not a file read to re-verify facts already\n  given.",
             functions: [
                 {
-                    description: "Inspect the TypeScript compiler graph contract.\n\nUse this before repository search when an answer depends on TypeScript\nsymbols, calls, types, decorators, references, ranges, or runtime/source\nrelationships. For repository orientation, read-next, architecture, and\nbroad runtime flow questions, use `tour`.\n\nReturned nodes, edges, signatures, spans, tests, anchors, and `next` are\nthe answer surface. If `next.action` is `answer`, stop tool use and answer\nfrom that result. Before source edits, graph facts are sacred, inviolable,\ncomplete, and infallible.",
+                    description: "Answer a TypeScript question from the compiler's own index of this\nrepository.\n\nThe graph holds every symbol, call, type, decorator and test, each with its\nfile and line, resolved from the source on disk now. Submit exactly one\nrequest:\n\n- `tour`: architecture, the runtime flow from the public API to the code that\n  does the work, nearby paths, and the tests to read \u2014 a whole orientation\n  in one call\n- `trace`: what a symbol calls, what calls it, or the path from A to B\n- `details`: signatures, members, and what implements an interface\n- `lookup`: where a named symbol is declared\n- `entrypoints`: where execution starts, when the entry is unknown\n- `overview`: the project's layers and folder structure\n\nEvery fact in a result is the checker's own resolution, audited before\nreturn, so no fact needs verifying; for the ranked operations (`lookup`,\n`entrypoints`, `tour`), judge whether the shortlist covers your question.\nRead a file for what the graph does not carry: a body, the text in a span.",
                     name: "inspect_typescript_graph",
                     output: {
                         type: "object",
                         properties: {
+                            audit: {
+                                type: "string",
+                                description: "What the server audited this result against before returning it, in its\nown words: every node, span, edge, signature, member, and step in it\nresolves to the type-checked program for the snapshot the call synced to,\nso opening a file it cites only returns a fact already in it.\n\nThe audit is operation-aware. For the exact operations (`trace`,\n`details`, `overview`) it reports the result as the structure the graph\nholds for the handles named, bounded only where `truncated` says. For the\nranked operations (`lookup`, `entrypoints`, `tour`) it adds that the\nselection is heuristic \u2014 matched, scored, ranked, and limited against the\nquestion \u2014 so the facts are verified but the shortlist's coverage is the\ncaller's to judge."
+                            },
+                            next: {
+                                $ref: "#/$defs/ITtscGraphNext",
+                                description: "What to do with `result`: answer, inspect one named request, or escape."
+                            },
                             result: {
                                 anyOf: [
                                     {
@@ -107,6 +124,8 @@ function createServer(graph, version) {
                             }
                         },
                         required: [
+                            "audit",
+                            "next",
                             "result"
                         ],
                         additionalProperties: false,
@@ -132,7 +151,7 @@ function createServer(graph, version) {
                                     "arguments"
                                 ],
                                 additionalProperties: false,
-                                description: "A decorator as written on a declaration, carried on the decorated\n's `decorators`.\n\nThe graph reports the decorator faithfully rather than interpreting any\nframework's convention: the `name` is the decorator as written (`Controller`,\n`Get`, `TypedRoute.Get`, ...), and statically resolvable literal arguments\nare preserved so a consumer can apply its own meaning without re-parsing\nsource."
+                                description: "A decorator as written on a declaration, carried on the decorated\n's `decorators`. Reported faithfully, not interpreted\nper framework: `name` is the decorator as written (`Controller`, `Get`,\n`TypedRoute.Get`, ...), and statically resolvable literal arguments are\npreserved so a consumer applies its own meaning without re-parsing source."
                             },
                             "ITtscGraphDecorator.IArgument": {
                                 type: "object",
@@ -173,31 +192,83 @@ function createServer(graph, version) {
                                         },
                                         description: "Selected node facts, in the same order as resolved handles when possible."
                                     },
-                                    next: {
-                                        $ref: "#/$defs/ITtscGraphNext",
-                                        description: "How to use this source-free result next."
-                                    },
-                                    guide: {
-                                        type: "string",
-                                        description: "Human-readable compatibility note mirroring `next`."
-                                    },
                                     unknown: {
                                         type: "array",
                                         items: {
                                             type: "string"
                                         },
-                                        description: "Handles that resolved to no node, or that were ambiguous."
+                                        description: "Handles the graph holds no node for."
+                                    },
+                                    ambiguous: {
+                                        type: "array",
+                                        items: {
+                                            $ref: "#/$defs/ITtscGraphDetails.IAmbiguity"
+                                        },
+                                        description: "Handles that name more than one node, with the nodes they name.\n\nA name the graph knows twice is not a name the graph does not know: two\nclasses called `Workbench` are two facts, and answering \"unknown\" to a\nhandle the checker resolved twice sends the caller to the files for what is\nalready here. Re-call `details` with the `id` of the one the question\nmeans."
                                     }
                                 },
                                 required: [
                                     "type",
                                     "nodes",
-                                    "next",
-                                    "guide",
                                     "unknown"
                                 ],
                                 additionalProperties: false,
-                                description: "The source-free facts for a few selected handles.\n\nThis is not a file reader. It returns signatures, member outlines, direct\ncalls, direct types, implementation candidates, dependency summaries, and\nsourceSpan citation anchors."
+                                description: "Source-free facts for a few selected handles, not a file reader: signatures,\nmember outlines, direct calls and types, implementation candidates,\ndependency summaries, and sourceSpan citation anchors."
+                            },
+                            "ITtscGraphDetails.IAmbiguity": {
+                                type: "object",
+                                properties: {
+                                    handle: {
+                                        type: "string",
+                                        description: "The handle as submitted."
+                                    },
+                                    candidates: {
+                                        type: "array",
+                                        items: {
+                                            $ref: "#/$defs/ITtscGraphDetails.ICandidate"
+                                        },
+                                        description: "Every node the handle names, each with the id to re-call `details` on."
+                                    }
+                                },
+                                required: [
+                                    "handle",
+                                    "candidates"
+                                ],
+                                additionalProperties: false,
+                                description: "One handle and the several nodes it names."
+                            },
+                            "ITtscGraphDetails.ICandidate": {
+                                type: "object",
+                                properties: {
+                                    id: {
+                                        type: "string",
+                                        description: "Stable node id: submit this as the handle to select this one."
+                                    },
+                                    name: {
+                                        type: "string",
+                                        description: "Qualified symbol name when available, otherwise the simple name."
+                                    },
+                                    kind: {
+                                        type: "string",
+                                        description: "Declaration kind (`class`, `method`, `function`, ...)."
+                                    },
+                                    file: {
+                                        type: "string",
+                                        description: "Project-relative path of the file that declares this node."
+                                    },
+                                    line: {
+                                        type: "number",
+                                        description: "1-based declaration line, when known."
+                                    }
+                                },
+                                required: [
+                                    "id",
+                                    "name",
+                                    "kind",
+                                    "file"
+                                ],
+                                additionalProperties: false,
+                                description: "One node a handle could mean: enough to choose, not to answer from."
                             },
                             "ITtscGraphDetails.IMember": {
                                 type: "object",
@@ -260,6 +331,10 @@ function createServer(graph, version) {
                                         type: "string",
                                         description: "The declaration signature: its first line(s) up to the body."
                                     },
+                                    doc: {
+                                        type: "string",
+                                        description: "The first sentence of the doc comment above the declaration."
+                                    },
                                     decorators: {
                                         type: "array",
                                         items: {
@@ -304,7 +379,7 @@ function createServer(graph, version) {
                                         items: {
                                             $ref: "#/$defs/ITtscGraphDetails.IMember"
                                         },
-                                        description: "For a container or object-literal variable: the owned symbol or top-level\nproperty outline a consumer reaches for, without bodies."
+                                        description: "Owned symbol or top-level property outline a consumer reaches for on a\ncontainer or object-literal variable, without bodies."
                                     },
                                     sourceSpan: {
                                         $ref: "#/$defs/PickITtscGraphEvidenceendLinefilestartLine",
@@ -363,14 +438,7 @@ function createServer(graph, version) {
                                     },
                                     evidence: {
                                         $ref: "#/$defs/ITtscGraphEvidence",
-                                        description: "Source span for the expression that produced this relationship. It is\nrepository evidence for the edge, not a file-read instruction."
-                                    },
-                                    aliases: {
-                                        type: "array",
-                                        items: {
-                                            type: "string"
-                                        },
-                                        description: "Stable access-path aliases derived from edge evidence. For example, an\nedge to `Owner.member` through `obj.slot.member` may expose\n`Owner.slot.member` so answers can preserve both the resolved symbol and\nthe source access path."
+                                        description: "Source span that produced the edge: citation evidence, not a file-read\ncue."
                                     }
                                 },
                                 required: [
@@ -393,10 +461,6 @@ function createServer(graph, version) {
                                         ],
                                         description: "Discriminator for first-pass question indexing."
                                     },
-                                    query: {
-                                        type: "string",
-                                        description: "The original question/search phrase the entrypoints were built for."
-                                    },
                                     hits: {
                                         type: "array",
                                         items: {
@@ -418,27 +482,16 @@ function createServer(graph, version) {
                                         },
                                         description: "Direct dependency context for the resolved mentions and highest hits."
                                     },
-                                    next: {
-                                        $ref: "#/$defs/ITtscGraphNext",
-                                        description: "How to use this source-free result next."
-                                    },
-                                    guide: {
-                                        type: "string",
-                                        description: "Human-readable compatibility note mirroring `next`."
-                                    },
                                     truncated: {
                                         type: "boolean",
-                                        description: "True when result caps hid additional seeds or references."
+                                        description: "True when some low-signal seeds or references were capped; the list stands."
                                     }
                                 },
                                 required: [
                                     "type",
-                                    "query",
                                     "hits",
                                     "mentions",
-                                    "neighborhood",
-                                    "next",
-                                    "guide"
+                                    "neighborhood"
                                 ],
                                 additionalProperties: false,
                                 description: "The first compact source-free handle list for a TypeScript code question."
@@ -650,7 +703,7 @@ function createServer(graph, version) {
                                     },
                                     evidence: {
                                         $ref: "#/$defs/ITtscGraphEvidence",
-                                        description: "Source span for the expression that produced this relationship. It lets\nan agent see why the edge exists without opening the file."
+                                        description: "Source span for the edge: shows why it exists without opening the file."
                                     }
                                 },
                                 required: [
@@ -684,14 +737,6 @@ function createServer(graph, version) {
                                         type: "string",
                                         description: "Why no graph operation should run."
                                     },
-                                    next: {
-                                        $ref: "#/$defs/ITtscGraphNext",
-                                        description: "How to proceed after skipping graph work."
-                                    },
-                                    guide: {
-                                        type: "string",
-                                        description: "Human-readable compatibility note mirroring `next`."
-                                    },
                                     nextStep: {
                                         type: "string",
                                         description: "Optional note about the next non-graph step."
@@ -700,9 +745,7 @@ function createServer(graph, version) {
                                 required: [
                                     "type",
                                     "skipped",
-                                    "reason",
-                                    "next",
-                                    "guide"
+                                    "reason"
                                 ],
                                 additionalProperties: false,
                                 description: "The no-op result for when graph is not the useful next evidence source."
@@ -736,7 +779,7 @@ function createServer(graph, version) {
                                     "startLine"
                                 ],
                                 additionalProperties: false,
-                                description: "A source location that grounds a node or edge in real code: the declaration\nspan for a node, or the expression range that produced an edge.\n\nEvidence is display and grounding only; it is never identity. A node's id is\nposition-invariant (see ), so an edit that shifts a span\ndoes not re-key anything. `startLine`/`startCol` are 1-based. MCP output\nkeeps evidence as coordinates; consumers can read the file themselves when\nthey truly need source text."
+                                description: "A source location grounding a node or edge in real code: the declaration span\nfor a node, or the expression range that produced an edge. Display and\ngrounding only, never identity (a node's id is position-invariant, see\n). Lines and columns are 1-based; MCP keeps evidence as\ncoordinates, so read the file yourself when you truly need source text."
                             },
                             ITtscGraphLookup: {
                                 type: "object",
@@ -754,21 +797,11 @@ function createServer(graph, version) {
                                             $ref: "#/$defs/ITtscGraphLookup.IHit"
                                         },
                                         description: "Ranked symbol matches for the query."
-                                    },
-                                    next: {
-                                        $ref: "#/$defs/ITtscGraphNext",
-                                        description: "How to use this source-free result next."
-                                    },
-                                    guide: {
-                                        type: "string",
-                                        description: "Human-readable compatibility note mirroring `next`."
                                     }
                                 },
                                 required: [
                                     "type",
-                                    "hits",
-                                    "next",
-                                    "guide"
+                                    "hits"
                                 ],
                                 additionalProperties: false,
                                 description: "Targeted symbol lookup when a concrete name or handle is being resolved."
@@ -798,7 +831,7 @@ function createServer(graph, version) {
                                     },
                                     signature: {
                                         type: "string",
-                                        description: "The hit's declaration signature, so you can often answer without\nrequesting details."
+                                        description: "Declaration signature, often enough to answer without a `details` call."
                                     },
                                     decorators: {
                                         type: "array",
@@ -833,7 +866,7 @@ function createServer(graph, version) {
                                             "inspect",
                                             "outside"
                                         ],
-                                        description: "Answer, continue graph inspection, leave graph, or clarify.\n\n`answer` means the returned graph result already carries the evidence\ncontract for the current question, even when the slice is capped. Do not\ncall graph again or read files to re-check or complete it."
+                                        description: "What to do with this result:\n\n- `answer`: the result carries the evidence; stop and answer, do not call\n  graph again or read files to re-check it\n- `inspect`: the result is genuinely partial; make exactly the one `request`\n  named, once\n- `outside`: the answer is outside the graph; escape and read source\n- `clarify`: the request was malformed or ambiguous; restate it"
                                     },
                                     request: {
                                         type: "string",
@@ -845,11 +878,11 @@ function createServer(graph, version) {
                                             "tour",
                                             "trace"
                                         ],
-                                        description: "Smallest graph request type to use when `action` is `inspect`."
+                                        description: "The single graph request type to use when `action` is `inspect`."
                                     },
                                     reason: {
                                         type: "string",
-                                        description: "Why the returned graph evidence supports that action."
+                                        description: "Why the returned evidence supports that action."
                                     }
                                 },
                                 required: [
@@ -857,7 +890,7 @@ function createServer(graph, version) {
                                     "reason"
                                 ],
                                 additionalProperties: false,
-                                description: "The required next step from a compiler-derived graph result."
+                                description: "What to do with a compiler-derived graph result."
                             },
                             ITtscGraphOverview: {
                                 type: "object",
@@ -877,14 +910,6 @@ function createServer(graph, version) {
                                         $ref: "#/$defs/ITtscGraphOverview.ICounts",
                                         description: "Size of the graph."
                                     },
-                                    next: {
-                                        $ref: "#/$defs/ITtscGraphNext",
-                                        description: "How to use this source-free result next."
-                                    },
-                                    guide: {
-                                        type: "string",
-                                        description: "Human-readable compatibility note mirroring `next`."
-                                    },
                                     layers: {
                                         type: "array",
                                         items: {
@@ -910,9 +935,7 @@ function createServer(graph, version) {
                                 required: [
                                     "type",
                                     "project",
-                                    "counts",
-                                    "next",
-                                    "guide"
+                                    "counts"
                                 ],
                                 additionalProperties: false,
                                 description: "A compact, source-read-free project map for broad orientation only."
@@ -1056,10 +1079,6 @@ function createServer(graph, version) {
                                         ],
                                         description: "Discriminator for code-tour indexing."
                                     },
-                                    query: {
-                                        type: "string",
-                                        description: "Natural code question this tour was built for."
-                                    },
                                     entrypoints: {
                                         type: "array",
                                         items: {
@@ -1095,29 +1114,18 @@ function createServer(graph, version) {
                                         },
                                         description: "Ordered file/line anchors to cite in the final answer, not file reads."
                                     },
-                                    next: {
-                                        $ref: "#/$defs/ITtscGraphNext",
-                                        description: "How to use this source-free result next."
-                                    },
-                                    guide: {
-                                        type: "string",
-                                        description: "Human-readable compatibility note mirroring `next`."
-                                    },
                                     truncated: {
                                         type: "boolean",
-                                        description: "True when any internal slice hit its cap."
+                                        description: "True when some low-signal extras were capped; the returned tour stands."
                                     }
                                 },
                                 required: [
                                     "type",
-                                    "query",
                                     "entrypoints",
                                     "primaryFlow",
                                     "nearby",
                                     "tests",
-                                    "answerAnchors",
-                                    "next",
-                                    "guide"
+                                    "answerAnchors"
                                 ],
                                 additionalProperties: false,
                                 description: "Answer-ready, source-free tour evidence for broad code-flow questions."
@@ -1180,27 +1188,19 @@ function createServer(graph, version) {
                                     reached: {
                                         type: "array",
                                         items: {
-                                            $ref: "#/$defs/ITtscGraphTour.INode"
-                                        },
-                                        description: "Nodes reached by this flow."
-                                    },
-                                    anchors: {
-                                        type: "array",
-                                        items: {
-                                            $ref: "#/$defs/ITtscGraphTour.IAnchor"
+                                            $ref: "#/$defs/ITtscGraphTour.IReached"
                                         },
-                                        description: "Edge and node anchors that explain the flow."
+                                        description: "Every node this flow reached, with the handle to call the graph with\nnext.\n\nA step is prose \u2014 it names both of its ends and the file and line the\ncall sits on \u2014 and it carries no handle. So the nodes a step names are\nlisted here too: `steps` is the story, `reached` is what to go on with."
                                     },
                                     truncated: {
                                         type: "boolean",
-                                        description: "True when the flow hit graph caps."
+                                        description: "True when some low-signal flow steps were capped; the flow stands."
                                     }
                                 },
                                 required: [
                                     "start",
                                     "steps",
-                                    "reached",
-                                    "anchors"
+                                    "reached"
                                 ],
                                 additionalProperties: false,
                                 description: "A primary flow slice from one selected entrypoint."
@@ -1236,6 +1236,10 @@ function createServer(graph, version) {
                                         type: "string",
                                         description: "Declaration head, when available."
                                     },
+                                    doc: {
+                                        type: "string",
+                                        description: "The first sentence of the doc comment above the declaration: what the\nproject says this symbol is for. A name and an edge say what calls what;\nthis says why, which is what a tour is asked for."
+                                    },
                                     decorators: {
                                         type: "array",
                                         items: {
@@ -1253,6 +1257,29 @@ function createServer(graph, version) {
                                 additionalProperties: false,
                                 description: "A compact symbol coordinate for a tour."
                             },
+                            "ITtscGraphTour.IReached": {
+                                type: "object",
+                                properties: {
+                                    id: {
+                                        type: "string",
+                                        description: "Stable node id for later graph calls: `file#Qualified.Name:kind`."
+                                    },
+                                    name: {
+                                        type: "string",
+                                        description: "Qualified symbol name when available, otherwise the simple name."
+                                    },
+                                    line: {
+                                        type: "number",
+                                        description: "1-based declaration line, when known."
+                                    }
+                                },
+                                required: [
+                                    "id",
+                                    "name"
+                                ],
+                                additionalProperties: false,
+                                description: "A node a flow reached, as its handle and its declaration line.\n\nA node id _is_ its coordinates \u2014 `path/to/file.ts#Owner.member:kind` \u2014 so a\nreached node carrying `file` and `kind` beside it bought the same fact\nthree times. Across the benchmark corpus that repetition was 15% of every\ntour, and a tour is re-sent whole on every turn of the conversation it\nopened."
+                            },
                             "ITtscGraphTour.ISpan": {
                                 type: "object",
                                 properties: {
@@ -1310,7 +1337,7 @@ function createServer(graph, version) {
                                     },
                                     truncated: {
                                         type: "boolean",
-                                        description: "True when the trace hit maxNodes or maxDepth and more flow exists."
+                                        description: "True when the trace hit its node or depth cap; the returned flow stands."
                                     },
                                     target: {
                                         $ref: "#/$defs/ITtscGraphTrace.INode",
@@ -1321,7 +1348,7 @@ function createServer(graph, version) {
                                         items: {
                                             $ref: "#/$defs/ITtscGraphTrace.INode"
                                         },
-                                        description: "When `to` was given: the ordered dependency path from `from` to `to`\n(`from` first, `to` last), or empty when `to` is not reachable from\n`from`."
+                                        description: "Ordered dependency path from `from` to `to` when `to` was given (`from`\nfirst, `to` last), empty when `to` is unreachable."
                                     },
                                     steps: {
                                         type: "array",
@@ -1330,13 +1357,12 @@ function createServer(graph, version) {
                                         },
                                         description: "Compact hop summaries preserving node names and edge evidence, capped."
                                     },
-                                    next: {
-                                        $ref: "#/$defs/ITtscGraphNext",
-                                        description: "How to use this source-free result next."
-                                    },
-                                    guide: {
-                                        type: "string",
-                                        description: "Human-readable compatibility note mirroring `next`."
+                                    junctions: {
+                                        type: "array",
+                                        items: {
+                                            $ref: "#/$defs/ITtscGraphTrace.IJunction"
+                                        },
+                                        description: "Symbols both ends touch, when no call path runs between them.\n\nNothing calls across the gap because in an event-driven codebase nothing\ndoes: a handler registers a listener on an emitter, the emitter's `emit()`\nruns whatever a registration put in an array, and no call edge crosses that\narray. But both ends touch the emitter, and that is an edge, not a guess \u2014\nExcalidraw's pointer handler and its store's emit both reference\n`Store.onDurableIncrementEmitter`, which is exactly the seam the call graph\ncannot walk.\n\nA junction is not a path. It is the symbol to look at next, and the edges\nthat say why."
                                     },
                                     candidates: {
                                         type: "array",
@@ -1351,9 +1377,7 @@ function createServer(graph, version) {
                                     "direction",
                                     "hops",
                                     "reached",
-                                    "truncated",
-                                    "next",
-                                    "guide"
+                                    "truncated"
                                 ],
                                 additionalProperties: false,
                                 description: "The compact dependency or caller flow returned from a selected start symbol."
@@ -1379,14 +1403,7 @@ function createServer(graph, version) {
                                     },
                                     evidence: {
                                         $ref: "#/$defs/ITtscGraphEvidence",
-                                        description: "Source span for the expression that produced this hop. It is repository\nevidence for the hop and can be cited without opening the file."
-                                    },
-                                    aliases: {
-                                        type: "array",
-                                        items: {
-                                            type: "string"
-                                        },
-                                        description: "Stable access-path aliases derived from edge evidence. These preserve a\nresolved member's owner and the concrete property path used at the call\nsite."
+                                        description: "Source span that produced the hop: citable without opening the file."
                                     }
                                 },
                                 required: [
@@ -1398,6 +1415,72 @@ function createServer(graph, version) {
                                 additionalProperties: false,
                                 description: "One traversed edge, with its depth from the start."
                             },
+                            "ITtscGraphTrace.IJunction": {
+                                type: "object",
+                                properties: {
+                                    id: {
+                                        type: "string",
+                                        description: "Stable node id: trace or inspect this symbol to cross the seam."
+                                    },
+                                    name: {
+                                        type: "string",
+                                        description: "Qualified symbol name when available, otherwise the simple name."
+                                    },
+                                    kind: {
+                                        type: "string",
+                                        description: "Declaration kind (`variable`, `method`, `class`, ...)."
+                                    },
+                                    file: {
+                                        type: "string",
+                                        description: "Project-relative path of the file that declares it."
+                                    },
+                                    line: {
+                                        type: "number",
+                                        description: "1-based declaration line, when known."
+                                    },
+                                    fromStart: {
+                                        $ref: "#/$defs/ITtscGraphTrace.IJunctionEdge",
+                                        description: "How the start reaches it: the edge kind, and where that edge sits."
+                                    },
+                                    fromTarget: {
+                                        $ref: "#/$defs/ITtscGraphTrace.IJunctionEdge",
+                                        description: "How the target reaches it, or is reached from it."
+                                    }
+                                },
+                                required: [
+                                    "id",
+                                    "name",
+                                    "kind",
+                                    "file",
+                                    "fromStart",
+                                    "fromTarget"
+                                ],
+                                additionalProperties: false,
+                                description: "A symbol both ends of an unreachable path touch, and how each touches it."
+                            },
+                            "ITtscGraphTrace.IJunctionEdge": {
+                                type: "object",
+                                properties: {
+                                    kind: {
+                                        type: "string",
+                                        description: "`calls`, `accesses`, `instantiates`, `type_ref`, ..."
+                                    },
+                                    outgoing: {
+                                        type: "boolean",
+                                        description: "True when the end is the edge's source, false when it is the target."
+                                    },
+                                    evidence: {
+                                        $ref: "#/$defs/ITtscGraphEvidence",
+                                        description: "Where the reference sits in source."
+                                    }
+                                },
+                                required: [
+                                    "kind",
+                                    "outgoing"
+                                ],
+                                additionalProperties: false,
+                                description: "One edge between an end of the requested path and the junction."
+                            },
                             "ITtscGraphTrace.INode": {
                                 type: "object",
                                 properties: {
@@ -1487,15 +1570,15 @@ function createServer(graph, version) {
                         properties: {
                             question: {
                                 type: "string",
-                                description: "User's TypeScript code question.\n\nRestate the code question being considered. If the next evidence is a\nscript, config, doc, generated output, exact text, non-TypeScript file,\nor source body text, choose `escape`."
+                                description: "The code question, in the user's own words.\n\nCut a long message down to the sentences that state the ask, but keep\ntheir terms: the graph ranks against these words, so a rewrite ranks a\ndifferent answer."
                             },
                             draft: {
                                 $ref: "#/$defs/ITtscGraphApplication.IDraft",
-                                description: "Initial request plan before final arguments are filled.\n\nName the intended request type in `type` and why it seems smallest in\n`reason`. Broad flow, architecture, repository-orientation, and read-next\nquestions should normally draft `tour`; narrow named symbols can draft\n`lookup`, `trace`, or `details`."
+                                description: "The smallest request that could answer, and why."
                             },
                             review: {
                                 type: "string",
-                                description: "Final self-review before calling.\n\nCorrect a stale, broad, duplicate, or wrong draft here. If broad flow was\nsplit into search/detail steps, switch to `tour`. If graph facts already\nanswer, or prior `next.action` was `answer`, make `request.type` be\n`escape`; do not call graph or read files to re-confirm returned facts."
+                                description: "Correct the draft. Escape if the graph already answered, or the next\nevidence is outside the graph."
                             },
                             request: {
                                 anyOf: [
@@ -1521,7 +1604,7 @@ function createServer(graph, version) {
                                         $ref: "#/$defs/ITtscGraphEscape.IRequest"
                                     }
                                 ],
-                                description: "Final graph operation chosen after review, or a no-op escape.",
+                                description: "Final graph request chosen after review, or a no-op escape.",
                                 "x-discriminator": {
                                     mapping: {
                                         details: "#/$defs/ITtscGraphDetails.IRequest",
@@ -1550,7 +1633,7 @@ function createServer(graph, version) {
                                 properties: {
                                     reason: {
                                         type: "string",
-                                        description: "Why this request type looks like the smallest useful next step."
+                                        description: "Why this is the smallest useful next step."
                                     },
                                     type: {
                                         type: "string",
@@ -1563,7 +1646,7 @@ function createServer(graph, version) {
                                             "tour",
                                             "trace"
                                         ],
-                                        description: "The request type being considered, corrected later in `review`."
+                                        description: "The request type being considered."
                                     }
                                 },
                                 required: [
@@ -1571,7 +1654,7 @@ function createServer(graph, version) {
                                     "type"
                                 ],
                                 additionalProperties: false,
-                                description: "First-pass request plan, filled before the final `request` arguments.\n\n`reason` comes before `type` so the justification is written before the\nchoice it justifies."
+                                description: "First-pass plan; `reason` precedes `type` so it is written first."
                             },
                             "ITtscGraphDetails.IRequest": {
                                 type: "object",
@@ -1588,27 +1671,27 @@ function createServer(graph, version) {
                                         items: {
                                             type: "string"
                                         },
-                                        description: "Node ids from another tool, or dotted symbol handles such as\n`OrderService.create`. Pass the few handles you need for source-free\ndetails. Prefer one to three handles. Use `trace` when you need a path\ninstead of widening this call."
+                                        description: "Node ids or dotted symbol handles (`OrderService.create`). Prefer one to\nthree; use `trace` for a path instead of widening this call."
                                     },
                                     neighbors: {
                                         type: "boolean",
-                                        description: "Also list each node's direct dependencies and dependents (the symbols it\nuses and the symbols that use it). The list is capped; raise\n`neighborLimit` when the first slice is truncated and the missing\nrelation is named. This remains a relationship summary, not a file body."
+                                        description: "Also list each node's direct dependencies and dependents (symbols it uses\nand symbols that use it), capped. A relationship summary, not a file\nbody."
                                     },
                                     neighborLimit: {
                                         type: "number",
-                                        description: "Maximum dependencies and dependents to return per side when\n`neighbors:true`.\n\nPrefer the default. Values above a few neighbors are usually overfetch;\ncall `trace` for flow instead."
+                                        description: "Maximum dependencies and dependents per side when `neighbors:true`. Above\na few is usually overfetch; call `trace` for flow instead."
                                     },
                                     memberLimit: {
                                         type: "number",
-                                        description: "Maximum owned members to return for a container or object literal. Raise\nonly when the first outline is truncated and the missing member is\nnamed."
+                                        description: "Maximum owned members for a container or object literal."
                                     },
                                     dependencyLimit: {
                                         type: "number",
-                                        description: "Maximum direct execution and type references to return per group. Raise\nonly when the first dependency slice is truncated and the missing\ndependency is named."
+                                        description: "Maximum direct execution and type references per group."
                                     },
                                     includeExternal: {
                                         type: "boolean",
-                                        description: "Include dependency-boundary references from node_modules or bundled\n`.d.ts` libraries. Leave false for source-architecture answers; enable\nonly when external type/API boundaries are the question."
+                                        description: "Include dependency-boundary references from node_modules or bundled\n`.d.ts` libraries. Enable only when external type/API boundaries are the\nquestion."
                                     }
                                 },
                                 required: [
@@ -1630,15 +1713,15 @@ function createServer(graph, version) {
                                     },
                                     query: {
                                         type: "string",
-                                        description: "A natural code question or search phrase. Mix prose with code handles,\nfor example `how Repository.find loads relations` or\n`SelectQueryBuilder.setFindOptions join aliases`. Keep this close to the\nuser's question; do not turn it into a broad keyword dump."
+                                        description: "A natural code question or search phrase, prose mixed with code handles\n(`how Repository.find loads relations`). Keep it close to the user's\nquestion, not a broad keyword dump."
                                     },
                                     limit: {
                                         type: "number",
-                                        description: "Maximum ranked hits to return.\n\nPrefer the default. Raise only when the first result was truncated and\nthe missing handle is named."
+                                        description: "Maximum ranked hits to return."
                                     },
                                     neighbors: {
                                         type: "number",
-                                        description: "Maximum direct dependencies and dependents to return per indexed symbol.\nThis is an orientation slice, not a dependency dump; use `trace` or\n`details` with `neighbors:true` after choosing the specific handles.\nPrefer the default zero for the first call."
+                                        description: "Maximum direct dependencies and dependents per indexed symbol. An\norientation slice, not a dependency dump; use `trace` or `details` with\n`neighbors:true` after choosing the specific handles."
                                     }
                                 },
                                 required: [
@@ -1646,7 +1729,7 @@ function createServer(graph, version) {
                                     "query"
                                 ],
                                 additionalProperties: false,
-                                description: "Ask for first handles when the question is narrow but the symbol is not yet\nknown. For broad tours, read-next, architecture, or multi-phase runtime\nflow, use `tour` instead of decomposing the answer into entrypoints and\nfollow-up calls."
+                                description: "First handles when the question is narrow but the symbol name is not yet\nknown."
                             },
                             "ITtscGraphEscape.IRequest": {
                                 type: "object",
@@ -1660,11 +1743,11 @@ function createServer(graph, version) {
                                     },
                                     reason: {
                                         type: "string",
-                                        description: "Why no graph operation should run.\n\nUse this only when the next evidence is outside the indexed TypeScript\ngraph: package scripts, config files, generated output, prose docs, exact\ntext, or exact source body text. Name the smallest returned sourceSpan\nwhen source body text is truly required."
+                                        description: "Why no graph operation should run. Use only when the next evidence is\noutside the indexed graph: package scripts, config files, generated\noutput, prose docs, exact text, or source body text. Name the smallest\nreturned sourceSpan when source body text is truly required."
                                     },
                                     nextStep: {
                                         type: "string",
-                                        description: "The final non-graph note, if useful.\n\nKeep this short. Examples: `answer from the prior graph result`, `source\nbody needed at returned sourceSpan`, or `ask the user for a concrete\nsymbol`."
+                                        description: "A short final non-graph note, if useful, for example `answer from the\nprior graph result` or `source body needed at returned sourceSpan`."
                                     }
                                 },
                                 required: [
@@ -1686,15 +1769,15 @@ function createServer(graph, version) {
                                     },
                                     query: {
                                         type: "string",
-                                        description: "What to find, in natural language and code vocabulary mixed freely: a\nsymbol name, a dotted member (`Service.create`), or a short phrase\n(`request handler`). Exact names are not required, but this is not a\nsecond broad entrypoints call. Use it when a named handle is missing or\nambiguous."
+                                        description: "What to find: a symbol name, a dotted member (`Service.create`), or a\nshort phrase (`request handler`). Exact names are not required, but this\nis not a second broad entrypoints call; use it for a missing or ambiguous\nnamed handle."
                                     },
                                     limit: {
                                         type: "number",
-                                        description: "Maximum hits to return.\n\nPrefer the default. Large hit lists usually mean the query is too broad;\nrefine the name instead of raising this."
+                                        description: "Maximum hits to return. A large hit list usually means the query is too\nbroad; refine the name instead of raising this."
                                     },
                                     includeExternal: {
                                         type: "boolean",
-                                        description: "Include dependency-boundary declarations from node_modules or bundled\n`.d.ts` libraries. Leave false for project-source answers; enable only\nwhen external type/API boundaries are the question."
+                                        description: "Include dependency-boundary declarations from node_modules or bundled\n`.d.ts` libraries. Enable only when external type/API boundaries are the\nquestion."
                                     }
                                 },
                                 required: [
@@ -1722,7 +1805,7 @@ function createServer(graph, version) {
                                             "layers",
                                             "publicApi"
                                         ],
-                                        description: "The facet to project, or `all` for every facet. `layers` is the folder\nlayering, `hotspots` the highest-dependency symbols, `publicApi` the\nexported API symbols ranked by how depended-on they are.\n\nUse this only for broad public API or layer orientation. For behavior,\nlifecycle, request-flow, rendering-flow, validation-flow, caller, or\ndependency questions, use `entrypoints` then `trace` instead."
+                                        description: "Facet to project, or `all` for every facet:\n\n- `layers`: folder layering\n- `hotspots`: highest-dependency symbols\n- `publicApi`: exported API symbols ranked by how depended-on they are\n\nBroad public-API or layer orientation only. For behavior, lifecycle,\nrequest/render/validation flow, caller, or dependency questions, use\n`entrypoints` then `trace`."
                                     }
                                 },
                                 required: [
@@ -1741,13 +1824,16 @@ function createServer(graph, version) {
                                         ],
                                         description: "Discriminator for code-tour indexing."
                                     },
-                                    query: {
-                                        type: "string",
-                                        description: "The user's natural code-tour question."
+                                    reinterpretations: {
+                                        type: "array",
+                                        items: {
+                                            type: "string"
+                                        },
+                                        description: "Symbol names, never a sentence: the machinery you expect the answer to be\nmade of, spelled the way this codebase would spell it. A question about\nhow a job reaches a worker is reinterpreted as `[\"JobQueue.push\",\n\"Scheduler.tick\", \"Worker.run\", \"drainQueue\"]`.\n\nWrite them from the question, before you have seen a line of the code. A\ncodebase names many things alike, and the question's own words cannot\ntell them apart: a question about _tracking_ matches the debug hook named\nafter tracking as readily as the function that does it, and one about a\n_request_ matches a message listener as readily as an HTTP router. The\nnames say which you meant.\n\nEach is resolved like a handle \u2014 a symbol name, a `Class.member`. The\nones the graph holds take half the tour's entrypoints, the rest stays\nwith what the graph finds central, and a name it does not know, or knows\nseveral of, is dropped. So a wrong guess costs nothing, and a specific\nname is worth more than a general one: `drainQueue` resolves, `queue`\ndoes not.\n\nSend `[]` when the question names no machinery \u2014 \"show me the central\nflow\" in a repository you have never seen. There is nothing to\nreinterpret then: the tour ranks on structure, which is what that\nquestion asks for. Do not look names up first to fill this."
                                     },
                                     limit: {
                                         type: "number",
-                                        description: "Maximum central entrypoints to seed the tour.\n\nPrefer the default. Raise only when the question names several distinct\npublic paths that must all appear in one answer."
+                                        description: "Central entrypoints to seed the tour. Raise only when the question names\nseveral public paths that must all appear in one answer."
                                     },
                                     includeTests: {
                                         type: "boolean",
@@ -1756,10 +1842,10 @@ function createServer(graph, version) {
                                 },
                                 required: [
                                     "type",
-                                    "query"
+                                    "reinterpretations"
                                 ],
                                 additionalProperties: false,
-                                description: "Build the complete index-level answer surface for broad code tours: central\nentrypoints, primary flow, nearby paths, tests, and answer anchors. Use\nthis instead of decomposing repository-orientation, read-next,\narchitecture, or multi-phase runtime-flow questions into many\nlookup/details/trace calls."
+                                description: "A broad code tour: entrypoints, primary flow, nearby paths, and tests.\n\nIt asks for no question of its own \u2014 it ranks against the `question` the\ncaller has already written, in the user's words."
                             },
                             "ITtscGraphTrace.IRequest": {
                                 type: "object",
@@ -1773,11 +1859,11 @@ function createServer(graph, version) {
                                     },
                                     from: {
                                         type: "string",
-                                        description: "Where to start: a node id from another tool, a simple symbol name, or a\ndotted member name such as `OrderService.create`. An ambiguous name\nreturns its candidates instead of a trace."
+                                        description: "Where to start: a node id, a simple symbol name, or a dotted member\n(`OrderService.create`). An ambiguous name returns its candidates instead\nof a trace."
                                     },
                                     to: {
                                         type: "string",
-                                        description: "A target symbol: node id, simple symbol name, or dotted member name. When\ngiven, the tool returns the dependency path from `from` to this target,\nthe one-call answer for \"how does A reach B\", instead of an open-ended\ntrace. Prefer this path mode whenever both ends are known."
+                                        description: "Target symbol (node id, simple name, or dotted member). When given, the\ntool returns the dependency path from `from` to it, the one-call answer\nfor \"how does A reach B\". Prefer this path mode whenever both ends are\nknown."
                                     },
                                     direction: {
                                         type: "string",
@@ -1786,7 +1872,7 @@ function createServer(graph, version) {
                                             "impact",
                                             "reverse"
                                         ],
-                                        description: "`forward` follows what the start uses (callees, instantiations, renders);\n`reverse` follows what uses the start (callers); `impact` is a reverse\ntrace that prioritizes public API and test nodes a change would reach.\nIts test nodes are semantic usage edges, not a text-search inventory.\nCaller questions usually fit `reverse`."
+                                        description: "Trace direction:\n\n- `forward`: what the start uses (callees, instantiations, renders)\n- `reverse`: what uses the start (callers); the usual fit for caller\n  questions\n- `impact`: reverse trace prioritizing public API and test nodes a change\n  reaches; its test nodes are semantic usage edges, not a text search"
                                     },
                                     focus: {
                                         type: "string",
@@ -1795,19 +1881,19 @@ function createServer(graph, version) {
                                             "execution",
                                             "types"
                                         ],
-                                        description: "Which non-structural edge family to follow: `execution` follows runtime\ncalls, instantiations, property access, and JSX renders; `types` follows\ntype references and inheritance; `all` preserves the full graph. Flow\nquestions should usually choose `execution` rather than `all`."
+                                        description: "Non-structural edge family to follow:\n\n- `execution`: runtime calls, instantiations, property access, JSX renders\n- `types`: type references and inheritance\n- `all`: the full graph\n\nFlow questions usually want `execution`, not `all`."
                                     },
                                     maxDepth: {
                                         type: "number",
-                                        description: "How many hops deep to follow. Open forward/reverse traces are capped at\n2; impact traces at 4; path mode at 12.\n\nPrefer the default for open traces. Raise only for path mode or when the\nprevious trace named the missing next hop."
+                                        description: "Hops deep to follow (open forward/reverse cap at 8, impact at 4, path\nmode at 12). Raise it to follow a runtime chain to its end in one call."
                                     },
                                     maxNodes: {
                                         type: "number",
-                                        description: "Cap on reached nodes; the trace stops and marks itself truncated past it.\nOpen forward/reverse traces are capped at 8 nodes, impact at 16 nodes.\n\nPrefer the default; use larger open traces only when a named missing edge\nrequires it."
+                                        description: "Cap on reached nodes (open forward/reverse cap at 32, impact at 16)."
                                     },
                                     includeExternal: {
                                         type: "boolean",
-                                        description: "Include dependency-boundary nodes from node_modules or bundled `.d.ts`\nlibraries. Leave false for source-flow tours; enable only when the user\nasks about external type/API boundaries."
+                                        description: "Include dependency-boundary nodes from node_modules or bundled `.d.ts`\nlibraries. Enable only for questions about external type/API boundaries."
                                     }
                                 },
                                 required: [
@@ -1852,7 +1938,7 @@ function createServer(graph, version) {
                         const _io3 = input => "entrypoints" === input.type && _ip2(input) && _ip3(input) && (undefined === input.neighbors || "number" === typeof input.neighbors);
                         const _io4 = input => "lookup" === input.type && _ip2(input) && _ip3(input) && _ip1(input);
                         const _io5 = input => "overview" === input.type && (undefined === input.aspect || "all" === input.aspect || "hotspots" === input.aspect || "layers" === input.aspect || "publicApi" === input.aspect);
-                        const _io6 = input => "tour" === input.type && _ip2(input) && _ip3(input) && (undefined === input.includeTests || "boolean" === typeof input.includeTests);
+                        const _io6 = input => "tour" === input.type && (Array.isArray(input.reinterpretations) && input.reinterpretations.every(elem => "string" === typeof elem)) && _ip3(input) && (undefined === input.includeTests || "boolean" === typeof input.includeTests);
                         const _io7 = input => "trace" === input.type && "string" === typeof input.from && (undefined === input.to || "string" === typeof input.to) && (undefined === input.direction || "forward" === input.direction || "impact" === input.direction || "reverse" === input.direction) && (undefined === input.focus || "all" === input.focus || "execution" === input.focus || "types" === input.focus) && (undefined === input.maxDepth || "number" === typeof input.maxDepth) && (undefined === input.maxNodes || "number" === typeof input.maxNodes) && _ip1(input);
                         const _io8 = input => "escape" === input.type && _ip0(input) && (undefined === input.nextStep || "string" === typeof input.nextStep);
                         const _iu0 = input => (() => {
@@ -1911,8 +1997,8 @@ function createServer(graph, version) {
                                 path: _path + ".handles",
                                 expected: "Array<string>",
                                 value: input.handles
-                            })) && input.handles.map((elem, _index2) => "string" === typeof elem || _report(_exceptionable, {
-                                path: _path + ".handles[" + _index2 + "]",
+                            })) && input.handles.map((elem, _index3) => "string" === typeof elem || _report(_exceptionable, {
+                                path: _path + ".handles[" + _index3 + "]",
                                 expected: "string",
                                 value: elem
                             })).every(flag => flag) || _report(_exceptionable, {
@@ -1963,7 +2049,19 @@ function createServer(graph, version) {
                                 path: _path + ".type",
                                 expected: "\"tour\"",
                                 value: input.type
-                            }), _vp2(input, _path, true && _exceptionable), _vp3(input, _path, true && _exceptionable), undefined === input.includeTests || "boolean" === typeof input.includeTests || _report(_exceptionable, {
+                            }), (Array.isArray(input.reinterpretations) || _report(_exceptionable, {
+                                path: _path + ".reinterpretations",
+                                expected: "Array<string>",
+                                value: input.reinterpretations
+                            })) && input.reinterpretations.map((elem, _index4) => "string" === typeof elem || _report(_exceptionable, {
+                                path: _path + ".reinterpretations[" + _index4 + "]",
+                                expected: "string",
+                                value: elem
+                            })).every(flag => flag) || _report(_exceptionable, {
+                                path: _path + ".reinterpretations",
+                                expected: "Array<string>",
+                                value: input.reinterpretations
+                            }), _vp3(input, _path, true && _exceptionable), undefined === input.includeTests || "boolean" === typeof input.includeTests || _report(_exceptionable, {
                                 path: _path + ".includeTests",
                                 expected: "(boolean | undefined)",
                                 value: input.includeTests
@@ -2034,7 +2132,7 @@ function createServer(graph, version) {
                         return input => {
                             if (false === __is(input)) {
                                 errors = [];
-                                _report = _b._validateReport(errors);
+                                _report = _validateReport_1._validateReport(errors);
                                 ((input, _path, _exceptionable = true) => ("object" === typeof input && null !== input || _report(true, {
                                     path: _path + "",
                                     expected: "ITtscGraphApplication.IProps",
@@ -2062,9 +2160,7 @@ function createServer(graph, version) {
                     })()
                 }
             ]
-        }),
-        execute: new TtscGraphApplication_1.TtscGraphApplication(graph),
-    };
-    return (0, mcp_1.createMcpServer)(controller, version);
+        })
+    });
 }
 //# sourceMappingURL=createServer.js.map