Contract Source Code (Solidity)

IDE

• Blockscan IDE
• 🤖 Code ReaderBeta
• Remix IDE

More Options

• Similar
• Sol2Uml
• Submit Audit
• Compare

/**
 *Submitted for verification at Etherscan.io on 2025-05-04
*/

// SPDX-License-Identifier: MIT

// File: @openzeppelin/contracts/utils/Context.sol


// OpenZeppelin Contracts (last updated v5.0.1) (utils/Context.sol)

pragma solidity ^0.8.20;

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

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

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

// File: @openzeppelin/contracts/access/Ownable.sol


// OpenZeppelin Contracts (last updated v5.0.0) (access/Ownable.sol)

pragma solidity ^0.8.20;


/**
 * @dev Contract module which provides a basic access control mechanism, where
 * there is an account (an owner) that can be granted exclusive access to
 * specific functions.
 *
 * The initial owner is set to the address provided by the deployer. This can
 * later be changed with {transferOwnership}.
 *
 * This module is used through inheritance. It will make available the modifier
 * `onlyOwner`, which can be applied to your functions to restrict their use to
 * the owner.
 */
abstract contract Ownable is Context {
    address private _owner;

    /**
     * @dev The caller account is not authorized to perform an operation.
     */
    error OwnableUnauthorizedAccount(address account);

    /**
     * @dev The owner is not a valid owner account. (eg. `address(0)`)
     */
    error OwnableInvalidOwner(address owner);

    event OwnershipTransferred(address indexed previousOwner, address indexed newOwner);

    /**
     * @dev Initializes the contract setting the address provided by the deployer as the initial owner.
     */
    constructor(address initialOwner) {
        if (initialOwner == address(0)) {
            revert OwnableInvalidOwner(address(0));
        }
        _transferOwnership(initialOwner);
    }

    /**
     * @dev Throws if called by any account other than the owner.
     */
    modifier onlyOwner() {
        _checkOwner();
        _;
    }

    /**
     * @dev Returns the address of the current owner.
     */
    function owner() public view virtual returns (address) {
        return _owner;
    }

    /**
     * @dev Throws if the sender is not the owner.
     */
    function _checkOwner() internal view virtual {
        if (owner() != _msgSender()) {
            revert OwnableUnauthorizedAccount(_msgSender());
        }
    }

    /**
     * @dev Leaves the contract without owner. It will not be possible to call
     * `onlyOwner` functions. Can only be called by the current owner.
     *
     * NOTE: Renouncing ownership will leave the contract without an owner,
     * thereby disabling any functionality that is only available to the owner.
     */
    function renounceOwnership() public virtual onlyOwner {
        _transferOwnership(address(0));
    }

    /**
     * @dev Transfers ownership of the contract to a new account (`newOwner`).
     * Can only be called by the current owner.
     */
    function transferOwnership(address newOwner) public virtual onlyOwner {
        if (newOwner == address(0)) {
            revert OwnableInvalidOwner(address(0));
        }
        _transferOwnership(newOwner);
    }

    /**
     * @dev Transfers ownership of the contract to a new account (`newOwner`).
     * Internal function without access restriction.
     */
    function _transferOwnership(address newOwner) internal virtual {
        address oldOwner = _owner;
        _owner = newOwner;
        emit OwnershipTransferred(oldOwner, newOwner);
    }
}

// File: @openzeppelin/contracts/access/Ownable2Step.sol


// OpenZeppelin Contracts (last updated v5.1.0) (access/Ownable2Step.sol)

pragma solidity ^0.8.20;


/**
 * @dev Contract module which provides access control mechanism, where
 * there is an account (an owner) that can be granted exclusive access to
 * specific functions.
 *
 * This extension of the {Ownable} contract includes a two-step mechanism to transfer
 * ownership, where the new owner must call {acceptOwnership} in order to replace the
 * old one. This can help prevent common mistakes, such as transfers of ownership to
 * incorrect accounts, or to contracts that are unable to interact with the
 * permission system.
 *
 * The initial owner is specified at deployment time in the constructor for `Ownable`. This
 * can later be changed with {transferOwnership} and {acceptOwnership}.
 *
 * This module is used through inheritance. It will make available all functions
 * from parent (Ownable).
 */
abstract contract Ownable2Step is Ownable {
    address private _pendingOwner;

    event OwnershipTransferStarted(address indexed previousOwner, address indexed newOwner);

    /**
     * @dev Returns the address of the pending owner.
     */
    function pendingOwner() public view virtual returns (address) {
        return _pendingOwner;
    }

    /**
     * @dev Starts the ownership transfer of the contract to a new account. Replaces the pending transfer if there is one.
     * Can only be called by the current owner.
     *
     * Setting `newOwner` to the zero address is allowed; this can be used to cancel an initiated ownership transfer.
     */
    function transferOwnership(address newOwner) public virtual override onlyOwner {
        _pendingOwner = newOwner;
        emit OwnershipTransferStarted(owner(), newOwner);
    }

    /**
     * @dev Transfers ownership of the contract to a new account (`newOwner`) and deletes any pending owner.
     * Internal function without access restriction.
     */
    function _transferOwnership(address newOwner) internal virtual override {
        delete _pendingOwner;
        super._transferOwnership(newOwner);
    }

    /**
     * @dev The new owner accepts the ownership transfer.
     */
    function acceptOwnership() public virtual {
        address sender = _msgSender();
        if (pendingOwner() != sender) {
            revert OwnableUnauthorizedAccount(sender);
        }
        _transferOwnership(sender);
    }
}

// File: @openzeppelin/contracts/security/ReentrancyGuard.sol


// OpenZeppelin Contracts (last updated v4.9.0) (security/ReentrancyGuard.sol)

pragma solidity ^0.8.0;

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

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

    uint256 private _status;

    constructor() {
        _status = _NOT_ENTERED;
    }

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

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

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

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

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

// File: @openzeppelin/contracts/token/ERC20/IERC20.sol


// OpenZeppelin Contracts (last updated v5.1.0) (token/ERC20/IERC20.sol)

pragma solidity ^0.8.20;

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

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

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

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

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

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

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

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

// File: @openzeppelin/contracts/interfaces/IERC20.sol


// OpenZeppelin Contracts (last updated v5.0.0) (interfaces/IERC20.sol)

pragma solidity ^0.8.20;


// File: @openzeppelin/contracts/utils/introspection/IERC165.sol


// OpenZeppelin Contracts (last updated v5.1.0) (utils/introspection/IERC165.sol)

pragma solidity ^0.8.20;

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

// File: @openzeppelin/contracts/interfaces/IERC165.sol


// OpenZeppelin Contracts (last updated v5.0.0) (interfaces/IERC165.sol)

pragma solidity ^0.8.20;


// File: @openzeppelin/contracts/interfaces/IERC1363.sol


// OpenZeppelin Contracts (last updated v5.1.0) (interfaces/IERC1363.sol)

pragma solidity ^0.8.20;



/**
 * @title IERC1363
 * @dev Interface of the ERC-1363 standard as defined in the https://eips.ethereum.org/EIPS/eip-1363[ERC-1363].
 *
 * Defines an extension interface for ERC-20 tokens that supports executing code on a recipient contract
 * after `transfer` or `transferFrom`, or code on a spender contract after `approve`, in a single transaction.
 */
interface IERC1363 is IERC20, IERC165 {
    /*
     * Note: the ERC-165 identifier for this interface is 0xb0202a11.
     * 0xb0202a11 ===
     *   bytes4(keccak256('transferAndCall(address,uint256)')) ^
     *   bytes4(keccak256('transferAndCall(address,uint256,bytes)')) ^
     *   bytes4(keccak256('transferFromAndCall(address,address,uint256)')) ^
     *   bytes4(keccak256('transferFromAndCall(address,address,uint256,bytes)')) ^
     *   bytes4(keccak256('approveAndCall(address,uint256)')) ^
     *   bytes4(keccak256('approveAndCall(address,uint256,bytes)'))
     */

    /**
     * @dev Moves a `value` amount of tokens from the caller's account to `to`
     * and then calls {IERC1363Receiver-onTransferReceived} on `to`.
     * @param to The address which you want to transfer to.
     * @param value The amount of tokens to be transferred.
     * @return A boolean value indicating whether the operation succeeded unless throwing.
     */
    function transferAndCall(address to, uint256 value) external returns (bool);

    /**
     * @dev Moves a `value` amount of tokens from the caller's account to `to`
     * and then calls {IERC1363Receiver-onTransferReceived} on `to`.
     * @param to The address which you want to transfer to.
     * @param value The amount of tokens to be transferred.
     * @param data Additional data with no specified format, sent in call to `to`.
     * @return A boolean value indicating whether the operation succeeded unless throwing.
     */
    function transferAndCall(address to, uint256 value, bytes calldata data) external returns (bool);

    /**
     * @dev Moves a `value` amount of tokens from `from` to `to` using the allowance mechanism
     * and then calls {IERC1363Receiver-onTransferReceived} on `to`.
     * @param from The address which you want to send tokens from.
     * @param to The address which you want to transfer to.
     * @param value The amount of tokens to be transferred.
     * @return A boolean value indicating whether the operation succeeded unless throwing.
     */
    function transferFromAndCall(address from, address to, uint256 value) external returns (bool);

    /**
     * @dev Moves a `value` amount of tokens from `from` to `to` using the allowance mechanism
     * and then calls {IERC1363Receiver-onTransferReceived} on `to`.
     * @param from The address which you want to send tokens from.
     * @param to The address which you want to transfer to.
     * @param value The amount of tokens to be transferred.
     * @param data Additional data with no specified format, sent in call to `to`.
     * @return A boolean value indicating whether the operation succeeded unless throwing.
     */
    function transferFromAndCall(address from, address to, uint256 value, bytes calldata data) external returns (bool);

    /**
     * @dev Sets a `value` amount of tokens as the allowance of `spender` over the
     * caller's tokens and then calls {IERC1363Spender-onApprovalReceived} on `spender`.
     * @param spender The address which will spend the funds.
     * @param value The amount of tokens to be spent.
     * @return A boolean value indicating whether the operation succeeded unless throwing.
     */
    function approveAndCall(address spender, uint256 value) external returns (bool);

    /**
     * @dev Sets a `value` amount of tokens as the allowance of `spender` over the
     * caller's tokens and then calls {IERC1363Spender-onApprovalReceived} on `spender`.
     * @param spender The address which will spend the funds.
     * @param value The amount of tokens to be spent.
     * @param data Additional data with no specified format, sent in call to `spender`.
     * @return A boolean value indicating whether the operation succeeded unless throwing.
     */
    function approveAndCall(address spender, uint256 value, bytes calldata data) external returns (bool);
}

// File: @openzeppelin/contracts/token/ERC20/utils/SafeERC20.sol


// OpenZeppelin Contracts (last updated v5.3.0) (token/ERC20/utils/SafeERC20.sol)

pragma solidity ^0.8.20;



/**
 * @title SafeERC20
 * @dev Wrappers around ERC-20 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 {
    /**
     * @dev An operation with an ERC-20 token failed.
     */
    error SafeERC20FailedOperation(address token);

    /**
     * @dev Indicates a failed `decreaseAllowance` request.
     */
    error SafeERC20FailedDecreaseAllowance(address spender, uint256 currentAllowance, uint256 requestedDecrease);

    /**
     * @dev Transfer `value` amount of `token` from the calling contract to `to`. If `token` returns no value,
     * non-reverting calls are assumed to be successful.
     */
    function safeTransfer(IERC20 token, address to, uint256 value) internal {
        _callOptionalReturn(token, abi.encodeCall(token.transfer, (to, value)));
    }

    /**
     * @dev Transfer `value` amount of `token` from `from` to `to`, spending the approval given by `from` to the
     * calling contract. If `token` returns no value, non-reverting calls are assumed to be successful.
     */
    function safeTransferFrom(IERC20 token, address from, address to, uint256 value) internal {
        _callOptionalReturn(token, abi.encodeCall(token.transferFrom, (from, to, value)));
    }

    /**
     * @dev Variant of {safeTransfer} that returns a bool instead of reverting if the operation is not successful.
     */
    function trySafeTransfer(IERC20 token, address to, uint256 value) internal returns (bool) {
        return _callOptionalReturnBool(token, abi.encodeCall(token.transfer, (to, value)));
    }

    /**
     * @dev Variant of {safeTransferFrom} that returns a bool instead of reverting if the operation is not successful.
     */
    function trySafeTransferFrom(IERC20 token, address from, address to, uint256 value) internal returns (bool) {
        return _callOptionalReturnBool(token, abi.encodeCall(token.transferFrom, (from, to, value)));
    }

    /**
     * @dev Increase the calling contract's allowance toward `spender` by `value`. If `token` returns no value,
     * non-reverting calls are assumed to be successful.
     *
     * IMPORTANT: If the token implements ERC-7674 (ERC-20 with temporary allowance), and if the "client"
     * smart contract uses ERC-7674 to set temporary allowances, then the "client" smart contract should avoid using
     * this function. Performing a {safeIncreaseAllowance} or {safeDecreaseAllowance} operation on a token contract
     * that has a non-zero temporary allowance (for that particular owner-spender) will result in unexpected behavior.
     */
    function safeIncreaseAllowance(IERC20 token, address spender, uint256 value) internal {
        uint256 oldAllowance = token.allowance(address(this), spender);
        forceApprove(token, spender, oldAllowance + value);
    }

    /**
     * @dev Decrease the calling contract's allowance toward `spender` by `requestedDecrease`. If `token` returns no
     * value, non-reverting calls are assumed to be successful.
     *
     * IMPORTANT: If the token implements ERC-7674 (ERC-20 with temporary allowance), and if the "client"
     * smart contract uses ERC-7674 to set temporary allowances, then the "client" smart contract should avoid using
     * this function. Performing a {safeIncreaseAllowance} or {safeDecreaseAllowance} operation on a token contract
     * that has a non-zero temporary allowance (for that particular owner-spender) will result in unexpected behavior.
     */
    function safeDecreaseAllowance(IERC20 token, address spender, uint256 requestedDecrease) internal {
        unchecked {
            uint256 currentAllowance = token.allowance(address(this), spender);
            if (currentAllowance < requestedDecrease) {
                revert SafeERC20FailedDecreaseAllowance(spender, currentAllowance, requestedDecrease);
            }
            forceApprove(token, spender, currentAllowance - requestedDecrease);
        }
    }

    /**
     * @dev Set the calling contract's allowance toward `spender` to `value`. If `token` returns no value,
     * non-reverting calls are assumed to be successful. Meant to be used with tokens that require the approval
     * to be set to zero before setting it to a non-zero value, such as USDT.
     *
     * NOTE: If the token implements ERC-7674, this function will not modify any temporary allowance. This function
     * only sets the "standard" allowance. Any temporary allowance will remain active, in addition to the value being
     * set here.
     */
    function forceApprove(IERC20 token, address spender, uint256 value) internal {
        bytes memory approvalCall = abi.encodeCall(token.approve, (spender, value));

        if (!_callOptionalReturnBool(token, approvalCall)) {
            _callOptionalReturn(token, abi.encodeCall(token.approve, (spender, 0)));
            _callOptionalReturn(token, approvalCall);
        }
    }

    /**
     * @dev Performs an {ERC1363} transferAndCall, with a fallback to the simple {ERC20} transfer if the target has no
     * code. This can be used to implement an {ERC721}-like safe transfer that rely on {ERC1363} checks when
     * targeting contracts.
     *
     * Reverts if the returned value is other than `true`.
     */
    function transferAndCallRelaxed(IERC1363 token, address to, uint256 value, bytes memory data) internal {
        if (to.code.length == 0) {
            safeTransfer(token, to, value);
        } else if (!token.transferAndCall(to, value, data)) {
            revert SafeERC20FailedOperation(address(token));
        }
    }

    /**
     * @dev Performs an {ERC1363} transferFromAndCall, with a fallback to the simple {ERC20} transferFrom if the target
     * has no code. This can be used to implement an {ERC721}-like safe transfer that rely on {ERC1363} checks when
     * targeting contracts.
     *
     * Reverts if the returned value is other than `true`.
     */
    function transferFromAndCallRelaxed(
        IERC1363 token,
        address from,
        address to,
        uint256 value,
        bytes memory data
    ) internal {
        if (to.code.length == 0) {
            safeTransferFrom(token, from, to, value);
        } else if (!token.transferFromAndCall(from, to, value, data)) {
            revert SafeERC20FailedOperation(address(token));
        }
    }

    /**
     * @dev Performs an {ERC1363} approveAndCall, with a fallback to the simple {ERC20} approve if the target has no
     * code. This can be used to implement an {ERC721}-like safe transfer that rely on {ERC1363} checks when
     * targeting contracts.
     *
     * NOTE: When the recipient address (`to`) has no code (i.e. is an EOA), this function behaves as {forceApprove}.
     * Opposedly, when the recipient address (`to`) has code, this function only attempts to call {ERC1363-approveAndCall}
     * once without retrying, and relies on the returned value to be true.
     *
     * Reverts if the returned value is other than `true`.
     */
    function approveAndCallRelaxed(IERC1363 token, address to, uint256 value, bytes memory data) internal {
        if (to.code.length == 0) {
            forceApprove(token, to, value);
        } else if (!token.approveAndCall(to, value, data)) {
            revert SafeERC20FailedOperation(address(token));
        }
    }

    /**
     * @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).
     *
     * This is a variant of {_callOptionalReturnBool} that reverts if call fails to meet the requirements.
     */
    function _callOptionalReturn(IERC20 token, bytes memory data) private {
        uint256 returnSize;
        uint256 returnValue;
        assembly ("memory-safe") {
            let success := call(gas(), token, 0, add(data, 0x20), mload(data), 0, 0x20)
            // bubble errors
            if iszero(success) {
                let ptr := mload(0x40)
                returndatacopy(ptr, 0, returndatasize())
                revert(ptr, returndatasize())
            }
            returnSize := returndatasize()
            returnValue := mload(0)
        }

        if (returnSize == 0 ? address(token).code.length == 0 : returnValue != 1) {
            revert SafeERC20FailedOperation(address(token));
        }
    }

    /**
     * @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).
     *
     * This is a variant of {_callOptionalReturn} that silently catches all reverts and returns a bool instead.
     */
    function _callOptionalReturnBool(IERC20 token, bytes memory data) private returns (bool) {
        bool success;
        uint256 returnSize;
        uint256 returnValue;
        assembly ("memory-safe") {
            success := call(gas(), token, 0, add(data, 0x20), mload(data), 0, 0x20)
            returnSize := returndatasize()
            returnValue := mload(0)
        }
        return success && (returnSize == 0 ? address(token).code.length > 0 : returnValue == 1);
    }
}

// File: @openzeppelin/contracts/token/ERC721/IERC721.sol


// OpenZeppelin Contracts (last updated v5.1.0) (token/ERC721/IERC721.sol)

pragma solidity ^0.8.20;


/**
 * @dev Required interface of an ERC-721 compliant contract.
 */
interface IERC721 is IERC165 {
    /**
     * @dev Emitted when `tokenId` token is transferred from `from` to `to`.
     */
    event Transfer(address indexed from, address indexed to, uint256 indexed tokenId);

    /**
     * @dev Emitted when `owner` enables `approved` to manage the `tokenId` token.
     */
    event Approval(address indexed owner, address indexed approved, uint256 indexed tokenId);

    /**
     * @dev Emitted when `owner` enables or disables (`approved`) `operator` to manage all of its assets.
     */
    event ApprovalForAll(address indexed owner, address indexed operator, bool approved);

    /**
     * @dev Returns the number of tokens in ``owner``'s account.
     */
    function balanceOf(address owner) external view returns (uint256 balance);

    /**
     * @dev Returns the owner of the `tokenId` token.
     *
     * Requirements:
     *
     * - `tokenId` must exist.
     */
    function ownerOf(uint256 tokenId) external view returns (address owner);

    /**
     * @dev Safely transfers `tokenId` token from `from` to `to`.
     *
     * Requirements:
     *
     * - `from` cannot be the zero address.
     * - `to` cannot be the zero address.
     * - `tokenId` token must exist and be owned by `from`.
     * - If the caller is not `from`, it must be approved to move this token by either {approve} or {setApprovalForAll}.
     * - If `to` refers to a smart contract, it must implement {IERC721Receiver-onERC721Received}, which is called upon
     *   a safe transfer.
     *
     * Emits a {Transfer} event.
     */
    function safeTransferFrom(address from, address to, uint256 tokenId, bytes calldata data) external;

    /**
     * @dev Safely transfers `tokenId` token from `from` to `to`, checking first that contract recipients
     * are aware of the ERC-721 protocol to prevent tokens from being forever locked.
     *
     * Requirements:
     *
     * - `from` cannot be the zero address.
     * - `to` cannot be the zero address.
     * - `tokenId` token must exist and be owned by `from`.
     * - If the caller is not `from`, it must have been allowed to move this token by either {approve} or
     *   {setApprovalForAll}.
     * - If `to` refers to a smart contract, it must implement {IERC721Receiver-onERC721Received}, which is called upon
     *   a safe transfer.
     *
     * Emits a {Transfer} event.
     */
    function safeTransferFrom(address from, address to, uint256 tokenId) external;

    /**
     * @dev Transfers `tokenId` token from `from` to `to`.
     *
     * WARNING: Note that the caller is responsible to confirm that the recipient is capable of receiving ERC-721
     * or else they may be permanently lost. Usage of {safeTransferFrom} prevents loss, though the caller must
     * understand this adds an external call which potentially creates a reentrancy vulnerability.
     *
     * Requirements:
     *
     * - `from` cannot be the zero address.
     * - `to` cannot be the zero address.
     * - `tokenId` token must be owned by `from`.
     * - If the caller is not `from`, it must be approved to move this token by either {approve} or {setApprovalForAll}.
     *
     * Emits a {Transfer} event.
     */
    function transferFrom(address from, address to, uint256 tokenId) external;

    /**
     * @dev Gives permission to `to` to transfer `tokenId` token to another account.
     * The approval is cleared when the token is transferred.
     *
     * Only a single account can be approved at a time, so approving the zero address clears previous approvals.
     *
     * Requirements:
     *
     * - The caller must own the token or be an approved operator.
     * - `tokenId` must exist.
     *
     * Emits an {Approval} event.
     */
    function approve(address to, uint256 tokenId) external;

    /**
     * @dev Approve or remove `operator` as an operator for the caller.
     * Operators can call {transferFrom} or {safeTransferFrom} for any token owned by the caller.
     *
     * Requirements:
     *
     * - The `operator` cannot be the address zero.
     *
     * Emits an {ApprovalForAll} event.
     */
    function setApprovalForAll(address operator, bool approved) external;

    /**
     * @dev Returns the account approved for `tokenId` token.
     *
     * Requirements:
     *
     * - `tokenId` must exist.
     */
    function getApproved(uint256 tokenId) external view returns (address operator);

    /**
     * @dev Returns if the `operator` is allowed to manage all of the assets of `owner`.
     *
     * See {setApprovalForAll}
     */
    function isApprovedForAll(address owner, address operator) external view returns (bool);
}

// File: @openzeppelin/contracts/utils/cryptography/Hashes.sol


// OpenZeppelin Contracts (last updated v5.3.0) (utils/cryptography/Hashes.sol)

pragma solidity ^0.8.20;

/**
 * @dev Library of standard hash functions.
 *
 * _Available since v5.1._
 */
library Hashes {
    /**
     * @dev Commutative Keccak256 hash of a sorted pair of bytes32. Frequently used when working with merkle proofs.
     *
     * NOTE: Equivalent to the `standardNodeHash` in our https://github.com/OpenZeppelin/merkle-tree[JavaScript library].
     */
    function commutativeKeccak256(bytes32 a, bytes32 b) internal pure returns (bytes32) {
        return a < b ? efficientKeccak256(a, b) : efficientKeccak256(b, a);
    }

    /**
     * @dev Implementation of keccak256(abi.encode(a, b)) that doesn't allocate or expand memory.
     */
    function efficientKeccak256(bytes32 a, bytes32 b) internal pure returns (bytes32 value) {
        assembly ("memory-safe") {
            mstore(0x00, a)
            mstore(0x20, b)
            value := keccak256(0x00, 0x40)
        }
    }
}

// File: @openzeppelin/contracts/utils/cryptography/MerkleProof.sol


// OpenZeppelin Contracts (last updated v5.1.0) (utils/cryptography/MerkleProof.sol)
// This file was procedurally generated from scripts/generate/templates/MerkleProof.js.

pragma solidity ^0.8.20;


/**
 * @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.
 *
 * IMPORTANT: Consider memory side-effects when using custom hashing functions
 * that access memory in an unsafe way.
 *
 * NOTE: This library supports proof verification for merkle trees built using
 * custom _commutative_ hashing functions (i.e. `H(a, b) == H(b, a)`). Proving
 * leaf inclusion in trees built using non-commutative hashing functions requires
 * additional logic that is not supported by this library.
 */
library MerkleProof {
    /**
     *@dev The multiproof provided is not valid.
     */
    error MerkleProofInvalidMultiproof();

    /**
     * @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.
     *
     * This version handles proofs in memory with the default hashing function.
     */
    function verify(bytes32[] memory proof, bytes32 root, bytes32 leaf) internal pure returns (bool) {
        return processProof(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 leaves & pre-images are assumed to be sorted.
     *
     * This version handles proofs in memory with the default hashing function.
     */
    function processProof(bytes32[] memory proof, bytes32 leaf) internal pure returns (bytes32) {
        bytes32 computedHash = leaf;
        for (uint256 i = 0; i < proof.length; i++) {
            computedHash = Hashes.commutativeKeccak256(computedHash, proof[i]);
        }
        return computedHash;
    }

    /**
     * @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.
     *
     * This version handles proofs in memory with a custom hashing function.
     */
    function verify(
        bytes32[] memory proof,
        bytes32 root,
        bytes32 leaf,
        function(bytes32, bytes32) view returns (bytes32) hasher
    ) internal view returns (bool) {
        return processProof(proof, leaf, hasher) == 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 leaves & pre-images are assumed to be sorted.
     *
     * This version handles proofs in memory with a custom hashing function.
     */
    function processProof(
        bytes32[] memory proof,
        bytes32 leaf,
        function(bytes32, bytes32) view returns (bytes32) hasher
    ) internal view returns (bytes32) {
        bytes32 computedHash = leaf;
        for (uint256 i = 0; i < proof.length; i++) {
            computedHash = hasher(computedHash, proof[i]);
        }
        return computedHash;
    }

    /**
     * @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.
     *
     * This version handles proofs in calldata with the default hashing function.
     */
    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 leaves & pre-images are assumed to be sorted.
     *
     * This version handles proofs in calldata with the default hashing function.
     */
    function processProofCalldata(bytes32[] calldata proof, bytes32 leaf) internal pure returns (bytes32) {
        bytes32 computedHash = leaf;
        for (uint256 i = 0; i < proof.length; i++) {
            computedHash = Hashes.commutativeKeccak256(computedHash, proof[i]);
        }
        return computedHash;
    }

    /**
     * @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.
     *
     * This version handles proofs in calldata with a custom hashing function.
     */
    function verifyCalldata(
        bytes32[] calldata proof,
        bytes32 root,
        bytes32 leaf,
        function(bytes32, bytes32) view returns (bytes32) hasher
    ) internal view returns (bool) {
        return processProofCalldata(proof, leaf, hasher) == 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 leaves & pre-images are assumed to be sorted.
     *
     * This version handles proofs in calldata with a custom hashing function.
     */
    function processProofCalldata(
        bytes32[] calldata proof,
        bytes32 leaf,
        function(bytes32, bytes32) view returns (bytes32) hasher
    ) internal view returns (bytes32) {
        bytes32 computedHash = leaf;
        for (uint256 i = 0; i < proof.length; i++) {
            computedHash = hasher(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}.
     *
     * This version handles multiproofs in memory with the default hashing function.
     *
     * CAUTION: Not all Merkle trees admit multiproofs. See {processMultiProof} for details.
     *
     * NOTE: Consider the case where `root == proof[0] && leaves.length == 0` as it will return `true`.
     * The `leaves` must be validated independently. See {processMultiProof}.
     */
    function multiProofVerify(
        bytes32[] memory proof,
        bool[] memory proofFlags,
        bytes32 root,
        bytes32[] memory leaves
    ) internal pure returns (bool) {
        return processMultiProof(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.
     *
     * This version handles multiproofs in memory with the default hashing function.
     *
     * 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).
     *
     * NOTE: The _empty set_ (i.e. the case where `proof.length == 1 && leaves.length == 0`) is considered a no-op,
     * and therefore a valid multiproof (i.e. it returns `proof[0]`). Consider disallowing this case if you're not
     * validating the leaves elsewhere.
     */
    function processMultiProof(
        bytes32[] memory proof,
        bool[] memory proofFlags,
        bytes32[] memory leaves
    ) internal pure returns (bytes32 merkleRoot) {
        // This function rebuilds 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 proofFlagsLen = proofFlags.length;

        // Check proof validity.
        if (leavesLen + proof.length != proofFlagsLen + 1) {
            revert MerkleProofInvalidMultiproof();
        }

        // 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[](proofFlagsLen);
        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 from the "main queue" (merging branches) or an element from the
        //   `proof` array.
        for (uint256 i = 0; i < proofFlagsLen; i++) {
            bytes32 a = leafPos < leavesLen ? leaves[leafPos++] : hashes[hashPos++];
            bytes32 b = proofFlags[i]
                ? (leafPos < leavesLen ? leaves[leafPos++] : hashes[hashPos++])
                : proof[proofPos++];
            hashes[i] = Hashes.commutativeKeccak256(a, b);
        }

        if (proofFlagsLen > 0) {
            if (proofPos != proof.length) {
                revert MerkleProofInvalidMultiproof();
            }
            unchecked {
                return hashes[proofFlagsLen - 1];
            }
        } else if (leavesLen > 0) {
            return leaves[0];
        } else {
            return proof[0];
        }
    }

    /**
     * @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}.
     *
     * This version handles multiproofs in memory with a custom hashing function.
     *
     * CAUTION: Not all Merkle trees admit multiproofs. See {processMultiProof} for details.
     *
     * NOTE: Consider the case where `root == proof[0] && leaves.length == 0` as it will return `true`.
     * The `leaves` must be validated independently. See {processMultiProof}.
     */
    function multiProofVerify(
        bytes32[] memory proof,
        bool[] memory proofFlags,
        bytes32 root,
        bytes32[] memory leaves,
        function(bytes32, bytes32) view returns (bytes32) hasher
    ) internal view returns (bool) {
        return processMultiProof(proof, proofFlags, leaves, hasher) == 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.
     *
     * This version handles multiproofs in memory with a custom hashing function.
     *
     * 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).
     *
     * NOTE: The _empty set_ (i.e. the case where `proof.length == 1 && leaves.length == 0`) is considered a no-op,
     * and therefore a valid multiproof (i.e. it returns `proof[0]`). Consider disallowing this case if you're not
     * validating the leaves elsewhere.
     */
    function processMultiProof(
        bytes32[] memory proof,
        bool[] memory proofFlags,
        bytes32[] memory leaves,
        function(bytes32, bytes32) view returns (bytes32) hasher
    ) internal view returns (bytes32 merkleRoot) {
        // This function rebuilds 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 proofFlagsLen = proofFlags.length;

        // Check proof validity.
        if (leavesLen + proof.length != proofFlagsLen + 1) {
            revert MerkleProofInvalidMultiproof();
        }

        // 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[](proofFlagsLen);
        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 from the "main queue" (merging branches) or an element from the
        //   `proof` array.
        for (uint256 i = 0; i < proofFlagsLen; i++) {
            bytes32 a = leafPos < leavesLen ? leaves[leafPos++] : hashes[hashPos++];
            bytes32 b = proofFlags[i]
                ? (leafPos < leavesLen ? leaves[leafPos++] : hashes[hashPos++])
                : proof[proofPos++];
            hashes[i] = hasher(a, b);
        }

        if (proofFlagsLen > 0) {
            if (proofPos != proof.length) {
                revert MerkleProofInvalidMultiproof();
            }
            unchecked {
                return hashes[proofFlagsLen - 1];
            }
        } else if (leavesLen > 0) {
            return leaves[0];
        } else {
            return proof[0];
        }
    }

    /**
     * @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}.
     *
     * This version handles multiproofs in calldata with the default hashing function.
     *
     * CAUTION: Not all Merkle trees admit multiproofs. See {processMultiProof} for details.
     *
     * NOTE: Consider the case where `root == proof[0] && leaves.length == 0` as it will return `true`.
     * The `leaves` must be validated independently. See {processMultiProofCalldata}.
     */
    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.
     *
     * This version handles multiproofs in calldata with the default hashing function.
     *
     * 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).
     *
     * NOTE: The _empty set_ (i.e. the case where `proof.length == 1 && leaves.length == 0`) is considered a no-op,
     * and therefore a valid multiproof (i.e. it returns `proof[0]`). Consider disallowing this case if you're not
     * validating the leaves elsewhere.
     */
    function processMultiProofCalldata(
        bytes32[] calldata proof,
        bool[] calldata proofFlags,
        bytes32[] memory leaves
    ) internal pure returns (bytes32 merkleRoot) {
        // This function rebuilds 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 proofFlagsLen = proofFlags.length;

        // Check proof validity.
        if (leavesLen + proof.length != proofFlagsLen + 1) {
            revert MerkleProofInvalidMultiproof();
        }

        // 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[](proofFlagsLen);
        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 from the "main queue" (merging branches) or an element from the
        //   `proof` array.
        for (uint256 i = 0; i < proofFlagsLen; i++) {
            bytes32 a = leafPos < leavesLen ? leaves[leafPos++] : hashes[hashPos++];
            bytes32 b = proofFlags[i]
                ? (leafPos < leavesLen ? leaves[leafPos++] : hashes[hashPos++])
                : proof[proofPos++];
            hashes[i] = Hashes.commutativeKeccak256(a, b);
        }

        if (proofFlagsLen > 0) {
            if (proofPos != proof.length) {
                revert MerkleProofInvalidMultiproof();
            }
            unchecked {
                return hashes[proofFlagsLen - 1];
            }
        } else if (leavesLen > 0) {
            return leaves[0];
        } else {
            return proof[0];
        }
    }

    /**
     * @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}.
     *
     * This version handles multiproofs in calldata with a custom hashing function.
     *
     * CAUTION: Not all Merkle trees admit multiproofs. See {processMultiProof} for details.
     *
     * NOTE: Consider the case where `root == proof[0] && leaves.length == 0` as it will return `true`.
     * The `leaves` must be validated independently. See {processMultiProofCalldata}.
     */
    function multiProofVerifyCalldata(
        bytes32[] calldata proof,
        bool[] calldata proofFlags,
        bytes32 root,
        bytes32[] memory leaves,
        function(bytes32, bytes32) view returns (bytes32) hasher
    ) internal view returns (bool) {
        return processMultiProofCalldata(proof, proofFlags, leaves, hasher) == 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.
     *
     * This version handles multiproofs in calldata with a custom hashing function.
     *
     * 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).
     *
     * NOTE: The _empty set_ (i.e. the case where `proof.length == 1 && leaves.length == 0`) is considered a no-op,
     * and therefore a valid multiproof (i.e. it returns `proof[0]`). Consider disallowing this case if you're not
     * validating the leaves elsewhere.
     */
    function processMultiProofCalldata(
        bytes32[] calldata proof,
        bool[] calldata proofFlags,
        bytes32[] memory leaves,
        function(bytes32, bytes32) view returns (bytes32) hasher
    ) internal view returns (bytes32 merkleRoot) {
        // This function rebuilds 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 proofFlagsLen = proofFlags.length;

        // Check proof validity.
        if (leavesLen + proof.length != proofFlagsLen + 1) {
            revert MerkleProofInvalidMultiproof();
        }

        // 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[](proofFlagsLen);
        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 from the "main queue" (merging branches) or an element from the
        //   `proof` array.
        for (uint256 i = 0; i < proofFlagsLen; i++) {
            bytes32 a = leafPos < leavesLen ? leaves[leafPos++] : hashes[hashPos++];
            bytes32 b = proofFlags[i]
                ? (leafPos < leavesLen ? leaves[leafPos++] : hashes[hashPos++])
                : proof[proofPos++];
            hashes[i] = hasher(a, b);
        }

        if (proofFlagsLen > 0) {
            if (proofPos != proof.length) {
                revert MerkleProofInvalidMultiproof();
            }
            unchecked {
                return hashes[proofFlagsLen - 1];
            }
        } else if (leavesLen > 0) {
            return leaves[0];
        } else {
            return proof[0];
        }
    }
}

// File: Claim_Contract/NFTRewardDistributor.sol


pragma solidity 0.8.29;






/**
 * @title NFT Reward Distributor with Time-Based Cyclic Claims
 * @notice Efficient ERC20 reward distribution to NFT holders using Merkle proofs, supporting recurring claims per cycle based on start time.
 * @dev Features:
 * - Fixed reward token with direct deposit handling
 * - Configurable NFT collection
 * - 30-day claim periods with automatic unclaimed returns
 * - Gas-optimized batch claims
 * - Emergency recovery functions
 * - Has Claimed status is tracked per reward cycle based on the cycle's start time.
 * - Merkle root can be the same across cycles if eligibility is identical.
 */

 // FOR THE DEPLOYMENT, THE TRANSACTION COST IS 2547632 * CUURENT GWEI GAS PRICE, according to the test with remix.

contract NFTRewardDistributor is Ownable2Step, ReentrancyGuard {
    using SafeERC20 for IERC20;
    using MerkleProof for bytes32[];

    /*//////////////////////////////////////////////////////////////
    * CORE SETTINGS
    *//////////////////////////////////////////////////////////////*/

    /// @notice Immutable ERC20 reward token address
    address public immutable REWARD_TOKEN;

    /// @notice Duration of claim period (30 days in seconds)
    uint256 public constant CLAIM_DEADLINE = 30 days;

    /// @notice Current NFT collection contract
    IERC721 public nftCollection;

    /// @notice Active Merkle root for reward verification for the *current* cycle. Can be same as previous cycles.
    bytes32 public merkleRoot;

    /// @notice Start time of current reward cycle. Used as the unique cycle identifier.
    uint256 public rewardStartTime;

    /// @notice Total rewards allocated for current cycle
    uint256 public expectedRewardAmount;

    /// @notice Tracks claimed NFT tokens per reward cycle (rewardStartTime => tokenId => claimed)
    // *** MODIFIED STATE VARIABLE ***
    mapping(uint256 => mapping(uint256 => bool)) public hasClaimed; // Keyed by rewardStartTime

    /*//////////////////////////////////////////////////////////////
    * EVENTS
    *//////////////////////////////////////////////////////////////*/

    // *** USING startTime as the cycle identifier in event ***
    event RewardCycleStarted(uint256 indexed startTime, bytes32 indexed root, uint256 amount);
    event RewardClaimed(address indexed user, uint256 indexed tokenId, uint256 indexed cycleStartTime, uint256 reward); // Added cycleStartTime to event
    event UnclaimedWithdrawn(uint256 amount);
    event NFTCollectionUpdated(address newCollection);
    event MerkleRootUpdated(bytes32 newRoot); // This event is less critical now
    event EmergencyWithdraw(address token, uint256 amount);
    event TokensDeposited(uint256 amount); // Note: This event is not emitted anywhere in the code

    /*//////////////////////////////////////////////////////////////
    * INITIALIZATION
    *//////////////////////////////////////////////////////////////*/

    /**
     * @notice Deploys contract with fixed parameters
     * @param _rewardToken ERC20 token address for rewards
     * @param _nftCollection Initial NFT collection address
     */
    constructor(address _rewardToken, address _nftCollection) Ownable(msg.sender) {
        require(_rewardToken != address(0), "Invalid reward token");
        require(_nftCollection != address(0), "Invalid NFT collection");
        REWARD_TOKEN = _rewardToken;
        nftCollection = IERC721(_nftCollection);
        // rewardStartTime starts at 0 by default
    }

    /*//////////////////////////////////////////////////////////////
    * REWARD CYCLE MANAGEMENT
    *//////////////////////////////////////////////////////////////*/

    /**
     * @notice Starts new reward distribution cycle
     * @param _merkleRoot Root of new reward Merkle tree. Can be the same as previous cycles.
     * @param _expectedAmount Total rewards for this cycle
     * @dev Uses current timestamp as unique cycle identifier. Handles unclaimed tokens from previous cycle.
     */

     // BEFORE THIS CALL BY THE ADMIN, THE AMOUNT EXPECTED HAS TO BE TRANSFERED INTO THE CONTRACT ALREADY, WHICH IS BY THE ADDRESS OF THE CONTRACT AFTER IT HAS BEEN DEPLOYED.

     // GAS COST is 99772(gas amount) * GAS price(0.366 gwei) = 0.00003651952 ETH, CHECK ETH GAS TRACKER FOR THE CURRENT GAS PRICE

     // LOAD REWARD CYCLE WILL NOT GO THROUGH IF THE EXPECTED REWARD OF THE CONTRACT IS NOT EQUAL TO THE BALANCE OF THE CONTRACT 
    function loadRewardCycle(bytes32 _merkleRoot, uint256 _expectedAmount) external onlyOwner {
        require(block.timestamp > rewardStartTime + CLAIM_DEADLINE, "Previous cycle active");
        require(_expectedAmount > 0, "Reward amount must be positive");

        // Handle any remaining unclaimed tokens from the *previous* cycle
        _autoWithdrawUnclaimed();

        require(
            IERC20(REWARD_TOKEN).balanceOf(address(this)) >= _expectedAmount,
            "Insufficient token balance"
        );

        // *** Set rewardStartTime for the NEW cycle (used as identifier) ***
        rewardStartTime = block.timestamp;

        // Update state for the new cycle. The merkleRoot here represents the eligibility
        // for THIS cycle, as differentiated by its rewardStartTime.
        merkleRoot = _merkleRoot;
        expectedRewardAmount = _expectedAmount;

        // *** EMIT EVENT WITH NEW START TIME ***
        emit RewardCycleStarted(rewardStartTime, _merkleRoot, _expectedAmount);
    }

    /*//////////////////////////////////////////////////////////////
    * CLAIM MECHANISMS
    *//////////////////////////////////////////////////////////////*/

            
    /**
     * @notice Claim rewards for single NFT for the current cycle
     * @param tokenId NFT token ID to claim
     * @param rarity NFT rarity tier
     * @param upgraded Upgrade status
     * @param reward Reward amount
     * @param proof Merkle verification proof. Must match the current merkleRoot state variable.
     */

     // GAS COST = 56085 * Current GAS PRICE per failed claim 
     // GAS COST = 107790 * Current GAS PRICE per succesful claim equals roughly 0.17335 USD

     // CAN'T CLAIM WHEN REWARD HAS NOT BEEN LOADED, COS REWARD CYCLE HAS NOT STARTED, USER CALLING THIS WILL JUST WASTE GAS, TIMER COUNTDOWN SHOULD BE IN THE USER INTERFACE
     // _validatteClaim and _executeClaim function are working perfectly.
    function claim( 
        uint256 tokenId,
        string calldata rarity,
        bool upgraded,
        uint256 reward,
        bytes32[] calldata proof
    ) external nonReentrant {
        // Validation checks using the current rewardStartTime
        _validateClaim(tokenId, rarity, upgraded, reward, proof);

        // Execute claim, marking status for the current rewardStartTime
        _executeClaim(tokenId, reward);

        // This call is likely redundant here
        _autoWithdrawUnclaimed();
    }

    /**
     * @notice Batch claim rewards for multiple NFTs for the current cycle
     * @param tokenIds Array of NFT token IDs
     * @param rarities Array of rarity tiers
     * @param upgradeds Array of upgrade statuses
     * @param rewards Array of reward amounts
     * @param proofs Array of Merkle proofs. Must match the current merkleRoot state variable.
     */

     // GAS COST = 178150 * CURRENT GAS PRICE estimated as 0.219815USD for 3 NFTs used in testing and rough gas fees will be lower for 100 NFTs, but that's depending on the cuurent gwei price
    // USERS CAN'T CLAIM TWICE IN THE SAME CYCLE, EVEN WHEN TRANSFERED TO ANOTHER USER
    function batchClaim(
        uint256[] calldata tokenIds,
        string[] calldata rarities,
        bool[] calldata upgradeds,
        uint256[] calldata rewards,
        bytes32[][] calldata proofs
    ) external nonReentrant {
        // Check claim period is active (explicit check for clarity)
        require(block.timestamp <= rewardStartTime + CLAIM_DEADLINE, "Claim period ended");
        require(tokenIds.length > 0, "Empty claim array");
        require(
            tokenIds.length == rewards.length &&
            tokenIds.length == proofs.length &&
            tokenIds.length == rarities.length &&
            tokenIds.length == upgradeds.length,
            "Array length mismatch"
        );

        uint256 totalToSend;

        for (uint256 i = 0; i < tokenIds.length; ) {
            // *** CHECK USES CURRENT REWARD START TIME ***
            if (!hasClaimed[rewardStartTime][tokenIds[i]] && nftCollection.ownerOf(tokenIds[i]) == msg.sender) {
                // *** LEAF HASHING DOES NOT INCLUDE START TIME or COUNTER ***
                bytes32 leaf = keccak256(abi.encodePacked(
                    tokenIds[i],
                    rarities[i],
                    upgradeds[i],
                    rewards[i]
                ));
                // Verify proof against the current merkleRoot state variable
                if (proofs[i].verify(merkleRoot, leaf)) {
                    // *** MARK AS CLAIMED USES CURRENT REWARD START TIME ***
                    hasClaimed[rewardStartTime][tokenIds[i]] = true;
                    totalToSend += rewards[i];
                    // Emit event for each successful individual claim within the batch
                    emit RewardClaimed(msg.sender, tokenIds[i], rewardStartTime, rewards[i]); // Added cycleStartTime to event
                }
            }
            unchecked { ++i; }
        }

        require(totalToSend > 0, "No valid claims");
        IERC20(REWARD_TOKEN).safeTransfer(msg.sender, totalToSend);

        // This call is likely redundant here
        _autoWithdrawUnclaimed();
    }

    /*//////////////////////////////////////////////////////////////
    * ADMIN CONTROLS
    *//////////////////////////////////////////////////////////////*/


    // Testing ensured both UPDATE functions have neccsary checks ensuring nothing interferes with the reward distribtuion during the active cycle.

    /**
     * @notice Update the NFT collection address
     * @param _newCollection Address of new ERC721 contract
     */
     // 
    function updateNFTCollection(address _newCollection) external onlyOwner {
        require(block.timestamp > rewardStartTime + CLAIM_DEADLINE, "Cycle active");
        require(_newCollection != address(0), "Invalid address");
        nftCollection = IERC721(_newCollection);
        emit NFTCollectionUpdated(_newCollection);
    }

     /**
     * @notice Update Merkle root between cycles (less common now, loadRewardCycle sets root)
     * @param _newRoot New Merkle root hash. Only useful if needed to correct mid-cycle (use with caution).
     * @dev Can only update when a claim period is NOT active.
     */

     // Test can confirm that the merkle root updating during active reward cycle will REVERT!
    function updateMerkleRoot(bytes32 _newRoot) external onlyOwner {
        require(block.timestamp > rewardStartTime + CLAIM_DEADLINE, "Cycle active");
        require(_newRoot != bytes32(0), "Invalid root");
        merkleRoot = _newRoot;
        emit MerkleRootUpdated(_newRoot);
    }

    /**
     * @notice Emergency token recovery
     * @param _token Token address to recover
     */

     // IN THIS FUNCTION, EMERGENCY REWARD WILL NOT HAPPEN DURING ACTIVE REWARD CYCLE TO AVOID DISRUPTION IN CLAIMS FOR USERS. DESIGN CHOICE, LET ME KNOW IF YOU LIKE THAT OR NOT
    function emergencyWithdraw(address _token) external onlyOwner {
        require(_token != REWARD_TOKEN ||
                block.timestamp > rewardStartTime + CLAIM_DEADLINE,
                "Active reward cycle");
        uint256 balance = IERC20(_token).balanceOf(address(this));
         if (balance > 0) {
            IERC20(_token).safeTransfer(owner(), balance);
            emit EmergencyWithdraw(_token, balance);
        }
    }


    /*//////////////////////////////////////////////////////////////
    * INTERNAL FUNCTIONS
    *//////////////////////////////////////////////////////////////*/

    /**
     * @dev Validates claim parameters against the current cycle's merkleRoot and claim status.
     */

     // TEST RESULT: USERS CAN'T CLAIM IF THEY ARE NOT THE OWNER OF THE NFT ACCORDING TO THE TOKEN ID PARAMETER
    function _validateClaim(
        uint256 tokenId,
        string calldata rarity,
        bool upgraded,
        uint256 reward,
        bytes32[] calldata proof
    ) internal view {
        require(block.timestamp <= rewardStartTime + CLAIM_DEADLINE, "Claim period ended");
        // *** CHECK USES CURRENT REWARD START TIME ***
        require(!hasClaimed[rewardStartTime][tokenId], "Reward already claimed for this cycle");
        require(nftCollection.ownerOf(tokenId) == msg.sender, "Not NFT owner");

        // *** LEAF HASHING DOES NOT INCLUDE START TIME or COUNTER ***
        bytes32 leaf = keccak256(abi.encodePacked(tokenId, rarity, upgraded, reward));
        // Verify proof against the current merkleRoot state variable
        require(proof.verify(merkleRoot, leaf), "Invalid proof");
    }

    /**
     * @dev Processes validated claim for the current cycle
     */
     // WORKS PERFECTLY
    function _executeClaim(uint256 tokenId, uint256 reward) internal {
        // *** MARK AS CLAIMED USES CURRENT REWARD START TIME ***
        hasClaimed[rewardStartTime][tokenId] = true;
        IERC20(REWARD_TOKEN).safeTransfer(msg.sender, reward);
        // Event is emitted in claim/batchClaim after _executeClaim
    }

    /**
     * @dev Automatically returns unclaimed tokens after deadline
     * Note: Does NOT reset hasClaimed, rewardStartTime handles differentiation.
     */
     // ONLY AFTER THE CLAIM PERIOD ENDS
    function _autoWithdrawUnclaimed() internal {
        if (block.timestamp > rewardStartTime + CLAIM_DEADLINE && rewardStartTime > 0) {
             uint256 balance = IERC20(REWARD_TOKEN).balanceOf(address(this));
             if (balance > 0) {
                IERC20(REWARD_TOKEN).safeTransfer(owner(), balance);
                emit UnclaimedWithdrawn(balance);
            }
        }
    }


    /*//////////////////////////////////////////////////////////////
    * FALLBACKS
    *//////////////////////////////////////////////////////////////*/

    /**
     * @dev Reject accidental ETH transfers
     */
    receive() external payable {
        revert("ETH not accepted");
    }

    /**
     * @dev Catch invalid calls
     */
    fallback() external {
        revert("Invalid function call");
    }

    // *** ADDED PUBLIC GETTER FOR NEW MAPPING STRUCTURE ***
    function getHasClaimed(uint256 startTime, uint256 tokenId) external view returns (bool) {
        return hasClaimed[startTime][tokenId];
    }

    function timeUntilDeadline() external view returns (uint256) {
    if (block.timestamp >= rewardStartTime + CLAIM_DEADLINE) return 0;
    return (rewardStartTime + CLAIM_DEADLINE) - block.timestamp;
}

}

• No Contract Security Audit Submitted- Submit Audit Here

[{"inputs":[{"internalType":"address","name":"_rewardToken","type":"address"},{"internalType":"address","name":"_nftCollection","type":"address"}],"stateMutability":"nonpayable","type":"constructor"},{"inputs":[{"internalType":"address","name":"owner","type":"address"}],"name":"OwnableInvalidOwner","type":"error"},{"inputs":[{"internalType":"address","name":"account","type":"address"}],"name":"OwnableUnauthorizedAccount","type":"error"},{"inputs":[{"internalType":"address","name":"token","type":"address"}],"name":"SafeERC20FailedOperation","type":"error"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"address","name":"token","type":"address"},{"indexed":false,"internalType":"uint256","name":"amount","type":"uint256"}],"name":"EmergencyWithdraw","type":"event"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"bytes32","name":"newRoot","type":"bytes32"}],"name":"MerkleRootUpdated","type":"event"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"address","name":"newCollection","type":"address"}],"name":"NFTCollectionUpdated","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"previousOwner","type":"address"},{"indexed":true,"internalType":"address","name":"newOwner","type":"address"}],"name":"OwnershipTransferStarted","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"previousOwner","type":"address"},{"indexed":true,"internalType":"address","name":"newOwner","type":"address"}],"name":"OwnershipTransferred","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"user","type":"address"},{"indexed":true,"internalType":"uint256","name":"tokenId","type":"uint256"},{"indexed":true,"internalType":"uint256","name":"cycleStartTime","type":"uint256"},{"indexed":false,"internalType":"uint256","name":"reward","type":"uint256"}],"name":"RewardClaimed","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"uint256","name":"startTime","type":"uint256"},{"indexed":true,"internalType":"bytes32","name":"root","type":"bytes32"},{"indexed":false,"internalType":"uint256","name":"amount","type":"uint256"}],"name":"RewardCycleStarted","type":"event"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"uint256","name":"amount","type":"uint256"}],"name":"TokensDeposited","type":"event"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"uint256","name":"amount","type":"uint256"}],"name":"UnclaimedWithdrawn","type":"event"},{"stateMutability":"nonpayable","type":"fallback"},{"inputs":[],"name":"CLAIM_DEADLINE","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"REWARD_TOKEN","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"acceptOwnership","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256[]","name":"tokenIds","type":"uint256[]"},{"internalType":"string[]","name":"rarities","type":"string[]"},{"internalType":"bool[]","name":"upgradeds","type":"bool[]"},{"internalType":"uint256[]","name":"rewards","type":"uint256[]"},{"internalType":"bytes32[][]","name":"proofs","type":"bytes32[][]"}],"name":"batchClaim","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"tokenId","type":"uint256"},{"internalType":"string","name":"rarity","type":"string"},{"internalType":"bool","name":"upgraded","type":"bool"},{"internalType":"uint256","name":"reward","type":"uint256"},{"internalType":"bytes32[]","name":"proof","type":"bytes32[]"}],"name":"claim","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"_token","type":"address"}],"name":"emergencyWithdraw","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"expectedRewardAmount","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"startTime","type":"uint256"},{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"getHasClaimed","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"","type":"uint256"},{"internalType":"uint256","name":"","type":"uint256"}],"name":"hasClaimed","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"bytes32","name":"_merkleRoot","type":"bytes32"},{"internalType":"uint256","name":"_expectedAmount","type":"uint256"}],"name":"loadRewardCycle","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"merkleRoot","outputs":[{"internalType":"bytes32","name":"","type":"bytes32"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"nftCollection","outputs":[{"internalType":"contract IERC721","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"owner","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"pendingOwner","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"renounceOwnership","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"rewardStartTime","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"timeUntilDeadline","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"newOwner","type":"address"}],"name":"transferOwnership","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"bytes32","name":"_newRoot","type":"bytes32"}],"name":"updateMerkleRoot","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"_newCollection","type":"address"}],"name":"updateNFTCollection","outputs":[],"stateMutability":"nonpayable","type":"function"},{"stateMutability":"payable","type":"receive"}]

60a060405234801561000f575f5ffd5b50604051611ba9380380611ba983398101604081905261002e916101bd565b338061005457604051631e4fbdf760e01b81525f60048201526024015b60405180910390fd5b61005d81610137565b5060016002556001600160a01b0382166100b95760405162461bcd60e51b815260206004820152601460248201527f496e76616c69642072657761726420746f6b656e000000000000000000000000604482015260640161004b565b6001600160a01b03811661010f5760405162461bcd60e51b815260206004820152601660248201527f496e76616c6964204e465420636f6c6c656374696f6e00000000000000000000604482015260640161004b565b6001600160a01b03918216608052600380546001600160a01b031916919092161790556101ee565b600180546001600160a01b031916905561015081610153565b50565b5f80546001600160a01b038381166001600160a01b0319831681178455604051919092169283917f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e09190a35050565b80516001600160a01b03811681146101b8575f5ffd5b919050565b5f5f604083850312156101ce575f5ffd5b6101d7836101a2565b91506101e5602084016101a2565b90509250929050565b6080516119796102305f395f8181610332015281816105400152818161090c01528181610f2001528181611053015281816110ea015261140601526119795ff3fe608060405260043610610122575f3560e01c80638da5cb5b1161009f578063b094308f11610063578063b094308f146103ac578063b5a4769f146103cb578063e30c3978146103ea578063f2fde38b14610407578063f8c75a5d1461042657610167565b80638da5cb5b146102f05780639868efe21461030c57806399248ea7146103215780639b5a54a2146103545780639fc704bb1461037357610167565b80636755f59b116100e65780636755f59b146102665780636ff1c9bc14610295578063715018a6146102b457806379ba5097146102c857806383c44a66146102dc57610167565b80632cc138be146101bb5780632eb4a7ab146101e357806342f81580146101f85780634783f0ef1461020e5780636588103b1461022f57610167565b366101675760405162461bcd60e51b815260206004820152601060248201526f115512081b9bdd081858d8d95c1d195960821b60448201526064015b60405180910390fd5b348015610172575f5ffd5b5060405162461bcd60e51b815260206004820152601560248201527f496e76616c69642066756e6374696f6e2063616c6c0000000000000000000000604482015260640161015e565b3480156101c6575f5ffd5b506101d060055481565b6040519081526020015b60405180910390f35b3480156101ee575f5ffd5b506101d060045481565b348015610203575f5ffd5b506101d062278d0081565b348015610219575f5ffd5b5061022d610228366004611574565b610445565b005b34801561023a575f5ffd5b5060035461024e906001600160a01b031681565b6040516001600160a01b0390911681526020016101da565b348015610271575f5ffd5b5061028561028036600461158b565b610513565b60405190151581526020016101da565b3480156102a0575f5ffd5b5061022d6102af3660046115bf565b610536565b3480156102bf575f5ffd5b5061022d6106b6565b3480156102d3575f5ffd5b5061022d6106c9565b3480156102e7575f5ffd5b506101d061070d565b3480156102fb575f5ffd5b505f546001600160a01b031661024e565b348015610317575f5ffd5b506101d060065481565b34801561032c575f5ffd5b5061024e7f000000000000000000000000000000000000000000000000000000000000000081565b34801561035f575f5ffd5b5061022d61036e3660046115bf565b61074b565b34801561037e575f5ffd5b5061028561038d36600461158b565b600760209081525f928352604080842090915290825290205460ff1681565b3480156103b7575f5ffd5b5061022d6103c636600461158b565b610837565b3480156103d6575f5ffd5b5061022d6103e5366004611636565b610a15565b3480156103f5575f5ffd5b506001546001600160a01b031661024e565b348015610412575f5ffd5b5061022d6104213660046115bf565b610a51565b348015610431575f5ffd5b5061022d6104403660046116f7565b610ac1565b61044d610f66565b62278d0060055461045e919061180b565b421161049b5760405162461bcd60e51b815260206004820152600c60248201526b4379636c652061637469766560a01b604482015260640161015e565b806104d75760405162461bcd60e51b815260206004820152600c60248201526b125b9d985b1a59081c9bdbdd60a21b604482015260640161015e565b60048190556040518181527f90004c04698bc3322499a575ed3752dd4abf33e0a7294c06a787a0fe01bea941906020015b60405180910390a150565b5f82815260076020908152604080832084845290915290205460ff165b92915050565b61053e610f66565b7f00000000000000000000000000000000000000000000000000000000000000006001600160a01b0316816001600160a01b031614158061058e575062278d0060055461058b919061180b565b42115b6105da5760405162461bcd60e51b815260206004820152601360248201527f41637469766520726577617264206379636c6500000000000000000000000000604482015260640161015e565b6040516370a0823160e01b81523060048201525f906001600160a01b038316906370a0823190602401602060405180830381865afa15801561061e573d5f5f3e3d5ffd5b505050506040513d601f19601f82011682018060405250810190610642919061181e565b905080156106b25761066f61065e5f546001600160a01b031690565b6001600160a01b0384169083610f92565b604080516001600160a01b0384168152602081018390527f5fafa99d0643513820be26656b45130b01e1c03062e1266bf36f88cbd3bd9695910160405180910390a15b5050565b6106be610f66565b6106c75f610ffe565b565b60015433906001600160a01b031681146107015760405163118cdaa760e01b81526001600160a01b038216600482015260240161015e565b61070a81610ffe565b50565b5f62278d0060055461071f919061180b565b421061072a57505f90565b4262278d0060055461073c919061180b565b6107469190611835565b905090565b610753610f66565b62278d00600554610764919061180b565b42116107a15760405162461bcd60e51b815260206004820152600c60248201526b4379636c652061637469766560a01b604482015260640161015e565b6001600160a01b0381166107e95760405162461bcd60e51b815260206004820152600f60248201526e496e76616c6964206164647265737360881b604482015260640161015e565b600380546001600160a01b0319166001600160a01b0383169081179091556040519081527fca87b4660417fb706ee5ce97aa88ce27f880beada493d35369edd786a38de4b590602001610508565b61083f610f66565b62278d00600554610850919061180b565b421161089e5760405162461bcd60e51b815260206004820152601560248201527f50726576696f7573206379636c65206163746976650000000000000000000000604482015260640161015e565b5f81116108ed5760405162461bcd60e51b815260206004820152601e60248201527f52657761726420616d6f756e74206d75737420626520706f7369746976650000604482015260640161015e565b6108f5611017565b6040516370a0823160e01b815230600482015281907f00000000000000000000000000000000000000000000000000000000000000006001600160a01b0316906370a0823190602401602060405180830381865afa158015610959573d5f5f3e3d5ffd5b505050506040513d601f19601f8201168201806040525081019061097d919061181e565b10156109cb5760405162461bcd60e51b815260206004820152601a60248201527f496e73756666696369656e7420746f6b656e2062616c616e6365000000000000604482015260640161015e565b426005819055600483905560068290556040518281528391907f5320beb90634063abe201fb86ebdbcc70014e46594fa2d9231cafd04b9481d8d9060200160405180910390a35050565b610a1d611141565b610a2c87878787878787611198565b610a3687846113d3565b610a3e611017565b610a486001600255565b50505050505050565b610a59610f66565b600180546001600160a01b0383166001600160a01b03199091168117909155610a895f546001600160a01b031690565b6001600160a01b03167f38d16b8cac22d99fc7c124b9cd0de2d3fa1faef420bfe791d8c362d765e2270060405160405180910390a350565b610ac9611141565b62278d00600554610ada919061180b565b421115610b1e5760405162461bcd60e51b815260206004820152601260248201527110db185a5b481c195c9a5bd908195b99195960721b604482015260640161015e565b88610b6b5760405162461bcd60e51b815260206004820152601160248201527f456d70747920636c61696d206172726179000000000000000000000000000000604482015260640161015e565b8883148015610b7957508881145b8015610b8457508887145b8015610b8f57508885145b610bdb5760405162461bcd60e51b815260206004820152601560248201527f4172726179206c656e677468206d69736d617463680000000000000000000000604482015260640161015e565b5f805b8a811015610ed1576005545f908152600760205260408120908d8d84818110610c0957610c09611848565b602090810292909201358352508101919091526040015f205460ff16158015610cc1575060035433906001600160a01b0316636352211e8e8e85818110610c5257610c52611848565b905060200201356040518263ffffffff1660e01b8152600401610c7791815260200190565b602060405180830381865afa158015610c92573d5f5f3e3d5ffd5b505050506040513d601f19601f82011682018060405250810190610cb6919061185c565b6001600160a01b0316145b15610ec9575f8c8c83818110610cd957610cd9611848565b905060200201358b8b84818110610cf257610cf2611848565b9050602002810190610d049190611877565b8b8b86818110610d1657610d16611848565b9050602002016020810190610d2b91906118ba565b8a8a87818110610d3d57610d3d611848565b90506020020135604051602001610d589594939291906118d3565b604051602081830303815290604052805190602001209050610dd560045482878786818110610d8957610d89611848565b9050602002810190610d9b91906118fd565b808060200260200160405190810160405280939291908181526020018383602002808284375f9201919091525092949392505061142d9050565b15610ec7576005545f9081526007602052604081206001918f8f86818110610dff57610dff611848565b9050602002013581526020019081526020015f205f6101000a81548160ff021916908315150217905550868683818110610e3b57610e3b611848565b9050602002013583610e4d919061180b565b92506005548d8d84818110610e6457610e64611848565b90506020020135336001600160a01b03167f812be816db82c66cd18ca8457005cd84689642d8ac4d38599cc6af444a2dc72a8a8a87818110610ea857610ea8611848565b90506020020135604051610ebe91815260200190565b60405180910390a45b505b600101610bde565b505f8111610f135760405162461bcd60e51b815260206004820152600f60248201526e4e6f2076616c696420636c61696d7360881b604482015260640161015e565b610f476001600160a01b037f0000000000000000000000000000000000000000000000000000000000000000163383610f92565b610f4f611017565b50610f5a6001600255565b50505050505050505050565b5f546001600160a01b031633146106c75760405163118cdaa760e01b815233600482015260240161015e565b604080516001600160a01b038416602482015260448082018490528251808303909101815260649091019091526020810180517bffffffffffffffffffffffffffffffffffffffffffffffffffffffff1663a9059cbb60e01b179052610ff9908490611442565b505050565b600180546001600160a01b031916905561070a816114b4565b62278d00600554611028919061180b565b4211801561103757505f600554115b156106c7576040516370a0823160e01b81523060048201525f907f00000000000000000000000000000000000000000000000000000000000000006001600160a01b0316906370a0823190602401602060405180830381865afa1580156110a0573d5f5f3e3d5ffd5b505050506040513d601f19601f820116820180604052508101906110c4919061181e565b9050801561070a576111116110e05f546001600160a01b031690565b6001600160a01b037f0000000000000000000000000000000000000000000000000000000000000000169083610f92565b6040518181527f9a42e00690ac783d5bde2910d349a3fe12b86b7748ab5ebdcbc4f76639416e4a90602001610508565b60028054036111925760405162461bcd60e51b815260206004820152601f60248201527f5265656e7472616e637947756172643a207265656e7472616e742063616c6c00604482015260640161015e565b60028055565b62278d006005546111a9919061180b565b4211156111ed5760405162461bcd60e51b815260206004820152601260248201527110db185a5b481c195c9a5bd908195b99195960721b604482015260640161015e565b6005545f9081526007602090815260408083208a845290915290205460ff16156112675760405162461bcd60e51b815260206004820152602560248201527f52657761726420616c726561647920636c61696d656420666f722074686973206044820152646379636c6560d81b606482015260840161015e565b6003546040516331a9108f60e11b81526004810189905233916001600160a01b031690636352211e90602401602060405180830381865afa1580156112ae573d5f5f3e3d5ffd5b505050506040513d601f19601f820116820180604052508101906112d2919061185c565b6001600160a01b0316146113185760405162461bcd60e51b815260206004820152600d60248201526c2737ba1027232a1037bbb732b960991b604482015260640161015e565b5f87878787876040516020016113329594939291906118d3565b60405160208183030381529060405280519060200120905061138d600454828585808060200260200160405190810160405280939291908181526020018383602002808284375f9201919091525092949392505061142d9050565b6113c95760405162461bcd60e51b815260206004820152600d60248201526c24b73b30b634b210383937b7b360991b604482015260640161015e565b5050505050505050565b6005545f9081526007602090815260408083208584529091529020805460ff191660011790556106b26001600160a01b037f0000000000000000000000000000000000000000000000000000000000000000163383610f92565b5f826114398584611503565b14949350505050565b5f5f60205f8451602086015f885af180611461576040513d5f823e3d81fd5b50505f513d91508115611478578060011415611485565b6001600160a01b0384163b155b156114ae57604051635274afe760e01b81526001600160a01b038516600482015260240161015e565b50505050565b5f80546001600160a01b038381166001600160a01b0319831681178455604051919092169283917f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e09190a35050565b5f81815b845181101561153d576115338286838151811061152657611526611848565b6020026020010151611545565b9150600101611507565b509392505050565b5f81831061155f575f82815260208490526040902061156d565b5f8381526020839052604090205b9392505050565b5f60208284031215611584575f5ffd5b5035919050565b5f5f6040838503121561159c575f5ffd5b50508035926020909101359150565b6001600160a01b038116811461070a575f5ffd5b5f602082840312156115cf575f5ffd5b813561156d816115ab565b803580151581146115e9575f5ffd5b919050565b5f5f83601f8401126115fe575f5ffd5b50813567ffffffffffffffff811115611615575f5ffd5b6020830191508360208260051b850101111561162f575f5ffd5b9250929050565b5f5f5f5f5f5f5f60a0888a03121561164c575f5ffd5b87359650602088013567ffffffffffffffff811115611669575f5ffd5b8801601f81018a13611679575f5ffd5b803567ffffffffffffffff81111561168f575f5ffd5b8a60208284010111156116a0575f5ffd5b602091909101965094506116b6604089016115da565b935060608801359250608088013567ffffffffffffffff8111156116d8575f5ffd5b6116e48a828b016115ee565b989b979a50959850939692959293505050565b5f5f5f5f5f5f5f5f5f5f60a08b8d031215611710575f5ffd5b8a3567ffffffffffffffff811115611726575f5ffd5b6117328d828e016115ee565b909b5099505060208b013567ffffffffffffffff811115611751575f5ffd5b61175d8d828e016115ee565b90995097505060408b013567ffffffffffffffff81111561177c575f5ffd5b6117888d828e016115ee565b90975095505060608b013567ffffffffffffffff8111156117a7575f5ffd5b6117b38d828e016115ee565b90955093505060808b013567ffffffffffffffff8111156117d2575f5ffd5b6117de8d828e016115ee565b915080935050809150509295989b9194979a5092959850565b634e487b7160e01b5f52601160045260245ffd5b80820180821115610530576105306117f7565b5f6020828403121561182e575f5ffd5b5051919050565b81810381811115610530576105306117f7565b634e487b7160e01b5f52603260045260245ffd5b5f6020828403121561186c575f5ffd5b815161156d816115ab565b5f5f8335601e1984360301811261188c575f5ffd5b83018035915067ffffffffffffffff8211156118a6575f5ffd5b60200191503681900382131561162f575f5ffd5b5f602082840312156118ca575f5ffd5b61156d826115da565b8581528385602083013791151560f81b929091016020810192909252602182015260410192915050565b5f5f8335601e19843603018112611912575f5ffd5b83018035915067ffffffffffffffff82111561192c575f5ffd5b6020019150600581901b360382131561162f575f5ffdfea2646970667358221220070b323687b656b97acbabee5f1e62b43de23688b189e8b3c2650d87fd0b457064736f6c634300081d0033000000000000000000000000b33522fa127a73ed4afc43500bbf56c5abbf45bb000000000000000000000000347af8252640b26887182f84ce3191549d3eab41

0x608060405260043610610122575f3560e01c80638da5cb5b1161009f578063b094308f11610063578063b094308f146103ac578063b5a4769f146103cb578063e30c3978146103ea578063f2fde38b14610407578063f8c75a5d1461042657610167565b80638da5cb5b146102f05780639868efe21461030c57806399248ea7146103215780639b5a54a2146103545780639fc704bb1461037357610167565b80636755f59b116100e65780636755f59b146102665780636ff1c9bc14610295578063715018a6146102b457806379ba5097146102c857806383c44a66146102dc57610167565b80632cc138be146101bb5780632eb4a7ab146101e357806342f81580146101f85780634783f0ef1461020e5780636588103b1461022f57610167565b366101675760405162461bcd60e51b815260206004820152601060248201526f115512081b9bdd081858d8d95c1d195960821b60448201526064015b60405180910390fd5b348015610172575f5ffd5b5060405162461bcd60e51b815260206004820152601560248201527f496e76616c69642066756e6374696f6e2063616c6c0000000000000000000000604482015260640161015e565b3480156101c6575f5ffd5b506101d060055481565b6040519081526020015b60405180910390f35b3480156101ee575f5ffd5b506101d060045481565b348015610203575f5ffd5b506101d062278d0081565b348015610219575f5ffd5b5061022d610228366004611574565b610445565b005b34801561023a575f5ffd5b5060035461024e906001600160a01b031681565b6040516001600160a01b0390911681526020016101da565b348015610271575f5ffd5b5061028561028036600461158b565b610513565b60405190151581526020016101da565b3480156102a0575f5ffd5b5061022d6102af3660046115bf565b610536565b3480156102bf575f5ffd5b5061022d6106b6565b3480156102d3575f5ffd5b5061022d6106c9565b3480156102e7575f5ffd5b506101d061070d565b3480156102fb575f5ffd5b505f546001600160a01b031661024e565b348015610317575f5ffd5b506101d060065481565b34801561032c575f5ffd5b5061024e7f000000000000000000000000b33522fa127a73ed4afc43500bbf56c5abbf45bb81565b34801561035f575f5ffd5b5061022d61036e3660046115bf565b61074b565b34801561037e575f5ffd5b5061028561038d36600461158b565b600760209081525f928352604080842090915290825290205460ff1681565b3480156103b7575f5ffd5b5061022d6103c636600461158b565b610837565b3480156103d6575f5ffd5b5061022d6103e5366004611636565b610a15565b3480156103f5575f5ffd5b506001546001600160a01b031661024e565b348015610412575f5ffd5b5061022d6104213660046115bf565b610a51565b348015610431575f5ffd5b5061022d6104403660046116f7565b610ac1565b61044d610f66565b62278d0060055461045e919061180b565b421161049b5760405162461bcd60e51b815260206004820152600c60248201526b4379636c652061637469766560a01b604482015260640161015e565b806104d75760405162461bcd60e51b815260206004820152600c60248201526b125b9d985b1a59081c9bdbdd60a21b604482015260640161015e565b60048190556040518181527f90004c04698bc3322499a575ed3752dd4abf33e0a7294c06a787a0fe01bea941906020015b60405180910390a150565b5f82815260076020908152604080832084845290915290205460ff165b92915050565b61053e610f66565b7f000000000000000000000000b33522fa127a73ed4afc43500bbf56c5abbf45bb6001600160a01b0316816001600160a01b031614158061058e575062278d0060055461058b919061180b565b42115b6105da5760405162461bcd60e51b815260206004820152601360248201527f41637469766520726577617264206379636c6500000000000000000000000000604482015260640161015e565b6040516370a0823160e01b81523060048201525f906001600160a01b038316906370a0823190602401602060405180830381865afa15801561061e573d5f5f3e3d5ffd5b505050506040513d601f19601f82011682018060405250810190610642919061181e565b905080156106b25761066f61065e5f546001600160a01b031690565b6001600160a01b0384169083610f92565b604080516001600160a01b0384168152602081018390527f5fafa99d0643513820be26656b45130b01e1c03062e1266bf36f88cbd3bd9695910160405180910390a15b5050565b6106be610f66565b6106c75f610ffe565b565b60015433906001600160a01b031681146107015760405163118cdaa760e01b81526001600160a01b038216600482015260240161015e565b61070a81610ffe565b50565b5f62278d0060055461071f919061180b565b421061072a57505f90565b4262278d0060055461073c919061180b565b6107469190611835565b905090565b610753610f66565b62278d00600554610764919061180b565b42116107a15760405162461bcd60e51b815260206004820152600c60248201526b4379636c652061637469766560a01b604482015260640161015e565b6001600160a01b0381166107e95760405162461bcd60e51b815260206004820152600f60248201526e496e76616c6964206164647265737360881b604482015260640161015e565b600380546001600160a01b0319166001600160a01b0383169081179091556040519081527fca87b4660417fb706ee5ce97aa88ce27f880beada493d35369edd786a38de4b590602001610508565b61083f610f66565b62278d00600554610850919061180b565b421161089e5760405162461bcd60e51b815260206004820152601560248201527f50726576696f7573206379636c65206163746976650000000000000000000000604482015260640161015e565b5f81116108ed5760405162461bcd60e51b815260206004820152601e60248201527f52657761726420616d6f756e74206d75737420626520706f7369746976650000604482015260640161015e565b6108f5611017565b6040516370a0823160e01b815230600482015281907f000000000000000000000000b33522fa127a73ed4afc43500bbf56c5abbf45bb6001600160a01b0316906370a0823190602401602060405180830381865afa158015610959573d5f5f3e3d5ffd5b505050506040513d601f19601f8201168201806040525081019061097d919061181e565b10156109cb5760405162461bcd60e51b815260206004820152601a60248201527f496e73756666696369656e7420746f6b656e2062616c616e6365000000000000604482015260640161015e565b426005819055600483905560068290556040518281528391907f5320beb90634063abe201fb86ebdbcc70014e46594fa2d9231cafd04b9481d8d9060200160405180910390a35050565b610a1d611141565b610a2c87878787878787611198565b610a3687846113d3565b610a3e611017565b610a486001600255565b50505050505050565b610a59610f66565b600180546001600160a01b0383166001600160a01b03199091168117909155610a895f546001600160a01b031690565b6001600160a01b03167f38d16b8cac22d99fc7c124b9cd0de2d3fa1faef420bfe791d8c362d765e2270060405160405180910390a350565b610ac9611141565b62278d00600554610ada919061180b565b421115610b1e5760405162461bcd60e51b815260206004820152601260248201527110db185a5b481c195c9a5bd908195b99195960721b604482015260640161015e565b88610b6b5760405162461bcd60e51b815260206004820152601160248201527f456d70747920636c61696d206172726179000000000000000000000000000000604482015260640161015e565b8883148015610b7957508881145b8015610b8457508887145b8015610b8f57508885145b610bdb5760405162461bcd60e51b815260206004820152601560248201527f4172726179206c656e677468206d69736d617463680000000000000000000000604482015260640161015e565b5f805b8a811015610ed1576005545f908152600760205260408120908d8d84818110610c0957610c09611848565b602090810292909201358352508101919091526040015f205460ff16158015610cc1575060035433906001600160a01b0316636352211e8e8e85818110610c5257610c52611848565b905060200201356040518263ffffffff1660e01b8152600401610c7791815260200190565b602060405180830381865afa158015610c92573d5f5f3e3d5ffd5b505050506040513d601f19601f82011682018060405250810190610cb6919061185c565b6001600160a01b0316145b15610ec9575f8c8c83818110610cd957610cd9611848565b905060200201358b8b84818110610cf257610cf2611848565b9050602002810190610d049190611877565b8b8b86818110610d1657610d16611848565b9050602002016020810190610d2b91906118ba565b8a8a87818110610d3d57610d3d611848565b90506020020135604051602001610d589594939291906118d3565b604051602081830303815290604052805190602001209050610dd560045482878786818110610d8957610d89611848565b9050602002810190610d9b91906118fd565b808060200260200160405190810160405280939291908181526020018383602002808284375f9201919091525092949392505061142d9050565b15610ec7576005545f9081526007602052604081206001918f8f86818110610dff57610dff611848565b9050602002013581526020019081526020015f205f6101000a81548160ff021916908315150217905550868683818110610e3b57610e3b611848565b9050602002013583610e4d919061180b565b92506005548d8d84818110610e6457610e64611848565b90506020020135336001600160a01b03167f812be816db82c66cd18ca8457005cd84689642d8ac4d38599cc6af444a2dc72a8a8a87818110610ea857610ea8611848565b90506020020135604051610ebe91815260200190565b60405180910390a45b505b600101610bde565b505f8111610f135760405162461bcd60e51b815260206004820152600f60248201526e4e6f2076616c696420636c61696d7360881b604482015260640161015e565b610f476001600160a01b037f000000000000000000000000b33522fa127a73ed4afc43500bbf56c5abbf45bb163383610f92565b610f4f611017565b50610f5a6001600255565b50505050505050505050565b5f546001600160a01b031633146106c75760405163118cdaa760e01b815233600482015260240161015e565b604080516001600160a01b038416602482015260448082018490528251808303909101815260649091019091526020810180517bffffffffffffffffffffffffffffffffffffffffffffffffffffffff1663a9059cbb60e01b179052610ff9908490611442565b505050565b600180546001600160a01b031916905561070a816114b4565b62278d00600554611028919061180b565b4211801561103757505f600554115b156106c7576040516370a0823160e01b81523060048201525f907f000000000000000000000000b33522fa127a73ed4afc43500bbf56c5abbf45bb6001600160a01b0316906370a0823190602401602060405180830381865afa1580156110a0573d5f5f3e3d5ffd5b505050506040513d601f19601f820116820180604052508101906110c4919061181e565b9050801561070a576111116110e05f546001600160a01b031690565b6001600160a01b037f000000000000000000000000b33522fa127a73ed4afc43500bbf56c5abbf45bb169083610f92565b6040518181527f9a42e00690ac783d5bde2910d349a3fe12b86b7748ab5ebdcbc4f76639416e4a90602001610508565b60028054036111925760405162461bcd60e51b815260206004820152601f60248201527f5265656e7472616e637947756172643a207265656e7472616e742063616c6c00604482015260640161015e565b60028055565b62278d006005546111a9919061180b565b4211156111ed5760405162461bcd60e51b815260206004820152601260248201527110db185a5b481c195c9a5bd908195b99195960721b604482015260640161015e565b6005545f9081526007602090815260408083208a845290915290205460ff16156112675760405162461bcd60e51b815260206004820152602560248201527f52657761726420616c726561647920636c61696d656420666f722074686973206044820152646379636c6560d81b606482015260840161015e565b6003546040516331a9108f60e11b81526004810189905233916001600160a01b031690636352211e90602401602060405180830381865afa1580156112ae573d5f5f3e3d5ffd5b505050506040513d601f19601f820116820180604052508101906112d2919061185c565b6001600160a01b0316146113185760405162461bcd60e51b815260206004820152600d60248201526c2737ba1027232a1037bbb732b960991b604482015260640161015e565b5f87878787876040516020016113329594939291906118d3565b60405160208183030381529060405280519060200120905061138d600454828585808060200260200160405190810160405280939291908181526020018383602002808284375f9201919091525092949392505061142d9050565b6113c95760405162461bcd60e51b815260206004820152600d60248201526c24b73b30b634b210383937b7b360991b604482015260640161015e565b5050505050505050565b6005545f9081526007602090815260408083208584529091529020805460ff191660011790556106b26001600160a01b037f000000000000000000000000b33522fa127a73ed4afc43500bbf56c5abbf45bb163383610f92565b5f826114398584611503565b14949350505050565b5f5f60205f8451602086015f885af180611461576040513d5f823e3d81fd5b50505f513d91508115611478578060011415611485565b6001600160a01b0384163b155b156114ae57604051635274afe760e01b81526001600160a01b038516600482015260240161015e565b50505050565b5f80546001600160a01b038381166001600160a01b0319831681178455604051919092169283917f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e09190a35050565b5f81815b845181101561153d576115338286838151811061152657611526611848565b6020026020010151611545565b9150600101611507565b509392505050565b5f81831061155f575f82815260208490526040902061156d565b5f8381526020839052604090205b9392505050565b5f60208284031215611584575f5ffd5b5035919050565b5f5f6040838503121561159c575f5ffd5b50508035926020909101359150565b6001600160a01b038116811461070a575f5ffd5b5f602082840312156115cf575f5ffd5b813561156d816115ab565b803580151581146115e9575f5ffd5b919050565b5f5f83601f8401126115fe575f5ffd5b50813567ffffffffffffffff811115611615575f5ffd5b6020830191508360208260051b850101111561162f575f5ffd5b9250929050565b5f5f5f5f5f5f5f60a0888a03121561164c575f5ffd5b87359650602088013567ffffffffffffffff811115611669575f5ffd5b8801601f81018a13611679575f5ffd5b803567ffffffffffffffff81111561168f575f5ffd5b8a60208284010111156116a0575f5ffd5b602091909101965094506116b6604089016115da565b935060608801359250608088013567ffffffffffffffff8111156116d8575f5ffd5b6116e48a828b016115ee565b989b979a50959850939692959293505050565b5f5f5f5f5f5f5f5f5f5f60a08b8d031215611710575f5ffd5b8a3567ffffffffffffffff811115611726575f5ffd5b6117328d828e016115ee565b909b5099505060208b013567ffffffffffffffff811115611751575f5ffd5b61175d8d828e016115ee565b90995097505060408b013567ffffffffffffffff81111561177c575f5ffd5b6117888d828e016115ee565b90975095505060608b013567ffffffffffffffff8111156117a7575f5ffd5b6117b38d828e016115ee565b90955093505060808b013567ffffffffffffffff8111156117d2575f5ffd5b6117de8d828e016115ee565b915080935050809150509295989b9194979a5092959850565b634e487b7160e01b5f52601160045260245ffd5b80820180821115610530576105306117f7565b5f6020828403121561182e575f5ffd5b5051919050565b81810381811115610530576105306117f7565b634e487b7160e01b5f52603260045260245ffd5b5f6020828403121561186c575f5ffd5b815161156d816115ab565b5f5f8335601e1984360301811261188c575f5ffd5b83018035915067ffffffffffffffff8211156118a6575f5ffd5b60200191503681900382131561162f575f5ffd5b5f602082840312156118ca575f5ffd5b61156d826115da565b8581528385602083013791151560f81b929091016020810192909252602182015260410192915050565b5f5f8335601e19843603018112611912575f5ffd5b83018035915067ffffffffffffffff82111561192c575f5ffd5b6020019150600581901b360382131561162f575f5ffdfea2646970667358221220070b323687b656b97acbabee5f1e62b43de23688b189e8b3c2650d87fd0b457064736f6c634300081d0033

000000000000000000000000b33522fa127a73ed4afc43500bbf56c5abbf45bb000000000000000000000000347af8252640b26887182f84ce3191549d3eab41

-----Decoded View---------------
Arg [0] : _rewardToken (address): 0xb33522fA127A73ed4Afc43500bBF56C5abBf45bB
Arg [1] : _nftCollection (address): 0x347Af8252640b26887182F84CE3191549D3EAb41

-----Encoded View---------------
2 Constructor Arguments found :
Arg [0] : 000000000000000000000000b33522fa127a73ed4afc43500bbf56c5abbf45bb
Arg [1] : 000000000000000000000000347af8252640b26887182f84ce3191549d3eab41

60699:14433:0:-:0;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;74539:26;;-1:-1:-1;;;74539:26:0;;216:2:1;74539:26:0;;;198:21:1;255:2;235:18;;;228:30;-1:-1:-1;;;274:18:1;;;267:46;330:18;;74539:26:0;;;;;;;;60699:14433;;;;;;;;;;-1:-1:-1;74663:31:0;;-1:-1:-1;;;74663:31:0;;561:2:1;74663:31:0;;;543:21:1;600:2;580:18;;;573:30;639:23;619:18;;;612:51;680:18;;74663:31:0;359:345:1;61553:30:0;;;;;;;;;;;;;;;;;;;855:25:1;;;843:2;828:18;61553:30:0;;;;;;;;61429:25;;;;;;;;;;;;;;;;61169:48;;;;;;;;;;;;61210:7;61169:48;;70948:290;;;;;;;;;;-1:-1:-1;70948:290:0;;;;;:::i;:::-;;:::i;:::-;;61275:28;;;;;;;;;;-1:-1:-1;61275:28:0;;;;-1:-1:-1;;;;;61275:28:0;;;;;;-1:-1:-1;;;;;1484:55:1;;;1466:74;;1454:2;1439:18;61275:28:0;1304:242:1;74772:144:0;;;;;;;;;;-1:-1:-1;74772:144:0;;;;;:::i;:::-;;:::i;:::-;;;2067:14:1;;2060:22;2042:41;;2030:2;2015:18;74772:144:0;1902:187:1;71533:445:0;;;;;;;;;;-1:-1:-1;71533:445:0;;;;;:::i;:::-;;:::i;3396:103::-;;;;;;;;;;;;;:::i;6524:235::-;;;;;;;;;;;;;:::i;74924:203::-;;;;;;;;;;;;;:::i;2721:87::-;;;;;;;;;;-1:-1:-1;2767:7:0;2794:6;-1:-1:-1;;;;;2794:6:0;2721:87;;61651:35;;;;;;;;;;;;;;;;61060:37;;;;;;;;;;;;;;;70220:335;;;;;;;;;;-1:-1:-1;70220:335:0;;;;;:::i;:::-;;:::i;61835:62::-;;;;;;;;;;-1:-1:-1;61835:62:0;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;;;;;64445:1038;;;;;;;;;;-1:-1:-1;64445:1038:0;;;;;:::i;:::-;;:::i;66425:528::-;;;;;;;;;;-1:-1:-1;66425:528:0;;;;;:::i;:::-;;:::i;5485:101::-;;;;;;;;;;-1:-1:-1;5565:13:0;;-1:-1:-1;;;;;5565:13:0;5485:101;;5912:181;;;;;;;;;;-1:-1:-1;5912:181:0;;;;;:::i;:::-;;:::i;67625:2130::-;;;;;;;;;;-1:-1:-1;67625:2130:0;;;;;:::i;:::-;;:::i;70948:290::-;2607:13;:11;:13::i;:::-;61210:7:::1;71048:15;;:32;;;;:::i;:::-;71030:15;:50;71022:75;;;::::0;-1:-1:-1;;;71022:75:0;;7119:2:1;71022:75:0::1;::::0;::::1;7101:21:1::0;7158:2;7138:18;;;7131:30;-1:-1:-1;;;7177:18:1;;;7170:42;7229:18;;71022:75:0::1;6917:336:1::0;71022:75:0::1;71116:8:::0;71108:47:::1;;;::::0;-1:-1:-1;;;71108:47:0;;7460:2:1;71108:47:0::1;::::0;::::1;7442:21:1::0;7499:2;7479:18;;;7472:30;-1:-1:-1;;;7518:18:1;;;7511:42;7570:18;;71108:47:0::1;7258:336:1::0;71108:47:0::1;71166:10;:21:::0;;;71203:27:::1;::::0;855:25:1;;;71203:27:0::1;::::0;843:2:1;828:18;71203:27:0::1;;;;;;;;70948:290:::0;:::o;74772:144::-;74854:4;74878:21;;;:10;:21;;;;;;;;:30;;;;;;;;;;;74772:144;;;;;:::o;71533:445::-;2607:13;:11;:13::i;:::-;71624:12:::1;-1:-1:-1::0;;;;;71614:22:0::1;:6;-1:-1:-1::0;;;;;71614:22:0::1;;;:93;;;;61210:7;71675:15;;:32;;;;:::i;:::-;71657:15;:50;71614:93;71606:142;;;::::0;-1:-1:-1;;;71606:142:0;;7801:2:1;71606:142:0::1;::::0;::::1;7783:21:1::0;7840:2;7820:18;;;7813:30;7879:21;7859:18;;;7852:49;7918:18;;71606:142:0::1;7599:343:1::0;71606:142:0::1;71777:39;::::0;-1:-1:-1;;;71777:39:0;;71810:4:::1;71777:39;::::0;::::1;1466:74:1::0;71759:15:0::1;::::0;-1:-1:-1;;;;;71777:24:0;::::1;::::0;::::1;::::0;1439:18:1;;71777:39:0::1;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;71759:57:::0;-1:-1:-1;71832:11:0;;71828:143:::1;;71860:45;71888:7;2767::::0;2794:6;-1:-1:-1;;;;;2794:6:0;;2721:87;71888:7:::1;-1:-1:-1::0;;;;;71860:27:0;::::1;::::0;71897:7;71860:27:::1;:45::i;:::-;71925:34;::::0;;-1:-1:-1;;;;;8328:55:1;;8310:74;;8415:2;8400:18;;8393:34;;;71925::0::1;::::0;8283:18:1;71925:34:0::1;;;;;;;71828:143;71595:383;71533:445:::0;:::o;3396:103::-;2607:13;:11;:13::i;:::-;3461:30:::1;3488:1;3461:18;:30::i;:::-;3396:103::o:0;6524:235::-;5565:13;;810:10;;-1:-1:-1;;;;;5565:13:0;6621:24;;6617:98;;6669:34;;-1:-1:-1;;;6669:34:0;;-1:-1:-1;;;;;1484:55:1;;6669:34:0;;;1466:74:1;1439:18;;6669:34:0;1304:242:1;6617:98:0;6725:26;6744:6;6725:18;:26::i;:::-;6566:193;6524:235::o;74924:203::-;74976:7;61210;75015:15;;:32;;;;:::i;:::-;74996:15;:51;74992:65;;-1:-1:-1;75056:1:0;;74924:203::o;74992:65::-;75108:15;61210:7;75072:15;;:32;;;;:::i;:::-;75071:52;;;;:::i;:::-;75064:59;;74924:203;:::o;70220:335::-;2607:13;:11;:13::i;:::-;61210:7:::1;70329:15;;:32;;;;:::i;:::-;70311:15;:50;70303:75;;;::::0;-1:-1:-1;;;70303:75:0;;7119:2:1;70303:75:0::1;::::0;::::1;7101:21:1::0;7158:2;7138:18;;;7131:30;-1:-1:-1;;;7177:18:1;;;7170:42;7229:18;;70303:75:0::1;6917:336:1::0;70303:75:0::1;-1:-1:-1::0;;;;;70397:28:0;::::1;70389:56;;;::::0;-1:-1:-1;;;70389:56:0;;8773:2:1;70389:56:0::1;::::0;::::1;8755:21:1::0;8812:2;8792:18;;;8785:30;-1:-1:-1;;;8831:18:1;;;8824:45;8886:18;;70389:56:0::1;8571:339:1::0;70389:56:0::1;70456:13;:39:::0;;-1:-1:-1;;;;;;70456:39:0::1;-1:-1:-1::0;;;;;70456:39:0;::::1;::::0;;::::1;::::0;;;70511:36:::1;::::0;1466:74:1;;;70511:36:0::1;::::0;1454:2:1;1439:18;70511:36:0::1;1304:242:1::0;64445:1038:0;2607:13;:11;:13::i;:::-;61210:7:::1;64572:15;;:32;;;;:::i;:::-;64554:15;:50;64546:84;;;::::0;-1:-1:-1;;;64546:84:0;;9117:2:1;64546:84:0::1;::::0;::::1;9099:21:1::0;9156:2;9136:18;;;9129:30;9195:23;9175:18;;;9168:51;9236:18;;64546:84:0::1;8915:345:1::0;64546:84:0::1;64667:1;64649:15;:19;64641:62;;;::::0;-1:-1:-1;;;64641:62:0;;9467:2:1;64641:62:0::1;::::0;::::1;9449:21:1::0;9506:2;9486:18;;;9479:30;9545:32;9525:18;;;9518:60;9595:18;;64641:62:0::1;9265:354:1::0;64641:62:0::1;64792:24;:22;:24::i;:::-;64851:45;::::0;-1:-1:-1;;;64851:45:0;;64890:4:::1;64851:45;::::0;::::1;1466:74:1::0;64900:15:0;;64858:12:::1;-1:-1:-1::0;;;;;64851:30:0::1;::::0;::::1;::::0;1439:18:1;;64851:45:0::1;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;:64;;64829:140;;;::::0;-1:-1:-1;;;64829:140:0;;9826:2:1;64829:140:0::1;::::0;::::1;9808:21:1::0;9865:2;9845:18;;;9838:30;9904:28;9884:18;;;9877:56;9950:18;;64829:140:0::1;9624:350:1::0;64829:140:0::1;65079:15;65061;:33:::0;;;65268:10:::1;:24:::0;;;65303:20:::1;:38:::0;;;65410:65:::1;::::0;855:25:1;;;65268:24:0;;65079:15;65410:65:::1;::::0;843:2:1;828:18;65410:65:0::1;;;;;;;64445:1038:::0;;:::o;66425:528::-;9111:21;:19;:21::i;:::-;66688:56:::1;66703:7;66712:6;;66720:8;66730:6;66738:5;;66688:14;:56::i;:::-;66831:30;66845:7;66854:6;66831:13;:30::i;:::-;66921:24;:22;:24::i;:::-;9155:20:::0;8549:1;9675:7;:22;9492:213;9155:20;66425:528;;;;;;;:::o;5912:181::-;2607:13;:11;:13::i;:::-;6002::::1;:24:::0;;-1:-1:-1;;;;;6002:24:0;::::1;-1:-1:-1::0;;;;;;6002:24:0;;::::1;::::0;::::1;::::0;;;6067:7:::1;2767::::0;2794:6;-1:-1:-1;;;;;2794:6:0;;2721:87;6067:7:::1;-1:-1:-1::0;;;;;6042:43:0::1;;;;;;;;;;;5912:181:::0;:::o;67625:2130::-;9111:21;:19;:21::i;:::-;61210:7:::1;67968:15;;:32;;;;:::i;:::-;67949:15;:51;;67941:82;;;::::0;-1:-1:-1;;;67941:82:0;;10181:2:1;67941:82:0::1;::::0;::::1;10163:21:1::0;10220:2;10200:18;;;10193:30;-1:-1:-1;;;10239:18:1;;;10232:48;10297:18;;67941:82:0::1;9979:342:1::0;67941:82:0::1;68042:19:::0;68034:49:::1;;;::::0;-1:-1:-1;;;68034:49:0;;10528:2:1;68034:49:0::1;::::0;::::1;10510:21:1::0;10567:2;10547:18;;;10540:30;10606:19;10586:18;;;10579:47;10643:18;;68034:49:0::1;10326:341:1::0;68034:49:0::1;68116:33:::0;;::::1;:82:::0;::::1;;;-1:-1:-1::0;68166:32:0;;::::1;68116:82;:133;;;;-1:-1:-1::0;68215:34:0;;::::1;68116:133;:185;;;;-1:-1:-1::0;68266:35:0;;::::1;68116:185;68094:256;;;::::0;-1:-1:-1;;;68094:256:0;;10874:2:1;68094:256:0::1;::::0;::::1;10856:21:1::0;10913:2;10893:18;;;10886:30;10952:23;10932:18;;;10925:51;10993:18;;68094:256:0::1;10672:345:1::0;68094:256:0::1;68363:19;::::0;68395:1144:::1;68415:19:::0;;::::1;68395:1144;;;68530:15;::::0;68519:27:::1;::::0;;;:10:::1;:27;::::0;;;;;68547:8;;68556:1;68547:11;;::::1;;;;;:::i;:::-;;::::0;;::::1;::::0;;;::::1;;68519:40:::0;;-1:-1:-1;68519:40:0;::::1;::::0;;;;;;-1:-1:-1;68519:40:0;;::::1;;68518:41;:93:::0;::::1;;;-1:-1:-1::0;68563:13:0::1;::::0;68601:10:::1;::::0;-1:-1:-1;;;;;68563:13:0::1;:21;68585:8:::0;;68594:1;68585:11;;::::1;;;;;:::i;:::-;;;;;;;68563:34;;;;;;;;;;;;;855:25:1::0;;843:2;828:18;;709:177;68563:34:0::1;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;-1:-1:-1::0;;;;;68563:48:0::1;;68518:93;68514:982;;;68712:12;68776:8;;68785:1;68776:11;;;;;;;:::i;:::-;;;;;;;68810:8;;68819:1;68810:11;;;;;;;:::i;:::-;;;;;;;;;;;;:::i;:::-;68844:9;;68854:1;68844:12;;;;;;;:::i;:::-;;;;;;;;;;;;;;:::i;:::-;68879:7;;68887:1;68879:10;;;;;;;:::i;:::-;;;;;;;68737:171;;;;;;;;;;;;:::i;:::-;;;;;;;;;;;;;68727:182;;;;;;68712:197;;69011:34;69028:10;;69040:4;69011:6;;69018:1;69011:9;;;;;;;:::i;:::-;;;;;;;;;;;;:::i;:::-;:16;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;::::0;::::1;::::0;;;;-1:-1:-1;69011:16:0;;:34;;-1:-1:-1;;69011:16:0::1;:34:::0;-1:-1:-1;69011:34:0:i:1;:::-;69007:474;;;69160:15;::::0;69149:27:::1;::::0;;;:10:::1;:27;::::0;;;;69192:4:::1;::::0;69177:8;;69186:1;69177:11;;::::1;;;;;:::i;:::-;;;;;;;69149:40;;;;;;;;;;;;:47;;;;;;;;;;;;;;;;;;69234:7;;69242:1;69234:10;;;;;;;:::i;:::-;;;;;;;69219:25;;;;;:::i;:::-;;;69400:15;;69387:8;;69396:1;69387:11;;;;;;;:::i;:::-;;;;;;;69375:10;-1:-1:-1::0;;;;;69361:67:0::1;;69417:7;;69425:1;69417:10;;;;;;;:::i;:::-;;;;;;;69361:67;;;;855:25:1::0;;843:2;828:18;;709:177;69361:67:0::1;;;;;;;;69007:474;68613:883;68514:982;69522:3;;68395:1144;;;;69573:1;69559:11;:15;69551:43;;;::::0;-1:-1:-1;;;69551:43:0;;13352:2:1;69551:43:0::1;::::0;::::1;13334:21:1::0;13391:2;13371:18;;;13364:30;-1:-1:-1;;;13410:18:1;;;13403:45;13465:18;;69551:43:0::1;13150:339:1::0;69551:43:0::1;69605:58;-1:-1:-1::0;;;;;69612:12:0::1;69605:33;69639:10;69651:11:::0;69605:33:::1;:58::i;:::-;69723:24;:22;:24::i;:::-;67860:1895;9155:20:::0;8549:1;9675:7;:22;9492:213;9155:20;67625:2130;;;;;;;;;;:::o;2886:166::-;2767:7;2794:6;-1:-1:-1;;;;;2794:6:0;810:10;2946:23;2942:103;;2993:40;;-1:-1:-1;;;2993:40:0;;810:10;2993:40;;;1466:74:1;1439:18;;2993:40:0;1304:242:1;19847:162:0;19957:43;;;-1:-1:-1;;;;;8328:55:1;;19957:43:0;;;8310:74:1;8400:18;;;;8393:34;;;19957:43:0;;;;;;;;;;8283:18:1;;;;19957:43:0;;;;;;;;;;-1:-1:-1;;;19957:43:0;;;19930:71;;19950:5;;19930:19;:71::i;:::-;19847:162;;;:::o;6283:156::-;6373:13;6366:20;;-1:-1:-1;;;;;;6366:20:0;;;6397:34;6422:8;6397:24;:34::i;73868:400::-;61210:7;73944:15;;:32;;;;:::i;:::-;73926:15;:50;:73;;;;;73998:1;73980:15;;:19;73926:73;73922:339;;;74035:45;;-1:-1:-1;;;74035:45:0;;74074:4;74035:45;;;1466:74:1;74017:15:0;;74042:12;-1:-1:-1;;;;;74035:30:0;;;;1439:18:1;;74035:45:0;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;74017:63;-1:-1:-1;74100:11:0;;74096:154;;74132:51;74166:7;2767;2794:6;-1:-1:-1;;;;;2794:6:0;;2721:87;74166:7;-1:-1:-1;;;;;74139:12:0;74132:33;;74175:7;74132:33;:51::i;:::-;74207:27;;855:25:1;;;74207:27:0;;843:2:1;828:18;74207:27:0;709:177:1;9191:293:0;8593:1;9325:7;;:19;9317:63;;;;-1:-1:-1;;;9317:63:0;;13696:2:1;9317:63:0;;;13678:21:1;13735:2;13715:18;;;13708:30;13774:33;13754:18;;;13747:61;13825:18;;9317:63:0;13494:355:1;9317:63:0;8593:1;9458:18;;9191:293::o;72387:825::-;61210:7;72613:15;;:32;;;;:::i;:::-;72594:15;:51;;72586:82;;;;-1:-1:-1;;;72586:82:0;;10181:2:1;72586:82:0;;;10163:21:1;10220:2;10200:18;;;10193:30;-1:-1:-1;;;10239:18:1;;;10232:48;10297:18;;72586:82:0;9979:342:1;72586:82:0;72756:15;;72745:27;;;;:10;:27;;;;;;;;:36;;;;;;;;;;;72744:37;72736:87;;;;-1:-1:-1;;;72736:87:0;;14056:2:1;72736:87:0;;;14038:21:1;14095:2;14075:18;;;14068:30;14134:34;14114:18;;;14107:62;-1:-1:-1;;;14185:18:1;;;14178:35;14230:19;;72736:87:0;13854:401:1;72736:87:0;72842:13;;:30;;-1:-1:-1;;;72842:30:0;;;;;855:25:1;;;72876:10:0;;-1:-1:-1;;;;;72842:13:0;;:21;;828:18:1;;72842:30:0;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;-1:-1:-1;;;;;72842:44:0;;72834:70;;;;-1:-1:-1;;;72834:70:0;;14462:2:1;72834:70:0;;;14444:21:1;14501:2;14481:18;;;14474:30;-1:-1:-1;;;14520:18:1;;;14513:43;14573:18;;72834:70:0;14260:337:1;72834:70:0;72989:12;73031:7;73040:6;;73048:8;73058:6;73014:51;;;;;;;;;;;;:::i;:::-;;;;;;;;;;;;;73004:62;;;;;;72989:77;;73156:30;73169:10;;73181:4;73156:5;;:12;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;-1:-1:-1;73156:12:0;;:30;;-1:-1:-1;;73156:12:0;:30;-1:-1:-1;73156:30:0:i;:::-;73148:56;;;;-1:-1:-1;;;73148:56:0;;14804:2:1;73148:56:0;;;14786:21:1;14843:2;14823:18;;;14816:30;-1:-1:-1;;;14862:18:1;;;14855:43;14915:18;;73148:56:0;14602:337:1;73148:56:0;72575:637;72387:825;;;;;;;:::o;73324:327::-;73478:15;;73467:27;;;;:10;:27;;;;;;;;:36;;;;;;;;:43;;-1:-1:-1;;73467:43:0;73506:4;73467:43;;;73521:53;-1:-1:-1;;;;;73528:12:0;73521:33;73555:10;73567:6;73521:33;:53::i;36966:156::-;37057:4;37110;37081:25;37094:5;37101:4;37081:12;:25::i;:::-;:33;;36966:156;-1:-1:-1;;;;36966:156:0:o;27138:738::-;27219:18;27248:19;27388:4;27385:1;27378:4;27372:11;27365:4;27359;27355:15;27352:1;27345:5;27338;27333:60;27447:7;27437:180;;27492:4;27486:11;27538:16;27535:1;27530:3;27515:40;27585:16;27580:3;27573:29;27437:180;-1:-1:-1;;27696:1:0;27690:8;27645:16;;-1:-1:-1;27725:15:0;;:68;;27777:11;27792:1;27777:16;;27725:68;;;-1:-1:-1;;;;;27743:26:0;;;:31;27725:68;27721:148;;;27817:40;;-1:-1:-1;;;27817:40:0;;-1:-1:-1;;;;;1484:55:1;;27817:40:0;;;1466:74:1;1439:18;;27817:40:0;1304:242:1;27721:148:0;27208:668;;27138:738;;:::o;4034:191::-;4108:16;4127:6;;-1:-1:-1;;;;;4144:17:0;;;-1:-1:-1;;;;;;4144:17:0;;;;;;4177:40;;4127:6;;;;;;;4177:40;;4108:16;4177:40;4097:128;4034:191;:::o;37533:314::-;37616:7;37659:4;37616:7;37674:136;37698:5;:12;37694:1;:16;37674:136;;;37747:51;37775:12;37789:5;37795:1;37789:8;;;;;;;;:::i;:::-;;;;;;;37747:27;:51::i;:::-;37732:66;-1:-1:-1;37712:3:0;;37674:136;;;-1:-1:-1;37827:12:0;37533:314;-1:-1:-1;;;37533:314:0:o;34472:169::-;34547:7;34578:1;34574;:5;:59;;34839:13;34905:15;;;34941:4;34934:15;;;34988:4;34972:21;;34574:59;;;34839:13;34905:15;;;34941:4;34934:15;;;34988:4;34972:21;;34582:24;34567:66;34472:169;-1:-1:-1;;;34472:169:0:o;1073:226:1:-;1132:6;1185:2;1173:9;1164:7;1160:23;1156:32;1153:52;;;1201:1;1198;1191:12;1153:52;-1:-1:-1;1246:23:1;;1073:226;-1:-1:-1;1073:226:1:o;1551:346::-;1619:6;1627;1680:2;1668:9;1659:7;1655:23;1651:32;1648:52;;;1696:1;1693;1686:12;1648:52;-1:-1:-1;;1741:23:1;;;1861:2;1846:18;;;1833:32;;-1:-1:-1;1551:346:1:o;2094:154::-;-1:-1:-1;;;;;2173:5:1;2169:54;2162:5;2159:65;2149:93;;2238:1;2235;2228:12;2253:247;2312:6;2365:2;2353:9;2344:7;2340:23;2336:32;2333:52;;;2381:1;2378;2371:12;2333:52;2420:9;2407:23;2439:31;2464:5;2439:31;:::i;3087:160::-;3152:20;;3208:13;;3201:21;3191:32;;3181:60;;3237:1;3234;3227:12;3181:60;3087:160;;;:::o;3252:367::-;3315:8;3325:6;3379:3;3372:4;3364:6;3360:17;3356:27;3346:55;;3397:1;3394;3387:12;3346:55;-1:-1:-1;3420:20:1;;3463:18;3452:30;;3449:50;;;3495:1;3492;3485:12;3449:50;3532:4;3524:6;3520:17;3508:29;;3592:3;3585:4;3575:6;3572:1;3568:14;3560:6;3556:27;3552:38;3549:47;3546:67;;;3609:1;3606;3599:12;3546:67;3252:367;;;;;:::o;3624:1222::-;3755:6;3763;3771;3779;3787;3795;3803;3856:3;3844:9;3835:7;3831:23;3827:33;3824:53;;;3873:1;3870;3863:12;3824:53;3918:23;;;-1:-1:-1;4016:2:1;4001:18;;3988:32;4043:18;4032:30;;4029:50;;;4075:1;4072;4065:12;4029:50;4098:22;;4151:4;4143:13;;4139:27;-1:-1:-1;4129:55:1;;4180:1;4177;4170:12;4129:55;4220:2;4207:16;4246:18;4238:6;4235:30;4232:50;;;4278:1;4275;4268:12;4232:50;4323:7;4318:2;4309:6;4305:2;4301:15;4297:24;4294:37;4291:57;;;4344:1;4341;4334:12;4291:57;4375:2;4367:11;;;;;-1:-1:-1;4397:6:1;-1:-1:-1;4422:35:1;4453:2;4438:18;;4422:35;:::i;:::-;4412:45;-1:-1:-1;4530:2:1;4515:18;;4502:32;;-1:-1:-1;4613:3:1;4598:19;;4585:33;4643:18;4630:32;;4627:52;;;4675:1;4672;4665:12;4627:52;4714:72;4778:7;4767:8;4756:9;4752:24;4714:72;:::i;:::-;3624:1222;;;;-1:-1:-1;3624:1222:1;;-1:-1:-1;3624:1222:1;;;;4688:98;;-1:-1:-1;;;3624:1222:1:o;4851:1799::-;5117:6;5125;5133;5141;5149;5157;5165;5173;5181;5189;5242:3;5230:9;5221:7;5217:23;5213:33;5210:53;;;5259:1;5256;5249:12;5210:53;5299:9;5286:23;5332:18;5324:6;5321:30;5318:50;;;5364:1;5361;5354:12;5318:50;5403:70;5465:7;5456:6;5445:9;5441:22;5403:70;:::i;:::-;5492:8;;-1:-1:-1;5377:96:1;-1:-1:-1;;5580:2:1;5565:18;;5552:32;5609:18;5596:32;;5593:52;;;5641:1;5638;5631:12;5593:52;5680:72;5744:7;5733:8;5722:9;5718:24;5680:72;:::i;:::-;5771:8;;-1:-1:-1;5654:98:1;-1:-1:-1;;5859:2:1;5844:18;;5831:32;5888:18;5875:32;;5872:52;;;5920:1;5917;5910:12;5872:52;5959:72;6023:7;6012:8;6001:9;5997:24;5959:72;:::i;:::-;6050:8;;-1:-1:-1;5933:98:1;-1:-1:-1;;6138:2:1;6123:18;;6110:32;6167:18;6154:32;;6151:52;;;6199:1;6196;6189:12;6151:52;6238:72;6302:7;6291:8;6280:9;6276:24;6238:72;:::i;:::-;6329:8;;-1:-1:-1;6212:98:1;-1:-1:-1;;6417:3:1;6402:19;;6389:33;6447:18;6434:32;;6431:52;;;6479:1;6476;6469:12;6431:52;6518:72;6582:7;6571:8;6560:9;6556:24;6518:72;:::i;:::-;6492:98;;6609:8;6599:18;;;6636:8;6626:18;;;4851:1799;;;;;;;;;;;;;:::o;6655:127::-;6716:10;6711:3;6707:20;6704:1;6697:31;6747:4;6744:1;6737:15;6771:4;6768:1;6761:15;6787:125;6852:9;;;6873:10;;;6870:36;;;6886:18;;:::i;7947:184::-;8017:6;8070:2;8058:9;8049:7;8045:23;8041:32;8038:52;;;8086:1;8083;8076:12;8038:52;-1:-1:-1;8109:16:1;;7947:184;-1:-1:-1;7947:184:1:o;8438:128::-;8505:9;;;8526:11;;;8523:37;;;8540:18;;:::i;11022:127::-;11083:10;11078:3;11074:20;11071:1;11064:31;11114:4;11111:1;11104:15;11138:4;11135:1;11128:15;11154:251;11224:6;11277:2;11265:9;11256:7;11252:23;11248:32;11245:52;;;11293:1;11290;11283:12;11245:52;11325:9;11319:16;11344:31;11369:5;11344:31;:::i;11410:522::-;11488:4;11494:6;11554:11;11541:25;11648:2;11644:7;11633:8;11617:14;11613:29;11609:43;11589:18;11585:68;11575:96;;11667:1;11664;11657:12;11575:96;11694:33;;11746:20;;;-1:-1:-1;11789:18:1;11778:30;;11775:50;;;11821:1;11818;11811:12;11775:50;11854:4;11842:17;;-1:-1:-1;11885:14:1;11881:27;;;11871:38;;11868:58;;;11922:1;11919;11912:12;11937:180;11993:6;12046:2;12034:9;12025:7;12021:23;12017:32;12014:52;;;12062:1;12059;12052:12;12014:52;12085:26;12101:9;12085:26;:::i;12122:473::-;12371:6;12366:3;12359:19;12422:6;12414;12409:2;12404:3;12400:12;12387:42;12509:14;;12502:22;12497:3;12493:32;12448:16;;;;12488:2;12480:11;;12473:53;;;;12550:2;12542:11;;12535:27;12586:2;12578:11;;;-1:-1:-1;;12122:473:1:o;12600:545::-;12693:4;12699:6;12759:11;12746:25;12853:2;12849:7;12838:8;12822:14;12818:29;12814:43;12794:18;12790:68;12780:96;;12872:1;12869;12862:12;12780:96;12899:33;;12951:20;;;-1:-1:-1;12994:18:1;12983:30;;12980:50;;;13026:1;13023;13016:12;12980:50;13059:4;13047:17;;-1:-1:-1;13110:1:1;13106:14;;;13090;13086:35;13076:46;;13073:66;;;13135:1;13132;13125:12

ipfs://070b323687b656b97acbabee5f1e62b43de23688b189e8b3c2650d87fd0b4570