Contract

Contract Source Code (Solidity Standard Json-Input format)

IDE

• Blockscan IDE
• 🤖 Code ReaderBeta
• Remix IDE

More Options

• Similar
• Sol2Uml
• Submit Audit
• Compare

// SPDX-License-Identifier: MIT
pragma solidity 0.8.19;
import {ERC721Holder} from "@openzeppelin/contracts/token/ERC721/utils/ERC721Holder.sol";
import {EnumerableSet} from "@openzeppelin/contracts/utils/structs/EnumerableSet.sol";
import {Pausable} from "@openzeppelin/contracts/security/Pausable.sol";
import {HasSignature} from "../core/HasSignature.sol";
import {TimeChecker} from "../utils/TimeChecker.sol";

interface INFT {
  function mint(address to, uint256 tokenID) external;
  function transferFrom(address from, address to, uint256 tokenId) external;
}

contract NFTLockMain is ERC721Holder, HasSignature, TimeChecker, Pausable {
  using EnumerableSet for EnumerableSet.UintSet;

  uint256 public immutable _CACHED_CHAIN_ID;
  address public immutable _CACHED_THIS;
  address public verifier;
  uint256 public maxBatch = 100;

  struct NFTInfo {
    uint256 tokenId;
    address to;
    bool isMint;
  }
  mapping(address nft => mapping(uint256 tokenId => address user)) public addressOriginal;
  mapping(address nft => mapping(address user => EnumerableSet.UintSet tokenIdSet)) private lockedRecords;
  mapping(address nft => bool status) public supportNftList;

  event UnLock(address indexed nft, address indexed user, uint256 nonce, NFTInfo[] nftList);
  event Lock(address indexed nft, address indexed sender, address indexed to, uint256[] tokenIds);
  event VerifierUpdated(address indexed verifier);

  constructor(uint256 _duration, address _verifier) TimeChecker(_duration) {
    _CACHED_CHAIN_ID = block.chainid;
    _CACHED_THIS = address(this);
    verifier = _verifier;
  }
  /**
   * lock NFT
   * from eoa only
   * @param nft nft address
   * @param to passport address for game
   * @param tokenIds nft token id list
   */
  function lock(address nft, address to, uint256[] calldata tokenIds) external whenNotPaused{
    require(tokenIds.length <= maxBatch, "tokenIds too many");
    require(to != address(0), "passport can't be zero");
    require(supportNftList[nft], "not support nft");
    address _sender = _msgSender();
    for (uint256 i = 0; i < tokenIds.length; i++) {
      addressOriginal[nft][tokenIds[i]] = _sender;
      lockedRecords[nft][_sender].add(tokenIds[i]);
      INFT(nft).transferFrom(_sender, address(this), tokenIds[i]);
    }
    emit Lock(nft, _sender, to, tokenIds);
  }
  /**
   * @dev unlock or mint nft
   * from passport only
   * if tokenId not exists, mint it
   * if exists and user is owner, unlock it
   */
  function unlockOrMint(
    address nft,
    NFTInfo[] calldata nftList,
    uint256 signTime,
    uint256 saltNonce,
    bytes calldata signature
  ) external signatureValid(signature) timeValid(signTime) {
    require(nftList.length <= maxBatch, "tokenIds too many");
    address _sender = _msgSender();
    bytes32 messageHash = getMessageHash(_sender, nft, nftList, _CACHED_THIS, _CACHED_CHAIN_ID, signTime, saltNonce);
    checkSigner(verifier, messageHash, signature);
    _useSignature(signature);
    for (uint256 i = 0; i < nftList.length; i++) {
      if (nftList[i].isMint) {
        INFT(nft).mint(nftList[i].to, nftList[i].tokenId);
      } else {
        require(addressOriginal[nft][nftList[i].tokenId] == _sender, "not owner");
        delete addressOriginal[nft][nftList[i].tokenId];
        lockedRecords[nft][_sender].remove(nftList[i].tokenId);
        INFT(nft).transferFrom(address(this), nftList[i].to, nftList[i].tokenId);
      }
    }
    emit UnLock(nft, _sender, saltNonce, nftList);
  }

  /**
   * @dev unlock nft
   * from game svr only
   */
  function unlockWithSvr(address nft, uint256[] calldata tokenIds) external onlyOwner{
    require(tokenIds.length <= maxBatch, "tokenIds too many");
    for (uint256 i = 0; i < tokenIds.length; i++) {
      address _sender = addressOriginal[nft][tokenIds[i]];
      delete addressOriginal[nft][tokenIds[i]];
      lockedRecords[nft][_sender].remove(tokenIds[i]);
      INFT(nft).transferFrom(address(this), _sender, tokenIds[i]);
    }
  }

  /** ------get------- **/
  function lockedNum(address token, address user) public view returns (uint256) {
    return lockedRecords[token][user].length();
  }

  function lockedNft(address token, address user) public view returns (uint256[] memory) {
    return lockedRecords[token][user].values();
  }

  function updateBatch(uint256 _maxBatch) external onlyOwner {
    maxBatch = _maxBatch;
  }

  function addSupportNftList(address[] calldata nftList) external onlyOwner {
    for (uint256 i = 0; i < nftList.length; i++) {
      supportNftList[nftList[i]] = true;
    }
  }
  function removeSupportNft(address nftAddress) external onlyOwner {
    require(supportNftList[nftAddress], "can't remove");
    delete supportNftList[nftAddress];
  }

  /**
   * @dev update verifier address
   */
  function updateVerifier(address _verifier) external onlyOwner {
    require(_verifier != address(0), "NFTClaimer: address can not be zero");
    verifier = _verifier;
    emit VerifierUpdated(_verifier);
  }

  function getMessageHash(
    address _to,
    address _nft,
    NFTInfo[] memory _ids,
    address _contract,
    uint256 _chainId,
    uint256 _signTime,
    uint256 _saltNonce
  ) public pure returns (bytes32) {
    bytes memory encoded = abi.encodePacked(_to, _nft, _contract, _chainId, _signTime, _saltNonce);
    for (uint256 i = 0; i < _ids.length; ++i) {
      encoded = bytes.concat(encoded, abi.encodePacked(_ids[i].tokenId));
      encoded = bytes.concat(encoded, abi.encodePacked(_ids[i].to));
      encoded = bytes.concat(encoded, abi.encodePacked(_ids[i].isMint));
    }
    return keccak256(encoded);
  }
}

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

pragma solidity ^0.8.0;

import "../utils/Context.sol";

/**
 * @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.
 *
 * By default, the owner account will be the one that deploys the contract. 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;

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

    /**
     * @dev Initializes the contract setting the deployer as the initial owner.
     */
    constructor() {
        _transferOwnership(_msgSender());
    }

    /**
     * @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 {
        require(owner() == _msgSender(), "Ownable: caller is not the owner");
    }

    /**
     * @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 {
        require(newOwner != address(0), "Ownable: new owner is the zero address");
        _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);
    }
}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v4.7.0) (security/Pausable.sol)

pragma solidity ^0.8.0;

import "../utils/Context.sol";

/**
 * @dev Contract module which allows children to implement an emergency stop
 * mechanism that can be triggered by an authorized account.
 *
 * This module is used through inheritance. It will make available the
 * modifiers `whenNotPaused` and `whenPaused`, which can be applied to
 * the functions of your contract. Note that they will not be pausable by
 * simply including this module, only once the modifiers are put in place.
 */
abstract contract Pausable is Context {
    /**
     * @dev Emitted when the pause is triggered by `account`.
     */
    event Paused(address account);

    /**
     * @dev Emitted when the pause is lifted by `account`.
     */
    event Unpaused(address account);

    bool private _paused;

    /**
     * @dev Initializes the contract in unpaused state.
     */
    constructor() {
        _paused = false;
    }

    /**
     * @dev Modifier to make a function callable only when the contract is not paused.
     *
     * Requirements:
     *
     * - The contract must not be paused.
     */
    modifier whenNotPaused() {
        _requireNotPaused();
        _;
    }

    /**
     * @dev Modifier to make a function callable only when the contract is paused.
     *
     * Requirements:
     *
     * - The contract must be paused.
     */
    modifier whenPaused() {
        _requirePaused();
        _;
    }

    /**
     * @dev Returns true if the contract is paused, and false otherwise.
     */
    function paused() public view virtual returns (bool) {
        return _paused;
    }

    /**
     * @dev Throws if the contract is paused.
     */
    function _requireNotPaused() internal view virtual {
        require(!paused(), "Pausable: paused");
    }

    /**
     * @dev Throws if the contract is not paused.
     */
    function _requirePaused() internal view virtual {
        require(paused(), "Pausable: not paused");
    }

    /**
     * @dev Triggers stopped state.
     *
     * Requirements:
     *
     * - The contract must not be paused.
     */
    function _pause() internal virtual whenNotPaused {
        _paused = true;
        emit Paused(_msgSender());
    }

    /**
     * @dev Returns to normal state.
     *
     * Requirements:
     *
     * - The contract must be paused.
     */
    function _unpause() internal virtual whenPaused {
        _paused = false;
        emit Unpaused(_msgSender());
    }
}

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

pragma solidity ^0.8.0;

/**
 * @title ERC721 token receiver interface
 * @dev Interface for any contract that wants to support safeTransfers
 * from ERC721 asset contracts.
 */
interface IERC721Receiver {
    /**
     * @dev Whenever an {IERC721} `tokenId` token is transferred to this contract via {IERC721-safeTransferFrom}
     * by `operator` from `from`, this function is called.
     *
     * It must return its Solidity selector to confirm the token transfer.
     * If any other value is returned or the interface is not implemented by the recipient, the transfer will be reverted.
     *
     * The selector can be obtained in Solidity with `IERC721Receiver.onERC721Received.selector`.
     */
    function onERC721Received(
        address operator,
        address from,
        uint256 tokenId,
        bytes calldata data
    ) external returns (bytes4);
}

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

pragma solidity ^0.8.0;

import "../IERC721Receiver.sol";

/**
 * @dev Implementation of the {IERC721Receiver} interface.
 *
 * Accepts all token transfers.
 * Make sure the contract is able to use its token with {IERC721-safeTransferFrom}, {IERC721-approve} or {IERC721-setApprovalForAll}.
 */
contract ERC721Holder is IERC721Receiver {
    /**
     * @dev See {IERC721Receiver-onERC721Received}.
     *
     * Always returns `IERC721Receiver.onERC721Received.selector`.
     */
    function onERC721Received(address, address, uint256, bytes memory) public virtual override returns (bytes4) {
        return this.onERC721Received.selector;
    }
}

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

pragma solidity ^0.8.0;

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

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

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

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

pragma solidity ^0.8.0;

import "../Strings.sol";

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

    function _throwError(RecoverError error) private pure {
        if (error == RecoverError.NoError) {
            return; // no error: do nothing
        } else if (error == RecoverError.InvalidSignature) {
            revert("ECDSA: invalid signature");
        } else if (error == RecoverError.InvalidSignatureLength) {
            revert("ECDSA: invalid signature length");
        } else if (error == RecoverError.InvalidSignatureS) {
            revert("ECDSA: invalid signature 's' value");
        }
    }

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

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

    /**
     * @dev Overload of {ECDSA-tryRecover} that receives the `r` and `vs` short-signature fields separately.
     *
     * See https://eips.ethereum.org/EIPS/eip-2098[EIP-2098 short signatures]
     *
     * _Available since v4.3._
     */
    function tryRecover(bytes32 hash, bytes32 r, bytes32 vs) internal pure returns (address, RecoverError) {
        bytes32 s = vs & bytes32(0x7fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff);
        uint8 v = uint8((uint256(vs) >> 255) + 27);
        return tryRecover(hash, v, r, s);
    }

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

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

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

        return (signer, RecoverError.NoError);
    }

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

    /**
     * @dev Returns an Ethereum Signed Message, created from a `hash`. This
     * produces hash corresponding to the one signed with the
     * https://eth.wiki/json-rpc/API#eth_sign[`eth_sign`]
     * JSON-RPC method as part of EIP-191.
     *
     * See {recover}.
     */
    function toEthSignedMessageHash(bytes32 hash) internal pure returns (bytes32 message) {
        // 32 is the length in bytes of hash,
        // enforced by the type signature above
        /// @solidity memory-safe-assembly
        assembly {
            mstore(0x00, "\x19Ethereum Signed Message:\n32")
            mstore(0x1c, hash)
            message := keccak256(0x00, 0x3c)
        }
    }

    /**
     * @dev Returns an Ethereum Signed Message, created from `s`. This
     * produces hash corresponding to the one signed with the
     * https://eth.wiki/json-rpc/API#eth_sign[`eth_sign`]
     * JSON-RPC method as part of EIP-191.
     *
     * See {recover}.
     */
    function toEthSignedMessageHash(bytes memory s) internal pure returns (bytes32) {
        return keccak256(abi.encodePacked("\x19Ethereum Signed Message:\n", Strings.toString(s.length), s));
    }

    /**
     * @dev Returns an Ethereum Signed Typed Data, created from a
     * `domainSeparator` and a `structHash`. This produces hash corresponding
     * to the one signed with the
     * https://eips.ethereum.org/EIPS/eip-712[`eth_signTypedData`]
     * JSON-RPC method as part of EIP-712.
     *
     * See {recover}.
     */
    function toTypedDataHash(bytes32 domainSeparator, bytes32 structHash) internal pure returns (bytes32 data) {
        /// @solidity memory-safe-assembly
        assembly {
            let ptr := mload(0x40)
            mstore(ptr, "\x19\x01")
            mstore(add(ptr, 0x02), domainSeparator)
            mstore(add(ptr, 0x22), structHash)
            data := keccak256(ptr, 0x42)
        }
    }

    /**
     * @dev Returns an Ethereum Signed Data with intended validator, created from a
     * `validator` and `data` according to the version 0 of EIP-191.
     *
     * See {recover}.
     */
    function toDataWithIntendedValidatorHash(address validator, bytes memory data) internal pure returns (bytes32) {
        return keccak256(abi.encodePacked("\x19\x00", validator, data));
    }
}

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

pragma solidity ^0.8.0;

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

pragma solidity ^0.8.0;

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

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

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

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

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

pragma solidity ^0.8.0;

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

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

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

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

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

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

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

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

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

pragma solidity ^0.8.0;

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

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

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

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

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

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

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

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

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

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

            return true;
        } else {
            return false;
        }
    }

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

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

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

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

    // Bytes32Set

    struct Bytes32Set {
        Set _inner;
    }

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

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

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

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

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

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

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

        return result;
    }

    // AddressSet

    struct AddressSet {
        Set _inner;
    }

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

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

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

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

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

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

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

        return result;
    }

    // UintSet

    struct UintSet {
        Set _inner;
    }

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

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

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

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

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

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

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

        return result;
    }
}

// SPDX-License-Identifier: MIT
pragma solidity 0.8.19;
import {ECDSA} from "@openzeppelin/contracts/utils/cryptography/ECDSA.sol";
import {Ownable} from "@openzeppelin/contracts/access/Ownable.sol";

contract HasSignature is Ownable {
  mapping(bytes signature => bool status) private _usedSignatures;

  function checkSigner(
    address signer,
    bytes32 hash,
    bytes memory signature
  ) public pure {
    bytes32 ethSignedMessageHash = ECDSA.toEthSignedMessageHash(hash);

    address recovered = ECDSA.recover(ethSignedMessageHash, signature);
    require(recovered == signer, "invalid signature");
  }

  modifier signatureValid(bytes calldata signature) {
    require(
      !_usedSignatures[signature],
      "signature used. please send another transaction with new signature"
    );
    _;
  }

  function _useSignature(bytes calldata signature) internal {
    if (!_usedSignatures[signature]) {
      _usedSignatures[signature] = true;
    }
  }
}

// SPDX-License-Identifier: MIT
pragma solidity 0.8.19;
import {Ownable} from "@openzeppelin/contracts/access/Ownable.sol";

contract TimeChecker is Ownable {
  uint256 public duration;
  uint256 public minDuration;

  event DurationUpdated(uint256 indexed duration);

  constructor(uint256 _duration) {
    duration = _duration;
    minDuration = 30 minutes;
  }

  /**
   * @dev Check if the time is valid
   */
  modifier timeValid(uint256 time) {
    require(
      time + duration >= block.timestamp,
      "expired, please send another transaction with new signature"
    );
    _;
  }


  /**
   * @dev Change duration value
   */
  function updateDuation(uint256 valNew) external onlyOwner {
    require(valNew > minDuration, "duration too short");
    duration = valNew;
    emit DurationUpdated(valNew);
  }
}

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

• No Contract Security Audit Submitted- Submit Audit Here

[{"inputs":[{"internalType":"uint256","name":"_duration","type":"uint256"},{"internalType":"address","name":"_verifier","type":"address"}],"stateMutability":"nonpayable","type":"constructor"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"uint256","name":"duration","type":"uint256"}],"name":"DurationUpdated","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"nft","type":"address"},{"indexed":true,"internalType":"address","name":"sender","type":"address"},{"indexed":true,"internalType":"address","name":"to","type":"address"},{"indexed":false,"internalType":"uint256[]","name":"tokenIds","type":"uint256[]"}],"name":"Lock","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":false,"internalType":"address","name":"account","type":"address"}],"name":"Paused","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"nft","type":"address"},{"indexed":true,"internalType":"address","name":"user","type":"address"},{"indexed":false,"internalType":"uint256","name":"nonce","type":"uint256"},{"components":[{"internalType":"uint256","name":"tokenId","type":"uint256"},{"internalType":"address","name":"to","type":"address"},{"internalType":"bool","name":"isMint","type":"bool"}],"indexed":false,"internalType":"struct NFTLockMain.NFTInfo[]","name":"nftList","type":"tuple[]"}],"name":"UnLock","type":"event"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"address","name":"account","type":"address"}],"name":"Unpaused","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"verifier","type":"address"}],"name":"VerifierUpdated","type":"event"},{"inputs":[],"name":"_CACHED_CHAIN_ID","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"_CACHED_THIS","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address[]","name":"nftList","type":"address[]"}],"name":"addSupportNftList","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"nft","type":"address"},{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"addressOriginal","outputs":[{"internalType":"address","name":"user","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"signer","type":"address"},{"internalType":"bytes32","name":"hash","type":"bytes32"},{"internalType":"bytes","name":"signature","type":"bytes"}],"name":"checkSigner","outputs":[],"stateMutability":"pure","type":"function"},{"inputs":[],"name":"duration","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"_to","type":"address"},{"internalType":"address","name":"_nft","type":"address"},{"components":[{"internalType":"uint256","name":"tokenId","type":"uint256"},{"internalType":"address","name":"to","type":"address"},{"internalType":"bool","name":"isMint","type":"bool"}],"internalType":"struct NFTLockMain.NFTInfo[]","name":"_ids","type":"tuple[]"},{"internalType":"address","name":"_contract","type":"address"},{"internalType":"uint256","name":"_chainId","type":"uint256"},{"internalType":"uint256","name":"_signTime","type":"uint256"},{"internalType":"uint256","name":"_saltNonce","type":"uint256"}],"name":"getMessageHash","outputs":[{"internalType":"bytes32","name":"","type":"bytes32"}],"stateMutability":"pure","type":"function"},{"inputs":[{"internalType":"address","name":"nft","type":"address"},{"internalType":"address","name":"to","type":"address"},{"internalType":"uint256[]","name":"tokenIds","type":"uint256[]"}],"name":"lock","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"token","type":"address"},{"internalType":"address","name":"user","type":"address"}],"name":"lockedNft","outputs":[{"internalType":"uint256[]","name":"","type":"uint256[]"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"token","type":"address"},{"internalType":"address","name":"user","type":"address"}],"name":"lockedNum","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"maxBatch","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"minDuration","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"","type":"address"},{"internalType":"address","name":"","type":"address"},{"internalType":"uint256","name":"","type":"uint256"},{"internalType":"bytes","name":"","type":"bytes"}],"name":"onERC721Received","outputs":[{"internalType":"bytes4","name":"","type":"bytes4"}],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"owner","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"paused","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"nftAddress","type":"address"}],"name":"removeSupportNft","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"renounceOwnership","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"nft","type":"address"}],"name":"supportNftList","outputs":[{"internalType":"bool","name":"status","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"newOwner","type":"address"}],"name":"transferOwnership","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"nft","type":"address"},{"components":[{"internalType":"uint256","name":"tokenId","type":"uint256"},{"internalType":"address","name":"to","type":"address"},{"internalType":"bool","name":"isMint","type":"bool"}],"internalType":"struct NFTLockMain.NFTInfo[]","name":"nftList","type":"tuple[]"},{"internalType":"uint256","name":"signTime","type":"uint256"},{"internalType":"uint256","name":"saltNonce","type":"uint256"},{"internalType":"bytes","name":"signature","type":"bytes"}],"name":"unlockOrMint","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"nft","type":"address"},{"internalType":"uint256[]","name":"tokenIds","type":"uint256[]"}],"name":"unlockWithSvr","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"_maxBatch","type":"uint256"}],"name":"updateBatch","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"valNew","type":"uint256"}],"name":"updateDuation","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"_verifier","type":"address"}],"name":"updateVerifier","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"verifier","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"}]

60c0346100fb57601f611b8438819003918201601f19168301916001600160401b038311848410176101005780849260409485528339810103126100fb5780516020909101516001600160a01b039182821682036100fb576000543360018060a01b0319821617600055604051933391167f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e0600080a3600255610708600355600480546064600555466080523060a0526001600160a81b03191660089290921b610100600160a81b0316919091179055611a6d9081610117823960805181818161097f0152610f8d015260a05181818161021001526109a10152f35b600080fd5b634e487b7160e01b600052604160045260246000fdfe6080604081815260048036101561001557600080fd5b600092833560e01c9081630fb5a6b414611190575080631275029214611152578063150b7a02146110fd578063230fb7fe14610fb05780632b437d4814610f755780632b7ac3f314610f4a57806338e2c2eb14610f285780635671576114610f095780635c975abb14610ee65780635fb110ca14610e5f57806367765b8714610e405780636d04319414610df3578063715018a614610d9957806376bd0cfd14610886578063799048fa146107fd5780637f9d3096146107715780638da5cb5b1461074957806397fc007c14610680578063a063472414610637578063bdfe78c9146105f3578063c419028f14610395578063ce3d1b2d14610308578063d13344c914610243578063da28b527146101fb5763f2fde38b1461013657600080fd5b346101f75760203660031901126101f75761014f6111ac565b906101586113ac565b6001600160a01b039182169283156101a557505082546001600160a01b0319811683178455167f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e08380a380f35b906020608492519162461bcd60e51b8352820152602660248201527f4f776e61626c653a206e6577206f776e657220697320746865207a65726f206160448201526564647265737360d01b6064820152fd5b8280fd5b50503461023f578160031936011261023f57517f00000000000000000000000000000000000000000000000000000000000000006001600160a01b03168152602090f35b5080fd5b8284346103055781600319360112610305579061025e6111ac565b916102676111c7565b6001600160a01b039384168252600760209081528383209190941682528352818120825181548082529183528483208186019392849190845b8181106102f157505050816102b6910382611235565b83519485948186019282875251809352850193925b8281106102da57505050500390f35b8351855286955093810193928101926001016102cb565b8254845292880192600192830192016102a0565b80fd5b50346101f75760e03660031901126101f7576103226111ac565b61032a6111c7565b91604435906001600160401b03821161039157366023830112156103915781602461035a933693013591016112f7565b93606435906001600160a01b03821682036103055750916020949161038a9360c4359360a4359360843593611926565b9051908152f35b8580fd5b50346101f75760603660031901126101f7576103af6111ac565b916103b86111c7565b916044356001600160401b038111610391576103d790369083016112ba565b91909360ff8254166105bd576103f1600554841115611674565b6001600160a01b039081169586156105815716928387526020916008835260ff82892054161561054e57875b84811061047a57505080518281529182018390526001600160fb1b038311610476577f356278d4d01db4ac9a53decc4eeeceecfb494d3bd0c463b305d33e65305e2bf29260051b8095828401378133958101030190a480f35b8680fd5b8589526006845282892061048f82878a6116d9565b358a528452828920336bffffffffffffffffffffffff60a01b82541617905585895260078452828920338a5284526104d5838a206104ce83888b6116d9565b3590611717565b506104e18186896116d9565b3589873b156103055784516323b872dd60e01b815233858201908152306020820152604081019390935291829081906060010381838b5af1801561054457906105309291610535575b506116b4565b61041d565b61053e906111f1565b3861052a565b84513d8c823e3d90fd5b82606492519162461bcd60e51b8352820152600f60248201526e1b9bdd081cdd5c1c1bdc9d081b999d608a1b6044820152fd5b845162461bcd60e51b8152602081850152601660248201527570617373706f72742063616e2774206265207a65726f60501b6044820152606490fd5b835162461bcd60e51b8152602081840152601060248201526f14185d5cd8589b194e881c185d5cd95960821b6044820152606490fd5b50503461023f578060031936011261023f576020916001600160a01b039082908261061c6111ac565b16815260068552818120602435825285522054169051908152f35b50503461023f578060031936011261023f57806020926106556111ac565b61065d6111c7565b6001600160a01b0391821683526007865283832091168252845220549051908152f35b50346101f75760203660031901126101f75761069a6111ac565b6106a26113ac565b6001600160a01b0381169283156106fb57508154610100600160a81b03191660089190911b610100600160a81b03161790557fd24015cc99cc1700cafca3042840a1d8ac1e3964fd2e0e37ea29c654056ee3278280a280f35b5162461bcd60e51b8152602081840152602360248201527f4e4654436c61696d65723a20616464726573732063616e206e6f74206265207a60448201526265726f60e81b6064820152608490fd5b50503461023f578160031936011261023f57905490516001600160a01b039091168152602090f35b50346101f75760203660031901126101f75780359161078e6113ac565b6003548311156107c5575050806002557f91abcc2d6823e3a3f11d31b208dd3065d2c6a791f1c7c9fe96a42ce12897eac58280a280f35b906020606492519162461bcd60e51b83528201526012602482015271191d5c985d1a5bdb881d1bdbc81cda1bdc9d60721b6044820152fd5b50346101f75760203660031901126101f7576108176111ac565b61081f6113ac565b6001600160a01b031680845260086020528284205490919060ff16156108545750825260086020528120805460ff1916905580f35b606490602084519162461bcd60e51b8352820152600c60248201526b63616e27742072656d6f766560a01b6044820152fd5b50346101f75760a03660031901126101f7576108a06111ac565b9160248035926001600160401b03938481116104765736602382011215610476578082013590858211610d955783810195606091853691848602010111610d915760449586359460649081359860843598858a11610d8d573660238b011215610d8d5789830135958611610d8d57808a019981873692010111610d8d57845195808b88378087019960ff8860019c8d815260209a8b91030190205416610d1c576002548101808211610d08574211610ca257908f9392918f8f8f90926109c79261097c8f958e96610975600554821115611674565b36916112f7565b907f0000000000000000000000000000000000000000000000000000000000000000917f00000000000000000000000000000000000000000000000000000000000000009133611926565b9c6109ec60018060a01b039e8f895460081c16906109e6368786611256565b91611404565b60ff8d838b5180928786833787820190815203019020541615610c7f575b505050829998979695995b8d898210610ab057505050505050508285519786890190895286838a01525281870197948a915b848310610a71578b33898d167f9a5ba7d70cc7e1cd613eb99e6ed8ea301d889773c9d4517218560eee5153803e8c8e038da380f35b90919293948480889b610a9b868b869c3584528d610a908983016111dd565b1688850152016112ea565b151581870152019a0196959493019190610a3c565b9a610ac1828b839a9b9c9d9e6117a1565b01358015158103610c7b578f8f91908e91600014610b505716610afa838d610af48d610aee8484896117a1565b016117b1565b946117a1565b3591813b1561047657858f918880948d5196879586946340c10f1960e01b8652168d850152898401525af18015610b465790610b3b929161053557506116b4565b999897969599610a15565b88513d87823e3d90fd5b959192939495169182825260068a52610b6d848d8b8520936117a1565b35825289528c88339220541603610c4f57908f9392918e81865260068a528b610b9a848b892092846117a1565b3587528a5288862080546001600160a01b031916905581865260078a528886203387528a52888620610bd890610bd1858f856117a1565b35906117c5565b50610bf3838d610bed8d610aee8484886117a1565b936117a1565b35823b156104765789516323b872dd60e01b815230818a019081526001600160a01b039093166020840152604083019190915291869183919082908490829060600103925af18015610b465790610b3b929161053557506116b4565b5050845162461bcd60e51b8152928301869052600990830152683737ba1037bbb732b960b91b90820152fd5b8480fd5b828951938492833781018d815203019020805460ff19168b179055388781610a0a565b865162461bcd60e51b8152808601899052603b818501527f657870697265642c20706c656173652073656e6420616e6f7468657220747261818601527f6e73616374696f6e2077697468206e6577207369676e6174757265000000000081880152608490fd5b5050634e487b7160e01b8f5250601183528dfd5b865162461bcd60e51b81528086018990526042818501527f7369676e617475726520757365642e20706c656173652073656e6420616e6f74818601527f686572207472616e73616374696f6e2077697468206e6577207369676e6174758188015261726560f01b608482015260a490fd5b8d80fd5b8880fd5b8780fd5b8334610305578060031936011261030557610db26113ac565b80546001600160a01b03198116825581906001600160a01b03167f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e08280a380f35b83823461023f57606036600319011261023f57610e0e6111ac565b6044356001600160401b038111610e3c57610e3992610e2f9136910161129c565b9060243590611404565b80f35b8380fd5b50503461023f578160031936011261023f576020906005549051908152f35b5090346101f75760209182600319360112610e3c578035906001600160401b038211610c7b57610e91913691016112ba565b9290610e9b6113ac565b845b848110610ea8578580f35b610ee1906001600160a01b03610ec7610ec28389876116d9565b6117b1565b16875260088452848720805460ff191660011790556116b4565b610e9d565b5091346103055780600319360112610305575060ff602092541690519015158152f35b50503461023f578160031936011261023f576020906003549051908152f35b83823461023f57602036600319011261023f57610f436113ac565b3560055580f35b50346101f757826003193601126101f75754905160089190911c6001600160a01b0316815260209150f35b50503461023f578160031936011261023f57602090517f00000000000000000000000000000000000000000000000000000000000000008152f35b50346101f757816003193601126101f757610fc96111ac565b91836024356001600160401b03811161023f57610fe990369085016112ba565b610ff49591956113ac565b611002600554821115611674565b6001600160a01b0391821690835b81811061101b578480f35b8285526006602081815287872061103384868d6116d9565b358852815285888820541691858852815287872061105284868d6116d9565b358852815287872080546001600160a01b031916905584875260078152878720828852905286862061108990610bd184868d6116d9565b5061109582848b6116d9565b3590843b156104765787516323b872dd60e01b8152308a82019081526001600160a01b0390921660208301526040820192909252869082908190606001038183885af180156110f357906110ee929161053557506116b4565b611010565b87513d88823e3d90fd5b509134610305576080366003190112610305576111186111ac565b506111216111c7565b50606435906001600160401b03821161030557506020926111449136910161129c565b5051630a85bd0160e11b8152f35b50503461023f57602036600319011261023f5760209160ff9082906001600160a01b0361117d6111ac565b1681526008855220541690519015158152f35b84903461023f578160031936011261023f576020906002548152f35b600435906001600160a01b03821682036111c257565b600080fd5b602435906001600160a01b03821682036111c257565b35906001600160a01b03821682036111c257565b6001600160401b03811161120457604052565b634e487b7160e01b600052604160045260246000fd5b604081019081106001600160401b0382111761120457604052565b90601f801991011681019081106001600160401b0382111761120457604052565b9291926001600160401b038211611204576040519161127f601f8201601f191660200184611235565b8294818452818301116111c2578281602093846000960137010152565b9080601f830112156111c2578160206112b793359101611256565b90565b9181601f840112156111c2578235916001600160401b0383116111c2576020808501948460051b0101116111c257565b359081151582036111c257565b6001600160401b03939284831161120457604090815195602092611320848760051b0189611235565b8388878152019260608097028601958187116111c257935b868510611349575050505050505050565b87858303126111c257825190888201908282108683111761139757899288928652873581526113798389016111dd565b838201526113888689016112ea565b86820152815201940193611338565b60246000634e487b7160e01b81526041600452fd5b6000546001600160a01b031633036113c057565b606460405162461bcd60e51b815260206004820152602060248201527f4f776e61626c653a2063616c6c6572206973206e6f7420746865206f776e65726044820152fd5b906114469261143e917f19457468657265756d205369676e6564204d6573736167653a0a333200000000600052601c52603c6000206115ad565b929092611493565b6001600160a01b0390811691160361145a57565b60405162461bcd60e51b8152602060048201526011602482015270696e76616c6964207369676e617475726560781b6044820152606490fd5b600581101561159757806114a45750565b600181036114f15760405162461bcd60e51b815260206004820152601860248201527f45434453413a20696e76616c6964207369676e617475726500000000000000006044820152606490fd5b6002810361153e5760405162461bcd60e51b815260206004820152601f60248201527f45434453413a20696e76616c6964207369676e6174757265206c656e677468006044820152606490fd5b60031461154757565b60405162461bcd60e51b815260206004820152602260248201527f45434453413a20696e76616c6964207369676e6174757265202773272076616c604482015261756560f01b6064820152608490fd5b634e487b7160e01b600052602160045260246000fd5b9060418151146000146115db576115d7916020820151906060604084015193015160001a906115e5565b9091565b5050600090600290565b9291907f7fffffffffffffffffffffffffffffff5d576e7357a4501ddfe92f46681b20a083116116685791608094939160ff602094604051948552168484015260408301526060820152600093849182805260015afa1561165b5781516001600160a01b03811615611655579190565b50600190565b50604051903d90823e3d90fd5b50505050600090600390565b1561167b57565b60405162461bcd60e51b8152602060048201526011602482015270746f6b656e49647320746f6f206d616e7960781b6044820152606490fd5b60001981146116c35760010190565b634e487b7160e01b600052601160045260246000fd5b91908110156116e95760051b0190565b634e487b7160e01b600052603260045260246000fd5b80548210156116e95760005260206000200190600090565b9190600183016000908282528060205260408220541560001461179b57845494680100000000000000008610156117875783611777611760886001604098999a018555846116ff565b819391549060031b91821b91600019901b19161790565b9055549382526020522055600190565b634e487b7160e01b83526041600452602483fd5b50925050565b91908110156116e9576060020190565b356001600160a01b03811681036111c25790565b906001820190600092818452826020526040842054908115156000146118ae576000199180830181811161189a5782549084820191821161188657808203611851575b5050508054801561183d5782019161182083836116ff565b909182549160031b1b191690555582526020526040812055600190565b634e487b7160e01b86526031600452602486fd5b61187161186161176093866116ff565b90549060031b1c928392866116ff565b90558652846020526040862055388080611808565b634e487b7160e01b88526011600452602488fd5b634e487b7160e01b87526011600452602487fd5b5050505090565b80518210156116e95760209160051b010190565b9081519160005b8381106118e1575050016000815290565b80602080928401015181850152016118d0565b61192490611916611910949360405195869360208501906118c9565b906118c9565b03601f198101845283611235565b565b939092919496956040978851926bffffffffffffffffffffffff198095816060988160209b8b1b168b890152891b166034870152871b166048850152605c840152607c830152609c820152609c815260c081018181106001600160401b038211176112045787526000905b8551821015611a2757611a1b6119f36119cc611a21936119b1868b6118b5565b5151908c51918a8301528982526119c78261121a565b6118f4565b876119d7868b6118b5565b51015190868c5192891b1689830152601482526119c78261121a565b896119fe858a6118b5565b5101511515908a519160f81b88830152600182526119c78261121a565b916116b4565b90611991565b959650505050905081519101209056fea26469706673582212202428c4007ad09fdc4a08c2d2fbe0daa040c81de0bf8d950346e0d9282a34504a64736f6c634300081300330000000000000000000000000000000000000000000000000000000000000e100000000000000000000000001f44332d41d264f11d9182d84cc4f0fb7aa016f1

0x6080604081815260048036101561001557600080fd5b600092833560e01c9081630fb5a6b414611190575080631275029214611152578063150b7a02146110fd578063230fb7fe14610fb05780632b437d4814610f755780632b7ac3f314610f4a57806338e2c2eb14610f285780635671576114610f095780635c975abb14610ee65780635fb110ca14610e5f57806367765b8714610e405780636d04319414610df3578063715018a614610d9957806376bd0cfd14610886578063799048fa146107fd5780637f9d3096146107715780638da5cb5b1461074957806397fc007c14610680578063a063472414610637578063bdfe78c9146105f3578063c419028f14610395578063ce3d1b2d14610308578063d13344c914610243578063da28b527146101fb5763f2fde38b1461013657600080fd5b346101f75760203660031901126101f75761014f6111ac565b906101586113ac565b6001600160a01b039182169283156101a557505082546001600160a01b0319811683178455167f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e08380a380f35b906020608492519162461bcd60e51b8352820152602660248201527f4f776e61626c653a206e6577206f776e657220697320746865207a65726f206160448201526564647265737360d01b6064820152fd5b8280fd5b50503461023f578160031936011261023f57517f0000000000000000000000005c16ac8322e5cac8ad235f7e0dc5d23bffe3ed506001600160a01b03168152602090f35b5080fd5b8284346103055781600319360112610305579061025e6111ac565b916102676111c7565b6001600160a01b039384168252600760209081528383209190941682528352818120825181548082529183528483208186019392849190845b8181106102f157505050816102b6910382611235565b83519485948186019282875251809352850193925b8281106102da57505050500390f35b8351855286955093810193928101926001016102cb565b8254845292880192600192830192016102a0565b80fd5b50346101f75760e03660031901126101f7576103226111ac565b61032a6111c7565b91604435906001600160401b03821161039157366023830112156103915781602461035a933693013591016112f7565b93606435906001600160a01b03821682036103055750916020949161038a9360c4359360a4359360843593611926565b9051908152f35b8580fd5b50346101f75760603660031901126101f7576103af6111ac565b916103b86111c7565b916044356001600160401b038111610391576103d790369083016112ba565b91909360ff8254166105bd576103f1600554841115611674565b6001600160a01b039081169586156105815716928387526020916008835260ff82892054161561054e57875b84811061047a57505080518281529182018390526001600160fb1b038311610476577f356278d4d01db4ac9a53decc4eeeceecfb494d3bd0c463b305d33e65305e2bf29260051b8095828401378133958101030190a480f35b8680fd5b8589526006845282892061048f82878a6116d9565b358a528452828920336bffffffffffffffffffffffff60a01b82541617905585895260078452828920338a5284526104d5838a206104ce83888b6116d9565b3590611717565b506104e18186896116d9565b3589873b156103055784516323b872dd60e01b815233858201908152306020820152604081019390935291829081906060010381838b5af1801561054457906105309291610535575b506116b4565b61041d565b61053e906111f1565b3861052a565b84513d8c823e3d90fd5b82606492519162461bcd60e51b8352820152600f60248201526e1b9bdd081cdd5c1c1bdc9d081b999d608a1b6044820152fd5b845162461bcd60e51b8152602081850152601660248201527570617373706f72742063616e2774206265207a65726f60501b6044820152606490fd5b835162461bcd60e51b8152602081840152601060248201526f14185d5cd8589b194e881c185d5cd95960821b6044820152606490fd5b50503461023f578060031936011261023f576020916001600160a01b039082908261061c6111ac565b16815260068552818120602435825285522054169051908152f35b50503461023f578060031936011261023f57806020926106556111ac565b61065d6111c7565b6001600160a01b0391821683526007865283832091168252845220549051908152f35b50346101f75760203660031901126101f75761069a6111ac565b6106a26113ac565b6001600160a01b0381169283156106fb57508154610100600160a81b03191660089190911b610100600160a81b03161790557fd24015cc99cc1700cafca3042840a1d8ac1e3964fd2e0e37ea29c654056ee3278280a280f35b5162461bcd60e51b8152602081840152602360248201527f4e4654436c61696d65723a20616464726573732063616e206e6f74206265207a60448201526265726f60e81b6064820152608490fd5b50503461023f578160031936011261023f57905490516001600160a01b039091168152602090f35b50346101f75760203660031901126101f75780359161078e6113ac565b6003548311156107c5575050806002557f91abcc2d6823e3a3f11d31b208dd3065d2c6a791f1c7c9fe96a42ce12897eac58280a280f35b906020606492519162461bcd60e51b83528201526012602482015271191d5c985d1a5bdb881d1bdbc81cda1bdc9d60721b6044820152fd5b50346101f75760203660031901126101f7576108176111ac565b61081f6113ac565b6001600160a01b031680845260086020528284205490919060ff16156108545750825260086020528120805460ff1916905580f35b606490602084519162461bcd60e51b8352820152600c60248201526b63616e27742072656d6f766560a01b6044820152fd5b50346101f75760a03660031901126101f7576108a06111ac565b9160248035926001600160401b03938481116104765736602382011215610476578082013590858211610d955783810195606091853691848602010111610d915760449586359460649081359860843598858a11610d8d573660238b011215610d8d5789830135958611610d8d57808a019981873692010111610d8d57845195808b88378087019960ff8860019c8d815260209a8b91030190205416610d1c576002548101808211610d08574211610ca257908f9392918f8f8f90926109c79261097c8f958e96610975600554821115611674565b36916112f7565b907f0000000000000000000000000000000000000000000000000000000000000001917f0000000000000000000000005c16ac8322e5cac8ad235f7e0dc5d23bffe3ed509133611926565b9c6109ec60018060a01b039e8f895460081c16906109e6368786611256565b91611404565b60ff8d838b5180928786833787820190815203019020541615610c7f575b505050829998979695995b8d898210610ab057505050505050508285519786890190895286838a01525281870197948a915b848310610a71578b33898d167f9a5ba7d70cc7e1cd613eb99e6ed8ea301d889773c9d4517218560eee5153803e8c8e038da380f35b90919293948480889b610a9b868b869c3584528d610a908983016111dd565b1688850152016112ea565b151581870152019a0196959493019190610a3c565b9a610ac1828b839a9b9c9d9e6117a1565b01358015158103610c7b578f8f91908e91600014610b505716610afa838d610af48d610aee8484896117a1565b016117b1565b946117a1565b3591813b1561047657858f918880948d5196879586946340c10f1960e01b8652168d850152898401525af18015610b465790610b3b929161053557506116b4565b999897969599610a15565b88513d87823e3d90fd5b959192939495169182825260068a52610b6d848d8b8520936117a1565b35825289528c88339220541603610c4f57908f9392918e81865260068a528b610b9a848b892092846117a1565b3587528a5288862080546001600160a01b031916905581865260078a528886203387528a52888620610bd890610bd1858f856117a1565b35906117c5565b50610bf3838d610bed8d610aee8484886117a1565b936117a1565b35823b156104765789516323b872dd60e01b815230818a019081526001600160a01b039093166020840152604083019190915291869183919082908490829060600103925af18015610b465790610b3b929161053557506116b4565b5050845162461bcd60e51b8152928301869052600990830152683737ba1037bbb732b960b91b90820152fd5b8480fd5b828951938492833781018d815203019020805460ff19168b179055388781610a0a565b865162461bcd60e51b8152808601899052603b818501527f657870697265642c20706c656173652073656e6420616e6f7468657220747261818601527f6e73616374696f6e2077697468206e6577207369676e6174757265000000000081880152608490fd5b5050634e487b7160e01b8f5250601183528dfd5b865162461bcd60e51b81528086018990526042818501527f7369676e617475726520757365642e20706c656173652073656e6420616e6f74818601527f686572207472616e73616374696f6e2077697468206e6577207369676e6174758188015261726560f01b608482015260a490fd5b8d80fd5b8880fd5b8780fd5b8334610305578060031936011261030557610db26113ac565b80546001600160a01b03198116825581906001600160a01b03167f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e08280a380f35b83823461023f57606036600319011261023f57610e0e6111ac565b6044356001600160401b038111610e3c57610e3992610e2f9136910161129c565b9060243590611404565b80f35b8380fd5b50503461023f578160031936011261023f576020906005549051908152f35b5090346101f75760209182600319360112610e3c578035906001600160401b038211610c7b57610e91913691016112ba565b9290610e9b6113ac565b845b848110610ea8578580f35b610ee1906001600160a01b03610ec7610ec28389876116d9565b6117b1565b16875260088452848720805460ff191660011790556116b4565b610e9d565b5091346103055780600319360112610305575060ff602092541690519015158152f35b50503461023f578160031936011261023f576020906003549051908152f35b83823461023f57602036600319011261023f57610f436113ac565b3560055580f35b50346101f757826003193601126101f75754905160089190911c6001600160a01b0316815260209150f35b50503461023f578160031936011261023f57602090517f00000000000000000000000000000000000000000000000000000000000000018152f35b50346101f757816003193601126101f757610fc96111ac565b91836024356001600160401b03811161023f57610fe990369085016112ba565b610ff49591956113ac565b611002600554821115611674565b6001600160a01b0391821690835b81811061101b578480f35b8285526006602081815287872061103384868d6116d9565b358852815285888820541691858852815287872061105284868d6116d9565b358852815287872080546001600160a01b031916905584875260078152878720828852905286862061108990610bd184868d6116d9565b5061109582848b6116d9565b3590843b156104765787516323b872dd60e01b8152308a82019081526001600160a01b0390921660208301526040820192909252869082908190606001038183885af180156110f357906110ee929161053557506116b4565b611010565b87513d88823e3d90fd5b509134610305576080366003190112610305576111186111ac565b506111216111c7565b50606435906001600160401b03821161030557506020926111449136910161129c565b5051630a85bd0160e11b8152f35b50503461023f57602036600319011261023f5760209160ff9082906001600160a01b0361117d6111ac565b1681526008855220541690519015158152f35b84903461023f578160031936011261023f576020906002548152f35b600435906001600160a01b03821682036111c257565b600080fd5b602435906001600160a01b03821682036111c257565b35906001600160a01b03821682036111c257565b6001600160401b03811161120457604052565b634e487b7160e01b600052604160045260246000fd5b604081019081106001600160401b0382111761120457604052565b90601f801991011681019081106001600160401b0382111761120457604052565b9291926001600160401b038211611204576040519161127f601f8201601f191660200184611235565b8294818452818301116111c2578281602093846000960137010152565b9080601f830112156111c2578160206112b793359101611256565b90565b9181601f840112156111c2578235916001600160401b0383116111c2576020808501948460051b0101116111c257565b359081151582036111c257565b6001600160401b03939284831161120457604090815195602092611320848760051b0189611235565b8388878152019260608097028601958187116111c257935b868510611349575050505050505050565b87858303126111c257825190888201908282108683111761139757899288928652873581526113798389016111dd565b838201526113888689016112ea565b86820152815201940193611338565b60246000634e487b7160e01b81526041600452fd5b6000546001600160a01b031633036113c057565b606460405162461bcd60e51b815260206004820152602060248201527f4f776e61626c653a2063616c6c6572206973206e6f7420746865206f776e65726044820152fd5b906114469261143e917f19457468657265756d205369676e6564204d6573736167653a0a333200000000600052601c52603c6000206115ad565b929092611493565b6001600160a01b0390811691160361145a57565b60405162461bcd60e51b8152602060048201526011602482015270696e76616c6964207369676e617475726560781b6044820152606490fd5b600581101561159757806114a45750565b600181036114f15760405162461bcd60e51b815260206004820152601860248201527f45434453413a20696e76616c6964207369676e617475726500000000000000006044820152606490fd5b6002810361153e5760405162461bcd60e51b815260206004820152601f60248201527f45434453413a20696e76616c6964207369676e6174757265206c656e677468006044820152606490fd5b60031461154757565b60405162461bcd60e51b815260206004820152602260248201527f45434453413a20696e76616c6964207369676e6174757265202773272076616c604482015261756560f01b6064820152608490fd5b634e487b7160e01b600052602160045260246000fd5b9060418151146000146115db576115d7916020820151906060604084015193015160001a906115e5565b9091565b5050600090600290565b9291907f7fffffffffffffffffffffffffffffff5d576e7357a4501ddfe92f46681b20a083116116685791608094939160ff602094604051948552168484015260408301526060820152600093849182805260015afa1561165b5781516001600160a01b03811615611655579190565b50600190565b50604051903d90823e3d90fd5b50505050600090600390565b1561167b57565b60405162461bcd60e51b8152602060048201526011602482015270746f6b656e49647320746f6f206d616e7960781b6044820152606490fd5b60001981146116c35760010190565b634e487b7160e01b600052601160045260246000fd5b91908110156116e95760051b0190565b634e487b7160e01b600052603260045260246000fd5b80548210156116e95760005260206000200190600090565b9190600183016000908282528060205260408220541560001461179b57845494680100000000000000008610156117875783611777611760886001604098999a018555846116ff565b819391549060031b91821b91600019901b19161790565b9055549382526020522055600190565b634e487b7160e01b83526041600452602483fd5b50925050565b91908110156116e9576060020190565b356001600160a01b03811681036111c25790565b906001820190600092818452826020526040842054908115156000146118ae576000199180830181811161189a5782549084820191821161188657808203611851575b5050508054801561183d5782019161182083836116ff565b909182549160031b1b191690555582526020526040812055600190565b634e487b7160e01b86526031600452602486fd5b61187161186161176093866116ff565b90549060031b1c928392866116ff565b90558652846020526040862055388080611808565b634e487b7160e01b88526011600452602488fd5b634e487b7160e01b87526011600452602487fd5b5050505090565b80518210156116e95760209160051b010190565b9081519160005b8381106118e1575050016000815290565b80602080928401015181850152016118d0565b61192490611916611910949360405195869360208501906118c9565b906118c9565b03601f198101845283611235565b565b939092919496956040978851926bffffffffffffffffffffffff198095816060988160209b8b1b168b890152891b166034870152871b166048850152605c840152607c830152609c820152609c815260c081018181106001600160401b038211176112045787526000905b8551821015611a2757611a1b6119f36119cc611a21936119b1868b6118b5565b5151908c51918a8301528982526119c78261121a565b6118f4565b876119d7868b6118b5565b51015190868c5192891b1689830152601482526119c78261121a565b896119fe858a6118b5565b5101511515908a519160f81b88830152600182526119c78261121a565b916116b4565b90611991565b959650505050905081519101209056fea26469706673582212202428c4007ad09fdc4a08c2d2fbe0daa040c81de0bf8d950346e0d9282a34504a64736f6c63430008130033

0000000000000000000000000000000000000000000000000000000000000e100000000000000000000000001f44332d41d264f11d9182d84cc4f0fb7aa016f1

-----Decoded View---------------
Arg [0] : _duration (uint256): 3600
Arg [1] : _verifier (address): 0x1f44332d41D264F11d9182d84cC4F0FB7AA016f1

-----Encoded View---------------
2 Constructor Arguments found :
Arg [0] : 0000000000000000000000000000000000000000000000000000000000000e10
Arg [1] : 0000000000000000000000001f44332d41d264f11d9182d84cc4f0fb7aa016f1

580:5194:11:-:0;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;-1:-1:-1;;580:5194:11;;;;;;:::i;:::-;1063:62:0;;;:::i;:::-;-1:-1:-1;;;;;580:5194:11;;;;2162:22:0;;580:5194:11;;-1:-1:-1;;580:5194:11;;-1:-1:-1;;;;;;580:5194:11;;;;;;;2566:40:0;580:5194:11;;2566:40:0;580:5194:11;;;;;;;;;;;;;;;;;;;;;;;;;;;-1:-1:-1;;;580:5194:11;;;;;;;;;;;;;;;;;;;;;;;;757:37;-1:-1:-1;;;;;580:5194:11;;;;;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;;;;:::i;:::-;-1:-1:-1;;;;;580:5194:11;;;;;4366:13;580:5194;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;-1:-1:-1;580:5194:11;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;-1:-1:-1;;580:5194:11;;;;;;:::i;:::-;;;:::i;:::-;;;;;-1:-1:-1;;;;;580:5194:11;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;;;;;-1:-1:-1;;;;;580:5194:11;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;-1:-1:-1;;580:5194:11;;;;;;:::i;:::-;;;;:::i;:::-;;;;-1:-1:-1;;;;;580:5194:11;;;;;;;;;;;:::i;:::-;;;;;;;;;;1898:57;1925:8;580:5194;1906:27;;;1898:57;:::i;:::-;-1:-1:-1;;;;;580:5194:11;;;;1970:16;;580:5194;;;;;;;;;2028:14;580:5194;;;;;;;;;;;2116:13;2131:19;;;;;;-1:-1:-1;;580:5194:11;;;;;;;;;;;-1:-1:-1;;;;;580:5194:11;;;;2349:32;580:5194;1925:8;580:5194;;;;;;;734:10:4;;580:5194:11;;;2349:32;;;;580:5194;;;;;;2152:3;580:5194;;;2166:15;580:5194;;;;;2187:11;;;;;:::i;:::-;580:5194;;;;;;;;734:10:4;580:5194:11;;;;;;;;;;;;2218:13;580:5194;;;;;734:10:4;580:5194:11;;;;10883:32:9;580:5194:11;;;2250:11;;;;;:::i;:::-;580:5194;10883:32:9;;:::i;:::-;;2318:11:11;;;;;:::i;:::-;580:5194;2271:59;;;;;;580:5194;;-1:-1:-1;;;2271:59:11;;734:10:4;2271:59:11;;;580:5194;;;2311:4;580:5194;;;;;;;;;;;;;;;;;;2271:59;;;;;;;;;;;2152:3;2271:59;;;;2152:3;;;:::i;:::-;2116:13;;2271:59;;;;:::i;:::-;;;;;580:5194;;;;;;;;;;;;;;;;;;;;;;;;;;;;-1:-1:-1;;;580:5194:11;;;;;;;;-1:-1:-1;;;580:5194:11;;;;;;;;;;;;-1:-1:-1;;;580:5194:11;;;;;;;;;;-1:-1:-1;;;580:5194:11;;;;;;;;;;;;-1:-1:-1;;;580:5194:11;;;;;;;;;;;;;;;;;;;;;;;-1:-1:-1;;;;;580:5194:11;;;;;;:::i;:::-;;;;945:87;580:5194;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;;;:::i;:::-;-1:-1:-1;;;;;580:5194:11;;;;;4218:13;580:5194;;;;;;;;;;;;;;;;;;;;;;;;;;-1:-1:-1;;580:5194:11;;;;;;:::i;:::-;1063:62:0;;:::i;:::-;-1:-1:-1;;;;;580:5194:11;;;4997:23;;580:5194;;-1:-1:-1;580:5194:11;;-1:-1:-1;;;;;;580:5194:11;;;;;;-1:-1:-1;;;;;580:5194:11;;;;5099:26;;;;580:5194;;;;-1:-1:-1;;;580:5194:11;;;;;;;;;;;;;;;;;-1:-1:-1;;;580:5194:11;;;;;;;;;;;;;;;;;;;;;;;;;-1:-1:-1;;;;;580:5194:11;;;;;;;;;;;;;;;-1:-1:-1;;580:5194:11;;;;;;1063:62:0;;;:::i;:::-;580:5194:11;;743:20:12;;580:5194:11;;;;;;793:17:12;580:5194:11;822:23:12;;;;580:5194:11;;;;;;;;;;;;;;;;;;;;;;-1:-1:-1;;;580:5194:11;;;;;;;;;;;;-1:-1:-1;;580:5194:11;;;;;;:::i;:::-;1063:62:0;;:::i;:::-;-1:-1:-1;;;;;580:5194:11;;;;4776:14;580:5194;;;;;;;;;;;;;;-1:-1:-1;580:5194:11;;4776:14;580:5194;;;;;;-1:-1:-1;;580:5194:11;;;;;;;;;;;;;;;;;;;;;;;;;-1:-1:-1;;;580:5194:11;;;;;;;;;;;;-1:-1:-1;;580:5194:11;;;;;;:::i;:::-;;;;;;-1:-1:-1;;;;;580:5194:11;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;497:8:12;580:5194:11;;;;;;;;509:15:12;-1:-1:-1;580:5194:11;;;;;;;;;;;;2882:90;580:5194;;;;;;2760:56;2786:8;580:5194;2768:26;;;2760:56;:::i;:::-;580:5194;;;:::i;:::-;2934:16;;2920:12;;734:10:4;;2882:90:11;:::i;:::-;580:5194;2979:45;580:5194;;;;;;;;;;;;;;;;;;:::i;:::-;2979:45;;:::i;:::-;580:5194;;;;;;;;;;;;;;;;;;;;;;;909:27:10;905:83;;580:5194:11;3067:13;;;;;;;;;;3082:18;;;;;;;580:5194;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;734:10:4;;580:5194:11;;;3533:40;;;;734:10:4;3533:40:11;580:5194;;;;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;;;;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;3102:3;3120:10;;;;;;;;;;;:::i;:::-;:17;580:5194;;;;;;;;3116:399;;;;;;;3120:17;;;580:5194;3180:10;3165;;:13;:10;;;;;;:::i;:::-;:13;;:::i;:::-;3180:10;;:::i;:::-;580:5194;3150:49;;;;;;580:5194;;;;;;;;;;;;;;;;3150:49;;580:5194;3150:49;;;580:5194;;;;;3150:49;;;;;;;3102:3;3150:49;;;;3116:399;3102:3;:::i;:::-;3067:13;;;;;;;;3150:49;580:5194;;;;;;;;;3116:399;580:5194;;;;;;;;;;;3234:15;580:5194;;3255:10;580:5194;;;;;3255:10;;:::i;:::-;580:5194;;;;;734:10:4;;;580:5194:11;;;;3234:51;580:5194;;;;;;;;;;;3234:15;580:5194;;;3338:10;580:5194;;;;3338:10;;;:::i;:::-;580:5194;;;;;;;;;;-1:-1:-1;;;;;;580:5194:11;;;;;;3368:13;580:5194;;;;;734:10:4;580:5194:11;;;;;;;11183:35:9;;3403:10:11;580:5194;;3403:10;;:::i;:::-;580:5194;11183:35:9;;:::i;:::-;;3486:10:11;3471;;:13;:10;;;;;;:::i;:13::-;3486:10;;:::i;:::-;580:5194;3433:72;;;;;580:5194;;-1:-1:-1;;;3433:72:11;;3464:4;3433:72;;;580:5194;;;-1:-1:-1;;;;;580:5194:11;;;;;;;;;;;;;;;;;;;;;;;;;;;;3433:72;;;;;;;;;3102:3;3433:72;;;;3116:399;3102:3;:::i;580:5194::-;-1:-1:-1;;580:5194:11;;-1:-1:-1;;;580:5194:11;;;;;;;;;;;;;-1:-1:-1;;;580:5194:11;;;;;;;;;905:83:10;580:5194:11;;;;;;;;;;;;;;;;;;;-1:-1:-1;;580:5194:11;;;;;905:83:10;;;;;580:5194:11;;;-1:-1:-1;;;580:5194:11;;;;;;;;;;;;;;;;;;;;;;;;;;;-1:-1:-1;;;;;580:5194:11;;-1:-1:-1;580:5194:11;;;;;;;;-1:-1:-1;;;580:5194:11;;;;;;;;;;;;;;;;;;;;;;;-1:-1:-1;;;580:5194:11;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;1063:62:0;;:::i;:::-;580:5194:11;;-1:-1:-1;;;;;;580:5194:11;;;;;;-1:-1:-1;;;;;580:5194:11;2566:40:0;580:5194:11;;2566:40:0;580:5194:11;;;;;;;;;;-1:-1:-1;;580:5194:11;;;;;;:::i;:::-;;;-1:-1:-1;;;;;580:5194:11;;;;;;;;;;;;:::i;:::-;;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;827:29;580:5194;;;;;;;;;;;;;;;;;;;;;;;;;;-1:-1:-1;;;;;580:5194:11;;;;;;;;;;:::i;:::-;1063:62:0;;;;:::i;:::-;4597:13:11;4612:18;;;;;;580:5194;;;4632:3;;;-1:-1:-1;;;;;4661:10:11;;580:5194;4661:10;;;:::i;:::-;;:::i;:::-;580:5194;;;4646:14;580:5194;;;;;;;-1:-1:-1;;580:5194:11;;;;;4632:3;:::i;:::-;4597:13;;580:5194;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;-1:-1:-1;;580:5194:11;;;;1063:62:0;;:::i;:::-;580:5194:11;4479:20;580:5194;;;;;;;;;;;;;;;;;;;;;;;;-1:-1:-1;;;;;580:5194:11;;;;;-1:-1:-1;580:5194:11;;;;;;;;;;;;;;;;;;711:41;580:5194;;;;;;;;;;;;;;;;;;:::i;:::-;;;;;-1:-1:-1;;;;;580:5194:11;;;;;;;;;;;:::i;:::-;1063:62:0;;;;;:::i;:::-;3736:57:11;3763:8;580:5194;3744:27;;;3736:57;:::i;:::-;-1:-1:-1;;;;;580:5194:11;;;;3805:13;3820:19;;;;;;580:5194;;;3841:3;580:5194;;;3873:15;580:5194;;;;;;;3894:11;;;;;:::i;:::-;580:5194;;;;;;;;;;;;;;;;;;;;3943:11;;;;;:::i;:::-;580:5194;;;;;;;;;;-1:-1:-1;;;;;;580:5194:11;;;;;;3964:13;580:5194;;;;;;;;;;;;;11183:35:9;;3999:11:11;;;;;:::i;11183:35:9:-;;4067:11:11;;;;;:::i;:::-;580:5194;4020:59;;;;;;580:5194;;-1:-1:-1;;;4020:59:11;;4051:4;4020:59;;;580:5194;;;-1:-1:-1;;;;;580:5194:11;;;;;;;;;;;;;;;;;;;;;;4020:59;;;;;;;;;;;3841:3;4020:59;;;;3841:3;;:::i;:::-;3805:13;;4020:59;580:5194;;;;;;;;;;;;;;;;;-1:-1:-1;;580:5194:11;;;;;;:::i;:::-;;;;:::i;:::-;;;;;-1:-1:-1;;;;;580:5194:11;;;;;;;;;;;;;:::i;:::-;-1:-1:-1;580:5194:11;-1:-1:-1;;;580:5194:11;;;;;;;;;;;-1:-1:-1;;580:5194:11;;;;;;;;;;-1:-1:-1;;;;;580:5194:11;;:::i;:::-;;;;1145:57;580:5194;;;;;;;;;;;;;;;;;;;;;;;;;;;;;166:23:12;580:5194:11;;;;;;;;-1:-1:-1;;;;;580:5194:11;;;;;;:::o;:::-;;;;;;;;-1:-1:-1;;;;;580:5194:11;;;;;;:::o;:::-;;;-1:-1:-1;;;;;580:5194:11;;;;;;:::o;:::-;-1:-1:-1;;;;;580:5194:11;;;;;;:::o;:::-;;;;;;;;;;;;;;;;;;;-1:-1:-1;;;;;580:5194:11;;;;;;;:::o;:::-;;;;;;;;;;;;;-1:-1:-1;;;;;580:5194:11;;;;;;;:::o;:::-;;;;-1:-1:-1;;;;;580:5194:11;;;;;;;;;;;-1:-1:-1;;580:5194:11;;;;;:::i;:::-;;;;;;;;;;;;;;;;;-1:-1:-1;580:5194:11;;;;;;:::o;:::-;;;;;;;;;;;;;;;;;;:::i;:::-;;:::o;:::-;;;;;;;;;;;;;-1:-1:-1;;;;;580:5194:11;;;;;;;;;;;;;;;;;:::o;:::-;;;;;;;;;;:::o;:::-;-1:-1:-1;;;;;580:5194:11;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::o;:::-;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;;;;;;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;;;1359:130:0;1273:6;580:5194:11;-1:-1:-1;;;;;580:5194:11;734:10:4;1422:23:0;580:5194:11;;1359:130:0:o;580:5194:11:-;;;;;;;;;;;;;;;;;;;;;;;;;314:316:10;;3849:5:6;314:316:10;3800:27:6;314:316:10;7353:157:6;-1:-1:-1;7353:157:6;;;;-1:-1:-1;7353:157:6;3800:27;:::i;:::-;3849:5;;;;:::i;:::-;-1:-1:-1;;;;;580:5194:11;;;;;583:19:10;580:5194:11;;314:316:10:o;580:5194:11:-;;;-1:-1:-1;;;580:5194:11;;;;;;;;;;;;-1:-1:-1;;;580:5194:11;;;;;;;570:511:6;580:5194:11;;;;;;638:29:6;;;683:7;:::o;634:441::-;580:5194:11;734:38:6;;580:5194:11;;;;-1:-1:-1;;;788:34:6;;580:5194:11;788:34:6;;;580:5194:11;;;;;;;;;;;;;788:34:6;730:345;852:35;843:44;;852:35;;580:5194:11;;-1:-1:-1;;;903:41:6;;580:5194:11;903:41:6;;;580:5194:11;;;;;;;;;;;;;903:41:6;839:236;974:30;965:39;961:114;;570:511::o;961:114::-;580:5194:11;;-1:-1:-1;;;1020:44:6;;580:5194:11;1020:44:6;;;580:5194:11;;;;;;;;;;;-1:-1:-1;;;580:5194:11;;;;;;1020:44:6;580:5194:11;;;;647:20:6;580:5194:11;;;;;647:20:6;580:5194:11;2145:730:6;;2283:2;580:5194:11;;2263:22:6;2259:610;2283:2;;;2746:25;2546:180;;;;;;;;;;;;;;-1:-1:-1;2546:180:6;2746:25;;:::i;:::-;2739:32;;:::o;2259:610::-;2802:56;;2818:1;2802:56;2822:35;2802:56;:::o;5009:1456::-;;;;6021:66;6008:79;;6004:161;;580:5194:11;;;;;;;;;;;;;;;;;;;;;;;;;;-1:-1:-1;6276:24:6;;;;;;;;;;;;;;-1:-1:-1;;;;;580:5194:11;;6314:20:6;6310:101;;6421:37;5009:1456;:::o;6310:101::-;6350:50;6276:24;6350:50;:::o;6276:24::-;580:5194:11;;;;;;;;;;;6004:161:6;6103:51;;;;6119:1;6103:51;6123:30;6103:51;:::o;580:5194:11:-;;;;:::o;:::-;;;-1:-1:-1;;;580:5194:11;;;;;;;;;;;;-1:-1:-1;;;580:5194:11;;;;;;;;-1:-1:-1;;580:5194:11;;;;;;;:::o;:::-;;;;;;;;;;;;;;;;;;;;;;;;:::o;:::-;;;;;;;;;;;;;;;;;;;;-1:-1:-1;580:5194:11;;-1:-1:-1;580:5194:11;;;-1:-1:-1;580:5194:11;:::o;2214:404:9:-;;;4351:12;;;-1:-1:-1;580:5194:11;;;;;;;;;;;4351:24:9;2293:319;580:5194:11;;;;;;;;;;;;;;;;4351:12:9;580:5194:11;;;;;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;4351:12:9;2547:11;:::o;580:5194:11:-;-1:-1:-1;;;580:5194:11;;;;;;;;2293:319:9;-1:-1:-1;2589:12:9;-1:-1:-1;;2589:12:9:o;580:5194:11:-;;;;;;;;;;;;:::o;:::-;;-1:-1:-1;;;;;580:5194:11;;;;;;;:::o;2786:1388:9:-;;2989:12;;;-1:-1:-1;;580:5194:11;;;;;;;;;;;3023:15:9;;;;3019:1149;3023:15;;;-1:-1:-1;;580:5194:11;;;;;;;;;;;;;;;;;;;;3505:26:9;;;3501:398;;3019:1149;580:5194:11;;;;;;;;;;;;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;2989:12:9;4103:11;:::o;580:5194:11:-;-1:-1:-1;;;580:5194:11;;;;;;;;3501:398:9;580:5194:11;3571:22:9;3693:26;3571:22;;;:::i;:::-;580:5194:11;;;;;;3693:26:9;;;;;:::i;580:5194:11:-;;;;;;;;;;;;3501:398:9;;;;;580:5194:11;-1:-1:-1;;;580:5194:11;;;;;;;;;-1:-1:-1;;;580:5194:11;;;;;;;;3019:1149:9;4145:12;;;;;:::o;580:5194:11:-;;;;;;;;;;;;;;;:::o;:::-;;;;;;;;;;;;;;;;;;;:::o;:::-;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;;;:::i;:::-;;;;;;;;;;:::i;:::-;:::o;5137:634::-;;;;;;;;580:5194;;;;;;;;;;;5387:71;;;580:5194;;;;5387:71;;;580:5194;;;;;;;;;;;;;;;;;;;;;;;;;;;;5387:71;;580:5194;;;;;;-1:-1:-1;;;;;580:5194:11;;;;;;;-1:-1:-1;5465:269:11;5502:3;580:5194;;5485:15;;;;;5671:55;5601:51;5526:56;5502:3;5565:7;;;;;:::i;:::-;;580:5194;;;;5548:33;;;;580:5194;5548:33;;;;;;:::i;:::-;5526:56;:::i;:::-;5640:7;;;;;:::i;:::-;;:10;580:5194;;;;;;;;;5623:28;;;580:5194;5623:28;;;;;;:::i;5601:51::-;5710:7;;;;;:::i;:::-;;:14;580:5194;;;;;;;;;5693:32;;;580:5194;5693:32;;;;;;:::i;5671:55::-;5502:3;;:::i;:::-;5470:13;;;5485:15;;;;;;;;;580:5194;;;;5747:18;5137:634;:::o

ipfs://2428c4007ad09fdc4a08c2d2fbe0daa040c81de0bf8d950346e0d9282a34504a