chain-insights 0.44.0 → 0.45.0

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";
@@ -70,461 +71,10 @@ 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.
-*/
-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;
-}
-/**
-* 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.
-*/
-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);
-}
-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",
@@ -580,6 +130,7 @@ function resolveMcpProxyMode(env = process.env) {
 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 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.",
@@ -632,6 +183,7 @@ const GRAPH_SCHEMA_HINTS = [
 	"- 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.",
@@ -926,6 +478,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 +607,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 +736,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 +927,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 +943,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.",