Contract Source Code (Solidity Standard Json-Input format)

IDE

• Blockscan IDE
• 🤖 Code ReaderBeta

More Options

• Similar
• Submit Audit
• Compare

// SPDX-License-Identifier: UNLICENSED
// Copyright (c) Eywa.Fi, 2021-2025 - all rights reserved
pragma solidity ^0.8.20;

import "@openzeppelin/contracts/access/AccessControlEnumerable.sol";
import { IChainIdAdapter } from "../../interfaces/IChainIdAdapter.sol";


contract ChainIdAdapter is IChainIdAdapter, AccessControlEnumerable {
    

    bytes32 public constant OPERATOR_ROLE = keccak256("OPERATOR_ROLE");


    mapping(uint64 => uint32) public chainIdToDstEid;
    mapping(uint32 => uint64) public dstEidToChainId;

    mapping(uint64 => string) public chainIdToChainName;
    mapping(string => uint64) public chainNameToChainId;

    event DstEidSet(uint32 dstEid, uint64 chainId);
    event ChainNameSet(string chainName, uint64 chainId);

    constructor() {
        _grantRole(DEFAULT_ADMIN_ROLE, _msgSender());
    }

    function setDstEids(uint32[] memory dstEids_, uint64[] memory chainIds_) external onlyRole(OPERATOR_ROLE) {
        uint256 length = dstEids_.length;
        require(length == chainIds_.length, "ChainIdAdapter: wrong length");
        for (uint32 i; i < length; ++i) {
            uint64 chainId = chainIds_[i];
            uint32 dstEid = dstEids_[i];

            uint32 tmpDstEid = chainIdToDstEid[chainId];
            delete chainIdToDstEid[dstEidToChainId[dstEid]];
            delete dstEidToChainId[tmpDstEid];

            chainIdToDstEid[chainId] = dstEid;
            dstEidToChainId[dstEid] = chainId;
            emit DstEidSet(dstEid, chainId);
        }
    }

    function setChainNames(string[] memory chainNames_, uint64[] memory chainIds_) external onlyRole(OPERATOR_ROLE) {
        uint256 length = chainNames_.length;
        require(length == chainIds_.length, "ChainIdAdapter: wrong length");
        for (uint32 i; i < length; ++i) {
            uint64 chainId = chainIds_[i];
            string memory chainName = chainNames_[i];

            string memory tmpChainName = chainIdToChainName[chainId];
            delete chainIdToChainName[chainNameToChainId[chainName]];
            delete chainNameToChainId[tmpChainName];

            chainIdToChainName[chainIds_[i]] = chainName;
            chainNameToChainId[chainNames_[i]] = chainId;
            emit ChainNameSet(chainName, chainId);
        }
    }
}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v4.9.0) (access/AccessControl.sol)

pragma solidity ^0.8.0;

import "./IAccessControl.sol";
import "../utils/Context.sol";
import "../utils/Strings.sol";
import "../utils/introspection/ERC165.sol";

/**
 * @dev Contract module that allows children to implement role-based access
 * control mechanisms. This is a lightweight version that doesn't allow enumerating role
 * members except through off-chain means by accessing the contract event logs. Some
 * applications may benefit from on-chain enumerability, for those cases see
 * {AccessControlEnumerable}.
 *
 * Roles are referred to by their `bytes32` identifier. These should be exposed
 * in the external API and be unique. The best way to achieve this is by
 * using `public constant` hash digests:
 *
 * ```solidity
 * bytes32 public constant MY_ROLE = keccak256("MY_ROLE");
 * ```
 *
 * Roles can be used to represent a set of permissions. To restrict access to a
 * function call, use {hasRole}:
 *
 * ```solidity
 * function foo() public {
 *     require(hasRole(MY_ROLE, msg.sender));
 *     ...
 * }
 * ```
 *
 * Roles can be granted and revoked dynamically via the {grantRole} and
 * {revokeRole} functions. Each role has an associated admin role, and only
 * accounts that have a role's admin role can call {grantRole} and {revokeRole}.
 *
 * By default, the admin role for all roles is `DEFAULT_ADMIN_ROLE`, which means
 * that only accounts with this role will be able to grant or revoke other
 * roles. More complex role relationships can be created by using
 * {_setRoleAdmin}.
 *
 * WARNING: The `DEFAULT_ADMIN_ROLE` is also its own admin: it has permission to
 * grant and revoke this role. Extra precautions should be taken to secure
 * accounts that have been granted it. We recommend using {AccessControlDefaultAdminRules}
 * to enforce additional security measures for this role.
 */
abstract contract AccessControl is Context, IAccessControl, ERC165 {
    struct RoleData {
        mapping(address => bool) members;
        bytes32 adminRole;
    }

    mapping(bytes32 => RoleData) private _roles;

    bytes32 public constant DEFAULT_ADMIN_ROLE = 0x00;

    /**
     * @dev Modifier that checks that an account has a specific role. Reverts
     * with a standardized message including the required role.
     *
     * The format of the revert reason is given by the following regular expression:
     *
     *  /^AccessControl: account (0x[0-9a-f]{40}) is missing role (0x[0-9a-f]{64})$/
     *
     * _Available since v4.1._
     */
    modifier onlyRole(bytes32 role) {
        _checkRole(role);
        _;
    }

    /**
     * @dev See {IERC165-supportsInterface}.
     */
    function supportsInterface(bytes4 interfaceId) public view virtual override returns (bool) {
        return interfaceId == type(IAccessControl).interfaceId || super.supportsInterface(interfaceId);
    }

    /**
     * @dev Returns `true` if `account` has been granted `role`.
     */
    function hasRole(bytes32 role, address account) public view virtual override returns (bool) {
        return _roles[role].members[account];
    }

    /**
     * @dev Revert with a standard message if `_msgSender()` is missing `role`.
     * Overriding this function changes the behavior of the {onlyRole} modifier.
     *
     * Format of the revert message is described in {_checkRole}.
     *
     * _Available since v4.6._
     */
    function _checkRole(bytes32 role) internal view virtual {
        _checkRole(role, _msgSender());
    }

    /**
     * @dev Revert with a standard message if `account` is missing `role`.
     *
     * The format of the revert reason is given by the following regular expression:
     *
     *  /^AccessControl: account (0x[0-9a-f]{40}) is missing role (0x[0-9a-f]{64})$/
     */
    function _checkRole(bytes32 role, address account) internal view virtual {
        if (!hasRole(role, account)) {
            revert(
                string(
                    abi.encodePacked(
                        "AccessControl: account ",
                        Strings.toHexString(account),
                        " is missing role ",
                        Strings.toHexString(uint256(role), 32)
                    )
                )
            );
        }
    }

    /**
     * @dev Returns the admin role that controls `role`. See {grantRole} and
     * {revokeRole}.
     *
     * To change a role's admin, use {_setRoleAdmin}.
     */
    function getRoleAdmin(bytes32 role) public view virtual override returns (bytes32) {
        return _roles[role].adminRole;
    }

    /**
     * @dev Grants `role` to `account`.
     *
     * If `account` had not been already granted `role`, emits a {RoleGranted}
     * event.
     *
     * Requirements:
     *
     * - the caller must have ``role``'s admin role.
     *
     * May emit a {RoleGranted} event.
     */
    function grantRole(bytes32 role, address account) public virtual override onlyRole(getRoleAdmin(role)) {
        _grantRole(role, account);
    }

    /**
     * @dev Revokes `role` from `account`.
     *
     * If `account` had been granted `role`, emits a {RoleRevoked} event.
     *
     * Requirements:
     *
     * - the caller must have ``role``'s admin role.
     *
     * May emit a {RoleRevoked} event.
     */
    function revokeRole(bytes32 role, address account) public virtual override onlyRole(getRoleAdmin(role)) {
        _revokeRole(role, account);
    }

    /**
     * @dev Revokes `role` from the calling account.
     *
     * Roles are often managed via {grantRole} and {revokeRole}: this function's
     * purpose is to provide a mechanism for accounts to lose their privileges
     * if they are compromised (such as when a trusted device is misplaced).
     *
     * If the calling account had been revoked `role`, emits a {RoleRevoked}
     * event.
     *
     * Requirements:
     *
     * - the caller must be `account`.
     *
     * May emit a {RoleRevoked} event.
     */
    function renounceRole(bytes32 role, address account) public virtual override {
        require(account == _msgSender(), "AccessControl: can only renounce roles for self");

        _revokeRole(role, account);
    }

    /**
     * @dev Grants `role` to `account`.
     *
     * If `account` had not been already granted `role`, emits a {RoleGranted}
     * event. Note that unlike {grantRole}, this function doesn't perform any
     * checks on the calling account.
     *
     * May emit a {RoleGranted} event.
     *
     * [WARNING]
     * ====
     * This function should only be called from the constructor when setting
     * up the initial roles for the system.
     *
     * Using this function in any other way is effectively circumventing the admin
     * system imposed by {AccessControl}.
     * ====
     *
     * NOTE: This function is deprecated in favor of {_grantRole}.
     */
    function _setupRole(bytes32 role, address account) internal virtual {
        _grantRole(role, account);
    }

    /**
     * @dev Sets `adminRole` as ``role``'s admin role.
     *
     * Emits a {RoleAdminChanged} event.
     */
    function _setRoleAdmin(bytes32 role, bytes32 adminRole) internal virtual {
        bytes32 previousAdminRole = getRoleAdmin(role);
        _roles[role].adminRole = adminRole;
        emit RoleAdminChanged(role, previousAdminRole, adminRole);
    }

    /**
     * @dev Grants `role` to `account`.
     *
     * Internal function without access restriction.
     *
     * May emit a {RoleGranted} event.
     */
    function _grantRole(bytes32 role, address account) internal virtual {
        if (!hasRole(role, account)) {
            _roles[role].members[account] = true;
            emit RoleGranted(role, account, _msgSender());
        }
    }

    /**
     * @dev Revokes `role` from `account`.
     *
     * Internal function without access restriction.
     *
     * May emit a {RoleRevoked} event.
     */
    function _revokeRole(bytes32 role, address account) internal virtual {
        if (hasRole(role, account)) {
            _roles[role].members[account] = false;
            emit RoleRevoked(role, account, _msgSender());
        }
    }
}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v4.5.0) (access/AccessControlEnumerable.sol)

pragma solidity ^0.8.0;

import "./IAccessControlEnumerable.sol";
import "./AccessControl.sol";
import "../utils/structs/EnumerableSet.sol";

/**
 * @dev Extension of {AccessControl} that allows enumerating the members of each role.
 */
abstract contract AccessControlEnumerable is IAccessControlEnumerable, AccessControl {
    using EnumerableSet for EnumerableSet.AddressSet;

    mapping(bytes32 => EnumerableSet.AddressSet) private _roleMembers;

    /**
     * @dev See {IERC165-supportsInterface}.
     */
    function supportsInterface(bytes4 interfaceId) public view virtual override returns (bool) {
        return interfaceId == type(IAccessControlEnumerable).interfaceId || super.supportsInterface(interfaceId);
    }

    /**
     * @dev Returns one of the accounts that have `role`. `index` must be a
     * value between 0 and {getRoleMemberCount}, non-inclusive.
     *
     * Role bearers are not sorted in any particular way, and their ordering may
     * change at any point.
     *
     * WARNING: When using {getRoleMember} and {getRoleMemberCount}, make sure
     * you perform all queries on the same block. See the following
     * https://forum.openzeppelin.com/t/iterating-over-elements-on-enumerableset-in-openzeppelin-contracts/2296[forum post]
     * for more information.
     */
    function getRoleMember(bytes32 role, uint256 index) public view virtual override returns (address) {
        return _roleMembers[role].at(index);
    }

    /**
     * @dev Returns the number of accounts that have `role`. Can be used
     * together with {getRoleMember} to enumerate all bearers of a role.
     */
    function getRoleMemberCount(bytes32 role) public view virtual override returns (uint256) {
        return _roleMembers[role].length();
    }

    /**
     * @dev Overload {_grantRole} to track enumerable memberships
     */
    function _grantRole(bytes32 role, address account) internal virtual override {
        super._grantRole(role, account);
        _roleMembers[role].add(account);
    }

    /**
     * @dev Overload {_revokeRole} to track enumerable memberships
     */
    function _revokeRole(bytes32 role, address account) internal virtual override {
        super._revokeRole(role, account);
        _roleMembers[role].remove(account);
    }
}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts v4.4.1 (access/IAccessControl.sol)

pragma solidity ^0.8.0;

/**
 * @dev External interface of AccessControl declared to support ERC165 detection.
 */
interface IAccessControl {
    /**
     * @dev Emitted when `newAdminRole` is set as ``role``'s admin role, replacing `previousAdminRole`
     *
     * `DEFAULT_ADMIN_ROLE` is the starting admin for all roles, despite
     * {RoleAdminChanged} not being emitted signaling this.
     *
     * _Available since v3.1._
     */
    event RoleAdminChanged(bytes32 indexed role, bytes32 indexed previousAdminRole, bytes32 indexed newAdminRole);

    /**
     * @dev Emitted when `account` is granted `role`.
     *
     * `sender` is the account that originated the contract call, an admin role
     * bearer except when using {AccessControl-_setupRole}.
     */
    event RoleGranted(bytes32 indexed role, address indexed account, address indexed sender);

    /**
     * @dev Emitted when `account` is revoked `role`.
     *
     * `sender` is the account that originated the contract call:
     *   - if using `revokeRole`, it is the admin role bearer
     *   - if using `renounceRole`, it is the role bearer (i.e. `account`)
     */
    event RoleRevoked(bytes32 indexed role, address indexed account, address indexed sender);

    /**
     * @dev Returns `true` if `account` has been granted `role`.
     */
    function hasRole(bytes32 role, address account) external view returns (bool);

    /**
     * @dev Returns the admin role that controls `role`. See {grantRole} and
     * {revokeRole}.
     *
     * To change a role's admin, use {AccessControl-_setRoleAdmin}.
     */
    function getRoleAdmin(bytes32 role) external view returns (bytes32);

    /**
     * @dev Grants `role` to `account`.
     *
     * If `account` had not been already granted `role`, emits a {RoleGranted}
     * event.
     *
     * Requirements:
     *
     * - the caller must have ``role``'s admin role.
     */
    function grantRole(bytes32 role, address account) external;

    /**
     * @dev Revokes `role` from `account`.
     *
     * If `account` had been granted `role`, emits a {RoleRevoked} event.
     *
     * Requirements:
     *
     * - the caller must have ``role``'s admin role.
     */
    function revokeRole(bytes32 role, address account) external;

    /**
     * @dev Revokes `role` from the calling account.
     *
     * Roles are often managed via {grantRole} and {revokeRole}: this function's
     * purpose is to provide a mechanism for accounts to lose their privileges
     * if they are compromised (such as when a trusted device is misplaced).
     *
     * If the calling account had been granted `role`, emits a {RoleRevoked}
     * event.
     *
     * Requirements:
     *
     * - the caller must be `account`.
     */
    function renounceRole(bytes32 role, address account) external;
}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts v4.4.1 (access/IAccessControlEnumerable.sol)

pragma solidity ^0.8.0;

import "./IAccessControl.sol";

/**
 * @dev External interface of AccessControlEnumerable declared to support ERC165 detection.
 */
interface IAccessControlEnumerable is IAccessControl {
    /**
     * @dev Returns one of the accounts that have `role`. `index` must be a
     * value between 0 and {getRoleMemberCount}, non-inclusive.
     *
     * Role bearers are not sorted in any particular way, and their ordering may
     * change at any point.
     *
     * WARNING: When using {getRoleMember} and {getRoleMemberCount}, make sure
     * you perform all queries on the same block. See the following
     * https://forum.openzeppelin.com/t/iterating-over-elements-on-enumerableset-in-openzeppelin-contracts/2296[forum post]
     * for more information.
     */
    function getRoleMember(bytes32 role, uint256 index) external view returns (address);

    /**
     * @dev Returns the number of accounts that have `role`. Can be used
     * together with {getRoleMember} to enumerate all bearers of a role.
     */
    function getRoleMemberCount(bytes32 role) external view returns (uint256);
}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v4.9.4) (utils/Context.sol)

pragma solidity ^0.8.0;

/**
 * @dev Provides information about the current execution context, including the
 * sender of the transaction and its data. While these are generally available
 * via msg.sender and msg.data, they should not be accessed in such a direct
 * manner, since when dealing with meta-transactions the account sending and
 * paying for execution may not be the actual sender (as far as an application
 * is concerned).
 *
 * This contract is only required for intermediate, library-like contracts.
 */
abstract contract Context {
    function _msgSender() internal view virtual returns (address) {
        return msg.sender;
    }

    function _msgData() internal view virtual returns (bytes calldata) {
        return msg.data;
    }

    function _contextSuffixLength() internal view virtual returns (uint256) {
        return 0;
    }
}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts v4.4.1 (utils/introspection/ERC165.sol)

pragma solidity ^0.8.0;

import "./IERC165.sol";

/**
 * @dev Implementation of the {IERC165} interface.
 *
 * Contracts that want to implement ERC165 should inherit from this contract and override {supportsInterface} to check
 * for the additional interface id that will be supported. For example:
 *
 * ```solidity
 * function supportsInterface(bytes4 interfaceId) public view virtual override returns (bool) {
 *     return interfaceId == type(MyInterface).interfaceId || super.supportsInterface(interfaceId);
 * }
 * ```
 *
 * Alternatively, {ERC165Storage} provides an easier to use but more expensive implementation.
 */
abstract contract ERC165 is IERC165 {
    /**
     * @dev See {IERC165-supportsInterface}.
     */
    function supportsInterface(bytes4 interfaceId) public view virtual override returns (bool) {
        return interfaceId == type(IERC165).interfaceId;
    }
}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts v4.4.1 (utils/introspection/IERC165.sol)

pragma solidity ^0.8.0;

/**
 * @dev Interface of the ERC165 standard, as defined in the
 * https://eips.ethereum.org/EIPS/eip-165[EIP].
 *
 * Implementers can declare support of contract interfaces, which can then be
 * queried by others ({ERC165Checker}).
 *
 * For an implementation, see {ERC165}.
 */
interface IERC165 {
    /**
     * @dev Returns true if this contract implements the interface defined by
     * `interfaceId`. See the corresponding
     * https://eips.ethereum.org/EIPS/eip-165#how-interfaces-are-identified[EIP section]
     * to learn more about how these ids are created.
     *
     * This function call must use less than 30 000 gas.
     */
    function supportsInterface(bytes4 interfaceId) external view returns (bool);
}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v4.9.0) (utils/math/Math.sol)

pragma solidity ^0.8.0;

/**
 * @dev Standard math utilities missing in the Solidity language.
 */
library Math {
    enum Rounding {
        Down, // Toward negative infinity
        Up, // Toward infinity
        Zero // Toward zero
    }

    /**
     * @dev Returns the largest of two numbers.
     */
    function max(uint256 a, uint256 b) internal pure returns (uint256) {
        return a > b ? a : b;
    }

    /**
     * @dev Returns the smallest of two numbers.
     */
    function min(uint256 a, uint256 b) internal pure returns (uint256) {
        return a < b ? a : b;
    }

    /**
     * @dev Returns the average of two numbers. The result is rounded towards
     * zero.
     */
    function average(uint256 a, uint256 b) internal pure returns (uint256) {
        // (a + b) / 2 can overflow.
        return (a & b) + (a ^ b) / 2;
    }

    /**
     * @dev Returns the ceiling of the division of two numbers.
     *
     * This differs from standard division with `/` in that it rounds up instead
     * of rounding down.
     */
    function ceilDiv(uint256 a, uint256 b) internal pure returns (uint256) {
        // (a + b - 1) / b can overflow on addition, so we distribute.
        return a == 0 ? 0 : (a - 1) / b + 1;
    }

    /**
     * @notice Calculates floor(x * y / denominator) with full precision. Throws if result overflows a uint256 or denominator == 0
     * @dev Original credit to Remco Bloemen under MIT license (https://xn--2-umb.com/21/muldiv)
     * with further edits by Uniswap Labs also under MIT license.
     */
    function mulDiv(uint256 x, uint256 y, uint256 denominator) internal pure returns (uint256 result) {
        unchecked {
            // 512-bit multiply [prod1 prod0] = x * y. Compute the product mod 2^256 and mod 2^256 - 1, then use
            // use the Chinese Remainder Theorem to reconstruct the 512 bit result. The result is stored in two 256
            // variables such that product = prod1 * 2^256 + prod0.
            uint256 prod0; // Least significant 256 bits of the product
            uint256 prod1; // Most significant 256 bits of the product
            assembly {
                let mm := mulmod(x, y, not(0))
                prod0 := mul(x, y)
                prod1 := sub(sub(mm, prod0), lt(mm, prod0))
            }

            // Handle non-overflow cases, 256 by 256 division.
            if (prod1 == 0) {
                // Solidity will revert if denominator == 0, unlike the div opcode on its own.
                // The surrounding unchecked block does not change this fact.
                // See https://docs.soliditylang.org/en/latest/control-structures.html#checked-or-unchecked-arithmetic.
                return prod0 / denominator;
            }

            // Make sure the result is less than 2^256. Also prevents denominator == 0.
            require(denominator > prod1, "Math: mulDiv overflow");

            ///////////////////////////////////////////////
            // 512 by 256 division.
            ///////////////////////////////////////////////

            // Make division exact by subtracting the remainder from [prod1 prod0].
            uint256 remainder;
            assembly {
                // Compute remainder using mulmod.
                remainder := mulmod(x, y, denominator)

                // Subtract 256 bit number from 512 bit number.
                prod1 := sub(prod1, gt(remainder, prod0))
                prod0 := sub(prod0, remainder)
            }

            // Factor powers of two out of denominator and compute largest power of two divisor of denominator. Always >= 1.
            // See https://cs.stackexchange.com/q/138556/92363.

            // Does not overflow because the denominator cannot be zero at this stage in the function.
            uint256 twos = denominator & (~denominator + 1);
            assembly {
                // Divide denominator by twos.
                denominator := div(denominator, twos)

                // Divide [prod1 prod0] by twos.
                prod0 := div(prod0, twos)

                // Flip twos such that it is 2^256 / twos. If twos is zero, then it becomes one.
                twos := add(div(sub(0, twos), twos), 1)
            }

            // Shift in bits from prod1 into prod0.
            prod0 |= prod1 * twos;

            // Invert denominator mod 2^256. Now that denominator is an odd number, it has an inverse modulo 2^256 such
            // that denominator * inv = 1 mod 2^256. Compute the inverse by starting with a seed that is correct for
            // four bits. That is, denominator * inv = 1 mod 2^4.
            uint256 inverse = (3 * denominator) ^ 2;

            // Use the Newton-Raphson iteration to improve the precision. Thanks to Hensel's lifting lemma, this also works
            // in modular arithmetic, doubling the correct bits in each step.
            inverse *= 2 - denominator * inverse; // inverse mod 2^8
            inverse *= 2 - denominator * inverse; // inverse mod 2^16
            inverse *= 2 - denominator * inverse; // inverse mod 2^32
            inverse *= 2 - denominator * inverse; // inverse mod 2^64
            inverse *= 2 - denominator * inverse; // inverse mod 2^128
            inverse *= 2 - denominator * inverse; // inverse mod 2^256

            // Because the division is now exact we can divide by multiplying with the modular inverse of denominator.
            // This will give us the correct result modulo 2^256. Since the preconditions guarantee that the outcome is
            // less than 2^256, this is the final result. We don't need to compute the high bits of the result and prod1
            // is no longer required.
            result = prod0 * inverse;
            return result;
        }
    }

    /**
     * @notice Calculates x * y / denominator with full precision, following the selected rounding direction.
     */
    function mulDiv(uint256 x, uint256 y, uint256 denominator, Rounding rounding) internal pure returns (uint256) {
        uint256 result = mulDiv(x, y, denominator);
        if (rounding == Rounding.Up && mulmod(x, y, denominator) > 0) {
            result += 1;
        }
        return result;
    }

    /**
     * @dev Returns the square root of a number. If the number is not a perfect square, the value is rounded down.
     *
     * Inspired by Henry S. Warren, Jr.'s "Hacker's Delight" (Chapter 11).
     */
    function sqrt(uint256 a) internal pure returns (uint256) {
        if (a == 0) {
            return 0;
        }

        // For our first guess, we get the biggest power of 2 which is smaller than the square root of the target.
        //
        // We know that the "msb" (most significant bit) of our target number `a` is a power of 2 such that we have
        // `msb(a) <= a < 2*msb(a)`. This value can be written `msb(a)=2**k` with `k=log2(a)`.
        //
        // This can be rewritten `2**log2(a) <= a < 2**(log2(a) + 1)`
        // → `sqrt(2**k) <= sqrt(a) < sqrt(2**(k+1))`
        // → `2**(k/2) <= sqrt(a) < 2**((k+1)/2) <= 2**(k/2 + 1)`
        //
        // Consequently, `2**(log2(a) / 2)` is a good first approximation of `sqrt(a)` with at least 1 correct bit.
        uint256 result = 1 << (log2(a) >> 1);

        // At this point `result` is an estimation with one bit of precision. We know the true value is a uint128,
        // since it is the square root of a uint256. Newton's method converges quadratically (precision doubles at
        // every iteration). We thus need at most 7 iteration to turn our partial result with one bit of precision
        // into the expected uint128 result.
        unchecked {
            result = (result + a / result) >> 1;
            result = (result + a / result) >> 1;
            result = (result + a / result) >> 1;
            result = (result + a / result) >> 1;
            result = (result + a / result) >> 1;
            result = (result + a / result) >> 1;
            result = (result + a / result) >> 1;
            return min(result, a / result);
        }
    }

    /**
     * @notice Calculates sqrt(a), following the selected rounding direction.
     */
    function sqrt(uint256 a, Rounding rounding) internal pure returns (uint256) {
        unchecked {
            uint256 result = sqrt(a);
            return result + (rounding == Rounding.Up && result * result < a ? 1 : 0);
        }
    }

    /**
     * @dev Return the log in base 2, rounded down, of a positive value.
     * Returns 0 if given 0.
     */
    function log2(uint256 value) internal pure returns (uint256) {
        uint256 result = 0;
        unchecked {
            if (value >> 128 > 0) {
                value >>= 128;
                result += 128;
            }
            if (value >> 64 > 0) {
                value >>= 64;
                result += 64;
            }
            if (value >> 32 > 0) {
                value >>= 32;
                result += 32;
            }
            if (value >> 16 > 0) {
                value >>= 16;
                result += 16;
            }
            if (value >> 8 > 0) {
                value >>= 8;
                result += 8;
            }
            if (value >> 4 > 0) {
                value >>= 4;
                result += 4;
            }
            if (value >> 2 > 0) {
                value >>= 2;
                result += 2;
            }
            if (value >> 1 > 0) {
                result += 1;
            }
        }
        return result;
    }

    /**
     * @dev Return the log in base 2, following the selected rounding direction, of a positive value.
     * Returns 0 if given 0.
     */
    function log2(uint256 value, Rounding rounding) internal pure returns (uint256) {
        unchecked {
            uint256 result = log2(value);
            return result + (rounding == Rounding.Up && 1 << result < value ? 1 : 0);
        }
    }

    /**
     * @dev Return the log in base 10, rounded down, of a positive value.
     * Returns 0 if given 0.
     */
    function log10(uint256 value) internal pure returns (uint256) {
        uint256 result = 0;
        unchecked {
            if (value >= 10 ** 64) {
                value /= 10 ** 64;
                result += 64;
            }
            if (value >= 10 ** 32) {
                value /= 10 ** 32;
                result += 32;
            }
            if (value >= 10 ** 16) {
                value /= 10 ** 16;
                result += 16;
            }
            if (value >= 10 ** 8) {
                value /= 10 ** 8;
                result += 8;
            }
            if (value >= 10 ** 4) {
                value /= 10 ** 4;
                result += 4;
            }
            if (value >= 10 ** 2) {
                value /= 10 ** 2;
                result += 2;
            }
            if (value >= 10 ** 1) {
                result += 1;
            }
        }
        return result;
    }

    /**
     * @dev Return the log in base 10, following the selected rounding direction, of a positive value.
     * Returns 0 if given 0.
     */
    function log10(uint256 value, Rounding rounding) internal pure returns (uint256) {
        unchecked {
            uint256 result = log10(value);
            return result + (rounding == Rounding.Up && 10 ** result < value ? 1 : 0);
        }
    }

    /**
     * @dev Return the log in base 256, rounded down, of a positive value.
     * Returns 0 if given 0.
     *
     * Adding one to the result gives the number of pairs of hex symbols needed to represent `value` as a hex string.
     */
    function log256(uint256 value) internal pure returns (uint256) {
        uint256 result = 0;
        unchecked {
            if (value >> 128 > 0) {
                value >>= 128;
                result += 16;
            }
            if (value >> 64 > 0) {
                value >>= 64;
                result += 8;
            }
            if (value >> 32 > 0) {
                value >>= 32;
                result += 4;
            }
            if (value >> 16 > 0) {
                value >>= 16;
                result += 2;
            }
            if (value >> 8 > 0) {
                result += 1;
            }
        }
        return result;
    }

    /**
     * @dev Return the log in base 256, following the selected rounding direction, of a positive value.
     * Returns 0 if given 0.
     */
    function log256(uint256 value, Rounding rounding) internal pure returns (uint256) {
        unchecked {
            uint256 result = log256(value);
            return result + (rounding == Rounding.Up && 1 << (result << 3) < value ? 1 : 0);
        }
    }
}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v4.8.0) (utils/math/SignedMath.sol)

pragma solidity ^0.8.0;

/**
 * @dev Standard signed math utilities missing in the Solidity language.
 */
library SignedMath {
    /**
     * @dev Returns the largest of two signed numbers.
     */
    function max(int256 a, int256 b) internal pure returns (int256) {
        return a > b ? a : b;
    }

    /**
     * @dev Returns the smallest of two signed numbers.
     */
    function min(int256 a, int256 b) internal pure returns (int256) {
        return a < b ? a : b;
    }

    /**
     * @dev Returns the average of two signed numbers without overflow.
     * The result is rounded towards zero.
     */
    function average(int256 a, int256 b) internal pure returns (int256) {
        // Formula from the book "Hacker's Delight"
        int256 x = (a & b) + ((a ^ b) >> 1);
        return x + (int256(uint256(x) >> 255) & (a ^ b));
    }

    /**
     * @dev Returns the absolute unsigned value of a signed value.
     */
    function abs(int256 n) internal pure returns (uint256) {
        unchecked {
            // must be unchecked in order to support `n = type(int256).min`
            return uint256(n >= 0 ? n : -n);
        }
    }
}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v4.9.0) (utils/Strings.sol)

pragma solidity ^0.8.0;

import "./math/Math.sol";
import "./math/SignedMath.sol";

/**
 * @dev String operations.
 */
library Strings {
    bytes16 private constant _SYMBOLS = "0123456789abcdef";
    uint8 private constant _ADDRESS_LENGTH = 20;

    /**
     * @dev Converts a `uint256` to its ASCII `string` decimal representation.
     */
    function toString(uint256 value) internal pure returns (string memory) {
        unchecked {
            uint256 length = Math.log10(value) + 1;
            string memory buffer = new string(length);
            uint256 ptr;
            /// @solidity memory-safe-assembly
            assembly {
                ptr := add(buffer, add(32, length))
            }
            while (true) {
                ptr--;
                /// @solidity memory-safe-assembly
                assembly {
                    mstore8(ptr, byte(mod(value, 10), _SYMBOLS))
                }
                value /= 10;
                if (value == 0) break;
            }
            return buffer;
        }
    }

    /**
     * @dev Converts a `int256` to its ASCII `string` decimal representation.
     */
    function toString(int256 value) internal pure returns (string memory) {
        return string(abi.encodePacked(value < 0 ? "-" : "", toString(SignedMath.abs(value))));
    }

    /**
     * @dev Converts a `uint256` to its ASCII `string` hexadecimal representation.
     */
    function toHexString(uint256 value) internal pure returns (string memory) {
        unchecked {
            return toHexString(value, Math.log256(value) + 1);
        }
    }

    /**
     * @dev Converts a `uint256` to its ASCII `string` hexadecimal representation with fixed length.
     */
    function toHexString(uint256 value, uint256 length) internal pure returns (string memory) {
        bytes memory buffer = new bytes(2 * length + 2);
        buffer[0] = "0";
        buffer[1] = "x";
        for (uint256 i = 2 * length + 1; i > 1; --i) {
            buffer[i] = _SYMBOLS[value & 0xf];
            value >>= 4;
        }
        require(value == 0, "Strings: hex length insufficient");
        return string(buffer);
    }

    /**
     * @dev Converts an `address` with fixed length of 20 bytes to its not checksummed ASCII `string` hexadecimal representation.
     */
    function toHexString(address addr) internal pure returns (string memory) {
        return toHexString(uint256(uint160(addr)), _ADDRESS_LENGTH);
    }

    /**
     * @dev Returns true if the two strings are equal.
     */
    function equal(string memory a, string memory b) internal pure returns (bool) {
        return keccak256(bytes(a)) == keccak256(bytes(b));
    }
}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v4.9.0) (utils/structs/EnumerableSet.sol)
// This file was procedurally generated from scripts/generate/templates/EnumerableSet.js.

pragma solidity ^0.8.0;

/**
 * @dev Library for managing
 * https://en.wikipedia.org/wiki/Set_(abstract_data_type)[sets] of primitive
 * types.
 *
 * Sets have the following properties:
 *
 * - Elements are added, removed, and checked for existence in constant time
 * (O(1)).
 * - Elements are enumerated in O(n). No guarantees are made on the ordering.
 *
 * ```solidity
 * contract Example {
 *     // Add the library methods
 *     using EnumerableSet for EnumerableSet.AddressSet;
 *
 *     // Declare a set state variable
 *     EnumerableSet.AddressSet private mySet;
 * }
 * ```
 *
 * As of v3.3.0, sets of type `bytes32` (`Bytes32Set`), `address` (`AddressSet`)
 * and `uint256` (`UintSet`) are supported.
 *
 * [WARNING]
 * ====
 * Trying to delete such a structure from storage will likely result in data corruption, rendering the structure
 * unusable.
 * See https://github.com/ethereum/solidity/pull/11843[ethereum/solidity#11843] for more info.
 *
 * In order to clean an EnumerableSet, you can either remove all elements one by one or create a fresh instance using an
 * array of EnumerableSet.
 * ====
 */
library EnumerableSet {
    // To implement this library for multiple types with as little code
    // repetition as possible, we write it in terms of a generic Set type with
    // bytes32 values.
    // The Set implementation uses private functions, and user-facing
    // implementations (such as AddressSet) are just wrappers around the
    // underlying Set.
    // This means that we can only create new EnumerableSets for types that fit
    // in bytes32.

    struct Set {
        // Storage of set values
        bytes32[] _values;
        // Position of the value in the `values` array, plus 1 because index 0
        // means a value is not in the set.
        mapping(bytes32 => uint256) _indexes;
    }

    /**
     * @dev Add a value to a set. O(1).
     *
     * Returns true if the value was added to the set, that is if it was not
     * already present.
     */
    function _add(Set storage set, bytes32 value) private returns (bool) {
        if (!_contains(set, value)) {
            set._values.push(value);
            // The value is stored at length-1, but we add 1 to all indexes
            // and use 0 as a sentinel value
            set._indexes[value] = set._values.length;
            return true;
        } else {
            return false;
        }
    }

    /**
     * @dev Removes a value from a set. O(1).
     *
     * Returns true if the value was removed from the set, that is if it was
     * present.
     */
    function _remove(Set storage set, bytes32 value) private returns (bool) {
        // We read and store the value's index to prevent multiple reads from the same storage slot
        uint256 valueIndex = set._indexes[value];

        if (valueIndex != 0) {
            // Equivalent to contains(set, value)
            // To delete an element from the _values array in O(1), we swap the element to delete with the last one in
            // the array, and then remove the last element (sometimes called as 'swap and pop').
            // This modifies the order of the array, as noted in {at}.

            uint256 toDeleteIndex = valueIndex - 1;
            uint256 lastIndex = set._values.length - 1;

            if (lastIndex != toDeleteIndex) {
                bytes32 lastValue = set._values[lastIndex];

                // Move the last value to the index where the value to delete is
                set._values[toDeleteIndex] = lastValue;
                // Update the index for the moved value
                set._indexes[lastValue] = valueIndex; // Replace lastValue's index to valueIndex
            }

            // Delete the slot where the moved value was stored
            set._values.pop();

            // Delete the index for the deleted slot
            delete set._indexes[value];

            return true;
        } else {
            return false;
        }
    }

    /**
     * @dev Returns true if the value is in the set. O(1).
     */
    function _contains(Set storage set, bytes32 value) private view returns (bool) {
        return set._indexes[value] != 0;
    }

    /**
     * @dev Returns the number of values on the set. O(1).
     */
    function _length(Set storage set) private view returns (uint256) {
        return set._values.length;
    }

    /**
     * @dev Returns the value stored at position `index` in the set. O(1).
     *
     * Note that there are no guarantees on the ordering of values inside the
     * array, and it may change when more values are added or removed.
     *
     * Requirements:
     *
     * - `index` must be strictly less than {length}.
     */
    function _at(Set storage set, uint256 index) private view returns (bytes32) {
        return set._values[index];
    }

    /**
     * @dev Return the entire set in an array
     *
     * WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed
     * to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that
     * this function has an unbounded cost, and using it as part of a state-changing function may render the function
     * uncallable if the set grows to a point where copying to memory consumes too much gas to fit in a block.
     */
    function _values(Set storage set) private view returns (bytes32[] memory) {
        return set._values;
    }

    // Bytes32Set

    struct Bytes32Set {
        Set _inner;
    }

    /**
     * @dev Add a value to a set. O(1).
     *
     * Returns true if the value was added to the set, that is if it was not
     * already present.
     */
    function add(Bytes32Set storage set, bytes32 value) internal returns (bool) {
        return _add(set._inner, value);
    }

    /**
     * @dev Removes a value from a set. O(1).
     *
     * Returns true if the value was removed from the set, that is if it was
     * present.
     */
    function remove(Bytes32Set storage set, bytes32 value) internal returns (bool) {
        return _remove(set._inner, value);
    }

    /**
     * @dev Returns true if the value is in the set. O(1).
     */
    function contains(Bytes32Set storage set, bytes32 value) internal view returns (bool) {
        return _contains(set._inner, value);
    }

    /**
     * @dev Returns the number of values in the set. O(1).
     */
    function length(Bytes32Set storage set) internal view returns (uint256) {
        return _length(set._inner);
    }

    /**
     * @dev Returns the value stored at position `index` in the set. O(1).
     *
     * Note that there are no guarantees on the ordering of values inside the
     * array, and it may change when more values are added or removed.
     *
     * Requirements:
     *
     * - `index` must be strictly less than {length}.
     */
    function at(Bytes32Set storage set, uint256 index) internal view returns (bytes32) {
        return _at(set._inner, index);
    }

    /**
     * @dev Return the entire set in an array
     *
     * WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed
     * to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that
     * this function has an unbounded cost, and using it as part of a state-changing function may render the function
     * uncallable if the set grows to a point where copying to memory consumes too much gas to fit in a block.
     */
    function values(Bytes32Set storage set) internal view returns (bytes32[] memory) {
        bytes32[] memory store = _values(set._inner);
        bytes32[] memory result;

        /// @solidity memory-safe-assembly
        assembly {
            result := store
        }

        return result;
    }

    // AddressSet

    struct AddressSet {
        Set _inner;
    }

    /**
     * @dev Add a value to a set. O(1).
     *
     * Returns true if the value was added to the set, that is if it was not
     * already present.
     */
    function add(AddressSet storage set, address value) internal returns (bool) {
        return _add(set._inner, bytes32(uint256(uint160(value))));
    }

    /**
     * @dev Removes a value from a set. O(1).
     *
     * Returns true if the value was removed from the set, that is if it was
     * present.
     */
    function remove(AddressSet storage set, address value) internal returns (bool) {
        return _remove(set._inner, bytes32(uint256(uint160(value))));
    }

    /**
     * @dev Returns true if the value is in the set. O(1).
     */
    function contains(AddressSet storage set, address value) internal view returns (bool) {
        return _contains(set._inner, bytes32(uint256(uint160(value))));
    }

    /**
     * @dev Returns the number of values in the set. O(1).
     */
    function length(AddressSet storage set) internal view returns (uint256) {
        return _length(set._inner);
    }

    /**
     * @dev Returns the value stored at position `index` in the set. O(1).
     *
     * Note that there are no guarantees on the ordering of values inside the
     * array, and it may change when more values are added or removed.
     *
     * Requirements:
     *
     * - `index` must be strictly less than {length}.
     */
    function at(AddressSet storage set, uint256 index) internal view returns (address) {
        return address(uint160(uint256(_at(set._inner, index))));
    }

    /**
     * @dev Return the entire set in an array
     *
     * WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed
     * to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that
     * this function has an unbounded cost, and using it as part of a state-changing function may render the function
     * uncallable if the set grows to a point where copying to memory consumes too much gas to fit in a block.
     */
    function values(AddressSet storage set) internal view returns (address[] memory) {
        bytes32[] memory store = _values(set._inner);
        address[] memory result;

        /// @solidity memory-safe-assembly
        assembly {
            result := store
        }

        return result;
    }

    // UintSet

    struct UintSet {
        Set _inner;
    }

    /**
     * @dev Add a value to a set. O(1).
     *
     * Returns true if the value was added to the set, that is if it was not
     * already present.
     */
    function add(UintSet storage set, uint256 value) internal returns (bool) {
        return _add(set._inner, bytes32(value));
    }

    /**
     * @dev Removes a value from a set. O(1).
     *
     * Returns true if the value was removed from the set, that is if it was
     * present.
     */
    function remove(UintSet storage set, uint256 value) internal returns (bool) {
        return _remove(set._inner, bytes32(value));
    }

    /**
     * @dev Returns true if the value is in the set. O(1).
     */
    function contains(UintSet storage set, uint256 value) internal view returns (bool) {
        return _contains(set._inner, bytes32(value));
    }

    /**
     * @dev Returns the number of values in the set. O(1).
     */
    function length(UintSet storage set) internal view returns (uint256) {
        return _length(set._inner);
    }

    /**
     * @dev Returns the value stored at position `index` in the set. O(1).
     *
     * Note that there are no guarantees on the ordering of values inside the
     * array, and it may change when more values are added or removed.
     *
     * Requirements:
     *
     * - `index` must be strictly less than {length}.
     */
    function at(UintSet storage set, uint256 index) internal view returns (uint256) {
        return uint256(_at(set._inner, index));
    }

    /**
     * @dev Return the entire set in an array
     *
     * WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed
     * to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that
     * this function has an unbounded cost, and using it as part of a state-changing function may render the function
     * uncallable if the set grows to a point where copying to memory consumes too much gas to fit in a block.
     */
    function values(UintSet storage set) internal view returns (uint256[] memory) {
        bytes32[] memory store = _values(set._inner);
        uint256[] memory result;

        /// @solidity memory-safe-assembly
        assembly {
            result := store
        }

        return result;
    }
}

// SPDX-License-Identifier: UNLICENSED
// Copyright (c) Eywa.Fi, 2021-2025 - all rights reserved
pragma solidity ^0.8.20;

interface IChainIdAdapter {

    function chainIdToDstEid(uint64 chainId) external view returns(uint32);
    function dstEidToChainId(uint32 dstEid) external view returns(uint64);
    function chainIdToChainName(uint64 chainId) external view returns(string memory);
    function chainNameToChainId(string memory chainName) external view returns(uint64);

}

{
  "evmVersion": "shanghai",
  "optimizer": {
    "enabled": true,
    "runs": 200
  },
  "outputSelection": {
    "*": {
      "*": [
        "evm.bytecode",
        "evm.deployedBytecode",
        "devdoc",
        "userdoc",
        "metadata",
        "abi"
      ]
    }
  },
  "remappings": [
    "project/:@openzeppelin/contracts/=npm/@openzeppelin/[email protected]/"
  ]
}

• No Contract Security Audit Submitted- Submit Audit Here

[{"inputs":[],"stateMutability":"nonpayable","type":"constructor"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"string","name":"chainName","type":"string"},{"indexed":false,"internalType":"uint64","name":"chainId","type":"uint64"}],"name":"ChainNameSet","type":"event"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"uint32","name":"dstEid","type":"uint32"},{"indexed":false,"internalType":"uint64","name":"chainId","type":"uint64"}],"name":"DstEidSet","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"bytes32","name":"role","type":"bytes32"},{"indexed":true,"internalType":"bytes32","name":"previousAdminRole","type":"bytes32"},{"indexed":true,"internalType":"bytes32","name":"newAdminRole","type":"bytes32"}],"name":"RoleAdminChanged","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"bytes32","name":"role","type":"bytes32"},{"indexed":true,"internalType":"address","name":"account","type":"address"},{"indexed":true,"internalType":"address","name":"sender","type":"address"}],"name":"RoleGranted","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"bytes32","name":"role","type":"bytes32"},{"indexed":true,"internalType":"address","name":"account","type":"address"},{"indexed":true,"internalType":"address","name":"sender","type":"address"}],"name":"RoleRevoked","type":"event"},{"inputs":[],"name":"DEFAULT_ADMIN_ROLE","outputs":[{"internalType":"bytes32","name":"","type":"bytes32"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"OPERATOR_ROLE","outputs":[{"internalType":"bytes32","name":"","type":"bytes32"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint64","name":"","type":"uint64"}],"name":"chainIdToChainName","outputs":[{"internalType":"string","name":"","type":"string"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint64","name":"","type":"uint64"}],"name":"chainIdToDstEid","outputs":[{"internalType":"uint32","name":"","type":"uint32"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"string","name":"","type":"string"}],"name":"chainNameToChainId","outputs":[{"internalType":"uint64","name":"","type":"uint64"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint32","name":"","type":"uint32"}],"name":"dstEidToChainId","outputs":[{"internalType":"uint64","name":"","type":"uint64"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"bytes32","name":"role","type":"bytes32"}],"name":"getRoleAdmin","outputs":[{"internalType":"bytes32","name":"","type":"bytes32"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"bytes32","name":"role","type":"bytes32"},{"internalType":"uint256","name":"index","type":"uint256"}],"name":"getRoleMember","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"bytes32","name":"role","type":"bytes32"}],"name":"getRoleMemberCount","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"bytes32","name":"role","type":"bytes32"},{"internalType":"address","name":"account","type":"address"}],"name":"grantRole","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"bytes32","name":"role","type":"bytes32"},{"internalType":"address","name":"account","type":"address"}],"name":"hasRole","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"bytes32","name":"role","type":"bytes32"},{"internalType":"address","name":"account","type":"address"}],"name":"renounceRole","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"bytes32","name":"role","type":"bytes32"},{"internalType":"address","name":"account","type":"address"}],"name":"revokeRole","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"string[]","name":"chainNames_","type":"string[]"},{"internalType":"uint64[]","name":"chainIds_","type":"uint64[]"}],"name":"setChainNames","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint32[]","name":"dstEids_","type":"uint32[]"},{"internalType":"uint64[]","name":"chainIds_","type":"uint64[]"}],"name":"setDstEids","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"bytes4","name":"interfaceId","type":"bytes4"}],"name":"supportsInterface","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"}]

608060405234801562000010575f80fd5b506200001d5f3362000023565b6200015a565b6200002f82826200004d565b5f828152600160205260409020620000489082620000ec565b505050565b5f828152602081815260408083206001600160a01b038516845290915290205460ff16620000e8575f828152602081815260408083206001600160a01b03851684529091529020805460ff19166001179055620000a73390565b6001600160a01b0316816001600160a01b0316837f2f8788117e7eff1d82e926ec794901d17c78024a50270940304540a733656f0d60405160405180910390a45b5050565b5f62000102836001600160a01b0384166200010b565b90505b92915050565b5f8181526001830160205260408120546200015257508154600181810184555f84815260208082209093018490558454848252828601909352604090209190915562000105565b505f62000105565b6115ed80620001685f395ff3fe608060405234801561000f575f80fd5b50600436106100fb575f3560e01c80639010d07c11610093578063d547741f11610063578063d547741f1461027e578063d9797f3e14610291578063f5b541a6146102a4578063f7520468146102cb575f80fd5b80639010d07c1461022657806391d1485414610251578063a217fddf14610264578063ca15c8731461026b575f80fd5b80632f2ff15d116100ce5780632f2ff15d146101b857806336568abe146101cb5780634ca96fc8146101de57806355765f3114610206575f80fd5b806301ffc9a7146100ff57806305a9ef02146101275780630c5cbe1914610173578063248a9ca314610188575b5f80fd5b61011261010d366004610ed1565b610305565b60405190151581526020015b60405180910390f35b61015b610135366004610fa7565b80516020818301810180516005825292820191909301209152546001600160401b031681565b6040516001600160401b03909116815260200161011e565b61018661018136600461109f565b61032f565b005b6101aa610196366004611158565b5f9081526020819052604090206001015490565b60405190815260200161011e565b6101866101c636600461116f565b6104db565b6101866101d936600461116f565b610504565b61015b6101ec3660046111a8565b60036020525f90815260409020546001600160401b031681565b6102196102143660046111c1565b610582565b60405161011e9190611227565b610239610234366004611239565b610619565b6040516001600160a01b03909116815260200161011e565b61011261025f36600461116f565b610637565b6101aa5f81565b6101aa610279366004611158565b61065f565b61018661028c36600461116f565b610675565b61018661029f366004611259565b610699565b6101aa7f97667070c54ef182b0f5858b034beac1b6f3089aa2d3188bb1e8929f4fa9b92981565b6102f06102d93660046111c1565b60026020525f908152604090205463ffffffff1681565b60405163ffffffff909116815260200161011e565b5f6001600160e01b03198216635a05180f60e01b148061032957506103298261098c565b92915050565b7f97667070c54ef182b0f5858b034beac1b6f3089aa2d3188bb1e8929f4fa9b929610359816109c0565b8251825181146103b05760405162461bcd60e51b815260206004820152601c60248201527f436861696e4964416461707465723a2077726f6e67206c656e6774680000000060448201526064015b60405180910390fd5b5f5b818163ffffffff1610156104d4575f848263ffffffff16815181106103d9576103d961130e565b602002602001015190505f868363ffffffff16815181106103fc576103fc61130e565b6020908102919091018101516001600160401b038481165f81815260028086526040808320805463ffffffff8089168087526003808c528588208054909a168852958b52848720805463ffffffff1990811690915591909216808752948a52838620805467ffffffffffffffff19908116909155835490911682179092559384905285541684179094558351918252948101919091529193507f0135cf745f6b00df63bbe519d750262f9fc5816e5b665747a9a755499e862c4b910160405180910390a1505050806104cd90611336565b90506103b2565b5050505050565b5f828152602081905260409020600101546104f5816109c0565b6104ff83836109cd565b505050565b6001600160a01b03811633146105745760405162461bcd60e51b815260206004820152602f60248201527f416363657373436f6e74726f6c3a2063616e206f6e6c792072656e6f756e636560448201526e103937b632b9903337b91039b2b63360891b60648201526084016103a7565b61057e82826109ee565b5050565b60046020525f90815260409020805461059a90611358565b80601f01602080910402602001604051908101604052809291908181526020018280546105c690611358565b80156106115780601f106105e857610100808354040283529160200191610611565b820191905f5260205f20905b8154815290600101906020018083116105f457829003601f168201915b505050505081565b5f8281526001602052604081206106309083610a0f565b9392505050565b5f918252602082815260408084206001600160a01b0393909316845291905290205460ff1690565b5f81815260016020526040812061032990610a1a565b5f8281526020819052604090206001015461068f816109c0565b6104ff83836109ee565b7f97667070c54ef182b0f5858b034beac1b6f3089aa2d3188bb1e8929f4fa9b9296106c3816109c0565b8251825181146107155760405162461bcd60e51b815260206004820152601c60248201527f436861696e4964416461707465723a2077726f6e67206c656e6774680000000060448201526064016103a7565b5f5b818163ffffffff1610156104d4575f848263ffffffff168151811061073e5761073e61130e565b602002602001015190505f868363ffffffff16815181106107615761076161130e565b602002602001015190505f60045f846001600160401b03166001600160401b031681526020019081526020015f20805461079a90611358565b80601f01602080910402602001604051908101604052809291908181526020018280546107c690611358565b80156108115780601f106107e857610100808354040283529160200191610811565b820191905f5260205f20905b8154815290600101906020018083116107f457829003601f168201915b5050505050905060045f60058460405161082b9190611390565b9081526040805160209281900383019020546001600160401b0316835290820192909252015f90812061085d91610e87565b60058160405161086d9190611390565b90815260200160405180910390205f6101000a8154906001600160401b0302191690558160045f898763ffffffff16815181106108ac576108ac61130e565b60200260200101516001600160401b03166001600160401b031681526020019081526020015f2090816108df91906113f8565b50826005898663ffffffff16815181106108fb576108fb61130e565b60200260200101516040516109109190611390565b90815260405190819003602001812080546001600160401b039390931667ffffffffffffffff19909316929092179091557f3a735fdad572d07ce78eeb7a887df5492c7e830a04932180615f83e2017265349061097090849086906114b3565b60405180910390a15050508061098590611336565b9050610717565b5f6001600160e01b03198216637965db0b60e01b148061032957506301ffc9a760e01b6001600160e01b0319831614610329565b6109ca8133610a23565b50565b6109d78282610a7c565b5f8281526001602052604090206104ff9082610aff565b6109f88282610b13565b5f8281526001602052604090206104ff9082610b77565b5f6106308383610b8b565b5f610329825490565b610a2d8282610637565b61057e57610a3a81610bb1565b610a45836020610bc3565b604051602001610a569291906114dd565b60408051601f198184030181529082905262461bcd60e51b82526103a791600401611227565b610a868282610637565b61057e575f828152602081815260408083206001600160a01b03851684529091529020805460ff19166001179055610abb3390565b6001600160a01b0316816001600160a01b0316837f2f8788117e7eff1d82e926ec794901d17c78024a50270940304540a733656f0d60405160405180910390a45050565b5f610630836001600160a01b038416610d58565b610b1d8282610637565b1561057e575f828152602081815260408083206001600160a01b0385168085529252808320805460ff1916905551339285917ff6391f5c32d9c69d2a47ea670b442974b53935d1edc7fd64eb21e047a839171b9190a45050565b5f610630836001600160a01b038416610da4565b5f825f018281548110610ba057610ba061130e565b905f5260205f200154905092915050565b60606103296001600160a01b03831660145b60605f610bd1836002611551565b610bdc906002611568565b6001600160401b03811115610bf357610bf3610ef8565b6040519080825280601f01601f191660200182016040528015610c1d576020820181803683370190505b509050600360fc1b815f81518110610c3757610c3761130e565b60200101906001600160f81b03191690815f1a905350600f60fb1b81600181518110610c6557610c6561130e565b60200101906001600160f81b03191690815f1a9053505f610c87846002611551565b610c92906001611568565b90505b6001811115610d09576f181899199a1a9b1b9c1cb0b131b232b360811b85600f1660108110610cc657610cc661130e565b1a60f81b828281518110610cdc57610cdc61130e565b60200101906001600160f81b03191690815f1a90535060049490941c93610d028161157b565b9050610c95565b5083156106305760405162461bcd60e51b815260206004820181905260248201527f537472696e67733a20686578206c656e67746820696e73756666696369656e7460448201526064016103a7565b5f818152600183016020526040812054610d9d57508154600181810184555f848152602080822090930184905584548482528286019093526040902091909155610329565b505f610329565b5f8181526001830160205260408120548015610e7e575f610dc6600183611590565b85549091505f90610dd990600190611590565b9050818114610e38575f865f018281548110610df757610df761130e565b905f5260205f200154905080875f018481548110610e1757610e1761130e565b5f918252602080832090910192909255918252600188019052604090208390555b8554869080610e4957610e496115a3565b600190038181905f5260205f20015f90559055856001015f8681526020019081526020015f205f905560019350505050610329565b5f915050610329565b508054610e9390611358565b5f825580601f10610ea2575050565b601f0160209004905f5260205f20908101906109ca91905b80821115610ecd575f8155600101610eba565b5090565b5f60208284031215610ee1575f80fd5b81356001600160e01b031981168114610630575f80fd5b634e487b7160e01b5f52604160045260245ffd5b604051601f8201601f191681016001600160401b0381118282101715610f3457610f34610ef8565b604052919050565b5f82601f830112610f4b575f80fd5b81356001600160401b03811115610f6457610f64610ef8565b610f77601f8201601f1916602001610f0c565b818152846020838601011115610f8b575f80fd5b816020850160208301375f918101602001919091529392505050565b5f60208284031215610fb7575f80fd5b81356001600160401b03811115610fcc575f80fd5b610fd884828501610f3c565b949350505050565b5f6001600160401b03821115610ff857610ff8610ef8565b5060051b60200190565b803563ffffffff81168114611015575f80fd5b919050565b80356001600160401b0381168114611015575f80fd5b5f82601f83011261103f575f80fd5b8135602061105461104f83610fe0565b610f0c565b82815260059290921b84018101918181019086841115611072575f80fd5b8286015b84811015611094576110878161101a565b8352918301918301611076565b509695505050505050565b5f80604083850312156110b0575f80fd5b82356001600160401b03808211156110c6575f80fd5b818501915085601f8301126110d9575f80fd5b813560206110e961104f83610fe0565b82815260059290921b84018101918181019089841115611107575f80fd5b948201945b8386101561112c5761111d86611002565b8252948201949082019061110c565b96505086013592505080821115611141575f80fd5b5061114e85828601611030565b9150509250929050565b5f60208284031215611168575f80fd5b5035919050565b5f8060408385031215611180575f80fd5b8235915060208301356001600160a01b038116811461119d575f80fd5b809150509250929050565b5f602082840312156111b8575f80fd5b61063082611002565b5f602082840312156111d1575f80fd5b6106308261101a565b5f5b838110156111f45781810151838201526020016111dc565b50505f910152565b5f81518084526112138160208601602086016111da565b601f01601f19169290920160200192915050565b602081525f61063060208301846111fc565b5f806040838503121561124a575f80fd5b50508035926020909101359150565b5f806040838503121561126a575f80fd5b82356001600160401b0380821115611280575f80fd5b818501915085601f830112611293575f80fd5b813560206112a361104f83610fe0565b82815260059290921b840181019181810190898411156112c1575f80fd5b8286015b848110156112f8578035868111156112dc575f8081fd5b6112ea8c86838b0101610f3c565b8452509183019183016112c5565b5096505086013592505080821115611141575f80fd5b634e487b7160e01b5f52603260045260245ffd5b634e487b7160e01b5f52601160045260245ffd5b5f63ffffffff80831681810361134e5761134e611322565b6001019392505050565b600181811c9082168061136c57607f821691505b60208210810361138a57634e487b7160e01b5f52602260045260245ffd5b50919050565b5f82516113a18184602087016111da565b9190910192915050565b601f8211156104ff575f81815260208120601f850160051c810160208610156113d15750805b601f850160051c820191505b818110156113f0578281556001016113dd565b505050505050565b81516001600160401b0381111561141157611411610ef8565b6114258161141f8454611358565b846113ab565b602080601f831160018114611458575f84156114415750858301515b5f19600386901b1c1916600185901b1785556113f0565b5f85815260208120601f198616915b8281101561148657888601518255948401946001909101908401611467565b50858210156114a357878501515f19600388901b60f8161c191681555b5050505050600190811b01905550565b604081525f6114c560408301856111fc565b90506001600160401b03831660208301529392505050565b7f416363657373436f6e74726f6c3a206163636f756e742000000000000000000081525f83516115148160178501602088016111da565b7001034b99036b4b9b9b4b733903937b6329607d1b60179184019182015283516115458160288401602088016111da565b01602801949350505050565b808202811582820484141761032957610329611322565b8082018082111561032957610329611322565b5f8161158957611589611322565b505f190190565b8181038181111561032957610329611322565b634e487b7160e01b5f52603160045260245ffdfea26469706673582212209b67eaab91a4df5a9dec1fc3e1420e9dffd8cf7e4ad5e31d48ea6dfe9b68c77364736f6c63430008140033

0x608060405234801561000f575f80fd5b50600436106100fb575f3560e01c80639010d07c11610093578063d547741f11610063578063d547741f1461027e578063d9797f3e14610291578063f5b541a6146102a4578063f7520468146102cb575f80fd5b80639010d07c1461022657806391d1485414610251578063a217fddf14610264578063ca15c8731461026b575f80fd5b80632f2ff15d116100ce5780632f2ff15d146101b857806336568abe146101cb5780634ca96fc8146101de57806355765f3114610206575f80fd5b806301ffc9a7146100ff57806305a9ef02146101275780630c5cbe1914610173578063248a9ca314610188575b5f80fd5b61011261010d366004610ed1565b610305565b60405190151581526020015b60405180910390f35b61015b610135366004610fa7565b80516020818301810180516005825292820191909301209152546001600160401b031681565b6040516001600160401b03909116815260200161011e565b61018661018136600461109f565b61032f565b005b6101aa610196366004611158565b5f9081526020819052604090206001015490565b60405190815260200161011e565b6101866101c636600461116f565b6104db565b6101866101d936600461116f565b610504565b61015b6101ec3660046111a8565b60036020525f90815260409020546001600160401b031681565b6102196102143660046111c1565b610582565b60405161011e9190611227565b610239610234366004611239565b610619565b6040516001600160a01b03909116815260200161011e565b61011261025f36600461116f565b610637565b6101aa5f81565b6101aa610279366004611158565b61065f565b61018661028c36600461116f565b610675565b61018661029f366004611259565b610699565b6101aa7f97667070c54ef182b0f5858b034beac1b6f3089aa2d3188bb1e8929f4fa9b92981565b6102f06102d93660046111c1565b60026020525f908152604090205463ffffffff1681565b60405163ffffffff909116815260200161011e565b5f6001600160e01b03198216635a05180f60e01b148061032957506103298261098c565b92915050565b7f97667070c54ef182b0f5858b034beac1b6f3089aa2d3188bb1e8929f4fa9b929610359816109c0565b8251825181146103b05760405162461bcd60e51b815260206004820152601c60248201527f436861696e4964416461707465723a2077726f6e67206c656e6774680000000060448201526064015b60405180910390fd5b5f5b818163ffffffff1610156104d4575f848263ffffffff16815181106103d9576103d961130e565b602002602001015190505f868363ffffffff16815181106103fc576103fc61130e565b6020908102919091018101516001600160401b038481165f81815260028086526040808320805463ffffffff8089168087526003808c528588208054909a168852958b52848720805463ffffffff1990811690915591909216808752948a52838620805467ffffffffffffffff19908116909155835490911682179092559384905285541684179094558351918252948101919091529193507f0135cf745f6b00df63bbe519d750262f9fc5816e5b665747a9a755499e862c4b910160405180910390a1505050806104cd90611336565b90506103b2565b5050505050565b5f828152602081905260409020600101546104f5816109c0565b6104ff83836109cd565b505050565b6001600160a01b03811633146105745760405162461bcd60e51b815260206004820152602f60248201527f416363657373436f6e74726f6c3a2063616e206f6e6c792072656e6f756e636560448201526e103937b632b9903337b91039b2b63360891b60648201526084016103a7565b61057e82826109ee565b5050565b60046020525f90815260409020805461059a90611358565b80601f01602080910402602001604051908101604052809291908181526020018280546105c690611358565b80156106115780601f106105e857610100808354040283529160200191610611565b820191905f5260205f20905b8154815290600101906020018083116105f457829003601f168201915b505050505081565b5f8281526001602052604081206106309083610a0f565b9392505050565b5f918252602082815260408084206001600160a01b0393909316845291905290205460ff1690565b5f81815260016020526040812061032990610a1a565b5f8281526020819052604090206001015461068f816109c0565b6104ff83836109ee565b7f97667070c54ef182b0f5858b034beac1b6f3089aa2d3188bb1e8929f4fa9b9296106c3816109c0565b8251825181146107155760405162461bcd60e51b815260206004820152601c60248201527f436861696e4964416461707465723a2077726f6e67206c656e6774680000000060448201526064016103a7565b5f5b818163ffffffff1610156104d4575f848263ffffffff168151811061073e5761073e61130e565b602002602001015190505f868363ffffffff16815181106107615761076161130e565b602002602001015190505f60045f846001600160401b03166001600160401b031681526020019081526020015f20805461079a90611358565b80601f01602080910402602001604051908101604052809291908181526020018280546107c690611358565b80156108115780601f106107e857610100808354040283529160200191610811565b820191905f5260205f20905b8154815290600101906020018083116107f457829003601f168201915b5050505050905060045f60058460405161082b9190611390565b9081526040805160209281900383019020546001600160401b0316835290820192909252015f90812061085d91610e87565b60058160405161086d9190611390565b90815260200160405180910390205f6101000a8154906001600160401b0302191690558160045f898763ffffffff16815181106108ac576108ac61130e565b60200260200101516001600160401b03166001600160401b031681526020019081526020015f2090816108df91906113f8565b50826005898663ffffffff16815181106108fb576108fb61130e565b60200260200101516040516109109190611390565b90815260405190819003602001812080546001600160401b039390931667ffffffffffffffff19909316929092179091557f3a735fdad572d07ce78eeb7a887df5492c7e830a04932180615f83e2017265349061097090849086906114b3565b60405180910390a15050508061098590611336565b9050610717565b5f6001600160e01b03198216637965db0b60e01b148061032957506301ffc9a760e01b6001600160e01b0319831614610329565b6109ca8133610a23565b50565b6109d78282610a7c565b5f8281526001602052604090206104ff9082610aff565b6109f88282610b13565b5f8281526001602052604090206104ff9082610b77565b5f6106308383610b8b565b5f610329825490565b610a2d8282610637565b61057e57610a3a81610bb1565b610a45836020610bc3565b604051602001610a569291906114dd565b60408051601f198184030181529082905262461bcd60e51b82526103a791600401611227565b610a868282610637565b61057e575f828152602081815260408083206001600160a01b03851684529091529020805460ff19166001179055610abb3390565b6001600160a01b0316816001600160a01b0316837f2f8788117e7eff1d82e926ec794901d17c78024a50270940304540a733656f0d60405160405180910390a45050565b5f610630836001600160a01b038416610d58565b610b1d8282610637565b1561057e575f828152602081815260408083206001600160a01b0385168085529252808320805460ff1916905551339285917ff6391f5c32d9c69d2a47ea670b442974b53935d1edc7fd64eb21e047a839171b9190a45050565b5f610630836001600160a01b038416610da4565b5f825f018281548110610ba057610ba061130e565b905f5260205f200154905092915050565b60606103296001600160a01b03831660145b60605f610bd1836002611551565b610bdc906002611568565b6001600160401b03811115610bf357610bf3610ef8565b6040519080825280601f01601f191660200182016040528015610c1d576020820181803683370190505b509050600360fc1b815f81518110610c3757610c3761130e565b60200101906001600160f81b03191690815f1a905350600f60fb1b81600181518110610c6557610c6561130e565b60200101906001600160f81b03191690815f1a9053505f610c87846002611551565b610c92906001611568565b90505b6001811115610d09576f181899199a1a9b1b9c1cb0b131b232b360811b85600f1660108110610cc657610cc661130e565b1a60f81b828281518110610cdc57610cdc61130e565b60200101906001600160f81b03191690815f1a90535060049490941c93610d028161157b565b9050610c95565b5083156106305760405162461bcd60e51b815260206004820181905260248201527f537472696e67733a20686578206c656e67746820696e73756666696369656e7460448201526064016103a7565b5f818152600183016020526040812054610d9d57508154600181810184555f848152602080822090930184905584548482528286019093526040902091909155610329565b505f610329565b5f8181526001830160205260408120548015610e7e575f610dc6600183611590565b85549091505f90610dd990600190611590565b9050818114610e38575f865f018281548110610df757610df761130e565b905f5260205f200154905080875f018481548110610e1757610e1761130e565b5f918252602080832090910192909255918252600188019052604090208390555b8554869080610e4957610e496115a3565b600190038181905f5260205f20015f90559055856001015f8681526020019081526020015f205f905560019350505050610329565b5f915050610329565b508054610e9390611358565b5f825580601f10610ea2575050565b601f0160209004905f5260205f20908101906109ca91905b80821115610ecd575f8155600101610eba565b5090565b5f60208284031215610ee1575f80fd5b81356001600160e01b031981168114610630575f80fd5b634e487b7160e01b5f52604160045260245ffd5b604051601f8201601f191681016001600160401b0381118282101715610f3457610f34610ef8565b604052919050565b5f82601f830112610f4b575f80fd5b81356001600160401b03811115610f6457610f64610ef8565b610f77601f8201601f1916602001610f0c565b818152846020838601011115610f8b575f80fd5b816020850160208301375f918101602001919091529392505050565b5f60208284031215610fb7575f80fd5b81356001600160401b03811115610fcc575f80fd5b610fd884828501610f3c565b949350505050565b5f6001600160401b03821115610ff857610ff8610ef8565b5060051b60200190565b803563ffffffff81168114611015575f80fd5b919050565b80356001600160401b0381168114611015575f80fd5b5f82601f83011261103f575f80fd5b8135602061105461104f83610fe0565b610f0c565b82815260059290921b84018101918181019086841115611072575f80fd5b8286015b84811015611094576110878161101a565b8352918301918301611076565b509695505050505050565b5f80604083850312156110b0575f80fd5b82356001600160401b03808211156110c6575f80fd5b818501915085601f8301126110d9575f80fd5b813560206110e961104f83610fe0565b82815260059290921b84018101918181019089841115611107575f80fd5b948201945b8386101561112c5761111d86611002565b8252948201949082019061110c565b96505086013592505080821115611141575f80fd5b5061114e85828601611030565b9150509250929050565b5f60208284031215611168575f80fd5b5035919050565b5f8060408385031215611180575f80fd5b8235915060208301356001600160a01b038116811461119d575f80fd5b809150509250929050565b5f602082840312156111b8575f80fd5b61063082611002565b5f602082840312156111d1575f80fd5b6106308261101a565b5f5b838110156111f45781810151838201526020016111dc565b50505f910152565b5f81518084526112138160208601602086016111da565b601f01601f19169290920160200192915050565b602081525f61063060208301846111fc565b5f806040838503121561124a575f80fd5b50508035926020909101359150565b5f806040838503121561126a575f80fd5b82356001600160401b0380821115611280575f80fd5b818501915085601f830112611293575f80fd5b813560206112a361104f83610fe0565b82815260059290921b840181019181810190898411156112c1575f80fd5b8286015b848110156112f8578035868111156112dc575f8081fd5b6112ea8c86838b0101610f3c565b8452509183019183016112c5565b5096505086013592505080821115611141575f80fd5b634e487b7160e01b5f52603260045260245ffd5b634e487b7160e01b5f52601160045260245ffd5b5f63ffffffff80831681810361134e5761134e611322565b6001019392505050565b600181811c9082168061136c57607f821691505b60208210810361138a57634e487b7160e01b5f52602260045260245ffd5b50919050565b5f82516113a18184602087016111da565b9190910192915050565b601f8211156104ff575f81815260208120601f850160051c810160208610156113d15750805b601f850160051c820191505b818110156113f0578281556001016113dd565b505050505050565b81516001600160401b0381111561141157611411610ef8565b6114258161141f8454611358565b846113ab565b602080601f831160018114611458575f84156114415750858301515b5f19600386901b1c1916600185901b1785556113f0565b5f85815260208120601f198616915b8281101561148657888601518255948401946001909101908401611467565b50858210156114a357878501515f19600388901b60f8161c191681555b5050505050600190811b01905550565b604081525f6114c560408301856111fc565b90506001600160401b03831660208301529392505050565b7f416363657373436f6e74726f6c3a206163636f756e742000000000000000000081525f83516115148160178501602088016111da565b7001034b99036b4b9b9b4b733903937b6329607d1b60179184019182015283516115458160288401602088016111da565b01602801949350505050565b808202811582820484141761032957610329611322565b8082018082111561032957610329611322565b5f8161158957611589611322565b505f190190565b8181038181111561032957610329611322565b634e487b7160e01b5f52603160045260245ffdfea26469706673582212209b67eaab91a4df5a9dec1fc3e1420e9dffd8cf7e4ad5e31d48ea6dfe9b68c77364736f6c63430008140033