chain-insights 0.44.1 → 0.46.2

package/dist/mcp-proxy.mjs

@@ -3,7 +3,8 @@ import { t as PaymentRequiredError } from "./client-gsLi528K.mjs";
 import { i as isAppOnlyTool, n as PUBLIC_MCP_TOOL_ALLOWED_ARGS, r as PUBLIC_MCP_TOOL_REQUIRED_ARGS, t as HIDDEN_REMOTE_TOOL_NAMES } from "./tool-visibility-P9wETx-d.mjs";
 import { t as primitiveBackendUsageStatus } from "./usage-status-CXOnrq-s.mjs";
 import { n as unavailableSubscriptionStatus } from "./subscription-status-CJ-DaMW9.mjs";
-import { n as mirrorGraphNetworkCapabilities } from "./capabilities-DfWL6n_g.mjs";
+import { r as mirrorGraphNetworkCapabilities } from "./capabilities-Cur8x6c7.mjs";
+import { a as handleMetaSchema, c as GRAPH_EXPAND_TITLE, l as GRAPH_EXPAND_TOOL, n as META_SCHEMA_DESCRIPTION, o as FLOWS_MAX_OFFSET, r as META_SCHEMA_TITLE, s as GRAPH_EXPAND_DESCRIPTION, t as GraphSchemaError, u as handleGraphExpand } from "./graph-schema-D1orCe5F.mjs";
 import { r as appendActionLog, t as actionLogSignalsFromResult } from "./action-log-D49Par9P.mjs";
 import { fileURLToPath } from "node:url";
 import path from "node:path";
@@ -16,21 +17,21 @@ import { Client } from "@modelcontextprotocol/sdk/client/index.js";
 import { StreamableHTTPClientTransport } from "@modelcontextprotocol/sdk/client/streamableHttp.js";
 //#region src/mcp/layer-routing.ts
 /** The routing rule, in one sentence. The server states it in the same words. */
-const ROUTING_RULE = "Route by what you know: topology searches, while facts and chain look up one known thing.";
+const ROUTING_RULE = "Route by what the question names: an address, a pair with a day, a transaction or a block. Topology searches outward from an address, while facts and chain look up one known thing.";
 /** The rule in three lines, one for each layer. */
 const ROUTING_LINES = [
-	"I do not know the thing yet: `USE topology`.",
-	"I know the pair and the day, or the transaction hash, and want the indexed rows: `USE facts`.",
-	"I want the chain's own record of a transaction by its hash, a block by its number or hash, or the head: `USE chain`."
+	"I know an address and want its links, senders, receivers, hops or a route: `USE topology`, anchored on that address.",
+	"I know both addresses of a pair and one day, and want the rows of that day: `USE facts`.",
+	"I want the chain's own record of a transaction by its `tx_id`, a block by its `block_height` or `block_hash`, an address at one block (`Address`), or the head: `USE chain`."
 ];
-/** The chain layer has no address lookup, so an address starts on topology. */
-const ROUTING_NO_ADDRESS_ON_CHAIN = "`USE chain` has no address lookup. Find the address on `USE topology`, then read the pair and one day on `USE facts`.";
+/** The chain layer reads one address at one block. A search for counterparties stays on topology. */
+const ROUTING_ADDRESS_ON_CHAIN = "`USE chain` with `Address` reads the balance, the nonce or the kind of one address, now or at a past block with `at_block`. A past block must be at least `chain_admission.at_block_min_depth` blocks below the tip. To find the counterparties of an address, search `USE topology`, then read the pair and one day on `USE facts`.";
 /** What to do when two layers fit. */
-const ROUTING_TWO_FIT = "When two fit, as with a hash: ask `USE chain` first for the record and the result, then `USE facts` for the transfers it caused.";
-/** The key that each layer hands to the next. */
-const ROUTING_HANDOFF = "The layers hand each other keys. Topology gives the pair and the first and last seen time. Chain gives the `block_date` of a hash or a height. Facts gives the `tx_id`.";
-/** A question that no layer serves. */
-const ROUTING_NOT_SERVED = "A list, a range or a whole-chain question is served on no layer. Say so, and go back to an anchored `USE topology` search.";
+const ROUTING_TWO_FIT = "A transaction is a chain question: read it on `USE chain` by its `tx_id`. Chain gives its `block_date`; the transfers between a pair on that day are a `USE facts` read.";
+/** The key that each layer hands to the next. Each key keeps its name. */
+const ROUTING_HANDOFF = "The layers hand each other keys, and each key keeps its name. Topology gives the pair and the first and last seen time. Facts gives the `tx_id` and the `block_height`. Chain takes an `address`, a `tx_id`, a `block_height` or a `block_hash`, and gives the `block_date` of a transaction or a block.";
+/** A question that no layer serves today. The agent says so once and asks for an anchor. */
+const ROUTING_NOT_SERVED = "A list, a range or a whole-chain question names no address, pair, transaction or block, so no layer serves it today. Say so in one line, ask the user for one of those, and send no workaround query.";
 /** What a refusal carries, and which part of it decides the move. */
 const MOVE_INTRO = "A refused, killed, busy or failed query comes back with `error_detail`: `code`, `rule`, `class`, `fix` and `example`. The `class` decides your next move.";
 /** The move for each class of the refusal envelope. */
@@ -63,468 +64,26 @@ function moveLines() {
 	];
 }
 /**
-* The two hints that the MCP proxy serves for routing and for refusals. Each is
-* one line of the served instructions.
-*/
-function routingHintLines() {
-	return [`- Pick the layer first. ${ROUTING_RULE} 1. ${ROUTING_LINES[0]} 2. ${ROUTING_LINES[1]} 3. ${ROUTING_LINES[2]} ${ROUTING_NO_ADDRESS_ON_CHAIN} ${ROUTING_TWO_FIT} ${ROUTING_HANDOFF} ${ROUTING_NOT_SERVED} The lookups that USE chain serves are listed in chain_admission.lookups of meta_network_capabilities. Read every limit that the server publishes from meta_network_capabilities (chain_admission and, when the server sends them, topology_admission and facts_admission). Never write a limit down.`, `- Act on a refusal by its class. ${moveLines().join(" ")}`];
-}
-//#endregion
-//#region src/mcp/flows.ts
-/**
-* graph_expand, the one dedicated tool of the local proxy, called by the Chain
-* Insights view (ui://chain-insights/view) when the investigator clicks. Its
-* _meta says visibility ["app"], so a host keeps it away from the model: the
-* model writes its own graph_query, and the view draws the rows by their column
-* names.
-*
-* Two forms, told apart by the arguments:
-*
-* - node, {network, address, in_offset?, out_offset?}: one address with its
-*   newest senders and receivers, a text summary and chain-insights.flows.v1 in
-*   structuredContent. Composed from three anchored graph_query reads on the
-*   topology graph (the node, its outgoing FLOWS_TO and its incoming FLOWS_TO,
-*   newest first).
-* - link, {network, from, to, day}: the transfers between two known addresses
-*   on one UTC day, newest first, at most 50, a short text summary and
-*   chain-insights.transfers.v1 in structuredContent. One anchored USE facts
-*   graph_query read.
-*
-* Every read goes through the proxy's remote client, the same path and payment
-* wrapping a graph_query call takes, and is billed as a graph_query. Every
-* argument is checked before the first read, so a refused call reaches no graph
-* endpoint and costs nothing.
-*/
-const FLOWS_SCHEMA = "chain-insights.flows.v1";
-const GRAPH_EXPAND_TOOL = "graph_expand";
-const FLOWS_NETWORK = "robinhood";
-/** Where a graph_expand page may start on each side, at most. */
-const FLOWS_MAX_OFFSET = 1e4;
-const TRANSFERS_SCHEMA = "chain-insights.transfers.v1";
-const INVALID_ADDRESS_TEXT = "invalid_address: a full 0x address of 40 hexadecimal characters is needed, for example 0x04911a118f11c75667e4d0dfb8e640af5a353550";
-const OFFSET_TOO_LARGE_TEXT = `invalid_offset: in_offset and out_offset must each be at most ${FLOWS_MAX_OFFSET}`;
-const OFFSET_NEGATIVE_TEXT = "invalid_offset: in_offset and out_offset must each be a whole number, 0 or more";
-const BOTH_FORMS_TEXT = "invalid_arguments: pass address (with in_offset and out_offset) to expand a node, or from, to and day to list the transfers of a link, not both";
-const ADDRESS_PATTERN = /^0x[0-9a-f]{40}$/;
-const DAY_PATTERN = /^\d{4}-\d{2}-\d{2}$/;
-const CODE_PREFIX = /^([a-z][a-z0-9_]*):\s*/;
-/**
-* The address lower-cased, or null when it is not 0x and 40 hexadecimal
-* characters. Only an address that passes is ever written into a read, so the
-* reads can carry it as a literal.
-*/
-function normalizeFlowsAddress(raw) {
-	if (typeof raw !== "string") return null;
-	const address = raw.trim().toLowerCase();
-	return ADDRESS_PATTERN.test(address) ? address : null;
-}
-/**
-* The day as YYYY-MM-DD when it is a real calendar date, or null. Only a day
-* that passes is ever written into a read.
-*/
-function normalizeFlowsDay(raw) {
-	if (typeof raw !== "string") return null;
-	const day = raw.trim();
-	if (!DAY_PATTERN.test(day)) return null;
-	const time = Date.parse(`${day}T00:00:00Z`);
-	if (Number.isNaN(time) || new Date(time).toISOString().slice(0, 10) !== day) return null;
-	return day;
-}
-/**
-* The one facts read of a link: the transfers from one address to another on
-* one day. A facts read names the pair with one day, takes no ORDER BY and
-* holds at most 200 rows, so the read asks for the whole cap and the order is
-* made in buildTransfersView. Both addresses and the day have passed their
-* checks, so they are written into the read as literals.
-*/
-function transfersReadFor(from, to, day) {
-	return `USE facts MATCH (a:Address {address: "${from}"})-[t:TRANSFER]->(b:Address {address: "${to}"}) WHERE t.block_date = "${day}" RETURN t.tx_id AS tx_id, t.block_timestamp AS block_timestamp, t.amount AS amount, t.asset_symbol AS asset_symbol, t.amount_usd AS amount_usd LIMIT 200`;
-}
-const NODE_FIELDS = "b.address AS address, b.labels AS labels, b.is_exchange AS is_exchange, b.is_sanctioned AS is_sanctioned, b.is_scam AS is_scam, b.is_victim AS is_victim, b:Pool AS pool, b.total_in_usd AS total_in_usd, b.total_out_usd AS total_out_usd, b.degree_in AS degree_in, b.degree_out AS degree_out";
-const PARTY_FIELDS = NODE_FIELDS + ", f.amount_usd_sum AS usd, f.tx_count AS tx_count, " + "f.first_seen_timestamp AS first_seen, f.last_seen_timestamp AS last_seen";
-const PAGE_ORDER = " ORDER BY f.last_seen_timestamp DESC, b.address";
-/**
-* The three anchored reads of one page. Each side asks for one row more than
-* it shows: the extra row says another page exists.
-*/
-function flowsReadsFor(address, inOffset, outOffset) {
-	const page = (offset) => `${PAGE_ORDER}${offset > 0 ? ` SKIP ${offset}` : ""} LIMIT 13`;
-	return [
-		{
-			id: "node",
-			query: `USE topology MATCH (b:Address {address: '${address}'}) RETURN ${NODE_FIELDS} LIMIT 1`
-		},
-		{
-			id: "out",
-			query: `USE topology MATCH (a:Address {address: '${address}'})-[f:FLOWS_TO]->(b:Address) RETURN ${PARTY_FIELDS}${page(outOffset)}`
-		},
-		{
-			id: "in",
-			query: `USE topology MATCH (b:Address)-[f:FLOWS_TO]->(a:Address {address: '${address}'}) RETURN ${PARTY_FIELDS}${page(inOffset)}`
-		}
-	];
-}
-/** The role word of an address, first match wins. */
-function flowsRole(row) {
-	if (row.is_exchange === true) return "exchange";
-	if (row.is_sanctioned === true) return "sanctioned";
-	if (row.is_scam === true) return "scam";
-	if (row.is_victim === true) return "victim";
-	if (row.pool === true) return "pool";
-	return "other";
-}
-function flowsFloat(value) {
-	return typeof value === "number" && Number.isFinite(value) ? value : 0;
-}
-function flowsInt(value) {
-	return typeof value === "number" && Number.isFinite(value) ? Math.trunc(value) : 0;
-}
-function flowsNodeOf(row) {
-	const labels = Array.isArray(row.labels) ? row.labels.filter((label) => typeof label === "string") : [];
-	return {
-		address: typeof row.address === "string" ? row.address : "",
-		role: flowsRole(row),
-		labels,
-		total_in_usd: flowsFloat(row.total_in_usd),
-		total_out_usd: flowsFloat(row.total_out_usd),
-		degree_in: flowsInt(row.degree_in),
-		degree_out: flowsInt(row.degree_out)
-	};
-}
-function assembleFlowView(network, page, senders, receivers, truncated) {
-	const center = flowsNodeOf(page.center);
-	const view = {
-		schema: FLOWS_SCHEMA,
-		network,
-		center: center.address,
-		nodes: [center],
-		edges: [],
-		cursor: {
-			in_offset: page.inOffset + senders.length,
-			out_offset: page.outOffset + receivers.length
-		},
-		truncated
-	};
-	const seen = /* @__PURE__ */ new Set([center.address]);
-	const add = (row, incoming) => {
-		const node = flowsNodeOf(row);
-		if (!seen.has(node.address)) {
-			seen.add(node.address);
-			view.nodes.push(node);
-		}
-		view.edges.push({
-			from: incoming ? node.address : center.address,
-			to: incoming ? center.address : node.address,
-			usd: flowsFloat(row.usd),
-			tx_count: flowsInt(row.tx_count),
-			first_seen_ms: flowsInt(row.first_seen),
-			last_seen_ms: flowsInt(row.last_seen)
-		});
-	};
-	for (const row of senders) add(row, true);
-	for (const row of receivers) add(row, false);
-	return view;
-}
-function fitsFlowBudget(view) {
-	return view.nodes.length <= 60 && JSON.stringify(view).length < 4e4;
-}
-/**
-* flows.v1 from one page: the centre first, then the senders and the
-* receivers, each newest first, at most FLOWS_PER_SIDE a side. When the view
-* data would hold more than FLOWS_MAX_NODES addresses or reach FLOWS_MAX_CHARS
-* characters, the oldest links go first, the view is marked truncated, and the
-* cursor still says where the next page starts.
+* The routing rule and its three lines, with the question that no layer serves,
+* as one paragraph. The proxy serves it first among its instructions: a host
+* that keeps only the start of the instructions (Claude Code keeps 2 KB) still
+* shows the agent where each kind of question goes, and which kind goes nowhere.
 */
-function buildFlowView(network, page) {
-	let truncated = page.senders.length > 12 || page.receivers.length > 12;
-	let senders = page.senders.slice(0, 12);
-	let receivers = page.receivers.slice(0, 12);
-	for (;;) {
-		const view = assembleFlowView(network, page, senders, receivers, truncated);
-		if (fitsFlowBudget(view) || senders.length + receivers.length === 0) return view;
-		truncated = true;
-		if (senders.length >= receivers.length) senders = senders.slice(0, -1);
-		else receivers = receivers.slice(0, -1);
-	}
-}
-function formatFlowsUsd(value) {
-	if (!(value > 0)) return "$0";
-	if (value < .01) return "under $0.01";
-	const whole = Math.floor(value);
-	const cents = Math.round((value - whole) * 100);
-	if (cents === 100) return formatFlowsUsd(whole + 1);
-	return `$${whole.toFixed(0).replace(/\B(?=(\d{3})+(?!\d))/g, ",")}.${String(cents).padStart(2, "0")}`;
-}
-function formatFlowsAge(lastSeenMs, now) {
-	if (lastSeenMs <= 0) return "at an unknown time";
-	const date = new Date(lastSeenMs).toISOString().slice(0, 10);
-	const days = Math.trunc((now.getTime() - lastSeenMs) / 864e5);
-	if (days < 1) return `${date} (less than a day ago)`;
-	if (days === 1) return `${date} (1 day ago)`;
-	return `${date} (${days} days ago)`;
-}
-/** The role word, with up to three address labels beside it. */
-function roleText(node) {
-	if (!node) return "other";
-	if (node.labels.length === 0) return node.role;
-	return `${node.role} (${node.labels.slice(0, 3).join(", ")})`;
-}
-function sideLines(title, parties) {
-	if (parties.length === 0) return [`${title}, newest first: none.`];
-	const lines = [`${title}, newest first (${parties.length}):`];
-	const perLine = parties.length > 6 ? 2 : 1;
-	for (let start = 0; start < parties.length; start += perLine) lines.push(`- ${parties.slice(start, start + perLine).join("; ")}`);
-	return lines;
+function routingHead() {
+	return `Pick the layer first. ${ROUTING_RULE} 1. ${ROUTING_LINES[0]} 2. ${ROUTING_LINES[1]} 3. ${ROUTING_LINES[2]} ${ROUTING_NOT_SERVED}`;
 }
 /**
-* The text of a node answer: the centre, its role and lifetime totals, then
-* every counterparty of the view with its USD, transaction count and last-seen
-* date and age. At most FLOWS_SUMMARY_MAX_LINES lines.
-*/
-function flowsSummary(view, now) {
-	const nodes = new Map(view.nodes.map((node) => [node.address, node]));
-	const center = nodes.get(view.center);
-	const party = (address, edge) => `${address} ${roleText(nodes.get(address))}, ${formatFlowsUsd(edge.usd)} in ${edge.tx_count} tx, last seen ${formatFlowsAge(edge.last_seen_ms, now)}`;
-	const senders = [];
-	const receivers = [];
-	for (const edge of view.edges) if (edge.to === view.center) senders.push(party(edge.from, edge));
-	else receivers.push(party(edge.to, edge));
-	const body = [
-		`Money flows of ${view.center} on ${view.network}: ${roleText(center)}; lifetime ${formatFlowsUsd(center?.total_in_usd ?? 0)} in, ${formatFlowsUsd(center?.total_out_usd ?? 0)} out; ${center?.degree_in ?? 0} senders and ${center?.degree_out ?? 0} receivers in the topology graph.`,
-		...sideLines("Recent senders", senders),
-		...sideLines("Recent receivers", receivers)
-	].slice(0, 18);
-	const footer = pagingLines(view, senders.length, receivers.length, center);
-	return [...body, ...footer].join("\n");
-}
-/** Where this page sits, and that the picture loads the rest when an address is clicked. */
-function pagingLines(view, shownSenders, shownReceivers, center) {
-	const totalIn = center?.degree_in ?? 0;
-	const totalOut = center?.degree_out ?? 0;
-	const { in_offset: nextIn, out_offset: nextOut } = view.cursor;
-	const range = (shown, next, total) => shown === 0 ? `none of ${total}` : `${next - shown + 1} to ${next} of ${total}`;
-	const where = `Showing senders ${range(shownSenders, nextIn, totalIn)} and receivers ${range(shownReceivers, nextOut, totalOut)}, newest first.`;
-	if (!view.truncated && nextIn >= totalIn && nextOut >= totalOut) return [where];
-	return [where, "More senders and receivers load when an address in the picture is clicked."];
-}
-/** A finite number, or a decimal string read as one, or null. */
-function flowsNumberOrNull(value) {
-	if (typeof value === "number") return Number.isFinite(value) ? value : null;
-	if (typeof value === "string" && value.trim() !== "") {
-		const parsed = Number(value);
-		return Number.isFinite(parsed) ? parsed : null;
-	}
-	return null;
-}
-function transferOf(row) {
-	const amount = typeof row.amount === "number" && Number.isFinite(row.amount) ? row.amount : typeof row.amount === "string" && row.amount.trim() !== "" ? row.amount : null;
-	return {
-		tx_id: typeof row.tx_id === "string" ? row.tx_id : "",
-		block_timestamp: flowsNumberOrNull(row.block_timestamp),
-		amount,
-		asset_symbol: typeof row.asset_symbol === "string" && row.asset_symbol !== "" ? row.asset_symbol : null,
-		amount_usd: flowsNumberOrNull(row.amount_usd)
-	};
-}
-/**
-* chain-insights.transfers.v1 from the rows of one facts read: newest first,
-* at most TRANSFERS_MAX, truncated when more rows than that came back. The
-* facts layer takes no ORDER BY, so the order is made here.
-*/
-function buildTransfersView(network, from, to, day, rows) {
-	const newestFirst = rows.map(transferOf).sort((a, b) => (b.block_timestamp ?? -Infinity) - (a.block_timestamp ?? -Infinity));
-	return {
-		schema: TRANSFERS_SCHEMA,
-		network,
-		from,
-		to,
-		day,
-		transfers: newestFirst.slice(0, 50),
-		truncated: newestFirst.length > 50
-	};
-}
-function transferLine(transfer) {
-	return `- ${transfer.block_timestamp === null ? "at an unknown time" : `${new Date(transfer.block_timestamp).toISOString().slice(0, 19).replace("T", " ")} UTC`}, ${transfer.amount === null ? "an unknown amount" : String(transfer.amount)}${transfer.asset_symbol ? ` ${transfer.asset_symbol}` : ""}, ${transfer.amount_usd === null ? "no USD price" : formatFlowsUsd(transfer.amount_usd)}, tx ${transfer.tx_id}`;
-}
-/** The short text of a link answer: the pair, the day, the count and the newest few transfers. */
-function transfersSummary(view) {
-	const head = `Transfers from ${view.from} to ${view.to} on ${view.day} (UTC) on ${view.network}`;
-	if (view.transfers.length === 0) return `${head}: none.`;
-	const lines = [`${head}: ${view.truncated ? `the newest ${view.transfers.length}, and the day holds more` : `${view.transfers.length}`}, newest first.`, ...view.transfers.slice(0, 5).map(transferLine)];
-	const rest = view.transfers.length - 5;
-	if (rest > 0) lines.push(`- and ${rest} more in the picture.`);
-	return lines.join("\n");
-}
-function errorResult(text) {
-	return {
-		content: [{
-			type: "text",
-			text
-		}],
-		isError: true
-	};
-}
-function isRecord$1(value) {
-	return !!value && typeof value === "object" && !Array.isArray(value);
-}
-function answerText(answer) {
-	return (answer.content ?? []).map((block) => block.type === "text" && typeof block.text === "string" ? block.text : "").filter(Boolean).join("\n").trim();
-}
-/**
-* The refusal of a read that did not answer, naming its code first:
-* error_detail.code when the graph endpoint sent its typed refusal, the code
-* its text starts with otherwise, and graph_query_failed when it names none.
-* The view marks the address it was expanding.
-*/
-function refusalText(answer) {
-	const text = answerText(answer);
-	const detail = isRecord$1(answer.structuredContent) ? answer.structuredContent.error_detail : void 0;
-	const detailCode = isRecord$1(detail) && typeof detail.code === "string" ? detail.code : "";
-	const textCode = CODE_PREFIX.exec(text)?.[1] ?? "";
-	const code = detailCode || textCode || "graph_query_failed";
-	const rest = textCode === code ? text.replace(CODE_PREFIX, "") : text;
-	return rest ? `${code}: ${rest}` : `${code}: the graph endpoint refused the read`;
-}
-function rowsOf(answer) {
-	const facts = isRecord$1(answer.structuredContent) ? answer.structuredContent.facts : void 0;
-	const query = isRecord$1(facts) ? facts.query : void 0;
-	const results = isRecord$1(query) ? query.results : void 0;
-	return Array.isArray(results) ? results.filter(isRecord$1) : null;
-}
-function checkNetwork(args) {
-	const rawNetwork = typeof args.network === "string" ? args.network.trim().toLowerCase() : "";
-	if (!rawNetwork) return { error: "invalid_network: network is required; pass robinhood" };
-	if (rawNetwork !== "robinhood") return { error: `invalid_network: graph_expand reads the robinhood graph only; got "${String(args.network).trim()}"` };
-	return FLOWS_NETWORK;
-}
-/** The address of a node or of one end of a link; `name` says which end in a link refusal. */
-function checkAddress(raw, name) {
-	const address = normalizeFlowsAddress(raw);
-	if (address) return address;
-	return { error: name ? INVALID_ADDRESS_TEXT.replace("invalid_address:", `invalid_address (${name}):`) : INVALID_ADDRESS_TEXT };
-}
-function checkDay(raw) {
-	return normalizeFlowsDay(raw) ?? { error: "invalid_day: day must be a calendar date written YYYY-MM-DD (UTC), for example 2026-07-10" };
-}
-function checkOffset(value) {
-	if (value === void 0 || value === null) return 0;
-	if (typeof value !== "number" || !Number.isInteger(value) || value < 0) return { error: OFFSET_NEGATIVE_TEXT };
-	if (value > 1e4) return { error: OFFSET_TOO_LARGE_TEXT };
-	return value;
-}
-/**
-* Read and answer one node page. The reads run one after another: the node
-* first, so an address the graph does not hold costs one read, not three; then
-* the receivers and the senders. The first read that does not answer ends the
-* call.
-*/
-async function runNode(deps, network, address, inOffset, outOffset) {
-	const unavailable = deps.unavailable?.();
-	if (unavailable) return errorResult(unavailable);
-	const rows = {};
-	for (const read of flowsReadsFor(address, inOffset, outOffset)) {
-		let answer;
-		try {
-			answer = await deps.graphQuery({
-				network,
-				query: read.query
-			});
-		} catch (err) {
-			return errorResult(deps.describeFailure(err));
-		}
-		if (answer.isError === true) return errorResult(refusalText(answer));
-		const found = rowsOf(answer);
-		if (!found) return errorResult("graph_query_failed: the graph endpoint answered without chain-insights.result.v1 rows");
-		rows[read.id] = found;
-		if (read.id === "node" && found.length === 0) return errorResult(`${address} is not in the ${network} topology graph`);
-	}
-	const view = buildFlowView(network, {
-		center: rows.node?.[0] ?? {},
-		senders: rows.in ?? [],
-		receivers: rows.out ?? [],
-		inOffset,
-		outOffset
-	});
-	return {
-		content: [{
-			type: "text",
-			text: flowsSummary(view, deps.now ? deps.now() : /* @__PURE__ */ new Date())
-		}],
-		structuredContent: view,
-		isError: false
-	};
-}
-/** Read and answer the transfers of one link on one day: a single facts read. */
-async function runLink(deps, network, from, to, day) {
-	const unavailable = deps.unavailable?.();
-	if (unavailable) return errorResult(unavailable);
-	let answer;
-	try {
-		answer = await deps.graphQuery({
-			network,
-			query: transfersReadFor(from, to, day)
-		});
-	} catch (err) {
-		return errorResult(deps.describeFailure(err));
-	}
-	if (answer.isError === true) return errorResult(refusalText(answer));
-	const rows = rowsOf(answer);
-	if (!rows) return errorResult("graph_query_failed: the graph endpoint answered without chain-insights.result.v1 rows");
-	const view = buildTransfersView(network, from, to, day, rows);
-	return {
-		content: [{
-			type: "text",
-			text: transfersSummary(view)
-		}],
-		structuredContent: view,
-		isError: false
-	};
-}
-function given(record, keys) {
-	return keys.some((key) => record[key] !== void 0 && record[key] !== null);
-}
-/**
-* graph_expand, the node form {network, address, in_offset?, out_offset?} or the
-* link form {network, from, to, day}. Every argument is checked before the
-* first read.
+* The two hints that the MCP proxy serves for routing and for refusals. Each is
+* one line of the served instructions.
 */
-async function handleGraphExpand(args, deps) {
-	const record = isRecord$1(args) ? args : {};
-	const network = checkNetwork(record);
-	if (typeof network !== "string") return errorResult(network.error);
-	const isLink = given(record, [
-		"from",
-		"to",
-		"day"
-	]);
-	if (isLink && given(record, [
-		"address",
-		"in_offset",
-		"out_offset"
-	])) return errorResult(BOTH_FORMS_TEXT);
-	if (isLink) {
-		const from = checkAddress(record.from, "from");
-		if (typeof from !== "string") return errorResult(from.error);
-		const to = checkAddress(record.to, "to");
-		if (typeof to !== "string") return errorResult(to.error);
-		const day = checkDay(record.day);
-		if (typeof day !== "string") return errorResult(day.error);
-		return runLink(deps, network, from, to, day);
-	}
-	const address = checkAddress(record.address);
-	if (typeof address !== "string") return errorResult(address.error);
-	const inOffset = checkOffset(record.in_offset);
-	if (typeof inOffset !== "number") return errorResult(inOffset.error);
-	const outOffset = checkOffset(record.out_offset);
-	if (typeof outOffset !== "number") return errorResult(outOffset.error);
-	return runNode(deps, network, address, inOffset, outOffset);
+function routingHintLines() {
+	return [`- Pick the layer first. ${ROUTING_RULE} 1. ${ROUTING_LINES[0]} 2. ${ROUTING_LINES[1]} 3. ${ROUTING_LINES[2]} ${ROUTING_NOT_SERVED} ${ROUTING_ADDRESS_ON_CHAIN} ${ROUTING_TWO_FIT} ${ROUTING_HANDOFF} The lookups that USE chain serves are listed in chain_admission.lookups of meta_network_capabilities. Read every limit that the server publishes from meta_network_capabilities (chain_admission and, when the server sends them, topology_admission and facts_admission). Never write a limit down.`, `- Act on a refusal by its class. ${moveLines().join(" ")}`];
 }
-const GRAPH_EXPAND_TITLE = "Expand a node or a link in the picture";
-const GRAPH_EXPAND_DESCRIPTION = "Expand an open Chain Insights picture. Called by the view when the investigator clicks, never by the model. A node, {network, address, in_offset?, out_offset?}, loads the newest senders and receivers of one address (12 a side, from the offsets); billed as three graph_query topology reads. A link, {network, from, to, day}, lists the transfers between two addresses on one UTC day (YYYY-MM-DD), newest first, at most 50; billed as one graph_query facts read. Read-only; an argument refused before a read costs nothing.";
 //#endregion
 //#region src/mcp/proxy.ts
 const LOCAL_TOOL_NAMES = /* @__PURE__ */ new Set([
 	"meta_network_capabilities",
+	"meta_schema",
 	"meta_usage_status",
 	"meta_subscription_status",
 	"meta_help",
@@ -577,14 +136,15 @@ function resolveMcpProxyMode(env = process.env) {
 	if (raw === "no-workspace" || raw === "workspace-less") return "stateless";
 	throw new Error(`CHAIN_INSIGHTS_MCP_PROXY_MODE must be workspace or stateless; got "${raw}"`);
 }
-const GRAPH_LAYERS_TEXT = "Use USE topology for topology (address/FLOWS_TO/OPERATED_BY/LINKED graph with SWAPPED, ADDED_LIQUIDITY, REMOVED_LIQUIDITY, BRIDGED and the Pool label, unified recent+historical) and USE facts for bounded TRANSFER, SWAP, LIQUIDITY_ADD, LIQUIDITY_REMOVE and BRIDGE_CROSSING rows and enrichment, and USE chain for the chain node's own record of one known transaction, block or the head.";
+const GRAPH_LAYERS_TEXT = "Use USE topology for topology (address/FLOWS_TO/OPERATED_BY/LINKED graph with SWAPPED, ADDED_LIQUIDITY, REMOVED_LIQUIDITY, BRIDGED and the Pool label, unified recent+historical) and USE facts for bounded TRANSFER, SWAP, LIQUIDITY_ADD, LIQUIDITY_REMOVE and BRIDGE_CROSSING rows and enrichment, and USE chain for the chain node's own record of one known transaction, block, address or the head.";
 const KNOWN_PUBLIC_TOOL_DESCRIPTIONS = {
 	meta_network_capabilities: "Return the current Chain Insights network and tool support matrix.",
+	meta_schema: META_SCHEMA_DESCRIPTION,
 	meta_usage_status: "Return the caller's public free graph_query quota for the current UTC day.",
 	meta_subscription_status: "Return the caller's CIA subscription window end, daily allowance, consumption, and tier.",
 	meta_help: "Show a short guide to Chain Insights tools and workflow.",
 	wallet_balance: "Show the local Chain Insights payment wallet address, payment network, token, and amount.",
-	graph_query: `Run a read-only GQL/Cypher query through the Chain Insights graph endpoint. ${GRAPH_LAYERS_TEXT} Preserve full addresses exactly.`,
+	graph_query: `Run a read-only GQL/Cypher query through the Chain Insights graph endpoint. ${GRAPH_LAYERS_TEXT} ${ROUTING_NOT_SERVED} Preserve full addresses exactly.`,
 	graph_query_batch: "Run multiple read-only GQL/Cypher queries through the Chain Insights graph endpoint in one paid batch. Prefer this for related topology/facts reads."
 };
 const KNOWN_PUBLIC_TOOL_TITLES = {
@@ -613,13 +173,14 @@ const GRAPH_SCHEMA_HINTS = [
 	"- Call meta_network_capabilities first. Pass network= exactly as GraphRAG advertised it. CIA does not pick a default network.",
 	...routingHintLines(),
 	"- Coverage is per kind of data. coverage.complete_through_block is the floor of USE facts: below it every raw relationship is indexed. graph_progress.complete_through_block is the floor of USE topology, and graph_progress.layers gives each link kind its own height. An empty answer above the floor may mean not indexed yet, not absent on chain. An absent chain_tip_block means the indexers are catching up: read freshness.max_data_age_seconds for the lag.",
-	"- The graph is address-grain. The only topology money node label is Address, keyed by the raw chain-native H160 address on EVM networks, for example 0x1874a43d7c6d888f9eda3d22a3a49704e3cadb24. The network value on Address nodes matches the tool argument. There is no separate identity key.",
+	"- The graph is address-grain. The only topology money node label is Address, keyed by the raw chain-native H160 address on EVM networks, for example 0x1874a43d7c6d888f9eda3d22a3a49704e3cadb24. There is no separate identity key. network is the query's network on every node and relationship, never stored, except on :Chain, where it names the remote chain.",
+	"- An Address carries a kind from chain facts. topology carries :Account or :Contract as a second label on an Address (:Contract:SmartAccount for a contract wallet), with is_contract kept beside :Contract, and an address that only received has none. facts serves no kind, and a facts read that names :Account or :Contract is refused: ask USE topology or USE chain. chain Address returns is_contract, nonce and delegated_to at the newest block, or at the block named by at_block. block_timestamp is epoch milliseconds on every layer.",
 	"- Address nodes carry address, network, labels, and the role flags is_exchange, is_scam, is_victim and is_sanctioned. (:Address)-[:LINKED]-(:Address) is an undirected ownership-overlay edge (basis derived/associated, plus confidence, source_event, declared_owner, owner_state) asserting the two addresses are controlled by the same actor. LINKED is served on the topology graph only. Enumerate LINKED neighbors with MATCH (a:Address {address: $addr})-[l:LINKED]-(b:Address) RETURN b.address, b.network, l.basis, l.confidence LIMIT 25.",
 	"- Labels hold role words, never detector names: Exchange (plus the exchange name), Scam, Victim and Sanctioned (plus the entity name). Each role is also a node label and a flag on the Address: :Exchange and is_exchange follow the exchange label, :Scam and is_scam the risk label, :Victim and is_victim the protection label, :Sanctioned and is_sanctioned the sanctioned label. Each flag is present only when true and absent otherwise, never false: test IS NOT NULL or IS NULL, not = false. A withdrawn label removes its node label and its flag.",
 	"- Address nodes carry base activity rollups: degree_in/degree_out/degree_total (distinct counterparty addresses), tx_in_count/tx_out_count/tx_total_count, total_in_usd/total_out_usd/total_volume_usd, net_flow_usd (in minus out; positive = net receiver) — all computed from external flows only — and first_activity_timestamp/last_activity_timestamp/activity_span_days, which include all flows (self-loops included). FLOWS_TO edges carry exactly tx_count, amount_usd_sum (total money flow, token and native value merged), first_seen_timestamp, last_seen_timestamp. Lifetime aggregates are the only serving window. Averages are computed inline (amount_usd_sum / toFloat(tx_count)). tx_count counts token and native transfers plus internal native transfers (a contract sending ETH during a call), and amount_usd_sum prices them all. USE facts TRANSFER lists all three, so the rows of a pair are the transfers its link counts, up to the height the link was built to. A link covers all time and a USE facts read covers one day: read the transfers of a pair one day at a time. A transaction anchor of a pair resolves through USE facts, on the UTC day of the first_seen_timestamp or last_seen_timestamp of the link: MATCH (a:Address {address: $from})-[t:TRANSFER]->(b:Address {address: $to}) WHERE t.block_date = \"YYYY-MM-DD\" RETURN t.tx_id, t.block_timestamp LIMIT 1.",
 	"- For actor-level exposure (AC11), UNION FLOWS_TO and SWAPPED reachability over one visible LINKED hop instead of expanding through the LINKED edge itself: MATCH (a:Address {address: $addr})-[:LINKED]-(owned:Address)-[r:FLOWS_TO|SWAPPED]-(b:Address) WHERE NOT a:Pool AND NOT owned:Pool AND owned.address <> b.address AND a.address <> b.address RETURN owned.address, b.address, type(r), coalesce(r.amount_usd_sum, r.bought_usd) LIMIT 50.",
 	"- Labels and per-label risk live on the address node: the labels array plus three parallel lists, label_risk_labels, label_risk_levels and label_risk_updated_timestamps, where entry i of each list is one label row. No overall risk score is served. USE facts serves bounded single-event rows (TRANSFER, SWAP, LIQUIDITY_ADD, LIQUIDITY_REMOVE and BRIDGE_CROSSING edges) only; lifetime address metrics (degrees, totals, activity window) are node properties on USE topology.",
-	"- (from:Address)-[t:TRANSFER]->(to:Address) on USE facts returns individual transfer rows, not aggregates, with properties amount, amount_usd, asset_symbol, asset_contract, tx_id, block_height, block_timestamp, event_index, edge_index, kind, price_usd, and price_missing. Every TRANSFER row has a kind: token, native or internal. An internal row is ETH a contract sends while it runs a call, such as the ETH leg of a wrap. Add t.kind = \"internal\" to the pair and the day to read only the internal rows. A facts read names an address pair with one day, or one tx_id, whether it is a TRANSFER row-select or a count()/sum() aggregate: both endpoint addresses as {address: \"...\"} on from and to, with WHERE t.block_date = \"YYYY-MM-DD\", or WHERE t.tx_id = \"...\" on its own (on EVM networks tx_id is the 0x transaction hash). t.block_timestamp bounds in epoch milliseconds may narrow the day to a time window. One address, a day alone, a window of days, a block range or a bare LIMIT is not enough. A facts read holds at most 200 rows in a reply, has one relationship and no hop, and takes no ORDER BY: sort the page yourself.",
+	"- (from:Address)-[t:TRANSFER]->(to:Address) on USE facts returns individual transfer rows, not aggregates, with properties amount, amount_usd, asset_symbol, asset_contract, tx_id, block_height, block_timestamp, event_index, edge_index, kind, price_usd, and price_missing. Every TRANSFER row has a kind: token, native or internal. An internal row is ETH a contract sends while it runs a call, such as the ETH leg of a wrap. Add t.kind = \"internal\" to the pair and the day to read only the internal rows. A facts read names an address pair with one day, whether it is a TRANSFER row-select or a count()/sum() aggregate: both endpoint addresses as {address: \"...\"} on from and to, with WHERE t.block_date = \"YYYY-MM-DD\". A transaction is read on USE chain by its tx_id, not on facts. t.block_timestamp bounds in epoch milliseconds may narrow the day to a time window. One address, a day alone, a window of days, a block range or a bare LIMIT is not enough. A facts read holds at most 200 rows in a reply, has one relationship and no hop, and takes no ORDER BY: sort the page yourself.",
 	"- Facts graph labels include Address; the TRANSFER, SWAP, LIQUIDITY_ADD, LIQUIDITY_REMOVE and BRIDGE_CROSSING relationships each connect two Address nodes. Facts address keys match topology address values exactly.",
 	"- Topology relationships include FLOWS_TO, SWAPPED, OPERATED_BY, LINKED, and RISK_PROXIMITY between Address nodes, ADDED_LIQUIDITY and REMOVED_LIQUIDITY to and from Pool nodes, and BRIDGED to and from Chain nodes.",
 	"- (:Address)-[:OPERATED_BY]->(:Address) is the directed owner-to-operator edge: the transaction sender that moved the owner's tokens (ERC-20/721), or the event operator (ERC-1155); not the approved spender. Aggregate properties: tx_count, amount_usd_sum, first_seen_timestamp, last_seen_timestamp, and optional token_standard (ERC20/ERC721/ERC1155; absent when the pair is mixed-standard). Valuation fields: valuation_tracked_count, valued_count and the reason counters missing_valuation_price_count, unknown_quantity_count, unrepresentable_quantity_count and usd_range_count. valuation_complete is true when valued_count equals valuation_tracked_count, valuation_coverage_ratio is valued_count divided by valuation_tracked_count, and amount_usd_sum counts a transfer with no USD value as 0, so it is a floor unless valuation_complete is true. One edge per owner/operator pair; direct transfers with no operator create none; an owner never operates for itself. Topology-only, and a topology fact — not a risk label. Probe: MATCH (owner:Address)-[operation:OPERATED_BY]->(operator:Address {address: $addr}) RETURN owner.address AS owner, operation.tx_count AS tx_count ORDER BY operation.tx_count DESC LIMIT 10.",
@@ -628,20 +189,23 @@ const GRAPH_SCHEMA_HINTS = [
 	"- Pool is a second label on an Address: the pool of a swap route or liquidity event, with liquidity_added_usd, liquidity_removed_usd, liquidity_net_usd, provider_count and receiver_count. (:Address)-[:ADDED_LIQUIDITY]->(:Pool) and (:Pool)-[:REMOVED_LIQUIDITY]->(:Address) join named providers and receivers to the pool, with event_count, totals_raw, usd, unpriced_count, first_seen_height and last_seen_height; REMOVED_LIQUIDITY adds fees_raw, receiver_added_usd (USD the receiver itself added to the same pool) and receiver_provided. A receiver's profit from a pool is usd minus receiver_added_usd: receiver_provided false is a drain by a stranger, true with a large profit is the creator's rug pull.",
 	"- (:Address)-[:BRIDGED]->(:Chain) is outbound bridge use and (:Chain)-[:BRIDGED]->(:Address) inbound, with kinds, events, totals_raw, first_height, last_height and last_bridge_event_id. A Chain node (network, address) is the remote bridge endpoint, never an Address, so no FLOWS_TO walk passes through it.",
 	"- Pool trace rule, for every trace: 1. Enter a `:Pool` on any edge. 2. Leave a `:Pool` only on `REMOVED_LIQUIDITY`, to the address the liquidity was paid to. 3. Never leave a `:Pool` on `FLOWS_TO`. 4. Across a swap, follow `SWAPPED` from payer to recipient, between two different addresses. Do not walk through the pool. Rug-pull probe: MATCH (victim:Address {address: $addr})-[paid:FLOWS_TO]->(pool:Pool)-[removal:REMOVED_LIQUIDITY]->(receiver:Address) WHERE NOT victim:Pool AND receiver.address <> victim.address RETURN pool.address AS pool_address, receiver.address AS receiver_address, removal.usd AS removed_usd, removal.receiver_added_usd AS receiver_added_usd, removal.receiver_provided AS receiver_provided LIMIT 25.",
-	"- USE facts serves the single events. (payer:Address)-[s:SWAP]->(recipient:Address) is one row per swap route, self swaps included, with strength, reason, route_id and the sold_ and bought_ asset, amount and usd columns. (provider:Address)-[:LIQUIDITY_ADD]->(pool:Address) and (pool:Address)-[:LIQUIDITY_REMOVE]->(receiver:Address) are one row per liquidity event, with party_state and evidence_state. (sender:Address)-[c:BRIDGE_CROSSING]->(recipient:Address) is one row per bridge event. SWAP, LIQUIDITY_* and BRIDGE_CROSSING take the same rule as TRANSFER: an address pair with one day, or one tx_id. USD comes from the daily price services, never from a swap: with no price, USD is empty and the matching price_missing column is true (price_missing on TRANSFER, sold_price_missing and bought_price_missing on SWAP, amount0_price_missing and amount1_price_missing on LIQUIDITY_*). block_timestamp on TRANSFER, SWAP and LIQUIDITY_* rows is epoch milliseconds, in filters and in results; BRIDGE_CROSSING has none.",
+	"- USE facts serves the single events. (payer:Address)-[s:SWAP]->(recipient:Address) is one row per swap route, self swaps included, with strength, reason, route_id and the sold_ and bought_ asset, amount and usd columns. (provider:Address)-[:LIQUIDITY_ADD]->(pool:Address) and (pool:Address)-[:LIQUIDITY_REMOVE]->(receiver:Address) are one row per liquidity event, with party_state and evidence_state. (sender:Address)-[c:BRIDGE_CROSSING]->(recipient:Address) is one row per bridge event. SWAP, LIQUIDITY_* and BRIDGE_CROSSING take the same rule as TRANSFER: an address pair with one day. USD comes from the daily price services, never from a swap: with no price, USD is empty and the matching price_missing column is true (price_missing on TRANSFER, sold_price_missing and bought_price_missing on SWAP, amount0_price_missing and amount1_price_missing on LIQUIDITY_*). block_timestamp on TRANSFER, SWAP and LIQUIDITY_* rows is epoch milliseconds, in filters and in results; BRIDGE_CROSSING has none.",
 	"- A USE facts SWAP row carries no route: it has no pools and no families column. A read that names one of them, to return it, to filter on it or to order by it, is refused. The route of a swap stays a topology question. For the pools of the swaps of an address, read SWAPPED.pools and SWAPPED.families on USE topology, anchored on the payer or the recipient. SWAPPED has one link per payer, recipient, sold asset and bought asset, so its pools cover every route on the link, not one route.",
 	"- Traversal rule: for BFS, fixed-hop fallback, shortest-path, or manual FLOWS_TO traversal, exchange hot wallets are terminal endpoints only. Do not expand from, through, or classify exchange nodes as deposit, suspect, or intermediate candidates; filter every non-terminal node with is_exchange IS NULL. is_exchange is absent unless true, so a labelled node with no is_exchange is walked through, and is_scam, is_victim and is_sanctioned do not end a walk. At a Pool, follow the pool trace rule above.",
 	"- Pool guard: a trace walks FLOWS_TO and SWAPPED, so it crosses a swap from payer to recipient without passing through the pool. A walk may end at a Pool, but never starts at one or passes through one: its start and every address in its middle stay off a Pool. A fixed-hop walk adds WHERE NOT src:Pool AND NOT mid:Pool, each its own AND term, never inside an OR. A quantified or shortest-path walk puts the guards inside the path pattern, on the start and on up to 4 guarded hops before one last hop: MATCH p = SHORTEST 1 (a:Address {address: $from} WHERE NOT a:Pool) (()-[:FLOWS_TO|SWAPPED]-(via:Address) WHERE NOT via:Pool){0,4} ()-[:FLOWS_TO|SWAPPED]-(b:Address {address: $to}) RETURN [n IN nodes(p) | n.address] AS route LIMIT 5. ANY SHORTEST takes the same pattern. A route search asks for one path. An open target from one address: MATCH SHORTEST 1 (a:Address {address: $addr} WHERE NOT a:Pool) (()-[:FLOWS_TO|SWAPPED]-(via:Address) WHERE NOT via:Pool){0,4} ()-[:FLOWS_TO|SWAPPED]-(b:Address) RETURN b.address LIMIT 50. Use these shapes as written, changing only the addresses and the RETURN. A WHERE placed after a SHORTEST pattern runs after the shortest route is chosen, so it drops a route that crosses a pool instead of finding the route that avoids it.",
+	"- Call meta_schema {network} first when you need field names; it is cached for 24 hours. The two discovery reads below are the fallback.",
 	"- Start schema discovery with endpoint-safe property reads: MATCH (n:Address) RETURN n.address AS address, n.network AS network, n.labels AS labels, n.last_activity_timestamp AS last_activity_timestamp LIMIT 20",
 	"- Relationship discovery: MATCH (:Address)-[r:FLOWS_TO]->(:Address) RETURN r.amount_usd_sum AS amount_usd_sum, r.tx_count AS tx_count LIMIT 20",
 	"- Anchor every topology read that filters on a link property: put an address in its pattern. Without one, a read starts from every link of the type it names, and you should not count on the filter to narrow that: WHERE x.strength = 'swap' on SWAPPED checks every SWAPPED link, LIMIT stops the read only after enough rows match, and a filter that matches few or none can run to the 60 s topology limit and fail with query_timeout. Example: MATCH (a:Address {address: $addr})-[x:SWAPPED]->(b:Address) WHERE x.swap_count >= 2 RETURN b.address, x.swap_count LIMIT 25. Pick an address with few links: degree_out and degree_in are a rough guide, because they count neighbours, not links, and an address with hundreds of thousands of neighbours can fail the same way. Discovery probes with LIMIT and no filter stay valid. The queries of one batch share a 100 s budget; USE facts queries stop at 30 s.",
-	"- graph_query uses the active Chain Insights graph endpoint. Select the graph with USE topology for topology (address/FLOWS_TO/OPERATED_BY/LINKED graph with SWAPPED, ADDED_LIQUIDITY, REMOVED_LIQUIDITY, BRIDGED and the Pool label, unified recent+historical) and USE facts for bounded TRANSFER, SWAP, LIQUIDITY_ADD, LIQUIDITY_REMOVE and BRIDGE_CROSSING rows and enrichment, and USE chain for one keyed lookup on the chain node: a transaction by hash, a block by number or hash, or the head, and no address. On topology, address is the node grain, not the topology name.",
+	"- graph_query uses the active Chain Insights graph endpoint. Select the graph with USE topology for topology (address/FLOWS_TO/OPERATED_BY/LINKED graph with SWAPPED, ADDED_LIQUIDITY, REMOVED_LIQUIDITY, BRIDGED and the Pool label, unified recent+historical) and USE facts for bounded TRANSFER, SWAP, LIQUIDITY_ADD, LIQUIDITY_REMOVE and BRIDGE_CROSSING rows and enrichment, and USE chain for one keyed lookup on the chain node: a transaction by tx_id, a block by block_height or block_hash, an address at one block, or the head. On topology, address is the node grain, not the topology name.",
 	"- All graph_query calls are read-only. Never use CREATE, INSERT, MERGE, SET, DELETE, REMOVE, DROP, DETACH, ADD, CONNECT, DISCONNECT, ALTER, TRUNCATE, GRANT, or REVOKE.",
 	"- Use USE facts graph patterns for fact and enrichment reads. Do not query internal table namespaces directly."
 ].join("\n");
+const ROUTING_HEAD = routingHead();
 const SERVER_INSTRUCTIONS = [
 	"Chain Insights is an AML and graph-analysis MCP server for AI agents.",
 	CHAIN_INSIGHTS_WORKFLOW,
+	ROUTING_HEAD,
 	PICTURE_RULES,
 	GRAPH_SCHEMA_HINTS,
 	"Presentation rules: preserve tool summaries as returned; never truncate blockchain addresses or identity_resolution audit mappings."
@@ -649,6 +213,7 @@ const SERVER_INSTRUCTIONS = [
 const STATELESS_SERVER_INSTRUCTIONS = [
 	"Chain Insights is running as a stateless AML proxy for a host application.",
 	"Use meta_network_capabilities first when network support is unknown, then call graph_query or graph_query_batch as needed.",
+	ROUTING_HEAD,
 	PICTURE_RULES,
 	"Use wallet_balance to inspect the local payment wallet when payment setup is needed.",
 	GRAPH_SCHEMA_HINTS,
@@ -926,6 +491,11 @@ function registerLocalPrompts(server) {
 		description: "Inspect supported networks and available tools before selecting a network.",
 		argsSchema: {}
 	}, async () => promptResult("Use Chain Insights meta_network_capabilities. Report only the supported networks and available tools exactly as returned; do not infer unsupported networks.", "Network capabilities"));
+	server.registerPrompt("meta-schema", {
+		title: "Graph Schema",
+		description: "Read the live graph schema of one network before writing a query.",
+		argsSchema: { network: NETWORK_SCHEMA }
+	}, async ({ network }) => promptResult(`Use Chain Insights meta_schema with network ${network}. Report the labels, link types and fields exactly as returned; do not invent fields.`, "Graph schema"));
 	server.registerPrompt("meta-usage-status", {
 		title: "Usage Status",
 		description: "Check the caller's public free graph_query quota.",
@@ -1050,7 +620,7 @@ async function createProxy() {
 	const { loadConfig } = await import("./config-9MabJh5R.mjs").then((n) => n.t);
 	const { activeDataDir, findActiveWorkspace } = await import("./active-Dkf8AB1R.mjs").then((n) => n.t);
 	const { createConfiguredGraphMcpFetch, resolveGraphMcpEndpoint } = await import("./client-gsLi528K.mjs").then((n) => n.r);
-	const { loadSchema, saveSchema } = await import("./schema-cache-DJdU4MIP.mjs");
+	const { loadSchema, saveSchema } = await import("./schema-cache-BT-kHy_r.mjs");
 	const proxyMode = resolveMcpProxyMode();
 	const workspaceArtifactsEnabled = proxyMode === "workspace";
 	const loadedConfig = await loadConfig();
@@ -1179,6 +749,28 @@ async function createProxy() {
 		}
 		return jsonTextResult(cleanNetworkCapabilities(void 0));
 	});
+	const schemaDependencies = {
+		endpoint: graphMcpEndpoint,
+		withClient: async (fn) => {
+			if (!remoteConnected) throw new GraphSchemaError(`${remoteUnavailableMessage ?? `Chain Insights Graph is not connected at ${graphMcpEndpoint}`}. Restart the Chain Insights MCP proxy after the endpoint is reachable.`);
+			return fn(remoteClient);
+		},
+		describeFailure: (err) => remoteCallFailureText("meta_schema", err)
+	};
+	server.registerTool("meta_schema", {
+		title: META_SCHEMA_TITLE,
+		description: KNOWN_PUBLIC_TOOL_DESCRIPTIONS.meta_schema,
+		inputSchema: {
+			network: NETWORK_SCHEMA,
+			refresh: z.boolean().optional().describe("Rebuild the schema now instead of reading the 24 hour cache.")
+		},
+		annotations: {
+			readOnlyHint: true,
+			destructiveHint: false,
+			idempotentHint: true,
+			openWorldHint: true
+		}
+	}, async (args) => handleMetaSchema(args, schemaDependencies));
 	server.registerTool("meta_usage_status", {
 		title: "Usage Status",
 		description: KNOWN_PUBLIC_TOOL_DESCRIPTIONS.meta_usage_status,
@@ -1348,6 +940,7 @@ async function createProxy() {
 				"",
 				"Investigation tools:",
 				"- meta_network_capabilities: inspect supported networks and available tools.",
+				"- meta_schema: read the live graph schema of one network: labels, link types and field names. Cached for 24 hours.",
 				"- meta_usage_status: check the caller public free graph_query quota.",
 				"- meta_subscription_status: check the caller CIA subscription window end, daily allowance, consumption, and tier.",
 				"- graph_query: run read-only GQL/Cypher through the universal graph endpoint. Use USE topology or USE facts.",
@@ -1363,6 +956,7 @@ async function createProxy() {
 				"",
 				"Available graph-backed tools:",
 				"- meta_network_capabilities: inspect supported networks and available tools.",
+				"- meta_schema: read the live graph schema of one network: labels, link types and field names. Cached for 24 hours.",
 				"- meta_usage_status: check the caller public free graph_query quota.",
 				"- meta_subscription_status: check the caller CIA subscription window end, daily allowance, consumption, and tier.",
 				"- graph_query: run read-only GQL/Cypher through the universal graph endpoint. Use USE topology or USE facts.",