chain-insights 0.71.4 → 0.73.2

package/dist/{graph-schema-BoUMa03H.cjs → graph-schema-BGbJumCY.cjs}

@@ -1,6 +1,6 @@
 const require_rolldown_runtime = require("./rolldown-runtime-C0BPl7ul.cjs");
-const require_client = require("./client-Ypw9BNbn.cjs");
-const require_capabilities = require("./capabilities-DGavTSoW.cjs");
+const require_client = require("./client-C9uwHnBS.cjs");
+const require_capabilities = require("./capabilities-Ds3320iS.cjs");
 const require_cache_location = require("./cache-location-CBVzUIxq.cjs");
 let node_path = require("node:path");
 node_path = require_rolldown_runtime.__toESM(node_path, 1);
@@ -45,13 +45,42 @@ let node_crypto = require("node:crypto");
 const FLOWS_SCHEMA = "chain-insights.flows.v1";
 const GRAPH_EXPAND_TOOL = "graph_expand";
 const FLOWS_NETWORK = "robinhood";
+/** How many senders and how many receivers one page shows, at most. */
+const FLOWS_PER_SIDE = 250;
+/** The view data of one answer: at most this many addresses, the centre included... */
+const FLOWS_MAX_NODES = 500;
+/**
+* ...and under this many characters of JSON. Hosts drop an app tool result
+* over about 150,000 characters.
+*/
+const FLOWS_MAX_CHARS = 14e4;
+/**
+* The graph endpoint cuts a reply at 200 rows, whatever the LIMIT, so one side
+* of a page is read in reads of at most this many rows.
+*/
+const FLOWS_READ_ROWS = 200;
 /** Where a graph_expand page may start on each side, at most. */
 const FLOWS_MAX_OFFSET = 1e4;
 const TRANSFERS_SCHEMA = "chain-insights.transfers.v1";
+/** A link answer lists at most this many transfers... */
+const TRANSFERS_MAX = 50;
+/**
+* ...from the rows one read brings back. A facts read takes no ORDER BY and
+* the server cuts a reply at 200 rows, so the read asks for the whole cap and
+* the newest rows are picked here.
+*/
+const TRANSFERS_READ_ROWS = 200;
+/** The text of a link answer names at most this many transfers. */
+const TRANSFERS_SUMMARY_ROWS = 5;
+/** A paged link answer reads at most this many days (a week) in one call: a sparse link costs at most this many reads a page, and a week of it comes back at once. */
+const TRANSFERS_MAX_DAYS = 7;
+/** Where a paged link answer stops reading back when the caller names no first_day. */
+const TRANSFERS_FLOOR_DAY = "2015-01-01";
 const ADDRESS_SCHEMA = "chain-insights.address.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 INVALID_DAY_TEXT = "invalid_day: day must be a calendar date written YYYY-MM-DD (UTC), for example 2026-07-10";
 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 INVALID_LIMIT_TEXT = "invalid_limit: limit must be a whole number from 1 to 50";
 const INVALID_SKIP_TEXT = "invalid_skip: skip must be a whole number of 0 or more";
@@ -90,7 +119,7 @@ function normalizeFlowsDay(raw) {
 * 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`;
+	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 ${TRANSFERS_READ_ROWS}`;
 }
 /** The UTC day before a YYYY-MM-DD day. */
 function dayBefore(day) {
@@ -139,9 +168,9 @@ const PAGE_ORDER = " ORDER BY f.last_seen_timestamp DESC, b.address";
 function flowsReadsFor(address, inOffset, outOffset) {
 	const side = (id, offset, match) => {
 		const reads = [];
-		for (let done = 0; done < 251; done += 200) {
+		for (let done = 0; done < 251; done += FLOWS_READ_ROWS) {
 			const skip = offset + done;
-			const limit = Math.min(200, 251 - done);
+			const limit = Math.min(FLOWS_READ_ROWS, 251 - done);
 			reads.push({
 				id,
 				query: `USE topology MATCH ${match} RETURN ${PARTY_FIELDS}${PAGE_ORDER}${skip > 0 ? ` SKIP ${skip}` : ""} LIMIT ${limit}`,
@@ -234,7 +263,7 @@ function assembleFlowView(network, page, senders, receivers, truncated) {
 	return view;
 }
 function fitsFlowBudget(view) {
-	return view.nodes.length <= 500 && JSON.stringify(view).length < 14e4;
+	return view.nodes.length <= FLOWS_MAX_NODES && JSON.stringify(view).length < FLOWS_MAX_CHARS;
 }
 /**
 * How many senders and receivers stay after `drops` of the oldest links go,
@@ -259,9 +288,9 @@ function keptAfterDrops(senders, receivers, drops) {
 * per dropped link.
 */
 function buildFlowView(network, page) {
-	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 overflow = page.senders.length > FLOWS_PER_SIDE || page.receivers.length > FLOWS_PER_SIDE;
+	const senders = page.senders.slice(0, FLOWS_PER_SIDE);
+	const receivers = page.receivers.slice(0, FLOWS_PER_SIDE);
 	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);
@@ -368,8 +397,8 @@ function buildTransfersView(network, from, to, day, rows) {
 		from,
 		to,
 		day,
-		transfers: newestFirst.slice(0, 50),
-		truncated: newestFirst.length > 50
+		transfers: newestFirst.slice(0, TRANSFERS_MAX),
+		truncated: newestFirst.length > TRANSFERS_MAX
 	};
 }
 function transferLine(transfer) {
@@ -381,8 +410,8 @@ function transfersSummary(view) {
 	const span = paged && view.through_day !== view.day ? `${view.through_day} to ${view.day}` : view.day;
 	const head = `Transfers from ${view.from} to ${view.to} on ${span} (UTC) on ${view.network}`;
 	if (view.transfers.length === 0) return paged && view.next ? `${head}: none; earlier days remain before ${view.next.day}.` : `${head}: none.`;
-	const lines = [`${head}: ${view.truncated ? paged ? `${view.transfers.length}, and a day holds more than one read lists` : `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;
+	const lines = [`${head}: ${view.truncated ? paged ? `${view.transfers.length}, and a day holds more than one read lists` : `the newest ${view.transfers.length}, and the day holds more` : `${view.transfers.length}`}, newest first.`, ...view.transfers.slice(0, TRANSFERS_SUMMARY_ROWS).map(transferLine)];
+	const rest = view.transfers.length - TRANSFERS_SUMMARY_ROWS;
 	if (rest > 0) lines.push(`- and ${rest} more in the picture.`);
 	if (paged && view.next) lines.push(`- earlier transfers remain, from ${view.next.day} back.`);
 	return lines.join("\n");
@@ -439,7 +468,7 @@ function rowsOf(answer) {
 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()}"` };
+	if (rawNetwork !== FLOWS_NETWORK) 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. */
@@ -449,10 +478,10 @@ function checkAddress(raw, name) {
 	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" };
+	return normalizeFlowsDay(raw) ?? { error: INVALID_DAY_TEXT };
 }
 function checkLimit(value) {
-	if (typeof value !== "number" || !Number.isInteger(value) || value < 1 || value > 50) return { error: INVALID_LIMIT_TEXT };
+	if (typeof value !== "number" || !Number.isInteger(value) || value < 1 || value > TRANSFERS_MAX) return { error: INVALID_LIMIT_TEXT };
 	return value;
 }
 function checkSkip(value) {
@@ -469,7 +498,7 @@ function checkFirstDay(value, day) {
 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 };
+	if (value > FLOWS_MAX_OFFSET) return { error: OFFSET_TOO_LARGE_TEXT };
 	return value;
 }
 /**
@@ -565,7 +594,7 @@ async function readDay(deps, network, from, to, day) {
 	if (!rows) return { error: "graph_query_failed: the graph endpoint answered without chain-insights.result.v1 rows" };
 	return {
 		rows: rows.map(transferOf).sort((a, b) => (b.block_timestamp ?? -Infinity) - (a.block_timestamp ?? -Infinity)),
-		cut: rows.length >= 200
+		cut: rows.length >= TRANSFERS_READ_ROWS
 	};
 }
 /**
@@ -578,7 +607,7 @@ async function readDay(deps, network, from, to, day) {
 async function runLinkPage(deps, network, from, to, day, page) {
 	const unavailable = deps.unavailable?.();
 	if (unavailable) return errorResult$1(unavailable);
-	const floor = page.firstDay ?? "2015-01-01";
+	const floor = page.firstDay ?? TRANSFERS_FLOOR_DAY;
 	const transfers = [];
 	let current = day;
 	let skip = page.skip;
@@ -588,7 +617,7 @@ async function runLinkPage(deps, network, from, to, day, page) {
 	let next = null;
 	for (;;) {
 		if (current < floor) break;
-		if (daysRead >= 7) {
+		if (daysRead >= TRANSFERS_MAX_DAYS) {
 			next = {
 				day: current,
 				skip
@@ -806,12 +835,12 @@ async function saveGraphSchemaCache(network, document, endpoint, complete, now)
 * adds a note. It never fails the tool.
 */
 var graph_schema_exports = /* @__PURE__ */ require_rolldown_runtime.__exportAll({
-	ADDRESS_SAMPLE_LIMIT: () => 20,
+	ADDRESS_SAMPLE_LIMIT: () => ADDRESS_SAMPLE_LIMIT,
 	FACTS_TRANSFER_COLUMNS: () => FACTS_TRANSFER_COLUMNS,
 	GRAPH_SCHEMA_ID: () => GRAPH_SCHEMA_ID,
 	GRAPH_SCHEMA_SOURCE: () => GRAPH_SCHEMA_SOURCE,
 	GraphSchemaError: () => GraphSchemaError,
-	LINK_SAMPLE_LIMIT: () => 5,
+	LINK_SAMPLE_LIMIT: () => LINK_SAMPLE_LIMIT,
 	META_SCHEMA_DESCRIPTION: () => META_SCHEMA_DESCRIPTION,
 	META_SCHEMA_TITLE: () => META_SCHEMA_TITLE,
 	SAMPLED_LINK_TYPES: () => SAMPLED_LINK_TYPES,
@@ -827,6 +856,9 @@ const GRAPH_SCHEMA_ID = "chain-insights.graph-schema.v1";
 const GRAPH_SCHEMA_SOURCE = "live catalog";
 const META_SCHEMA_TITLE = "Graph schema";
 const META_SCHEMA_DESCRIPTION = "Return the live graph schema of one network: the labels, the link types, the field names of an address and of each main link, the indexes, the USE facts relationships with the TRANSFER columns, and the USE chain lookups. Call it first when you need field names. It is cached for 24 hours; pass refresh=true to rebuild it.";
+/** Fields of an address come from this many sampled nodes, and of a link from this many sampled links. */
+const ADDRESS_SAMPLE_LIMIT = 20;
+const LINK_SAMPLE_LIMIT = 5;
 /** The link types an agent queries. Each is sampled only when the graph lists it. */
 const SAMPLED_LINK_TYPES = [
 	"FLOWS_TO",
@@ -876,10 +908,10 @@ const CATALOG_READS = {
 	}
 };
 function addressSampleQuery() {
-	return `USE topology MATCH (a:Address) RETURN keys(a) AS keys LIMIT 20`;
+	return `USE topology MATCH (a:Address) RETURN keys(a) AS keys LIMIT ${ADDRESS_SAMPLE_LIMIT}`;
 }
 function linkSampleQuery(linkType) {
-	return `USE topology MATCH ()-[r:${linkType}]->() RETURN keys(r) AS keys LIMIT 5`;
+	return `USE topology MATCH ()-[r:${linkType}]->() RETURN keys(r) AS keys LIMIT ${LINK_SAMPLE_LIMIT}`;
 }
 /** A refusal with its own words for the caller: a bad argument, an unserved network, an endpoint that is down. */
 var GraphSchemaError = class extends Error {
@@ -1053,7 +1085,7 @@ async function buildGraphSchema(options) {
 			if (rows) topology.samples[type] = unionOfKeys(rows);
 		}
 		const unsampled = topology.link_types.filter((type) => !SAMPLED_LINK_TYPES.includes(type));
-		if (unsampled.length > 0) remarks.push(`Link types with no sample: ${unsampled.join(", ")}. Read the keys of one with USE topology MATCH ()-[r:<TYPE>]->() RETURN keys(r) AS keys LIMIT 5.`);
+		if (unsampled.length > 0) remarks.push(`Link types with no sample: ${unsampled.join(", ")}. Read the keys of one with USE topology MATCH ()-[r:<TYPE>]->() RETURN keys(r) AS keys LIMIT ${LINK_SAMPLE_LIMIT}.`);
 	}
 	const facts = {
 		relationships: [],
@@ -1231,6 +1263,12 @@ Object.defineProperty(exports, "META_SCHEMA_TITLE", {
 		return META_SCHEMA_TITLE;
 	}
 });
+Object.defineProperty(exports, "TRANSFERS_MAX", {
+	enumerable: true,
+	get: function() {
+		return TRANSFERS_MAX;
+	}
+});
 Object.defineProperty(exports, "graph_schema_exports", {
 	enumerable: true,
 	get: function() {

package/dist/{graph-schema-DqZUTnP0.mjs → graph-schema-ClqjzgrM.mjs}

@@ -1,6 +1,6 @@
 import { t as __exportAll } from "./rolldown-runtime-8H4AJuhK.mjs";
-import { t as PaymentRequiredError } from "./client-gsLi528K.mjs";
-import { n as findNetworkCapability, r as mirrorGraphNetworkCapabilities } from "./capabilities-BBVDIECk.mjs";
+import { t as PaymentRequiredError } from "./client-7qOfAdpH.mjs";
+import { n as findNetworkCapability, r as mirrorGraphNetworkCapabilities } from "./capabilities-DxojbX4D.mjs";
 import { n as chainInsightsHome, t as CACHE_TTL_MS } from "./cache-location-BO2XkfgI.mjs";
 import path from "node:path";
 import { mkdir, readFile, rename, writeFile } from "node:fs/promises";
@@ -44,13 +44,42 @@ import { createHash } from "node:crypto";
 const FLOWS_SCHEMA = "chain-insights.flows.v1";
 const GRAPH_EXPAND_TOOL = "graph_expand";
 const FLOWS_NETWORK = "robinhood";
+/** How many senders and how many receivers one page shows, at most. */
+const FLOWS_PER_SIDE = 250;
+/** The view data of one answer: at most this many addresses, the centre included... */
+const FLOWS_MAX_NODES = 500;
+/**
+* ...and under this many characters of JSON. Hosts drop an app tool result
+* over about 150,000 characters.
+*/
+const FLOWS_MAX_CHARS = 14e4;
+/**
+* The graph endpoint cuts a reply at 200 rows, whatever the LIMIT, so one side
+* of a page is read in reads of at most this many rows.
+*/
+const FLOWS_READ_ROWS = 200;
 /** Where a graph_expand page may start on each side, at most. */
 const FLOWS_MAX_OFFSET = 1e4;
 const TRANSFERS_SCHEMA = "chain-insights.transfers.v1";
+/** A link answer lists at most this many transfers... */
+const TRANSFERS_MAX = 50;
+/**
+* ...from the rows one read brings back. A facts read takes no ORDER BY and
+* the server cuts a reply at 200 rows, so the read asks for the whole cap and
+* the newest rows are picked here.
+*/
+const TRANSFERS_READ_ROWS = 200;
+/** The text of a link answer names at most this many transfers. */
+const TRANSFERS_SUMMARY_ROWS = 5;
+/** A paged link answer reads at most this many days (a week) in one call: a sparse link costs at most this many reads a page, and a week of it comes back at once. */
+const TRANSFERS_MAX_DAYS = 7;
+/** Where a paged link answer stops reading back when the caller names no first_day. */
+const TRANSFERS_FLOOR_DAY = "2015-01-01";
 const ADDRESS_SCHEMA = "chain-insights.address.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 INVALID_DAY_TEXT = "invalid_day: day must be a calendar date written YYYY-MM-DD (UTC), for example 2026-07-10";
 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 INVALID_LIMIT_TEXT = "invalid_limit: limit must be a whole number from 1 to 50";
 const INVALID_SKIP_TEXT = "invalid_skip: skip must be a whole number of 0 or more";
@@ -89,7 +118,7 @@ function normalizeFlowsDay(raw) {
 * 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`;
+	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 ${TRANSFERS_READ_ROWS}`;
 }
 /** The UTC day before a YYYY-MM-DD day. */
 function dayBefore(day) {
@@ -138,9 +167,9 @@ const PAGE_ORDER = " ORDER BY f.last_seen_timestamp DESC, b.address";
 function flowsReadsFor(address, inOffset, outOffset) {
 	const side = (id, offset, match) => {
 		const reads = [];
-		for (let done = 0; done < 251; done += 200) {
+		for (let done = 0; done < 251; done += FLOWS_READ_ROWS) {
 			const skip = offset + done;
-			const limit = Math.min(200, 251 - done);
+			const limit = Math.min(FLOWS_READ_ROWS, 251 - done);
 			reads.push({
 				id,
 				query: `USE topology MATCH ${match} RETURN ${PARTY_FIELDS}${PAGE_ORDER}${skip > 0 ? ` SKIP ${skip}` : ""} LIMIT ${limit}`,
@@ -233,7 +262,7 @@ function assembleFlowView(network, page, senders, receivers, truncated) {
 	return view;
 }
 function fitsFlowBudget(view) {
-	return view.nodes.length <= 500 && JSON.stringify(view).length < 14e4;
+	return view.nodes.length <= FLOWS_MAX_NODES && JSON.stringify(view).length < FLOWS_MAX_CHARS;
 }
 /**
 * How many senders and receivers stay after `drops` of the oldest links go,
@@ -258,9 +287,9 @@ function keptAfterDrops(senders, receivers, drops) {
 * per dropped link.
 */
 function buildFlowView(network, page) {
-	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 overflow = page.senders.length > FLOWS_PER_SIDE || page.receivers.length > FLOWS_PER_SIDE;
+	const senders = page.senders.slice(0, FLOWS_PER_SIDE);
+	const receivers = page.receivers.slice(0, FLOWS_PER_SIDE);
 	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);
@@ -367,8 +396,8 @@ function buildTransfersView(network, from, to, day, rows) {
 		from,
 		to,
 		day,
-		transfers: newestFirst.slice(0, 50),
-		truncated: newestFirst.length > 50
+		transfers: newestFirst.slice(0, TRANSFERS_MAX),
+		truncated: newestFirst.length > TRANSFERS_MAX
 	};
 }
 function transferLine(transfer) {
@@ -380,8 +409,8 @@ function transfersSummary(view) {
 	const span = paged && view.through_day !== view.day ? `${view.through_day} to ${view.day}` : view.day;
 	const head = `Transfers from ${view.from} to ${view.to} on ${span} (UTC) on ${view.network}`;
 	if (view.transfers.length === 0) return paged && view.next ? `${head}: none; earlier days remain before ${view.next.day}.` : `${head}: none.`;
-	const lines = [`${head}: ${view.truncated ? paged ? `${view.transfers.length}, and a day holds more than one read lists` : `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;
+	const lines = [`${head}: ${view.truncated ? paged ? `${view.transfers.length}, and a day holds more than one read lists` : `the newest ${view.transfers.length}, and the day holds more` : `${view.transfers.length}`}, newest first.`, ...view.transfers.slice(0, TRANSFERS_SUMMARY_ROWS).map(transferLine)];
+	const rest = view.transfers.length - TRANSFERS_SUMMARY_ROWS;
 	if (rest > 0) lines.push(`- and ${rest} more in the picture.`);
 	if (paged && view.next) lines.push(`- earlier transfers remain, from ${view.next.day} back.`);
 	return lines.join("\n");
@@ -438,7 +467,7 @@ function rowsOf(answer) {
 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()}"` };
+	if (rawNetwork !== FLOWS_NETWORK) 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. */
@@ -448,10 +477,10 @@ function checkAddress(raw, name) {
 	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" };
+	return normalizeFlowsDay(raw) ?? { error: INVALID_DAY_TEXT };
 }
 function checkLimit(value) {
-	if (typeof value !== "number" || !Number.isInteger(value) || value < 1 || value > 50) return { error: INVALID_LIMIT_TEXT };
+	if (typeof value !== "number" || !Number.isInteger(value) || value < 1 || value > TRANSFERS_MAX) return { error: INVALID_LIMIT_TEXT };
 	return value;
 }
 function checkSkip(value) {
@@ -468,7 +497,7 @@ function checkFirstDay(value, day) {
 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 };
+	if (value > FLOWS_MAX_OFFSET) return { error: OFFSET_TOO_LARGE_TEXT };
 	return value;
 }
 /**
@@ -564,7 +593,7 @@ async function readDay(deps, network, from, to, day) {
 	if (!rows) return { error: "graph_query_failed: the graph endpoint answered without chain-insights.result.v1 rows" };
 	return {
 		rows: rows.map(transferOf).sort((a, b) => (b.block_timestamp ?? -Infinity) - (a.block_timestamp ?? -Infinity)),
-		cut: rows.length >= 200
+		cut: rows.length >= TRANSFERS_READ_ROWS
 	};
 }
 /**
@@ -577,7 +606,7 @@ async function readDay(deps, network, from, to, day) {
 async function runLinkPage(deps, network, from, to, day, page) {
 	const unavailable = deps.unavailable?.();
 	if (unavailable) return errorResult$1(unavailable);
-	const floor = page.firstDay ?? "2015-01-01";
+	const floor = page.firstDay ?? TRANSFERS_FLOOR_DAY;
 	const transfers = [];
 	let current = day;
 	let skip = page.skip;
@@ -587,7 +616,7 @@ async function runLinkPage(deps, network, from, to, day, page) {
 	let next = null;
 	for (;;) {
 		if (current < floor) break;
-		if (daysRead >= 7) {
+		if (daysRead >= TRANSFERS_MAX_DAYS) {
 			next = {
 				day: current,
 				skip
@@ -805,12 +834,12 @@ async function saveGraphSchemaCache(network, document, endpoint, complete, now)
 * adds a note. It never fails the tool.
 */
 var graph_schema_exports = /* @__PURE__ */ __exportAll({
-	ADDRESS_SAMPLE_LIMIT: () => 20,
+	ADDRESS_SAMPLE_LIMIT: () => ADDRESS_SAMPLE_LIMIT,
 	FACTS_TRANSFER_COLUMNS: () => FACTS_TRANSFER_COLUMNS,
 	GRAPH_SCHEMA_ID: () => GRAPH_SCHEMA_ID,
 	GRAPH_SCHEMA_SOURCE: () => GRAPH_SCHEMA_SOURCE,
 	GraphSchemaError: () => GraphSchemaError,
-	LINK_SAMPLE_LIMIT: () => 5,
+	LINK_SAMPLE_LIMIT: () => LINK_SAMPLE_LIMIT,
 	META_SCHEMA_DESCRIPTION: () => META_SCHEMA_DESCRIPTION,
 	META_SCHEMA_TITLE: () => META_SCHEMA_TITLE,
 	SAMPLED_LINK_TYPES: () => SAMPLED_LINK_TYPES,
@@ -826,6 +855,9 @@ const GRAPH_SCHEMA_ID = "chain-insights.graph-schema.v1";
 const GRAPH_SCHEMA_SOURCE = "live catalog";
 const META_SCHEMA_TITLE = "Graph schema";
 const META_SCHEMA_DESCRIPTION = "Return the live graph schema of one network: the labels, the link types, the field names of an address and of each main link, the indexes, the USE facts relationships with the TRANSFER columns, and the USE chain lookups. Call it first when you need field names. It is cached for 24 hours; pass refresh=true to rebuild it.";
+/** Fields of an address come from this many sampled nodes, and of a link from this many sampled links. */
+const ADDRESS_SAMPLE_LIMIT = 20;
+const LINK_SAMPLE_LIMIT = 5;
 /** The link types an agent queries. Each is sampled only when the graph lists it. */
 const SAMPLED_LINK_TYPES = [
 	"FLOWS_TO",
@@ -875,10 +907,10 @@ const CATALOG_READS = {
 	}
 };
 function addressSampleQuery() {
-	return `USE topology MATCH (a:Address) RETURN keys(a) AS keys LIMIT 20`;
+	return `USE topology MATCH (a:Address) RETURN keys(a) AS keys LIMIT ${ADDRESS_SAMPLE_LIMIT}`;
 }
 function linkSampleQuery(linkType) {
-	return `USE topology MATCH ()-[r:${linkType}]->() RETURN keys(r) AS keys LIMIT 5`;
+	return `USE topology MATCH ()-[r:${linkType}]->() RETURN keys(r) AS keys LIMIT ${LINK_SAMPLE_LIMIT}`;
 }
 /** A refusal with its own words for the caller: a bad argument, an unserved network, an endpoint that is down. */
 var GraphSchemaError = class extends Error {
@@ -1052,7 +1084,7 @@ async function buildGraphSchema(options) {
 			if (rows) topology.samples[type] = unionOfKeys(rows);
 		}
 		const unsampled = topology.link_types.filter((type) => !SAMPLED_LINK_TYPES.includes(type));
-		if (unsampled.length > 0) remarks.push(`Link types with no sample: ${unsampled.join(", ")}. Read the keys of one with USE topology MATCH ()-[r:<TYPE>]->() RETURN keys(r) AS keys LIMIT 5.`);
+		if (unsampled.length > 0) remarks.push(`Link types with no sample: ${unsampled.join(", ")}. Read the keys of one with USE topology MATCH ()-[r:<TYPE>]->() RETURN keys(r) AS keys LIMIT ${LINK_SAMPLE_LIMIT}.`);
 	}
 	const facts = {
 		relationships: [],
@@ -1188,6 +1220,6 @@ 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 };
+export { handleMetaSchema as a, GRAPH_EXPAND_TITLE as c, handleGraphExpand as d, 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, TRANSFERS_MAX as u };
 
-//# sourceMappingURL=graph-schema-DqZUTnP0.mjs.map
+//# sourceMappingURL=graph-schema-ClqjzgrM.mjs.map