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/utils/Address.sol";
import "@openzeppelin/contracts/access/AccessControlEnumerable.sol";
import "@openzeppelin/contracts/security/ReentrancyGuard.sol";
import "../interfaces/IBridgeV3.sol";
import "../interfaces/IOracle.sol";
import "../interfaces/IReceiver.sol";
import "../utils/Block.sol";
import "../utils/Bls.sol";
import "../utils/Merkle.sol";


contract BridgeV3 is IBridgeV3, AccessControlEnumerable, ReentrancyGuard {
    
    using Address for address;
    using Bls for Bls.Epoch;

    /// @dev gate keeper role id
    bytes32 public constant GATEKEEPER_ROLE = keccak256("GATEKEEPER_ROLE");
    /// @dev validator role id
    bytes32 public constant VALIDATOR_ROLE = keccak256("VALIDATOR_ROLE");
    /// @dev operator role id
    bytes32 public constant OPERATOR_ROLE = keccak256("OPERATOR_ROLE");

    /// @dev receiver that store thresholds
    address public receiver;
    /// @dev priceOracle that store prices for execution
    address public priceOracle;
    /// @dev human readable version
    string public version;
    /// @dev human readable tag
    string public tag;
    /// @dev current state Active\Inactive
    State public state;
    /// @dev received request IDs 
    mapping(bytes32 => bool) public requestIdChecker;
    // current epoch
    Bls.Epoch internal currentEpoch;
    // previous epoch
    Bls.Epoch internal previousEpoch;

    event EpochUpdated(bytes key, uint32 epochNum, uint64 protocolVersion);
    event RequestSent(
        bytes32 requestId,
        bytes data,
        address to,
        uint64 chainIdTo
    );
    event StateSet(State state);
    event ReceiverSet(address receiver);
    event PriceOracleSet(address priceOracle);
    event ValueWithdrawn(address to, uint256 amount);
    event GasPaid(bytes32 requestId, uint32 gasAmount);


    constructor(string memory tag_) {
        _grantRole(DEFAULT_ADMIN_ROLE, _msgSender());
        version = "2.2.3";
        state = State.Inactive;
        tag = tag_;
    }

    /**
     * @dev Get current epoch.
     */
    function getCurrentEpoch() public view returns (bytes memory, uint8, uint32) {
        return (abi.encode(currentEpoch.publicKey), currentEpoch.participantsCount, currentEpoch.epochNum);
    }

    /**
     * @dev Get previous epoch.
     */
    function getPreviousEpoch() public view returns (bytes memory, uint8, uint32) {
        return (abi.encode(previousEpoch.publicKey), previousEpoch.participantsCount, previousEpoch.epochNum);
    }

    /**
     * @dev Updates current epoch.
     *
     * @param params ReceiveParams struct.
     */
    function updateEpoch(ReceiveParams calldata params) external onlyRole(VALIDATOR_ROLE) {
        // TODO ensure that new epoch really next one after previous (by hash)
        bytes memory payload = Merkle.prove(params.merkleProof, Block.txRootHash(params.blockHeader));
        (uint64 newEpochProtocolVersion, uint32 newEpochNum, bytes memory newKey, uint8 newParticipantsCount) = Block
            .decodeEpochUpdate(payload);

        require(currentEpoch.epochNum + 1 == newEpochNum, "Bridge: wrong epoch number");
    
        // TODO remove if when resetEpoch will be removed
        if (currentEpoch.isSet()) {
            verifyEpoch(currentEpoch, params);
            rotateEpoch();
        }

        // TODO ensure that new epoch really next one after previous (prev hash + params.blockHeader)
        bytes32 newHash = sha256(params.blockHeader);
        currentEpoch.update(newKey, newParticipantsCount, newEpochNum, newHash);

        onEpochStart(newEpochProtocolVersion);
    }

    /**
     * @dev Forcefully reset epoch on all chains.
     *
     * Controlled by operator. Should be removed at PoS stage.
     */
    function resetEpoch() public onlyRole(OPERATOR_ROLE) {
        // TODO consider to remove any possible manipulations from protocol
        if (currentEpoch.isSet()) {
            rotateEpoch();
            currentEpoch.epochNum = previousEpoch.epochNum + 1;
        } else {
            currentEpoch.epochNum = currentEpoch.epochNum + 1;
        }
        onEpochStart(0);
    }

    /**
     * @dev Send crosschain request v3.
     *
     * @param params struct with requestId, data, receiver and opposite cahinId
     * @param sender address to where send params
     * @param nonce unique nonce for send
     * @param options additional params for send
     */
    function sendV3(
        SendParams calldata params,
        address sender,
        uint256 nonce,
        bytes memory options
    ) external payable onlyRole(GATEKEEPER_ROLE) {
        require(state == State.Active, "Bridge: state inactive");
        require(previousEpoch.isSet() || currentEpoch.isSet(), "Bridge: epoch not set");

        address to = address(uint160(uint256(params.to)));

        emit RequestSent(
            params.requestId,
            params.data,
            to,
            params.chainIdTo
        );
        emit GasPaid(params.requestId, abi.decode(options, (uint32)));
    }

    /**
     * @dev Estimate crosschain request v3.
     *
     * @param params struct with requestId, data, receiver and opposite cahinId
     * @param sender address to where send params
     * @param options additional params for send
     */
    function estimateGasFee(
        SendParams calldata params,
        address sender,
        bytes memory options
    ) public view returns (uint256) {
        uint32 gasExecute = abi.decode(options, (uint32));
        (uint256 fee,) = IOracle(priceOracle).estimateFeeByChain(
            params.chainIdTo, 
            params.data.length, 
            gasExecute
        );
        return fee;
    }

    /**
     * @dev Withdraw value from this contract.
     *
     * @param value_ Amount of value
     */
    function withdrawValue(uint256 value_) external onlyRole(DEFAULT_ADMIN_ROLE) {
        (bool success, ) = msg.sender.call{value: value_}("");
        require(success, "BridgeV3: failed to send Ether");
        emit ValueWithdrawn(msg.sender, value_);
    }

    /**
     * @dev Receive crosschain request v3.
     *
     * @param params array with ReceiveParams structs.
     */
    function receiveV3(ReceiveParams[] calldata params) external override onlyRole(VALIDATOR_ROLE) nonReentrant returns (bool) {
        
        require(state != State.Inactive, "Bridge: state inactive");

        for (uint256 i = 0; i < params.length; ++i) {
            bytes32 epochHash = Block.epochHash(params[i].blockHeader);

            // verify the block signature
            if (epochHash == currentEpoch.epochHash) {
                require(currentEpoch.isSet(), "Bridge: epoch not set");
                verifyEpoch(currentEpoch, params[i]);
            } else if (epochHash == previousEpoch.epochHash) {
                require(previousEpoch.isSet(), "Bridge: epoch not set");
                verifyEpoch(previousEpoch, params[i]);
            } else {
                revert("Bridge: wrong epoch");
            }

            // verify that the transaction is really in the block
            bytes memory payload = Merkle.prove(params[i].merkleProof, Block.txRootHash(params[i].blockHeader));

            // get call data
            (bytes32 requestId, bytes memory receivedData, address to, uint64 chainIdTo) = Block.decodeRequest(payload);
            require(chainIdTo == block.chainid, "Bridge: wrong chain id");

            require(requestIdChecker[requestId] == false, "Bridge: request id already seen");
            requestIdChecker[requestId] = true;

            uint256 length = receivedData.length - 1;
            payload = new bytes(length);
            for (uint j; j < length; ++j) {
                payload[j] = receivedData[j];
            }
            if (receivedData[receivedData.length - 1] == 0x01){
                require(payload.length == 128, "Bridge: Invalid message length");
                (bytes32 payload_, bytes32 sender, uint256 chainIdFrom, ) = abi.decode(receivedData, (bytes32, bytes32, uint256, bytes32));
                IReceiver(receiver).receiveHash(sender, uint64(chainIdFrom), payload_, requestId);
            } else if (receivedData[receivedData.length - 1] == 0x00) {
                (bytes memory payload_, bytes32 sender, uint256 chainIdFrom, ) = abi.decode(receivedData, (bytes, bytes32, uint256, bytes32));
                IReceiver(receiver).receiveData(sender, uint64(chainIdFrom), payload_, requestId);
            } else {
                revert("Bridge: wrong message");
            }
        }
        return true;
    }

    /**
     * @dev Set new state.
     *
     * Controlled by operator. Can be used to emergency pause send or send and receive data.
     *
     * @param state_ Active\Inactive state
     */
    function setState(State state_) external onlyRole(OPERATOR_ROLE) {
        state = state_;
        emit StateSet(state);
    }

    /**
     * @dev Set new receiver.
     *
     * Controlled by operator.
     *
     * @param receiver_ Receiver address
     */
    function setReceiver(address receiver_) external onlyRole(OPERATOR_ROLE) {
        require(receiver_ != address(0), "BridgeV3: zero address");
        receiver = receiver_;
        emit ReceiverSet(receiver_);
    }

    /**
     * @dev Set new price oracle.
     *
     * Controlled by operator.
     *
     * @param priceOracle_ GasPriceOracle address
     */
    function setPriceOracle(address priceOracle_) external onlyRole(OPERATOR_ROLE) {
        require(priceOracle_ != address(0), "BridgeV3: zero address");
        priceOracle = priceOracle_;
        emit PriceOracleSet(priceOracle_);
    }

    /**
     * @dev Verifies epoch.
     *
     * @param epoch current or previous epoch;
     * @param params oracle tx params
     */
    function verifyEpoch(Bls.Epoch storage epoch, ReceiveParams calldata params) internal view {
        Block.verify(
            epoch,
            params.blockHeader,
            params.votersPubKey,
            params.votersSignature,
            params.votersMask
        );
    }

    /**
     * @dev Moves current epoch and current request filter to previous.
     */
    function rotateEpoch() internal {
        previousEpoch = currentEpoch;
        Bls.Epoch memory epoch;
        currentEpoch = epoch;
    }

    /**
     * @dev Hook on start new epoch.
     */
    function onEpochStart(uint64 protocolVersion_) internal virtual {
        emit EpochUpdated(abi.encode(currentEpoch.publicKey), currentEpoch.epochNum, protocolVersion_);
    }
}

// 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.0) (security/ReentrancyGuard.sol)

pragma solidity ^0.8.0;

/**
 * @dev Contract module that helps prevent reentrant calls to a function.
 *
 * Inheriting from `ReentrancyGuard` will make the {nonReentrant} modifier
 * available, which can be applied to functions to make sure there are no nested
 * (reentrant) calls to them.
 *
 * Note that because there is a single `nonReentrant` guard, functions marked as
 * `nonReentrant` may not call one another. This can be worked around by making
 * those functions `private`, and then adding `external` `nonReentrant` entry
 * points to them.
 *
 * TIP: If you would like to learn more about reentrancy and alternative ways
 * to protect against it, check out our blog post
 * https://blog.openzeppelin.com/reentrancy-after-istanbul/[Reentrancy After Istanbul].
 */
abstract contract ReentrancyGuard {
    // Booleans are more expensive than uint256 or any type that takes up a full
    // word because each write operation emits an extra SLOAD to first read the
    // slot's contents, replace the bits taken up by the boolean, and then write
    // back. This is the compiler's defense against contract upgrades and
    // pointer aliasing, and it cannot be disabled.

    // The values being non-zero value makes deployment a bit more expensive,
    // but in exchange the refund on every call to nonReentrant will be lower in
    // amount. Since refunds are capped to a percentage of the total
    // transaction's gas, it is best to keep them low in cases like this one, to
    // increase the likelihood of the full refund coming into effect.
    uint256 private constant _NOT_ENTERED = 1;
    uint256 private constant _ENTERED = 2;

    uint256 private _status;

    constructor() {
        _status = _NOT_ENTERED;
    }

    /**
     * @dev Prevents a contract from calling itself, directly or indirectly.
     * Calling a `nonReentrant` function from another `nonReentrant`
     * function is not supported. It is possible to prevent this from happening
     * by making the `nonReentrant` function external, and making it call a
     * `private` function that does the actual work.
     */
    modifier nonReentrant() {
        _nonReentrantBefore();
        _;
        _nonReentrantAfter();
    }

    function _nonReentrantBefore() private {
        // On the first call to nonReentrant, _status will be _NOT_ENTERED
        require(_status != _ENTERED, "ReentrancyGuard: reentrant call");

        // Any calls to nonReentrant after this point will fail
        _status = _ENTERED;
    }

    function _nonReentrantAfter() private {
        // By storing the original value once again, a refund is triggered (see
        // https://eips.ethereum.org/EIPS/eip-2200)
        _status = _NOT_ENTERED;
    }

    /**
     * @dev Returns true if the reentrancy guard is currently set to "entered", which indicates there is a
     * `nonReentrant` function in the call stack.
     */
    function _reentrancyGuardEntered() internal view returns (bool) {
        return _status == _ENTERED;
    }
}

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

pragma solidity ^0.8.1;

/**
 * @dev Collection of functions related to the address type
 */
library Address {
    /**
     * @dev Returns true if `account` is a contract.
     *
     * [IMPORTANT]
     * ====
     * It is unsafe to assume that an address for which this function returns
     * false is an externally-owned account (EOA) and not a contract.
     *
     * Among others, `isContract` will return false for the following
     * types of addresses:
     *
     *  - an externally-owned account
     *  - a contract in construction
     *  - an address where a contract will be created
     *  - an address where a contract lived, but was destroyed
     *
     * Furthermore, `isContract` will also return true if the target contract within
     * the same transaction is already scheduled for destruction by `SELFDESTRUCT`,
     * which only has an effect at the end of a transaction.
     * ====
     *
     * [IMPORTANT]
     * ====
     * You shouldn't rely on `isContract` to protect against flash loan attacks!
     *
     * Preventing calls from contracts is highly discouraged. It breaks composability, breaks support for smart wallets
     * like Gnosis Safe, and does not provide security since it can be circumvented by calling from a contract
     * constructor.
     * ====
     */
    function isContract(address account) internal view returns (bool) {
        // This method relies on extcodesize/address.code.length, which returns 0
        // for contracts in construction, since the code is only stored at the end
        // of the constructor execution.

        return account.code.length > 0;
    }

    /**
     * @dev Replacement for Solidity's `transfer`: sends `amount` wei to
     * `recipient`, forwarding all available gas and reverting on errors.
     *
     * https://eips.ethereum.org/EIPS/eip-1884[EIP1884] increases the gas cost
     * of certain opcodes, possibly making contracts go over the 2300 gas limit
     * imposed by `transfer`, making them unable to receive funds via
     * `transfer`. {sendValue} removes this limitation.
     *
     * https://consensys.net/diligence/blog/2019/09/stop-using-soliditys-transfer-now/[Learn more].
     *
     * IMPORTANT: because control is transferred to `recipient`, care must be
     * taken to not create reentrancy vulnerabilities. Consider using
     * {ReentrancyGuard} or the
     * https://solidity.readthedocs.io/en/v0.8.0/security-considerations.html#use-the-checks-effects-interactions-pattern[checks-effects-interactions pattern].
     */
    function sendValue(address payable recipient, uint256 amount) internal {
        require(address(this).balance >= amount, "Address: insufficient balance");

        (bool success, ) = recipient.call{value: amount}("");
        require(success, "Address: unable to send value, recipient may have reverted");
    }

    /**
     * @dev Performs a Solidity function call using a low level `call`. A
     * plain `call` is an unsafe replacement for a function call: use this
     * function instead.
     *
     * If `target` reverts with a revert reason, it is bubbled up by this
     * function (like regular Solidity function calls).
     *
     * Returns the raw returned data. To convert to the expected return value,
     * use https://solidity.readthedocs.io/en/latest/units-and-global-variables.html?highlight=abi.decode#abi-encoding-and-decoding-functions[`abi.decode`].
     *
     * Requirements:
     *
     * - `target` must be a contract.
     * - calling `target` with `data` must not revert.
     *
     * _Available since v3.1._
     */
    function functionCall(address target, bytes memory data) internal returns (bytes memory) {
        return functionCallWithValue(target, data, 0, "Address: low-level call failed");
    }

    /**
     * @dev Same as {xref-Address-functionCall-address-bytes-}[`functionCall`], but with
     * `errorMessage` as a fallback revert reason when `target` reverts.
     *
     * _Available since v3.1._
     */
    function functionCall(
        address target,
        bytes memory data,
        string memory errorMessage
    ) internal returns (bytes memory) {
        return functionCallWithValue(target, data, 0, errorMessage);
    }

    /**
     * @dev Same as {xref-Address-functionCall-address-bytes-}[`functionCall`],
     * but also transferring `value` wei to `target`.
     *
     * Requirements:
     *
     * - the calling contract must have an ETH balance of at least `value`.
     * - the called Solidity function must be `payable`.
     *
     * _Available since v3.1._
     */
    function functionCallWithValue(address target, bytes memory data, uint256 value) internal returns (bytes memory) {
        return functionCallWithValue(target, data, value, "Address: low-level call with value failed");
    }

    /**
     * @dev Same as {xref-Address-functionCallWithValue-address-bytes-uint256-}[`functionCallWithValue`], but
     * with `errorMessage` as a fallback revert reason when `target` reverts.
     *
     * _Available since v3.1._
     */
    function functionCallWithValue(
        address target,
        bytes memory data,
        uint256 value,
        string memory errorMessage
    ) internal returns (bytes memory) {
        require(address(this).balance >= value, "Address: insufficient balance for call");
        (bool success, bytes memory returndata) = target.call{value: value}(data);
        return verifyCallResultFromTarget(target, success, returndata, errorMessage);
    }

    /**
     * @dev Same as {xref-Address-functionCall-address-bytes-}[`functionCall`],
     * but performing a static call.
     *
     * _Available since v3.3._
     */
    function functionStaticCall(address target, bytes memory data) internal view returns (bytes memory) {
        return functionStaticCall(target, data, "Address: low-level static call failed");
    }

    /**
     * @dev Same as {xref-Address-functionCall-address-bytes-string-}[`functionCall`],
     * but performing a static call.
     *
     * _Available since v3.3._
     */
    function functionStaticCall(
        address target,
        bytes memory data,
        string memory errorMessage
    ) internal view returns (bytes memory) {
        (bool success, bytes memory returndata) = target.staticcall(data);
        return verifyCallResultFromTarget(target, success, returndata, errorMessage);
    }

    /**
     * @dev Same as {xref-Address-functionCall-address-bytes-}[`functionCall`],
     * but performing a delegate call.
     *
     * _Available since v3.4._
     */
    function functionDelegateCall(address target, bytes memory data) internal returns (bytes memory) {
        return functionDelegateCall(target, data, "Address: low-level delegate call failed");
    }

    /**
     * @dev Same as {xref-Address-functionCall-address-bytes-string-}[`functionCall`],
     * but performing a delegate call.
     *
     * _Available since v3.4._
     */
    function functionDelegateCall(
        address target,
        bytes memory data,
        string memory errorMessage
    ) internal returns (bytes memory) {
        (bool success, bytes memory returndata) = target.delegatecall(data);
        return verifyCallResultFromTarget(target, success, returndata, errorMessage);
    }

    /**
     * @dev Tool to verify that a low level call to smart-contract was successful, and revert (either by bubbling
     * the revert reason or using the provided one) in case of unsuccessful call or if target was not a contract.
     *
     * _Available since v4.8._
     */
    function verifyCallResultFromTarget(
        address target,
        bool success,
        bytes memory returndata,
        string memory errorMessage
    ) internal view returns (bytes memory) {
        if (success) {
            if (returndata.length == 0) {
                // only check isContract if the call was successful and the return data is empty
                // otherwise we already know that it was a contract
                require(isContract(target), "Address: call to non-contract");
            }
            return returndata;
        } else {
            _revert(returndata, errorMessage);
        }
    }

    /**
     * @dev Tool to verify that a low level call was successful, and revert if it wasn't, either by bubbling the
     * revert reason or using the provided one.
     *
     * _Available since v4.3._
     */
    function verifyCallResult(
        bool success,
        bytes memory returndata,
        string memory errorMessage
    ) internal pure returns (bytes memory) {
        if (success) {
            return returndata;
        } else {
            _revert(returndata, errorMessage);
        }
    }

    function _revert(bytes memory returndata, string memory errorMessage) private pure {
        // Look for revert reason and bubble it up if present
        if (returndata.length > 0) {
            // The easiest way to bubble the revert reason is using memory via assembly
            /// @solidity memory-safe-assembly
            assembly {
                let returndata_size := mload(returndata)
                revert(add(32, returndata), returndata_size)
            }
        } else {
            revert(errorMessage);
        }
    }
}

// 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: Unlicense
/*
 * @title Solidity Bytes Arrays Utils
 * @author Gonçalo Sá <[email protected]>
 *
 * @dev Bytes tightly packed arrays utility library for ethereum contracts written in Solidity.
 *      The library lets you concatenate, slice and type cast bytes arrays both in memory and storage.
 */
pragma solidity >=0.8.0 <0.9.0;


library BytesLib {
    function concat(
        bytes memory _preBytes,
        bytes memory _postBytes
    )
        internal
        pure
        returns (bytes memory)
    {
        bytes memory tempBytes;

        assembly {
            // Get a location of some free memory and store it in tempBytes as
            // Solidity does for memory variables.
            tempBytes := mload(0x40)

            // Store the length of the first bytes array at the beginning of
            // the memory for tempBytes.
            let length := mload(_preBytes)
            mstore(tempBytes, length)

            // Maintain a memory counter for the current write location in the
            // temp bytes array by adding the 32 bytes for the array length to
            // the starting location.
            let mc := add(tempBytes, 0x20)
            // Stop copying when the memory counter reaches the length of the
            // first bytes array.
            let end := add(mc, length)

            for {
                // Initialize a copy counter to the start of the _preBytes data,
                // 32 bytes into its memory.
                let cc := add(_preBytes, 0x20)
            } lt(mc, end) {
                // Increase both counters by 32 bytes each iteration.
                mc := add(mc, 0x20)
                cc := add(cc, 0x20)
            } {
                // Write the _preBytes data into the tempBytes memory 32 bytes
                // at a time.
                mstore(mc, mload(cc))
            }

            // Add the length of _postBytes to the current length of tempBytes
            // and store it as the new length in the first 32 bytes of the
            // tempBytes memory.
            length := mload(_postBytes)
            mstore(tempBytes, add(length, mload(tempBytes)))

            // Move the memory counter back from a multiple of 0x20 to the
            // actual end of the _preBytes data.
            mc := end
            // Stop copying when the memory counter reaches the new combined
            // length of the arrays.
            end := add(mc, length)

            for {
                let cc := add(_postBytes, 0x20)
            } lt(mc, end) {
                mc := add(mc, 0x20)
                cc := add(cc, 0x20)
            } {
                mstore(mc, mload(cc))
            }

            // Update the free-memory pointer by padding our last write location
            // to 32 bytes: add 31 bytes to the end of tempBytes to move to the
            // next 32 byte block, then round down to the nearest multiple of
            // 32. If the sum of the length of the two arrays is zero then add
            // one before rounding down to leave a blank 32 bytes (the length block with 0).
            mstore(0x40, and(
              add(add(end, iszero(add(length, mload(_preBytes)))), 31),
              not(31) // Round down to the nearest 32 bytes.
            ))
        }

        return tempBytes;
    }

    function concatStorage(bytes storage _preBytes, bytes memory _postBytes) internal {
        assembly {
            // Read the first 32 bytes of _preBytes storage, which is the length
            // of the array. (We don't need to use the offset into the slot
            // because arrays use the entire slot.)
            let fslot := sload(_preBytes.slot)
            // Arrays of 31 bytes or less have an even value in their slot,
            // while longer arrays have an odd value. The actual length is
            // the slot divided by two for odd values, and the lowest order
            // byte divided by two for even values.
            // If the slot is even, bitwise and the slot with 255 and divide by
            // two to get the length. If the slot is odd, bitwise and the slot
            // with -1 and divide by two.
            let slength := div(and(fslot, sub(mul(0x100, iszero(and(fslot, 1))), 1)), 2)
            let mlength := mload(_postBytes)
            let newlength := add(slength, mlength)
            // slength can contain both the length and contents of the array
            // if length < 32 bytes so let's prepare for that
            // v. http://solidity.readthedocs.io/en/latest/miscellaneous.html#layout-of-state-variables-in-storage
            switch add(lt(slength, 32), lt(newlength, 32))
            case 2 {
                // Since the new array still fits in the slot, we just need to
                // update the contents of the slot.
                // uint256(bytes_storage) = uint256(bytes_storage) + uint256(bytes_memory) + new_length
                sstore(
                    _preBytes.slot,
                    // all the modifications to the slot are inside this
                    // next block
                    add(
                        // we can just add to the slot contents because the
                        // bytes we want to change are the LSBs
                        fslot,
                        add(
                            mul(
                                div(
                                    // load the bytes from memory
                                    mload(add(_postBytes, 0x20)),
                                    // zero all bytes to the right
                                    exp(0x100, sub(32, mlength))
                                ),
                                // and now shift left the number of bytes to
                                // leave space for the length in the slot
                                exp(0x100, sub(32, newlength))
                            ),
                            // increase length by the double of the memory
                            // bytes length
                            mul(mlength, 2)
                        )
                    )
                )
            }
            case 1 {
                // The stored value fits in the slot, but the combined value
                // will exceed it.
                // get the keccak hash to get the contents of the array
                mstore(0x0, _preBytes.slot)
                let sc := add(keccak256(0x0, 0x20), div(slength, 32))

                // save new length
                sstore(_preBytes.slot, add(mul(newlength, 2), 1))

                // The contents of the _postBytes array start 32 bytes into
                // the structure. Our first read should obtain the `submod`
                // bytes that can fit into the unused space in the last word
                // of the stored array. To get this, we read 32 bytes starting
                // from `submod`, so the data we read overlaps with the array
                // contents by `submod` bytes. Masking the lowest-order
                // `submod` bytes allows us to add that value directly to the
                // stored value.

                let submod := sub(32, slength)
                let mc := add(_postBytes, submod)
                let end := add(_postBytes, mlength)
                let mask := sub(exp(0x100, submod), 1)

                sstore(
                    sc,
                    add(
                        and(
                            fslot,
                            0xffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff00
                        ),
                        and(mload(mc), mask)
                    )
                )

                for {
                    mc := add(mc, 0x20)
                    sc := add(sc, 1)
                } lt(mc, end) {
                    sc := add(sc, 1)
                    mc := add(mc, 0x20)
                } {
                    sstore(sc, mload(mc))
                }

                mask := exp(0x100, sub(mc, end))

                sstore(sc, mul(div(mload(mc), mask), mask))
            }
            default {
                // get the keccak hash to get the contents of the array
                mstore(0x0, _preBytes.slot)
                // Start copying to the last used word of the stored array.
                let sc := add(keccak256(0x0, 0x20), div(slength, 32))

                // save new length
                sstore(_preBytes.slot, add(mul(newlength, 2), 1))

                // Copy over the first `submod` bytes of the new data as in
                // case 1 above.
                let slengthmod := mod(slength, 32)
                let mlengthmod := mod(mlength, 32)
                let submod := sub(32, slengthmod)
                let mc := add(_postBytes, submod)
                let end := add(_postBytes, mlength)
                let mask := sub(exp(0x100, submod), 1)

                sstore(sc, add(sload(sc), and(mload(mc), mask)))

                for {
                    sc := add(sc, 1)
                    mc := add(mc, 0x20)
                } lt(mc, end) {
                    sc := add(sc, 1)
                    mc := add(mc, 0x20)
                } {
                    sstore(sc, mload(mc))
                }

                mask := exp(0x100, sub(mc, end))

                sstore(sc, mul(div(mload(mc), mask), mask))
            }
        }
    }

    function slice(
        bytes memory _bytes,
        uint256 _start,
        uint256 _length
    )
        internal
        pure
        returns (bytes memory)
    {
        // We're using the unchecked block below because otherwise execution ends 
        // with the native overflow error code.
        unchecked {
            require(_length + 31 >= _length, "slice_overflow");
        }
        require(_bytes.length >= _start + _length, "slice_outOfBounds");

        bytes memory tempBytes;

        assembly {
            switch iszero(_length)
            case 0 {
                // Get a location of some free memory and store it in tempBytes as
                // Solidity does for memory variables.
                tempBytes := mload(0x40)

                // The first word of the slice result is potentially a partial
                // word read from the original array. To read it, we calculate
                // the length of that partial word and start copying that many
                // bytes into the array. The first word we copy will start with
                // data we don't care about, but the last `lengthmod` bytes will
                // land at the beginning of the contents of the new array. When
                // we're done copying, we overwrite the full first word with
                // the actual length of the slice.
                let lengthmod := and(_length, 31)

                // The multiplication in the next line is necessary
                // because when slicing multiples of 32 bytes (lengthmod == 0)
                // the following copy loop was copying the origin's length
                // and then ending prematurely not copying everything it should.
                let mc := add(add(tempBytes, lengthmod), mul(0x20, iszero(lengthmod)))
                let end := add(mc, _length)

                for {
                    // The multiplication in the next line has the same exact purpose
                    // as the one above.
                    let cc := add(add(add(_bytes, lengthmod), mul(0x20, iszero(lengthmod))), _start)
                } lt(mc, end) {
                    mc := add(mc, 0x20)
                    cc := add(cc, 0x20)
                } {
                    mstore(mc, mload(cc))
                }

                mstore(tempBytes, _length)

                //update free-memory pointer
                //allocating the array padded to 32 bytes like the compiler does now
                mstore(0x40, and(add(mc, 31), not(31)))
            }
            //if we want a zero-length slice let's just return a zero-length array
            default {
                tempBytes := mload(0x40)
                //zero out the 32 bytes slice we are about to return
                //we need to do it because Solidity does not garbage collect
                mstore(tempBytes, 0)

                mstore(0x40, add(tempBytes, 0x20))
            }
        }

        return tempBytes;
    }

    function toAddress(bytes memory _bytes, uint256 _start) internal pure returns (address) {
        require(_bytes.length >= _start + 20, "toAddress_outOfBounds");
        address tempAddress;

        assembly {
            tempAddress := div(mload(add(add(_bytes, 0x20), _start)), 0x1000000000000000000000000)
        }

        return tempAddress;
    }

    function toUint8(bytes memory _bytes, uint256 _start) internal pure returns (uint8) {
        require(_bytes.length >= _start + 1 , "toUint8_outOfBounds");
        uint8 tempUint;

        assembly {
            tempUint := mload(add(add(_bytes, 0x1), _start))
        }

        return tempUint;
    }

    function toUint16(bytes memory _bytes, uint256 _start) internal pure returns (uint16) {
        require(_bytes.length >= _start + 2, "toUint16_outOfBounds");
        uint16 tempUint;

        assembly {
            tempUint := mload(add(add(_bytes, 0x2), _start))
        }

        return tempUint;
    }

    function toUint32(bytes memory _bytes, uint256 _start) internal pure returns (uint32) {
        require(_bytes.length >= _start + 4, "toUint32_outOfBounds");
        uint32 tempUint;

        assembly {
            tempUint := mload(add(add(_bytes, 0x4), _start))
        }

        return tempUint;
    }

    function toUint64(bytes memory _bytes, uint256 _start) internal pure returns (uint64) {
        require(_bytes.length >= _start + 8, "toUint64_outOfBounds");
        uint64 tempUint;

        assembly {
            tempUint := mload(add(add(_bytes, 0x8), _start))
        }

        return tempUint;
    }

    function toUint96(bytes memory _bytes, uint256 _start) internal pure returns (uint96) {
        require(_bytes.length >= _start + 12, "toUint96_outOfBounds");
        uint96 tempUint;

        assembly {
            tempUint := mload(add(add(_bytes, 0xc), _start))
        }

        return tempUint;
    }

    function toUint128(bytes memory _bytes, uint256 _start) internal pure returns (uint128) {
        require(_bytes.length >= _start + 16, "toUint128_outOfBounds");
        uint128 tempUint;

        assembly {
            tempUint := mload(add(add(_bytes, 0x10), _start))
        }

        return tempUint;
    }

    function toUint256(bytes memory _bytes, uint256 _start) internal pure returns (uint256) {
        require(_bytes.length >= _start + 32, "toUint256_outOfBounds");
        uint256 tempUint;

        assembly {
            tempUint := mload(add(add(_bytes, 0x20), _start))
        }

        return tempUint;
    }

    function toBytes32(bytes memory _bytes, uint256 _start) internal pure returns (bytes32) {
        require(_bytes.length >= _start + 32, "toBytes32_outOfBounds");
        bytes32 tempBytes32;

        assembly {
            tempBytes32 := mload(add(add(_bytes, 0x20), _start))
        }

        return tempBytes32;
    }

    function equal(bytes memory _preBytes, bytes memory _postBytes) internal pure returns (bool) {
        bool success = true;

        assembly {
            let length := mload(_preBytes)

            // if lengths don't match the arrays are not equal
            switch eq(length, mload(_postBytes))
            case 1 {
                // cb is a circuit breaker in the for loop since there's
                //  no said feature for inline assembly loops
                // cb = 1 - don't breaker
                // cb = 0 - break
                let cb := 1

                let mc := add(_preBytes, 0x20)
                let end := add(mc, length)

                for {
                    let cc := add(_postBytes, 0x20)
                // the next line is the loop condition:
                // while(uint256(mc < end) + cb == 2)
                } eq(add(lt(mc, end), cb), 2) {
                    mc := add(mc, 0x20)
                    cc := add(cc, 0x20)
                } {
                    // if any of these checks fails then arrays are not equal
                    if iszero(eq(mload(mc), mload(cc))) {
                        // unsuccess:
                        success := 0
                        cb := 0
                    }
                }
            }
            default {
                // unsuccess:
                success := 0
            }
        }

        return success;
    }

    function equalStorage(
        bytes storage _preBytes,
        bytes memory _postBytes
    )
        internal
        view
        returns (bool)
    {
        bool success = true;

        assembly {
            // we know _preBytes_offset is 0
            let fslot := sload(_preBytes.slot)
            // Decode the length of the stored array like in concatStorage().
            let slength := div(and(fslot, sub(mul(0x100, iszero(and(fslot, 1))), 1)), 2)
            let mlength := mload(_postBytes)

            // if lengths don't match the arrays are not equal
            switch eq(slength, mlength)
            case 1 {
                // slength can contain both the length and contents of the array
                // if length < 32 bytes so let's prepare for that
                // v. http://solidity.readthedocs.io/en/latest/miscellaneous.html#layout-of-state-variables-in-storage
                if iszero(iszero(slength)) {
                    switch lt(slength, 32)
                    case 1 {
                        // blank the last byte which is the length
                        fslot := mul(div(fslot, 0x100), 0x100)

                        if iszero(eq(fslot, mload(add(_postBytes, 0x20)))) {
                            // unsuccess:
                            success := 0
                        }
                    }
                    default {
                        // cb is a circuit breaker in the for loop since there's
                        //  no said feature for inline assembly loops
                        // cb = 1 - don't breaker
                        // cb = 0 - break
                        let cb := 1

                        // get the keccak hash to get the contents of the array
                        mstore(0x0, _preBytes.slot)
                        let sc := keccak256(0x0, 0x20)

                        let mc := add(_postBytes, 0x20)
                        let end := add(mc, mlength)

                        // the next line is the loop condition:
                        // while(uint256(mc < end) + cb == 2)
                        for {} eq(add(lt(mc, end), cb), 2) {
                            sc := add(sc, 1)
                            mc := add(mc, 0x20)
                        } {
                            if iszero(eq(sload(sc), mload(mc))) {
                                // unsuccess:
                                success := 0
                                cb := 0
                            }
                        }
                    }
                }
            }
            default {
                // unsuccess:
                success := 0
            }
        }

        return success;
    }
}

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


interface IBridge {

    enum State { 
        Active, // data send and receive possible
        Inactive, // data send and receive impossible
        Limited // only data receive possible
    }

    struct SendParams {
        /// @param requestId unique request ID
        bytes32 requestId;
        /// @param data call data
        bytes data;
        /// @param to receiver contract address
        bytes32 to;
        /// @param chainIdTo destination chain ID
        uint64 chainIdTo;
    }

    function sendV3(
        SendParams calldata params,
        address sender,
        uint256 nonce,
        bytes memory options
    ) external payable;

    function estimateGasFee(
        SendParams memory  params,
        address sender,
        bytes memory options
    ) external view returns (uint256);
}

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

import "../interfaces/IBridge.sol";

interface IBridgeV3 is IBridge {
    
    struct ReceiveParams {
        /// @param blockHeader block header serialization
        bytes blockHeader;
        /// @param merkleProof OracleRequest transaction payload and its Merkle audit path
        bytes merkleProof;
        /// @param votersPubKey aggregated public key of the old epoch participants, who voted for the block
        bytes votersPubKey;
        /// @param votersSignature aggregated signature of the old epoch participants, who voted for the block
        bytes votersSignature;
        /// @param votersMask bitmask of epoch participants, who voted, among all participants
        uint256 votersMask;
    }

    enum ChainType {
        DEFAULT,
        ARBITRUM,
        OPTIMISM
    }

    function receiveV3(ReceiveParams[] calldata params) external returns (bool);

}

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


interface IOracle {

    function estimateFeeByChain(
        uint64 chainIdTo,
        uint256 callDataLength,
        uint256 gasExecute
    ) external view returns (uint256 fee, uint256 priceRatio);
}

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


interface IReceiver {
    function receiveData(bytes32 sender, uint64 chainIdFrom, bytes memory receivedData, bytes32 requestId) external;
    function receiveHash(bytes32 sender, uint64 chainIdFrom, bytes32 receivedHash, bytes32 requestId) external;
}

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

import "../utils/Bls.sol";
import "../utils/Utils.sol";
import "../utils/ZeroCopySource.sol";

library Block {

    function txRootHash(bytes calldata payload) internal pure returns (bytes32 txRootHash_) {
        txRootHash_ = Utils.bytesToBytes32(payload[72:104]);
    }

    function epochHash(bytes calldata payload) internal pure returns (bytes32 epochHash_) {
        epochHash_ = Utils.bytesToBytes32(payload[40:72]);
    }

    function decodeRequest(bytes memory payload) internal pure returns (
        bytes32 requestId,
        bytes memory data,
        address to,
        uint64 chainIdTo
    ) {
        uint256 off = 0;
        (requestId, off) = ZeroCopySource.NextHash(payload, off);
        (chainIdTo, off) = ZeroCopySource.NextUint64(payload, off);
        (to, off) = ZeroCopySource.NextAddress(payload, off);
        (data, off) = ZeroCopySource.NextVarBytes(payload, off);
    }

    function decodeEpochUpdate(bytes memory payload) internal pure returns (
        uint64 newEpochVersion,
        uint32 newEpochNum,
        bytes memory newKey,
        uint8 newEpochParticipantsCount
    ) {
        uint256 off = 0;
        (newEpochVersion, off) = ZeroCopySource.NextUint64(payload, off);
        (newEpochNum, off) = ZeroCopySource.NextUint32(payload, off);
        (newEpochParticipantsCount, off) = ZeroCopySource.NextUint8(payload, off);
        (newKey, off) = ZeroCopySource.NextVarBytes(payload, off);
    }

    function verify(
        Bls.Epoch memory epoch,
        bytes calldata blockHeader,
        bytes calldata votersPubKey,
        bytes calldata votersSignature,
        uint256 votersMask
    ) internal view {
        require(popcnt(votersMask) > (uint256(epoch.participantsCount) * 2) / 3, "Block: not enough participants");
        require(epoch.participantsCount == 255 || votersMask < (1 << epoch.participantsCount), "Block: bitmask too big");
        require(
            Bls.verifyMultisig(epoch, votersPubKey, blockHeader, votersSignature, votersMask),
            "Block: multisig mismatch"
        );
    }

    function popcnt(uint256 mask) internal pure returns (uint256 cnt) {
        cnt = 0;
        while (mask != 0) {
            mask = mask & (mask - 1);
            cnt++;
        }
    }
}

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

import "./ModUtils.sol";

/**
 * @title Verify BLS Threshold Signed values.
 *
 * Much of the code in this file is derived from here:
 * https://github.com/ConsenSys/gpact/blob/main/common/common/src/main/solidity/BlsSignatureVerification.sol
 * https://github.com/ConsenSys/gpact/blob/main/contracts/contracts/src/common/BlsSignatureVerification.sol
 */
library Bls {
    using ModUtils for uint256;

    struct E1Point {
        uint256 x;
        uint256 y;
    }

    /**
     * @dev Note that the ordering of the elements in each array needs to be the reverse of what you would
     * normally have, to match the ordering expected by the precompile.
     */
    struct E2Point {
        uint256[2] x;
        uint256[2] y;
    }

    /**
     * @dev P is a prime over which we form a basic field;
     * taken from go-ethereum/crypto/bn256/cloudflare/constants.go.
     */
    uint256 constant P = 21888242871839275222246405745257275088696311157297823662689037894645226208583;

    struct Epoch {
        /// @param sum of all participant public keys
        E2Point publicKey;
        /// @param // sum of H(Pub, i) hashes of all participants indexes
        E1Point precomputedSum;
        /// @param // participants count contributed to the epochKey
        uint8 participantsCount;
        /// @param epoch number
        uint32 epochNum;
        /// @param epoch hash
        bytes32 epochHash;
    }

    /**
     * @dev Tests that epoch is set or zero.
     */
    function isSet(Epoch memory epoch) internal pure returns (bool) {
        return epoch.publicKey.x[0] != 0 || epoch.publicKey.x[1] != 0;
    }

    /**
     * @dev Reset the epoch.
     */
    function reset(Epoch storage epoch) internal {
        epoch.publicKey.x[0] = 0;
        epoch.publicKey.x[1] = 0;
        epoch.precomputedSum.x = 0;
        epoch.epochHash = 0;
        epoch.participantsCount = 0;
    }

    /**
     * @dev Update epoch and precompute epoch sum as if all participants signed.
     *
     * @param epoch_ current epoch to update;
     * @param epochPublicKey sum of all participant public keys;
     * @param epochParticipantsCount number of participants;
     * @param epochNum number of participants;
     * @param epochHash epoch hash.
     */
    function update(
        Epoch storage epoch_,
        bytes memory epochPublicKey,
        uint8 epochParticipantsCount,
        uint32 epochNum,
        bytes32 epochHash
    ) internal {
        E2Point memory pub = decodeE2Point(epochPublicKey);
        E1Point memory sum = E1Point(0, 0);
        uint256 index = 0;
        bytes memory buf = abi.encodePacked(pub.x, pub.y, index);
        while (index < epochParticipantsCount) {
            assembly {
                mstore(add(buf, 160), index)
            } // overwrite index field, same as buf[128] = index
            sum = addCurveE1(sum, hashToCurveE1(buf));
            index++;
        }
        epoch_.publicKey = pub;
        epoch_.precomputedSum = sum;
        epoch_.participantsCount = epochParticipantsCount;
        epoch_.epochNum = epochNum;
        epoch_.epochHash = epochHash;
    }

    /**
     * @dev Checks if the BLS multisignature is valid in the current epoch.
     *
     * @param epoch_ current epoch;
     * @param partPublicKey Sum of participated public keys;
     * @param message Message that was signed;
     * @param partSignature Signature over the message;
     * @param signersBitmask Bitmask of participants in this signature;
     * @return True if the message was correctly signed by the given participants.
     */
    function verifyMultisig(
        Epoch memory epoch_,
        bytes memory partPublicKey,
        bytes memory message,
        bytes memory partSignature,
        uint256 signersBitmask
    ) internal view returns (bool) {
        E1Point memory sum = epoch_.precomputedSum;
        uint256 index = 0;
        uint256 mask = 1;
        bytes memory buf = abi.encodePacked(epoch_.publicKey.x, epoch_.publicKey.y, index);
        while (index < epoch_.participantsCount) {
            if (signersBitmask & mask == 0) {
                assembly {
                    mstore(add(buf, 160), index)
                } // overwrite index field, same as buf[128] = index
                sum = addCurveE1(sum, negate(hashToCurveE1(buf)));
            }
            mask <<= 1;
            index++;
        }

        E1Point[] memory e1points = new E1Point[](3);
        E2Point[] memory e2points = new E2Point[](3);
        e1points[0] = negate(decodeE1Point(partSignature));
        e1points[1] = hashToCurveE1(abi.encodePacked(epoch_.publicKey.x, epoch_.publicKey.y, message));
        e1points[2] = sum;
        e2points[0] = G2();
        e2points[1] = decodeE2Point(partPublicKey);
        e2points[2] = epoch_.publicKey;
        return pairing(e1points, e2points);
    }

    /**
     * @return The generator of E1.
     */
    function G1() private pure returns (E1Point memory) {
        return E1Point(1, 2);
    }

    /**
     * @return The generator of E2.
     */
    function G2() private pure returns (E2Point memory) {
        return E2Point({
            x: [
                11559732032986387107991004021392285783925812861821192530917403151452391805634,
                10857046999023057135944570762232829481370756359578518086990519993285655852781
            ],
            y: [
                4082367875863433681332203403145435568316851327593401208105741076214120093531,
                8495653923123431417604973247489272438418190587263600148770280649306958101930
            ]
        });
    }

    /**
     * Negate a point: Assuming the point isn't at infinity, the negation is same x value with -y.
     *
     * @dev Negates a point in E1;
     * @param _point Point to negate;
     * @return The negated point.
     */
    function negate(E1Point memory _point) private pure returns (E1Point memory) {
        if (isAtInfinity(_point)) {
            return E1Point(0, 0);
        }
        return E1Point(_point.x, P - (_point.y % P));
    }

    /**
     * Computes the pairing check e(p1[0], p2[0]) *  .... * e(p1[n], p2[n]) == 1
     *
     * @param _e1points List of points in E1;
     * @param _e2points List of points in E2;
     * @return True if pairing check succeeds.
     */
    function pairing(E1Point[] memory _e1points, E2Point[] memory _e2points) private view returns (bool) {
        require(_e1points.length == _e2points.length, "Bls: point count mismatch");

        uint256 elements = _e1points.length;
        uint256 inputSize = elements * 6;
        uint256[] memory input = new uint256[](inputSize);

        for (uint256 i = 0; i < elements; i++) {
            input[i * 6 + 0] = _e1points[i].x;
            input[i * 6 + 1] = _e1points[i].y;
            input[i * 6 + 2] = _e2points[i].x[0];
            input[i * 6 + 3] = _e2points[i].x[1];
            input[i * 6 + 4] = _e2points[i].y[0];
            input[i * 6 + 5] = _e2points[i].y[1];
        }

        uint256[1] memory out;
        bool success;
        assembly {
            // Start at memory offset 0x20 rather than 0 as input is a variable length array.
            // Location 0 is the length field.
            success := staticcall(sub(gas(), 2000), 8, add(input, 0x20), mul(inputSize, 0x20), out, 0x20)
        }
        // The pairing operation will fail if the input data isn't the correct size (this won't happen
        // given the code above), or if one of the points isn't on the curve.
        require(success, "Bls: pairing operation failed");
        return out[0] != 0;
    }

    /**
     * @dev Checks if the point is the point at infinity.
     *
     * @param _point a point on E1;
     * @return true if the point is the point at infinity.
     */
    function isAtInfinity(E1Point memory _point) private pure returns (bool) {
        return (_point.x == 0 && _point.y == 0);
    }

    /**
     * @dev Hash a byte array message, m, and map it deterministically to a point on G1.
     * Note that this approach was chosen for its simplicity /
     * lower gas cost on the EVM, rather than good distribution of points on G1.
     */
    function hashToCurveE1(bytes memory m) internal view returns (E1Point memory) {
        bytes32 h = sha256(m);
        uint256 x = uint256(h) % P;
        uint256 y;

        while (true) {
            y = YFromX(x);
            if (y > 0) {
                return E1Point(x, y);
            }
            x += 1;
        }
        revert("hashToCurveE1: unreachable end point");
    }

    /**
     * @dev g1YFromX computes a Y value for a G1 point based on an X value.
     * This computation is simply evaluating the curve equation for Y on a given X,
     * and allows a point on the curve to be represented by just an X value + a sign bit.
     */
    function YFromX(uint256 x) internal view returns (uint256) {
        return ((x.modExp(3, P) + 3) % P).modSqrt(P);
    }

    /**
     * @dev return the sum of two points of G1.
     */
    function addCurveE1(E1Point memory _p1, E1Point memory _p2) internal view returns (E1Point memory res) {
        uint256[4] memory input;
        input[0] = _p1.x;
        input[1] = _p1.y;
        input[2] = _p2.x;
        input[3] = _p2.y;
        bool success;
        assembly {
            success := staticcall(sub(gas(), 2000), 6, input, 0x80, res, 0x40)
        }
        require(success, "Bls: add points failed");
    }

    function decodeE1Point(bytes memory _sig) internal pure returns (E1Point memory signature) {
        uint256 sigx;
        uint256 sigy;
        assembly {
            sigx := mload(add(_sig, 0x20))
            sigy := mload(add(_sig, 0x40))
        }
        signature.x = sigx;
        signature.y = sigy;
    }

    function decodeE2Point(bytes memory _pubKey) internal pure returns (E2Point memory pubKey) {
        uint256 x1;
        uint256 x2;
        uint256 y1;
        uint256 y2;
        assembly {
            x1 := mload(add(_pubKey, 0x20))
            x2 := mload(add(_pubKey, 0x40))
            y1 := mload(add(_pubKey, 0x60))
            y2 := mload(add(_pubKey, 0x80))
        }
        pubKey.x[0] = x1;
        pubKey.x[1] = x2;
        pubKey.y[0] = y1;
        pubKey.y[1] = y2;
    }
}

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

import "./ZeroCopySource.sol";

library Merkle {
    /** @notice Do hash leaf as the multi-chain does.
     *
     *  @param data_ Data in bytes format;
     *  @return result Hashed value in bytes32 format.
     */
    function hashLeaf(bytes memory data_) internal pure returns (bytes32 result) {
        result = sha256(abi.encodePacked(uint8(0x0), data_));
    }

    /** @notice Do hash children as the multi-chain does.
     *
     *  @param l_ Left node;
     *  @param r_ Right node;
     *  @return result Hashed value in bytes32 format.
     */
    function hashChildren(bytes32 l_, bytes32 r_) internal pure returns (bytes32 result) {
        result = sha256(abi.encodePacked(bytes1(0x01), l_, r_));
    }

    /** @notice Verify merkle proove.
     *
     *  @param auditPath_ Merkle path;
     *  @param root_ Merkle tree root;
     *  @return The verified value included in auditPath_.
     */
    function prove(bytes memory auditPath_, bytes32 root_) internal pure returns (bytes memory) {
        uint256 off = 0;
        bytes memory value;
        (value, off) = ZeroCopySource.NextVarBytes(auditPath_, off);

        bytes32 hash = hashLeaf(value);
        uint256 size = (auditPath_.length - off) / 33; // 33 = sizeof(uint256) + 1
        bytes32 nodeHash;
        uint8 pos;
        for (uint256 i = 0; i < size; i++) {
            (pos, off) = ZeroCopySource.NextUint8(auditPath_, off);
            (nodeHash, off) = ZeroCopySource.NextHash(auditPath_, off);
            if (pos == 0x00) {
                hash = hashChildren(nodeHash, hash);
            } else if (pos == 0x01) {
                hash = hashChildren(hash, nodeHash);
            } else {
                revert("Merkle: prove eod");
            }
        }
        require(hash == root_, "Merkle: prove root");
        return value;
    }
}

// SPDX-License-Identifier: MIT
pragma solidity ^0.8.20;

library ModUtils {
    /**
     * @dev Wrap the modular exponent pre-compile introduced in Byzantium.
     * Returns base^exponent mod p.
     */
    function modExp(
        uint256 base,
        uint256 exponent,
        uint256 p
    ) internal view returns (uint256 o) {
        /* solium-disable-next-line */
        assembly {
            // Args for the precompile: [<length_of_BASE> <length_of_EXPONENT>
            // <length_of_MODULUS> <BASE> <EXPONENT> <MODULUS>]
            let output := mload(0x40)
            let args := add(output, 0x20)
            mstore(args, 0x20)
            mstore(add(args, 0x20), 0x20)
            mstore(add(args, 0x40), 0x20)
            mstore(add(args, 0x60), base)
            mstore(add(args, 0x80), exponent)
            mstore(add(args, 0xa0), p)

            // 0x05 is the modular exponent contract address
            if iszero(staticcall(not(0), 0x05, args, 0xc0, output, 0x20)) {
                revert(0, 0)
            }
            o := mload(output)
        }
    }

    /**
     * @dev Calculates and returns the square root of a mod p if such a square
     * root exists. The modulus p must be an odd prime. If a square root does
     * not exist, function returns 0.
     */
    function modSqrt(uint256 a, uint256 p) internal view returns (uint256) {
        if (legendre(a, p) != 1) {
            return 0;
        }

        if (a == 0) {
            return 0;
        }

        if (p % 4 == 3) {
            return modExp(a, (p + 1) / 4, p);
        }

        uint256 s = p - 1;
        uint256 e = 0;

        while (s % 2 == 0) {
            s = s / 2;
            e = e + 1;
        }

        // Note the smaller int- finding n with Legendre symbol or -1
        // should be quick
        uint256 n = 2;
        while (legendre(n, p) != -1) {
            n = n + 1;
        }

        uint256 x = modExp(a, (s + 1) / 2, p);
        uint256 b = modExp(a, s, p);
        uint256 g = modExp(n, s, p);
        uint256 r = e;
        uint256 gs = 0;
        uint256 m = 0;
        uint256 t = b;

        while (true) {
            t = b;
            m = 0;

            for (m = 0; m < r; m++) {
                if (t == 1) {
                    break;
                }
                t = modExp(t, 2, p);
            }

            if (m == 0) {
                return x;
            }

            gs = modExp(g, uint256(2)**(r - m - 1), p);
            g = (gs * gs) % p;
            x = (x * gs) % p;
            b = (b * g) % p;
            r = m;
        }
        revert("modSqrt: unreachable end point");
    }

    /**
     * @dev Calculates the Legendre symbol of the given a mod p.
     * @return Returns 1 if a is a quadratic residue mod p, -1 if it is
     * a non-quadratic residue, and 0 if a is 0.
     */
    function legendre(uint256 a, uint256 p) internal view returns (int256) {
        uint256 raised = modExp(a, (p - 1) / uint256(2), p);

        if (raised == 0 || raised == 1) {
            return int256(raised);
        } else if (raised == p - 1) {
            return -1;
        }

        revert("Failed to calculate legendre.");
    }
}

// SPDX-License-Identifier: MIT
pragma solidity ^0.8.20;

import "solidity-bytes-utils/contracts/BytesLib.sol";

library Utils {
    /* @notice      Convert the bytes array to bytes32 type, the bytes array length must be 32
     *  @param _bs   Source bytes array
     *  @return      bytes32
     */
    function bytesToBytes32(bytes memory _bs) internal pure returns (bytes32 value) {
        require(_bs.length == 32, "bytes length is not 32.");
        assembly {
            // load 32 bytes from memory starting from position _bs + 0x20 since the first 0x20 bytes stores _bs length
            value := mload(add(_bs, 0x20))
        }
    }

    /* @notice      Convert bytes to uint256
     *  @param _b    Source bytes should have length of 32
     *  @return      uint256
     */
    function bytesToUint256(bytes memory _bs) internal pure returns (uint256 value) {
        require(_bs.length == 32, "bytes length is not 32.");
        assembly {
            // load 32 bytes from memory starting from position _bs + 32
            value := mload(add(_bs, 0x20))
        }
        require(value <= 0x7fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff, "Value exceeds the range");
    }

    /* @notice      Convert uint256 to bytes
     *  @param _b    uint256 that needs to be converted
     *  @return      bytes
     */
    function uint256ToBytes(uint256 _value) internal pure returns (bytes memory bs) {
        require(
            _value <= 0x7fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff,
            "Value exceeds the range"
        );
        assembly {
            // Get a location of some free memory and store it in result as
            // Solidity does for memory variables.
            bs := mload(0x40)
            // Put 0x20 at the first word, the length of bytes for uint256 value
            mstore(bs, 0x20)
            //In the next word, put value in bytes format to the next 32 bytes
            mstore(add(bs, 0x20), _value)
            // Update the free-memory pointer by padding our last write location to 32 bytes
            mstore(0x40, add(bs, 0x40))
        }
    }

    /* @notice      Convert bytes to address
     *  @param _bs   Source bytes: bytes length must be 20
     *  @return      Converted address from source bytes
     */
    function bytesToAddress(bytes memory _bs) internal pure returns (address addr) {
        require(_bs.length == 20, "bytes length does not match address");
        assembly {
            // for _bs, first word store _bs.length, second word store _bs.value
            // load 32 bytes from mem[_bs+20], convert it into Uint160, meaning we take last 20 bytes as addr (address).
            addr := mload(add(_bs, 0x14))
        }
    }

    /* @notice      Convert address to bytes
     *  @param _addr Address need to be converted
     *  @return      Converted bytes from address
     */
    function addressToBytes(address _addr) internal pure returns (bytes memory bs) {
        assembly {
            // Get a location of some free memory and store it in result as
            // Solidity does for memory variables.
            bs := mload(0x40)
            // Put 20 (address byte length) at the first word, the length of bytes for uint256 value
            mstore(bs, 0x14)
            // logical shift left _a by 12 bytes, change _a from right-aligned to left-aligned
            mstore(add(bs, 0x20), shl(96, _addr))
            // Update the free-memory pointer by padding our last write location to 32 bytes
            mstore(0x40, add(bs, 0x40))
        }
    }

    /* @notice              Compare if two bytes are equal, which are in storage and memory, seperately
                            Refer from https://github.com/summa-tx/bitcoin-spv/blob/master/solidity/contracts/BytesLib.sol#L368
    *  @param _preBytes     The bytes stored in storage
    *  @param _postBytes    The bytes stored in memory
    *  @return              Bool type indicating if they are equal
    */
    function equalStorage(bytes storage _preBytes, bytes memory _postBytes) internal view returns (bool) {
        bool success = true;

        assembly {
            // we know _preBytes_offset is 0
            let fslot := sload(_preBytes.slot)
            // Arrays of 31 bytes or less have an even value in their slot,
            // while longer arrays have an odd value. The actual length is
            // the slot divided by two for odd values, and the lowest order
            // byte divided by two for even values.
            // If the slot is even, bitwise and the slot with 255 and divide by
            // two to get the length. If the slot is odd, bitwise and the slot
            // with -1 and divide by two.
            let slength := div(and(fslot, sub(mul(0x100, iszero(and(fslot, 1))), 1)), 2)
            let mlength := mload(_postBytes)

            // if lengths don't match the arrays are not equal
            switch eq(slength, mlength)
            case 1 {
                // fslot can contain both the length and contents of the array
                // if slength < 32 bytes so let's prepare for that
                // v. http://solidity.readthedocs.io/en/latest/miscellaneous.html#layout-of-state-variables-in-storage
                // slength != 0
                if iszero(iszero(slength)) {
                    switch lt(slength, 32)
                    case 1 {
                        // blank the last byte which is the length
                        fslot := mul(div(fslot, 0x100), 0x100)

                        if iszero(eq(fslot, mload(add(_postBytes, 0x20)))) {
                            // unsuccess:
                            success := 0
                        }
                    }
                    default {
                        // cb is a circuit breaker in the for loop since there's
                        //  no said feature for inline assembly loops
                        // cb = 1 - don't breaker
                        // cb = 0 - break
                        let cb := 1

                        // get the keccak hash to get the contents of the array
                        mstore(0x0, _preBytes.slot)
                        let sc := keccak256(0x0, 0x20)

                        let mc := add(_postBytes, 0x20)
                        let end := add(mc, mlength)

                        // the next line is the loop condition:
                        // while(uint(mc < end) + cb == 2)
                        for {

                        } eq(add(lt(mc, end), cb), 2) {
                            sc := add(sc, 1)
                            mc := add(mc, 0x20)
                        } {
                            if iszero(eq(sload(sc), mload(mc))) {
                                // unsuccess:
                                success := 0
                                cb := 0
                            }
                        }
                    }
                }
            }
            default {
                // unsuccess:
                success := 0
            }
        }

        return success;
    }

    /* @notice              Slice the _bytes from _start index till the result has length of _length
                            Refer from https://github.com/summa-tx/bitcoin-spv/blob/master/solidity/contracts/BytesLib.sol#L246
    *  @param _bytes        The original bytes needs to be sliced
    *  @param _start        The index of _bytes for the start of sliced bytes
    *  @param _length       The index of _bytes for the end of sliced bytes
    *  @return              The sliced bytes
    */
    function slice(
        bytes memory _bytes,
        uint256 _start,
        uint256 _length
    ) internal pure returns (bytes memory) {
        require(_bytes.length >= (_start + _length));

        bytes memory tempBytes;

        assembly {
            switch iszero(_length)
            case 0 {
                // Get a location of some free memory and store it in tempBytes as
                // Solidity does for memory variables.
                tempBytes := mload(0x40)

                // The first word of the slice result is potentially a partial
                // word read from the original array. To read it, we calculate
                // the length of that partial word and start copying that many
                // bytes into the array. The first word we copy will start with
                // data we don't care about, but the last `lengthmod` bytes will
                // land at the beginning of the contents of the new array. When
                // we're done copying, we overwrite the full first word with
                // the actual length of the slice.
                // lengthmod <= _length % 32
                let lengthmod := and(_length, 31)

                // The multiplication in the next line is necessary
                // because when slicing multiples of 32 bytes (lengthmod == 0)
                // the following copy loop was copying the origin's length
                // and then ending prematurely not copying everything it should.
                let mc := add(add(tempBytes, lengthmod), mul(0x20, iszero(lengthmod)))
                let end := add(mc, _length)

                for {
                    // The multiplication in the next line has the same exact purpose
                    // as the one above.
                    let cc := add(add(add(_bytes, lengthmod), mul(0x20, iszero(lengthmod))), _start)
                } lt(mc, end) {
                    mc := add(mc, 0x20)
                    cc := add(cc, 0x20)
                } {
                    mstore(mc, mload(cc))
                }

                mstore(tempBytes, _length)

                //update free-memory pointer
                //allocating the array padded to 32 bytes like the compiler does now
                mstore(0x40, and(add(mc, 31), not(31)))
            }
            //if we want a zero-length slice let's just return a zero-length array
            default {
                tempBytes := mload(0x40)

                mstore(0x40, add(tempBytes, 0x20))
            }
        }

        return tempBytes;
    }

    /* @notice              Check if the elements number of _signers within _keepers array is no less than _m
     *  @param _keepers      The array consists of serveral address
     *  @param _signers      Some specific addresses to be looked into
     *  @param _m            The number requirement paramter
     *  @return              True means containment, false meansdo do not contain.
     */
    function containMAddresses(
        address[] memory _keepers,
        address[] memory _signers,
        uint256 _m
    ) internal pure returns (bool) {
        uint256 m = 0;
        for (uint256 i = 0; i < _signers.length; i++) {
            for (uint256 j = 0; j < _keepers.length; j++) {
                if (_signers[i] == _keepers[j]) {
                    m++;
                    delete _keepers[j];
                }
            }
        }
        return m >= _m;
    }

    /* @notice              TODO
     *  @param key
     *  @return
     */
    function compressMCPubKey(bytes memory key) internal pure returns (bytes memory newkey) {
        require(key.length >= 67, "key lenggh is too short");
        newkey = slice(key, 0, 35);
        if (uint8(key[66]) % 2 == 0) {
            newkey[2] = 0x02;
        } else {
            newkey[2] = 0x03;
        }
        return newkey;
    }

    /**
     * @dev Returns true if `account` is a contract.
     *      Refer from https://github.com/OpenZeppelin/openzeppelin-contracts/blob/master/contracts/utils/Address.sol#L18
     *
     * This test is non-exhaustive, and there may be false-negatives: during the
     * execution of a contract's constructor, its address will be reported as
     * not containing a contract.
     *
     * IMPORTANT: It is unsafe to assume that an address for which this
     * function returns false is an externally-owned account (EOA) and not a
     * contract.
     */
    function isContract(address account) internal view returns (bool) {
        // This method relies in extcodesize, which returns 0 for contracts in
        // construction, since the code is only stored at the end of the
        // constructor execution.

        // According to EIP-1052, 0x0 is the value returned for not-yet created accounts
        // and 0xc5d2460186f7233c927e7db2dcc703c0e500b653ca82273b7bfad8045d85a470 is returned
        // for accounts without code, i.e. `keccak256('')`
        bytes32 codehash;
        bytes32 accountHash = 0xc5d2460186f7233c927e7db2dcc703c0e500b653ca82273b7bfad8045d85a470;
        // solhint-disable-next-line no-inline-assembly
        assembly {
            codehash := extcodehash(account)
        }
        return (codehash != 0x0 && codehash != accountHash);
    }

    /**
     * @dev Extracts error from the returned data of inter-contract call
     */
    function extractErrorMessage(bytes memory data) internal pure returns (string memory) {
        if (data.length < 68) return "unknown error";
        bytes memory revertData = BytesLib.slice(data, 4, data.length - 4);
        return abi.decode(revertData, (string));
    }
}

// SPDX-License-Identifier: MIT
pragma solidity ^0.8.20;


/**
 * @dev Wrappers over decoding and deserialization operation from bytes into bassic types in Solidity for PolyNetwork cross chain utility.
 *
 * Decode into basic types in Solidity from bytes easily. It's designed to be used
 * for PolyNetwork cross chain application, and the decoding rules on Ethereum chain
 * and the encoding rule on other chains should be consistent, and . Here we
 * follow the underlying deserialization rule with implementation found here:
 * https://github.com/polynetwork/poly/blob/master/common/zero_copy_source.go
 *
 * Using this library instead of the unchecked serialization method can help reduce
 * the risk of serious bugs and handfule, so it's recommended to use it.
 *
 * Please note that risk can be minimized, yet not eliminated.
 */
library ZeroCopySource {
    /* @notice              Read next byte as boolean type starting at offset from buff
     *  @param buff          Source bytes array
     *  @param offset        The position from where we read the boolean value
     *  @return              The the read boolean value and new offset
     */
    function NextBool(bytes memory buff, uint256 offset) internal pure returns (bool, uint256) {
        require(offset + 1 <= buff.length, "Offset exceeds limit");
        // byte === bytes1
        bytes1 v;
        assembly {
            v := mload(add(add(buff, 0x20), offset))
        }
        bool value;
        if (v == 0x01) {
            value = true;
        } else if (v == 0x00) {
            value = false;
        } else {
            revert("NextBool value error");
        }
        return (value, offset + 1);
    }

    /* @notice              Read next byte as uint8 starting at offset from buff
     *  @param buff          Source bytes array
     *  @param offset        The position from where we read the byte value
     *  @return              The read uint8 value and new offset
     */
    function NextUint8(bytes memory buff, uint256 offset) internal pure returns (uint8, uint256) {
        require(offset + 1 <= buff.length && offset < offset + 1, "NextUint8, Offset exceeds maximum");
        uint8 v;
        assembly {
            let tmpbytes := mload(0x40)
            let bvalue := mload(add(add(buff, 0x20), offset))
            mstore8(tmpbytes, byte(0, bvalue))
            mstore(0x40, add(tmpbytes, 0x01))
            v := mload(sub(tmpbytes, 0x1f))
        }
        return (v, offset + 1);
    }

    /* @notice              Read next two bytes as uint16 type starting from offset
     *  @param buff          Source bytes array
     *  @param offset        The position from where we read the uint16 value
     *  @return              The read uint16 value and updated offset
     */
    function NextUint16(bytes memory buff, uint256 offset) internal pure returns (uint16, uint256) {
        require(offset + 2 <= buff.length && offset < offset + 2, "NextUint16, offset exceeds maximum");

        uint16 v;
        assembly {
            let tmpbytes := mload(0x40)
            let bvalue := mload(add(add(buff, 0x20), offset))
            mstore8(tmpbytes, byte(0x01, bvalue))
            mstore8(add(tmpbytes, 0x01), byte(0, bvalue))
            mstore(0x40, add(tmpbytes, 0x02))
            v := mload(sub(tmpbytes, 0x1e))
        }
        return (v, offset + 2);
    }

    /* @notice              Read next four bytes as uint32 type starting from offset
     *  @param buff          Source bytes array
     *  @param offset        The position from where we read the uint32 value
     *  @return              The read uint32 value and updated offset
     */
    function NextUint32(bytes memory buff, uint256 offset) internal pure returns (uint32, uint256) {
        require(offset + 4 <= buff.length && offset < offset + 4, "NextUint32, offset exceeds maximum");
        uint32 v;
        assembly {
            let tmpbytes := mload(0x40)
            let byteLen := 0x04
            for {
                let tindex := 0x00
                let bindex := sub(byteLen, 0x01)
                let bvalue := mload(add(add(buff, 0x20), offset))
            } lt(tindex, byteLen) {
                tindex := add(tindex, 0x01)
                bindex := sub(bindex, 0x01)
            } {
                mstore8(add(tmpbytes, tindex), byte(bindex, bvalue))
            }
            mstore(0x40, add(tmpbytes, byteLen))
            v := mload(sub(tmpbytes, sub(0x20, byteLen)))
        }
        return (v, offset + 4);
    }

    /* @notice              Read next eight bytes as uint64 type starting from offset
     *  @param buff          Source bytes array
     *  @param offset        The position from where we read the uint64 value
     *  @return              The read uint64 value and updated offset
     */
    function NextUint64(bytes memory buff, uint256 offset) internal pure returns (uint64, uint256) {
        require(offset + 8 <= buff.length && offset < offset + 8, "NextUint64, offset exceeds maximum");
        uint64 v;
        assembly {
            let tmpbytes := mload(0x40)
            let byteLen := 0x08
            for {
                let tindex := 0x00
                let bindex := sub(byteLen, 0x01)
                let bvalue := mload(add(add(buff, 0x20), offset))
            } lt(tindex, byteLen) {
                tindex := add(tindex, 0x01)
                bindex := sub(bindex, 0x01)
            } {
                mstore8(add(tmpbytes, tindex), byte(bindex, bvalue))
            }
            mstore(0x40, add(tmpbytes, byteLen))
            v := mload(sub(tmpbytes, sub(0x20, byteLen)))
        }
        return (v, offset + 8);
    }


    /* @notice              Read next 32 bytes as uint256 type starting from offset,
                            there are limits considering the numerical limits in multi-chain
    *  @param buff          Source bytes array
    *  @param offset        The position from where we read the uint256 value
    *  @return              The read uint256 value and updated offset
    */
    function NextUint255(bytes memory buff, uint256 offset) internal pure returns (uint256, uint256) {
        require(offset + 32 <= buff.length && offset < offset + 32, "NextUint255, offset exceeds maximum");
        uint256 v;
        assembly {
            let tmpbytes := mload(0x40)
            let byteLen := 0x20
            for {
                let tindex := 0x00
                let bindex := sub(byteLen, 0x01)
                let bvalue := mload(add(add(buff, 0x20), offset))
            } lt(tindex, byteLen) {
                tindex := add(tindex, 0x01)
                bindex := sub(bindex, 0x01)
            } {
                mstore8(add(tmpbytes, tindex), byte(bindex, bvalue))
            }
            mstore(0x40, add(tmpbytes, byteLen))
            v := mload(tmpbytes)
        }
        require(v <= 0x7fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff, "Value exceeds the range");
        return (v, offset + 32);
    }

    /* @notice              Read next variable bytes starting from offset,
                            the decoding rule coming from multi-chain
    *  @param buff          Source bytes array
    *  @param offset        The position from where we read the bytes value
    *  @return              The read variable bytes array value and updated offset
    */
    function NextVarBytes(bytes memory buff, uint256 offset) internal pure returns (bytes memory, uint256) {
        uint256 len;
        (len, offset) = NextVarUint(buff, offset);
        require(offset + len <= buff.length && offset < offset + len, "NextVarBytes, offset exceeds maximum");
        bytes memory tempBytes;
        assembly {
            switch iszero(len)
            case 0 {
                // Get a location of some free memory and store it in tempBytes as
                // Solidity does for memory variables.
                tempBytes := mload(0x40)
                // The first word of the slice result is potentially a partial
                // word read from the original array. To read it, we calculate
                // the length of that partial word and start copying that many
                // bytes into the array. The first word we copy will start with
                // data we don't care about, but the last `lengthmod` bytes will
                // land at the beginning of the contents of the new array. When
                // we're done copying, we overwrite the full first word with
                // the actual length of the slice.
                let lengthmod := and(len, 31)

                // The multiplication in the next line is necessary
                // because when slicing multiples of 32 bytes (lengthmod == 0)
                // the following copy loop was copying the origin's length
                // and then ending prematurely not copying everything it should.
                let mc := add(add(tempBytes, lengthmod), mul(0x20, iszero(lengthmod)))
                let end := add(mc, len)

                for {
                    // The multiplication in the next line has the same exact purpose
                    // as the one above.
                    let cc := add(add(add(buff, lengthmod), mul(0x20, iszero(lengthmod))), offset)
                } lt(mc, end) {
                    mc := add(mc, 0x20)
                    cc := add(cc, 0x20)
                } {
                    mstore(mc, mload(cc))
                }

                mstore(tempBytes, len)

                //update free-memory pointer
                //allocating the array padded to 32 bytes like the compiler does now
                mstore(0x40, and(add(mc, 31), not(31)))
            }
            //if we want a zero-length slice let's just return a zero-length array
            default {
                tempBytes := mload(0x40)
                mstore(tempBytes, 0)
                mstore(0x40, add(tempBytes, 0x20))
            }
        }

        return (tempBytes, offset + len);
    }

    /* @notice              Read next 32 bytes starting from offset,
     *  @param buff          Source bytes array
     *  @param offset        The position from where we read the bytes value
     *  @return              The read bytes32 value and updated offset
     */
    function NextHash(bytes memory buff, uint256 offset) internal pure returns (bytes32, uint256) {
        require(offset + 32 <= buff.length && offset < offset + 32, "NextHash, offset exceeds maximum");
        bytes32 v;
        assembly {
            v := mload(add(buff, add(offset, 0x20)))
        }
        return (v, offset + 32);
    }

    /* @notice              Read next 20 bytes starting from offset,
     *  @param buff          Source bytes array
     *  @param offset        The position from where we read the bytes value
     *  @return              The read bytes20 value and updated offset
     */
    function NextAddress(bytes memory buff, uint256 offset) internal pure returns (address, uint256) {
        require(offset + 20 <= buff.length && offset < offset + 20, "NextAddress, offset exceeds maximum");
        bytes20 v;
        assembly {
            v := mload(add(buff, add(offset, 0x20)))
        }
        return (address(v), offset + 20);
    }

    function NextVarUint(bytes memory buff, uint256 offset) internal pure returns (uint256, uint256) {
        uint8 v;
        (v, offset) = NextUint8(buff, offset);

        uint256 value;
        if (v == 0xFD) {
            // return NextUint16(buff, offset);
            (value, offset) = NextUint16(buff, offset);
            require(value >= 0xFD && value <= 0xFFFF, "NextUint16, value outside range");
            return (value, offset);
        } else if (v == 0xFE) {
            // return NextUint32(buff, offset);
            (value, offset) = NextUint32(buff, offset);
            require(value > 0xFFFF && value <= 0xFFFFFFFF, "NextVarUint, value outside range");
            return (value, offset);
        } else if (v == 0xFF) {
            // return NextUint64(buff, offset);
            (value, offset) = NextUint64(buff, offset);
            require(value > 0xFFFFFFFF, "NextVarUint, value outside range");
            return (value, offset);
        } else {
            // return (uint8(v), offset);
            value = uint8(v);
            require(value < 0xFD, "NextVarUint, value outside range");
            return (value, offset);
        }
    }
}

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

• No Contract Security Audit Submitted- Submit Audit Here

[{"inputs":[{"internalType":"string","name":"tag_","type":"string"}],"stateMutability":"nonpayable","type":"constructor"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"bytes","name":"key","type":"bytes"},{"indexed":false,"internalType":"uint32","name":"epochNum","type":"uint32"},{"indexed":false,"internalType":"uint64","name":"protocolVersion","type":"uint64"}],"name":"EpochUpdated","type":"event"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"bytes32","name":"requestId","type":"bytes32"},{"indexed":false,"internalType":"uint32","name":"gasAmount","type":"uint32"}],"name":"GasPaid","type":"event"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"address","name":"priceOracle","type":"address"}],"name":"PriceOracleSet","type":"event"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"address","name":"receiver","type":"address"}],"name":"ReceiverSet","type":"event"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"bytes32","name":"requestId","type":"bytes32"},{"indexed":false,"internalType":"bytes","name":"data","type":"bytes"},{"indexed":false,"internalType":"address","name":"to","type":"address"},{"indexed":false,"internalType":"uint64","name":"chainIdTo","type":"uint64"}],"name":"RequestSent","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"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"enum IBridge.State","name":"state","type":"uint8"}],"name":"StateSet","type":"event"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"address","name":"to","type":"address"},{"indexed":false,"internalType":"uint256","name":"amount","type":"uint256"}],"name":"ValueWithdrawn","type":"event"},{"inputs":[],"name":"DEFAULT_ADMIN_ROLE","outputs":[{"internalType":"bytes32","name":"","type":"bytes32"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"GATEKEEPER_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":[],"name":"VALIDATOR_ROLE","outputs":[{"internalType":"bytes32","name":"","type":"bytes32"}],"stateMutability":"view","type":"function"},{"inputs":[{"components":[{"internalType":"bytes32","name":"requestId","type":"bytes32"},{"internalType":"bytes","name":"data","type":"bytes"},{"internalType":"bytes32","name":"to","type":"bytes32"},{"internalType":"uint64","name":"chainIdTo","type":"uint64"}],"internalType":"struct IBridge.SendParams","name":"params","type":"tuple"},{"internalType":"address","name":"sender","type":"address"},{"internalType":"bytes","name":"options","type":"bytes"}],"name":"estimateGasFee","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"getCurrentEpoch","outputs":[{"internalType":"bytes","name":"","type":"bytes"},{"internalType":"uint8","name":"","type":"uint8"},{"internalType":"uint32","name":"","type":"uint32"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"getPreviousEpoch","outputs":[{"internalType":"bytes","name":"","type":"bytes"},{"internalType":"uint8","name":"","type":"uint8"},{"internalType":"uint32","name":"","type":"uint32"}],"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":[],"name":"priceOracle","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"components":[{"internalType":"bytes","name":"blockHeader","type":"bytes"},{"internalType":"bytes","name":"merkleProof","type":"bytes"},{"internalType":"bytes","name":"votersPubKey","type":"bytes"},{"internalType":"bytes","name":"votersSignature","type":"bytes"},{"internalType":"uint256","name":"votersMask","type":"uint256"}],"internalType":"struct IBridgeV3.ReceiveParams[]","name":"params","type":"tuple[]"}],"name":"receiveV3","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"receiver","outputs":[{"internalType":"address","name":"","type":"address"}],"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":"","type":"bytes32"}],"name":"requestIdChecker","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"resetEpoch","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":[{"components":[{"internalType":"bytes32","name":"requestId","type":"bytes32"},{"internalType":"bytes","name":"data","type":"bytes"},{"internalType":"bytes32","name":"to","type":"bytes32"},{"internalType":"uint64","name":"chainIdTo","type":"uint64"}],"internalType":"struct IBridge.SendParams","name":"params","type":"tuple"},{"internalType":"address","name":"sender","type":"address"},{"internalType":"uint256","name":"nonce","type":"uint256"},{"internalType":"bytes","name":"options","type":"bytes"}],"name":"sendV3","outputs":[],"stateMutability":"payable","type":"function"},{"inputs":[{"internalType":"address","name":"priceOracle_","type":"address"}],"name":"setPriceOracle","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"receiver_","type":"address"}],"name":"setReceiver","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"enum IBridge.State","name":"state_","type":"uint8"}],"name":"setState","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"state","outputs":[{"internalType":"enum IBridge.State","name":"","type":"uint8"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"bytes4","name":"interfaceId","type":"bytes4"}],"name":"supportsInterface","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"tag","outputs":[{"internalType":"string","name":"","type":"string"}],"stateMutability":"view","type":"function"},{"inputs":[{"components":[{"internalType":"bytes","name":"blockHeader","type":"bytes"},{"internalType":"bytes","name":"merkleProof","type":"bytes"},{"internalType":"bytes","name":"votersPubKey","type":"bytes"},{"internalType":"bytes","name":"votersSignature","type":"bytes"},{"internalType":"uint256","name":"votersMask","type":"uint256"}],"internalType":"struct IBridgeV3.ReceiveParams","name":"params","type":"tuple"}],"name":"updateEpoch","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"version","outputs":[{"internalType":"string","name":"","type":"string"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"value_","type":"uint256"}],"name":"withdrawValue","outputs":[],"stateMutability":"nonpayable","type":"function"}]

608060405234801562000010575f80fd5b5060405162004ac338038062004ac38339810160408190526200003391620001dd565b6001600255620000445f3362000092565b60408051808201909152600580825264322e322e3360d81b6020830152906200006e908262000336565b506007805460ff1916600117905560066200008a828262000336565b5050620003fe565b6200009e8282620000bc565b5f828152600160205260409020620000b790826200015b565b505050565b5f828152602081815260408083206001600160a01b038516845290915290205460ff1662000157575f828152602081815260408083206001600160a01b03851684529091529020805460ff19166001179055620001163390565b6001600160a01b0316816001600160a01b0316837f2f8788117e7eff1d82e926ec794901d17c78024a50270940304540a733656f0d60405160405180910390a45b5050565b5f62000171836001600160a01b0384166200017a565b90505b92915050565b5f818152600183016020526040812054620001c157508154600181810184555f84815260208082209093018490558454848252828601909352604090209190915562000174565b505f62000174565b634e487b7160e01b5f52604160045260245ffd5b5f6020808385031215620001ef575f80fd5b82516001600160401b038082111562000206575f80fd5b818501915085601f8301126200021a575f80fd5b8151818111156200022f576200022f620001c9565b604051601f8201601f19908116603f011681019083821181831017156200025a576200025a620001c9565b81604052828152888684870101111562000272575f80fd5b5f93505b8284101562000295578484018601518185018701529285019262000276565b5f86848301015280965050505050505092915050565b600181811c90821680620002c057607f821691505b602082108103620002df57634e487b7160e01b5f52602260045260245ffd5b50919050565b601f821115620000b7575f81815260208120601f850160051c810160208610156200030d5750805b601f850160051c820191505b818110156200032e5782815560010162000319565b505050505050565b81516001600160401b03811115620003525762000352620001c9565b6200036a81620003638454620002ab565b84620002e5565b602080601f831160018114620003a0575f8415620003885750858301515b5f19600386901b1c1916600185901b1785556200032e565b5f85815260208120601f198616915b82811015620003d057888601518255948401946001909101908401620003af565b5085821015620003ee57878501515f19600388901b60f8161c191681555b5050505050600190811b01905550565b6146b7806200040c5f395ff3fe6080604052600436106101ba575f3560e01c80638210a5bc116100f2578063c49baebe11610092578063d6fd317511610062578063d6fd317514610508578063d79de39e1461053b578063f5b541a61461055a578063f7260d3e1461057a575f80fd5b8063c49baebe14610484578063ca15c873146104b7578063d174ff82146104d6578063d547741f146104e9575f80fd5b806391d14854116100cd57806391d1485414610418578063a217fddf14610437578063b97dd9e21461044a578063c19d93fb1461045e575f80fd5b80638210a5bc146103ac5780639010d07c146103da57806391cdd9f0146103f9575f80fd5b806351f910661161015d57806356de96db1161013857806356de96db146103305780636e9cb0971461034f578063718da7ee1461036e57806379e997571461038d575f80fd5b806351f91066146102dc578063530e784f146102fd57806354fd4d501461031c575f80fd5b80632630c12f116101985780632630c12f146102515780632f2ff15d1461028857806331eab48a146102a957806336568abe146102bd575f80fd5b806301ffc9a7146101be578063056768bf146101f2578063248a9ca314610215575b5f80fd5b3480156101c9575f80fd5b506101dd6101d8366004613bae565b610599565b60405190151581526020015b60405180910390f35b3480156101fd575f80fd5b506102066105c3565b6040516101e993929190613c22565b348015610220575f80fd5b5061024361022f366004613c53565b5f9081526020819052604090206001015490565b6040519081526020016101e9565b34801561025c575f80fd5b50600454610270906001600160a01b031681565b6040516001600160a01b0390911681526020016101e9565b348015610293575f80fd5b506102a76102a2366004613c80565b610608565b005b3480156102b4575f80fd5b506102a7610631565b3480156102c8575f80fd5b506102a76102d7366004613c80565b6107ac565b3480156102e7575f80fd5b506102f061082f565b6040516101e99190613caa565b348015610308575f80fd5b506102a7610317366004613cbc565b6108bb565b348015610327575f80fd5b506102f0610977565b34801561033b575f80fd5b506102a761034a366004613cd5565b610984565b34801561035a575f80fd5b50610243610369366004613dc5565b6109f6565b348015610379575f80fd5b506102a7610388366004613cbc565b610ac1565b348015610398575f80fd5b506101dd6103a7366004613e33565b610b75565b3480156103b7575f80fd5b506101dd6103c6366004613c53565b60086020525f908152604090205460ff1681565b3480156103e5575f80fd5b506102706103f4366004613ea1565b61130c565b348015610404575f80fd5b506102a7610413366004613c53565b61132a565b348015610423575f80fd5b506101dd610432366004613c80565b611407565b348015610442575f80fd5b506102435f81565b348015610455575f80fd5b5061020661142f565b348015610469575f80fd5b506007546104779060ff1681565b6040516101e99190613ed5565b34801561048f575f80fd5b506102437f21702c8af46127c7fa207f89d0b0a8441bb32959a0ac7df790e9ab1a25c9892681565b3480156104c2575f80fd5b506102436104d1366004613c53565b611474565b6102a76104e4366004613efb565b61148a565b3480156104f4575f80fd5b506102a7610503366004613c80565b611789565b348015610513575f80fd5b506102437f3c63e605be3290ab6b04cfc46c6e1516e626d43236b034f09d7ede1d017beb0c81565b348015610546575f80fd5b506102a7610555366004613f73565b6117ad565b348015610565575f80fd5b506102435f8051602061466283398151915281565b348015610585575f80fd5b50600354610270906001600160a01b031681565b5f6001600160e01b03198216635a05180f60e01b14806105bd57506105bd82611a15565b92915050565b60605f8060115f016040516020016105db9190613fd1565b60408051808303601f19018152919052601754909460ff8216945061010090910463ffffffff1692509050565b5f8281526020819052604090206001015461062281611a49565b61062c8383611a53565b505050565b5f8051602061466283398151915261064881611a49565b6040805161012081019091526107199060098160a08101828160e084018260028282826020028201915b81548152602001906001019080831161067257505050918352505060408051808201918290526020909201919060028481019182845b8154815260200190600101908083116106a857505050919092525050508152604080518082018252600484015481526005840154602080830191909152830152600683015460ff811691830191909152610100900463ffffffff166060820152600790910154608090910152611a74565b1561076557610726611a8e565b60175461073f90610100900463ffffffff166001614003565b600f805463ffffffff929092166101000264ffffffff00199092169190911790556107a0565b600f5461077e90610100900463ffffffff166001614003565b600f805463ffffffff929092166101000264ffffffff00199092169190911790555b6107a95f611b9d565b50565b6001600160a01b03811633146108215760405162461bcd60e51b815260206004820152602f60248201527f416363657373436f6e74726f6c3a2063616e206f6e6c792072656e6f756e636560448201526e103937b632b9903337b91039b2b63360891b60648201526084015b60405180910390fd5b61082b8282611c08565b5050565b6006805461083c90614020565b80601f016020809104026020016040519081016040528092919081815260200182805461086890614020565b80156108b35780601f1061088a576101008083540402835291602001916108b3565b820191905f5260205f20905b81548152906001019060200180831161089657829003601f168201915b505050505081565b5f805160206146628339815191526108d281611a49565b6001600160a01b0382166109215760405162461bcd60e51b815260206004820152601660248201527542726964676556333a207a65726f206164647265737360501b6044820152606401610818565b600480546001600160a01b0319166001600160a01b0384169081179091556040519081527f6536690106168bdf4ba72c128a053d817999b1db90cae23f139b293bf862cb75906020015b60405180910390a15050565b6005805461083c90614020565b5f8051602061466283398151915261099b81611a49565b6007805483919060ff191660018360028111156109ba576109ba613ec1565b02179055506007546040517fc635bb75c392e81c891d50372a48cfa81b6799ac6d594cb4c28a8c5e8bef6e9b9161096b9160ff90911690613ed5565b5f8082806020019051810190610a0c9190614052565b6004549091505f906001600160a01b031663095c1566610a326080890160608a01614075565b610a3f60208a018a61409b565b60405160e085901b6001600160e01b03191681526001600160401b03909316600484015260248301525063ffffffff851660448201526064016040805180830381865afa158015610a92573d5f803e3d5ffd5b505050506040513d601f19601f82011682018060405250810190610ab691906140dd565b509695505050505050565b5f80516020614662833981519152610ad881611a49565b6001600160a01b038216610b275760405162461bcd60e51b815260206004820152601660248201527542726964676556333a207a65726f206164647265737360501b6044820152606401610818565b600380546001600160a01b0319166001600160a01b0384169081179091556040519081527fb68fd1a788a85f8f18de7976d851969ff9ff2216de81169c17a6f4ac94c23def9060200161096b565b5f7f21702c8af46127c7fa207f89d0b0a8441bb32959a0ac7df790e9ab1a25c98926610ba081611a49565b610ba8611c29565b600160075460ff166002811115610bc157610bc1613ec1565b03610c075760405162461bcd60e51b81526020600482015260166024820152754272696467653a20737461746520696e61637469766560501b6044820152606401610818565b5f5b838110156112f6575f610c48868684818110610c2757610c276140ff565b9050602002810190610c399190614113565b610c43908061409b565b611c80565b6010549091508103610d6f57604080516101208101918290526009805460e08301908152610d2093839160a0830191849183918390600290600a6101008901808311610672575050509183525050604080518082019182905260028481018054835260209485019492939092600387019085018083116106a857505050919092525050508152604080518082018252600484015481526005840154602080830191909152830152600683015460ff811691830191909152610100900463ffffffff166060820152600790910154608090910152611a74565b610d3c5760405162461bcd60e51b815260040161081890614131565b610d6a6009878785818110610d5357610d536140ff565b9050602002810190610d659190614113565b611ccb565b610eb5565b6018548103610e7757604080516101208101918290526011805460e08301908152610e4493839160a083019184918391839060029060126101008901808311610672575050509183525050604080518082019182905260028481018054835260209485019492939092600387019085018083116106a857505050919092525050508152604080518082018252600484015481526005840154602080830191909152830152600683015460ff811691830191909152610100900463ffffffff166060820152600790910154608090910152611a74565b610e605760405162461bcd60e51b815260040161081890614131565b610d6a6011878785818110610d5357610d536140ff565b60405162461bcd60e51b8152602060048201526013602482015272084e4d2c8ceca7440eee4dedcce40cae0dec6d606b1b6044820152606401610818565b5f610f5c878785818110610ecb57610ecb6140ff565b9050602002810190610edd9190614113565b610eeb90602081019061409b565b8080601f0160208091040260200160405190810160405280939291908181526020018383808284375f92019190915250610f5792508b91508a905087818110610f3657610f366140ff565b9050602002810190610f489190614113565b610f52908061409b565b611dc4565b611dd6565b90505f805f80610f6b85611f09565b935093509350935046816001600160401b031614610fc45760405162461bcd60e51b8152602060048201526016602482015275109c9a5919d94e881ddc9bdb99c818da185a5b881a5960521b6044820152606401610818565b5f8481526008602052604090205460ff16156110225760405162461bcd60e51b815260206004820152601f60248201527f4272696467653a207265717565737420696420616c7265616479207365656e006044820152606401610818565b5f848152600860205260408120805460ff1916600190811790915584516110499190614160565b9050806001600160401b0381111561106357611063613d09565b6040519080825280601f01601f19166020018201604052801561108d576020820181803683370190505b5095505f5b818110156110ef578481815181106110ac576110ac6140ff565b602001015160f81c60f81b8782815181106110c9576110c96140ff565b60200101906001600160f81b03191690815f1a9053506110e881614173565b9050611092565b5083600185516110ff9190614160565b8151811061110f5761110f6140ff565b01602001516001600160f81b031916600160f81b036112165785516080146111795760405162461bcd60e51b815260206004820152601e60248201527f4272696467653a20496e76616c6964206d657373616765206c656e67746800006044820152606401610818565b5f805f86806020019051810190611190919061418b565b50600354604051632c7f327760e11b8152600481018490526001600160401b038316602482015260448101859052606481018d905293965091945092506001600160a01b0316906358fe64ee906084015b5f604051808303815f87803b1580156111f8575f80fd5b505af115801561120a573d5f803e3d5ffd5b505050505050506112de565b83600185516112259190614160565b81518110611235576112356140ff565b01602001516001600160f81b0319165f0361129e575f805f8680602001905181019061126191906141be565b5060035460405163f137538b60e01b815293965091945092506001600160a01b03169063f137538b906111e1908590859088908e90600401614249565b60405162461bcd60e51b81526020600482015260156024820152744272696467653a2077726f6e67206d65737361676560581b6044820152606401610818565b50505050505050806112ef90614173565b9050610c09565b50600191506113056001600255565b5092915050565b5f8281526001602052604081206113239083611f55565b9392505050565b5f61133481611a49565b6040515f90339084908381818185875af1925050503d805f8114611373576040519150601f19603f3d011682016040523d82523d5f602084013e611378565b606091505b50509050806113c95760405162461bcd60e51b815260206004820152601e60248201527f42726964676556333a206661696c656420746f2073656e6420457468657200006044820152606401610818565b60408051338152602081018590527f810f4216b8f4ed8460c9944d3a3bee30521ce371329120f4cf59fad7ffd2e081910160405180910390a1505050565b5f918252602082815260408084206001600160a01b0393909316845291905290205460ff1690565b60605f8060095f016040516020016114479190613fd1565b60408051808303601f19018152919052600f54909460ff8216945061010090910463ffffffff1692509050565b5f8181526001602052604081206105bd90611f60565b7f3c63e605be3290ab6b04cfc46c6e1516e626d43236b034f09d7ede1d017beb0c6114b481611a49565b5f60075460ff1660028111156114cc576114cc613ec1565b146115125760405162461bcd60e51b81526020600482015260166024820152754272696467653a20737461746520696e61637469766560501b6044820152606401610818565b604080516101208101918290526011805460e083019081526115de93839160a083019184918391839060029060126101008901808311610672575050509183525050604080518082019182905260028481018054835260209485019492939092600387019085018083116106a857505050919092525050508152604080518082018252600484015481526005840154602080830191909152830152600683015460ff811691830191909152610100900463ffffffff166060820152600790910154608090910152611a74565b806116b05750604080516101208101918290526009805460e083019081526116b093839160a0830191849183918390600290600a6101008901808311610672575050509183525050604080518082019182905260028481018054835260209485019492939092600387019085018083116106a857505050919092525050508152604080518082018252600484015481526005840154602080830191909152830152600683015460ff811691830191909152610100900463ffffffff166060820152600790910154608090910152611a74565b6116cc5760405162461bcd60e51b815260040161081890614131565b60408501357f5566d73d091d945ab32ea023cd1930c0d43aa43bef9aee4cb029775cfc94bdae8635611701602089018961409b565b8461171260808c0160608d01614075565b604051611723959493929190614281565b60405180910390a17f3486f12e81927998a69cd0e6cd3978f4b1260266edb68145d92c6a32e080ddb3865f0135848060200190518101906117649190614052565b6040805192835263ffffffff90911660208301520160405180910390a1505050505050565b5f828152602081905260409020600101546117a381611a49565b61062c8383611c08565b7f21702c8af46127c7fa207f89d0b0a8441bb32959a0ac7df790e9ab1a25c989266117d781611a49565b5f61182b6117e8602085018561409b565b8080601f0160208091040260200160405190810160405280939291908181526020018383808284375f92019190915250610f579250610f5291508790508061409b565b90505f805f8061183a85611f69565b600f549397509195509350915063ffffffff8085169161186291610100909104166001614003565b63ffffffff16146118b55760405162461bcd60e51b815260206004820152601a60248201527f4272696467653a2077726f6e672065706f6368206e756d6265720000000000006044820152606401610818565b604080516101208101918290526009805460e0830190815261198193839160a0830191849183918390600290600a6101008901808311610672575050509183525050604080518082019182905260028481018054835260209485019492939092600387019085018083116106a857505050919092525050508152604080518082018252600484015481526005840154602080830191909152830152600683015460ff811691830191909152610100900463ffffffff166060820152600790910154608090910152611a74565b1561199957611991600988611ccb565b611999611a8e565b5f60026119a6898061409b565b6040516119b49291906142d9565b602060405180830381855afa1580156119cf573d5f803e3d5ffd5b5050506040513d601f19601f820116820180604052508101906119f291906142e8565b9050611a02600984848785611fb3565b611a0b85611b9d565b5050505050505050565b5f6001600160e01b03198216637965db0b60e01b14806105bd57506301ffc9a760e01b6001600160e01b03198316146105bd565b6107a981336120b5565b611a5d828261210e565b5f82815260016020526040902061062c9082612191565b805151515f901515806105bd575050515160200151151590565b600960118181611aa081836002613a65565b50611ab360028281019084810190613a65565b505050600482810154908201556005808301549082015560068083018054918301805460ff19811660ff9094169384178255915463ffffffff61010091829004160264ffffffffff19909216909217179055600791820154910155611b16613aa0565b8051805182916009918290611b2e9082906002613aed565b506020820151611b449060028084019190613aed565b50505060208281015180516004840155015160058201556040820151600682018054606085015163ffffffff166101000264ffffffffff1990911660ff9093169290921791909117905560809091015160079091015550565b6040517f7abd871edc50e0783b456da5e3441224a90207257b5a02f5b2410f905204e0c090611bd190600990602001613fd1565b60408051808303601f1901815290829052600f54611bfd9261010090910463ffffffff169085906142ff565b60405180910390a150565b611c1282826121a5565b5f82815260016020526040902061062c9082612209565b6002805403611c7a5760405162461bcd60e51b815260206004820152601f60248201527f5265656e7472616e637947756172643a207265656e7472616e742063616c6c006044820152606401610818565b60028055565b5f611323611c92604860288587614336565b8080601f0160208091040260200160405190810160405280939291908181526020018383808284375f9201919091525061221d92505050565b60408051610120810190915261082b90838160a08101828160e084018260028282826020028201915b815481526020019060010190808311611cf457505050918352505060408051808201918290526020909201919060028481019182845b815481526020019060010190808311611d2a57505050919092525050508152604080518082018252600484015481526005840154602080830191909152830152600683015460ff811691830191909152610100900463ffffffff166060820152600790910154608090910152611da0838061409b565b611dad604086018661409b565b611dba606088018861409b565b8860800135612277565b5f611323611c92606860488587614336565b60605f6060611de58583612445565b925090505f611df382612555565b90505f6021848851611e059190614160565b611e0f9190614371565b90505f805f5b83811015611eb757611e278a886125c3565b97509150611e358a8861267b565b9750925060ff82165f03611e5457611e4d8386612707565b9450611ea5565b8160ff16600103611e6957611e4d8584612707565b60405162461bcd60e51b815260206004820152601160248201527013595c9adb194e881c1c9bdd9948195bd9607a1b6044820152606401610818565b80611eaf81614173565b915050611e15565b50878414611efc5760405162461bcd60e51b815260206004820152601260248201527113595c9adb194e881c1c9bdd99481c9bdbdd60721b6044820152606401610818565b5092979650505050505050565b5f60605f805f611f19868261267b565b9095509050611f288682612782565b9092509050611f378682612850565b9093509050611f468682612445565b50949694955091939092509050565b5f61132383836128e7565b5f6105bd825490565b5f8060608180611f798682612782565b9095509050611f88868261290d565b9094509050611f9786826125c3565b9092509050611fa68682612445565b5094969395509092915050565b5f611fbd856129db565b90505f60405180604001604052805f81526020015f81525090505f80835f0151846020015183604051602001611ff5939291906143a6565b60405160208183030381529060405290505b8660ff1682101561203e578160a082015261202a8361202583612a17565b612ad3565b92508161203681614173565b925050612007565b835184908a906120519082906002613aed565b5060208201516120679060028084019190613aed565b5050835160048b01555050506020015160058701555060068501805463ffffffff9093166101000264ffffffffff1990931660ff909416939093179190911790915560079092019190915550565b6120bf8282611407565b61082b576120cc81612b6e565b6120d7836020612b80565b6040516020016120e89291906143ce565b60408051601f198184030181529082905262461bcd60e51b825261081891600401613caa565b6121188282611407565b61082b575f828152602081815260408083206001600160a01b03851684529091529020805460ff1916600117905561214d3390565b6001600160a01b0316816001600160a01b0316837f2f8788117e7eff1d82e926ec794901d17c78024a50270940304540a733656f0d60405160405180910390a45050565b5f611323836001600160a01b038416612d15565b6121af8282611407565b1561082b575f828152602081815260408083206001600160a01b0385168085529252808320805460ff1916905551339285917ff6391f5c32d9c69d2a47ea670b442974b53935d1edc7fd64eb21e047a839171b9190a45050565b5f611323836001600160a01b038416612d61565b5f815160201461226f5760405162461bcd60e51b815260206004820152601760248201527f6279746573206c656e677468206973206e6f742033322e0000000000000000006044820152606401610818565b506020015190565b6003886040015160ff16600261228d9190614442565b6122979190614371565b6122a082612e44565b116122ed5760405162461bcd60e51b815260206004820152601e60248201527f426c6f636b3a206e6f7420656e6f756768207061727469636970616e747300006044820152606401610818565b876040015160ff1660ff148061230d5750876040015160ff166001901b81105b6123525760405162461bcd60e51b8152602060048201526016602482015275426c6f636b3a206269746d61736b20746f6f2062696760501b6044820152606401610818565b6123f98886868080601f0160208091040260200160405190810160405280939291908181526020018383808284375f9201919091525050604080516020601f8e018190048102820181019092528c815292508c91508b90819084018382808284375f9201919091525050604080516020601f8b0181900481028201810190925289815292508991508890819084018382808284375f92019190915250889250612e72915050565b611a0b5760405162461bcd60e51b815260206004820152601860248201527f426c6f636b3a206d756c7469736967206d69736d6174636800000000000000006044820152606401610818565b60605f8061245385856130b0565b86519095509091506124658286614459565b1115801561247b57506124788185614459565b84105b6124d35760405162461bcd60e51b8152602060048201526024808201527f4e65787456617242797465732c206f66667365742065786365656473206d6178604482015263696d756d60e01b6064820152608401610818565b6060811580156124f15760405191505f82526020820160405261253b565b6040519150601f8316801560200281840101848101888315602002848c0101015b8183101561252a578051835260209283019201612512565b5050848452601f01601f1916604052505b50806125478387614459565b9350935050505b9250929050565b5f60025f8360405160200161256b92919061446c565b60408051601f19818403018152908290526125859161449a565b602060405180830381855afa1580156125a0573d5f803e3d5ffd5b5050506040513d601f19601f820116820180604052508101906105bd91906142e8565b5f8083518360016125d49190614459565b111580156125eb57506125e8836001614459565b83105b6126415760405162461bcd60e51b815260206004820152602160248201527f4e65787455696e74382c204f66667365742065786365656473206d6178696d756044820152606d60f81b6064820152608401610818565b5f60405184602087010151805f1a82535060018101604052601f8103519150508084600161266f9190614459565b92509250509250929050565b5f80835183602061268c9190614459565b111580156126a357506126a0836020614459565b83105b6126ef5760405162461bcd60e51b815260206004820181905260248201527f4e657874486173682c206f66667365742065786365656473206d6178696d756d6044820152606401610818565b5f6020840185015190508084602061266f9190614459565b604051600160f81b602082015260218101839052604181018290525f9060029060610160408051601f19818403018152908290526127449161449a565b602060405180830381855afa15801561275f573d5f803e3d5ffd5b5050506040513d601f19601f8201168201806040525081019061132391906142e8565b5f8083518360086127939190614459565b111580156127aa57506127a7836008614459565b83105b6128015760405162461bcd60e51b815260206004820152602260248201527f4e65787455696e7436342c206f66667365742065786365656473206d6178696d604482015261756d60f01b6064820152608401610818565b5f60405160085f600182038760208a0101515b838310156128345780821a83860153600183019250600182039150612814565b505050016040819052601f19015190508061266f856008614459565b5f8083518360146128619190614459565b111580156128785750612875836014614459565b83105b6128d05760405162461bcd60e51b815260206004820152602360248201527f4e657874416464726573732c206f66667365742065786365656473206d6178696044820152626d756d60e81b6064820152608401610818565b83830160200151606081901c61266f856014614459565b5f825f0182815481106128fc576128fc6140ff565b905f5260205f200154905092915050565b5f80835183600461291e9190614459565b111580156129355750612932836004614459565b83105b61298c5760405162461bcd60e51b815260206004820152602260248201527f4e65787455696e7433322c206f66667365742065786365656473206d6178696d604482015261756d60f01b6064820152608401610818565b5f60405160045f600182038760208a0101515b838310156129bf5780821a8386015360018301925060018203915061299f565b505050016040819052601f19015190508061266f856004614459565b6129e3613b1b565b6020828101516040840151606085015160809095015184519290925283518301528282018051949094529251019190915290565b604080518082019091525f80825260208201525f600283604051612a3b919061449a565b602060405180830381855afa158015612a56573d5f803e3d5ffd5b5050506040513d601f19601f82011682018060405250810190612a7991906142e8565b90505f612a935f80516020614642833981519152836144ab565b90505f5b612aa082613204565b90508015612ac1576040805180820190915291825260208201529392505050565b612acc600183614459565b9150612a97565b604080518082019091525f8082526020820152612aee613b40565b835181526020808501518183015283516040808401919091529084015160608301525f908360808460066107d05a03fa905080612b665760405162461bcd60e51b8152602060048201526016602482015275109b1cce88185919081c1bda5b9d1cc819985a5b195960521b6044820152606401610818565b505092915050565b60606105bd6001600160a01b03831660145b60605f612b8e836002614442565b612b99906002614459565b6001600160401b03811115612bb057612bb0613d09565b6040519080825280601f01601f191660200182016040528015612bda576020820181803683370190505b509050600360fc1b815f81518110612bf457612bf46140ff565b60200101906001600160f81b03191690815f1a905350600f60fb1b81600181518110612c2257612c226140ff565b60200101906001600160f81b03191690815f1a9053505f612c44846002614442565b612c4f906001614459565b90505b6001811115612cc6576f181899199a1a9b1b9c1cb0b131b232b360811b85600f1660108110612c8357612c836140ff565b1a60f81b828281518110612c9957612c996140ff565b60200101906001600160f81b03191690815f1a90535060049490941c93612cbf816144be565b9050612c52565b5083156113235760405162461bcd60e51b815260206004820181905260248201527f537472696e67733a20686578206c656e67746820696e73756666696369656e746044820152606401610818565b5f818152600183016020526040812054612d5a57508154600181810184555f8481526020808220909301849055845484825282860190935260409020919091556105bd565b505f6105bd565b5f8181526001830160205260408120548015612e3b575f612d83600183614160565b85549091505f90612d9690600190614160565b9050818114612df5575f865f018281548110612db457612db46140ff565b905f5260205f200154905080875f018481548110612dd457612dd46140ff565b5f918252602080832090910192909255918252600188019052604090208390555b8554869080612e0657612e066144d3565b600190038181905f5260205f20015f90559055856001015f8681526020019081526020015f205f9055600193505050506105bd565b5f9150506105bd565b5f5b8115612e6d57612e57600183614160565b9091169080612e6581614173565b915050612e46565b919050565b60208086015186518051908301516040515f9485936001938593612e98938591016143a6565b60405160208183030381529060405290505b896040015160ff16831015612ef9578186165f03612ee0578260a0820152612edd84612025612ed884612a17565b61323e565b93505b60019190911b9082612ef181614173565b935050612eaa565b604080516003808252608082019092525f91816020015b604080518082019091525f8082526020820152815260200190600190039081612f10575050604080516003808252608082019092529192505f9190602082015b612f58613b1b565b815260200190600190039081612f505750506040805180820182525f80825260208083019182528d0151928d015192825291909152909150612f999061323e565b825f81518110612fab57612fab6140ff565b6020908102919091018101919091528c51805190820151604051612feb93612fd79392918f91016144e7565b604051602081830303815290604052612a17565b82600181518110612ffe57612ffe6140ff565b6020026020010181905250858260028151811061301d5761301d6140ff565b60200260200101819052506130306132c7565b815f81518110613042576130426140ff565b60200260200101819052506130568b6129db565b81600181518110613069576130696140ff565b60200260200101819052508b5f01518160028151811061308b5761308b6140ff565b60200260200101819052506130a08282613387565b9c9b505050505050505050505050565b5f805f6130bd85856125c3565b945090505f60ff821660fd0361314a576130d786866136dc565b955061ffff16905060fd81108015906130f2575061ffff8111155b61313e5760405162461bcd60e51b815260206004820152601f60248201527f4e65787455696e7431362c2076616c7565206f7574736964652072616e6765006044820152606401610818565b925083915061254e9050565b8160ff1660fe0361319a5761315f868661290d565b955063ffffffff16905061ffff8111801561317e575063ffffffff8111155b61313e5760405162461bcd60e51b815260040161081890614521565b8160ff1660ff036131df576131af8686612782565b95506001600160401b0316905063ffffffff811161313e5760405162461bcd60e51b815260040161081890614521565b5060ff811660fd811061313e5760405162461bcd60e51b815260040161081890614521565b5f6105bd5f805160206146428339815191528061322385600383613792565b61322e906003614459565b61323891906144ab565b906137da565b604080518082019091525f808252602082015261325a826139af565b15613277575050604080518082019091525f808252602082015290565b6040518060400160405280835f015181526020015f8051602061464283398151915284602001516132a891906144ab565b6132bf905f80516020614642833981519152614160565b905292915050565b6132cf613b1b565b50604080516080810182527f198e9393920d483a7260bfb731fb5d25f1aa493335a9e71297e485b7aef312c28183019081527f1800deef121f1e76426a00665e5c4479674322d4f75edadd46debd5cd992f6ed6060830152815281518083019092527f090689d0585ff075ec9e99ad690c3395bc4b313370b38ef355acdadcd122975b82527f12c85ea5db8c6deb4aab71808dcb408fe3d1e7690c43d37b4ce6cc0166fa7daa60208381019190915281019190915290565b5f81518351146133d95760405162461bcd60e51b815260206004820152601960248201527f426c733a20706f696e7420636f756e74206d69736d61746368000000000000006044820152606401610818565b82515f6133e7826006614442565b90505f816001600160401b0381111561340257613402613d09565b60405190808252806020026020018201604052801561342b578160200160208202803683370190505b5090505f5b838110156136625786818151811061344a5761344a6140ff565b60200260200101515f0151828260066134639190614442565b61346d905f614459565b8151811061347d5761347d6140ff565b60200260200101818152505086818151811061349b5761349b6140ff565b602002602001015160200151828260066134b59190614442565b6134c0906001614459565b815181106134d0576134d06140ff565b6020026020010181815250508581815181106134ee576134ee6140ff565b6020908102919091010151515182613507836006614442565b613512906002614459565b81518110613522576135226140ff565b602002602001018181525050858181518110613540576135406140ff565b6020908102919091018101515101518261355b836006614442565b613566906003614459565b81518110613576576135766140ff565b602002602001018181525050858181518110613594576135946140ff565b6020026020010151602001515f600281106135b1576135b16140ff565b6020020151826135c2836006614442565b6135cd906004614459565b815181106135dd576135dd6140ff565b6020026020010181815250508581815181106135fb576135fb6140ff565b602002602001015160200151600160028110613619576136196140ff565b60200201518261362a836006614442565b613635906005614459565b81518110613645576136456140ff565b60209081029190910101528061365a81614173565b915050613430565b5061366b613b5e565b5f602082602086026020860160086107d05a03fa9050806136ce5760405162461bcd60e51b815260206004820152601d60248201527f426c733a2070616972696e67206f7065726174696f6e206661696c65640000006044820152606401610818565b505115159695505050505050565b5f8083518360026136ed9190614459565b111580156137045750613701836002614459565b83105b61375b5760405162461bcd60e51b815260206004820152602260248201527f4e65787455696e7431362c206f66667365742065786365656473206d6178696d604482015261756d60f01b6064820152608401610818565b5f604051846020870101518060011a8253805f1a60018301535060028101604052601e8103519150508084600261266f9190614459565b5f6040516020810160208152602080820152602060408201528560608201528460808201528360a082015260208260c08360055f19fa6137d0575f80fd5b5051949350505050565b5f6137e583836139c4565b6001146137f357505f6105bd565b825f0361380157505f6105bd565b61380c6004836144ab565b60030361383b57613834836004613824856001614459565b61382e9190614371565b84613792565b90506105bd565b5f613847600184614160565b90505f5b6138566002836144ab565b5f0361387b57613867600283614371565b9150613874816001614459565b905061384b565b60025b61388881866139c4565b5f19146138a15761389a816001614459565b905061387e565b5f6138c38760026138b3876001614459565b6138bd9190614371565b88613792565b90505f6138d1888689613792565b90505f6138df84878a613792565b9050845f80845b505f9050845b8382101561391c576001811461391c576139088160028e613792565b90508161391481614173565b9250506138ec565b815f0361393557869a50505050505050505050506105bd565b6139608560016139458588614160565b61394f9190614160565b61395a906002614636565b8e613792565b92508b61396d8480614442565b61397791906144ab565b94508b6139848489614442565b61398e91906144ab565b96508b61399b8688614442565b6139a591906144ab565b95508193506138e6565b80515f901580156105bd575050602001511590565b5f806139e78460026139d7600187614160565b6139e19190614371565b85613792565b90508015806139f65750806001145b15613a025790506105bd565b613a0d600184614160565b8103613a1d575f199150506105bd565b60405162461bcd60e51b815260206004820152601d60248201527f4661696c656420746f2063616c63756c617465206c6567656e6472652e0000006044820152606401610818565b8260028101928215613a90579182015b82811115613a90578254825591600101919060010190613a75565b50613a9c929150613b7c565b5090565b6040518060a00160405280613ab3613b1b565b8152602001613ad360405180604001604052805f81526020015f81525090565b81525f602082018190526040820181905260609091015290565b8260028101928215613a90579160200282015b82811115613a90578251825591602001919060010190613b00565b6040518060400160405280613b2e613b90565b8152602001613b3b613b90565b905290565b60405180608001604052806004906020820280368337509192915050565b60405180602001604052806001906020820280368337509192915050565b5b80821115613a9c575f8155600101613b7d565b60405180604001604052806002906020820280368337509192915050565b5f60208284031215613bbe575f80fd5b81356001600160e01b031981168114611323575f80fd5b5f5b83811015613bef578181015183820152602001613bd7565b50505f910152565b5f8151808452613c0e816020860160208601613bd5565b601f01601f19169290920160200192915050565b606081525f613c346060830186613bf7565b905060ff8416602083015263ffffffff83166040830152949350505050565b5f60208284031215613c63575f80fd5b5035919050565b80356001600160a01b0381168114612e6d575f80fd5b5f8060408385031215613c91575f80fd5b82359150613ca160208401613c6a565b90509250929050565b602081525f6113236020830184613bf7565b5f60208284031215613ccc575f80fd5b61132382613c6a565b5f60208284031215613ce5575f80fd5b813560038110611323575f80fd5b5f60808284031215613d03575f80fd5b50919050565b634e487b7160e01b5f52604160045260245ffd5b604051601f8201601f191681016001600160401b0381118282101715613d4557613d45613d09565b604052919050565b5f6001600160401b03821115613d6557613d65613d09565b50601f01601f191660200190565b5f82601f830112613d82575f80fd5b8135613d95613d9082613d4d565b613d1d565b818152846020838601011115613da9575f80fd5b816020850160208301375f918101602001919091529392505050565b5f805f60608486031215613dd7575f80fd5b83356001600160401b0380821115613ded575f80fd5b613df987838801613cf3565b9450613e0760208701613c6a565b93506040860135915080821115613e1c575f80fd5b50613e2986828701613d73565b9150509250925092565b5f8060208385031215613e44575f80fd5b82356001600160401b0380821115613e5a575f80fd5b818501915085601f830112613e6d575f80fd5b813581811115613e7b575f80fd5b8660208260051b8501011115613e8f575f80fd5b60209290920196919550909350505050565b5f8060408385031215613eb2575f80fd5b50508035926020909101359150565b634e487b7160e01b5f52602160045260245ffd5b6020810160038310613ef557634e487b7160e01b5f52602160045260245ffd5b91905290565b5f805f8060808587031215613f0e575f80fd5b84356001600160401b0380821115613f24575f80fd5b613f3088838901613cf3565b9550613f3e60208801613c6a565b9450604087013593506060870135915080821115613f5a575f80fd5b50613f6787828801613d73565b91505092959194509250565b5f60208284031215613f83575f80fd5b81356001600160401b03811115613f98575f80fd5b820160a08185031215611323575f80fd5b805f5b6002811015613fcb578154845260209093019260019182019101613fac565b50505050565b60808101613fdf8284613fa9565b6105bd6040830160028501613fa9565b634e487b7160e01b5f52601160045260245ffd5b63ffffffff81811683821601908082111561130557611305613fef565b600181811c9082168061403457607f821691505b602082108103613d0357634e487b7160e01b5f52602260045260245ffd5b5f60208284031215614062575f80fd5b815163ffffffff81168114611323575f80fd5b5f60208284031215614085575f80fd5b81356001600160401b0381168114611323575f80fd5b5f808335601e198436030181126140b0575f80fd5b8301803591506001600160401b038211156140c9575f80fd5b60200191503681900382131561254e575f80fd5b5f80604083850312156140ee575f80fd5b505080516020909101519092909150565b634e487b7160e01b5f52603260045260245ffd5b5f8235609e19833603018112614127575f80fd5b9190910192915050565b602080825260159082015274109c9a5919d94e88195c1bd8da081b9bdd081cd95d605a1b604082015260600190565b818103818111156105bd576105bd613fef565b5f6001820161418457614184613fef565b5060010190565b5f805f806080858703121561419e575f80fd5b505082516020840151604085015160609095015191969095509092509050565b5f805f80608085870312156141d1575f80fd5b84516001600160401b038111156141e6575f80fd5b8501601f810187136141f6575f80fd5b8051614204613d9082613d4d565b818152886020838501011115614218575f80fd5b614229826020830160208601613bd5565b60208801516040890151606090990151919a909950909650945050505050565b8481526001600160401b0384166020820152608060408201525f6142706080830185613bf7565b905082606083015295945050505050565b85815260806020820152836080820152838560a08301375f60a08583018101919091526001600160a01b039390931660408201526001600160401b03919091166060820152601f909201601f19169091010192915050565b818382375f9101908152919050565b5f602082840312156142f8575f80fd5b5051919050565b606081525f6143116060830186613bf7565b905063ffffffff841660208301526001600160401b0383166040830152949350505050565b5f8085851115614344575f80fd5b83861115614350575f80fd5b5050820193919092039150565b634e487b7160e01b5f52601260045260245ffd5b5f8261437f5761437f61435d565b500490565b805f5b6002811015613fcb578151845260209384019390910190600101614387565b6143b08185614384565b6143bd6040820184614384565b608081019190915260a00192915050565b7f416363657373436f6e74726f6c3a206163636f756e742000000000000000000081525f8351614405816017850160208801613bd5565b7001034b99036b4b9b9b4b733903937b6329607d1b6017918401918201528351614436816028840160208801613bd5565b01602801949350505050565b80820281158282048414176105bd576105bd613fef565b808201808211156105bd576105bd613fef565b60ff60f81b8360f81b1681525f825161448c816001850160208701613bd5565b919091016001019392505050565b5f8251614127818460208701613bd5565b5f826144b9576144b961435d565b500690565b5f816144cc576144cc613fef565b505f190190565b634e487b7160e01b5f52603160045260245ffd5b6144f18185614384565b6144fe6040820184614384565b5f8251614512816080850160208701613bd5565b91909101608001949350505050565b6020808252818101527f4e65787456617255696e742c2076616c7565206f7574736964652072616e6765604082015260600190565b600181815b8085111561459057815f190482111561457657614576613fef565b8085161561458357918102915b93841c939080029061455b565b509250929050565b5f826145a6575060016105bd565b816145b257505f6105bd565b81600181146145c857600281146145d2576145ee565b60019150506105bd565b60ff8411156145e3576145e3613fef565b50506001821b6105bd565b5060208310610133831016604e8410600b8410161715614611575081810a6105bd565b61461b8383614556565b805f190482111561462e5761462e613fef565b029392505050565b5f611323838361459856fe30644e72e131a029b85045b68181585d97816a916871ca8d3c208c16d87cfd4797667070c54ef182b0f5858b034beac1b6f3089aa2d3188bb1e8929f4fa9b929a26469706673582212202c62d62bca58bd4b10ac4c45bbb84600bf3b60ce1ea0af202e7dd96b55741bc964736f6c63430008140033000000000000000000000000000000000000000000000000000000000000002000000000000000000000000000000000000000000000000000000000000000044579776100000000000000000000000000000000000000000000000000000000

0x6080604052600436106101ba575f3560e01c80638210a5bc116100f2578063c49baebe11610092578063d6fd317511610062578063d6fd317514610508578063d79de39e1461053b578063f5b541a61461055a578063f7260d3e1461057a575f80fd5b8063c49baebe14610484578063ca15c873146104b7578063d174ff82146104d6578063d547741f146104e9575f80fd5b806391d14854116100cd57806391d1485414610418578063a217fddf14610437578063b97dd9e21461044a578063c19d93fb1461045e575f80fd5b80638210a5bc146103ac5780639010d07c146103da57806391cdd9f0146103f9575f80fd5b806351f910661161015d57806356de96db1161013857806356de96db146103305780636e9cb0971461034f578063718da7ee1461036e57806379e997571461038d575f80fd5b806351f91066146102dc578063530e784f146102fd57806354fd4d501461031c575f80fd5b80632630c12f116101985780632630c12f146102515780632f2ff15d1461028857806331eab48a146102a957806336568abe146102bd575f80fd5b806301ffc9a7146101be578063056768bf146101f2578063248a9ca314610215575b5f80fd5b3480156101c9575f80fd5b506101dd6101d8366004613bae565b610599565b60405190151581526020015b60405180910390f35b3480156101fd575f80fd5b506102066105c3565b6040516101e993929190613c22565b348015610220575f80fd5b5061024361022f366004613c53565b5f9081526020819052604090206001015490565b6040519081526020016101e9565b34801561025c575f80fd5b50600454610270906001600160a01b031681565b6040516001600160a01b0390911681526020016101e9565b348015610293575f80fd5b506102a76102a2366004613c80565b610608565b005b3480156102b4575f80fd5b506102a7610631565b3480156102c8575f80fd5b506102a76102d7366004613c80565b6107ac565b3480156102e7575f80fd5b506102f061082f565b6040516101e99190613caa565b348015610308575f80fd5b506102a7610317366004613cbc565b6108bb565b348015610327575f80fd5b506102f0610977565b34801561033b575f80fd5b506102a761034a366004613cd5565b610984565b34801561035a575f80fd5b50610243610369366004613dc5565b6109f6565b348015610379575f80fd5b506102a7610388366004613cbc565b610ac1565b348015610398575f80fd5b506101dd6103a7366004613e33565b610b75565b3480156103b7575f80fd5b506101dd6103c6366004613c53565b60086020525f908152604090205460ff1681565b3480156103e5575f80fd5b506102706103f4366004613ea1565b61130c565b348015610404575f80fd5b506102a7610413366004613c53565b61132a565b348015610423575f80fd5b506101dd610432366004613c80565b611407565b348015610442575f80fd5b506102435f81565b348015610455575f80fd5b5061020661142f565b348015610469575f80fd5b506007546104779060ff1681565b6040516101e99190613ed5565b34801561048f575f80fd5b506102437f21702c8af46127c7fa207f89d0b0a8441bb32959a0ac7df790e9ab1a25c9892681565b3480156104c2575f80fd5b506102436104d1366004613c53565b611474565b6102a76104e4366004613efb565b61148a565b3480156104f4575f80fd5b506102a7610503366004613c80565b611789565b348015610513575f80fd5b506102437f3c63e605be3290ab6b04cfc46c6e1516e626d43236b034f09d7ede1d017beb0c81565b348015610546575f80fd5b506102a7610555366004613f73565b6117ad565b348015610565575f80fd5b506102435f8051602061466283398151915281565b348015610585575f80fd5b50600354610270906001600160a01b031681565b5f6001600160e01b03198216635a05180f60e01b14806105bd57506105bd82611a15565b92915050565b60605f8060115f016040516020016105db9190613fd1565b60408051808303601f19018152919052601754909460ff8216945061010090910463ffffffff1692509050565b5f8281526020819052604090206001015461062281611a49565b61062c8383611a53565b505050565b5f8051602061466283398151915261064881611a49565b6040805161012081019091526107199060098160a08101828160e084018260028282826020028201915b81548152602001906001019080831161067257505050918352505060408051808201918290526020909201919060028481019182845b8154815260200190600101908083116106a857505050919092525050508152604080518082018252600484015481526005840154602080830191909152830152600683015460ff811691830191909152610100900463ffffffff166060820152600790910154608090910152611a74565b1561076557610726611a8e565b60175461073f90610100900463ffffffff166001614003565b600f805463ffffffff929092166101000264ffffffff00199092169190911790556107a0565b600f5461077e90610100900463ffffffff166001614003565b600f805463ffffffff929092166101000264ffffffff00199092169190911790555b6107a95f611b9d565b50565b6001600160a01b03811633146108215760405162461bcd60e51b815260206004820152602f60248201527f416363657373436f6e74726f6c3a2063616e206f6e6c792072656e6f756e636560448201526e103937b632b9903337b91039b2b63360891b60648201526084015b60405180910390fd5b61082b8282611c08565b5050565b6006805461083c90614020565b80601f016020809104026020016040519081016040528092919081815260200182805461086890614020565b80156108b35780601f1061088a576101008083540402835291602001916108b3565b820191905f5260205f20905b81548152906001019060200180831161089657829003601f168201915b505050505081565b5f805160206146628339815191526108d281611a49565b6001600160a01b0382166109215760405162461bcd60e51b815260206004820152601660248201527542726964676556333a207a65726f206164647265737360501b6044820152606401610818565b600480546001600160a01b0319166001600160a01b0384169081179091556040519081527f6536690106168bdf4ba72c128a053d817999b1db90cae23f139b293bf862cb75906020015b60405180910390a15050565b6005805461083c90614020565b5f8051602061466283398151915261099b81611a49565b6007805483919060ff191660018360028111156109ba576109ba613ec1565b02179055506007546040517fc635bb75c392e81c891d50372a48cfa81b6799ac6d594cb4c28a8c5e8bef6e9b9161096b9160ff90911690613ed5565b5f8082806020019051810190610a0c9190614052565b6004549091505f906001600160a01b031663095c1566610a326080890160608a01614075565b610a3f60208a018a61409b565b60405160e085901b6001600160e01b03191681526001600160401b03909316600484015260248301525063ffffffff851660448201526064016040805180830381865afa158015610a92573d5f803e3d5ffd5b505050506040513d601f19601f82011682018060405250810190610ab691906140dd565b509695505050505050565b5f80516020614662833981519152610ad881611a49565b6001600160a01b038216610b275760405162461bcd60e51b815260206004820152601660248201527542726964676556333a207a65726f206164647265737360501b6044820152606401610818565b600380546001600160a01b0319166001600160a01b0384169081179091556040519081527fb68fd1a788a85f8f18de7976d851969ff9ff2216de81169c17a6f4ac94c23def9060200161096b565b5f7f21702c8af46127c7fa207f89d0b0a8441bb32959a0ac7df790e9ab1a25c98926610ba081611a49565b610ba8611c29565b600160075460ff166002811115610bc157610bc1613ec1565b03610c075760405162461bcd60e51b81526020600482015260166024820152754272696467653a20737461746520696e61637469766560501b6044820152606401610818565b5f5b838110156112f6575f610c48868684818110610c2757610c276140ff565b9050602002810190610c399190614113565b610c43908061409b565b611c80565b6010549091508103610d6f57604080516101208101918290526009805460e08301908152610d2093839160a0830191849183918390600290600a6101008901808311610672575050509183525050604080518082019182905260028481018054835260209485019492939092600387019085018083116106a857505050919092525050508152604080518082018252600484015481526005840154602080830191909152830152600683015460ff811691830191909152610100900463ffffffff166060820152600790910154608090910152611a74565b610d3c5760405162461bcd60e51b815260040161081890614131565b610d6a6009878785818110610d5357610d536140ff565b9050602002810190610d659190614113565b611ccb565b610eb5565b6018548103610e7757604080516101208101918290526011805460e08301908152610e4493839160a083019184918391839060029060126101008901808311610672575050509183525050604080518082019182905260028481018054835260209485019492939092600387019085018083116106a857505050919092525050508152604080518082018252600484015481526005840154602080830191909152830152600683015460ff811691830191909152610100900463ffffffff166060820152600790910154608090910152611a74565b610e605760405162461bcd60e51b815260040161081890614131565b610d6a6011878785818110610d5357610d536140ff565b60405162461bcd60e51b8152602060048201526013602482015272084e4d2c8ceca7440eee4dedcce40cae0dec6d606b1b6044820152606401610818565b5f610f5c878785818110610ecb57610ecb6140ff565b9050602002810190610edd9190614113565b610eeb90602081019061409b565b8080601f0160208091040260200160405190810160405280939291908181526020018383808284375f92019190915250610f5792508b91508a905087818110610f3657610f366140ff565b9050602002810190610f489190614113565b610f52908061409b565b611dc4565b611dd6565b90505f805f80610f6b85611f09565b935093509350935046816001600160401b031614610fc45760405162461bcd60e51b8152602060048201526016602482015275109c9a5919d94e881ddc9bdb99c818da185a5b881a5960521b6044820152606401610818565b5f8481526008602052604090205460ff16156110225760405162461bcd60e51b815260206004820152601f60248201527f4272696467653a207265717565737420696420616c7265616479207365656e006044820152606401610818565b5f848152600860205260408120805460ff1916600190811790915584516110499190614160565b9050806001600160401b0381111561106357611063613d09565b6040519080825280601f01601f19166020018201604052801561108d576020820181803683370190505b5095505f5b818110156110ef578481815181106110ac576110ac6140ff565b602001015160f81c60f81b8782815181106110c9576110c96140ff565b60200101906001600160f81b03191690815f1a9053506110e881614173565b9050611092565b5083600185516110ff9190614160565b8151811061110f5761110f6140ff565b01602001516001600160f81b031916600160f81b036112165785516080146111795760405162461bcd60e51b815260206004820152601e60248201527f4272696467653a20496e76616c6964206d657373616765206c656e67746800006044820152606401610818565b5f805f86806020019051810190611190919061418b565b50600354604051632c7f327760e11b8152600481018490526001600160401b038316602482015260448101859052606481018d905293965091945092506001600160a01b0316906358fe64ee906084015b5f604051808303815f87803b1580156111f8575f80fd5b505af115801561120a573d5f803e3d5ffd5b505050505050506112de565b83600185516112259190614160565b81518110611235576112356140ff565b01602001516001600160f81b0319165f0361129e575f805f8680602001905181019061126191906141be565b5060035460405163f137538b60e01b815293965091945092506001600160a01b03169063f137538b906111e1908590859088908e90600401614249565b60405162461bcd60e51b81526020600482015260156024820152744272696467653a2077726f6e67206d65737361676560581b6044820152606401610818565b50505050505050806112ef90614173565b9050610c09565b50600191506113056001600255565b5092915050565b5f8281526001602052604081206113239083611f55565b9392505050565b5f61133481611a49565b6040515f90339084908381818185875af1925050503d805f8114611373576040519150601f19603f3d011682016040523d82523d5f602084013e611378565b606091505b50509050806113c95760405162461bcd60e51b815260206004820152601e60248201527f42726964676556333a206661696c656420746f2073656e6420457468657200006044820152606401610818565b60408051338152602081018590527f810f4216b8f4ed8460c9944d3a3bee30521ce371329120f4cf59fad7ffd2e081910160405180910390a1505050565b5f918252602082815260408084206001600160a01b0393909316845291905290205460ff1690565b60605f8060095f016040516020016114479190613fd1565b60408051808303601f19018152919052600f54909460ff8216945061010090910463ffffffff1692509050565b5f8181526001602052604081206105bd90611f60565b7f3c63e605be3290ab6b04cfc46c6e1516e626d43236b034f09d7ede1d017beb0c6114b481611a49565b5f60075460ff1660028111156114cc576114cc613ec1565b146115125760405162461bcd60e51b81526020600482015260166024820152754272696467653a20737461746520696e61637469766560501b6044820152606401610818565b604080516101208101918290526011805460e083019081526115de93839160a083019184918391839060029060126101008901808311610672575050509183525050604080518082019182905260028481018054835260209485019492939092600387019085018083116106a857505050919092525050508152604080518082018252600484015481526005840154602080830191909152830152600683015460ff811691830191909152610100900463ffffffff166060820152600790910154608090910152611a74565b806116b05750604080516101208101918290526009805460e083019081526116b093839160a0830191849183918390600290600a6101008901808311610672575050509183525050604080518082019182905260028481018054835260209485019492939092600387019085018083116106a857505050919092525050508152604080518082018252600484015481526005840154602080830191909152830152600683015460ff811691830191909152610100900463ffffffff166060820152600790910154608090910152611a74565b6116cc5760405162461bcd60e51b815260040161081890614131565b60408501357f5566d73d091d945ab32ea023cd1930c0d43aa43bef9aee4cb029775cfc94bdae8635611701602089018961409b565b8461171260808c0160608d01614075565b604051611723959493929190614281565b60405180910390a17f3486f12e81927998a69cd0e6cd3978f4b1260266edb68145d92c6a32e080ddb3865f0135848060200190518101906117649190614052565b6040805192835263ffffffff90911660208301520160405180910390a1505050505050565b5f828152602081905260409020600101546117a381611a49565b61062c8383611c08565b7f21702c8af46127c7fa207f89d0b0a8441bb32959a0ac7df790e9ab1a25c989266117d781611a49565b5f61182b6117e8602085018561409b565b8080601f0160208091040260200160405190810160405280939291908181526020018383808284375f92019190915250610f579250610f5291508790508061409b565b90505f805f8061183a85611f69565b600f549397509195509350915063ffffffff8085169161186291610100909104166001614003565b63ffffffff16146118b55760405162461bcd60e51b815260206004820152601a60248201527f4272696467653a2077726f6e672065706f6368206e756d6265720000000000006044820152606401610818565b604080516101208101918290526009805460e0830190815261198193839160a0830191849183918390600290600a6101008901808311610672575050509183525050604080518082019182905260028481018054835260209485019492939092600387019085018083116106a857505050919092525050508152604080518082018252600484015481526005840154602080830191909152830152600683015460ff811691830191909152610100900463ffffffff166060820152600790910154608090910152611a74565b1561199957611991600988611ccb565b611999611a8e565b5f60026119a6898061409b565b6040516119b49291906142d9565b602060405180830381855afa1580156119cf573d5f803e3d5ffd5b5050506040513d601f19601f820116820180604052508101906119f291906142e8565b9050611a02600984848785611fb3565b611a0b85611b9d565b5050505050505050565b5f6001600160e01b03198216637965db0b60e01b14806105bd57506301ffc9a760e01b6001600160e01b03198316146105bd565b6107a981336120b5565b611a5d828261210e565b5f82815260016020526040902061062c9082612191565b805151515f901515806105bd575050515160200151151590565b600960118181611aa081836002613a65565b50611ab360028281019084810190613a65565b505050600482810154908201556005808301549082015560068083018054918301805460ff19811660ff9094169384178255915463ffffffff61010091829004160264ffffffffff19909216909217179055600791820154910155611b16613aa0565b8051805182916009918290611b2e9082906002613aed565b506020820151611b449060028084019190613aed565b50505060208281015180516004840155015160058201556040820151600682018054606085015163ffffffff166101000264ffffffffff1990911660ff9093169290921791909117905560809091015160079091015550565b6040517f7abd871edc50e0783b456da5e3441224a90207257b5a02f5b2410f905204e0c090611bd190600990602001613fd1565b60408051808303601f1901815290829052600f54611bfd9261010090910463ffffffff169085906142ff565b60405180910390a150565b611c1282826121a5565b5f82815260016020526040902061062c9082612209565b6002805403611c7a5760405162461bcd60e51b815260206004820152601f60248201527f5265656e7472616e637947756172643a207265656e7472616e742063616c6c006044820152606401610818565b60028055565b5f611323611c92604860288587614336565b8080601f0160208091040260200160405190810160405280939291908181526020018383808284375f9201919091525061221d92505050565b60408051610120810190915261082b90838160a08101828160e084018260028282826020028201915b815481526020019060010190808311611cf457505050918352505060408051808201918290526020909201919060028481019182845b815481526020019060010190808311611d2a57505050919092525050508152604080518082018252600484015481526005840154602080830191909152830152600683015460ff811691830191909152610100900463ffffffff166060820152600790910154608090910152611da0838061409b565b611dad604086018661409b565b611dba606088018861409b565b8860800135612277565b5f611323611c92606860488587614336565b60605f6060611de58583612445565b925090505f611df382612555565b90505f6021848851611e059190614160565b611e0f9190614371565b90505f805f5b83811015611eb757611e278a886125c3565b97509150611e358a8861267b565b9750925060ff82165f03611e5457611e4d8386612707565b9450611ea5565b8160ff16600103611e6957611e4d8584612707565b60405162461bcd60e51b815260206004820152601160248201527013595c9adb194e881c1c9bdd9948195bd9607a1b6044820152606401610818565b80611eaf81614173565b915050611e15565b50878414611efc5760405162461bcd60e51b815260206004820152601260248201527113595c9adb194e881c1c9bdd99481c9bdbdd60721b6044820152606401610818565b5092979650505050505050565b5f60605f805f611f19868261267b565b9095509050611f288682612782565b9092509050611f378682612850565b9093509050611f468682612445565b50949694955091939092509050565b5f61132383836128e7565b5f6105bd825490565b5f8060608180611f798682612782565b9095509050611f88868261290d565b9094509050611f9786826125c3565b9092509050611fa68682612445565b5094969395509092915050565b5f611fbd856129db565b90505f60405180604001604052805f81526020015f81525090505f80835f0151846020015183604051602001611ff5939291906143a6565b60405160208183030381529060405290505b8660ff1682101561203e578160a082015261202a8361202583612a17565b612ad3565b92508161203681614173565b925050612007565b835184908a906120519082906002613aed565b5060208201516120679060028084019190613aed565b5050835160048b01555050506020015160058701555060068501805463ffffffff9093166101000264ffffffffff1990931660ff909416939093179190911790915560079092019190915550565b6120bf8282611407565b61082b576120cc81612b6e565b6120d7836020612b80565b6040516020016120e89291906143ce565b60408051601f198184030181529082905262461bcd60e51b825261081891600401613caa565b6121188282611407565b61082b575f828152602081815260408083206001600160a01b03851684529091529020805460ff1916600117905561214d3390565b6001600160a01b0316816001600160a01b0316837f2f8788117e7eff1d82e926ec794901d17c78024a50270940304540a733656f0d60405160405180910390a45050565b5f611323836001600160a01b038416612d15565b6121af8282611407565b1561082b575f828152602081815260408083206001600160a01b0385168085529252808320805460ff1916905551339285917ff6391f5c32d9c69d2a47ea670b442974b53935d1edc7fd64eb21e047a839171b9190a45050565b5f611323836001600160a01b038416612d61565b5f815160201461226f5760405162461bcd60e51b815260206004820152601760248201527f6279746573206c656e677468206973206e6f742033322e0000000000000000006044820152606401610818565b506020015190565b6003886040015160ff16600261228d9190614442565b6122979190614371565b6122a082612e44565b116122ed5760405162461bcd60e51b815260206004820152601e60248201527f426c6f636b3a206e6f7420656e6f756768207061727469636970616e747300006044820152606401610818565b876040015160ff1660ff148061230d5750876040015160ff166001901b81105b6123525760405162461bcd60e51b8152602060048201526016602482015275426c6f636b3a206269746d61736b20746f6f2062696760501b6044820152606401610818565b6123f98886868080601f0160208091040260200160405190810160405280939291908181526020018383808284375f9201919091525050604080516020601f8e018190048102820181019092528c815292508c91508b90819084018382808284375f9201919091525050604080516020601f8b0181900481028201810190925289815292508991508890819084018382808284375f92019190915250889250612e72915050565b611a0b5760405162461bcd60e51b815260206004820152601860248201527f426c6f636b3a206d756c7469736967206d69736d6174636800000000000000006044820152606401610818565b60605f8061245385856130b0565b86519095509091506124658286614459565b1115801561247b57506124788185614459565b84105b6124d35760405162461bcd60e51b8152602060048201526024808201527f4e65787456617242797465732c206f66667365742065786365656473206d6178604482015263696d756d60e01b6064820152608401610818565b6060811580156124f15760405191505f82526020820160405261253b565b6040519150601f8316801560200281840101848101888315602002848c0101015b8183101561252a578051835260209283019201612512565b5050848452601f01601f1916604052505b50806125478387614459565b9350935050505b9250929050565b5f60025f8360405160200161256b92919061446c565b60408051601f19818403018152908290526125859161449a565b602060405180830381855afa1580156125a0573d5f803e3d5ffd5b5050506040513d601f19601f820116820180604052508101906105bd91906142e8565b5f8083518360016125d49190614459565b111580156125eb57506125e8836001614459565b83105b6126415760405162461bcd60e51b815260206004820152602160248201527f4e65787455696e74382c204f66667365742065786365656473206d6178696d756044820152606d60f81b6064820152608401610818565b5f60405184602087010151805f1a82535060018101604052601f8103519150508084600161266f9190614459565b92509250509250929050565b5f80835183602061268c9190614459565b111580156126a357506126a0836020614459565b83105b6126ef5760405162461bcd60e51b815260206004820181905260248201527f4e657874486173682c206f66667365742065786365656473206d6178696d756d6044820152606401610818565b5f6020840185015190508084602061266f9190614459565b604051600160f81b602082015260218101839052604181018290525f9060029060610160408051601f19818403018152908290526127449161449a565b602060405180830381855afa15801561275f573d5f803e3d5ffd5b5050506040513d601f19601f8201168201806040525081019061132391906142e8565b5f8083518360086127939190614459565b111580156127aa57506127a7836008614459565b83105b6128015760405162461bcd60e51b815260206004820152602260248201527f4e65787455696e7436342c206f66667365742065786365656473206d6178696d604482015261756d60f01b6064820152608401610818565b5f60405160085f600182038760208a0101515b838310156128345780821a83860153600183019250600182039150612814565b505050016040819052601f19015190508061266f856008614459565b5f8083518360146128619190614459565b111580156128785750612875836014614459565b83105b6128d05760405162461bcd60e51b815260206004820152602360248201527f4e657874416464726573732c206f66667365742065786365656473206d6178696044820152626d756d60e81b6064820152608401610818565b83830160200151606081901c61266f856014614459565b5f825f0182815481106128fc576128fc6140ff565b905f5260205f200154905092915050565b5f80835183600461291e9190614459565b111580156129355750612932836004614459565b83105b61298c5760405162461bcd60e51b815260206004820152602260248201527f4e65787455696e7433322c206f66667365742065786365656473206d6178696d604482015261756d60f01b6064820152608401610818565b5f60405160045f600182038760208a0101515b838310156129bf5780821a8386015360018301925060018203915061299f565b505050016040819052601f19015190508061266f856004614459565b6129e3613b1b565b6020828101516040840151606085015160809095015184519290925283518301528282018051949094529251019190915290565b604080518082019091525f80825260208201525f600283604051612a3b919061449a565b602060405180830381855afa158015612a56573d5f803e3d5ffd5b5050506040513d601f19601f82011682018060405250810190612a7991906142e8565b90505f612a935f80516020614642833981519152836144ab565b90505f5b612aa082613204565b90508015612ac1576040805180820190915291825260208201529392505050565b612acc600183614459565b9150612a97565b604080518082019091525f8082526020820152612aee613b40565b835181526020808501518183015283516040808401919091529084015160608301525f908360808460066107d05a03fa905080612b665760405162461bcd60e51b8152602060048201526016602482015275109b1cce88185919081c1bda5b9d1cc819985a5b195960521b6044820152606401610818565b505092915050565b60606105bd6001600160a01b03831660145b60605f612b8e836002614442565b612b99906002614459565b6001600160401b03811115612bb057612bb0613d09565b6040519080825280601f01601f191660200182016040528015612bda576020820181803683370190505b509050600360fc1b815f81518110612bf457612bf46140ff565b60200101906001600160f81b03191690815f1a905350600f60fb1b81600181518110612c2257612c226140ff565b60200101906001600160f81b03191690815f1a9053505f612c44846002614442565b612c4f906001614459565b90505b6001811115612cc6576f181899199a1a9b1b9c1cb0b131b232b360811b85600f1660108110612c8357612c836140ff565b1a60f81b828281518110612c9957612c996140ff565b60200101906001600160f81b03191690815f1a90535060049490941c93612cbf816144be565b9050612c52565b5083156113235760405162461bcd60e51b815260206004820181905260248201527f537472696e67733a20686578206c656e67746820696e73756666696369656e746044820152606401610818565b5f818152600183016020526040812054612d5a57508154600181810184555f8481526020808220909301849055845484825282860190935260409020919091556105bd565b505f6105bd565b5f8181526001830160205260408120548015612e3b575f612d83600183614160565b85549091505f90612d9690600190614160565b9050818114612df5575f865f018281548110612db457612db46140ff565b905f5260205f200154905080875f018481548110612dd457612dd46140ff565b5f918252602080832090910192909255918252600188019052604090208390555b8554869080612e0657612e066144d3565b600190038181905f5260205f20015f90559055856001015f8681526020019081526020015f205f9055600193505050506105bd565b5f9150506105bd565b5f5b8115612e6d57612e57600183614160565b9091169080612e6581614173565b915050612e46565b919050565b60208086015186518051908301516040515f9485936001938593612e98938591016143a6565b60405160208183030381529060405290505b896040015160ff16831015612ef9578186165f03612ee0578260a0820152612edd84612025612ed884612a17565b61323e565b93505b60019190911b9082612ef181614173565b935050612eaa565b604080516003808252608082019092525f91816020015b604080518082019091525f8082526020820152815260200190600190039081612f10575050604080516003808252608082019092529192505f9190602082015b612f58613b1b565b815260200190600190039081612f505750506040805180820182525f80825260208083019182528d0151928d015192825291909152909150612f999061323e565b825f81518110612fab57612fab6140ff565b6020908102919091018101919091528c51805190820151604051612feb93612fd79392918f91016144e7565b604051602081830303815290604052612a17565b82600181518110612ffe57612ffe6140ff565b6020026020010181905250858260028151811061301d5761301d6140ff565b60200260200101819052506130306132c7565b815f81518110613042576130426140ff565b60200260200101819052506130568b6129db565b81600181518110613069576130696140ff565b60200260200101819052508b5f01518160028151811061308b5761308b6140ff565b60200260200101819052506130a08282613387565b9c9b505050505050505050505050565b5f805f6130bd85856125c3565b945090505f60ff821660fd0361314a576130d786866136dc565b955061ffff16905060fd81108015906130f2575061ffff8111155b61313e5760405162461bcd60e51b815260206004820152601f60248201527f4e65787455696e7431362c2076616c7565206f7574736964652072616e6765006044820152606401610818565b925083915061254e9050565b8160ff1660fe0361319a5761315f868661290d565b955063ffffffff16905061ffff8111801561317e575063ffffffff8111155b61313e5760405162461bcd60e51b815260040161081890614521565b8160ff1660ff036131df576131af8686612782565b95506001600160401b0316905063ffffffff811161313e5760405162461bcd60e51b815260040161081890614521565b5060ff811660fd811061313e5760405162461bcd60e51b815260040161081890614521565b5f6105bd5f805160206146428339815191528061322385600383613792565b61322e906003614459565b61323891906144ab565b906137da565b604080518082019091525f808252602082015261325a826139af565b15613277575050604080518082019091525f808252602082015290565b6040518060400160405280835f015181526020015f8051602061464283398151915284602001516132a891906144ab565b6132bf905f80516020614642833981519152614160565b905292915050565b6132cf613b1b565b50604080516080810182527f198e9393920d483a7260bfb731fb5d25f1aa493335a9e71297e485b7aef312c28183019081527f1800deef121f1e76426a00665e5c4479674322d4f75edadd46debd5cd992f6ed6060830152815281518083019092527f090689d0585ff075ec9e99ad690c3395bc4b313370b38ef355acdadcd122975b82527f12c85ea5db8c6deb4aab71808dcb408fe3d1e7690c43d37b4ce6cc0166fa7daa60208381019190915281019190915290565b5f81518351146133d95760405162461bcd60e51b815260206004820152601960248201527f426c733a20706f696e7420636f756e74206d69736d61746368000000000000006044820152606401610818565b82515f6133e7826006614442565b90505f816001600160401b0381111561340257613402613d09565b60405190808252806020026020018201604052801561342b578160200160208202803683370190505b5090505f5b838110156136625786818151811061344a5761344a6140ff565b60200260200101515f0151828260066134639190614442565b61346d905f614459565b8151811061347d5761347d6140ff565b60200260200101818152505086818151811061349b5761349b6140ff565b602002602001015160200151828260066134b59190614442565b6134c0906001614459565b815181106134d0576134d06140ff565b6020026020010181815250508581815181106134ee576134ee6140ff565b6020908102919091010151515182613507836006614442565b613512906002614459565b81518110613522576135226140ff565b602002602001018181525050858181518110613540576135406140ff565b6020908102919091018101515101518261355b836006614442565b613566906003614459565b81518110613576576135766140ff565b602002602001018181525050858181518110613594576135946140ff565b6020026020010151602001515f600281106135b1576135b16140ff565b6020020151826135c2836006614442565b6135cd906004614459565b815181106135dd576135dd6140ff565b6020026020010181815250508581815181106135fb576135fb6140ff565b602002602001015160200151600160028110613619576136196140ff565b60200201518261362a836006614442565b613635906005614459565b81518110613645576136456140ff565b60209081029190910101528061365a81614173565b915050613430565b5061366b613b5e565b5f602082602086026020860160086107d05a03fa9050806136ce5760405162461bcd60e51b815260206004820152601d60248201527f426c733a2070616972696e67206f7065726174696f6e206661696c65640000006044820152606401610818565b505115159695505050505050565b5f8083518360026136ed9190614459565b111580156137045750613701836002614459565b83105b61375b5760405162461bcd60e51b815260206004820152602260248201527f4e65787455696e7431362c206f66667365742065786365656473206d6178696d604482015261756d60f01b6064820152608401610818565b5f604051846020870101518060011a8253805f1a60018301535060028101604052601e8103519150508084600261266f9190614459565b5f6040516020810160208152602080820152602060408201528560608201528460808201528360a082015260208260c08360055f19fa6137d0575f80fd5b5051949350505050565b5f6137e583836139c4565b6001146137f357505f6105bd565b825f0361380157505f6105bd565b61380c6004836144ab565b60030361383b57613834836004613824856001614459565b61382e9190614371565b84613792565b90506105bd565b5f613847600184614160565b90505f5b6138566002836144ab565b5f0361387b57613867600283614371565b9150613874816001614459565b905061384b565b60025b61388881866139c4565b5f19146138a15761389a816001614459565b905061387e565b5f6138c38760026138b3876001614459565b6138bd9190614371565b88613792565b90505f6138d1888689613792565b90505f6138df84878a613792565b9050845f80845b505f9050845b8382101561391c576001811461391c576139088160028e613792565b90508161391481614173565b9250506138ec565b815f0361393557869a50505050505050505050506105bd565b6139608560016139458588614160565b61394f9190614160565b61395a906002614636565b8e613792565b92508b61396d8480614442565b61397791906144ab565b94508b6139848489614442565b61398e91906144ab565b96508b61399b8688614442565b6139a591906144ab565b95508193506138e6565b80515f901580156105bd575050602001511590565b5f806139e78460026139d7600187614160565b6139e19190614371565b85613792565b90508015806139f65750806001145b15613a025790506105bd565b613a0d600184614160565b8103613a1d575f199150506105bd565b60405162461bcd60e51b815260206004820152601d60248201527f4661696c656420746f2063616c63756c617465206c6567656e6472652e0000006044820152606401610818565b8260028101928215613a90579182015b82811115613a90578254825591600101919060010190613a75565b50613a9c929150613b7c565b5090565b6040518060a00160405280613ab3613b1b565b8152602001613ad360405180604001604052805f81526020015f81525090565b81525f602082018190526040820181905260609091015290565b8260028101928215613a90579160200282015b82811115613a90578251825591602001919060010190613b00565b6040518060400160405280613b2e613b90565b8152602001613b3b613b90565b905290565b60405180608001604052806004906020820280368337509192915050565b60405180602001604052806001906020820280368337509192915050565b5b80821115613a9c575f8155600101613b7d565b60405180604001604052806002906020820280368337509192915050565b5f60208284031215613bbe575f80fd5b81356001600160e01b031981168114611323575f80fd5b5f5b83811015613bef578181015183820152602001613bd7565b50505f910152565b5f8151808452613c0e816020860160208601613bd5565b601f01601f19169290920160200192915050565b606081525f613c346060830186613bf7565b905060ff8416602083015263ffffffff83166040830152949350505050565b5f60208284031215613c63575f80fd5b5035919050565b80356001600160a01b0381168114612e6d575f80fd5b5f8060408385031215613c91575f80fd5b82359150613ca160208401613c6a565b90509250929050565b602081525f6113236020830184613bf7565b5f60208284031215613ccc575f80fd5b61132382613c6a565b5f60208284031215613ce5575f80fd5b813560038110611323575f80fd5b5f60808284031215613d03575f80fd5b50919050565b634e487b7160e01b5f52604160045260245ffd5b604051601f8201601f191681016001600160401b0381118282101715613d4557613d45613d09565b604052919050565b5f6001600160401b03821115613d6557613d65613d09565b50601f01601f191660200190565b5f82601f830112613d82575f80fd5b8135613d95613d9082613d4d565b613d1d565b818152846020838601011115613da9575f80fd5b816020850160208301375f918101602001919091529392505050565b5f805f60608486031215613dd7575f80fd5b83356001600160401b0380821115613ded575f80fd5b613df987838801613cf3565b9450613e0760208701613c6a565b93506040860135915080821115613e1c575f80fd5b50613e2986828701613d73565b9150509250925092565b5f8060208385031215613e44575f80fd5b82356001600160401b0380821115613e5a575f80fd5b818501915085601f830112613e6d575f80fd5b813581811115613e7b575f80fd5b8660208260051b8501011115613e8f575f80fd5b60209290920196919550909350505050565b5f8060408385031215613eb2575f80fd5b50508035926020909101359150565b634e487b7160e01b5f52602160045260245ffd5b6020810160038310613ef557634e487b7160e01b5f52602160045260245ffd5b91905290565b5f805f8060808587031215613f0e575f80fd5b84356001600160401b0380821115613f24575f80fd5b613f3088838901613cf3565b9550613f3e60208801613c6a565b9450604087013593506060870135915080821115613f5a575f80fd5b50613f6787828801613d73565b91505092959194509250565b5f60208284031215613f83575f80fd5b81356001600160401b03811115613f98575f80fd5b820160a08185031215611323575f80fd5b805f5b6002811015613fcb578154845260209093019260019182019101613fac565b50505050565b60808101613fdf8284613fa9565b6105bd6040830160028501613fa9565b634e487b7160e01b5f52601160045260245ffd5b63ffffffff81811683821601908082111561130557611305613fef565b600181811c9082168061403457607f821691505b602082108103613d0357634e487b7160e01b5f52602260045260245ffd5b5f60208284031215614062575f80fd5b815163ffffffff81168114611323575f80fd5b5f60208284031215614085575f80fd5b81356001600160401b0381168114611323575f80fd5b5f808335601e198436030181126140b0575f80fd5b8301803591506001600160401b038211156140c9575f80fd5b60200191503681900382131561254e575f80fd5b5f80604083850312156140ee575f80fd5b505080516020909101519092909150565b634e487b7160e01b5f52603260045260245ffd5b5f8235609e19833603018112614127575f80fd5b9190910192915050565b602080825260159082015274109c9a5919d94e88195c1bd8da081b9bdd081cd95d605a1b604082015260600190565b818103818111156105bd576105bd613fef565b5f6001820161418457614184613fef565b5060010190565b5f805f806080858703121561419e575f80fd5b505082516020840151604085015160609095015191969095509092509050565b5f805f80608085870312156141d1575f80fd5b84516001600160401b038111156141e6575f80fd5b8501601f810187136141f6575f80fd5b8051614204613d9082613d4d565b818152886020838501011115614218575f80fd5b614229826020830160208601613bd5565b60208801516040890151606090990151919a909950909650945050505050565b8481526001600160401b0384166020820152608060408201525f6142706080830185613bf7565b905082606083015295945050505050565b85815260806020820152836080820152838560a08301375f60a08583018101919091526001600160a01b039390931660408201526001600160401b03919091166060820152601f909201601f19169091010192915050565b818382375f9101908152919050565b5f602082840312156142f8575f80fd5b5051919050565b606081525f6143116060830186613bf7565b905063ffffffff841660208301526001600160401b0383166040830152949350505050565b5f8085851115614344575f80fd5b83861115614350575f80fd5b5050820193919092039150565b634e487b7160e01b5f52601260045260245ffd5b5f8261437f5761437f61435d565b500490565b805f5b6002811015613fcb578151845260209384019390910190600101614387565b6143b08185614384565b6143bd6040820184614384565b608081019190915260a00192915050565b7f416363657373436f6e74726f6c3a206163636f756e742000000000000000000081525f8351614405816017850160208801613bd5565b7001034b99036b4b9b9b4b733903937b6329607d1b6017918401918201528351614436816028840160208801613bd5565b01602801949350505050565b80820281158282048414176105bd576105bd613fef565b808201808211156105bd576105bd613fef565b60ff60f81b8360f81b1681525f825161448c816001850160208701613bd5565b919091016001019392505050565b5f8251614127818460208701613bd5565b5f826144b9576144b961435d565b500690565b5f816144cc576144cc613fef565b505f190190565b634e487b7160e01b5f52603160045260245ffd5b6144f18185614384565b6144fe6040820184614384565b5f8251614512816080850160208701613bd5565b91909101608001949350505050565b6020808252818101527f4e65787456617255696e742c2076616c7565206f7574736964652072616e6765604082015260600190565b600181815b8085111561459057815f190482111561457657614576613fef565b8085161561458357918102915b93841c939080029061455b565b509250929050565b5f826145a6575060016105bd565b816145b257505f6105bd565b81600181146145c857600281146145d2576145ee565b60019150506105bd565b60ff8411156145e3576145e3613fef565b50506001821b6105bd565b5060208310610133831016604e8410600b8410161715614611575081810a6105bd565b61461b8383614556565b805f190482111561462e5761462e613fef565b029392505050565b5f611323838361459856fe30644e72e131a029b85045b68181585d97816a916871ca8d3c208c16d87cfd4797667070c54ef182b0f5858b034beac1b6f3089aa2d3188bb1e8929f4fa9b929a26469706673582212202c62d62bca58bd4b10ac4c45bbb84600bf3b60ce1ea0af202e7dd96b55741bc964736f6c63430008140033

000000000000000000000000000000000000000000000000000000000000002000000000000000000000000000000000000000000000000000000000000000044579776100000000000000000000000000000000000000000000000000000000

-----Decoded View---------------
Arg [0] : tag_ (string): Eywa

-----Encoded View---------------
3 Constructor Arguments found :
Arg [0] : 0000000000000000000000000000000000000000000000000000000000000020
Arg [1] : 0000000000000000000000000000000000000000000000000000000000000004
Arg [2] : 4579776100000000000000000000000000000000000000000000000000000000