@across-protocol/sdk 4.1.63-beta.3 → 4.1.64-alpha.0

package/dist/esm/arch/evm/BlockUtils.js

@@ -1,250 +0,0 @@
-var _a;
-import { __awaiter, __extends, __generator } from "tslib";
-import assert from "assert";
-import { clamp, sortedIndexBy } from "lodash";
-import { chainIsOPStack, getNetworkName } from "../../utils/NetworkUtils";
-import { isDefined } from "../../utils/TypeGuards";
-import { BlockFinder, } from "../../utils/BlockFinder";
-import { getCurrentTime } from "../../utils/TimeUtils";
-import { CHAIN_IDs } from "../../constants";
-// Archive requests typically commence at 128 blocks past the head of the chain.
-// Round down to 120 blocks to avoid slipping into archive territory.
-var defaultBlockRange = 120;
-// Default offset to the high block number. This is subtracted from the block number of the high block
-// when it is queried from the network, rather than having been specified by the caller. This is useful
-// since the supplied Provider instance may be backed by multiple RPC providers, which can lead to some
-// providers running slower than others and taking time to synchronise on the latest block.
-var defaultHighBlockOffset = 10;
-// Retain computations for 15 minutes.
-var cacheTTL = 60 * 15;
-var now = getCurrentTime(); // Seed the cache with initial values.
-var blockTimes = (_a = {},
-    _a[CHAIN_IDs.INK] = { average: 1, timestamp: now, blockRange: 1 },
-    _a[CHAIN_IDs.LINEA] = { average: 3, timestamp: now, blockRange: 1 },
-    _a[CHAIN_IDs.MAINNET] = { average: 12.5, timestamp: now, blockRange: 1 },
-    _a[CHAIN_IDs.OPTIMISM] = { average: 2, timestamp: now, blockRange: 1 },
-    _a[CHAIN_IDs.UNICHAIN] = { average: 1, timestamp: now, blockRange: 1 },
-    _a);
-/**
- * @description Compute the average block time over a block range.
- * @returns Average number of seconds per block.
- */
-export function averageBlockTime(provider, _a) {
-    var _b;
-    var _c = _a === void 0 ? {} : _a, highBlock = _c.highBlock, highBlockOffset = _c.highBlockOffset, blockRange = _c.blockRange;
-    return __awaiter(this, void 0, void 0, function () {
-        var chainId, cache, now, earliestBlockNumber, _d, firstBlock, lastBlock, average;
-        return __generator(this, function (_e) {
-            switch (_e.label) {
-                case 0: return [4 /*yield*/, provider.getNetwork()];
-                case 1:
-                    chainId = (_e.sent()).chainId;
-                    cache = (_b = blockTimes[chainId]) !== null && _b !== void 0 ? _b : (chainIsOPStack(chainId) ? blockTimes[CHAIN_IDs.OPTIMISM] : undefined);
-                    now = getCurrentTime();
-                    if (isDefined(cache) && now < cache.timestamp + cacheTTL) {
-                        return [2 /*return*/, { average: cache.average, blockRange: cache.blockRange }];
-                    }
-                    if (!!isDefined(highBlock)) return [3 /*break*/, 3];
-                    return [4 /*yield*/, provider.getBlockNumber()];
-                case 2:
-                    highBlock = _e.sent();
-                    highBlock -= highBlockOffset !== null && highBlockOffset !== void 0 ? highBlockOffset : defaultHighBlockOffset;
-                    _e.label = 3;
-                case 3:
-                    blockRange !== null && blockRange !== void 0 ? blockRange : (blockRange = defaultBlockRange);
-                    earliestBlockNumber = highBlock - blockRange;
-                    return [4 /*yield*/, Promise.all([
-                            provider.getBlock(earliestBlockNumber),
-                            provider.getBlock(highBlock),
-                        ])];
-                case 4:
-                    _d = _e.sent(), firstBlock = _d[0], lastBlock = _d[1];
-                    [firstBlock, lastBlock].forEach(function (block) {
-                        if (!isDefined(block === null || block === void 0 ? void 0 : block.timestamp)) {
-                            var network = getNetworkName(chainId);
-                            var blockNumber = block === firstBlock ? earliestBlockNumber : highBlock;
-                            throw new Error("BlockFinder: Failed to fetch block ".concat(blockNumber, " on ").concat(network));
-                        }
-                    });
-                    average = (lastBlock.timestamp - firstBlock.timestamp) / blockRange;
-                    blockTimes[chainId] = { timestamp: now, average: average, blockRange: blockRange };
-                    return [2 /*return*/, { average: average, blockRange: blockRange }];
-            }
-        });
-    });
-}
-function estimateBlocksElapsed(seconds, cushionPercentage, provider) {
-    if (cushionPercentage === void 0) { cushionPercentage = 0.0; }
-    return __awaiter(this, void 0, void 0, function () {
-        var cushionMultiplier, average;
-        return __generator(this, function (_a) {
-            switch (_a.label) {
-                case 0:
-                    cushionMultiplier = cushionPercentage + 1.0;
-                    return [4 /*yield*/, averageBlockTime(provider)];
-                case 1:
-                    average = (_a.sent()).average;
-                    return [2 /*return*/, Math.floor((seconds * cushionMultiplier) / average)];
-            }
-        });
-    });
-}
-var EVMBlockFinder = /** @class */ (function (_super) {
-    __extends(EVMBlockFinder, _super);
-    function EVMBlockFinder(provider, blocks) {
-        if (blocks === void 0) { blocks = []; }
-        var _this = _super.call(this) || this;
-        _this.provider = provider;
-        _this.blocks = blocks;
-        return _this;
-    }
-    /**
-     * @notice Gets the latest block whose timestamp is <= the provided timestamp.
-     * @param number Timestamp timestamp to search.
-     * @param hints Optional low and high block to bound the search space.
-     */
-    EVMBlockFinder.prototype.getBlockForTimestamp = function (timestamp, hints) {
-        if (hints === void 0) { hints = {}; }
-        return __awaiter(this, void 0, void 0, function () {
-            var block, initialBlock, cushion, incrementDistance, _a, _b, multiplier, distance, blockNumber, block, index;
-            var _this = this;
-            return __generator(this, function (_c) {
-                switch (_c.label) {
-                    case 0:
-                        timestamp = Number(timestamp);
-                        assert(timestamp !== undefined && timestamp !== null, "timestamp must be provided");
-                        if (!(this.blocks.length === 0 || this.blocks[this.blocks.length - 1].timestamp < timestamp)) return [3 /*break*/, 2];
-                        return [4 /*yield*/, this.getLatestBlock()];
-                    case 1:
-                        block = _c.sent();
-                        if (timestamp >= block.timestamp)
-                            return [2 /*return*/, block];
-                        _c.label = 2;
-                    case 2: 
-                    // Prime the BlockFinder cache with any supplied hints.
-                    // If the hint is accurate, then this will bypass the subsequent estimation.
-                    return [4 /*yield*/, Promise.all(Object.values(hints)
-                            .filter(function (blockNumber) { return isDefined(blockNumber); })
-                            .map(function (blockNumber) { return _this.getBlock(blockNumber); }))];
-                    case 3:
-                        // Prime the BlockFinder cache with any supplied hints.
-                        // If the hint is accurate, then this will bypass the subsequent estimation.
-                        _c.sent();
-                        if (!(this.blocks[0].timestamp > timestamp)) return [3 /*break*/, 8];
-                        initialBlock = this.blocks[0];
-                        cushion = 1;
-                        _b = (_a = Math).max;
-                        // Ensure the increment block distance is _at least_ a single block to prevent an infinite loop.
-                        return [4 /*yield*/, estimateBlocksElapsed(initialBlock.timestamp - timestamp, cushion, this.provider)];
-                    case 4:
-                        incrementDistance = _b.apply(_a, [
-                            // Ensure the increment block distance is _at least_ a single block to prevent an infinite loop.
-                            _c.sent(), 1]);
-                        multiplier = 1;
-                        _c.label = 5;
-                    case 5:
-                        distance = multiplier * incrementDistance;
-                        blockNumber = Math.max(0, initialBlock.number - distance);
-                        return [4 /*yield*/, this.getBlock(blockNumber)];
-                    case 6:
-                        block = _c.sent();
-                        if (block.timestamp <= timestamp)
-                            return [3 /*break*/, 8]; // Found an earlier block.
-                        assert(blockNumber > 0, "timestamp is before block 0"); // Block 0 was not earlier than this timestamp. The row.
-                        _c.label = 7;
-                    case 7:
-                        multiplier++;
-                        return [3 /*break*/, 5];
-                    case 8:
-                        index = sortedIndexBy(this.blocks, { timestamp: timestamp }, "timestamp");
-                        return [2 /*return*/, this.findBlock(this.blocks[index - 1], this.blocks[index], timestamp)];
-                }
-            });
-        });
-    };
-    // Grabs the most recent block and caches it.
-    EVMBlockFinder.prototype.getLatestBlock = function () {
-        var _a;
-        return __awaiter(this, void 0, void 0, function () {
-            var block, index;
-            return __generator(this, function (_b) {
-                switch (_b.label) {
-                    case 0: return [4 /*yield*/, this.provider.getBlock("latest")];
-                    case 1:
-                        block = _b.sent();
-                        index = sortedIndexBy(this.blocks, block, "number");
-                        if (((_a = this.blocks[index]) === null || _a === void 0 ? void 0 : _a.number) !== block.number)
-                            this.blocks.splice(index, 0, block);
-                        return [2 /*return*/, this.blocks[index]];
-                }
-            });
-        });
-    };
-    // Grabs the block for a particular number and caches it.
-    EVMBlockFinder.prototype.getBlock = function (number) {
-        var _a, _b;
-        return __awaiter(this, void 0, void 0, function () {
-            var index, block;
-            return __generator(this, function (_c) {
-                switch (_c.label) {
-                    case 0:
-                        index = sortedIndexBy(this.blocks, { number: number }, "number");
-                        if (((_a = this.blocks[index]) === null || _a === void 0 ? void 0 : _a.number) === number)
-                            return [2 /*return*/, this.blocks[index]]; // Return early if block already exists.
-                        return [4 /*yield*/, this.provider.getBlock(number)];
-                    case 1:
-                        block = _c.sent();
-                        // Recompute the index after the async call since the state of this.blocks could have changed!
-                        index = sortedIndexBy(this.blocks, { number: number }, "number");
-                        // Rerun this check to avoid duplicate insertion.
-                        if (((_b = this.blocks[index]) === null || _b === void 0 ? void 0 : _b.number) === number)
-                            return [2 /*return*/, this.blocks[index]];
-                        this.blocks.splice(index, 0, block); // A simple insert at index.
-                        return [2 /*return*/, block];
-                }
-            });
-        });
-    };
-    // Return the latest block, between startBlock and endBlock, whose timestamp is <= timestamp.
-    // Effectively, this is an interpolation search algorithm to minimize block requests.
-    // Note: startBlock and endBlock _must_ be different blocks.
-    EVMBlockFinder.prototype.findBlock = function (_startBlock, _endBlock, timestamp) {
-        return __awaiter(this, void 0, void 0, function () {
-            var _a, startBlock, endBlock, totalTimeDifference, totalBlockDistance, blockPercentile, estimatedBlock, newBlock;
-            return __generator(this, function (_b) {
-                switch (_b.label) {
-                    case 0:
-                        _a = [_startBlock, _endBlock], startBlock = _a[0], endBlock = _a[1];
-                        // In the case of equality, the endBlock is expected to be passed as the one whose timestamp === the requested
-                        // timestamp.
-                        if (endBlock.timestamp === timestamp)
-                            return [2 /*return*/, endBlock];
-                        // If there's no equality, but the blocks are adjacent, return the startBlock, since we want the returned block's
-                        // timestamp to be <= the requested timestamp.
-                        if (endBlock.number === startBlock.number + 1)
-                            return [2 /*return*/, startBlock];
-                        assert(endBlock.number !== startBlock.number, "startBlock cannot equal endBlock");
-                        assert(timestamp < endBlock.timestamp && timestamp > startBlock.timestamp, "timestamp not in between start and end blocks");
-                        totalTimeDifference = endBlock.timestamp - startBlock.timestamp;
-                        totalBlockDistance = endBlock.number - startBlock.number;
-                        blockPercentile = (timestamp - startBlock.timestamp) / totalTimeDifference;
-                        estimatedBlock = startBlock.number + Math.round(blockPercentile * totalBlockDistance);
-                        return [4 /*yield*/, this.getBlock(clamp(estimatedBlock, startBlock.number + 1, endBlock.number - 1))];
-                    case 1:
-                        newBlock = _b.sent();
-                        // Depending on whether the new block is below or above the timestamp, narrow the search space accordingly.
-                        if (newBlock.timestamp < timestamp) {
-                            return [2 /*return*/, this.findBlock(newBlock, endBlock, timestamp)];
-                        }
-                        else {
-                            return [2 /*return*/, this.findBlock(startBlock, newBlock, timestamp)];
-                        }
-                        return [2 /*return*/];
-                }
-            });
-        });
-    };
-    return EVMBlockFinder;
-}(BlockFinder));
-export { EVMBlockFinder };
-//# sourceMappingURL=BlockUtils.js.map

package/dist/esm/arch/evm/BlockUtils.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"BlockUtils.js","sourceRoot":"","sources":["../../../../src/arch/evm/BlockUtils.ts"],"names":[],"mappings":";;AAAA,OAAO,MAAM,MAAM,QAAQ,CAAC;AAE5B,OAAO,EAAE,KAAK,EAAE,aAAa,EAAE,MAAM,QAAQ,CAAC;AAC9C,OAAO,EAAE,cAAc,EAAE,cAAc,EAAE,MAAM,0BAA0B,CAAC;AAC1E,OAAO,EAAE,SAAS,EAAE,MAAM,wBAAwB,CAAC;AACnD,OAAO,EACL,WAAW,GAKZ,MAAM,yBAAyB,CAAC;AACjC,OAAO,EAAE,cAAc,EAAE,MAAM,uBAAuB,CAAC;AACvD,OAAO,EAAE,SAAS,EAAE,MAAM,iBAAiB,CAAC;AAK5C,gFAAgF;AAChF,qEAAqE;AACrE,IAAM,iBAAiB,GAAG,GAAG,CAAC;AAE9B,sGAAsG;AACtG,uGAAuG;AACvG,uGAAuG;AACvG,2FAA2F;AAC3F,IAAM,sBAAsB,GAAG,EAAE,CAAC;AAElC,sCAAsC;AACtC,IAAM,QAAQ,GAAG,EAAE,GAAG,EAAE,CAAC;AACzB,IAAM,GAAG,GAAG,cAAc,EAAE,CAAC,CAAC,sCAAsC;AACpE,IAAM,UAAU;IACd,GAAC,SAAS,CAAC,GAAG,IAAG,EAAE,OAAO,EAAE,CAAC,EAAE,SAAS,EAAE,GAAG,EAAE,UAAU,EAAE,CAAC,EAAE;IAC9D,GAAC,SAAS,CAAC,KAAK,IAAG,EAAE,OAAO,EAAE,CAAC,EAAE,SAAS,EAAE,GAAG,EAAE,UAAU,EAAE,CAAC,EAAE;IAChE,GAAC,SAAS,CAAC,OAAO,IAAG,EAAE,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,GAAG,EAAE,UAAU,EAAE,CAAC,EAAE;IACrE,GAAC,SAAS,CAAC,QAAQ,IAAG,EAAE,OAAO,EAAE,CAAC,EAAE,SAAS,EAAE,GAAG,EAAE,UAAU,EAAE,CAAC,EAAE;IACnE,GAAC,SAAS,CAAC,QAAQ,IAAG,EAAE,OAAO,EAAE,CAAC,EAAE,SAAS,EAAE,GAAG,EAAE,UAAU,EAAE,CAAC,EAAE;OACpE,CAAC;AAEF;;;GAGG;AACH,MAAM,UAAgB,gBAAgB,CACpC,QAAkB,EAClB,EAAqD;;QAArD,qBAAmD,EAAE,KAAA,EAAnD,SAAS,eAAA,EAAE,eAAe,qBAAA,EAAE,UAAU,gBAAA;;;;;wBAGpB,qBAAM,QAAQ,CAAC,UAAU,EAAE,EAAA;;oBAAvC,OAAO,GAAK,CAAA,SAA2B,CAAA,QAAhC;oBAGT,KAAK,GAAG,MAAA,UAAU,CAAC,OAAO,CAAC,mCAAI,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;oBAEtG,GAAG,GAAG,cAAc,EAAE,CAAC;oBAC7B,IAAI,SAAS,CAAC,KAAK,CAAC,IAAI,GAAG,GAAG,KAAK,CAAC,SAAS,GAAG,QAAQ,EAAE;wBACxD,sBAAO,EAAE,OAAO,EAAE,KAAK,CAAC,OAAO,EAAE,UAAU,EAAE,KAAK,CAAC,UAAU,EAAE,EAAC;qBACjE;yBAIG,CAAC,SAAS,CAAC,SAAS,CAAC,EAArB,wBAAqB;oBACX,qBAAM,QAAQ,CAAC,cAAc,EAAE,EAAA;;oBAA3C,SAAS,GAAG,SAA+B,CAAC;oBAC5C,SAAS,IAAI,eAAe,aAAf,eAAe,cAAf,eAAe,GAAI,sBAAsB,CAAC;;;oBAEzD,UAAU,aAAV,UAAU,cAAV,UAAU,IAAV,UAAU,GAAK,iBAAiB,EAAC;oBAE3B,mBAAmB,GAAG,SAAS,GAAG,UAAU,CAAC;oBACnB,qBAAM,OAAO,CAAC,GAAG,CAAC;4BAChD,QAAQ,CAAC,QAAQ,CAAC,mBAAmB,CAAC;4BACtC,QAAQ,CAAC,QAAQ,CAAC,SAAS,CAAC;yBAC7B,CAAC,EAAA;;oBAHI,KAA0B,SAG9B,EAHK,UAAU,QAAA,EAAE,SAAS,QAAA;oBAI5B,CAAC,UAAU,EAAE,SAAS,CAAC,CAAC,OAAO,CAAC,UAAC,KAAwB;wBACvD,IAAI,CAAC,SAAS,CAAC,KAAK,aAAL,KAAK,uBAAL,KAAK,CAAE,SAAS,CAAC,EAAE;4BAChC,IAAM,OAAO,GAAG,cAAc,CAAC,OAAO,CAAC,CAAC;4BACxC,IAAM,WAAW,GAAG,KAAK,KAAK,UAAU,CAAC,CAAC,CAAC,mBAAmB,CAAC,CAAC,CAAC,SAAS,CAAC;4BAC3E,MAAM,IAAI,KAAK,CAAC,6CAAsC,WAAW,iBAAO,OAAO,CAAE,CAAC,CAAC;yBACpF;oBACH,CAAC,CAAC,CAAC;oBAEG,OAAO,GAAG,CAAC,SAAS,CAAC,SAAS,GAAG,UAAU,CAAC,SAAS,CAAC,GAAG,UAAU,CAAC;oBAC1E,UAAU,CAAC,OAAO,CAAC,GAAG,EAAE,SAAS,EAAE,GAAG,EAAE,OAAO,SAAA,EAAE,UAAU,YAAA,EAAE,CAAC;oBAE9D,sBAAO,EAAE,OAAO,SAAA,EAAE,UAAU,YAAA,EAAE,EAAC;;;;CAChC;AAED,SAAe,qBAAqB,CAAC,OAAe,EAAE,iBAAuB,EAAE,QAAkB;IAA3C,kCAAA,EAAA,uBAAuB;;;;;;oBACrE,iBAAiB,GAAG,iBAAiB,GAAG,GAAG,CAAC;oBAC9B,qBAAM,gBAAgB,CAAC,QAAQ,CAAC,EAAA;;oBAA5C,OAAO,GAAK,CAAA,SAAgC,CAAA,QAArC;oBACf,sBAAO,IAAI,CAAC,KAAK,CAAC,CAAC,OAAO,GAAG,iBAAiB,CAAC,GAAG,OAAO,CAAC,EAAC;;;;CAC5D;AAED;IAAoC,kCAAqB;IACvD,wBACmB,QAAkB,EAClB,MAAuB;QAAvB,uBAAA,EAAA,WAAuB;QAF1C,YAIE,iBAAO,SACR;QAJkB,cAAQ,GAAR,QAAQ,CAAU;QAClB,YAAM,GAAN,MAAM,CAAiB;;IAG1C,CAAC;IAED;;;;OAIG;IACU,6CAAoB,GAAjC,UAAkC,SAA0B,EAAE,KAA4B;QAA5B,sBAAA,EAAA,UAA4B;;;;;;;wBACxF,SAAS,GAAG,MAAM,CAAC,SAAS,CAAC,CAAC;wBAC9B,MAAM,CAAC,SAAS,KAAK,SAAS,IAAI,SAAS,KAAK,IAAI,EAAE,4BAA4B,CAAC,CAAC;6BAEhF,CAAA,IAAI,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,SAAS,GAAG,SAAS,CAAA,EAArF,wBAAqF;wBACzE,qBAAM,IAAI,CAAC,cAAc,EAAE,EAAA;;wBAAnC,KAAK,GAAG,SAA2B;wBACzC,IAAI,SAAS,IAAI,KAAK,CAAC,SAAS;4BAAE,sBAAO,KAAK,EAAC;;;oBAGjD,uDAAuD;oBACvD,4EAA4E;oBAC5E,qBAAM,OAAO,CAAC,GAAG,CACf,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC;6BACjB,MAAM,CAAC,UAAC,WAAW,IAAK,OAAA,SAAS,CAAC,WAAW,CAAC,EAAtB,CAAsB,CAAC;6BAC/C,GAAG,CAAC,UAAC,WAAW,IAAK,OAAA,KAAI,CAAC,QAAQ,CAAC,WAAW,CAAC,EAA1B,CAA0B,CAAC,CACpD,EAAA;;wBAND,uDAAuD;wBACvD,4EAA4E;wBAC5E,SAIC,CAAC;6BAGE,CAAA,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,SAAS,GAAG,SAAS,CAAA,EAApC,wBAAoC;wBAChC,YAAY,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;wBAK9B,OAAO,GAAG,CAAC,CAAC;wBACQ,KAAA,CAAA,KAAA,IAAI,CAAA,CAAC,GAAG,CAAA;wBAChC,gGAAgG;wBAChG,qBAAM,qBAAqB,CAAC,YAAY,CAAC,SAAS,GAAG,SAAS,EAAE,OAAO,EAAE,IAAI,CAAC,QAAQ,CAAC,EAAA;;wBAFnF,iBAAiB,GAAG;4BACxB,gGAAgG;4BAChG,SAAuF,EACvF,CAAC,EACF;wBAGQ,UAAU,GAAG,CAAC;;;wBACf,QAAQ,GAAG,UAAU,GAAG,iBAAiB,CAAC;wBAC1C,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,YAAY,CAAC,MAAM,GAAG,QAAQ,CAAC,CAAC;wBAClD,qBAAM,IAAI,CAAC,QAAQ,CAAC,WAAW,CAAC,EAAA;;wBAAxC,KAAK,GAAG,SAAgC;wBAC9C,IAAI,KAAK,CAAC,SAAS,IAAI,SAAS;4BAAE,wBAAM,CAAC,0BAA0B;wBACnE,MAAM,CAAC,WAAW,GAAG,CAAC,EAAE,6BAA6B,CAAC,CAAC,CAAC,wDAAwD;;;wBALvF,UAAU,EAAE,CAAA;;;wBAUnC,KAAK,GAAG,aAAa,CAAC,IAAI,CAAC,MAAM,EAAE,EAAE,SAAS,WAAA,EAAW,EAAE,WAAW,CAAC,CAAC;wBAC9E,sBAAO,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,SAAS,CAAC,EAAC;;;;KAC9E;IAED,6CAA6C;IAC/B,uCAAc,GAA5B;;;;;;4BACgB,qBAAM,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,QAAQ,CAAC,EAAA;;wBAA9C,KAAK,GAAG,SAAsC;wBAC9C,KAAK,GAAG,aAAa,CAAC,IAAI,CAAC,MAAM,EAAE,KAAK,EAAE,QAAQ,CAAC,CAAC;wBAC1D,IAAI,CAAA,MAAA,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,0CAAE,MAAM,MAAK,KAAK,CAAC,MAAM;4BAAE,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;wBACrF,sBAAO,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,EAAC;;;;KAC3B;IAED,yDAAyD;IAC3C,iCAAQ,GAAtB,UAAuB,MAAc;;;;;;;wBAC/B,KAAK,GAAG,aAAa,CAAC,IAAI,CAAC,MAAM,EAAE,EAAE,MAAM,QAAA,EAAW,EAAE,QAAQ,CAAC,CAAC;wBACtE,IAAI,CAAA,MAAA,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,0CAAE,MAAM,MAAK,MAAM;4BAAE,sBAAO,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,EAAC,CAAC,wCAAwC;wBAChG,qBAAM,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAA;;wBAA5C,KAAK,GAAG,SAAoC;wBAElD,8FAA8F;wBAC9F,KAAK,GAAG,aAAa,CAAC,IAAI,CAAC,MAAM,EAAE,EAAE,MAAM,QAAA,EAAW,EAAE,QAAQ,CAAC,CAAC;wBAElE,iDAAiD;wBACjD,IAAI,CAAA,MAAA,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,0CAAE,MAAM,MAAK,MAAM;4BAAE,sBAAO,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,EAAC;wBACrE,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,4BAA4B;wBACjE,sBAAO,KAAK,EAAC;;;;KACd;IAED,6FAA6F;IAC7F,qFAAqF;IACrF,4DAA4D;IAC9C,kCAAS,GAAvB,UAAwB,WAAqB,EAAE,SAAmB,EAAE,SAAiB;;;;;;wBAC7E,KAAyB,CAAC,WAAW,EAAE,SAAS,CAAC,EAAhD,UAAU,QAAA,EAAE,QAAQ,QAAA,CAA6B;wBACxD,8GAA8G;wBAC9G,aAAa;wBACb,IAAI,QAAQ,CAAC,SAAS,KAAK,SAAS;4BAAE,sBAAO,QAAQ,EAAC;wBAEtD,iHAAiH;wBACjH,8CAA8C;wBAC9C,IAAI,QAAQ,CAAC,MAAM,KAAK,UAAU,CAAC,MAAM,GAAG,CAAC;4BAAE,sBAAO,UAAU,EAAC;wBAEjE,MAAM,CAAC,QAAQ,CAAC,MAAM,KAAK,UAAU,CAAC,MAAM,EAAE,kCAAkC,CAAC,CAAC;wBAClF,MAAM,CACJ,SAAS,GAAG,QAAQ,CAAC,SAAS,IAAI,SAAS,GAAG,UAAU,CAAC,SAAS,EAClE,+CAA+C,CAChD,CAAC;wBAGI,mBAAmB,GAAG,QAAQ,CAAC,SAAS,GAAG,UAAU,CAAC,SAAS,CAAC;wBAChE,kBAAkB,GAAG,QAAQ,CAAC,MAAM,GAAG,UAAU,CAAC,MAAM,CAAC;wBACzD,eAAe,GAAG,CAAC,SAAS,GAAG,UAAU,CAAC,SAAS,CAAC,GAAG,mBAAmB,CAAC;wBAC3E,cAAc,GAAG,UAAU,CAAC,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,eAAe,GAAG,kBAAkB,CAAC,CAAC;wBAG3E,qBAAM,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,cAAc,EAAE,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,EAAA;;wBAAjG,QAAQ,GAAG,SAAsF;wBAEvG,2GAA2G;wBAC3G,IAAI,QAAQ,CAAC,SAAS,GAAG,SAAS,EAAE;4BAClC,sBAAO,IAAI,CAAC,SAAS,CAAC,QAAQ,EAAE,QAAQ,EAAE,SAAS,CAAC,EAAC;yBACtD;6BAAM;4BACL,sBAAO,IAAI,CAAC,SAAS,CAAC,UAAU,EAAE,QAAQ,EAAE,SAAS,CAAC,EAAC;yBACxD;;;;;KACF;IACH,qBAAC;AAAD,CAAC,AArHD,CAAoC,WAAW,GAqH9C"}

package/dist/esm/arch/svm/SpokeUtils.d.ts

@@ -1,129 +0,0 @@
-import { SvmSpokeClient } from "@across-protocol/contracts";
-import { Address, type TransactionSigner } from "@solana/kit";
-import { Logger } from "winston";
-import { Deposit, DepositWithBlock, FillStatus, FillWithBlock, RelayData } from "../../interfaces";
-import { BigNumber, SvmAddress } from "../../utils";
-import { SvmCpiEventsClient } from "./";
-import { SVMProvider } from "./types";
-/**
- * @note: Average Solana slot duration is about 400-500ms. We can be conservative
- *        and choose 400 to ensure that the most slots get included in our ranges
- */
-export declare const SLOT_DURATION_MS = 400;
-/**
- * @param spokePool SpokePool Contract instance.
- * @param deposit V3Deopsit instance.
- * @param repaymentChainId Optional repaymentChainId (defaults to destinationChainId).
- * @returns An Ethers UnsignedTransaction instance.
- */
-export declare function populateV3Relay(_spokePool: unknown, _deposit: Omit<Deposit, "messageHash">, _relayer: string, _repaymentChainId?: number): Promise<unknown>;
-/**
- * Retrieves the chain time at a particular slot.
- */
-export declare function getTimestampForSlot(provider: SVMProvider, slotNumber: number): Promise<number>;
-/**
- * Returns the current fill deadline buffer.
- * @param provider SVM Provider instance
- * @param statePda Spoke Pool's State PDA
- * @returns fill deadline buffer
- */
-export declare function getFillDeadline(provider: SVMProvider, statePda: Address): Promise<number>;
-/**
- * Finds the deposit id at a specific block number.
- * @param blockTag The block number to search for the deposit ID at.
- * @returns The deposit ID.
- */
-export declare function getDepositIdAtBlock(_contract: unknown, _blockTag: number): Promise<BigNumber>;
-/**
- * Finds deposit events within a 2-day window ending at the specified slot.
- *
- * @remarks
- * This implementation uses a slot-limited search approach because Solana PDA state has
- * limitations that prevent directly referencing old deposit IDs. Unlike EVM chains where
- * we might use binary search across the entire chain history, in Solana we must query within
- * a constrained slot range.
- *
- * The search window is calculated by:
- * 1. Using the provided slot (or current confirmed slot if none is provided)
- * 2. Looking back 2 days worth of slots from that point
- *
- * We use a 2-day window because:
- * 1. Most valid deposits that need to be processed will be recent
- * 2. This covers multiple bundle submission periods
- * 3. It balances performance with practical deposit age
- *
- * @important
- * This function may return `undefined` for valid deposit IDs that are older than the search
- * window (approximately 2 days before the specified slot). This is an acceptable limitation
- * as deposits this old are typically not relevant to current operations.
- *
- * @param eventClient - SvmCpiEventsClient instance
- * @param depositId - The deposit ID to search for
- * @param slot - The slot to search up to (defaults to current slot). The search will look
- *              for deposits between (slot - secondsLookback) and slot.
- * @param secondsLookback - The number of seconds to look back for deposits (defaults to 2 days).
- * @returns The deposit if found within the slot window, undefined otherwise
- */
-export declare function findDeposit(eventClient: SvmCpiEventsClient, depositId: BigNumber, slot?: bigint, secondsLookback?: number): Promise<DepositWithBlock | undefined>;
-/**
- * Resolves the fill status of a deposit at a specific slot or at the current confirmed one.
- *
- * If no slot is provided, attempts to solve the fill status using the PDA. Otherwise, it is reconstructed from PDA events.
- *
- * @param programId - The spoke pool program ID.
- * @param relayData - Deposit information used to locate the fill status.
- * @param destinationChainId - Destination chain ID (must be an SVM chain).
- * @param provider - SVM provider instance.
- * @param svmEventsClient - SVM events client for querying events.
- * @param atHeight - (Optional) Specific slot number to query. Defaults to the latest confirmed slot.
- * @returns The fill status for the deposit at the specified or current slot.
- */
-export declare function relayFillStatus(programId: Address, relayData: RelayData, destinationChainId: number, svmEventsClient: SvmCpiEventsClient, atHeight?: number): Promise<FillStatus>;
-/**
- * Resolves fill statuses for multiple deposits at a specific or latest confirmed slot,
- * using PDAs when possible and falling back to events if needed.
- *
- * @param programId The spoke pool program ID.
- * @param relayData An array of relay data to resolve fill statuses for.
- * @param destinationChainId The destination chain ID (must be an SVM chain).
- * @param provider SVM Provider instance.
- * @param svmEventsClient SVM events client instance for querying events.
- * @param atHeight (Optional) The slot number to query at. If omitted, queries the latest confirmed slot.
- * @returns An array of fill statuses for the specified deposits at the requested slot (or at the current confirmed slot).
- */
-export declare function fillStatusArray(programId: Address, relayData: RelayData[], destinationChainId: number, svmEventsClient: SvmCpiEventsClient, atHeight?: number, logger?: Logger): Promise<(FillStatus | undefined)[]>;
-/**
- * Finds the `FilledRelay` event for a given deposit within the provided slot range.
- *
- * @param relayData - Deposit information that is used to complete a fill.
- * @param destinationChainId - Destination chain ID (must be an SVM chain).
- * @param svmEventsClient - SVM events client instance for querying events.
- * @param fromSlot - Starting slot to search.
- * @param toSlot (Optional) Ending slot to search. If not provided, the current confirmed slot will be used.
- * @returns The fill event with block info, or `undefined` if not found.
- */
-export declare function findFillEvent(relayData: RelayData, destinationChainId: number, svmEventsClient: SvmCpiEventsClient, fromSlot: number, toSlot?: number): Promise<FillWithBlock | undefined>;
-/**
- * @param spokePool Address (program ID) of the SvmSpoke.
- * @param deposit V3Deopsit instance.
- * @param relayer Address of the relayer filling the deposit.
- * @param repaymentChainId Optional repaymentChainId (defaults to destinationChainId).
- * @returns An Ethers UnsignedTransaction instance.
- */
-export declare function fillRelayInstruction(spokePool: SvmAddress, deposit: Omit<Deposit, "messageHash">, relayer: TransactionSigner<string>, recipientTokenAccount: Address<string>, repaymentChainId?: number): Promise<SvmSpokeClient.FillRelayInstruction<Address<"JAZWcGrpSWNPTBj8QtJ9UyQqhJCDhG9GJkDeMf5NQBiq">, string, string, string, string, string, string, string, string, string, string, string, string, []>>;
-/**
- * @param mint Address of the token corresponding to the account being made.
- * @param relayer Address of the relayer filling the deposit.
- * @returns An instruction for creating a new token account.
- */
-export declare function createTokenAccountsInstruction(mint: SvmAddress, relayer: TransactionSigner<string>): SvmSpokeClient.CreateTokenAccountsInstruction;
-/**
- * @param mint Address of the token corresponding to the account being made.
- * @param amount Amount of the token to approve.
- * @param relayer Address of the relayer filling the deposit.
- * @param spokePool Address (program ID) of the SvmSpoke.
- * @returns A token approval instruction.
- */
-export declare function createApproveInstruction(mint: SvmAddress, amount: BigNumber, relayer: SvmAddress, spokePool: SvmAddress, mintDecimals?: number): Promise<import("@solana-program/token").ApproveCheckedInstruction<Address<"TokenkegQfeZyiNwAJbNbGKPFXCWuBvf9Ss623VQ5DA">, string, string, string, string, []>>;
-export declare function getAssociatedTokenAddress(owner: SvmAddress, mint: SvmAddress, tokenProgramId?: Address<string>): Promise<Address<string>>;
-export declare function getRelayDataHash(relayData: RelayData, destinationChainId: number): string;