Contract

Contract Source Code (Solidity Standard Json-Input format)

IDE

• Blockscan IDE
• 🤖 Code ReaderBeta
• Remix IDE

More Options

• Similar
• Sol2Uml
• Submit Audit
• Compare

// SPDX-License-Identifier: MIT

pragma solidity ^0.8.7;

import "@openzeppelin/contracts/token/ERC20/IERC20.sol";
import "@openzeppelin/contracts/token/ERC20/utils/SafeERC20.sol";
import "@openzeppelin/contracts/utils/Address.sol";
import "@openzeppelin/contracts/utils/structs/BitMaps.sol";
import "@openzeppelin/contracts/access/AccessControl.sol";
import "@openzeppelin/contracts/utils/cryptography/MerkleProof.sol";

error AlreadyClaimed();
error InvalidProof();

/**
 * @author [email protected]
 * TODO unsafe : Non-Detected contract call return value
 */
contract MerkleDistributor is AccessControl {
    
    using SafeERC20 for IERC20;
    using BitMaps for BitMaps.BitMap;
    using Address for address;
    
    bytes32 public constant CREATE_ROLE = keccak256("CREATE_ROLE");

    event Claimed(uint256 roundID, address sender, uint256 index);

    struct Project {
        address target;                 // nft or deposit or any contract
        address payable receipt;        // receive payment 
        bytes32 merkleRoot;             // merkle root
        BitMaps.BitMap bitmap;          // distribute status of index
        address payment;                // ETH or ERC20
        uint256 price;                  // nft price
        uint256 startTime;              // start
        uint256 endTime;                // end
    }

    // roundID => Project
    mapping(uint256 => Project) private round;

    constructor(address root, address creator) {
        _setupRole(DEFAULT_ADMIN_ROLE, root);
        _grantRole(CREATE_ROLE, creator);
    }

    // Setting
    function launchpad( uint256 _roundID, address _target, bytes32 _merkleRoot, address payable _receipt, address _payment, uint256 _price, uint256 _startTime, uint256 _endTime) public onlyRole(CREATE_ROLE) {
        
        require(_endTime > block.timestamp, "End time is past");
        require( _target != address(0) , "require target");
        require( _receipt != address(0), "require receipt");
        require( _price > 0 , "price > 0");

        Project storage project = round[_roundID];
        
        require(project.target == address(0) , "Do not repeat Settings");

        project.merkleRoot = _merkleRoot;
        project.target = _target;
        project.receipt = _receipt;
        project.payment = _payment;
        project.price = _price;
        project.startTime = _startTime;
        project.endTime = _endTime;
    }

    // anyone can pay
    function claim(uint256 roundID, uint256 index, uint256 num, bytes calldata calldataABI, bytes32[] calldata merkleProof) public payable {
        
        Project storage project = round[roundID];
        
        // Verify time
        require(project.startTime <= block.timestamp, "Hasn't begined");
        require(project.endTime >= block.timestamp, "It's over");

        // Verify claim
        if (project.bitmap.get(index)) revert AlreadyClaimed();

        // Verify the merkle proof.
        bytes32 node = keccak256(abi.encodePacked(roundID, index, num, calldataABI));
        if (!MerkleProof.verify(merkleProof, project.merkleRoot, node)) revert InvalidProof();
        
        // Mark it claimed
        project.bitmap.set(index);

        // Receipt token && Refund token
        uint256 total = project.price * num;
        if( project.payment == address(0) ) {
            require(msg.value >= total, 'You have to pay enough eth.');
            uint256 refund = msg.value - total;
            if(refund > 0) payable(msg.sender).transfer(refund);
            project.receipt.transfer(total);
        } else {
            require(msg.value == 0, "You don't need to pay eth");
            IERC20(project.payment).safeTransferFrom(msg.sender, project.receipt, total);
        }

        // execute
        // TODO unsafe : Non-Detected contract call return value
        project.target.functionCall(calldataABI, "MerkleDistributor: Call ABI failed.");
        emit Claimed(roundID, msg.sender, index);
    }
    
    // Returns project details by this round.
    function getProject(uint256 roundID) external view returns (address,address, bytes32, address, uint256, uint256, uint256) {
        Project storage project = round[roundID];
        return (project.target, project.receipt, project.merkleRoot, project.payment, project.price, project.startTime, project.endTime);
    }

    // Returns true if the index has been marked claimed by this round.
    function isClaimed(uint256 roundID, uint256 index) external view returns (bool) {
        Project storage project = round[roundID];
        return project.bitmap.get(index);
    }
}

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

pragma solidity ^0.8.0;

/**
 * @dev These functions deal with verification of Merkle Tree proofs.
 *
 * The tree and the proofs can be generated using our
 * https://github.com/OpenZeppelin/merkle-tree[JavaScript library].
 * You will find a quickstart guide in the readme.
 *
 * WARNING: You should avoid using leaf values that are 64 bytes long prior to
 * hashing, or use a hash function other than keccak256 for hashing leaves.
 * This is because the concatenation of a sorted pair of internal nodes in
 * the merkle tree could be reinterpreted as a leaf value.
 * OpenZeppelin's JavaScript library generates merkle trees that are safe
 * against this attack out of the box.
 */
library MerkleProof {
    /**
     * @dev Returns true if a `leaf` can be proved to be a part of a Merkle tree
     * defined by `root`. For this, a `proof` must be provided, containing
     * sibling hashes on the branch from the leaf to the root of the tree. Each
     * pair of leaves and each pair of pre-images are assumed to be sorted.
     */
    function verify(
        bytes32[] memory proof,
        bytes32 root,
        bytes32 leaf
    ) internal pure returns (bool) {
        return processProof(proof, leaf) == root;
    }

    /**
     * @dev Calldata version of {verify}
     *
     * _Available since v4.7._
     */
    function verifyCalldata(
        bytes32[] calldata proof,
        bytes32 root,
        bytes32 leaf
    ) internal pure returns (bool) {
        return processProofCalldata(proof, leaf) == root;
    }

    /**
     * @dev Returns the rebuilt hash obtained by traversing a Merkle tree up
     * from `leaf` using `proof`. A `proof` is valid if and only if the rebuilt
     * hash matches the root of the tree. When processing the proof, the pairs
     * of leafs & pre-images are assumed to be sorted.
     *
     * _Available since v4.4._
     */
    function processProof(bytes32[] memory proof, bytes32 leaf) internal pure returns (bytes32) {
        bytes32 computedHash = leaf;
        for (uint256 i = 0; i < proof.length; i++) {
            computedHash = _hashPair(computedHash, proof[i]);
        }
        return computedHash;
    }

    /**
     * @dev Calldata version of {processProof}
     *
     * _Available since v4.7._
     */
    function processProofCalldata(bytes32[] calldata proof, bytes32 leaf) internal pure returns (bytes32) {
        bytes32 computedHash = leaf;
        for (uint256 i = 0; i < proof.length; i++) {
            computedHash = _hashPair(computedHash, proof[i]);
        }
        return computedHash;
    }

    /**
     * @dev Returns true if the `leaves` can be simultaneously proven to be a part of a merkle tree defined by
     * `root`, according to `proof` and `proofFlags` as described in {processMultiProof}.
     *
     * CAUTION: Not all merkle trees admit multiproofs. See {processMultiProof} for details.
     *
     * _Available since v4.7._
     */
    function multiProofVerify(
        bytes32[] memory proof,
        bool[] memory proofFlags,
        bytes32 root,
        bytes32[] memory leaves
    ) internal pure returns (bool) {
        return processMultiProof(proof, proofFlags, leaves) == root;
    }

    /**
     * @dev Calldata version of {multiProofVerify}
     *
     * CAUTION: Not all merkle trees admit multiproofs. See {processMultiProof} for details.
     *
     * _Available since v4.7._
     */
    function multiProofVerifyCalldata(
        bytes32[] calldata proof,
        bool[] calldata proofFlags,
        bytes32 root,
        bytes32[] memory leaves
    ) internal pure returns (bool) {
        return processMultiProofCalldata(proof, proofFlags, leaves) == root;
    }

    /**
     * @dev Returns the root of a tree reconstructed from `leaves` and sibling nodes in `proof`. The reconstruction
     * proceeds by incrementally reconstructing all inner nodes by combining a leaf/inner node with either another
     * leaf/inner node or a proof sibling node, depending on whether each `proofFlags` item is true or false
     * respectively.
     *
     * CAUTION: Not all merkle trees admit multiproofs. To use multiproofs, it is sufficient to ensure that: 1) the tree
     * is complete (but not necessarily perfect), 2) the leaves to be proven are in the opposite order they are in the
     * tree (i.e., as seen from right to left starting at the deepest layer and continuing at the next layer).
     *
     * _Available since v4.7._
     */
    function processMultiProof(
        bytes32[] memory proof,
        bool[] memory proofFlags,
        bytes32[] memory leaves
    ) internal pure returns (bytes32 merkleRoot) {
        // This function rebuild the root hash by traversing the tree up from the leaves. The root is rebuilt by
        // consuming and producing values on a queue. The queue starts with the `leaves` array, then goes onto the
        // `hashes` array. At the end of the process, the last hash in the `hashes` array should contain the root of
        // the merkle tree.
        uint256 leavesLen = leaves.length;
        uint256 totalHashes = proofFlags.length;

        // Check proof validity.
        require(leavesLen + proof.length - 1 == totalHashes, "MerkleProof: invalid multiproof");

        // The xxxPos values are "pointers" to the next value to consume in each array. All accesses are done using
        // `xxx[xxxPos++]`, which return the current value and increment the pointer, thus mimicking a queue's "pop".
        bytes32[] memory hashes = new bytes32[](totalHashes);
        uint256 leafPos = 0;
        uint256 hashPos = 0;
        uint256 proofPos = 0;
        // At each step, we compute the next hash using two values:
        // - a value from the "main queue". If not all leaves have been consumed, we get the next leaf, otherwise we
        //   get the next hash.
        // - depending on the flag, either another value for the "main queue" (merging branches) or an element from the
        //   `proof` array.
        for (uint256 i = 0; i < totalHashes; i++) {
            bytes32 a = leafPos < leavesLen ? leaves[leafPos++] : hashes[hashPos++];
            bytes32 b = proofFlags[i] ? leafPos < leavesLen ? leaves[leafPos++] : hashes[hashPos++] : proof[proofPos++];
            hashes[i] = _hashPair(a, b);
        }

        if (totalHashes > 0) {
            return hashes[totalHashes - 1];
        } else if (leavesLen > 0) {
            return leaves[0];
        } else {
            return proof[0];
        }
    }

    /**
     * @dev Calldata version of {processMultiProof}.
     *
     * CAUTION: Not all merkle trees admit multiproofs. See {processMultiProof} for details.
     *
     * _Available since v4.7._
     */
    function processMultiProofCalldata(
        bytes32[] calldata proof,
        bool[] calldata proofFlags,
        bytes32[] memory leaves
    ) internal pure returns (bytes32 merkleRoot) {
        // This function rebuild the root hash by traversing the tree up from the leaves. The root is rebuilt by
        // consuming and producing values on a queue. The queue starts with the `leaves` array, then goes onto the
        // `hashes` array. At the end of the process, the last hash in the `hashes` array should contain the root of
        // the merkle tree.
        uint256 leavesLen = leaves.length;
        uint256 totalHashes = proofFlags.length;

        // Check proof validity.
        require(leavesLen + proof.length - 1 == totalHashes, "MerkleProof: invalid multiproof");

        // The xxxPos values are "pointers" to the next value to consume in each array. All accesses are done using
        // `xxx[xxxPos++]`, which return the current value and increment the pointer, thus mimicking a queue's "pop".
        bytes32[] memory hashes = new bytes32[](totalHashes);
        uint256 leafPos = 0;
        uint256 hashPos = 0;
        uint256 proofPos = 0;
        // At each step, we compute the next hash using two values:
        // - a value from the "main queue". If not all leaves have been consumed, we get the next leaf, otherwise we
        //   get the next hash.
        // - depending on the flag, either another value for the "main queue" (merging branches) or an element from the
        //   `proof` array.
        for (uint256 i = 0; i < totalHashes; i++) {
            bytes32 a = leafPos < leavesLen ? leaves[leafPos++] : hashes[hashPos++];
            bytes32 b = proofFlags[i] ? leafPos < leavesLen ? leaves[leafPos++] : hashes[hashPos++] : proof[proofPos++];
            hashes[i] = _hashPair(a, b);
        }

        if (totalHashes > 0) {
            return hashes[totalHashes - 1];
        } else if (leavesLen > 0) {
            return leaves[0];
        } else {
            return proof[0];
        }
    }

    function _hashPair(bytes32 a, bytes32 b) private pure returns (bytes32) {
        return a < b ? _efficientHash(a, b) : _efficientHash(b, a);
    }

    function _efficientHash(bytes32 a, bytes32 b) private pure returns (bytes32 value) {
        /// @solidity memory-safe-assembly
        assembly {
            mstore(0x00, a)
            mstore(0x20, b)
            value := keccak256(0x00, 0x40)
        }
    }
}

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

pragma solidity ^0.8.0;

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

/**
 * @dev Contract module that allows children to implement role-based access
 * control mechanisms. This is a lightweight version that doesn't allow enumerating role
 * members except through off-chain means by accessing the contract event logs. Some
 * applications may benefit from on-chain enumerability, for those cases see
 * {AccessControlEnumerable}.
 *
 * Roles are referred to by their `bytes32` identifier. These should be exposed
 * in the external API and be unique. The best way to achieve this is by
 * using `public constant` hash digests:
 *
 * ```
 * 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}:
 *
 * ```
 * 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.
 */
abstract contract AccessControl is Context, IAccessControl, ERC165 {
    struct RoleData {
        mapping(address => bool) members;
        bytes32 adminRole;
    }

    mapping(bytes32 => RoleData) private _roles;

    bytes32 public constant DEFAULT_ADMIN_ROLE = 0x00;

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

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

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

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

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

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

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

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

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

        _revokeRole(role, account);
    }

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

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

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

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

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v4.8.0) (utils/structs/BitMaps.sol)
pragma solidity ^0.8.0;

/**
 * @dev Library for managing uint256 to bool mapping in a compact and efficient way, providing the keys are sequential.
 * Largely inspired by Uniswap's https://github.com/Uniswap/merkle-distributor/blob/master/contracts/MerkleDistributor.sol[merkle-distributor].
 */
library BitMaps {
    struct BitMap {
        mapping(uint256 => uint256) _data;
    }

    /**
     * @dev Returns whether the bit at `index` is set.
     */
    function get(BitMap storage bitmap, uint256 index) internal view returns (bool) {
        uint256 bucket = index >> 8;
        uint256 mask = 1 << (index & 0xff);
        return bitmap._data[bucket] & mask != 0;
    }

    /**
     * @dev Sets the bit at `index` to the boolean `value`.
     */
    function setTo(
        BitMap storage bitmap,
        uint256 index,
        bool value
    ) internal {
        if (value) {
            set(bitmap, index);
        } else {
            unset(bitmap, index);
        }
    }

    /**
     * @dev Sets the bit at `index`.
     */
    function set(BitMap storage bitmap, uint256 index) internal {
        uint256 bucket = index >> 8;
        uint256 mask = 1 << (index & 0xff);
        bitmap._data[bucket] |= mask;
    }

    /**
     * @dev Unsets the bit at `index`.
     */
    function unset(BitMap storage bitmap, uint256 index) internal {
        uint256 bucket = index >> 8;
        uint256 mask = 1 << (index & 0xff);
        bitmap._data[bucket] &= ~mask;
    }
}

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

pragma solidity ^0.8.1;

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

        return account.code.length > 0;
    }

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

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

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

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

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

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

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

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

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

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

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

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

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

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v4.8.0) (token/ERC20/utils/SafeERC20.sol)

pragma solidity ^0.8.0;

import "../IERC20.sol";
import "../extensions/draft-IERC20Permit.sol";
import "../../../utils/Address.sol";

/**
 * @title SafeERC20
 * @dev Wrappers around ERC20 operations that throw on failure (when the token
 * contract returns false). Tokens that return no value (and instead revert or
 * throw on failure) are also supported, non-reverting calls are assumed to be
 * successful.
 * To use this library you can add a `using SafeERC20 for IERC20;` statement to your contract,
 * which allows you to call the safe operations as `token.safeTransfer(...)`, etc.
 */
library SafeERC20 {
    using Address for address;

    function safeTransfer(
        IERC20 token,
        address to,
        uint256 value
    ) internal {
        _callOptionalReturn(token, abi.encodeWithSelector(token.transfer.selector, to, value));
    }

    function safeTransferFrom(
        IERC20 token,
        address from,
        address to,
        uint256 value
    ) internal {
        _callOptionalReturn(token, abi.encodeWithSelector(token.transferFrom.selector, from, to, value));
    }

    /**
     * @dev Deprecated. This function has issues similar to the ones found in
     * {IERC20-approve}, and its usage is discouraged.
     *
     * Whenever possible, use {safeIncreaseAllowance} and
     * {safeDecreaseAllowance} instead.
     */
    function safeApprove(
        IERC20 token,
        address spender,
        uint256 value
    ) internal {
        // safeApprove should only be called when setting an initial allowance,
        // or when resetting it to zero. To increase and decrease it, use
        // 'safeIncreaseAllowance' and 'safeDecreaseAllowance'
        require(
            (value == 0) || (token.allowance(address(this), spender) == 0),
            "SafeERC20: approve from non-zero to non-zero allowance"
        );
        _callOptionalReturn(token, abi.encodeWithSelector(token.approve.selector, spender, value));
    }

    function safeIncreaseAllowance(
        IERC20 token,
        address spender,
        uint256 value
    ) internal {
        uint256 newAllowance = token.allowance(address(this), spender) + value;
        _callOptionalReturn(token, abi.encodeWithSelector(token.approve.selector, spender, newAllowance));
    }

    function safeDecreaseAllowance(
        IERC20 token,
        address spender,
        uint256 value
    ) internal {
        unchecked {
            uint256 oldAllowance = token.allowance(address(this), spender);
            require(oldAllowance >= value, "SafeERC20: decreased allowance below zero");
            uint256 newAllowance = oldAllowance - value;
            _callOptionalReturn(token, abi.encodeWithSelector(token.approve.selector, spender, newAllowance));
        }
    }

    function safePermit(
        IERC20Permit token,
        address owner,
        address spender,
        uint256 value,
        uint256 deadline,
        uint8 v,
        bytes32 r,
        bytes32 s
    ) internal {
        uint256 nonceBefore = token.nonces(owner);
        token.permit(owner, spender, value, deadline, v, r, s);
        uint256 nonceAfter = token.nonces(owner);
        require(nonceAfter == nonceBefore + 1, "SafeERC20: permit did not succeed");
    }

    /**
     * @dev Imitates a Solidity high-level call (i.e. a regular function call to a contract), relaxing the requirement
     * on the return value: the return value is optional (but if data is returned, it must not be false).
     * @param token The token targeted by the call.
     * @param data The call data (encoded using abi.encode or one of its variants).
     */
    function _callOptionalReturn(IERC20 token, bytes memory data) private {
        // We need to perform a low level call here, to bypass Solidity's return data size checking mechanism, since
        // we're implementing it ourselves. We use {Address-functionCall} to perform this call, which verifies that
        // the target address contains contract code and also asserts for success in the low-level call.

        bytes memory returndata = address(token).functionCall(data, "SafeERC20: low-level call failed");
        if (returndata.length > 0) {
            // Return data is optional
            require(abi.decode(returndata, (bool)), "SafeERC20: ERC20 operation did not succeed");
        }
    }
}

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

pragma solidity ^0.8.0;

/**
 * @dev Interface of the ERC20 standard as defined in the EIP.
 */
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 amount of tokens in existence.
     */
    function totalSupply() external view returns (uint256);

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

    /**
     * @dev Moves `amount` 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 amount) 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 `amount` 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 amount) external returns (bool);

    /**
     * @dev Moves `amount` tokens from `from` to `to` using the
     * allowance mechanism. `amount` 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 amount
    ) external returns (bool);
}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts v4.4.1 (token/ERC20/extensions/draft-IERC20Permit.sol)

pragma solidity ^0.8.0;

/**
 * @dev Interface of the ERC20 Permit extension allowing approvals to be made via signatures, as defined in
 * https://eips.ethereum.org/EIPS/eip-2612[EIP-2612].
 *
 * Adds the {permit} method, which can be used to change an account's ERC20 allowance (see {IERC20-allowance}) by
 * presenting a message signed by the account. By not relying on {IERC20-approve}, the token holder account doesn't
 * need to send a transaction, and thus is not required to hold Ether at all.
 */
interface IERC20Permit {
    /**
     * @dev Sets `value` as the allowance of `spender` over ``owner``'s tokens,
     * given ``owner``'s signed approval.
     *
     * IMPORTANT: The same issues {IERC20-approve} has related to transaction
     * ordering also apply here.
     *
     * Emits an {Approval} event.
     *
     * Requirements:
     *
     * - `spender` cannot be the zero address.
     * - `deadline` must be a timestamp in the future.
     * - `v`, `r` and `s` must be a valid `secp256k1` signature from `owner`
     * over the EIP712-formatted function arguments.
     * - the signature must use ``owner``'s current nonce (see {nonces}).
     *
     * For more information on the signature format, see the
     * https://eips.ethereum.org/EIPS/eip-2612#specification[relevant EIP
     * section].
     */
    function permit(
        address owner,
        address spender,
        uint256 value,
        uint256 deadline,
        uint8 v,
        bytes32 r,
        bytes32 s
    ) external;

    /**
     * @dev Returns the current nonce for `owner`. This value must be
     * included whenever a signature is generated for {permit}.
     *
     * Every successful call to {permit} increases ``owner``'s nonce by one. This
     * prevents a signature from being used multiple times.
     */
    function nonces(address owner) external view returns (uint256);

    /**
     * @dev Returns the domain separator used in the encoding of the signature for {permit}, as defined by {EIP712}.
     */
    // solhint-disable-next-line func-name-mixedcase
    function DOMAIN_SEPARATOR() external view returns (bytes32);
}

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

pragma solidity ^0.8.0;

import "./IERC165.sol";

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

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

pragma solidity ^0.8.0;

import "./math/Math.sol";

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

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

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

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

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

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

pragma solidity ^0.8.0;

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

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

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

pragma solidity ^0.8.0;

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

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

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

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

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

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

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

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

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

pragma solidity ^0.8.0;

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

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

pragma solidity ^0.8.0;

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

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

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

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

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

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

            // Handle non-overflow cases, 256 by 256 division.
            if (prod1 == 0) {
                return prod0 / denominator;
            }

            // Make sure the result is less than 2^256. Also prevents denominator == 0.
            require(denominator > prod1);

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

{
  "optimizer": {
    "enabled": true,
    "runs": 200
  },
  "outputSelection": {
    "*": {
      "*": [
        "evm.bytecode",
        "evm.deployedBytecode",
        "abi"
      ]
    }
  }
}

• No Contract Security Audit Submitted- Submit Audit Here

[{"inputs":[{"internalType":"address","name":"root","type":"address"},{"internalType":"address","name":"creator","type":"address"}],"stateMutability":"nonpayable","type":"constructor"},{"inputs":[],"name":"AlreadyClaimed","type":"error"},{"inputs":[],"name":"InvalidProof","type":"error"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"uint256","name":"roundID","type":"uint256"},{"indexed":false,"internalType":"address","name":"sender","type":"address"},{"indexed":false,"internalType":"uint256","name":"index","type":"uint256"}],"name":"Claimed","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":"CREATE_ROLE","outputs":[{"internalType":"bytes32","name":"","type":"bytes32"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"DEFAULT_ADMIN_ROLE","outputs":[{"internalType":"bytes32","name":"","type":"bytes32"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"roundID","type":"uint256"},{"internalType":"uint256","name":"index","type":"uint256"},{"internalType":"uint256","name":"num","type":"uint256"},{"internalType":"bytes","name":"calldataABI","type":"bytes"},{"internalType":"bytes32[]","name":"merkleProof","type":"bytes32[]"}],"name":"claim","outputs":[],"stateMutability":"payable","type":"function"},{"inputs":[{"internalType":"uint256","name":"roundID","type":"uint256"}],"name":"getProject","outputs":[{"internalType":"address","name":"","type":"address"},{"internalType":"address","name":"","type":"address"},{"internalType":"bytes32","name":"","type":"bytes32"},{"internalType":"address","name":"","type":"address"},{"internalType":"uint256","name":"","type":"uint256"},{"internalType":"uint256","name":"","type":"uint256"},{"internalType":"uint256","name":"","type":"uint256"}],"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":"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":"roundID","type":"uint256"},{"internalType":"uint256","name":"index","type":"uint256"}],"name":"isClaimed","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"_roundID","type":"uint256"},{"internalType":"address","name":"_target","type":"address"},{"internalType":"bytes32","name":"_merkleRoot","type":"bytes32"},{"internalType":"address payable","name":"_receipt","type":"address"},{"internalType":"address","name":"_payment","type":"address"},{"internalType":"uint256","name":"_price","type":"uint256"},{"internalType":"uint256","name":"_startTime","type":"uint256"},{"internalType":"uint256","name":"_endTime","type":"uint256"}],"name":"launchpad","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"bytes32","name":"role","type":"bytes32"},{"internalType":"address","name":"account","type":"address"}],"name":"renounceRole","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"bytes32","name":"role","type":"bytes32"},{"internalType":"address","name":"account","type":"address"}],"name":"revokeRole","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"bytes4","name":"interfaceId","type":"bytes4"}],"name":"supportsInterface","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"}]

0x6080604052600436106100a65760003560e01c806336568abe1161006457806336568abe146101a757806391d14854146101c7578063a217fddf146101e7578063d547741f146101fc578063f0f3f2c81461021c578063f364c90c146102ca57600080fd5b80626f53c9146100ab57806301ffc9a7146100f25780630c21254a14610122578063248a9ca3146101375780632573658b146101675780632f2ff15d14610187575b600080fd5b3480156100b757600080fd5b506100df7f2ad5dda4abad2eba9015076cc6a1db468a91b444067d58b590c8c73985521a0481565b6040519081526020015b60405180910390f35b3480156100fe57600080fd5b5061011261010d366004611037565b6102ea565b60405190151581526020016100e9565b6101356101303660046110ad565b610321565b005b34801561014357600080fd5b506100df610152366004611168565b60009081526020819052604090206001015490565b34801561017357600080fd5b50610135610182366004611196565b6106c6565b34801561019357600080fd5b506101356101a236600461120e565b6108bb565b3480156101b357600080fd5b506101356101c236600461120e565b6108e5565b3480156101d357600080fd5b506101126101e236600461120e565b610963565b3480156101f357600080fd5b506100df600081565b34801561020857600080fd5b5061013561021736600461120e565b61098c565b34801561022857600080fd5b50610285610237366004611168565b600090815260016020819052604090912080549181015460028201546004830154600584015460068501546007909501546001600160a01b0396871697948716969395939092169390929190565b604080516001600160a01b0398891681529688166020880152860194909452949091166060840152608083015260a082019290925260c081019190915260e0016100e9565b3480156102d657600080fd5b506101126102e536600461123e565b6109b1565b60006001600160e01b03198216637965db0b60e01b148061031b57506301ffc9a760e01b6001600160e01b03198316145b92915050565b600087815260016020526040902060068101544210156103795760405162461bcd60e51b815260206004820152600e60248201526d12185cdb89dd08189959da5b995960921b60448201526064015b60405180910390fd5b42816007015410156103b95760405162461bcd60e51b815260206004820152600960248201526824ba13b99037bb32b960b91b6044820152606401610370565b600887901c6000908152600382016020526040902054600160ff89161b16156103f557604051630c8d9eab60e31b815260040160405180910390fd5b60008888888888604051602001610410959493929190611260565b6040516020818303038152906040528051906020012090506104698484808060200260200160405190810160405280939291908181526020018383602002808284376000920191909152505050506002840154836109e6565b610486576040516309bde33960e01b815260040160405180910390fd5b600888901c600090815260038301602052604081208054600160ff8c161b17905560058301546104b790899061129e565b60048401549091506001600160a01b03166105a2578034101561051c5760405162461bcd60e51b815260206004820152601b60248201527f596f75206861766520746f2070617920656e6f756768206574682e00000000006044820152606401610370565b600061052882346112b5565b9050801561055f57604051339082156108fc029083906000818181858888f1935050505015801561055d573d6000803e3d6000fd5b505b60018401546040516001600160a01b039091169083156108fc029084906000818181858888f1935050505015801561059b573d6000803e3d6000fd5b5050610613565b34156105f05760405162461bcd60e51b815260206004820152601960248201527f596f7520646f6e2774206e65656420746f2070617920657468000000000000006044820152606401610370565b60018301546004840154610613916001600160a01b0391821691339116846109fc565b61067987878080601f01602080910402602001604051908101604052809392919081815260200183838082843760009201919091525050604080516060810190915260238082529092509050611442602083013985546001600160a01b03169190610a5c565b50604080518b81523360208201529081018a90527f4ec90e965519d92681267467f775ada5bd214aa92c0dc93d90a5e880ce9ed0269060600160405180910390a150505050505050505050565b7f2ad5dda4abad2eba9015076cc6a1db468a91b444067d58b590c8c73985521a046106f081610a6b565b4282116107325760405162461bcd60e51b815260206004820152601060248201526f115b99081d1a5b59481a5cc81c185cdd60821b6044820152606401610370565b6001600160a01b0388166107795760405162461bcd60e51b815260206004820152600e60248201526d1c995c5d5a5c99481d185c99d95d60921b6044820152606401610370565b6001600160a01b0386166107c15760405162461bcd60e51b815260206004820152600f60248201526e1c995c5d5a5c99481c9958d95a5c1d608a1b6044820152606401610370565b600084116107fd5760405162461bcd60e51b815260206004820152600960248201526807072696365203e20360bc1b6044820152606401610370565b600089815260016020526040902080546001600160a01b03161561085c5760405162461bcd60e51b8152602060048201526016602482015275446f206e6f74207265706561742053657474696e677360501b6044820152606401610370565b60028101979097555085546001600160a01b03199081166001600160a01b039889161787556001870180548216968916969096179095556004860180549095169390961692909217909255600583019190915560068201556007015550565b6000828152602081905260409020600101546108d681610a6b565b6108e08383610a78565b505050565b6001600160a01b03811633146109555760405162461bcd60e51b815260206004820152602f60248201527f416363657373436f6e74726f6c3a2063616e206f6e6c792072656e6f756e636560448201526e103937b632b9903337b91039b2b63360891b6064820152608401610370565b61095f8282610afc565b5050565b6000918252602082815260408084206001600160a01b0393909316845291905290205460ff1690565b6000828152602081905260409020600101546109a781610a6b565b6108e08383610afc565b6000828152600160208181526040808420600886901c855260038101909252832054909160ff85161b1615155b949350505050565b6000826109f38584610b61565b14949350505050565b604080516001600160a01b0385811660248301528416604482015260648082018490528251808303909101815260849091019091526020810180516001600160e01b03166323b872dd60e01b179052610a56908590610bae565b50505050565b60606109de8484600085610c80565b610a758133610d5b565b50565b610a828282610963565b61095f576000828152602081815260408083206001600160a01b03851684529091529020805460ff19166001179055610ab83390565b6001600160a01b0316816001600160a01b0316837f2f8788117e7eff1d82e926ec794901d17c78024a50270940304540a733656f0d60405160405180910390a45050565b610b068282610963565b1561095f576000828152602081815260408083206001600160a01b0385168085529252808320805460ff1916905551339285917ff6391f5c32d9c69d2a47ea670b442974b53935d1edc7fd64eb21e047a839171b9190a45050565b600081815b8451811015610ba657610b9282868381518110610b8557610b856112c8565b6020026020010151610db4565b915080610b9e816112de565b915050610b66565b509392505050565b6000610c03826040518060400160405280602081526020017f5361666545524332303a206c6f772d6c6576656c2063616c6c206661696c6564815250856001600160a01b0316610a5c9092919063ffffffff16565b8051909150156108e05780806020019051810190610c2191906112f7565b6108e05760405162461bcd60e51b815260206004820152602a60248201527f5361666545524332303a204552433230206f7065726174696f6e20646964206e6044820152691bdd081cdd58d8d9595960b21b6064820152608401610370565b606082471015610ce15760405162461bcd60e51b815260206004820152602660248201527f416464726573733a20696e73756666696369656e742062616c616e636520666f6044820152651c8818d85b1b60d21b6064820152608401610370565b600080866001600160a01b03168587604051610cfd919061133d565b60006040518083038185875af1925050503d8060008114610d3a576040519150601f19603f3d011682016040523d82523d6000602084013e610d3f565b606091505b5091509150610d5087838387610de6565b979650505050505050565b610d658282610963565b61095f57610d7281610e5f565b610d7d836020610e71565b604051602001610d8e929190611359565b60408051601f198184030181529082905262461bcd60e51b8252610370916004016113ce565b6000818310610dd0576000828152602084905260409020610ddf565b60008381526020839052604090205b9392505050565b60608315610e55578251600003610e4e576001600160a01b0385163b610e4e5760405162461bcd60e51b815260206004820152601d60248201527f416464726573733a2063616c6c20746f206e6f6e2d636f6e74726163740000006044820152606401610370565b50816109de565b6109de838361100d565b606061031b6001600160a01b03831660145b60606000610e8083600261129e565b610e8b906002611401565b67ffffffffffffffff811115610ea357610ea3611414565b6040519080825280601f01601f191660200182016040528015610ecd576020820181803683370190505b509050600360fc1b81600081518110610ee857610ee86112c8565b60200101906001600160f81b031916908160001a905350600f60fb1b81600181518110610f1757610f176112c8565b60200101906001600160f81b031916908160001a9053506000610f3b84600261129e565b610f46906001611401565b90505b6001811115610fbe576f181899199a1a9b1b9c1cb0b131b232b360811b85600f1660108110610f7a57610f7a6112c8565b1a60f81b828281518110610f9057610f906112c8565b60200101906001600160f81b031916908160001a90535060049490941c93610fb78161142a565b9050610f49565b508315610ddf5760405162461bcd60e51b815260206004820181905260248201527f537472696e67733a20686578206c656e67746820696e73756666696369656e746044820152606401610370565b81511561101d5781518083602001fd5b8060405162461bcd60e51b815260040161037091906113ce565b60006020828403121561104957600080fd5b81356001600160e01b031981168114610ddf57600080fd5b60008083601f84011261107357600080fd5b50813567ffffffffffffffff81111561108b57600080fd5b6020830191508360208260051b85010111156110a657600080fd5b9250929050565b600080600080600080600060a0888a0312156110c857600080fd5b873596506020880135955060408801359450606088013567ffffffffffffffff808211156110f557600080fd5b818a0191508a601f83011261110957600080fd5b81358181111561111857600080fd5b8b602082850101111561112a57600080fd5b6020830196508095505060808a013591508082111561114857600080fd5b506111558a828b01611061565b989b979a50959850939692959293505050565b60006020828403121561117a57600080fd5b5035919050565b6001600160a01b0381168114610a7557600080fd5b600080600080600080600080610100898b0312156111b357600080fd5b8835975060208901356111c581611181565b96506040890135955060608901356111dc81611181565b945060808901356111ec81611181565b979a969950949793969560a0850135955060c08501359460e001359350915050565b6000806040838503121561122157600080fd5b82359150602083013561123381611181565b809150509250929050565b6000806040838503121561125157600080fd5b50508035926020909101359150565b8581528460208201528360408201528183606083013760009101606001908152949350505050565b634e487b7160e01b600052601160045260246000fd5b808202811582820484141761031b5761031b611288565b8181038181111561031b5761031b611288565b634e487b7160e01b600052603260045260246000fd5b6000600182016112f0576112f0611288565b5060010190565b60006020828403121561130957600080fd5b81518015158114610ddf57600080fd5b60005b8381101561133457818101518382015260200161131c565b50506000910152565b6000825161134f818460208701611319565b9190910192915050565b7f416363657373436f6e74726f6c3a206163636f756e7420000000000000000000815260008351611391816017850160208801611319565b7001034b99036b4b9b9b4b733903937b6329607d1b60179184019182015283516113c2816028840160208801611319565b01602801949350505050565b60208152600082518060208401526113ed816040850160208701611319565b601f01601f19169190910160400192915050565b8082018082111561031b5761031b611288565b634e487b7160e01b600052604160045260246000fd5b60008161143957611439611288565b50600019019056fe4d65726b6c654469737472696275746f723a2043616c6c20414249206661696c65642ea2646970667358221220b565519862846a5f4c11518b82a47cac4860bb2d8fecf12892dfae90eb9866da64736f6c63430008120033

567:4044:13:-:0;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;728:62;;;;;;;;;;;;766:24;728:62;;;;;160:25:14;;;148:2;133:18;728:62:13;;;;;;;;2606:202:0;;;;;;;;;;-1:-1:-1;2606:202:0;;;;;:::i;:::-;;:::i;:::-;;;652:14:14;;645:22;627:41;;615:2;600:18;2606:202:0;487:187:14;2459:1520:13;;;;;;:::i;:::-;;:::i;:::-;;4378:129:0;;;;;;;;;;-1:-1:-1;4378:129:0;;;;;:::i;:::-;4452:7;4478:12;;;;;;;;;;:22;;;;4378:129;1590:841:13;;;;;;;;;;-1:-1:-1;1590:841:13;;;;;:::i;:::-;;:::i;4803:145:0:-;;;;;;;;;;-1:-1:-1;4803:145:0;;;;;:::i;:::-;;:::i;5912:214::-;;;;;;;;;;-1:-1:-1;5912:214:0;;;;;:::i;:::-;;:::i;2895:145::-;;;;;;;;;;-1:-1:-1;2895:145:0;;;;;:::i;:::-;;:::i;2027:49::-;;;;;;;;;;-1:-1:-1;2027:49:0;2072:4;2027:49;;5228:147;;;;;;;;;;-1:-1:-1;5228:147:0;;;;;:::i;:::-;;:::i;4035:317:13:-;;;;;;;;;;-1:-1:-1;4035:317:13;;;;;:::i;:::-;4095:7;4193:14;;;:5;:14;;;;;;;;4225;;4241:15;;;;4258:18;;;;4278:15;;;;4295:13;;;;4310:17;;;;4329:15;;;;;-1:-1:-1;;;;;4225:14:13;;;;4241:15;;;;4258:18;;4278:15;;;;;4295:13;;4310:17;4329:15;4035:317;;;;;-1:-1:-1;;;;;4252:15:14;;;4234:34;;4304:15;;;4299:2;4284:18;;4277:43;4336:18;;4329:34;;;;4399:15;;;;4394:2;4379:18;;4372:43;4446:3;4431:19;;4424:35;4214:3;4475:19;;4468:35;;;;4534:3;4519:19;;4512:35;;;;4183:3;4168:19;4035:317:13;3881:672:14;4430:179:13;;;;;;;;;;-1:-1:-1;4430:179:13;;;;;:::i;:::-;;:::i;2606:202:0:-;2691:4;-1:-1:-1;;;;;;2714:47:0;;-1:-1:-1;;;2714:47:0;;:87;;-1:-1:-1;;;;;;;;;;937:40:9;;;2765:36:0;2707:94;2606:202;-1:-1:-1;;2606:202:0:o;2459:1520:13:-;2613:23;2639:14;;;:5;:14;;;;;2703:17;;;;2724:15;-1:-1:-1;2703:36:13;2695:63;;;;-1:-1:-1;;;2695:63:13;;5013:2:14;2695:63:13;;;4995:21:14;5052:2;5032:18;;;5025:30;-1:-1:-1;;;5071:18:14;;;5064:44;5125:18;;2695:63:13;;;;;;;;;2795:15;2776:7;:15;;;:34;;2768:56;;;;-1:-1:-1;;;2768:56:13;;5356:2:14;2768:56:13;;;5338:21:14;5395:1;5375:18;;;5368:29;-1:-1:-1;;;5413:18:14;;;5406:39;5462:18;;2768:56:13;5154:332:14;2768:56:13;684:1:12;675:10;;;642:4;746:20;;;2863:14:13;;;746:20:12;;;;;;710:1;724:4;716:12;;710:19;746:27;:32;2859:54:13;;2897:16;;-1:-1:-1;;;2897:16:13;;;;;;;;;;;2859:54;2960:12;3002:7;3011:5;3018:3;3023:11;;2985:50;;;;;;;;;;;;:::i;:::-;;;;;;;;;;;;;2975:61;;;;;;2960:76;;3051:57;3070:11;;3051:57;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;-1:-1:-1;;;;3083:18:13;;;;3103:4;3051:18;:57::i;:::-;3046:85;;3117:14;;-1:-1:-1;;;3117:14:13;;;;;;;;;;;3046:85;1247:1:12;1238:10;;;1221:14;1302:20;;;3177:14:13;;;1302:20:12;;;;;:28;;1273:1;1287:4;1279:12;;1273:19;1302:28;;;3270:13:13;;;;:19;;3286:3;;3270:19;:::i;:::-;3303:15;;;;3254:35;;-1:-1:-1;;;;;;3303:15:13;3299:450;;3370:5;3357:9;:18;;3349:58;;;;-1:-1:-1;;;3349:58:13;;6478:2:14;3349:58:13;;;6460:21:14;6517:2;6497:18;;;6490:30;6556:29;6536:18;;;6529:57;6603:18;;3349:58:13;6276:351:14;3349:58:13;3421:14;3438:17;3450:5;3438:9;:17;:::i;:::-;3421:34;-1:-1:-1;3472:10:13;;3469:51;;3484:36;;3492:10;;3484:36;;;;;3513:6;;3484:36;;;;3513:6;3492:10;3484:36;;;;;;;;;;;;;;;;;;;;;3469:51;3534:15;;;;:31;;-1:-1:-1;;;;;3534:15:13;;;;:31;;;;;3559:5;;3534:15;:31;:15;:31;3559:5;3534:15;:31;;;;;;;;;;;;;;;;;;;;;3335:241;3299:450;;;3604:9;:14;3596:52;;;;-1:-1:-1;;;3596:52:13;;6967:2:14;3596:52:13;;;6949:21:14;7006:2;6986:18;;;6979:30;7045:27;7025:18;;;7018:55;7090:18;;3596:52:13;6765:349:14;3596:52:13;3715:15;;;;3669;;;;3662:76;;-1:-1:-1;;;;;3669:15:13;;;;3703:10;;3715:15;3732:5;3662:40;:76::i;:::-;3843:79;3871:11;;3843:79;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;-1:-1:-1;;3843:79:13;;;;;;;;;;;;;;;-1:-1:-1;3843:79:13;-1:-1:-1;3843:79:13;;;;;:14;;-1:-1:-1;;;;;3843:14:13;;:79;:27;:79::i;:::-;-1:-1:-1;3937:35:13;;;7321:25:14;;;3954:10:13;7377:2:14;7362:18;;7355:60;7431:18;;;7424:34;;;3937:35:13;;7309:2:14;7294:18;3937:35:13;;;;;;;2594:1385;;;2459:1520;;;;;;;:::o;1590:841::-;766:24;2505:16:0;2516:4;2505:10;:16::i;:::-;1831:15:13::1;1820:8;:26;1812:55;;;::::0;-1:-1:-1;;;1812:55:13;;7671:2:14;1812:55:13::1;::::0;::::1;7653:21:14::0;7710:2;7690:18;;;7683:30;-1:-1:-1;;;7729:18:14;;;7722:46;7785:18;;1812:55:13::1;7469:340:14::0;1812:55:13::1;-1:-1:-1::0;;;;;1886:21:13;::::1;1877:50;;;::::0;-1:-1:-1;;;1877:50:13;;8016:2:14;1877:50:13::1;::::0;::::1;7998:21:14::0;8055:2;8035:18;;;8028:30;-1:-1:-1;;;8074:18:14;;;8067:44;8128:18;;1877:50:13::1;7814:338:14::0;1877:50:13::1;-1:-1:-1::0;;;;;1946:22:13;::::1;1937:51;;;::::0;-1:-1:-1;;;1937:51:13;;8359:2:14;1937:51:13::1;::::0;::::1;8341:21:14::0;8398:2;8378:18;;;8371:30;-1:-1:-1;;;8417:18:14;;;8410:45;8472:18;;1937:51:13::1;8157:339:14::0;1937:51:13::1;2016:1;2007:6;:10;1998:34;;;::::0;-1:-1:-1;;;1998:34:13;;8703:2:14;1998:34:13::1;::::0;::::1;8685:21:14::0;8742:1;8722:18;;;8715:29;-1:-1:-1;;;8760:18:14;;;8753:39;8809:18;;1998:34:13::1;8501:332:14::0;1998:34:13::1;2043:23;2069:15:::0;;;:5:::1;:15;::::0;;;;2111:14;;-1:-1:-1;;;;;2111:14:13::1;:28:::0;2103:64:::1;;;::::0;-1:-1:-1;;;2103:64:13;;9040:2:14;2103:64:13::1;::::0;::::1;9022:21:14::0;9079:2;9059:18;;;9052:30;-1:-1:-1;;;9098:18:14;;;9091:52;9160:18;;2103:64:13::1;8838:346:14::0;2103:64:13::1;2178:18;::::0;::::1;:32:::0;;;;-1:-1:-1;2220:24:13;;-1:-1:-1;;;;;;2220:24:13;;::::1;-1:-1:-1::0;;;;;2220:24:13;;::::1;;::::0;;-1:-1:-1;2254:15:13;::::1;:26:::0;;;::::1;::::0;;::::1;::::0;;;::::1;::::0;;;2290:15:::1;::::0;::::1;:26:::0;;;;::::1;::::0;;;::::1;::::0;;;::::1;::::0;;;2326:13:::1;::::0;::::1;:22:::0;;;;2358:17:::1;::::0;::::1;:30:::0;2398:15:::1;;:26:::0;-1:-1:-1;1590:841:13:o;4803:145:0:-;4452:7;4478:12;;;;;;;;;;:22;;;2505:16;2516:4;2505:10;:16::i;:::-;4916:25:::1;4927:4;4933:7;4916:10;:25::i;:::-;4803:145:::0;;;:::o;5912:214::-;-1:-1:-1;;;;;6007:23:0;;719:10:6;6007:23:0;5999:83;;;;-1:-1:-1;;;5999:83:0;;9391:2:14;5999:83:0;;;9373:21:14;9430:2;9410:18;;;9403:30;9469:34;9449:18;;;9442:62;-1:-1:-1;;;9520:18:14;;;9513:45;9575:19;;5999:83:0;9189:411:14;5999:83:0;6093:26;6105:4;6111:7;6093:11;:26::i;:::-;5912:214;;:::o;2895:145::-;2981:4;3004:12;;;;;;;;;;;-1:-1:-1;;;;;3004:29:0;;;;;;;;;;;;;;;2895:145::o;5228:147::-;4452:7;4478:12;;;;;;;;;;:22;;;2505:16;2516:4;2505:10;:16::i;:::-;5342:26:::1;5354:4;5360:7;5342:11;:26::i;4430:179:13:-:0;4504:4;4546:14;;;:5;:14;;;;;;;;684:1:12;675:10;;;746:20;;4577:14:13;;;746:20:12;;;;;;4546:14:13;;724:4:12;716:12;;710:19;746:27;:32;;4577:25:13;4570:32;4430:179;-1:-1:-1;;;;4430:179:13:o;1156:184:8:-;1277:4;1329;1300:25;1313:5;1320:4;1300:12;:25::i;:::-;:33;;1156:184;-1:-1:-1;;;;1156:184:8:o;974:241:4:-;1139:68;;;-1:-1:-1;;;;;9863:15:14;;;1139:68:4;;;9845:34:14;9915:15;;9895:18;;;9888:43;9947:18;;;;9940:34;;;1139:68:4;;;;;;;;;;9780:18:14;;;;1139:68:4;;;;;;;;-1:-1:-1;;;;;1139:68:4;-1:-1:-1;;;1139:68:4;;;1112:96;;1132:5;;1112:19;:96::i;:::-;974:241;;;;:::o;3873:223:5:-;4006:12;4037:52;4059:6;4067:4;4073:1;4076:12;4037:21;:52::i;3334:103:0:-;3400:30;3411:4;719:10:6;3400::0;:30::i;:::-;3334:103;:::o;7461:233::-;7544:22;7552:4;7558:7;7544;:22::i;:::-;7539:149;;7582:6;:12;;;;;;;;;;;-1:-1:-1;;;;;7582:29:0;;;;;;;;;:36;;-1:-1:-1;;7582:36:0;7614:4;7582:36;;;7664:12;719:10:6;;640:96;7664:12:0;-1:-1:-1;;;;;7637:40:0;7655:7;-1:-1:-1;;;;;7637:40:0;7649:4;7637:40;;;;;;;;;;7461:233;;:::o;7865:234::-;7948:22;7956:4;7962:7;7948;:22::i;:::-;7944:149;;;8018:5;7986:12;;;;;;;;;;;-1:-1:-1;;;;;7986:29:0;;;;;;;;;;:37;;-1:-1:-1;;7986:37:0;;;8042:40;719:10:6;;7986:12:0;;8042:40;;8018:5;8042:40;7865:234;;:::o;1994:290:8:-;2077:7;2119:4;2077:7;2133:116;2157:5;:12;2153:1;:16;2133:116;;;2205:33;2215:12;2229:5;2235:1;2229:8;;;;;;;;:::i;:::-;;;;;;;2205:9;:33::i;:::-;2190:48;-1:-1:-1;2171:3:8;;;;:::i;:::-;;;;2133:116;;;-1:-1:-1;2265:12:8;1994:290;-1:-1:-1;;;1994:290:8:o;3747:706:4:-;4166:23;4192:69;4220:4;4192:69;;;;;;;;;;;;;;;;;4200:5;-1:-1:-1;;;;;4192:27:4;;;:69;;;;;:::i;:::-;4275:17;;4166:95;;-1:-1:-1;4275:21:4;4271:176;;4370:10;4359:30;;;;;;;;;;;;:::i;:::-;4351:85;;;;-1:-1:-1;;;4351:85:4;;10741:2:14;4351:85:4;;;10723:21:14;10780:2;10760:18;;;10753:30;10819:34;10799:18;;;10792:62;-1:-1:-1;;;10870:18:14;;;10863:40;10920:19;;4351:85:4;10539:406:14;4960:446:5;5125:12;5182:5;5157:21;:30;;5149:81;;;;-1:-1:-1;;;5149:81:5;;11152:2:14;5149:81:5;;;11134:21:14;11191:2;11171:18;;;11164:30;11230:34;11210:18;;;11203:62;-1:-1:-1;;;11281:18:14;;;11274:36;11327:19;;5149:81:5;10950:402:14;5149:81:5;5241:12;5255:23;5282:6;-1:-1:-1;;;;;5282:11:5;5301:5;5308:4;5282:31;;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;5240:73;;;;5330:69;5357:6;5365:7;5374:10;5386:12;5330:26;:69::i;:::-;5323:76;4960:446;-1:-1:-1;;;;;;;4960:446:5:o;3718:479:0:-;3806:22;3814:4;3820:7;3806;:22::i;:::-;3801:390;;3989:28;4009:7;3989:19;:28::i;:::-;4088:38;4116:4;4123:2;4088:19;:38::i;:::-;3896:252;;;;;;;;;:::i;:::-;;;;-1:-1:-1;;3896:252:0;;;;;;;;;;-1:-1:-1;;;3844:336:0;;;;;;;:::i;8879:147:8:-;8942:7;8972:1;8968;:5;:51;;9100:13;9191:15;;;9226:4;9219:15;;;9272:4;9256:21;;8968:51;;;9100:13;9191:15;;;9226:4;9219:15;;;9272:4;9256:21;;8976:20;8961:58;8879:147;-1:-1:-1;;;8879:147:8:o;7466:628:5:-;7646:12;7674:7;7670:418;;;7701:10;:17;7722:1;7701:22;7697:286;;-1:-1:-1;;;;;1465:19:5;;;7908:60;;;;-1:-1:-1;;;7908:60:5;;13324:2:14;7908:60:5;;;13306:21:14;13363:2;13343:18;;;13336:30;13402:31;13382:18;;;13375:59;13451:18;;7908:60:5;13122:353:14;7908:60:5;-1:-1:-1;8003:10:5;7996:17;;7670:418;8044:33;8052:10;8064:12;8044:7;:33::i;2102:149:7:-;2160:13;2192:52;-1:-1:-1;;;;;2204:22:7;;311:2;1513:437;1588:13;1613:19;1645:10;1649:6;1645:1;:10;:::i;:::-;:14;;1658:1;1645:14;:::i;:::-;1635:25;;;;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;-1:-1:-1;1635:25:7;;1613:47;;-1:-1:-1;;;1670:6:7;1677:1;1670:9;;;;;;;;:::i;:::-;;;;:15;-1:-1:-1;;;;;1670:15:7;;;;;;;;;-1:-1:-1;;;1695:6:7;1702:1;1695:9;;;;;;;;:::i;:::-;;;;:15;-1:-1:-1;;;;;1695:15:7;;;;;;;;-1:-1:-1;1725:9:7;1737:10;1741:6;1737:1;:10;:::i;:::-;:14;;1750:1;1737:14;:::i;:::-;1725:26;;1720:128;1757:1;1753;:5;1720:128;;;-1:-1:-1;;;1800:5:7;1808:3;1800:11;1791:21;;;;;;;:::i;:::-;;;;1779:6;1786:1;1779:9;;;;;;;;:::i;:::-;;;;:33;-1:-1:-1;;;;;1779:33:7;;;;;;;;-1:-1:-1;1836:1:7;1826:11;;;;;1760:3;;;:::i;:::-;;;1720:128;;;-1:-1:-1;1865:10:7;;1857:55;;;;-1:-1:-1;;;1857:55:7;;14085:2:14;1857:55:7;;;14067:21:14;;;14104:18;;;14097:30;14163:34;14143:18;;;14136:62;14215:18;;1857:55:7;13883:356:14;8616:540:5;8775:17;;:21;8771:379;;9003:10;8997:17;9059:15;9046:10;9042:2;9038:19;9031:44;8771:379;9126:12;9119:20;;-1:-1:-1;;;9119:20:5;;;;;;;;:::i;196:286:14:-;254:6;307:2;295:9;286:7;282:23;278:32;275:52;;;323:1;320;313:12;275:52;349:23;;-1:-1:-1;;;;;;401:32:14;;391:43;;381:71;;448:1;445;438:12;679:367;742:8;752:6;806:3;799:4;791:6;787:17;783:27;773:55;;824:1;821;814:12;773:55;-1:-1:-1;847:20:14;;890:18;879:30;;876:50;;;922:1;919;912:12;876:50;959:4;951:6;947:17;935:29;;1019:3;1012:4;1002:6;999:1;995:14;987:6;983:27;979:38;976:47;973:67;;;1036:1;1033;1026:12;973:67;679:367;;;;;:::o;1051:1112::-;1184:6;1192;1200;1208;1216;1224;1232;1285:3;1273:9;1264:7;1260:23;1256:33;1253:53;;;1302:1;1299;1292:12;1253:53;1338:9;1325:23;1315:33;;1395:2;1384:9;1380:18;1367:32;1357:42;;1446:2;1435:9;1431:18;1418:32;1408:42;;1501:2;1490:9;1486:18;1473:32;1524:18;1565:2;1557:6;1554:14;1551:34;;;1581:1;1578;1571:12;1551:34;1619:6;1608:9;1604:22;1594:32;;1664:7;1657:4;1653:2;1649:13;1645:27;1635:55;;1686:1;1683;1676:12;1635:55;1726:2;1713:16;1752:2;1744:6;1741:14;1738:34;;;1768:1;1765;1758:12;1738:34;1813:7;1808:2;1799:6;1795:2;1791:15;1787:24;1784:37;1781:57;;;1834:1;1831;1824:12;1781:57;1865:2;1861;1857:11;1847:21;;1887:6;1877:16;;;1946:3;1935:9;1931:19;1918:33;1902:49;;1976:2;1966:8;1963:16;1960:36;;;1992:1;1989;1982:12;1960:36;;2031:72;2095:7;2084:8;2073:9;2069:24;2031:72;:::i;:::-;1051:1112;;;;-1:-1:-1;1051:1112:14;;-1:-1:-1;1051:1112:14;;;;2005:98;;-1:-1:-1;;;1051:1112:14:o;2168:180::-;2227:6;2280:2;2268:9;2259:7;2255:23;2251:32;2248:52;;;2296:1;2293;2286:12;2248:52;-1:-1:-1;2319:23:14;;2168:180;-1:-1:-1;2168:180:14:o;2353:131::-;-1:-1:-1;;;;;2428:31:14;;2418:42;;2408:70;;2474:1;2471;2464:12;2489:882;2619:6;2627;2635;2643;2651;2659;2667;2675;2728:3;2716:9;2707:7;2703:23;2699:33;2696:53;;;2745:1;2742;2735:12;2696:53;2781:9;2768:23;2758:33;;2841:2;2830:9;2826:18;2813:32;2854:31;2879:5;2854:31;:::i;:::-;2904:5;-1:-1:-1;2956:2:14;2941:18;;2928:32;;-1:-1:-1;3012:2:14;2997:18;;2984:32;3025:33;2984:32;3025:33;:::i;:::-;3077:7;-1:-1:-1;3136:3:14;3121:19;;3108:33;3150;3108;3150;:::i;:::-;2489:882;;;;-1:-1:-1;2489:882:14;;;;3202:7;3256:3;3241:19;;3228:33;;-1:-1:-1;3308:3:14;3293:19;;3280:33;;3360:3;3345:19;3332:33;;-1:-1:-1;2489:882:14;-1:-1:-1;;2489:882:14:o;3376:315::-;3444:6;3452;3505:2;3493:9;3484:7;3480:23;3476:32;3473:52;;;3521:1;3518;3511:12;3473:52;3557:9;3544:23;3534:33;;3617:2;3606:9;3602:18;3589:32;3630:31;3655:5;3630:31;:::i;:::-;3680:5;3670:15;;;3376:315;;;;;:::o;4558:248::-;4626:6;4634;4687:2;4675:9;4666:7;4662:23;4658:32;4655:52;;;4703:1;4700;4693:12;4655:52;-1:-1:-1;;4726:23:14;;;4796:2;4781:18;;;4768:32;;-1:-1:-1;4558:248:14:o;5491:475::-;5744:6;5739:3;5732:19;5781:6;5776:2;5771:3;5767:12;5760:28;5818:6;5813:2;5808:3;5804:12;5797:28;5869:6;5861;5856:2;5851:3;5847:12;5834:42;5714:3;5899:16;;5917:2;5895:25;5929:13;;;5895:25;5491:475;-1:-1:-1;;;;5491:475:14:o;5971:127::-;6032:10;6027:3;6023:20;6020:1;6013:31;6063:4;6060:1;6053:15;6087:4;6084:1;6077:15;6103:168;6176:9;;;6207;;6224:15;;;6218:22;;6204:37;6194:71;;6245:18;;:::i;6632:128::-;6699:9;;;6720:11;;;6717:37;;;6734:18;;:::i;9985:127::-;10046:10;10041:3;10037:20;10034:1;10027:31;10077:4;10074:1;10067:15;10101:4;10098:1;10091:15;10117:135;10156:3;10177:17;;;10174:43;;10197:18;;:::i;:::-;-1:-1:-1;10244:1:14;10233:13;;10117:135::o;10257:277::-;10324:6;10377:2;10365:9;10356:7;10352:23;10348:32;10345:52;;;10393:1;10390;10383:12;10345:52;10425:9;10419:16;10478:5;10471:13;10464:21;10457:5;10454:32;10444:60;;10500:1;10497;10490:12;11357:250;11442:1;11452:113;11466:6;11463:1;11460:13;11452:113;;;11542:11;;;11536:18;11523:11;;;11516:39;11488:2;11481:10;11452:113;;;-1:-1:-1;;11599:1:14;11581:16;;11574:27;11357:250::o;11612:287::-;11741:3;11779:6;11773:13;11795:66;11854:6;11849:3;11842:4;11834:6;11830:17;11795:66;:::i;:::-;11877:16;;;;;11612:287;-1:-1:-1;;11612:287:14:o;11904:812::-;12315:25;12310:3;12303:38;12285:3;12370:6;12364:13;12386:75;12454:6;12449:2;12444:3;12440:12;12433:4;12425:6;12421:17;12386:75;:::i;:::-;-1:-1:-1;;;12520:2:14;12480:16;;;12512:11;;;12505:40;12570:13;;12592:76;12570:13;12654:2;12646:11;;12639:4;12627:17;;12592:76;:::i;:::-;12688:17;12707:2;12684:26;;11904:812;-1:-1:-1;;;;11904:812:14:o;12721:396::-;12870:2;12859:9;12852:21;12833:4;12902:6;12896:13;12945:6;12940:2;12929:9;12925:18;12918:34;12961:79;13033:6;13028:2;13017:9;13013:18;13008:2;13000:6;12996:15;12961:79;:::i;:::-;13101:2;13080:15;-1:-1:-1;;13076:29:14;13061:45;;;;13108:2;13057:54;;12721:396;-1:-1:-1;;12721:396:14:o;13480:125::-;13545:9;;;13566:10;;;13563:36;;;13579:18;;:::i;13610:127::-;13671:10;13666:3;13662:20;13659:1;13652:31;13702:4;13699:1;13692:15;13726:4;13723:1;13716:15;13742:136;13781:3;13809:5;13799:39;;13818:18;;:::i;:::-;-1:-1:-1;;;13854:18:14;;13742:136::o

ipfs://b565519862846a5f4c11518b82a47cac4860bb2d8fecf12892dfae90eb9866da