Contract

Contract Source Code (Solidity Standard Json-Input format)

IDE

• Blockscan IDE
• 🤖 Code ReaderBeta

More Options

• Similar
• Submit Audit
• Compare

//SPDX-License-Identifier:MIT

pragma solidity ^0.8.28;

import "erc721a/contracts/ERC721A.sol";
import "@openzeppelin/contracts/access/Ownable.sol";
import "@openzeppelin/contracts/utils/cryptography/MerkleProof.sol";

contract LAMBS is ERC721A, Ownable 
{

    bool public isTradingEnabled;
    bool public whitelistMintState;
    bool public publicMintState;
    uint256 public maxSupply;
    uint256 public whitelistMintPrice;
    uint256 public publicMintPrice;
    uint256 public teamMintAmount;
    bytes32 public merkleRoot;
    string public baseURI;

    constructor 
    ( 
        bool newTradingState,
        bool newWhitelistMintState,
        bool newPublicMintState,
        uint256 newMaxSupply,
        uint256 newWhitelistMintPrice,
        uint256 newPublicMintPrice,
        uint256 newTeamMintAmount,
        bytes32 newMerkleRoot,
        string memory newBaseURI
    ) 
        ERC721A ( "LAMBS", "LBS" ) 
        Ownable ( msg.sender ) 
    {
        setTradingState ( newTradingState );
        setWhitelistMintState ( newWhitelistMintState );
        setPublicMintState ( newPublicMintState );
        setMaxSupply ( newMaxSupply );
        setWhitelistMintPrice ( newWhitelistMintPrice );
        setPublicMintPrice ( newPublicMintPrice );
        setTeamMintAmount ( newTeamMintAmount );
        setMerkleRoot ( newMerkleRoot );
        setBaseURI ( newBaseURI );
    }

    modifier globalMintCompliance 
    ( 
        uint256 quantity 
    ) 
    {
        require 
        ( 
            totalSupply() + quantity <= maxSupply, 
            "Attempted mint amount exceeds total supply!" 
        );
        _;
    }

    modifier whitelistMintCompliance 
    ( 
        uint256 quantity, 
        bytes32 [] calldata merkleProof
    ) 
    {
        require 
        ( 
            whitelistMintState, 
            "Whitelist mint phase has not started yet!"
        );
        require 
        (
            isWhitelisted ( merkleProof ),
            "You are not whitelisted!"
        );
        require 
        ( 
            quantity + balanceOf( msg.sender ) <= 2, 
            "Maximum whitelist mint limit per user is 2!" 
        );
        require 
        ( 
            msg.value >= quantity * whitelistMintPrice, 
            "Insufficient funds!"
        );        
        _;
    }

    modifier publicMintCompliance 
    ( 
        uint256 quantity 
    ) 
    {
        require 
        ( 
            publicMintState, 
            "Public mint phase has not started yet!" 
        );
        require 
        ( 
            quantity + balanceOf( msg.sender ) <= 5, 
            "Maximum mint limit per user is 5!" 
        );
        require 
        ( 
            msg.value >= quantity * publicMintPrice,
            "Insufficient funds!" 
        );
        _;
    }

    function _baseURI 
    (
    ) 
        internal view virtual override 
        returns ( string memory )
    {
        return baseURI;
    }

    function _startTokenId 
    (
    ) 
        internal view virtual override 
        returns ( uint256 ) 
    {
        return 1;
    }

    function _beforeTokenTransfers 
    ( 
        address from, 
        address to, 
        uint256 startTokenId, 
        uint256 quantity 
    ) 
        internal override 
    {
        if ( from == address( 0 ) )
        {
            return;
        }
        require 
        ( 
            isTradingEnabled, 
            "Trading is currently disabled"
        );
        super._beforeTokenTransfers ( from, to, startTokenId, quantity );
    }

    function isWhitelisted 
    ( 
        bytes32 [] calldata merkleProof
    )
        public view returns ( bool )
    {
        bytes32 merkleLeaf = keccak256( abi.encodePacked( msg.sender ) );
        return MerkleProof.verify ( merkleProof, merkleRoot, merkleLeaf );
    }

    function setMerkleRoot 
    (
        bytes32 newMerkleRoot 
    )
        public onlyOwner
    {
        merkleRoot = newMerkleRoot;
    }

    function setTradingState 
    ( 
        bool newTradingState 
    ) 
        public onlyOwner 
    {
        isTradingEnabled = newTradingState;
    }

    function setMaxSupply 
    ( 
        uint256 newMaxSupply 
    ) 
        public onlyOwner
    {
        maxSupply = newMaxSupply;
    }

    function setBaseURI 
    ( 
        string memory newBaseURI 
    ) 
        public onlyOwner 
    {
        baseURI = newBaseURI;
    }

    function setTeamMintAmount 
    ( 
        uint256 newTeamMintAmount 
    ) 
        public onlyOwner
    {
        teamMintAmount = newTeamMintAmount;
    }

    function setWhitelistMintState 
    ( 
        bool newWhitelistMintState 
    ) 
        public onlyOwner
    {
        whitelistMintState = newWhitelistMintState;
    }

    function setWhitelistMintPrice 
    ( 
        uint256 newWhitelistMintPrice 
    ) 
        public onlyOwner 
    {
        whitelistMintPrice = newWhitelistMintPrice;
    }

    function setPublicMintState 
    ( 
        bool newPublicMintState 
    ) 
        public onlyOwner 
    {
        publicMintState = newPublicMintState;
    }

    function setPublicMintPrice 
    ( 
        uint256 newPublicMintPrice 
    ) 
        public onlyOwner
    {
        publicMintPrice = newPublicMintPrice;
    }

    function whitelistMint 
    (
        uint256 quantity, 
        bytes32 [] calldata merkleProof
    ) 
        globalMintCompliance ( quantity )
        whitelistMintCompliance ( quantity, merkleProof )
        external payable 
    {
        _mint ( msg.sender, quantity );
    }

    function publicMint 
    (
        uint256 quantity 
    ) 
        globalMintCompliance ( quantity )
        publicMintCompliance ( quantity )
        external payable 
    {
        _mint ( msg.sender, quantity );
    }

    function teamMint 
    (
    ) 
        external onlyOwner 
    {
        _mint ( msg.sender, teamMintAmount );
    }

    function withdraw 
    (
    ) 
        external onlyOwner 
    {
        (bool success, ) = msg.sender.call{value: address(this).balance}("");
        require ( success, "Withdrawal failed." ); 
    }

}

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

pragma solidity ^0.8.20;

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

/**
 * @dev These functions deal with verification of Merkle Tree proofs.
 *
 * The tree and the proofs can be generated using our
 * https://github.com/OpenZeppelin/merkle-tree[JavaScript library].
 * You will find a quickstart guide in the readme.
 *
 * WARNING: You should avoid using leaf values that are 64 bytes long prior to
 * hashing, or use a hash function other than keccak256 for hashing leaves.
 * This is because the concatenation of a sorted pair of internal nodes in
 * the Merkle tree could be reinterpreted as a leaf value.
 * OpenZeppelin's JavaScript library generates Merkle trees that are safe
 * against this attack out of the box.
 *
 * IMPORTANT: Consider memory side-effects when using custom hashing functions
 * that access memory in an unsafe way.
 *
 * NOTE: This library supports proof verification for merkle trees built using
 * custom _commutative_ hashing functions (i.e. `H(a, b) == H(b, a)`). Proving
 * leaf inclusion in trees built using non-commutative hashing functions requires
 * additional logic that is not supported by this library.
 */
library MerkleProof {
    /**
     *@dev The multiproof provided is not valid.
     */
    error MerkleProofInvalidMultiproof();

    /**
     * @dev Returns true if a `leaf` can be proved to be a part of a Merkle tree
     * defined by `root`. For this, a `proof` must be provided, containing
     * sibling hashes on the branch from the leaf to the root of the tree. Each
     * pair of leaves and each pair of pre-images are assumed to be sorted.
     *
     * This version handles proofs in memory with the default hashing function.
     */
    function verify(bytes32[] memory proof, bytes32 root, bytes32 leaf) internal pure returns (bool) {
        return processProof(proof, leaf) == root;
    }

    /**
     * @dev Returns the rebuilt hash obtained by traversing a Merkle tree up
     * from `leaf` using `proof`. A `proof` is valid if and only if the rebuilt
     * hash matches the root of the tree. When processing the proof, the pairs
     * of leaves & pre-images are assumed to be sorted.
     *
     * This version handles proofs in memory with the default hashing function.
     */
    function processProof(bytes32[] memory proof, bytes32 leaf) internal pure returns (bytes32) {
        bytes32 computedHash = leaf;
        for (uint256 i = 0; i < proof.length; i++) {
            computedHash = Hashes.commutativeKeccak256(computedHash, proof[i]);
        }
        return computedHash;
    }

    /**
     * @dev Returns true if a `leaf` can be proved to be a part of a Merkle tree
     * defined by `root`. For this, a `proof` must be provided, containing
     * sibling hashes on the branch from the leaf to the root of the tree. Each
     * pair of leaves and each pair of pre-images are assumed to be sorted.
     *
     * This version handles proofs in memory with a custom hashing function.
     */
    function verify(
        bytes32[] memory proof,
        bytes32 root,
        bytes32 leaf,
        function(bytes32, bytes32) view returns (bytes32) hasher
    ) internal view returns (bool) {
        return processProof(proof, leaf, hasher) == root;
    }

    /**
     * @dev Returns the rebuilt hash obtained by traversing a Merkle tree up
     * from `leaf` using `proof`. A `proof` is valid if and only if the rebuilt
     * hash matches the root of the tree. When processing the proof, the pairs
     * of leaves & pre-images are assumed to be sorted.
     *
     * This version handles proofs in memory with a custom hashing function.
     */
    function processProof(
        bytes32[] memory proof,
        bytes32 leaf,
        function(bytes32, bytes32) view returns (bytes32) hasher
    ) internal view returns (bytes32) {
        bytes32 computedHash = leaf;
        for (uint256 i = 0; i < proof.length; i++) {
            computedHash = hasher(computedHash, proof[i]);
        }
        return computedHash;
    }

    /**
     * @dev Returns true if a `leaf` can be proved to be a part of a Merkle tree
     * defined by `root`. For this, a `proof` must be provided, containing
     * sibling hashes on the branch from the leaf to the root of the tree. Each
     * pair of leaves and each pair of pre-images are assumed to be sorted.
     *
     * This version handles proofs in calldata with the default hashing function.
     */
    function verifyCalldata(bytes32[] calldata proof, bytes32 root, bytes32 leaf) internal pure returns (bool) {
        return processProofCalldata(proof, leaf) == root;
    }

    /**
     * @dev Returns the rebuilt hash obtained by traversing a Merkle tree up
     * from `leaf` using `proof`. A `proof` is valid if and only if the rebuilt
     * hash matches the root of the tree. When processing the proof, the pairs
     * of leaves & pre-images are assumed to be sorted.
     *
     * This version handles proofs in calldata with the default hashing function.
     */
    function processProofCalldata(bytes32[] calldata proof, bytes32 leaf) internal pure returns (bytes32) {
        bytes32 computedHash = leaf;
        for (uint256 i = 0; i < proof.length; i++) {
            computedHash = Hashes.commutativeKeccak256(computedHash, proof[i]);
        }
        return computedHash;
    }

    /**
     * @dev Returns true if a `leaf` can be proved to be a part of a Merkle tree
     * defined by `root`. For this, a `proof` must be provided, containing
     * sibling hashes on the branch from the leaf to the root of the tree. Each
     * pair of leaves and each pair of pre-images are assumed to be sorted.
     *
     * This version handles proofs in calldata with a custom hashing function.
     */
    function verifyCalldata(
        bytes32[] calldata proof,
        bytes32 root,
        bytes32 leaf,
        function(bytes32, bytes32) view returns (bytes32) hasher
    ) internal view returns (bool) {
        return processProofCalldata(proof, leaf, hasher) == root;
    }

    /**
     * @dev Returns the rebuilt hash obtained by traversing a Merkle tree up
     * from `leaf` using `proof`. A `proof` is valid if and only if the rebuilt
     * hash matches the root of the tree. When processing the proof, the pairs
     * of leaves & pre-images are assumed to be sorted.
     *
     * This version handles proofs in calldata with a custom hashing function.
     */
    function processProofCalldata(
        bytes32[] calldata proof,
        bytes32 leaf,
        function(bytes32, bytes32) view returns (bytes32) hasher
    ) internal view returns (bytes32) {
        bytes32 computedHash = leaf;
        for (uint256 i = 0; i < proof.length; i++) {
            computedHash = hasher(computedHash, proof[i]);
        }
        return computedHash;
    }

    /**
     * @dev Returns true if the `leaves` can be simultaneously proven to be a part of a Merkle tree defined by
     * `root`, according to `proof` and `proofFlags` as described in {processMultiProof}.
     *
     * This version handles multiproofs in memory with the default hashing function.
     *
     * CAUTION: Not all Merkle trees admit multiproofs. See {processMultiProof} for details.
     *
     * NOTE: Consider the case where `root == proof[0] && leaves.length == 0` as it will return `true`.
     * The `leaves` must be validated independently. See {processMultiProof}.
     */
    function multiProofVerify(
        bytes32[] memory proof,
        bool[] memory proofFlags,
        bytes32 root,
        bytes32[] memory leaves
    ) internal pure returns (bool) {
        return processMultiProof(proof, proofFlags, leaves) == root;
    }

    /**
     * @dev Returns the root of a tree reconstructed from `leaves` and sibling nodes in `proof`. The reconstruction
     * proceeds by incrementally reconstructing all inner nodes by combining a leaf/inner node with either another
     * leaf/inner node or a proof sibling node, depending on whether each `proofFlags` item is true or false
     * respectively.
     *
     * This version handles multiproofs in memory with the default hashing function.
     *
     * CAUTION: Not all Merkle trees admit multiproofs. To use multiproofs, it is sufficient to ensure that: 1) the tree
     * is complete (but not necessarily perfect), 2) the leaves to be proven are in the opposite order they are in the
     * tree (i.e., as seen from right to left starting at the deepest layer and continuing at the next layer).
     *
     * NOTE: The _empty set_ (i.e. the case where `proof.length == 1 && leaves.length == 0`) is considered a no-op,
     * and therefore a valid multiproof (i.e. it returns `proof[0]`). Consider disallowing this case if you're not
     * validating the leaves elsewhere.
     */
    function processMultiProof(
        bytes32[] memory proof,
        bool[] memory proofFlags,
        bytes32[] memory leaves
    ) internal pure returns (bytes32 merkleRoot) {
        // This function rebuilds the root hash by traversing the tree up from the leaves. The root is rebuilt by
        // consuming and producing values on a queue. The queue starts with the `leaves` array, then goes onto the
        // `hashes` array. At the end of the process, the last hash in the `hashes` array should contain the root of
        // the Merkle tree.
        uint256 leavesLen = leaves.length;
        uint256 proofFlagsLen = proofFlags.length;

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

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

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

    /**
     * @dev Returns true if the `leaves` can be simultaneously proven to be a part of a Merkle tree defined by
     * `root`, according to `proof` and `proofFlags` as described in {processMultiProof}.
     *
     * This version handles multiproofs in memory with a custom hashing function.
     *
     * CAUTION: Not all Merkle trees admit multiproofs. See {processMultiProof} for details.
     *
     * NOTE: Consider the case where `root == proof[0] && leaves.length == 0` as it will return `true`.
     * The `leaves` must be validated independently. See {processMultiProof}.
     */
    function multiProofVerify(
        bytes32[] memory proof,
        bool[] memory proofFlags,
        bytes32 root,
        bytes32[] memory leaves,
        function(bytes32, bytes32) view returns (bytes32) hasher
    ) internal view returns (bool) {
        return processMultiProof(proof, proofFlags, leaves, hasher) == root;
    }

    /**
     * @dev Returns the root of a tree reconstructed from `leaves` and sibling nodes in `proof`. The reconstruction
     * proceeds by incrementally reconstructing all inner nodes by combining a leaf/inner node with either another
     * leaf/inner node or a proof sibling node, depending on whether each `proofFlags` item is true or false
     * respectively.
     *
     * This version handles multiproofs in memory with a custom hashing function.
     *
     * CAUTION: Not all Merkle trees admit multiproofs. To use multiproofs, it is sufficient to ensure that: 1) the tree
     * is complete (but not necessarily perfect), 2) the leaves to be proven are in the opposite order they are in the
     * tree (i.e., as seen from right to left starting at the deepest layer and continuing at the next layer).
     *
     * NOTE: The _empty set_ (i.e. the case where `proof.length == 1 && leaves.length == 0`) is considered a no-op,
     * and therefore a valid multiproof (i.e. it returns `proof[0]`). Consider disallowing this case if you're not
     * validating the leaves elsewhere.
     */
    function processMultiProof(
        bytes32[] memory proof,
        bool[] memory proofFlags,
        bytes32[] memory leaves,
        function(bytes32, bytes32) view returns (bytes32) hasher
    ) internal view returns (bytes32 merkleRoot) {
        // This function rebuilds the root hash by traversing the tree up from the leaves. The root is rebuilt by
        // consuming and producing values on a queue. The queue starts with the `leaves` array, then goes onto the
        // `hashes` array. At the end of the process, the last hash in the `hashes` array should contain the root of
        // the Merkle tree.
        uint256 leavesLen = leaves.length;
        uint256 proofFlagsLen = proofFlags.length;

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

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

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

    /**
     * @dev Returns true if the `leaves` can be simultaneously proven to be a part of a Merkle tree defined by
     * `root`, according to `proof` and `proofFlags` as described in {processMultiProof}.
     *
     * This version handles multiproofs in calldata with the default hashing function.
     *
     * CAUTION: Not all Merkle trees admit multiproofs. See {processMultiProof} for details.
     *
     * NOTE: Consider the case where `root == proof[0] && leaves.length == 0` as it will return `true`.
     * The `leaves` must be validated independently. See {processMultiProofCalldata}.
     */
    function multiProofVerifyCalldata(
        bytes32[] calldata proof,
        bool[] calldata proofFlags,
        bytes32 root,
        bytes32[] memory leaves
    ) internal pure returns (bool) {
        return processMultiProofCalldata(proof, proofFlags, leaves) == root;
    }

    /**
     * @dev Returns the root of a tree reconstructed from `leaves` and sibling nodes in `proof`. The reconstruction
     * proceeds by incrementally reconstructing all inner nodes by combining a leaf/inner node with either another
     * leaf/inner node or a proof sibling node, depending on whether each `proofFlags` item is true or false
     * respectively.
     *
     * This version handles multiproofs in calldata with the default hashing function.
     *
     * CAUTION: Not all Merkle trees admit multiproofs. To use multiproofs, it is sufficient to ensure that: 1) the tree
     * is complete (but not necessarily perfect), 2) the leaves to be proven are in the opposite order they are in the
     * tree (i.e., as seen from right to left starting at the deepest layer and continuing at the next layer).
     *
     * NOTE: The _empty set_ (i.e. the case where `proof.length == 1 && leaves.length == 0`) is considered a no-op,
     * and therefore a valid multiproof (i.e. it returns `proof[0]`). Consider disallowing this case if you're not
     * validating the leaves elsewhere.
     */
    function processMultiProofCalldata(
        bytes32[] calldata proof,
        bool[] calldata proofFlags,
        bytes32[] memory leaves
    ) internal pure returns (bytes32 merkleRoot) {
        // This function rebuilds the root hash by traversing the tree up from the leaves. The root is rebuilt by
        // consuming and producing values on a queue. The queue starts with the `leaves` array, then goes onto the
        // `hashes` array. At the end of the process, the last hash in the `hashes` array should contain the root of
        // the Merkle tree.
        uint256 leavesLen = leaves.length;
        uint256 proofFlagsLen = proofFlags.length;

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

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

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

    /**
     * @dev Returns true if the `leaves` can be simultaneously proven to be a part of a Merkle tree defined by
     * `root`, according to `proof` and `proofFlags` as described in {processMultiProof}.
     *
     * This version handles multiproofs in calldata with a custom hashing function.
     *
     * CAUTION: Not all Merkle trees admit multiproofs. See {processMultiProof} for details.
     *
     * NOTE: Consider the case where `root == proof[0] && leaves.length == 0` as it will return `true`.
     * The `leaves` must be validated independently. See {processMultiProofCalldata}.
     */
    function multiProofVerifyCalldata(
        bytes32[] calldata proof,
        bool[] calldata proofFlags,
        bytes32 root,
        bytes32[] memory leaves,
        function(bytes32, bytes32) view returns (bytes32) hasher
    ) internal view returns (bool) {
        return processMultiProofCalldata(proof, proofFlags, leaves, hasher) == root;
    }

    /**
     * @dev Returns the root of a tree reconstructed from `leaves` and sibling nodes in `proof`. The reconstruction
     * proceeds by incrementally reconstructing all inner nodes by combining a leaf/inner node with either another
     * leaf/inner node or a proof sibling node, depending on whether each `proofFlags` item is true or false
     * respectively.
     *
     * This version handles multiproofs in calldata with a custom hashing function.
     *
     * CAUTION: Not all Merkle trees admit multiproofs. To use multiproofs, it is sufficient to ensure that: 1) the tree
     * is complete (but not necessarily perfect), 2) the leaves to be proven are in the opposite order they are in the
     * tree (i.e., as seen from right to left starting at the deepest layer and continuing at the next layer).
     *
     * NOTE: The _empty set_ (i.e. the case where `proof.length == 1 && leaves.length == 0`) is considered a no-op,
     * and therefore a valid multiproof (i.e. it returns `proof[0]`). Consider disallowing this case if you're not
     * validating the leaves elsewhere.
     */
    function processMultiProofCalldata(
        bytes32[] calldata proof,
        bool[] calldata proofFlags,
        bytes32[] memory leaves,
        function(bytes32, bytes32) view returns (bytes32) hasher
    ) internal view returns (bytes32 merkleRoot) {
        // This function rebuilds the root hash by traversing the tree up from the leaves. The root is rebuilt by
        // consuming and producing values on a queue. The queue starts with the `leaves` array, then goes onto the
        // `hashes` array. At the end of the process, the last hash in the `hashes` array should contain the root of
        // the Merkle tree.
        uint256 leavesLen = leaves.length;
        uint256 proofFlagsLen = proofFlags.length;

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

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

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

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

pragma solidity ^0.8.20;

import {Context} from "../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.
 *
 * The initial owner is set to the address provided by the deployer. This can
 * later be changed with {transferOwnership}.
 *
 * This module is used through inheritance. It will make available the modifier
 * `onlyOwner`, which can be applied to your functions to restrict their use to
 * the owner.
 */
abstract contract Ownable is Context {
    address private _owner;

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

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

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

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

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

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

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

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

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

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

// SPDX-License-Identifier: MIT
// ERC721A Contracts v4.3.0
// Creator: Chiru Labs

pragma solidity ^0.8.4;

import './IERC721A.sol';

/**
 * @dev Interface of ERC721 token receiver.
 */
interface ERC721A__IERC721Receiver {
    function onERC721Received(
        address operator,
        address from,
        uint256 tokenId,
        bytes calldata data
    ) external returns (bytes4);
}

/**
 * @title ERC721A
 *
 * @dev Implementation of the [ERC721](https://eips.ethereum.org/EIPS/eip-721)
 * Non-Fungible Token Standard, including the Metadata extension.
 * Optimized for lower gas during batch mints.
 *
 * Token IDs are minted in sequential order (e.g. 0, 1, 2, 3, ...)
 * starting from `_startTokenId()`.
 *
 * The `_sequentialUpTo()` function can be overriden to enable spot mints
 * (i.e. non-consecutive mints) for `tokenId`s greater than `_sequentialUpTo()`.
 *
 * Assumptions:
 *
 * - An owner cannot have more than 2**64 - 1 (max value of uint64) of supply.
 * - The maximum token ID cannot exceed 2**256 - 1 (max value of uint256).
 */
contract ERC721A is IERC721A {
    // Bypass for a `--via-ir` bug (https://github.com/chiru-labs/ERC721A/pull/364).
    struct TokenApprovalRef {
        address value;
    }

    // =============================================================
    //                           CONSTANTS
    // =============================================================

    // Mask of an entry in packed address data.
    uint256 private constant _BITMASK_ADDRESS_DATA_ENTRY = (1 << 64) - 1;

    // The bit position of `numberMinted` in packed address data.
    uint256 private constant _BITPOS_NUMBER_MINTED = 64;

    // The bit position of `numberBurned` in packed address data.
    uint256 private constant _BITPOS_NUMBER_BURNED = 128;

    // The bit position of `aux` in packed address data.
    uint256 private constant _BITPOS_AUX = 192;

    // Mask of all 256 bits in packed address data except the 64 bits for `aux`.
    uint256 private constant _BITMASK_AUX_COMPLEMENT = (1 << 192) - 1;

    // The bit position of `startTimestamp` in packed ownership.
    uint256 private constant _BITPOS_START_TIMESTAMP = 160;

    // The bit mask of the `burned` bit in packed ownership.
    uint256 private constant _BITMASK_BURNED = 1 << 224;

    // The bit position of the `nextInitialized` bit in packed ownership.
    uint256 private constant _BITPOS_NEXT_INITIALIZED = 225;

    // The bit mask of the `nextInitialized` bit in packed ownership.
    uint256 private constant _BITMASK_NEXT_INITIALIZED = 1 << 225;

    // The bit position of `extraData` in packed ownership.
    uint256 private constant _BITPOS_EXTRA_DATA = 232;

    // Mask of all 256 bits in a packed ownership except the 24 bits for `extraData`.
    uint256 private constant _BITMASK_EXTRA_DATA_COMPLEMENT = (1 << 232) - 1;

    // The mask of the lower 160 bits for addresses.
    uint256 private constant _BITMASK_ADDRESS = (1 << 160) - 1;

    // The maximum `quantity` that can be minted with {_mintERC2309}.
    // This limit is to prevent overflows on the address data entries.
    // For a limit of 5000, a total of 3.689e15 calls to {_mintERC2309}
    // is required to cause an overflow, which is unrealistic.
    uint256 private constant _MAX_MINT_ERC2309_QUANTITY_LIMIT = 5000;

    // The `Transfer` event signature is given by:
    // `keccak256(bytes("Transfer(address,address,uint256)"))`.
    bytes32 private constant _TRANSFER_EVENT_SIGNATURE =
        0xddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef;

    // =============================================================
    //                            STORAGE
    // =============================================================

    // The next token ID to be minted.
    uint256 private _currentIndex;

    // The number of tokens burned.
    uint256 private _burnCounter;

    // Token name
    string private _name;

    // Token symbol
    string private _symbol;

    // Mapping from token ID to ownership details
    // An empty struct value does not necessarily mean the token is unowned.
    // See {_packedOwnershipOf} implementation for details.
    //
    // Bits Layout:
    // - [0..159]   `addr`
    // - [160..223] `startTimestamp`
    // - [224]      `burned`
    // - [225]      `nextInitialized`
    // - [232..255] `extraData`
    mapping(uint256 => uint256) private _packedOwnerships;

    // Mapping owner address to address data.
    //
    // Bits Layout:
    // - [0..63]    `balance`
    // - [64..127]  `numberMinted`
    // - [128..191] `numberBurned`
    // - [192..255] `aux`
    mapping(address => uint256) private _packedAddressData;

    // Mapping from token ID to approved address.
    mapping(uint256 => TokenApprovalRef) private _tokenApprovals;

    // Mapping from owner to operator approvals
    mapping(address => mapping(address => bool)) private _operatorApprovals;

    // The amount of tokens minted above `_sequentialUpTo()`.
    // We call these spot mints (i.e. non-sequential mints).
    uint256 private _spotMinted;

    // =============================================================
    //                          CONSTRUCTOR
    // =============================================================

    constructor(string memory name_, string memory symbol_) {
        _name = name_;
        _symbol = symbol_;
        _currentIndex = _startTokenId();

        if (_sequentialUpTo() < _startTokenId()) _revert(SequentialUpToTooSmall.selector);
    }

    // =============================================================
    //                   TOKEN COUNTING OPERATIONS
    // =============================================================

    /**
     * @dev Returns the starting token ID for sequential mints.
     *
     * Override this function to change the starting token ID for sequential mints.
     *
     * Note: The value returned must never change after any tokens have been minted.
     */
    function _startTokenId() internal view virtual returns (uint256) {
        return 0;
    }

    /**
     * @dev Returns the maximum token ID (inclusive) for sequential mints.
     *
     * Override this function to return a value less than 2**256 - 1,
     * but greater than `_startTokenId()`, to enable spot (non-sequential) mints.
     *
     * Note: The value returned must never change after any tokens have been minted.
     */
    function _sequentialUpTo() internal view virtual returns (uint256) {
        return type(uint256).max;
    }

    /**
     * @dev Returns the next token ID to be minted.
     */
    function _nextTokenId() internal view virtual returns (uint256) {
        return _currentIndex;
    }

    /**
     * @dev Returns the total number of tokens in existence.
     * Burned tokens will reduce the count.
     * To get the total number of tokens minted, please see {_totalMinted}.
     */
    function totalSupply() public view virtual override returns (uint256 result) {
        // Counter underflow is impossible as `_burnCounter` cannot be incremented
        // more than `_currentIndex + _spotMinted - _startTokenId()` times.
        unchecked {
            // With spot minting, the intermediate `result` can be temporarily negative,
            // and the computation must be unchecked.
            result = _currentIndex - _burnCounter - _startTokenId();
            if (_sequentialUpTo() != type(uint256).max) result += _spotMinted;
        }
    }

    /**
     * @dev Returns the total amount of tokens minted in the contract.
     */
    function _totalMinted() internal view virtual returns (uint256 result) {
        // Counter underflow is impossible as `_currentIndex` does not decrement,
        // and it is initialized to `_startTokenId()`.
        unchecked {
            result = _currentIndex - _startTokenId();
            if (_sequentialUpTo() != type(uint256).max) result += _spotMinted;
        }
    }

    /**
     * @dev Returns the total number of tokens burned.
     */
    function _totalBurned() internal view virtual returns (uint256) {
        return _burnCounter;
    }

    /**
     * @dev Returns the total number of tokens that are spot-minted.
     */
    function _totalSpotMinted() internal view virtual returns (uint256) {
        return _spotMinted;
    }

    // =============================================================
    //                    ADDRESS DATA OPERATIONS
    // =============================================================

    /**
     * @dev Returns the number of tokens in `owner`'s account.
     */
    function balanceOf(address owner) public view virtual override returns (uint256) {
        if (owner == address(0)) _revert(BalanceQueryForZeroAddress.selector);
        return _packedAddressData[owner] & _BITMASK_ADDRESS_DATA_ENTRY;
    }

    /**
     * Returns the number of tokens minted by `owner`.
     */
    function _numberMinted(address owner) internal view returns (uint256) {
        return (_packedAddressData[owner] >> _BITPOS_NUMBER_MINTED) & _BITMASK_ADDRESS_DATA_ENTRY;
    }

    /**
     * Returns the number of tokens burned by or on behalf of `owner`.
     */
    function _numberBurned(address owner) internal view returns (uint256) {
        return (_packedAddressData[owner] >> _BITPOS_NUMBER_BURNED) & _BITMASK_ADDRESS_DATA_ENTRY;
    }

    /**
     * Returns the auxiliary data for `owner`. (e.g. number of whitelist mint slots used).
     */
    function _getAux(address owner) internal view returns (uint64) {
        return uint64(_packedAddressData[owner] >> _BITPOS_AUX);
    }

    /**
     * Sets the auxiliary data for `owner`. (e.g. number of whitelist mint slots used).
     * If there are multiple variables, please pack them into a uint64.
     */
    function _setAux(address owner, uint64 aux) internal virtual {
        uint256 packed = _packedAddressData[owner];
        uint256 auxCasted;
        // Cast `aux` with assembly to avoid redundant masking.
        assembly {
            auxCasted := aux
        }
        packed = (packed & _BITMASK_AUX_COMPLEMENT) | (auxCasted << _BITPOS_AUX);
        _packedAddressData[owner] = packed;
    }

    // =============================================================
    //                            IERC165
    // =============================================================

    /**
     * @dev Returns true if this contract implements the interface defined by
     * `interfaceId`. See the corresponding
     * [EIP section](https://eips.ethereum.org/EIPS/eip-165#how-interfaces-are-identified)
     * to learn more about how these ids are created.
     *
     * This function call must use less than 30000 gas.
     */
    function supportsInterface(bytes4 interfaceId) public view virtual override returns (bool) {
        // The interface IDs are constants representing the first 4 bytes
        // of the XOR of all function selectors in the interface.
        // See: [ERC165](https://eips.ethereum.org/EIPS/eip-165)
        // (e.g. `bytes4(i.functionA.selector ^ i.functionB.selector ^ ...)`)
        return
            interfaceId == 0x01ffc9a7 || // ERC165 interface ID for ERC165.
            interfaceId == 0x80ac58cd || // ERC165 interface ID for ERC721.
            interfaceId == 0x5b5e139f; // ERC165 interface ID for ERC721Metadata.
    }

    // =============================================================
    //                        IERC721Metadata
    // =============================================================

    /**
     * @dev Returns the token collection name.
     */
    function name() public view virtual override returns (string memory) {
        return _name;
    }

    /**
     * @dev Returns the token collection symbol.
     */
    function symbol() public view virtual override returns (string memory) {
        return _symbol;
    }

    /**
     * @dev Returns the Uniform Resource Identifier (URI) for `tokenId` token.
     */
    function tokenURI(uint256 tokenId) public view virtual override returns (string memory) {
        if (!_exists(tokenId)) _revert(URIQueryForNonexistentToken.selector);

        string memory baseURI = _baseURI();
        return bytes(baseURI).length != 0 ? string(abi.encodePacked(baseURI, _toString(tokenId))) : '';
    }

    /**
     * @dev Base URI for computing {tokenURI}. If set, the resulting URI for each
     * token will be the concatenation of the `baseURI` and the `tokenId`. Empty
     * by default, it can be overridden in child contracts.
     */
    function _baseURI() internal view virtual returns (string memory) {
        return '';
    }

    // =============================================================
    //                     OWNERSHIPS OPERATIONS
    // =============================================================

    /**
     * @dev Returns the owner of the `tokenId` token.
     *
     * Requirements:
     *
     * - `tokenId` must exist.
     */
    function ownerOf(uint256 tokenId) public view virtual override returns (address) {
        return address(uint160(_packedOwnershipOf(tokenId)));
    }

    /**
     * @dev Gas spent here starts off proportional to the maximum mint batch size.
     * It gradually moves to O(1) as tokens get transferred around over time.
     */
    function _ownershipOf(uint256 tokenId) internal view virtual returns (TokenOwnership memory) {
        return _unpackedOwnership(_packedOwnershipOf(tokenId));
    }

    /**
     * @dev Returns the unpacked `TokenOwnership` struct at `index`.
     */
    function _ownershipAt(uint256 index) internal view virtual returns (TokenOwnership memory) {
        return _unpackedOwnership(_packedOwnerships[index]);
    }

    /**
     * @dev Returns whether the ownership slot at `index` is initialized.
     * An uninitialized slot does not necessarily mean that the slot has no owner.
     */
    function _ownershipIsInitialized(uint256 index) internal view virtual returns (bool) {
        return _packedOwnerships[index] != 0;
    }

    /**
     * @dev Initializes the ownership slot minted at `index` for efficiency purposes.
     */
    function _initializeOwnershipAt(uint256 index) internal virtual {
        if (_packedOwnerships[index] == 0) {
            _packedOwnerships[index] = _packedOwnershipOf(index);
        }
    }

    /**
     * @dev Returns the packed ownership data of `tokenId`.
     */
    function _packedOwnershipOf(uint256 tokenId) private view returns (uint256 packed) {
        if (_startTokenId() <= tokenId) {
            packed = _packedOwnerships[tokenId];

            if (tokenId > _sequentialUpTo()) {
                if (_packedOwnershipExists(packed)) return packed;
                _revert(OwnerQueryForNonexistentToken.selector);
            }

            // If the data at the starting slot does not exist, start the scan.
            if (packed == 0) {
                if (tokenId >= _currentIndex) _revert(OwnerQueryForNonexistentToken.selector);
                // Invariant:
                // There will always be an initialized ownership slot
                // (i.e. `ownership.addr != address(0) && ownership.burned == false`)
                // before an unintialized ownership slot
                // (i.e. `ownership.addr == address(0) && ownership.burned == false`)
                // Hence, `tokenId` will not underflow.
                //
                // We can directly compare the packed value.
                // If the address is zero, packed will be zero.
                for (;;) {
                    unchecked {
                        packed = _packedOwnerships[--tokenId];
                    }
                    if (packed == 0) continue;
                    if (packed & _BITMASK_BURNED == 0) return packed;
                    // Otherwise, the token is burned, and we must revert.
                    // This handles the case of batch burned tokens, where only the burned bit
                    // of the starting slot is set, and remaining slots are left uninitialized.
                    _revert(OwnerQueryForNonexistentToken.selector);
                }
            }
            // Otherwise, the data exists and we can skip the scan.
            // This is possible because we have already achieved the target condition.
            // This saves 2143 gas on transfers of initialized tokens.
            // If the token is not burned, return `packed`. Otherwise, revert.
            if (packed & _BITMASK_BURNED == 0) return packed;
        }
        _revert(OwnerQueryForNonexistentToken.selector);
    }

    /**
     * @dev Returns the unpacked `TokenOwnership` struct from `packed`.
     */
    function _unpackedOwnership(uint256 packed) private pure returns (TokenOwnership memory ownership) {
        ownership.addr = address(uint160(packed));
        ownership.startTimestamp = uint64(packed >> _BITPOS_START_TIMESTAMP);
        ownership.burned = packed & _BITMASK_BURNED != 0;
        ownership.extraData = uint24(packed >> _BITPOS_EXTRA_DATA);
    }

    /**
     * @dev Packs ownership data into a single uint256.
     */
    function _packOwnershipData(address owner, uint256 flags) private view returns (uint256 result) {
        assembly {
            // Mask `owner` to the lower 160 bits, in case the upper bits somehow aren't clean.
            owner := and(owner, _BITMASK_ADDRESS)
            // `owner | (block.timestamp << _BITPOS_START_TIMESTAMP) | flags`.
            result := or(owner, or(shl(_BITPOS_START_TIMESTAMP, timestamp()), flags))
        }
    }

    /**
     * @dev Returns the `nextInitialized` flag set if `quantity` equals 1.
     */
    function _nextInitializedFlag(uint256 quantity) private pure returns (uint256 result) {
        // For branchless setting of the `nextInitialized` flag.
        assembly {
            // `(quantity == 1) << _BITPOS_NEXT_INITIALIZED`.
            result := shl(_BITPOS_NEXT_INITIALIZED, eq(quantity, 1))
        }
    }

    // =============================================================
    //                      APPROVAL OPERATIONS
    // =============================================================

    /**
     * @dev Gives permission to `to` to transfer `tokenId` token to another account. See {ERC721A-_approve}.
     *
     * Requirements:
     *
     * - The caller must own the token or be an approved operator.
     */
    function approve(address to, uint256 tokenId) public payable virtual override {
        _approve(to, tokenId, true);
    }

    /**
     * @dev Returns the account approved for `tokenId` token.
     *
     * Requirements:
     *
     * - `tokenId` must exist.
     */
    function getApproved(uint256 tokenId) public view virtual override returns (address) {
        if (!_exists(tokenId)) _revert(ApprovalQueryForNonexistentToken.selector);

        return _tokenApprovals[tokenId].value;
    }

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

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

    /**
     * @dev Returns whether `tokenId` exists.
     *
     * Tokens can be managed by their owner or approved accounts via {approve} or {setApprovalForAll}.
     *
     * Tokens start existing when they are minted. See {_mint}.
     */
    function _exists(uint256 tokenId) internal view virtual returns (bool result) {
        if (_startTokenId() <= tokenId) {
            if (tokenId > _sequentialUpTo()) return _packedOwnershipExists(_packedOwnerships[tokenId]);

            if (tokenId < _currentIndex) {
                uint256 packed;
                while ((packed = _packedOwnerships[tokenId]) == 0) --tokenId;
                result = packed & _BITMASK_BURNED == 0;
            }
        }
    }

    /**
     * @dev Returns whether `packed` represents a token that exists.
     */
    function _packedOwnershipExists(uint256 packed) private pure returns (bool result) {
        assembly {
            // The following is equivalent to `owner != address(0) && burned == false`.
            // Symbolically tested.
            result := gt(and(packed, _BITMASK_ADDRESS), and(packed, _BITMASK_BURNED))
        }
    }

    /**
     * @dev Returns whether `msgSender` is equal to `approvedAddress` or `owner`.
     */
    function _isSenderApprovedOrOwner(
        address approvedAddress,
        address owner,
        address msgSender
    ) private pure returns (bool result) {
        assembly {
            // Mask `owner` to the lower 160 bits, in case the upper bits somehow aren't clean.
            owner := and(owner, _BITMASK_ADDRESS)
            // Mask `msgSender` to the lower 160 bits, in case the upper bits somehow aren't clean.
            msgSender := and(msgSender, _BITMASK_ADDRESS)
            // `msgSender == owner || msgSender == approvedAddress`.
            result := or(eq(msgSender, owner), eq(msgSender, approvedAddress))
        }
    }

    /**
     * @dev Returns the storage slot and value for the approved address of `tokenId`.
     */
    function _getApprovedSlotAndAddress(uint256 tokenId)
        private
        view
        returns (uint256 approvedAddressSlot, address approvedAddress)
    {
        TokenApprovalRef storage tokenApproval = _tokenApprovals[tokenId];
        // The following is equivalent to `approvedAddress = _tokenApprovals[tokenId].value`.
        assembly {
            approvedAddressSlot := tokenApproval.slot
            approvedAddress := sload(approvedAddressSlot)
        }
    }

    // =============================================================
    //                      TRANSFER OPERATIONS
    // =============================================================

    /**
     * @dev Transfers `tokenId` from `from` to `to`.
     *
     * Requirements:
     *
     * - `from` cannot be the zero address.
     * - `to` cannot be the zero address.
     * - `tokenId` token must be owned by `from`.
     * - If the caller is not `from`, it must be approved to move this token
     * by either {approve} or {setApprovalForAll}.
     *
     * Emits a {Transfer} event.
     */
    function transferFrom(
        address from,
        address to,
        uint256 tokenId
    ) public payable virtual override {
        uint256 prevOwnershipPacked = _packedOwnershipOf(tokenId);

        // Mask `from` to the lower 160 bits, in case the upper bits somehow aren't clean.
        from = address(uint160(uint256(uint160(from)) & _BITMASK_ADDRESS));

        if (address(uint160(prevOwnershipPacked)) != from) _revert(TransferFromIncorrectOwner.selector);

        (uint256 approvedAddressSlot, address approvedAddress) = _getApprovedSlotAndAddress(tokenId);

        // The nested ifs save around 20+ gas over a compound boolean condition.
        if (!_isSenderApprovedOrOwner(approvedAddress, from, _msgSenderERC721A()))
            if (!isApprovedForAll(from, _msgSenderERC721A())) _revert(TransferCallerNotOwnerNorApproved.selector);

        _beforeTokenTransfers(from, to, tokenId, 1);

        // Clear approvals from the previous owner.
        assembly {
            if approvedAddress {
                // This is equivalent to `delete _tokenApprovals[tokenId]`.
                sstore(approvedAddressSlot, 0)
            }
        }

        // Underflow of the sender's balance is impossible because we check for
        // ownership above and the recipient's balance can't realistically overflow.
        // Counter overflow is incredibly unrealistic as `tokenId` would have to be 2**256.
        unchecked {
            // We can directly increment and decrement the balances.
            --_packedAddressData[from]; // Updates: `balance -= 1`.
            ++_packedAddressData[to]; // Updates: `balance += 1`.

            // Updates:
            // - `address` to the next owner.
            // - `startTimestamp` to the timestamp of transfering.
            // - `burned` to `false`.
            // - `nextInitialized` to `true`.
            _packedOwnerships[tokenId] = _packOwnershipData(
                to,
                _BITMASK_NEXT_INITIALIZED | _nextExtraData(from, to, prevOwnershipPacked)
            );

            // If the next slot may not have been initialized (i.e. `nextInitialized == false`) .
            if (prevOwnershipPacked & _BITMASK_NEXT_INITIALIZED == 0) {
                uint256 nextTokenId = tokenId + 1;
                // If the next slot's address is zero and not burned (i.e. packed value is zero).
                if (_packedOwnerships[nextTokenId] == 0) {
                    // If the next slot is within bounds.
                    if (nextTokenId != _currentIndex) {
                        // Initialize the next slot to maintain correctness for `ownerOf(tokenId + 1)`.
                        _packedOwnerships[nextTokenId] = prevOwnershipPacked;
                    }
                }
            }
        }

        // Mask `to` to the lower 160 bits, in case the upper bits somehow aren't clean.
        uint256 toMasked = uint256(uint160(to)) & _BITMASK_ADDRESS;
        assembly {
            // Emit the `Transfer` event.
            log4(
                0, // Start of data (0, since no data).
                0, // End of data (0, since no data).
                _TRANSFER_EVENT_SIGNATURE, // Signature.
                from, // `from`.
                toMasked, // `to`.
                tokenId // `tokenId`.
            )
        }
        if (toMasked == 0) _revert(TransferToZeroAddress.selector);

        _afterTokenTransfers(from, to, tokenId, 1);
    }

    /**
     * @dev Equivalent to `safeTransferFrom(from, to, tokenId, '')`.
     */
    function safeTransferFrom(
        address from,
        address to,
        uint256 tokenId
    ) public payable virtual override {
        safeTransferFrom(from, to, tokenId, '');
    }

    /**
     * @dev Safely transfers `tokenId` token from `from` to `to`.
     *
     * Requirements:
     *
     * - `from` cannot be the zero address.
     * - `to` cannot be the zero address.
     * - `tokenId` token must exist and be owned by `from`.
     * - If the caller is not `from`, it must be approved to move this token
     * by either {approve} or {setApprovalForAll}.
     * - If `to` refers to a smart contract, it must implement
     * {IERC721Receiver-onERC721Received}, which is called upon a safe transfer.
     *
     * Emits a {Transfer} event.
     */
    function safeTransferFrom(
        address from,
        address to,
        uint256 tokenId,
        bytes memory _data
    ) public payable virtual override {
        transferFrom(from, to, tokenId);
        if (to.code.length != 0)
            if (!_checkContractOnERC721Received(from, to, tokenId, _data)) {
                _revert(TransferToNonERC721ReceiverImplementer.selector);
            }
    }

    /**
     * @dev Hook that is called before a set of serially-ordered token IDs
     * are about to be transferred. This includes minting.
     * And also called before burning one token.
     *
     * `startTokenId` - the first token ID to be transferred.
     * `quantity` - the amount to be transferred.
     *
     * Calling conditions:
     *
     * - When `from` and `to` are both non-zero, `from`'s `tokenId` will be
     * transferred to `to`.
     * - When `from` is zero, `tokenId` will be minted for `to`.
     * - When `to` is zero, `tokenId` will be burned by `from`.
     * - `from` and `to` are never both zero.
     */
    function _beforeTokenTransfers(
        address from,
        address to,
        uint256 startTokenId,
        uint256 quantity
    ) internal virtual {}

    /**
     * @dev Hook that is called after a set of serially-ordered token IDs
     * have been transferred. This includes minting.
     * And also called after one token has been burned.
     *
     * `startTokenId` - the first token ID to be transferred.
     * `quantity` - the amount to be transferred.
     *
     * Calling conditions:
     *
     * - When `from` and `to` are both non-zero, `from`'s `tokenId` has been
     * transferred to `to`.
     * - When `from` is zero, `tokenId` has been minted for `to`.
     * - When `to` is zero, `tokenId` has been burned by `from`.
     * - `from` and `to` are never both zero.
     */
    function _afterTokenTransfers(
        address from,
        address to,
        uint256 startTokenId,
        uint256 quantity
    ) internal virtual {}

    /**
     * @dev Private function to invoke {IERC721Receiver-onERC721Received} on a target contract.
     *
     * `from` - Previous owner of the given token ID.
     * `to` - Target address that will receive the token.
     * `tokenId` - Token ID to be transferred.
     * `_data` - Optional data to send along with the call.
     *
     * Returns whether the call correctly returned the expected magic value.
     */
    function _checkContractOnERC721Received(
        address from,
        address to,
        uint256 tokenId,
        bytes memory _data
    ) private returns (bool) {
        try ERC721A__IERC721Receiver(to).onERC721Received(_msgSenderERC721A(), from, tokenId, _data) returns (
            bytes4 retval
        ) {
            return retval == ERC721A__IERC721Receiver(to).onERC721Received.selector;
        } catch (bytes memory reason) {
            if (reason.length == 0) {
                _revert(TransferToNonERC721ReceiverImplementer.selector);
            }
            assembly {
                revert(add(32, reason), mload(reason))
            }
        }
    }

    // =============================================================
    //                        MINT OPERATIONS
    // =============================================================

    /**
     * @dev Mints `quantity` tokens and transfers them to `to`.
     *
     * Requirements:
     *
     * - `to` cannot be the zero address.
     * - `quantity` must be greater than 0.
     *
     * Emits a {Transfer} event for each mint.
     */
    function _mint(address to, uint256 quantity) internal virtual {
        uint256 startTokenId = _currentIndex;
        if (quantity == 0) _revert(MintZeroQuantity.selector);

        _beforeTokenTransfers(address(0), to, startTokenId, quantity);

        // Overflows are incredibly unrealistic.
        // `balance` and `numberMinted` have a maximum limit of 2**64.
        // `tokenId` has a maximum limit of 2**256.
        unchecked {
            // Updates:
            // - `address` to the owner.
            // - `startTimestamp` to the timestamp of minting.
            // - `burned` to `false`.
            // - `nextInitialized` to `quantity == 1`.
            _packedOwnerships[startTokenId] = _packOwnershipData(
                to,
                _nextInitializedFlag(quantity) | _nextExtraData(address(0), to, 0)
            );

            // Updates:
            // - `balance += quantity`.
            // - `numberMinted += quantity`.
            //
            // We can directly add to the `balance` and `numberMinted`.
            _packedAddressData[to] += quantity * ((1 << _BITPOS_NUMBER_MINTED) | 1);

            // Mask `to` to the lower 160 bits, in case the upper bits somehow aren't clean.
            uint256 toMasked = uint256(uint160(to)) & _BITMASK_ADDRESS;

            if (toMasked == 0) _revert(MintToZeroAddress.selector);

            uint256 end = startTokenId + quantity;
            uint256 tokenId = startTokenId;

            if (end - 1 > _sequentialUpTo()) _revert(SequentialMintExceedsLimit.selector);

            do {
                assembly {
                    // Emit the `Transfer` event.
                    log4(
                        0, // Start of data (0, since no data).
                        0, // End of data (0, since no data).
                        _TRANSFER_EVENT_SIGNATURE, // Signature.
                        0, // `address(0)`.
                        toMasked, // `to`.
                        tokenId // `tokenId`.
                    )
                }
                // The `!=` check ensures that large values of `quantity`
                // that overflows uint256 will make the loop run out of gas.
            } while (++tokenId != end);

            _currentIndex = end;
        }
        _afterTokenTransfers(address(0), to, startTokenId, quantity);
    }

    /**
     * @dev Mints `quantity` tokens and transfers them to `to`.
     *
     * This function is intended for efficient minting only during contract creation.
     *
     * It emits only one {ConsecutiveTransfer} as defined in
     * [ERC2309](https://eips.ethereum.org/EIPS/eip-2309),
     * instead of a sequence of {Transfer} event(s).
     *
     * Calling this function outside of contract creation WILL make your contract
     * non-compliant with the ERC721 standard.
     * For full ERC721 compliance, substituting ERC721 {Transfer} event(s) with the ERC2309
     * {ConsecutiveTransfer} event is only permissible during contract creation.
     *
     * Requirements:
     *
     * - `to` cannot be the zero address.
     * - `quantity` must be greater than 0.
     *
     * Emits a {ConsecutiveTransfer} event.
     */
    function _mintERC2309(address to, uint256 quantity) internal virtual {
        uint256 startTokenId = _currentIndex;
        if (to == address(0)) _revert(MintToZeroAddress.selector);
        if (quantity == 0) _revert(MintZeroQuantity.selector);
        if (quantity > _MAX_MINT_ERC2309_QUANTITY_LIMIT) _revert(MintERC2309QuantityExceedsLimit.selector);

        _beforeTokenTransfers(address(0), to, startTokenId, quantity);

        // Overflows are unrealistic due to the above check for `quantity` to be below the limit.
        unchecked {
            // Updates:
            // - `balance += quantity`.
            // - `numberMinted += quantity`.
            //
            // We can directly add to the `balance` and `numberMinted`.
            _packedAddressData[to] += quantity * ((1 << _BITPOS_NUMBER_MINTED) | 1);

            // Updates:
            // - `address` to the owner.
            // - `startTimestamp` to the timestamp of minting.
            // - `burned` to `false`.
            // - `nextInitialized` to `quantity == 1`.
            _packedOwnerships[startTokenId] = _packOwnershipData(
                to,
                _nextInitializedFlag(quantity) | _nextExtraData(address(0), to, 0)
            );

            if (startTokenId + quantity - 1 > _sequentialUpTo()) _revert(SequentialMintExceedsLimit.selector);

            emit ConsecutiveTransfer(startTokenId, startTokenId + quantity - 1, address(0), to);

            _currentIndex = startTokenId + quantity;
        }
        _afterTokenTransfers(address(0), to, startTokenId, quantity);
    }

    /**
     * @dev Safely mints `quantity` tokens and transfers them to `to`.
     *
     * Requirements:
     *
     * - If `to` refers to a smart contract, it must implement
     * {IERC721Receiver-onERC721Received}, which is called for each safe transfer.
     * - `quantity` must be greater than 0.
     *
     * See {_mint}.
     *
     * Emits a {Transfer} event for each mint.
     */
    function _safeMint(
        address to,
        uint256 quantity,
        bytes memory _data
    ) internal virtual {
        _mint(to, quantity);

        unchecked {
            if (to.code.length != 0) {
                uint256 end = _currentIndex;
                uint256 index = end - quantity;
                do {
                    if (!_checkContractOnERC721Received(address(0), to, index++, _data)) {
                        _revert(TransferToNonERC721ReceiverImplementer.selector);
                    }
                } while (index < end);
                // This prevents reentrancy to `_safeMint`.
                // It does not prevent reentrancy to `_safeMintSpot`.
                if (_currentIndex != end) revert();
            }
        }
    }

    /**
     * @dev Equivalent to `_safeMint(to, quantity, '')`.
     */
    function _safeMint(address to, uint256 quantity) internal virtual {
        _safeMint(to, quantity, '');
    }

    /**
     * @dev Mints a single token at `tokenId`.
     *
     * Note: A spot-minted `tokenId` that has been burned can be re-minted again.
     *
     * Requirements:
     *
     * - `to` cannot be the zero address.
     * - `tokenId` must be greater than `_sequentialUpTo()`.
     * - `tokenId` must not exist.
     *
     * Emits a {Transfer} event for each mint.
     */
    function _mintSpot(address to, uint256 tokenId) internal virtual {
        if (tokenId <= _sequentialUpTo()) _revert(SpotMintTokenIdTooSmall.selector);
        uint256 prevOwnershipPacked = _packedOwnerships[tokenId];
        if (_packedOwnershipExists(prevOwnershipPacked)) _revert(TokenAlreadyExists.selector);

        _beforeTokenTransfers(address(0), to, tokenId, 1);

        // Overflows are incredibly unrealistic.
        // The `numberMinted` for `to` is incremented by 1, and has a max limit of 2**64 - 1.
        // `_spotMinted` is incremented by 1, and has a max limit of 2**256 - 1.
        unchecked {
            // Updates:
            // - `address` to the owner.
            // - `startTimestamp` to the timestamp of minting.
            // - `burned` to `false`.
            // - `nextInitialized` to `true` (as `quantity == 1`).
            _packedOwnerships[tokenId] = _packOwnershipData(
                to,
                _nextInitializedFlag(1) | _nextExtraData(address(0), to, prevOwnershipPacked)
            );

            // Updates:
            // - `balance += 1`.
            // - `numberMinted += 1`.
            //
            // We can directly add to the `balance` and `numberMinted`.
            _packedAddressData[to] += (1 << _BITPOS_NUMBER_MINTED) | 1;

            // Mask `to` to the lower 160 bits, in case the upper bits somehow aren't clean.
            uint256 toMasked = uint256(uint160(to)) & _BITMASK_ADDRESS;

            if (toMasked == 0) _revert(MintToZeroAddress.selector);

            assembly {
                // Emit the `Transfer` event.
                log4(
                    0, // Start of data (0, since no data).
                    0, // End of data (0, since no data).
                    _TRANSFER_EVENT_SIGNATURE, // Signature.
                    0, // `address(0)`.
                    toMasked, // `to`.
                    tokenId // `tokenId`.
                )
            }

            ++_spotMinted;
        }

        _afterTokenTransfers(address(0), to, tokenId, 1);
    }

    /**
     * @dev Safely mints a single token at `tokenId`.
     *
     * Note: A spot-minted `tokenId` that has been burned can be re-minted again.
     *
     * Requirements:
     *
     * - If `to` refers to a smart contract, it must implement {IERC721Receiver-onERC721Received}.
     * - `tokenId` must be greater than `_sequentialUpTo()`.
     * - `tokenId` must not exist.
     *
     * See {_mintSpot}.
     *
     * Emits a {Transfer} event.
     */
    function _safeMintSpot(
        address to,
        uint256 tokenId,
        bytes memory _data
    ) internal virtual {
        _mintSpot(to, tokenId);

        unchecked {
            if (to.code.length != 0) {
                uint256 currentSpotMinted = _spotMinted;
                if (!_checkContractOnERC721Received(address(0), to, tokenId, _data)) {
                    _revert(TransferToNonERC721ReceiverImplementer.selector);
                }
                // This prevents reentrancy to `_safeMintSpot`.
                // It does not prevent reentrancy to `_safeMint`.
                if (_spotMinted != currentSpotMinted) revert();
            }
        }
    }

    /**
     * @dev Equivalent to `_safeMintSpot(to, tokenId, '')`.
     */
    function _safeMintSpot(address to, uint256 tokenId) internal virtual {
        _safeMintSpot(to, tokenId, '');
    }

    // =============================================================
    //                       APPROVAL OPERATIONS
    // =============================================================

    /**
     * @dev Equivalent to `_approve(to, tokenId, false)`.
     */
    function _approve(address to, uint256 tokenId) internal virtual {
        _approve(to, tokenId, false);
    }

    /**
     * @dev Gives permission to `to` to transfer `tokenId` token to another account.
     * The approval is cleared when the token is transferred.
     *
     * Only a single account can be approved at a time, so approving the
     * zero address clears previous approvals.
     *
     * Requirements:
     *
     * - `tokenId` must exist.
     *
     * Emits an {Approval} event.
     */
    function _approve(
        address to,
        uint256 tokenId,
        bool approvalCheck
    ) internal virtual {
        address owner = ownerOf(tokenId);

        if (approvalCheck && _msgSenderERC721A() != owner)
            if (!isApprovedForAll(owner, _msgSenderERC721A())) {
                _revert(ApprovalCallerNotOwnerNorApproved.selector);
            }

        _tokenApprovals[tokenId].value = to;
        emit Approval(owner, to, tokenId);
    }

    // =============================================================
    //                        BURN OPERATIONS
    // =============================================================

    /**
     * @dev Equivalent to `_burn(tokenId, false)`.
     */
    function _burn(uint256 tokenId) internal virtual {
        _burn(tokenId, false);
    }

    /**
     * @dev Destroys `tokenId`.
     * The approval is cleared when the token is burned.
     *
     * Requirements:
     *
     * - `tokenId` must exist.
     *
     * Emits a {Transfer} event.
     */
    function _burn(uint256 tokenId, bool approvalCheck) internal virtual {
        uint256 prevOwnershipPacked = _packedOwnershipOf(tokenId);

        address from = address(uint160(prevOwnershipPacked));

        (uint256 approvedAddressSlot, address approvedAddress) = _getApprovedSlotAndAddress(tokenId);

        if (approvalCheck) {
            // The nested ifs save around 20+ gas over a compound boolean condition.
            if (!_isSenderApprovedOrOwner(approvedAddress, from, _msgSenderERC721A()))
                if (!isApprovedForAll(from, _msgSenderERC721A())) _revert(TransferCallerNotOwnerNorApproved.selector);
        }

        _beforeTokenTransfers(from, address(0), tokenId, 1);

        // Clear approvals from the previous owner.
        assembly {
            if approvedAddress {
                // This is equivalent to `delete _tokenApprovals[tokenId]`.
                sstore(approvedAddressSlot, 0)
            }
        }

        // Underflow of the sender's balance is impossible because we check for
        // ownership above and the recipient's balance can't realistically overflow.
        // Counter overflow is incredibly unrealistic as `tokenId` would have to be 2**256.
        unchecked {
            // Updates:
            // - `balance -= 1`.
            // - `numberBurned += 1`.
            //
            // We can directly decrement the balance, and increment the number burned.
            // This is equivalent to `packed -= 1; packed += 1 << _BITPOS_NUMBER_BURNED;`.
            _packedAddressData[from] += (1 << _BITPOS_NUMBER_BURNED) - 1;

            // Updates:
            // - `address` to the last owner.
            // - `startTimestamp` to the timestamp of burning.
            // - `burned` to `true`.
            // - `nextInitialized` to `true`.
            _packedOwnerships[tokenId] = _packOwnershipData(
                from,
                (_BITMASK_BURNED | _BITMASK_NEXT_INITIALIZED) | _nextExtraData(from, address(0), prevOwnershipPacked)
            );

            // If the next slot may not have been initialized (i.e. `nextInitialized == false`) .
            if (prevOwnershipPacked & _BITMASK_NEXT_INITIALIZED == 0) {
                uint256 nextTokenId = tokenId + 1;
                // If the next slot's address is zero and not burned (i.e. packed value is zero).
                if (_packedOwnerships[nextTokenId] == 0) {
                    // If the next slot is within bounds.
                    if (nextTokenId != _currentIndex) {
                        // Initialize the next slot to maintain correctness for `ownerOf(tokenId + 1)`.
                        _packedOwnerships[nextTokenId] = prevOwnershipPacked;
                    }
                }
            }
        }

        emit Transfer(from, address(0), tokenId);
        _afterTokenTransfers(from, address(0), tokenId, 1);

        // Overflow not possible, as `_burnCounter` cannot be exceed `_currentIndex + _spotMinted` times.
        unchecked {
            _burnCounter++;
        }
    }

    // =============================================================
    //                     EXTRA DATA OPERATIONS
    // =============================================================

    /**
     * @dev Directly sets the extra data for the ownership data `index`.
     */
    function _setExtraDataAt(uint256 index, uint24 extraData) internal virtual {
        uint256 packed = _packedOwnerships[index];
        if (packed == 0) _revert(OwnershipNotInitializedForExtraData.selector);
        uint256 extraDataCasted;
        // Cast `extraData` with assembly to avoid redundant masking.
        assembly {
            extraDataCasted := extraData
        }
        packed = (packed & _BITMASK_EXTRA_DATA_COMPLEMENT) | (extraDataCasted << _BITPOS_EXTRA_DATA);
        _packedOwnerships[index] = packed;
    }

    /**
     * @dev Called during each token transfer to set the 24bit `extraData` field.
     * Intended to be overridden by the cosumer contract.
     *
     * `previousExtraData` - the value of `extraData` before transfer.
     *
     * Calling conditions:
     *
     * - When `from` and `to` are both non-zero, `from`'s `tokenId` will be
     * transferred to `to`.
     * - When `from` is zero, `tokenId` will be minted for `to`.
     * - When `to` is zero, `tokenId` will be burned by `from`.
     * - `from` and `to` are never both zero.
     */
    function _extraData(
        address from,
        address to,
        uint24 previousExtraData
    ) internal view virtual returns (uint24) {}

    /**
     * @dev Returns the next extra data for the packed ownership data.
     * The returned result is shifted into position.
     */
    function _nextExtraData(
        address from,
        address to,
        uint256 prevOwnershipPacked
    ) private view returns (uint256) {
        uint24 extraData = uint24(prevOwnershipPacked >> _BITPOS_EXTRA_DATA);
        return uint256(_extraData(from, to, extraData)) << _BITPOS_EXTRA_DATA;
    }

    // =============================================================
    //                       OTHER OPERATIONS
    // =============================================================

    /**
     * @dev Returns the message sender (defaults to `msg.sender`).
     *
     * If you are writing GSN compatible contracts, you need to override this function.
     */
    function _msgSenderERC721A() internal view virtual returns (address) {
        return msg.sender;
    }

    /**
     * @dev Converts a uint256 to its ASCII string decimal representation.
     */
    function _toString(uint256 value) internal pure virtual returns (string memory str) {
        assembly {
            // The maximum value of a uint256 contains 78 digits (1 byte per digit), but
            // we allocate 0xa0 bytes to keep the free memory pointer 32-byte word aligned.
            // We will need 1 word for the trailing zeros padding, 1 word for the length,
            // and 3 words for a maximum of 78 digits. Total: 5 * 0x20 = 0xa0.
            let m := add(mload(0x40), 0xa0)
            // Update the free memory pointer to allocate.
            mstore(0x40, m)
            // Assign the `str` to the end.
            str := sub(m, 0x20)
            // Zeroize the slot after the string.
            mstore(str, 0)

            // Cache the end of the memory to calculate the length later.
            let end := str

            // We write the string from rightmost digit to leftmost digit.
            // The following is essentially a do-while loop that also handles the zero case.
            // prettier-ignore
            for { let temp := value } 1 {} {
                str := sub(str, 1)
                // Write the character to the pointer.
                // The ASCII index of the '0' character is 48.
                mstore8(str, add(48, mod(temp, 10)))
                // Keep dividing `temp` until zero.
                temp := div(temp, 10)
                // prettier-ignore
                if iszero(temp) { break }
            }

            let length := sub(end, str)
            // Move the pointer 32 bytes leftwards to make room for the length.
            str := sub(str, 0x20)
            // Store the length.
            mstore(str, length)
        }
    }

    /**
     * @dev For more efficient reverts.
     */
    function _revert(bytes4 errorSelector) internal pure {
        assembly {
            mstore(0x00, errorSelector)
            revert(0x00, 0x04)
        }
    }
}

// SPDX-License-Identifier: MIT
// ERC721A Contracts v4.3.0
// Creator: Chiru Labs

pragma solidity ^0.8.4;

/**
 * @dev Interface of ERC721A.
 */
interface IERC721A {
    /**
     * The caller must own the token or be an approved operator.
     */
    error ApprovalCallerNotOwnerNorApproved();

    /**
     * The token does not exist.
     */
    error ApprovalQueryForNonexistentToken();

    /**
     * Cannot query the balance for the zero address.
     */
    error BalanceQueryForZeroAddress();

    /**
     * Cannot mint to the zero address.
     */
    error MintToZeroAddress();

    /**
     * The quantity of tokens minted must be more than zero.
     */
    error MintZeroQuantity();

    /**
     * The token does not exist.
     */
    error OwnerQueryForNonexistentToken();

    /**
     * The caller must own the token or be an approved operator.
     */
    error TransferCallerNotOwnerNorApproved();

    /**
     * The token must be owned by `from`.
     */
    error TransferFromIncorrectOwner();

    /**
     * Cannot safely transfer to a contract that does not implement the
     * ERC721Receiver interface.
     */
    error TransferToNonERC721ReceiverImplementer();

    /**
     * Cannot transfer to the zero address.
     */
    error TransferToZeroAddress();

    /**
     * The token does not exist.
     */
    error URIQueryForNonexistentToken();

    /**
     * The `quantity` minted with ERC2309 exceeds the safety limit.
     */
    error MintERC2309QuantityExceedsLimit();

    /**
     * The `extraData` cannot be set on an unintialized ownership slot.
     */
    error OwnershipNotInitializedForExtraData();

    /**
     * `_sequentialUpTo()` must be greater than `_startTokenId()`.
     */
    error SequentialUpToTooSmall();

    /**
     * The `tokenId` of a sequential mint exceeds `_sequentialUpTo()`.
     */
    error SequentialMintExceedsLimit();

    /**
     * Spot minting requires a `tokenId` greater than `_sequentialUpTo()`.
     */
    error SpotMintTokenIdTooSmall();

    /**
     * Cannot mint over a token that already exists.
     */
    error TokenAlreadyExists();

    /**
     * The feature is not compatible with spot mints.
     */
    error NotCompatibleWithSpotMints();

    // =============================================================
    //                            STRUCTS
    // =============================================================

    struct TokenOwnership {
        // The address of the owner.
        address addr;
        // Stores the start time of ownership with minimal overhead for tokenomics.
        uint64 startTimestamp;
        // Whether the token has been burned.
        bool burned;
        // Arbitrary data similar to `startTimestamp` that can be set via {_extraData}.
        uint24 extraData;
    }

    // =============================================================
    //                         TOKEN COUNTERS
    // =============================================================

    /**
     * @dev Returns the total number of tokens in existence.
     * Burned tokens will reduce the count.
     * To get the total number of tokens minted, please see {_totalMinted}.
     */
    function totalSupply() external view returns (uint256);

    // =============================================================
    //                            IERC165
    // =============================================================

    /**
     * @dev Returns true if this contract implements the interface defined by
     * `interfaceId`. See the corresponding
     * [EIP section](https://eips.ethereum.org/EIPS/eip-165#how-interfaces-are-identified)
     * to learn more about how these ids are created.
     *
     * This function call must use less than 30000 gas.
     */
    function supportsInterface(bytes4 interfaceId) external view returns (bool);

    // =============================================================
    //                            IERC721
    // =============================================================

    /**
     * @dev Emitted when `tokenId` token is transferred from `from` to `to`.
     */
    event Transfer(address indexed from, address indexed to, uint256 indexed tokenId);

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

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

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

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

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

    /**
     * @dev Equivalent to `safeTransferFrom(from, to, tokenId, '')`.
     */
    function safeTransferFrom(
        address from,
        address to,
        uint256 tokenId
    ) external payable;

    /**
     * @dev Transfers `tokenId` from `from` to `to`.
     *
     * WARNING: Usage of this method is discouraged, use {safeTransferFrom}
     * whenever possible.
     *
     * Requirements:
     *
     * - `from` cannot be the zero address.
     * - `to` cannot be the zero address.
     * - `tokenId` token must be owned by `from`.
     * - If the caller is not `from`, it must be approved to move this token
     * by either {approve} or {setApprovalForAll}.
     *
     * Emits a {Transfer} event.
     */
    function transferFrom(
        address from,
        address to,
        uint256 tokenId
    ) external payable;

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

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

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

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

    // =============================================================
    //                        IERC721Metadata
    // =============================================================

    /**
     * @dev Returns the token collection name.
     */
    function name() external view returns (string memory);

    /**
     * @dev Returns the token collection symbol.
     */
    function symbol() external view returns (string memory);

    /**
     * @dev Returns the Uniform Resource Identifier (URI) for `tokenId` token.
     */
    function tokenURI(uint256 tokenId) external view returns (string memory);

    // =============================================================
    //                           IERC2309
    // =============================================================

    /**
     * @dev Emitted when tokens in `fromTokenId` to `toTokenId`
     * (inclusive) is transferred from `from` to `to`, as defined in the
     * [ERC2309](https://eips.ethereum.org/EIPS/eip-2309) standard.
     *
     * See {_mintERC2309} for more details.
     */
    event ConsecutiveTransfer(uint256 indexed fromTokenId, uint256 toTokenId, address indexed from, address indexed to);
}

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

pragma solidity ^0.8.20;

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

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

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

pragma solidity ^0.8.20;

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

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

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

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

• No Contract Security Audit Submitted- Submit Audit Here

[{"inputs":[{"internalType":"bool","name":"newTradingState","type":"bool"},{"internalType":"bool","name":"newWhitelistMintState","type":"bool"},{"internalType":"bool","name":"newPublicMintState","type":"bool"},{"internalType":"uint256","name":"newMaxSupply","type":"uint256"},{"internalType":"uint256","name":"newWhitelistMintPrice","type":"uint256"},{"internalType":"uint256","name":"newPublicMintPrice","type":"uint256"},{"internalType":"uint256","name":"newTeamMintAmount","type":"uint256"},{"internalType":"bytes32","name":"newMerkleRoot","type":"bytes32"},{"internalType":"string","name":"newBaseURI","type":"string"}],"stateMutability":"nonpayable","type":"constructor"},{"inputs":[],"name":"ApprovalCallerNotOwnerNorApproved","type":"error"},{"inputs":[],"name":"ApprovalQueryForNonexistentToken","type":"error"},{"inputs":[],"name":"BalanceQueryForZeroAddress","type":"error"},{"inputs":[],"name":"MintERC2309QuantityExceedsLimit","type":"error"},{"inputs":[],"name":"MintToZeroAddress","type":"error"},{"inputs":[],"name":"MintZeroQuantity","type":"error"},{"inputs":[],"name":"NotCompatibleWithSpotMints","type":"error"},{"inputs":[{"internalType":"address","name":"owner","type":"address"}],"name":"OwnableInvalidOwner","type":"error"},{"inputs":[{"internalType":"address","name":"account","type":"address"}],"name":"OwnableUnauthorizedAccount","type":"error"},{"inputs":[],"name":"OwnerQueryForNonexistentToken","type":"error"},{"inputs":[],"name":"OwnershipNotInitializedForExtraData","type":"error"},{"inputs":[],"name":"SequentialMintExceedsLimit","type":"error"},{"inputs":[],"name":"SequentialUpToTooSmall","type":"error"},{"inputs":[],"name":"SpotMintTokenIdTooSmall","type":"error"},{"inputs":[],"name":"TokenAlreadyExists","type":"error"},{"inputs":[],"name":"TransferCallerNotOwnerNorApproved","type":"error"},{"inputs":[],"name":"TransferFromIncorrectOwner","type":"error"},{"inputs":[],"name":"TransferToNonERC721ReceiverImplementer","type":"error"},{"inputs":[],"name":"TransferToZeroAddress","type":"error"},{"inputs":[],"name":"URIQueryForNonexistentToken","type":"error"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"owner","type":"address"},{"indexed":true,"internalType":"address","name":"approved","type":"address"},{"indexed":true,"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"Approval","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"owner","type":"address"},{"indexed":true,"internalType":"address","name":"operator","type":"address"},{"indexed":false,"internalType":"bool","name":"approved","type":"bool"}],"name":"ApprovalForAll","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"uint256","name":"fromTokenId","type":"uint256"},{"indexed":false,"internalType":"uint256","name":"toTokenId","type":"uint256"},{"indexed":true,"internalType":"address","name":"from","type":"address"},{"indexed":true,"internalType":"address","name":"to","type":"address"}],"name":"ConsecutiveTransfer","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"previousOwner","type":"address"},{"indexed":true,"internalType":"address","name":"newOwner","type":"address"}],"name":"OwnershipTransferred","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"from","type":"address"},{"indexed":true,"internalType":"address","name":"to","type":"address"},{"indexed":true,"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"Transfer","type":"event"},{"inputs":[{"internalType":"address","name":"to","type":"address"},{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"approve","outputs":[],"stateMutability":"payable","type":"function"},{"inputs":[{"internalType":"address","name":"owner","type":"address"}],"name":"balanceOf","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"baseURI","outputs":[{"internalType":"string","name":"","type":"string"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"getApproved","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"owner","type":"address"},{"internalType":"address","name":"operator","type":"address"}],"name":"isApprovedForAll","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"isTradingEnabled","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"bytes32[]","name":"merkleProof","type":"bytes32[]"}],"name":"isWhitelisted","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"maxSupply","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"merkleRoot","outputs":[{"internalType":"bytes32","name":"","type":"bytes32"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"name","outputs":[{"internalType":"string","name":"","type":"string"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"owner","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"ownerOf","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"quantity","type":"uint256"}],"name":"publicMint","outputs":[],"stateMutability":"payable","type":"function"},{"inputs":[],"name":"publicMintPrice","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"publicMintState","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"renounceOwnership","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"from","type":"address"},{"internalType":"address","name":"to","type":"address"},{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"safeTransferFrom","outputs":[],"stateMutability":"payable","type":"function"},{"inputs":[{"internalType":"address","name":"from","type":"address"},{"internalType":"address","name":"to","type":"address"},{"internalType":"uint256","name":"tokenId","type":"uint256"},{"internalType":"bytes","name":"_data","type":"bytes"}],"name":"safeTransferFrom","outputs":[],"stateMutability":"payable","type":"function"},{"inputs":[{"internalType":"address","name":"operator","type":"address"},{"internalType":"bool","name":"approved","type":"bool"}],"name":"setApprovalForAll","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"string","name":"newBaseURI","type":"string"}],"name":"setBaseURI","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"newMaxSupply","type":"uint256"}],"name":"setMaxSupply","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"bytes32","name":"newMerkleRoot","type":"bytes32"}],"name":"setMerkleRoot","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"newPublicMintPrice","type":"uint256"}],"name":"setPublicMintPrice","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"bool","name":"newPublicMintState","type":"bool"}],"name":"setPublicMintState","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"newTeamMintAmount","type":"uint256"}],"name":"setTeamMintAmount","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"bool","name":"newTradingState","type":"bool"}],"name":"setTradingState","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"newWhitelistMintPrice","type":"uint256"}],"name":"setWhitelistMintPrice","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"bool","name":"newWhitelistMintState","type":"bool"}],"name":"setWhitelistMintState","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"bytes4","name":"interfaceId","type":"bytes4"}],"name":"supportsInterface","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"symbol","outputs":[{"internalType":"string","name":"","type":"string"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"teamMint","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"teamMintAmount","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"tokenURI","outputs":[{"internalType":"string","name":"","type":"string"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"totalSupply","outputs":[{"internalType":"uint256","name":"result","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"from","type":"address"},{"internalType":"address","name":"to","type":"address"},{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"transferFrom","outputs":[],"stateMutability":"payable","type":"function"},{"inputs":[{"internalType":"address","name":"newOwner","type":"address"}],"name":"transferOwnership","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"quantity","type":"uint256"},{"internalType":"bytes32[]","name":"merkleProof","type":"bytes32[]"}],"name":"whitelistMint","outputs":[],"stateMutability":"payable","type":"function"},{"inputs":[],"name":"whitelistMintPrice","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"whitelistMintState","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"withdraw","outputs":[],"stateMutability":"nonpayable","type":"function"}]

608060405234801561000f575f5ffd5b5060405161215338038061215383398101604081905261002e91610296565b33604051806040016040528060058152602001644c414d425360d81b815250604051806040016040528060038152602001624c425360e81b8152508160029081610078919061043c565b506003610085828261043c565b5060015f5550506001600160a01b0381166100ba57604051631e4fbdf760e01b81525f60048201526024015b60405180910390fd5b6100c381610123565b506100cd89610174565b6100d68861019a565b6100df876101c0565b6100e8866101e6565b6100f1856101f3565b6100fa84610200565b6101038361020d565b61010c8261021a565b61011581610227565b5050505050505050506104f6565b600980546001600160a01b038381166001600160a01b0319831681179093556040519116919082907f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e0905f90a35050565b61017c61023f565b60098054911515600160a01b0260ff60a01b19909216919091179055565b6101a261023f565b60098054911515600160a81b0260ff60a81b19909216919091179055565b6101c861023f565b60098054911515600160b01b0260ff60b01b19909216919091179055565b6101ee61023f565b600a55565b6101fb61023f565b600b55565b61020861023f565b600c55565b61021561023f565b600d55565b61022261023f565b600e55565b61022f61023f565b600f61023b828261043c565b5050565b6009546001600160a01b0316331461026c5760405163118cdaa760e01b81523360048201526024016100b1565b565b8051801515811461027d575f5ffd5b919050565b634e487b7160e01b5f52604160045260245ffd5b5f5f5f5f5f5f5f5f5f6101208a8c0312156102af575f5ffd5b6102b88a61026e565b98506102c660208b0161026e565b97506102d460408b0161026e565b96505f60608b01519050809650505f60808b01519050809550505f60a08b01519050809450505f60c08b015190508093505060e08a015191506101008a015160018060401b03811115610325575f5ffd5b8a01601f81018c13610335575f5ffd5b80516001600160401b0381111561034e5761034e610282565b604051601f8201601f19908116603f011681016001600160401b038111828210171561037c5761037c610282565b6040528181528282016020018e1015610393575f5ffd5b8160208401602083015e5f602083830101528093505050509295985092959850929598565b600181811c908216806103cc57607f821691505b6020821081036103ea57634e487b7160e01b5f52602260045260245ffd5b50919050565b601f82111561043757805f5260205f20601f840160051c810160208510156104155750805b601f840160051c820191505b81811015610434575f8155600101610421565b50505b505050565b81516001600160401b0381111561045557610455610282565b6104698161046384546103b8565b846103f0565b6020601f82116001811461049b575f83156104845750848201515b5f19600385901b1c1916600184901b178455610434565b5f84815260208120601f198516915b828110156104ca57878501518255602094850194600190920191016104aa565b50848210156104e757868401515f19600387901b60f8161c191681555b50505050600190811b01905550565b611c50806105035f395ff3fe608060405260043610610233575f3560e01c8063715018a611610129578063ba7a86b8116100a8578063d5abeb011161006d578063d5abeb0114610613578063d5ccb8ee14610628578063dc53fd9214610647578063e985e9c51461065c578063f2fde38b146106a3575f5ffd5b8063ba7a86b81461058f578063c6a768f4146105a3578063c87b56dd146105c2578063cdc449e0146105e1578063d2cab05614610600575f5ffd5b806395d89b41116100ee57806395d89b4114610515578063a22cb46514610529578063a611708e14610548578063b4bc159a14610567578063b88d4fde1461057c575f5ffd5b8063715018a6146104865780637cb647591461049a578063879fbedf146104b95780638da5cb5b146104d8578063922400ff146104f5575f5ffd5b80632eb4a7ab116101b55780635d82cf6e1161017a5780635d82cf6e146103f65780636352211e146104155780636c0360eb146104345780636f8b44b01461044857806370a0823114610467575f5ffd5b80632eb4a7ab1461038657806335c6aaf81461039b5780633ccfd60b146103b057806342842e0e146103c457806355f804b3146103d7575f5ffd5b8063095ea7b3116101fb578063095ea7b31461030257806318160ddd1461031757806322ab47a11461034057806323b872dd146103605780632db1154414610373575f5ffd5b806301ffc9a714610237578063064a59d01461026b578063069824fb1461028b57806306fdde03146102aa578063081812fc146102cb575b5f5ffd5b348015610242575f5ffd5b5061025661025136600461160e565b6106c2565b60405190151581526020015b60405180910390f35b348015610276575f5ffd5b5060095461025690600160a01b900460ff1681565b348015610296575f5ffd5b506102566102a5366004611671565b610713565b3480156102b5575f5ffd5b506102be610795565b60405161026291906116de565b3480156102d6575f5ffd5b506102ea6102e53660046116f0565b610825565b6040516001600160a01b039091168152602001610262565b61031561031036600461171d565b61085e565b005b348015610322575f5ffd5b506103326001545f54035f190190565b604051908152602001610262565b34801561034b575f5ffd5b5060095461025690600160b01b900460ff1681565b61031561036e366004611745565b61086e565b6103156103813660046116f0565b6109d5565b348015610391575f5ffd5b50610332600e5481565b3480156103a6575f5ffd5b50610332600b5481565b3480156103bb575f5ffd5b50610315610b52565b6103156103d2366004611745565b610be7565b3480156103e2575f5ffd5b506103156103f136600461180a565b610c01565b348015610401575f5ffd5b506103156104103660046116f0565b610c15565b348015610420575f5ffd5b506102ea61042f3660046116f0565b610c22565b34801561043f575f5ffd5b506102be610c2c565b348015610453575f5ffd5b506103156104623660046116f0565b610cb8565b348015610472575f5ffd5b5061033261048136600461184f565b610cc5565b348015610491575f5ffd5b50610315610d09565b3480156104a5575f5ffd5b506103156104b43660046116f0565b610d1c565b3480156104c4575f5ffd5b506103156104d3366004611877565b610d29565b3480156104e3575f5ffd5b506009546001600160a01b03166102ea565b348015610500575f5ffd5b5060095461025690600160a81b900460ff1681565b348015610520575f5ffd5b506102be610d4f565b348015610534575f5ffd5b50610315610543366004611890565b610d5e565b348015610553575f5ffd5b506103156105623660046116f0565b610dc9565b348015610572575f5ffd5b50610332600d5481565b61031561058a3660046118c1565b610dd6565b34801561059a575f5ffd5b50610315610e17565b3480156105ae575f5ffd5b506103156105bd366004611877565b610e2b565b3480156105cd575f5ffd5b506102be6105dc3660046116f0565b610e51565b3480156105ec575f5ffd5b506103156105fb3660046116f0565b610ec9565b61031561060e366004611938565b610ed6565b34801561061e575f5ffd5b50610332600a5481565b348015610633575f5ffd5b50610315610642366004611877565b6110ac565b348015610652575f5ffd5b50610332600c5481565b348015610667575f5ffd5b50610256610676366004611980565b6001600160a01b039182165f90815260076020908152604080832093909416825291909152205460ff1690565b3480156106ae575f5ffd5b506103156106bd36600461184f565b6110d2565b5f6301ffc9a760e01b6001600160e01b0319831614806106f257506380ac58cd60e01b6001600160e01b03198316145b8061070d5750635b5e139f60e01b6001600160e01b03198316145b92915050565b6040516bffffffffffffffffffffffff193360601b1660208201525f90819060340160405160208183030381529060405280519060200120905061078d8484808060200260200160405190810160405280939291908181526020018383602002808284375f9201919091525050600e54915084905061110c565b949350505050565b6060600280546107a4906119a8565b80601f01602080910402602001604051908101604052809291908181526020018280546107d0906119a8565b801561081b5780601f106107f25761010080835404028352916020019161081b565b820191905f5260205f20905b8154815290600101906020018083116107fe57829003601f168201915b5050505050905090565b5f61082f82611121565b610843576108436333d1c03960e21b61116b565b505f908152600660205260409020546001600160a01b031690565b61086a82826001611173565b5050565b5f61087882611214565b6001600160a01b03948516949091508116841461089e5761089e62a1148160e81b61116b565b5f8281526006602052604090208054338082146001600160a01b038816909114176108e1576108cd8633610676565b6108e1576108e1632ce44b5f60e11b61116b565b6108ee86868660016112ad565b80156108f8575f82555b6001600160a01b038681165f9081526005602052604080822080545f19019055918716808252919020805460010190554260a01b17600160e11b175f85815260046020526040812091909155600160e11b8416900361098457600184015f818152600460205260408120549003610982575f548114610982575f8181526004602052604090208490555b505b6001600160a01b0385168481887fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef5f80a4805f036109cc576109cc633a954ecd60e21b61116b565b50505050505050565b80600a54816109e96001545f54035f190190565b6109f391906119f4565b1115610a1a5760405162461bcd60e51b8152600401610a1190611a07565b60405180910390fd5b6009548290600160b01b900460ff16610a845760405162461bcd60e51b815260206004820152602660248201527f5075626c6963206d696e7420706861736520686173206e6f742073746172746560448201526564207965742160d01b6064820152608401610a11565b6005610a8f33610cc5565b610a9990836119f4565b1115610af15760405162461bcd60e51b815260206004820152602160248201527f4d6178696d756d206d696e74206c696d697420706572207573657220697320356044820152602160f81b6064820152608401610a11565b600c54610afe9082611a52565b341015610b435760405162461bcd60e51b8152602060048201526013602482015272496e73756666696369656e742066756e64732160681b6044820152606401610a11565b610b4d338461131a565b505050565b610b5a6113e0565b6040515f90339047908381818185875af1925050503d805f8114610b99576040519150601f19603f3d011682016040523d82523d5f602084013e610b9e565b606091505b5050905080610be45760405162461bcd60e51b81526020600482015260126024820152712bb4ba34323930bbb0b6103330b4b632b21760711b6044820152606401610a11565b50565b610b4d83838360405180602001604052805f815250610dd6565b610c096113e0565b600f61086a8282611ab4565b610c1d6113e0565b600c55565b5f61070d82611214565b600f8054610c39906119a8565b80601f0160208091040260200160405190810160405280929190818152602001828054610c65906119a8565b8015610cb05780601f10610c8757610100808354040283529160200191610cb0565b820191905f5260205f20905b815481529060010190602001808311610c9357829003601f168201915b505050505081565b610cc06113e0565b600a55565b5f6001600160a01b038216610ce457610ce46323d3ad8160e21b61116b565b506001600160a01b03165f9081526005602052604090205467ffffffffffffffff1690565b610d116113e0565b610d1a5f61140d565b565b610d246113e0565b600e55565b610d316113e0565b60098054911515600160b01b0260ff60b01b19909216919091179055565b6060600380546107a4906119a8565b335f8181526007602090815260408083206001600160a01b03871680855290835292819020805460ff191686151590811790915590519081529192917f17307eab39ab6107e8899845ad3d59bd9653f200f220920489ca2b5937696c31910160405180910390a35050565b610dd16113e0565b600b55565b610de184848461086e565b6001600160a01b0383163b15610e1157610dfd8484848461145e565b610e1157610e116368d2bf6b60e11b61116b565b50505050565b610e1f6113e0565b610d1a33600d5461131a565b610e336113e0565b60098054911515600160a81b0260ff60a81b19909216919091179055565b6060610e5c82611121565b610e7057610e70630a14c4b560e41b61116b565b5f610e7961153c565b905080515f03610e975760405180602001604052805f815250610ec2565b80610ea18461154b565b604051602001610eb2929190611b86565b6040516020818303038152906040525b9392505050565b610ed16113e0565b600d55565b82600a5481610eea6001545f54035f190190565b610ef491906119f4565b1115610f125760405162461bcd60e51b8152600401610a1190611a07565b838383600960159054906101000a900460ff16610f835760405162461bcd60e51b815260206004820152602960248201527f57686974656c697374206d696e7420706861736520686173206e6f742073746160448201526872746564207965742160b81b6064820152608401610a11565b610f8d8282610713565b610fd95760405162461bcd60e51b815260206004820152601860248201527f596f7520617265206e6f742077686974656c69737465642100000000000000006044820152606401610a11565b6002610fe433610cc5565b610fee90856119f4565b11156110505760405162461bcd60e51b815260206004820152602b60248201527f4d6178696d756d2077686974656c697374206d696e74206c696d69742070657260448201526a207573657220697320322160a81b6064820152608401610a11565b600b5461105d9084611a52565b3410156110a25760405162461bcd60e51b8152602060048201526013602482015272496e73756666696369656e742066756e64732160681b6044820152606401610a11565b6109cc338861131a565b6110b46113e0565b60098054911515600160a01b0260ff60a01b19909216919091179055565b6110da6113e0565b6001600160a01b03811661110357604051631e4fbdf760e01b81525f6004820152602401610a11565b610be48161140d565b5f82611118858461158e565b14949350505050565b5f81600111611166575f54821015611166575f5b505f828152600460205260408120549081900361115c5761115583611b9a565b9250611135565b600160e01b161590505b919050565b805f5260045ffd5b5f61117d83610c22565b90508180156111955750336001600160a01b03821614155b156111b8576111a48133610676565b6111b8576111b86367d9dca160e11b61116b565b5f8381526006602052604080822080546001600160a01b0319166001600160a01b0388811691821790925591518693918516917f8c5be1e5ebec7d5bd14f71427d1e84f3dd0314c0f7b2291e5b200ac8c7c3b92591a450505050565b5f8160011161129d57505f81815260046020526040902054805f0361128b575f54821061124b5761124b636f96cda160e11b61116b565b5b505f19015f81815260046020526040902054801561124c57600160e01b81165f0361127657919050565b611286636f96cda160e11b61116b565b61124c565b600160e01b81165f0361129d57919050565b611166636f96cda160e11b61116b565b6001600160a01b03841615610e1157600954600160a01b900460ff166113155760405162461bcd60e51b815260206004820152601d60248201527f54726164696e672069732063757272656e746c792064697361626c65640000006044820152606401610a11565b610e11565b5f8054908290036113355761133563b562e8dd60e01b61116b565b6113415f8483856112ad565b5f8181526004602090815260408083206001600160a01b0387164260a01b6001881460e11b1781179091558084526005909252822080546801000000000000000186020190559081900361139e5761139e622e076360e81b61116b565b818301825b80835f7fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef5f5fa48181600101915081036113a357505f5550505050565b6009546001600160a01b03163314610d1a5760405163118cdaa760e01b8152336004820152602401610a11565b600980546001600160a01b038381166001600160a01b0319831681179093556040519116919082907f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e0905f90a35050565b604051630a85bd0160e11b81525f906001600160a01b0385169063150b7a0290611492903390899088908890600401611baf565b6020604051808303815f875af19250505080156114cc575060408051601f3d908101601f191682019092526114c991810190611beb565b60015b61151f573d8080156114f9576040519150601f19603f3d011682016040523d82523d5f602084013e6114fe565b606091505b5080515f03611517576115176368d2bf6b60e11b61116b565b805181602001fd5b6001600160e01b031916630a85bd0160e11b149050949350505050565b6060600f80546107a4906119a8565b606060a06040510180604052602081039150505f815280825b600183039250600a81066030018353600a9004806115645750819003601f19909101908152919050565b5f81815b84518110156115c8576115be828683815181106115b1576115b1611c06565b60200260200101516115d0565b9150600101611592565b509392505050565b5f8183106115ea575f828152602084905260409020610ec2565b505f9182526020526040902090565b6001600160e01b031981168114610be4575f5ffd5b5f6020828403121561161e575f5ffd5b8135610ec2816115f9565b5f5f83601f840112611639575f5ffd5b50813567ffffffffffffffff811115611650575f5ffd5b6020830191508360208260051b850101111561166a575f5ffd5b9250929050565b5f5f60208385031215611682575f5ffd5b823567ffffffffffffffff811115611698575f5ffd5b6116a485828601611629565b90969095509350505050565b5f81518084528060208401602086015e5f602082860101526020601f19601f83011685010191505092915050565b602081525f610ec260208301846116b0565b5f60208284031215611700575f5ffd5b5035919050565b80356001600160a01b0381168114611166575f5ffd5b5f5f6040838503121561172e575f5ffd5b61173783611707565b946020939093013593505050565b5f5f5f60608486031215611757575f5ffd5b61176084611707565b925061176e60208501611707565b929592945050506040919091013590565b634e487b7160e01b5f52604160045260245ffd5b5f5f67ffffffffffffffff8411156117ad576117ad61177f565b50604051601f19601f85018116603f0116810181811067ffffffffffffffff821117156117dc576117dc61177f565b6040528381529050808284018510156117f3575f5ffd5b838360208301375f60208583010152509392505050565b5f6020828403121561181a575f5ffd5b813567ffffffffffffffff811115611830575f5ffd5b8201601f81018413611840575f5ffd5b61078d84823560208401611793565b5f6020828403121561185f575f5ffd5b610ec282611707565b80358015158114611166575f5ffd5b5f60208284031215611887575f5ffd5b610ec282611868565b5f5f604083850312156118a1575f5ffd5b6118aa83611707565b91506118b860208401611868565b90509250929050565b5f5f5f5f608085870312156118d4575f5ffd5b6118dd85611707565b93506118eb60208601611707565b925060408501359150606085013567ffffffffffffffff81111561190d575f5ffd5b8501601f8101871361191d575f5ffd5b61192c87823560208401611793565b91505092959194509250565b5f5f5f6040848603121561194a575f5ffd5b83359250602084013567ffffffffffffffff811115611967575f5ffd5b61197386828701611629565b9497909650939450505050565b5f5f60408385031215611991575f5ffd5b61199a83611707565b91506118b860208401611707565b600181811c908216806119bc57607f821691505b6020821081036119da57634e487b7160e01b5f52602260045260245ffd5b50919050565b634e487b7160e01b5f52601160045260245ffd5b8082018082111561070d5761070d6119e0565b6020808252602b908201527f417474656d70746564206d696e7420616d6f756e74206578636565647320746f60408201526a74616c20737570706c792160a81b606082015260800190565b808202811582820484141761070d5761070d6119e0565b601f821115610b4d57805f5260205f20601f840160051c81016020851015611a8e5750805b601f840160051c820191505b81811015611aad575f8155600101611a9a565b5050505050565b815167ffffffffffffffff811115611ace57611ace61177f565b611ae281611adc84546119a8565b84611a69565b6020601f821160018114611b14575f8315611afd5750848201515b5f19600385901b1c1916600184901b178455611aad565b5f84815260208120601f198516915b82811015611b435787850151825560209485019460019092019101611b23565b5084821015611b6057868401515f19600387901b60f8161c191681555b50505050600190811b01905550565b5f81518060208401855e5f93019283525090919050565b5f61078d611b948386611b6f565b84611b6f565b5f81611ba857611ba86119e0565b505f190190565b6001600160a01b03858116825284166020820152604081018390526080606082018190525f90611be1908301846116b0565b9695505050505050565b5f60208284031215611bfb575f5ffd5b8151610ec2816115f9565b634e487b7160e01b5f52603260045260245ffdfea2646970667358221220600743494f11b4b202af29b801b67e2fd7011bc0c35fb4c83c1dbe98d7e3fcf064736f6c634300081c003300000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000640000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000190000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000012000000000000000000000000000000000000000000000000000000000000000013000000000000000000000000000000000000000000000000000000000000000

0x608060405260043610610233575f3560e01c8063715018a611610129578063ba7a86b8116100a8578063d5abeb011161006d578063d5abeb0114610613578063d5ccb8ee14610628578063dc53fd9214610647578063e985e9c51461065c578063f2fde38b146106a3575f5ffd5b8063ba7a86b81461058f578063c6a768f4146105a3578063c87b56dd146105c2578063cdc449e0146105e1578063d2cab05614610600575f5ffd5b806395d89b41116100ee57806395d89b4114610515578063a22cb46514610529578063a611708e14610548578063b4bc159a14610567578063b88d4fde1461057c575f5ffd5b8063715018a6146104865780637cb647591461049a578063879fbedf146104b95780638da5cb5b146104d8578063922400ff146104f5575f5ffd5b80632eb4a7ab116101b55780635d82cf6e1161017a5780635d82cf6e146103f65780636352211e146104155780636c0360eb146104345780636f8b44b01461044857806370a0823114610467575f5ffd5b80632eb4a7ab1461038657806335c6aaf81461039b5780633ccfd60b146103b057806342842e0e146103c457806355f804b3146103d7575f5ffd5b8063095ea7b3116101fb578063095ea7b31461030257806318160ddd1461031757806322ab47a11461034057806323b872dd146103605780632db1154414610373575f5ffd5b806301ffc9a714610237578063064a59d01461026b578063069824fb1461028b57806306fdde03146102aa578063081812fc146102cb575b5f5ffd5b348015610242575f5ffd5b5061025661025136600461160e565b6106c2565b60405190151581526020015b60405180910390f35b348015610276575f5ffd5b5060095461025690600160a01b900460ff1681565b348015610296575f5ffd5b506102566102a5366004611671565b610713565b3480156102b5575f5ffd5b506102be610795565b60405161026291906116de565b3480156102d6575f5ffd5b506102ea6102e53660046116f0565b610825565b6040516001600160a01b039091168152602001610262565b61031561031036600461171d565b61085e565b005b348015610322575f5ffd5b506103326001545f54035f190190565b604051908152602001610262565b34801561034b575f5ffd5b5060095461025690600160b01b900460ff1681565b61031561036e366004611745565b61086e565b6103156103813660046116f0565b6109d5565b348015610391575f5ffd5b50610332600e5481565b3480156103a6575f5ffd5b50610332600b5481565b3480156103bb575f5ffd5b50610315610b52565b6103156103d2366004611745565b610be7565b3480156103e2575f5ffd5b506103156103f136600461180a565b610c01565b348015610401575f5ffd5b506103156104103660046116f0565b610c15565b348015610420575f5ffd5b506102ea61042f3660046116f0565b610c22565b34801561043f575f5ffd5b506102be610c2c565b348015610453575f5ffd5b506103156104623660046116f0565b610cb8565b348015610472575f5ffd5b5061033261048136600461184f565b610cc5565b348015610491575f5ffd5b50610315610d09565b3480156104a5575f5ffd5b506103156104b43660046116f0565b610d1c565b3480156104c4575f5ffd5b506103156104d3366004611877565b610d29565b3480156104e3575f5ffd5b506009546001600160a01b03166102ea565b348015610500575f5ffd5b5060095461025690600160a81b900460ff1681565b348015610520575f5ffd5b506102be610d4f565b348015610534575f5ffd5b50610315610543366004611890565b610d5e565b348015610553575f5ffd5b506103156105623660046116f0565b610dc9565b348015610572575f5ffd5b50610332600d5481565b61031561058a3660046118c1565b610dd6565b34801561059a575f5ffd5b50610315610e17565b3480156105ae575f5ffd5b506103156105bd366004611877565b610e2b565b3480156105cd575f5ffd5b506102be6105dc3660046116f0565b610e51565b3480156105ec575f5ffd5b506103156105fb3660046116f0565b610ec9565b61031561060e366004611938565b610ed6565b34801561061e575f5ffd5b50610332600a5481565b348015610633575f5ffd5b50610315610642366004611877565b6110ac565b348015610652575f5ffd5b50610332600c5481565b348015610667575f5ffd5b50610256610676366004611980565b6001600160a01b039182165f90815260076020908152604080832093909416825291909152205460ff1690565b3480156106ae575f5ffd5b506103156106bd36600461184f565b6110d2565b5f6301ffc9a760e01b6001600160e01b0319831614806106f257506380ac58cd60e01b6001600160e01b03198316145b8061070d5750635b5e139f60e01b6001600160e01b03198316145b92915050565b6040516bffffffffffffffffffffffff193360601b1660208201525f90819060340160405160208183030381529060405280519060200120905061078d8484808060200260200160405190810160405280939291908181526020018383602002808284375f9201919091525050600e54915084905061110c565b949350505050565b6060600280546107a4906119a8565b80601f01602080910402602001604051908101604052809291908181526020018280546107d0906119a8565b801561081b5780601f106107f25761010080835404028352916020019161081b565b820191905f5260205f20905b8154815290600101906020018083116107fe57829003601f168201915b5050505050905090565b5f61082f82611121565b610843576108436333d1c03960e21b61116b565b505f908152600660205260409020546001600160a01b031690565b61086a82826001611173565b5050565b5f61087882611214565b6001600160a01b03948516949091508116841461089e5761089e62a1148160e81b61116b565b5f8281526006602052604090208054338082146001600160a01b038816909114176108e1576108cd8633610676565b6108e1576108e1632ce44b5f60e11b61116b565b6108ee86868660016112ad565b80156108f8575f82555b6001600160a01b038681165f9081526005602052604080822080545f19019055918716808252919020805460010190554260a01b17600160e11b175f85815260046020526040812091909155600160e11b8416900361098457600184015f818152600460205260408120549003610982575f548114610982575f8181526004602052604090208490555b505b6001600160a01b0385168481887fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef5f80a4805f036109cc576109cc633a954ecd60e21b61116b565b50505050505050565b80600a54816109e96001545f54035f190190565b6109f391906119f4565b1115610a1a5760405162461bcd60e51b8152600401610a1190611a07565b60405180910390fd5b6009548290600160b01b900460ff16610a845760405162461bcd60e51b815260206004820152602660248201527f5075626c6963206d696e7420706861736520686173206e6f742073746172746560448201526564207965742160d01b6064820152608401610a11565b6005610a8f33610cc5565b610a9990836119f4565b1115610af15760405162461bcd60e51b815260206004820152602160248201527f4d6178696d756d206d696e74206c696d697420706572207573657220697320356044820152602160f81b6064820152608401610a11565b600c54610afe9082611a52565b341015610b435760405162461bcd60e51b8152602060048201526013602482015272496e73756666696369656e742066756e64732160681b6044820152606401610a11565b610b4d338461131a565b505050565b610b5a6113e0565b6040515f90339047908381818185875af1925050503d805f8114610b99576040519150601f19603f3d011682016040523d82523d5f602084013e610b9e565b606091505b5050905080610be45760405162461bcd60e51b81526020600482015260126024820152712bb4ba34323930bbb0b6103330b4b632b21760711b6044820152606401610a11565b50565b610b4d83838360405180602001604052805f815250610dd6565b610c096113e0565b600f61086a8282611ab4565b610c1d6113e0565b600c55565b5f61070d82611214565b600f8054610c39906119a8565b80601f0160208091040260200160405190810160405280929190818152602001828054610c65906119a8565b8015610cb05780601f10610c8757610100808354040283529160200191610cb0565b820191905f5260205f20905b815481529060010190602001808311610c9357829003601f168201915b505050505081565b610cc06113e0565b600a55565b5f6001600160a01b038216610ce457610ce46323d3ad8160e21b61116b565b506001600160a01b03165f9081526005602052604090205467ffffffffffffffff1690565b610d116113e0565b610d1a5f61140d565b565b610d246113e0565b600e55565b610d316113e0565b60098054911515600160b01b0260ff60b01b19909216919091179055565b6060600380546107a4906119a8565b335f8181526007602090815260408083206001600160a01b03871680855290835292819020805460ff191686151590811790915590519081529192917f17307eab39ab6107e8899845ad3d59bd9653f200f220920489ca2b5937696c31910160405180910390a35050565b610dd16113e0565b600b55565b610de184848461086e565b6001600160a01b0383163b15610e1157610dfd8484848461145e565b610e1157610e116368d2bf6b60e11b61116b565b50505050565b610e1f6113e0565b610d1a33600d5461131a565b610e336113e0565b60098054911515600160a81b0260ff60a81b19909216919091179055565b6060610e5c82611121565b610e7057610e70630a14c4b560e41b61116b565b5f610e7961153c565b905080515f03610e975760405180602001604052805f815250610ec2565b80610ea18461154b565b604051602001610eb2929190611b86565b6040516020818303038152906040525b9392505050565b610ed16113e0565b600d55565b82600a5481610eea6001545f54035f190190565b610ef491906119f4565b1115610f125760405162461bcd60e51b8152600401610a1190611a07565b838383600960159054906101000a900460ff16610f835760405162461bcd60e51b815260206004820152602960248201527f57686974656c697374206d696e7420706861736520686173206e6f742073746160448201526872746564207965742160b81b6064820152608401610a11565b610f8d8282610713565b610fd95760405162461bcd60e51b815260206004820152601860248201527f596f7520617265206e6f742077686974656c69737465642100000000000000006044820152606401610a11565b6002610fe433610cc5565b610fee90856119f4565b11156110505760405162461bcd60e51b815260206004820152602b60248201527f4d6178696d756d2077686974656c697374206d696e74206c696d69742070657260448201526a207573657220697320322160a81b6064820152608401610a11565b600b5461105d9084611a52565b3410156110a25760405162461bcd60e51b8152602060048201526013602482015272496e73756666696369656e742066756e64732160681b6044820152606401610a11565b6109cc338861131a565b6110b46113e0565b60098054911515600160a01b0260ff60a01b19909216919091179055565b6110da6113e0565b6001600160a01b03811661110357604051631e4fbdf760e01b81525f6004820152602401610a11565b610be48161140d565b5f82611118858461158e565b14949350505050565b5f81600111611166575f54821015611166575f5b505f828152600460205260408120549081900361115c5761115583611b9a565b9250611135565b600160e01b161590505b919050565b805f5260045ffd5b5f61117d83610c22565b90508180156111955750336001600160a01b03821614155b156111b8576111a48133610676565b6111b8576111b86367d9dca160e11b61116b565b5f8381526006602052604080822080546001600160a01b0319166001600160a01b0388811691821790925591518693918516917f8c5be1e5ebec7d5bd14f71427d1e84f3dd0314c0f7b2291e5b200ac8c7c3b92591a450505050565b5f8160011161129d57505f81815260046020526040902054805f0361128b575f54821061124b5761124b636f96cda160e11b61116b565b5b505f19015f81815260046020526040902054801561124c57600160e01b81165f0361127657919050565b611286636f96cda160e11b61116b565b61124c565b600160e01b81165f0361129d57919050565b611166636f96cda160e11b61116b565b6001600160a01b03841615610e1157600954600160a01b900460ff166113155760405162461bcd60e51b815260206004820152601d60248201527f54726164696e672069732063757272656e746c792064697361626c65640000006044820152606401610a11565b610e11565b5f8054908290036113355761133563b562e8dd60e01b61116b565b6113415f8483856112ad565b5f8181526004602090815260408083206001600160a01b0387164260a01b6001881460e11b1781179091558084526005909252822080546801000000000000000186020190559081900361139e5761139e622e076360e81b61116b565b818301825b80835f7fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef5f5fa48181600101915081036113a357505f5550505050565b6009546001600160a01b03163314610d1a5760405163118cdaa760e01b8152336004820152602401610a11565b600980546001600160a01b038381166001600160a01b0319831681179093556040519116919082907f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e0905f90a35050565b604051630a85bd0160e11b81525f906001600160a01b0385169063150b7a0290611492903390899088908890600401611baf565b6020604051808303815f875af19250505080156114cc575060408051601f3d908101601f191682019092526114c991810190611beb565b60015b61151f573d8080156114f9576040519150601f19603f3d011682016040523d82523d5f602084013e6114fe565b606091505b5080515f03611517576115176368d2bf6b60e11b61116b565b805181602001fd5b6001600160e01b031916630a85bd0160e11b149050949350505050565b6060600f80546107a4906119a8565b606060a06040510180604052602081039150505f815280825b600183039250600a81066030018353600a9004806115645750819003601f19909101908152919050565b5f81815b84518110156115c8576115be828683815181106115b1576115b1611c06565b60200260200101516115d0565b9150600101611592565b509392505050565b5f8183106115ea575f828152602084905260409020610ec2565b505f9182526020526040902090565b6001600160e01b031981168114610be4575f5ffd5b5f6020828403121561161e575f5ffd5b8135610ec2816115f9565b5f5f83601f840112611639575f5ffd5b50813567ffffffffffffffff811115611650575f5ffd5b6020830191508360208260051b850101111561166a575f5ffd5b9250929050565b5f5f60208385031215611682575f5ffd5b823567ffffffffffffffff811115611698575f5ffd5b6116a485828601611629565b90969095509350505050565b5f81518084528060208401602086015e5f602082860101526020601f19601f83011685010191505092915050565b602081525f610ec260208301846116b0565b5f60208284031215611700575f5ffd5b5035919050565b80356001600160a01b0381168114611166575f5ffd5b5f5f6040838503121561172e575f5ffd5b61173783611707565b946020939093013593505050565b5f5f5f60608486031215611757575f5ffd5b61176084611707565b925061176e60208501611707565b929592945050506040919091013590565b634e487b7160e01b5f52604160045260245ffd5b5f5f67ffffffffffffffff8411156117ad576117ad61177f565b50604051601f19601f85018116603f0116810181811067ffffffffffffffff821117156117dc576117dc61177f565b6040528381529050808284018510156117f3575f5ffd5b838360208301375f60208583010152509392505050565b5f6020828403121561181a575f5ffd5b813567ffffffffffffffff811115611830575f5ffd5b8201601f81018413611840575f5ffd5b61078d84823560208401611793565b5f6020828403121561185f575f5ffd5b610ec282611707565b80358015158114611166575f5ffd5b5f60208284031215611887575f5ffd5b610ec282611868565b5f5f604083850312156118a1575f5ffd5b6118aa83611707565b91506118b860208401611868565b90509250929050565b5f5f5f5f608085870312156118d4575f5ffd5b6118dd85611707565b93506118eb60208601611707565b925060408501359150606085013567ffffffffffffffff81111561190d575f5ffd5b8501601f8101871361191d575f5ffd5b61192c87823560208401611793565b91505092959194509250565b5f5f5f6040848603121561194a575f5ffd5b83359250602084013567ffffffffffffffff811115611967575f5ffd5b61197386828701611629565b9497909650939450505050565b5f5f60408385031215611991575f5ffd5b61199a83611707565b91506118b860208401611707565b600181811c908216806119bc57607f821691505b6020821081036119da57634e487b7160e01b5f52602260045260245ffd5b50919050565b634e487b7160e01b5f52601160045260245ffd5b8082018082111561070d5761070d6119e0565b6020808252602b908201527f417474656d70746564206d696e7420616d6f756e74206578636565647320746f60408201526a74616c20737570706c792160a81b606082015260800190565b808202811582820484141761070d5761070d6119e0565b601f821115610b4d57805f5260205f20601f840160051c81016020851015611a8e5750805b601f840160051c820191505b81811015611aad575f8155600101611a9a565b5050505050565b815167ffffffffffffffff811115611ace57611ace61177f565b611ae281611adc84546119a8565b84611a69565b6020601f821160018114611b14575f8315611afd5750848201515b5f19600385901b1c1916600184901b178455611aad565b5f84815260208120601f198516915b82811015611b435787850151825560209485019460019092019101611b23565b5084821015611b6057868401515f19600387901b60f8161c191681555b50505050600190811b01905550565b5f81518060208401855e5f93019283525090919050565b5f61078d611b948386611b6f565b84611b6f565b5f81611ba857611ba86119e0565b505f190190565b6001600160a01b03858116825284166020820152604081018390526080606082018190525f90611be1908301846116b0565b9695505050505050565b5f60208284031215611bfb575f5ffd5b8151610ec2816115f9565b634e487b7160e01b5f52603260045260245ffdfea2646970667358221220600743494f11b4b202af29b801b67e2fd7011bc0c35fb4c83c1dbe98d7e3fcf064736f6c634300081c0033

00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000640000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000190000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000012000000000000000000000000000000000000000000000000000000000000000013000000000000000000000000000000000000000000000000000000000000000

-----Decoded View---------------
Arg [0] : newTradingState (bool): False
Arg [1] : newWhitelistMintState (bool): False
Arg [2] : newPublicMintState (bool): False
Arg [3] : newMaxSupply (uint256): 100
Arg [4] : newWhitelistMintPrice (uint256): 0
Arg [5] : newPublicMintPrice (uint256): 0
Arg [6] : newTeamMintAmount (uint256): 25
Arg [7] : newMerkleRoot (bytes32): 0x0000000000000000000000000000000000000000000000000000000000000000
Arg [8] : newBaseURI (string): 0

-----Encoded View---------------
11 Constructor Arguments found :
Arg [0] : 0000000000000000000000000000000000000000000000000000000000000000
Arg [1] : 0000000000000000000000000000000000000000000000000000000000000000
Arg [2] : 0000000000000000000000000000000000000000000000000000000000000000
Arg [3] : 0000000000000000000000000000000000000000000000000000000000000064
Arg [4] : 0000000000000000000000000000000000000000000000000000000000000000
Arg [5] : 0000000000000000000000000000000000000000000000000000000000000000
Arg [6] : 0000000000000000000000000000000000000000000000000000000000000019
Arg [7] : 0000000000000000000000000000000000000000000000000000000000000000
Arg [8] : 0000000000000000000000000000000000000000000000000000000000000120
Arg [9] : 0000000000000000000000000000000000000000000000000000000000000001
Arg [10] : 3000000000000000000000000000000000000000000000000000000000000000

228:6182:4:-:0;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;10689:630:5;;;;;;;;;;-1:-1:-1;10689:630:5;;;;;:::i;:::-;;:::i;:::-;;;565:14:7;;558:22;540:41;;528:2;513:18;10689:630:5;;;;;;;;274:28:4;;;;;;;;;;-1:-1:-1;274:28:4;;;;-1:-1:-1;;;274:28:4;;;;;;3720:282;;;;;;;;;;-1:-1:-1;3720:282:4;;;;;:::i;:::-;;:::i;11573:98:5:-;;;;;;;;;;;;;:::i;:::-;;;;;;;:::i;18636:223::-;;;;;;;;;;-1:-1:-1;18636:223:5;;;;;:::i;:::-;;:::i;:::-;;;-1:-1:-1;;;;;2342:32:7;;;2324:51;;2312:2;2297:18;18636:223:5;2178:203:7;18364:122:5;;;;;;:::i;:::-;;:::i;:::-;;6890:564;;;;;;;;;;;;3227:1:4;7328:12:5;6951:14;7312:13;:28;-1:-1:-1;;7312:46:5;;6890:564;;;;3015:25:7;;;3003:2;2988:18;6890:564:5;2869:177:7;346:27:4;;;;;;;;;;-1:-1:-1;346:27:4;;;;-1:-1:-1;;;346:27:4;;;;;;22796:3447:5;;;;;;:::i;:::-;;:::i;5828:230:4:-;;;;;;:::i;:::-;;:::i;524:25::-;;;;;;;;;;;;;;;;411:33;;;;;;;;;;;;;;;;6197:208;;;;;;;;;;;;;:::i;26334:187:5:-;;;;;;:::i;:::-;;:::i;4482:143:4:-;;;;;;;;;;-1:-1:-1;4482:143:4;;;;;:::i;:::-;;:::i;5353:168::-;;;;;;;;;;-1:-1:-1;5353:168:4;;;;;:::i;:::-;;:::i;12934:150:5:-;;;;;;;;;;-1:-1:-1;12934:150:5;;;;;:::i;:::-;;:::i;556:21:4:-;;;;;;;;;;;;;:::i;4330:144::-;;;;;;;;;;-1:-1:-1;4330:144:4;;;;;:::i;:::-;;:::i;8570:239:5:-;;;;;;;;;;-1:-1:-1;8570:239:5;;;;;:::i;:::-;;:::i;2293:101:0:-;;;;;;;;;;;;;:::i;4010:146:4:-;;;;;;;;;;-1:-1:-1;4010:146:4;;;;;:::i;:::-;;:::i;5179:166::-;;;;;;;;;;-1:-1:-1;5179:166:4;;;;;:::i;:::-;;:::i;1638:85:0:-;;;;;;;;;;-1:-1:-1;1710:6:0;;-1:-1:-1;;;;;1710:6:0;1638:85;;309:30:4;;;;;;;;;;-1:-1:-1;309:30:4;;;;-1:-1:-1;;;309:30:4;;;;;;11742:102:5;;;;;;;;;;;;;:::i;19186:231::-;;;;;;;;;;-1:-1:-1;19186:231:5;;;;;:::i;:::-;;:::i;4990:181:4:-;;;;;;;;;;-1:-1:-1;4990:181:4;;;;;:::i;:::-;;:::i;488:29::-;;;;;;;;;;;;;;;;27102:405:5;;;;;;:::i;:::-;;:::i;6066:123:4:-;;;;;;;;;;;;;:::i;4805:177::-;;;;;;;;;;-1:-1:-1;4805:177:4;;;;;:::i;:::-;;:::i;11945:322:5:-;;;;;;;;;;-1:-1:-1;11945:322:5;;;;;:::i;:::-;;:::i;4633:164:4:-;;;;;;;;;;-1:-1:-1;4633:164:4;;;;;:::i;:::-;;:::i;5529:291::-;;;;;;:::i;:::-;;:::i;380:24::-;;;;;;;;;;;;;;;;4164:158;;;;;;;;;;-1:-1:-1;4164:158:4;;;;;:::i;:::-;;:::i;451:30::-;;;;;;;;;;;;;;;;19567:162:5;;;;;;;;;;-1:-1:-1;19567:162:5;;;;;:::i;:::-;-1:-1:-1;;;;;19687:25:5;;;19664:4;19687:25;;;:18;:25;;;;;;;;:35;;;;;;;;;;;;;;;19567:162;2543:215:0;;;;;;;;;;-1:-1:-1;2543:215:0;;;;;:::i;:::-;;:::i;10689:630:5:-;10774:4;-1:-1:-1;;;;;;;;;11092:25:5;;;;:101;;-1:-1:-1;;;;;;;;;;11168:25:5;;;11092:101;:177;;;-1:-1:-1;;;;;;;;;;11244:25:5;;;11092:177;11073:196;10689:630;-1:-1:-1;;10689:630:5:o;3720:282:4:-;3886:30;;-1:-1:-1;;3904:10:4;7594:2:7;7590:15;7586:53;3886:30:4;;;7574:66:7;3831:4:4;;;;7656:12:7;;3886:30:4;;;;;;;;;;;;3875:43;;;;;;3854:64;;3936:58;3957:11;;3936:58;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;-1:-1:-1;;3970:10:4;;;-1:-1:-1;3982:10:4;;-1:-1:-1;3936:18:4;:58::i;:::-;3929:65;3720:282;-1:-1:-1;;;;3720:282:4:o;11573:98:5:-;11627:13;11659:5;11652:12;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;11573:98;:::o;18636:223::-;18712:7;18736:16;18744:7;18736;:16::i;:::-;18731:73;;18754:50;-1:-1:-1;;;18754:7:5;:50::i;:::-;-1:-1:-1;18822:24:5;;;;:15;:24;;;;;:30;-1:-1:-1;;;;;18822:30:5;;18636:223::o;18364:122::-;18452:27;18461:2;18465:7;18474:4;18452:8;:27::i;:::-;18364:122;;:::o;22796:3447::-;22933:27;22963;22982:7;22963:18;:27::i;:::-;-1:-1:-1;;;;;23115:22:5;;;;22933:57;;-1:-1:-1;23173:45:5;;;;23169:95;;23220:44;-1:-1:-1;;;23220:7:5;:44::i;:::-;23276:27;21929:24;;;:15;:24;;;;;22153:26;;47819:10;21566:30;;;-1:-1:-1;;;;;21263:28:5;;21544:20;;;21541:56;23459:188;;23551:43;23568:4;47819:10;19567:162;:::i;23551:43::-;23546:101;;23596:51;-1:-1:-1;;;23596:7:5;:51::i;:::-;23658:43;23680:4;23686:2;23690:7;23699:1;23658:21;:43::i;:::-;23790:15;23787:157;;;23928:1;23907:19;23900:30;23787:157;-1:-1:-1;;;;;24316:24:5;;;;;;;:18;:24;;;;;;24314:26;;-1:-1:-1;;24314:26:5;;;24384:22;;;;;;;;;24382:24;;-1:-1:-1;24382:24:5;;;17492:11;17467:23;17463:41;17450:63;-1:-1:-1;;;17450:63:5;24670:26;;;;:17;:26;;;;;:172;;;;-1:-1:-1;;;24959:47:5;;:52;;24955:617;;25063:1;25053:11;;25031:19;25184:30;;;:17;:30;;;;;;:35;;25180:378;;25320:13;;25305:11;:28;25301:239;;25465:30;;;;:17;:30;;;;;:52;;;25301:239;25013:559;24955:617;-1:-1:-1;;;;;25700:20:5;;26071:7;25700:20;26003:4;25946:25;25681:16;;25814:292;26129:8;26141:1;26129:13;26125:58;;26144:39;-1:-1:-1;;;26144:7:5;:39::i;:::-;22923:3320;;;;22796:3447;;;:::o;5828:230:4:-;5923:8;1604:9;;1592:8;1576:13;3227:1;7328:12:5;6951:14;7312:13;:28;-1:-1:-1;;7312:46:5;;6890:564;1576:13:4;:24;;;;:::i;:::-;:37;;1542:144;;;;-1:-1:-1;;;1542:144:4;;;;;;;:::i;:::-;;;;;;;;;2548:15:::1;::::0;5966:8;;-1:-1:-1;;;2548:15:4;::::1;;;2514:117;;;::::0;-1:-1:-1;;;2514:117:4;;8940:2:7;2514:117:4::1;::::0;::::1;8922:21:7::0;8979:2;8959:18;;;8952:30;9018:34;8998:18;;;8991:62;-1:-1:-1;;;9069:18:7;;;9062:36;9115:19;;2514:117:4::1;8738:402:7::0;2514:117:4::1;2714:1;2687:23;2698:10;2687:9;:23::i;:::-;2676:34;::::0;:8;:34:::1;:::i;:::-;:39;;2642:136;;;::::0;-1:-1:-1;;;2642:136:4;;9347:2:7;2642:136:4::1;::::0;::::1;9329:21:7::0;9386:2;9366:18;;;9359:30;9425:34;9405:18;;;9398:62;-1:-1:-1;;;9476:18:7;;;9469:31;9517:19;;2642:136:4::1;9145:397:7::0;2642:136:4::1;2847:15;::::0;2836:26:::1;::::0;:8;:26:::1;:::i;:::-;2823:9;:39;;2789:121;;;::::0;-1:-1:-1;;;2789:121:4;;9922:2:7;2789:121:4::1;::::0;::::1;9904:21:7::0;9961:2;9941:18;;;9934:30;-1:-1:-1;;;9980:18:7;;;9973:49;10039:18;;2789:121:4::1;9720:343:7::0;2789:121:4::1;6020:30:::2;6028:10;6040:8;6020:5;:30::i;:::-;1697:1:::1;5828:230:::0;;:::o;6197:208::-;1531:13:0;:11;:13::i;:::-;6295:49:4::1;::::0;6277:12:::1;::::0;6295:10:::1;::::0;6318:21:::1;::::0;6277:12;6295:49;6277:12;6295:49;6318:21;6295:10;:49:::1;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;6276:68;;;6365:7;6355:41;;;::::0;-1:-1:-1;;;6355:41:4;;10480:2:7;6355:41:4::1;::::0;::::1;10462:21:7::0;10519:2;10499:18;;;10492:30;-1:-1:-1;;;10538:18:7;;;10531:48;10596:18;;6355:41:4::1;10278:342:7::0;6355:41:4::1;6265:140;6197:208::o:0;26334:187:5:-;26475:39;26492:4;26498:2;26502:7;26475:39;;;;;;;;;;;;:16;:39::i;4482:143:4:-;1531:13:0;:11;:13::i;:::-;4597:7:4::1;:20;4607:10:::0;4597:7;:20:::1;:::i;5353:168::-:0;1531:13:0;:11;:13::i;:::-;5477:15:4::1;:36:::0;5353:168::o;12934:150:5:-;13006:7;13048:27;13067:7;13048:18;:27::i;556:21:4:-;;;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::o;4330:144::-;1531:13:0;:11;:13::i;:::-;4442:9:4::1;:24:::0;4330:144::o;8570:239:5:-;8642:7;-1:-1:-1;;;;;8665:19:5;;8661:69;;8686:44;-1:-1:-1;;;8686:7:5;:44::i;:::-;-1:-1:-1;;;;;;8747:25:5;;;;;:18;:25;;;;;;1518:13;8747:55;;8570:239::o;2293:101:0:-;1531:13;:11;:13::i;:::-;2357:30:::1;2384:1;2357:18;:30::i;:::-;2293:101::o:0;4010:146:4:-;1531:13:0;:11;:13::i;:::-;4122:10:4::1;:26:::0;4010:146::o;5179:166::-;1531:13:0;:11;:13::i;:::-;5301:15:4::1;:36:::0;;;::::1;;-1:-1:-1::0;;;5301:36:4::1;-1:-1:-1::0;;;;5301:36:4;;::::1;::::0;;;::::1;::::0;;5179:166::o;11742:102:5:-;11798:13;11830:7;11823:14;;;;;:::i;19186:231::-;47819:10;19280:39;;;;:18;:39;;;;;;;;-1:-1:-1;;;;;19280:49:5;;;;;;;;;;;;:60;;-1:-1:-1;;19280:60:5;;;;;;;;;;19355:55;;540:41:7;;;19280:49:5;;47819:10;19355:55;;513:18:7;19355:55:5;;;;;;;19186:231;;:::o;4990:181:4:-;1531:13:0;:11;:13::i;:::-;5121:18:4::1;:42:::0;4990:181::o;27102:405:5:-;27271:31;27284:4;27290:2;27294:7;27271:12;:31::i;:::-;-1:-1:-1;;;;;27316:14:5;;;:19;27312:189;;27354:56;27385:4;27391:2;27395:7;27404:5;27354:30;:56::i;:::-;27349:152;;27430:56;-1:-1:-1;;;27430:7:5;:56::i;:::-;27102:405;;;;:::o;6066:123:4:-;1531:13:0;:11;:13::i;:::-;6145:36:4::1;6153:10;6165:14;;6145:5;:36::i;4805:177::-:0;1531:13:0;:11;:13::i;:::-;4932:18:4::1;:42:::0;;;::::1;;-1:-1:-1::0;;;4932:42:4::1;-1:-1:-1::0;;;;4932:42:4;;::::1;::::0;;;::::1;::::0;;4805:177::o;11945:322:5:-;12018:13;12048:16;12056:7;12048;:16::i;:::-;12043:68;;12066:45;-1:-1:-1;;;12066:7:5;:45::i;:::-;12122:21;12146:10;:8;:10::i;:::-;12122:34;;12179:7;12173:21;12198:1;12173:26;:87;;;;;;;;;;;;;;;;;12226:7;12235:18;12245:7;12235:9;:18::i;:::-;12209:45;;;;;;;;;:::i;:::-;;;;;;;;;;;;;12173:87;12166:94;11945:322;-1:-1:-1;;;11945:322:5:o;4633:164:4:-;1531:13:0;:11;:13::i;:::-;4755:14:4::1;:34:::0;4633:164::o;5529:291::-;5669:8;1604:9;;1592:8;1576:13;3227:1;7328:12:5;6951:14;7312:13;:28;-1:-1:-1;;7312:46:5;;6890:564;1576:13:4;:24;;;;:::i;:::-;:37;;1542:144;;;;-1:-1:-1;;;1542:144:4;;;;;;;:::i;:::-;5715:8:::1;5725:11;;1883:18;;;;;;;;;;;1849:122;;;::::0;-1:-1:-1;;;1849:122:4;;13440:2:7;1849:122:4::1;::::0;::::1;13422:21:7::0;13479:2;13459:18;;;13452:30;13518:34;13498:18;;;13491:62;-1:-1:-1;;;13569:18:7;;;13562:39;13618:19;;1849:122:4::1;13238:405:7::0;1849:122:4::1;2015:29;2031:11;;2015:13;:29::i;:::-;1982:114;;;::::0;-1:-1:-1;;;1982:114:4;;13850:2:7;1982:114:4::1;::::0;::::1;13832:21:7::0;13889:2;13869:18;;;13862:30;13928:26;13908:18;;;13901:54;13972:18;;1982:114:4::1;13648:348:7::0;1982:114:4::1;2179:1;2152:23;2163:10;2152:9;:23::i;:::-;2141:34;::::0;:8;:34:::1;:::i;:::-;:39;;2107:146;;;::::0;-1:-1:-1;;;2107:146:4;;14203:2:7;2107:146:4::1;::::0;::::1;14185:21:7::0;14242:2;14222:18;;;14215:30;14281:34;14261:18;;;14254:62;-1:-1:-1;;;14332:18:7;;;14325:41;14383:19;;2107:146:4::1;14001:407:7::0;2107:146:4::1;2322:18;::::0;2311:29:::1;::::0;:8;:29:::1;:::i;:::-;2298:9;:42;;2264:124;;;::::0;-1:-1:-1;;;2264:124:4;;9922:2:7;2264:124:4::1;::::0;::::1;9904:21:7::0;9961:2;9941:18;;;9934:30;-1:-1:-1;;;9980:18:7;;;9973:49;10039:18;;2264:124:4::1;9720:343:7::0;2264:124:4::1;5782:30:::2;5790:10;5802:8;5782:5;:30::i;4164:158::-:0;1531:13:0;:11;:13::i;:::-;4280:16:4::1;:34:::0;;;::::1;;-1:-1:-1::0;;;4280:34:4::1;-1:-1:-1::0;;;;4280:34:4;;::::1;::::0;;;::::1;::::0;;4164:158::o;2543:215:0:-;1531:13;:11;:13::i;:::-;-1:-1:-1;;;;;2627:22:0;::::1;2623:91;;2672:31;::::0;-1:-1:-1;;;2672:31:0;;2700:1:::1;2672:31;::::0;::::1;2324:51:7::0;2297:18;;2672:31:0::1;2178:203:7::0;2623:91:0::1;2723:28;2742:8;2723:18;:28::i;1902:154:3:-:0;1993:4;2045;2016:25;2029:5;2036:4;2016:12;:25::i;:::-;:33;;1902:154;-1:-1:-1;;;;1902:154:3:o;19978:465:5:-;20043:11;20089:7;3227:1:4;20070:26:5;20066:371;;20231:13;;20221:7;:23;20217:210;;;20264:14;20296:60;-1:-1:-1;20313:26:5;;;;:17;:26;;;;;;;20303:42;;;20296:60;;20347:9;;;:::i;:::-;;;20296:60;;;-1:-1:-1;;;20383:24:5;:29;;-1:-1:-1;20217:210:5;19978:465;;;:::o;49703:160::-;49802:13;49796:4;49789:27;49842:4;49836;49829:18;41333:460;41457:13;41473:16;41481:7;41473;:16::i;:::-;41457:32;;41504:13;:45;;;;-1:-1:-1;47819:10:5;-1:-1:-1;;;;;41521:28:5;;;;41504:45;41500:198;;;41568:44;41585:5;47819:10;19567:162;:::i;41568:44::-;41563:135;;41632:51;-1:-1:-1;;;41632:7:5;:51::i;:::-;41708:24;;;;:15;:24;;;;;;:35;;-1:-1:-1;;;;;;41708:35:5;-1:-1:-1;;;;;41708:35:5;;;;;;;;;41758:28;;41708:24;;41758:28;;;;;;;41447:346;41333:460;;;:::o;14380:2173::-;14447:14;14496:7;3227:1:4;14477:26:5;14473:2017;;-1:-1:-1;14528:26:5;;;;:17;:26;;;;;;14847:6;14857:1;14847:11;14843:1270;;14893:13;;14882:7;:24;14878:77;;14908:47;-1:-1:-1;;;14908:7:5;:47::i;:::-;15502:597;-1:-1:-1;;;15596:9:5;15578:28;;;;:17;:28;;;;;;15650:25;;15502:597;15650:25;-1:-1:-1;;;15701:6:5;:24;15729:1;15701:29;15697:48;;14380:2173;;;:::o;15697:48::-;16033:47;-1:-1:-1;;;16033:7:5;:47::i;:::-;15502:597;;14843:1270;-1:-1:-1;;;16435:6:5;:24;16463:1;16435:29;16431:48;;14380:2173;;;:::o;16431:48::-;16499:47;-1:-1:-1;;;16499:7:5;:47::i;3244:468:4:-;-1:-1:-1;;;;;3446:20:4;;3441:70;3493:7;3441:70;3555:16;;-1:-1:-1;;;3555:16:4;;;;3521:108;;;;-1:-1:-1;;;3521:108:4;;14756:2:7;3521:108:4;;;14738:21:7;14795:2;14775:18;;;14768:30;14834:31;14814:18;;;14807:59;14883:18;;3521:108:4;14554:353:7;3521:108:4;3640:64;27102:405:5;30652:2343;30724:20;30747:13;;;30774;;;30770:53;;30789:34;-1:-1:-1;;;30789:7:5;:34::i;:::-;30834:61;30864:1;30868:2;30872:12;30886:8;30834:21;:61::i;:::-;31323:31;;;;:17;:31;;;;;;;;-1:-1:-1;;;;;17320:28:5;;17492:11;17467:23;17463:41;17925:1;17912:15;;17886:24;17882:46;17460:52;17450:63;;31323:170;;;31704:22;;;:18;:22;;;;;:71;;31742:32;31730:45;;31704:71;;;17320:28;31960:13;;;31956:54;;31975:35;-1:-1:-1;;;31975:7:5;:35::i;:::-;32039:23;;;;32213:662;32623:7;32580:8;32536:1;32471:25;32409:1;32345;32315:351;32870:3;32857:9;;;;;;:16;32213:662;;-1:-1:-1;32889:13:5;:19;-1:-1:-1;1697:1:4::1;5828:230:::0;;:::o;1796:162:0:-;1710:6;;-1:-1:-1;;;;;1710:6:0;47819:10:5;1855:23:0;1851:101;;1901:40;;-1:-1:-1;;;1901:40:0;;47819:10:5;1901:40:0;;;2324:51:7;2297:18;;1901:40:0;2178:203:7;2912:187:0;3004:6;;;-1:-1:-1;;;;;3020:17:0;;;-1:-1:-1;;;;;;3020:17:0;;;;;;;3052:40;;3004:6;;;3020:17;3004:6;;3052:40;;2985:16;;3052:40;2975:124;2912:187;:::o;29533:673:5:-;29711:88;;-1:-1:-1;;;29711:88:5;;29691:4;;-1:-1:-1;;;;;29711:45:5;;;;;:88;;47819:10;;29778:4;;29784:7;;29793:5;;29711:88;;;:::i;:::-;;;;;;;;;;;;;;;;;;;;-1:-1:-1;29711:88:5;;;;;;;;-1:-1:-1;;29711:88:5;;;;;;;;;;;;:::i;:::-;;;29707:493;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;29989:6;:13;30006:1;29989:18;29985:113;;30027:56;-1:-1:-1;;;30027:7:5;:56::i;:::-;30168:6;30162:13;30153:6;30149:2;30145:15;30138:38;29707:493;-1:-1:-1;;;;;;29867:64:5;-1:-1:-1;;;29867:64:5;;-1:-1:-1;29533:673:5;;;;;;:::o;2938:148:4:-;3032:13;3071:7;3064:14;;;;;:::i;47933:1708:5:-;47998:17;48426:4;48419;48413:11;48409:22;48516:1;48510:4;48503:15;48589:4;48586:1;48582:12;48575:19;;;48669:1;48664:3;48657:14;48770:3;49004:5;48986:419;49051:1;49046:3;49042:11;49035:18;;49219:2;49213:4;49209:13;49205:2;49201:22;49196:3;49188:36;49311:2;49301:13;;49366:25;48986:419;49366:25;-1:-1:-1;49433:13:5;;;-1:-1:-1;;49546:14:5;;;49606:19;;;49546:14;47933:1708;-1:-1:-1;47933:1708:5:o;2457:308:3:-;2540:7;2582:4;2540:7;2596:134;2620:5;:12;2616:1;:16;2596:134;;;2668:51;2696:12;2710:5;2716:1;2710:8;;;;;;;;:::i;:::-;;;;;;;2668:27;:51::i;:::-;2653:66;-1:-1:-1;2634:3:3;;2596:134;;;-1:-1:-1;2746:12:3;2457:308;-1:-1:-1;;;2457:308:3:o;504:169:2:-;579:7;609:1;605;:5;:61;;866:13;930:15;;;965:4;958:15;;;1011:4;995:21;;605:61;;;-1:-1:-1;866:13:2;930:15;;;965:4;958:15;1011:4;995:21;;;504:169::o;14:131:7:-;-1:-1:-1;;;;;;88:32:7;;78:43;;68:71;;135:1;132;125:12;150:245;208:6;261:2;249:9;240:7;236:23;232:32;229:52;;;277:1;274;267:12;229:52;316:9;303:23;335:30;359:5;335:30;:::i;592:367::-;655:8;665:6;719:3;712:4;704:6;700:17;696:27;686:55;;737:1;734;727:12;686:55;-1:-1:-1;760:20:7;;803:18;792:30;;789:50;;;835:1;832;825:12;789:50;872:4;864:6;860:17;848:29;;932:3;925:4;915:6;912:1;908:14;900:6;896:27;892:38;889:47;886:67;;;949:1;946;939:12;886:67;592:367;;;;;:::o;964:437::-;1050:6;1058;1111:2;1099:9;1090:7;1086:23;1082:32;1079:52;;;1127:1;1124;1117:12;1079:52;1167:9;1154:23;1200:18;1192:6;1189:30;1186:50;;;1232:1;1229;1222:12;1186:50;1271:70;1333:7;1324:6;1313:9;1309:22;1271:70;:::i;:::-;1360:8;;1245:96;;-1:-1:-1;964:437:7;-1:-1:-1;;;;964:437:7:o;1406:300::-;1459:3;1497:5;1491:12;1524:6;1519:3;1512:19;1580:6;1573:4;1566:5;1562:16;1555:4;1550:3;1546:14;1540:47;1632:1;1625:4;1616:6;1611:3;1607:16;1603:27;1596:38;1695:4;1688:2;1684:7;1679:2;1671:6;1667:15;1663:29;1658:3;1654:39;1650:50;1643:57;;;1406:300;;;;:::o;1711:231::-;1860:2;1849:9;1842:21;1823:4;1880:56;1932:2;1921:9;1917:18;1909:6;1880:56;:::i;1947:226::-;2006:6;2059:2;2047:9;2038:7;2034:23;2030:32;2027:52;;;2075:1;2072;2065:12;2027:52;-1:-1:-1;2120:23:7;;1947:226;-1:-1:-1;1947:226:7:o;2386:173::-;2454:20;;-1:-1:-1;;;;;2503:31:7;;2493:42;;2483:70;;2549:1;2546;2539:12;2564:300;2632:6;2640;2693:2;2681:9;2672:7;2668:23;2664:32;2661:52;;;2709:1;2706;2699:12;2661:52;2732:29;2751:9;2732:29;:::i;:::-;2722:39;2830:2;2815:18;;;;2802:32;;-1:-1:-1;;;2564:300:7:o;3051:374::-;3128:6;3136;3144;3197:2;3185:9;3176:7;3172:23;3168:32;3165:52;;;3213:1;3210;3203:12;3165:52;3236:29;3255:9;3236:29;:::i;:::-;3226:39;;3284:38;3318:2;3307:9;3303:18;3284:38;:::i;:::-;3051:374;;3274:48;;-1:-1:-1;;;3391:2:7;3376:18;;;;3363:32;;3051:374::o;3612:127::-;3673:10;3668:3;3664:20;3661:1;3654:31;3704:4;3701:1;3694:15;3728:4;3725:1;3718:15;3744:716;3809:5;3841:1;3865:18;3857:6;3854:30;3851:56;;;3887:18;;:::i;:::-;-1:-1:-1;4042:2:7;4036:9;-1:-1:-1;;3955:2:7;3934:15;;3930:29;;4100:2;4088:15;4084:29;4072:42;;4165:22;;;4144:18;4129:34;;4126:62;4123:88;;;4191:18;;:::i;:::-;4227:2;4220:22;4275;;;4260:6;-1:-1:-1;4260:6:7;4312:16;;;4309:25;-1:-1:-1;4306:45:7;;;4347:1;4344;4337:12;4306:45;4397:6;4392:3;4385:4;4377:6;4373:17;4360:44;4452:1;4445:4;4436:6;4428;4424:19;4420:30;4413:41;;3744:716;;;;;:::o;4465:451::-;4534:6;4587:2;4575:9;4566:7;4562:23;4558:32;4555:52;;;4603:1;4600;4593:12;4555:52;4643:9;4630:23;4676:18;4668:6;4665:30;4662:50;;;4708:1;4705;4698:12;4662:50;4731:22;;4784:4;4776:13;;4772:27;-1:-1:-1;4762:55:7;;4813:1;4810;4803:12;4762:55;4836:74;4902:7;4897:2;4884:16;4879:2;4875;4871:11;4836:74;:::i;4921:186::-;4980:6;5033:2;5021:9;5012:7;5008:23;5004:32;5001:52;;;5049:1;5046;5039:12;5001:52;5072:29;5091:9;5072:29;:::i;5297:160::-;5362:20;;5418:13;;5411:21;5401:32;;5391:60;;5447:1;5444;5437:12;5462:180;5518:6;5571:2;5559:9;5550:7;5546:23;5542:32;5539:52;;;5587:1;5584;5577:12;5539:52;5610:26;5626:9;5610:26;:::i;5647:254::-;5712:6;5720;5773:2;5761:9;5752:7;5748:23;5744:32;5741:52;;;5789:1;5786;5779:12;5741:52;5812:29;5831:9;5812:29;:::i;:::-;5802:39;;5860:35;5891:2;5880:9;5876:18;5860:35;:::i;:::-;5850:45;;5647:254;;;;;:::o;5906:713::-;6001:6;6009;6017;6025;6078:3;6066:9;6057:7;6053:23;6049:33;6046:53;;;6095:1;6092;6085:12;6046:53;6118:29;6137:9;6118:29;:::i;:::-;6108:39;;6166:38;6200:2;6189:9;6185:18;6166:38;:::i;:::-;6156:48;-1:-1:-1;6273:2:7;6258:18;;6245:32;;-1:-1:-1;6352:2:7;6337:18;;6324:32;6379:18;6368:30;;6365:50;;;6411:1;6408;6401:12;6365:50;6434:22;;6487:4;6479:13;;6475:27;-1:-1:-1;6465:55:7;;6516:1;6513;6506:12;6465:55;6539:74;6605:7;6600:2;6587:16;6582:2;6578;6574:11;6539:74;:::i;:::-;6529:84;;;5906:713;;;;;;;:::o;6624:551::-;6719:6;6727;6735;6788:2;6776:9;6767:7;6763:23;6759:32;6756:52;;;6804:1;6801;6794:12;6756:52;6849:23;;;-1:-1:-1;6947:2:7;6932:18;;6919:32;6974:18;6963:30;;6960:50;;;7006:1;7003;6996:12;6960:50;7045:70;7107:7;7098:6;7087:9;7083:22;7045:70;:::i;:::-;6624:551;;7134:8;;-1:-1:-1;7019:96:7;;-1:-1:-1;;;;6624:551:7:o;7180:260::-;7248:6;7256;7309:2;7297:9;7288:7;7284:23;7280:32;7277:52;;;7325:1;7322;7315:12;7277:52;7348:29;7367:9;7348:29;:::i;:::-;7338:39;;7396:38;7430:2;7419:9;7415:18;7396:38;:::i;7679:380::-;7758:1;7754:12;;;;7801;;;7822:61;;7876:4;7868:6;7864:17;7854:27;;7822:61;7929:2;7921:6;7918:14;7898:18;7895:38;7892:161;;7975:10;7970:3;7966:20;7963:1;7956:31;8010:4;8007:1;8000:15;8038:4;8035:1;8028:15;7892:161;;7679:380;;;:::o;8064:127::-;8125:10;8120:3;8116:20;8113:1;8106:31;8156:4;8153:1;8146:15;8180:4;8177:1;8170:15;8196:125;8261:9;;;8282:10;;;8279:36;;;8295:18;;:::i;8326:407::-;8528:2;8510:21;;;8567:2;8547:18;;;8540:30;8606:34;8601:2;8586:18;;8579:62;-1:-1:-1;;;8672:2:7;8657:18;;8650:41;8723:3;8708:19;;8326:407::o;9547:168::-;9620:9;;;9651;;9668:15;;;9662:22;;9648:37;9638:71;;9689:18;;:::i;10751:518::-;10853:2;10848:3;10845:11;10842:421;;;10889:5;10886:1;10879:16;10933:4;10930:1;10920:18;11003:2;10991:10;10987:19;10984:1;10980:27;10974:4;10970:38;11039:4;11027:10;11024:20;11021:47;;;-1:-1:-1;11062:4:7;11021:47;11117:2;11112:3;11108:12;11105:1;11101:20;11095:4;11091:31;11081:41;;11172:81;11190:2;11183:5;11180:13;11172:81;;;11249:1;11235:16;;11216:1;11205:13;11172:81;;;11176:3;;10751:518;;;:::o;11445:1299::-;11571:3;11565:10;11598:18;11590:6;11587:30;11584:56;;;11620:18;;:::i;:::-;11649:97;11739:6;11699:38;11731:4;11725:11;11699:38;:::i;:::-;11693:4;11649:97;:::i;:::-;11795:4;11826:2;11815:14;;11843:1;11838:649;;;;12531:1;12548:6;12545:89;;;-1:-1:-1;12600:19:7;;;12594:26;12545:89;-1:-1:-1;;11402:1:7;11398:11;;;11394:24;11390:29;11380:40;11426:1;11422:11;;;11377:57;12647:81;;11808:930;;11838:649;10698:1;10691:14;;;10735:4;10722:18;;-1:-1:-1;;11874:20:7;;;11992:222;12006:7;12003:1;12000:14;11992:222;;;12088:19;;;12082:26;12067:42;;12195:4;12180:20;;;;12148:1;12136:14;;;;12022:12;11992:222;;;11996:3;12242:6;12233:7;12230:19;12227:201;;;12303:19;;;12297:26;-1:-1:-1;;12386:1:7;12382:14;;;12398:3;12378:24;12374:37;12370:42;12355:58;12340:74;;12227:201;-1:-1:-1;;;;12474:1:7;12458:14;;;12454:22;12441:36;;-1:-1:-1;11445:1299:7:o;12749:212::-;12791:3;12829:5;12823:12;12873:6;12866:4;12859:5;12855:16;12850:3;12844:36;12935:1;12899:16;;12924:13;;;-1:-1:-1;12899:16:7;;12749:212;-1:-1:-1;12749:212:7:o;12966:267::-;13145:3;13170:57;13196:30;13222:3;13214:6;13196:30;:::i;:::-;13188:6;13170:57;:::i;14413:136::-;14452:3;14480:5;14470:39;;14489:18;;:::i;:::-;-1:-1:-1;;;14525:18:7;;14413:136::o;14912:496::-;-1:-1:-1;;;;;15143:32:7;;;15125:51;;15212:32;;15207:2;15192:18;;15185:60;15276:2;15261:18;;15254:34;;;15324:3;15319:2;15304:18;;15297:31;;;-1:-1:-1;;15345:57:7;;15382:19;;15374:6;15345:57;:::i;:::-;15337:65;14912:496;-1:-1:-1;;;;;;14912:496:7:o;15413:249::-;15482:6;15535:2;15523:9;15514:7;15510:23;15506:32;15503:52;;;15551:1;15548;15541:12;15503:52;15583:9;15577:16;15602:30;15626:5;15602:30;:::i;15667:127::-;15728:10;15723:3;15719:20;15716:1;15709:31;15759:4;15756:1;15749:15;15783:4;15780:1;15773:15

ipfs://600743494f11b4b202af29b801b67e2fd7011bc0c35fb4c83c1dbe98d7e3fcf0