Contract

Contract Source Code (Solidity)

IDE

• Blockscan IDE
• 🤖 Code ReaderBeta
• Remix IDE

Outline

• library SignedMath
•    - function max(int256 a, int256 b)
•    - function min(int256 a, int256 b)
•    - function average(int256 a, int256 b)
•    - function abs(int256 n)
• library Math
•    - function max(uint256 a, uint256 b)
•    - function min(uint256 a, uint256 b)
•    - function average(uint256 a, uint256 b ...
•    - function ceilDiv(uint256 a, uint256 b ...
•    - function mulDiv(uint256 x, uint256 y, ...
•    - function mulDiv(uint256 x, uint256 y, ...
•    - function sqrt(uint256 a)
•    - function sqrt(uint256 a, Rounding rou ...
•    - function log2(uint256 value)
•    - function log2(uint256 value, Rounding ...
•    - function log10(uint256 value)
•    - function log10(uint256 value, Roundin ...
•    - function log256(uint256 value)
•    - function log256(uint256 value, Roundi ...
• library Strings
•    - function toString(uint256 value)
•    - function toString(int256 value)
•    - function toHexString(uint256 value)
•    - function toHexString(uint256 value, u ...
•    - function toHexString(address addr)
•    - function equal(string memory a, strin ...
• library ECDSA
•    - function _throwError(RecoverError err ...
•    - function tryRecover(bytes32 hash, byt ...
•    - function recover(bytes32 hash, bytes ...
•    - function tryRecover(bytes32 hash, byt ...
•    - function recover(bytes32 hash, bytes3 ...
•    - function tryRecover(bytes32 hash, uin ...
•    - function recover(bytes32 hash, uint8 ...
•    - function toEthSignedMessageHash(bytes ...
•    - function toEthSignedMessageHash(bytes ...
•    - function toTypedDataHash(bytes32 doma ...
•    - function toDataWithIntendedValidatorH ...
•  contract BabuPunks *
•    - function setMintState(uint256 _MINT_S ...
•    - function setPrice(uint256 _PRICE)
•    - function purchaseBabus(uint256 amount ...
•    - function claimBabu(uint256 index, byt ...

More Options

• Is this a proxy?
• Similar
• Sol2Uml
• Submit Audit
• Compare

/**
 *Submitted for verification at Etherscan.io on 2023-08-24
*/

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


// OpenZeppelin Contracts (last updated v4.8.0) (utils/math/SignedMath.sol)

pragma solidity ^0.8.0;

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

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

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

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

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


// OpenZeppelin Contracts (last updated v4.9.0) (utils/math/Math.sol)

pragma solidity ^0.8.0;

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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


// OpenZeppelin Contracts (last updated v4.9.0) (utils/Strings.sol)

pragma solidity ^0.8.0;



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

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

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

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

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

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

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

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


// OpenZeppelin Contracts (last updated v4.9.0) (utils/cryptography/ECDSA.sol)

pragma solidity ^0.8.0;


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

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

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

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

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

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

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

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

        return (signer, RecoverError.NoError);
    }

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

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

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

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

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

// File: Babupunks.sol


pragma solidity ^0.8.20;


contract BabuPunks {

    error MaxSupplyReached();
    error InvalidValue();
    error RequestingTooMany();
    error TransferFailed();
    error OnlyOwner();
    error MintClosed();
    error AlreadyClaimed();
    error InvalidSnapshotProof();

    event Mint(address indexed minter, uint256 indexed amount, uint256 startID, uint256 endID);

    uint256 public TOTAL_SUPPLY = 1083;
    uint256 public PRICE = 0.002 * 1 ether;
    uint256 public immutable MAX_SUPPLY = 10_000;
    uint256 public immutable MAX_PER_TXN = 69;
    uint256 public MINT_STATE = 0;
    uint256 public CLAIM_SUPPLY = 0;
    uint256 public immutable CLAIM_MAX_SUPPLY = 888;

    address OWNER;

    mapping (address => bool) public claimed;

    modifier onlyOwner() {
        require(msg.sender == OWNER, "OnlyOwner()");
        _;
    }

    constructor () {
        OWNER = msg.sender;
    }

    function setMintState(uint256 _MINT_STATE) external onlyOwner {
        MINT_STATE = _MINT_STATE;
    }

    function setPrice(uint256 _PRICE) external onlyOwner {
        PRICE = _PRICE;
    }

    function purchaseBabus(uint256 amount) payable external {
        if (MINT_STATE != 1) { revert MintClosed(); }
        if ((TOTAL_SUPPLY + amount) > MAX_SUPPLY ||
            amount > MAX_PER_TXN) { revert RequestingTooMany(); }
        if (TOTAL_SUPPLY == MAX_SUPPLY) { revert MaxSupplyReached(); }
        if ((amount * PRICE) < msg.value) { revert InvalidValue(); }

        uint256 startId = TOTAL_SUPPLY;
        unchecked {
            TOTAL_SUPPLY += amount;
        }

        (bool success,) = address(OWNER).call{value: msg.value}('');
        if (!success) { revert TransferFailed(); }

        emit Mint(msg.sender, amount, startId, TOTAL_SUPPLY);
    }

    function claimBabu(uint256 index, bytes calldata signature) external {
        if (claimed[msg.sender]) { revert AlreadyClaimed(); }
        if ((TOTAL_SUPPLY + 1) > MAX_SUPPLY ||
            (CLAIM_SUPPLY + 1) > CLAIM_MAX_SUPPLY) { revert RequestingTooMany(); }

        bytes32 message = keccak256(
            abi.encode(msg.sender, index)
        );
        if (
            ECDSA.recover(
                ECDSA.toEthSignedMessageHash(message),
                signature
            ) != OWNER
        ) {
            revert InvalidSnapshotProof();
        }

        claimed[msg.sender] = true;
        
        unchecked {
            emit Mint(msg.sender, 1, TOTAL_SUPPLY, TOTAL_SUPPLY++);
            CLAIM_SUPPLY++;
        }
    }
}

• No Contract Security Audit Submitted- Submit Audit Here

[{"inputs":[],"stateMutability":"nonpayable","type":"constructor"},{"inputs":[],"name":"AlreadyClaimed","type":"error"},{"inputs":[],"name":"InvalidSnapshotProof","type":"error"},{"inputs":[],"name":"InvalidValue","type":"error"},{"inputs":[],"name":"MaxSupplyReached","type":"error"},{"inputs":[],"name":"MintClosed","type":"error"},{"inputs":[],"name":"OnlyOwner","type":"error"},{"inputs":[],"name":"RequestingTooMany","type":"error"},{"inputs":[],"name":"TransferFailed","type":"error"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"minter","type":"address"},{"indexed":true,"internalType":"uint256","name":"amount","type":"uint256"},{"indexed":false,"internalType":"uint256","name":"startID","type":"uint256"},{"indexed":false,"internalType":"uint256","name":"endID","type":"uint256"}],"name":"Mint","type":"event"},{"inputs":[],"name":"CLAIM_MAX_SUPPLY","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"CLAIM_SUPPLY","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"MAX_PER_TXN","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"MAX_SUPPLY","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"MINT_STATE","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"PRICE","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"TOTAL_SUPPLY","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"index","type":"uint256"},{"internalType":"bytes","name":"signature","type":"bytes"}],"name":"claimBabu","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"","type":"address"}],"name":"claimed","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"amount","type":"uint256"}],"name":"purchaseBabus","outputs":[],"stateMutability":"payable","type":"function"},{"inputs":[{"internalType":"uint256","name":"_MINT_STATE","type":"uint256"}],"name":"setMintState","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"_PRICE","type":"uint256"}],"name":"setPrice","outputs":[],"stateMutability":"nonpayable","type":"function"}]

60e060405261043b5f90815566071afd498d0000600155612710608052604560a052600281905560035561037860c05234801561003a575f80fd5b50600480546001600160a01b0319163317905560805160a05160c051610a7061009a5f395f8181610169015261052901525f8181610136015261030401525f8181610103015281816102cf0152818161034601526104f30152610a705ff3fe6080604052600436106100a5575f3560e01c806388c2cde61161006257806388c2cde61461019e5780638d859f3e146101b3578063902d55a5146101c857806391b7f5ed146101dc578063c884ef83146101fb578063df49a47214610239575f80fd5b80630bb862d1146100a957806322c168b1146100ca57806332cb6b0c146100f257806351b96d92146101255780635af4fdab14610158578063603d79411461018b575b5f80fd5b3480156100b4575f80fd5b506100c86100c336600461092f565b610258565b005b3480156100d5575f80fd5b506100df60035481565b6040519081526020015b60405180910390f35b3480156100fd575f80fd5b506100df7f000000000000000000000000000000000000000000000000000000000000000081565b348015610130575f80fd5b506100df7f000000000000000000000000000000000000000000000000000000000000000081565b348015610163575f80fd5b506100df7f000000000000000000000000000000000000000000000000000000000000000081565b6100c861019936600461092f565b6102aa565b3480156101a9575f80fd5b506100df60025481565b3480156101be575f80fd5b506100df60015481565b3480156101d3575f80fd5b506100df5f5481565b3480156101e7575f80fd5b506100c86101f636600461092f565b610474565b348015610206575f80fd5b50610229610215366004610946565b60056020525f908152604090205460ff1681565b60405190151581526020016100e9565b348015610244575f80fd5b506100c8610253366004610973565b6104c1565b6004546001600160a01b031633146102a55760405162461bcd60e51b815260206004820152600b60248201526a4f6e6c794f776e6572282960a81b60448201526064015b60405180910390fd5b600255565b6002546001146102cd5760405163589ed34b60e01b815260040160405180910390fd5b7f0000000000000000000000000000000000000000000000000000000000000000815f546102fb91906109fc565b118061032657507f000000000000000000000000000000000000000000000000000000000000000081115b1561034457604051639e0456c360e01b815260040160405180910390fd5b7f00000000000000000000000000000000000000000000000000000000000000005f54036103855760405163d05cb60960e01b815260040160405180910390fd5b34600154826103949190610a0f565b10156103b357604051632a9ffab760e21b815260040160405180910390fd5b5f805482810182556004546040519192916001600160a01b039091169034908381818185875af1925050503d805f8114610408576040519150601f19603f3d011682016040523d82523d5f602084013e61040d565b606091505b505090508061042f576040516312171d8360e31b815260040160405180910390fd5b5f54604080518481526020810192909252849133917fb4c03061fb5b7fed76389d5af8f2e0ddb09f8c70d1333abbb62582835e10accb910160405180910390a3505050565b6004546001600160a01b031633146104bc5760405162461bcd60e51b815260206004820152600b60248201526a4f6e6c794f776e6572282960a81b604482015260640161029c565b600155565b335f9081526005602052604090205460ff16156104f157604051630c8d9eab60e31b815260040160405180910390fd5b7f00000000000000000000000000000000000000000000000000000000000000005f54600161052091906109fc565b118061055957507f0000000000000000000000000000000000000000000000000000000000000000600354600161055791906109fc565b115b1561057757604051639e0456c360e01b815260040160405180910390fd5b604080513360208201529081018490525f9060600160408051808303601f1901815291905280516020909101206004547f19457468657265756d205369676e6564204d6573736167653a0a3332000000005f908152601c839052603c90209192506001600160a01b0316906106219085858080601f0160208091040260200160405190810160405280939291908181526020018383808284375f920191909152506106c092505050565b6001600160a01b0316146106485760405163a4513f6560e01b815260040160405180910390fd5b335f81815260056020526040808220805460ff19166001908117909155825480820190935590519092917fb4c03061fb5b7fed76389d5af8f2e0ddb09f8c70d1333abbb62582835e10accb916106a991908190918252602082015260400190565b60405180910390a350506003805460010190555050565b5f805f6106cd85856106e4565b915091506106da81610726565b5090505b92915050565b5f808251604103610718576020830151604084015160608501515f1a61070c87828585610872565b9450945050505061071f565b505f905060025b9250929050565b5f81600481111561073957610739610a26565b036107415750565b600181600481111561075557610755610a26565b036107a25760405162461bcd60e51b815260206004820152601860248201527f45434453413a20696e76616c6964207369676e61747572650000000000000000604482015260640161029c565b60028160048111156107b6576107b6610a26565b036108035760405162461bcd60e51b815260206004820152601f60248201527f45434453413a20696e76616c6964207369676e6174757265206c656e67746800604482015260640161029c565b600381600481111561081757610817610a26565b0361086f5760405162461bcd60e51b815260206004820152602260248201527f45434453413a20696e76616c6964207369676e6174757265202773272076616c604482015261756560f01b606482015260840161029c565b50565b5f807f7fffffffffffffffffffffffffffffff5d576e7357a4501ddfe92f46681b20a08311156108a757505f90506003610926565b604080515f8082526020820180845289905260ff881692820192909252606081018690526080810185905260019060a0016020604051602081039080840390855afa1580156108f8573d5f803e3d5ffd5b5050604051601f1901519150506001600160a01b038116610920575f60019250925050610926565b91505f90505b94509492505050565b5f6020828403121561093f575f80fd5b5035919050565b5f60208284031215610956575f80fd5b81356001600160a01b038116811461096c575f80fd5b9392505050565b5f805f60408486031215610985575f80fd5b83359250602084013567ffffffffffffffff808211156109a3575f80fd5b818601915086601f8301126109b6575f80fd5b8135818111156109c4575f80fd5b8760208285010111156109d5575f80fd5b6020830194508093505050509250925092565b634e487b7160e01b5f52601160045260245ffd5b808201808211156106de576106de6109e8565b80820281158282048414176106de576106de6109e8565b634e487b7160e01b5f52602160045260245ffdfea2646970667358221220e84901c172b7dfd718187a7f8512ee8f7a68f2427a6bbff1edc9567c8fd0de4564736f6c63430008150033

0x6080604052600436106100a5575f3560e01c806388c2cde61161006257806388c2cde61461019e5780638d859f3e146101b3578063902d55a5146101c857806391b7f5ed146101dc578063c884ef83146101fb578063df49a47214610239575f80fd5b80630bb862d1146100a957806322c168b1146100ca57806332cb6b0c146100f257806351b96d92146101255780635af4fdab14610158578063603d79411461018b575b5f80fd5b3480156100b4575f80fd5b506100c86100c336600461092f565b610258565b005b3480156100d5575f80fd5b506100df60035481565b6040519081526020015b60405180910390f35b3480156100fd575f80fd5b506100df7f000000000000000000000000000000000000000000000000000000000000271081565b348015610130575f80fd5b506100df7f000000000000000000000000000000000000000000000000000000000000004581565b348015610163575f80fd5b506100df7f000000000000000000000000000000000000000000000000000000000000037881565b6100c861019936600461092f565b6102aa565b3480156101a9575f80fd5b506100df60025481565b3480156101be575f80fd5b506100df60015481565b3480156101d3575f80fd5b506100df5f5481565b3480156101e7575f80fd5b506100c86101f636600461092f565b610474565b348015610206575f80fd5b50610229610215366004610946565b60056020525f908152604090205460ff1681565b60405190151581526020016100e9565b348015610244575f80fd5b506100c8610253366004610973565b6104c1565b6004546001600160a01b031633146102a55760405162461bcd60e51b815260206004820152600b60248201526a4f6e6c794f776e6572282960a81b60448201526064015b60405180910390fd5b600255565b6002546001146102cd5760405163589ed34b60e01b815260040160405180910390fd5b7f0000000000000000000000000000000000000000000000000000000000002710815f546102fb91906109fc565b118061032657507f000000000000000000000000000000000000000000000000000000000000004581115b1561034457604051639e0456c360e01b815260040160405180910390fd5b7f00000000000000000000000000000000000000000000000000000000000027105f54036103855760405163d05cb60960e01b815260040160405180910390fd5b34600154826103949190610a0f565b10156103b357604051632a9ffab760e21b815260040160405180910390fd5b5f805482810182556004546040519192916001600160a01b039091169034908381818185875af1925050503d805f8114610408576040519150601f19603f3d011682016040523d82523d5f602084013e61040d565b606091505b505090508061042f576040516312171d8360e31b815260040160405180910390fd5b5f54604080518481526020810192909252849133917fb4c03061fb5b7fed76389d5af8f2e0ddb09f8c70d1333abbb62582835e10accb910160405180910390a3505050565b6004546001600160a01b031633146104bc5760405162461bcd60e51b815260206004820152600b60248201526a4f6e6c794f776e6572282960a81b604482015260640161029c565b600155565b335f9081526005602052604090205460ff16156104f157604051630c8d9eab60e31b815260040160405180910390fd5b7f00000000000000000000000000000000000000000000000000000000000027105f54600161052091906109fc565b118061055957507f0000000000000000000000000000000000000000000000000000000000000378600354600161055791906109fc565b115b1561057757604051639e0456c360e01b815260040160405180910390fd5b604080513360208201529081018490525f9060600160408051808303601f1901815291905280516020909101206004547f19457468657265756d205369676e6564204d6573736167653a0a3332000000005f908152601c839052603c90209192506001600160a01b0316906106219085858080601f0160208091040260200160405190810160405280939291908181526020018383808284375f920191909152506106c092505050565b6001600160a01b0316146106485760405163a4513f6560e01b815260040160405180910390fd5b335f81815260056020526040808220805460ff19166001908117909155825480820190935590519092917fb4c03061fb5b7fed76389d5af8f2e0ddb09f8c70d1333abbb62582835e10accb916106a991908190918252602082015260400190565b60405180910390a350506003805460010190555050565b5f805f6106cd85856106e4565b915091506106da81610726565b5090505b92915050565b5f808251604103610718576020830151604084015160608501515f1a61070c87828585610872565b9450945050505061071f565b505f905060025b9250929050565b5f81600481111561073957610739610a26565b036107415750565b600181600481111561075557610755610a26565b036107a25760405162461bcd60e51b815260206004820152601860248201527f45434453413a20696e76616c6964207369676e61747572650000000000000000604482015260640161029c565b60028160048111156107b6576107b6610a26565b036108035760405162461bcd60e51b815260206004820152601f60248201527f45434453413a20696e76616c6964207369676e6174757265206c656e67746800604482015260640161029c565b600381600481111561081757610817610a26565b0361086f5760405162461bcd60e51b815260206004820152602260248201527f45434453413a20696e76616c6964207369676e6174757265202773272076616c604482015261756560f01b606482015260840161029c565b50565b5f807f7fffffffffffffffffffffffffffffff5d576e7357a4501ddfe92f46681b20a08311156108a757505f90506003610926565b604080515f8082526020820180845289905260ff881692820192909252606081018690526080810185905260019060a0016020604051602081039080840390855afa1580156108f8573d5f803e3d5ffd5b5050604051601f1901519150506001600160a01b038116610920575f60019250925050610926565b91505f90505b94509492505050565b5f6020828403121561093f575f80fd5b5035919050565b5f60208284031215610956575f80fd5b81356001600160a01b038116811461096c575f80fd5b9392505050565b5f805f60408486031215610985575f80fd5b83359250602084013567ffffffffffffffff808211156109a3575f80fd5b818601915086601f8301126109b6575f80fd5b8135818111156109c4575f80fd5b8760208285010111156109d5575f80fd5b6020830194508093505050509250925092565b634e487b7160e01b5f52601160045260245ffd5b808201808211156106de576106de6109e8565b80820281158282048414176106de576106de6109e8565b634e487b7160e01b5f52602160045260245ffdfea2646970667358221220e84901c172b7dfd718187a7f8512ee8f7a68f2427a6bbff1edc9567c8fd0de4564736f6c63430008150033

26738:2573:0:-:0;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;27648:105;;;;;;;;;;-1:-1:-1;27648:105:0;;;;;:::i;:::-;;:::i;:::-;;27320:31;;;;;;;;;;;;;;;;;;;345:25:1;;;333:2;318:18;27320:31:0;;;;;;;;27185:44;;;;;;;;;;;;;;;27236:41;;;;;;;;;;;;;;;27358:47;;;;;;;;;;;;;;;27855:682;;;;;;:::i;:::-;;:::i;27284:29::-;;;;;;;;;;;;;;;;27140:38;;;;;;;;;;;;;;;;27099:34;;;;;;;;;;;;;;;;27761:86;;;;;;;;;;-1:-1:-1;27761:86:0;;;;;:::i;:::-;;:::i;27436:40::-;;;;;;;;;;-1:-1:-1;27436:40:0;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;837:14:1;;830:22;812:41;;800:2;785:18;27436:40:0;672:187:1;28545:763:0;;;;;;;;;;-1:-1:-1;28545:763:0;;;;;:::i;:::-;;:::i;27648:105::-;27539:5;;-1:-1:-1;;;;;27539:5:0;27525:10;:19;27517:43;;;;-1:-1:-1;;;27517:43:0;;1730:2:1;27517:43:0;;;1712:21:1;1769:2;1749:18;;;1742:30;-1:-1:-1;;;1788:18:1;;;1781:41;1839:18;;27517:43:0;;;;;;;;;27721:10:::1;:24:::0;27648:105::o;27855:682::-;27926:10;;27940:1;27926:15;27922:45;;27952:12;;-1:-1:-1;;;27952:12:0;;;;;;;;;;;27922:45;28007:10;27997:6;27982:12;;:21;;;;:::i;:::-;27981:36;:73;;;;28043:11;28034:6;:20;27981:73;27977:110;;;28065:19;;-1:-1:-1;;;28065:19:0;;;;;;;;;;;27977:110;28117:10;28101:12;;:26;28097:62;;28138:18;;-1:-1:-1;;;28138:18:0;;;;;;;;;;;28097:62;28192:9;28183:5;;28174:6;:14;;;;:::i;:::-;28173:28;28169:60;;;28212:14;;-1:-1:-1;;;28212:14:0;;;;;;;;;;;28169:60;28241:15;28259:12;;28307:22;;;;;28379:5;;28371:41;;28259:12;;28241:15;-1:-1:-1;;;;;28379:5:0;;;;28398:9;;28241:15;28371:41;28241:15;28371:41;28398:9;28379:5;28371:41;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;28353:59;;;28428:7;28423:42;;28446:16;;-1:-1:-1;;;28446:16:0;;;;;;;;;;;28423:42;28516:12;;28482:47;;;2687:25:1;;;2743:2;2728:18;;2721:34;;;;28499:6:0;;28487:10;;28482:47;;2660:18:1;28482:47:0;;;;;;;27911:626;;27855:682;:::o;27761:86::-;27539:5;;-1:-1:-1;;;;;27539:5:0;27525:10;:19;27517:43;;;;-1:-1:-1;;;27517:43:0;;1730:2:1;27517:43:0;;;1712:21:1;1769:2;1749:18;;;1742:30;-1:-1:-1;;;1788:18:1;;;1781:41;1839:18;;27517:43:0;1528:335:1;27517:43:0;27825:5:::1;:14:::0;27761:86::o;28545:763::-;28637:10;28629:19;;;;:7;:19;;;;;;;;28625:53;;;28659:16;;-1:-1:-1;;;28659:16:0;;;;;;;;;;;28625:53;28713:10;28693:12;;28708:1;28693:16;;;;:::i;:::-;28692:31;:85;;;;28761:16;28741:12;;28756:1;28741:16;;;;:::i;:::-;28740:37;28692:85;28688:122;;;28788:19;;-1:-1:-1;;;28788:19:0;;;;;;;;;;;28688:122;28864:29;;;28875:10;28864:29;;;2940:51:1;3007:18;;;3000:34;;;28822:15:0;;2913:18:1;;28864:29:0;;;;;;-1:-1:-1;;28864:29:0;;;;;;28840:64;;28864:29;28840:64;;;;29049:5;;24888:34;24683:15;24875:48;;;24944:4;24937:18;;;24996:4;24980:21;;28840:64;;-1:-1:-1;;;;;;29049:5:0;;28933:112;;29021:9;;28933:112;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;-1:-1:-1;28933:13:0;;-1:-1:-1;;;28933:112:0:i;:::-;-1:-1:-1;;;;;28933:121:0;;28915:207;;29088:22;;-1:-1:-1;;;29088:22:0;;;;;;;;;;;28915:207;29142:10;29134:19;;;;:7;:19;;;;;;:26;;-1:-1:-1;;29134:26:0;29156:4;29134:26;;;;;;29231:12;;29245:14;;;;;;29211:49;;29156:4;;29142:10;29211:49;;;;29231:12;;;2687:25:1;;;2743:2;2728:18;;2721:34;2675:2;2660:18;;2513:248;29211:49:0;;;;;;;;-1:-1:-1;;29275:12:0;:14;;;;;;-1:-1:-1;;28545:763:0:o;21078:231::-;21156:7;21177:17;21196:18;21218:27;21229:4;21235:9;21218:10;:27::i;:::-;21176:69;;;;21256:18;21268:5;21256:11;:18::i;:::-;-1:-1:-1;21292:9:0;-1:-1:-1;21078:231:0;;;;;:::o;19529:747::-;19610:7;19619:12;19648:9;:16;19668:2;19648:22;19644:625;;19992:4;19977:20;;19971:27;20042:4;20027:20;;20021:27;20100:4;20085:20;;20079:27;19687:9;20071:36;20143:25;20154:4;20071:36;19971:27;20021;20143:10;:25::i;:::-;20136:32;;;;;;;;;19644:625;-1:-1:-1;20217:1:0;;-1:-1:-1;20221:35:0;19644:625;19529:747;;;;;:::o;17922:521::-;18000:20;17991:5;:29;;;;;;;;:::i;:::-;;17987:449;;17922:521;:::o;17987:449::-;18098:29;18089:5;:38;;;;;;;;:::i;:::-;;18085:351;;18144:34;;-1:-1:-1;;;18144:34:0;;3379:2:1;18144:34:0;;;3361:21:1;3418:2;3398:18;;;3391:30;3457:26;3437:18;;;3430:54;3501:18;;18144:34:0;3177:348:1;18085:351:0;18209:35;18200:5;:44;;;;;;;;:::i;:::-;;18196:240;;18261:41;;-1:-1:-1;;;18261:41:0;;3732:2:1;18261:41:0;;;3714:21:1;3771:2;3751:18;;;3744:30;3810:33;3790:18;;;3783:61;3861:18;;18261:41:0;3530:355:1;18196:240:0;18333:30;18324:5;:39;;;;;;;;:::i;:::-;;18320:116;;18380:44;;-1:-1:-1;;;18380:44:0;;4092:2:1;18380:44:0;;;4074:21:1;4131:2;4111:18;;;4104:30;4170:34;4150:18;;;4143:62;-1:-1:-1;;;4221:18:1;;;4214:32;4263:19;;18380:44:0;3890:398:1;18320:116:0;17922:521;:::o;22462:1477::-;22550:7;;23484:66;23471:79;;23467:163;;;-1:-1:-1;23583:1:0;;-1:-1:-1;23587:30:0;23567:51;;23467:163;23744:24;;;23727:14;23744:24;;;;;;;;;4520:25:1;;;4593:4;4581:17;;4561:18;;;4554:45;;;;4615:18;;;4608:34;;;4658:18;;;4651:34;;;23744:24:0;;4492:19:1;;23744:24:0;;;;;;;;;;;;;;;;;;;;;;;;;;;-1:-1:-1;;23744:24:0;;-1:-1:-1;;23744:24:0;;;-1:-1:-1;;;;;;;23783:20:0;;23779:103;;23836:1;23840:29;23820:50;;;;;;;23779:103;23902:6;-1:-1:-1;23910:20:0;;-1:-1:-1;22462:1477:0;;;;;;;;:::o;14:180:1:-;73:6;126:2;114:9;105:7;101:23;97:32;94:52;;;142:1;139;132:12;94:52;-1:-1:-1;165:23:1;;14:180;-1:-1:-1;14:180:1:o;381:286::-;440:6;493:2;481:9;472:7;468:23;464:32;461:52;;;509:1;506;499:12;461:52;535:23;;-1:-1:-1;;;;;587:31:1;;577:42;;567:70;;633:1;630;623:12;567:70;656:5;381:286;-1:-1:-1;;;381:286:1:o;864:659::-;943:6;951;959;1012:2;1000:9;991:7;987:23;983:32;980:52;;;1028:1;1025;1018:12;980:52;1064:9;1051:23;1041:33;;1125:2;1114:9;1110:18;1097:32;1148:18;1189:2;1181:6;1178:14;1175:34;;;1205:1;1202;1195:12;1175:34;1243:6;1232:9;1228:22;1218:32;;1288:7;1281:4;1277:2;1273:13;1269:27;1259:55;;1310:1;1307;1300:12;1259:55;1350:2;1337:16;1376:2;1368:6;1365:14;1362:34;;;1392:1;1389;1382:12;1362:34;1437:7;1432:2;1423:6;1419:2;1415:15;1411:24;1408:37;1405:57;;;1458:1;1455;1448:12;1405:57;1489:2;1485;1481:11;1471:21;;1511:6;1501:16;;;;;864:659;;;;;:::o;1868:127::-;1929:10;1924:3;1920:20;1917:1;1910:31;1960:4;1957:1;1950:15;1984:4;1981:1;1974:15;2000:125;2065:9;;;2086:10;;;2083:36;;;2099:18;;:::i;2130:168::-;2203:9;;;2234;;2251:15;;;2245:22;;2231:37;2221:71;;2272:18;;:::i;3045:127::-;3106:10;3101:3;3097:20;3094:1;3087:31;3137:4;3134:1;3127:15;3161:4;3158:1;3151:15

ipfs://e84901c172b7dfd718187a7f8512ee8f7a68f2427a6bbff1edc9567c8fd0de45