@chainlink/ccip-sdk 0.0.0 → 0.90.0

package/dist/gas.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"gas.d.ts","sourceRoot":"","sources":["../src/gas.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,KAAK,SAAS,EAWf,MAAM,QAAQ,CAAA;AAGf,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,YAAY,CAAA;AAIvC,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAA;AAE9C,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,YAAY,CAAA;AAetC;;;;;;;;IAQI;AACJ,wBAAsB,yBAAyB,CAC7C,MAAM,EAAE,KAAK,EACb,IAAI,EAAE,QAAQ,EACd,OAAO,EAAE;IACP,IAAI,EAAE,IAAI,CAAA;IACV,OAAO,EAAE;QACP,MAAM,EAAE,MAAM,CAAA;QACd,QAAQ,EAAE,MAAM,CAAA;QAChB,IAAI,EAAE,SAAS,CAAA;QACf,YAAY,EAAE,SAAS;YACrB,iBAAiB,EAAE,MAAM,CAAA;YACzB,gBAAgB,EAAE,MAAM,CAAA;YACxB,MAAM,EAAE,MAAM,CAAA;SACf,EAAE,CAAA;KACJ,CAAA;CACF,mBA0EF"}

package/dist/gas.js

@@ -0,0 +1,80 @@
+import { Contract, FunctionFragment, concat, formatUnits, getNumber, hexlify, randomBytes, solidityPackedKeccak256, toBeHex, zeroPadValue, } from 'ethers';
+import TokenABI from "./evm/abi/BurnMintERC677Token.js";
+import RouterABI from "./evm/abi/Router.js";
+import { defaultAbiCoder } from "./evm/const.js";
+import { discoverOffRamp } from "./execution.js";
+const BALANCES_SLOT = 0;
+const ccipReceive = FunctionFragment.from({
+    type: 'function',
+    name: 'ccipReceive',
+    stateMutability: 'nonpayable',
+    inputs: RouterABI.find((v) => v.type === 'function' && v.name === 'routeMessage').inputs.slice(0, 1),
+    outputs: [],
+});
+/**
+ * Estimate CCIP gasLimit needed to execute a request on a contract receiver
+ *
+ * @param dest - Provider for the destination chain
+ * @param request - CCIP request info
+ * @param request.lane - Lane info
+ * @param request.message - Message info
+ * @returns estimated gasLimit as bigint
+ **/
+export async function estimateExecGasForRequest(source, dest, request) {
+    const offRamp = await discoverOffRamp(source, dest, request.lane.onRamp);
+    const destRouter = await dest.getRouterForOffRamp(offRamp, request.lane.sourceChainSelector);
+    const destTokenAmounts = await Promise.all(request.message.tokenAmounts.map(async (ta) => {
+        if (!('destTokenAddress' in ta))
+            throw new Error('legacy <1.5 tokenPools not supported');
+        const [{ decimals: sourceDecimals }, { decimals: destDecimals }] = await Promise.all([
+            source
+                .getTokenForTokenPool(ta.sourcePoolAddress)
+                .then((token) => source.getTokenInfo(token)),
+            dest.getTokenInfo(ta.destTokenAddress),
+        ]);
+        const destAmount = (ta.amount * 10n ** BigInt(destDecimals - sourceDecimals + 36)) / 10n ** 36n;
+        if (destAmount === 0n)
+            throw new Error(`not enough decimals=${destDecimals} for token=${ta.destTokenAddress} on dest=${dest.network.name} to express ${formatUnits(ta.amount, sourceDecimals)}`);
+        return { token: ta.destTokenAddress, amount: destAmount };
+    }));
+    const message = {
+        messageId: hexlify(randomBytes(32)),
+        sender: zeroPadValue(request.message.sender, 32),
+        data: hexlify(request.message.data),
+        sourceChainSelector: request.lane.sourceChainSelector,
+        destTokenAmounts,
+    };
+    // we need to override the state, increasing receiver's balance for each token, to simulate the
+    // state after tokens were transferred by the offRamp just before calling `ccipReceive`
+    const destAmounts = {};
+    const stateOverrides = {};
+    for (const { token, amount } of destTokenAmounts) {
+        if (!(token in destAmounts)) {
+            const tokenContract = new Contract(token, TokenABI, dest);
+            const currentBalance = await tokenContract.balanceOf(request.message.receiver);
+            destAmounts[token] = currentBalance;
+        }
+        destAmounts[token] += amount;
+        stateOverrides[token] = {
+            stateDiff: {
+                [solidityPackedKeccak256(['uint256', 'uint256'], [request.message.receiver, BALANCES_SLOT])]: toBeHex(destAmounts[token], 32),
+            },
+        };
+    }
+    const calldata = concat([
+        ccipReceive.selector,
+        defaultAbiCoder.encode(ccipReceive.inputs, [message]),
+    ]);
+    return (getNumber((await dest.provider.send('eth_estimateGas', [
+        {
+            from: destRouter,
+            to: request.message.receiver,
+            data: calldata,
+        },
+        'latest',
+        ...(Object.keys(stateOverrides).length ? [stateOverrides] : []),
+    ]))) -
+        (21_000 - 700) // 21k is the base gas cost for a transaction, 700 is the gas cost of the call
+    );
+}
+//# sourceMappingURL=gas.js.map

package/dist/gas.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"gas.js","sourceRoot":"","sources":["../src/gas.ts"],"names":[],"mappings":"AAAA,OAAO,EAEL,QAAQ,EACR,gBAAgB,EAChB,MAAM,EACN,WAAW,EACX,SAAS,EACT,OAAO,EACP,WAAW,EACX,uBAAuB,EACvB,OAAO,EACP,YAAY,GACb,MAAM,QAAQ,CAAA;AAIf,OAAO,QAAQ,MAAM,kCAAkC,CAAA;AACvD,OAAO,SAAS,MAAM,qBAAqB,CAAA;AAC3C,OAAO,EAAE,eAAe,EAAE,MAAM,gBAAgB,CAAA;AAEhD,OAAO,EAAE,eAAe,EAAE,MAAM,gBAAgB,CAAA;AAGhD,MAAM,aAAa,GAAG,CAAC,CAAA;AACvB,MAAM,WAAW,GAAG,gBAAgB,CAAC,IAAI,CAAC;IACxC,IAAI,EAAE,UAAU;IAChB,IAAI,EAAE,aAAa;IACnB,eAAe,EAAE,YAAY;IAC7B,MAAM,EAAE,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,UAAU,IAAI,CAAC,CAAC,IAAI,KAAK,cAAc,CAAE,CAAC,MAAM,CAAC,KAAK,CAC7F,CAAC,EACD,CAAC,CACF;IACD,OAAO,EAAE,EAAE;CACZ,CAAC,CAAA;AAGF;;;;;;;;IAQI;AACJ,MAAM,CAAC,KAAK,UAAU,yBAAyB,CAC7C,MAAa,EACb,IAAc,EACd,OAYC;IAED,MAAM,OAAO,GAAG,MAAM,eAAe,CAAC,MAAM,EAAE,IAAI,EAAE,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;IACxE,MAAM,UAAU,GAAG,MAAM,IAAI,CAAC,mBAAmB,CAAC,OAAO,EAAE,OAAO,CAAC,IAAI,CAAC,mBAAmB,CAAC,CAAA;IAE5F,MAAM,gBAAgB,GAAG,MAAM,OAAO,CAAC,GAAG,CACxC,OAAO,CAAC,OAAO,CAAC,YAAY,CAAC,GAAG,CAAC,KAAK,EAAE,EAAE,EAAE,EAAE;QAC5C,IAAI,CAAC,CAAC,kBAAkB,IAAI,EAAE,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,sCAAsC,CAAC,CAAA;QACxF,MAAM,CAAC,EAAE,QAAQ,EAAE,cAAc,EAAE,EAAE,EAAE,QAAQ,EAAE,YAAY,EAAE,CAAC,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC;YACnF,MAAM;iBACH,oBAAoB,CAAC,EAAE,CAAC,iBAAiB,CAAC;iBAC1C,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,MAAM,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;YAC9C,IAAI,CAAC,YAAY,CAAC,EAAE,CAAC,gBAAgB,CAAC;SACvC,CAAC,CAAA;QACF,MAAM,UAAU,GACd,CAAC,EAAE,CAAC,MAAM,GAAG,GAAG,IAAI,MAAM,CAAC,YAAY,GAAG,cAAc,GAAG,EAAE,CAAC,CAAC,GAAG,GAAG,IAAI,GAAG,CAAA;QAC9E,IAAI,UAAU,KAAK,EAAE;YACnB,MAAM,IAAI,KAAK,CACb,uBAAuB,YAAY,cAAc,EAAE,CAAC,gBAAgB,YAAY,IAAI,CAAC,OAAO,CAAC,IAAI,eAAe,WAAW,CAAC,EAAE,CAAC,MAAM,EAAE,cAAc,CAAC,EAAE,CACzJ,CAAA;QACH,OAAO,EAAE,KAAK,EAAE,EAAE,CAAC,gBAAgB,EAAE,MAAM,EAAE,UAAU,EAAE,CAAA;IAC3D,CAAC,CAAC,CACH,CAAA;IAED,MAAM,OAAO,GAAmB;QAC9B,SAAS,EAAE,OAAO,CAAC,WAAW,CAAC,EAAE,CAAC,CAAC;QACnC,MAAM,EAAE,YAAY,CAAC,OAAO,CAAC,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC;QAChD,IAAI,EAAE,OAAO,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC;QACnC,mBAAmB,EAAE,OAAO,CAAC,IAAI,CAAC,mBAAmB;QACrD,gBAAgB;KACjB,CAAA;IAED,+FAA+F;IAC/F,uFAAuF;IACvF,MAAM,WAAW,GAA2B,EAAE,CAAA;IAC9C,MAAM,cAAc,GAA0D,EAAE,CAAA;IAChF,KAAK,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,gBAAgB,EAAE,CAAC;QACjD,IAAI,CAAC,CAAC,KAAK,IAAI,WAAW,CAAC,EAAE,CAAC;YAC5B,MAAM,aAAa,GAAG,IAAI,QAAQ,CAAC,KAAK,EAAE,QAAQ,EAAE,IAAI,CAEvD,CAAA;YACD,MAAM,cAAc,GAAG,MAAM,aAAa,CAAC,SAAS,CAAC,OAAO,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAA;YAC9E,WAAW,CAAC,KAAK,CAAC,GAAG,cAAc,CAAA;QACrC,CAAC;QACD,WAAW,CAAC,KAAK,CAAC,IAAI,MAAM,CAAA;QAC5B,cAAc,CAAC,KAAK,CAAC,GAAG;YACtB,SAAS,EAAE;gBACT,CAAC,uBAAuB,CACtB,CAAC,SAAS,EAAE,SAAS,CAAC,EACtB,CAAC,OAAO,CAAC,OAAO,CAAC,QAAQ,EAAE,aAAa,CAAC,CAC1C,CAAC,EAAE,OAAO,CAAC,WAAW,CAAC,KAAK,CAAC,EAAE,EAAE,CAAC;aACpC;SACF,CAAA;IACH,CAAC;IAED,MAAM,QAAQ,GAAG,MAAM,CAAC;QACtB,WAAW,CAAC,QAAQ;QACpB,eAAe,CAAC,MAAM,CAAC,WAAW,CAAC,MAAM,EAAE,CAAC,OAAO,CAAC,CAAC;KACtD,CAAC,CAAA;IAEF,OAAO,CACL,SAAS,CACP,CAAC,MAAM,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,iBAAiB,EAAE;QAC3C;YACE,IAAI,EAAE,UAAU;YAChB,EAAE,EAAE,OAAO,CAAC,OAAO,CAAC,QAAQ;YAC5B,IAAI,EAAE,QAAQ;SACf;QACD,QAAQ;QACR,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;KAChE,CAAC,CAAW,CACd;QACD,CAAC,MAAM,GAAG,GAAG,CAAC,CAAC,8EAA8E;KAC9F,CAAA;AACH,CAAC"}

package/dist/hasher/common.d.ts

@@ -0,0 +1,12 @@
+import type { CCIPMessage, CCIPVersion } from '../types.ts';
+export type LeafHasher<V extends CCIPVersion = CCIPVersion> = (message: CCIPMessage<V>) => string;
+export declare const LEAF_DOMAIN_SEPARATOR = "0x00";
+export declare const ZERO_HASH: string;
+/**
+ * Computes the Keccak-256 hash of the concatenation of two hash values.
+ * @param a The first hash as a Hash type.
+ * @param b The second hash as a Hash type.
+ * @returns The Keccak-256 hash result as a Hash type.
+ */
+export declare function hashInternal(a: string, b: string): string;
+//# sourceMappingURL=common.d.ts.map

package/dist/hasher/common.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"common.d.ts","sourceRoot":"","sources":["../../src/hasher/common.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,WAAW,EAAE,WAAW,EAAE,MAAM,aAAa,CAAA;AAE3D,MAAM,MAAM,UAAU,CAAC,CAAC,SAAS,WAAW,GAAG,WAAW,IAAI,CAAC,OAAO,EAAE,WAAW,CAAC,CAAC,CAAC,KAAK,MAAM,CAAA;AAGjG,eAAO,MAAM,qBAAqB,SAAS,CAAA;AAC3C,eAAO,MAAM,SAAS,QAAyC,CAAA;AAE/D;;;;;GAKG;AACH,wBAAgB,YAAY,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAMzD"}

package/dist/hasher/common.js

@@ -0,0 +1,19 @@
+import { concat, hexlify, keccak256, toBeHex } from 'ethers';
+const INTERNAL_DOMAIN_SEPARATOR = toBeHex(1, 32);
+export const LEAF_DOMAIN_SEPARATOR = '0x00';
+export const ZERO_HASH = hexlify(new Uint8Array(32).fill(0xff));
+/**
+ * Computes the Keccak-256 hash of the concatenation of two hash values.
+ * @param a The first hash as a Hash type.
+ * @param b The second hash as a Hash type.
+ * @returns The Keccak-256 hash result as a Hash type.
+ */
+export function hashInternal(a, b) {
+    if (a > b) {
+        ;
+        [a, b] = [b, a];
+    }
+    const combinedData = concat([INTERNAL_DOMAIN_SEPARATOR, a, b]);
+    return keccak256(combinedData);
+}
+//# sourceMappingURL=common.js.map

package/dist/hasher/common.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"common.js","sourceRoot":"","sources":["../../src/hasher/common.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,SAAS,EAAE,OAAO,EAAE,MAAM,QAAQ,CAAA;AAM5D,MAAM,yBAAyB,GAAG,OAAO,CAAC,CAAC,EAAE,EAAE,CAAC,CAAA;AAChD,MAAM,CAAC,MAAM,qBAAqB,GAAG,MAAM,CAAA;AAC3C,MAAM,CAAC,MAAM,SAAS,GAAG,OAAO,CAAC,IAAI,UAAU,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAA;AAE/D;;;;;GAKG;AACH,MAAM,UAAU,YAAY,CAAC,CAAS,EAAE,CAAS;IAC/C,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QACV,CAAC;QAAA,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;IAClB,CAAC;IACD,MAAM,YAAY,GAAG,MAAM,CAAC,CAAC,yBAAyB,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAA;IAC9D,OAAO,SAAS,CAAC,YAAY,CAAC,CAAA;AAChC,CAAC"}

package/dist/hasher/hasher.d.ts

@@ -0,0 +1,4 @@
+import type { CCIPVersion, Lane } from '../types.ts';
+import type { LeafHasher } from './common.ts';
+export declare function getLeafHasher<V extends CCIPVersion = CCIPVersion>(lane: Lane<V>): LeafHasher<V>;
+//# sourceMappingURL=hasher.d.ts.map

package/dist/hasher/hasher.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"hasher.d.ts","sourceRoot":"","sources":["../../src/hasher/hasher.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,WAAW,EAAE,IAAI,EAAE,MAAM,aAAa,CAAA;AAEpD,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,aAAa,CAAA;AAG7C,wBAAgB,aAAa,CAAC,CAAC,SAAS,WAAW,GAAG,WAAW,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,CAK/F"}

package/dist/hasher/hasher.js

@@ -0,0 +1,11 @@
+import { supportedChains } from "../supported-chains.js";
+import { networkInfo } from "../utils.js";
+// Factory function that returns the right encoder based on the version of the lane
+export function getLeafHasher(lane) {
+    const destFamily = networkInfo(lane.destChainSelector).family;
+    const chain = supportedChains[destFamily];
+    if (!chain)
+        throw new Error(`Unsupported chain family: ${destFamily}`);
+    return chain.getDestLeafHasher(lane);
+}
+//# sourceMappingURL=hasher.js.map

package/dist/hasher/hasher.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"hasher.js","sourceRoot":"","sources":["../../src/hasher/hasher.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,eAAe,EAAE,MAAM,wBAAwB,CAAA;AAExD,OAAO,EAAE,WAAW,EAAE,MAAM,aAAa,CAAA;AAGzC,mFAAmF;AACnF,MAAM,UAAU,aAAa,CAAsC,IAAa;IAC9E,MAAM,UAAU,GAAG,WAAW,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAC,MAAM,CAAA;IAC7D,MAAM,KAAK,GAAG,eAAe,CAAC,UAAU,CAAC,CAAA;IACzC,IAAI,CAAC,KAAK;QAAE,MAAM,IAAI,KAAK,CAAC,6BAA6B,UAAU,EAAE,CAAC,CAAA;IACtE,OAAO,KAAK,CAAC,iBAAiB,CAAC,IAAI,CAAkB,CAAA;AACvD,CAAC"}

package/dist/hasher/index.d.ts

@@ -0,0 +1,4 @@
+export { type LeafHasher, ZERO_HASH, hashInternal } from './common.ts';
+export { MAX_NUMBER_TREE_LEAVES, Tree, proofFlagsToBits, verifyComputeRoot } from './merklemulti.ts';
+export { getLeafHasher } from './hasher.ts';
+//# sourceMappingURL=index.d.ts.map

package/dist/hasher/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/hasher/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,UAAU,EAAE,SAAS,EAAE,YAAY,EAAE,MAAM,aAAa,CAAA;AACtE,OAAO,EAAE,sBAAsB,EAAE,IAAI,EAAE,gBAAgB,EAAE,iBAAiB,EAAE,MAAM,kBAAkB,CAAA;AACpG,OAAO,EAAE,aAAa,EAAE,MAAM,aAAa,CAAA"}

package/dist/hasher/index.js

@@ -0,0 +1,4 @@
+export { ZERO_HASH, hashInternal } from "./common.js";
+export { MAX_NUMBER_TREE_LEAVES, Tree, proofFlagsToBits, verifyComputeRoot } from "./merklemulti.js";
+export { getLeafHasher } from "./hasher.js";
+//# sourceMappingURL=index.js.map

package/dist/hasher/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/hasher/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAmB,SAAS,EAAE,YAAY,EAAE,MAAM,aAAa,CAAA;AACtE,OAAO,EAAE,sBAAsB,EAAE,IAAI,EAAE,gBAAgB,EAAE,iBAAiB,EAAE,MAAM,kBAAkB,CAAA;AACpG,OAAO,EAAE,aAAa,EAAE,MAAM,aAAa,CAAA"}

package/dist/hasher/merklemulti.d.ts

@@ -0,0 +1,58 @@
+export declare const MAX_NUMBER_TREE_LEAVES = 256;
+type Hash = string;
+/**
+ * Proof represents a proof data structure with hashes and source flags.
+ * @template Hash The hash type.
+ */
+export declare class Proof {
+    hashes: Hash[];
+    sourceFlags: boolean[];
+    constructor(hashes?: Hash[], sourceFlags?: boolean[]);
+    /**
+     * Counts the number of source flags that match the given boolean value.
+     * @param b The boolean value to count.
+     * @returns The count of source flags matching the provided boolean value.
+     */
+    countSourceFlags(b: boolean): number;
+}
+/**
+ * Represents a Merkle Tree data structure.
+ * @typeparam Hash The type of hash used in the tree.
+ */
+export declare class Tree {
+    layers: Hash[][];
+    /**
+     * Creates a new Merkle Tree using the provided context and leaf hashes.
+     * @param leafHashes An array of leaf hashes to construct the tree.
+     * @returns A new Merkle Tree instance.
+     * @throws Error if there are no leaf hashes provided.
+     */
+    constructor(leafHashes: Hash[]);
+    /**
+     * Returns the root hash of the Merkle Tree.
+     * @returns The root hash.
+     */
+    root(): Hash;
+    /**
+     * Generates a Merkle proof for a set of indices in the tree.
+     * @param indices The indices for which to generate the proof.
+     * @returns A proof object containing hashes and source flags.
+     */
+    prove(indices: number[]): Proof;
+}
+/**
+ * Converts an array of boolean proof flags to a BigNumber where each flag represents a bit.
+ * @param proofFlags An array of boolean proof flags.
+ * @returns A BigNumber representing the encoded flags.
+ */
+export declare function proofFlagsToBits(proofFlags: boolean[]): bigint;
+/**
+ * Verifies and computes the Merkle root hash based on provided leaf hashes and a Merkle proof.
+ * @param ctx The Merkle context.
+ * @param leafHashes An array of leaf hashes.
+ * @param proof The Merkle proof containing hashes and source flags.
+ * @returns The computed Merkle root hash.
+ */
+export declare function verifyComputeRoot(leafHashes: Hash[], proof: Proof): Hash;
+export {};
+//# sourceMappingURL=merklemulti.d.ts.map

package/dist/hasher/merklemulti.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"merklemulti.d.ts","sourceRoot":"","sources":["../../src/hasher/merklemulti.ts"],"names":[],"mappings":"AAGA,eAAO,MAAM,sBAAsB,MAAM,CAAA;AAEzC,KAAK,IAAI,GAAG,MAAM,CAAA;AAQlB;;;GAGG;AACH,qBAAa,KAAK;IAChB,MAAM,EAAE,IAAI,EAAE,CAAK;IACnB,WAAW,EAAE,OAAO,EAAE,CAAK;gBAEf,MAAM,GAAE,IAAI,EAAO,EAAE,WAAW,GAAE,OAAO,EAAO;IAK5D;;;;OAIG;IACH,gBAAgB,CAAC,CAAC,EAAE,OAAO,GAAG,MAAM;CAGrC;AAiGD;;;GAGG;AACH,qBAAa,IAAI;IACf,MAAM,EAAE,IAAI,EAAE,EAAE,CAAA;IAEhB;;;;;OAKG;gBACS,UAAU,EAAE,IAAI,EAAE;IAyB9B;;;OAGG;IACH,IAAI,IAAI,IAAI;IAIZ;;;;OAIG;IACH,KAAK,CAAC,OAAO,EAAE,MAAM,EAAE,GAAG,KAAK;CAahC;AAED;;;;GAIG;AACH,wBAAgB,gBAAgB,CAAC,UAAU,EAAE,OAAO,EAAE,GAAG,MAAM,CAY9D;AAED;;;;;;GAMG;AACH,wBAAgB,iBAAiB,CAAC,UAAU,EAAE,IAAI,EAAE,EAAE,KAAK,EAAE,KAAK,GAAG,IAAI,CAqFxE"}

package/dist/hasher/merklemulti.js

@@ -0,0 +1,257 @@
+// For reference implementation, see https://github.com/smartcontractkit/ccip/blob/ccip-develop/core/services/ocr2/plugins/ccip/merklemulti/merkle_multi.go
+import { ZERO_HASH, hashInternal } from "./common.js";
+export const MAX_NUMBER_TREE_LEAVES = 256;
+/**
+ * Proof represents a proof data structure with hashes and source flags.
+ * @template Hash The hash type.
+ */
+export class Proof {
+    hashes = [];
+    sourceFlags = [];
+    constructor(hashes = [], sourceFlags = []) {
+        this.hashes = hashes;
+        this.sourceFlags = sourceFlags;
+    }
+    /**
+     * Counts the number of source flags that match the given boolean value.
+     * @param b The boolean value to count.
+     * @returns The count of source flags matching the provided boolean value.
+     */
+    countSourceFlags(b) {
+        return this.sourceFlags.filter((flag) => flag === b).length;
+    }
+}
+/**
+ * Computes the next layer of a binary tree structure represented as an array of hash values.
+ *
+ * This function takes a context `ctx` and an array `layer` containing hash values as input.
+ * It processes the `layer` to generate the next layer of hash values, pairing adjacent values
+ * and applying the hashing function provided by the context.
+ *
+ * @template Hash - Generic type parameter representing the hash type.
+ * @param {Hash[]} layer - An array of hash values representing the current layer of the binary tree.
+ * @returns {[Hash[], Hash[]]} A tuple containing two arrays:
+ *   - The first array contains the original input layer.
+ *   - The second array contains the next layer of hash values generated by combining pairs of hashes.
+ */
+function computeNextLayer(layer) {
+    if (layer.length === 1) {
+        return [layer, layer];
+    }
+    if (layer.length % 2 !== 0) {
+        layer.push(ZERO_HASH);
+    }
+    const nextLayer = [];
+    for (let i = 0; i < layer.length; i += 2) {
+        nextLayer.push(hashInternal(layer[i], layer[i + 1]));
+    }
+    return [layer, nextLayer];
+}
+/**
+ * Calculates the parent index of a given index in a binary tree.
+ * @param idx The index for which to calculate the parent index.
+ * @returns The parent index.
+ */
+function parentIndex(idx) {
+    return Math.floor(idx / 2);
+}
+/**
+ * Calculates the sibling index of a given index in a binary tree.
+ * @param idx The index for which to calculate the sibling index.
+ * @returns The sibling index.
+ */
+function siblingIndex(idx) {
+    return idx ^ 1;
+}
+/**
+ * Generates a single-layer Merkle proof for a given set of indices within a layer.
+ * @param layer The layer of data for which to generate the proof.
+ * @param indices The indices within the layer for which to generate the proof.
+ * @returns A single-layer proof object containing nextIndices, subProof, and sourceFlags.
+ */
+function proveSingleLayer(layer, indices) {
+    const authIndices = [];
+    const nextIndices = [];
+    const sourceFlags = [];
+    let j = 0;
+    while (j < indices.length) {
+        const x = indices[j];
+        // Calculate the parent index for the current index and add it to the nextIndices array.
+        nextIndices.push(parentIndex(x));
+        // Check if there is a sibling index following the current index.
+        if (j + 1 < indices.length && indices[j + 1] === siblingIndex(x)) {
+            // If a sibling index is found, mark it as a source of the proof (sourceFlag = true).
+            j++;
+            sourceFlags.push(true);
+        }
+        else {
+            // If there is no sibling index, add the sibling index to the authentication indices.
+            authIndices.push(siblingIndex(x));
+            // Mark it as not a source of the proof (sourceFlag = false).
+            sourceFlags.push(false);
+        }
+        j++;
+    }
+    // Initialize an array to store the subproof.
+    const subProof = [];
+    for (const i of authIndices) {
+        // Populate the subproof array with the values from the authentication indices in the layer.
+        subProof.push(layer[i]);
+    }
+    // Return the single-layer proof object containing nextIndices, subProof, and sourceFlags.
+    return {
+        nextIndices,
+        subProof,
+        sourceFlags,
+    };
+}
+/**
+ * Represents a Merkle Tree data structure.
+ * @typeparam Hash The type of hash used in the tree.
+ */
+export class Tree {
+    layers;
+    /**
+     * Creates a new Merkle Tree using the provided context and leaf hashes.
+     * @param leafHashes An array of leaf hashes to construct the tree.
+     * @returns A new Merkle Tree instance.
+     * @throws Error if there are no leaf hashes provided.
+     */
+    constructor(leafHashes) {
+        if (leafHashes.length === 0) {
+            throw new Error('Cannot construct a tree without leaves');
+        }
+        // Initialize the first layer with leaf hashes.
+        let layer = [...leafHashes];
+        // Initialize an array to store layers.
+        const layers = [layer];
+        let curr = 0;
+        // Continue building layers until there is only one hash remaining.
+        while (layer.length > 1) {
+            const [paddedLayer, nextLayer] = computeNextLayer(layer);
+            layers[curr] = paddedLayer;
+            curr++;
+            layers.push(nextLayer);
+            layer = nextLayer;
+        }
+        this.layers = layers;
+    }
+    /**
+     * Returns the root hash of the Merkle Tree.
+     * @returns The root hash.
+     */
+    root() {
+        return this.layers[this.layers.length - 1][0];
+    }
+    /**
+     * Generates a Merkle proof for a set of indices in the tree.
+     * @param indices The indices for which to generate the proof.
+     * @returns A proof object containing hashes and source flags.
+     */
+    prove(indices) {
+        const proof = new Proof([], []);
+        for (const layer of this.layers.slice(0, this.layers.length - 1)) {
+            const res = proveSingleLayer(layer, indices);
+            indices = res.nextIndices;
+            proof.hashes.push(...res.subProof);
+            proof.sourceFlags.push(...res.sourceFlags);
+        }
+        return proof;
+    }
+}
+/**
+ * Converts an array of boolean proof flags to a BigNumber where each flag represents a bit.
+ * @param proofFlags An array of boolean proof flags.
+ * @returns A BigNumber representing the encoded flags.
+ */
+export function proofFlagsToBits(proofFlags) {
+    let encodedFlags = 0n;
+    // Iterate through the proof flags to encode them into bits.
+    for (let i = 0; i < proofFlags.length; i++) {
+        if (proofFlags[i]) {
+            // If the current flag is true, set the corresponding bit to 1 using bitwise OR.
+            encodedFlags |= 1n << BigInt(i);
+        }
+    }
+    // Return the final BigNumber representing the encoded flags.
+    return encodedFlags;
+}
+/**
+ * Verifies and computes the Merkle root hash based on provided leaf hashes and a Merkle proof.
+ * @param ctx The Merkle context.
+ * @param leafHashes An array of leaf hashes.
+ * @param proof The Merkle proof containing hashes and source flags.
+ * @returns The computed Merkle root hash.
+ */
+export function verifyComputeRoot(leafHashes, proof) {
+    const leavesLength = leafHashes.length;
+    const proofsLength = proof.hashes.length;
+    if (leavesLength === 0 && proofsLength === 0) {
+        throw new Error('leaves and proofs are empty');
+    }
+    if (leavesLength > MAX_NUMBER_TREE_LEAVES + 1 || proofsLength > MAX_NUMBER_TREE_LEAVES + 1) {
+        throw new Error(`leaves or proofs length beyond the limit of ${MAX_NUMBER_TREE_LEAVES}`);
+    }
+    const totalHashes = leavesLength + proofsLength - 1;
+    if (totalHashes > MAX_NUMBER_TREE_LEAVES) {
+        throw new Error(`total hashes length cannot be larger than ${MAX_NUMBER_TREE_LEAVES}`);
+    }
+    if (totalHashes !== proof.sourceFlags.length) {
+        throw new Error(`hashes ${totalHashes} != sourceFlags ${proof.sourceFlags.length}`);
+    }
+    // If there are no hashes, return the first leaf hash.
+    if (totalHashes === 0) {
+        return leafHashes[0];
+    }
+    // Count the number of source flags pointing to proofs.
+    const sourceProofCount = proof.countSourceFlags(false);
+    if (sourceProofCount !== proofsLength) {
+        throw new Error(`proof source flags ${sourceProofCount} != proof hashes ${proofsLength}`);
+    }
+    const hashes = new Array(totalHashes);
+    for (let i = 0; i < totalHashes; i++) {
+        // Initialize the hashes array with the first leaf hash.
+        hashes.push(leafHashes[0]);
+    }
+    let leafPos = 0;
+    let hashPos = 0;
+    let proofPos = 0;
+    for (let i = 0; i < totalHashes; i++) {
+        let a = undefined;
+        let b = undefined;
+        if (proof.sourceFlags[i] === true) {
+            if (leafPos < leavesLength) {
+                a = leafHashes[leafPos];
+                leafPos++;
+            }
+            else {
+                a = hashes[hashPos];
+                hashPos++;
+            }
+        }
+        else if (proof.sourceFlags[i] === false) {
+            a = proof.hashes[proofPos];
+            proofPos++;
+        }
+        if (leafPos < leavesLength) {
+            b = leafHashes[leafPos];
+            leafPos++;
+        }
+        else {
+            b = hashes[hashPos];
+            hashPos++;
+        }
+        if (a === undefined || b === undefined) {
+            throw new Error('a or b is undefined');
+        }
+        // Compute the hash of a and b and store it in the hashes array.
+        hashes[i] = hashInternal(a, b);
+    }
+    // Check if all proofs were used during processing.
+    if (hashPos !== totalHashes - 1 || leafPos !== leavesLength || proofPos !== proofsLength) {
+        throw new Error('not all proofs used during processing');
+    }
+    // Return the computed Merkle root hash.
+    return hashes[totalHashes - 1];
+}
+//# sourceMappingURL=merklemulti.js.map

package/dist/hasher/merklemulti.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"merklemulti.js","sourceRoot":"","sources":["../../src/hasher/merklemulti.ts"],"names":[],"mappings":"AAAA,2JAA2J;AAC3J,OAAO,EAAE,SAAS,EAAE,YAAY,EAAE,MAAM,aAAa,CAAA;AAErD,MAAM,CAAC,MAAM,sBAAsB,GAAG,GAAG,CAAA;AAUzC;;;GAGG;AACH,MAAM,OAAO,KAAK;IAChB,MAAM,GAAW,EAAE,CAAA;IACnB,WAAW,GAAc,EAAE,CAAA;IAE3B,YAAY,SAAiB,EAAE,EAAE,cAAyB,EAAE;QAC1D,IAAI,CAAC,MAAM,GAAG,MAAM,CAAA;QACpB,IAAI,CAAC,WAAW,GAAG,WAAW,CAAA;IAChC,CAAC;IAED;;;;OAIG;IACH,gBAAgB,CAAC,CAAU;QACzB,OAAO,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,MAAM,CAAA;IAC7D,CAAC;CACF;AAED;;;;;;;;;;;;GAYG;AACH,SAAS,gBAAgB,CAAC,KAAa;IACrC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACvB,OAAO,CAAC,KAAK,EAAE,KAAK,CAAC,CAAA;IACvB,CAAC;IACD,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;QAC3B,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAA;IACvB,CAAC;IAED,MAAM,SAAS,GAAW,EAAE,CAAA;IAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QACzC,SAAS,CAAC,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAA;IACtD,CAAC;IAED,OAAO,CAAC,KAAK,EAAE,SAAS,CAAC,CAAA;AAC3B,CAAC;AAED;;;;GAIG;AACH,SAAS,WAAW,CAAC,GAAW;IAC9B,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,GAAG,CAAC,CAAC,CAAA;AAC5B,CAAC;AAED;;;;GAIG;AACH,SAAS,YAAY,CAAC,GAAW;IAC/B,OAAO,GAAG,GAAG,CAAC,CAAA;AAChB,CAAC;AAED;;;;;GAKG;AACH,SAAS,gBAAgB,CAAC,KAAa,EAAE,OAAiB;IACxD,MAAM,WAAW,GAAa,EAAE,CAAA;IAChC,MAAM,WAAW,GAAa,EAAE,CAAA;IAChC,MAAM,WAAW,GAAc,EAAE,CAAA;IAEjC,IAAI,CAAC,GAAG,CAAC,CAAA;IACT,OAAO,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;QAC1B,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAA;QAEpB,wFAAwF;QACxF,WAAW,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAA;QAEhC,iEAAiE;QACjE,IAAI,CAAC,GAAG,CAAC,GAAG,OAAO,CAAC,MAAM,IAAI,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC;YACjE,qFAAqF;YACrF,CAAC,EAAE,CAAA;YACH,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;QACxB,CAAC;aAAM,CAAC;YACN,qFAAqF;YACrF,WAAW,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAA;YACjC,6DAA6D;YAC7D,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;QACzB,CAAC;QAED,CAAC,EAAE,CAAA;IACL,CAAC;IAED,6CAA6C;IAC7C,MAAM,QAAQ,GAAW,EAAE,CAAA;IAC3B,KAAK,MAAM,CAAC,IAAI,WAAW,EAAE,CAAC;QAC5B,4FAA4F;QAC5F,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAA;IACzB,CAAC;IAED,0FAA0F;IAC1F,OAAO;QACL,WAAW;QACX,QAAQ;QACR,WAAW;KACZ,CAAA;AACH,CAAC;AAED;;;GAGG;AACH,MAAM,OAAO,IAAI;IACf,MAAM,CAAU;IAEhB;;;;;OAKG;IACH,YAAY,UAAkB;QAC5B,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC5B,MAAM,IAAI,KAAK,CAAC,wCAAwC,CAAC,CAAA;QAC3D,CAAC;QAED,+CAA+C;QAC/C,IAAI,KAAK,GAAW,CAAC,GAAG,UAAU,CAAC,CAAA;QAEnC,uCAAuC;QACvC,MAAM,MAAM,GAAa,CAAC,KAAK,CAAC,CAAA;QAEhC,IAAI,IAAI,GAAG,CAAC,CAAA;QAEZ,mEAAmE;QACnE,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,CAAC,WAAW,EAAE,SAAS,CAAC,GAAG,gBAAgB,CAAC,KAAK,CAAC,CAAA;YACxD,MAAM,CAAC,IAAI,CAAC,GAAG,WAAW,CAAA;YAC1B,IAAI,EAAE,CAAA;YACN,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAA;YACtB,KAAK,GAAG,SAAS,CAAA;QACnB,CAAC;QAED,IAAI,CAAC,MAAM,GAAG,MAAM,CAAA;IACtB,CAAC;IAED;;;OAGG;IACH,IAAI;QACF,OAAO,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;IAC/C,CAAC;IAED;;;;OAIG;IACH,KAAK,CAAC,OAAiB;QACrB,MAAM,KAAK,GAAU,IAAI,KAAK,CAAC,EAAE,EAAE,EAAE,CAAC,CAAA;QAEtC,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,CAAC;YACjE,MAAM,GAAG,GAAG,gBAAgB,CAAC,KAAK,EAAE,OAAO,CAAC,CAAA;YAE5C,OAAO,GAAG,GAAG,CAAC,WAAW,CAAA;YACzB,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,QAAQ,CAAC,CAAA;YAClC,KAAK,CAAC,WAAW,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,WAAW,CAAC,CAAA;QAC5C,CAAC;QAED,OAAO,KAAK,CAAA;IACd,CAAC;CACF;AAED;;;;GAIG;AACH,MAAM,UAAU,gBAAgB,CAAC,UAAqB;IACpD,IAAI,YAAY,GAAG,EAAE,CAAA;IAErB,4DAA4D;IAC5D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3C,IAAI,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC;YAClB,gFAAgF;YAChF,YAAY,IAAI,EAAE,IAAI,MAAM,CAAC,CAAC,CAAC,CAAA;QACjC,CAAC;IACH,CAAC;IACD,6DAA6D;IAC7D,OAAO,YAAY,CAAA;AACrB,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,iBAAiB,CAAC,UAAkB,EAAE,KAAY;IAChE,MAAM,YAAY,GAAG,UAAU,CAAC,MAAM,CAAA;IACtC,MAAM,YAAY,GAAG,KAAK,CAAC,MAAM,CAAC,MAAM,CAAA;IAExC,IAAI,YAAY,KAAK,CAAC,IAAI,YAAY,KAAK,CAAC,EAAE,CAAC;QAC7C,MAAM,IAAI,KAAK,CAAC,6BAA6B,CAAC,CAAA;IAChD,CAAC;IAED,IAAI,YAAY,GAAG,sBAAsB,GAAG,CAAC,IAAI,YAAY,GAAG,sBAAsB,GAAG,CAAC,EAAE,CAAC;QAC3F,MAAM,IAAI,KAAK,CAAC,+CAA+C,sBAAsB,EAAE,CAAC,CAAA;IAC1F,CAAC;IAED,MAAM,WAAW,GAAG,YAAY,GAAG,YAAY,GAAG,CAAC,CAAA;IAEnD,IAAI,WAAW,GAAG,sBAAsB,EAAE,CAAC;QACzC,MAAM,IAAI,KAAK,CAAC,6CAA6C,sBAAsB,EAAE,CAAC,CAAA;IACxF,CAAC;IAED,IAAI,WAAW,KAAK,KAAK,CAAC,WAAW,CAAC,MAAM,EAAE,CAAC;QAC7C,MAAM,IAAI,KAAK,CAAC,UAAU,WAAW,mBAAmB,KAAK,CAAC,WAAW,CAAC,MAAM,EAAE,CAAC,CAAA;IACrF,CAAC;IAED,sDAAsD;IACtD,IAAI,WAAW,KAAK,CAAC,EAAE,CAAC;QACtB,OAAO,UAAU,CAAC,CAAC,CAAC,CAAA;IACtB,CAAC;IAED,uDAAuD;IACvD,MAAM,gBAAgB,GAAG,KAAK,CAAC,gBAAgB,CAAC,KAAK,CAAC,CAAA;IAEtD,IAAI,gBAAgB,KAAK,YAAY,EAAE,CAAC;QACtC,MAAM,IAAI,KAAK,CAAC,sBAAsB,gBAAgB,oBAAoB,YAAY,EAAE,CAAC,CAAA;IAC3F,CAAC;IAED,MAAM,MAAM,GAAW,IAAI,KAAK,CAAO,WAAW,CAAC,CAAA;IAEnD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,EAAE,CAAC,EAAE,EAAE,CAAC;QACrC,wDAAwD;QACxD,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAA;IAC5B,CAAC;IAED,IAAI,OAAO,GAAG,CAAC,CAAA;IACf,IAAI,OAAO,GAAG,CAAC,CAAA;IACf,IAAI,QAAQ,GAAG,CAAC,CAAA;IAEhB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,EAAE,CAAC,EAAE,EAAE,CAAC;QACrC,IAAI,CAAC,GAAqB,SAAS,CAAA;QACnC,IAAI,CAAC,GAAqB,SAAS,CAAA;QAEnC,IAAI,KAAK,CAAC,WAAW,CAAC,CAAC,CAAC,KAAK,IAAI,EAAE,CAAC;YAClC,IAAI,OAAO,GAAG,YAAY,EAAE,CAAC;gBAC3B,CAAC,GAAG,UAAU,CAAC,OAAO,CAAC,CAAA;gBACvB,OAAO,EAAE,CAAA;YACX,CAAC;iBAAM,CAAC;gBACN,CAAC,GAAG,MAAM,CAAC,OAAO,CAAC,CAAA;gBACnB,OAAO,EAAE,CAAA;YACX,CAAC;QACH,CAAC;aAAM,IAAI,KAAK,CAAC,WAAW,CAAC,CAAC,CAAC,KAAK,KAAK,EAAE,CAAC;YAC1C,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAA;YAC1B,QAAQ,EAAE,CAAA;QACZ,CAAC;QAED,IAAI,OAAO,GAAG,YAAY,EAAE,CAAC;YAC3B,CAAC,GAAG,UAAU,CAAC,OAAO,CAAC,CAAA;YACvB,OAAO,EAAE,CAAA;QACX,CAAC;aAAM,CAAC;YACN,CAAC,GAAG,MAAM,CAAC,OAAO,CAAC,CAAA;YACnB,OAAO,EAAE,CAAA;QACX,CAAC;QAED,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,SAAS,EAAE,CAAC;YACvC,MAAM,IAAI,KAAK,CAAC,qBAAqB,CAAC,CAAA;QACxC,CAAC;QAED,gEAAgE;QAChE,MAAM,CAAC,CAAC,CAAC,GAAG,YAAY,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;IAChC,CAAC;IAED,mDAAmD;IACnD,IAAI,OAAO,KAAK,WAAW,GAAG,CAAC,IAAI,OAAO,KAAK,YAAY,IAAI,QAAQ,KAAK,YAAY,EAAE,CAAC;QACzF,MAAM,IAAI,KAAK,CAAC,uCAAuC,CAAC,CAAA;IAC1D,CAAC;IAED,wCAAwC;IACxC,OAAO,MAAM,CAAC,WAAW,GAAG,CAAC,CAAC,CAAA;AAChC,CAAC"}

package/dist/index.d.ts

@@ -0,0 +1,13 @@
+export { AptosChain } from './aptos/index.ts';
+export { type Chain, type ChainGetter, type ChainStatic, type ChainTransaction, type LogFilter, type RateLimiterState, type TokenInfo, type TokenPoolRemote, ChainFamily, } from './chain.ts';
+export { EVMChain } from './evm/index.ts';
+export { calculateManualExecProof, discoverOffRamp } from './execution.ts';
+export { type EVMExtraArgsV1, type EVMExtraArgsV2, type ExtraArgs, type SVMExtraArgsV1, type SuiExtraArgsV1, decodeExtraArgs, encodeExtraArgs, } from './extra-args.ts';
+export { estimateExecGasForRequest } from './gas.ts';
+export { decodeMessage, fetchAllMessagesInBatch, fetchCCIPMessageById, fetchCCIPRequestsInTx, fetchRequestsForSender, sourceToDestTokenAmounts, } from './requests.ts';
+export { SolanaChain } from './solana/index.ts';
+export { SuiChain } from './sui/index.ts';
+export { supportedChains } from './supported-chains.ts';
+export { type AnyMessage, type CCIPCommit, type CCIPExecution, type CCIPMessage, type CCIPRequest, type CommitReport, type ExecutionReceipt, type ExecutionReport, type Lane, type NetworkInfo, type OffchainTokenData, CCIPVersion, ExecutionState, } from './types.ts';
+export { bigIntReplacer, bigIntReviver, decodeAddress, getDataBytes, networkInfo } from './utils.ts';
+//# sourceMappingURL=index.d.ts.map

package/dist/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,MAAM,kBAAkB,CAAA;AAC7C,OAAO,EACL,KAAK,KAAK,EACV,KAAK,WAAW,EAChB,KAAK,WAAW,EAChB,KAAK,gBAAgB,EACrB,KAAK,SAAS,EACd,KAAK,gBAAgB,EACrB,KAAK,SAAS,EACd,KAAK,eAAe,EACpB,WAAW,GACZ,MAAM,YAAY,CAAA;AACnB,OAAO,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAA;AACzC,OAAO,EAAE,wBAAwB,EAAE,eAAe,EAAE,MAAM,gBAAgB,CAAA;AAC1E,OAAO,EACL,KAAK,cAAc,EACnB,KAAK,cAAc,EACnB,KAAK,SAAS,EACd,KAAK,cAAc,EACnB,KAAK,cAAc,EACnB,eAAe,EACf,eAAe,GAChB,MAAM,iBAAiB,CAAA;AACxB,OAAO,EAAE,yBAAyB,EAAE,MAAM,UAAU,CAAA;AACpD,OAAO,EACL,aAAa,EACb,uBAAuB,EACvB,oBAAoB,EACpB,qBAAqB,EACrB,sBAAsB,EACtB,wBAAwB,GACzB,MAAM,eAAe,CAAA;AACtB,OAAO,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAA;AAC/C,OAAO,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAA;AACzC,OAAO,EAAE,eAAe,EAAE,MAAM,uBAAuB,CAAA;AACvD,OAAO,EACL,KAAK,UAAU,EACf,KAAK,UAAU,EACf,KAAK,aAAa,EAClB,KAAK,WAAW,EAChB,KAAK,WAAW,EAChB,KAAK,YAAY,EACjB,KAAK,gBAAgB,EACrB,KAAK,eAAe,EACpB,KAAK,IAAI,EACT,KAAK,WAAW,EAChB,KAAK,iBAAiB,EACtB,WAAW,EACX,cAAc,GACf,MAAM,YAAY,CAAA;AACnB,OAAO,EAAE,cAAc,EAAE,aAAa,EAAE,aAAa,EAAE,YAAY,EAAE,WAAW,EAAE,MAAM,YAAY,CAAA"}

package/dist/index.js

@@ -0,0 +1,13 @@
+export { AptosChain } from "./aptos/index.js";
+export { ChainFamily, } from "./chain.js";
+export { EVMChain } from "./evm/index.js";
+export { calculateManualExecProof, discoverOffRamp } from "./execution.js";
+export { decodeExtraArgs, encodeExtraArgs, } from "./extra-args.js";
+export { estimateExecGasForRequest } from "./gas.js";
+export { decodeMessage, fetchAllMessagesInBatch, fetchCCIPMessageById, fetchCCIPRequestsInTx, fetchRequestsForSender, sourceToDestTokenAmounts, } from "./requests.js";
+export { SolanaChain } from "./solana/index.js";
+export { SuiChain } from "./sui/index.js";
+export { supportedChains } from "./supported-chains.js";
+export { CCIPVersion, ExecutionState, } from "./types.js";
+export { bigIntReplacer, bigIntReviver, decodeAddress, getDataBytes, networkInfo } from "./utils.js";
+//# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,MAAM,kBAAkB,CAAA;AAC7C,OAAO,EASL,WAAW,GACZ,MAAM,YAAY,CAAA;AACnB,OAAO,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAA;AACzC,OAAO,EAAE,wBAAwB,EAAE,eAAe,EAAE,MAAM,gBAAgB,CAAA;AAC1E,OAAO,EAML,eAAe,EACf,eAAe,GAChB,MAAM,iBAAiB,CAAA;AACxB,OAAO,EAAE,yBAAyB,EAAE,MAAM,UAAU,CAAA;AACpD,OAAO,EACL,aAAa,EACb,uBAAuB,EACvB,oBAAoB,EACpB,qBAAqB,EACrB,sBAAsB,EACtB,wBAAwB,GACzB,MAAM,eAAe,CAAA;AACtB,OAAO,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAA;AAC/C,OAAO,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAA;AACzC,OAAO,EAAE,eAAe,EAAE,MAAM,uBAAuB,CAAA;AACvD,OAAO,EAYL,WAAW,EACX,cAAc,GACf,MAAM,YAAY,CAAA;AACnB,OAAO,EAAE,cAAc,EAAE,aAAa,EAAE,aAAa,EAAE,YAAY,EAAE,WAAW,EAAE,MAAM,YAAY,CAAA"}

package/dist/offchain.d.ts

@@ -0,0 +1,20 @@
+/**
+ * Returns the USDC attestation for a given MessageSent Log
+ * https://developers.circle.com/stablecoins/reference/getattestation
+ *
+ * @param message - payload of USDC MessageSent(bytes message) event
+ * @param isTestnet - true if this was from a testnet
+ * @returns USDC/CCTP attestation bytes
+ */
+export declare function getUsdcAttestation(message: string, isTestnet: boolean): Promise<string>;
+/**
+ * Returns the LBTC attestation for a given payload hash
+ *
+ * @param payloadHash - hash of the payload of the LBTC transfer
+ * @param isTestnet - true if this was from a testnet
+ * @returns LBTC attestation bytes
+ */
+export declare function getLbtcAttestation(payloadHash: string, isTestnet: boolean): Promise<{
+    attestation: string;
+}>;
+//# sourceMappingURL=offchain.d.ts.map

package/dist/offchain.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"offchain.d.ts","sourceRoot":"","sources":["../src/offchain.ts"],"names":[],"mappings":"AAsBA;;;;;;;GAOG;AACH,wBAAsB,kBAAkB,CAAC,OAAO,EAAE,MAAM,EAAE,SAAS,EAAE,OAAO,GAAG,OAAO,CAAC,MAAM,CAAC,CAU7F;AAED;;;;;;GAMG;AACH,wBAAsB,kBAAkB,CACtC,WAAW,EAAE,MAAM,EACnB,SAAS,EAAE,OAAO,GACjB,OAAO,CAAC;IACT,WAAW,EAAE,MAAM,CAAA;CACpB,CAAC,CA+BD"}

package/dist/offchain.js

@@ -0,0 +1,59 @@
+import { keccak256 } from 'ethers';
+const CIRCLE_API_URL = {
+    mainnet: 'https://iris-api.circle.com/v1',
+    testnet: 'https://iris-api-sandbox.circle.com/v1',
+};
+const LOMBARD_API_URL = {
+    mainnet: 'https://mainnet.prod.lombard.finance',
+    testnet: 'https://gastald-testnet.prod.lombard.finance',
+};
+/**
+ * Returns the USDC attestation for a given MessageSent Log
+ * https://developers.circle.com/stablecoins/reference/getattestation
+ *
+ * @param message - payload of USDC MessageSent(bytes message) event
+ * @param isTestnet - true if this was from a testnet
+ * @returns USDC/CCTP attestation bytes
+ */
+export async function getUsdcAttestation(message, isTestnet) {
+    const msgHash = keccak256(message);
+    const circleApiBaseUrl = isTestnet ? CIRCLE_API_URL.testnet : CIRCLE_API_URL.mainnet;
+    const res = await fetch(`${circleApiBaseUrl}/attestations/${msgHash}`);
+    const json = (await res.json());
+    if (!('status' in json) || json.status !== 'complete' || !json.attestation) {
+        throw new Error('Could not fetch USDC attestation. Response: ' + JSON.stringify(json, null, 2));
+    }
+    return json.attestation;
+}
+/**
+ * Returns the LBTC attestation for a given payload hash
+ *
+ * @param payloadHash - hash of the payload of the LBTC transfer
+ * @param isTestnet - true if this was from a testnet
+ * @returns LBTC attestation bytes
+ */
+export async function getLbtcAttestation(payloadHash, isTestnet) {
+    const lbtcApiBaseUrl = isTestnet ? LOMBARD_API_URL.testnet : LOMBARD_API_URL.mainnet;
+    const res = await fetch(`${lbtcApiBaseUrl}/api/bridge/v1/deposits/getByHash`, {
+        method: 'POST',
+        body: JSON.stringify({ messageHash: [payloadHash] }),
+    });
+    const response = (await res.json());
+    if (response == null || !('attestations' in response)) {
+        throw new Error('Error while fetching LBTC attestation. Response: ' + JSON.stringify(response, null, 2));
+    }
+    const attestation = response.attestations.find((att) => att.message_hash === payloadHash);
+    if (attestation == null) {
+        throw new Error('Could not find requested LBTC attestation with hash:' +
+            payloadHash +
+            ' in response: ' +
+            JSON.stringify(response, null, 2));
+    }
+    if (attestation.status !== 'NOTARIZATION_STATUS_SESSION_APPROVED' ||
+        !('attestation' in attestation)) {
+        throw new Error('LBTC attestation is not approved or invalid. Response: ' +
+            JSON.stringify(attestation, null, 2));
+    }
+    return attestation;
+}
+//# sourceMappingURL=offchain.js.map

package/dist/offchain.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"offchain.js","sourceRoot":"","sources":["../src/offchain.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,SAAS,EAAE,MAAM,QAAQ,CAAA;AAElC,MAAM,cAAc,GAAG;IACrB,OAAO,EAAE,gCAAgC;IACzC,OAAO,EAAE,wCAAwC;CAClD,CAAA;AAOD,MAAM,eAAe,GAAG;IACtB,OAAO,EAAE,sCAAsC;IAC/C,OAAO,EAAE,8CAA8C;CACxD,CAAA;AAOD;;;;;;;GAOG;AACH,MAAM,CAAC,KAAK,UAAU,kBAAkB,CAAC,OAAe,EAAE,SAAkB;IAC1E,MAAM,OAAO,GAAG,SAAS,CAAC,OAAO,CAAC,CAAA;IAElC,MAAM,gBAAgB,GAAG,SAAS,CAAC,CAAC,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC,cAAc,CAAC,OAAO,CAAA;IACpF,MAAM,GAAG,GAAG,MAAM,KAAK,CAAC,GAAG,gBAAgB,iBAAiB,OAAO,EAAE,CAAC,CAAA;IACtE,MAAM,IAAI,GAAG,CAAC,MAAM,GAAG,CAAC,IAAI,EAAE,CAA4B,CAAA;IAC1D,IAAI,CAAC,CAAC,QAAQ,IAAI,IAAI,CAAC,IAAI,IAAI,CAAC,MAAM,KAAK,UAAU,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC;QAC3E,MAAM,IAAI,KAAK,CAAC,8CAA8C,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,CAAA;IACjG,CAAC;IACD,OAAO,IAAI,CAAC,WAAW,CAAA;AACzB,CAAC;AAED;;;;;;GAMG;AACH,MAAM,CAAC,KAAK,UAAU,kBAAkB,CACtC,WAAmB,EACnB,SAAkB;IAIlB,MAAM,cAAc,GAAG,SAAS,CAAC,CAAC,CAAC,eAAe,CAAC,OAAO,CAAC,CAAC,CAAC,eAAe,CAAC,OAAO,CAAA;IACpF,MAAM,GAAG,GAAG,MAAM,KAAK,CAAC,GAAG,cAAc,mCAAmC,EAAE;QAC5E,MAAM,EAAE,MAAM;QACd,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,EAAE,WAAW,EAAE,CAAC,WAAW,CAAC,EAAE,CAAC;KACrD,CAAC,CAAA;IACF,MAAM,QAAQ,GAAG,CAAC,MAAM,GAAG,CAAC,IAAI,EAAE,CAAgC,CAAA;IAClE,IAAI,QAAQ,IAAI,IAAI,IAAI,CAAC,CAAC,cAAc,IAAI,QAAQ,CAAC,EAAE,CAAC;QACtD,MAAM,IAAI,KAAK,CACb,mDAAmD,GAAG,IAAI,CAAC,SAAS,CAAC,QAAQ,EAAE,IAAI,EAAE,CAAC,CAAC,CACxF,CAAA;IACH,CAAC;IACD,MAAM,WAAW,GAAG,QAAQ,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,YAAY,KAAK,WAAW,CAAC,CAAA;IACzF,IAAI,WAAW,IAAI,IAAI,EAAE,CAAC;QACxB,MAAM,IAAI,KAAK,CACb,sDAAsD;YACpD,WAAW;YACX,gBAAgB;YAChB,IAAI,CAAC,SAAS,CAAC,QAAQ,EAAE,IAAI,EAAE,CAAC,CAAC,CACpC,CAAA;IACH,CAAC;IACD,IACE,WAAW,CAAC,MAAM,KAAK,sCAAsC;QAC7D,CAAC,CAAC,aAAa,IAAI,WAAW,CAAC,EAC/B,CAAC;QACD,MAAM,IAAI,KAAK,CACb,yDAAyD;YACvD,IAAI,CAAC,SAAS,CAAC,WAAW,EAAE,IAAI,EAAE,CAAC,CAAC,CACvC,CAAA;IACH,CAAC;IACD,OAAO,WAAW,CAAA;AACpB,CAAC"}