ETH Price: $3,089.77 (+0.92%)
Gas: 5 Gwei

Token

Yashima Verse Genesis (YSM)
 

Overview

Max Total Supply

444 YSM

Holders

274

Market

Volume (24H)

N/A

Min Price (24H)

N/A

Max Price (24H)

N/A
Filtered by Token Holder
2nice.eth
Balance
3 YSM
0xc673a6f48d65050e25633bed838bf8587bff09c7
Loading...
Loading
Loading...
Loading
Loading...
Loading

Click here to update the token information / general information
# Exchange Pair Price  24H Volume % Volume

Contract Source Code Verified (Exact Match)

Contract Name:
YashimaVerse

Compiler Version
v0.8.24+commit.e11b9ed9

Optimization Enabled:
Yes with 200 runs

Other Settings:
default evmVersion, MIT license

Contract Source Code (Solidity)

/**
 *Submitted for verification at Etherscan.io on 2024-02-26
*/

//SPDX-License-Identifier: MIT
// File: @openzeppelin/contracts/utils/cryptography/MerkleProof.sol


// OpenZeppelin Contracts (last updated v5.0.0) (utils/cryptography/MerkleProof.sol)

pragma solidity ^0.8.20;

/**
 * @dev These functions deal with verification of Merkle Tree proofs.
 *
 * The tree and the proofs can be generated using our
 * https://github.com/OpenZeppelin/merkle-tree[JavaScript library].
 * You will find a quickstart guide in the readme.
 *
 * WARNING: You should avoid using leaf values that are 64 bytes long prior to
 * hashing, or use a hash function other than keccak256 for hashing leaves.
 * This is because the concatenation of a sorted pair of internal nodes in
 * the Merkle tree could be reinterpreted as a leaf value.
 * OpenZeppelin's JavaScript library generates Merkle trees that are safe
 * against this attack out of the box.
 */
library MerkleProof {
    /**
     *@dev The multiproof provided is not valid.
     */
    error MerkleProofInvalidMultiproof();

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

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

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

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

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

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

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

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

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

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

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

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

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

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

    /**
     * @dev Sorts the pair (a, b) and hashes the result.
     */
    function _hashPair(bytes32 a, bytes32 b) private pure returns (bytes32) {
        return a < b ? _efficientHash(a, b) : _efficientHash(b, a);
    }

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

// File: @openzeppelin/contracts/utils/math/SignedMath.sol


// OpenZeppelin Contracts (last updated v5.0.0) (utils/math/SignedMath.sol)

pragma solidity ^0.8.20;

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

// File: @openzeppelin/contracts/utils/math/Math.sol


// OpenZeppelin Contracts (last updated v5.0.0) (utils/math/Math.sol)

pragma solidity ^0.8.20;

/**
 * @dev Standard math utilities missing in the Solidity language.
 */
library Math {
    /**
     * @dev Muldiv operation overflow.
     */
    error MathOverflowedMulDiv();

    enum Rounding {
        Floor, // Toward negative infinity
        Ceil, // Toward positive infinity
        Trunc, // Toward zero
        Expand // Away from zero
    }

    /**
     * @dev Returns the addition of two unsigned integers, with an overflow flag.
     */
    function tryAdd(uint256 a, uint256 b) internal pure returns (bool, uint256) {
        unchecked {
            uint256 c = a + b;
            if (c < a) return (false, 0);
            return (true, c);
        }
    }

    /**
     * @dev Returns the subtraction of two unsigned integers, with an overflow flag.
     */
    function trySub(uint256 a, uint256 b) internal pure returns (bool, uint256) {
        unchecked {
            if (b > a) return (false, 0);
            return (true, a - b);
        }
    }

    /**
     * @dev Returns the multiplication of two unsigned integers, with an overflow flag.
     */
    function tryMul(uint256 a, uint256 b) internal pure returns (bool, uint256) {
        unchecked {
            // Gas optimization: this is cheaper than requiring 'a' not being zero, but the
            // benefit is lost if 'b' is also tested.
            // See: https://github.com/OpenZeppelin/openzeppelin-contracts/pull/522
            if (a == 0) return (true, 0);
            uint256 c = a * b;
            if (c / a != b) return (false, 0);
            return (true, c);
        }
    }

    /**
     * @dev Returns the division of two unsigned integers, with a division by zero flag.
     */
    function tryDiv(uint256 a, uint256 b) internal pure returns (bool, uint256) {
        unchecked {
            if (b == 0) return (false, 0);
            return (true, a / b);
        }
    }

    /**
     * @dev Returns the remainder of dividing two unsigned integers, with a division by zero flag.
     */
    function tryMod(uint256 a, uint256 b) internal pure returns (bool, uint256) {
        unchecked {
            if (b == 0) return (false, 0);
            return (true, a % b);
        }
    }

    /**
     * @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 towards infinity instead
     * of rounding towards zero.
     */
    function ceilDiv(uint256 a, uint256 b) internal pure returns (uint256) {
        if (b == 0) {
            // Guarantee the same behavior as in a regular Solidity division.
            return a / b;
        }

        // (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 = x * y; // Least significant 256 bits of the product
            uint256 prod1; // Most significant 256 bits of the product
            assembly {
                let mm := mulmod(x, y, not(0))
                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.
            if (denominator <= prod1) {
                revert MathOverflowedMulDiv();
            }

            ///////////////////////////////////////////////
            // 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.

            uint256 twos = denominator & (0 - denominator);
            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 (unsignedRoundsUp(rounding) && 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
     * towards zero.
     *
     * 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 + (unsignedRoundsUp(rounding) && result * result < a ? 1 : 0);
        }
    }

    /**
     * @dev Return the log in base 2 of a positive value rounded towards zero.
     * 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 + (unsignedRoundsUp(rounding) && 1 << result < value ? 1 : 0);
        }
    }

    /**
     * @dev Return the log in base 10 of a positive value rounded towards zero.
     * 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 + (unsignedRoundsUp(rounding) && 10 ** result < value ? 1 : 0);
        }
    }

    /**
     * @dev Return the log in base 256 of a positive value rounded towards zero.
     * 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 + (unsignedRoundsUp(rounding) && 1 << (result << 3) < value ? 1 : 0);
        }
    }

    /**
     * @dev Returns whether a provided rounding mode is considered rounding up for unsigned integers.
     */
    function unsignedRoundsUp(Rounding rounding) internal pure returns (bool) {
        return uint8(rounding) % 2 == 1;
    }
}

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


// OpenZeppelin Contracts (last updated v5.0.0) (utils/Strings.sol)

pragma solidity ^0.8.20;



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

    /**
     * @dev The `value` string doesn't fit in the specified `length`.
     */
    error StringsInsufficientHexLength(uint256 value, uint256 length);

    /**
     * @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), HEX_DIGITS))
                }
                value /= 10;
                if (value == 0) break;
            }
            return buffer;
        }
    }

    /**
     * @dev Converts a `int256` to its ASCII `string` decimal representation.
     */
    function toStringSigned(int256 value) internal pure returns (string memory) {
        return string.concat(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) {
        uint256 localValue = value;
        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] = HEX_DIGITS[localValue & 0xf];
            localValue >>= 4;
        }
        if (localValue != 0) {
            revert StringsInsufficientHexLength(value, length);
        }
        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 bytes(a).length == bytes(b).length && keccak256(bytes(a)) == keccak256(bytes(b));
    }
}

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


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

pragma solidity ^0.8.20;

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

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

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

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


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

pragma solidity ^0.8.20;


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

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

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

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

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

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

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

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

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

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

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

// File: ERC721A/IERC721A.sol


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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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


// ERC721A Contracts v4.2.3
// Creator: Chiru Labs

pragma solidity ^0.8.4;


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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

    // Token name
    string private _name;

    // Token symbol
    string private _symbol;

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

        return _tokenApprovals[tokenId].value;
    }

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

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

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

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

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

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

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

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

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

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

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

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

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

        _beforeTokenTransfers(from, to, tokenId, 1);

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

            ++_spotMinted;
        }

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

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

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

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

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

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

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

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

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

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

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

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

        address from = address(uint160(prevOwnershipPacked));

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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


// Compatible with OpenZeppelin Contracts ^5.0.0
pragma solidity ^0.8.20;





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

    bool public paused = true;
    bool public revealed = false;

    string public baseURI;
    string public hiddenMetadataURI = "ipfs://bafkreialab4kvh2gx3pj6yni42sfxud6jyzaz5dx3z4u47ym5doevgaga4";

    bool public whitelistStatus = true;
    bytes32 public root;
    mapping(address => uint256) public whitelistClaimed;
    mapping(address => uint256) public publicClaimed;

    uint256 public publicPrice = 0;
    uint256 public presalePrice = 0;

    uint256 public maxMintPerTx = 1;
    uint256 public maxSupply = 555;

    constructor()
        ERC721A("Yashima Verse Genesis", "YSM")
        Ownable(msg.sender)
    {}

    // ============ PUBLIC FUNCTIONS FOR MINTING ============
    function mint(uint256 quantity,  bytes32[] calldata proofs) external payable {
        require(!paused, "The contract is paused!");
        require(quantity > 0 && totalSupply() + quantity <= maxSupply, "Invalid amount!");
        if(whitelistStatus) {
            require(isValid(proofs), "You're address is not whitelisted!");
            require(whitelistClaimed[msg.sender] + quantity <= maxMintPerTx, "You can't mint this amount");
            require(msg.value >= presalePrice, "Incorrect Funds!");
            whitelistClaimed[msg.sender] += quantity;
        }
        else {
            require(publicClaimed[msg.sender] + quantity <= maxMintPerTx, "You can't mint this amount");
            require(msg.value >= publicPrice * quantity, "Insufficient Funds!");
            publicClaimed[msg.sender] += quantity;
        }
        _safeMint(msg.sender, quantity);
    }

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

    // ============ PUBLIC READ-ONLY FUNCTIONS ============
    function isValid(bytes32[] calldata _merkleProof) internal view returns (bool){
        bytes32 leaf = keccak256(abi.encodePacked(msg.sender));
        require(MerkleProof.verify(_merkleProof, root, leaf), "Address is not whitelisted!");
        return true;
    }

    function setRoot(bytes32 _newRoot) external onlyOwner {
        root = _newRoot;
    }

    function setWhitelistStatus(bool _newState) external onlyOwner {
        whitelistStatus = _newState;
    }

    function setMaxSuppy(uint256 _amount) external onlyOwner {
        maxSupply = _amount;
    }

    function setMaxMintPerTx(uint256 _newState) external onlyOwner {
        maxMintPerTx = _newState;
    }

    function setPresalePrice(uint256 _newState) external onlyOwner {
        presalePrice = _newState;
    }
    function setCost(uint256 _newPublicCost) external onlyOwner {
        publicPrice = _newPublicCost;
    }

    function setPaused(bool _state) external onlyOwner {
        paused = _state;
    }

    function setBaseURI(string memory _newBaseURI) external onlyOwner {
        baseURI = _newBaseURI;
    }

    function setHiddenMetadataURI(string memory _URI) external onlyOwner {
        hiddenMetadataURI = _URI;
    }

    function setRevealed(bool _state) external onlyOwner {
        revealed = _state;
    }
    
    function airDrop(uint256 quantity, address _address) external onlyOwner {
        _safeMint(_address, quantity);
    }

    function airDropBatch(address[] memory _addresses, uint256[] memory _quantities) external onlyOwner {
        for (uint256 i = 0; i < _addresses.length; i++) {
            _safeMint(_addresses[i], _quantities[i]);
        }
    }

    function tokenURI(uint256 tokenId)
        public
        view
        virtual
        override
        returns (string memory)
    {
        require(
            _exists(tokenId),
            "ERC721Metadata: URI query for nonexistent token"
        );
        if (revealed == false) {
            return hiddenMetadataURI;
        }
        string memory currentBaseURI = _baseURI();
        return
            bytes(currentBaseURI).length > 0
                ? string(
                    abi.encodePacked(
                        currentBaseURI,
                        tokenId.toString(),
                        ".json"
                    )
                )
                : "";
    }

    function withdraw() public onlyOwner {
        // Do not remove this otherwise you will not be able to withdraw the funds.
        // =============================================================================
        (bool ts, ) = payable(owner()).call{value: address(this).balance}("");
        require(ts);
        // =============================================================================
    }
}

Contract Security Audit

Contract ABI

[{"inputs":[],"stateMutability":"nonpayable","type":"constructor"},{"inputs":[],"name":"ApprovalCallerNotOwnerNorApproved","type":"error"},{"inputs":[],"name":"ApprovalQueryForNonexistentToken","type":"error"},{"inputs":[],"name":"BalanceQueryForZeroAddress","type":"error"},{"inputs":[],"name":"MintERC2309QuantityExceedsLimit","type":"error"},{"inputs":[],"name":"MintToZeroAddress","type":"error"},{"inputs":[],"name":"MintZeroQuantity","type":"error"},{"inputs":[],"name":"NotCompatibleWithSpotMints","type":"error"},{"inputs":[{"internalType":"address","name":"owner","type":"address"}],"name":"OwnableInvalidOwner","type":"error"},{"inputs":[{"internalType":"address","name":"account","type":"address"}],"name":"OwnableUnauthorizedAccount","type":"error"},{"inputs":[],"name":"OwnerQueryForNonexistentToken","type":"error"},{"inputs":[],"name":"OwnershipNotInitializedForExtraData","type":"error"},{"inputs":[],"name":"SequentialMintExceedsLimit","type":"error"},{"inputs":[],"name":"SequentialUpToTooSmall","type":"error"},{"inputs":[],"name":"SpotMintTokenIdTooSmall","type":"error"},{"inputs":[],"name":"TokenAlreadyExists","type":"error"},{"inputs":[],"name":"TransferCallerNotOwnerNorApproved","type":"error"},{"inputs":[],"name":"TransferFromIncorrectOwner","type":"error"},{"inputs":[],"name":"TransferToNonERC721ReceiverImplementer","type":"error"},{"inputs":[],"name":"TransferToZeroAddress","type":"error"},{"inputs":[],"name":"URIQueryForNonexistentToken","type":"error"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"owner","type":"address"},{"indexed":true,"internalType":"address","name":"approved","type":"address"},{"indexed":true,"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"Approval","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"owner","type":"address"},{"indexed":true,"internalType":"address","name":"operator","type":"address"},{"indexed":false,"internalType":"bool","name":"approved","type":"bool"}],"name":"ApprovalForAll","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"uint256","name":"fromTokenId","type":"uint256"},{"indexed":false,"internalType":"uint256","name":"toTokenId","type":"uint256"},{"indexed":true,"internalType":"address","name":"from","type":"address"},{"indexed":true,"internalType":"address","name":"to","type":"address"}],"name":"ConsecutiveTransfer","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"previousOwner","type":"address"},{"indexed":true,"internalType":"address","name":"newOwner","type":"address"}],"name":"OwnershipTransferred","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"from","type":"address"},{"indexed":true,"internalType":"address","name":"to","type":"address"},{"indexed":true,"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"Transfer","type":"event"},{"inputs":[{"internalType":"uint256","name":"quantity","type":"uint256"},{"internalType":"address","name":"_address","type":"address"}],"name":"airDrop","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address[]","name":"_addresses","type":"address[]"},{"internalType":"uint256[]","name":"_quantities","type":"uint256[]"}],"name":"airDropBatch","outputs":[],"stateMutability":"nonpayable","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":"baseURI","outputs":[{"internalType":"string","name":"","type":"string"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"getApproved","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"hiddenMetadataURI","outputs":[{"internalType":"string","name":"","type":"string"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"owner","type":"address"},{"internalType":"address","name":"operator","type":"address"}],"name":"isApprovedForAll","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"maxMintPerTx","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"maxSupply","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"quantity","type":"uint256"},{"internalType":"bytes32[]","name":"proofs","type":"bytes32[]"}],"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":"paused","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"presalePrice","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"","type":"address"}],"name":"publicClaimed","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"publicPrice","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"renounceOwnership","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"revealed","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"root","outputs":[{"internalType":"bytes32","name":"","type":"bytes32"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"from","type":"address"},{"internalType":"address","name":"to","type":"address"},{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"safeTransferFrom","outputs":[],"stateMutability":"payable","type":"function"},{"inputs":[{"internalType":"address","name":"from","type":"address"},{"internalType":"address","name":"to","type":"address"},{"internalType":"uint256","name":"tokenId","type":"uint256"},{"internalType":"bytes","name":"_data","type":"bytes"}],"name":"safeTransferFrom","outputs":[],"stateMutability":"payable","type":"function"},{"inputs":[{"internalType":"address","name":"operator","type":"address"},{"internalType":"bool","name":"approved","type":"bool"}],"name":"setApprovalForAll","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"string","name":"_newBaseURI","type":"string"}],"name":"setBaseURI","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"_newPublicCost","type":"uint256"}],"name":"setCost","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"string","name":"_URI","type":"string"}],"name":"setHiddenMetadataURI","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"_newState","type":"uint256"}],"name":"setMaxMintPerTx","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"_amount","type":"uint256"}],"name":"setMaxSuppy","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"bool","name":"_state","type":"bool"}],"name":"setPaused","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"_newState","type":"uint256"}],"name":"setPresalePrice","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"bool","name":"_state","type":"bool"}],"name":"setRevealed","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"bytes32","name":"_newRoot","type":"bytes32"}],"name":"setRoot","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"bool","name":"_newState","type":"bool"}],"name":"setWhitelistStatus","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":"result","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"from","type":"address"},{"internalType":"address","name":"to","type":"address"},{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"transferFrom","outputs":[],"stateMutability":"payable","type":"function"},{"inputs":[{"internalType":"address","name":"newOwner","type":"address"}],"name":"transferOwnership","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"","type":"address"}],"name":"whitelistClaimed","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"whitelistStatus","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"withdraw","outputs":[],"stateMutability":"nonpayable","type":"function"}]

6009805461ffff60a01b1916600160a01b17905561010060405260426080818152906200233160a039600b9062000037908262000210565b50600c805460ff191660019081179091555f601081905560115560125561022b60135534801562000066575f80fd5b50336040518060400160405280601581526020017f59617368696d612056657273652047656e6573697300000000000000000000008152506040518060400160405280600381526020016259534d60e81b8152508160029081620000cb919062000210565b506003620000da828262000210565b5060015f5550506001600160a01b0381166200010f57604051631e4fbdf760e01b81525f600482015260240160405180910390fd5b6200011a8162000121565b50620002dc565b600980546001600160a01b038381166001600160a01b0319831681179093556040519116919082907f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e0905f90a35050565b634e487b7160e01b5f52604160045260245ffd5b600181811c908216806200019b57607f821691505b602082108103620001ba57634e487b7160e01b5f52602260045260245ffd5b50919050565b601f8211156200020b57805f5260205f20601f840160051c81016020851015620001e75750805b601f840160051c820191505b8181101562000208575f8155600101620001f3565b50505b505050565b81516001600160401b038111156200022c576200022c62000172565b62000244816200023d845462000186565b84620001c0565b602080601f8311600181146200027a575f8415620002625750858301515b5f19600386901b1c1916600185901b178555620002d4565b5f85815260208120601f198616915b82811015620002aa5788860151825594840194600190910190840162000289565b5085821015620002c857878501515f19600388901b60f8161c191681555b505060018460011b0185555b505050505050565b61204780620002ea5f395ff3fe608060405260043610610253575f3560e01c8063715018a61161013f578063ba41b0c6116100b3578063db4bec4411610078578063db4bec4414610682578063de7fcb1d146106ad578063e0a80853146106c2578063e985e9c5146106e1578063ebf0c71714610700578063f2fde38b14610715575f80fd5b8063ba41b0c614610608578063ba9e12f71461061b578063c87b56dd1461062f578063d5abeb011461064e578063dab5f34014610663575f80fd5b80639ec571d5116101045780639ec571d514610558578063a22cb46514610577578063a945bf8014610596578063aed38015146105ab578063b5b1cd7c146105ca578063b88d4fde146105f5575f80fd5b8063715018a6146104db5780638da5cb5b146104ef5780638fede9991461050c57806395d89b411461052b5780639ddf7ad31461053f575f80fd5b806342842e0e116101d657806355f804b31161019b57806355f804b31461042b5780635c975abb1461044a578063616cdb1e1461046a5780636352211e146104895780636c0360eb146104a857806370a08231146104bc575f80fd5b806342842e0e1461039b57806344a0d68a146103ae5780634a999118146103cd578063512507c6146103ec578063518302271461040b575f80fd5b806316c38b3c1161021c57806316c38b3c1461031b57806318160ddd1461033a57806323b872dd146103555780633549345e146103685780633ccfd60b14610387575f80fd5b80620e7fa81461025757806301ffc9a71461027f57806306fdde03146102ae578063081812fc146102cf578063095ea7b314610306575b5f80fd5b348015610262575f80fd5b5061026c60115481565b6040519081526020015b60405180910390f35b34801561028a575f80fd5b5061029e6102993660046118ff565b610734565b6040519015158152602001610276565b3480156102b9575f80fd5b506102c2610785565b6040516102769190611967565b3480156102da575f80fd5b506102ee6102e9366004611979565b610815565b6040516001600160a01b039091168152602001610276565b6103196103143660046119a6565b61084e565b005b348015610326575f80fd5b506103196103353660046119dd565b61085e565b348015610345575f80fd5b5061026c6001545f54035f190190565b6103196103633660046119f6565b610884565b348015610373575f80fd5b50610319610382366004611979565b6109de565b348015610392575f80fd5b506103196109eb565b6103196103a93660046119f6565b610a62565b3480156103b9575f80fd5b506103196103c8366004611979565b610a81565b3480156103d8575f80fd5b506103196103e73660046119dd565b610a8e565b3480156103f7575f80fd5b50610319610406366004611ac9565b610aa9565b348015610416575f80fd5b5060095461029e90600160a81b900460ff1681565b348015610436575f80fd5b50610319610445366004611ac9565b610abd565b348015610455575f80fd5b5060095461029e90600160a01b900460ff1681565b348015610475575f80fd5b50610319610484366004611979565b610ad1565b348015610494575f80fd5b506102ee6104a3366004611979565b610ade565b3480156104b3575f80fd5b506102c2610ae8565b3480156104c7575f80fd5b5061026c6104d6366004611b0e565b610b74565b3480156104e6575f80fd5b50610319610bb8565b3480156104fa575f80fd5b506009546001600160a01b03166102ee565b348015610517575f80fd5b50610319610526366004611bb6565b610bcb565b348015610536575f80fd5b506102c2610c22565b34801561054a575f80fd5b50600c5461029e9060ff1681565b348015610563575f80fd5b50610319610572366004611979565b610c31565b348015610582575f80fd5b50610319610591366004611c70565b610c3e565b3480156105a1575f80fd5b5061026c60105481565b3480156105b6575f80fd5b506103196105c5366004611ca1565b610ca9565b3480156105d5575f80fd5b5061026c6105e4366004611b0e565b600f6020525f908152604090205481565b610319610603366004611cc2565b610cbb565b610319610616366004611d39565b610cfc565b348015610626575f80fd5b506102c2610ff4565b34801561063a575f80fd5b506102c2610649366004611979565b611001565b348015610659575f80fd5b5061026c60135481565b34801561066e575f80fd5b5061031961067d366004611979565b61116e565b34801561068d575f80fd5b5061026c61069c366004611b0e565b600e6020525f908152604090205481565b3480156106b8575f80fd5b5061026c60125481565b3480156106cd575f80fd5b506103196106dc3660046119dd565b61117b565b3480156106ec575f80fd5b5061029e6106fb366004611db1565b6111a1565b34801561070b575f80fd5b5061026c600d5481565b348015610720575f80fd5b5061031961072f366004611b0e565b6111ce565b5f6301ffc9a760e01b6001600160e01b03198316148061076457506380ac58cd60e01b6001600160e01b03198316145b8061077f5750635b5e139f60e01b6001600160e01b03198316145b92915050565b60606002805461079490611dd9565b80601f01602080910402602001604051908101604052809291908181526020018280546107c090611dd9565b801561080b5780601f106107e25761010080835404028352916020019161080b565b820191905f5260205f20905b8154815290600101906020018083116107ee57829003601f168201915b5050505050905090565b5f61081f82611208565b610833576108336333d1c03960e21b611252565b505f908152600660205260409020546001600160a01b031690565b61085a8282600161125a565b5050565b6108666112fb565b60098054911515600160a01b0260ff60a01b19909216919091179055565b5f61088e82611328565b6001600160a01b0394851694909150811684146108b4576108b462a1148160e81b611252565b5f8281526006602052604090208054338082146001600160a01b038816909114176108f7576108e386336111a1565b6108f7576108f7632ce44b5f60e11b611252565b8015610901575f82555b6001600160a01b038681165f9081526005602052604080822080545f19019055918716808252919020805460010190554260a01b17600160e11b175f85815260046020526040812091909155600160e11b8416900361098d57600184015f81815260046020526040812054900361098b575f54811461098b575f8181526004602052604090208490555b505b6001600160a01b0385168481887fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef5f80a4805f036109d5576109d5633a954ecd60e21b611252565b50505050505050565b6109e66112fb565b601155565b6109f36112fb565b5f610a066009546001600160a01b031690565b6001600160a01b0316476040515f6040518083038185875af1925050503d805f8114610a4d576040519150601f19603f3d011682016040523d82523d5f602084013e610a52565b606091505b5050905080610a5f575f80fd5b50565b610a7c83838360405180602001604052805f815250610cbb565b505050565b610a896112fb565b601055565b610a966112fb565b600c805460ff1916911515919091179055565b610ab16112fb565b600b61085a8282611e55565b610ac56112fb565b600a61085a8282611e55565b610ad96112fb565b601255565b5f61077f82611328565b600a8054610af590611dd9565b80601f0160208091040260200160405190810160405280929190818152602001828054610b2190611dd9565b8015610b6c5780601f10610b4357610100808354040283529160200191610b6c565b820191905f5260205f20905b815481529060010190602001808311610b4f57829003601f168201915b505050505081565b5f6001600160a01b038216610b9357610b936323d3ad8160e21b611252565b506001600160a01b03165f9081526005602052604090205467ffffffffffffffff1690565b610bc06112fb565b610bc95f6113c1565b565b610bd36112fb565b5f5b8251811015610a7c57610c1a838281518110610bf357610bf3611f15565b6020026020010151838381518110610c0d57610c0d611f15565b6020026020010151611412565b600101610bd5565b60606003805461079490611dd9565b610c396112fb565b601355565b335f8181526007602090815260408083206001600160a01b03871680855290835292819020805460ff191686151590811790915590519081529192917f17307eab39ab6107e8899845ad3d59bd9653f200f220920489ca2b5937696c31910160405180910390a35050565b610cb16112fb565b61085a8183611412565b610cc6848484610884565b6001600160a01b0383163b15610cf657610ce28484848461142b565b610cf657610cf66368d2bf6b60e11b611252565b50505050565b600954600160a01b900460ff1615610d5b5760405162461bcd60e51b815260206004820152601760248201527f54686520636f6e7472616374206973207061757365642100000000000000000060448201526064015b60405180910390fd5b5f83118015610d85575060135483610d786001545f54035f190190565b610d829190611f3d565b11155b610dc35760405162461bcd60e51b815260206004820152600f60248201526e496e76616c696420616d6f756e742160881b6044820152606401610d52565b600c5460ff1615610f0857610dd8828261150a565b610e2f5760405162461bcd60e51b815260206004820152602260248201527f596f752772652061646472657373206973206e6f742077686974656c69737465604482015261642160f01b6064820152608401610d52565b601254335f908152600e6020526040902054610e4c908590611f3d565b1115610e9a5760405162461bcd60e51b815260206004820152601a60248201527f596f752063616e2774206d696e74207468697320616d6f756e740000000000006044820152606401610d52565b601154341015610edf5760405162461bcd60e51b815260206004820152601060248201526f496e636f72726563742046756e64732160801b6044820152606401610d52565b335f908152600e602052604081208054859290610efd908490611f3d565b90915550610fea9050565b601254335f908152600f6020526040902054610f25908590611f3d565b1115610f735760405162461bcd60e51b815260206004820152601a60248201527f596f752063616e2774206d696e74207468697320616d6f756e740000000000006044820152606401610d52565b82601054610f819190611f50565b341015610fc65760405162461bcd60e51b8152602060048201526013602482015272496e73756666696369656e742046756e64732160681b6044820152606401610d52565b335f908152600f602052604081208054859290610fe4908490611f3d565b90915550505b610a7c3384611412565b600b8054610af590611dd9565b606061100c82611208565b6110705760405162461bcd60e51b815260206004820152602f60248201527f4552433732314d657461646174613a2055524920717565727920666f72206e6f60448201526e3732bc34b9ba32b73a103a37b5b2b760891b6064820152608401610d52565b600954600160a81b900460ff1615155f0361111557600b805461109290611dd9565b80601f01602080910402602001604051908101604052809291908181526020018280546110be90611dd9565b80156111095780601f106110e057610100808354040283529160200191611109565b820191905f5260205f20905b8154815290600101906020018083116110ec57829003601f168201915b50505050509050919050565b5f61111e6115da565b90505f81511161113c5760405180602001604052805f815250611167565b80611146846115e9565b604051602001611157929190611f67565b6040516020818303038152906040525b9392505050565b6111766112fb565b600d55565b6111836112fb565b60098054911515600160a81b0260ff60a81b19909216919091179055565b6001600160a01b039182165f90815260076020908152604080832093909416825291909152205460ff1690565b6111d66112fb565b6001600160a01b0381166111ff57604051631e4fbdf760e01b81525f6004820152602401610d52565b610a5f816113c1565b5f8160011161124d575f5482101561124d575f5b505f82815260046020526040812054908190036112435761123c83611fa5565b925061121c565b600160e01b161590505b919050565b805f5260045ffd5b5f61126483610ade565b905081801561127c5750336001600160a01b03821614155b1561129f5761128b81336111a1565b61129f5761129f6367d9dca160e11b611252565b5f8381526006602052604080822080546001600160a01b0319166001600160a01b0388811691821790925591518693918516917f8c5be1e5ebec7d5bd14f71427d1e84f3dd0314c0f7b2291e5b200ac8c7c3b92591a450505050565b6009546001600160a01b03163314610bc95760405163118cdaa760e01b8152336004820152602401610d52565b5f816001116113b157505f81815260046020526040902054805f0361139f575f54821061135f5761135f636f96cda160e11b611252565b5b505f19015f81815260046020526040902054801561136057600160e01b81165f0361138a57919050565b61139a636f96cda160e11b611252565b611360565b600160e01b81165f036113b157919050565b61124d636f96cda160e11b611252565b600980546001600160a01b038381166001600160a01b0319831681179093556040519116919082907f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e0905f90a35050565b61085a828260405180602001604052805f815250611679565b604051630a85bd0160e11b81525f906001600160a01b0385169063150b7a029061145f903390899088908890600401611fba565b6020604051808303815f875af1925050508015611499575060408051601f3d908101601f1916820190925261149691810190611ff6565b60015b6114ec573d8080156114c6576040519150601f19603f3d011682016040523d82523d5f602084013e6114cb565b606091505b5080515f036114e4576114e46368d2bf6b60e11b611252565b805181602001fd5b6001600160e01b031916630a85bd0160e11b1490505b949350505050565b6040516bffffffffffffffffffffffff193360601b1660208201525f9081906034016040516020818303038152906040528051906020012090506115848484808060200260200160405190810160405280939291908181526020018383602002808284375f9201919091525050600d5491508490506116d9565b6115d05760405162461bcd60e51b815260206004820152601b60248201527f41646472657373206973206e6f742077686974656c69737465642100000000006044820152606401610d52565b5060019392505050565b6060600a805461079490611dd9565b60605f6115f5836116ee565b60010190505f8167ffffffffffffffff81111561161457611614611a2f565b6040519080825280601f01601f19166020018201604052801561163e576020820181803683370190505b5090508181016020015b5f19016f181899199a1a9b1b9c1cb0b131b232b360811b600a86061a8153600a850494508461164857509392505050565b61168383836117c5565b6001600160a01b0383163b15610a7c575f548281035b6116ab5f86838060010194508661142b565b6116bf576116bf6368d2bf6b60e11b611252565b81811061169957815f54146116d2575f80fd5b5050505050565b5f826116e5858461187f565b14949350505050565b5f8072184f03e93ff9f4daa797ed6e38ed64bf6a1f0160401b831061172c5772184f03e93ff9f4daa797ed6e38ed64bf6a1f0160401b830492506040015b6d04ee2d6d415b85acef81000000008310611758576d04ee2d6d415b85acef8100000000830492506020015b662386f26fc10000831061177657662386f26fc10000830492506010015b6305f5e100831061178e576305f5e100830492506008015b61271083106117a257612710830492506004015b606483106117b4576064830492506002015b600a831061077f5760010192915050565b5f8054908290036117e0576117e063b562e8dd60e01b611252565b5f8181526004602090815260408083206001600160a01b0387164260a01b6001881460e11b1781179091558084526005909252822080546801000000000000000186020190559081900361183d5761183d622e076360e81b611252565b818301825b80835f7fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef5f80a481816001019150810361184257505f5550505050565b5f81815b84518110156118b9576118af828683815181106118a2576118a2611f15565b60200260200101516118c1565b9150600101611883565b509392505050565b5f8183106118db575f828152602084905260409020611167565b505f9182526020526040902090565b6001600160e01b031981168114610a5f575f80fd5b5f6020828403121561190f575f80fd5b8135611167816118ea565b5f5b8381101561193457818101518382015260200161191c565b50505f910152565b5f815180845261195381602086016020860161191a565b601f01601f19169290920160200192915050565b602081525f611167602083018461193c565b5f60208284031215611989575f80fd5b5035919050565b80356001600160a01b038116811461124d575f80fd5b5f80604083850312156119b7575f80fd5b6119c083611990565b946020939093013593505050565b8035801515811461124d575f80fd5b5f602082840312156119ed575f80fd5b611167826119ce565b5f805f60608486031215611a08575f80fd5b611a1184611990565b9250611a1f60208501611990565b9150604084013590509250925092565b634e487b7160e01b5f52604160045260245ffd5b604051601f8201601f1916810167ffffffffffffffff81118282101715611a6c57611a6c611a2f565b604052919050565b5f67ffffffffffffffff831115611a8d57611a8d611a2f565b611aa0601f8401601f1916602001611a43565b9050828152838383011115611ab3575f80fd5b828260208301375f602084830101529392505050565b5f60208284031215611ad9575f80fd5b813567ffffffffffffffff811115611aef575f80fd5b8201601f81018413611aff575f80fd5b61150284823560208401611a74565b5f60208284031215611b1e575f80fd5b61116782611990565b5f67ffffffffffffffff821115611b4057611b40611a2f565b5060051b60200190565b5f82601f830112611b59575f80fd5b81356020611b6e611b6983611b27565b611a43565b8083825260208201915060208460051b870101935086841115611b8f575f80fd5b602086015b84811015611bab5780358352918301918301611b94565b509695505050505050565b5f8060408385031215611bc7575f80fd5b823567ffffffffffffffff80821115611bde575f80fd5b818501915085601f830112611bf1575f80fd5b81356020611c01611b6983611b27565b82815260059290921b84018101918181019089841115611c1f575f80fd5b948201945b83861015611c4457611c3586611990565b82529482019490820190611c24565b96505086013592505080821115611c59575f80fd5b50611c6685828601611b4a565b9150509250929050565b5f8060408385031215611c81575f80fd5b611c8a83611990565b9150611c98602084016119ce565b90509250929050565b5f8060408385031215611cb2575f80fd5b82359150611c9860208401611990565b5f805f8060808587031215611cd5575f80fd5b611cde85611990565b9350611cec60208601611990565b925060408501359150606085013567ffffffffffffffff811115611d0e575f80fd5b8501601f81018713611d1e575f80fd5b611d2d87823560208401611a74565b91505092959194509250565b5f805f60408486031215611d4b575f80fd5b83359250602084013567ffffffffffffffff80821115611d69575f80fd5b818601915086601f830112611d7c575f80fd5b813581811115611d8a575f80fd5b8760208260051b8501011115611d9e575f80fd5b6020830194508093505050509250925092565b5f8060408385031215611dc2575f80fd5b611dcb83611990565b9150611c9860208401611990565b600181811c90821680611ded57607f821691505b602082108103611e0b57634e487b7160e01b5f52602260045260245ffd5b50919050565b601f821115610a7c57805f5260205f20601f840160051c81016020851015611e365750805b601f840160051c820191505b818110156116d2575f8155600101611e42565b815167ffffffffffffffff811115611e6f57611e6f611a2f565b611e8381611e7d8454611dd9565b84611e11565b602080601f831160018114611eb6575f8415611e9f5750858301515b5f19600386901b1c1916600185901b178555611f0d565b5f85815260208120601f198616915b82811015611ee457888601518255948401946001909101908401611ec5565b5085821015611f0157878501515f19600388901b60f8161c191681555b505060018460011b0185555b505050505050565b634e487b7160e01b5f52603260045260245ffd5b634e487b7160e01b5f52601160045260245ffd5b8082018082111561077f5761077f611f29565b808202811582820484141761077f5761077f611f29565b5f8351611f7881846020880161191a565b835190830190611f8c81836020880161191a565b64173539b7b760d91b9101908152600501949350505050565b5f81611fb357611fb3611f29565b505f190190565b6001600160a01b03858116825284166020820152604081018390526080606082018190525f90611fec9083018461193c565b9695505050505050565b5f60208284031215612006575f80fd5b8151611167816118ea56fea26469706673582212205f6533e3265534872521fd4a9828d153056dd705172eca03f53ab87c2301d5da64736f6c63430008180033697066733a2f2f6261666b726569616c6162346b766832677833706a36796e6934327366787564366a797a617a356478337a34753437796d35646f65766761676134

Deployed Bytecode

0x608060405260043610610253575f3560e01c8063715018a61161013f578063ba41b0c6116100b3578063db4bec4411610078578063db4bec4414610682578063de7fcb1d146106ad578063e0a80853146106c2578063e985e9c5146106e1578063ebf0c71714610700578063f2fde38b14610715575f80fd5b8063ba41b0c614610608578063ba9e12f71461061b578063c87b56dd1461062f578063d5abeb011461064e578063dab5f34014610663575f80fd5b80639ec571d5116101045780639ec571d514610558578063a22cb46514610577578063a945bf8014610596578063aed38015146105ab578063b5b1cd7c146105ca578063b88d4fde146105f5575f80fd5b8063715018a6146104db5780638da5cb5b146104ef5780638fede9991461050c57806395d89b411461052b5780639ddf7ad31461053f575f80fd5b806342842e0e116101d657806355f804b31161019b57806355f804b31461042b5780635c975abb1461044a578063616cdb1e1461046a5780636352211e146104895780636c0360eb146104a857806370a08231146104bc575f80fd5b806342842e0e1461039b57806344a0d68a146103ae5780634a999118146103cd578063512507c6146103ec578063518302271461040b575f80fd5b806316c38b3c1161021c57806316c38b3c1461031b57806318160ddd1461033a57806323b872dd146103555780633549345e146103685780633ccfd60b14610387575f80fd5b80620e7fa81461025757806301ffc9a71461027f57806306fdde03146102ae578063081812fc146102cf578063095ea7b314610306575b5f80fd5b348015610262575f80fd5b5061026c60115481565b6040519081526020015b60405180910390f35b34801561028a575f80fd5b5061029e6102993660046118ff565b610734565b6040519015158152602001610276565b3480156102b9575f80fd5b506102c2610785565b6040516102769190611967565b3480156102da575f80fd5b506102ee6102e9366004611979565b610815565b6040516001600160a01b039091168152602001610276565b6103196103143660046119a6565b61084e565b005b348015610326575f80fd5b506103196103353660046119dd565b61085e565b348015610345575f80fd5b5061026c6001545f54035f190190565b6103196103633660046119f6565b610884565b348015610373575f80fd5b50610319610382366004611979565b6109de565b348015610392575f80fd5b506103196109eb565b6103196103a93660046119f6565b610a62565b3480156103b9575f80fd5b506103196103c8366004611979565b610a81565b3480156103d8575f80fd5b506103196103e73660046119dd565b610a8e565b3480156103f7575f80fd5b50610319610406366004611ac9565b610aa9565b348015610416575f80fd5b5060095461029e90600160a81b900460ff1681565b348015610436575f80fd5b50610319610445366004611ac9565b610abd565b348015610455575f80fd5b5060095461029e90600160a01b900460ff1681565b348015610475575f80fd5b50610319610484366004611979565b610ad1565b348015610494575f80fd5b506102ee6104a3366004611979565b610ade565b3480156104b3575f80fd5b506102c2610ae8565b3480156104c7575f80fd5b5061026c6104d6366004611b0e565b610b74565b3480156104e6575f80fd5b50610319610bb8565b3480156104fa575f80fd5b506009546001600160a01b03166102ee565b348015610517575f80fd5b50610319610526366004611bb6565b610bcb565b348015610536575f80fd5b506102c2610c22565b34801561054a575f80fd5b50600c5461029e9060ff1681565b348015610563575f80fd5b50610319610572366004611979565b610c31565b348015610582575f80fd5b50610319610591366004611c70565b610c3e565b3480156105a1575f80fd5b5061026c60105481565b3480156105b6575f80fd5b506103196105c5366004611ca1565b610ca9565b3480156105d5575f80fd5b5061026c6105e4366004611b0e565b600f6020525f908152604090205481565b610319610603366004611cc2565b610cbb565b610319610616366004611d39565b610cfc565b348015610626575f80fd5b506102c2610ff4565b34801561063a575f80fd5b506102c2610649366004611979565b611001565b348015610659575f80fd5b5061026c60135481565b34801561066e575f80fd5b5061031961067d366004611979565b61116e565b34801561068d575f80fd5b5061026c61069c366004611b0e565b600e6020525f908152604090205481565b3480156106b8575f80fd5b5061026c60125481565b3480156106cd575f80fd5b506103196106dc3660046119dd565b61117b565b3480156106ec575f80fd5b5061029e6106fb366004611db1565b6111a1565b34801561070b575f80fd5b5061026c600d5481565b348015610720575f80fd5b5061031961072f366004611b0e565b6111ce565b5f6301ffc9a760e01b6001600160e01b03198316148061076457506380ac58cd60e01b6001600160e01b03198316145b8061077f5750635b5e139f60e01b6001600160e01b03198316145b92915050565b60606002805461079490611dd9565b80601f01602080910402602001604051908101604052809291908181526020018280546107c090611dd9565b801561080b5780601f106107e25761010080835404028352916020019161080b565b820191905f5260205f20905b8154815290600101906020018083116107ee57829003601f168201915b5050505050905090565b5f61081f82611208565b610833576108336333d1c03960e21b611252565b505f908152600660205260409020546001600160a01b031690565b61085a8282600161125a565b5050565b6108666112fb565b60098054911515600160a01b0260ff60a01b19909216919091179055565b5f61088e82611328565b6001600160a01b0394851694909150811684146108b4576108b462a1148160e81b611252565b5f8281526006602052604090208054338082146001600160a01b038816909114176108f7576108e386336111a1565b6108f7576108f7632ce44b5f60e11b611252565b8015610901575f82555b6001600160a01b038681165f9081526005602052604080822080545f19019055918716808252919020805460010190554260a01b17600160e11b175f85815260046020526040812091909155600160e11b8416900361098d57600184015f81815260046020526040812054900361098b575f54811461098b575f8181526004602052604090208490555b505b6001600160a01b0385168481887fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef5f80a4805f036109d5576109d5633a954ecd60e21b611252565b50505050505050565b6109e66112fb565b601155565b6109f36112fb565b5f610a066009546001600160a01b031690565b6001600160a01b0316476040515f6040518083038185875af1925050503d805f8114610a4d576040519150601f19603f3d011682016040523d82523d5f602084013e610a52565b606091505b5050905080610a5f575f80fd5b50565b610a7c83838360405180602001604052805f815250610cbb565b505050565b610a896112fb565b601055565b610a966112fb565b600c805460ff1916911515919091179055565b610ab16112fb565b600b61085a8282611e55565b610ac56112fb565b600a61085a8282611e55565b610ad96112fb565b601255565b5f61077f82611328565b600a8054610af590611dd9565b80601f0160208091040260200160405190810160405280929190818152602001828054610b2190611dd9565b8015610b6c5780601f10610b4357610100808354040283529160200191610b6c565b820191905f5260205f20905b815481529060010190602001808311610b4f57829003601f168201915b505050505081565b5f6001600160a01b038216610b9357610b936323d3ad8160e21b611252565b506001600160a01b03165f9081526005602052604090205467ffffffffffffffff1690565b610bc06112fb565b610bc95f6113c1565b565b610bd36112fb565b5f5b8251811015610a7c57610c1a838281518110610bf357610bf3611f15565b6020026020010151838381518110610c0d57610c0d611f15565b6020026020010151611412565b600101610bd5565b60606003805461079490611dd9565b610c396112fb565b601355565b335f8181526007602090815260408083206001600160a01b03871680855290835292819020805460ff191686151590811790915590519081529192917f17307eab39ab6107e8899845ad3d59bd9653f200f220920489ca2b5937696c31910160405180910390a35050565b610cb16112fb565b61085a8183611412565b610cc6848484610884565b6001600160a01b0383163b15610cf657610ce28484848461142b565b610cf657610cf66368d2bf6b60e11b611252565b50505050565b600954600160a01b900460ff1615610d5b5760405162461bcd60e51b815260206004820152601760248201527f54686520636f6e7472616374206973207061757365642100000000000000000060448201526064015b60405180910390fd5b5f83118015610d85575060135483610d786001545f54035f190190565b610d829190611f3d565b11155b610dc35760405162461bcd60e51b815260206004820152600f60248201526e496e76616c696420616d6f756e742160881b6044820152606401610d52565b600c5460ff1615610f0857610dd8828261150a565b610e2f5760405162461bcd60e51b815260206004820152602260248201527f596f752772652061646472657373206973206e6f742077686974656c69737465604482015261642160f01b6064820152608401610d52565b601254335f908152600e6020526040902054610e4c908590611f3d565b1115610e9a5760405162461bcd60e51b815260206004820152601a60248201527f596f752063616e2774206d696e74207468697320616d6f756e740000000000006044820152606401610d52565b601154341015610edf5760405162461bcd60e51b815260206004820152601060248201526f496e636f72726563742046756e64732160801b6044820152606401610d52565b335f908152600e602052604081208054859290610efd908490611f3d565b90915550610fea9050565b601254335f908152600f6020526040902054610f25908590611f3d565b1115610f735760405162461bcd60e51b815260206004820152601a60248201527f596f752063616e2774206d696e74207468697320616d6f756e740000000000006044820152606401610d52565b82601054610f819190611f50565b341015610fc65760405162461bcd60e51b8152602060048201526013602482015272496e73756666696369656e742046756e64732160681b6044820152606401610d52565b335f908152600f602052604081208054859290610fe4908490611f3d565b90915550505b610a7c3384611412565b600b8054610af590611dd9565b606061100c82611208565b6110705760405162461bcd60e51b815260206004820152602f60248201527f4552433732314d657461646174613a2055524920717565727920666f72206e6f60448201526e3732bc34b9ba32b73a103a37b5b2b760891b6064820152608401610d52565b600954600160a81b900460ff1615155f0361111557600b805461109290611dd9565b80601f01602080910402602001604051908101604052809291908181526020018280546110be90611dd9565b80156111095780601f106110e057610100808354040283529160200191611109565b820191905f5260205f20905b8154815290600101906020018083116110ec57829003601f168201915b50505050509050919050565b5f61111e6115da565b90505f81511161113c5760405180602001604052805f815250611167565b80611146846115e9565b604051602001611157929190611f67565b6040516020818303038152906040525b9392505050565b6111766112fb565b600d55565b6111836112fb565b60098054911515600160a81b0260ff60a81b19909216919091179055565b6001600160a01b039182165f90815260076020908152604080832093909416825291909152205460ff1690565b6111d66112fb565b6001600160a01b0381166111ff57604051631e4fbdf760e01b81525f6004820152602401610d52565b610a5f816113c1565b5f8160011161124d575f5482101561124d575f5b505f82815260046020526040812054908190036112435761123c83611fa5565b925061121c565b600160e01b161590505b919050565b805f5260045ffd5b5f61126483610ade565b905081801561127c5750336001600160a01b03821614155b1561129f5761128b81336111a1565b61129f5761129f6367d9dca160e11b611252565b5f8381526006602052604080822080546001600160a01b0319166001600160a01b0388811691821790925591518693918516917f8c5be1e5ebec7d5bd14f71427d1e84f3dd0314c0f7b2291e5b200ac8c7c3b92591a450505050565b6009546001600160a01b03163314610bc95760405163118cdaa760e01b8152336004820152602401610d52565b5f816001116113b157505f81815260046020526040902054805f0361139f575f54821061135f5761135f636f96cda160e11b611252565b5b505f19015f81815260046020526040902054801561136057600160e01b81165f0361138a57919050565b61139a636f96cda160e11b611252565b611360565b600160e01b81165f036113b157919050565b61124d636f96cda160e11b611252565b600980546001600160a01b038381166001600160a01b0319831681179093556040519116919082907f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e0905f90a35050565b61085a828260405180602001604052805f815250611679565b604051630a85bd0160e11b81525f906001600160a01b0385169063150b7a029061145f903390899088908890600401611fba565b6020604051808303815f875af1925050508015611499575060408051601f3d908101601f1916820190925261149691810190611ff6565b60015b6114ec573d8080156114c6576040519150601f19603f3d011682016040523d82523d5f602084013e6114cb565b606091505b5080515f036114e4576114e46368d2bf6b60e11b611252565b805181602001fd5b6001600160e01b031916630a85bd0160e11b1490505b949350505050565b6040516bffffffffffffffffffffffff193360601b1660208201525f9081906034016040516020818303038152906040528051906020012090506115848484808060200260200160405190810160405280939291908181526020018383602002808284375f9201919091525050600d5491508490506116d9565b6115d05760405162461bcd60e51b815260206004820152601b60248201527f41646472657373206973206e6f742077686974656c69737465642100000000006044820152606401610d52565b5060019392505050565b6060600a805461079490611dd9565b60605f6115f5836116ee565b60010190505f8167ffffffffffffffff81111561161457611614611a2f565b6040519080825280601f01601f19166020018201604052801561163e576020820181803683370190505b5090508181016020015b5f19016f181899199a1a9b1b9c1cb0b131b232b360811b600a86061a8153600a850494508461164857509392505050565b61168383836117c5565b6001600160a01b0383163b15610a7c575f548281035b6116ab5f86838060010194508661142b565b6116bf576116bf6368d2bf6b60e11b611252565b81811061169957815f54146116d2575f80fd5b5050505050565b5f826116e5858461187f565b14949350505050565b5f8072184f03e93ff9f4daa797ed6e38ed64bf6a1f0160401b831061172c5772184f03e93ff9f4daa797ed6e38ed64bf6a1f0160401b830492506040015b6d04ee2d6d415b85acef81000000008310611758576d04ee2d6d415b85acef8100000000830492506020015b662386f26fc10000831061177657662386f26fc10000830492506010015b6305f5e100831061178e576305f5e100830492506008015b61271083106117a257612710830492506004015b606483106117b4576064830492506002015b600a831061077f5760010192915050565b5f8054908290036117e0576117e063b562e8dd60e01b611252565b5f8181526004602090815260408083206001600160a01b0387164260a01b6001881460e11b1781179091558084526005909252822080546801000000000000000186020190559081900361183d5761183d622e076360e81b611252565b818301825b80835f7fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef5f80a481816001019150810361184257505f5550505050565b5f81815b84518110156118b9576118af828683815181106118a2576118a2611f15565b60200260200101516118c1565b9150600101611883565b509392505050565b5f8183106118db575f828152602084905260409020611167565b505f9182526020526040902090565b6001600160e01b031981168114610a5f575f80fd5b5f6020828403121561190f575f80fd5b8135611167816118ea565b5f5b8381101561193457818101518382015260200161191c565b50505f910152565b5f815180845261195381602086016020860161191a565b601f01601f19169290920160200192915050565b602081525f611167602083018461193c565b5f60208284031215611989575f80fd5b5035919050565b80356001600160a01b038116811461124d575f80fd5b5f80604083850312156119b7575f80fd5b6119c083611990565b946020939093013593505050565b8035801515811461124d575f80fd5b5f602082840312156119ed575f80fd5b611167826119ce565b5f805f60608486031215611a08575f80fd5b611a1184611990565b9250611a1f60208501611990565b9150604084013590509250925092565b634e487b7160e01b5f52604160045260245ffd5b604051601f8201601f1916810167ffffffffffffffff81118282101715611a6c57611a6c611a2f565b604052919050565b5f67ffffffffffffffff831115611a8d57611a8d611a2f565b611aa0601f8401601f1916602001611a43565b9050828152838383011115611ab3575f80fd5b828260208301375f602084830101529392505050565b5f60208284031215611ad9575f80fd5b813567ffffffffffffffff811115611aef575f80fd5b8201601f81018413611aff575f80fd5b61150284823560208401611a74565b5f60208284031215611b1e575f80fd5b61116782611990565b5f67ffffffffffffffff821115611b4057611b40611a2f565b5060051b60200190565b5f82601f830112611b59575f80fd5b81356020611b6e611b6983611b27565b611a43565b8083825260208201915060208460051b870101935086841115611b8f575f80fd5b602086015b84811015611bab5780358352918301918301611b94565b509695505050505050565b5f8060408385031215611bc7575f80fd5b823567ffffffffffffffff80821115611bde575f80fd5b818501915085601f830112611bf1575f80fd5b81356020611c01611b6983611b27565b82815260059290921b84018101918181019089841115611c1f575f80fd5b948201945b83861015611c4457611c3586611990565b82529482019490820190611c24565b96505086013592505080821115611c59575f80fd5b50611c6685828601611b4a565b9150509250929050565b5f8060408385031215611c81575f80fd5b611c8a83611990565b9150611c98602084016119ce565b90509250929050565b5f8060408385031215611cb2575f80fd5b82359150611c9860208401611990565b5f805f8060808587031215611cd5575f80fd5b611cde85611990565b9350611cec60208601611990565b925060408501359150606085013567ffffffffffffffff811115611d0e575f80fd5b8501601f81018713611d1e575f80fd5b611d2d87823560208401611a74565b91505092959194509250565b5f805f60408486031215611d4b575f80fd5b83359250602084013567ffffffffffffffff80821115611d69575f80fd5b818601915086601f830112611d7c575f80fd5b813581811115611d8a575f80fd5b8760208260051b8501011115611d9e575f80fd5b6020830194508093505050509250925092565b5f8060408385031215611dc2575f80fd5b611dcb83611990565b9150611c9860208401611990565b600181811c90821680611ded57607f821691505b602082108103611e0b57634e487b7160e01b5f52602260045260245ffd5b50919050565b601f821115610a7c57805f5260205f20601f840160051c81016020851015611e365750805b601f840160051c820191505b818110156116d2575f8155600101611e42565b815167ffffffffffffffff811115611e6f57611e6f611a2f565b611e8381611e7d8454611dd9565b84611e11565b602080601f831160018114611eb6575f8415611e9f5750858301515b5f19600386901b1c1916600185901b178555611f0d565b5f85815260208120601f198616915b82811015611ee457888601518255948401946001909101908401611ec5565b5085821015611f0157878501515f19600388901b60f8161c191681555b505060018460011b0185555b505050505050565b634e487b7160e01b5f52603260045260245ffd5b634e487b7160e01b5f52601160045260245ffd5b8082018082111561077f5761077f611f29565b808202811582820484141761077f5761077f611f29565b5f8351611f7881846020880161191a565b835190830190611f8c81836020880161191a565b64173539b7b760d91b9101908152600501949350505050565b5f81611fb357611fb3611f29565b505f190190565b6001600160a01b03858116825284166020820152604081018390526080606082018190525f90611fec9083018461193c565b9695505050505050565b5f60208284031215612006575f80fd5b8151611167816118ea56fea26469706673582212205f6533e3265534872521fd4a9828d153056dd705172eca03f53ab87c2301d5da64736f6c63430008180033

Deployed Bytecode Sourcemap

95177:4745:0:-:0;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;95687:31;;;;;;;;;;;;;;;;;;;160:25:1;;;148:2;133:18;95687:31:0;;;;;;;;54859:639;;;;;;;;;;-1:-1:-1;54859:639:0;;;;;:::i;:::-;;:::i;:::-;;;747:14:1;;740:22;722:41;;710:2;695:18;54859:639:0;582:187:1;55761:100:0;;;;;;;;;;;;;:::i;:::-;;;;;;;:::i;63001:227::-;;;;;;;;;;-1:-1:-1;63001:227:0;;;;;:::i;:::-;;:::i;:::-;;;-1:-1:-1;;;;;1879:32:1;;;1861:51;;1849:2;1834:18;63001:227:0;1715:203:1;62718:124:0;;;;;;:::i;:::-;;:::i;:::-;;97984:85;;;;;;;;;;-1:-1:-1;97984:85:0;;;;;:::i;:::-;;:::i;50963:573::-;;;;;;;;;;;;50094:1;51407:12;51024:14;51391:13;:28;-1:-1:-1;;51391:46:0;;50963:573;67273:3523;;;;;;:::i;:::-;;:::i;97757:106::-;;;;;;;;;;-1:-1:-1;97757:106:0;;;;;:::i;:::-;;:::i;99507:412::-;;;;;;;;;;;;;:::i;70892:193::-;;;;;;:::i;:::-;;:::i;97869:107::-;;;;;;;;;;-1:-1:-1;97869:107:0;;;;;:::i;:::-;;:::i;97423:109::-;;;;;;;;;;-1:-1:-1;97423:109:0;;;;;:::i;:::-;;:::i;98191:112::-;;;;;;;;;;-1:-1:-1;98191:112:0;;;;;:::i;:::-;;:::i;95292:28::-;;;;;;;;;;-1:-1:-1;95292:28:0;;;;-1:-1:-1;;;95292:28:0;;;;;;98077:106;;;;;;;;;;-1:-1:-1;98077:106:0;;;;;:::i;:::-;;:::i;95260:25::-;;;;;;;;;;-1:-1:-1;95260:25:0;;;;-1:-1:-1;;;95260:25:0;;;;;;97643:106;;;;;;;;;;-1:-1:-1;97643:106:0;;;;;:::i;:::-;;:::i;57163:152::-;;;;;;;;;;-1:-1:-1;57163:152:0;;;;;:::i;:::-;;:::i;95329:21::-;;;;;;;;;;;;;:::i;52687:242::-;;;;;;;;;;-1:-1:-1;52687:242:0;;;;;:::i;:::-;;:::i;33457:103::-;;;;;;;;;;;;;:::i;32782:87::-;;;;;;;;;;-1:-1:-1;32855:6:0;;-1:-1:-1;;;;;32855:6:0;32782:87;;98540:233;;;;;;;;;;-1:-1:-1;98540:233:0;;;;;:::i;:::-;;:::i;55937:104::-;;;;;;;;;;;;;:::i;95468:34::-;;;;;;;;;;-1:-1:-1;95468:34:0;;;;;;;;97540:95;;;;;;;;;;-1:-1:-1;97540:95:0;;;;;:::i;:::-;;:::i;63568:234::-;;;;;;;;;;-1:-1:-1;63568:234:0;;;;;:::i;:::-;;:::i;95650:30::-;;;;;;;;;;;;;;;;98412:120;;;;;;;;;;-1:-1:-1;98412:120:0;;;;;:::i;:::-;;:::i;95593:48::-;;;;;;;;;;-1:-1:-1;95593:48:0;;;;;:::i;:::-;;;;;;;;;;;;;;71683:416;;;;;;:::i;:::-;;:::i;95974:892::-;;;;;;:::i;:::-;;:::i;95357:102::-;;;;;;;;;;;;;:::i;98781:718::-;;;;;;;;;;-1:-1:-1;98781:718:0;;;;;:::i;:::-;;:::i;95765:30::-;;;;;;;;;;;;;;;;97327:88;;;;;;;;;;-1:-1:-1;97327:88:0;;;;;:::i;:::-;;:::i;95535:51::-;;;;;;;;;;-1:-1:-1;95535:51:0;;;;;:::i;:::-;;;;;;;;;;;;;;95727:31;;;;;;;;;;;;;;;;98311:89;;;;;;;;;;-1:-1:-1;98311:89:0;;;;;:::i;:::-;;:::i;63959:164::-;;;;;;;;;;-1:-1:-1;63959:164:0;;;;;:::i;:::-;;:::i;95509:19::-;;;;;;;;;;;;;;;;33715:220;;;;;;;;;;-1:-1:-1;33715:220:0;;;;;:::i;:::-;;:::i;54859:639::-;54944:4;-1:-1:-1;;;;;;;;;55268:25:0;;;;:102;;-1:-1:-1;;;;;;;;;;55345:25:0;;;55268:102;:179;;;-1:-1:-1;;;;;;;;;;55422:25:0;;;55268:179;55248:199;54859:639;-1:-1:-1;;54859:639:0:o;55761:100::-;55815:13;55848:5;55841:12;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;55761:100;:::o;63001:227::-;63077:7;63102:16;63110:7;63102;:16::i;:::-;63097:73;;63120:50;-1:-1:-1;;;63120:7:0;:50::i;:::-;-1:-1:-1;63190:24:0;;;;:15;:24;;;;;:30;-1:-1:-1;;;;;63190:30:0;;63001:227::o;62718:124::-;62807:27;62816:2;62820:7;62829:4;62807:8;:27::i;:::-;62718:124;;:::o;97984:85::-;32668:13;:11;:13::i;:::-;98046:6:::1;:15:::0;;;::::1;;-1:-1:-1::0;;;98046:15:0::1;-1:-1:-1::0;;;;98046:15:0;;::::1;::::0;;;::::1;::::0;;97984:85::o;67273:3523::-;67415:27;67445;67464:7;67445:18;:27::i;:::-;-1:-1:-1;;;;;67600:22:0;;;;67415:57;;-1:-1:-1;67660:45:0;;;;67656:95;;67707:44;-1:-1:-1;;;67707:7:0;:44::i;:::-;67765:27;66381:24;;;:15;:24;;;;;66609:26;;92958:10;66006:30;;;-1:-1:-1;;;;;65699:28:0;;65984:20;;;65981:56;67951:189;;68044:43;68061:4;92958:10;63959:164;:::i;68044:43::-;68039:101;;68089:51;-1:-1:-1;;;68089:7:0;:51::i;:::-;68289:15;68286:160;;;68429:1;68408:19;68401:30;68286:160;-1:-1:-1;;;;;68826:24:0;;;;;;;:18;:24;;;;;;68824:26;;-1:-1:-1;;68824:26:0;;;68895:22;;;;;;;;;68893:24;;-1:-1:-1;68893:24:0;;;61820:11;61795:23;61791:41;61778:63;-1:-1:-1;;;61778:63:0;69188:26;;;;:17;:26;;;;;:175;;;;-1:-1:-1;;;69483:47:0;;:52;;69479:627;;69588:1;69578:11;;69556:19;69711:30;;;:17;:30;;;;;;:35;;69707:384;;69849:13;;69834:11;:28;69830:242;;69996:30;;;;:17;:30;;;;;:52;;;69830:242;69537:569;69479:627;-1:-1:-1;;;;;70238:20:0;;70618:7;70238:20;70548:4;70490:25;70219:16;;70355:299;70679:8;70691:1;70679:13;70675:58;;70694:39;-1:-1:-1;;;70694:7:0;:39::i;:::-;67404:3392;;;;67273:3523;;;:::o;97757:106::-;32668:13;:11;:13::i;:::-;97831:12:::1;:24:::0;97757:106::o;99507:412::-;32668:13;:11;:13::i;:::-;99731:7:::1;99752;32855:6:::0;;-1:-1:-1;;;;;32855:6:0;;32782:87;99752:7:::1;-1:-1:-1::0;;;;;99744:21:0::1;99773;99744:55;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;99730:69;;;99818:2;99810:11;;;::::0;::::1;;99544:375;99507:412::o:0;70892:193::-;71038:39;71055:4;71061:2;71065:7;71038:39;;;;;;;;;;;;:16;:39::i;:::-;70892:193;;;:::o;97869:107::-;32668:13;:11;:13::i;:::-;97940:11:::1;:28:::0;97869:107::o;97423:109::-;32668:13;:11;:13::i;:::-;97497:15:::1;:27:::0;;-1:-1:-1;;97497:27:0::1;::::0;::::1;;::::0;;;::::1;::::0;;97423:109::o;98191:112::-;32668:13;:11;:13::i;:::-;98271:17:::1;:24;98291:4:::0;98271:17;:24:::1;:::i;98077:106::-:0;32668:13;:11;:13::i;:::-;98154:7:::1;:21;98164:11:::0;98154:7;:21:::1;:::i;97643:106::-:0;32668:13;:11;:13::i;:::-;97717:12:::1;:24:::0;97643:106::o;57163:152::-;57235:7;57278:27;57297:7;57278:18;:27::i;95329:21::-;;;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::o;52687:242::-;52759:7;-1:-1:-1;;;;;52783:19:0;;52779:69;;52804:44;-1:-1:-1;;;52804:7:0;:44::i;:::-;-1:-1:-1;;;;;;52866:25:0;;;;;:18;:25;;;;;;45447:13;52866:55;;52687:242::o;33457:103::-;32668:13;:11;:13::i;:::-;33522:30:::1;33549:1;33522:18;:30::i;:::-;33457:103::o:0;98540:233::-;32668:13;:11;:13::i;:::-;98656:9:::1;98651:115;98675:10;:17;98671:1;:21;98651:115;;;98714:40;98724:10;98735:1;98724:13;;;;;;;;:::i;:::-;;;;;;;98739:11;98751:1;98739:14;;;;;;;;:::i;:::-;;;;;;;98714:9;:40::i;:::-;98694:3;;98651:115;;55937:104:::0;55993:13;56026:7;56019:14;;;;;:::i;97540:95::-;32668:13;:11;:13::i;:::-;97608:9:::1;:19:::0;97540:95::o;63568:234::-;92958:10;63663:39;;;;:18;:39;;;;;;;;-1:-1:-1;;;;;63663:49:0;;;;;;;;;;;;:60;;-1:-1:-1;;63663:60:0;;;;;;;;;;63739:55;;722:41:1;;;63663:49:0;;92958:10;63739:55;;695:18:1;63739:55:0;;;;;;;63568:234;;:::o;98412:120::-;32668:13;:11;:13::i;:::-;98495:29:::1;98505:8;98515;98495:9;:29::i;71683:416::-:0;71858:31;71871:4;71877:2;71881:7;71858:12;:31::i;:::-;-1:-1:-1;;;;;71904:14:0;;;:19;71900:192;;71943:56;71974:4;71980:2;71984:7;71993:5;71943:30;:56::i;:::-;71938:154;;72020:56;-1:-1:-1;;;72020:7:0;:56::i;:::-;71683:416;;;;:::o;95974:892::-;96071:6;;-1:-1:-1;;;96071:6:0;;;;96070:7;96062:43;;;;-1:-1:-1;;;96062:43:0;;12135:2:1;96062:43:0;;;12117:21:1;12174:2;12154:18;;;12147:30;12213:25;12193:18;;;12186:53;12256:18;;96062:43:0;;;;;;;;;96135:1;96124:8;:12;:53;;;;;96168:9;;96156:8;96140:13;50094:1;51407:12;51024:14;51391:13;:28;-1:-1:-1;;51391:46:0;;50963:573;96140:13;:24;;;;:::i;:::-;:37;;96124:53;96116:81;;;;-1:-1:-1;;;96116:81:0;;12749:2:1;96116:81:0;;;12731:21:1;12788:2;12768:18;;;12761:30;-1:-1:-1;;;12807:18:1;;;12800:45;12862:18;;96116:81:0;12547:339:1;96116:81:0;96211:15;;;;96208:609;;;96251:15;96259:6;;96251:7;:15::i;:::-;96243:62;;;;-1:-1:-1;;;96243:62:0;;13093:2:1;96243:62:0;;;13075:21:1;13132:2;13112:18;;;13105:30;13171:34;13151:18;;;13144:62;-1:-1:-1;;;13222:18:1;;;13215:32;13264:19;;96243:62:0;12891:398:1;96243:62:0;96371:12;;96345:10;96328:28;;;;:16;:28;;;;;;:39;;96359:8;;96328:39;:::i;:::-;:55;;96320:94;;;;-1:-1:-1;;;96320:94:0;;13496:2:1;96320:94:0;;;13478:21:1;13535:2;13515:18;;;13508:30;13574:28;13554:18;;;13547:56;13620:18;;96320:94:0;13294:350:1;96320:94:0;96450:12;;96437:9;:25;;96429:54;;;;-1:-1:-1;;;96429:54:0;;13851:2:1;96429:54:0;;;13833:21:1;13890:2;13870:18;;;13863:30;-1:-1:-1;;;13909:18:1;;;13902:46;13965:18;;96429:54:0;13649:340:1;96429:54:0;96515:10;96498:28;;;;:16;:28;;;;;:40;;96530:8;;96498:28;:40;;96530:8;;96498:40;:::i;:::-;;;;-1:-1:-1;96208:609:0;;-1:-1:-1;96208:609:0;;96628:12;;96602:10;96588:25;;;;:13;:25;;;;;;:36;;96616:8;;96588:36;:::i;:::-;:52;;96580:91;;;;-1:-1:-1;;;96580:91:0;;13496:2:1;96580:91:0;;;13478:21:1;13535:2;13515:18;;;13508:30;13574:28;13554:18;;;13547:56;13620:18;;96580:91:0;13294:350:1;96580:91:0;96721:8;96707:11;;:22;;;;:::i;:::-;96694:9;:35;;96686:67;;;;-1:-1:-1;;;96686:67:0;;14369:2:1;96686:67:0;;;14351:21:1;14408:2;14388:18;;;14381:30;-1:-1:-1;;;14427:18:1;;;14420:49;14486:18;;96686:67:0;14167:343:1;96686:67:0;96782:10;96768:25;;;;:13;:25;;;;;:37;;96797:8;;96768:25;:37;;96797:8;;96768:37;:::i;:::-;;;;-1:-1:-1;;96208:609:0;96827:31;96837:10;96849:8;96827:9;:31::i;95357:102::-;;;;;;;:::i;98781:718::-;98899:13;98952:16;98960:7;98952;:16::i;:::-;98930:113;;;;-1:-1:-1;;;98930:113:0;;14717:2:1;98930:113:0;;;14699:21:1;14756:2;14736:18;;;14729:30;14795:34;14775:18;;;14768:62;-1:-1:-1;;;14846:18:1;;;14839:45;14901:19;;98930:113:0;14515:411:1;98930:113:0;99058:8;;-1:-1:-1;;;99058:8:0;;;;:17;;99070:5;99058:17;99054:74;;99099:17;99092:24;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;98781:718;;;:::o;99054:74::-;99138:28;99169:10;:8;:10::i;:::-;99138:41;;99241:1;99216:14;99210:28;:32;:281;;;;;;;;;;;;;;;;;99334:14;99375:18;:7;:16;:18::i;:::-;99291:159;;;;;;;;;:::i;:::-;;;;;;;;;;;;;99210:281;99190:301;98781:718;-1:-1:-1;;;98781:718:0:o;97327:88::-;32668:13;:11;:13::i;:::-;97392:4:::1;:15:::0;97327:88::o;98311:89::-;32668:13;:11;:13::i;:::-;98375:8:::1;:17:::0;;;::::1;;-1:-1:-1::0;;;98375:17:0::1;-1:-1:-1::0;;;;98375:17:0;;::::1;::::0;;;::::1;::::0;;98311:89::o;63959:164::-;-1:-1:-1;;;;;64080:25:0;;;64056:4;64080:25;;;:18;:25;;;;;;;;:35;;;;;;;;;;;;;;;63959:164::o;33715:220::-;32668:13;:11;:13::i;:::-;-1:-1:-1;;;;;33800:22:0;::::1;33796:93;;33846:31;::::0;-1:-1:-1;;;33846:31:0;;33874:1:::1;33846:31;::::0;::::1;1861:51:1::0;1834:18;;33846:31:0::1;1715:203:1::0;33796:93:0::1;33899:28;33918:8;33899:18;:28::i;64381:475::-:0;64446:11;64493:7;50094:1;64474:26;64470:379;;64638:13;;64628:7;:23;64624:214;;;64672:14;64705:60;-1:-1:-1;64722:26:0;;;;:17;:26;;;;;;;64712:42;;;64705:60;;64756:9;;;:::i;:::-;;;64705:60;;;-1:-1:-1;;;64793:24:0;:29;;-1:-1:-1;64624:214:0;64381:475;;;:::o;94890:165::-;94991:13;94985:4;94978:27;95032:4;95026;95019:18;86305:474;86434:13;86450:16;86458:7;86450;:16::i;:::-;86434:32;;86483:13;:45;;;;-1:-1:-1;92958:10:0;-1:-1:-1;;;;;86500:28:0;;;;86483:45;86479:201;;;86548:44;86565:5;92958:10;63959:164;:::i;86548:44::-;86543:137;;86613:51;-1:-1:-1;;;86613:7:0;:51::i;:::-;86692:24;;;;:15;:24;;;;;;:35;;-1:-1:-1;;;;;;86692:35:0;-1:-1:-1;;;;;86692:35:0;;;;;;;;;86743:28;;86692:24;;86743:28;;;;;;;86423:356;86305:474;;;:::o;32947:166::-;32855:6;;-1:-1:-1;;;;;32855:6:0;92958:10;33007:23;33003:103;;33054:40;;-1:-1:-1;;;33054:40:0;;92958:10;33054:40;;;1861:51:1;1834:18;;33054:40:0;1715:203:1;58648:2213:0;58715:14;58765:7;50094:1;58746:26;58742:2054;;-1:-1:-1;58798:26:0;;;;:17;:26;;;;;;59125:6;59135:1;59125:11;59121:1292;;59172:13;;59161:7;:24;59157:77;;59187:47;-1:-1:-1;;;59187:7:0;:47::i;:::-;59791:607;-1:-1:-1;;;59887:9:0;59869:28;;;;:17;:28;;;;;;59943:25;;59791:607;59943:25;-1:-1:-1;;;59995:6:0;:24;60023:1;59995:29;59991:48;;58648:2213;;;:::o;59991:48::-;60331:47;-1:-1:-1;;;60331:7:0;:47::i;:::-;59791:607;;59121:1292;-1:-1:-1;;;60740:6:0;:24;60768:1;60740:29;60736:48;;58648:2213;;;:::o;60736:48::-;60806:47;-1:-1:-1;;;60806:7:0;:47::i;34095:191::-;34188:6;;;-1:-1:-1;;;;;34205:17:0;;;-1:-1:-1;;;;;;34205:17:0;;;;;;;34238:40;;34188:6;;;34205:17;34188:6;;34238:40;;34169:16;;34238:40;34158:128;34095:191;:::o;81499:112::-;81576:27;81586:2;81590:8;81576:27;;;;;;;;;;;;:9;:27::i;74183:691::-;74367:88;;-1:-1:-1;;;74367:88:0;;74346:4;;-1:-1:-1;;;;;74367:45:0;;;;;:88;;92958:10;;74434:4;;74440:7;;74449:5;;74367:88;;;:::i;:::-;;;;;;;;;;;;;;;;;;;;-1:-1:-1;74367:88:0;;;;;;;;-1:-1:-1;;74367:88:0;;;;;;;;;;;;:::i;:::-;;;74363:504;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;74650:6;:13;74667:1;74650:18;74646:115;;74689:56;-1:-1:-1;;;74689:7:0;:56::i;:::-;74833:6;74827:13;74818:6;74814:2;74810:15;74803:38;74363:504;-1:-1:-1;;;;;;74526:64:0;-1:-1:-1;;;74526:64:0;;-1:-1:-1;74363:504:0;74183:691;;;;;;:::o;97051:268::-;97165:28;;-1:-1:-1;;97182:10:0;16637:2:1;16633:15;16629:53;97165:28:0;;;16617:66:1;97124:4:0;;;;16699:12:1;;97165:28:0;;;;;;;;;;;;97155:39;;;;;;97140:54;;97213:44;97232:12;;97213:44;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;-1:-1:-1;;97246:4:0;;;-1:-1:-1;97252:4:0;;-1:-1:-1;97213:18:0;:44::i;:::-;97205:84;;;;-1:-1:-1;;;97205:84:0;;16924:2:1;97205:84:0;;;16906:21:1;16963:2;16943:18;;;16936:30;17002:29;16982:18;;;16975:57;17049:18;;97205:84:0;16722:351:1;97205:84:0;-1:-1:-1;97307:4:0;;97051:268;-1:-1:-1;;;97051:268:0:o;96874:108::-;96934:13;96967:7;96960:14;;;;;:::i;27561:718::-;27617:13;27668:14;27685:17;27696:5;27685:10;:17::i;:::-;27705:1;27685:21;27668:38;;27721:20;27755:6;27744:18;;;;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;-1:-1:-1;27744:18:0;-1:-1:-1;27721:41:0;-1:-1:-1;27886:28:0;;;27902:2;27886:28;27943:290;-1:-1:-1;;27975:5:0;-1:-1:-1;;;28112:2:0;28101:14;;28096:32;27975:5;28083:46;28175:2;28166:11;;;-1:-1:-1;28196:21:0;27943:290;28196:21;-1:-1:-1;28254:6:0;27561:718;-1:-1:-1;;;27561:718:0:o;80628:787::-;80759:19;80765:2;80769:8;80759:5;:19::i;:::-;-1:-1:-1;;;;;80820:14:0;;;:19;80816:581;;80860:11;80874:13;80922:14;;;80955:242;80986:62;81025:1;81029:2;81033:7;;;;;;81042:5;80986:30;:62::i;:::-;80981:176;;81077:56;-1:-1:-1;;;81077:7:0;:56::i;:::-;81192:3;81184:5;:11;80955:242;;81368:3;81351:13;;:20;81347:34;;81373:8;;;81347:34;80841:556;;80628:787;;;:::o;1368:156::-;1459:4;1512;1483:25;1496:5;1503:4;1483:12;:25::i;:::-;:33;;1368:156;-1:-1:-1;;;;1368:156:0:o;23965:948::-;24018:7;;-1:-1:-1;;;24096:17:0;;24092:106;;-1:-1:-1;;;24134:17:0;;;-1:-1:-1;24180:2:0;24170:12;24092:106;24225:8;24216:5;:17;24212:106;;24263:8;24254:17;;;-1:-1:-1;24300:2:0;24290:12;24212:106;24345:8;24336:5;:17;24332:106;;24383:8;24374:17;;;-1:-1:-1;24420:2:0;24410:12;24332:106;24465:7;24456:5;:16;24452:103;;24502:7;24493:16;;;-1:-1:-1;24538:1:0;24528:11;24452:103;24582:7;24573:5;:16;24569:103;;24619:7;24610:16;;;-1:-1:-1;24655:1:0;24645:11;24569:103;24699:7;24690:5;:16;24686:103;;24736:7;24727:16;;;-1:-1:-1;24772:1:0;24762:11;24686:103;24816:7;24807:5;:16;24803:68;;24854:1;24844:11;24899:6;23965:948;-1:-1:-1;;23965:948:0:o;75336:2399::-;75409:20;75432:13;;;75460;;;75456:53;;75475:34;-1:-1:-1;;;75475:7:0;:34::i;:::-;76022:31;;;;:17;:31;;;;;;;;-1:-1:-1;;;;;61646:28:0;;61820:11;61795:23;61791:41;62264:1;62251:15;;62225:24;62221:46;61788:52;61778:63;;76022:173;;;76413:22;;;:18;:22;;;;;:71;;76451:32;76439:45;;76413:71;;;61646:28;76674:13;;;76670:54;;76689:35;-1:-1:-1;;;76689:7:0;:35::i;:::-;76755:23;;;;76934:676;77353:7;77309:8;77264:1;77198:25;77135:1;77070;77039:358;77605:3;77592:9;;;;;;:16;76934:676;;-1:-1:-1;77626:13:0;:19;-1:-1:-1;70892:193:0;;;:::o;2087:296::-;2170:7;2213:4;2170:7;2228:118;2252:5;:12;2248:1;:16;2228:118;;;2301:33;2311:12;2325:5;2331:1;2325:8;;;;;;;;:::i;:::-;;;;;;;2301:9;:33::i;:::-;2286:48;-1:-1:-1;2266:3:0;;2228:118;;;-1:-1:-1;2363:12:0;2087:296;-1:-1:-1;;;2087:296:0:o;9517:149::-;9580:7;9611:1;9607;:5;:51;;9859:13;9953:15;;;9989:4;9982:15;;;10036:4;10020:21;;9607:51;;;-1:-1:-1;9859:13:0;9953:15;;;9989:4;9982:15;10036:4;10020:21;;;9517:149::o;196:131:1:-;-1:-1:-1;;;;;;270:32:1;;260:43;;250:71;;317:1;314;307:12;332:245;390:6;443:2;431:9;422:7;418:23;414:32;411:52;;;459:1;456;449:12;411:52;498:9;485:23;517:30;541:5;517:30;:::i;774:250::-;859:1;869:113;883:6;880:1;877:13;869:113;;;959:11;;;953:18;940:11;;;933:39;905:2;898:10;869:113;;;-1:-1:-1;;1016:1:1;998:16;;991:27;774:250::o;1029:271::-;1071:3;1109:5;1103:12;1136:6;1131:3;1124:19;1152:76;1221:6;1214:4;1209:3;1205:14;1198:4;1191:5;1187:16;1152:76;:::i;:::-;1282:2;1261:15;-1:-1:-1;;1257:29:1;1248:39;;;;1289:4;1244:50;;1029:271;-1:-1:-1;;1029:271:1:o;1305:220::-;1454:2;1443:9;1436:21;1417:4;1474:45;1515:2;1504:9;1500:18;1492:6;1474:45;:::i;1530:180::-;1589:6;1642:2;1630:9;1621:7;1617:23;1613:32;1610:52;;;1658:1;1655;1648:12;1610:52;-1:-1:-1;1681:23:1;;1530:180;-1:-1:-1;1530:180:1:o;1923:173::-;1991:20;;-1:-1:-1;;;;;2040:31:1;;2030:42;;2020:70;;2086:1;2083;2076:12;2101:254;2169:6;2177;2230:2;2218:9;2209:7;2205:23;2201:32;2198:52;;;2246:1;2243;2236:12;2198:52;2269:29;2288:9;2269:29;:::i;:::-;2259:39;2345:2;2330:18;;;;2317:32;;-1:-1:-1;;;2101:254:1:o;2360:160::-;2425:20;;2481:13;;2474:21;2464:32;;2454:60;;2510:1;2507;2500:12;2525:180;2581:6;2634:2;2622:9;2613:7;2609:23;2605:32;2602:52;;;2650:1;2647;2640:12;2602:52;2673:26;2689:9;2673:26;:::i;2710:328::-;2787:6;2795;2803;2856:2;2844:9;2835:7;2831:23;2827:32;2824:52;;;2872:1;2869;2862:12;2824:52;2895:29;2914:9;2895:29;:::i;:::-;2885:39;;2943:38;2977:2;2966:9;2962:18;2943:38;:::i;:::-;2933:48;;3028:2;3017:9;3013:18;3000:32;2990:42;;2710:328;;;;;:::o;3043:127::-;3104:10;3099:3;3095:20;3092:1;3085:31;3135:4;3132:1;3125:15;3159:4;3156:1;3149:15;3175:275;3246:2;3240:9;3311:2;3292:13;;-1:-1:-1;;3288:27:1;3276:40;;3346:18;3331:34;;3367:22;;;3328:62;3325:88;;;3393:18;;:::i;:::-;3429:2;3422:22;3175:275;;-1:-1:-1;3175:275:1:o;3455:407::-;3520:5;3554:18;3546:6;3543:30;3540:56;;;3576:18;;:::i;:::-;3614:57;3659:2;3638:15;;-1:-1:-1;;3634:29:1;3665:4;3630:40;3614:57;:::i;:::-;3605:66;;3694:6;3687:5;3680:21;3734:3;3725:6;3720:3;3716:16;3713:25;3710:45;;;3751:1;3748;3741:12;3710:45;3800:6;3795:3;3788:4;3781:5;3777:16;3764:43;3854:1;3847:4;3838:6;3831:5;3827:18;3823:29;3816:40;3455:407;;;;;:::o;3867:451::-;3936:6;3989:2;3977:9;3968:7;3964:23;3960:32;3957:52;;;4005:1;4002;3995:12;3957:52;4045:9;4032:23;4078:18;4070:6;4067:30;4064:50;;;4110:1;4107;4100:12;4064:50;4133:22;;4186:4;4178:13;;4174:27;-1:-1:-1;4164:55:1;;4215:1;4212;4205:12;4164:55;4238:74;4304:7;4299:2;4286:16;4281:2;4277;4273:11;4238:74;:::i;4323:186::-;4382:6;4435:2;4423:9;4414:7;4410:23;4406:32;4403:52;;;4451:1;4448;4441:12;4403:52;4474:29;4493:9;4474:29;:::i;4514:183::-;4574:4;4607:18;4599:6;4596:30;4593:56;;;4629:18;;:::i;:::-;-1:-1:-1;4674:1:1;4670:14;4686:4;4666:25;;4514:183::o;4702:668::-;4756:5;4809:3;4802:4;4794:6;4790:17;4786:27;4776:55;;4827:1;4824;4817:12;4776:55;4863:6;4850:20;4889:4;4913:60;4929:43;4969:2;4929:43;:::i;:::-;4913:60;:::i;:::-;4995:3;5019:2;5014:3;5007:15;5047:4;5042:3;5038:14;5031:21;;5104:4;5098:2;5095:1;5091:10;5083:6;5079:23;5075:34;5061:48;;5132:3;5124:6;5121:15;5118:35;;;5149:1;5146;5139:12;5118:35;5185:4;5177:6;5173:17;5199:142;5215:6;5210:3;5207:15;5199:142;;;5281:17;;5269:30;;5319:12;;;;5232;;5199:142;;;-1:-1:-1;5359:5:1;4702:668;-1:-1:-1;;;;;;4702:668:1:o;5375:1146::-;5493:6;5501;5554:2;5542:9;5533:7;5529:23;5525:32;5522:52;;;5570:1;5567;5560:12;5522:52;5610:9;5597:23;5639:18;5680:2;5672:6;5669:14;5666:34;;;5696:1;5693;5686:12;5666:34;5734:6;5723:9;5719:22;5709:32;;5779:7;5772:4;5768:2;5764:13;5760:27;5750:55;;5801:1;5798;5791:12;5750:55;5837:2;5824:16;5859:4;5883:60;5899:43;5939:2;5899:43;:::i;5883:60::-;5977:15;;;6059:1;6055:10;;;;6047:19;;6043:28;;;6008:12;;;;6083:19;;;6080:39;;;6115:1;6112;6105:12;6080:39;6139:11;;;;6159:148;6175:6;6170:3;6167:15;6159:148;;;6241:23;6260:3;6241:23;:::i;:::-;6229:36;;6192:12;;;;6285;;;;6159:148;;;6326:5;-1:-1:-1;;6369:18:1;;6356:32;;-1:-1:-1;;6400:16:1;;;6397:36;;;6429:1;6426;6419:12;6397:36;;6452:63;6507:7;6496:8;6485:9;6481:24;6452:63;:::i;:::-;6442:73;;;5375:1146;;;;;:::o;6526:254::-;6591:6;6599;6652:2;6640:9;6631:7;6627:23;6623:32;6620:52;;;6668:1;6665;6658:12;6620:52;6691:29;6710:9;6691:29;:::i;:::-;6681:39;;6739:35;6770:2;6759:9;6755:18;6739:35;:::i;:::-;6729:45;;6526:254;;;;;:::o;6785:::-;6853:6;6861;6914:2;6902:9;6893:7;6889:23;6885:32;6882:52;;;6930:1;6927;6920:12;6882:52;6966:9;6953:23;6943:33;;6995:38;7029:2;7018:9;7014:18;6995:38;:::i;7044:667::-;7139:6;7147;7155;7163;7216:3;7204:9;7195:7;7191:23;7187:33;7184:53;;;7233:1;7230;7223:12;7184:53;7256:29;7275:9;7256:29;:::i;:::-;7246:39;;7304:38;7338:2;7327:9;7323:18;7304:38;:::i;:::-;7294:48;;7389:2;7378:9;7374:18;7361:32;7351:42;;7444:2;7433:9;7429:18;7416:32;7471:18;7463:6;7460:30;7457:50;;;7503:1;7500;7493:12;7457:50;7526:22;;7579:4;7571:13;;7567:27;-1:-1:-1;7557:55:1;;7608:1;7605;7598:12;7557:55;7631:74;7697:7;7692:2;7679:16;7674:2;7670;7666:11;7631:74;:::i;:::-;7621:84;;;7044:667;;;;;;;:::o;7716:683::-;7811:6;7819;7827;7880:2;7868:9;7859:7;7855:23;7851:32;7848:52;;;7896:1;7893;7886:12;7848:52;7932:9;7919:23;7909:33;;7993:2;7982:9;7978:18;7965:32;8016:18;8057:2;8049:6;8046:14;8043:34;;;8073:1;8070;8063:12;8043:34;8111:6;8100:9;8096:22;8086:32;;8156:7;8149:4;8145:2;8141:13;8137:27;8127:55;;8178:1;8175;8168:12;8127:55;8218:2;8205:16;8244:2;8236:6;8233:14;8230:34;;;8260:1;8257;8250:12;8230:34;8313:7;8308:2;8298:6;8295:1;8291:14;8287:2;8283:23;8279:32;8276:45;8273:65;;;8334:1;8331;8324:12;8273:65;8365:2;8361;8357:11;8347:21;;8387:6;8377:16;;;;;7716:683;;;;;:::o;8589:260::-;8657:6;8665;8718:2;8706:9;8697:7;8693:23;8689:32;8686:52;;;8734:1;8731;8724:12;8686:52;8757:29;8776:9;8757:29;:::i;:::-;8747:39;;8805:38;8839:2;8828:9;8824:18;8805:38;:::i;9036:380::-;9115:1;9111:12;;;;9158;;;9179:61;;9233:4;9225:6;9221:17;9211:27;;9179:61;9286:2;9278:6;9275:14;9255:18;9252:38;9249:161;;9332:10;9327:3;9323:20;9320:1;9313:31;9367:4;9364:1;9357:15;9395:4;9392:1;9385:15;9249:161;;9036:380;;;:::o;9757:518::-;9859:2;9854:3;9851:11;9848:421;;;9895:5;9892:1;9885:16;9939:4;9936:1;9926:18;10009:2;9997:10;9993:19;9990:1;9986:27;9980:4;9976:38;10045:4;10033:10;10030:20;10027:47;;;-1:-1:-1;10068:4:1;10027:47;10123:2;10118:3;10114:12;10111:1;10107:20;10101:4;10097:31;10087:41;;10178:81;10196:2;10189:5;10186:13;10178:81;;;10255:1;10241:16;;10222:1;10211:13;10178:81;;10451:1345;10577:3;10571:10;10604:18;10596:6;10593:30;10590:56;;;10626:18;;:::i;:::-;10655:97;10745:6;10705:38;10737:4;10731:11;10705:38;:::i;:::-;10699:4;10655:97;:::i;:::-;10807:4;;10864:2;10853:14;;10881:1;10876:663;;;;11583:1;11600:6;11597:89;;;-1:-1:-1;11652:19:1;;;11646:26;11597:89;-1:-1:-1;;10408:1:1;10404:11;;;10400:24;10396:29;10386:40;10432:1;10428:11;;;10383:57;11699:81;;10846:944;;10876:663;9704:1;9697:14;;;9741:4;9728:18;;-1:-1:-1;;10912:20:1;;;11030:236;11044:7;11041:1;11038:14;11030:236;;;11133:19;;;11127:26;11112:42;;11225:27;;;;11193:1;11181:14;;;;11060:19;;11030:236;;;11034:3;11294:6;11285:7;11282:19;11279:201;;;11355:19;;;11349:26;-1:-1:-1;;11438:1:1;11434:14;;;11450:3;11430:24;11426:37;11422:42;11407:58;11392:74;;11279:201;;;11526:1;11517:6;11514:1;11510:14;11506:22;11500:4;11493:36;10846:944;;;;;10451:1345;;:::o;11801:127::-;11862:10;11857:3;11853:20;11850:1;11843:31;11893:4;11890:1;11883:15;11917:4;11914:1;11907:15;12285:127;12346:10;12341:3;12337:20;12334:1;12327:31;12377:4;12374:1;12367:15;12401:4;12398:1;12391:15;12417:125;12482:9;;;12503:10;;;12500:36;;;12516:18;;:::i;13994:168::-;14067:9;;;14098;;14115:15;;;14109:22;;14095:37;14085:71;;14136:18;;:::i;14931:663::-;15211:3;15249:6;15243:13;15265:66;15324:6;15319:3;15312:4;15304:6;15300:17;15265:66;:::i;:::-;15394:13;;15353:16;;;;15416:70;15394:13;15353:16;15463:4;15451:17;;15416:70;:::i;:::-;-1:-1:-1;;;15508:20:1;;15537:22;;;15586:1;15575:13;;14931:663;-1:-1:-1;;;;14931:663:1:o;15599:136::-;15638:3;15666:5;15656:39;;15675:18;;:::i;:::-;-1:-1:-1;;;15711:18:1;;15599:136::o;15740:489::-;-1:-1:-1;;;;;16009:15:1;;;15991:34;;16061:15;;16056:2;16041:18;;16034:43;16108:2;16093:18;;16086:34;;;16156:3;16151:2;16136:18;;16129:31;;;15934:4;;16177:46;;16203:19;;16195:6;16177:46;:::i;:::-;16169:54;15740:489;-1:-1:-1;;;;;;15740:489:1:o;16234:249::-;16303:6;16356:2;16344:9;16335:7;16331:23;16327:32;16324:52;;;16372:1;16369;16362:12;16324:52;16404:9;16398:16;16423:30;16447:5;16423:30;:::i

Swarm Source

ipfs://5f6533e3265534872521fd4a9828d153056dd705172eca03f53ab87c2301d5da
Loading...
Loading
Loading...
Loading
[ Download: CSV Export  ]
[ Download: CSV Export  ]

A token is a representation of an on-chain or off-chain asset. The token page shows information such as price, total supply, holders, transfers and social links. Learn more about this page in our Knowledge Base.