Contract

Contract Source Code (Solidity Standard Json-Input format)

IDE

• Blockscan IDE
• 🤖 Code ReaderBeta
• Remix IDE

More Options

• Similar
• Sol2Uml
• Submit Audit
• Compare

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

import "lib/erc721A/contracts/ERC721A.sol";
import "lib/solady/src/utils/MerkleProofLib.sol";
import 'lib/solady/src/utils/Base64.sol';
import "@openzeppelin/contracts/access/Ownable.sol";
import "@openzeppelin/contracts/utils/Strings.sol";

contract AsciiPricks is ERC721A, Ownable {
    using Strings for uint256;

    error SaleIsPaused();
    error MaxSupplyReached();
    error MaxPerWalletReached();
    error NoDicFound();
    error InvalidProof();
    error MustMintMoreThanZero();
    error ToughLuckMate();

    mapping(uint256 => uint256) private tokenSeed; //TokenID to TokenSeed
    uint256 public MAX_SUPPLY = 8004;
    bytes32 private merkleRoot;
    mapping(address => bool) private founderWallets;
    bool public saleIsActive = false;
    uint8 public MAX_PER_WALLET = 10;

    struct Color {
        string value;
        string name;
    }

    struct Trait {
        string content;
        string name;
        Color color;
    }

    Color[] colors = [
            Color("#08f7fe", "Glowy Blue"),
            Color("#09fbd3", "Glowy Green"),
            Color("#fe53bb", "Glowy Pink"),
            Color("#f5d300", "Glowy Yellow"),
            Color("#ffacfc", "Bubblegum Pink"),
            Color("#f148fb", "Neon Pink"),
            Color("#7122fa", "Neon Purple"),
            Color("#560a86", "Dark Purple"),
            Color("#ffe3f1", "Light Pink"),
            Color("#fe1c80", "Retro Pink"),
            Color("#ff5f01", "Retro Orange"),
            Color("#ce0000", "Retro Red"),
            Color("#fcf340", "Bokeh Yellow"),
            Color("#7fff00", "Bokeh Green"),
            Color("#fb33db", "Bokeh Pink"),
            Color("#0310ea", "Bokeh Blue"),
            Color("#fcf340", "Plain Yellow"),
            Color("#7fff00", "Plain Green"),
            Color("#fb33db", "Bright Pink"),
            Color("#0310ea", "Plain Blue"),
            Color("#f7ef8a", "Golden")
            ];

    constructor(bytes32 _root, address[] memory wallets, uint32 quantity) ERC721A("ASCII Pricks", "PRICK") {
        merkleRoot = _root;
        for (uint256 i = 0; i < wallets.length;) {
            for (uint256 j = 0; j < 50;) {
                tokenSeed[_totalMinted() + j] = uint256(
                    keccak256(abi.encodePacked(block.timestamp, wallets[i], _totalMinted() + j)) << 108 >> 216
                );
                unchecked { ++j; }
            }

            _mintERC2309(wallets[i], quantity);

            unchecked { ++i; }
        }
    }

    function alMint(bytes32[] calldata _proof, uint32 qty) external payable {
        if (qty == 0) revert MustMintMoreThanZero();
        if (_totalMinted() + qty > MAX_SUPPLY) revert MaxSupplyReached();
        if (_numberMinted(msg.sender) + qty > MAX_PER_WALLET) revert MaxPerWalletReached();

        bytes32 leaf = keccak256((abi.encodePacked(msg.sender)));

        if (!MerkleProofLib.verify(_proof, merkleRoot, leaf)) {
            revert InvalidProof();
        }

        for (uint256 i = 0; i < qty; ) {
            tokenSeed[_totalMinted() + i] = uint256(
                keccak256(abi.encodePacked(block.timestamp, msg.sender, _totalMinted() + i)) << 108 >> 216
            );
            unchecked { ++i; }
        }

        _mint(msg.sender, qty);
    }

    function mint(uint32 qty) external payable {
        if (qty == 0) revert MustMintMoreThanZero();
        if (!saleIsActive) revert SaleIsPaused();
        if (_totalMinted() + qty > MAX_SUPPLY) revert MaxSupplyReached();
        if (_numberMinted(msg.sender) + qty > MAX_PER_WALLET) revert MaxPerWalletReached();

        for (uint256 i = 0; i < qty; ) {
            tokenSeed[_totalMinted() + i] = uint256(
                keccak256(abi.encodePacked(block.timestamp, msg.sender, _totalMinted() + i)) << 108 >> 216
            );
            unchecked { ++i; }
        }

        _mint(msg.sender, qty);
    }

    function flipSaleState() external onlyOwner {
        saleIsActive = !saleIsActive;
    }

    function withdraw() external payable onlyOwner {
        (bool os,)= payable(owner()).call{value: address(this).balance}("");
        require(os);
    }

    function getSeed(uint256 tokenId) public view returns (uint256) {
        if (!_exists(tokenId)) revert NoDicFound();
        return tokenSeed[tokenId];
    }

    /*
    XX    FamilyJewls       90% normal / 10% other
    YY    Fur               75% without / 25% with
    ZZ    length            Linear scale from 0 to 127 - Max len 12
    AA    Tip               Split in 3 get one of 3
    */
    function tokenURI(uint256 tokenId) public override view returns (string memory) {
        uint256 seed = tokenSeed[tokenId];
        Trait memory famjewls = setFamilyJewls(uint8(seed >> 32));           //up to 255
        Trait memory fur = setFur(uint8(seed << 224 >> 248));       //up to 255
        Trait memory length = setLoveDepth(uint8(seed << 240 >> 249)); //up to 127
        Trait memory tip = setTip(uint8(seed << 248 >> 248));     //up to 255
        Trait memory style = setStyle(seed);

        string memory rawSvg = string(
            abi.encodePacked(
                '<svg width="350" height="350" viewBox="0 0 350 350" xmlns="http://www.w3.org/2000/svg">',
                '<rect width="100%" height="100%" fill="#0C090A"/>',
                '<text x="50%" y="50%" font-family="Roboto" font-weight="700" font-size="30" text-anchor="middle" letter-spacing="1">',
                famjewls.content,
                fur.content,
                length.content,
                tip.content,
                '</text>',
                style.content,
                '</svg>'
            )
        );

        string memory encodedSvg = Base64.encode(bytes(rawSvg));
        string memory description = 'Prick';

        return string(
            abi.encodePacked(
                'data:application/json;base64,',
                Base64.encode(
                    bytes(
                        abi.encodePacked(
                            '{',
                            '"name":"PRICKS #', tokenId.toString(), '",',
                            '"description":"', description, '",',
                            '"image": "', 'data:image/svg+xml;base64,', encodedSvg, '",',
                            '"attributes": [{"trait_type": "Tip", "value": "', tip.color.name, ' ', tip.name,'"},',
                            '{"trait_type": "How deep is your love", "value": "', length.color.name,'"},',
                            '{"trait_type": "Fur", "value": "', fur.color.name, ' ', fur.name,'"},',
                            '{"trait_type": "Family Jewls", "value": "', famjewls.color.name, ' ', famjewls.name,'"},',
                            '{"trait_type": "Style", "value": "', style.name,'"}'
                            ']',
                            '}')
                    )
                )
            )
        );
    }

    function setFamilyJewls(uint8 seed) private view returns (Trait memory) {
        Color memory color = setColor(uint8(seed >> 1));
        string memory content;
        string memory name;
        if (seed < 299) {
            content = "8";
            name = "Regular Joe";
        } else {
            content = "d";
            name = "That Lucky Ball";
        }

        return Trait(string(abi.encodePacked('<tspan fill="', color.value, '">', content, '</tspan>')), name, color);
    }

    function setFur(uint8 seed) private view returns (Trait memory) {
        Color memory color;
        string memory content;
        string memory name;
        if (seed > 32 && seed < 223) {
            content = "";
            name = "No Fur";
            color = Color("#0C090A", "");
        } else {
            color = setColor(uint8(seed >> 1));
            content = "#";
            name = "Comfy Fur";
        }

        return Trait(string(abi.encodePacked('<tspan fill="', color.value, '">', content, '</tspan>')), name, color);
    }

    function setLoveDepth(uint8 seed) private view returns (Trait memory) {
        Color memory color = setColor(seed);
        string memory content = "";
        for (uint8 i = 0; i < seed;) {
            if (i % 10 == 0) {
                content = string(abi.encodePacked(content, "="));
            }

            unchecked {
                ++i;
            }
        }

        return Trait(string(abi.encodePacked('<tspan fill="', color.value, '">', content, '</tspan>')), "How deep is your love", color);
    }

    function setTip(uint8 seed) private view returns (Trait memory) {
        Color memory color = setColor(uint8(seed >> 1));
        string memory content;
        string memory name;
        if (seed < 85) {
            content = "D";
            name = "Rounded";
        } else if (seed < 170) {
            content = "()";
            name = "Splashed";
        } else {
            content = ">";
            name = "Arrow";
        }

        return Trait(string(abi.encodePacked('<tspan fill="', color.value, '">', content, '</tspan>')), name, color);
    }

    function setStyle(uint256 seed) private pure returns (Trait memory style) {
        uint256 animation = seed % 100;

        if (animation < 60) {   // 60%
            style.content = '';
            style.name = 'Lousy picture';
        } else if (animation >= 60 && animation < 80) {   // 20%
            style.content = '<style>text {animation: rotate-up 1s steps(5) infinite alternate, rotate-down 0.5s ease-out infinite alternate;transform-origin: center;}@keyframes rotate-up {from {transform: rotate(25deg);}to {transform: rotate(-45deg);}}@keyframes rotate-down {from {transform: rotate(-45deg);}to {transform: rotate(25deg);}}</style>';
            style.name = 'Shake';
        } else if (animation >= 80 && animation < 95) {   // 15%
            style.content = '<style>text {animation: heli 1.5s infinite;transform-origin: 5% 50%;display: inline-block;}@keyframes heli {0% {transform: rotate(720deg);}}</style>';
            style.name = 'Helicopter';
        } else {   // 5%
            style.content = '<style>text {animation: move 0.2s cubic-bezier(.44,.05,.55,.95) infinite alternate;transform-origin: center;}@keyframes move {from {transform: translateX(-20px);}to {transform: translateX(20px);}}</style>';
            style.name = 'Getting lucky';
        }

        return style;
    }

    function setColor(uint8 seed) public view returns (Color memory) {
        uint8 index = seed % uint8(colors.length);

        return colors[index];
    }

    function setMerkleRoot(bytes32 _root) external onlyOwner {
        merkleRoot = _root;
    }

    function getMerkleRoot() view external returns (bytes32) {
        return merkleRoot;
    }
}

// SPDX-License-Identifier: MIT
// ERC721A Contracts v4.2.3
// 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()`.
 *
 * 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;

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

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

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

    /**
     * @dev Returns the starting token ID.
     * To change the starting token ID, please override this function.
     */
    function _startTokenId() internal view virtual returns (uint256) {
        return 0;
    }

    /**
     * @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) {
        // Counter underflow is impossible as _burnCounter cannot be incremented
        // more than `_currentIndex - _startTokenId()` times.
        unchecked {
            return _currentIndex - _burnCounter - _startTokenId();
        }
    }

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

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

    // =============================================================
    //                    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();
        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();

        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 Initializes the ownership slot minted at `index` for efficiency purposes.
     */
    function _initializeOwnershipAt(uint256 index) internal virtual {
        if (_packedOwnerships[index] == 0) {
            _packedOwnerships[index] = _packedOwnershipOf(index);
        }
    }

    /**
     * Returns the packed ownership data of `tokenId`.
     */
    function _packedOwnershipOf(uint256 tokenId) private view returns (uint256) {
        uint256 curr = tokenId;

        unchecked {
            if (_startTokenId() <= curr)
                if (curr < _currentIndex) {
                    uint256 packed = _packedOwnerships[curr];
                    // If not burned.
                    if (packed & _BITMASK_BURNED == 0) {
                        // 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, `curr` will not underflow.
                        //
                        // We can directly compare the packed value.
                        // If the address is zero, packed will be zero.
                        while (packed == 0) {
                            packed = _packedOwnerships[--curr];
                        }
                        return packed;
                    }
                }
        }
        revert OwnerQueryForNonexistentToken();
    }

    /**
     * @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.
     * 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) public payable virtual override {
        address owner = ownerOf(tokenId);

        if (_msgSenderERC721A() != owner)
            if (!isApprovedForAll(owner, _msgSenderERC721A())) {
                revert ApprovalCallerNotOwnerNorApproved();
            }

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

    /**
     * @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();

        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) {
        return
            _startTokenId() <= tokenId &&
            tokenId < _currentIndex && // If within bounds,
            _packedOwnerships[tokenId] & _BITMASK_BURNED == 0; // and not 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);

        if (address(uint160(prevOwnershipPacked)) != from) revert TransferFromIncorrectOwner();

        (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();

        if (to == address(0)) revert TransferToZeroAddress();

        _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;
                    }
                }
            }
        }

        emit Transfer(from, to, tokenId);
        _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();
            }
    }

    /**
     * @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();
            } else {
                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();

        _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:
            // - `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)
            );

            uint256 toMasked;
            uint256 end = startTokenId + quantity;

            // Use assembly to loop and emit the `Transfer` event for gas savings.
            // The duplicated `log4` removes an extra check and reduces stack juggling.
            // The assembly, together with the surrounding Solidity code, have been
            // delicately arranged to nudge the compiler into producing optimized opcodes.
            assembly {
                // Mask `to` to the lower 160 bits, in case the upper bits somehow aren't clean.
                toMasked := and(to, _BITMASK_ADDRESS)
                // 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`.
                    startTokenId // `tokenId`.
                )

                // The `iszero(eq(,))` check ensures that large values of `quantity`
                // that overflows uint256 will make the loop run out of gas.
                // The compiler will optimize the `iszero` away for performance.
                for {
                    let tokenId := add(startTokenId, 1)
                } iszero(eq(tokenId, end)) {
                    tokenId := add(tokenId, 1)
                } {
                    // Emit the `Transfer` event. Similar to above.
                    log4(0, 0, _TRANSFER_EVENT_SIGNATURE, 0, toMasked, tokenId)
                }
            }
            if (toMasked == 0) revert MintToZeroAddress();

            _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();
        if (quantity == 0) revert MintZeroQuantity();
        if (quantity > _MAX_MINT_ERC2309_QUANTITY_LIMIT) revert MintERC2309QuantityExceedsLimit();

        _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)
            );

            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();
                    }
                } while (index < end);
                // Reentrancy protection.
                if (_currentIndex != end) revert();
            }
        }
    }

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

    // =============================================================
    //                        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();
        }

        _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 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();
        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)
        }
    }
}

// SPDX-License-Identifier: MIT
pragma solidity ^0.8.4;

/// @notice Gas optimized verification of proof of inclusion for a leaf in a Merkle tree.
/// @author Solady (https://github.com/vectorized/solady/blob/main/src/utils/MerkleProofLib.sol)
/// @author Modified from Solmate (https://github.com/transmissions11/solmate/blob/main/src/utils/MerkleProofLib.sol)
/// @author Modified from OpenZeppelin (https://github.com/OpenZeppelin/openzeppelin-contracts/blob/master/contracts/utils/cryptography/MerkleProof.sol)
library MerkleProofLib {
    /*´:°•.°+.*•´.*:˚.°*.˚•´.°:°•.°•.*•´.*:˚.°*.˚•´.°:°•.°+.*•´.*:*/
    /*            MERKLE PROOF VERIFICATION OPERATIONS            */
    /*.•°:°.´+˚.*°.˚:*.´•*.+°.•°:´*.´•*.•°.•°:°.´:•˚°.*°.˚:*.´+°.•*/

    /// @dev Returns whether `leaf` exists in the Merkle tree with `root`, given `proof`.
    function verify(bytes32[] memory proof, bytes32 root, bytes32 leaf)
        internal
        pure
        returns (bool isValid)
    {
        /// @solidity memory-safe-assembly
        assembly {
            if mload(proof) {
                // Initialize `offset` to the offset of `proof` elements in memory.
                let offset := add(proof, 0x20)
                // Left shift by 5 is equivalent to multiplying by 0x20.
                let end := add(offset, shl(5, mload(proof)))
                // Iterate over proof elements to compute root hash.
                for {} 1 {} {
                    // Slot of `leaf` in scratch space.
                    // If the condition is true: 0x20, otherwise: 0x00.
                    let scratch := shl(5, gt(leaf, mload(offset)))
                    // Store elements to hash contiguously in scratch space.
                    // Scratch space is 64 bytes (0x00 - 0x3f) and both elements are 32 bytes.
                    mstore(scratch, leaf)
                    mstore(xor(scratch, 0x20), mload(offset))
                    // Reuse `leaf` to store the hash to reduce stack operations.
                    leaf := keccak256(0x00, 0x40)
                    offset := add(offset, 0x20)
                    if iszero(lt(offset, end)) { break }
                }
            }
            isValid := eq(leaf, root)
        }
    }

    /// @dev Returns whether `leaf` exists in the Merkle tree with `root`, given `proof`.
    function verifyCalldata(bytes32[] calldata proof, bytes32 root, bytes32 leaf)
        internal
        pure
        returns (bool isValid)
    {
        /// @solidity memory-safe-assembly
        assembly {
            if proof.length {
                // Left shift by 5 is equivalent to multiplying by 0x20.
                let end := add(proof.offset, shl(5, proof.length))
                // Initialize `offset` to the offset of `proof` in the calldata.
                let offset := proof.offset
                // Iterate over proof elements to compute root hash.
                for {} 1 {} {
                    // Slot of `leaf` in scratch space.
                    // If the condition is true: 0x20, otherwise: 0x00.
                    let scratch := shl(5, gt(leaf, calldataload(offset)))
                    // Store elements to hash contiguously in scratch space.
                    // Scratch space is 64 bytes (0x00 - 0x3f) and both elements are 32 bytes.
                    mstore(scratch, leaf)
                    mstore(xor(scratch, 0x20), calldataload(offset))
                    // Reuse `leaf` to store the hash to reduce stack operations.
                    leaf := keccak256(0x00, 0x40)
                    offset := add(offset, 0x20)
                    if iszero(lt(offset, end)) { break }
                }
            }
            isValid := eq(leaf, root)
        }
    }

    /// @dev Returns whether all `leaves` exist in the Merkle tree with `root`,
    /// given `proof` and `flags`.
    function verifyMultiProof(
        bytes32[] memory proof,
        bytes32 root,
        bytes32[] memory leaves,
        bool[] memory flags
    ) internal pure returns (bool isValid) {
        // Rebuilds the root by consuming and producing values on a queue.
        // The queue starts with the `leaves` array, and goes into a `hashes` array.
        // After the process, the last element on the queue is verified
        // to be equal to the `root`.
        //
        // The `flags` array denotes whether the sibling
        // should be popped from the queue (`flag == true`), or
        // should be popped from the `proof` (`flag == false`).
        /// @solidity memory-safe-assembly
        assembly {
            // Cache the lengths of the arrays.
            let leavesLength := mload(leaves)
            let proofLength := mload(proof)
            let flagsLength := mload(flags)

            // Advance the pointers of the arrays to point to the data.
            leaves := add(0x20, leaves)
            proof := add(0x20, proof)
            flags := add(0x20, flags)

            // If the number of flags is correct.
            for {} eq(add(leavesLength, proofLength), add(flagsLength, 1)) {} {
                // For the case where `proof.length + leaves.length == 1`.
                if iszero(flagsLength) {
                    // `isValid = (proof.length == 1 ? proof[0] : leaves[0]) == root`.
                    isValid := eq(mload(xor(leaves, mul(xor(proof, leaves), proofLength))), root)
                    break
                }

                // The required final proof offset if `flagsLength` is not zero, otherwise zero.
                let proofEnd := mul(iszero(iszero(flagsLength)), add(proof, shl(5, proofLength)))
                // We can use the free memory space for the queue.
                // We don't need to allocate, since the queue is temporary.
                let hashesFront := mload(0x40)
                // Copy the leaves into the hashes.
                // Sometimes, a little memory expansion costs less than branching.
                // Should cost less, even with a high free memory offset of 0x7d00.
                leavesLength := shl(5, leavesLength)
                for { let i := 0 } iszero(eq(i, leavesLength)) { i := add(i, 0x20) } {
                    mstore(add(hashesFront, i), mload(add(leaves, i)))
                }
                // Compute the back of the hashes.
                let hashesBack := add(hashesFront, leavesLength)
                // This is the end of the memory for the queue.
                // We recycle `flagsLength` to save on stack variables (sometimes save gas).
                flagsLength := add(hashesBack, shl(5, flagsLength))

                for {} 1 {} {
                    // Pop from `hashes`.
                    let a := mload(hashesFront)
                    // Pop from `hashes`.
                    let b := mload(add(hashesFront, 0x20))
                    hashesFront := add(hashesFront, 0x40)

                    // If the flag is false, load the next proof,
                    // else, pops from the queue.
                    if iszero(mload(flags)) {
                        // Loads the next proof.
                        b := mload(proof)
                        proof := add(proof, 0x20)
                        // Unpop from `hashes`.
                        hashesFront := sub(hashesFront, 0x20)
                    }

                    // Advance to the next flag.
                    flags := add(flags, 0x20)

                    // Slot of `a` in scratch space.
                    // If the condition is true: 0x20, otherwise: 0x00.
                    let scratch := shl(5, gt(a, b))
                    // Hash the scratch space and push the result onto the queue.
                    mstore(scratch, a)
                    mstore(xor(scratch, 0x20), b)
                    mstore(hashesBack, keccak256(0x00, 0x40))
                    hashesBack := add(hashesBack, 0x20)
                    if iszero(lt(hashesBack, flagsLength)) { break }
                }
                isValid :=
                    and(
                        // Checks if the last value in the queue is same as the root.
                        eq(mload(sub(hashesBack, 0x20)), root),
                        // And whether all the proofs are used, if required (i.e. `proofEnd != 0`).
                        or(iszero(proofEnd), eq(proofEnd, proof))
                    )
                break
            }
        }
    }

    /// @dev Returns whether all `leaves` exist in the Merkle tree with `root`,
    /// given `proof` and `flags`.
    function verifyMultiProofCalldata(
        bytes32[] calldata proof,
        bytes32 root,
        bytes32[] calldata leaves,
        bool[] calldata flags
    ) internal pure returns (bool isValid) {
        // Rebuilds the root by consuming and producing values on a queue.
        // The queue starts with the `leaves` array, and goes into a `hashes` array.
        // After the process, the last element on the queue is verified
        // to be equal to the `root`.
        //
        // The `flags` array denotes whether the sibling
        // should be popped from the queue (`flag == true`), or
        // should be popped from the `proof` (`flag == false`).
        /// @solidity memory-safe-assembly
        assembly {
            // If the number of flags is correct.
            for {} eq(add(leaves.length, proof.length), add(flags.length, 1)) {} {
                // For the case where `proof.length + leaves.length == 1`.
                if iszero(flags.length) {
                    // `isValid = (proof.length == 1 ? proof[0] : leaves[0]) == root`.
                    // forgefmt: disable-next-item
                    isValid := eq(
                        calldataload(
                            xor(leaves.offset, mul(xor(proof.offset, leaves.offset), proof.length))
                        ),
                        root
                    )
                    break
                }

                // The required final proof offset if `flagsLength` is not zero, otherwise zero.
                let proofEnd :=
                    mul(iszero(iszero(flags.length)), add(proof.offset, shl(5, proof.length)))
                // We can use the free memory space for the queue.
                // We don't need to allocate, since the queue is temporary.
                let hashesFront := mload(0x40)
                // Copy the leaves into the hashes.
                // Sometimes, a little memory expansion costs less than branching.
                // Should cost less, even with a high free memory offset of 0x7d00.
                calldatacopy(hashesFront, leaves.offset, shl(5, leaves.length))
                // Compute the back of the hashes.
                let hashesBack := add(hashesFront, shl(5, leaves.length))
                // This is the end of the memory for the queue.
                // We recycle `flagsLength` to save on stack variables (sometimes save gas).
                flags.length := add(hashesBack, shl(5, flags.length))

                // We don't need to make a copy of `proof.offset` or `flags.offset`,
                // as they are pass-by-value (this trick may not always save gas).

                for {} 1 {} {
                    // Pop from `hashes`.
                    let a := mload(hashesFront)
                    // Pop from `hashes`.
                    let b := mload(add(hashesFront, 0x20))
                    hashesFront := add(hashesFront, 0x40)

                    // If the flag is false, load the next proof,
                    // else, pops from the queue.
                    if iszero(calldataload(flags.offset)) {
                        // Loads the next proof.
                        b := calldataload(proof.offset)
                        proof.offset := add(proof.offset, 0x20)
                        // Unpop from `hashes`.
                        hashesFront := sub(hashesFront, 0x20)
                    }

                    // Advance to the next flag offset.
                    flags.offset := add(flags.offset, 0x20)

                    // Slot of `a` in scratch space.
                    // If the condition is true: 0x20, otherwise: 0x00.
                    let scratch := shl(5, gt(a, b))
                    // Hash the scratch space and push the result onto the queue.
                    mstore(scratch, a)
                    mstore(xor(scratch, 0x20), b)
                    mstore(hashesBack, keccak256(0x00, 0x40))
                    hashesBack := add(hashesBack, 0x20)
                    if iszero(lt(hashesBack, flags.length)) { break }
                }
                isValid :=
                    and(
                        // Checks if the last value in the queue is same as the root.
                        eq(mload(sub(hashesBack, 0x20)), root),
                        // And whether all the proofs are used, if required (i.e. `proofEnd != 0`).
                        or(iszero(proofEnd), eq(proofEnd, proof.offset))
                    )
                break
            }
        }
    }

    /*´:°•.°+.*•´.*:˚.°*.˚•´.°:°•.°•.*•´.*:˚.°*.˚•´.°:°•.°+.*•´.*:*/
    /*                   EMPTY CALLDATA HELPERS                   */
    /*.•°:°.´+˚.*°.˚:*.´•*.+°.•°:´*.´•*.•°.•°:°.´:•˚°.*°.˚:*.´+°.•*/

    /// @dev Returns an empty calldata bytes32 array.
    function emptyProof() internal pure returns (bytes32[] calldata proof) {
        /// @solidity memory-safe-assembly
        assembly {
            proof.length := 0
        }
    }

    /// @dev Returns an empty calldata bytes32 array.
    function emptyLeaves() internal pure returns (bytes32[] calldata leaves) {
        /// @solidity memory-safe-assembly
        assembly {
            leaves.length := 0
        }
    }

    /// @dev Returns an empty calldata bool array.
    function emptyFlags() internal pure returns (bool[] calldata flags) {
        /// @solidity memory-safe-assembly
        assembly {
            flags.length := 0
        }
    }
}

// SPDX-License-Identifier: MIT
pragma solidity ^0.8.4;

/// @notice Library to encode strings in Base64.
/// @author Solady (https://github.com/vectorized/solady/blob/main/src/utils/Base64.sol)
/// @author Modified from Solmate (https://github.com/transmissions11/solmate/blob/main/src/utils/Base64.sol)
/// @author Modified from (https://github.com/Brechtpd/base64/blob/main/base64.sol) by Brecht Devos - <[email protected]>.
library Base64 {
    /// @dev Encodes `data` using the base64 encoding described in RFC 4648.
    /// See: https://datatracker.ietf.org/doc/html/rfc4648
    /// @param fileSafe  Whether to replace '+' with '-' and '/' with '_'.
    /// @param noPadding Whether to strip away the padding.
    function encode(bytes memory data, bool fileSafe, bool noPadding)
        internal
        pure
        returns (string memory result)
    {
        /// @solidity memory-safe-assembly
        assembly {
            let dataLength := mload(data)

            if dataLength {
                // Multiply by 4/3 rounded up.
                // The `shl(2, ...)` is equivalent to multiplying by 4.
                let encodedLength := shl(2, div(add(dataLength, 2), 3))

                // Set `result` to point to the start of the free memory.
                result := mload(0x40)

                // Store the table into the scratch space.
                // Offsetted by -1 byte so that the `mload` will load the character.
                // We will rewrite the free memory pointer at `0x40` later with
                // the allocated size.
                // The magic constant 0x0230 will translate "-_" + "+/".
                mstore(0x1f, "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdef")
                mstore(0x3f, sub("ghijklmnopqrstuvwxyz0123456789-_", mul(iszero(fileSafe), 0x0230)))

                // Skip the first slot, which stores the length.
                let ptr := add(result, 0x20)
                let end := add(ptr, encodedLength)

                // Run over the input, 3 bytes at a time.
                for {} 1 {} {
                    data := add(data, 3) // Advance 3 bytes.
                    let input := mload(data)

                    // Write 4 bytes. Optimized for fewer stack operations.
                    mstore8(0, mload(and(shr(18, input), 0x3F)))
                    mstore8(1, mload(and(shr(12, input), 0x3F)))
                    mstore8(2, mload(and(shr(6, input), 0x3F)))
                    mstore8(3, mload(and(input, 0x3F)))
                    mstore(ptr, mload(0x00))

                    ptr := add(ptr, 4) // Advance 4 bytes.
                    if iszero(lt(ptr, end)) { break }
                }
                mstore(0x40, add(end, 0x20)) // Allocate the memory.
                // Equivalent to `o = [0, 2, 1][dataLength % 3]`.
                let o := div(2, mod(dataLength, 3))
                // Offset `ptr` and pad with '='. We can simply write over the end.
                mstore(sub(ptr, o), shl(240, 0x3d3d))
                // Set `o` to zero if there is padding.
                o := mul(iszero(iszero(noPadding)), o)
                mstore(sub(ptr, o), 0) // Zeroize the slot after the string.
                mstore(result, sub(encodedLength, o)) // Store the length.
            }
        }
    }

    /// @dev Encodes `data` using the base64 encoding described in RFC 4648.
    /// Equivalent to `encode(data, false, false)`.
    function encode(bytes memory data) internal pure returns (string memory result) {
        result = encode(data, false, false);
    }

    /// @dev Encodes `data` using the base64 encoding described in RFC 4648.
    /// Equivalent to `encode(data, fileSafe, false)`.
    function encode(bytes memory data, bool fileSafe)
        internal
        pure
        returns (string memory result)
    {
        result = encode(data, fileSafe, false);
    }

    /// @dev Decodes base64 encoded `data`.
    ///
    /// Supports:
    /// - RFC 4648 (both standard and file-safe mode).
    /// - RFC 3501 (63: ',').
    ///
    /// Does not support:
    /// - Line breaks.
    ///
    /// Note: For performance reasons,
    /// this function will NOT revert on invalid `data` inputs.
    /// Outputs for invalid inputs will simply be undefined behaviour.
    /// It is the user's responsibility to ensure that the `data`
    /// is a valid base64 encoded string.
    function decode(string memory data) internal pure returns (bytes memory result) {
        /// @solidity memory-safe-assembly
        assembly {
            let dataLength := mload(data)

            if dataLength {
                let decodedLength := mul(shr(2, dataLength), 3)

                for {} 1 {} {
                    // If padded.
                    if iszero(and(dataLength, 3)) {
                        let t := xor(mload(add(data, dataLength)), 0x3d3d)
                        // forgefmt: disable-next-item
                        decodedLength := sub(
                            decodedLength,
                            add(iszero(byte(30, t)), iszero(byte(31, t)))
                        )
                        break
                    }
                    // If non-padded.
                    decodedLength := add(decodedLength, sub(and(dataLength, 3), 1))
                    break
                }
                result := mload(0x40)

                // Write the length of the bytes.
                mstore(result, decodedLength)

                // Skip the first slot, which stores the length.
                let ptr := add(result, 0x20)
                let end := add(ptr, decodedLength)

                // Load the table into the scratch space.
                // Constants are optimized for smaller bytecode with zero gas overhead.
                // `m` also doubles as the mask of the upper 6 bits.
                let m := 0xfc000000fc00686c7074787c8084888c9094989ca0a4a8acb0b4b8bcc0c4c8cc
                mstore(0x5b, m)
                mstore(0x3b, 0x04080c1014181c2024282c3034383c4044484c5054585c6064)
                mstore(0x1a, 0xf8fcf800fcd0d4d8dce0e4e8ecf0f4)

                for {} 1 {} {
                    // Read 4 bytes.
                    data := add(data, 4)
                    let input := mload(data)

                    // Write 3 bytes.
                    // forgefmt: disable-next-item
                    mstore(ptr, or(
                        and(m, mload(byte(28, input))),
                        shr(6, or(
                            and(m, mload(byte(29, input))),
                            shr(6, or(
                                and(m, mload(byte(30, input))),
                                shr(6, mload(byte(31, input)))
                            ))
                        ))
                    ))
                    ptr := add(ptr, 3)
                    if iszero(lt(ptr, end)) { break }
                }
                mstore(0x40, add(end, 0x20)) // Allocate the memory.
                mstore(end, 0) // Zeroize the slot after the bytes.
                mstore(0x60, 0) // Restore the zero slot.
            }
        }
    }
}

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

pragma solidity ^0.8.0;

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

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

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

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

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

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

    /**
     * @dev Throws if the sender is not the owner.
     */
    function _checkOwner() internal view virtual {
        require(owner() == _msgSender(), "Ownable: caller is not the owner");
    }

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

    /**
     * @dev Transfers ownership of the contract to a new account (`newOwner`).
     * Can only be called by the current owner.
     */
    function transferOwnership(address newOwner) public virtual onlyOwner {
        require(newOwner != address(0), "Ownable: new owner is the zero address");
        _transferOwnership(newOwner);
    }

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

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

pragma solidity ^0.8.0;

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

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

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

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

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

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

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

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

// SPDX-License-Identifier: MIT
// ERC721A Contracts v4.2.3
// 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();

    // =============================================================
    //                            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 v4.4.1 (utils/Context.sol)

pragma solidity ^0.8.0;

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

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

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

pragma solidity ^0.8.0;

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

pragma solidity ^0.8.0;

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

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

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

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

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

• No Contract Security Audit Submitted- Submit Audit Here

[{"inputs":[{"internalType":"bytes32","name":"_root","type":"bytes32"},{"internalType":"address[]","name":"wallets","type":"address[]"},{"internalType":"uint32","name":"quantity","type":"uint32"}],"stateMutability":"nonpayable","type":"constructor"},{"inputs":[],"name":"ApprovalCallerNotOwnerNorApproved","type":"error"},{"inputs":[],"name":"ApprovalQueryForNonexistentToken","type":"error"},{"inputs":[],"name":"BalanceQueryForZeroAddress","type":"error"},{"inputs":[],"name":"InvalidProof","type":"error"},{"inputs":[],"name":"MaxPerWalletReached","type":"error"},{"inputs":[],"name":"MaxSupplyReached","type":"error"},{"inputs":[],"name":"MintERC2309QuantityExceedsLimit","type":"error"},{"inputs":[],"name":"MintToZeroAddress","type":"error"},{"inputs":[],"name":"MintZeroQuantity","type":"error"},{"inputs":[],"name":"MustMintMoreThanZero","type":"error"},{"inputs":[],"name":"NoDicFound","type":"error"},{"inputs":[],"name":"OwnerQueryForNonexistentToken","type":"error"},{"inputs":[],"name":"OwnershipNotInitializedForExtraData","type":"error"},{"inputs":[],"name":"SaleIsPaused","type":"error"},{"inputs":[],"name":"ToughLuckMate","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":[],"name":"MAX_PER_WALLET","outputs":[{"internalType":"uint8","name":"","type":"uint8"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"MAX_SUPPLY","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"bytes32[]","name":"_proof","type":"bytes32[]"},{"internalType":"uint32","name":"qty","type":"uint32"}],"name":"alMint","outputs":[],"stateMutability":"payable","type":"function"},{"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":"flipSaleState","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"getApproved","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"getMerkleRoot","outputs":[{"internalType":"bytes32","name":"","type":"bytes32"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"getSeed","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"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":[{"internalType":"uint32","name":"qty","type":"uint32"}],"name":"mint","outputs":[],"stateMutability":"payable","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":[],"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":[],"name":"saleIsActive","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"operator","type":"address"},{"internalType":"bool","name":"approved","type":"bool"}],"name":"setApprovalForAll","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint8","name":"seed","type":"uint8"}],"name":"setColor","outputs":[{"components":[{"internalType":"string","name":"value","type":"string"},{"internalType":"string","name":"name","type":"string"}],"internalType":"struct AsciiPricks.Color","name":"","type":"tuple"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"bytes32","name":"_root","type":"bytes32"}],"name":"setMerkleRoot","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":[{"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":"","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":[],"name":"withdraw","outputs":[],"stateMutability":"payable","type":"function"}]

60808060405234620010bb5762003b018038038091620000208285620010fe565b83398101606082820312620010bb57815160208301519092906001600160401b038111620010bb57810182601f82011215620010bb578051926001600160401b03841162000c29578360051b9160405194620000806020850187620010fe565b8552602080860193820101918211620010bb57602001915b818310620010c057505050604001519063ffffffff82168203620010bb5760405192620000c584620010e2565b600c84526b415343494920507269636b7360a01b602085015260405193620000ed85620010e2565b6005855264505249434b60d81b60208601528051906001600160401b03821162000c29576200011e60025462001122565b601f811162001079575b50602090601f831160011462000ffe576200015d92916000918362000d31575b50508160011b916000199060031b1c19161790565b6002555b83516001600160401b03811162000c29576200017f60035462001122565b601f811162000fab575b50602094601f821160011462000f3e57620001c092939495829160009262000d315750508160011b916000199060031b1c19161790565b6003555b600080805560088054336001600160a01b031982168117909255604051926001600160a01b03909116907f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e09080a3611f44600a55600d805461ffff1916610a001790556102a081016001600160401b0381118282101762000c2957806040526200024e81620010e2565b6040516200025c81620010e2565b60078152662330386637666560c81b602082015281526040516200028081620010e2565b600a815269476c6f777920426c756560b01b60208201526102c08301528152604051620002ad81620010e2565b604051620002bb81620010e2565b60078152662330396662643360c81b60208201528152604051620002df81620010e2565b600b81526a23b637bbbc9023b932b2b760a91b6020820152602082015260208201526040516200030f81620010e2565b6040516200031d81620010e2565b600781526611b3329a99b13160c91b602082015281526040516200034181620010e2565b600a815269476c6f77792050696e6b60b01b6020820152602082015260408201526040516200037081620010e2565b6040516200037e81620010e2565b60078152660236635643330360cc1b60208201528152604051620003a281620010e2565b600c81526b476c6f77792059656c6c6f7760a01b602082015260208201526060820152604051620003d381620010e2565b604051620003e181620010e2565b60078152662366666163666360c81b602082015281526040516200040581620010e2565b600e81526d427562626c6567756d2050696e6b60901b6020820152602082015260808201526040516200043881620010e2565b6040516200044681620010e2565b600781526611b3189a1c333160c91b602082015281526040516200046a81620010e2565b60098152684e656f6e2050696e6b60b81b6020820152602082015260a08201526040516200049881620010e2565b604051620004a681620010e2565b60078152662337313232666160c81b60208201528152604051620004ca81620010e2565b600b81526a4e656f6e20507572706c6560a81b6020820152602082015260c0820152604051620004fa81620010e2565b6040516200050881620010e2565b6007815266119a9b18309c1b60c91b602082015281526040516200052c81620010e2565b600b81526a4461726b20507572706c6560a81b6020820152602082015260e08201526040516200055c81620010e2565b6040516200056a81620010e2565b60078152662366666533663160c81b602082015281526040516200058e81620010e2565b600a8152694c696768742050696e6b60b01b60208201526020820152610100820152604051620005be81620010e2565b604051620005cc81620010e2565b60078152660236665316338360cc1b60208201528152604051620005f081620010e2565b600a815269526574726f2050696e6b60b01b602082015260208201526101208201526040516200062081620010e2565b6040516200062e81620010e2565b60078152662366663566303160c81b602082015281526040516200065281620010e2565b600c81526b526574726f204f72616e676560a01b602082015260208201526101408201526040516200068481620010e2565b6040516200069281620010e2565b60078152660236365303030360cc1b60208201528152604051620006b681620010e2565b600981526814995d1c9bc814995960ba1b60208201526020820152610160820152604051620006e581620010e2565b60405190620006f482620010e2565b60078252660236663663334360cc1b9182602082015281526040516200071a81620010e2565b600c81526b426f6b65682059656c6c6f7760a01b602082015260208201526101808301526040516200074c81620010e2565b604051906200075b82620010e2565b60078252660233766666630360cc1b9182602082015281526040516200078181620010e2565b600b81526a2137b5b2b41023b932b2b760a91b602082015260208201526101a084015260405190620007b382620010e2565b60405191620007c283620010e2565b600783526611b3311999b23160c91b928360208201528152604051620007e881620010e2565b600a815269426f6b65682050696e6b60b01b602082015260208201526101c0850152604051926200081984620010e2565b604051936200082885620010e2565b60078552662330333130656160c81b9485602082015281526040516200084e81620010e2565b600a815269426f6b656820426c756560b01b602082015260208201526101e0860152604051906200087f82620010e2565b604051906200088e82620010e2565b6007825260208201528152604051620008a781620010e2565b600c81526b506c61696e2059656c6c6f7760a01b6020820152602082015261020085015260405190620008da82620010e2565b60405190620008e982620010e2565b60078252602082015281526040516200090281620010e2565b600b81526a283630b4b71023b932b2b760a91b60208201526020820152610220840152604051906200093482620010e2565b604051906200094382620010e2565b60078252602082015281526040516200095c81620010e2565b600b81526a4272696768742050696e6b60a81b60208201526020820152610240830152604051906200098e82620010e2565b604051906200099d82620010e2565b6007825260208201528152604051620009b681620010e2565b600a815269506c61696e20426c756560b01b60208201526020820152610260820152604051620009e681620010e2565b604051620009f481620010e2565b60078152662366376566386160c81b6020820152815260405162000a1881620010e2565b600681526523b7b63232b760d11b60208201526020820152610280820152600e546015600e558060151062000ea7575b50600e600090815260008051602062003ae1833981519152915b6015821062000c4f57505050600b556000905b805182101562000c3f5760005b6032811062000b8e5750906001600160a01b0362000aa18284620011c7565b511690600054821562000b7d5763ffffffff85161562000b6b5761138863ffffffff86161162000b595782600193600052600560205260406000206801000000000000000163ffffffff88160281540190558160005260046020528363ffffffff87161460e11b4260a01b178117604060002055600063ffffffff87168301927fdeaa91b6123d068f5821d0fb0678463d1a8a6079fe8af5de3ce5e896dcf9133d6020604051841987018152a4600055019062000a75565b604051633db1f9af60e01b8152600490fd5b60405163b562e8dd60e01b8152600490fd5b604051622e076360e81b8152600490fd5b62000b9a8383620011c7565b519060005462000bab8282620011f2565b60408051426020820190815260609690961b6001600160601b031916918101919091526054808201929092529081526080810193906001600160401b0385118186101762000c295764ffffffffff62000c14928592600197604052519020606c1c1692620011f2565b60005260096020526040600020550162000a82565b634e487b7160e01b600052604160045260246000fd5b6040516128c09081620012018239f35b805180518051906001600160401b03821162000c295762000c71865462001122565b601f811162000e71575b50602090601f831160011462000dfc57918062000cb3926020959460009262000d315750508160011b916000199060031b1c19161790565b85555b01518051906001600160401b03821162000c295762000cd9600186015462001122565b601f811162000db7575b50602090601f831160011462000d3d579262000d1f8360029460209460019760009262000d315750508160011b916000199060031b1c19161790565b848701555b0193019101909162000a62565b01519050388062000148565b906001860160005260206000209160005b601f198516811062000d9e575083602093600196938793600297601f1981161062000d84575b505050811b018487015562000d24565b015160001960f88460031b161c1916905538808062000d74565b9192602060018192868501518155019401920162000d4e565b62000dea90600187016000526020600020601f850160051c8101916020861062000df1575b601f0160051c01906200115f565b3862000ce3565b909150819062000ddc565b929190866000526020600020906000945b601f198416861062000e55576020955083601f1981161062000e3b575b505050600190811b01855562000cb6565b015160001960f88460031b161c1916905538808062000e2a565b8181015183556020958601956001909301929091019062000e0d565b62000ea090876000526020600020601f850160051c8101916020861062000df157601f0160051c01906200115f565b3862000c7b565b60016001600160ff1b038216820362000f2857600e60005290811b60008051602062003ae183398151915201907fbb7b4a454dc3493923482f07822329ed19e8244eff582cc204f8554c3620c4275b82811062000f0657505062000a48565b8062000f1460029262001178565b62000f2183820162001178565b0162000ef6565b634e487b7160e01b600052601160045260246000fd5b601f19821695600360005260206000209160005b88811062000f925750836001959697981062000f78575b505050811b01600355620001c4565b015160001960f88460031b161c1916905538808062000f69565b9192602060018192868501518155019401920162000f52565b600360005262000ff7907fc2575a0e9e593c00f959f8c92f12db2869c3395a3b0502d05e2516446f71f85b601f840160051c8101916020851062000df157601f0160051c01906200115f565b3862000189565b6002600090815260008051602062003ac1833981519152929190601f198516905b81811062001060575090846001959493921062001046575b505050811b0160025562000161565b015160001960f88460031b161c1916905538808062001037565b929360206001819287860151815501950193016200101f565b6002600052620010b49060008051602062003ac1833981519152601f850160051c8101916020861062000df157601f0160051c01906200115f565b3862000128565b600080fd5b82516001600160a01b0381168103620010bb5781526020928301920162000098565b604081019081106001600160401b0382111762000c2957604052565b601f909101601f19168101906001600160401b0382119082101762000c2957604052565b90600182811c9216801562001154575b60208310146200113e57565b634e487b7160e01b600052602260045260246000fd5b91607f169162001132565b8181106200116b575050565b600081556001016200115f565b62001184815462001122565b90816200118f575050565b81601f60009311600114620011a2575055565b908083918252620011c3601f60208420940160051c8401600185016200115f565b5555565b8051821015620011dc5760209160051b010190565b634e487b7160e01b600052603260045260246000fd5b9190820180921162000f285756fe6080604052600436101561001257600080fd5b60003560e01c806301ffc9a7146101d757806306fdde03146101d2578063081812fc146101cd578063095ea7b3146101c85780630f2cdd6c146101c357806318160ddd146101be578063209bc6a5146101b957806323b872dd146101b457806323b9f3bb146101af57806332cb6b0c146101aa57806334918dfd146101a55780633ccfd60b146101a057806342842e0e1461019b57806349590657146101965780636352211e1461019157806370a082311461018c578063715018a6146101875780637cb64759146101825780638da5cb5b1461017d57806395d89b4114610178578063a22cb46514610173578063a71bbebe1461016e578063b88d4fde14610169578063c87b56dd14610164578063e0d4ea371461015f578063e985e9c51461015a578063eb8d2444146101555763f2fde38b1461015057600080fd5b611284565b611261565b611204565b6111b8565b610c4d565b610bca565b6109af565b610921565b61085e565b610835565b610814565b6107b6565b61075b565b61072c565b61070e565b6106eb565b6106b2565b610681565b610663565b610604565b6105f2565b61055a565b610524565b610500565b610449565b6103c9565b6102bd565b6101f3565b6001600160e01b03198116036101ee57565b600080fd5b346101ee5760203660031901126101ee576020600435610212816101dc565b63ffffffff60e01b166301ffc9a760e01b8114908115610250575b811561023f575b506040519015158152f35b635b5e139f60e01b14905038610234565b6380ac58cd60e01b8114915061022d565b60005b8381106102745750506000910152565b8181015183820152602001610264565b9060209161029d81518092818552858086019101610261565b601f01601f1916010190565b9060206102ba928181520190610284565b90565b346101ee576000806003193601126103c65760405190806002549060019180831c928082169283156103bc575b60209283861085146103a8578588526020880194908115610387575060011461032e575b61032a8761031e81890382610b60565b604051918291826102a9565b0390f35b600260005294509192917f405787fa12a823e0f2b7631cc41b3ba8828b3321ca811111fa75cd3aa3bb5ace5b838610610376575050509101905061031e8261032a388061030e565b80548587015294820194810161035a565b60ff191685525050505090151560051b01905061031e8261032a388061030e565b634e487b7160e01b82526022600452602482fd5b93607f16936102ea565b80fd5b346101ee5760203660031901126101ee576004356103e68161149f565b1561040b576000526006602052602060018060a01b0360406000205416604051908152f35b6040516333d1c03960e21b8152600490fd5b600435906001600160a01b03821682036101ee57565b602435906001600160a01b03821682036101ee57565b60403660031901126101ee5761045d61041d565b6024356001600160a01b038061047283611430565b16908133036104cd575b600083815260066020526040812080546001600160a01b0319166001600160a01b0387161790559316907f8c5be1e5ebec7d5bd14f71427d1e84f3dd0314c0f7b2291e5b200ac8c7c3b9258480a480f35b600082815260076020908152604080832033845290915290205460ff1661047c576040516367d9dca160e11b8152600490fd5b346101ee5760003660031901126101ee57602060ff600d5460081c16604051908152f35b346101ee5760003660031901126101ee5760206000546001549003604051908152f35b6004359063ffffffff821682036101ee57565b60403660031901126101ee576004356001600160401b038082116101ee57366023830112156101ee5781600401359081116101ee573660248260051b840101116101ee576024359063ffffffff821682036101ee5760246105bb93016118e3565b005b60609060031901126101ee576001600160a01b039060043582811681036101ee579160243590811681036101ee579060443590565b6105bb6105fe366105bd565b916114c8565b346101ee5760203660031901126101ee5760043560ff811681036101ee5761062e61032a916127ce565b60405191829160208352602061064f82516040838701526060860190610284565b910151838203601f19016040850152610284565b346101ee5760003660031901126101ee576020600a54604051908152f35b346101ee5760003660031901126101ee5761069a611813565b600d5460ff80821615169060ff191617600d55600080f35b6000806003193601126103c6576106c7611813565b8080808060018060a01b036008541647905af16106e261173a565b50156103c65780f35b6105bb6106f7366105bd565b906040519261070584610b45565b600084526116b0565b346101ee5760003660031901126101ee576020600b54604051908152f35b346101ee5760203660031901126101ee5760206001600160a01b03610752600435611430565b16604051908152f35b346101ee5760203660031901126101ee576001600160a01b0361077c61041d565b1680156107a457600052600560205260206001600160401b0360406000205416604051908152f35b6040516323d3ad8160e21b8152600490fd5b346101ee576000806003193601126103c6576107d0611813565b600880546001600160a01b0319811690915581906001600160a01b03167f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e08280a380f35b346101ee5760203660031901126101ee5761082d611813565b600435600b55005b346101ee5760003660031901126101ee576008546040516001600160a01b039091168152602090f35b346101ee576000806003193601126103c65760405190806003549060019180831c92808216928315610917575b60209283861085146103a857858852602088019490811561038757506001146108be5761032a8761031e81890382610b60565b600360005294509192917fc2575a0e9e593c00f959f8c92f12db2869c3395a3b0502d05e2516446f71f85b5b838610610906575050509101905061031e8261032a388061030e565b8054858701529482019481016108ea565b93607f169361088b565b346101ee5760403660031901126101ee5761093a61041d565b602435908115158092036101ee573360009081526007602090815260408083206001600160a01b0385168452909152902060ff1981541660ff841617905560405191825260018060a01b0316907f17307eab39ab6107e8899845ad3d59bd9653f200f220920489ca2b5937696c3160203392a3005b6020806003193601126101ee5763ffffffff6109c9610547565b168015610afd57600d549160ff831615610aeb576000926109eb83855461186b565b600a5410610ad95733600090815260056020526040908190205460ff91610a1d9186911c6001600160401b031661186b565b9160081c1610610ac757825b828110610a3e5783610a3b8433611a2a565b80f35b6001908454610ac0610ab083610aaa610aa4610a5a838761186b565b604051428b82019081523360601b6bffffffffffffffffffffffff191660208201526034810192909252610a9b81605484015b03601f198101835282610b60565b519020606c1b90565b60d81c90565b9361186b565b6000526009602052604060002090565b5501610a29565b60405163d330f98560e01b8152600490fd5b60405163d05cb60960e01b8152600490fd5b604051631c7324b560e21b8152600490fd5b604051633fa6c4c760e21b8152600490fd5b634e487b7160e01b600052604160045260246000fd5b604081019081106001600160401b03821117610b4057604052565b610b0f565b602081019081106001600160401b03821117610b4057604052565b90601f801991011681019081106001600160401b03821117610b4057604052565b60405190606082018281106001600160401b03821117610b4057604052565b60405190610bad82610b25565b565b6001600160401b038111610b4057601f01601f191660200190565b60803660031901126101ee57610bde61041d565b610be6610433565b606435916001600160401b0383116101ee57366023840112156101ee57826004013591610c1283610baf565b92610c206040519485610b60565b80845236602482870101116101ee5760208160009260246105bb98018388013785010152604435916116b0565b346101ee576020806003193601126101ee57600435610c76816000526009602052604060002090565b5490610c8660ff83851c16611eb2565b91838160181c60ff16610c9890612021565b928260091c607f16610ca990612114565b94610cb660ff85166122b9565b93610cc090612756565b90805196865196815191875199855160409b8c9586519c8d948c8601610d56906057907f3c7376672077696474683d2233353022206865696768743d223335302220766981527f6577426f783d2230203020333530203335302220786d6c6e733d22687474703a60208201527f2f2f7777772e77332e6f72672f323030302f737667223e00000000000000000060408201520190565b7f3c726563742077696474683d223130302522206865696768743d223130302522815270103334b6361e91119821981c982091179f60791b60208201526031017f3c7465787420783d223530252220793d223530252220666f6e742d66616d696c81527f793d22526f626f746f2220666f6e742d7765696768743d223730302220666f6e60208201527f742d73697a653d2233302220746578742d616e63686f723d226d6964646c6522604082015273103632ba3a32b916b9b830b1b4b7339e9118911f60611b6060820152607401610e2e91611b63565b610e3791611b63565b610e4091611b63565b610e4991611b63565b661e17ba32bc3a1f60c91b8152600701610e6291611b63565b651e17b9bb339f60d11b81526006010398601f19998a81018252610e869082610b60565b610e8f90611d10565b90610e98611b7a565b96610ea290611bcd565b988885818082850151015193015193015101519289808080808a8a01510151980151988a01510151980151980151988d519b8c9b8c01610eea90600190607b60f81b81520190565b6f226e616d65223a22505249434b53202360801b8152601001610f0c91611b63565b61088b60f21b81526002016e113232b9b1b934b83a34b7b7111d1160891b8152600f01610f3891611b63565b61088b60f21b8152600201691134b6b0b3b2911d101160b11b8152600a017f646174613a696d6167652f7376672b786d6c3b6261736536342c0000000000008152601a01610f8591611b63565b61088b60f21b81526002017f2261747472696275746573223a205b7b2274726169745f74797065223a20225481526e34b8111610113b30b63ab2911d101160891b6020820152602f01610fd791611b63565b600160fd1b8152600101610fea91611b63565b62089f4b60ea1b81526003017f7b2274726169745f74797065223a2022486f77206465657020697320796f7572815271103637bb32911610113b30b63ab2911d101160711b602082015260320161104091611b63565b62089f4b60ea1b81526003017f7b2274726169745f74797065223a2022467572222c202276616c7565223a2022815260200161107b91611b63565b600160fd1b815260010161108e91611b63565b62089f4b60ea1b81526003017f7b2274726169745f74797065223a202246616d696c79204a65776c73222c20228152683b30b63ab2911d101160b91b60208201526029016110db91611b63565b600160fd1b81526001016110ee91611b63565b62089f4b60ea1b81526003017f7b2274726169745f74797065223a20225374796c65222c202276616c7565223a815261101160f11b602082015260220161113491611b63565b62227d5d60e81b8152600301607d60f81b815260010103828101825261115a9082610b60565b61116390611d10565b82517f646174613a6170706c69636174696f6e2f6a736f6e3b6261736536342c00000094810194855293849190601d0161119c91611b63565b0390810183526111ac9083610b60565b5161032a8192826102a9565b346101ee5760203660031901126101ee576004356111d58161149f565b156111f25760005260096020526020604060002054604051908152f35b604051635747e7fd60e11b8152600490fd5b346101ee5760403660031901126101ee57602060ff61125561122461041d565b61122c610433565b6001600160a01b0391821660009081526007865260408082209290931681526020919091522090565b54166040519015158152f35b346101ee5760003660031901126101ee57602060ff600d54166040519015158152f35b346101ee5760203660031901126101ee5761129d61041d565b6112a5611813565b6001600160a01b039081169081156112f957600854826bffffffffffffffffffffffff60a01b821617600855167f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e0600080a3005b60405162461bcd60e51b815260206004820152602660248201527f4f776e61626c653a206e6577206f776e657220697320746865207a65726f206160448201526564647265737360d01b6064820152608490fd5b9060405190600092805493600185811c92818716918215611426575b6020918286108414611412578798611388878a98999a60209181520190565b949081156113f157506001146113a9575b50505050610bad92500383610b60565b6113bd919450959195600052602060002090565b946000935b8285106113db57505050610bad93500138808080611399565b86548585015295860195889550938101936113c2565b9350505050610bad9491925060ff19168252151560051b0138808080611399565b634e487b7160e01b85526022600452602485fd5b93607f1693611369565b806000908154811061144f575b604051636f96cda160e11b8152600490fd5b81526004906020918083526040928383205494600160e01b8616156114765750505061143d565b93929190935b851561148a57505050505090565b6000190180835281855283832054955061147c565b600054811090816114ae575090565b90506000526004602052600160e01b604060002054161590565b906114d283611430565b6001600160a01b038381169282821684900361168c576000868152600660205260409020805490926115176001600160a01b03881633908114908414171590565b1590565b611631575b821695861561161f576115819361154d92611615575b506001600160a01b0316600090815260056020526040902090565b80546000190190556001600160a01b03166000818152600560205260409020805460010190554260a01b17600160e11b1790565b611595856000526004602052604060002090565b55600160e11b8116156115cb575b507fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef600080a4565b600184016115e3816000526004602052604060002090565b54156115f0575b506115a3565b60005481146115ea5761160d906000526004602052604060002090565b5538806115ea565b6000905538611532565b604051633a954ecd60e21b8152600490fd5b61167561151361166e336116578b60018060a01b03166000526007602052604060002090565b9060018060a01b0316600052602052604060002090565b5460ff1690565b1561151c57604051632ce44b5f60e11b8152600490fd5b60405162a1148160e81b8152600490fd5b604051906116aa82610b45565b60008252565b9291906116be8282866114c8565b803b6116cb575b50505050565b6116d49361176a565b156116e257388080806116c5565b6040516368d2bf6b60e11b8152600490fd5b908160209103126101ee57516102ba816101dc565b6001600160a01b0391821681529116602082015260408101919091526080606082018190526102ba92910190610284565b3d15611765573d9061174b82610baf565b916117596040519384610b60565b82523d6000602084013e565b606090565b92602091611793936000604051809681958294630a85bd0160e11b9a8b85523360048601611709565b03926001600160a01b03165af1600091816117e3575b506117d5576117b661173a565b805190816117d0576040516368d2bf6b60e11b8152600490fd5b602001fd5b6001600160e01b0319161490565b61180591925060203d811161180c575b6117fd8183610b60565b8101906116f4565b90386117a9565b503d6117f3565b6008546001600160a01b0316330361182757565b606460405162461bcd60e51b815260206004820152602060248201527f4f776e61626c653a2063616c6c6572206973206e6f7420746865206f776e65726044820152fd5b9190820180921161187857565b634e487b7160e01b600052601160045260246000fd5b9092916001600160401b038411610b40578360051b602092836040516118b682850182610b60565b80978152019181019283116101ee57905b8282106118d45750505050565b813581529083019083016118c7565b909163ffffffff16918215610afd5760009161190084845461186b565b600a5410610ad957336000908152600560205260409081902054611930918691901c6001600160401b031661186b565b600d5460081c60ff1610610ac75760409061199d6115138351926020956119988786018661197533836014916bffffffffffffffffffffffff199060601b1681520190565b0396611989601f1998898101835282610b60565b51902092600b5492369161188e565b611b0c565b611a1957835b8581106119b9575050505050610bad9033611a2a565b6001908554611a12610ab083610aaa610aa46119d5838761186b565b8a5142818e019081523360601b6bffffffffffffffffffffffff191660208201526034810192909252610a9b8160548401038c8101835282610b60565b55016119a3565b81516309bde33960e01b8152600490fd5b906000908154908015611afa576001600160a01b038416600090815260056020526040902080546801000000000000000183020190556001906001600160a01b0385164260a01b83831460e11b1717611a8d846000526004602052604060002090565b558201936001600160a01b0316917fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef908290808587858180a4015b858103611aeb5750505015611ada5755565b604051622e076360e81b8152600490fd5b8083918587858180a401611ac8565b60405163b562e8dd60e01b8152600490fd5b919091805180611b1d575b50501490565b91906020908180820191600595861b0101925b81518111851b90815282825191185281604060002091019383851015611b57579390611b30565b50925050503880611b17565b90611b7660209282815194859201610261565b0190565b60405190611b8782610b25565b6005825264507269636b60d81b6020830152565b90611ba582610baf565b611bb26040519182610b60565b8281528092611bc3601f1991610baf565b0190602036910137565b806000917a184f03e93ff9f4daa797ed6e38ed64bf6a1f01000000000000000080821015611d02575b506d04ee2d6d415b85acef810000000080831015611cf3575b50662386f26fc1000080831015611ce4575b506305f5e10080831015611cd5575b5061271080831015611cc6575b506064821015611cb6575b600a80921015611cac575b600190816021611c64828701611b9b565b95860101905b611c76575b5050505090565b600019019083906f181899199a1a9b1b9c1cb0b131b232b360811b8282061a835304918215611ca757919082611c6a565b611c6f565b9160010191611c53565b9190606460029104910191611c48565b60049193920491019138611c3d565b60089193920491019138611c30565b60109193920491019138611c21565b60209193920491019138611c0f565b604093508104915038611bf6565b90606091805180611d1f575050565b90925060036002938185840104851b92604051957f4142434445464748494a4b4c4d4e4f505152535455565758595a616263646566601f52603f9361022f197f6768696a6b6c6d6e6f707172737475767778797a303132333435363738392d5f018552602088018689019560048360208901975b0192835183808260121c16519160009283538181600c1c1651600153818160061c1651895316518653518152019186831015611dd3576004908490611d93565b50509350604060009501604052613d3d60f01b92069004820352528252565b60405190611dff82610b25565b60606020838281520152565b60405190606082018281106001600160401b03821117610b40576040528160608152606060208201526040611e3e611df2565b910152565b60405190611e5082610b25565b600f82526e151a185d08131d58dade4810985b1b608a1b6020830152565b60405190611e7b82610b25565b60018252600760fb1b6020830152565b60405190611e9882610b25565b600b82526a526567756c6172204a6f6560a81b6020830152565b611f2790611ebe611e0b565b5061012b60ff611ed3607f8460011c166127ce565b92161015611f6f57611ee3611e6e565b611f57611eee611e8b565b915b83516040516c1e3a39b830b7103334b6361e9160991b6020820152958692611f4992611f3592611f2191602d870183565b90611b63565b61111f60f11b815260020190565b671e17ba39b830b71f60c11b815260080190565b03601f198101855284610b60565b611f5f610b81565b9283526020830152604082015290565b604051611f7b81610b25565b60018152601960fa1b6020820152611f57611f94611e43565b91611ef0565b60405190611fa782610b25565b60018252602360f81b6020830152565b60405190611fc482610b25565b600982526821b7b6b33c90233ab960b91b6020830152565b60405190611fe982610b25565b6006825265273790233ab960d11b6020830152565b6040519061200b82610b25565b60078252662330433039304160c81b6020830152565b612029611e0b565b506000612034611df2565b505060ff81166020811190816120d8575b50156120b35750611f2761205761169d565b61205f611fdc565b611f5761206a610ba0565b612072611ffe565b815261207c61169d565b60208201529283516040516c1e3a39b830b7103334b6361e9160991b6020820152958692611f4992611f3592611f2191602d870183565b6120c5607f611f279260011c166127ce565b6120cd611f9a565b611f57611f94611fb7565b60df91501038612045565b604051906120f082610b25565b6015825274486f77206465657020697320796f7572206c6f766560581b6020830152565b9061211d611e0b565b50612127826127ce565b9061213061169d565b60005b60ff9081811682871681101561218a57600a8391061615612158575b60010116612133565b91612175612182600192610a8d6040519384926020840190611b63565b603d60f81b815260010190565b92905061214f565b505050611f27929193506121d9906121cb611f35845192611f21604051978895611f2160208801600d906c1e3a39b830b7103334b6361e9160991b81520190565b03601f198101845283610b60565b6121e1610b81565b9182526121ec6120e3565b6020830152604082015290565b6040519061220682610b25565b60018252601f60f91b6020830152565b6040519061222382610b25565b60058252644172726f7760d81b6020830152565b6040519061224482610b25565b6002825261282960f01b6020830152565b6040519061226282610b25565b600882526714dc1b185cda195960c21b6020830152565b6040519061228682610b25565b60018252601160fa1b6020830152565b604051906122a382610b25565b6007825266149bdd5b99195960ca1b6020830152565b611f27906122c5611e0b565b5060ff6122d7607f8360011c166127ce565b911660558110156122f657506122eb612279565b611f57611eee612296565b60aa111561231157612306612237565b611f57611f94612255565b6123196121f9565b611f57611f94612216565b6040519061010082018281106001600160401b03821117610b405760405260cc82526b149dbebe9e17b9ba3cb6329f60a11b60e0837f3c7374796c653e74657874207b616e696d6174696f6e3a206d6f766520302e3260208201527f732063756269632d62657a696572282e34342c2e30352c2e35352c2e3935292060408201527f696e66696e69746520616c7465726e6174653b7472616e73666f726d2d6f726960608201527f67696e3a2063656e7465723b7d406b65796672616d6573206d6f7665207b667260808201527f6f6d207b7472616e73666f726d3a207472616e736c61746558282d323070782960a08201527f3b7d746f207b7472616e73666f726d3a207472616e736c61746558283230707860c08201520152565b6040519061244e82610b25565b600d82526c47657474696e67206c75636b7960981b6020830152565b6040519060c082018281106001600160401b03821117610b4057604052609482527332941b99183232b3949dbebe9e17b9ba3cb6329f60611b60a0837f3c7374796c653e74657874207b616e696d6174696f6e3a2068656c6920312e3560208201527f7320696e66696e6974653b7472616e73666f726d2d6f726967696e3a2035252060408201527f3530253b646973706c61793a20696e6c696e652d626c6f636b3b7d406b65796660608201527f72616d65732068656c69207b3025207b7472616e73666f726d3a20726f74617460808201520152565b6040519061254f82610b25565b600a8252692432b634b1b7b83a32b960b11b6020830152565b6040519061016082018281106001600160401b03821117610b405760405261013f82527f73666f726d3a20726f74617465283235646567293b7d7d3c2f7374796c653e00610140837f3c7374796c653e74657874207b616e696d6174696f6e3a20726f746174652d7560208201527f7020317320737465707328352920696e66696e69746520616c7465726e61746560408201527f2c20726f746174652d646f776e20302e357320656173652d6f757420696e666960608201527f6e69746520616c7465726e6174653b7472616e73666f726d2d6f726967696e3a60808201527f2063656e7465723b7d406b65796672616d657320726f746174652d7570207b6660a08201527f726f6d207b7472616e73666f726d3a20726f74617465283235646567293b7d7460c08201527f6f207b7472616e73666f726d3a20726f74617465282d3435646567293b7d7d4060e08201527f6b65796672616d657320726f746174652d646f776e207b66726f6d207b7472616101008201527f6e73666f726d3a20726f74617465282d3435646567293b7d746f207b7472616e6101208201520152565b6040519061271982610b25565b60058252645368616b6560d81b6020830152565b6040519061273a82610b25565b600d82526c4c6f757379207069637475726560981b6020830152565b6064612760611e0b565b9106603c811015612786575061277461169d565b815261277e61272d565b602082015290565b60508110156127a25750612798612568565b815261277e61270c565b605f11156127bc576127b261246a565b815261277e612542565b6127c4612324565b815261277e612441565b6127d6611df2565b50600e549060ff82169081156128745760ff16069081101561285e57600e60005260011b61277e7fbb7b4a454dc3493923482f07822329ed19e8244eff582cc204f8554c3620c3fe6040519261282b84610b25565b612856817fbb7b4a454dc3493923482f07822329ed19e8244eff582cc204f8554c3620c3fd0161134d565b84520161134d565b634e487b7160e01b600052603260045260246000fd5b634e487b7160e01b600052601260045260246000fdfea26469706673582212202a918a4d924f73d5a5e33040032e89e171e3b8f1617ef11dbadbb75aa116103864736f6c63430008150033405787fa12a823e0f2b7631cc41b3ba8828b3321ca811111fa75cd3aa3bb5acebb7b4a454dc3493923482f07822329ed19e8244eff582cc204f8554c3620c3fd9598005b669be16262e45580fea8d6822a1d04d02d61ea31b2eab35ea6ec60aa0000000000000000000000000000000000000000000000000000000000000060000000000000000000000000000000000000000000000000000000000000000f00000000000000000000000000000000000000000000000000000000000000050000000000000000000000007e7d3b0b3103234c222365e30310b705144272dd000000000000000000000000c218d847a18e521ae08f49f7c43882b6d1963c600000000000000000000000004203be4dbcba5a82bdc42e7c25f8473e125338210000000000000000000000007c2145e13c6917296d2e95bd5b1f5706c1a99f720000000000000000000000002bf0653a9bef4eee408008f32211bb8dc3811f86

0x6080604052600436101561001257600080fd5b60003560e01c806301ffc9a7146101d757806306fdde03146101d2578063081812fc146101cd578063095ea7b3146101c85780630f2cdd6c146101c357806318160ddd146101be578063209bc6a5146101b957806323b872dd146101b457806323b9f3bb146101af57806332cb6b0c146101aa57806334918dfd146101a55780633ccfd60b146101a057806342842e0e1461019b57806349590657146101965780636352211e1461019157806370a082311461018c578063715018a6146101875780637cb64759146101825780638da5cb5b1461017d57806395d89b4114610178578063a22cb46514610173578063a71bbebe1461016e578063b88d4fde14610169578063c87b56dd14610164578063e0d4ea371461015f578063e985e9c51461015a578063eb8d2444146101555763f2fde38b1461015057600080fd5b611284565b611261565b611204565b6111b8565b610c4d565b610bca565b6109af565b610921565b61085e565b610835565b610814565b6107b6565b61075b565b61072c565b61070e565b6106eb565b6106b2565b610681565b610663565b610604565b6105f2565b61055a565b610524565b610500565b610449565b6103c9565b6102bd565b6101f3565b6001600160e01b03198116036101ee57565b600080fd5b346101ee5760203660031901126101ee576020600435610212816101dc565b63ffffffff60e01b166301ffc9a760e01b8114908115610250575b811561023f575b506040519015158152f35b635b5e139f60e01b14905038610234565b6380ac58cd60e01b8114915061022d565b60005b8381106102745750506000910152565b8181015183820152602001610264565b9060209161029d81518092818552858086019101610261565b601f01601f1916010190565b9060206102ba928181520190610284565b90565b346101ee576000806003193601126103c65760405190806002549060019180831c928082169283156103bc575b60209283861085146103a8578588526020880194908115610387575060011461032e575b61032a8761031e81890382610b60565b604051918291826102a9565b0390f35b600260005294509192917f405787fa12a823e0f2b7631cc41b3ba8828b3321ca811111fa75cd3aa3bb5ace5b838610610376575050509101905061031e8261032a388061030e565b80548587015294820194810161035a565b60ff191685525050505090151560051b01905061031e8261032a388061030e565b634e487b7160e01b82526022600452602482fd5b93607f16936102ea565b80fd5b346101ee5760203660031901126101ee576004356103e68161149f565b1561040b576000526006602052602060018060a01b0360406000205416604051908152f35b6040516333d1c03960e21b8152600490fd5b600435906001600160a01b03821682036101ee57565b602435906001600160a01b03821682036101ee57565b60403660031901126101ee5761045d61041d565b6024356001600160a01b038061047283611430565b16908133036104cd575b600083815260066020526040812080546001600160a01b0319166001600160a01b0387161790559316907f8c5be1e5ebec7d5bd14f71427d1e84f3dd0314c0f7b2291e5b200ac8c7c3b9258480a480f35b600082815260076020908152604080832033845290915290205460ff1661047c576040516367d9dca160e11b8152600490fd5b346101ee5760003660031901126101ee57602060ff600d5460081c16604051908152f35b346101ee5760003660031901126101ee5760206000546001549003604051908152f35b6004359063ffffffff821682036101ee57565b60403660031901126101ee576004356001600160401b038082116101ee57366023830112156101ee5781600401359081116101ee573660248260051b840101116101ee576024359063ffffffff821682036101ee5760246105bb93016118e3565b005b60609060031901126101ee576001600160a01b039060043582811681036101ee579160243590811681036101ee579060443590565b6105bb6105fe366105bd565b916114c8565b346101ee5760203660031901126101ee5760043560ff811681036101ee5761062e61032a916127ce565b60405191829160208352602061064f82516040838701526060860190610284565b910151838203601f19016040850152610284565b346101ee5760003660031901126101ee576020600a54604051908152f35b346101ee5760003660031901126101ee5761069a611813565b600d5460ff80821615169060ff191617600d55600080f35b6000806003193601126103c6576106c7611813565b8080808060018060a01b036008541647905af16106e261173a565b50156103c65780f35b6105bb6106f7366105bd565b906040519261070584610b45565b600084526116b0565b346101ee5760003660031901126101ee576020600b54604051908152f35b346101ee5760203660031901126101ee5760206001600160a01b03610752600435611430565b16604051908152f35b346101ee5760203660031901126101ee576001600160a01b0361077c61041d565b1680156107a457600052600560205260206001600160401b0360406000205416604051908152f35b6040516323d3ad8160e21b8152600490fd5b346101ee576000806003193601126103c6576107d0611813565b600880546001600160a01b0319811690915581906001600160a01b03167f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e08280a380f35b346101ee5760203660031901126101ee5761082d611813565b600435600b55005b346101ee5760003660031901126101ee576008546040516001600160a01b039091168152602090f35b346101ee576000806003193601126103c65760405190806003549060019180831c92808216928315610917575b60209283861085146103a857858852602088019490811561038757506001146108be5761032a8761031e81890382610b60565b600360005294509192917fc2575a0e9e593c00f959f8c92f12db2869c3395a3b0502d05e2516446f71f85b5b838610610906575050509101905061031e8261032a388061030e565b8054858701529482019481016108ea565b93607f169361088b565b346101ee5760403660031901126101ee5761093a61041d565b602435908115158092036101ee573360009081526007602090815260408083206001600160a01b0385168452909152902060ff1981541660ff841617905560405191825260018060a01b0316907f17307eab39ab6107e8899845ad3d59bd9653f200f220920489ca2b5937696c3160203392a3005b6020806003193601126101ee5763ffffffff6109c9610547565b168015610afd57600d549160ff831615610aeb576000926109eb83855461186b565b600a5410610ad95733600090815260056020526040908190205460ff91610a1d9186911c6001600160401b031661186b565b9160081c1610610ac757825b828110610a3e5783610a3b8433611a2a565b80f35b6001908454610ac0610ab083610aaa610aa4610a5a838761186b565b604051428b82019081523360601b6bffffffffffffffffffffffff191660208201526034810192909252610a9b81605484015b03601f198101835282610b60565b519020606c1b90565b60d81c90565b9361186b565b6000526009602052604060002090565b5501610a29565b60405163d330f98560e01b8152600490fd5b60405163d05cb60960e01b8152600490fd5b604051631c7324b560e21b8152600490fd5b604051633fa6c4c760e21b8152600490fd5b634e487b7160e01b600052604160045260246000fd5b604081019081106001600160401b03821117610b4057604052565b610b0f565b602081019081106001600160401b03821117610b4057604052565b90601f801991011681019081106001600160401b03821117610b4057604052565b60405190606082018281106001600160401b03821117610b4057604052565b60405190610bad82610b25565b565b6001600160401b038111610b4057601f01601f191660200190565b60803660031901126101ee57610bde61041d565b610be6610433565b606435916001600160401b0383116101ee57366023840112156101ee57826004013591610c1283610baf565b92610c206040519485610b60565b80845236602482870101116101ee5760208160009260246105bb98018388013785010152604435916116b0565b346101ee576020806003193601126101ee57600435610c76816000526009602052604060002090565b5490610c8660ff83851c16611eb2565b91838160181c60ff16610c9890612021565b928260091c607f16610ca990612114565b94610cb660ff85166122b9565b93610cc090612756565b90805196865196815191875199855160409b8c9586519c8d948c8601610d56906057907f3c7376672077696474683d2233353022206865696768743d223335302220766981527f6577426f783d2230203020333530203335302220786d6c6e733d22687474703a60208201527f2f2f7777772e77332e6f72672f323030302f737667223e00000000000000000060408201520190565b7f3c726563742077696474683d223130302522206865696768743d223130302522815270103334b6361e91119821981c982091179f60791b60208201526031017f3c7465787420783d223530252220793d223530252220666f6e742d66616d696c81527f793d22526f626f746f2220666f6e742d7765696768743d223730302220666f6e60208201527f742d73697a653d2233302220746578742d616e63686f723d226d6964646c6522604082015273103632ba3a32b916b9b830b1b4b7339e9118911f60611b6060820152607401610e2e91611b63565b610e3791611b63565b610e4091611b63565b610e4991611b63565b661e17ba32bc3a1f60c91b8152600701610e6291611b63565b651e17b9bb339f60d11b81526006010398601f19998a81018252610e869082610b60565b610e8f90611d10565b90610e98611b7a565b96610ea290611bcd565b988885818082850151015193015193015101519289808080808a8a01510151980151988a01510151980151980151988d519b8c9b8c01610eea90600190607b60f81b81520190565b6f226e616d65223a22505249434b53202360801b8152601001610f0c91611b63565b61088b60f21b81526002016e113232b9b1b934b83a34b7b7111d1160891b8152600f01610f3891611b63565b61088b60f21b8152600201691134b6b0b3b2911d101160b11b8152600a017f646174613a696d6167652f7376672b786d6c3b6261736536342c0000000000008152601a01610f8591611b63565b61088b60f21b81526002017f2261747472696275746573223a205b7b2274726169745f74797065223a20225481526e34b8111610113b30b63ab2911d101160891b6020820152602f01610fd791611b63565b600160fd1b8152600101610fea91611b63565b62089f4b60ea1b81526003017f7b2274726169745f74797065223a2022486f77206465657020697320796f7572815271103637bb32911610113b30b63ab2911d101160711b602082015260320161104091611b63565b62089f4b60ea1b81526003017f7b2274726169745f74797065223a2022467572222c202276616c7565223a2022815260200161107b91611b63565b600160fd1b815260010161108e91611b63565b62089f4b60ea1b81526003017f7b2274726169745f74797065223a202246616d696c79204a65776c73222c20228152683b30b63ab2911d101160b91b60208201526029016110db91611b63565b600160fd1b81526001016110ee91611b63565b62089f4b60ea1b81526003017f7b2274726169745f74797065223a20225374796c65222c202276616c7565223a815261101160f11b602082015260220161113491611b63565b62227d5d60e81b8152600301607d60f81b815260010103828101825261115a9082610b60565b61116390611d10565b82517f646174613a6170706c69636174696f6e2f6a736f6e3b6261736536342c00000094810194855293849190601d0161119c91611b63565b0390810183526111ac9083610b60565b5161032a8192826102a9565b346101ee5760203660031901126101ee576004356111d58161149f565b156111f25760005260096020526020604060002054604051908152f35b604051635747e7fd60e11b8152600490fd5b346101ee5760403660031901126101ee57602060ff61125561122461041d565b61122c610433565b6001600160a01b0391821660009081526007865260408082209290931681526020919091522090565b54166040519015158152f35b346101ee5760003660031901126101ee57602060ff600d54166040519015158152f35b346101ee5760203660031901126101ee5761129d61041d565b6112a5611813565b6001600160a01b039081169081156112f957600854826bffffffffffffffffffffffff60a01b821617600855167f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e0600080a3005b60405162461bcd60e51b815260206004820152602660248201527f4f776e61626c653a206e6577206f776e657220697320746865207a65726f206160448201526564647265737360d01b6064820152608490fd5b9060405190600092805493600185811c92818716918215611426575b6020918286108414611412578798611388878a98999a60209181520190565b949081156113f157506001146113a9575b50505050610bad92500383610b60565b6113bd919450959195600052602060002090565b946000935b8285106113db57505050610bad93500138808080611399565b86548585015295860195889550938101936113c2565b9350505050610bad9491925060ff19168252151560051b0138808080611399565b634e487b7160e01b85526022600452602485fd5b93607f1693611369565b806000908154811061144f575b604051636f96cda160e11b8152600490fd5b81526004906020918083526040928383205494600160e01b8616156114765750505061143d565b93929190935b851561148a57505050505090565b6000190180835281855283832054955061147c565b600054811090816114ae575090565b90506000526004602052600160e01b604060002054161590565b906114d283611430565b6001600160a01b038381169282821684900361168c576000868152600660205260409020805490926115176001600160a01b03881633908114908414171590565b1590565b611631575b821695861561161f576115819361154d92611615575b506001600160a01b0316600090815260056020526040902090565b80546000190190556001600160a01b03166000818152600560205260409020805460010190554260a01b17600160e11b1790565b611595856000526004602052604060002090565b55600160e11b8116156115cb575b507fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef600080a4565b600184016115e3816000526004602052604060002090565b54156115f0575b506115a3565b60005481146115ea5761160d906000526004602052604060002090565b5538806115ea565b6000905538611532565b604051633a954ecd60e21b8152600490fd5b61167561151361166e336116578b60018060a01b03166000526007602052604060002090565b9060018060a01b0316600052602052604060002090565b5460ff1690565b1561151c57604051632ce44b5f60e11b8152600490fd5b60405162a1148160e81b8152600490fd5b604051906116aa82610b45565b60008252565b9291906116be8282866114c8565b803b6116cb575b50505050565b6116d49361176a565b156116e257388080806116c5565b6040516368d2bf6b60e11b8152600490fd5b908160209103126101ee57516102ba816101dc565b6001600160a01b0391821681529116602082015260408101919091526080606082018190526102ba92910190610284565b3d15611765573d9061174b82610baf565b916117596040519384610b60565b82523d6000602084013e565b606090565b92602091611793936000604051809681958294630a85bd0160e11b9a8b85523360048601611709565b03926001600160a01b03165af1600091816117e3575b506117d5576117b661173a565b805190816117d0576040516368d2bf6b60e11b8152600490fd5b602001fd5b6001600160e01b0319161490565b61180591925060203d811161180c575b6117fd8183610b60565b8101906116f4565b90386117a9565b503d6117f3565b6008546001600160a01b0316330361182757565b606460405162461bcd60e51b815260206004820152602060248201527f4f776e61626c653a2063616c6c6572206973206e6f7420746865206f776e65726044820152fd5b9190820180921161187857565b634e487b7160e01b600052601160045260246000fd5b9092916001600160401b038411610b40578360051b602092836040516118b682850182610b60565b80978152019181019283116101ee57905b8282106118d45750505050565b813581529083019083016118c7565b909163ffffffff16918215610afd5760009161190084845461186b565b600a5410610ad957336000908152600560205260409081902054611930918691901c6001600160401b031661186b565b600d5460081c60ff1610610ac75760409061199d6115138351926020956119988786018661197533836014916bffffffffffffffffffffffff199060601b1681520190565b0396611989601f1998898101835282610b60565b51902092600b5492369161188e565b611b0c565b611a1957835b8581106119b9575050505050610bad9033611a2a565b6001908554611a12610ab083610aaa610aa46119d5838761186b565b8a5142818e019081523360601b6bffffffffffffffffffffffff191660208201526034810192909252610a9b8160548401038c8101835282610b60565b55016119a3565b81516309bde33960e01b8152600490fd5b906000908154908015611afa576001600160a01b038416600090815260056020526040902080546801000000000000000183020190556001906001600160a01b0385164260a01b83831460e11b1717611a8d846000526004602052604060002090565b558201936001600160a01b0316917fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef908290808587858180a4015b858103611aeb5750505015611ada5755565b604051622e076360e81b8152600490fd5b8083918587858180a401611ac8565b60405163b562e8dd60e01b8152600490fd5b919091805180611b1d575b50501490565b91906020908180820191600595861b0101925b81518111851b90815282825191185281604060002091019383851015611b57579390611b30565b50925050503880611b17565b90611b7660209282815194859201610261565b0190565b60405190611b8782610b25565b6005825264507269636b60d81b6020830152565b90611ba582610baf565b611bb26040519182610b60565b8281528092611bc3601f1991610baf565b0190602036910137565b806000917a184f03e93ff9f4daa797ed6e38ed64bf6a1f01000000000000000080821015611d02575b506d04ee2d6d415b85acef810000000080831015611cf3575b50662386f26fc1000080831015611ce4575b506305f5e10080831015611cd5575b5061271080831015611cc6575b506064821015611cb6575b600a80921015611cac575b600190816021611c64828701611b9b565b95860101905b611c76575b5050505090565b600019019083906f181899199a1a9b1b9c1cb0b131b232b360811b8282061a835304918215611ca757919082611c6a565b611c6f565b9160010191611c53565b9190606460029104910191611c48565b60049193920491019138611c3d565b60089193920491019138611c30565b60109193920491019138611c21565b60209193920491019138611c0f565b604093508104915038611bf6565b90606091805180611d1f575050565b90925060036002938185840104851b92604051957f4142434445464748494a4b4c4d4e4f505152535455565758595a616263646566601f52603f9361022f197f6768696a6b6c6d6e6f707172737475767778797a303132333435363738392d5f018552602088018689019560048360208901975b0192835183808260121c16519160009283538181600c1c1651600153818160061c1651895316518653518152019186831015611dd3576004908490611d93565b50509350604060009501604052613d3d60f01b92069004820352528252565b60405190611dff82610b25565b60606020838281520152565b60405190606082018281106001600160401b03821117610b40576040528160608152606060208201526040611e3e611df2565b910152565b60405190611e5082610b25565b600f82526e151a185d08131d58dade4810985b1b608a1b6020830152565b60405190611e7b82610b25565b60018252600760fb1b6020830152565b60405190611e9882610b25565b600b82526a526567756c6172204a6f6560a81b6020830152565b611f2790611ebe611e0b565b5061012b60ff611ed3607f8460011c166127ce565b92161015611f6f57611ee3611e6e565b611f57611eee611e8b565b915b83516040516c1e3a39b830b7103334b6361e9160991b6020820152958692611f4992611f3592611f2191602d870183565b90611b63565b61111f60f11b815260020190565b671e17ba39b830b71f60c11b815260080190565b03601f198101855284610b60565b611f5f610b81565b9283526020830152604082015290565b604051611f7b81610b25565b60018152601960fa1b6020820152611f57611f94611e43565b91611ef0565b60405190611fa782610b25565b60018252602360f81b6020830152565b60405190611fc482610b25565b600982526821b7b6b33c90233ab960b91b6020830152565b60405190611fe982610b25565b6006825265273790233ab960d11b6020830152565b6040519061200b82610b25565b60078252662330433039304160c81b6020830152565b612029611e0b565b506000612034611df2565b505060ff81166020811190816120d8575b50156120b35750611f2761205761169d565b61205f611fdc565b611f5761206a610ba0565b612072611ffe565b815261207c61169d565b60208201529283516040516c1e3a39b830b7103334b6361e9160991b6020820152958692611f4992611f3592611f2191602d870183565b6120c5607f611f279260011c166127ce565b6120cd611f9a565b611f57611f94611fb7565b60df91501038612045565b604051906120f082610b25565b6015825274486f77206465657020697320796f7572206c6f766560581b6020830152565b9061211d611e0b565b50612127826127ce565b9061213061169d565b60005b60ff9081811682871681101561218a57600a8391061615612158575b60010116612133565b91612175612182600192610a8d6040519384926020840190611b63565b603d60f81b815260010190565b92905061214f565b505050611f27929193506121d9906121cb611f35845192611f21604051978895611f2160208801600d906c1e3a39b830b7103334b6361e9160991b81520190565b03601f198101845283610b60565b6121e1610b81565b9182526121ec6120e3565b6020830152604082015290565b6040519061220682610b25565b60018252601f60f91b6020830152565b6040519061222382610b25565b60058252644172726f7760d81b6020830152565b6040519061224482610b25565b6002825261282960f01b6020830152565b6040519061226282610b25565b600882526714dc1b185cda195960c21b6020830152565b6040519061228682610b25565b60018252601160fa1b6020830152565b604051906122a382610b25565b6007825266149bdd5b99195960ca1b6020830152565b611f27906122c5611e0b565b5060ff6122d7607f8360011c166127ce565b911660558110156122f657506122eb612279565b611f57611eee612296565b60aa111561231157612306612237565b611f57611f94612255565b6123196121f9565b611f57611f94612216565b6040519061010082018281106001600160401b03821117610b405760405260cc82526b149dbebe9e17b9ba3cb6329f60a11b60e0837f3c7374796c653e74657874207b616e696d6174696f6e3a206d6f766520302e3260208201527f732063756269632d62657a696572282e34342c2e30352c2e35352c2e3935292060408201527f696e66696e69746520616c7465726e6174653b7472616e73666f726d2d6f726960608201527f67696e3a2063656e7465723b7d406b65796672616d6573206d6f7665207b667260808201527f6f6d207b7472616e73666f726d3a207472616e736c61746558282d323070782960a08201527f3b7d746f207b7472616e73666f726d3a207472616e736c61746558283230707860c08201520152565b6040519061244e82610b25565b600d82526c47657474696e67206c75636b7960981b6020830152565b6040519060c082018281106001600160401b03821117610b4057604052609482527332941b99183232b3949dbebe9e17b9ba3cb6329f60611b60a0837f3c7374796c653e74657874207b616e696d6174696f6e3a2068656c6920312e3560208201527f7320696e66696e6974653b7472616e73666f726d2d6f726967696e3a2035252060408201527f3530253b646973706c61793a20696e6c696e652d626c6f636b3b7d406b65796660608201527f72616d65732068656c69207b3025207b7472616e73666f726d3a20726f74617460808201520152565b6040519061254f82610b25565b600a8252692432b634b1b7b83a32b960b11b6020830152565b6040519061016082018281106001600160401b03821117610b405760405261013f82527f73666f726d3a20726f74617465283235646567293b7d7d3c2f7374796c653e00610140837f3c7374796c653e74657874207b616e696d6174696f6e3a20726f746174652d7560208201527f7020317320737465707328352920696e66696e69746520616c7465726e61746560408201527f2c20726f746174652d646f776e20302e357320656173652d6f757420696e666960608201527f6e69746520616c7465726e6174653b7472616e73666f726d2d6f726967696e3a60808201527f2063656e7465723b7d406b65796672616d657320726f746174652d7570207b6660a08201527f726f6d207b7472616e73666f726d3a20726f74617465283235646567293b7d7460c08201527f6f207b7472616e73666f726d3a20726f74617465282d3435646567293b7d7d4060e08201527f6b65796672616d657320726f746174652d646f776e207b66726f6d207b7472616101008201527f6e73666f726d3a20726f74617465282d3435646567293b7d746f207b7472616e6101208201520152565b6040519061271982610b25565b60058252645368616b6560d81b6020830152565b6040519061273a82610b25565b600d82526c4c6f757379207069637475726560981b6020830152565b6064612760611e0b565b9106603c811015612786575061277461169d565b815261277e61272d565b602082015290565b60508110156127a25750612798612568565b815261277e61270c565b605f11156127bc576127b261246a565b815261277e612542565b6127c4612324565b815261277e612441565b6127d6611df2565b50600e549060ff82169081156128745760ff16069081101561285e57600e60005260011b61277e7fbb7b4a454dc3493923482f07822329ed19e8244eff582cc204f8554c3620c3fe6040519261282b84610b25565b612856817fbb7b4a454dc3493923482f07822329ed19e8244eff582cc204f8554c3620c3fd0161134d565b84520161134d565b634e487b7160e01b600052603260045260246000fd5b634e487b7160e01b600052601260045260246000fdfea26469706673582212202a918a4d924f73d5a5e33040032e89e171e3b8f1617ef11dbadbb75aa116103864736f6c63430008150033

9598005b669be16262e45580fea8d6822a1d04d02d61ea31b2eab35ea6ec60aa0000000000000000000000000000000000000000000000000000000000000060000000000000000000000000000000000000000000000000000000000000000f00000000000000000000000000000000000000000000000000000000000000050000000000000000000000007e7d3b0b3103234c222365e30310b705144272dd000000000000000000000000c218d847a18e521ae08f49f7c43882b6d1963c600000000000000000000000004203be4dbcba5a82bdc42e7c25f8473e125338210000000000000000000000007c2145e13c6917296d2e95bd5b1f5706c1a99f720000000000000000000000002bf0653a9bef4eee408008f32211bb8dc3811f86

-----Decoded View---------------
Arg [0] : _root (bytes32): 0x9598005b669be16262e45580fea8d6822a1d04d02d61ea31b2eab35ea6ec60aa
Arg [1] : wallets (address[]): 0x7E7D3B0b3103234c222365e30310b705144272DD,0xC218D847a18E521Ae08F49F7c43882b6d1963c60,0x4203bE4DBCBa5a82Bdc42E7c25F8473e12533821,0x7C2145E13C6917296d2e95BD5B1f5706c1A99F72,0x2bf0653a9beF4EEE408008f32211BB8dC3811F86
Arg [2] : quantity (uint32): 15

-----Encoded View---------------
9 Constructor Arguments found :
Arg [0] : 9598005b669be16262e45580fea8d6822a1d04d02d61ea31b2eab35ea6ec60aa
Arg [1] : 0000000000000000000000000000000000000000000000000000000000000060
Arg [2] : 000000000000000000000000000000000000000000000000000000000000000f
Arg [3] : 0000000000000000000000000000000000000000000000000000000000000005
Arg [4] : 0000000000000000000000007e7d3b0b3103234c222365e30310b705144272dd
Arg [5] : 000000000000000000000000c218d847a18e521ae08f49f7c43882b6d1963c60
Arg [6] : 0000000000000000000000004203be4dbcba5a82bdc42e7c25f8473e12533821
Arg [7] : 0000000000000000000000007c2145e13c6917296d2e95bd5b1f5706c1a99f72
Arg [8] : 0000000000000000000000002bf0653a9bef4eee408008f32211bb8dc3811f86