chain-insights 0.48.0 → 0.49.0

package/dist/cli.cjs

@@ -152,7 +152,7 @@ async function printNetworkCapability(name, opts) {
 async function printNetworkSchema(name, opts) {
 	const { loadConfig } = await Promise.resolve().then(() => require("./config-BxtMoo9c.cjs")).then((n) => n.config_exports);
 	const { resolveGraphMcpEndpoint } = await Promise.resolve().then(() => require("./client-Ypw9BNbn.cjs")).then((n) => n.client_exports);
-	const { formatGraphSchemaText, getGraphSchema } = await Promise.resolve().then(() => require("./graph-schema-CgWgVltN.cjs")).then((n) => n.graph_schema_exports);
+	const { formatGraphSchemaText, getGraphSchema } = await Promise.resolve().then(() => require("./graph-schema-CXD7NtEX.cjs")).then((n) => n.graph_schema_exports);
 	const config = await loadConfig();
 	const schema = await getGraphSchema({
 		network: name,

package/dist/cli.mjs

@@ -150,7 +150,7 @@ async function printNetworkCapability(name, opts) {
 async function printNetworkSchema(name, opts) {
 	const { loadConfig } = await import("./config-9MabJh5R.mjs").then((n) => n.t);
 	const { resolveGraphMcpEndpoint } = await import("./client-gsLi528K.mjs").then((n) => n.r);
-	const { formatGraphSchemaText, getGraphSchema } = await import("./graph-schema-DhVJiVba.mjs").then((n) => n.i);
+	const { formatGraphSchemaText, getGraphSchema } = await import("./graph-schema-D7wSNOT5.mjs").then((n) => n.i);
 	const config = await loadConfig();
 	const schema = await getGraphSchema({
 		network: name,

package/dist/{graph-schema-CgWgVltN.cjs → graph-schema-CXD7NtEX.cjs}

@@ -16,11 +16,12 @@ let node_crypto = require("node:crypto");
 *
 * 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).
+* - node, {network, address, in_offset?, out_offset?}: one address with up to
+*   250 newest senders and 250 newest receivers, a text summary and
+*   chain-insights.flows.v1 in structuredContent. Composed from at most five
+*   anchored graph_query reads on the topology graph: the node, then its
+*   outgoing and its incoming FLOWS_TO, newest first, two reads a side because
+*   a reply holds at most 200 rows.
 * - 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
@@ -80,24 +81,35 @@ const NODE_FIELDS = "b.address AS address, b.labels AS labels, b.is_exchange AS
 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.
+* The anchored reads of one page: the node, then the receivers, then the
+* senders. Each side asks for one row more than it shows: the extra row says
+* another page exists. A reply holds at most FLOWS_READ_ROWS rows, so a side
+* is read in chunks on the same order, each starting where the last one ends.
 */
 function flowsReadsFor(address, inOffset, outOffset) {
-	const page = (offset) => `${PAGE_ORDER}${offset > 0 ? ` SKIP ${offset}` : ""} LIMIT 13`;
+	const side = (id, offset, match) => {
+		const reads = [];
+		for (let done = 0; done < 251; done += 200) {
+			const skip = offset + done;
+			const limit = Math.min(200, 251 - done);
+			reads.push({
+				id,
+				query: `USE topology MATCH ${match} RETURN ${PARTY_FIELDS}${PAGE_ORDER}${skip > 0 ? ` SKIP ${skip}` : ""} LIMIT ${limit}`,
+				skip,
+				limit
+			});
+		}
+		return reads;
+	};
 	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)}`
+			query: `USE topology MATCH (b:Address {address: '${address}'}) RETURN ${NODE_FIELDS} LIMIT 1`,
+			skip: 0,
+			limit: 1
 		},
-		{
-			id: "in",
-			query: `USE topology MATCH (b:Address)-[f:FLOWS_TO]->(a:Address {address: '${address}'}) RETURN ${PARTY_FIELDS}${page(inOffset)}`
-		}
+		...side("out", outOffset, `(a:Address {address: '${address}'})-[f:FLOWS_TO]->(b:Address)`),
+		...side("in", inOffset, `(b:Address)-[f:FLOWS_TO]->(a:Address {address: '${address}'})`)
 	];
 }
 /** The role word of an address, first match wins. */
@@ -129,17 +141,22 @@ function flowsNodeOf(row) {
 }
 function assembleFlowView(network, page, senders, receivers, truncated) {
 	const center = flowsNodeOf(page.center);
+	const cursor = {
+		in_offset: page.inOffset + senders.length,
+		out_offset: page.outOffset + receivers.length
+	};
 	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
+		cursor,
+		truncated,
+		remaining: {
+			senders: Math.max(0, center.degree_in - cursor.in_offset),
+			receivers: Math.max(0, center.degree_out - cursor.out_offset)
+		}
 	};
 	const seen = /* @__PURE__ */ new Set([center.address]);
 	const add = (row, incoming) => {
@@ -162,7 +179,18 @@ function assembleFlowView(network, page, senders, receivers, truncated) {
 	return view;
 }
 function fitsFlowBudget(view) {
-	return view.nodes.length <= 60 && JSON.stringify(view).length < 4e4;
+	return view.nodes.length <= 500 && JSON.stringify(view).length < 14e4;
+}
+/**
+* How many senders and receivers stay after `drops` of the oldest links go,
+* one at a time from the longer side, the senders first on a tie.
+*/
+function keptAfterDrops(senders, receivers, drops) {
+	let s = senders;
+	let r = receivers;
+	for (let left = Math.min(drops, s + r); left > 0; left -= 1) if (s >= r) s -= 1;
+	else r -= 1;
+	return [s, r];
 }
 /**
 * flows.v1 from one page: the centre first, then the senders and the
@@ -170,18 +198,27 @@ function fitsFlowBudget(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.
+*
+* Each dropped link only makes the view smaller, so the fewest drops that fit
+* are found by halving: about ten views are measured for a full page, not one
+* per dropped link.
 */
 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);
+	const overflow = page.senders.length > 250 || page.receivers.length > 250;
+	const senders = page.senders.slice(0, 250);
+	const receivers = page.receivers.slice(0, 250);
+	const viewAfter = (drops) => {
+		const [s, r] = keptAfterDrops(senders.length, receivers.length, drops);
+		return assembleFlowView(network, page, senders.slice(0, s), receivers.slice(0, r), overflow || drops > 0);
+	};
+	let low = 0;
+	let high = senders.length + receivers.length;
+	while (low < high) {
+		const mid = low + high >> 1;
+		if (fitsFlowBudget(viewAfter(mid))) high = mid;
+		else low = mid + 1;
 	}
+	return viewAfter(low);
 }
 function formatFlowsUsd(value) {
 	if (!(value > 0)) return "$0";
@@ -321,6 +358,12 @@ function refusalText(answer) {
 	const rest = textCode === code ? text.replace(CODE_PREFIX, "") : text;
 	return rest ? `${code}: ${rest}` : `${code}: the graph endpoint refused the read`;
 }
+/** The endpoint says it cut the reply short (facts.query.truncated). */
+function cutByEndpoint(answer) {
+	const facts = isRecord$1(answer.structuredContent) ? answer.structuredContent.facts : void 0;
+	const query = isRecord$1(facts) ? facts.query : void 0;
+	return isRecord$1(query) && query.truncated === true;
+}
 function rowsOf(answer) {
 	const facts = isRecord$1(answer.structuredContent) ? answer.structuredContent.facts : void 0;
 	const query = isRecord$1(facts) ? facts.query : void 0;
@@ -350,15 +393,23 @@ function checkOffset(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.
+* first, so an address the graph does not hold costs one read; then the
+* receivers and the senders, the chunks of a side joined in order. A chunk that
+* comes back short, and not cut by the endpoint, ends its side, so the next
+* chunk of that side is not read or billed. 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$1(unavailable);
-	const rows = {};
+	const rows = {
+		node: [],
+		out: [],
+		in: []
+	};
+	const ended = /* @__PURE__ */ new Set();
 	for (const read of flowsReadsFor(address, inOffset, outOffset)) {
+		if (ended.has(read.id)) continue;
 		let answer;
 		try {
 			answer = await deps.graphQuery({
@@ -371,13 +422,14 @@ async function runNode(deps, network, address, inOffset, outOffset) {
 		if (answer.isError === true) return errorResult$1(refusalText(answer));
 		const found = rowsOf(answer);
 		if (!found) return errorResult$1("graph_query_failed: the graph endpoint answered without chain-insights.result.v1 rows");
-		rows[read.id] = found;
+		rows[read.id].push(...found);
 		if (read.id === "node" && found.length === 0) return errorResult$1(`${address} is not in the ${network} topology graph`);
+		if (found.length < read.limit && !cutByEndpoint(answer)) ended.add(read.id);
 	}
 	const view = buildFlowView(network, {
-		center: rows.node?.[0] ?? {},
-		senders: rows.in ?? [],
-		receivers: rows.out ?? [],
+		center: rows.node[0] ?? {},
+		senders: rows.in,
+		receivers: rows.out,
 		inOffset,
 		outOffset
 	});
@@ -456,7 +508,7 @@ async function handleGraphExpand(args, deps) {
 	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.";
+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 (up to 250 a side, from the offsets); billed as at most five 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/graph-schema-cache.ts
 /** How long a schema with a failed read stays fresh. */

package/dist/{graph-schema-DhVJiVba.mjs → graph-schema-D7wSNOT5.mjs}

@@ -15,11 +15,12 @@ import { createHash } from "node:crypto";
 *
 * 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).
+* - node, {network, address, in_offset?, out_offset?}: one address with up to
+*   250 newest senders and 250 newest receivers, a text summary and
+*   chain-insights.flows.v1 in structuredContent. Composed from at most five
+*   anchored graph_query reads on the topology graph: the node, then its
+*   outgoing and its incoming FLOWS_TO, newest first, two reads a side because
+*   a reply holds at most 200 rows.
 * - 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
@@ -79,24 +80,35 @@ const NODE_FIELDS = "b.address AS address, b.labels AS labels, b.is_exchange AS
 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.
+* The anchored reads of one page: the node, then the receivers, then the
+* senders. Each side asks for one row more than it shows: the extra row says
+* another page exists. A reply holds at most FLOWS_READ_ROWS rows, so a side
+* is read in chunks on the same order, each starting where the last one ends.
 */
 function flowsReadsFor(address, inOffset, outOffset) {
-	const page = (offset) => `${PAGE_ORDER}${offset > 0 ? ` SKIP ${offset}` : ""} LIMIT 13`;
+	const side = (id, offset, match) => {
+		const reads = [];
+		for (let done = 0; done < 251; done += 200) {
+			const skip = offset + done;
+			const limit = Math.min(200, 251 - done);
+			reads.push({
+				id,
+				query: `USE topology MATCH ${match} RETURN ${PARTY_FIELDS}${PAGE_ORDER}${skip > 0 ? ` SKIP ${skip}` : ""} LIMIT ${limit}`,
+				skip,
+				limit
+			});
+		}
+		return reads;
+	};
 	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)}`
+			query: `USE topology MATCH (b:Address {address: '${address}'}) RETURN ${NODE_FIELDS} LIMIT 1`,
+			skip: 0,
+			limit: 1
 		},
-		{
-			id: "in",
-			query: `USE topology MATCH (b:Address)-[f:FLOWS_TO]->(a:Address {address: '${address}'}) RETURN ${PARTY_FIELDS}${page(inOffset)}`
-		}
+		...side("out", outOffset, `(a:Address {address: '${address}'})-[f:FLOWS_TO]->(b:Address)`),
+		...side("in", inOffset, `(b:Address)-[f:FLOWS_TO]->(a:Address {address: '${address}'})`)
 	];
 }
 /** The role word of an address, first match wins. */
@@ -128,17 +140,22 @@ function flowsNodeOf(row) {
 }
 function assembleFlowView(network, page, senders, receivers, truncated) {
 	const center = flowsNodeOf(page.center);
+	const cursor = {
+		in_offset: page.inOffset + senders.length,
+		out_offset: page.outOffset + receivers.length
+	};
 	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
+		cursor,
+		truncated,
+		remaining: {
+			senders: Math.max(0, center.degree_in - cursor.in_offset),
+			receivers: Math.max(0, center.degree_out - cursor.out_offset)
+		}
 	};
 	const seen = /* @__PURE__ */ new Set([center.address]);
 	const add = (row, incoming) => {
@@ -161,7 +178,18 @@ function assembleFlowView(network, page, senders, receivers, truncated) {
 	return view;
 }
 function fitsFlowBudget(view) {
-	return view.nodes.length <= 60 && JSON.stringify(view).length < 4e4;
+	return view.nodes.length <= 500 && JSON.stringify(view).length < 14e4;
+}
+/**
+* How many senders and receivers stay after `drops` of the oldest links go,
+* one at a time from the longer side, the senders first on a tie.
+*/
+function keptAfterDrops(senders, receivers, drops) {
+	let s = senders;
+	let r = receivers;
+	for (let left = Math.min(drops, s + r); left > 0; left -= 1) if (s >= r) s -= 1;
+	else r -= 1;
+	return [s, r];
 }
 /**
 * flows.v1 from one page: the centre first, then the senders and the
@@ -169,18 +197,27 @@ function fitsFlowBudget(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.
+*
+* Each dropped link only makes the view smaller, so the fewest drops that fit
+* are found by halving: about ten views are measured for a full page, not one
+* per dropped link.
 */
 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);
+	const overflow = page.senders.length > 250 || page.receivers.length > 250;
+	const senders = page.senders.slice(0, 250);
+	const receivers = page.receivers.slice(0, 250);
+	const viewAfter = (drops) => {
+		const [s, r] = keptAfterDrops(senders.length, receivers.length, drops);
+		return assembleFlowView(network, page, senders.slice(0, s), receivers.slice(0, r), overflow || drops > 0);
+	};
+	let low = 0;
+	let high = senders.length + receivers.length;
+	while (low < high) {
+		const mid = low + high >> 1;
+		if (fitsFlowBudget(viewAfter(mid))) high = mid;
+		else low = mid + 1;
 	}
+	return viewAfter(low);
 }
 function formatFlowsUsd(value) {
 	if (!(value > 0)) return "$0";
@@ -320,6 +357,12 @@ function refusalText(answer) {
 	const rest = textCode === code ? text.replace(CODE_PREFIX, "") : text;
 	return rest ? `${code}: ${rest}` : `${code}: the graph endpoint refused the read`;
 }
+/** The endpoint says it cut the reply short (facts.query.truncated). */
+function cutByEndpoint(answer) {
+	const facts = isRecord$1(answer.structuredContent) ? answer.structuredContent.facts : void 0;
+	const query = isRecord$1(facts) ? facts.query : void 0;
+	return isRecord$1(query) && query.truncated === true;
+}
 function rowsOf(answer) {
 	const facts = isRecord$1(answer.structuredContent) ? answer.structuredContent.facts : void 0;
 	const query = isRecord$1(facts) ? facts.query : void 0;
@@ -349,15 +392,23 @@ function checkOffset(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.
+* first, so an address the graph does not hold costs one read; then the
+* receivers and the senders, the chunks of a side joined in order. A chunk that
+* comes back short, and not cut by the endpoint, ends its side, so the next
+* chunk of that side is not read or billed. 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$1(unavailable);
-	const rows = {};
+	const rows = {
+		node: [],
+		out: [],
+		in: []
+	};
+	const ended = /* @__PURE__ */ new Set();
 	for (const read of flowsReadsFor(address, inOffset, outOffset)) {
+		if (ended.has(read.id)) continue;
 		let answer;
 		try {
 			answer = await deps.graphQuery({
@@ -370,13 +421,14 @@ async function runNode(deps, network, address, inOffset, outOffset) {
 		if (answer.isError === true) return errorResult$1(refusalText(answer));
 		const found = rowsOf(answer);
 		if (!found) return errorResult$1("graph_query_failed: the graph endpoint answered without chain-insights.result.v1 rows");
-		rows[read.id] = found;
+		rows[read.id].push(...found);
 		if (read.id === "node" && found.length === 0) return errorResult$1(`${address} is not in the ${network} topology graph`);
+		if (found.length < read.limit && !cutByEndpoint(answer)) ended.add(read.id);
 	}
 	const view = buildFlowView(network, {
-		center: rows.node?.[0] ?? {},
-		senders: rows.in ?? [],
-		receivers: rows.out ?? [],
+		center: rows.node[0] ?? {},
+		senders: rows.in,
+		receivers: rows.out,
 		inOffset,
 		outOffset
 	});
@@ -455,7 +507,7 @@ async function handleGraphExpand(args, deps) {
 	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.";
+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 (up to 250 a side, from the offsets); billed as at most five 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/graph-schema-cache.ts
 /** How long a schema with a failed read stays fresh. */
@@ -911,4 +963,4 @@ async function handleMetaSchema(args, deps) {
 //#endregion
 export { handleMetaSchema as a, GRAPH_EXPAND_TITLE as c, graph_schema_exports as i, GRAPH_EXPAND_TOOL as l, META_SCHEMA_DESCRIPTION as n, FLOWS_MAX_OFFSET as o, META_SCHEMA_TITLE as r, GRAPH_EXPAND_DESCRIPTION as s, GraphSchemaError as t, handleGraphExpand as u };
 
-//# sourceMappingURL=graph-schema-DhVJiVba.mjs.map
+//# sourceMappingURL=graph-schema-D7wSNOT5.mjs.map