@gearbox-protocol/sdk 15.1.0-next.10 → 15.1.0-next.12

package/dist/cjs/dev/mode-parity/compareOpportunities.js

@@ -0,0 +1,105 @@
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+const require_model_opportunities = require("../../model/opportunities.js");
+const require_model_opportunities_schema = require("../../model/opportunities.schema.js");
+require("../../model/index.js");
+const require_dev_mode_parity_fieldDiff = require("./fieldDiff.js");
+const require_dev_mode_parity_compareRules = require("./compareRules.js");
+//#region src/dev/mode-parity/compareOpportunities.ts
+const tagDiff = require_dev_mode_parity_compareRules.makeTagDiff({
+	pool: require_dev_mode_parity_compareRules.compileCompareRules(require_model_opportunities_schema.poolOpportunitySchema),
+	strategy: require_dev_mode_parity_compareRules.compileCompareRules(require_model_opportunities_schema.strategyOpportunitySchema)
+});
+/**
+* Matches two opportunity listings by {@link opportunityId} and reports every
+* field the two sources disagree on.
+*
+* Nothing is filtered out. A field only the backend can fill, or a USD value
+* that drifted within snapshot-lag noise, is still reported — tagged
+* {@link FieldDiff.expected} so that {@link CompareCounts.clean} can ignore it
+* while {@link CompareCounts.identical} stays strict.
+**/
+function compareOpportunities(input) {
+	const onchainRows = indexById(input.onchain.data);
+	const offchainRows = indexById(input.offchain.data);
+	const onlyOnchain = [];
+	const onlyOffchain = [];
+	const matched = [];
+	for (const [id, row] of onchainRows) {
+		const counterpart = offchainRows.get(id);
+		if (!counterpart) {
+			onlyOnchain.push(toRef(row));
+			continue;
+		}
+		const diffs = diffOpportunity(row, counterpart);
+		matched.push({
+			id,
+			kind: row.kind,
+			chainId: row.chainId,
+			onchainName: row.name,
+			offchainName: counterpart.name,
+			identical: diffs.length === 0,
+			clean: diffs.every((diff) => diff.expected),
+			diffs
+		});
+	}
+	for (const [id, row] of offchainRows) if (!onchainRows.has(id)) onlyOffchain.push(toRef(row));
+	byId(onlyOnchain);
+	byId(onlyOffchain);
+	matched.sort((a, b) => a.id.localeCompare(b.id));
+	return {
+		generatedAt: input.generatedAt ?? (/* @__PURE__ */ new Date()).toISOString(),
+		backendUrl: input.backendUrl,
+		networks: [...input.networks],
+		onchainChains: input.onchain.meta.chains,
+		offchainChains: input.offchain.meta.chains,
+		summary: summarize(input.onchain.data, input.offchain.data, onlyOnchain, onlyOffchain, matched),
+		onlyOnchain,
+		onlyOffchain,
+		matched
+	};
+}
+function indexById(rows) {
+	return new Map(rows.map((row) => [require_model_opportunities.opportunityId(row), row]));
+}
+function byId(refs) {
+	refs.sort((a, b) => a.id.localeCompare(b.id));
+}
+function toRef(row) {
+	const base = {
+		id: require_model_opportunities.opportunityId(row),
+		kind: row.kind,
+		chainId: row.chainId,
+		name: row.name
+	};
+	return row.kind === "pool" ? {
+		...base,
+		pool: row.pool
+	} : {
+		...base,
+		creditManager: row.creditManager,
+		targetCollateral: row.targetCollateral.address
+	};
+}
+/**
+* Every field two versions of one opportunity disagree on.
+**/
+function diffOpportunity(onchain, offchain) {
+	return require_dev_mode_parity_fieldDiff.diffObjects(onchain, offchain).map((diff) => tagDiff(diff, onchain.kind));
+}
+function summarize(onchain, offchain, onlyOnchain, onlyOffchain, matched) {
+	const byChain = require_dev_mode_parity_fieldDiff.union(onchain.map((row) => String(row.chainId)), offchain.map((row) => String(row.chainId))).map((chainId) => ({
+		chainId: Number(chainId),
+		...require_dev_mode_parity_fieldDiff.toCompareCounts(onchain.filter((row) => String(row.chainId) === chainId).length, offchain.filter((row) => String(row.chainId) === chainId).length, onlyOnchain.filter((ref) => String(ref.chainId) === chainId).length, onlyOffchain.filter((ref) => String(ref.chainId) === chainId).length, matched.filter((match) => String(match.chainId) === chainId))
+	})).sort((a, b) => a.chainId - b.chainId);
+	return {
+		...require_dev_mode_parity_fieldDiff.toCompareCounts(onchain.length, offchain.length, onlyOnchain.length, onlyOffchain.length, matched),
+		byChain,
+		diffsByPath: require_dev_mode_parity_fieldDiff.countPaths(matched.flatMap((match) => match.diffs.map((diff) => ({
+			id: match.id,
+			diff
+		}))))
+	};
+}
+//#endregion
+exports.compareOpportunities = compareOpportunities;
+exports.diffOpportunity = diffOpportunity;

package/dist/cjs/dev/mode-parity/comparePositions.js

@@ -0,0 +1,160 @@
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+const require_model_liquidations_schema = require("../../model/liquidations.schema.js");
+const require_model_positions = require("../../model/positions.js");
+const require_model_positions_schema = require("../../model/positions.schema.js");
+require("../../model/index.js");
+const require_dev_mode_parity_fieldDiff = require("./fieldDiff.js");
+const require_dev_mode_parity_compareRules = require("./compareRules.js");
+//#region src/dev/mode-parity/comparePositions.ts
+const tagDiff = require_dev_mode_parity_compareRules.makeTagDiff({
+	pool: require_dev_mode_parity_compareRules.compileCompareRules(require_model_positions_schema.poolPositionSchema),
+	strategy: require_dev_mode_parity_compareRules.compileCompareRules(require_model_positions_schema.strategyPositionSchema),
+	liquidation: require_dev_mode_parity_compareRules.compileCompareRules(require_model_liquidations_schema.liquidationPositionSchema)
+});
+/**
+* Matches two position listings per wallet by {@link positionId} and reports
+* every field the two sources disagree on.
+*
+* Nothing is filtered out. A field only one mode can fill, or a USD value that
+* drifted within snapshot-lag noise, is still reported — tagged
+* {@link FieldDiff.expected} so that {@link CompareCounts.clean} can ignore it
+* while {@link CompareCounts.identical} stays strict.
+**/
+function comparePositions(input) {
+	const failures = input.failures ?? [];
+	const wallets = [...input.wallets.map(compareWallet), ...failures.map((failure) => ({
+		wallet: failure.wallet,
+		error: failure.error,
+		onlyOnchain: [],
+		onlyOffchain: [],
+		matched: []
+	}))];
+	wallets.sort((a, b) => a.wallet.localeCompare(b.wallet));
+	return {
+		generatedAt: input.generatedAt ?? (/* @__PURE__ */ new Date()).toISOString(),
+		backendUrl: input.backendUrl,
+		networks: [...input.networks],
+		onchainChains: collectChains(input.wallets, "onchain"),
+		offchainChains: collectChains(input.wallets, "offchain"),
+		summary: summarize(input.wallets, wallets, failures.length),
+		wallets
+	};
+}
+/**
+* Every field two versions of one position disagree on.
+**/
+function diffPosition(onchain, offchain) {
+	return require_dev_mode_parity_fieldDiff.diffObjects(onchain, offchain, { keyOf: keyOfPositionArray }).map((diff) => tagDiff(diff, onchain.kind));
+}
+function compareWallet(input) {
+	const onchainRows = indexById(input.onchain.data);
+	const offchainRows = indexById(input.offchain.data);
+	const onlyOnchain = [];
+	const onlyOffchain = [];
+	const matched = [];
+	for (const [id, row] of onchainRows) {
+		const counterpart = offchainRows.get(id);
+		if (!counterpart) {
+			onlyOnchain.push(toRef(row));
+			continue;
+		}
+		const diffs = diffPosition(row, counterpart);
+		matched.push({
+			id,
+			kind: row.kind,
+			chainId: row.chainId,
+			onchainName: row.name,
+			offchainName: counterpart.name,
+			identical: diffs.length === 0,
+			clean: diffs.every((diff) => diff.expected),
+			diffs
+		});
+	}
+	for (const [id, row] of offchainRows) if (!onchainRows.has(id)) onlyOffchain.push(toRef(row));
+	onlyOnchain.sort((a, b) => a.id.localeCompare(b.id));
+	onlyOffchain.sort((a, b) => a.id.localeCompare(b.id));
+	matched.sort((a, b) => a.id.localeCompare(b.id));
+	return {
+		wallet: input.wallet,
+		onlyOnchain,
+		onlyOffchain,
+		matched
+	};
+}
+function indexById(rows) {
+	return new Map(rows.map((row) => [require_model_positions.positionId(row), row]));
+}
+function toRef(row) {
+	const base = {
+		id: require_model_positions.positionId(row),
+		kind: row.kind,
+		chainId: row.chainId,
+		name: row.name
+	};
+	switch (row.kind) {
+		case "pool": return {
+			...base,
+			pool: row.pool
+		};
+		case "strategy": return {
+			...base,
+			creditAccount: row.creditAccount,
+			creditManager: row.creditManager
+		};
+		case "liquidation": return base;
+	}
+}
+/**
+* `collaterals[]` is keyed by the collateral token, not by a top-level
+* address. Rewards-points programs already identify themselves by `id`.
+**/
+function keyOfPositionArray(path, value) {
+	if (path !== "collaterals" || !require_dev_mode_parity_fieldDiff.isRecord(value) || !require_dev_mode_parity_fieldDiff.isRecord(value.collateral)) return;
+	const token = value.collateral.token;
+	return require_dev_mode_parity_fieldDiff.isRecord(token) && typeof token.address === "string" ? token.address : void 0;
+}
+function summarize(inputs, wallets, failed) {
+	const compared = wallets.filter((wallet) => !wallet.error);
+	const allOnchain = inputs.flatMap((input) => input.onchain.data);
+	const allOffchain = inputs.flatMap((input) => input.offchain.data);
+	const onlyOnchain = compared.flatMap((wallet) => wallet.onlyOnchain);
+	const onlyOffchain = compared.flatMap((wallet) => wallet.onlyOffchain);
+	const matched = compared.flatMap((wallet) => wallet.matched);
+	const byChain = require_dev_mode_parity_fieldDiff.union(allOnchain.map((row) => String(row.chainId)), allOffchain.map((row) => String(row.chainId))).map((chainId) => ({
+		chainId: Number(chainId),
+		...require_dev_mode_parity_fieldDiff.toCompareCounts(allOnchain.filter((row) => String(row.chainId) === chainId).length, allOffchain.filter((row) => String(row.chainId) === chainId).length, onlyOnchain.filter((ref) => String(ref.chainId) === chainId).length, onlyOffchain.filter((ref) => String(ref.chainId) === chainId).length, matched.filter((match) => String(match.chainId) === chainId))
+	})).sort((a, b) => a.chainId - b.chainId);
+	const byWallet = wallets.map((wallet) => ({
+		wallet: wallet.wallet,
+		...wallet.error ? { error: wallet.error } : {},
+		...require_dev_mode_parity_fieldDiff.toCompareCounts(wallet.matched.length + wallet.onlyOnchain.length, wallet.matched.length + wallet.onlyOffchain.length, wallet.onlyOnchain.length, wallet.onlyOffchain.length, wallet.matched)
+	}));
+	const walletsClean = compared.filter((wallet) => wallet.onlyOnchain.length === 0 && wallet.onlyOffchain.length === 0 && wallet.matched.every((match) => match.clean)).length;
+	return {
+		...require_dev_mode_parity_fieldDiff.toCompareCounts(allOnchain.length, allOffchain.length, onlyOnchain.length, onlyOffchain.length, matched),
+		wallets: wallets.length,
+		walletsClean,
+		walletsFailed: failed,
+		byChain,
+		byWallet,
+		diffsByPath: require_dev_mode_parity_fieldDiff.countPaths(matched.flatMap((match) => match.diffs.map((diff) => ({
+			id: match.id,
+			diff
+		}))))
+	};
+}
+/**
+* One metadata entry per chain, preferring a success so the report names the
+* block. Later wallets of the same chain are ignored.
+**/
+function collectChains(wallets, side) {
+	const byChain = /* @__PURE__ */ new Map();
+	for (const wallet of wallets) for (const chain of wallet[side].meta.chains) {
+		const existing = byChain.get(chain.chainId);
+		if (!existing || existing.status !== "success" && chain.status === "success") byChain.set(chain.chainId, chain);
+	}
+	return [...byChain.values()].sort((a, b) => a.chainId - b.chainId);
+}
+//#endregion
+exports.comparePositions = comparePositions;
+exports.diffPosition = diffPosition;

package/dist/cjs/dev/mode-parity/compareRules.js

@@ -0,0 +1,93 @@
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+const require_model_compare_schema = require("../../model/compare.schema.js");
+const require_dev_mode_parity_fieldDiff = require("./fieldDiff.js");
+//#region src/dev/mode-parity/compareRules.ts
+/**
+* Walks a schema and records every field that carries compare metadata.
+*
+* `"amount"` on an object (an Amount / TokenAmount) is stored
+* at `<path>.value`; every other tag is stored at the field's own path.
+**/
+function compileCompareRules(schema) {
+	const rules = /* @__PURE__ */ new Map();
+	walk(schema, "", /* @__PURE__ */ new Set(), rules);
+	return rules;
+}
+/**
+* Tags diffs using the rules compiled for each row kind.
+*
+* Mode tags match the path or anything nested under it. Tolerance tags match
+* the path exactly and dispatch on {@link CompareTolerance}.
+**/
+function makeTagDiff(rulesByKind) {
+	return (diff, kind) => {
+		const rules = rulesByKind[kind];
+		if (!rules) return diff;
+		const path = require_dev_mode_parity_fieldDiff.collapseArrayKeys(diff.path);
+		if (isModeScoped(path, rules)) return require_dev_mode_parity_fieldDiff.withExpected(diff, "mode-scoped");
+		const tag = rules.get(path);
+		if (tag && typeof tag === "object" && withinTolerance(tag.tolerance, diff)) return require_dev_mode_parity_fieldDiff.withExpected(diff, "tolerance");
+		return diff;
+	};
+}
+function isModeScoped(path, rules) {
+	for (const [rulePath, tag] of rules) {
+		if (tag !== "offchainOnly" && tag !== "onchainOnly") continue;
+		if (path === rulePath || path.startsWith(`${rulePath}.`) || path.startsWith(`${rulePath}[`)) return true;
+	}
+	return false;
+}
+function withinTolerance(kind, diff) {
+	switch (kind) {
+		case "usd": return require_dev_mode_parity_fieldDiff.isUsdWithinTolerance(diff.onchain, diff.offchain);
+		case "bps": return require_dev_mode_parity_fieldDiff.isBpsWithinTolerance(diff.onchain, diff.offchain);
+		case "amount": return require_dev_mode_parity_fieldDiff.isAmountWithinTolerance(diff.onchain, diff.offchain);
+		case "float": return require_dev_mode_parity_fieldDiff.withinRelative(require_dev_mode_parity_fieldDiff.asFiniteNumber(diff.onchain), require_dev_mode_parity_fieldDiff.asFiniteNumber(diff.offchain), require_dev_mode_parity_fieldDiff.USD_RELATIVE_EPSILON);
+	}
+}
+function walk(schema, path, seen, rules) {
+	if (seen.has(schema)) return;
+	const nextSeen = new Set(seen);
+	nextSeen.add(schema);
+	const tag = require_model_compare_schema.compareTagOf(schema);
+	if (tag) record(path, tag, schema, rules);
+	const def = schema.def;
+	switch (def.type) {
+		case "optional":
+		case "nullable":
+		case "default":
+		case "prefault":
+		case "readonly":
+			if (def.innerType) walk(def.innerType, path, nextSeen, rules);
+			return;
+		case "array":
+			if (def.element) walk(def.element, `${path}[]`, nextSeen, rules);
+			return;
+		case "object":
+			if (def.shape) for (const [key, field] of Object.entries(def.shape)) walk(field, join(path, key), nextSeen, rules);
+			return;
+		case "union":
+			for (const option of def.options ?? []) walk(option, path, nextSeen, rules);
+			return;
+		case "pipe":
+			if (def.out) walk(def.out, path, nextSeen, rules);
+			return;
+		case "lazy":
+			if (def.getter) walk(def.getter(), path, nextSeen, rules);
+			return;
+		default: return;
+	}
+}
+function record(path, tag, schema, rules) {
+	if (typeof tag === "object" && tag.tolerance === "amount" && schema.def.type === "object") {
+		rules.set(join(path, "value"), tag);
+		return;
+	}
+	rules.set(path, tag);
+}
+function join(path, key) {
+	return path ? `${path}.${key}` : key;
+}
+//#endregion
+exports.compileCompareRules = compileCompareRules;
+exports.makeTagDiff = makeTagDiff;

package/dist/cjs/dev/mode-parity/fieldDiff.js

@@ -0,0 +1,288 @@
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+//#region src/dev/mode-parity/fieldDiff.ts
+/**
+* Relative drift allowed on {@link Amount.valueUsd} before a USD float is a
+* real disagreement: 0.1%.
+**/
+const USD_RELATIVE_EPSILON = .001;
+/**
+* Relative drift allowed on lag-bounded bigint amounts: 0.05%.
+**/
+const AMOUNT_RELATIVE_EPSILON = 5e-4;
+/**
+* Absolute drift allowed on bps rates before rounding and a one-block lag are
+* no longer enough to explain it.
+**/
+const BPS_ABSOLUTE_EPSILON = 1;
+/**
+* Every field two versions of one value disagree on. Nothing is filtered or
+* tagged: the caller marks expected diffs afterwards.
+**/
+function diffValue(path, onchain, offchain, out, options) {
+	if (isAbsent(onchain) && isAbsent(offchain)) return;
+	if (isAbsent(onchain) || isAbsent(offchain)) {
+		out.push({
+			path,
+			onchain,
+			offchain,
+			kind: "presence"
+		});
+		return;
+	}
+	if (Array.isArray(onchain) && Array.isArray(offchain)) {
+		diffArray(path, onchain, offchain, out, options);
+		return;
+	}
+	if (isRecord(onchain) && isRecord(offchain)) {
+		for (const key of union(Object.keys(onchain), Object.keys(offchain))) diffValue(join(path, key), onchain[key], offchain[key], out, options);
+		return;
+	}
+	if (!sameScalar(onchain, offchain)) out.push({
+		path,
+		onchain,
+		offchain,
+		kind: scalarKind(path, onchain)
+	});
+}
+/**
+* Deep-diff two values and return the disagreements, in path order of
+* discovery.
+**/
+function diffObjects(onchain, offchain, options) {
+	const diffs = [];
+	diffValue("", onchain, offchain, diffs, options);
+	return diffs;
+}
+/**
+* Mark a diff expected, so a later `clean` count can ignore it.
+**/
+function withExpected(diff, reason) {
+	return {
+		...diff,
+		expected: true,
+		reason
+	};
+}
+/**
+* How often each field differed, with array keys collapsed so that the same
+* field of a hundred collateral tokens counts as one path. Sorted so the
+* unexpected disagreements come first.
+**/
+function countPaths(diffs) {
+	const counts = /* @__PURE__ */ new Map();
+	for (const { id, diff } of diffs) {
+		const path = collapseArrayKeys(diff.path);
+		const entry = counts.get(path) ?? {
+			path,
+			kinds: [],
+			count: 0,
+			expected: 0,
+			unexpected: 0
+		};
+		entry.count += 1;
+		if (diff.expected) entry.expected += 1;
+		else entry.unexpected += 1;
+		if (!entry.kinds.includes(diff.kind)) entry.kinds.push(diff.kind);
+		recordWorst(entry, id, diff);
+		counts.set(path, entry);
+	}
+	return [...counts.values()].sort((a, b) => b.unexpected - a.unexpected || b.count - a.count || a.path.localeCompare(b.path));
+}
+function recordWorst(entry, id, diff) {
+	const bps = relativeDiffBps(diff.onchain, diff.offchain);
+	if (bps === void 0) return;
+	const worst = {
+		id,
+		path: diff.path,
+		bps,
+		onchain: diff.onchain,
+		offchain: diff.offchain
+	};
+	if (diff.expected) {
+		if (isWorse(worst, entry.worstExpected)) entry.worstExpected = worst;
+		return;
+	}
+	if (isWorse(worst, entry.worstUnexpected)) entry.worstUnexpected = worst;
+}
+function isWorse(candidate, current) {
+	if (!current) return true;
+	return candidate.bps > current.bps || candidate.bps === current.bps && candidate.id.localeCompare(current.id) < 0;
+}
+/**
+* Collapse `collateralTokens[0xa0b8...].symbol` to `collateralTokens[].symbol`.
+**/
+function collapseArrayKeys(path) {
+	return path.replace(/\[[^\]]*\]/g, "[]");
+}
+/**
+* Membership and match totals of one comparison, from already-built lists.
+**/
+function toCompareCounts(onchainRows, offchainRows, onlyOnchain, onlyOffchain, matched) {
+	const identical = matched.filter((match) => match.identical).length;
+	const clean = matched.filter((match) => match.clean).length;
+	return {
+		onchainRows,
+		offchainRows,
+		matched: matched.length,
+		identical,
+		clean,
+		differing: matched.length - identical,
+		onlyOnchain,
+		onlyOffchain
+	};
+}
+/**
+* USD floats within {@link USD_RELATIVE_EPSILON}.
+**/
+function isUsdWithinTolerance(onchain, offchain) {
+	return withinRelative(asFiniteNumber(onchain), asFiniteNumber(offchain), USD_RELATIVE_EPSILON);
+}
+/**
+* Bps rates that differ by at most {@link BPS_ABSOLUTE_EPSILON}.
+**/
+function isBpsWithinTolerance(onchain, offchain) {
+	const left = asFiniteNumber(onchain);
+	const right = asFiniteNumber(offchain);
+	return left !== void 0 && right !== void 0 && Math.abs(left - right) <= 1;
+}
+/**
+* Bigint amounts within {@link AMOUNT_RELATIVE_EPSILON}.
+**/
+function isAmountWithinTolerance(onchain, offchain) {
+	return typeof onchain === "bigint" && typeof offchain === "bigint" && withinRelativeBigint(onchain, offchain, 5e-4);
+}
+/**
+* Finite numbers within a relative epsilon of each other.
+**/
+function withinRelative(onchain, offchain, epsilon) {
+	if (onchain === void 0 || offchain === void 0) return false;
+	const scale = Math.max(Math.abs(onchain), Math.abs(offchain));
+	return scale === 0 ? true : Math.abs(onchain - offchain) / scale <= epsilon;
+}
+/**
+* `diff / max(|a|, |b|) <= epsilon`, computed in integer arithmetic so a
+* 1e18-scale amount does not round through `Number`.
+**/
+function withinRelativeBigint(onchain, offchain, epsilon) {
+	if (onchain === offchain) return true;
+	const diff = onchain > offchain ? onchain - offchain : offchain - onchain;
+	const scale = abs(onchain) > abs(offchain) ? abs(onchain) : abs(offchain);
+	if (scale === 0n) return true;
+	return diff * BigInt(Math.round(1 / epsilon)) <= scale;
+}
+function asFiniteNumber(value) {
+	return typeof value === "number" && Number.isFinite(value) ? value : void 0;
+}
+/**
+* Relative difference of two numbers or bigints, in bps:
+* `|a − b| / max(|a|, |b|) * 10_000`. `undefined` when the values are not
+* a comparable pair of finite numbers or of bigints.
+**/
+function relativeDiffBps(onchain, offchain) {
+	if (typeof onchain === "bigint" && typeof offchain === "bigint") return relativeDiffBpsBigint(onchain, offchain);
+	const left = asFiniteNumber(onchain);
+	const right = asFiniteNumber(offchain);
+	if (left === void 0 || right === void 0) return;
+	const scale = Math.max(Math.abs(left), Math.abs(right));
+	return scale === 0 ? 0 : Math.abs(left - right) / scale * 1e4;
+}
+/**
+* Same formula as {@link relativeDiffBps} for bigints, computed in integer
+* arithmetic to milli-bps so a 1e18-scale amount does not round through
+* `Number`.
+**/
+function relativeDiffBpsBigint(onchain, offchain) {
+	if (onchain === offchain) return 0;
+	const diff = onchain > offchain ? onchain - offchain : offchain - onchain;
+	const scale = abs(onchain) > abs(offchain) ? abs(onchain) : abs(offchain);
+	if (scale === 0n) return 0;
+	return Number(diff * 10000n * 1000n / scale) / 1e3;
+}
+function union(left, right) {
+	return [.../* @__PURE__ */ new Set([...left, ...right])];
+}
+function isRecord(value) {
+	return typeof value === "object" && value !== null && !Array.isArray(value);
+}
+function diffArray(path, onchain, offchain, out, options) {
+	const onchainKeyed = keyElements(path, onchain, options?.keyOf);
+	const offchainKeyed = keyElements(path, offchain, options?.keyOf);
+	if (!onchainKeyed || !offchainKeyed) {
+		if (onchain.length !== offchain.length) {
+			out.push({
+				path,
+				onchain,
+				offchain,
+				kind: "other"
+			});
+			return;
+		}
+		onchain.forEach((element, index) => {
+			diffValue(`${path}[${index}]`, element, offchain[index], out, options);
+		});
+		return;
+	}
+	for (const key of union([...onchainKeyed.keys()], [...offchainKeyed.keys()])) diffValue(`${path}[${key}]`, onchainKeyed.get(key), offchainKeyed.get(key), out, options);
+}
+/**
+* The array indexed by each element's own identity, or `undefined` when its
+* elements have none and order is all there is to go by.
+**/
+function keyElements(path, values, keyOf) {
+	const keyed = /* @__PURE__ */ new Map();
+	for (const value of values) {
+		const identity = keyOf?.(path, value) ?? defaultIdentity(value);
+		if (typeof identity !== "string") return;
+		keyed.set(identity.toLowerCase(), value);
+	}
+	return keyed.size === values.length ? keyed : void 0;
+}
+function defaultIdentity(value) {
+	if (!isRecord(value)) return;
+	if (typeof value.address === "string") return value.address;
+	if (typeof value.id === "string") return value.id;
+	if (typeof value.token === "string") return value.token;
+	if (isRecord(value.token) && typeof value.token.address === "string") return value.token.address;
+}
+const ADDRESS = /^0x[0-9a-f]{40}$/i;
+/**
+* Only addresses are compared case-insensitively: the backend lowercases them
+* while the chain hands out checksummed ones, which is not a disagreement. A
+* symbol or a name spelled differently is.
+**/
+function sameScalar(onchain, offchain) {
+	if (typeof onchain === "string" && typeof offchain === "string" && ADDRESS.test(onchain) && ADDRESS.test(offchain)) return onchain.toLowerCase() === offchain.toLowerCase();
+	return onchain === offchain;
+}
+function scalarKind(path, onchain) {
+	if (path.endsWith("valueUsd")) return "usd";
+	return typeof onchain === "number" || typeof onchain === "bigint" ? "numeric" : "other";
+}
+function isAbsent(value) {
+	return value === void 0 || value === null;
+}
+function join(path, key) {
+	return path ? `${path}.${key}` : key;
+}
+function abs(value) {
+	return value < 0n ? -value : value;
+}
+//#endregion
+exports.AMOUNT_RELATIVE_EPSILON = AMOUNT_RELATIVE_EPSILON;
+exports.BPS_ABSOLUTE_EPSILON = BPS_ABSOLUTE_EPSILON;
+exports.USD_RELATIVE_EPSILON = USD_RELATIVE_EPSILON;
+exports.asFiniteNumber = asFiniteNumber;
+exports.collapseArrayKeys = collapseArrayKeys;
+exports.countPaths = countPaths;
+exports.diffObjects = diffObjects;
+exports.diffValue = diffValue;
+exports.isAmountWithinTolerance = isAmountWithinTolerance;
+exports.isBpsWithinTolerance = isBpsWithinTolerance;
+exports.isRecord = isRecord;
+exports.isUsdWithinTolerance = isUsdWithinTolerance;
+exports.relativeDiffBps = relativeDiffBps;
+exports.toCompareCounts = toCompareCounts;
+exports.union = union;
+exports.withExpected = withExpected;
+exports.withinRelative = withinRelative;
+exports.withinRelativeBigint = withinRelativeBigint;