Contract Source Code (Solidity Standard Json-Input format)

IDE

• Blockscan IDE

More Options

• Similar
• Compare

// SPDX-License-Identifier: UNLICENSED
pragma solidity ^0.8.0;

import "./interfaces/IComputePool.sol";
import "./interfaces/IDomainRegistry.sol";
import "./interfaces/IRewardsDistributor.sol";
import "./interfaces/IRewardsDistributorFactory.sol";
import "@openzeppelin/contracts/access/extensions/AccessControlEnumerable.sol";
import "@openzeppelin/contracts/token/ERC20/IERC20.sol";
import "@openzeppelin/contracts/utils/cryptography/SignatureChecker.sol";
import {EnumerableSet} from "@openzeppelin/contracts/utils/structs/EnumerableSet.sol";
import {MessageHashUtils} from "@openzeppelin/contracts/utils/cryptography/MessageHashUtils.sol";

contract ComputePool is IComputePool, AccessControlEnumerable {
    using MessageHashUtils for bytes32;
    using EnumerableSet for EnumerableSet.AddressSet;

    struct PoolState {
        mapping(address => uint256) providerActiveNodes;
        EnumerableSet.AddressSet poolProviders;
        EnumerableSet.AddressSet poolNodes;
        mapping(address => bool) blacklistedProviders;
        mapping(address => bool) blacklistedNodes;
        IRewardsDistributor rewardsDistributor;
    }

    bytes32 public constant PRIME_ROLE = keccak256("PRIME_ROLE");
    bytes32 public constant FEDERATOR_ROLE = keccak256("FEDERATOR_ROLE");

    mapping(uint256 => PoolInfo) public pools;
    uint256 public poolIdCounter;
    IComputeRegistry public computeRegistry;
    IDomainRegistry public domainRegistry;
    IRewardsDistributorFactory public rewardsDistributorFactory;
    IERC20 public AIToken;

    mapping(uint256 => PoolState) private poolStates;

    modifier onlyExistingPool(uint256 poolId) {
        // check creator here since it's the only field that can't be 0
        require(pools[poolId].creator != address(0), "ComputePool: pool does not exist");
        _;
    }

    modifier onlyPoolCreatorOrManager(uint256 poolId) {
        require(
            pools[poolId].creator == msg.sender || pools[poolId].computeManagerKey == msg.sender,
            "ComputePool: only creator or manager can perform this action"
        );
        _;
    }

    modifier onlyValidProvider(uint256 poolId, address provider) {
        require(pools[poolId].status == PoolStatus.ACTIVE, "ComputePool: pool is not active");
        require(!poolStates[poolId].blacklistedProviders[provider], "ComputePool: provider is blacklisted");
        require(
            computeRegistry.getWhitelistStatus(provider),
            "ComputePool: provider has not been allowed to join pools by federator"
        );
        _;
    }

    constructor(
        address _primeAdmin,
        IDomainRegistry _domainRegistry,
        IComputeRegistry _computeRegistry,
        IRewardsDistributorFactory _rewardsDistributorFactory,
        IERC20 _AIToken
    ) {
        _grantRole(DEFAULT_ADMIN_ROLE, _primeAdmin);
        _grantRole(PRIME_ROLE, _primeAdmin);
        poolIdCounter = 0;
        AIToken = _AIToken;
        computeRegistry = _computeRegistry;
        domainRegistry = _domainRegistry;
        rewardsDistributorFactory = _rewardsDistributorFactory;
        address federator = IAccessControlEnumerable(address(_primeAdmin)).getRoleMember(FEDERATOR_ROLE, 0);
        _grantRole(FEDERATOR_ROLE, federator);
    }

    function _verifyPoolInvite(
        uint256 domainId,
        uint256 poolId,
        address computeManagerKey,
        address nodekey,
        bytes memory signature
    ) internal view returns (bool) {
        bytes32 messageHash = keccak256(abi.encodePacked(domainId, poolId, nodekey)).toEthSignedMessageHash();
        return SignatureChecker.isValidSignatureNow(computeManagerKey, messageHash, signature);
    }

    function _removeNodeSafe(uint256 poolId, address provider, address node) internal {
        (address node_provider, uint32 computeUnits,,) = computeRegistry.getNodeContractData(node);
        if (node_provider == provider) {
            _removeNode(poolId, provider, node, computeUnits);
            emit ComputePoolLeft(poolId, provider, node);
        }
    }

    function _removeNode(uint256 poolId, address provider, address nodekey, uint32 computeUnits) internal {
        // WARNING: order here is VERY important, computeUnits must be removed AFTER leavePool
        poolStates[poolId].poolNodes.remove(nodekey);
        poolStates[poolId].rewardsDistributor.leavePool(nodekey);
        pools[poolId].totalCompute -= computeUnits;
        poolStates[poolId].providerActiveNodes[provider]--;
        computeRegistry.updateNodeStatus(provider, nodekey, false);
    }

    function _addNode(uint256 poolId, address provider, address nodekey, uint32 computeUnits) internal {
        // WARNING: order here is VERY important, computeUnits must be added AFTER joinPool
        poolStates[poolId].poolNodes.add(nodekey);
        poolStates[poolId].rewardsDistributor.joinPool(nodekey);
        pools[poolId].totalCompute += computeUnits;
        poolStates[poolId].providerActiveNodes[provider]++;
        computeRegistry.updateNodeStatus(provider, nodekey, true);
    }

    function createComputePool(
        uint256 domainId,
        address computeManagerKey,
        string calldata poolName,
        string calldata poolDataURI,
        uint256 computeLimit
    ) external onlyRole(FEDERATOR_ROLE) returns (uint256) {
        require(domainRegistry.get(domainId).domainId == domainId, "ComputePool: domain does not exist");

        pools[poolIdCounter] = PoolInfo({
            poolId: poolIdCounter,
            domainId: domainId,
            poolName: poolName,
            creator: msg.sender,
            computeManagerKey: computeManagerKey,
            creationTime: block.timestamp,
            startTime: 0,
            endTime: 0,
            poolDataURI: poolDataURI,
            poolValidationLogic: address(0),
            totalCompute: 0,
            computeLimit: computeLimit,
            status: PoolStatus.PENDING
        });

        poolStates[poolIdCounter].rewardsDistributor =
            rewardsDistributorFactory.createRewardsDistributor(computeRegistry, poolIdCounter);

        poolIdCounter++;

        emit ComputePoolCreated(poolIdCounter - 1, domainId, msg.sender);

        return poolIdCounter - 1;
    }

    function startComputePool(uint256 poolId) external onlyExistingPool(poolId) onlyPoolCreatorOrManager(poolId) {
        require(pools[poolId].status == PoolStatus.PENDING, "ComputePool: pool is not pending");

        pools[poolId].startTime = block.timestamp;
        pools[poolId].status = PoolStatus.ACTIVE;

        emit ComputePoolStarted(poolId, block.timestamp);
    }

    function endComputePool(uint256 poolId) external onlyExistingPool(poolId) onlyPoolCreatorOrManager(poolId) {
        require(pools[poolId].status == PoolStatus.ACTIVE, "ComputePool: pool is not active");

        pools[poolId].endTime = block.timestamp;
        pools[poolId].status = PoolStatus.COMPLETED;

        poolStates[poolId].rewardsDistributor.endRewards();

        emit ComputePoolEnded(poolId);
    }

    function _joinComputePool(uint256 poolId, address provider, address[] memory nodekey, bytes[] memory signatures)
        internal
    {
        for (uint256 i = 0; i < nodekey.length; i++) {
            require(!poolStates[poolId].blacklistedNodes[nodekey[i]], "ComputePool: node is blacklisted");
        }

        if (!poolStates[poolId].poolProviders.contains(provider)) {
            poolStates[poolId].poolProviders.add(provider);
        }
        for (uint256 i = 0; i < nodekey.length; i++) {
            (address node_provider, uint32 computeUnits, bool isActive, bool isValidated) =
                computeRegistry.getNodeContractData(nodekey[i]);
            require(node_provider == provider, "ComputePool: node does not exist or not owned by provider");
            require(isActive == false, "ComputePool: node can only be in one pool at a time");
            require(isValidated, "ComputePool: node is not validated");
            require(
                _verifyPoolInvite(
                    pools[poolId].domainId, poolId, pools[poolId].computeManagerKey, nodekey[i], signatures[i]
                ),
                "ComputePool: invalid invite"
            );
            uint256 addedCompute = pools[poolId].totalCompute + computeUnits;
            if (pools[poolId].computeLimit > 0) {
                require(addedCompute < pools[poolId].computeLimit, "ComputePool: pool is at capacity");
            }
            _addNode(poolId, provider, nodekey[i], computeUnits);
        }
    }

    function joinComputePool(uint256 poolId, address provider, address nodekey, bytes memory signature)
        external
        onlyExistingPool(poolId)
        onlyValidProvider(poolId, provider)
    {
        require(msg.sender == provider, "ComputePool: only provider can join pool");

        address[] memory nodekeys = new address[](1);
        bytes[] memory signatures = new bytes[](1);
        nodekeys[0] = nodekey;
        signatures[0] = signature;

        _joinComputePool(poolId, provider, nodekeys, signatures);

        emit ComputePoolJoined(poolId, provider, nodekeys);
    }

    function joinComputePool(uint256 poolId, address provider, address[] memory nodekey, bytes[] memory signatures)
        external
        onlyExistingPool(poolId)
        onlyValidProvider(poolId, provider)
    {
        require(msg.sender == provider, "ComputePool: only provider can join pool");

        _joinComputePool(poolId, provider, nodekey, signatures);

        emit ComputePoolJoined(poolId, provider, nodekey);
    }

    function _leaveComputePool(uint256 poolId, address provider, address[] memory nodekeys) internal {
        if (nodekeys.length == 0) {
            // Remove all nodes belonging to that provider
            address[] memory nodes = poolStates[poolId].poolNodes.values();
            for (uint256 i = 0; i < nodes.length; ++i) {
                _removeNodeSafe(poolId, provider, nodes[i]);
            }
        } else {
            // Just remove the listed nodes
            for (uint256 i = 0; i < nodekeys.length; i++) {
                _removeNodeSafe(poolId, provider, nodekeys[i]);
            }
        }
        if (poolStates[poolId].providerActiveNodes[provider] == 0) {
            poolStates[poolId].poolProviders.remove(provider);
        }
    }

    function leaveComputePool(uint256 poolId, address provider, address nodekey) external onlyExistingPool(poolId) {
        require(msg.sender == provider, "ComputePool: only provider can leave pool");

        if (nodekey == address(0)) {
            address[] memory nodekeys = new address[](0);
            _leaveComputePool(poolId, provider, nodekeys);
        } else {
            address[] memory nodekeys = new address[](1);
            nodekeys[0] = nodekey;
            _leaveComputePool(poolId, provider, nodekeys);
        }
    }

    function leaveComputePool(uint256 poolId, address provider, address[] memory nodekeys)
        external
        onlyExistingPool(poolId)
    {
        require(msg.sender == provider, "ComputePool: only provider can leave pool");

        _leaveComputePool(poolId, provider, nodekeys);
    }

    function changeComputePool(
        uint256 fromPoolId,
        uint256 toPoolId,
        address[] memory nodekeys,
        bytes[] memory signatures
    ) external onlyExistingPool(fromPoolId) onlyExistingPool(toPoolId) {
        require(pools[toPoolId].status == PoolStatus.ACTIVE, "ComputePool: dest pool is not ready");
        address provider = msg.sender;

        if (nodekeys.length == poolStates[fromPoolId].providerActiveNodes[provider]) {
            // If all nodes are being moved, just move the provider
            _leaveComputePool(fromPoolId, provider, new address[](0));
        } else {
            _leaveComputePool(fromPoolId, provider, nodekeys);
        }
        _joinComputePool(toPoolId, provider, nodekeys, signatures);
    }

    //
    // Management functions
    //
    function updateComputePoolURI(uint256 poolId, string calldata poolDataURI)
        external
        onlyExistingPool(poolId)
        onlyPoolCreatorOrManager(poolId)
    {
        pools[poolId].poolDataURI = poolDataURI;

        emit ComputePoolURIUpdated(poolId, poolDataURI);
    }

    function updateComputeLimit(uint256 poolId, uint256 computeLimit)
        external
        onlyExistingPool(poolId)
        onlyPoolCreatorOrManager(poolId)
    {
        pools[poolId].computeLimit = computeLimit;

        emit ComputePoolLimitUpdated(poolId, computeLimit);
    }

    function ejectNode(uint256 poolId, address nodekey)
        external
        onlyExistingPool(poolId)
        onlyPoolCreatorOrManager(poolId)
    {
        require(poolStates[poolId].poolNodes.contains(nodekey), "ComputePool: node not in pool");

        (address node_provider, uint32 computeUnits,,) = computeRegistry.getNodeContractData(nodekey);
        _removeNode(poolId, node_provider, nodekey, computeUnits);

        if (poolStates[poolId].providerActiveNodes[node_provider] == 0) {
            poolStates[poolId].poolProviders.remove(node_provider);
        }

        emit ComputePoolNodeEjected(poolId, node_provider, nodekey);
    }

    function _blacklistProvider(uint256 poolId, address provider) internal {
        // Add to blacklist set
        poolStates[poolId].blacklistedProviders[provider] = true;
        emit ComputePoolProviderBlacklisted(poolId, provider);
    }

    function blacklistProvider(uint256 poolId, address provider)
        external
        onlyExistingPool(poolId)
        onlyPoolCreatorOrManager(poolId)
    {
        require(provider != address(0), "ComputePool: provider cannot be zero address");

        _blacklistProvider(poolId, provider);
    }

    function blacklistProviderList(uint256 poolId, address[] memory providers)
        external
        onlyExistingPool(poolId)
        onlyPoolCreatorOrManager(poolId)
    {
        for (uint256 i = 0; i < providers.length; i++) {
            if (providers[i] != address(0)) {
                _blacklistProvider(poolId, providers[i]);
            }
        }
    }

    function _purgeProvider(uint256 poolId, address provider) internal {
        address[] memory provider_nodes = computeRegistry.getProviderValidatedNodes(provider, true);
        for (uint256 i = 0; i < provider_nodes.length; i++) {
            if (poolStates[poolId].poolNodes.contains(provider_nodes[i])) {
                (address node_provider, uint32 computeUnits,,) = computeRegistry.getNodeContractData(provider_nodes[i]);
                if (node_provider == provider) {
                    _removeNode(poolId, provider, provider_nodes[i], computeUnits);
                }
            }
        }

        emit ComputePoolPurgedProvider(poolId, provider);

        // Remove from active set
        poolStates[poolId].poolProviders.remove(provider);
    }

    function purgeProvider(uint256 poolId, address provider)
        external
        onlyExistingPool(poolId)
        onlyPoolCreatorOrManager(poolId)
    {
        require(provider != address(0), "ComputePool: provider cannot be zero address");

        _purgeProvider(poolId, provider);
    }

    function blacklistAndPurgeProvider(uint256 poolId, address provider)
        external
        onlyExistingPool(poolId)
        onlyPoolCreatorOrManager(poolId)
    {
        require(provider != address(0), "ComputePool: provider cannot be zero address");

        _blacklistProvider(poolId, provider);
        _purgeProvider(poolId, provider);
    }

    function _blacklistNode(uint256 poolId, address nodekey) internal {
        address node_provider = address(0);
        if (poolStates[poolId].poolNodes.contains(nodekey)) {
            uint32 computeUnits = 0;
            (node_provider, computeUnits,,) = computeRegistry.getNodeContractData(nodekey);
            if (node_provider != address(0)) {
                _removeNode(poolId, node_provider, nodekey, computeUnits);
                if (poolStates[poolId].providerActiveNodes[node_provider] == 0) {
                    poolStates[poolId].poolProviders.remove(node_provider);
                }
            }
        }
        poolStates[poolId].blacklistedNodes[nodekey] = true;
        emit ComputePoolNodeBlacklisted(poolId, node_provider, nodekey);
    }

    function blacklistNode(uint256 poolId, address nodekey)
        external
        onlyExistingPool(poolId)
        onlyPoolCreatorOrManager(poolId)
    {
        _blacklistNode(poolId, nodekey);
    }

    function blacklistNodeList(uint256 poolId, address[] memory nodekeys)
        external
        onlyExistingPool(poolId)
        onlyPoolCreatorOrManager(poolId)
    {
        for (uint256 i = 0; i < nodekeys.length; i++) {
            _blacklistNode(poolId, nodekeys[i]);
        }
    }

    //
    // View functions
    //
    function getComputePool(uint256 poolId) external view returns (PoolInfo memory) {
        return pools[poolId];
    }

    function getComputePoolProviders(uint256 poolId) external view returns (address[] memory) {
        return poolStates[poolId].poolProviders.values();
    }

    function getComputePoolNodes(uint256 poolId) external view returns (address[] memory) {
        return poolStates[poolId].poolNodes.values();
    }

    function getProviderActiveNodesInPool(uint256 poolId, address provider) external view returns (uint256) {
        return poolStates[poolId].providerActiveNodes[provider];
    }

    function getRewardToken() external view returns (address) {
        return address(AIToken);
    }

    function getRewardDistributorForPool(uint256 poolId) external view returns (IRewardsDistributor) {
        return poolStates[poolId].rewardsDistributor;
    }

    function getComputePoolTotalCompute(uint256 poolId) external view returns (uint256) {
        return pools[poolId].totalCompute;
    }

    function isProviderBlacklistedFromPool(uint256 poolId, address provider) external view returns (bool) {
        return poolStates[poolId].blacklistedProviders[provider];
    }

    function isNodeBlacklistedFromPool(uint256 poolId, address nodekey) external view returns (bool) {
        return poolStates[poolId].blacklistedNodes[nodekey];
    }

    function isNodeInPool(uint256 poolId, address nodekey) external view returns (bool) {
        return poolStates[poolId].poolNodes.contains(nodekey);
    }

    function isProviderInPool(uint256 poolId, address provider) external view returns (bool) {
        return poolStates[poolId].poolProviders.contains(provider);
    }
}

// SPDX-License-Identifier: UNLICENSED
pragma solidity ^0.8.0;

import "./IComputeRegistry.sol";
import "./IRewardsDistributor.sol";
import "@openzeppelin/contracts/access/extensions/IAccessControlEnumerable.sol";

event ComputePoolCreated(uint256 indexed poolId, uint256 indexed domainId, address indexed creator);

event ComputePoolStarted(uint256 indexed poolId, uint256 timestamp);

event ComputePoolEnded(uint256 indexed poolId);

event ComputePoolURIUpdated(uint256 indexed poolId, string uri);

event ComputePoolLimitUpdated(uint256 indexed poolId, uint256 limit);

event ComputePoolJoined(uint256 indexed poolId, address indexed provider, address[] nodekeys);

event ComputePoolLeft(uint256 indexed poolId, address indexed provider, address nodekey);

event ComputePoolNodeEjected(uint256 indexed poolId, address indexed provider, address nodekey);

event ComputePoolPurgedProvider(uint256 indexed poolId, address indexed provider);

event ComputePoolProviderBlacklisted(uint256 indexed poolId, address indexed provider);

event ComputePoolNodeBlacklisted(uint256 indexed poolId, address indexed provider, address nodekey);

interface IComputePool is IAccessControlEnumerable {
    enum PoolStatus {
        PENDING,
        ACTIVE,
        COMPLETED
    }

    struct PoolInfo {
        uint256 poolId;
        uint256 domainId;
        string poolName;
        address creator;
        address computeManagerKey;
        uint256 creationTime;
        uint256 startTime;
        uint256 endTime;
        string poolDataURI;
        address poolValidationLogic;
        uint256 totalCompute;
        uint256 computeLimit;
        PoolStatus status;
    }

    // Note: computeLimit == 0 implies no limit
    function createComputePool(
        uint256 domainId,
        address computeManagerKey,
        string calldata poolName,
        string calldata poolDataURI,
        uint256 computeLimit
    ) external returns (uint256);
    function startComputePool(uint256 poolId) external;
    function endComputePool(uint256 poolId) external;
    function joinComputePool(uint256 poolId, address provider, address nodekeys, bytes memory signature) external;
    function joinComputePool(uint256 poolId, address provider, address[] memory nodekeys, bytes[] memory signatures)
        external;
    function leaveComputePool(uint256 poolId, address provider, address nodekey) external;
    function leaveComputePool(uint256 poolId, address provider, address[] memory nodekeys) external;
    function changeComputePool(
        uint256 fromPoolId,
        uint256 toPoolId,
        address[] memory nodekeys,
        bytes[] memory signatures
    ) external;
    function updateComputePoolURI(uint256 poolId, string calldata poolDataURI) external;
    function updateComputeLimit(uint256 poolId, uint256 computeLimit) external;
    function purgeProvider(uint256 poolId, address provider) external;
    function ejectNode(uint256 poolId, address nodekey) external;
    function blacklistProvider(uint256 poolId, address provider) external;
    function blacklistProviderList(uint256 poolId, address[] memory providers) external;
    function blacklistAndPurgeProvider(uint256 poolId, address provider) external;
    function blacklistNode(uint256 poolId, address nodekey) external;
    function blacklistNodeList(uint256 poolId, address[] memory nodekeys) external;
    function getComputePool(uint256 poolId) external view returns (PoolInfo memory);
    function getComputePoolProviders(uint256 poolId) external view returns (address[] memory);
    function getComputePoolNodes(uint256 poolId) external view returns (address[] memory);
    function getComputePoolTotalCompute(uint256 poolId) external view returns (uint256);
    function getProviderActiveNodesInPool(uint256 poolId, address provider) external view returns (uint256);
    function getRewardToken() external view returns (address);
    function getRewardDistributorForPool(uint256 poolId) external view returns (IRewardsDistributor);
    function isNodeInPool(uint256 poolId, address nodekey) external view returns (bool);
    function isProviderInPool(uint256 poolId, address provider) external view returns (bool);
    function isProviderBlacklistedFromPool(uint256 poolId, address provider) external returns (bool);
    function isNodeBlacklistedFromPool(uint256 poolId, address nodekey) external returns (bool);
}

// SPDX-License-Identifier: UNLICENSED
pragma solidity ^0.8.0;

import "./IWorkValidation.sol";
import "./IComputePool.sol";
import "@openzeppelin/contracts/access/extensions/IAccessControlEnumerable.sol";

event DomainCreated(string domainName, uint256 domainId);

event DomainUpdated(uint256 domainId, address validationLogic, string domainParametersURI);

interface IDomainRegistry is IAccessControlEnumerable {
    struct Domain {
        uint256 domainId;
        string name;
        IWorkValidation validationLogic;
        string domainParametersURI;
        IComputePool computePool;
    }

    function create(
        string calldata name,
        IComputePool computePool,
        IWorkValidation validationContract,
        string calldata domainParametersURI
    ) external returns (uint256);
    function updateValidationLogic(uint256 domainId, address validationContract) external;
    function updateParameters(uint256 domainId, string calldata domainParametersURI) external;
    function get(uint256 domainId) external view returns (Domain memory);
}

// SPDX-License-Identifier: UNLICENSED
pragma solidity ^0.8.0;

event RewardRate(uint256 indexed poolId, uint256 rate);

event RewardsClaimed(uint256 indexed poolId, address indexed provider, address indexed nodekey, uint256 reward);

interface IRewardsDistributor {
    function calculateRewards(address node) external view returns (uint256);
    function claimRewards(address node) external;
    function setRewardRate(uint256 newRate) external;
    function endRewards() external;
    function joinPool(address node) external;
    function leavePool(address node) external;
}

// SPDX-License-Identifier: UNLICENSED
pragma solidity ^0.8.0;

import "./IComputePool.sol";
import "./IComputeRegistry.sol";
import "./IRewardsDistributor.sol";
import "@openzeppelin/contracts/access/IAccessControl.sol";

interface IRewardsDistributorFactory is IAccessControl {
    function setComputePool(IComputePool _computePool) external;
    function createRewardsDistributor(IComputeRegistry _computeRegistry, uint256 _poolId)
        external
        returns (IRewardsDistributor);
}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.1.0) (access/extensions/AccessControlEnumerable.sol)

pragma solidity ^0.8.20;

import {IAccessControlEnumerable} from "./IAccessControlEnumerable.sol";
import {AccessControl} from "../AccessControl.sol";
import {EnumerableSet} from "../../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 role => 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 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 returns (uint256) {
        return _roleMembers[role].length();
    }

    /**
     * @dev Return all accounts that have `role`
     *
     * 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 getRoleMembers(bytes32 role) public view virtual returns (address[] memory) {
        return _roleMembers[role].values();
    }

    /**
     * @dev Overload {AccessControl-_grantRole} to track enumerable memberships
     */
    function _grantRole(bytes32 role, address account) internal virtual override returns (bool) {
        bool granted = super._grantRole(role, account);
        if (granted) {
            _roleMembers[role].add(account);
        }
        return granted;
    }

    /**
     * @dev Overload {AccessControl-_revokeRole} to track enumerable memberships
     */
    function _revokeRole(bytes32 role, address account) internal virtual override returns (bool) {
        bool revoked = super._revokeRole(role, account);
        if (revoked) {
            _roleMembers[role].remove(account);
        }
        return revoked;
    }
}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.1.0) (token/ERC20/IERC20.sol)

pragma solidity ^0.8.20;

/**
 * @dev Interface of the ERC-20 standard as defined in the ERC.
 */
interface IERC20 {
    /**
     * @dev Emitted when `value` tokens are moved from one account (`from`) to
     * another (`to`).
     *
     * Note that `value` may be zero.
     */
    event Transfer(address indexed from, address indexed to, uint256 value);

    /**
     * @dev Emitted when the allowance of a `spender` for an `owner` is set by
     * a call to {approve}. `value` is the new allowance.
     */
    event Approval(address indexed owner, address indexed spender, uint256 value);

    /**
     * @dev Returns the value of tokens in existence.
     */
    function totalSupply() external view returns (uint256);

    /**
     * @dev Returns the value of tokens owned by `account`.
     */
    function balanceOf(address account) external view returns (uint256);

    /**
     * @dev Moves a `value` amount of tokens from the caller's account to `to`.
     *
     * Returns a boolean value indicating whether the operation succeeded.
     *
     * Emits a {Transfer} event.
     */
    function transfer(address to, uint256 value) external returns (bool);

    /**
     * @dev Returns the remaining number of tokens that `spender` will be
     * allowed to spend on behalf of `owner` through {transferFrom}. This is
     * zero by default.
     *
     * This value changes when {approve} or {transferFrom} are called.
     */
    function allowance(address owner, address spender) external view returns (uint256);

    /**
     * @dev Sets a `value` amount of tokens as the allowance of `spender` over the
     * caller's tokens.
     *
     * Returns a boolean value indicating whether the operation succeeded.
     *
     * IMPORTANT: Beware that changing an allowance with this method brings the risk
     * that someone may use both the old and the new allowance by unfortunate
     * transaction ordering. One possible solution to mitigate this race
     * condition is to first reduce the spender's allowance to 0 and set the
     * desired value afterwards:
     * https://github.com/ethereum/EIPs/issues/20#issuecomment-263524729
     *
     * Emits an {Approval} event.
     */
    function approve(address spender, uint256 value) external returns (bool);

    /**
     * @dev Moves a `value` amount of tokens from `from` to `to` using the
     * allowance mechanism. `value` is then deducted from the caller's
     * allowance.
     *
     * Returns a boolean value indicating whether the operation succeeded.
     *
     * Emits a {Transfer} event.
     */
    function transferFrom(address from, address to, uint256 value) external returns (bool);
}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.1.0) (utils/cryptography/SignatureChecker.sol)

pragma solidity ^0.8.20;

import {ECDSA} from "./ECDSA.sol";
import {IERC1271} from "../../interfaces/IERC1271.sol";

/**
 * @dev Signature verification helper that can be used instead of `ECDSA.recover` to seamlessly support both ECDSA
 * signatures from externally owned accounts (EOAs) as well as ERC-1271 signatures from smart contract wallets like
 * Argent and Safe Wallet (previously Gnosis Safe).
 */
library SignatureChecker {
    /**
     * @dev Checks if a signature is valid for a given signer and data hash. If the signer is a smart contract, the
     * signature is validated against that smart contract using ERC-1271, otherwise it's validated using `ECDSA.recover`.
     *
     * NOTE: Unlike ECDSA signatures, contract signatures are revocable, and the outcome of this function can thus
     * change through time. It could return true at block N and false at block N+1 (or the opposite).
     */
    function isValidSignatureNow(address signer, bytes32 hash, bytes memory signature) internal view returns (bool) {
        if (signer.code.length == 0) {
            (address recovered, ECDSA.RecoverError err, ) = ECDSA.tryRecover(hash, signature);
            return err == ECDSA.RecoverError.NoError && recovered == signer;
        } else {
            return isValidERC1271SignatureNow(signer, hash, signature);
        }
    }

    /**
     * @dev Checks if a signature is valid for a given signer and data hash. The signature is validated
     * against the signer smart contract using ERC-1271.
     *
     * NOTE: Unlike ECDSA signatures, contract signatures are revocable, and the outcome of this function can thus
     * change through time. It could return true at block N and false at block N+1 (or the opposite).
     */
    function isValidERC1271SignatureNow(
        address signer,
        bytes32 hash,
        bytes memory signature
    ) internal view returns (bool) {
        (bool success, bytes memory result) = signer.staticcall(
            abi.encodeCall(IERC1271.isValidSignature, (hash, signature))
        );
        return (success &&
            result.length >= 32 &&
            abi.decode(result, (bytes32)) == bytes32(IERC1271.isValidSignature.selector));
    }
}

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

pragma solidity ^0.8.20;

/**
 * @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 is the index of the value in the `values` array plus 1.
        // Position 0 is used to mean a value is not in the set.
        mapping(bytes32 value => uint256) _positions;
    }

    /**
     * @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._positions[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 cache the value's position to prevent multiple reads from the same storage slot
        uint256 position = set._positions[value];

        if (position != 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 valueIndex = position - 1;
            uint256 lastIndex = set._values.length - 1;

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

                // Move the lastValue to the index where the value to delete is
                set._values[valueIndex] = lastValue;
                // Update the tracked position of the lastValue (that was just moved)
                set._positions[lastValue] = position;
            }

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

            // Delete the tracked position for the deleted slot
            delete set._positions[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._positions[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;

        assembly ("memory-safe") {
            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;

        assembly ("memory-safe") {
            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;

        assembly ("memory-safe") {
            result := store
        }

        return result;
    }
}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.1.0) (utils/cryptography/MessageHashUtils.sol)

pragma solidity ^0.8.20;

import {Strings} from "../Strings.sol";

/**
 * @dev Signature message hash utilities for producing digests to be consumed by {ECDSA} recovery or signing.
 *
 * The library provides methods for generating a hash of a message that conforms to the
 * https://eips.ethereum.org/EIPS/eip-191[ERC-191] and https://eips.ethereum.org/EIPS/eip-712[EIP 712]
 * specifications.
 */
library MessageHashUtils {
    /**
     * @dev Returns the keccak256 digest of an ERC-191 signed data with version
     * `0x45` (`personal_sign` messages).
     *
     * The digest is calculated by prefixing a bytes32 `messageHash` with
     * `"\x19Ethereum Signed Message:\n32"` and hashing the result. It corresponds with the
     * hash signed when using the https://eth.wiki/json-rpc/API#eth_sign[`eth_sign`] JSON-RPC method.
     *
     * NOTE: The `messageHash` parameter is intended to be the result of hashing a raw message with
     * keccak256, although any bytes32 value can be safely used because the final digest will
     * be re-hashed.
     *
     * See {ECDSA-recover}.
     */
    function toEthSignedMessageHash(bytes32 messageHash) internal pure returns (bytes32 digest) {
        assembly ("memory-safe") {
            mstore(0x00, "\x19Ethereum Signed Message:\n32") // 32 is the bytes-length of messageHash
            mstore(0x1c, messageHash) // 0x1c (28) is the length of the prefix
            digest := keccak256(0x00, 0x3c) // 0x3c is the length of the prefix (0x1c) + messageHash (0x20)
        }
    }

    /**
     * @dev Returns the keccak256 digest of an ERC-191 signed data with version
     * `0x45` (`personal_sign` messages).
     *
     * The digest is calculated by prefixing an arbitrary `message` with
     * `"\x19Ethereum Signed Message:\n" + len(message)` and hashing the result. It corresponds with the
     * hash signed when using the https://eth.wiki/json-rpc/API#eth_sign[`eth_sign`] JSON-RPC method.
     *
     * See {ECDSA-recover}.
     */
    function toEthSignedMessageHash(bytes memory message) internal pure returns (bytes32) {
        return
            keccak256(bytes.concat("\x19Ethereum Signed Message:\n", bytes(Strings.toString(message.length)), message));
    }

    /**
     * @dev Returns the keccak256 digest of an ERC-191 signed data with version
     * `0x00` (data with intended validator).
     *
     * The digest is calculated by prefixing an arbitrary `data` with `"\x19\x00"` and the intended
     * `validator` address. Then hashing the result.
     *
     * See {ECDSA-recover}.
     */
    function toDataWithIntendedValidatorHash(address validator, bytes memory data) internal pure returns (bytes32) {
        return keccak256(abi.encodePacked(hex"19_00", validator, data));
    }

    /**
     * @dev Returns the keccak256 digest of an EIP-712 typed data (ERC-191 version `0x01`).
     *
     * The digest is calculated from a `domainSeparator` and a `structHash`, by prefixing them with
     * `\x19\x01` and hashing the result. It corresponds to the hash signed by the
     * https://eips.ethereum.org/EIPS/eip-712[`eth_signTypedData`] JSON-RPC method as part of EIP-712.
     *
     * See {ECDSA-recover}.
     */
    function toTypedDataHash(bytes32 domainSeparator, bytes32 structHash) internal pure returns (bytes32 digest) {
        assembly ("memory-safe") {
            let ptr := mload(0x40)
            mstore(ptr, hex"19_01")
            mstore(add(ptr, 0x02), domainSeparator)
            mstore(add(ptr, 0x22), structHash)
            digest := keccak256(ptr, 0x42)
        }
    }
}

// SPDX-License-Identifier: UNLICENSED
pragma solidity ^0.8.0;

import "@openzeppelin/contracts/utils/structs/EnumerableMap.sol";
import "@openzeppelin/contracts/access/extensions/IAccessControlEnumerable.sol";

event ProviderRegistered(address provider, uint256 stake);

event ProviderDeregistered(address provider);

event ProviderWhitelisted(address provider);

event ProviderBlacklisted(address provider);

event ComputeNodeAdded(address provider, address nodekey, string specsURI);

event ComputeNodeRemoved(address provider, address nodekey);

event ComputeNodeValidated(address provider, address nodekey);

event ComputeNodeInvalidated(address provider, address nodekey);

interface IComputeRegistry is IAccessControlEnumerable {
    struct ComputeNode {
        address provider;
        address subkey;
        string specsURI;
        uint32 computeUnits; // H100 equivalents
        uint32 benchmarkScore; // some fidelity metric
        bool isActive;
        bool isValidated;
    }

    struct ComputeProvider {
        address providerAddress;
        bool isWhitelisted;
        uint32 activeNodes;
        ComputeNode[] nodes;
    }

    function setComputePool(address computePool) external;
    function register(address provider) external returns (bool);
    function deregister(address provider) external returns (bool);
    function addComputeNode(address provider, address subkey, uint256 computeUnits, string calldata specsURI)
        external
        returns (uint256);
    function removeComputeNode(address provider, address subkey) external returns (bool);
    function updateNodeURI(address provider, address subkey, string calldata specsURI) external;
    function updateNodeStatus(address provider, address subkey, bool isActive) external;
    function updateNodeBenchmark(address provider, address subkey, uint256 benchmarkScore) external;
    function setWhitelistStatus(address provider, bool status) external;
    function getWhitelistStatus(address provider) external view returns (bool);
    function setNodeValidationStatus(address provider, address subkey, bool status) external;
    function getNodeValidationStatus(address provider, address subkey) external returns (bool);
    function getProvider(address provider) external view returns (ComputeProvider memory);
    function getProviderActiveNodes(address provider) external view returns (uint32);
    function getProviderTotalNodes(address provider) external view returns (uint32);
    function getProviderAddressList() external view returns (address[] memory);
    function getProviderValidatedNodes(address provider, bool filterForActive)
        external
        view
        returns (address[] memory);
    function getNodes(address provider, uint256 page, uint256 limit) external view returns (ComputeNode[] memory);
    function getNode(address provider, address subkey) external view returns (ComputeNode memory);
    function getNode(address subkey) external view returns (ComputeNode memory);
    function getNodeComputeUnits(address subkey) external view returns (uint256);
    function getNodeProvider(address subkey) external view returns (address);
    function getNodeContractData(address subkey) external view returns (address, uint32, bool, bool);
    function checkProviderExists(address provider) external view returns (bool);
}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.1.0) (access/extensions/IAccessControlEnumerable.sol)

pragma solidity ^0.8.20;

import {IAccessControl} from "../IAccessControl.sol";

/**
 * @dev External interface of AccessControlEnumerable declared to support ERC-165 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: UNLICENSED
pragma solidity ^0.8.0;

abstract contract IWorkValidation {
    function validateWork(uint256 domainId, uint256 poolId, address provider, address nodeId, bytes calldata data)
        external
        virtual
        returns (bool);
}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.1.0) (access/IAccessControl.sol)

pragma solidity ^0.8.20;

/**
 * @dev External interface of AccessControl declared to support ERC-165 detection.
 */
interface IAccessControl {
    /**
     * @dev The `account` is missing a role.
     */
    error AccessControlUnauthorizedAccount(address account, bytes32 neededRole);

    /**
     * @dev The caller of a function is not the expected one.
     *
     * NOTE: Don't confuse with {AccessControlUnauthorizedAccount}.
     */
    error AccessControlBadConfirmation();

    /**
     * @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.
     */
    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. This account bears the admin role (for the granted role).
     * Expected in cases where the role was granted using the internal {AccessControl-_grantRole}.
     */
    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 `callerConfirmation`.
     */
    function renounceRole(bytes32 role, address callerConfirmation) external;
}

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

pragma solidity ^0.8.20;

import {IAccessControl} from "./IAccessControl.sol";
import {Context} from "../utils/Context.sol";
import {ERC165} from "../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 account => bool) hasRole;
        bytes32 adminRole;
    }

    mapping(bytes32 role => RoleData) private _roles;

    bytes32 public constant DEFAULT_ADMIN_ROLE = 0x00;

    /**
     * @dev Modifier that checks that an account has a specific role. Reverts
     * with an {AccessControlUnauthorizedAccount} error including the required role.
     */
    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 returns (bool) {
        return _roles[role].hasRole[account];
    }

    /**
     * @dev Reverts with an {AccessControlUnauthorizedAccount} error if `_msgSender()`
     * is missing `role`. Overriding this function changes the behavior of the {onlyRole} modifier.
     */
    function _checkRole(bytes32 role) internal view virtual {
        _checkRole(role, _msgSender());
    }

    /**
     * @dev Reverts with an {AccessControlUnauthorizedAccount} error if `account`
     * is missing `role`.
     */
    function _checkRole(bytes32 role, address account) internal view virtual {
        if (!hasRole(role, account)) {
            revert AccessControlUnauthorizedAccount(account, role);
        }
    }

    /**
     * @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 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 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 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 `callerConfirmation`.
     *
     * May emit a {RoleRevoked} event.
     */
    function renounceRole(bytes32 role, address callerConfirmation) public virtual {
        if (callerConfirmation != _msgSender()) {
            revert AccessControlBadConfirmation();
        }

        _revokeRole(role, callerConfirmation);
    }

    /**
     * @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 Attempts to grant `role` to `account` and returns a boolean indicating if `role` was granted.
     *
     * Internal function without access restriction.
     *
     * May emit a {RoleGranted} event.
     */
    function _grantRole(bytes32 role, address account) internal virtual returns (bool) {
        if (!hasRole(role, account)) {
            _roles[role].hasRole[account] = true;
            emit RoleGranted(role, account, _msgSender());
            return true;
        } else {
            return false;
        }
    }

    /**
     * @dev Attempts to revoke `role` to `account` and returns a boolean indicating if `role` was revoked.
     *
     * Internal function without access restriction.
     *
     * May emit a {RoleRevoked} event.
     */
    function _revokeRole(bytes32 role, address account) internal virtual returns (bool) {
        if (hasRole(role, account)) {
            _roles[role].hasRole[account] = false;
            emit RoleRevoked(role, account, _msgSender());
            return true;
        } else {
            return false;
        }
    }
}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.1.0) (utils/cryptography/ECDSA.sol)

pragma solidity ^0.8.20;

/**
 * @dev Elliptic Curve Digital Signature Algorithm (ECDSA) operations.
 *
 * These functions can be used to verify that a message was signed by the holder
 * of the private keys of a given address.
 */
library ECDSA {
    enum RecoverError {
        NoError,
        InvalidSignature,
        InvalidSignatureLength,
        InvalidSignatureS
    }

    /**
     * @dev The signature derives the `address(0)`.
     */
    error ECDSAInvalidSignature();

    /**
     * @dev The signature has an invalid length.
     */
    error ECDSAInvalidSignatureLength(uint256 length);

    /**
     * @dev The signature has an S value that is in the upper half order.
     */
    error ECDSAInvalidSignatureS(bytes32 s);

    /**
     * @dev Returns the address that signed a hashed message (`hash`) with `signature` or an error. This will not
     * return address(0) without also returning an error description. Errors are documented using an enum (error type)
     * and a bytes32 providing additional information about the error.
     *
     * If no error is returned, then the address can be used for verification purposes.
     *
     * The `ecrecover` EVM precompile allows for malleable (non-unique) signatures:
     * this function rejects them by requiring the `s` value to be in the lower
     * half order, and the `v` value to be either 27 or 28.
     *
     * IMPORTANT: `hash` _must_ be the result of a hash operation for the
     * verification to be secure: it is possible to craft signatures that
     * recover to arbitrary addresses for non-hashed data. A safe way to ensure
     * this is by receiving a hash of the original message (which may otherwise
     * be too long), and then calling {MessageHashUtils-toEthSignedMessageHash} on it.
     *
     * Documentation for signature generation:
     * - with https://web3js.readthedocs.io/en/v1.3.4/web3-eth-accounts.html#sign[Web3.js]
     * - with https://docs.ethers.io/v5/api/signer/#Signer-signMessage[ethers]
     */
    function tryRecover(
        bytes32 hash,
        bytes memory signature
    ) internal pure returns (address recovered, RecoverError err, bytes32 errArg) {
        if (signature.length == 65) {
            bytes32 r;
            bytes32 s;
            uint8 v;
            // ecrecover takes the signature parameters, and the only way to get them
            // currently is to use assembly.
            assembly ("memory-safe") {
                r := mload(add(signature, 0x20))
                s := mload(add(signature, 0x40))
                v := byte(0, mload(add(signature, 0x60)))
            }
            return tryRecover(hash, v, r, s);
        } else {
            return (address(0), RecoverError.InvalidSignatureLength, bytes32(signature.length));
        }
    }

    /**
     * @dev Returns the address that signed a hashed message (`hash`) with
     * `signature`. This address can then be used for verification purposes.
     *
     * The `ecrecover` EVM precompile allows for malleable (non-unique) signatures:
     * this function rejects them by requiring the `s` value to be in the lower
     * half order, and the `v` value to be either 27 or 28.
     *
     * IMPORTANT: `hash` _must_ be the result of a hash operation for the
     * verification to be secure: it is possible to craft signatures that
     * recover to arbitrary addresses for non-hashed data. A safe way to ensure
     * this is by receiving a hash of the original message (which may otherwise
     * be too long), and then calling {MessageHashUtils-toEthSignedMessageHash} on it.
     */
    function recover(bytes32 hash, bytes memory signature) internal pure returns (address) {
        (address recovered, RecoverError error, bytes32 errorArg) = tryRecover(hash, signature);
        _throwError(error, errorArg);
        return recovered;
    }

    /**
     * @dev Overload of {ECDSA-tryRecover} that receives the `r` and `vs` short-signature fields separately.
     *
     * See https://eips.ethereum.org/EIPS/eip-2098[ERC-2098 short signatures]
     */
    function tryRecover(
        bytes32 hash,
        bytes32 r,
        bytes32 vs
    ) internal pure returns (address recovered, RecoverError err, bytes32 errArg) {
        unchecked {
            bytes32 s = vs & bytes32(0x7fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff);
            // We do not check for an overflow here since the shift operation results in 0 or 1.
            uint8 v = uint8((uint256(vs) >> 255) + 27);
            return tryRecover(hash, v, r, s);
        }
    }

    /**
     * @dev Overload of {ECDSA-recover} that receives the `r and `vs` short-signature fields separately.
     */
    function recover(bytes32 hash, bytes32 r, bytes32 vs) internal pure returns (address) {
        (address recovered, RecoverError error, bytes32 errorArg) = tryRecover(hash, r, vs);
        _throwError(error, errorArg);
        return recovered;
    }

    /**
     * @dev Overload of {ECDSA-tryRecover} that receives the `v`,
     * `r` and `s` signature fields separately.
     */
    function tryRecover(
        bytes32 hash,
        uint8 v,
        bytes32 r,
        bytes32 s
    ) internal pure returns (address recovered, RecoverError err, bytes32 errArg) {
        // EIP-2 still allows signature malleability for ecrecover(). Remove this possibility and make the signature
        // unique. Appendix F in the Ethereum Yellow paper (https://ethereum.github.io/yellowpaper/paper.pdf), defines
        // the valid range for s in (301): 0 < s < secp256k1n ÷ 2 + 1, and for v in (302): v ∈ {27, 28}. Most
        // signatures from current libraries generate a unique signature with an s-value in the lower half order.
        //
        // If your library generates malleable signatures, such as s-values in the upper range, calculate a new s-value
        // with 0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEBAAEDCE6AF48A03BBFD25E8CD0364141 - s1 and flip v from 27 to 28 or
        // vice versa. If your library also generates signatures with 0/1 for v instead 27/28, add 27 to v to accept
        // these malleable signatures as well.
        if (uint256(s) > 0x7FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF5D576E7357A4501DDFE92F46681B20A0) {
            return (address(0), RecoverError.InvalidSignatureS, s);
        }

        // If the signature is valid (and not malleable), return the signer address
        address signer = ecrecover(hash, v, r, s);
        if (signer == address(0)) {
            return (address(0), RecoverError.InvalidSignature, bytes32(0));
        }

        return (signer, RecoverError.NoError, bytes32(0));
    }

    /**
     * @dev Overload of {ECDSA-recover} that receives the `v`,
     * `r` and `s` signature fields separately.
     */
    function recover(bytes32 hash, uint8 v, bytes32 r, bytes32 s) internal pure returns (address) {
        (address recovered, RecoverError error, bytes32 errorArg) = tryRecover(hash, v, r, s);
        _throwError(error, errorArg);
        return recovered;
    }

    /**
     * @dev Optionally reverts with the corresponding custom error according to the `error` argument provided.
     */
    function _throwError(RecoverError error, bytes32 errorArg) private pure {
        if (error == RecoverError.NoError) {
            return; // no error: do nothing
        } else if (error == RecoverError.InvalidSignature) {
            revert ECDSAInvalidSignature();
        } else if (error == RecoverError.InvalidSignatureLength) {
            revert ECDSAInvalidSignatureLength(uint256(errorArg));
        } else if (error == RecoverError.InvalidSignatureS) {
            revert ECDSAInvalidSignatureS(errorArg);
        }
    }
}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.1.0) (interfaces/IERC1271.sol)

pragma solidity ^0.8.20;

/**
 * @dev Interface of the ERC-1271 standard signature validation method for
 * contracts as defined in https://eips.ethereum.org/EIPS/eip-1271[ERC-1271].
 */
interface IERC1271 {
    /**
     * @dev Should return whether the signature provided is valid for the provided data
     * @param hash      Hash of the data to be signed
     * @param signature Signature byte array associated with _data
     */
    function isValidSignature(bytes32 hash, bytes memory signature) external view returns (bytes4 magicValue);
}

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

pragma solidity ^0.8.20;

import {Math} from "./math/Math.sol";
import {SafeCast} from "./math/SafeCast.sol";
import {SignedMath} from "./math/SignedMath.sol";

/**
 * @dev String operations.
 */
library Strings {
    using SafeCast for *;

    bytes16 private constant HEX_DIGITS = "0123456789abcdef";
    uint8 private constant ADDRESS_LENGTH = 20;

    /**
     * @dev The `value` string doesn't fit in the specified `length`.
     */
    error StringsInsufficientHexLength(uint256 value, uint256 length);

    /**
     * @dev The string being parsed contains characters that are not in scope of the given base.
     */
    error StringsInvalidChar();

    /**
     * @dev The string being parsed is not a properly formatted address.
     */
    error StringsInvalidAddressFormat();

    /**
     * @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;
            assembly ("memory-safe") {
                ptr := add(buffer, add(32, length))
            }
            while (true) {
                ptr--;
                assembly ("memory-safe") {
                    mstore8(ptr, byte(mod(value, 10), HEX_DIGITS))
                }
                value /= 10;
                if (value == 0) break;
            }
            return buffer;
        }
    }

    /**
     * @dev Converts a `int256` to its ASCII `string` decimal representation.
     */
    function toStringSigned(int256 value) internal pure returns (string memory) {
        return string.concat(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) {
        uint256 localValue = value;
        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] = HEX_DIGITS[localValue & 0xf];
            localValue >>= 4;
        }
        if (localValue != 0) {
            revert StringsInsufficientHexLength(value, length);
        }
        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 Converts an `address` with fixed length of 20 bytes to its checksummed ASCII `string` hexadecimal
     * representation, according to EIP-55.
     */
    function toChecksumHexString(address addr) internal pure returns (string memory) {
        bytes memory buffer = bytes(toHexString(addr));

        // hash the hex part of buffer (skip length + 2 bytes, length 40)
        uint256 hashValue;
        assembly ("memory-safe") {
            hashValue := shr(96, keccak256(add(buffer, 0x22), 40))
        }

        for (uint256 i = 41; i > 1; --i) {
            // possible values for buffer[i] are 48 (0) to 57 (9) and 97 (a) to 102 (f)
            if (hashValue & 0xf > 7 && uint8(buffer[i]) > 96) {
                // case shift by xoring with 0x20
                buffer[i] ^= 0x20;
            }
            hashValue >>= 4;
        }
        return string(buffer);
    }

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

    /**
     * @dev Parse a decimal string and returns the value as a `uint256`.
     *
     * Requirements:
     * - The string must be formatted as `[0-9]*`
     * - The result must fit into an `uint256` type
     */
    function parseUint(string memory input) internal pure returns (uint256) {
        return parseUint(input, 0, bytes(input).length);
    }

    /**
     * @dev Variant of {parseUint} that parses a substring of `input` located between position `begin` (included) and
     * `end` (excluded).
     *
     * Requirements:
     * - The substring must be formatted as `[0-9]*`
     * - The result must fit into an `uint256` type
     */
    function parseUint(string memory input, uint256 begin, uint256 end) internal pure returns (uint256) {
        (bool success, uint256 value) = tryParseUint(input, begin, end);
        if (!success) revert StringsInvalidChar();
        return value;
    }

    /**
     * @dev Variant of {parseUint-string} that returns false if the parsing fails because of an invalid character.
     *
     * NOTE: This function will revert if the result does not fit in a `uint256`.
     */
    function tryParseUint(string memory input) internal pure returns (bool success, uint256 value) {
        return _tryParseUintUncheckedBounds(input, 0, bytes(input).length);
    }

    /**
     * @dev Variant of {parseUint-string-uint256-uint256} that returns false if the parsing fails because of an invalid
     * character.
     *
     * NOTE: This function will revert if the result does not fit in a `uint256`.
     */
    function tryParseUint(
        string memory input,
        uint256 begin,
        uint256 end
    ) internal pure returns (bool success, uint256 value) {
        if (end > bytes(input).length || begin > end) return (false, 0);
        return _tryParseUintUncheckedBounds(input, begin, end);
    }

    /**
     * @dev Implementation of {tryParseUint} that does not check bounds. Caller should make sure that
     * `begin <= end <= input.length`. Other inputs would result in undefined behavior.
     */
    function _tryParseUintUncheckedBounds(
        string memory input,
        uint256 begin,
        uint256 end
    ) private pure returns (bool success, uint256 value) {
        bytes memory buffer = bytes(input);

        uint256 result = 0;
        for (uint256 i = begin; i < end; ++i) {
            uint8 chr = _tryParseChr(bytes1(_unsafeReadBytesOffset(buffer, i)));
            if (chr > 9) return (false, 0);
            result *= 10;
            result += chr;
        }
        return (true, result);
    }

    /**
     * @dev Parse a decimal string and returns the value as a `int256`.
     *
     * Requirements:
     * - The string must be formatted as `[-+]?[0-9]*`
     * - The result must fit in an `int256` type.
     */
    function parseInt(string memory input) internal pure returns (int256) {
        return parseInt(input, 0, bytes(input).length);
    }

    /**
     * @dev Variant of {parseInt-string} that parses a substring of `input` located between position `begin` (included) and
     * `end` (excluded).
     *
     * Requirements:
     * - The substring must be formatted as `[-+]?[0-9]*`
     * - The result must fit in an `int256` type.
     */
    function parseInt(string memory input, uint256 begin, uint256 end) internal pure returns (int256) {
        (bool success, int256 value) = tryParseInt(input, begin, end);
        if (!success) revert StringsInvalidChar();
        return value;
    }

    /**
     * @dev Variant of {parseInt-string} that returns false if the parsing fails because of an invalid character or if
     * the result does not fit in a `int256`.
     *
     * NOTE: This function will revert if the absolute value of the result does not fit in a `uint256`.
     */
    function tryParseInt(string memory input) internal pure returns (bool success, int256 value) {
        return _tryParseIntUncheckedBounds(input, 0, bytes(input).length);
    }

    uint256 private constant ABS_MIN_INT256 = 2 ** 255;

    /**
     * @dev Variant of {parseInt-string-uint256-uint256} that returns false if the parsing fails because of an invalid
     * character or if the result does not fit in a `int256`.
     *
     * NOTE: This function will revert if the absolute value of the result does not fit in a `uint256`.
     */
    function tryParseInt(
        string memory input,
        uint256 begin,
        uint256 end
    ) internal pure returns (bool success, int256 value) {
        if (end > bytes(input).length || begin > end) return (false, 0);
        return _tryParseIntUncheckedBounds(input, begin, end);
    }

    /**
     * @dev Implementation of {tryParseInt} that does not check bounds. Caller should make sure that
     * `begin <= end <= input.length`. Other inputs would result in undefined behavior.
     */
    function _tryParseIntUncheckedBounds(
        string memory input,
        uint256 begin,
        uint256 end
    ) private pure returns (bool success, int256 value) {
        bytes memory buffer = bytes(input);

        // Check presence of a negative sign.
        bytes1 sign = begin == end ? bytes1(0) : bytes1(_unsafeReadBytesOffset(buffer, begin)); // don't do out-of-bound (possibly unsafe) read if sub-string is empty
        bool positiveSign = sign == bytes1("+");
        bool negativeSign = sign == bytes1("-");
        uint256 offset = (positiveSign || negativeSign).toUint();

        (bool absSuccess, uint256 absValue) = tryParseUint(input, begin + offset, end);

        if (absSuccess && absValue < ABS_MIN_INT256) {
            return (true, negativeSign ? -int256(absValue) : int256(absValue));
        } else if (absSuccess && negativeSign && absValue == ABS_MIN_INT256) {
            return (true, type(int256).min);
        } else return (false, 0);
    }

    /**
     * @dev Parse a hexadecimal string (with or without "0x" prefix), and returns the value as a `uint256`.
     *
     * Requirements:
     * - The string must be formatted as `(0x)?[0-9a-fA-F]*`
     * - The result must fit in an `uint256` type.
     */
    function parseHexUint(string memory input) internal pure returns (uint256) {
        return parseHexUint(input, 0, bytes(input).length);
    }

    /**
     * @dev Variant of {parseHexUint} that parses a substring of `input` located between position `begin` (included) and
     * `end` (excluded).
     *
     * Requirements:
     * - The substring must be formatted as `(0x)?[0-9a-fA-F]*`
     * - The result must fit in an `uint256` type.
     */
    function parseHexUint(string memory input, uint256 begin, uint256 end) internal pure returns (uint256) {
        (bool success, uint256 value) = tryParseHexUint(input, begin, end);
        if (!success) revert StringsInvalidChar();
        return value;
    }

    /**
     * @dev Variant of {parseHexUint-string} that returns false if the parsing fails because of an invalid character.
     *
     * NOTE: This function will revert if the result does not fit in a `uint256`.
     */
    function tryParseHexUint(string memory input) internal pure returns (bool success, uint256 value) {
        return _tryParseHexUintUncheckedBounds(input, 0, bytes(input).length);
    }

    /**
     * @dev Variant of {parseHexUint-string-uint256-uint256} that returns false if the parsing fails because of an
     * invalid character.
     *
     * NOTE: This function will revert if the result does not fit in a `uint256`.
     */
    function tryParseHexUint(
        string memory input,
        uint256 begin,
        uint256 end
    ) internal pure returns (bool success, uint256 value) {
        if (end > bytes(input).length || begin > end) return (false, 0);
        return _tryParseHexUintUncheckedBounds(input, begin, end);
    }

    /**
     * @dev Implementation of {tryParseHexUint} that does not check bounds. Caller should make sure that
     * `begin <= end <= input.length`. Other inputs would result in undefined behavior.
     */
    function _tryParseHexUintUncheckedBounds(
        string memory input,
        uint256 begin,
        uint256 end
    ) private pure returns (bool success, uint256 value) {
        bytes memory buffer = bytes(input);

        // skip 0x prefix if present
        bool hasPrefix = (end > begin + 1) && bytes2(_unsafeReadBytesOffset(buffer, begin)) == bytes2("0x"); // don't do out-of-bound (possibly unsafe) read if sub-string is empty
        uint256 offset = hasPrefix.toUint() * 2;

        uint256 result = 0;
        for (uint256 i = begin + offset; i < end; ++i) {
            uint8 chr = _tryParseChr(bytes1(_unsafeReadBytesOffset(buffer, i)));
            if (chr > 15) return (false, 0);
            result *= 16;
            unchecked {
                // Multiplying by 16 is equivalent to a shift of 4 bits (with additional overflow check).
                // This guaratees that adding a value < 16 will not cause an overflow, hence the unchecked.
                result += chr;
            }
        }
        return (true, result);
    }

    /**
     * @dev Parse a hexadecimal string (with or without "0x" prefix), and returns the value as an `address`.
     *
     * Requirements:
     * - The string must be formatted as `(0x)?[0-9a-fA-F]{40}`
     */
    function parseAddress(string memory input) internal pure returns (address) {
        return parseAddress(input, 0, bytes(input).length);
    }

    /**
     * @dev Variant of {parseAddress} that parses a substring of `input` located between position `begin` (included) and
     * `end` (excluded).
     *
     * Requirements:
     * - The substring must be formatted as `(0x)?[0-9a-fA-F]{40}`
     */
    function parseAddress(string memory input, uint256 begin, uint256 end) internal pure returns (address) {
        (bool success, address value) = tryParseAddress(input, begin, end);
        if (!success) revert StringsInvalidAddressFormat();
        return value;
    }

    /**
     * @dev Variant of {parseAddress-string} that returns false if the parsing fails because the input is not a properly
     * formatted address. See {parseAddress} requirements.
     */
    function tryParseAddress(string memory input) internal pure returns (bool success, address value) {
        return tryParseAddress(input, 0, bytes(input).length);
    }

    /**
     * @dev Variant of {parseAddress-string-uint256-uint256} that returns false if the parsing fails because input is not a properly
     * formatted address. See {parseAddress} requirements.
     */
    function tryParseAddress(
        string memory input,
        uint256 begin,
        uint256 end
    ) internal pure returns (bool success, address value) {
        if (end > bytes(input).length || begin > end) return (false, address(0));

        bool hasPrefix = (end > begin + 1) && bytes2(_unsafeReadBytesOffset(bytes(input), begin)) == bytes2("0x"); // don't do out-of-bound (possibly unsafe) read if sub-string is empty
        uint256 expectedLength = 40 + hasPrefix.toUint() * 2;

        // check that input is the correct length
        if (end - begin == expectedLength) {
            // length guarantees that this does not overflow, and value is at most type(uint160).max
            (bool s, uint256 v) = _tryParseHexUintUncheckedBounds(input, begin, end);
            return (s, address(uint160(v)));
        } else {
            return (false, address(0));
        }
    }

    function _tryParseChr(bytes1 chr) private pure returns (uint8) {
        uint8 value = uint8(chr);

        // Try to parse `chr`:
        // - Case 1: [0-9]
        // - Case 2: [a-f]
        // - Case 3: [A-F]
        // - otherwise not supported
        unchecked {
            if (value > 47 && value < 58) value -= 48;
            else if (value > 96 && value < 103) value -= 87;
            else if (value > 64 && value < 71) value -= 55;
            else return type(uint8).max;
        }

        return value;
    }

    /**
     * @dev Reads a bytes32 from a bytes array without bounds checking.
     *
     * NOTE: making this function internal would mean it could be used with memory unsafe offset, and marking the
     * assembly block as such would prevent some optimizations.
     */
    function _unsafeReadBytesOffset(bytes memory buffer, uint256 offset) private pure returns (bytes32 value) {
        // This is not memory safe in the general case, but all calls to this private function are within bounds.
        assembly ("memory-safe") {
            value := mload(add(buffer, add(0x20, offset)))
        }
    }
}

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

pragma solidity ^0.8.20;

import {EnumerableSet} from "./EnumerableSet.sol";

/**
 * @dev Library for managing an enumerable variant of Solidity's
 * https://solidity.readthedocs.io/en/latest/types.html#mapping-types[`mapping`]
 * type.
 *
 * Maps have the following properties:
 *
 * - Entries are added, removed, and checked for existence in constant time
 * (O(1)).
 * - Entries are enumerated in O(n). No guarantees are made on the ordering.
 *
 * ```solidity
 * contract Example {
 *     // Add the library methods
 *     using EnumerableMap for EnumerableMap.UintToAddressMap;
 *
 *     // Declare a set state variable
 *     EnumerableMap.UintToAddressMap private myMap;
 * }
 * ```
 *
 * The following map types are supported:
 *
 * - `uint256 -> address` (`UintToAddressMap`) since v3.0.0
 * - `address -> uint256` (`AddressToUintMap`) since v4.6.0
 * - `bytes32 -> bytes32` (`Bytes32ToBytes32Map`) since v4.6.0
 * - `uint256 -> uint256` (`UintToUintMap`) since v4.7.0
 * - `bytes32 -> uint256` (`Bytes32ToUintMap`) since v4.7.0
 * - `uint256 -> bytes32` (`UintToBytes32Map`) since v5.1.0
 * - `address -> address` (`AddressToAddressMap`) since v5.1.0
 * - `address -> bytes32` (`AddressToBytes32Map`) since v5.1.0
 * - `bytes32 -> address` (`Bytes32ToAddressMap`) since v5.1.0
 *
 * [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 EnumerableMap, you can either remove all elements one by one or create a fresh instance using an
 * array of EnumerableMap.
 * ====
 */
library EnumerableMap {
    using EnumerableSet for EnumerableSet.Bytes32Set;

    // To implement this library for multiple types with as little code repetition as possible, we write it in
    // terms of a generic Map type with bytes32 keys and values. The Map implementation uses private functions,
    // and user-facing implementations such as `UintToAddressMap` are just wrappers around the underlying Map.
    // This means that we can only create new EnumerableMaps for types that fit in bytes32.

    /**
     * @dev Query for a nonexistent map key.
     */
    error EnumerableMapNonexistentKey(bytes32 key);

    struct Bytes32ToBytes32Map {
        // Storage of keys
        EnumerableSet.Bytes32Set _keys;
        mapping(bytes32 key => bytes32) _values;
    }

    /**
     * @dev Adds a key-value pair to a map, or updates the value for an existing
     * key. O(1).
     *
     * Returns true if the key was added to the map, that is if it was not
     * already present.
     */
    function set(Bytes32ToBytes32Map storage map, bytes32 key, bytes32 value) internal returns (bool) {
        map._values[key] = value;
        return map._keys.add(key);
    }

    /**
     * @dev Removes a key-value pair from a map. O(1).
     *
     * Returns true if the key was removed from the map, that is if it was present.
     */
    function remove(Bytes32ToBytes32Map storage map, bytes32 key) internal returns (bool) {
        delete map._values[key];
        return map._keys.remove(key);
    }

    /**
     * @dev Returns true if the key is in the map. O(1).
     */
    function contains(Bytes32ToBytes32Map storage map, bytes32 key) internal view returns (bool) {
        return map._keys.contains(key);
    }

    /**
     * @dev Returns the number of key-value pairs in the map. O(1).
     */
    function length(Bytes32ToBytes32Map storage map) internal view returns (uint256) {
        return map._keys.length();
    }

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

    /**
     * @dev Tries to returns the value associated with `key`. O(1).
     * Does not revert if `key` is not in the map.
     */
    function tryGet(Bytes32ToBytes32Map storage map, bytes32 key) internal view returns (bool exists, bytes32 value) {
        bytes32 val = map._values[key];
        if (val == bytes32(0)) {
            return (contains(map, key), bytes32(0));
        } else {
            return (true, val);
        }
    }

    /**
     * @dev Returns the value associated with `key`. O(1).
     *
     * Requirements:
     *
     * - `key` must be in the map.
     */
    function get(Bytes32ToBytes32Map storage map, bytes32 key) internal view returns (bytes32) {
        bytes32 value = map._values[key];
        if (value == 0 && !contains(map, key)) {
            revert EnumerableMapNonexistentKey(key);
        }
        return value;
    }

    /**
     * @dev Return the an array containing all the keys
     *
     * 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 map grows to a point where copying to memory consumes too much gas to fit in a block.
     */
    function keys(Bytes32ToBytes32Map storage map) internal view returns (bytes32[] memory) {
        return map._keys.values();
    }

    // UintToUintMap

    struct UintToUintMap {
        Bytes32ToBytes32Map _inner;
    }

    /**
     * @dev Adds a key-value pair to a map, or updates the value for an existing
     * key. O(1).
     *
     * Returns true if the key was added to the map, that is if it was not
     * already present.
     */
    function set(UintToUintMap storage map, uint256 key, uint256 value) internal returns (bool) {
        return set(map._inner, bytes32(key), bytes32(value));
    }

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

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

    /**
     * @dev Returns the number of elements in the map. O(1).
     */
    function length(UintToUintMap storage map) internal view returns (uint256) {
        return length(map._inner);
    }

    /**
     * @dev Returns the element stored at position `index` in the map. 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(UintToUintMap storage map, uint256 index) internal view returns (uint256 key, uint256 value) {
        (bytes32 atKey, bytes32 val) = at(map._inner, index);
        return (uint256(atKey), uint256(val));
    }

    /**
     * @dev Tries to returns the value associated with `key`. O(1).
     * Does not revert if `key` is not in the map.
     */
    function tryGet(UintToUintMap storage map, uint256 key) internal view returns (bool exists, uint256 value) {
        (bool success, bytes32 val) = tryGet(map._inner, bytes32(key));
        return (success, uint256(val));
    }

    /**
     * @dev Returns the value associated with `key`. O(1).
     *
     * Requirements:
     *
     * - `key` must be in the map.
     */
    function get(UintToUintMap storage map, uint256 key) internal view returns (uint256) {
        return uint256(get(map._inner, bytes32(key)));
    }

    /**
     * @dev Return the an array containing all the keys
     *
     * 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 map grows to a point where copying to memory consumes too much gas to fit in a block.
     */
    function keys(UintToUintMap storage map) internal view returns (uint256[] memory) {
        bytes32[] memory store = keys(map._inner);
        uint256[] memory result;

        assembly ("memory-safe") {
            result := store
        }

        return result;
    }

    // UintToAddressMap

    struct UintToAddressMap {
        Bytes32ToBytes32Map _inner;
    }

    /**
     * @dev Adds a key-value pair to a map, or updates the value for an existing
     * key. O(1).
     *
     * Returns true if the key was added to the map, that is if it was not
     * already present.
     */
    function set(UintToAddressMap storage map, uint256 key, address value) internal returns (bool) {
        return set(map._inner, bytes32(key), bytes32(uint256(uint160(value))));
    }

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

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

    /**
     * @dev Returns the number of elements in the map. O(1).
     */
    function length(UintToAddressMap storage map) internal view returns (uint256) {
        return length(map._inner);
    }

    /**
     * @dev Returns the element stored at position `index` in the map. 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(UintToAddressMap storage map, uint256 index) internal view returns (uint256 key, address value) {
        (bytes32 atKey, bytes32 val) = at(map._inner, index);
        return (uint256(atKey), address(uint160(uint256(val))));
    }

    /**
     * @dev Tries to returns the value associated with `key`. O(1).
     * Does not revert if `key` is not in the map.
     */
    function tryGet(UintToAddressMap storage map, uint256 key) internal view returns (bool exists, address value) {
        (bool success, bytes32 val) = tryGet(map._inner, bytes32(key));
        return (success, address(uint160(uint256(val))));
    }

    /**
     * @dev Returns the value associated with `key`. O(1).
     *
     * Requirements:
     *
     * - `key` must be in the map.
     */
    function get(UintToAddressMap storage map, uint256 key) internal view returns (address) {
        return address(uint160(uint256(get(map._inner, bytes32(key)))));
    }

    /**
     * @dev Return the an array containing all the keys
     *
     * 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 map grows to a point where copying to memory consumes too much gas to fit in a block.
     */
    function keys(UintToAddressMap storage map) internal view returns (uint256[] memory) {
        bytes32[] memory store = keys(map._inner);
        uint256[] memory result;

        assembly ("memory-safe") {
            result := store
        }

        return result;
    }

    // UintToBytes32Map

    struct UintToBytes32Map {
        Bytes32ToBytes32Map _inner;
    }

    /**
     * @dev Adds a key-value pair to a map, or updates the value for an existing
     * key. O(1).
     *
     * Returns true if the key was added to the map, that is if it was not
     * already present.
     */
    function set(UintToBytes32Map storage map, uint256 key, bytes32 value) internal returns (bool) {
        return set(map._inner, bytes32(key), value);
    }

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

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

    /**
     * @dev Returns the number of elements in the map. O(1).
     */
    function length(UintToBytes32Map storage map) internal view returns (uint256) {
        return length(map._inner);
    }

    /**
     * @dev Returns the element stored at position `index` in the map. 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(UintToBytes32Map storage map, uint256 index) internal view returns (uint256 key, bytes32 value) {
        (bytes32 atKey, bytes32 val) = at(map._inner, index);
        return (uint256(atKey), val);
    }

    /**
     * @dev Tries to returns the value associated with `key`. O(1).
     * Does not revert if `key` is not in the map.
     */
    function tryGet(UintToBytes32Map storage map, uint256 key) internal view returns (bool exists, bytes32 value) {
        (bool success, bytes32 val) = tryGet(map._inner, bytes32(key));
        return (success, val);
    }

    /**
     * @dev Returns the value associated with `key`. O(1).
     *
     * Requirements:
     *
     * - `key` must be in the map.
     */
    function get(UintToBytes32Map storage map, uint256 key) internal view returns (bytes32) {
        return get(map._inner, bytes32(key));
    }

    /**
     * @dev Return the an array containing all the keys
     *
     * 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 map grows to a point where copying to memory consumes too much gas to fit in a block.
     */
    function keys(UintToBytes32Map storage map) internal view returns (uint256[] memory) {
        bytes32[] memory store = keys(map._inner);
        uint256[] memory result;

        assembly ("memory-safe") {
            result := store
        }

        return result;
    }

    // AddressToUintMap

    struct AddressToUintMap {
        Bytes32ToBytes32Map _inner;
    }

    /**
     * @dev Adds a key-value pair to a map, or updates the value for an existing
     * key. O(1).
     *
     * Returns true if the key was added to the map, that is if it was not
     * already present.
     */
    function set(AddressToUintMap storage map, address key, uint256 value) internal returns (bool) {
        return set(map._inner, bytes32(uint256(uint160(key))), bytes32(value));
    }

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

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

    /**
     * @dev Returns the number of elements in the map. O(1).
     */
    function length(AddressToUintMap storage map) internal view returns (uint256) {
        return length(map._inner);
    }

    /**
     * @dev Returns the element stored at position `index` in the map. 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(AddressToUintMap storage map, uint256 index) internal view returns (address key, uint256 value) {
        (bytes32 atKey, bytes32 val) = at(map._inner, index);
        return (address(uint160(uint256(atKey))), uint256(val));
    }

    /**
     * @dev Tries to returns the value associated with `key`. O(1).
     * Does not revert if `key` is not in the map.
     */
    function tryGet(AddressToUintMap storage map, address key) internal view returns (bool exists, uint256 value) {
        (bool success, bytes32 val) = tryGet(map._inner, bytes32(uint256(uint160(key))));
        return (success, uint256(val));
    }

    /**
     * @dev Returns the value associated with `key`. O(1).
     *
     * Requirements:
     *
     * - `key` must be in the map.
     */
    function get(AddressToUintMap storage map, address key) internal view returns (uint256) {
        return uint256(get(map._inner, bytes32(uint256(uint160(key)))));
    }

    /**
     * @dev Return the an array containing all the keys
     *
     * 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 map grows to a point where copying to memory consumes too much gas to fit in a block.
     */
    function keys(AddressToUintMap storage map) internal view returns (address[] memory) {
        bytes32[] memory store = keys(map._inner);
        address[] memory result;

        assembly ("memory-safe") {
            result := store
        }

        return result;
    }

    // AddressToAddressMap

    struct AddressToAddressMap {
        Bytes32ToBytes32Map _inner;
    }

    /**
     * @dev Adds a key-value pair to a map, or updates the value for an existing
     * key. O(1).
     *
     * Returns true if the key was added to the map, that is if it was not
     * already present.
     */
    function set(AddressToAddressMap storage map, address key, address value) internal returns (bool) {
        return set(map._inner, bytes32(uint256(uint160(key))), bytes32(uint256(uint160(value))));
    }

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

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

    /**
     * @dev Returns the number of elements in the map. O(1).
     */
    function length(AddressToAddressMap storage map) internal view returns (uint256) {
        return length(map._inner);
    }

    /**
     * @dev Returns the element stored at position `index` in the map. 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(AddressToAddressMap storage map, uint256 index) internal view returns (address key, address value) {
        (bytes32 atKey, bytes32 val) = at(map._inner, index);
        return (address(uint160(uint256(atKey))), address(uint160(uint256(val))));
    }

    /**
     * @dev Tries to returns the value associated with `key`. O(1).
     * Does not revert if `key` is not in the map.
     */
    function tryGet(AddressToAddressMap storage map, address key) internal view returns (bool exists, address value) {
        (bool success, bytes32 val) = tryGet(map._inner, bytes32(uint256(uint160(key))));
        return (success, address(uint160(uint256(val))));
    }

    /**
     * @dev Returns the value associated with `key`. O(1).
     *
     * Requirements:
     *
     * - `key` must be in the map.
     */
    function get(AddressToAddressMap storage map, address key) internal view returns (address) {
        return address(uint160(uint256(get(map._inner, bytes32(uint256(uint160(key)))))));
    }

    /**
     * @dev Return the an array containing all the keys
     *
     * 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 map grows to a point where copying to memory consumes too much gas to fit in a block.
     */
    function keys(AddressToAddressMap storage map) internal view returns (address[] memory) {
        bytes32[] memory store = keys(map._inner);
        address[] memory result;

        assembly ("memory-safe") {
            result := store
        }

        return result;
    }

    // AddressToBytes32Map

    struct AddressToBytes32Map {
        Bytes32ToBytes32Map _inner;
    }

    /**
     * @dev Adds a key-value pair to a map, or updates the value for an existing
     * key. O(1).
     *
     * Returns true if the key was added to the map, that is if it was not
     * already present.
     */
    function set(AddressToBytes32Map storage map, address key, bytes32 value) internal returns (bool) {
        return set(map._inner, bytes32(uint256(uint160(key))), value);
    }

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

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

    /**
     * @dev Returns the number of elements in the map. O(1).
     */
    function length(AddressToBytes32Map storage map) internal view returns (uint256) {
        return length(map._inner);
    }

    /**
     * @dev Returns the element stored at position `index` in the map. 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(AddressToBytes32Map storage map, uint256 index) internal view returns (address key, bytes32 value) {
        (bytes32 atKey, bytes32 val) = at(map._inner, index);
        return (address(uint160(uint256(atKey))), val);
    }

    /**
     * @dev Tries to returns the value associated with `key`. O(1).
     * Does not revert if `key` is not in the map.
     */
    function tryGet(AddressToBytes32Map storage map, address key) internal view returns (bool exists, bytes32 value) {
        (bool success, bytes32 val) = tryGet(map._inner, bytes32(uint256(uint160(key))));
        return (success, val);
    }

    /**
     * @dev Returns the value associated with `key`. O(1).
     *
     * Requirements:
     *
     * - `key` must be in the map.
     */
    function get(AddressToBytes32Map storage map, address key) internal view returns (bytes32) {
        return get(map._inner, bytes32(uint256(uint160(key))));
    }

    /**
     * @dev Return the an array containing all the keys
     *
     * 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 map grows to a point where copying to memory consumes too much gas to fit in a block.
     */
    function keys(AddressToBytes32Map storage map) internal view returns (address[] memory) {
        bytes32[] memory store = keys(map._inner);
        address[] memory result;

        assembly ("memory-safe") {
            result := store
        }

        return result;
    }

    // Bytes32ToUintMap

    struct Bytes32ToUintMap {
        Bytes32ToBytes32Map _inner;
    }

    /**
     * @dev Adds a key-value pair to a map, or updates the value for an existing
     * key. O(1).
     *
     * Returns true if the key was added to the map, that is if it was not
     * already present.
     */
    function set(Bytes32ToUintMap storage map, bytes32 key, uint256 value) internal returns (bool) {
        return set(map._inner, key, bytes32(value));
    }

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

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

    /**
     * @dev Returns the number of elements in the map. O(1).
     */
    function length(Bytes32ToUintMap storage map) internal view returns (uint256) {
        return length(map._inner);
    }

    /**
     * @dev Returns the element stored at position `index` in the map. 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(Bytes32ToUintMap storage map, uint256 index) internal view returns (bytes32 key, uint256 value) {
        (bytes32 atKey, bytes32 val) = at(map._inner, index);
        return (atKey, uint256(val));
    }

    /**
     * @dev Tries to returns the value associated with `key`. O(1).
     * Does not revert if `key` is not in the map.
     */
    function tryGet(Bytes32ToUintMap storage map, bytes32 key) internal view returns (bool exists, uint256 value) {
        (bool success, bytes32 val) = tryGet(map._inner, key);
        return (success, uint256(val));
    }

    /**
     * @dev Returns the value associated with `key`. O(1).
     *
     * Requirements:
     *
     * - `key` must be in the map.
     */
    function get(Bytes32ToUintMap storage map, bytes32 key) internal view returns (uint256) {
        return uint256(get(map._inner, key));
    }

    /**
     * @dev Return the an array containing all the keys
     *
     * 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 map grows to a point where copying to memory consumes too much gas to fit in a block.
     */
    function keys(Bytes32ToUintMap storage map) internal view returns (bytes32[] memory) {
        bytes32[] memory store = keys(map._inner);
        bytes32[] memory result;

        assembly ("memory-safe") {
            result := store
        }

        return result;
    }

    // Bytes32ToAddressMap

    struct Bytes32ToAddressMap {
        Bytes32ToBytes32Map _inner;
    }

    /**
     * @dev Adds a key-value pair to a map, or updates the value for an existing
     * key. O(1).
     *
     * Returns true if the key was added to the map, that is if it was not
     * already present.
     */
    function set(Bytes32ToAddressMap storage map, bytes32 key, address value) internal returns (bool) {
        return set(map._inner, key, bytes32(uint256(uint160(value))));
    }

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

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

    /**
     * @dev Returns the number of elements in the map. O(1).
     */
    function length(Bytes32ToAddressMap storage map) internal view returns (uint256) {
        return length(map._inner);
    }

    /**
     * @dev Returns the element stored at position `index` in the map. 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(Bytes32ToAddressMap storage map, uint256 index) internal view returns (bytes32 key, address value) {
        (bytes32 atKey, bytes32 val) = at(map._inner, index);
        return (atKey, address(uint160(uint256(val))));
    }

    /**
     * @dev Tries to returns the value associated with `key`. O(1).
     * Does not revert if `key` is not in the map.
     */
    function tryGet(Bytes32ToAddressMap storage map, bytes32 key) internal view returns (bool exists, address value) {
        (bool success, bytes32 val) = tryGet(map._inner, key);
        return (success, address(uint160(uint256(val))));
    }

    /**
     * @dev Returns the value associated with `key`. O(1).
     *
     * Requirements:
     *
     * - `key` must be in the map.
     */
    function get(Bytes32ToAddressMap storage map, bytes32 key) internal view returns (address) {
        return address(uint160(uint256(get(map._inner, key))));
    }

    /**
     * @dev Return the an array containing all the keys
     *
     * 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 map grows to a point where copying to memory consumes too much gas to fit in a block.
     */
    function keys(Bytes32ToAddressMap storage map) internal view returns (bytes32[] memory) {
        bytes32[] memory store = keys(map._inner);
        bytes32[] memory result;

        assembly ("memory-safe") {
            result := store
        }

        return result;
    }
}

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

pragma solidity ^0.8.20;

/**
 * @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 (last updated v5.1.0) (utils/introspection/ERC165.sol)

pragma solidity ^0.8.20;

import {IERC165} from "./IERC165.sol";

/**
 * @dev Implementation of the {IERC165} interface.
 *
 * Contracts that want to implement ERC-165 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);
 * }
 * ```
 */
abstract contract ERC165 is IERC165 {
    /**
     * @dev See {IERC165-supportsInterface}.
     */
    function supportsInterface(bytes4 interfaceId) public view virtual returns (bool) {
        return interfaceId == type(IERC165).interfaceId;
    }
}

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

pragma solidity ^0.8.20;

import {Panic} from "../Panic.sol";
import {SafeCast} from "./SafeCast.sol";

/**
 * @dev Standard math utilities missing in the Solidity language.
 */
library Math {
    enum Rounding {
        Floor, // Toward negative infinity
        Ceil, // Toward positive infinity
        Trunc, // Toward zero
        Expand // Away from zero
    }

    /**
     * @dev Returns the addition of two unsigned integers, with an success flag (no overflow).
     */
    function tryAdd(uint256 a, uint256 b) internal pure returns (bool success, uint256 result) {
        unchecked {
            uint256 c = a + b;
            if (c < a) return (false, 0);
            return (true, c);
        }
    }

    /**
     * @dev Returns the subtraction of two unsigned integers, with an success flag (no overflow).
     */
    function trySub(uint256 a, uint256 b) internal pure returns (bool success, uint256 result) {
        unchecked {
            if (b > a) return (false, 0);
            return (true, a - b);
        }
    }

    /**
     * @dev Returns the multiplication of two unsigned integers, with an success flag (no overflow).
     */
    function tryMul(uint256 a, uint256 b) internal pure returns (bool success, uint256 result) {
        unchecked {
            // Gas optimization: this is cheaper than requiring 'a' not being zero, but the
            // benefit is lost if 'b' is also tested.
            // See: https://github.com/OpenZeppelin/openzeppelin-contracts/pull/522
            if (a == 0) return (true, 0);
            uint256 c = a * b;
            if (c / a != b) return (false, 0);
            return (true, c);
        }
    }

    /**
     * @dev Returns the division of two unsigned integers, with a success flag (no division by zero).
     */
    function tryDiv(uint256 a, uint256 b) internal pure returns (bool success, uint256 result) {
        unchecked {
            if (b == 0) return (false, 0);
            return (true, a / b);
        }
    }

    /**
     * @dev Returns the remainder of dividing two unsigned integers, with a success flag (no division by zero).
     */
    function tryMod(uint256 a, uint256 b) internal pure returns (bool success, uint256 result) {
        unchecked {
            if (b == 0) return (false, 0);
            return (true, a % b);
        }
    }

    /**
     * @dev Branchless ternary evaluation for `a ? b : c`. Gas costs are constant.
     *
     * IMPORTANT: This function may reduce bytecode size and consume less gas when used standalone.
     * However, the compiler may optimize Solidity ternary operations (i.e. `a ? b : c`) to only compute
     * one branch when needed, making this function more expensive.
     */
    function ternary(bool condition, uint256 a, uint256 b) internal pure returns (uint256) {
        unchecked {
            // branchless ternary works because:
            // b ^ (a ^ b) == a
            // b ^ 0 == b
            return b ^ ((a ^ b) * SafeCast.toUint(condition));
        }
    }

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

    /**
     * @dev Returns the smallest of two numbers.
     */
    function min(uint256 a, uint256 b) internal pure returns (uint256) {
        return ternary(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 towards infinity instead
     * of rounding towards zero.
     */
    function ceilDiv(uint256 a, uint256 b) internal pure returns (uint256) {
        if (b == 0) {
            // Guarantee the same behavior as in a regular Solidity division.
            Panic.panic(Panic.DIVISION_BY_ZERO);
        }

        // The following calculation ensures accurate ceiling division without overflow.
        // Since a is non-zero, (a - 1) / b will not overflow.
        // The largest possible result occurs when (a - 1) / b is type(uint256).max,
        // but the largest value we can obtain is type(uint256).max - 1, which happens
        // when a = type(uint256).max and b = 1.
        unchecked {
            return SafeCast.toUint(a > 0) * ((a - 1) / b + 1);
        }
    }

    /**
     * @dev Calculates floor(x * y / denominator) with full precision. Throws if result overflows a uint256 or
     * denominator == 0.
     *
     * 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²⁵⁶ and mod 2²⁵⁶ - 1, then use
            // the Chinese Remainder Theorem to reconstruct the 512 bit result. The result is stored in two 256
            // variables such that product = prod1 * 2²⁵⁶ + prod0.
            uint256 prod0 = x * y; // Least significant 256 bits of the product
            uint256 prod1; // Most significant 256 bits of the product
            assembly {
                let mm := mulmod(x, y, not(0))
                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²⁵⁶. Also prevents denominator == 0.
            if (denominator <= prod1) {
                Panic.panic(ternary(denominator == 0, Panic.DIVISION_BY_ZERO, Panic.UNDER_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.

            uint256 twos = denominator & (0 - denominator);
            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²⁵⁶ / 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²⁵⁶. Now that denominator is an odd number, it has an inverse modulo 2²⁵⁶ such
            // that denominator * inv ≡ 1 mod 2²⁵⁶. Compute the inverse by starting with a seed that is correct for
            // four bits. That is, denominator * inv ≡ 1 mod 2⁴.
            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⁸
            inverse *= 2 - denominator * inverse; // inverse mod 2¹⁶
            inverse *= 2 - denominator * inverse; // inverse mod 2³²
            inverse *= 2 - denominator * inverse; // inverse mod 2⁶⁴
            inverse *= 2 - denominator * inverse; // inverse mod 2¹²⁸
            inverse *= 2 - denominator * inverse; // inverse mod 2²⁵⁶

            // 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²⁵⁶. Since the preconditions guarantee that the outcome is
            // less than 2²⁵⁶, 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;
        }
    }

    /**
     * @dev 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) {
        return mulDiv(x, y, denominator) + SafeCast.toUint(unsignedRoundsUp(rounding) && mulmod(x, y, denominator) > 0);
    }

    /**
     * @dev Calculate the modular multiplicative inverse of a number in Z/nZ.
     *
     * If n is a prime, then Z/nZ is a field. In that case all elements are inversible, except 0.
     * If n is not a prime, then Z/nZ is not a field, and some elements might not be inversible.
     *
     * If the input value is not inversible, 0 is returned.
     *
     * NOTE: If you know for sure that n is (big) a prime, it may be cheaper to use Fermat's little theorem and get the
     * inverse using `Math.modExp(a, n - 2, n)`. See {invModPrime}.
     */
    function invMod(uint256 a, uint256 n) internal pure returns (uint256) {
        unchecked {
            if (n == 0) return 0;

            // The inverse modulo is calculated using the Extended Euclidean Algorithm (iterative version)
            // Used to compute integers x and y such that: ax + ny = gcd(a, n).
            // When the gcd is 1, then the inverse of a modulo n exists and it's x.
            // ax + ny = 1
            // ax = 1 + (-y)n
            // ax ≡ 1 (mod n) # x is the inverse of a modulo n

            // If the remainder is 0 the gcd is n right away.
            uint256 remainder = a % n;
            uint256 gcd = n;

            // Therefore the initial coefficients are:
            // ax + ny = gcd(a, n) = n
            // 0a + 1n = n
            int256 x = 0;
            int256 y = 1;

            while (remainder != 0) {
                uint256 quotient = gcd / remainder;

                (gcd, remainder) = (
                    // The old remainder is the next gcd to try.
                    remainder,
                    // Compute the next remainder.
                    // Can't overflow given that (a % gcd) * (gcd // (a % gcd)) <= gcd
                    // where gcd is at most n (capped to type(uint256).max)
                    gcd - remainder * quotient
                );

                (x, y) = (
                    // Increment the coefficient of a.
                    y,
                    // Decrement the coefficient of n.
                    // Can overflow, but the result is casted to uint256 so that the
                    // next value of y is "wrapped around" to a value between 0 and n - 1.
                    x - y * int256(quotient)
                );
            }

            if (gcd != 1) return 0; // No inverse exists.
            return ternary(x < 0, n - uint256(-x), uint256(x)); // Wrap the result if it's negative.
        }
    }

    /**
     * @dev Variant of {invMod}. More efficient, but only works if `p` is known to be a prime greater than `2`.
     *
     * From https://en.wikipedia.org/wiki/Fermat%27s_little_theorem[Fermat's little theorem], we know that if p is
     * prime, then `a**(p-1) ≡ 1 mod p`. As a consequence, we have `a * a**(p-2) ≡ 1 mod p`, which means that
     * `a**(p-2)` is the modular multiplicative inverse of a in Fp.
     *
     * NOTE: this function does NOT check that `p` is a prime greater than `2`.
     */
    function invModPrime(uint256 a, uint256 p) internal view returns (uint256) {
        unchecked {
            return Math.modExp(a, p - 2, p);
        }
    }

    /**
     * @dev Returns the modular exponentiation of the specified base, exponent and modulus (b ** e % m)
     *
     * Requirements:
     * - modulus can't be zero
     * - underlying staticcall to precompile must succeed
     *
     * IMPORTANT: The result is only valid if the underlying call succeeds. When using this function, make
     * sure the chain you're using it on supports the precompiled contract for modular exponentiation
     * at address 0x05 as specified in https://eips.ethereum.org/EIPS/eip-198[EIP-198]. Otherwise,
     * the underlying function will succeed given the lack of a revert, but the result may be incorrectly
     * interpreted as 0.
     */
    function modExp(uint256 b, uint256 e, uint256 m) internal view returns (uint256) {
        (bool success, uint256 result) = tryModExp(b, e, m);
        if (!success) {
            Panic.panic(Panic.DIVISION_BY_ZERO);
        }
        return result;
    }

    /**
     * @dev Returns the modular exponentiation of the specified base, exponent and modulus (b ** e % m).
     * It includes a success flag indicating if the operation succeeded. Operation will be marked as failed if trying
     * to operate modulo 0 or if the underlying precompile reverted.
     *
     * IMPORTANT: The result is only valid if the success flag is true. When using this function, make sure the chain
     * you're using it on supports the precompiled contract for modular exponentiation at address 0x05 as specified in
     * https://eips.ethereum.org/EIPS/eip-198[EIP-198]. Otherwise, the underlying function will succeed given the lack
     * of a revert, but the result may be incorrectly interpreted as 0.
     */
    function tryModExp(uint256 b, uint256 e, uint256 m) internal view returns (bool success, uint256 result) {
        if (m == 0) return (false, 0);
        assembly ("memory-safe") {
            let ptr := mload(0x40)
            // | Offset    | Content    | Content (Hex)                                                      |
            // |-----------|------------|--------------------------------------------------------------------|
            // | 0x00:0x1f | size of b  | 0x0000000000000000000000000000000000000000000000000000000000000020 |
            // | 0x20:0x3f | size of e  | 0x0000000000000000000000000000000000000000000000000000000000000020 |
            // | 0x40:0x5f | size of m  | 0x0000000000000000000000000000000000000000000000000000000000000020 |
            // | 0x60:0x7f | value of b | 0x<.............................................................b> |
            // | 0x80:0x9f | value of e | 0x<.............................................................e> |
            // | 0xa0:0xbf | value of m | 0x<.............................................................m> |
            mstore(ptr, 0x20)
            mstore(add(ptr, 0x20), 0x20)
            mstore(add(ptr, 0x40), 0x20)
            mstore(add(ptr, 0x60), b)
            mstore(add(ptr, 0x80), e)
            mstore(add(ptr, 0xa0), m)

            // Given the result < m, it's guaranteed to fit in 32 bytes,
            // so we can use the memory scratch space located at offset 0.
            success := staticcall(gas(), 0x05, ptr, 0xc0, 0x00, 0x20)
            result := mload(0x00)
        }
    }

    /**
     * @dev Variant of {modExp} that supports inputs of arbitrary length.
     */
    function modExp(bytes memory b, bytes memory e, bytes memory m) internal view returns (bytes memory) {
        (bool success, bytes memory result) = tryModExp(b, e, m);
        if (!success) {
            Panic.panic(Panic.DIVISION_BY_ZERO);
        }
        return result;
    }

    /**
     * @dev Variant of {tryModExp} that supports inputs of arbitrary length.
     */
    function tryModExp(
        bytes memory b,
        bytes memory e,
        bytes memory m
    ) internal view returns (bool success, bytes memory result) {
        if (_zeroBytes(m)) return (false, new bytes(0));

        uint256 mLen = m.length;

        // Encode call args in result and move the free memory pointer
        result = abi.encodePacked(b.length, e.length, mLen, b, e, m);

        assembly ("memory-safe") {
            let dataPtr := add(result, 0x20)
            // Write result on top of args to avoid allocating extra memory.
            success := staticcall(gas(), 0x05, dataPtr, mload(result), dataPtr, mLen)
            // Overwrite the length.
            // result.length > returndatasize() is guaranteed because returndatasize() == m.length
            mstore(result, mLen)
            // Set the memory pointer after the returned data.
            mstore(0x40, add(dataPtr, mLen))
        }
    }

    /**
     * @dev Returns whether the provided byte array is zero.
     */
    function _zeroBytes(bytes memory byteArray) private pure returns (bool) {
        for (uint256 i = 0; i < byteArray.length; ++i) {
            if (byteArray[i] != 0) {
                return false;
            }
        }
        return true;
    }

    /**
     * @dev Returns the square root of a number. If the number is not a perfect square, the value is rounded
     * towards zero.
     *
     * This method is based on Newton's method for computing square roots; the algorithm is restricted to only
     * using integer operations.
     */
    function sqrt(uint256 a) internal pure returns (uint256) {
        unchecked {
            // Take care of easy edge cases when a == 0 or a == 1
            if (a <= 1) {
                return a;
            }

            // In this function, we use Newton's method to get a root of `f(x) := x² - a`. It involves building a
            // sequence x_n that converges toward sqrt(a). For each iteration x_n, we also define the error between
            // the current value as `ε_n = | x_n - sqrt(a) |`.
            //
            // For our first estimation, we consider `e` the smallest power of 2 which is bigger than the square root
            // of the target. (i.e. `2**(e-1) ≤ sqrt(a) < 2**e`). We know that `e ≤ 128` because `(2¹²⁸)² = 2²⁵⁶` is
            // bigger than any uint256.
            //
            // By noticing that
            // `2**(e-1) ≤ sqrt(a) < 2**e → (2**(e-1))² ≤ a < (2**e)² → 2**(2*e-2) ≤ a < 2**(2*e)`
            // we can deduce that `e - 1` is `log2(a) / 2`. We can thus compute `x_n = 2**(e-1)` using a method similar
            // to the msb function.
            uint256 aa = a;
            uint256 xn = 1;

            if (aa >= (1 << 128)) {
                aa >>= 128;
                xn <<= 64;
            }
            if (aa >= (1 << 64)) {
                aa >>= 64;
                xn <<= 32;
            }
            if (aa >= (1 << 32)) {
                aa >>= 32;
                xn <<= 16;
            }
            if (aa >= (1 << 16)) {
                aa >>= 16;
                xn <<= 8;
            }
            if (aa >= (1 << 8)) {
                aa >>= 8;
                xn <<= 4;
            }
            if (aa >= (1 << 4)) {
                aa >>= 4;
                xn <<= 2;
            }
            if (aa >= (1 << 2)) {
                xn <<= 1;
            }

            // We now have x_n such that `x_n = 2**(e-1) ≤ sqrt(a) < 2**e = 2 * x_n`. This implies ε_n ≤ 2**(e-1).
            //
            // We can refine our estimation by noticing that the middle of that interval minimizes the error.
            // If we move x_n to equal 2**(e-1) + 2**(e-2), then we reduce the error to ε_n ≤ 2**(e-2).
            // This is going to be our x_0 (and ε_0)
            xn = (3 * xn) >> 1; // ε_0 := | x_0 - sqrt(a) | ≤ 2**(e-2)

            // From here, Newton's method give us:
            // x_{n+1} = (x_n + a / x_n) / 2
            //
            // One should note that:
            // x_{n+1}² - a = ((x_n + a / x_n) / 2)² - a
            //              = ((x_n² + a) / (2 * x_n))² - a
            //              = (x_n⁴ + 2 * a * x_n² + a²) / (4 * x_n²) - a
            //              = (x_n⁴ + 2 * a * x_n² + a² - 4 * a * x_n²) / (4 * x_n²)
            //              = (x_n⁴ - 2 * a * x_n² + a²) / (4 * x_n²)
            //              = (x_n² - a)² / (2 * x_n)²
            //              = ((x_n² - a) / (2 * x_n))²
            //              ≥ 0
            // Which proves that for all n ≥ 1, sqrt(a) ≤ x_n
            //
            // This gives us the proof of quadratic convergence of the sequence:
            // ε_{n+1} = | x_{n+1} - sqrt(a) |
            //         = | (x_n + a / x_n) / 2 - sqrt(a) |
            //         = | (x_n² + a - 2*x_n*sqrt(a)) / (2 * x_n) |
            //         = | (x_n - sqrt(a))² / (2 * x_n) |
            //         = | ε_n² / (2 * x_n) |
            //         = ε_n² / | (2 * x_n) |
            //
            // For the first iteration, we have a special case where x_0 is known:
            // ε_1 = ε_0² / | (2 * x_0) |
            //     ≤ (2**(e-2))² / (2 * (2**(e-1) + 2**(e-2)))
            //     ≤ 2**(2*e-4) / (3 * 2**(e-1))
            //     ≤ 2**(e-3) / 3
            //     ≤ 2**(e-3-log2(3))
            //     ≤ 2**(e-4.5)
            //
            // For the following iterations, we use the fact that, 2**(e-1) ≤ sqrt(a) ≤ x_n:
            // ε_{n+1} = ε_n² / | (2 * x_n) |
            //         ≤ (2**(e-k))² / (2 * 2**(e-1))
            //         ≤ 2**(2*e-2*k) / 2**e
            //         ≤ 2**(e-2*k)
            xn = (xn + a / xn) >> 1; // ε_1 := | x_1 - sqrt(a) | ≤ 2**(e-4.5)  -- special case, see above
            xn = (xn + a / xn) >> 1; // ε_2 := | x_2 - sqrt(a) | ≤ 2**(e-9)    -- general case with k = 4.5
            xn = (xn + a / xn) >> 1; // ε_3 := | x_3 - sqrt(a) | ≤ 2**(e-18)   -- general case with k = 9
            xn = (xn + a / xn) >> 1; // ε_4 := | x_4 - sqrt(a) | ≤ 2**(e-36)   -- general case with k = 18
            xn = (xn + a / xn) >> 1; // ε_5 := | x_5 - sqrt(a) | ≤ 2**(e-72)   -- general case with k = 36
            xn = (xn + a / xn) >> 1; // ε_6 := | x_6 - sqrt(a) | ≤ 2**(e-144)  -- general case with k = 72

            // Because e ≤ 128 (as discussed during the first estimation phase), we know have reached a precision
            // ε_6 ≤ 2**(e-144) < 1. Given we're operating on integers, then we can ensure that xn is now either
            // sqrt(a) or sqrt(a) + 1.
            return xn - SafeCast.toUint(xn > a / xn);
        }
    }

    /**
     * @dev 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 + SafeCast.toUint(unsignedRoundsUp(rounding) && result * result < a);
        }
    }

    /**
     * @dev Return the log in base 2 of a positive value rounded towards zero.
     * Returns 0 if given 0.
     */
    function log2(uint256 x) internal pure returns (uint256 r) {
        // If value has upper 128 bits set, log2 result is at least 128
        r = SafeCast.toUint(x > 0xffffffffffffffffffffffffffffffff) << 7;
        // If upper 64 bits of 128-bit half set, add 64 to result
        r |= SafeCast.toUint((x >> r) > 0xffffffffffffffff) << 6;
        // If upper 32 bits of 64-bit half set, add 32 to result
        r |= SafeCast.toUint((x >> r) > 0xffffffff) << 5;
        // If upper 16 bits of 32-bit half set, add 16 to result
        r |= SafeCast.toUint((x >> r) > 0xffff) << 4;
        // If upper 8 bits of 16-bit half set, add 8 to result
        r |= SafeCast.toUint((x >> r) > 0xff) << 3;
        // If upper 4 bits of 8-bit half set, add 4 to result
        r |= SafeCast.toUint((x >> r) > 0xf) << 2;

        // Shifts value right by the current result and use it as an index into this lookup table:
        //
        // | x (4 bits) |  index  | table[index] = MSB position |
        // |------------|---------|-----------------------------|
        // |    0000    |    0    |        table[0] = 0         |
        // |    0001    |    1    |        table[1] = 0         |
        // |    0010    |    2    |        table[2] = 1         |
        // |    0011    |    3    |        table[3] = 1         |
        // |    0100    |    4    |        table[4] = 2         |
        // |    0101    |    5    |        table[5] = 2         |
        // |    0110    |    6    |        table[6] = 2         |
        // |    0111    |    7    |        table[7] = 2         |
        // |    1000    |    8    |        table[8] = 3         |
        // |    1001    |    9    |        table[9] = 3         |
        // |    1010    |   10    |        table[10] = 3        |
        // |    1011    |   11    |        table[11] = 3        |
        // |    1100    |   12    |        table[12] = 3        |
        // |    1101    |   13    |        table[13] = 3        |
        // |    1110    |   14    |        table[14] = 3        |
        // |    1111    |   15    |        table[15] = 3        |
        //
        // The lookup table is represented as a 32-byte value with the MSB positions for 0-15 in the last 16 bytes.
        assembly ("memory-safe") {
            r := or(r, byte(shr(r, x), 0x0000010102020202030303030303030300000000000000000000000000000000))
        }
    }

    /**
     * @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 + SafeCast.toUint(unsignedRoundsUp(rounding) && 1 << result < value);
        }
    }

    /**
     * @dev Return the log in base 10 of a positive value rounded towards zero.
     * 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 + SafeCast.toUint(unsignedRoundsUp(rounding) && 10 ** result < value);
        }
    }

    /**
     * @dev Return the log in base 256 of a positive value rounded towards zero.
     * 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 x) internal pure returns (uint256 r) {
        // If value has upper 128 bits set, log2 result is at least 128
        r = SafeCast.toUint(x > 0xffffffffffffffffffffffffffffffff) << 7;
        // If upper 64 bits of 128-bit half set, add 64 to result
        r |= SafeCast.toUint((x >> r) > 0xffffffffffffffff) << 6;
        // If upper 32 bits of 64-bit half set, add 32 to result
        r |= SafeCast.toUint((x >> r) > 0xffffffff) << 5;
        // If upper 16 bits of 32-bit half set, add 16 to result
        r |= SafeCast.toUint((x >> r) > 0xffff) << 4;
        // Add 1 if upper 8 bits of 16-bit half set, and divide accumulated result by 8
        return (r >> 3) | SafeCast.toUint((x >> r) > 0xff);
    }

    /**
     * @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 + SafeCast.toUint(unsignedRoundsUp(rounding) && 1 << (result << 3) < value);
        }
    }

    /**
     * @dev Returns whether a provided rounding mode is considered rounding up for unsigned integers.
     */
    function unsignedRoundsUp(Rounding rounding) internal pure returns (bool) {
        return uint8(rounding) % 2 == 1;
    }
}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.1.0) (utils/math/SafeCast.sol)
// This file was procedurally generated from scripts/generate/templates/SafeCast.js.

pragma solidity ^0.8.20;

/**
 * @dev Wrappers over Solidity's uintXX/intXX/bool casting operators with added overflow
 * checks.
 *
 * Downcasting from uint256/int256 in Solidity does not revert on overflow. This can
 * easily result in undesired exploitation or bugs, since developers usually
 * assume that overflows raise errors. `SafeCast` restores this intuition by
 * reverting the transaction when such an operation overflows.
 *
 * Using this library instead of the unchecked operations eliminates an entire
 * class of bugs, so it's recommended to use it always.
 */
library SafeCast {
    /**
     * @dev Value doesn't fit in an uint of `bits` size.
     */
    error SafeCastOverflowedUintDowncast(uint8 bits, uint256 value);

    /**
     * @dev An int value doesn't fit in an uint of `bits` size.
     */
    error SafeCastOverflowedIntToUint(int256 value);

    /**
     * @dev Value doesn't fit in an int of `bits` size.
     */
    error SafeCastOverflowedIntDowncast(uint8 bits, int256 value);

    /**
     * @dev An uint value doesn't fit in an int of `bits` size.
     */
    error SafeCastOverflowedUintToInt(uint256 value);

    /**
     * @dev Returns the downcasted uint248 from uint256, reverting on
     * overflow (when the input is greater than largest uint248).
     *
     * Counterpart to Solidity's `uint248` operator.
     *
     * Requirements:
     *
     * - input must fit into 248 bits
     */
    function toUint248(uint256 value) internal pure returns (uint248) {
        if (value > type(uint248).max) {
            revert SafeCastOverflowedUintDowncast(248, value);
        }
        return uint248(value);
    }

    /**
     * @dev Returns the downcasted uint240 from uint256, reverting on
     * overflow (when the input is greater than largest uint240).
     *
     * Counterpart to Solidity's `uint240` operator.
     *
     * Requirements:
     *
     * - input must fit into 240 bits
     */
    function toUint240(uint256 value) internal pure returns (uint240) {
        if (value > type(uint240).max) {
            revert SafeCastOverflowedUintDowncast(240, value);
        }
        return uint240(value);
    }

    /**
     * @dev Returns the downcasted uint232 from uint256, reverting on
     * overflow (when the input is greater than largest uint232).
     *
     * Counterpart to Solidity's `uint232` operator.
     *
     * Requirements:
     *
     * - input must fit into 232 bits
     */
    function toUint232(uint256 value) internal pure returns (uint232) {
        if (value > type(uint232).max) {
            revert SafeCastOverflowedUintDowncast(232, value);
        }
        return uint232(value);
    }

    /**
     * @dev Returns the downcasted uint224 from uint256, reverting on
     * overflow (when the input is greater than largest uint224).
     *
     * Counterpart to Solidity's `uint224` operator.
     *
     * Requirements:
     *
     * - input must fit into 224 bits
     */
    function toUint224(uint256 value) internal pure returns (uint224) {
        if (value > type(uint224).max) {
            revert SafeCastOverflowedUintDowncast(224, value);
        }
        return uint224(value);
    }

    /**
     * @dev Returns the downcasted uint216 from uint256, reverting on
     * overflow (when the input is greater than largest uint216).
     *
     * Counterpart to Solidity's `uint216` operator.
     *
     * Requirements:
     *
     * - input must fit into 216 bits
     */
    function toUint216(uint256 value) internal pure returns (uint216) {
        if (value > type(uint216).max) {
            revert SafeCastOverflowedUintDowncast(216, value);
        }
        return uint216(value);
    }

    /**
     * @dev Returns the downcasted uint208 from uint256, reverting on
     * overflow (when the input is greater than largest uint208).
     *
     * Counterpart to Solidity's `uint208` operator.
     *
     * Requirements:
     *
     * - input must fit into 208 bits
     */
    function toUint208(uint256 value) internal pure returns (uint208) {
        if (value > type(uint208).max) {
            revert SafeCastOverflowedUintDowncast(208, value);
        }
        return uint208(value);
    }

    /**
     * @dev Returns the downcasted uint200 from uint256, reverting on
     * overflow (when the input is greater than largest uint200).
     *
     * Counterpart to Solidity's `uint200` operator.
     *
     * Requirements:
     *
     * - input must fit into 200 bits
     */
    function toUint200(uint256 value) internal pure returns (uint200) {
        if (value > type(uint200).max) {
            revert SafeCastOverflowedUintDowncast(200, value);
        }
        return uint200(value);
    }

    /**
     * @dev Returns the downcasted uint192 from uint256, reverting on
     * overflow (when the input is greater than largest uint192).
     *
     * Counterpart to Solidity's `uint192` operator.
     *
     * Requirements:
     *
     * - input must fit into 192 bits
     */
    function toUint192(uint256 value) internal pure returns (uint192) {
        if (value > type(uint192).max) {
            revert SafeCastOverflowedUintDowncast(192, value);
        }
        return uint192(value);
    }

    /**
     * @dev Returns the downcasted uint184 from uint256, reverting on
     * overflow (when the input is greater than largest uint184).
     *
     * Counterpart to Solidity's `uint184` operator.
     *
     * Requirements:
     *
     * - input must fit into 184 bits
     */
    function toUint184(uint256 value) internal pure returns (uint184) {
        if (value > type(uint184).max) {
            revert SafeCastOverflowedUintDowncast(184, value);
        }
        return uint184(value);
    }

    /**
     * @dev Returns the downcasted uint176 from uint256, reverting on
     * overflow (when the input is greater than largest uint176).
     *
     * Counterpart to Solidity's `uint176` operator.
     *
     * Requirements:
     *
     * - input must fit into 176 bits
     */
    function toUint176(uint256 value) internal pure returns (uint176) {
        if (value > type(uint176).max) {
            revert SafeCastOverflowedUintDowncast(176, value);
        }
        return uint176(value);
    }

    /**
     * @dev Returns the downcasted uint168 from uint256, reverting on
     * overflow (when the input is greater than largest uint168).
     *
     * Counterpart to Solidity's `uint168` operator.
     *
     * Requirements:
     *
     * - input must fit into 168 bits
     */
    function toUint168(uint256 value) internal pure returns (uint168) {
        if (value > type(uint168).max) {
            revert SafeCastOverflowedUintDowncast(168, value);
        }
        return uint168(value);
    }

    /**
     * @dev Returns the downcasted uint160 from uint256, reverting on
     * overflow (when the input is greater than largest uint160).
     *
     * Counterpart to Solidity's `uint160` operator.
     *
     * Requirements:
     *
     * - input must fit into 160 bits
     */
    function toUint160(uint256 value) internal pure returns (uint160) {
        if (value > type(uint160).max) {
            revert SafeCastOverflowedUintDowncast(160, value);
        }
        return uint160(value);
    }

    /**
     * @dev Returns the downcasted uint152 from uint256, reverting on
     * overflow (when the input is greater than largest uint152).
     *
     * Counterpart to Solidity's `uint152` operator.
     *
     * Requirements:
     *
     * - input must fit into 152 bits
     */
    function toUint152(uint256 value) internal pure returns (uint152) {
        if (value > type(uint152).max) {
            revert SafeCastOverflowedUintDowncast(152, value);
        }
        return uint152(value);
    }

    /**
     * @dev Returns the downcasted uint144 from uint256, reverting on
     * overflow (when the input is greater than largest uint144).
     *
     * Counterpart to Solidity's `uint144` operator.
     *
     * Requirements:
     *
     * - input must fit into 144 bits
     */
    function toUint144(uint256 value) internal pure returns (uint144) {
        if (value > type(uint144).max) {
            revert SafeCastOverflowedUintDowncast(144, value);
        }
        return uint144(value);
    }

    /**
     * @dev Returns the downcasted uint136 from uint256, reverting on
     * overflow (when the input is greater than largest uint136).
     *
     * Counterpart to Solidity's `uint136` operator.
     *
     * Requirements:
     *
     * - input must fit into 136 bits
     */
    function toUint136(uint256 value) internal pure returns (uint136) {
        if (value > type(uint136).max) {
            revert SafeCastOverflowedUintDowncast(136, value);
        }
        return uint136(value);
    }

    /**
     * @dev Returns the downcasted uint128 from uint256, reverting on
     * overflow (when the input is greater than largest uint128).
     *
     * Counterpart to Solidity's `uint128` operator.
     *
     * Requirements:
     *
     * - input must fit into 128 bits
     */
    function toUint128(uint256 value) internal pure returns (uint128) {
        if (value > type(uint128).max) {
            revert SafeCastOverflowedUintDowncast(128, value);
        }
        return uint128(value);
    }

    /**
     * @dev Returns the downcasted uint120 from uint256, reverting on
     * overflow (when the input is greater than largest uint120).
     *
     * Counterpart to Solidity's `uint120` operator.
     *
     * Requirements:
     *
     * - input must fit into 120 bits
     */
    function toUint120(uint256 value) internal pure returns (uint120) {
        if (value > type(uint120).max) {
            revert SafeCastOverflowedUintDowncast(120, value);
        }
        return uint120(value);
    }

    /**
     * @dev Returns the downcasted uint112 from uint256, reverting on
     * overflow (when the input is greater than largest uint112).
     *
     * Counterpart to Solidity's `uint112` operator.
     *
     * Requirements:
     *
     * - input must fit into 112 bits
     */
    function toUint112(uint256 value) internal pure returns (uint112) {
        if (value > type(uint112).max) {
            revert SafeCastOverflowedUintDowncast(112, value);
        }
        return uint112(value);
    }

    /**
     * @dev Returns the downcasted uint104 from uint256, reverting on
     * overflow (when the input is greater than largest uint104).
     *
     * Counterpart to Solidity's `uint104` operator.
     *
     * Requirements:
     *
     * - input must fit into 104 bits
     */
    function toUint104(uint256 value) internal pure returns (uint104) {
        if (value > type(uint104).max) {
            revert SafeCastOverflowedUintDowncast(104, value);
        }
        return uint104(value);
    }

    /**
     * @dev Returns the downcasted uint96 from uint256, reverting on
     * overflow (when the input is greater than largest uint96).
     *
     * Counterpart to Solidity's `uint96` operator.
     *
     * Requirements:
     *
     * - input must fit into 96 bits
     */
    function toUint96(uint256 value) internal pure returns (uint96) {
        if (value > type(uint96).max) {
            revert SafeCastOverflowedUintDowncast(96, value);
        }
        return uint96(value);
    }

    /**
     * @dev Returns the downcasted uint88 from uint256, reverting on
     * overflow (when the input is greater than largest uint88).
     *
     * Counterpart to Solidity's `uint88` operator.
     *
     * Requirements:
     *
     * - input must fit into 88 bits
     */
    function toUint88(uint256 value) internal pure returns (uint88) {
        if (value > type(uint88).max) {
            revert SafeCastOverflowedUintDowncast(88, value);
        }
        return uint88(value);
    }

    /**
     * @dev Returns the downcasted uint80 from uint256, reverting on
     * overflow (when the input is greater than largest uint80).
     *
     * Counterpart to Solidity's `uint80` operator.
     *
     * Requirements:
     *
     * - input must fit into 80 bits
     */
    function toUint80(uint256 value) internal pure returns (uint80) {
        if (value > type(uint80).max) {
            revert SafeCastOverflowedUintDowncast(80, value);
        }
        return uint80(value);
    }

    /**
     * @dev Returns the downcasted uint72 from uint256, reverting on
     * overflow (when the input is greater than largest uint72).
     *
     * Counterpart to Solidity's `uint72` operator.
     *
     * Requirements:
     *
     * - input must fit into 72 bits
     */
    function toUint72(uint256 value) internal pure returns (uint72) {
        if (value > type(uint72).max) {
            revert SafeCastOverflowedUintDowncast(72, value);
        }
        return uint72(value);
    }

    /**
     * @dev Returns the downcasted uint64 from uint256, reverting on
     * overflow (when the input is greater than largest uint64).
     *
     * Counterpart to Solidity's `uint64` operator.
     *
     * Requirements:
     *
     * - input must fit into 64 bits
     */
    function toUint64(uint256 value) internal pure returns (uint64) {
        if (value > type(uint64).max) {
            revert SafeCastOverflowedUintDowncast(64, value);
        }
        return uint64(value);
    }

    /**
     * @dev Returns the downcasted uint56 from uint256, reverting on
     * overflow (when the input is greater than largest uint56).
     *
     * Counterpart to Solidity's `uint56` operator.
     *
     * Requirements:
     *
     * - input must fit into 56 bits
     */
    function toUint56(uint256 value) internal pure returns (uint56) {
        if (value > type(uint56).max) {
            revert SafeCastOverflowedUintDowncast(56, value);
        }
        return uint56(value);
    }

    /**
     * @dev Returns the downcasted uint48 from uint256, reverting on
     * overflow (when the input is greater than largest uint48).
     *
     * Counterpart to Solidity's `uint48` operator.
     *
     * Requirements:
     *
     * - input must fit into 48 bits
     */
    function toUint48(uint256 value) internal pure returns (uint48) {
        if (value > type(uint48).max) {
            revert SafeCastOverflowedUintDowncast(48, value);
        }
        return uint48(value);
    }

    /**
     * @dev Returns the downcasted uint40 from uint256, reverting on
     * overflow (when the input is greater than largest uint40).
     *
     * Counterpart to Solidity's `uint40` operator.
     *
     * Requirements:
     *
     * - input must fit into 40 bits
     */
    function toUint40(uint256 value) internal pure returns (uint40) {
        if (value > type(uint40).max) {
            revert SafeCastOverflowedUintDowncast(40, value);
        }
        return uint40(value);
    }

    /**
     * @dev Returns the downcasted uint32 from uint256, reverting on
     * overflow (when the input is greater than largest uint32).
     *
     * Counterpart to Solidity's `uint32` operator.
     *
     * Requirements:
     *
     * - input must fit into 32 bits
     */
    function toUint32(uint256 value) internal pure returns (uint32) {
        if (value > type(uint32).max) {
            revert SafeCastOverflowedUintDowncast(32, value);
        }
        return uint32(value);
    }

    /**
     * @dev Returns the downcasted uint24 from uint256, reverting on
     * overflow (when the input is greater than largest uint24).
     *
     * Counterpart to Solidity's `uint24` operator.
     *
     * Requirements:
     *
     * - input must fit into 24 bits
     */
    function toUint24(uint256 value) internal pure returns (uint24) {
        if (value > type(uint24).max) {
            revert SafeCastOverflowedUintDowncast(24, value);
        }
        return uint24(value);
    }

    /**
     * @dev Returns the downcasted uint16 from uint256, reverting on
     * overflow (when the input is greater than largest uint16).
     *
     * Counterpart to Solidity's `uint16` operator.
     *
     * Requirements:
     *
     * - input must fit into 16 bits
     */
    function toUint16(uint256 value) internal pure returns (uint16) {
        if (value > type(uint16).max) {
            revert SafeCastOverflowedUintDowncast(16, value);
        }
        return uint16(value);
    }

    /**
     * @dev Returns the downcasted uint8 from uint256, reverting on
     * overflow (when the input is greater than largest uint8).
     *
     * Counterpart to Solidity's `uint8` operator.
     *
     * Requirements:
     *
     * - input must fit into 8 bits
     */
    function toUint8(uint256 value) internal pure returns (uint8) {
        if (value > type(uint8).max) {
            revert SafeCastOverflowedUintDowncast(8, value);
        }
        return uint8(value);
    }

    /**
     * @dev Converts a signed int256 into an unsigned uint256.
     *
     * Requirements:
     *
     * - input must be greater than or equal to 0.
     */
    function toUint256(int256 value) internal pure returns (uint256) {
        if (value < 0) {
            revert SafeCastOverflowedIntToUint(value);
        }
        return uint256(value);
    }

    /**
     * @dev Returns the downcasted int248 from int256, reverting on
     * overflow (when the input is less than smallest int248 or
     * greater than largest int248).
     *
     * Counterpart to Solidity's `int248` operator.
     *
     * Requirements:
     *
     * - input must fit into 248 bits
     */
    function toInt248(int256 value) internal pure returns (int248 downcasted) {
        downcasted = int248(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(248, value);
        }
    }

    /**
     * @dev Returns the downcasted int240 from int256, reverting on
     * overflow (when the input is less than smallest int240 or
     * greater than largest int240).
     *
     * Counterpart to Solidity's `int240` operator.
     *
     * Requirements:
     *
     * - input must fit into 240 bits
     */
    function toInt240(int256 value) internal pure returns (int240 downcasted) {
        downcasted = int240(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(240, value);
        }
    }

    /**
     * @dev Returns the downcasted int232 from int256, reverting on
     * overflow (when the input is less than smallest int232 or
     * greater than largest int232).
     *
     * Counterpart to Solidity's `int232` operator.
     *
     * Requirements:
     *
     * - input must fit into 232 bits
     */
    function toInt232(int256 value) internal pure returns (int232 downcasted) {
        downcasted = int232(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(232, value);
        }
    }

    /**
     * @dev Returns the downcasted int224 from int256, reverting on
     * overflow (when the input is less than smallest int224 or
     * greater than largest int224).
     *
     * Counterpart to Solidity's `int224` operator.
     *
     * Requirements:
     *
     * - input must fit into 224 bits
     */
    function toInt224(int256 value) internal pure returns (int224 downcasted) {
        downcasted = int224(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(224, value);
        }
    }

    /**
     * @dev Returns the downcasted int216 from int256, reverting on
     * overflow (when the input is less than smallest int216 or
     * greater than largest int216).
     *
     * Counterpart to Solidity's `int216` operator.
     *
     * Requirements:
     *
     * - input must fit into 216 bits
     */
    function toInt216(int256 value) internal pure returns (int216 downcasted) {
        downcasted = int216(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(216, value);
        }
    }

    /**
     * @dev Returns the downcasted int208 from int256, reverting on
     * overflow (when the input is less than smallest int208 or
     * greater than largest int208).
     *
     * Counterpart to Solidity's `int208` operator.
     *
     * Requirements:
     *
     * - input must fit into 208 bits
     */
    function toInt208(int256 value) internal pure returns (int208 downcasted) {
        downcasted = int208(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(208, value);
        }
    }

    /**
     * @dev Returns the downcasted int200 from int256, reverting on
     * overflow (when the input is less than smallest int200 or
     * greater than largest int200).
     *
     * Counterpart to Solidity's `int200` operator.
     *
     * Requirements:
     *
     * - input must fit into 200 bits
     */
    function toInt200(int256 value) internal pure returns (int200 downcasted) {
        downcasted = int200(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(200, value);
        }
    }

    /**
     * @dev Returns the downcasted int192 from int256, reverting on
     * overflow (when the input is less than smallest int192 or
     * greater than largest int192).
     *
     * Counterpart to Solidity's `int192` operator.
     *
     * Requirements:
     *
     * - input must fit into 192 bits
     */
    function toInt192(int256 value) internal pure returns (int192 downcasted) {
        downcasted = int192(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(192, value);
        }
    }

    /**
     * @dev Returns the downcasted int184 from int256, reverting on
     * overflow (when the input is less than smallest int184 or
     * greater than largest int184).
     *
     * Counterpart to Solidity's `int184` operator.
     *
     * Requirements:
     *
     * - input must fit into 184 bits
     */
    function toInt184(int256 value) internal pure returns (int184 downcasted) {
        downcasted = int184(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(184, value);
        }
    }

    /**
     * @dev Returns the downcasted int176 from int256, reverting on
     * overflow (when the input is less than smallest int176 or
     * greater than largest int176).
     *
     * Counterpart to Solidity's `int176` operator.
     *
     * Requirements:
     *
     * - input must fit into 176 bits
     */
    function toInt176(int256 value) internal pure returns (int176 downcasted) {
        downcasted = int176(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(176, value);
        }
    }

    /**
     * @dev Returns the downcasted int168 from int256, reverting on
     * overflow (when the input is less than smallest int168 or
     * greater than largest int168).
     *
     * Counterpart to Solidity's `int168` operator.
     *
     * Requirements:
     *
     * - input must fit into 168 bits
     */
    function toInt168(int256 value) internal pure returns (int168 downcasted) {
        downcasted = int168(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(168, value);
        }
    }

    /**
     * @dev Returns the downcasted int160 from int256, reverting on
     * overflow (when the input is less than smallest int160 or
     * greater than largest int160).
     *
     * Counterpart to Solidity's `int160` operator.
     *
     * Requirements:
     *
     * - input must fit into 160 bits
     */
    function toInt160(int256 value) internal pure returns (int160 downcasted) {
        downcasted = int160(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(160, value);
        }
    }

    /**
     * @dev Returns the downcasted int152 from int256, reverting on
     * overflow (when the input is less than smallest int152 or
     * greater than largest int152).
     *
     * Counterpart to Solidity's `int152` operator.
     *
     * Requirements:
     *
     * - input must fit into 152 bits
     */
    function toInt152(int256 value) internal pure returns (int152 downcasted) {
        downcasted = int152(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(152, value);
        }
    }

    /**
     * @dev Returns the downcasted int144 from int256, reverting on
     * overflow (when the input is less than smallest int144 or
     * greater than largest int144).
     *
     * Counterpart to Solidity's `int144` operator.
     *
     * Requirements:
     *
     * - input must fit into 144 bits
     */
    function toInt144(int256 value) internal pure returns (int144 downcasted) {
        downcasted = int144(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(144, value);
        }
    }

    /**
     * @dev Returns the downcasted int136 from int256, reverting on
     * overflow (when the input is less than smallest int136 or
     * greater than largest int136).
     *
     * Counterpart to Solidity's `int136` operator.
     *
     * Requirements:
     *
     * - input must fit into 136 bits
     */
    function toInt136(int256 value) internal pure returns (int136 downcasted) {
        downcasted = int136(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(136, value);
        }
    }

    /**
     * @dev Returns the downcasted int128 from int256, reverting on
     * overflow (when the input is less than smallest int128 or
     * greater than largest int128).
     *
     * Counterpart to Solidity's `int128` operator.
     *
     * Requirements:
     *
     * - input must fit into 128 bits
     */
    function toInt128(int256 value) internal pure returns (int128 downcasted) {
        downcasted = int128(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(128, value);
        }
    }

    /**
     * @dev Returns the downcasted int120 from int256, reverting on
     * overflow (when the input is less than smallest int120 or
     * greater than largest int120).
     *
     * Counterpart to Solidity's `int120` operator.
     *
     * Requirements:
     *
     * - input must fit into 120 bits
     */
    function toInt120(int256 value) internal pure returns (int120 downcasted) {
        downcasted = int120(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(120, value);
        }
    }

    /**
     * @dev Returns the downcasted int112 from int256, reverting on
     * overflow (when the input is less than smallest int112 or
     * greater than largest int112).
     *
     * Counterpart to Solidity's `int112` operator.
     *
     * Requirements:
     *
     * - input must fit into 112 bits
     */
    function toInt112(int256 value) internal pure returns (int112 downcasted) {
        downcasted = int112(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(112, value);
        }
    }

    /**
     * @dev Returns the downcasted int104 from int256, reverting on
     * overflow (when the input is less than smallest int104 or
     * greater than largest int104).
     *
     * Counterpart to Solidity's `int104` operator.
     *
     * Requirements:
     *
     * - input must fit into 104 bits
     */
    function toInt104(int256 value) internal pure returns (int104 downcasted) {
        downcasted = int104(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(104, value);
        }
    }

    /**
     * @dev Returns the downcasted int96 from int256, reverting on
     * overflow (when the input is less than smallest int96 or
     * greater than largest int96).
     *
     * Counterpart to Solidity's `int96` operator.
     *
     * Requirements:
     *
     * - input must fit into 96 bits
     */
    function toInt96(int256 value) internal pure returns (int96 downcasted) {
        downcasted = int96(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(96, value);
        }
    }

    /**
     * @dev Returns the downcasted int88 from int256, reverting on
     * overflow (when the input is less than smallest int88 or
     * greater than largest int88).
     *
     * Counterpart to Solidity's `int88` operator.
     *
     * Requirements:
     *
     * - input must fit into 88 bits
     */
    function toInt88(int256 value) internal pure returns (int88 downcasted) {
        downcasted = int88(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(88, value);
        }
    }

    /**
     * @dev Returns the downcasted int80 from int256, reverting on
     * overflow (when the input is less than smallest int80 or
     * greater than largest int80).
     *
     * Counterpart to Solidity's `int80` operator.
     *
     * Requirements:
     *
     * - input must fit into 80 bits
     */
    function toInt80(int256 value) internal pure returns (int80 downcasted) {
        downcasted = int80(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(80, value);
        }
    }

    /**
     * @dev Returns the downcasted int72 from int256, reverting on
     * overflow (when the input is less than smallest int72 or
     * greater than largest int72).
     *
     * Counterpart to Solidity's `int72` operator.
     *
     * Requirements:
     *
     * - input must fit into 72 bits
     */
    function toInt72(int256 value) internal pure returns (int72 downcasted) {
        downcasted = int72(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(72, value);
        }
    }

    /**
     * @dev Returns the downcasted int64 from int256, reverting on
     * overflow (when the input is less than smallest int64 or
     * greater than largest int64).
     *
     * Counterpart to Solidity's `int64` operator.
     *
     * Requirements:
     *
     * - input must fit into 64 bits
     */
    function toInt64(int256 value) internal pure returns (int64 downcasted) {
        downcasted = int64(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(64, value);
        }
    }

    /**
     * @dev Returns the downcasted int56 from int256, reverting on
     * overflow (when the input is less than smallest int56 or
     * greater than largest int56).
     *
     * Counterpart to Solidity's `int56` operator.
     *
     * Requirements:
     *
     * - input must fit into 56 bits
     */
    function toInt56(int256 value) internal pure returns (int56 downcasted) {
        downcasted = int56(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(56, value);
        }
    }

    /**
     * @dev Returns the downcasted int48 from int256, reverting on
     * overflow (when the input is less than smallest int48 or
     * greater than largest int48).
     *
     * Counterpart to Solidity's `int48` operator.
     *
     * Requirements:
     *
     * - input must fit into 48 bits
     */
    function toInt48(int256 value) internal pure returns (int48 downcasted) {
        downcasted = int48(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(48, value);
        }
    }

    /**
     * @dev Returns the downcasted int40 from int256, reverting on
     * overflow (when the input is less than smallest int40 or
     * greater than largest int40).
     *
     * Counterpart to Solidity's `int40` operator.
     *
     * Requirements:
     *
     * - input must fit into 40 bits
     */
    function toInt40(int256 value) internal pure returns (int40 downcasted) {
        downcasted = int40(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(40, value);
        }
    }

    /**
     * @dev Returns the downcasted int32 from int256, reverting on
     * overflow (when the input is less than smallest int32 or
     * greater than largest int32).
     *
     * Counterpart to Solidity's `int32` operator.
     *
     * Requirements:
     *
     * - input must fit into 32 bits
     */
    function toInt32(int256 value) internal pure returns (int32 downcasted) {
        downcasted = int32(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(32, value);
        }
    }

    /**
     * @dev Returns the downcasted int24 from int256, reverting on
     * overflow (when the input is less than smallest int24 or
     * greater than largest int24).
     *
     * Counterpart to Solidity's `int24` operator.
     *
     * Requirements:
     *
     * - input must fit into 24 bits
     */
    function toInt24(int256 value) internal pure returns (int24 downcasted) {
        downcasted = int24(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(24, value);
        }
    }

    /**
     * @dev Returns the downcasted int16 from int256, reverting on
     * overflow (when the input is less than smallest int16 or
     * greater than largest int16).
     *
     * Counterpart to Solidity's `int16` operator.
     *
     * Requirements:
     *
     * - input must fit into 16 bits
     */
    function toInt16(int256 value) internal pure returns (int16 downcasted) {
        downcasted = int16(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(16, value);
        }
    }

    /**
     * @dev Returns the downcasted int8 from int256, reverting on
     * overflow (when the input is less than smallest int8 or
     * greater than largest int8).
     *
     * Counterpart to Solidity's `int8` operator.
     *
     * Requirements:
     *
     * - input must fit into 8 bits
     */
    function toInt8(int256 value) internal pure returns (int8 downcasted) {
        downcasted = int8(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(8, value);
        }
    }

    /**
     * @dev Converts an unsigned uint256 into a signed int256.
     *
     * Requirements:
     *
     * - input must be less than or equal to maxInt256.
     */
    function toInt256(uint256 value) internal pure returns (int256) {
        // Note: Unsafe cast below is okay because `type(int256).max` is guaranteed to be positive
        if (value > uint256(type(int256).max)) {
            revert SafeCastOverflowedUintToInt(value);
        }
        return int256(value);
    }

    /**
     * @dev Cast a boolean (false or true) to a uint256 (0 or 1) with no jump.
     */
    function toUint(bool b) internal pure returns (uint256 u) {
        assembly ("memory-safe") {
            u := iszero(iszero(b))
        }
    }
}

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

pragma solidity ^0.8.20;

import {SafeCast} from "./SafeCast.sol";

/**
 * @dev Standard signed math utilities missing in the Solidity language.
 */
library SignedMath {
    /**
     * @dev Branchless ternary evaluation for `a ? b : c`. Gas costs are constant.
     *
     * IMPORTANT: This function may reduce bytecode size and consume less gas when used standalone.
     * However, the compiler may optimize Solidity ternary operations (i.e. `a ? b : c`) to only compute
     * one branch when needed, making this function more expensive.
     */
    function ternary(bool condition, int256 a, int256 b) internal pure returns (int256) {
        unchecked {
            // branchless ternary works because:
            // b ^ (a ^ b) == a
            // b ^ 0 == b
            return b ^ ((a ^ b) * int256(SafeCast.toUint(condition)));
        }
    }

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

    /**
     * @dev Returns the smallest of two signed numbers.
     */
    function min(int256 a, int256 b) internal pure returns (int256) {
        return ternary(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 {
            // Formula from the "Bit Twiddling Hacks" by Sean Eron Anderson.
            // Since `n` is a signed integer, the generated bytecode will use the SAR opcode to perform the right shift,
            // taking advantage of the most significant (or "sign" bit) in two's complement representation.
            // This opcode adds new most significant bits set to the value of the previous most significant bit. As a result,
            // the mask will either be `bytes32(0)` (if n is positive) or `~bytes32(0)` (if n is negative).
            int256 mask = n >> 255;

            // A `bytes32(0)` mask leaves the input unchanged, while a `~bytes32(0)` mask complements it.
            return uint256((n + mask) ^ mask);
        }
    }
}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.1.0) (utils/introspection/IERC165.sol)

pragma solidity ^0.8.20;

/**
 * @dev Interface of the ERC-165 standard, as defined in the
 * https://eips.ethereum.org/EIPS/eip-165[ERC].
 *
 * 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[ERC 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 v5.1.0) (utils/Panic.sol)

pragma solidity ^0.8.20;

/**
 * @dev Helper library for emitting standardized panic codes.
 *
 * ```solidity
 * contract Example {
 *      using Panic for uint256;
 *
 *      // Use any of the declared internal constants
 *      function foo() { Panic.GENERIC.panic(); }
 *
 *      // Alternatively
 *      function foo() { Panic.panic(Panic.GENERIC); }
 * }
 * ```
 *
 * Follows the list from https://github.com/ethereum/solidity/blob/v0.8.24/libsolutil/ErrorCodes.h[libsolutil].
 *
 * _Available since v5.1._
 */
// slither-disable-next-line unused-state
library Panic {
    /// @dev generic / unspecified error
    uint256 internal constant GENERIC = 0x00;
    /// @dev used by the assert() builtin
    uint256 internal constant ASSERT = 0x01;
    /// @dev arithmetic underflow or overflow
    uint256 internal constant UNDER_OVERFLOW = 0x11;
    /// @dev division or modulo by zero
    uint256 internal constant DIVISION_BY_ZERO = 0x12;
    /// @dev enum conversion error
    uint256 internal constant ENUM_CONVERSION_ERROR = 0x21;
    /// @dev invalid encoding in storage
    uint256 internal constant STORAGE_ENCODING_ERROR = 0x22;
    /// @dev empty array pop
    uint256 internal constant EMPTY_ARRAY_POP = 0x31;
    /// @dev array out of bounds access
    uint256 internal constant ARRAY_OUT_OF_BOUNDS = 0x32;
    /// @dev resource error (too large allocation or too large array)
    uint256 internal constant RESOURCE_ERROR = 0x41;
    /// @dev calling invalid internal function
    uint256 internal constant INVALID_INTERNAL_FUNCTION = 0x51;

    /// @dev Reverts with a panic code. Recommended to use with
    /// the internal constants with predefined codes.
    function panic(uint256 code) internal pure {
        assembly ("memory-safe") {
            mstore(0x00, 0x4e487b71)
            mstore(0x20, code)
            revert(0x1c, 0x24)
        }
    }
}

{
  "remappings": [
    "@openzeppelin/contracts/=lib/openzeppelin-contracts/contracts/",
    "ds-test/=lib/openzeppelin-contracts/lib/forge-std/lib/ds-test/src/",
    "erc4626-tests/=lib/openzeppelin-contracts/lib/erc4626-tests/",
    "forge-std/=lib/forge-std/src/",
    "halmos-cheatcodes/=lib/openzeppelin-contracts/lib/halmos-cheatcodes/src/",
    "openzeppelin-contracts/=lib/openzeppelin-contracts/"
  ],
  "optimizer": {
    "enabled": true,
    "runs": 100
  },
  "metadata": {
    "useLiteralContent": false,
    "bytecodeHash": "ipfs",
    "appendCBOR": true
  },
  "outputSelection": {
    "*": {
      "*": [
        "evm.bytecode",
        "evm.deployedBytecode",
        "devdoc",
        "userdoc",
        "metadata",
        "abi"
      ]
    }
  },
  "evmVersion": "cancun",
  "viaIR": true,
  "libraries": {}
}

[{"inputs":[{"internalType":"address","name":"_primeAdmin","type":"address"},{"internalType":"contract IDomainRegistry","name":"_domainRegistry","type":"address"},{"internalType":"contract IComputeRegistry","name":"_computeRegistry","type":"address"},{"internalType":"contract IRewardsDistributorFactory","name":"_rewardsDistributorFactory","type":"address"},{"internalType":"contract IERC20","name":"_AIToken","type":"address"}],"stateMutability":"nonpayable","type":"constructor"},{"inputs":[],"name":"AccessControlBadConfirmation","type":"error"},{"inputs":[{"internalType":"address","name":"account","type":"address"},{"internalType":"bytes32","name":"neededRole","type":"bytes32"}],"name":"AccessControlUnauthorizedAccount","type":"error"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"uint256","name":"poolId","type":"uint256"},{"indexed":true,"internalType":"uint256","name":"domainId","type":"uint256"},{"indexed":true,"internalType":"address","name":"creator","type":"address"}],"name":"ComputePoolCreated","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"uint256","name":"poolId","type":"uint256"}],"name":"ComputePoolEnded","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"uint256","name":"poolId","type":"uint256"},{"indexed":true,"internalType":"address","name":"provider","type":"address"},{"indexed":false,"internalType":"address[]","name":"nodekeys","type":"address[]"}],"name":"ComputePoolJoined","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"uint256","name":"poolId","type":"uint256"},{"indexed":true,"internalType":"address","name":"provider","type":"address"},{"indexed":false,"internalType":"address","name":"nodekey","type":"address"}],"name":"ComputePoolLeft","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"uint256","name":"poolId","type":"uint256"},{"indexed":false,"internalType":"uint256","name":"limit","type":"uint256"}],"name":"ComputePoolLimitUpdated","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"uint256","name":"poolId","type":"uint256"},{"indexed":true,"internalType":"address","name":"provider","type":"address"},{"indexed":false,"internalType":"address","name":"nodekey","type":"address"}],"name":"ComputePoolNodeBlacklisted","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"uint256","name":"poolId","type":"uint256"},{"indexed":true,"internalType":"address","name":"provider","type":"address"},{"indexed":false,"internalType":"address","name":"nodekey","type":"address"}],"name":"ComputePoolNodeEjected","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"uint256","name":"poolId","type":"uint256"},{"indexed":true,"internalType":"address","name":"provider","type":"address"}],"name":"ComputePoolProviderBlacklisted","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"uint256","name":"poolId","type":"uint256"},{"indexed":true,"internalType":"address","name":"provider","type":"address"}],"name":"ComputePoolPurgedProvider","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"uint256","name":"poolId","type":"uint256"},{"indexed":false,"internalType":"uint256","name":"timestamp","type":"uint256"}],"name":"ComputePoolStarted","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"uint256","name":"poolId","type":"uint256"},{"indexed":false,"internalType":"string","name":"uri","type":"string"}],"name":"ComputePoolURIUpdated","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"bytes32","name":"role","type":"bytes32"},{"indexed":true,"internalType":"bytes32","name":"previousAdminRole","type":"bytes32"},{"indexed":true,"internalType":"bytes32","name":"newAdminRole","type":"bytes32"}],"name":"RoleAdminChanged","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"bytes32","name":"role","type":"bytes32"},{"indexed":true,"internalType":"address","name":"account","type":"address"},{"indexed":true,"internalType":"address","name":"sender","type":"address"}],"name":"RoleGranted","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"bytes32","name":"role","type":"bytes32"},{"indexed":true,"internalType":"address","name":"account","type":"address"},{"indexed":true,"internalType":"address","name":"sender","type":"address"}],"name":"RoleRevoked","type":"event"},{"inputs":[],"name":"AIToken","outputs":[{"internalType":"contract IERC20","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"DEFAULT_ADMIN_ROLE","outputs":[{"internalType":"bytes32","name":"","type":"bytes32"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"FEDERATOR_ROLE","outputs":[{"internalType":"bytes32","name":"","type":"bytes32"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"PRIME_ROLE","outputs":[{"internalType":"bytes32","name":"","type":"bytes32"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"poolId","type":"uint256"},{"internalType":"address","name":"provider","type":"address"}],"name":"blacklistAndPurgeProvider","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"poolId","type":"uint256"},{"internalType":"address","name":"nodekey","type":"address"}],"name":"blacklistNode","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"poolId","type":"uint256"},{"internalType":"address[]","name":"nodekeys","type":"address[]"}],"name":"blacklistNodeList","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"poolId","type":"uint256"},{"internalType":"address","name":"provider","type":"address"}],"name":"blacklistProvider","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"poolId","type":"uint256"},{"internalType":"address[]","name":"providers","type":"address[]"}],"name":"blacklistProviderList","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"fromPoolId","type":"uint256"},{"internalType":"uint256","name":"toPoolId","type":"uint256"},{"internalType":"address[]","name":"nodekeys","type":"address[]"},{"internalType":"bytes[]","name":"signatures","type":"bytes[]"}],"name":"changeComputePool","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"computeRegistry","outputs":[{"internalType":"contract IComputeRegistry","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"domainId","type":"uint256"},{"internalType":"address","name":"computeManagerKey","type":"address"},{"internalType":"string","name":"poolName","type":"string"},{"internalType":"string","name":"poolDataURI","type":"string"},{"internalType":"uint256","name":"computeLimit","type":"uint256"}],"name":"createComputePool","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"domainRegistry","outputs":[{"internalType":"contract IDomainRegistry","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"poolId","type":"uint256"},{"internalType":"address","name":"nodekey","type":"address"}],"name":"ejectNode","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"poolId","type":"uint256"}],"name":"endComputePool","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"poolId","type":"uint256"}],"name":"getComputePool","outputs":[{"components":[{"internalType":"uint256","name":"poolId","type":"uint256"},{"internalType":"uint256","name":"domainId","type":"uint256"},{"internalType":"string","name":"poolName","type":"string"},{"internalType":"address","name":"creator","type":"address"},{"internalType":"address","name":"computeManagerKey","type":"address"},{"internalType":"uint256","name":"creationTime","type":"uint256"},{"internalType":"uint256","name":"startTime","type":"uint256"},{"internalType":"uint256","name":"endTime","type":"uint256"},{"internalType":"string","name":"poolDataURI","type":"string"},{"internalType":"address","name":"poolValidationLogic","type":"address"},{"internalType":"uint256","name":"totalCompute","type":"uint256"},{"internalType":"uint256","name":"computeLimit","type":"uint256"},{"internalType":"enum IComputePool.PoolStatus","name":"status","type":"uint8"}],"internalType":"struct IComputePool.PoolInfo","name":"","type":"tuple"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"poolId","type":"uint256"}],"name":"getComputePoolNodes","outputs":[{"internalType":"address[]","name":"","type":"address[]"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"poolId","type":"uint256"}],"name":"getComputePoolProviders","outputs":[{"internalType":"address[]","name":"","type":"address[]"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"poolId","type":"uint256"}],"name":"getComputePoolTotalCompute","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"poolId","type":"uint256"},{"internalType":"address","name":"provider","type":"address"}],"name":"getProviderActiveNodesInPool","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"poolId","type":"uint256"}],"name":"getRewardDistributorForPool","outputs":[{"internalType":"contract IRewardsDistributor","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"getRewardToken","outputs":[{"internalType":"address","name":"","type":"address"}],"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"}],"name":"getRoleMembers","outputs":[{"internalType":"address[]","name":"","type":"address[]"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"bytes32","name":"role","type":"bytes32"},{"internalType":"address","name":"account","type":"address"}],"name":"grantRole","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"bytes32","name":"role","type":"bytes32"},{"internalType":"address","name":"account","type":"address"}],"name":"hasRole","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"poolId","type":"uint256"},{"internalType":"address","name":"nodekey","type":"address"}],"name":"isNodeBlacklistedFromPool","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"poolId","type":"uint256"},{"internalType":"address","name":"nodekey","type":"address"}],"name":"isNodeInPool","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"poolId","type":"uint256"},{"internalType":"address","name":"provider","type":"address"}],"name":"isProviderBlacklistedFromPool","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"poolId","type":"uint256"},{"internalType":"address","name":"provider","type":"address"}],"name":"isProviderInPool","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"poolId","type":"uint256"},{"internalType":"address","name":"provider","type":"address"},{"internalType":"address","name":"nodekey","type":"address"},{"internalType":"bytes","name":"signature","type":"bytes"}],"name":"joinComputePool","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"poolId","type":"uint256"},{"internalType":"address","name":"provider","type":"address"},{"internalType":"address[]","name":"nodekey","type":"address[]"},{"internalType":"bytes[]","name":"signatures","type":"bytes[]"}],"name":"joinComputePool","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"poolId","type":"uint256"},{"internalType":"address","name":"provider","type":"address"},{"internalType":"address[]","name":"nodekeys","type":"address[]"}],"name":"leaveComputePool","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"poolId","type":"uint256"},{"internalType":"address","name":"provider","type":"address"},{"internalType":"address","name":"nodekey","type":"address"}],"name":"leaveComputePool","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"poolIdCounter","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"","type":"uint256"}],"name":"pools","outputs":[{"internalType":"uint256","name":"poolId","type":"uint256"},{"internalType":"uint256","name":"domainId","type":"uint256"},{"internalType":"string","name":"poolName","type":"string"},{"internalType":"address","name":"creator","type":"address"},{"internalType":"address","name":"computeManagerKey","type":"address"},{"internalType":"uint256","name":"creationTime","type":"uint256"},{"internalType":"uint256","name":"startTime","type":"uint256"},{"internalType":"uint256","name":"endTime","type":"uint256"},{"internalType":"string","name":"poolDataURI","type":"string"},{"internalType":"address","name":"poolValidationLogic","type":"address"},{"internalType":"uint256","name":"totalCompute","type":"uint256"},{"internalType":"uint256","name":"computeLimit","type":"uint256"},{"internalType":"enum IComputePool.PoolStatus","name":"status","type":"uint8"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"poolId","type":"uint256"},{"internalType":"address","name":"provider","type":"address"}],"name":"purgeProvider","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"bytes32","name":"role","type":"bytes32"},{"internalType":"address","name":"callerConfirmation","type":"address"}],"name":"renounceRole","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"bytes32","name":"role","type":"bytes32"},{"internalType":"address","name":"account","type":"address"}],"name":"revokeRole","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"rewardsDistributorFactory","outputs":[{"internalType":"contract IRewardsDistributorFactory","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"poolId","type":"uint256"}],"name":"startComputePool","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"bytes4","name":"interfaceId","type":"bytes4"}],"name":"supportsInterface","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"poolId","type":"uint256"},{"internalType":"uint256","name":"computeLimit","type":"uint256"}],"name":"updateComputeLimit","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"poolId","type":"uint256"},{"internalType":"string","name":"poolDataURI","type":"string"}],"name":"updateComputePoolURI","outputs":[],"stateMutability":"nonpayable","type":"function"}]

608080604052346101d85760a081614189803803809161001f8285610249565b8339810103126101d85761003281610280565b60208201516001600160a01b03811691908290036101d85760408301516001600160a01b03811693908490036101d85760608101516001600160a01b03811691908290036101d857608001516001600160a01b03811693908490036101d8576044946020946100a085610294565b610223575b6100ae8561030a565b6101ef575b5f60035560018060a01b0319600754161760075560018060a01b0319600454161760045560018060a01b0319600554161760055560018060a01b0319600654161760065560405192838092632404341f60e21b82525f5160206141495f395f51905f5260048301525f602483015260018060a01b03165afa9081156101e4575f916101a6575b506101438161038a565b610157575b604051613c4e908161047b8239f35b5f5160206141495f395f51905f525f52600160205261019f906001600160a01b03167fd0574b37ab069eda55708726edb474c67ad37ec9fc1c1cc17b874bf1a392a74361040a565b505f610148565b90506020813d6020116101dc575b816101c160209383610249565b810103126101d8576101d290610280565b5f610139565b5f80fd5b3d91506101b4565b6040513d5f823e3d90fd5b5f5160206140e95f395f51905f525f908152600187526040902061021d906001600160a01b0387169061040a565b506100b3565b5f8080526001875260409020610243906001600160a01b0387169061040a565b506100a5565b601f909101601f19168101906001600160401b0382119082101761026c57604052565b634e487b7160e01b5f52604160045260245ffd5b51906001600160a01b03821682036101d857565b6001600160a01b0381165f9081525f5160206141695f395f51905f52602052604090205460ff16610305576001600160a01b03165f8181525f5160206141695f395f51905f5260205260408120805460ff191660011790553391905f5160206140c95f395f51905f528180a4600190565b505f90565b6001600160a01b0381165f9081525f5160206141095f395f51905f52602052604090205460ff16610305576001600160a01b03165f8181525f5160206141095f395f51905f5260205260408120805460ff191660011790553391905f5160206140e95f395f51905f52905f5160206140c95f395f51905f529080a4600190565b6001600160a01b0381165f9081525f5160206141295f395f51905f52602052604090205460ff16610305576001600160a01b03165f8181525f5160206141295f395f51905f5260205260408120805460ff191660011790553391905f5160206141495f395f51905f52905f5160206140c95f395f51905f529080a4600190565b6001810190825f528160205260405f2054155f146104735780546801000000000000000081101561026c576001810180835581101561045f578390825f5260205f20015554915f5260205260405f2055600190565b634e487b7160e01b5f52603260045260245ffd5b5050505f9056fe6080806040526004361015610012575f80fd5b5f905f3560e01c90816301ffc9a7146122b5575080630944a93d1461228d57806318690946146121e65780632296ce3714611fe8578063248a9ca314611fb6578063294a5c8114611f3a5780632f2ff15d14611ed557806336568abe14611e915780633ff98fb614611dd6578063408ba8d614611d8a5780634979dfcc14611d5d5780634ab8bf0814611c9f5780634d056e6e14611c725780636183087014611b0257806369940d79146105525780636aa2b07514611ab85780636b2a6135146119ec5780637d5b2f8e1461193c578063856bab25146117495780638f1a3d4e146116fd5780639010d07c146116b857806391d14854146116705780639a093f331461103b578063a217fddf14611021578063a3246ad314610ff7578063a3860f9d14610dfe578063a6fd56bc14610d5c578063a8266c1e14610d08578063abe451e614610c75578063ac4afa3814610b72578063ad2cc3c714610b38578063b04ad99714610a87578063bc634beb14610884578063c273d27114610853578063c28084cc14610819578063ca15c873146107ef578063d105984e146107ba578063d547741f14610776578063d6fa395f146105bf578063d89aac4a146105a2578063dfdfe9c81461057a578063e4e3466a14610552578063e79674761461050e578063e8e3ebcc14610398578063ec9f078f146102435763ed743d1e14610218575f80fd5b346102405780600319360112610240576006546040516001600160a01b039091168152602090f35b80fd5b5034610240576020366003190112610240576004358082526002602052604082206003015461027c906001600160a01b031615156126a4565b808252600260205260408220600301546001600160a01b031633148015610377575b6102a7906126ef565b808252600260205260ff600c6040842001541660038110156103635761031f5780825260026020524260066040842001558082526002602052600c6040832001600160ff198254161790557f91339b637c84d3a0338a3e683d04b08978c781abdfc8382f9db0e165300c12c56020604051428152a280f35b606460405162461bcd60e51b815260206004820152602060248201527f436f6d70757465506f6f6c3a20706f6f6c206973206e6f742070656e64696e676044820152fd5b634e487b7160e01b83526021600452602483fd5b50808252600260205260408220600401546001600160a01b0316331461029e565b50346104d45760203660031901126104d4576004355f818152600260205260409020600301546103d2906001600160a01b031615156126a4565b805f52600260205260018060a01b03600360405f20015416331480156104ec575b6103fc906126ef565b805f52600260205260ff600c60405f2001541660038110156104d85760016104249114612855565b5f81815260026020818152604080842042600782810191909155600c909101805460ff1916909417909355600890915290912001546001600160a01b0316803b156104d4575f80916004604051809481936306ce68e560e51b83525af180156104c9576104b4575b507f213d4233ecf85f4eb8c58c0662cd1c41b52be98dcf6041be58b73048f0ab211d8280a280f35b6104c19192505f9061239b565b5f905f61048c565b6040513d5f823e3d90fd5b5f80fd5b634e487b7160e01b5f52602160045260245ffd5b505f818152600260205260409020600401546001600160a01b031633146103f3565b346104d45760403660031901126104d457610527612322565b6004355f52600860205260405f209060018060a01b03165f52602052602060405f2054604051908152f35b346104d4575f3660031901126104d4576007546040516001600160a01b039091168152602090f35b346104d4575f3660031901126104d4576004546040516001600160a01b039091168152602090f35b346104d4575f3660031901126104d4576020600354604051908152f35b346104d45760803660031901126104d4576004356105db612322565b906044356001600160401b0381116104d4576105fb9036906004016123d3565b6064356001600160401b0381116104d45761061a9036906004016124f2565b90825f52600260205261063d60018060a01b03600360405f2001541615156126a4565b825f52600260205260ff600c60405f2001541660038110156104d85760016106659114612855565b825f526008602052600560405f200160018060a01b0385165f5260205261069360ff60405f205416156128a1565b6004805460405163366e8cbf60e21b81526001600160a01b03878116938201849052929692909160209183916024918391165afa9081156104c9575f91610719575b505f516020613bf95f395f51905f52938361071494936106f761070894612906565b610702893314612986565b87612c8a565b60405191829182612441565b0390a3005b929190506020833d60201161076e575b816107366020938361239b565b810103126104d4575f516020613bf95f395f51905f529382610708926106f7610761610714976128f9565b94505093509350936106d5565b3d9150610729565b346104d45760403660031901126104d4576107b8600435610795612322565b906107b36107ae825f525f602052600160405f20015490565b612c0b565b612c43565b005b346104d45760203660031901126104d4576004355f526008602052602060018060a01b03600760405f20015416604051908152f35b346104d45760203660031901126104d4576004355f526001602052602060405f2054604051908152f35b346104d4575f3660031901126104d45760206040517f4224ac760a19a0bd83d3469bb1eb2770cf93bce486d0c94483102de5a5ae0df08152f35b346104d45760203660031901126104d4576004355f526008602052610880610708600360405f20016138d3565b0390f35b346104d45760403660031901126104d45760036004356108a2612322565b5f8281526002602052604090208301546108c6906001600160a01b031615156126a4565b815f52600260205260018060a01b038360405f2001541633148015610a65575b6108ef906126ef565b5f8281526008602090815260408083206001600160a01b038516808552960160010190915290205415610a2057602490608060018060a01b03600454166040519384809263c993d24360e01b82528860048301525afa9081156104c9577ffeaa1c0159e289de4710be5a52de5d047cee5aa7cf311eedecf4253082df3e0e926020925f915f916109e7575b508192610987928761358a565b5f8481526008835260408082206001600160a01b03841683528452902054156109be575b6040519485526001600160a01b031693a3005b5f84815260088352604090206109e1906001600160a01b03831690600101613930565b506109ab565b6109879250610a0e915060803d608011610a19575b610a06818361239b565b810190612a9a565b50919290915061097a565b503d6109fc565b60405162461bcd60e51b815260206004820152601d60248201527f436f6d70757465506f6f6c3a206e6f6465206e6f7420696e20706f6f6c0000006044820152606490fd5b505f828152600260205260409020600401546001600160a01b031633146108e6565b346104d45760403660031901126104d4576107b8600435610aa6612322565b90805f526002602052610ac960018060a01b03600360405f2001541615156126a4565b805f52600260205260018060a01b03600360405f2001541633148015610b16575b610af3906126ef565b610b076001600160a01b0383161515612761565b610b118282612adb565b613365565b505f818152600260205260409020600401546001600160a01b03163314610aea565b346104d4575f3660031901126104d45760206040517f257a11202a56a7d32cd465cc8894ee9eaa6cc12d9b7c22f7f4125f08d6ae39208152f35b346104d45760203660031901126104d4576004355f52600260205260405f20805460018201549160028101610ba690612604565b600382015460048301546005840154600685015460078601549195936001600160a01b03938416939192911690610bdf60088601612604565b92600160a01b6001900360098701541697600a87015495600b88015497600c015460ff16986040519c8d9c8d5260208d015260408c016101a090526101a08c01610c289161234e565b9460608c015260808b015260a08a015260c089015260e0880152868103610100880152610c549161234e565b93610120860152610140850152610160840152610180830161088091612372565b346104d45760403660031901126104d4576107b8600435610c94612322565b90805f526002602052610cb760018060a01b03600360405f2001541615156126a4565b805f52600260205260018060a01b03600360405f2001541633148015610ce6575b610ce1906126ef565b6131ec565b505f818152600260205260409020600401546001600160a01b03163314610cd8565b346104d45760403660031901126104d4576020610d52610d26612322565b6004355f9081526008845260408082206001600160a01b03909316825260029092016020522054151590565b6040519015158152f35b346104d45760403660031901126104d4576107b8600435610d7b612322565b90805f526002602052610d9e60018060a01b03600360405f2001541615156126a4565b805f52600260205260018060a01b03600360405f2001541633148015610ddc575b610dc8906126ef565b610b116001600160a01b0383161515612761565b505f818152600260205260409020600401546001600160a01b03163314610dbf565b346104d45760403660031901126104d4576004356024356001600160401b0381116104d457610e3190369060040161259f565b90825f526002602052610e5460018060a01b03600360405f2001541615156126a4565b825f52600260205260018060a01b03600360405f2001541633148015610fd5575b610e7e906126ef565b825f526002602052600860405f20016001600160401b038311610fc157610eaf83610ea983546125cc565b83612a29565b5f601f8411600114610f395791604091610f0185807f3f78a06fc7106f9e466ac7b072858eb25f88ffecfe63addf4f751e57a9eae2b897965f91610f2e575b508160011b915f199060031b1c19161790565b90555b82825193849260208452816020850152848401375f828201840152601f01601f19168101030190a2005b905084013589610eee565b601f19841690825f5260205f20915f5b818110610fa957509160409391867f3f78a06fc7106f9e466ac7b072858eb25f88ffecfe63addf4f751e57a9eae2b897969410610f90575b5050600184811b019055610f04565b8301355f19600387901b60f8161c191690558680610f81565b91926020600181928689013581550194019201610f49565b634e487b7160e01b5f52604160045260245ffd5b505f838152600260205260409020600401546001600160a01b03163314610e75565b346104d45760203660031901126104d4576004355f52600160205261088061070860405f206138d3565b346104d4575f3660031901126104d45760206040515f8152f35b346104d45760a03660031901126104d457600435611057612322565b906044356001600160401b0381116104d45761107790369060040161259f565b906064356001600160401b0381116104d45761109790369060040161259f565b335f9081527f453801b85a2eb41e1e77caf4d61370d327e1fee91eed150a40d59c377746ae55602052604090205491939160ff161561163957600554604051634a83e9cd60e11b815260048101879052905f90829060249082906001600160a01b03165afa80156104c95786915f91611558575b5051036115085760035493611138604051946111268661237f565b8686526020860194888652369161249e565b91604085019283526060850191338352608086019860018060a01b0316895260a0860142815261117860c08801925f845260e08901945f8652369161249e565b9961010088019a8b526101208801945f86526101408901965f88526101608a01986084358a526101808b019b5f8d525f52600260205260405f209a518b555160018b015560028a0190518051906001600160401b038211610fc1576111e7826111e185546125cc565b85612a29565b602090601f83116001146114a55761121692915f918361149a575b50508160011b915f199060031b1c19161790565b90555b516003890180546001600160a01b03199081166001600160a01b0393841617909155915160048a01805490931691161790555160058701555160068601555160078501559551805190969060088501906001600160401b038111610fc15761128b8161128584546125cc565b84612a29565b6020601f82116001146114345790806112bd92600c999a9b5f926114295750508160011b915f199060031b1c19161790565b90555b516009840180546001600160a01b0319166001600160a01b039290921691909117905551600a83015551600b820155915191019060038110156104d85760ff8019835416911617905560018060a01b0360065416602060018060a01b03600454166044600354915f60405195869485936320af9e4f60e21b8552600485015260248401525af19081156104c9575f916113e7575b50600380545f90815260086020526040902060070180546001600160a01b0319166001600160a01b03909316929092179091555461139190612a78565b90816003555f1982019182116113d357602091604051913390827f606bff4f66442daf75e3b94fa0fed071ffb7573d3c2565ab6e0338af0762d6395f80a48152f35b634e487b7160e01b5f52601160045260245ffd5b90506020813d602011611421575b816114026020938361239b565b810103126104d457516001600160a01b03811681036104d45782611354565b3d91506113f5565b015190508b80611202565b601f19821699835f52815f209a5f5b818110611482575091600c999a9b9184600195941061146a575b505050811b0190556112c0565b01515f1960f88460031b161c191690558a808061145d565b838301518d556001909c019b60209384019301611443565b015190505f80611202565b90601f19831691845f52815f20925f5b8181106114f057509084600195949392106114d8575b505050811b019055611219565b01515f1960f88460031b161c191690558f80806114cb565b929360206001819287860151815501950193016114b5565b60405162461bcd60e51b815260206004820152602260248201527f436f6d70757465506f6f6c3a20646f6d61696e20646f6573206e6f74206578696044820152611cdd60f21b6064820152608490fd5b9150503d805f833e61156a818361239b565b8101906020818303126104d4578051906001600160401b0382116104d457019060a0828203126104d4576040519160a083018381106001600160401b03821117610fc1576040528051835260208101516001600160401b0381116104d457826115d49183016129e3565b602084015260408101516001600160a01b03811681036104d457604084015260608101516001600160401b0381116104d4576080926116149183016129e3565b60608401520151906001600160a01b03821682036104d457869160808201528861110b565b63e2517d3f60e01b5f52336004527f257a11202a56a7d32cd465cc8894ee9eaa6cc12d9b7c22f7f4125f08d6ae392060245260445ffd5b346104d45760403660031901126104d457611689612322565b6004355f525f60205260405f209060018060a01b03165f52602052602060ff60405f2054166040519015158152f35b346104d45760403660031901126104d4576004355f52600160205260206116e460243560405f2061391b565b905460405160039290921b1c6001600160a01b03168152f35b346104d45760403660031901126104d457611716612322565b6004355f526008602052600560405f20019060018060a01b03165f52602052602060ff60405f2054166040519015158152f35b346104d45760803660031901126104d457600435611765612322565b61176d612338565b916064356001600160401b0381116104d45761178d9036906004016124d4565b5f828152600260205260409020600301546117b2906001600160a01b031615156126a4565b815f52600260205260ff600c60405f2001541660038110156104d85760016117da9114612855565b815f526008602052600560405f200160018060a01b0384165f5260205261180860ff60405f205416156128a1565b6004805460405163366e8cbf60e21b81526001600160a01b03868116938201849052929592909160209183916024918391165afa80156104c9575f90611901575b6118539150612906565b61185e843314612986565b60409081519261186e838561239b565b60018452601f198301968736602087013783519761188c858a61239b565b600189525f5b8181106118f05750508785809461071496946118e6946118bf5f516020613bf95f395f51905f529a612820565b6001600160a01b0390911690526118d584612820565b526118df83612820565b5088612c8a565b5191829182612441565b806060602080938d01015201611892565b506020813d602011611934575b8161191b6020938361239b565b810103126104d45761192f611853916128f9565b611849565b3d915061190e565b346104d45761194a36612570565b5f8281526002602052604090206003015461196f906001600160a01b031615156126a4565b815f52600260205260018060a01b03600360405f20015416331480156119ca575b611999906126ef565b5f5b81518110156107b8576001906119c46001600160a01b036119bc8386612841565b5116856131ec565b0161199b565b505f828152600260205260409020600401546001600160a01b03163314611990565b346104d4576119fa36612570565b5f82815260026020526040902060030154611a1f906001600160a01b031615156126a4565b815f52600260205260018060a01b03600360405f2001541633148015611a96575b611a49906126ef565b5f5b81518110156107b8576001906001600160a01b03611a698285612841565b5116611a76575b01611a4b565b611a91828060a01b03611a898386612841565b511685612adb565b611a70565b505f828152600260205260409020600401546001600160a01b03163314611a40565b346104d45760403660031901126104d4576020610d52611ad6612322565b600480355f9081526008855260408082206001600160a01b039094168252929091016020522054151590565b346104d45760803660031901126104d4576004356024356044356001600160401b0381116104d457611b389036906004016123d3565b6064356001600160401b0381116104d457611b579036906004016124f2565b91835f526002602052611b7a60018060a01b03600360405f2001541615156126a4565b5f81815260026020526040902060030154611b9f906001600160a01b031615156126a4565b805f52600260205260ff600c60405f2001541660038110156104d857600103611c215781515f8581526008602090815260408083203384529091529020546107b89591849103611c115750604051611c0a91611bfc60208361239b565b5f82525f3681373390612b35565b3390612c8a565b611c1c913390612b35565b611c0a565b60405162461bcd60e51b815260206004820152602360248201527f436f6d70757465506f6f6c3a206465737420706f6f6c206973206e6f7420726560448201526261647960e81b6064820152608490fd5b346104d45760203660031901126104d4576004355f5260026020526020600a60405f200154604051908152f35b346104d45760403660031901126104d4576004357f7c33539de3ea8f2d6904b1e48db77fb289b201468088b7f1b9dba3ebadc39d326020602435835f5260028252611cfa60018060a01b03600360405f2001541615156126a4565b835f526002825260018060a01b03600360405f2001541633148015611d3c575b611d23906126ef565b835f526002825280600b60405f200155604051908152a2005b505f8481526002835260409020600401546001600160a01b03163314611d1a565b346104d45760203660031901126104d4576004355f526008602052610880610708600160405f20016138d3565b346104d45760403660031901126104d457611da3612322565b6004355f526008602052600660405f20019060018060a01b03165f52602052602060ff60405f2054166040519015158152f35b346104d45760603660031901126104d457600435611df2612322565b90611dfb612338565b5f82815260026020526040902060030154611e20906001600160a01b031615156126a4565b611e34336001600160a01b038516146127c2565b6001600160a01b03169182611e63576107b8925060405191611e5760208461239b565b5f83525f368137612b35565b6107b8929160405192611e7760408561239b565b6001845260203681860137611e8b84612820565b52612b35565b346104d45760403660031901126104d457611eaa612322565b336001600160a01b03821603611ec6576107b890600435612c43565b63334bd91960e11b5f5260045ffd5b346104d45760403660031901126104d457600435611ef1612322565b611f096107ae835f525f602052600160405f20015490565b611f1381836137cb565b611f1957005b5f918252600160205260409091206107b8916001600160a01b031690613a0b565b346104d45760603660031901126104d457600435611f56612322565b90604435916001600160401b0383116104d457611f7a6107b89336906004016123d3565b91805f526002602052611f9d60018060a01b03600360405f2001541615156126a4565b611fb1336001600160a01b038416146127c2565b612b35565b346104d45760203660031901126104d4576020611fe06004355f525f602052600160405f20015490565b604051908152f35b346104d45760203660031901126104d4575f6101806040516120098161237f565b828152826020820152606060408201528260608201528260808201528260a08201528260c08201528260e0820152606061010082015282610120820152826101408201528261016082015201526004355f52600260205260405f206040516120708161237f565b815481526001820154916020820192835261208d60028201612604565b604083019081528260018060a01b03600384015416926060820193845260018060a01b036004820154169360808301948552600582015460a08401908152600683015460c0850190815260078401549060e086019182526120f060088601612604565b92610100870193845260018060a01b03600987015416986101208801998a5260ff600c600a890154986101408b01998a52610160600b8201549b019a8b52015416986101808c019960038110156104d8578a526040519c8d809d602082525190602001525160408d01525160608c016101a090526101c08c016121729161234e565b95516001600160a01b0390811660808d015290511660a08b01525160c08a01525160e08901525161010088015251868203601f19016101208801526121b7919061234e565b93516001600160a01b0316610140860152516101608501525161018084015251610880906101a0840190612372565b346104d45760403660031901126104d4576107b8600435612205612322565b90805f52600260205261222860018060a01b03600360405f2001541615156126a4565b805f52600260205260018060a01b03600360405f200154163314801561226b575b612252906126ef565b6122666001600160a01b0383161515612761565b612adb565b505f818152600260205260409020600401546001600160a01b03163314612249565b346104d4575f3660031901126104d4576005546040516001600160a01b039091168152602090f35b346104d45760203660031901126104d4576004359063ffffffff60e01b82168092036104d457602091635a05180f60e01b81149081156122f7575b5015158152f35b637965db0b60e01b811491508115612311575b50836122f0565b6301ffc9a760e01b1490508361230a565b602435906001600160a01b03821682036104d457565b604435906001600160a01b03821682036104d457565b805180835260209291819084018484015e5f828201840152601f01601f1916010190565b9060038210156104d85752565b6101a081019081106001600160401b03821117610fc157604052565b90601f801991011681019081106001600160401b03821117610fc157604052565b6001600160401b038111610fc15760051b60200190565b9080601f830112156104d4578135906123eb826123bc565b926123f9604051948561239b565b82845260208085019360051b8201019182116104d457602001915b8183106124215750505090565b82356001600160a01b03811681036104d457815260209283019201612414565b60206040818301928281528451809452019201905f5b8181106124645750505090565b82516001600160a01b0316845260209384019390920191600101612457565b6001600160401b038111610fc157601f01601f191660200190565b9291926124aa82612483565b916124b8604051938461239b565b8294818452818301116104d4578281602093845f960137010152565b9080601f830112156104d4578160206124ef9335910161249e565b90565b9080601f830112156104d4578135612509816123bc565b92612517604051948561239b565b81845260208085019260051b820101918383116104d45760208201905b83821061254357505050505090565b81356001600160401b0381116104d457602091612565878480948801016124d4565b815201910190612534565b9060406003198301126104d45760043591602435906001600160401b0382116104d4576124ef916004016123d3565b9181601f840112156104d4578235916001600160401b0383116104d457602083818601950101116104d457565b90600182811c921680156125fa575b60208310146125e657565b634e487b7160e01b5f52602260045260245ffd5b91607f16916125db565b9060405191825f825492612617846125cc565b8084529360018116908115612682575060011461263e575b5061263c9250038361239b565b565b90505f9291925260205f20905f915b81831061266657505090602061263c928201015f61262f565b602091935080600191548385890101520191019091849261264d565b90506020925061263c94915060ff191682840152151560051b8201015f61262f565b156126ab57565b606460405162461bcd60e51b815260206004820152602060248201527f436f6d70757465506f6f6c3a20706f6f6c20646f6573206e6f742065786973746044820152fd5b156126f657565b60405162461bcd60e51b815260206004820152603c60248201527f436f6d70757465506f6f6c3a206f6e6c792063726561746f72206f72206d616e60448201527f616765722063616e20706572666f726d207468697320616374696f6e000000006064820152608490fd5b1561276857565b60405162461bcd60e51b815260206004820152602c60248201527f436f6d70757465506f6f6c3a2070726f76696465722063616e6e6f742062652060448201526b7a65726f206164647265737360a01b6064820152608490fd5b156127c957565b60405162461bcd60e51b815260206004820152602960248201527f436f6d70757465506f6f6c3a206f6e6c792070726f76696465722063616e206c60448201526819585d99481c1bdbdb60ba1b6064820152608490fd5b80511561282d5760200190565b634e487b7160e01b5f52603260045260245ffd5b805182101561282d5760209160051b010190565b1561285c57565b60405162461bcd60e51b815260206004820152601f60248201527f436f6d70757465506f6f6c3a20706f6f6c206973206e6f7420616374697665006044820152606490fd5b156128a857565b60405162461bcd60e51b8152602060048201526024808201527f436f6d70757465506f6f6c3a2070726f766964657220697320626c61636b6c696044820152631cdd195960e21b6064820152608490fd5b519081151582036104d457565b1561290d57565b60405162461bcd60e51b815260206004820152604560248201527f436f6d70757465506f6f6c3a2070726f766964657220686173206e6f7420626560448201527f656e20616c6c6f77656420746f206a6f696e20706f6f6c7320627920666564656064820152643930ba37b960d91b608482015260a490fd5b1561298d57565b60405162461bcd60e51b815260206004820152602860248201527f436f6d70757465506f6f6c3a206f6e6c792070726f76696465722063616e206a6044820152671bda5b881c1bdbdb60c21b6064820152608490fd5b81601f820112156104d4578051906129fa82612483565b92612a08604051948561239b565b828452602083830101116104d457815f9260208093018386015e8301015290565b601f8211612a3657505050565b5f5260205f20906020601f840160051c83019310612a6e575b601f0160051c01905b818110612a63575050565b5f8155600101612a58565b9091508190612a4f565b5f1981146113d35760010190565b51906001600160a01b03821682036104d457565b91908260809103126104d457612aaf82612a86565b91602081015163ffffffff811681036104d457916124ef6060612ad4604085016128f9565b93016128f9565b5f8181526008602090815260408083206001600160a01b039095168084526005959095019091528120805460ff191660011790557fb727dcf46488f8537b19da6b2dbcd45113e28c262332d65b20f1d392a4db453d9080a3565b918051155f14612bdb5750815f526008602052612b57600360405f20016138d3565b5f5b8151811015612b8957600190612b836001600160a01b03612b7a8386612841565b511685876136fe565b01612b59565b50505b815f52600860205260405f2060018060a01b0382165f5260205260405f205415612bb4575050565b5f91825260086020526040909120612bd8916001600160a01b031690600101613930565b50565b5f5b8151811015612c0457600190612bfe6001600160a01b03612b7a8386612841565b01612bdd565b5050612b8c565b5f8181526020818152604080832033845290915290205460ff1615612c2d5750565b63e2517d3f60e01b5f523360045260245260445ffd5b612c4d8282613853565b9182612c5857505090565b5f91825260016020526040909120612c79916001600160a01b031690613930565b5090565b919082018092116113d357565b919290935f5b8451811015612d22575f8481526008602052604090206006016001600160a01b03612cbb8388612841565b511660018060a01b03165f5260205260ff60405f205416612cde57600101612c90565b606460405162461bcd60e51b815260206004820152602060248201527f436f6d70757465506f6f6c3a206e6f646520697320626c61636b6c69737465646044820152fd5b5092612d576001939295835f52600860205260405f2090858060a01b0316948591016001915f520160205260405f2054151590565b156131ce575b5f5b81518110156131c6576004546001600160a01b039081169190608090612d858386612841565b511660246040518095819363c993d24360e01b835260048301525afa80156104c9575f92865f945f925f9461319c575b506001600160a01b031603613135576130d45715613084575f8481526002602052604090206001810154600490910154612e7691906001600160a01b0316612dfd8487612841565b5191612e09858c612841565b519260405190602082019283528960408301526bffffffffffffffffffffffff199060601b16606082015260548152612e4360748261239b565b5190207f19457468657265756d205369676e6564204d6573736167653a0a3332000000005f52601c52603c5f2090613a58565b1561303f57835f526002602052612e9c63ffffffff600a60405f20015493168093612c7d565b845f526002602052600b60405f200154612fdf575b506001600160a01b03612ec48285612841565b511691845f526008602052612edf83600360405f2001613a0b565b505f858152600860205260409020600701546001600160a01b0316803b156104d4575f8091602460405180948193631ae0e73d60e01b83528960048401525af180156104c957612fcf575b50845f526002602052612f45600a60405f2001918254612c7d565b9055835f52600860205260405f20855f5260205260405f20612f678154612a78565b90556004546001600160a01b031691823b156104d4575f9260648492604051958693849263024ad34360e21b84528b60048501526024840152600160448401525af19182156104c957600192612fbf575b5001612d5f565b5f612fc99161239b565b5f612fb8565b5f612fd99161239b565b5f612f2a565b845f526002602052600b60405f2001541115612ffb575f612eb1565b606460405162461bcd60e51b815260206004820152602060248201527f436f6d70757465506f6f6c3a20706f6f6c2069732061742063617061636974796044820152fd5b60405162461bcd60e51b815260206004820152601b60248201527f436f6d70757465506f6f6c3a20696e76616c696420696e7669746500000000006044820152606490fd5b60405162461bcd60e51b815260206004820152602260248201527f436f6d70757465506f6f6c3a206e6f6465206973206e6f742076616c69646174604482015261195960f21b6064820152608490fd5b60405162461bcd60e51b815260206004820152603360248201527f436f6d70757465506f6f6c3a206e6f64652063616e206f6e6c7920626520696e604482015272206f6e6520706f6f6c20617420612074696d6560681b6064820152608490fd5b60405162461bcd60e51b815260206004820152603960248201527f436f6d70757465506f6f6c3a206e6f646520646f6573206e6f742065786973746044820152781037b9103737ba1037bbb732b210313c90383937bb34b232b960391b6064820152608490fd5b92505093506131b9915060803d8111610a1957610a06818361239b565b919491929091905f612db5565b505050509050565b815f5260086020526131e683600160405f2001613a0b565b50612d5d565b5f8181526008602090815260408083206001600160a01b0386168085526004909101909252822054909390613275575b5060207f4d58172de21b64818707d32c7f11f934725f75eb5d4e3be9d5397c801328f80391835f5260088252600660405f2001855f52825260405f20600160ff1982541617905560405194855260018060a01b031693a3565b90506024608060018060a01b03600454166040519283809263c993d24360e01b82528860048301525afa80156104c9577f4d58172de21b64818707d32c7f11f934725f75eb5d4e3be9d5397c801328f803926020925f905f9361333f575b50916001600160a01b03831691839190836132f4575b50505050915061321c565b6132fe928861358a565b845f526008835260405f20815f52835260405f205415613321575b8080806132e9565b61333890855f5260088452600160405f2001613930565b505f613319565b905061335b91925060803d608011610a1957610a06818361239b565b505091905f6132d3565b6004805460405163b483ac5d60e01b81526001600160a01b03808616938201849052600160248301529495949093915f9185916044918391165afa9283156104c9575f936134f0575b505f5b83518110156134ad575f8281526008602052604090206133f6906003016001600160a01b036133e08488612841565b5116906001915f520160205260405f2054151590565b613403575b6001016133b1565b6004546001600160a01b0390811691906080906134208388612841565b511660246040518095819363c993d24360e01b835260048301525afa80156104c957846001935f905f93613488575b50848060a01b031614613465575b5090506133fb565b61348290838060a01b036134798489612841565b5116898661358a565b5f61345d565b90506134a391925060803d8111610a1957610a06818361239b565b505091905f61344f565b50909150612bd892935081817ffa6726d61af679b41d56109ec1e7ee27db5048f3b87216874563eeced1f276305f80a35f526008602052600160405f2001613930565b9092503d805f833e613502818361239b565b8101906020818303126104d4578051906001600160401b0382116104d457019080601f830112156104d4578151613538816123bc565b92613546604051948561239b565b81845260208085019260051b8201019283116104d457602001905b82821061357257505050915f6133ae565b6020809161357f84612a86565b815201910190613561565b5f818152600860205260408120909492936001600160a01b031692906135b4908490600301613930565b505f828152600860205260409020600701546001600160a01b0316803b156104d4575f80916024604051809481936334388fe160e21b83528960048401525af180156104c9576136e9575b508185526002602052600a604086200163ffffffff8154921682039182116136d55755835260086020526040832060018060a01b0383165f5260205260405f20805480156136c1575f190190556004546001600160a01b031691823b156136bd57906064849283604051958694859363024ad34360e21b855260018060a01b0316600485015260248401528160448401525af180156136b2576136a0575050565b6136ab82809261239b565b6102405750565b6040513d84823e3d90fd5b8380fd5b634e487b7160e01b85526011600452602485fd5b634e487b7160e01b86526011600452602486fd5b6136f69195505f9061239b565b5f935f6135ff565b6004805460405163c993d24360e01b81526001600160a01b038681169382018490529095939493929160809187916024918391165afa9283156104c9575f955f946137a2575b506001600160a01b0381811696168614613761575b505050505050565b7f26d6fbdc6ba12646d85870f07976c5177fc1a947d332744bd2f2588d8a1243fa93602093613790928761358a565b604051908152a35f8080808080613759565b9093506137bf91955060803d608011610a1957610a06818361239b565b5050949094925f613744565b5f818152602081815260408083206001600160a01b038616845290915290205460ff1661384d575f818152602081815260408083206001600160a01b0395909516808452949091528120805460ff19166001179055339291907f2f8788117e7eff1d82e926ec794901d17c78024a50270940304540a733656f0d9080a4600190565b50505f90565b5f818152602081815260408083206001600160a01b038616845290915290205460ff161561384d575f818152602081815260408083206001600160a01b0395909516808452949091528120805460ff19169055339291907ff6391f5c32d9c69d2a47ea670b442974b53935d1edc7fd64eb21e047a839171b9080a4600190565b90604051918281549182825260208201905f5260205f20925f5b81811061390257505061263c9250038361239b565b84548352600194850194879450602090930192016138ed565b805482101561282d575f5260205f2001905f90565b906001820191815f528260205260405f20548015155f14613a03575f1981018181116113d35782545f198101919082116113d3578181036139b8575b505050805480156139a4575f190190613985828261391b565b8154905f199060031b1b19169055555f526020525f6040812055600190565b634e487b7160e01b5f52603160045260245ffd5b6139ee6139c86139d8938661391b565b90549060031b1c9283928661391b565b819391549060031b91821b915f19901b19161790565b90555f528360205260405f20555f808061396c565b505050505f90565b5f82815260018201602052604090205461384d57805490600160401b821015610fc15782613a436139d884600180960185558461391b565b90558054925f520160205260405f2055600190565b9190823b613a935790613a6a91613b46565b5060048110156104d857159182613a8057505090565b6001600160a01b03918216911614919050565b915f92613ac9613ad785946040519283916020830195630b135d3f60e11b8752602484015260406044840152606483019061234e565b03601f19810183528261239b565b51915afa3d15613b3f573d613aeb81612483565b90613af9604051928361239b565b81523d5f602083013e5b81613b31575b81613b12575090565b90506020818051810103126104d45760200151630b135d3f60e11b1490565b905060208151101590613b09565b6060613b03565b8151919060418303613b7657613b6f9250602082015190606060408401519301515f1a90613b80565b9192909190565b50505f9160029190565b91906fa2a8918ca85bafe22016d0b997e4df60600160ff1b038411613bed579160209360809260ff5f9560405194855216868401526040830152606082015282805260015afa156104c9575f516001600160a01b03811615613be357905f905f90565b505f906001905f90565b5050505f916003919056febcdd4a6f29bb81131471f3192fe48a218af901e1c9888b463659bb61fbeb3815a2646970667358221220e9b1763c12588f05afff4433310106d4154e34197b7e40f654958c0b44d1fb4364736f6c634300081c00332f8788117e7eff1d82e926ec794901d17c78024a50270940304540a733656f0d4224ac760a19a0bd83d3469bb1eb2770cf93bce486d0c94483102de5a5ae0df0ef5349cc450c70e5391501ad4e436e6960249b57a7fb7058927cfe8c9906d866453801b85a2eb41e1e77caf4d61370d327e1fee91eed150a40d59c377746ae55257a11202a56a7d32cd465cc8894ee9eaa6cc12d9b7c22f7f4125f08d6ae3920ad3228b676f7d3cd4284a5443f17f1962b36e491b30a40b2405849e597ba5fb50000000000000000000000000dfd3646391c8cbde50b8b3541a2f6f12718c23f000000000000000000000000e9f8e23199fa9a8331314272adaf5d931c12384c0000000000000000000000003b03ad8e9f03cfa364d80cd52b98e6523e04137600000000000000000000000052886277dc3490f1c41cab0dbaf89260927b0f7d0000000000000000000000008958d3b2aa57fe0d8ca6710ef1bed1f104e1cded

0x6080806040526004361015610012575f80fd5b5f905f3560e01c90816301ffc9a7146122b5575080630944a93d1461228d57806318690946146121e65780632296ce3714611fe8578063248a9ca314611fb6578063294a5c8114611f3a5780632f2ff15d14611ed557806336568abe14611e915780633ff98fb614611dd6578063408ba8d614611d8a5780634979dfcc14611d5d5780634ab8bf0814611c9f5780634d056e6e14611c725780636183087014611b0257806369940d79146105525780636aa2b07514611ab85780636b2a6135146119ec5780637d5b2f8e1461193c578063856bab25146117495780638f1a3d4e146116fd5780639010d07c146116b857806391d14854146116705780639a093f331461103b578063a217fddf14611021578063a3246ad314610ff7578063a3860f9d14610dfe578063a6fd56bc14610d5c578063a8266c1e14610d08578063abe451e614610c75578063ac4afa3814610b72578063ad2cc3c714610b38578063b04ad99714610a87578063bc634beb14610884578063c273d27114610853578063c28084cc14610819578063ca15c873146107ef578063d105984e146107ba578063d547741f14610776578063d6fa395f146105bf578063d89aac4a146105a2578063dfdfe9c81461057a578063e4e3466a14610552578063e79674761461050e578063e8e3ebcc14610398578063ec9f078f146102435763ed743d1e14610218575f80fd5b346102405780600319360112610240576006546040516001600160a01b039091168152602090f35b80fd5b5034610240576020366003190112610240576004358082526002602052604082206003015461027c906001600160a01b031615156126a4565b808252600260205260408220600301546001600160a01b031633148015610377575b6102a7906126ef565b808252600260205260ff600c6040842001541660038110156103635761031f5780825260026020524260066040842001558082526002602052600c6040832001600160ff198254161790557f91339b637c84d3a0338a3e683d04b08978c781abdfc8382f9db0e165300c12c56020604051428152a280f35b606460405162461bcd60e51b815260206004820152602060248201527f436f6d70757465506f6f6c3a20706f6f6c206973206e6f742070656e64696e676044820152fd5b634e487b7160e01b83526021600452602483fd5b50808252600260205260408220600401546001600160a01b0316331461029e565b50346104d45760203660031901126104d4576004355f818152600260205260409020600301546103d2906001600160a01b031615156126a4565b805f52600260205260018060a01b03600360405f20015416331480156104ec575b6103fc906126ef565b805f52600260205260ff600c60405f2001541660038110156104d85760016104249114612855565b5f81815260026020818152604080842042600782810191909155600c909101805460ff1916909417909355600890915290912001546001600160a01b0316803b156104d4575f80916004604051809481936306ce68e560e51b83525af180156104c9576104b4575b507f213d4233ecf85f4eb8c58c0662cd1c41b52be98dcf6041be58b73048f0ab211d8280a280f35b6104c19192505f9061239b565b5f905f61048c565b6040513d5f823e3d90fd5b5f80fd5b634e487b7160e01b5f52602160045260245ffd5b505f818152600260205260409020600401546001600160a01b031633146103f3565b346104d45760403660031901126104d457610527612322565b6004355f52600860205260405f209060018060a01b03165f52602052602060405f2054604051908152f35b346104d4575f3660031901126104d4576007546040516001600160a01b039091168152602090f35b346104d4575f3660031901126104d4576004546040516001600160a01b039091168152602090f35b346104d4575f3660031901126104d4576020600354604051908152f35b346104d45760803660031901126104d4576004356105db612322565b906044356001600160401b0381116104d4576105fb9036906004016123d3565b6064356001600160401b0381116104d45761061a9036906004016124f2565b90825f52600260205261063d60018060a01b03600360405f2001541615156126a4565b825f52600260205260ff600c60405f2001541660038110156104d85760016106659114612855565b825f526008602052600560405f200160018060a01b0385165f5260205261069360ff60405f205416156128a1565b6004805460405163366e8cbf60e21b81526001600160a01b03878116938201849052929692909160209183916024918391165afa9081156104c9575f91610719575b505f516020613bf95f395f51905f52938361071494936106f761070894612906565b610702893314612986565b87612c8a565b60405191829182612441565b0390a3005b929190506020833d60201161076e575b816107366020938361239b565b810103126104d4575f516020613bf95f395f51905f529382610708926106f7610761610714976128f9565b94505093509350936106d5565b3d9150610729565b346104d45760403660031901126104d4576107b8600435610795612322565b906107b36107ae825f525f602052600160405f20015490565b612c0b565b612c43565b005b346104d45760203660031901126104d4576004355f526008602052602060018060a01b03600760405f20015416604051908152f35b346104d45760203660031901126104d4576004355f526001602052602060405f2054604051908152f35b346104d4575f3660031901126104d45760206040517f4224ac760a19a0bd83d3469bb1eb2770cf93bce486d0c94483102de5a5ae0df08152f35b346104d45760203660031901126104d4576004355f526008602052610880610708600360405f20016138d3565b0390f35b346104d45760403660031901126104d45760036004356108a2612322565b5f8281526002602052604090208301546108c6906001600160a01b031615156126a4565b815f52600260205260018060a01b038360405f2001541633148015610a65575b6108ef906126ef565b5f8281526008602090815260408083206001600160a01b038516808552960160010190915290205415610a2057602490608060018060a01b03600454166040519384809263c993d24360e01b82528860048301525afa9081156104c9577ffeaa1c0159e289de4710be5a52de5d047cee5aa7cf311eedecf4253082df3e0e926020925f915f916109e7575b508192610987928761358a565b5f8481526008835260408082206001600160a01b03841683528452902054156109be575b6040519485526001600160a01b031693a3005b5f84815260088352604090206109e1906001600160a01b03831690600101613930565b506109ab565b6109879250610a0e915060803d608011610a19575b610a06818361239b565b810190612a9a565b50919290915061097a565b503d6109fc565b60405162461bcd60e51b815260206004820152601d60248201527f436f6d70757465506f6f6c3a206e6f6465206e6f7420696e20706f6f6c0000006044820152606490fd5b505f828152600260205260409020600401546001600160a01b031633146108e6565b346104d45760403660031901126104d4576107b8600435610aa6612322565b90805f526002602052610ac960018060a01b03600360405f2001541615156126a4565b805f52600260205260018060a01b03600360405f2001541633148015610b16575b610af3906126ef565b610b076001600160a01b0383161515612761565b610b118282612adb565b613365565b505f818152600260205260409020600401546001600160a01b03163314610aea565b346104d4575f3660031901126104d45760206040517f257a11202a56a7d32cd465cc8894ee9eaa6cc12d9b7c22f7f4125f08d6ae39208152f35b346104d45760203660031901126104d4576004355f52600260205260405f20805460018201549160028101610ba690612604565b600382015460048301546005840154600685015460078601549195936001600160a01b03938416939192911690610bdf60088601612604565b92600160a01b6001900360098701541697600a87015495600b88015497600c015460ff16986040519c8d9c8d5260208d015260408c016101a090526101a08c01610c289161234e565b9460608c015260808b015260a08a015260c089015260e0880152868103610100880152610c549161234e565b93610120860152610140850152610160840152610180830161088091612372565b346104d45760403660031901126104d4576107b8600435610c94612322565b90805f526002602052610cb760018060a01b03600360405f2001541615156126a4565b805f52600260205260018060a01b03600360405f2001541633148015610ce6575b610ce1906126ef565b6131ec565b505f818152600260205260409020600401546001600160a01b03163314610cd8565b346104d45760403660031901126104d4576020610d52610d26612322565b6004355f9081526008845260408082206001600160a01b03909316825260029092016020522054151590565b6040519015158152f35b346104d45760403660031901126104d4576107b8600435610d7b612322565b90805f526002602052610d9e60018060a01b03600360405f2001541615156126a4565b805f52600260205260018060a01b03600360405f2001541633148015610ddc575b610dc8906126ef565b610b116001600160a01b0383161515612761565b505f818152600260205260409020600401546001600160a01b03163314610dbf565b346104d45760403660031901126104d4576004356024356001600160401b0381116104d457610e3190369060040161259f565b90825f526002602052610e5460018060a01b03600360405f2001541615156126a4565b825f52600260205260018060a01b03600360405f2001541633148015610fd5575b610e7e906126ef565b825f526002602052600860405f20016001600160401b038311610fc157610eaf83610ea983546125cc565b83612a29565b5f601f8411600114610f395791604091610f0185807f3f78a06fc7106f9e466ac7b072858eb25f88ffecfe63addf4f751e57a9eae2b897965f91610f2e575b508160011b915f199060031b1c19161790565b90555b82825193849260208452816020850152848401375f828201840152601f01601f19168101030190a2005b905084013589610eee565b601f19841690825f5260205f20915f5b818110610fa957509160409391867f3f78a06fc7106f9e466ac7b072858eb25f88ffecfe63addf4f751e57a9eae2b897969410610f90575b5050600184811b019055610f04565b8301355f19600387901b60f8161c191690558680610f81565b91926020600181928689013581550194019201610f49565b634e487b7160e01b5f52604160045260245ffd5b505f838152600260205260409020600401546001600160a01b03163314610e75565b346104d45760203660031901126104d4576004355f52600160205261088061070860405f206138d3565b346104d4575f3660031901126104d45760206040515f8152f35b346104d45760a03660031901126104d457600435611057612322565b906044356001600160401b0381116104d45761107790369060040161259f565b906064356001600160401b0381116104d45761109790369060040161259f565b335f9081527f453801b85a2eb41e1e77caf4d61370d327e1fee91eed150a40d59c377746ae55602052604090205491939160ff161561163957600554604051634a83e9cd60e11b815260048101879052905f90829060249082906001600160a01b03165afa80156104c95786915f91611558575b5051036115085760035493611138604051946111268661237f565b8686526020860194888652369161249e565b91604085019283526060850191338352608086019860018060a01b0316895260a0860142815261117860c08801925f845260e08901945f8652369161249e565b9961010088019a8b526101208801945f86526101408901965f88526101608a01986084358a526101808b019b5f8d525f52600260205260405f209a518b555160018b015560028a0190518051906001600160401b038211610fc1576111e7826111e185546125cc565b85612a29565b602090601f83116001146114a55761121692915f918361149a575b50508160011b915f199060031b1c19161790565b90555b516003890180546001600160a01b03199081166001600160a01b0393841617909155915160048a01805490931691161790555160058701555160068601555160078501559551805190969060088501906001600160401b038111610fc15761128b8161128584546125cc565b84612a29565b6020601f82116001146114345790806112bd92600c999a9b5f926114295750508160011b915f199060031b1c19161790565b90555b516009840180546001600160a01b0319166001600160a01b039290921691909117905551600a83015551600b820155915191019060038110156104d85760ff8019835416911617905560018060a01b0360065416602060018060a01b03600454166044600354915f60405195869485936320af9e4f60e21b8552600485015260248401525af19081156104c9575f916113e7575b50600380545f90815260086020526040902060070180546001600160a01b0319166001600160a01b03909316929092179091555461139190612a78565b90816003555f1982019182116113d357602091604051913390827f606bff4f66442daf75e3b94fa0fed071ffb7573d3c2565ab6e0338af0762d6395f80a48152f35b634e487b7160e01b5f52601160045260245ffd5b90506020813d602011611421575b816114026020938361239b565b810103126104d457516001600160a01b03811681036104d45782611354565b3d91506113f5565b015190508b80611202565b601f19821699835f52815f209a5f5b818110611482575091600c999a9b9184600195941061146a575b505050811b0190556112c0565b01515f1960f88460031b161c191690558a808061145d565b838301518d556001909c019b60209384019301611443565b015190505f80611202565b90601f19831691845f52815f20925f5b8181106114f057509084600195949392106114d8575b505050811b019055611219565b01515f1960f88460031b161c191690558f80806114cb565b929360206001819287860151815501950193016114b5565b60405162461bcd60e51b815260206004820152602260248201527f436f6d70757465506f6f6c3a20646f6d61696e20646f6573206e6f74206578696044820152611cdd60f21b6064820152608490fd5b9150503d805f833e61156a818361239b565b8101906020818303126104d4578051906001600160401b0382116104d457019060a0828203126104d4576040519160a083018381106001600160401b03821117610fc1576040528051835260208101516001600160401b0381116104d457826115d49183016129e3565b602084015260408101516001600160a01b03811681036104d457604084015260608101516001600160401b0381116104d4576080926116149183016129e3565b60608401520151906001600160a01b03821682036104d457869160808201528861110b565b63e2517d3f60e01b5f52336004527f257a11202a56a7d32cd465cc8894ee9eaa6cc12d9b7c22f7f4125f08d6ae392060245260445ffd5b346104d45760403660031901126104d457611689612322565b6004355f525f60205260405f209060018060a01b03165f52602052602060ff60405f2054166040519015158152f35b346104d45760403660031901126104d4576004355f52600160205260206116e460243560405f2061391b565b905460405160039290921b1c6001600160a01b03168152f35b346104d45760403660031901126104d457611716612322565b6004355f526008602052600560405f20019060018060a01b03165f52602052602060ff60405f2054166040519015158152f35b346104d45760803660031901126104d457600435611765612322565b61176d612338565b916064356001600160401b0381116104d45761178d9036906004016124d4565b5f828152600260205260409020600301546117b2906001600160a01b031615156126a4565b815f52600260205260ff600c60405f2001541660038110156104d85760016117da9114612855565b815f526008602052600560405f200160018060a01b0384165f5260205261180860ff60405f205416156128a1565b6004805460405163366e8cbf60e21b81526001600160a01b03868116938201849052929592909160209183916024918391165afa80156104c9575f90611901575b6118539150612906565b61185e843314612986565b60409081519261186e838561239b565b60018452601f198301968736602087013783519761188c858a61239b565b600189525f5b8181106118f05750508785809461071496946118e6946118bf5f516020613bf95f395f51905f529a612820565b6001600160a01b0390911690526118d584612820565b526118df83612820565b5088612c8a565b5191829182612441565b806060602080938d01015201611892565b506020813d602011611934575b8161191b6020938361239b565b810103126104d45761192f611853916128f9565b611849565b3d915061190e565b346104d45761194a36612570565b5f8281526002602052604090206003015461196f906001600160a01b031615156126a4565b815f52600260205260018060a01b03600360405f20015416331480156119ca575b611999906126ef565b5f5b81518110156107b8576001906119c46001600160a01b036119bc8386612841565b5116856131ec565b0161199b565b505f828152600260205260409020600401546001600160a01b03163314611990565b346104d4576119fa36612570565b5f82815260026020526040902060030154611a1f906001600160a01b031615156126a4565b815f52600260205260018060a01b03600360405f2001541633148015611a96575b611a49906126ef565b5f5b81518110156107b8576001906001600160a01b03611a698285612841565b5116611a76575b01611a4b565b611a91828060a01b03611a898386612841565b511685612adb565b611a70565b505f828152600260205260409020600401546001600160a01b03163314611a40565b346104d45760403660031901126104d4576020610d52611ad6612322565b600480355f9081526008855260408082206001600160a01b039094168252929091016020522054151590565b346104d45760803660031901126104d4576004356024356044356001600160401b0381116104d457611b389036906004016123d3565b6064356001600160401b0381116104d457611b579036906004016124f2565b91835f526002602052611b7a60018060a01b03600360405f2001541615156126a4565b5f81815260026020526040902060030154611b9f906001600160a01b031615156126a4565b805f52600260205260ff600c60405f2001541660038110156104d857600103611c215781515f8581526008602090815260408083203384529091529020546107b89591849103611c115750604051611c0a91611bfc60208361239b565b5f82525f3681373390612b35565b3390612c8a565b611c1c913390612b35565b611c0a565b60405162461bcd60e51b815260206004820152602360248201527f436f6d70757465506f6f6c3a206465737420706f6f6c206973206e6f7420726560448201526261647960e81b6064820152608490fd5b346104d45760203660031901126104d4576004355f5260026020526020600a60405f200154604051908152f35b346104d45760403660031901126104d4576004357f7c33539de3ea8f2d6904b1e48db77fb289b201468088b7f1b9dba3ebadc39d326020602435835f5260028252611cfa60018060a01b03600360405f2001541615156126a4565b835f526002825260018060a01b03600360405f2001541633148015611d3c575b611d23906126ef565b835f526002825280600b60405f200155604051908152a2005b505f8481526002835260409020600401546001600160a01b03163314611d1a565b346104d45760203660031901126104d4576004355f526008602052610880610708600160405f20016138d3565b346104d45760403660031901126104d457611da3612322565b6004355f526008602052600660405f20019060018060a01b03165f52602052602060ff60405f2054166040519015158152f35b346104d45760603660031901126104d457600435611df2612322565b90611dfb612338565b5f82815260026020526040902060030154611e20906001600160a01b031615156126a4565b611e34336001600160a01b038516146127c2565b6001600160a01b03169182611e63576107b8925060405191611e5760208461239b565b5f83525f368137612b35565b6107b8929160405192611e7760408561239b565b6001845260203681860137611e8b84612820565b52612b35565b346104d45760403660031901126104d457611eaa612322565b336001600160a01b03821603611ec6576107b890600435612c43565b63334bd91960e11b5f5260045ffd5b346104d45760403660031901126104d457600435611ef1612322565b611f096107ae835f525f602052600160405f20015490565b611f1381836137cb565b611f1957005b5f918252600160205260409091206107b8916001600160a01b031690613a0b565b346104d45760603660031901126104d457600435611f56612322565b90604435916001600160401b0383116104d457611f7a6107b89336906004016123d3565b91805f526002602052611f9d60018060a01b03600360405f2001541615156126a4565b611fb1336001600160a01b038416146127c2565b612b35565b346104d45760203660031901126104d4576020611fe06004355f525f602052600160405f20015490565b604051908152f35b346104d45760203660031901126104d4575f6101806040516120098161237f565b828152826020820152606060408201528260608201528260808201528260a08201528260c08201528260e0820152606061010082015282610120820152826101408201528261016082015201526004355f52600260205260405f206040516120708161237f565b815481526001820154916020820192835261208d60028201612604565b604083019081528260018060a01b03600384015416926060820193845260018060a01b036004820154169360808301948552600582015460a08401908152600683015460c0850190815260078401549060e086019182526120f060088601612604565b92610100870193845260018060a01b03600987015416986101208801998a5260ff600c600a890154986101408b01998a52610160600b8201549b019a8b52015416986101808c019960038110156104d8578a526040519c8d809d602082525190602001525160408d01525160608c016101a090526101c08c016121729161234e565b95516001600160a01b0390811660808d015290511660a08b01525160c08a01525160e08901525161010088015251868203601f19016101208801526121b7919061234e565b93516001600160a01b0316610140860152516101608501525161018084015251610880906101a0840190612372565b346104d45760403660031901126104d4576107b8600435612205612322565b90805f52600260205261222860018060a01b03600360405f2001541615156126a4565b805f52600260205260018060a01b03600360405f200154163314801561226b575b612252906126ef565b6122666001600160a01b0383161515612761565b612adb565b505f818152600260205260409020600401546001600160a01b03163314612249565b346104d4575f3660031901126104d4576005546040516001600160a01b039091168152602090f35b346104d45760203660031901126104d4576004359063ffffffff60e01b82168092036104d457602091635a05180f60e01b81149081156122f7575b5015158152f35b637965db0b60e01b811491508115612311575b50836122f0565b6301ffc9a760e01b1490508361230a565b602435906001600160a01b03821682036104d457565b604435906001600160a01b03821682036104d457565b805180835260209291819084018484015e5f828201840152601f01601f1916010190565b9060038210156104d85752565b6101a081019081106001600160401b03821117610fc157604052565b90601f801991011681019081106001600160401b03821117610fc157604052565b6001600160401b038111610fc15760051b60200190565b9080601f830112156104d4578135906123eb826123bc565b926123f9604051948561239b565b82845260208085019360051b8201019182116104d457602001915b8183106124215750505090565b82356001600160a01b03811681036104d457815260209283019201612414565b60206040818301928281528451809452019201905f5b8181106124645750505090565b82516001600160a01b0316845260209384019390920191600101612457565b6001600160401b038111610fc157601f01601f191660200190565b9291926124aa82612483565b916124b8604051938461239b565b8294818452818301116104d4578281602093845f960137010152565b9080601f830112156104d4578160206124ef9335910161249e565b90565b9080601f830112156104d4578135612509816123bc565b92612517604051948561239b565b81845260208085019260051b820101918383116104d45760208201905b83821061254357505050505090565b81356001600160401b0381116104d457602091612565878480948801016124d4565b815201910190612534565b9060406003198301126104d45760043591602435906001600160401b0382116104d4576124ef916004016123d3565b9181601f840112156104d4578235916001600160401b0383116104d457602083818601950101116104d457565b90600182811c921680156125fa575b60208310146125e657565b634e487b7160e01b5f52602260045260245ffd5b91607f16916125db565b9060405191825f825492612617846125cc565b8084529360018116908115612682575060011461263e575b5061263c9250038361239b565b565b90505f9291925260205f20905f915b81831061266657505090602061263c928201015f61262f565b602091935080600191548385890101520191019091849261264d565b90506020925061263c94915060ff191682840152151560051b8201015f61262f565b156126ab57565b606460405162461bcd60e51b815260206004820152602060248201527f436f6d70757465506f6f6c3a20706f6f6c20646f6573206e6f742065786973746044820152fd5b156126f657565b60405162461bcd60e51b815260206004820152603c60248201527f436f6d70757465506f6f6c3a206f6e6c792063726561746f72206f72206d616e60448201527f616765722063616e20706572666f726d207468697320616374696f6e000000006064820152608490fd5b1561276857565b60405162461bcd60e51b815260206004820152602c60248201527f436f6d70757465506f6f6c3a2070726f76696465722063616e6e6f742062652060448201526b7a65726f206164647265737360a01b6064820152608490fd5b156127c957565b60405162461bcd60e51b815260206004820152602960248201527f436f6d70757465506f6f6c3a206f6e6c792070726f76696465722063616e206c60448201526819585d99481c1bdbdb60ba1b6064820152608490fd5b80511561282d5760200190565b634e487b7160e01b5f52603260045260245ffd5b805182101561282d5760209160051b010190565b1561285c57565b60405162461bcd60e51b815260206004820152601f60248201527f436f6d70757465506f6f6c3a20706f6f6c206973206e6f7420616374697665006044820152606490fd5b156128a857565b60405162461bcd60e51b8152602060048201526024808201527f436f6d70757465506f6f6c3a2070726f766964657220697320626c61636b6c696044820152631cdd195960e21b6064820152608490fd5b519081151582036104d457565b1561290d57565b60405162461bcd60e51b815260206004820152604560248201527f436f6d70757465506f6f6c3a2070726f766964657220686173206e6f7420626560448201527f656e20616c6c6f77656420746f206a6f696e20706f6f6c7320627920666564656064820152643930ba37b960d91b608482015260a490fd5b1561298d57565b60405162461bcd60e51b815260206004820152602860248201527f436f6d70757465506f6f6c3a206f6e6c792070726f76696465722063616e206a6044820152671bda5b881c1bdbdb60c21b6064820152608490fd5b81601f820112156104d4578051906129fa82612483565b92612a08604051948561239b565b828452602083830101116104d457815f9260208093018386015e8301015290565b601f8211612a3657505050565b5f5260205f20906020601f840160051c83019310612a6e575b601f0160051c01905b818110612a63575050565b5f8155600101612a58565b9091508190612a4f565b5f1981146113d35760010190565b51906001600160a01b03821682036104d457565b91908260809103126104d457612aaf82612a86565b91602081015163ffffffff811681036104d457916124ef6060612ad4604085016128f9565b93016128f9565b5f8181526008602090815260408083206001600160a01b039095168084526005959095019091528120805460ff191660011790557fb727dcf46488f8537b19da6b2dbcd45113e28c262332d65b20f1d392a4db453d9080a3565b918051155f14612bdb5750815f526008602052612b57600360405f20016138d3565b5f5b8151811015612b8957600190612b836001600160a01b03612b7a8386612841565b511685876136fe565b01612b59565b50505b815f52600860205260405f2060018060a01b0382165f5260205260405f205415612bb4575050565b5f91825260086020526040909120612bd8916001600160a01b031690600101613930565b50565b5f5b8151811015612c0457600190612bfe6001600160a01b03612b7a8386612841565b01612bdd565b5050612b8c565b5f8181526020818152604080832033845290915290205460ff1615612c2d5750565b63e2517d3f60e01b5f523360045260245260445ffd5b612c4d8282613853565b9182612c5857505090565b5f91825260016020526040909120612c79916001600160a01b031690613930565b5090565b919082018092116113d357565b919290935f5b8451811015612d22575f8481526008602052604090206006016001600160a01b03612cbb8388612841565b511660018060a01b03165f5260205260ff60405f205416612cde57600101612c90565b606460405162461bcd60e51b815260206004820152602060248201527f436f6d70757465506f6f6c3a206e6f646520697320626c61636b6c69737465646044820152fd5b5092612d576001939295835f52600860205260405f2090858060a01b0316948591016001915f520160205260405f2054151590565b156131ce575b5f5b81518110156131c6576004546001600160a01b039081169190608090612d858386612841565b511660246040518095819363c993d24360e01b835260048301525afa80156104c9575f92865f945f925f9461319c575b506001600160a01b031603613135576130d45715613084575f8481526002602052604090206001810154600490910154612e7691906001600160a01b0316612dfd8487612841565b5191612e09858c612841565b519260405190602082019283528960408301526bffffffffffffffffffffffff199060601b16606082015260548152612e4360748261239b565b5190207f19457468657265756d205369676e6564204d6573736167653a0a3332000000005f52601c52603c5f2090613a58565b1561303f57835f526002602052612e9c63ffffffff600a60405f20015493168093612c7d565b845f526002602052600b60405f200154612fdf575b506001600160a01b03612ec48285612841565b511691845f526008602052612edf83600360405f2001613a0b565b505f858152600860205260409020600701546001600160a01b0316803b156104d4575f8091602460405180948193631ae0e73d60e01b83528960048401525af180156104c957612fcf575b50845f526002602052612f45600a60405f2001918254612c7d565b9055835f52600860205260405f20855f5260205260405f20612f678154612a78565b90556004546001600160a01b031691823b156104d4575f9260648492604051958693849263024ad34360e21b84528b60048501526024840152600160448401525af19182156104c957600192612fbf575b5001612d5f565b5f612fc99161239b565b5f612fb8565b5f612fd99161239b565b5f612f2a565b845f526002602052600b60405f2001541115612ffb575f612eb1565b606460405162461bcd60e51b815260206004820152602060248201527f436f6d70757465506f6f6c3a20706f6f6c2069732061742063617061636974796044820152fd5b60405162461bcd60e51b815260206004820152601b60248201527f436f6d70757465506f6f6c3a20696e76616c696420696e7669746500000000006044820152606490fd5b60405162461bcd60e51b815260206004820152602260248201527f436f6d70757465506f6f6c3a206e6f6465206973206e6f742076616c69646174604482015261195960f21b6064820152608490fd5b60405162461bcd60e51b815260206004820152603360248201527f436f6d70757465506f6f6c3a206e6f64652063616e206f6e6c7920626520696e604482015272206f6e6520706f6f6c20617420612074696d6560681b6064820152608490fd5b60405162461bcd60e51b815260206004820152603960248201527f436f6d70757465506f6f6c3a206e6f646520646f6573206e6f742065786973746044820152781037b9103737ba1037bbb732b210313c90383937bb34b232b960391b6064820152608490fd5b92505093506131b9915060803d8111610a1957610a06818361239b565b919491929091905f612db5565b505050509050565b815f5260086020526131e683600160405f2001613a0b565b50612d5d565b5f8181526008602090815260408083206001600160a01b0386168085526004909101909252822054909390613275575b5060207f4d58172de21b64818707d32c7f11f934725f75eb5d4e3be9d5397c801328f80391835f5260088252600660405f2001855f52825260405f20600160ff1982541617905560405194855260018060a01b031693a3565b90506024608060018060a01b03600454166040519283809263c993d24360e01b82528860048301525afa80156104c9577f4d58172de21b64818707d32c7f11f934725f75eb5d4e3be9d5397c801328f803926020925f905f9361333f575b50916001600160a01b03831691839190836132f4575b50505050915061321c565b6132fe928861358a565b845f526008835260405f20815f52835260405f205415613321575b8080806132e9565b61333890855f5260088452600160405f2001613930565b505f613319565b905061335b91925060803d608011610a1957610a06818361239b565b505091905f6132d3565b6004805460405163b483ac5d60e01b81526001600160a01b03808616938201849052600160248301529495949093915f9185916044918391165afa9283156104c9575f936134f0575b505f5b83518110156134ad575f8281526008602052604090206133f6906003016001600160a01b036133e08488612841565b5116906001915f520160205260405f2054151590565b613403575b6001016133b1565b6004546001600160a01b0390811691906080906134208388612841565b511660246040518095819363c993d24360e01b835260048301525afa80156104c957846001935f905f93613488575b50848060a01b031614613465575b5090506133fb565b61348290838060a01b036134798489612841565b5116898661358a565b5f61345d565b90506134a391925060803d8111610a1957610a06818361239b565b505091905f61344f565b50909150612bd892935081817ffa6726d61af679b41d56109ec1e7ee27db5048f3b87216874563eeced1f276305f80a35f526008602052600160405f2001613930565b9092503d805f833e613502818361239b565b8101906020818303126104d4578051906001600160401b0382116104d457019080601f830112156104d4578151613538816123bc565b92613546604051948561239b565b81845260208085019260051b8201019283116104d457602001905b82821061357257505050915f6133ae565b6020809161357f84612a86565b815201910190613561565b5f818152600860205260408120909492936001600160a01b031692906135b4908490600301613930565b505f828152600860205260409020600701546001600160a01b0316803b156104d4575f80916024604051809481936334388fe160e21b83528960048401525af180156104c9576136e9575b508185526002602052600a604086200163ffffffff8154921682039182116136d55755835260086020526040832060018060a01b0383165f5260205260405f20805480156136c1575f190190556004546001600160a01b031691823b156136bd57906064849283604051958694859363024ad34360e21b855260018060a01b0316600485015260248401528160448401525af180156136b2576136a0575050565b6136ab82809261239b565b6102405750565b6040513d84823e3d90fd5b8380fd5b634e487b7160e01b85526011600452602485fd5b634e487b7160e01b86526011600452602486fd5b6136f69195505f9061239b565b5f935f6135ff565b6004805460405163c993d24360e01b81526001600160a01b038681169382018490529095939493929160809187916024918391165afa9283156104c9575f955f946137a2575b506001600160a01b0381811696168614613761575b505050505050565b7f26d6fbdc6ba12646d85870f07976c5177fc1a947d332744bd2f2588d8a1243fa93602093613790928761358a565b604051908152a35f8080808080613759565b9093506137bf91955060803d608011610a1957610a06818361239b565b5050949094925f613744565b5f818152602081815260408083206001600160a01b038616845290915290205460ff1661384d575f818152602081815260408083206001600160a01b0395909516808452949091528120805460ff19166001179055339291907f2f8788117e7eff1d82e926ec794901d17c78024a50270940304540a733656f0d9080a4600190565b50505f90565b5f818152602081815260408083206001600160a01b038616845290915290205460ff161561384d575f818152602081815260408083206001600160a01b0395909516808452949091528120805460ff19169055339291907ff6391f5c32d9c69d2a47ea670b442974b53935d1edc7fd64eb21e047a839171b9080a4600190565b90604051918281549182825260208201905f5260205f20925f5b81811061390257505061263c9250038361239b565b84548352600194850194879450602090930192016138ed565b805482101561282d575f5260205f2001905f90565b906001820191815f528260205260405f20548015155f14613a03575f1981018181116113d35782545f198101919082116113d3578181036139b8575b505050805480156139a4575f190190613985828261391b565b8154905f199060031b1b19169055555f526020525f6040812055600190565b634e487b7160e01b5f52603160045260245ffd5b6139ee6139c86139d8938661391b565b90549060031b1c9283928661391b565b819391549060031b91821b915f19901b19161790565b90555f528360205260405f20555f808061396c565b505050505f90565b5f82815260018201602052604090205461384d57805490600160401b821015610fc15782613a436139d884600180960185558461391b565b90558054925f520160205260405f2055600190565b9190823b613a935790613a6a91613b46565b5060048110156104d857159182613a8057505090565b6001600160a01b03918216911614919050565b915f92613ac9613ad785946040519283916020830195630b135d3f60e11b8752602484015260406044840152606483019061234e565b03601f19810183528261239b565b51915afa3d15613b3f573d613aeb81612483565b90613af9604051928361239b565b81523d5f602083013e5b81613b31575b81613b12575090565b90506020818051810103126104d45760200151630b135d3f60e11b1490565b905060208151101590613b09565b6060613b03565b8151919060418303613b7657613b6f9250602082015190606060408401519301515f1a90613b80565b9192909190565b50505f9160029190565b91906fa2a8918ca85bafe22016d0b997e4df60600160ff1b038411613bed579160209360809260ff5f9560405194855216868401526040830152606082015282805260015afa156104c9575f516001600160a01b03811615613be357905f905f90565b505f906001905f90565b5050505f916003919056febcdd4a6f29bb81131471f3192fe48a218af901e1c9888b463659bb61fbeb3815a2646970667358221220e9b1763c12588f05afff4433310106d4154e34197b7e40f654958c0b44d1fb4364736f6c634300081c0033

0000000000000000000000000dfd3646391c8cbde50b8b3541a2f6f12718c23f000000000000000000000000e9f8e23199fa9a8331314272adaf5d931c12384c0000000000000000000000003b03ad8e9f03cfa364d80cd52b98e6523e04137600000000000000000000000052886277dc3490f1c41cab0dbaf89260927b0f7d0000000000000000000000008958d3b2aa57fe0d8ca6710ef1bed1f104e1cded

-----Decoded View---------------
Arg [0] : _primeAdmin (address): 0x0DFd3646391c8CBde50b8B3541a2F6f12718c23F
Arg [1] : _domainRegistry (address): 0xE9f8e23199FA9A8331314272AdaF5D931c12384C
Arg [2] : _computeRegistry (address): 0x3B03Ad8e9F03cfA364d80cd52b98E6523E041376
Arg [3] : _rewardsDistributorFactory (address): 0x52886277dc3490F1c41Cab0dBaF89260927B0F7d
Arg [4] : _AIToken (address): 0x8958D3b2aa57Fe0d8CA6710EF1bED1f104e1CdeD

-----Encoded View---------------
5 Constructor Arguments found :
Arg [0] : 0000000000000000000000000dfd3646391c8cbde50b8b3541a2f6f12718c23f
Arg [1] : 000000000000000000000000e9f8e23199fa9a8331314272adaf5d931c12384c
Arg [2] : 0000000000000000000000003b03ad8e9f03cfa364d80cd52b98e6523e041376
Arg [3] : 00000000000000000000000052886277dc3490f1c41cab0dbaf89260927b0f7d
Arg [4] : 0000000000000000000000008958d3b2aa57fe0d8ca6710ef1bed1f104e1cded