Contract Source Code (Solidity Standard Json-Input format)

IDE

• Blockscan IDE
• 🤖 Code ReaderBeta

More Options

• Similar
• Submit Audit
• Compare

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

import "openzeppelin-contracts/contracts/utils/cryptography/EIP712.sol";
import "openzeppelin-contracts/contracts/utils/cryptography/ECDSA.sol";

// Unused.
interface IMetadataRenderer {

}

interface IERC721Drop {
    function adminMint(address to, uint256 quantity) external returns (uint256);

    function hasRole(
        bytes32 role,
        address account
    ) external view returns (bool);

    /// @notice General configuration for NFT Minting and bookkeeping
    struct Configuration {
        /// @dev Metadata renderer (uint160)
        IMetadataRenderer metadataRenderer;
        /// @dev Total size of edition that can be minted (uint160+64 = 224)
        uint64 editionSize;
        /// @dev Royalty amount in bps (uint224+16 = 240)
        uint16 royaltyBPS;
        /// @dev Funds recipient for sale (new slot, uint160)
        address payable fundsRecipient;
    }

    function config() external view returns (Configuration memory);
}

interface IMirrorSignatureMinter {
    struct MintRequest {
        address token;
        address to;
        uint256 pricePerToken;
        uint128 validityStartTimestamp;
        uint128 validityEndTimestamp;
        bytes32 uid;
    }

    function signer() external view returns (address);

    function feeRecipient() external view returns (address);

    function zoraFeeRecipient() external view returns (address);

    function fee() external view returns (uint256);

    function mintWithSignature(
        MintRequest calldata req,
        bytes memory signature
    ) external payable;

    event Minted(
        address indexed token,
        address indexed to,
        uint256 pricePerToken,
        uint128 validityStartTimestamp,
        uint128 validityEndTimestamp,
        bytes32 uid
    );

    event SignerSet(address indexed signer);

    event FeeSet(uint256 indexed fee);

    event FeeRecipientSet(address indexed feeRecipient);

    event ZoraFeeRecipientSet(address indexed feeRecipient);
}

contract MirrorSignatureMinter is IMirrorSignatureMinter, EIP712 {
    bytes32 public constant TYPEHASH =
        keccak256(
            "MintRequest(address token,address to,uint256 pricePerToken,uint128 validityStartTimestamp,uint128 validityEndTimestamp,bytes32 uid)"
        );

    address public immutable override signer;

    address public immutable override feeRecipient;

    address public immutable override zoraFeeRecipient;

    uint256 public immutable override fee;

    bytes32 public immutable MINTER_ROLE = keccak256("MINTER");

    mapping(bytes32 => bool) public usedHashes;

    constructor(
        address _signer,
        uint256 _fee,
        address _feeRecipient,
        address _zoraFeeRecipient
    ) EIP712("MirrorSignatureMinter", "1") {
        signer = _signer;
        emit SignerSet(_signer);

        fee = _fee;
        emit FeeSet(_fee);

        feeRecipient = _feeRecipient;
        emit FeeRecipientSet(_feeRecipient);

        zoraFeeRecipient = _zoraFeeRecipient;
        emit ZoraFeeRecipientSet(_zoraFeeRecipient);
    }

    function mintWithSignature(
        MintRequest calldata req,
        bytes memory signature
    ) public payable override {
        // Verify that the price and value are correct.
        require(msg.value == req.pricePerToken + fee, "insufficient funds");

        // Verify that the timestamp is valid.
        require(
            req.validityStartTimestamp <= block.timestamp &&
                req.validityEndTimestamp >= block.timestamp,
            "minting closed"
        );

        // Verify signature is valid.
        require(isValid(req, signature), "invalid signature.");

        // Store the hash of the signed message to prevent replay attacks.
        usedHashes[req.uid] = true;

        // Mint tokens.
        IERC721Drop(req.token).adminMint(req.to, 1);

        emit Minted(
            req.token,
            req.to,
            req.pricePerToken,
            req.validityStartTimestamp,
            req.validityEndTimestamp,
            req.uid
        );

        // Send funds.
        if (req.pricePerToken > 0) {
            IERC721Drop.Configuration memory config = IERC721Drop(req.token)
                .config();
            _sendEther(config.fundsRecipient, req.pricePerToken);
        }

        // Send fees.
        _sendEther(payable(feeRecipient), 0.00069 ether);
        _sendEther(payable(zoraFeeRecipient), 0.000777 ether);
    }

    function isValid(
        MintRequest calldata req,
        bytes memory signature
    ) public view returns (bool) {
        // Verify that the uid of the signed message has not been used.
        if (usedHashes[req.uid]) {
            return false;
        }

        bytes32 digest = getDigest(req);

        // Verify signature is valid.
        return
            signer != address(0) && ECDSA.recover(digest, signature) == signer;
    }

    function getDigest(MintRequest calldata req) public view returns (bytes32) {
        return
            _hashTypedDataV4(
                keccak256(
                    abi.encode(
                        TYPEHASH,
                        req.token,
                        req.to,
                        req.pricePerToken,
                        req.validityStartTimestamp,
                        req.validityEndTimestamp,
                        req.uid
                    )
                )
            );
    }

    function _sendEther(address payable recipient, uint256 amount) internal {
        // Ensure sufficient balance.
        require(address(this).balance >= amount, "insufficient balance");

        // Send the value.
        // slither-disable-next-line low-level-calls
        (bool success, ) = recipient.call{value: amount, gas: gasleft()}("");

        require(success, "recipient reverted");
    }
}

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

pragma solidity ^0.8.0;

import "./ECDSA.sol";

/**
 * @dev https://eips.ethereum.org/EIPS/eip-712[EIP 712] is a standard for hashing and signing of typed structured data.
 *
 * The encoding specified in the EIP is very generic, and such a generic implementation in Solidity is not feasible,
 * thus this contract does not implement the encoding itself. Protocols need to implement the type-specific encoding
 * they need in their contracts using a combination of `abi.encode` and `keccak256`.
 *
 * This contract implements the EIP 712 domain separator ({_domainSeparatorV4}) that is used as part of the encoding
 * scheme, and the final step of the encoding to obtain the message digest that is then signed via ECDSA
 * ({_hashTypedDataV4}).
 *
 * The implementation of the domain separator was designed to be as efficient as possible while still properly updating
 * the chain id to protect against replay attacks on an eventual fork of the chain.
 *
 * NOTE: This contract implements the version of the encoding known as "v4", as implemented by the JSON RPC method
 * https://docs.metamask.io/guide/signing-data.html[`eth_signTypedDataV4` in MetaMask].
 *
 * _Available since v3.4._
 */
abstract contract EIP712 {
    /* solhint-disable var-name-mixedcase */
    // Cache the domain separator as an immutable value, but also store the chain id that it corresponds to, in order to
    // invalidate the cached domain separator if the chain id changes.
    bytes32 private immutable _CACHED_DOMAIN_SEPARATOR;
    uint256 private immutable _CACHED_CHAIN_ID;
    address private immutable _CACHED_THIS;

    bytes32 private immutable _HASHED_NAME;
    bytes32 private immutable _HASHED_VERSION;
    bytes32 private immutable _TYPE_HASH;

    /* solhint-enable var-name-mixedcase */

    /**
     * @dev Initializes the domain separator and parameter caches.
     *
     * The meaning of `name` and `version` is specified in
     * https://eips.ethereum.org/EIPS/eip-712#definition-of-domainseparator[EIP 712]:
     *
     * - `name`: the user readable name of the signing domain, i.e. the name of the DApp or the protocol.
     * - `version`: the current major version of the signing domain.
     *
     * NOTE: These parameters cannot be changed except through a xref:learn::upgrading-smart-contracts.adoc[smart
     * contract upgrade].
     */
    constructor(string memory name, string memory version) {
        bytes32 hashedName = keccak256(bytes(name));
        bytes32 hashedVersion = keccak256(bytes(version));
        bytes32 typeHash = keccak256(
            "EIP712Domain(string name,string version,uint256 chainId,address verifyingContract)"
        );
        _HASHED_NAME = hashedName;
        _HASHED_VERSION = hashedVersion;
        _CACHED_CHAIN_ID = block.chainid;
        _CACHED_DOMAIN_SEPARATOR = _buildDomainSeparator(typeHash, hashedName, hashedVersion);
        _CACHED_THIS = address(this);
        _TYPE_HASH = typeHash;
    }

    /**
     * @dev Returns the domain separator for the current chain.
     */
    function _domainSeparatorV4() internal view returns (bytes32) {
        if (address(this) == _CACHED_THIS && block.chainid == _CACHED_CHAIN_ID) {
            return _CACHED_DOMAIN_SEPARATOR;
        } else {
            return _buildDomainSeparator(_TYPE_HASH, _HASHED_NAME, _HASHED_VERSION);
        }
    }

    function _buildDomainSeparator(
        bytes32 typeHash,
        bytes32 nameHash,
        bytes32 versionHash
    ) private view returns (bytes32) {
        return keccak256(abi.encode(typeHash, nameHash, versionHash, block.chainid, address(this)));
    }

    /**
     * @dev Given an already https://eips.ethereum.org/EIPS/eip-712#definition-of-hashstruct[hashed struct], this
     * function returns the hash of the fully encoded EIP712 message for this domain.
     *
     * This hash can be used together with {ECDSA-recover} to obtain the signer of a message. For example:
     *
     * ```solidity
     * bytes32 digest = _hashTypedDataV4(keccak256(abi.encode(
     *     keccak256("Mail(address to,string contents)"),
     *     mailTo,
     *     keccak256(bytes(mailContents))
     * )));
     * address signer = ECDSA.recover(digest, signature);
     * ```
     */
    function _hashTypedDataV4(bytes32 structHash) internal view virtual returns (bytes32) {
        return ECDSA.toTypedDataHash(_domainSeparatorV4(), structHash);
    }
}

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

pragma solidity ^0.8.0;

import "../Strings.sol";

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

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

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

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

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

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

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

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

        return (signer, RecoverError.NoError);
    }

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

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

    /**
     * @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) {
        return keccak256(abi.encodePacked("\x19\x01", domainSeparator, structHash));
    }
}

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

pragma solidity ^0.8.0;

import "./math/Math.sol";

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

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

    /**
     * @dev Converts a `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);
    }
}

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

pragma solidity ^0.8.0;

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

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

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

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

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

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

            // Handle non-overflow cases, 256 by 256 division.
            if (prod1 == 0) {
                return prod0 / denominator;
            }

            // Make sure the result is less than 2^256. Also prevents denominator == 0.
            require(denominator > prod1);

            ///////////////////////////////////////////////
            // 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 10, 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 * 8) < value ? 1 : 0);
        }
    }
}

{
  "remappings": [
    "ds-test/=lib/forge-std/lib/ds-test/src/",
    "forge-std/=lib/forge-std/src/",
    "openzeppelin-contracts/=lib/openzeppelin-contracts/"
  ],
  "optimizer": {
    "enabled": true,
    "runs": 200
  },
  "metadata": {
    "bytecodeHash": "ipfs"
  },
  "outputSelection": {
    "*": {
      "*": [
        "evm.bytecode",
        "evm.deployedBytecode",
        "devdoc",
        "userdoc",
        "metadata",
        "abi"
      ]
    }
  },
  "evmVersion": "london",
  "libraries": {}
}

• No Contract Security Audit Submitted- Submit Audit Here

[{"inputs":[{"internalType":"address","name":"_signer","type":"address"},{"internalType":"uint256","name":"_fee","type":"uint256"},{"internalType":"address","name":"_feeRecipient","type":"address"},{"internalType":"address","name":"_zoraFeeRecipient","type":"address"}],"stateMutability":"nonpayable","type":"constructor"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"feeRecipient","type":"address"}],"name":"FeeRecipientSet","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"uint256","name":"fee","type":"uint256"}],"name":"FeeSet","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"token","type":"address"},{"indexed":true,"internalType":"address","name":"to","type":"address"},{"indexed":false,"internalType":"uint256","name":"pricePerToken","type":"uint256"},{"indexed":false,"internalType":"uint128","name":"validityStartTimestamp","type":"uint128"},{"indexed":false,"internalType":"uint128","name":"validityEndTimestamp","type":"uint128"},{"indexed":false,"internalType":"bytes32","name":"uid","type":"bytes32"}],"name":"Minted","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"signer","type":"address"}],"name":"SignerSet","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"feeRecipient","type":"address"}],"name":"ZoraFeeRecipientSet","type":"event"},{"inputs":[],"name":"MINTER_ROLE","outputs":[{"internalType":"bytes32","name":"","type":"bytes32"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"TYPEHASH","outputs":[{"internalType":"bytes32","name":"","type":"bytes32"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"fee","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"feeRecipient","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"components":[{"internalType":"address","name":"token","type":"address"},{"internalType":"address","name":"to","type":"address"},{"internalType":"uint256","name":"pricePerToken","type":"uint256"},{"internalType":"uint128","name":"validityStartTimestamp","type":"uint128"},{"internalType":"uint128","name":"validityEndTimestamp","type":"uint128"},{"internalType":"bytes32","name":"uid","type":"bytes32"}],"internalType":"struct IMirrorSignatureMinter.MintRequest","name":"req","type":"tuple"}],"name":"getDigest","outputs":[{"internalType":"bytes32","name":"","type":"bytes32"}],"stateMutability":"view","type":"function"},{"inputs":[{"components":[{"internalType":"address","name":"token","type":"address"},{"internalType":"address","name":"to","type":"address"},{"internalType":"uint256","name":"pricePerToken","type":"uint256"},{"internalType":"uint128","name":"validityStartTimestamp","type":"uint128"},{"internalType":"uint128","name":"validityEndTimestamp","type":"uint128"},{"internalType":"bytes32","name":"uid","type":"bytes32"}],"internalType":"struct IMirrorSignatureMinter.MintRequest","name":"req","type":"tuple"},{"internalType":"bytes","name":"signature","type":"bytes"}],"name":"isValid","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[{"components":[{"internalType":"address","name":"token","type":"address"},{"internalType":"address","name":"to","type":"address"},{"internalType":"uint256","name":"pricePerToken","type":"uint256"},{"internalType":"uint128","name":"validityStartTimestamp","type":"uint128"},{"internalType":"uint128","name":"validityEndTimestamp","type":"uint128"},{"internalType":"bytes32","name":"uid","type":"bytes32"}],"internalType":"struct IMirrorSignatureMinter.MintRequest","name":"req","type":"tuple"},{"internalType":"bytes","name":"signature","type":"bytes"}],"name":"mintWithSignature","outputs":[],"stateMutability":"payable","type":"function"},{"inputs":[],"name":"signer","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"bytes32","name":"","type":"bytes32"}],"name":"usedHashes","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"zoraFeeRecipient","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"}]

6101e06040527ff0887ba65ee2024ea881d91b74c2450ef19e1557f03bed3ea9f16b037cbe2dc96101c05234801561003657600080fd5b5060405161128138038061128183398101604081905261005591610257565b604080518082018252601581527f4d6972726f725369676e61747572654d696e74657200000000000000000000006020808301918252835180850190945260018452603160f81b908401528151902060e08190527fc89efdaa54c0f20c7adf612882df0950f5a951637e0307cdcb4c672f298b8bc66101008190524660a0529192917f8b73c3c69bb8fe3d512ecc4cf759cc79239f7b179b0ffacaa9a75d522b39400f6101478184846040805160208101859052908101839052606081018290524660808201523060a082015260009060c0016040516020818303038152906040528051906020012090509392505050565b6080523060c05261012052505050506001600160a01b0384166101408190526040517f9eaa897564d022fb8c5efaf0acdb5d9d27b440b2aad44400b6e1c702e65b9ed390600090a26101a083905260405183907f20461e09b8e557b77e107939f9ce6544698123aad0fc964ac5cc59b7df2e608f90600090a26001600160a01b0382166101608190526040517fbf9a9534339a9d6b81696e05dcfb614b7dc518a31d48be3cfb757988381fb32390600090a26001600160a01b0381166101808190526040517ff7d383c0db8b90a2bdf9233bd12d231979283d765834156cda0081528fd41b8b90600090a2505050506102a4565b80516001600160a01b038116811461025257600080fd5b919050565b6000806000806080858703121561026d57600080fd5b6102768561023b565b93506020850151925061028b6040860161023b565b91506102996060860161023b565b905092959194509250565b60805160a05160c05160e05161010051610120516101405161016051610180516101a0516101c051610f3561034c600039600061023801526000818161026c01526102930152600081816101b401526105f401526000818161018001526105c301526000818160bd01528181610657015261068a01526000610b1701526000610b6601526000610b4101526000610a9a01526000610ac401526000610aee0152610f356000f3fe6080604052600436106100915760003560e01c80638f7c79a3116100595780638f7c79a3146101a2578063aef18bf7146101d6578063af06e19e14610206578063d539139314610226578063ddca3f431461025a57600080fd5b80631e87626014610096578063238ac933146100ab57806326f13a9b146100fc5780633b639e6f1461012c578063469048401461016e575b600080fd5b6100a96100a4366004610cd7565b61028e565b005b3480156100b757600080fd5b506100df7f000000000000000000000000000000000000000000000000000000000000000081565b6040516001600160a01b0390911681526020015b60405180910390f35b34801561010857600080fd5b5061011c610117366004610cd7565b610624565b60405190151581526020016100f3565b34801561013857600080fd5b506101607f32ca3fc87d0de225d75b91e3009304848e2ea86d27105d2af5b4c81d6b5f2e5581565b6040519081526020016100f3565b34801561017a57600080fd5b506100df7f000000000000000000000000000000000000000000000000000000000000000081565b3480156101ae57600080fd5b506100df7f000000000000000000000000000000000000000000000000000000000000000081565b3480156101e257600080fd5b5061011c6101f1366004610d80565b60006020819052908152604090205460ff1681565b34801561021257600080fd5b50610160610221366004610d99565b6106d1565b34801561023257600080fd5b506101607f000000000000000000000000000000000000000000000000000000000000000081565b34801561026657600080fd5b506101607f000000000000000000000000000000000000000000000000000000000000000081565b6102bc7f00000000000000000000000000000000000000000000000000000000000000006040840135610dbc565b34146103045760405162461bcd60e51b8152602060048201526012602482015271696e73756666696369656e742066756e647360701b60448201526064015b60405180910390fd5b426103156080840160608501610ddd565b6001600160801b03161115801561034457504261033860a0840160808501610ddd565b6001600160801b031610155b6103815760405162461bcd60e51b815260206004820152600e60248201526d1b5a5b9d1a5b99c818db1bdcd95960921b60448201526064016102fb565b61038b8282610624565b6103cc5760405162461bcd60e51b815260206004820152601260248201527134b73b30b634b21039b4b3b730ba3ab9329760711b60448201526064016102fb565b60a0820135600090815260208181526040909120805460ff191660011790556103f790830183610e1b565b6001600160a01b031663e58306f96104156040850160208601610e1b565b6040516001600160e01b031960e084901b1681526001600160a01b039091166004820152600160248201526044016020604051808303816000875af1158015610462573d6000803e3d6000fd5b505050506040513d601f19601f820116820180604052508101906104869190610e38565b506104976040830160208401610e1b565b6001600160a01b03166104ad6020840184610e1b565b6001600160a01b03167f6b49c456b8ba382bbce2acfbf44371a926e7bc8bf99393fcb0e13c76a8f1a5d960408501356104ec6080870160608801610ddd565b6104fc60a0880160808901610ddd565b604080519384526001600160801b03928316602085015291169082015260a0860135606082015260800160405180910390a36040820135156105be5760006105476020840184610e1b565b6001600160a01b03166379502c556040518163ffffffff1660e01b8152600401608060405180830381865afa158015610584573d6000803e3d6000fd5b505050506040513d601f19601f820116820180604052508101906105a89190610e51565b90506105bc816060015184604001356107a4565b505b6105ef7f00000000000000000000000000000000000000000000000000000000000000006602738d24e520006107a4565b6106207f00000000000000000000000000000000000000000000000000000000000000006602c2ad68fd90006107a4565b5050565b60a082013560009081526020819052604081205460ff1615610648575060006106cb565b6000610653846106d1565b90507f00000000000000000000000000000000000000000000000000000000000000006001600160a01b0316158015906106c757507f00000000000000000000000000000000000000000000000000000000000000006001600160a01b03166106bc8285610889565b6001600160a01b0316145b9150505b92915050565b60006106cb7f32ca3fc87d0de225d75b91e3009304848e2ea86d27105d2af5b4c81d6b5f2e556107046020850185610e1b565b6107146040860160208701610e1b565b60408601356107296080880160608901610ddd565b61073960a0890160808a01610ddd565b6040805160208101979097526001600160a01b039586169087015293909216606085015260808401526001600160801b0390811660a084810191909152911660c083015284013560e082015261010001604051602081830303815290604052805190602001206108ad565b804710156107eb5760405162461bcd60e51b8152602060048201526014602482015273696e73756666696369656e742062616c616e636560601b60448201526064016102fb565b6000826001600160a01b0316825a6040519091906000818181858888f193505050503d8060008114610839576040519150601f19603f3d011682016040523d82523d6000602084013e61083e565b606091505b50509050806108845760405162461bcd60e51b81526020600482015260126024820152711c9958da5c1a595b9d081c995d995c9d195960721b60448201526064016102fb565b505050565b600080600061089885856108fb565b915091506108a581610940565b509392505050565b60006106cb6108ba610a8d565b8360405161190160f01b6020820152602281018390526042810182905260009060620160405160208183030381529060405280519060200120905092915050565b60008082516041036109315760208301516040840151606085015160001a61092587828585610bb4565b94509450505050610939565b506000905060025b9250929050565b600081600481111561095457610954610ee9565b0361095c5750565b600181600481111561097057610970610ee9565b036109bd5760405162461bcd60e51b815260206004820152601860248201527f45434453413a20696e76616c6964207369676e6174757265000000000000000060448201526064016102fb565b60028160048111156109d1576109d1610ee9565b03610a1e5760405162461bcd60e51b815260206004820152601f60248201527f45434453413a20696e76616c6964207369676e6174757265206c656e6774680060448201526064016102fb565b6003816004811115610a3257610a32610ee9565b03610a8a5760405162461bcd60e51b815260206004820152602260248201527f45434453413a20696e76616c6964207369676e6174757265202773272076616c604482015261756560f01b60648201526084016102fb565b50565b6000306001600160a01b037f000000000000000000000000000000000000000000000000000000000000000016148015610ae657507f000000000000000000000000000000000000000000000000000000000000000046145b15610b1057507f000000000000000000000000000000000000000000000000000000000000000090565b50604080517f00000000000000000000000000000000000000000000000000000000000000006020808301919091527f0000000000000000000000000000000000000000000000000000000000000000828401527f000000000000000000000000000000000000000000000000000000000000000060608301524660808301523060a0808401919091528351808403909101815260c0909201909252805191012090565b6000807f7fffffffffffffffffffffffffffffff5d576e7357a4501ddfe92f46681b20a0831115610beb5750600090506003610c6f565b6040805160008082526020820180845289905260ff881692820192909252606081018690526080810185905260019060a0016020604051602081039080840390855afa158015610c3f573d6000803e3d6000fd5b5050604051601f1901519150506001600160a01b038116610c6857600060019250925050610c6f565b9150600090505b94509492505050565b600060c08284031215610c8a57600080fd5b50919050565b634e487b7160e01b600052604160045260246000fd5b604051601f8201601f1916810167ffffffffffffffff81118282101715610ccf57610ccf610c90565b604052919050565b60008060e08385031215610cea57600080fd5b610cf48484610c78565b915060c083013567ffffffffffffffff80821115610d1157600080fd5b818501915085601f830112610d2557600080fd5b813581811115610d3757610d37610c90565b610d4a601f8201601f1916602001610ca6565b9150808252866020828501011115610d6157600080fd5b8060208401602084013760009082016020015292959294509192505050565b600060208284031215610d9257600080fd5b5035919050565b600060c08284031215610dab57600080fd5b610db58383610c78565b9392505050565b808201808211156106cb57634e487b7160e01b600052601160045260246000fd5b600060208284031215610def57600080fd5b81356001600160801b0381168114610db557600080fd5b6001600160a01b0381168114610a8a57600080fd5b600060208284031215610e2d57600080fd5b8135610db581610e06565b600060208284031215610e4a57600080fd5b5051919050565b600060808284031215610e6357600080fd5b6040516080810167ffffffffffffffff8282108183111715610e8757610e87610c90565b8160405284519150610e9882610e06565b9082526020840151908082168214610eaf57600080fd5b506020820152604083015161ffff81168114610eca57600080fd5b60408201526060830151610edd81610e06565b60608201529392505050565b634e487b7160e01b600052602160045260246000fdfea26469706673582212208cd92161f85cdae7c2e50e07aa8fe07555349ae2b03425deb82445b7acbdd53264736f6c634300081100330000000000000000000000005be12d4b22eaa4354b3d6f636df047ab7a2a0af80000000000000000000000000000000000000000000000000005363a8de2b000000000000000000000000000ae6fdda940155d090e3a3de9b090ad6a392f761a0000000000000000000000007a810dcd0f8d83b20212326813db6ef7e9fd030c

0x6080604052600436106100915760003560e01c80638f7c79a3116100595780638f7c79a3146101a2578063aef18bf7146101d6578063af06e19e14610206578063d539139314610226578063ddca3f431461025a57600080fd5b80631e87626014610096578063238ac933146100ab57806326f13a9b146100fc5780633b639e6f1461012c578063469048401461016e575b600080fd5b6100a96100a4366004610cd7565b61028e565b005b3480156100b757600080fd5b506100df7f0000000000000000000000005be12d4b22eaa4354b3d6f636df047ab7a2a0af881565b6040516001600160a01b0390911681526020015b60405180910390f35b34801561010857600080fd5b5061011c610117366004610cd7565b610624565b60405190151581526020016100f3565b34801561013857600080fd5b506101607f32ca3fc87d0de225d75b91e3009304848e2ea86d27105d2af5b4c81d6b5f2e5581565b6040519081526020016100f3565b34801561017a57600080fd5b506100df7f000000000000000000000000ae6fdda940155d090e3a3de9b090ad6a392f761a81565b3480156101ae57600080fd5b506100df7f0000000000000000000000007a810dcd0f8d83b20212326813db6ef7e9fd030c81565b3480156101e257600080fd5b5061011c6101f1366004610d80565b60006020819052908152604090205460ff1681565b34801561021257600080fd5b50610160610221366004610d99565b6106d1565b34801561023257600080fd5b506101607ff0887ba65ee2024ea881d91b74c2450ef19e1557f03bed3ea9f16b037cbe2dc981565b34801561026657600080fd5b506101607f0000000000000000000000000000000000000000000000000005363a8de2b00081565b6102bc7f0000000000000000000000000000000000000000000000000005363a8de2b0006040840135610dbc565b34146103045760405162461bcd60e51b8152602060048201526012602482015271696e73756666696369656e742066756e647360701b60448201526064015b60405180910390fd5b426103156080840160608501610ddd565b6001600160801b03161115801561034457504261033860a0840160808501610ddd565b6001600160801b031610155b6103815760405162461bcd60e51b815260206004820152600e60248201526d1b5a5b9d1a5b99c818db1bdcd95960921b60448201526064016102fb565b61038b8282610624565b6103cc5760405162461bcd60e51b815260206004820152601260248201527134b73b30b634b21039b4b3b730ba3ab9329760711b60448201526064016102fb565b60a0820135600090815260208181526040909120805460ff191660011790556103f790830183610e1b565b6001600160a01b031663e58306f96104156040850160208601610e1b565b6040516001600160e01b031960e084901b1681526001600160a01b039091166004820152600160248201526044016020604051808303816000875af1158015610462573d6000803e3d6000fd5b505050506040513d601f19601f820116820180604052508101906104869190610e38565b506104976040830160208401610e1b565b6001600160a01b03166104ad6020840184610e1b565b6001600160a01b03167f6b49c456b8ba382bbce2acfbf44371a926e7bc8bf99393fcb0e13c76a8f1a5d960408501356104ec6080870160608801610ddd565b6104fc60a0880160808901610ddd565b604080519384526001600160801b03928316602085015291169082015260a0860135606082015260800160405180910390a36040820135156105be5760006105476020840184610e1b565b6001600160a01b03166379502c556040518163ffffffff1660e01b8152600401608060405180830381865afa158015610584573d6000803e3d6000fd5b505050506040513d601f19601f820116820180604052508101906105a89190610e51565b90506105bc816060015184604001356107a4565b505b6105ef7f000000000000000000000000ae6fdda940155d090e3a3de9b090ad6a392f761a6602738d24e520006107a4565b6106207f0000000000000000000000007a810dcd0f8d83b20212326813db6ef7e9fd030c6602c2ad68fd90006107a4565b5050565b60a082013560009081526020819052604081205460ff1615610648575060006106cb565b6000610653846106d1565b90507f0000000000000000000000005be12d4b22eaa4354b3d6f636df047ab7a2a0af86001600160a01b0316158015906106c757507f0000000000000000000000005be12d4b22eaa4354b3d6f636df047ab7a2a0af86001600160a01b03166106bc8285610889565b6001600160a01b0316145b9150505b92915050565b60006106cb7f32ca3fc87d0de225d75b91e3009304848e2ea86d27105d2af5b4c81d6b5f2e556107046020850185610e1b565b6107146040860160208701610e1b565b60408601356107296080880160608901610ddd565b61073960a0890160808a01610ddd565b6040805160208101979097526001600160a01b039586169087015293909216606085015260808401526001600160801b0390811660a084810191909152911660c083015284013560e082015261010001604051602081830303815290604052805190602001206108ad565b804710156107eb5760405162461bcd60e51b8152602060048201526014602482015273696e73756666696369656e742062616c616e636560601b60448201526064016102fb565b6000826001600160a01b0316825a6040519091906000818181858888f193505050503d8060008114610839576040519150601f19603f3d011682016040523d82523d6000602084013e61083e565b606091505b50509050806108845760405162461bcd60e51b81526020600482015260126024820152711c9958da5c1a595b9d081c995d995c9d195960721b60448201526064016102fb565b505050565b600080600061089885856108fb565b915091506108a581610940565b509392505050565b60006106cb6108ba610a8d565b8360405161190160f01b6020820152602281018390526042810182905260009060620160405160208183030381529060405280519060200120905092915050565b60008082516041036109315760208301516040840151606085015160001a61092587828585610bb4565b94509450505050610939565b506000905060025b9250929050565b600081600481111561095457610954610ee9565b0361095c5750565b600181600481111561097057610970610ee9565b036109bd5760405162461bcd60e51b815260206004820152601860248201527f45434453413a20696e76616c6964207369676e6174757265000000000000000060448201526064016102fb565b60028160048111156109d1576109d1610ee9565b03610a1e5760405162461bcd60e51b815260206004820152601f60248201527f45434453413a20696e76616c6964207369676e6174757265206c656e6774680060448201526064016102fb565b6003816004811115610a3257610a32610ee9565b03610a8a5760405162461bcd60e51b815260206004820152602260248201527f45434453413a20696e76616c6964207369676e6174757265202773272076616c604482015261756560f01b60648201526084016102fb565b50565b6000306001600160a01b037f000000000000000000000000ef566f012080371d0facb933b81a2dbc9a59839616148015610ae657507f000000000000000000000000000000000000000000000000000000000000000a46145b15610b1057507f2ec599b9a40c8f967656395b3b4849105c57d9adc2c333716a6b766596c3631790565b50604080517f8b73c3c69bb8fe3d512ecc4cf759cc79239f7b179b0ffacaa9a75d522b39400f6020808301919091527f8d149344e10826b516726d24ab17914e11ff9b455e7e5e0084111f464135463a828401527fc89efdaa54c0f20c7adf612882df0950f5a951637e0307cdcb4c672f298b8bc660608301524660808301523060a0808401919091528351808403909101815260c0909201909252805191012090565b6000807f7fffffffffffffffffffffffffffffff5d576e7357a4501ddfe92f46681b20a0831115610beb5750600090506003610c6f565b6040805160008082526020820180845289905260ff881692820192909252606081018690526080810185905260019060a0016020604051602081039080840390855afa158015610c3f573d6000803e3d6000fd5b5050604051601f1901519150506001600160a01b038116610c6857600060019250925050610c6f565b9150600090505b94509492505050565b600060c08284031215610c8a57600080fd5b50919050565b634e487b7160e01b600052604160045260246000fd5b604051601f8201601f1916810167ffffffffffffffff81118282101715610ccf57610ccf610c90565b604052919050565b60008060e08385031215610cea57600080fd5b610cf48484610c78565b915060c083013567ffffffffffffffff80821115610d1157600080fd5b818501915085601f830112610d2557600080fd5b813581811115610d3757610d37610c90565b610d4a601f8201601f1916602001610ca6565b9150808252866020828501011115610d6157600080fd5b8060208401602084013760009082016020015292959294509192505050565b600060208284031215610d9257600080fd5b5035919050565b600060c08284031215610dab57600080fd5b610db58383610c78565b9392505050565b808201808211156106cb57634e487b7160e01b600052601160045260246000fd5b600060208284031215610def57600080fd5b81356001600160801b0381168114610db557600080fd5b6001600160a01b0381168114610a8a57600080fd5b600060208284031215610e2d57600080fd5b8135610db581610e06565b600060208284031215610e4a57600080fd5b5051919050565b600060808284031215610e6357600080fd5b6040516080810167ffffffffffffffff8282108183111715610e8757610e87610c90565b8160405284519150610e9882610e06565b9082526020840151908082168214610eaf57600080fd5b506020820152604083015161ffff81168114610eca57600080fd5b60408201526060830151610edd81610e06565b60608201529392505050565b634e487b7160e01b600052602160045260246000fdfea26469706673582212208cd92161f85cdae7c2e50e07aa8fe07555349ae2b03425deb82445b7acbdd53264736f6c63430008110033

0000000000000000000000005be12d4b22eaa4354b3d6f636df047ab7a2a0af80000000000000000000000000000000000000000000000000005363a8de2b000000000000000000000000000ae6fdda940155d090e3a3de9b090ad6a392f761a0000000000000000000000007a810dcd0f8d83b20212326813db6ef7e9fd030c

-----Decoded View---------------
Arg [0] : _signer (address): 0x5bE12d4b22EAa4354b3D6F636df047AB7A2A0aF8
Arg [1] : _fee (uint256): 1467000000000000
Arg [2] : _feeRecipient (address): 0xae6FdDA940155D090E3A3DE9b090aD6A392F761a
Arg [3] : _zoraFeeRecipient (address): 0x7A810DCd0f8d83B20212326813Db6EF7E9FD030c

-----Encoded View---------------
4 Constructor Arguments found :
Arg [0] : 0000000000000000000000005be12d4b22eaa4354b3d6f636df047ab7a2a0af8
Arg [1] : 0000000000000000000000000000000000000000000000000005363a8de2b000
Arg [2] : 000000000000000000000000ae6fdda940155d090e3a3de9b090ad6a392f761a
Arg [3] : 0000000000000000000000007a810dcd0f8d83b20212326813db6ef7e9fd030c