POL Price: $0.426729 (-5.62%)
 

Overview

TokenID

14

Total Transfers

-

Market

Onchain Market Cap

$0.00

Circulating Supply Market Cap

-

Other Info

Loading...
Loading
Loading...
Loading
Loading...
Loading

Click here to update the token information / general information

Contract Source Code Verified (Exact Match)

Contract Name:
Trudopes

Compiler Version
v0.8.17+commit.8df45f5f

Optimization Enabled:
Yes with 250 runs

Other Settings:
default evmVersion
File 1 of 14 : Trudopes.sol
// SPDX-License-Identifier: MIT
pragma solidity = 0.8.17;

import "@openzeppelin/contracts/utils/math/SafeMath.sol";
import "@openzeppelin/contracts/access/Ownable.sol";
import "@openzeppelin/contracts/security/ReentrancyGuard.sol";
import "@openzeppelin/contracts/utils/Strings.sol";
import "@openzeppelin/contracts/utils/cryptography/MerkleProof.sol";
import "./support/ERC721A_royalty.sol";
import "./support/DefaultOperatorFilterer.sol";


interface iBlacklist {
    function getBlacklist(
        address _address,
        address _contract
    ) external view returns (uint256 is_blacklisted);
}

contract Trudopes is Ownable, ERC721A, ReentrancyGuard, DefaultOperatorFilterer {
    using Strings for uint;

    address public _blacklistContract;

    enum Step {
        Before,
        DopeInflationReduction, //whitelist
        DopeInflation, //public
        SoldOut
    }

    Step public sellingStep;

    string public baseURI;

    uint256 public _maxSupply = 80000;
    uint256 public _maxDopeInflationTotal = 80000; //public max
    uint256 public _maxDopeInflationReductionTotal = 80000; //whitelist max

    uint256 public _maxWalletDopeInflation = 80000; //max public wallet
    uint256 public _maxWalletDopeInflationReduction = 80000; //max whitelist wallet

    uint256 public _dopeInflationPrice = 0.01 * 10**18 wei; //public sale price 120
    uint256 public _dopeInflationReductionPrice = 0.01 * 10**18 wei; //whitelist sale price 100

    bytes32 public _merkleRootDopeInflationReduction; //whitelist merkle

    mapping(address => uint) public _amountNFTsperWalletDopeInflation; //public wallet amounts
    mapping(address => uint) public _amountNFTsperWalletDopeInflationReduction; //whitelist wallet amounts

    uint96 _royaltyFeesInBips;
    address _royaltyReceiver;
    address _payments;

    error NotUser();
    error WhitelistNotStarted();
    error NotWhitelisted();
    error MaxHoldExceededWhitelist();
    error MaxSupplyExceededWhitelist();
    error MaxSupplyExceededPublic();
    error MaxSupplyExceeded();
    error IncorrectValue();
    error PublicNotStarted();
    error MaxHoldExceeded();
    error CannotIncrease();
    error DoesNotExist();

    constructor(address blacklist_, bytes32 merkleRootDopeInflationReduction_, string memory baseURI_, uint96 royaltyFeesInBips_, address royaltyReceiver_, address payments_) ERC721A("Trudopes", "Trudopes") {
        _blacklistContract = blacklist_;
        _merkleRootDopeInflationReduction = merkleRootDopeInflationReduction_;
        baseURI = baseURI_;
        _royaltyFeesInBips = royaltyFeesInBips_;
        _royaltyReceiver = royaltyReceiver_;
        _payments = payments_;
    }

    modifier callerIsUser() {
        if(tx.origin != msg.sender) {revert NotUser();}
        _;
    }

    //whitelist Mint
    function dopeInflationReductionMint(uint _quantity, bytes32[] calldata _proof) public payable nonReentrant callerIsUser{
        if(sellingStep != Step.DopeInflationReduction) {revert WhitelistNotStarted();}
        if(!isDopeInflationReduction(msg.sender, _proof)) {revert NotWhitelisted();}
        if((_amountNFTsperWalletDopeInflationReduction[msg.sender] + _quantity) > _maxWalletDopeInflationReduction) {revert MaxHoldExceededWhitelist();}
        if((totalSupply() + _quantity) > _maxDopeInflationReductionTotal) {revert MaxSupplyExceededWhitelist();}
        if((totalSupply() + _quantity) > _maxSupply) {revert MaxSupplyExceeded();}
        if(msg.value < (_dopeInflationReductionPrice * _quantity)) {revert IncorrectValue();}
        _amountNFTsperWalletDopeInflationReduction[msg.sender] += _quantity;
        payable(_payments).transfer(msg.value);
        _safeMint(msg.sender, _quantity);
    }

    //Public Mint
    function dopeInflationMint(uint _quantity) public payable nonReentrant callerIsUser {
        if(sellingStep != Step.DopeInflation) {revert PublicNotStarted();}
        if((totalSupply() + _quantity) > _maxDopeInflationTotal) {revert MaxSupplyExceededPublic();}
        if((totalSupply() + _quantity) > _maxSupply) {revert MaxSupplyExceeded();}
        if((_amountNFTsperWalletDopeInflation[msg.sender] + _quantity) > _maxWalletDopeInflation) {revert MaxHoldExceeded();}
        if(msg.value < (_dopeInflationPrice * _quantity)) {revert IncorrectValue();}
        _amountNFTsperWalletDopeInflation[msg.sender] += _quantity;
        payable(_payments).transfer(msg.value);
        _safeMint(msg.sender, _quantity);
    }

    //Airdrop
    function giftsFromLobbyists(address _to, uint _quantity) public onlyOwner {
        if((totalSupply() + _quantity) > _maxSupply) {revert MaxSupplyExceeded();}
        _safeMint(_to, _quantity);
    }

    //lowers _maxSupply
    function emptyShelves(uint256 _newMaxSupply) public onlyOwner {
        if(_newMaxSupply >= _maxSupply) {revert CannotIncrease();}
        _maxSupply = _newMaxSupply;
    }

    //max public sale amount
    function setMaxDopeInflationTotal(uint256 _newMaxDopeInflationTotal) public onlyOwner{
        _maxDopeInflationTotal = _newMaxDopeInflationTotal;
    }

    //max whitelist sale amount
    function setMaxDopeInflationReductionTotal(uint256 _newMaxDopeInflationReductionTotal) public onlyOwner {
        _maxDopeInflationReductionTotal = _newMaxDopeInflationReductionTotal;
    }

    //max public wallet size
    function setMaxWalletDopeInflation(uint256 _newMaxWalletDopeInflation) public onlyOwner {
        _maxWalletDopeInflation = _newMaxWalletDopeInflation;
    }

    //max whitelist wallet size
    function setMaxWalletDopeInflationReduction(uint256 _newMaxWalletDopeInflationReduction) public onlyOwner {
        _maxWalletDopeInflationReduction = _newMaxWalletDopeInflationReduction;
    }

    //whitelist price change
    function dopeInflationRebate(uint256 _newDopeInflationReductionPrice) public onlyOwner {
        _dopeInflationReductionPrice = _newDopeInflationReductionPrice;
    }

    //public price change
    function dopeInflationFee(uint256 _newDopeInflationPrice) public onlyOwner {
        _dopeInflationPrice = _newDopeInflationPrice;
    }

    //sets new Base URI
    function setBaseURI(string memory _newBaseURI) public onlyOwner {
        baseURI = _newBaseURI;
    }

    //sets the selling step
    function setStep(uint8 _step) public onlyOwner {
        sellingStep = Step(_step);
    }

    //calls the token URI
    function tokenURI(uint256 _tokenId) public view virtual override returns(string memory) {
        if(!_exists(_tokenId)) {revert DoesNotExist();}

        return string(abi.encodePacked(baseURI, _tokenId.toString(), ".json"));
    }


    //Whitelist functions
    function setMerkleRootWL(bytes32 _newMerkleRootDopeInflationReduction) external onlyOwner {
        _merkleRootDopeInflationReduction = _newMerkleRootDopeInflationReduction;
    }

    function isDopeInflationReduction(address _account, bytes32[] calldata _proof) internal view returns(bool) {
        return _verifyDopeInflationReduction(leaf(_account), _proof);
    }

    function leaf(address _account) internal pure returns(bytes32) {
        return keccak256(abi.encodePacked(_account));
    }

    function _verifyDopeInflationReduction(bytes32 _leaf, bytes32[] memory _proof) internal view returns(bool) {
        return MerkleProof.verify(_proof, _merkleRootDopeInflationReduction, _leaf);
    }


    function setApprovalForAll(address operator, bool approved) public override onlyAllowedOperatorApproval(operator) {
        super.setApprovalForAll(operator, approved);
    }

    function approve(address operator, uint256 tokenId) public override onlyAllowedOperatorApproval(operator) {
        super.approve(operator, tokenId);
    }

    function transferFrom(address from, address to, uint256 tokenId) public override onlyAllowedOperator(from) {
        super.transferFrom(from, to, tokenId);
    }

    function safeTransferFrom(address from, address to, uint256 tokenId) public override onlyAllowedOperator(from) {
        super.safeTransferFrom(from, to, tokenId);
    }
    
    function safeTransferFrom(address from, address to, uint256 tokenId, bytes memory data) public override onlyAllowedOperator(from) {
        super.safeTransferFrom(from, to, tokenId, data);
    }

    //Royalty functions
    function royaltyInfo (
    uint256 _tokenId,
    uint256 _salePrice
     ) external view returns (
        address receiver,
        uint256 royaltyAmount
     ){
         return (_royaltyReceiver, calculateRoyalty(_salePrice));
     }


    function calculateRoyalty(uint256 _salePrice) view public returns (uint256){
        return(_salePrice / 10000) * _royaltyFeesInBips;
    }

    function setRoyaltyInfo (address _receiver, uint96 royaltyFeesInBips_) public onlyOwner {
        _royaltyReceiver = _receiver;
        _royaltyFeesInBips = royaltyFeesInBips_;
    }
    
    function setNewPaymentWallet (address _newPayments) public onlyOwner {
        _payments = _newPayments;
    }

}

File 2 of 14 : Ownable.sol
// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v4.9.0) (access/Ownable.sol)

pragma solidity ^0.8.0;

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

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

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

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

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

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

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

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

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

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

File 3 of 14 : ReentrancyGuard.sol
// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v4.9.0) (security/ReentrancyGuard.sol)

pragma solidity ^0.8.0;

/**
 * @dev Contract module that helps prevent reentrant calls to a function.
 *
 * Inheriting from `ReentrancyGuard` will make the {nonReentrant} modifier
 * available, which can be applied to functions to make sure there are no nested
 * (reentrant) calls to them.
 *
 * Note that because there is a single `nonReentrant` guard, functions marked as
 * `nonReentrant` may not call one another. This can be worked around by making
 * those functions `private`, and then adding `external` `nonReentrant` entry
 * points to them.
 *
 * TIP: If you would like to learn more about reentrancy and alternative ways
 * to protect against it, check out our blog post
 * https://blog.openzeppelin.com/reentrancy-after-istanbul/[Reentrancy After Istanbul].
 */
abstract contract ReentrancyGuard {
    // Booleans are more expensive than uint256 or any type that takes up a full
    // word because each write operation emits an extra SLOAD to first read the
    // slot's contents, replace the bits taken up by the boolean, and then write
    // back. This is the compiler's defense against contract upgrades and
    // pointer aliasing, and it cannot be disabled.

    // The values being non-zero value makes deployment a bit more expensive,
    // but in exchange the refund on every call to nonReentrant will be lower in
    // amount. Since refunds are capped to a percentage of the total
    // transaction's gas, it is best to keep them low in cases like this one, to
    // increase the likelihood of the full refund coming into effect.
    uint256 private constant _NOT_ENTERED = 1;
    uint256 private constant _ENTERED = 2;

    uint256 private _status;

    constructor() {
        _status = _NOT_ENTERED;
    }

    /**
     * @dev Prevents a contract from calling itself, directly or indirectly.
     * Calling a `nonReentrant` function from another `nonReentrant`
     * function is not supported. It is possible to prevent this from happening
     * by making the `nonReentrant` function external, and making it call a
     * `private` function that does the actual work.
     */
    modifier nonReentrant() {
        _nonReentrantBefore();
        _;
        _nonReentrantAfter();
    }

    function _nonReentrantBefore() private {
        // On the first call to nonReentrant, _status will be _NOT_ENTERED
        require(_status != _ENTERED, "ReentrancyGuard: reentrant call");

        // Any calls to nonReentrant after this point will fail
        _status = _ENTERED;
    }

    function _nonReentrantAfter() private {
        // By storing the original value once again, a refund is triggered (see
        // https://eips.ethereum.org/EIPS/eip-2200)
        _status = _NOT_ENTERED;
    }

    /**
     * @dev Returns true if the reentrancy guard is currently set to "entered", which indicates there is a
     * `nonReentrant` function in the call stack.
     */
    function _reentrancyGuardEntered() internal view returns (bool) {
        return _status == _ENTERED;
    }
}

File 4 of 14 : Context.sol
// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts v4.4.1 (utils/Context.sol)

pragma solidity ^0.8.0;

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

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

File 5 of 14 : MerkleProof.sol
// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v4.9.2) (utils/cryptography/MerkleProof.sol)

pragma solidity ^0.8.0;

/**
 * @dev These functions deal with verification of Merkle Tree proofs.
 *
 * The tree and the proofs can be generated using our
 * https://github.com/OpenZeppelin/merkle-tree[JavaScript library].
 * You will find a quickstart guide in the readme.
 *
 * WARNING: You should avoid using leaf values that are 64 bytes long prior to
 * hashing, or use a hash function other than keccak256 for hashing leaves.
 * This is because the concatenation of a sorted pair of internal nodes in
 * the merkle tree could be reinterpreted as a leaf value.
 * OpenZeppelin's JavaScript library generates merkle trees that are safe
 * against this attack out of the box.
 */
library MerkleProof {
    /**
     * @dev Returns true if a `leaf` can be proved to be a part of a Merkle tree
     * defined by `root`. For this, a `proof` must be provided, containing
     * sibling hashes on the branch from the leaf to the root of the tree. Each
     * pair of leaves and each pair of pre-images are assumed to be sorted.
     */
    function verify(bytes32[] memory proof, bytes32 root, bytes32 leaf) internal pure returns (bool) {
        return processProof(proof, leaf) == root;
    }

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

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

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

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

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

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

        // Check proof validity.
        require(leavesLen + proofLen - 1 == totalHashes, "MerkleProof: invalid multiproof");

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

        if (totalHashes > 0) {
            require(proofPos == proofLen, "MerkleProof: invalid multiproof");
            unchecked {
                return hashes[totalHashes - 1];
            }
        } else if (leavesLen > 0) {
            return leaves[0];
        } else {
            return proof[0];
        }
    }

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

        // Check proof validity.
        require(leavesLen + proofLen - 1 == totalHashes, "MerkleProof: invalid multiproof");

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

        if (totalHashes > 0) {
            require(proofPos == proofLen, "MerkleProof: invalid multiproof");
            unchecked {
                return hashes[totalHashes - 1];
            }
        } else if (leavesLen > 0) {
            return leaves[0];
        } else {
            return proof[0];
        }
    }

    function _hashPair(bytes32 a, bytes32 b) private pure returns (bytes32) {
        return a < b ? _efficientHash(a, b) : _efficientHash(b, a);
    }

    function _efficientHash(bytes32 a, bytes32 b) private pure returns (bytes32 value) {
        /// @solidity memory-safe-assembly
        assembly {
            mstore(0x00, a)
            mstore(0x20, b)
            value := keccak256(0x00, 0x40)
        }
    }
}

File 6 of 14 : Math.sol
// SPDX-License-Identifier: MIT
// 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 7 of 14 : SafeMath.sol
// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v4.9.0) (utils/math/SafeMath.sol)

pragma solidity ^0.8.0;

// CAUTION
// This version of SafeMath should only be used with Solidity 0.8 or later,
// because it relies on the compiler's built in overflow checks.

/**
 * @dev Wrappers over Solidity's arithmetic operations.
 *
 * NOTE: `SafeMath` is generally not needed starting with Solidity 0.8, since the compiler
 * now has built in overflow checking.
 */
library SafeMath {
    /**
     * @dev Returns the addition of two unsigned integers, with an overflow flag.
     *
     * _Available since v3.4._
     */
    function tryAdd(uint256 a, uint256 b) internal pure returns (bool, uint256) {
        unchecked {
            uint256 c = a + b;
            if (c < a) return (false, 0);
            return (true, c);
        }
    }

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

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

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

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

    /**
     * @dev Returns the addition of two unsigned integers, reverting on
     * overflow.
     *
     * Counterpart to Solidity's `+` operator.
     *
     * Requirements:
     *
     * - Addition cannot overflow.
     */
    function add(uint256 a, uint256 b) internal pure returns (uint256) {
        return a + b;
    }

    /**
     * @dev Returns the subtraction of two unsigned integers, reverting on
     * overflow (when the result is negative).
     *
     * Counterpart to Solidity's `-` operator.
     *
     * Requirements:
     *
     * - Subtraction cannot overflow.
     */
    function sub(uint256 a, uint256 b) internal pure returns (uint256) {
        return a - b;
    }

    /**
     * @dev Returns the multiplication of two unsigned integers, reverting on
     * overflow.
     *
     * Counterpart to Solidity's `*` operator.
     *
     * Requirements:
     *
     * - Multiplication cannot overflow.
     */
    function mul(uint256 a, uint256 b) internal pure returns (uint256) {
        return a * b;
    }

    /**
     * @dev Returns the integer division of two unsigned integers, reverting on
     * division by zero. The result is rounded towards zero.
     *
     * Counterpart to Solidity's `/` operator.
     *
     * Requirements:
     *
     * - The divisor cannot be zero.
     */
    function div(uint256 a, uint256 b) internal pure returns (uint256) {
        return a / b;
    }

    /**
     * @dev Returns the remainder of dividing two unsigned integers. (unsigned integer modulo),
     * reverting when dividing by zero.
     *
     * Counterpart to Solidity's `%` operator. This function uses a `revert`
     * opcode (which leaves remaining gas untouched) while Solidity uses an
     * invalid opcode to revert (consuming all remaining gas).
     *
     * Requirements:
     *
     * - The divisor cannot be zero.
     */
    function mod(uint256 a, uint256 b) internal pure returns (uint256) {
        return a % b;
    }

    /**
     * @dev Returns the subtraction of two unsigned integers, reverting with custom message on
     * overflow (when the result is negative).
     *
     * CAUTION: This function is deprecated because it requires allocating memory for the error
     * message unnecessarily. For custom revert reasons use {trySub}.
     *
     * Counterpart to Solidity's `-` operator.
     *
     * Requirements:
     *
     * - Subtraction cannot overflow.
     */
    function sub(uint256 a, uint256 b, string memory errorMessage) internal pure returns (uint256) {
        unchecked {
            require(b <= a, errorMessage);
            return a - b;
        }
    }

    /**
     * @dev Returns the integer division of two unsigned integers, reverting with custom message on
     * division by zero. The result is rounded towards zero.
     *
     * Counterpart to Solidity's `/` operator. Note: this function uses a
     * `revert` opcode (which leaves remaining gas untouched) while Solidity
     * uses an invalid opcode to revert (consuming all remaining gas).
     *
     * Requirements:
     *
     * - The divisor cannot be zero.
     */
    function div(uint256 a, uint256 b, string memory errorMessage) internal pure returns (uint256) {
        unchecked {
            require(b > 0, errorMessage);
            return a / b;
        }
    }

    /**
     * @dev Returns the remainder of dividing two unsigned integers. (unsigned integer modulo),
     * reverting with custom message when dividing by zero.
     *
     * CAUTION: This function is deprecated because it requires allocating memory for the error
     * message unnecessarily. For custom revert reasons use {tryMod}.
     *
     * Counterpart to Solidity's `%` operator. This function uses a `revert`
     * opcode (which leaves remaining gas untouched) while Solidity uses an
     * invalid opcode to revert (consuming all remaining gas).
     *
     * Requirements:
     *
     * - The divisor cannot be zero.
     */
    function mod(uint256 a, uint256 b, string memory errorMessage) internal pure returns (uint256) {
        unchecked {
            require(b > 0, errorMessage);
            return a % b;
        }
    }
}

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

pragma solidity ^0.8.0;

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

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

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

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

File 9 of 14 : Strings.sol
// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v4.9.0) (utils/Strings.sol)

pragma solidity ^0.8.0;

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

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

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

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

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

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

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

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

File 10 of 14 : DefaultOperatorFilterer.sol
// SPDX-License-Identifier: MIT
pragma solidity ^0.8.13;

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

/**
 * @title  DefaultOperatorFilterer
 * @notice Inherits from OperatorFilterer and automatically subscribes to the default OpenSea subscription.
 */
abstract contract DefaultOperatorFilterer is OperatorFilterer {
    address constant DEFAULT_SUBSCRIPTION = address(0x3cc6CddA760b79bAfa08dF41ECFA224f810dCeB6);

    constructor() OperatorFilterer(DEFAULT_SUBSCRIPTION, true) {}
}

File 11 of 14 : ERC721A_royalty.sol
// SPDX-License-Identifier: MIT
// ERC721A Contracts v4.1.0
// Creator: Chiru Labs

pragma solidity ^0.8.4;

import './IERC721A.sol';

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

/**
 * @dev Implementation of https://eips.ethereum.org/EIPS/eip-721[ERC721] Non-Fungible Token Standard,
 * including the Metadata extension. Built to optimize for lower gas during batch mints.
 *
 * Assumes serials are sequentially minted starting at `_startTokenId()`
 * (defaults to 0, e.g. 0, 1, 2, 3..).
 *
 * Assumes that an owner cannot have more than 2**64 - 1 (max value of uint64) of supply.
 *
 * Assumes that the maximum token id cannot exceed 2**256 - 1 (max value of uint256).
 */
contract ERC721A is IERC721A {
    // Mask of an entry in packed address data.
    uint256 private constant BITMASK_ADDRESS_DATA_ENTRY = (1 << 64) - 1;

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

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

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

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

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

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

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

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

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

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

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

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

    // The tokenId of the next token to be minted.
    uint256 private _currentIndex;

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

    // Token name
    string private _name;

    // Token symbol
    string private _symbol;

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

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

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

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

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

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

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

    /**
     * @dev Returns the total number of tokens in existence.
     * Burned tokens will reduce the count.
     * To get the total number of tokens minted, please see `_totalMinted`.
     */
    function totalSupply() public view override returns (uint256) {
        // Counter underflow is impossible as _burnCounter cannot be incremented
        // more than `_currentIndex - _startTokenId()` times.
        unchecked {
            return _currentIndex - _burnCounter - _startTokenId();
        }
    }

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

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

    /**
     * @dev See {IERC165-supportsInterface}.
     */
    function supportsInterface(bytes4 interfaceId) public view virtual override returns (bool) {
        // The interface IDs are constants representing the first 4 bytes of the XOR of
        // all function selectors in the interface. See: https://eips.ethereum.org/EIPS/eip-165
        // e.g. `bytes4(i.functionA.selector ^ i.functionB.selector ^ ...)`
        return
            interfaceId == 0x01ffc9a7 || // ERC165 interface ID for ERC165.
            interfaceId == 0x80ac58cd || // ERC165 interface ID for ERC721.
            interfaceId == 0x2a55205a || // ERC 2981 rotyalty
            interfaceId == 0x5b5e139f; // ERC165 interface ID for ERC721Metadata.
    }

    /**
     * @dev See {IERC721-balanceOf}.
     */
    function balanceOf(address owner) public view override returns (uint256) {
        if (owner == address(0)) revert BalanceQueryForZeroAddress();
        return _packedAddressData[owner] & BITMASK_ADDRESS_DATA_ENTRY;
    }

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

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

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

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

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

        unchecked {
            if (_startTokenId() <= curr)
                if (curr < _currentIndex) {
                    uint256 packed = _packedOwnerships[curr];
                    // If not burned.
                    if (packed & BITMASK_BURNED == 0) {
                        // Invariant:
                        // There will always be an ownership that has an address and is not burned
                        // before an ownership that does not have an address and is not burned.
                        // Hence, curr will not underflow.
                        //
                        // We can directly compare the packed value.
                        // If the address is zero, packed is zero.
                        while (packed == 0) {
                            packed = _packedOwnerships[--curr];
                        }
                        return packed;
                    }
                }
        }
        revert OwnerQueryForNonexistentToken();
    }

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

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

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

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

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

    /**
     * @dev See {IERC721-ownerOf}.
     */
    function ownerOf(uint256 tokenId) public view override returns (address) {
        return address(uint160(_packedOwnershipOf(tokenId)));
    }

    /**
     * @dev See {IERC721Metadata-name}.
     */
    function name() public view virtual override returns (string memory) {
        return _name;
    }

    /**
     * @dev See {IERC721Metadata-symbol}.
     */
    function symbol() public view virtual override returns (string memory) {
        return _symbol;
    }

    /**
     * @dev See {IERC721Metadata-tokenURI}.
     */
    function tokenURI(uint256 tokenId) public view virtual override returns (string memory) {
        if (!_exists(tokenId)) revert URIQueryForNonexistentToken();

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

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

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

    /**
     * @dev See {IERC721-approve}.
     */
    function approve(address to, uint256 tokenId) public virtual override {
        address owner = ownerOf(tokenId);
        if (_msgSenderERC721A() != owner)
            if (!isApprovedForAll(owner, _msgSenderERC721A())) {
                revert ApprovalCallerNotOwnerNorApproved();
            }

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

    /**
     * @dev See {IERC721-getApproved}.
     */
    function getApproved(uint256 tokenId) public view override returns (address) {
        if (!_exists(tokenId)) revert ApprovalQueryForNonexistentToken();

        return _tokenApprovals[tokenId];
    }

    /**
     * @dev See {IERC721-setApprovalForAll}.
     */
    function setApprovalForAll(address operator, bool approved) public virtual override {
        if (operator == _msgSenderERC721A()) revert ApproveToCaller();
        _operatorApprovals[_msgSenderERC721A()][operator] = approved;
        emit ApprovalForAll(_msgSenderERC721A(), operator, approved);
    }
    

    /**
     * @dev See {IERC721-isApprovedForAll}.
     */
    function isApprovedForAll(address owner, address operator) public view virtual override returns (bool) {
        return _operatorApprovals[owner][operator];
    }

    /**
     * @dev See {IERC721-safeTransferFrom}.
     */
    function safeTransferFrom(
        address from,
        address to,
        uint256 tokenId
    ) public virtual override {
        safeTransferFrom(from, to, tokenId, '');
    }

    /**
     * @dev See {IERC721-safeTransferFrom}.
     */
    function safeTransferFrom(
        address from,
        address to,
        uint256 tokenId,
        bytes memory _data
    ) public virtual override {
        transferFrom(from, to, tokenId);
        if (to.code.length != 0)
            if (!_checkContractOnERC721Received(from, to, tokenId, _data)) {
                revert TransferToNonERC721ReceiverImplementer();
            }
    }

    /**
     * @dev Returns whether `tokenId` exists.
     *
     * Tokens can be managed by their owner or approved accounts via {approve} or {setApprovalForAll}.
     *
     * Tokens start existing when they are minted (`_mint`),
     */
    function _exists(uint256 tokenId) internal view returns (bool) {
        return
            _startTokenId() <= tokenId &&
            tokenId < _currentIndex && // If within bounds,
            _packedOwnerships[tokenId] & BITMASK_BURNED == 0; // and not burned.
    }

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

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

        unchecked {
            if (to.code.length != 0) {
                uint256 end = _currentIndex;
                uint256 index = end - quantity;
                do {
                    if (!_checkContractOnERC721Received(address(0), to, index++, _data)) {
                        revert TransferToNonERC721ReceiverImplementer();
                    }
                } while (index < end);
                // Reentrancy protection.
                if (_currentIndex != end) revert();
            }
        }
    }

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

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

        // Overflows are incredibly unrealistic.
        // `balance` and `numberMinted` have a maximum limit of 2**64.
        // `tokenId` has a maximum limit of 2**256.
        unchecked {
            // Updates:
            // - `balance += quantity`.
            // - `numberMinted += quantity`.
            //
            // We can directly add to the `balance` and `numberMinted`.
            _packedAddressData[to] += quantity * ((1 << BITPOS_NUMBER_MINTED) | 1);

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

            uint256 tokenId = startTokenId;
            uint256 end = startTokenId + quantity;
            do {
                emit Transfer(address(0), to, tokenId++);
            } while (tokenId < end);

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

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

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

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

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

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

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

    /**
     * @dev Returns the storage slot and value for the approved address of `tokenId`.
     */
    function _getApprovedAddress(uint256 tokenId)
        private
        view
        returns (uint256 approvedAddressSlot, address approvedAddress)
    {
        mapping(uint256 => address) storage tokenApprovalsPtr = _tokenApprovals;
        // The following is equivalent to `approvedAddress = _tokenApprovals[tokenId]`.
        assembly {
            // Compute the slot.
            mstore(0x00, tokenId)
            mstore(0x20, tokenApprovalsPtr.slot)
            approvedAddressSlot := keccak256(0x00, 0x40)
            // Load the slot's value from storage.
            approvedAddress := sload(approvedAddressSlot)
        }
    }

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

    /**
     * @dev Transfers `tokenId` from `from` to `to`.
     *
     * Requirements:
     *
     * - `to` cannot be the zero address.
     * - `tokenId` token must be owned by `from`.
     *
     * Emits a {Transfer} event.
     */
    function transferFrom(
        address from,
        address to,
        uint256 tokenId
    ) public virtual override {
        uint256 prevOwnershipPacked = _packedOwnershipOf(tokenId);

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

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

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

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

        _beforeTokenTransfers(from, to, tokenId, 1);

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

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

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

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

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

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

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

        address from = address(uint160(prevOwnershipPacked));

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

    /**
     * @dev Converts a `uint256` to its ASCII `string` decimal representation.
     */
    function _toString(uint256 value) internal pure returns (string memory ptr) {
        assembly {
            // The maximum value of a uint256 contains 78 digits (1 byte per digit),
            // but we allocate 128 bytes to keep the free memory pointer 32-byte word aliged.
            // We will need 1 32-byte word to store the length,
            // and 3 32-byte words to store a maximum of 78 digits. Total: 32 + 3 * 32 = 128.
            ptr := add(mload(0x40), 128)
            // Update the free memory pointer to allocate.
            mstore(0x40, ptr)

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

            // We write the string from the rightmost digit to the leftmost digit.
            // The following is essentially a do-while loop that also handles the zero case.
            // Costs a bit more than early returning for the zero case,
            // but cheaper in terms of deployment and overall runtime costs.
            for {
                // Initialize and perform the first pass without check.
                let temp := value
                // Move the pointer 1 byte leftwards to point to an empty character slot.
                ptr := sub(ptr, 1)
                // Write the character to the pointer. 48 is the ASCII index of '0'.
                mstore8(ptr, add(48, mod(temp, 10)))
                temp := div(temp, 10)
            } temp {
                // Keep dividing `temp` until zero.
                temp := div(temp, 10)
            } {
                // Body of the for loop.
                ptr := sub(ptr, 1)
                mstore8(ptr, add(48, mod(temp, 10)))
            }

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

File 12 of 14 : IERC721A.sol
// SPDX-License-Identifier: MIT
// ERC721A Contracts v4.1.0
// Creator: Chiru Labs

pragma solidity ^0.8.4;

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

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

    /**
     * The caller cannot approve to their own address.
     */
    error ApproveToCaller();

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

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

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

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

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

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

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

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

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

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

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

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

    /**
     * @dev Returns the total amount of tokens stored by the contract.
     *
     * Burned tokens are calculated here, use `_totalMinted()` if you want to count just minted tokens.
     */
    function totalSupply() external view returns (uint256);

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

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

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

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

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

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

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

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

    /**
     * @dev Safely transfers `tokenId` token from `from` to `to`.
     *
     * Requirements:
     *
     * - `from` cannot be the zero address.
     * - `to` cannot be the zero address.
     * - `tokenId` token must exist and be owned by `from`.
     * - If the caller is not `from`, it must be approved to move this token by either {approve} or {setApprovalForAll}.
     * - If `to` refers to a smart contract, it must implement {IERC721Receiver-onERC721Received}, which is called upon a safe transfer.
     *
     * Emits a {Transfer} event.
     */
    function safeTransferFrom(
        address from,
        address to,
        uint256 tokenId,
        bytes calldata data
    ) external;

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

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

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

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

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

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

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

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

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

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

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

    /**
     * @dev Emitted when tokens in `fromTokenId` to `toTokenId` (inclusive) is transferred from `from` to `to`,
     * as defined in the ERC2309 standard. See `_mintERC2309` for more details.
     */
    event ConsecutiveTransfer(uint256 indexed fromTokenId, uint256 toTokenId, address indexed from, address indexed to);
}

File 13 of 14 : IOperatorFilterRegistry.sol
// SPDX-License-Identifier: MIT
pragma solidity ^0.8.13;

interface IOperatorFilterRegistry {
    function isOperatorAllowed(address registrant, address operator) external view returns (bool);
    function register(address registrant) external;
    function registerAndSubscribe(address registrant, address subscription) external;
    function registerAndCopyEntries(address registrant, address registrantToCopy) external;
    function unregister(address addr) external;
    function updateOperator(address registrant, address operator, bool filtered) external;
    function updateOperators(address registrant, address[] calldata operators, bool filtered) external;
    function updateCodeHash(address registrant, bytes32 codehash, bool filtered) external;
    function updateCodeHashes(address registrant, bytes32[] calldata codeHashes, bool filtered) external;
    function subscribe(address registrant, address registrantToSubscribe) external;
    function unsubscribe(address registrant, bool copyExistingEntries) external;
    function subscriptionOf(address addr) external returns (address registrant);
    function subscribers(address registrant) external returns (address[] memory);
    function subscriberAt(address registrant, uint256 index) external returns (address);
    function copyEntriesOf(address registrant, address registrantToCopy) external;
    function isOperatorFiltered(address registrant, address operator) external returns (bool);
    function isCodeHashOfFiltered(address registrant, address operatorWithCode) external returns (bool);
    function isCodeHashFiltered(address registrant, bytes32 codeHash) external returns (bool);
    function filteredOperators(address addr) external returns (address[] memory);
    function filteredCodeHashes(address addr) external returns (bytes32[] memory);
    function filteredOperatorAt(address registrant, uint256 index) external returns (address);
    function filteredCodeHashAt(address registrant, uint256 index) external returns (bytes32);
    function isRegistered(address addr) external returns (bool);
    function codeHashOf(address addr) external returns (bytes32);
}

File 14 of 14 : OperatorFilterer.sol
// SPDX-License-Identifier: MIT
pragma solidity ^0.8.13;

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

/**
 * @title  OperatorFilterer
 * @notice Abstract contract whose constructor automatically registers and optionally subscribes to or copies another
 *         registrant's entries in the OperatorFilterRegistry.
 * @dev    This smart contract is meant to be inherited by token contracts so they can use the following:
 *         - `onlyAllowedOperator` modifier for `transferFrom` and `safeTransferFrom` methods.
 *         - `onlyAllowedOperatorApproval` modifier for `approve` and `setApprovalForAll` methods.
 */
abstract contract OperatorFilterer {
    error OperatorNotAllowed(address operator);

    IOperatorFilterRegistry public constant OPERATOR_FILTER_REGISTRY =
        IOperatorFilterRegistry(0x000000000000AAeB6D7670E522A718067333cd4E);

    constructor(address subscriptionOrRegistrantToCopy, bool subscribe) {
        // If an inheriting token contract is deployed to a network without the registry deployed, the modifier
        // will not revert, but the contract will need to be registered with the registry once it is deployed in
        // order for the modifier to filter addresses.
        if (address(OPERATOR_FILTER_REGISTRY).code.length > 0) {
            if (subscribe) {
                OPERATOR_FILTER_REGISTRY.registerAndSubscribe(address(this), subscriptionOrRegistrantToCopy);
            } else {
                if (subscriptionOrRegistrantToCopy != address(0)) {
                    OPERATOR_FILTER_REGISTRY.registerAndCopyEntries(address(this), subscriptionOrRegistrantToCopy);
                } else {
                    OPERATOR_FILTER_REGISTRY.register(address(this));
                }
            }
        }
    }

    modifier onlyAllowedOperator(address from) virtual {
        // Allow spending tokens from addresses with balance
        // Note that this still allows listings and marketplaces with escrow to transfer tokens if transferred
        // from an EOA.
        if (from != msg.sender) {
            _checkFilterOperator(msg.sender);
        }
        _;
    }

    modifier onlyAllowedOperatorApproval(address operator) virtual {
        _checkFilterOperator(operator);
        _;
    }

    function _checkFilterOperator(address operator) internal view virtual {
        // Check registry code length to facilitate testing in environments without a deployed registry.
        if (address(OPERATOR_FILTER_REGISTRY).code.length > 0) {
            if (!OPERATOR_FILTER_REGISTRY.isOperatorAllowed(address(this), operator)) {
                revert OperatorNotAllowed(operator);
            }
        }
    }
}

Settings
{
  "optimizer": {
    "enabled": true,
    "runs": 250
  },
  "outputSelection": {
    "*": {
      "*": [
        "evm.bytecode",
        "evm.deployedBytecode",
        "devdoc",
        "userdoc",
        "metadata",
        "abi"
      ]
    }
  },
  "libraries": {}
}

Contract Security Audit

Contract ABI

[{"inputs":[{"internalType":"address","name":"blacklist_","type":"address"},{"internalType":"bytes32","name":"merkleRootDopeInflationReduction_","type":"bytes32"},{"internalType":"string","name":"baseURI_","type":"string"},{"internalType":"uint96","name":"royaltyFeesInBips_","type":"uint96"},{"internalType":"address","name":"royaltyReceiver_","type":"address"},{"internalType":"address","name":"payments_","type":"address"}],"stateMutability":"nonpayable","type":"constructor"},{"inputs":[],"name":"ApprovalCallerNotOwnerNorApproved","type":"error"},{"inputs":[],"name":"ApprovalQueryForNonexistentToken","type":"error"},{"inputs":[],"name":"ApproveToCaller","type":"error"},{"inputs":[],"name":"BalanceQueryForZeroAddress","type":"error"},{"inputs":[],"name":"CannotIncrease","type":"error"},{"inputs":[],"name":"DoesNotExist","type":"error"},{"inputs":[],"name":"IncorrectValue","type":"error"},{"inputs":[],"name":"MaxHoldExceeded","type":"error"},{"inputs":[],"name":"MaxHoldExceededWhitelist","type":"error"},{"inputs":[],"name":"MaxSupplyExceeded","type":"error"},{"inputs":[],"name":"MaxSupplyExceededPublic","type":"error"},{"inputs":[],"name":"MaxSupplyExceededWhitelist","type":"error"},{"inputs":[],"name":"MintERC2309QuantityExceedsLimit","type":"error"},{"inputs":[],"name":"MintToZeroAddress","type":"error"},{"inputs":[],"name":"MintZeroQuantity","type":"error"},{"inputs":[],"name":"NotUser","type":"error"},{"inputs":[],"name":"NotWhitelisted","type":"error"},{"inputs":[{"internalType":"address","name":"operator","type":"address"}],"name":"OperatorNotAllowed","type":"error"},{"inputs":[],"name":"OwnerQueryForNonexistentToken","type":"error"},{"inputs":[],"name":"OwnershipNotInitializedForExtraData","type":"error"},{"inputs":[],"name":"PublicNotStarted","type":"error"},{"inputs":[],"name":"TransferCallerNotOwnerNorApproved","type":"error"},{"inputs":[],"name":"TransferFromIncorrectOwner","type":"error"},{"inputs":[],"name":"TransferToNonERC721ReceiverImplementer","type":"error"},{"inputs":[],"name":"TransferToZeroAddress","type":"error"},{"inputs":[],"name":"URIQueryForNonexistentToken","type":"error"},{"inputs":[],"name":"WhitelistNotStarted","type":"error"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"owner","type":"address"},{"indexed":true,"internalType":"address","name":"approved","type":"address"},{"indexed":true,"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"Approval","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"owner","type":"address"},{"indexed":true,"internalType":"address","name":"operator","type":"address"},{"indexed":false,"internalType":"bool","name":"approved","type":"bool"}],"name":"ApprovalForAll","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"uint256","name":"fromTokenId","type":"uint256"},{"indexed":false,"internalType":"uint256","name":"toTokenId","type":"uint256"},{"indexed":true,"internalType":"address","name":"from","type":"address"},{"indexed":true,"internalType":"address","name":"to","type":"address"}],"name":"ConsecutiveTransfer","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"previousOwner","type":"address"},{"indexed":true,"internalType":"address","name":"newOwner","type":"address"}],"name":"OwnershipTransferred","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"from","type":"address"},{"indexed":true,"internalType":"address","name":"to","type":"address"},{"indexed":true,"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"Transfer","type":"event"},{"inputs":[],"name":"OPERATOR_FILTER_REGISTRY","outputs":[{"internalType":"contract IOperatorFilterRegistry","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"","type":"address"}],"name":"_amountNFTsperWalletDopeInflation","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"","type":"address"}],"name":"_amountNFTsperWalletDopeInflationReduction","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"_blacklistContract","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"_dopeInflationPrice","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"_dopeInflationReductionPrice","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"_maxDopeInflationReductionTotal","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"_maxDopeInflationTotal","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"_maxSupply","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"_maxWalletDopeInflation","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"_maxWalletDopeInflationReduction","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"_merkleRootDopeInflationReduction","outputs":[{"internalType":"bytes32","name":"","type":"bytes32"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"operator","type":"address"},{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"approve","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"owner","type":"address"}],"name":"balanceOf","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"baseURI","outputs":[{"internalType":"string","name":"","type":"string"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"_salePrice","type":"uint256"}],"name":"calculateRoyalty","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"_newDopeInflationPrice","type":"uint256"}],"name":"dopeInflationFee","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"_quantity","type":"uint256"}],"name":"dopeInflationMint","outputs":[],"stateMutability":"payable","type":"function"},{"inputs":[{"internalType":"uint256","name":"_newDopeInflationReductionPrice","type":"uint256"}],"name":"dopeInflationRebate","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"_quantity","type":"uint256"},{"internalType":"bytes32[]","name":"_proof","type":"bytes32[]"}],"name":"dopeInflationReductionMint","outputs":[],"stateMutability":"payable","type":"function"},{"inputs":[{"internalType":"uint256","name":"_newMaxSupply","type":"uint256"}],"name":"emptyShelves","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"getApproved","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"_to","type":"address"},{"internalType":"uint256","name":"_quantity","type":"uint256"}],"name":"giftsFromLobbyists","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"owner","type":"address"},{"internalType":"address","name":"operator","type":"address"}],"name":"isApprovedForAll","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"name","outputs":[{"internalType":"string","name":"","type":"string"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"owner","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"ownerOf","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"renounceOwnership","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"_tokenId","type":"uint256"},{"internalType":"uint256","name":"_salePrice","type":"uint256"}],"name":"royaltyInfo","outputs":[{"internalType":"address","name":"receiver","type":"address"},{"internalType":"uint256","name":"royaltyAmount","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"from","type":"address"},{"internalType":"address","name":"to","type":"address"},{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"safeTransferFrom","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"from","type":"address"},{"internalType":"address","name":"to","type":"address"},{"internalType":"uint256","name":"tokenId","type":"uint256"},{"internalType":"bytes","name":"data","type":"bytes"}],"name":"safeTransferFrom","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"sellingStep","outputs":[{"internalType":"enum Trudopes.Step","name":"","type":"uint8"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"operator","type":"address"},{"internalType":"bool","name":"approved","type":"bool"}],"name":"setApprovalForAll","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"string","name":"_newBaseURI","type":"string"}],"name":"setBaseURI","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"_newMaxDopeInflationReductionTotal","type":"uint256"}],"name":"setMaxDopeInflationReductionTotal","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"_newMaxDopeInflationTotal","type":"uint256"}],"name":"setMaxDopeInflationTotal","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"_newMaxWalletDopeInflation","type":"uint256"}],"name":"setMaxWalletDopeInflation","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"_newMaxWalletDopeInflationReduction","type":"uint256"}],"name":"setMaxWalletDopeInflationReduction","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"bytes32","name":"_newMerkleRootDopeInflationReduction","type":"bytes32"}],"name":"setMerkleRootWL","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"_newPayments","type":"address"}],"name":"setNewPaymentWallet","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"_receiver","type":"address"},{"internalType":"uint96","name":"royaltyFeesInBips_","type":"uint96"}],"name":"setRoyaltyInfo","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint8","name":"_step","type":"uint8"}],"name":"setStep","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"bytes4","name":"interfaceId","type":"bytes4"}],"name":"supportsInterface","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"symbol","outputs":[{"internalType":"string","name":"","type":"string"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"_tokenId","type":"uint256"}],"name":"tokenURI","outputs":[{"internalType":"string","name":"","type":"string"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"totalSupply","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"from","type":"address"},{"internalType":"address","name":"to","type":"address"},{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"transferFrom","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"newOwner","type":"address"}],"name":"transferOwnership","outputs":[],"stateMutability":"nonpayable","type":"function"}]

608060405262013880600c5562013880600d5562013880600e5562013880600f5562013880601055662386f26fc10000601155662386f26fc100006012553480156200004a57600080fd5b5060405162002a2338038062002a238339810160408190526200006d9162000369565b733cc6cdda760b79bafa08df41ecfa224f810dceb6600160405180604001604052806008815260200167547275646f70657360c01b81525060405180604001604052806008815260200167547275646f70657360c01b815250620000e0620000da620002ca60201b60201c565b620002ce565b6003620000ee838262000521565b506004620000fd828262000521565b50600180815560095550506daaeb6d7670e522a718067333cd4e3b156200024d5780156200019b57604051633e9f1edf60e11b81523060048201526001600160a01b03831660248201526daaeb6d7670e522a718067333cd4e90637d3e3dbe906044015b600060405180830381600087803b1580156200017c57600080fd5b505af115801562000191573d6000803e3d6000fd5b505050506200024d565b6001600160a01b03821615620001ec5760405163a0af290360e01b81523060048201526001600160a01b03831660248201526daaeb6d7670e522a718067333cd4e9063a0af29039060440162000161565b604051632210724360e11b81523060048201526daaeb6d7670e522a718067333cd4e90634420e48690602401600060405180830381600087803b1580156200023357600080fd5b505af115801562000248573d6000803e3d6000fd5b505050505b5050600a80546001600160a01b0319166001600160a01b0388161790556013859055600b6200027d858262000521565b506001600160601b03929092166c010000000000000000000000006001600160a01b039283160217601655601780546001600160a01b0319169290911691909117905550620005ed915050565b3390565b600080546001600160a01b038381166001600160a01b0319831681178455604051919092169283917f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e09190a35050565b80516001600160a01b03811681146200033657600080fd5b919050565b634e487b7160e01b600052604160045260246000fd5b80516001600160601b03811681146200033657600080fd5b60008060008060008060c087890312156200038357600080fd5b6200038e876200031e565b60208881015160408a01519298509650906001600160401b0380821115620003b557600080fd5b818a0191508a601f830112620003ca57600080fd5b815181811115620003df57620003df6200033b565b604051601f8201601f19908116603f011681019083821181831017156200040a576200040a6200033b565b816040528281528d868487010111156200042357600080fd5b600093505b8284101562000447578484018601518185018701529285019262000428565b6000868483010152809950505050505050620004666060880162000351565b925062000476608088016200031e565b91506200048660a088016200031e565b90509295509295509295565b600181811c90821680620004a757607f821691505b602082108103620004c857634e487b7160e01b600052602260045260246000fd5b50919050565b601f8211156200051c57600081815260208120601f850160051c81016020861015620004f75750805b601f850160051c820191505b81811015620005185782815560010162000503565b5050505b505050565b81516001600160401b038111156200053d576200053d6200033b565b62000555816200054e845462000492565b84620004ce565b602080601f8311600181146200058d5760008415620005745750858301515b600019600386901b1c1916600185901b17855562000518565b600085815260208120601f198616915b82811015620005be578886015182559484019460019091019084016200059d565b5085821015620005dd5787850151600019600388901b60f8161c191681555b5050505050600190811b01905550565b61242680620005fd6000396000f3fe6080604052600436106102935760003560e01c8063715018a61161015a578063a22cb465116100c1578063cbccefb21161007a578063cbccefb2146107c2578063e985e9c5146107f0578063eee96f9614610839578063f2fde38b14610859578063f8b89dfb14610879578063f91ff6131461089957600080fd5b8063a22cb46514610702578063a2e6961314610722578063ad3e31b714610742578063b1dd5c9b14610762578063b88d4fde14610782578063c87b56dd146107a257600080fd5b8063806a8f3f11610113578063806a8f3f146106595780638708f5061461066c5780638da5cb5b1461069957806392b6a992146106b757806395d89b41146106cd57806397b92d24146106e257600080fd5b8063715018a6146105ae57806371b2686b146105c357806372e89f9d146105e3578063795f453e146105f65780637bcb2515146106235780638052a6341461063957600080fd5b806340362ff2116101fe578063588ef964116101b7578063588ef9641461050d57806360ecbb321461052d5780636352211e146105435780636c0360eb146105635780636d9e207b1461057857806370a082311461058e57600080fd5b806340362ff21461045557806341f434341461047557806342842e0e146104975780634f5985d7146104b7578063501a882b146104cd57806355f804b3146104ed57600080fd5b80631468b609116102505780631468b6091461038d57806318160ddd146103ad57806322f4596f146103ca57806323b872dd146103e05780632a55205a146104005780633ff488471461043f57600080fd5b806301ffc9a71461029857806302fa7c47146102cd57806306fdde03146102ef578063081812fc14610311578063095ea7b314610349578063096a027014610369575b600080fd5b3480156102a457600080fd5b506102b86102b3366004611cd4565b6108b9565b60405190151581526020015b60405180910390f35b3480156102d957600080fd5b506102ed6102e8366004611d0d565b610926565b005b3480156102fb57600080fd5b50610304610962565b6040516102c49190611da5565b34801561031d57600080fd5b5061033161032c366004611db8565b6109f4565b6040516001600160a01b0390911681526020016102c4565b34801561035557600080fd5b506102ed610364366004611dd1565b610a38565b34801561037557600080fd5b5061037f60105481565b6040519081526020016102c4565b34801561039957600080fd5b506102ed6103a8366004611db8565b610a51565b3480156103b957600080fd5b50600254600154036000190161037f565b3480156103d657600080fd5b5061037f600c5481565b3480156103ec57600080fd5b506102ed6103fb366004611dfb565b610a5e565b34801561040c57600080fd5b5061042061041b366004611e37565b610a89565b604080516001600160a01b0390931683526020830191909152016102c4565b34801561044b57600080fd5b5061037f600e5481565b34801561046157600080fd5b506102ed610470366004611e59565b610ab5565b34801561048157600080fd5b506103316daaeb6d7670e522a718067333cd4e81565b3480156104a357600080fd5b506102ed6104b2366004611dfb565b610adf565b3480156104c357600080fd5b5061037f60125481565b3480156104d957600080fd5b506102ed6104e8366004611dd1565b610b04565b3480156104f957600080fd5b506102ed610508366004611f00565b610b54565b34801561051957600080fd5b506102ed610528366004611db8565b610b68565b34801561053957600080fd5b5061037f60135481565b34801561054f57600080fd5b5061033161055e366004611db8565b610b97565b34801561056f57600080fd5b50610304610ba2565b34801561058457600080fd5b5061037f600f5481565b34801561059a57600080fd5b5061037f6105a9366004611e59565b610c30565b3480156105ba57600080fd5b506102ed610c7f565b3480156105cf57600080fd5b506102ed6105de366004611db8565b610c93565b6102ed6105f1366004611db8565b610ca0565b34801561060257600080fd5b5061037f610611366004611e59565b60156020526000908152604090205481565b34801561062f57600080fd5b5061037f60115481565b34801561064557600080fd5b506102ed610654366004611db8565b610e5a565b6102ed610667366004611f49565b610e67565b34801561067857600080fd5b5061037f610687366004611e59565b60146020526000908152604090205481565b3480156106a557600080fd5b506000546001600160a01b0316610331565b3480156106c357600080fd5b5061037f600d5481565b3480156106d957600080fd5b50610304611046565b3480156106ee57600080fd5b506102ed6106fd366004611db8565b611055565b34801561070e57600080fd5b506102ed61071d366004611fd6565b611062565b34801561072e57600080fd5b5061037f61073d366004611db8565b611076565b34801561074e57600080fd5b506102ed61075d366004611db8565b6110a0565b34801561076e57600080fd5b50600a54610331906001600160a01b031681565b34801561078e57600080fd5b506102ed61079d366004612002565b6110ad565b3480156107ae57600080fd5b506103046107bd366004611db8565b6110da565b3480156107ce57600080fd5b50600a546107e390600160a01b900460ff1681565b6040516102c49190612094565b3480156107fc57600080fd5b506102b861080b3660046120bc565b6001600160a01b03918216600090815260086020908152604080832093909416825291909152205460ff1690565b34801561084557600080fd5b506102ed610854366004611db8565b611134565b34801561086557600080fd5b506102ed610874366004611e59565b611141565b34801561088557600080fd5b506102ed6108943660046120ef565b6111bc565b3480156108a557600080fd5b506102ed6108b4366004611db8565b611203565b60006301ffc9a760e01b6001600160e01b0319831614806108ea57506380ac58cd60e01b6001600160e01b03198316145b80610905575063152a902d60e11b6001600160e01b03198316145b806109205750635b5e139f60e01b6001600160e01b03198316145b92915050565b61092e611210565b6bffffffffffffffffffffffff166001600160a01b03909116600160601b026bffffffffffffffffffffffff191617601655565b60606003805461097190612112565b80601f016020809104026020016040519081016040528092919081815260200182805461099d90612112565b80156109ea5780601f106109bf576101008083540402835291602001916109ea565b820191906000526020600020905b8154815290600101906020018083116109cd57829003601f168201915b5050505050905090565b60006109ff8261126a565b610a1c576040516333d1c03960e21b815260040160405180910390fd5b506000908152600760205260409020546001600160a01b031690565b81610a428161129f565b610a4c8383611358565b505050565b610a59611210565b600f55565b826001600160a01b0381163314610a7857610a783361129f565b610a83848484611415565b50505050565b6016546000908190600160601b90046001600160a01b0316610aaa84611076565b915091509250929050565b610abd611210565b601780546001600160a01b0319166001600160a01b0392909216919091179055565b826001600160a01b0381163314610af957610af93361129f565b610a838484846115cb565b610b0c611210565b600c546002546001548391900360001901610b279190612162565b1115610b4657604051638a164f6360e01b815260040160405180910390fd5b610b5082826115e6565b5050565b610b5c611210565b600b610b5082826121bb565b610b70611210565b600c548110610b925760405163c6ee900160e01b815260040160405180910390fd5b600c55565b600061092082611600565b600b8054610baf90612112565b80601f0160208091040260200160405190810160405280929190818152602001828054610bdb90612112565b8015610c285780601f10610bfd57610100808354040283529160200191610c28565b820191906000526020600020905b815481529060010190602001808311610c0b57829003601f168201915b505050505081565b60006001600160a01b038216610c59576040516323d3ad8160e21b815260040160405180910390fd5b506001600160a01b031660009081526006602052604090205467ffffffffffffffff1690565b610c87611210565b610c916000611676565b565b610c9b611210565b601255565b610ca86116c6565b323314610cc857604051637aafae9760e01b815260040160405180910390fd5b6002600a54600160a01b900460ff166003811115610ce857610ce861207e565b14610d065760405163f80c2fa960e01b815260040160405180910390fd5b600d546002546001548391900360001901610d219190612162565b1115610d405760405163306fb68b60e01b815260040160405180910390fd5b600c546002546001548391900360001901610d5b9190612162565b1115610d7a57604051638a164f6360e01b815260040160405180910390fd5b600f5433600090815260146020526040902054610d98908390612162565b1115610db757604051632b3a404b60e21b815260040160405180910390fd5b80601154610dc5919061227b565b341015610de557604051636956f2ab60e11b815260040160405180910390fd5b3360009081526014602052604081208054839290610e04908490612162565b90915550506017546040516001600160a01b03909116903480156108fc02916000818181858888f19350505050158015610e42573d6000803e3d6000fd5b50610e4d33826115e6565b610e576001600955565b50565b610e62611210565b601055565b610e6f6116c6565b323314610e8f57604051637aafae9760e01b815260040160405180910390fd5b6001600a54600160a01b900460ff166003811115610eaf57610eaf61207e565b14610ecd576040516318f35a5f60e01b815260040160405180910390fd5b610ed833838361171f565b610ef557604051630b094f2760e31b815260040160405180910390fd5b60105433600090815260156020526040902054610f13908590612162565b1115610f3257604051633abdf65960e01b815260040160405180910390fd5b600e546002546001548591900360001901610f4d9190612162565b1115610f6c5760405163b7f4cb7b60e01b815260040160405180910390fd5b600c546002546001548591900360001901610f879190612162565b1115610fa657604051638a164f6360e01b815260040160405180910390fd5b82601254610fb4919061227b565b341015610fd457604051636956f2ab60e11b815260040160405180910390fd5b3360009081526015602052604081208054859290610ff3908490612162565b90915550506017546040516001600160a01b03909116903480156108fc02916000818181858888f19350505050158015611031573d6000803e3d6000fd5b5061103c33846115e6565b610a4c6001600955565b60606004805461097190612112565b61105d611210565b600e55565b8161106c8161129f565b610a4c83836117a8565b6016546000906bffffffffffffffffffffffff1661109661271084612292565b610920919061227b565b6110a8611210565b601355565b836001600160a01b03811633146110c7576110c73361129f565b6110d38585858561183d565b5050505050565b60606110e58261126a565b6111025760405163b0ce759160e01b815260040160405180910390fd5b600b61110d83611881565b60405160200161111e9291906122b4565b6040516020818303038152906040529050919050565b61113c611210565b601155565b611149611210565b6001600160a01b0381166111b35760405162461bcd60e51b815260206004820152602660248201527f4f776e61626c653a206e6577206f776e657220697320746865207a65726f206160448201526564647265737360d01b60648201526084015b60405180910390fd5b610e5781611676565b6111c4611210565b8060ff1660038111156111d9576111d961207e565b600a805460ff60a01b1916600160a01b8360038111156111fb576111fb61207e565b021790555050565b61120b611210565b600d55565b6000546001600160a01b03163314610c915760405162461bcd60e51b815260206004820181905260248201527f4f776e61626c653a2063616c6c6572206973206e6f7420746865206f776e657260448201526064016111aa565b60008160011115801561127e575060015482105b8015610920575050600090815260056020526040902054600160e01b161590565b6daaeb6d7670e522a718067333cd4e3b15610e5757604051633185c44d60e21b81523060048201526001600160a01b03821660248201526daaeb6d7670e522a718067333cd4e9063c617113490604401602060405180830381865afa15801561130c573d6000803e3d6000fd5b505050506040513d601f19601f82011682018060405250810190611330919061234b565b610e5757604051633b79c77360e21b81526001600160a01b03821660048201526024016111aa565b600061136382610b97565b9050336001600160a01b038216146113b9576001600160a01b038116600090815260086020908152604080832033845290915290205460ff166113b9576040516367d9dca160e11b815260040160405180910390fd5b60008281526007602052604080822080546001600160a01b0319166001600160a01b0387811691821790925591518593918516917f8c5be1e5ebec7d5bd14f71427d1e84f3dd0314c0f7b2291e5b200ac8c7c3b92591a4505050565b600061142082611600565b9050836001600160a01b0316816001600160a01b0316146114535760405162a1148160e81b815260040160405180910390fd5b60008281526007602052604090208054338082146001600160a01b038816909114176114bd576001600160a01b038616600090815260086020908152604080832033845290915290205460ff166114bd57604051632ce44b5f60e11b815260040160405180910390fd5b6001600160a01b0385166114e457604051633a954ecd60e21b815260040160405180910390fd5b80156114ef57600082555b6001600160a01b038681166000908152600660205260408082208054600019019055918716808252919020805460010190554260a01b17600160e11b17600085815260056020526040812091909155600160e11b841690036115815760018401600081815260056020526040812054900361157f57600154811461157f5760008181526005602052604090208490555b505b83856001600160a01b0316876001600160a01b03167fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef60405160405180910390a45b505050505050565b610a4c838383604051806020016040528060008152506110ad565b610b50828260405180602001604052806000815250611914565b6000818060011161165d5760015481101561165d5760008181526005602052604081205490600160e01b8216900361165b575b80600003611654575060001901600081815260056020526040902054611633565b9392505050565b505b604051636f96cda160e11b815260040160405180910390fd5b600080546001600160a01b038381166001600160a01b0319831681178455604051919092169283917f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e09190a35050565b6002600954036117185760405162461bcd60e51b815260206004820152601f60248201527f5265656e7472616e637947756172643a207265656e7472616e742063616c6c0060448201526064016111aa565b6002600955565b60006117a0611767856040516bffffffffffffffffffffffff19606083901b166020820152600090603401604051602081830303815290604052805190602001209050919050565b84848080602002602001604051908101604052809392919081815260200183836020028082843760009201919091525061197a92505050565b949350505050565b336001600160a01b038316036117d15760405163b06307db60e01b815260040160405180910390fd5b3360008181526008602090815260408083206001600160a01b03871680855290835292819020805460ff191686151590811790915590519081529192917f17307eab39ab6107e8899845ad3d59bd9653f200f220920489ca2b5937696c31910160405180910390a35050565b611848848484610a5e565b6001600160a01b0383163b15610a835761186484848484611989565b610a83576040516368d2bf6b60e11b815260040160405180910390fd5b6060600061188e83611a74565b600101905060008167ffffffffffffffff8111156118ae576118ae611e74565b6040519080825280601f01601f1916602001820160405280156118d8576020820181803683370190505b5090508181016020015b600019016f181899199a1a9b1b9c1cb0b131b232b360811b600a86061a8153600a85049450846118e257509392505050565b61191e8383611b4c565b6001600160a01b0383163b15610a4c576001548281035b6119486000868380600101945086611989565b611965576040516368d2bf6b60e11b815260040160405180910390fd5b8181106119355781600154146110d357600080fd5b60006116548260135485611c2c565b604051630a85bd0160e11b81526000906001600160a01b0385169063150b7a02906119be903390899088908890600401612368565b6020604051808303816000875af19250505080156119f9575060408051601f3d908101601f191682019092526119f6918101906123a4565b60015b611a57573d808015611a27576040519150601f19603f3d011682016040523d82523d6000602084013e611a2c565b606091505b508051600003611a4f576040516368d2bf6b60e11b815260040160405180910390fd5b805181602001fd5b6001600160e01b031916630a85bd0160e11b149050949350505050565b60008072184f03e93ff9f4daa797ed6e38ed64bf6a1f0160401b8310611ab35772184f03e93ff9f4daa797ed6e38ed64bf6a1f0160401b830492506040015b6d04ee2d6d415b85acef81000000008310611adf576d04ee2d6d415b85acef8100000000830492506020015b662386f26fc100008310611afd57662386f26fc10000830492506010015b6305f5e1008310611b15576305f5e100830492506008015b6127108310611b2957612710830492506004015b60648310611b3b576064830492506002015b600a83106109205760010192915050565b6001546001600160a01b038316611b7557604051622e076360e81b815260040160405180910390fd5b81600003611b965760405163b562e8dd60e01b815260040160405180910390fd5b6001600160a01b038316600081815260066020526040902080546801000000000000000185020190554260a01b6001841460e11b1717600082815260056020526040902055808281015b6040516001830192906001600160a01b038716906000907fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef908290a4808210611be05760015550505050565b600082611c398584611c42565b14949350505050565b600081815b8451811015611c8757611c7382868381518110611c6657611c666123c1565b6020026020010151611c8f565b915080611c7f816123d7565b915050611c47565b509392505050565b6000818310611cab576000828152602084905260409020611654565b6000838152602083905260409020611654565b6001600160e01b031981168114610e5757600080fd5b600060208284031215611ce657600080fd5b813561165481611cbe565b80356001600160a01b0381168114611d0857600080fd5b919050565b60008060408385031215611d2057600080fd5b611d2983611cf1565b915060208301356bffffffffffffffffffffffff81168114611d4a57600080fd5b809150509250929050565b60005b83811015611d70578181015183820152602001611d58565b50506000910152565b60008151808452611d91816020860160208601611d55565b601f01601f19169290920160200192915050565b6020815260006116546020830184611d79565b600060208284031215611dca57600080fd5b5035919050565b60008060408385031215611de457600080fd5b611ded83611cf1565b946020939093013593505050565b600080600060608486031215611e1057600080fd5b611e1984611cf1565b9250611e2760208501611cf1565b9150604084013590509250925092565b60008060408385031215611e4a57600080fd5b50508035926020909101359150565b600060208284031215611e6b57600080fd5b61165482611cf1565b634e487b7160e01b600052604160045260246000fd5b600067ffffffffffffffff80841115611ea557611ea5611e74565b604051601f8501601f19908116603f01168101908282118183101715611ecd57611ecd611e74565b81604052809350858152868686011115611ee657600080fd5b858560208301376000602087830101525050509392505050565b600060208284031215611f1257600080fd5b813567ffffffffffffffff811115611f2957600080fd5b8201601f81018413611f3a57600080fd5b6117a084823560208401611e8a565b600080600060408486031215611f5e57600080fd5b83359250602084013567ffffffffffffffff80821115611f7d57600080fd5b818601915086601f830112611f9157600080fd5b813581811115611fa057600080fd5b8760208260051b8501011115611fb557600080fd5b6020830194508093505050509250925092565b8015158114610e5757600080fd5b60008060408385031215611fe957600080fd5b611ff283611cf1565b91506020830135611d4a81611fc8565b6000806000806080858703121561201857600080fd5b61202185611cf1565b935061202f60208601611cf1565b925060408501359150606085013567ffffffffffffffff81111561205257600080fd5b8501601f8101871361206357600080fd5b61207287823560208401611e8a565b91505092959194509250565b634e487b7160e01b600052602160045260246000fd5b60208101600483106120b657634e487b7160e01b600052602160045260246000fd5b91905290565b600080604083850312156120cf57600080fd5b6120d883611cf1565b91506120e660208401611cf1565b90509250929050565b60006020828403121561210157600080fd5b813560ff8116811461165457600080fd5b600181811c9082168061212657607f821691505b60208210810361214657634e487b7160e01b600052602260045260246000fd5b50919050565b634e487b7160e01b600052601160045260246000fd5b808201808211156109205761092061214c565b601f821115610a4c57600081815260208120601f850160051c8101602086101561219c5750805b601f850160051c820191505b818110156115c3578281556001016121a8565b815167ffffffffffffffff8111156121d5576121d5611e74565b6121e9816121e38454612112565b84612175565b602080601f83116001811461221e57600084156122065750858301515b600019600386901b1c1916600185901b1785556115c3565b600085815260208120601f198616915b8281101561224d5788860151825594840194600190910190840161222e565b508582101561226b5787850151600019600388901b60f8161c191681555b5050505050600190811b01905550565b80820281158282048414176109205761092061214c565b6000826122af57634e487b7160e01b600052601260045260246000fd5b500490565b60008084546122c281612112565b600182811680156122da57600181146122ef5761231e565b60ff198416875282151583028701945061231e565b8860005260208060002060005b858110156123155781548a8201529084019082016122fc565b50505082870194505b505050508351612332818360208801611d55565b64173539b7b760d91b9101908152600501949350505050565b60006020828403121561235d57600080fd5b815161165481611fc8565b60006001600160a01b0380871683528086166020840152508360408301526080606083015261239a6080830184611d79565b9695505050505050565b6000602082840312156123b657600080fd5b815161165481611cbe565b634e487b7160e01b600052603260045260246000fd5b6000600182016123e9576123e961214c565b506001019056fea2646970667358221220d59f1301015b9d3b3d5ea1575afee6846314d1a3036f900f905a9512a7ffcb2a64736f6c63430008110033000000000000000000000000287085f5e6760c422e0f8dc6e42ab2d6ad27b604aceb0d88a70e706566170ca5537fa17b5adbbf68240bc149698dd5d72b77832500000000000000000000000000000000000000000000000000000000000000c000000000000000000000000000000000000000000000000000000000000003e800000000000000000000000036b4936f9caf50e0be537dd91353e90acd7c5ff600000000000000000000000036b4936f9caf50e0be537dd91353e90acd7c5ff6000000000000000000000000000000000000000000000000000000000000000c747275646f70652e6172742f0000000000000000000000000000000000000000

Deployed Bytecode

0x6080604052600436106102935760003560e01c8063715018a61161015a578063a22cb465116100c1578063cbccefb21161007a578063cbccefb2146107c2578063e985e9c5146107f0578063eee96f9614610839578063f2fde38b14610859578063f8b89dfb14610879578063f91ff6131461089957600080fd5b8063a22cb46514610702578063a2e6961314610722578063ad3e31b714610742578063b1dd5c9b14610762578063b88d4fde14610782578063c87b56dd146107a257600080fd5b8063806a8f3f11610113578063806a8f3f146106595780638708f5061461066c5780638da5cb5b1461069957806392b6a992146106b757806395d89b41146106cd57806397b92d24146106e257600080fd5b8063715018a6146105ae57806371b2686b146105c357806372e89f9d146105e3578063795f453e146105f65780637bcb2515146106235780638052a6341461063957600080fd5b806340362ff2116101fe578063588ef964116101b7578063588ef9641461050d57806360ecbb321461052d5780636352211e146105435780636c0360eb146105635780636d9e207b1461057857806370a082311461058e57600080fd5b806340362ff21461045557806341f434341461047557806342842e0e146104975780634f5985d7146104b7578063501a882b146104cd57806355f804b3146104ed57600080fd5b80631468b609116102505780631468b6091461038d57806318160ddd146103ad57806322f4596f146103ca57806323b872dd146103e05780632a55205a146104005780633ff488471461043f57600080fd5b806301ffc9a71461029857806302fa7c47146102cd57806306fdde03146102ef578063081812fc14610311578063095ea7b314610349578063096a027014610369575b600080fd5b3480156102a457600080fd5b506102b86102b3366004611cd4565b6108b9565b60405190151581526020015b60405180910390f35b3480156102d957600080fd5b506102ed6102e8366004611d0d565b610926565b005b3480156102fb57600080fd5b50610304610962565b6040516102c49190611da5565b34801561031d57600080fd5b5061033161032c366004611db8565b6109f4565b6040516001600160a01b0390911681526020016102c4565b34801561035557600080fd5b506102ed610364366004611dd1565b610a38565b34801561037557600080fd5b5061037f60105481565b6040519081526020016102c4565b34801561039957600080fd5b506102ed6103a8366004611db8565b610a51565b3480156103b957600080fd5b50600254600154036000190161037f565b3480156103d657600080fd5b5061037f600c5481565b3480156103ec57600080fd5b506102ed6103fb366004611dfb565b610a5e565b34801561040c57600080fd5b5061042061041b366004611e37565b610a89565b604080516001600160a01b0390931683526020830191909152016102c4565b34801561044b57600080fd5b5061037f600e5481565b34801561046157600080fd5b506102ed610470366004611e59565b610ab5565b34801561048157600080fd5b506103316daaeb6d7670e522a718067333cd4e81565b3480156104a357600080fd5b506102ed6104b2366004611dfb565b610adf565b3480156104c357600080fd5b5061037f60125481565b3480156104d957600080fd5b506102ed6104e8366004611dd1565b610b04565b3480156104f957600080fd5b506102ed610508366004611f00565b610b54565b34801561051957600080fd5b506102ed610528366004611db8565b610b68565b34801561053957600080fd5b5061037f60135481565b34801561054f57600080fd5b5061033161055e366004611db8565b610b97565b34801561056f57600080fd5b50610304610ba2565b34801561058457600080fd5b5061037f600f5481565b34801561059a57600080fd5b5061037f6105a9366004611e59565b610c30565b3480156105ba57600080fd5b506102ed610c7f565b3480156105cf57600080fd5b506102ed6105de366004611db8565b610c93565b6102ed6105f1366004611db8565b610ca0565b34801561060257600080fd5b5061037f610611366004611e59565b60156020526000908152604090205481565b34801561062f57600080fd5b5061037f60115481565b34801561064557600080fd5b506102ed610654366004611db8565b610e5a565b6102ed610667366004611f49565b610e67565b34801561067857600080fd5b5061037f610687366004611e59565b60146020526000908152604090205481565b3480156106a557600080fd5b506000546001600160a01b0316610331565b3480156106c357600080fd5b5061037f600d5481565b3480156106d957600080fd5b50610304611046565b3480156106ee57600080fd5b506102ed6106fd366004611db8565b611055565b34801561070e57600080fd5b506102ed61071d366004611fd6565b611062565b34801561072e57600080fd5b5061037f61073d366004611db8565b611076565b34801561074e57600080fd5b506102ed61075d366004611db8565b6110a0565b34801561076e57600080fd5b50600a54610331906001600160a01b031681565b34801561078e57600080fd5b506102ed61079d366004612002565b6110ad565b3480156107ae57600080fd5b506103046107bd366004611db8565b6110da565b3480156107ce57600080fd5b50600a546107e390600160a01b900460ff1681565b6040516102c49190612094565b3480156107fc57600080fd5b506102b861080b3660046120bc565b6001600160a01b03918216600090815260086020908152604080832093909416825291909152205460ff1690565b34801561084557600080fd5b506102ed610854366004611db8565b611134565b34801561086557600080fd5b506102ed610874366004611e59565b611141565b34801561088557600080fd5b506102ed6108943660046120ef565b6111bc565b3480156108a557600080fd5b506102ed6108b4366004611db8565b611203565b60006301ffc9a760e01b6001600160e01b0319831614806108ea57506380ac58cd60e01b6001600160e01b03198316145b80610905575063152a902d60e11b6001600160e01b03198316145b806109205750635b5e139f60e01b6001600160e01b03198316145b92915050565b61092e611210565b6bffffffffffffffffffffffff166001600160a01b03909116600160601b026bffffffffffffffffffffffff191617601655565b60606003805461097190612112565b80601f016020809104026020016040519081016040528092919081815260200182805461099d90612112565b80156109ea5780601f106109bf576101008083540402835291602001916109ea565b820191906000526020600020905b8154815290600101906020018083116109cd57829003601f168201915b5050505050905090565b60006109ff8261126a565b610a1c576040516333d1c03960e21b815260040160405180910390fd5b506000908152600760205260409020546001600160a01b031690565b81610a428161129f565b610a4c8383611358565b505050565b610a59611210565b600f55565b826001600160a01b0381163314610a7857610a783361129f565b610a83848484611415565b50505050565b6016546000908190600160601b90046001600160a01b0316610aaa84611076565b915091509250929050565b610abd611210565b601780546001600160a01b0319166001600160a01b0392909216919091179055565b826001600160a01b0381163314610af957610af93361129f565b610a838484846115cb565b610b0c611210565b600c546002546001548391900360001901610b279190612162565b1115610b4657604051638a164f6360e01b815260040160405180910390fd5b610b5082826115e6565b5050565b610b5c611210565b600b610b5082826121bb565b610b70611210565b600c548110610b925760405163c6ee900160e01b815260040160405180910390fd5b600c55565b600061092082611600565b600b8054610baf90612112565b80601f0160208091040260200160405190810160405280929190818152602001828054610bdb90612112565b8015610c285780601f10610bfd57610100808354040283529160200191610c28565b820191906000526020600020905b815481529060010190602001808311610c0b57829003601f168201915b505050505081565b60006001600160a01b038216610c59576040516323d3ad8160e21b815260040160405180910390fd5b506001600160a01b031660009081526006602052604090205467ffffffffffffffff1690565b610c87611210565b610c916000611676565b565b610c9b611210565b601255565b610ca86116c6565b323314610cc857604051637aafae9760e01b815260040160405180910390fd5b6002600a54600160a01b900460ff166003811115610ce857610ce861207e565b14610d065760405163f80c2fa960e01b815260040160405180910390fd5b600d546002546001548391900360001901610d219190612162565b1115610d405760405163306fb68b60e01b815260040160405180910390fd5b600c546002546001548391900360001901610d5b9190612162565b1115610d7a57604051638a164f6360e01b815260040160405180910390fd5b600f5433600090815260146020526040902054610d98908390612162565b1115610db757604051632b3a404b60e21b815260040160405180910390fd5b80601154610dc5919061227b565b341015610de557604051636956f2ab60e11b815260040160405180910390fd5b3360009081526014602052604081208054839290610e04908490612162565b90915550506017546040516001600160a01b03909116903480156108fc02916000818181858888f19350505050158015610e42573d6000803e3d6000fd5b50610e4d33826115e6565b610e576001600955565b50565b610e62611210565b601055565b610e6f6116c6565b323314610e8f57604051637aafae9760e01b815260040160405180910390fd5b6001600a54600160a01b900460ff166003811115610eaf57610eaf61207e565b14610ecd576040516318f35a5f60e01b815260040160405180910390fd5b610ed833838361171f565b610ef557604051630b094f2760e31b815260040160405180910390fd5b60105433600090815260156020526040902054610f13908590612162565b1115610f3257604051633abdf65960e01b815260040160405180910390fd5b600e546002546001548591900360001901610f4d9190612162565b1115610f6c5760405163b7f4cb7b60e01b815260040160405180910390fd5b600c546002546001548591900360001901610f879190612162565b1115610fa657604051638a164f6360e01b815260040160405180910390fd5b82601254610fb4919061227b565b341015610fd457604051636956f2ab60e11b815260040160405180910390fd5b3360009081526015602052604081208054859290610ff3908490612162565b90915550506017546040516001600160a01b03909116903480156108fc02916000818181858888f19350505050158015611031573d6000803e3d6000fd5b5061103c33846115e6565b610a4c6001600955565b60606004805461097190612112565b61105d611210565b600e55565b8161106c8161129f565b610a4c83836117a8565b6016546000906bffffffffffffffffffffffff1661109661271084612292565b610920919061227b565b6110a8611210565b601355565b836001600160a01b03811633146110c7576110c73361129f565b6110d38585858561183d565b5050505050565b60606110e58261126a565b6111025760405163b0ce759160e01b815260040160405180910390fd5b600b61110d83611881565b60405160200161111e9291906122b4565b6040516020818303038152906040529050919050565b61113c611210565b601155565b611149611210565b6001600160a01b0381166111b35760405162461bcd60e51b815260206004820152602660248201527f4f776e61626c653a206e6577206f776e657220697320746865207a65726f206160448201526564647265737360d01b60648201526084015b60405180910390fd5b610e5781611676565b6111c4611210565b8060ff1660038111156111d9576111d961207e565b600a805460ff60a01b1916600160a01b8360038111156111fb576111fb61207e565b021790555050565b61120b611210565b600d55565b6000546001600160a01b03163314610c915760405162461bcd60e51b815260206004820181905260248201527f4f776e61626c653a2063616c6c6572206973206e6f7420746865206f776e657260448201526064016111aa565b60008160011115801561127e575060015482105b8015610920575050600090815260056020526040902054600160e01b161590565b6daaeb6d7670e522a718067333cd4e3b15610e5757604051633185c44d60e21b81523060048201526001600160a01b03821660248201526daaeb6d7670e522a718067333cd4e9063c617113490604401602060405180830381865afa15801561130c573d6000803e3d6000fd5b505050506040513d601f19601f82011682018060405250810190611330919061234b565b610e5757604051633b79c77360e21b81526001600160a01b03821660048201526024016111aa565b600061136382610b97565b9050336001600160a01b038216146113b9576001600160a01b038116600090815260086020908152604080832033845290915290205460ff166113b9576040516367d9dca160e11b815260040160405180910390fd5b60008281526007602052604080822080546001600160a01b0319166001600160a01b0387811691821790925591518593918516917f8c5be1e5ebec7d5bd14f71427d1e84f3dd0314c0f7b2291e5b200ac8c7c3b92591a4505050565b600061142082611600565b9050836001600160a01b0316816001600160a01b0316146114535760405162a1148160e81b815260040160405180910390fd5b60008281526007602052604090208054338082146001600160a01b038816909114176114bd576001600160a01b038616600090815260086020908152604080832033845290915290205460ff166114bd57604051632ce44b5f60e11b815260040160405180910390fd5b6001600160a01b0385166114e457604051633a954ecd60e21b815260040160405180910390fd5b80156114ef57600082555b6001600160a01b038681166000908152600660205260408082208054600019019055918716808252919020805460010190554260a01b17600160e11b17600085815260056020526040812091909155600160e11b841690036115815760018401600081815260056020526040812054900361157f57600154811461157f5760008181526005602052604090208490555b505b83856001600160a01b0316876001600160a01b03167fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef60405160405180910390a45b505050505050565b610a4c838383604051806020016040528060008152506110ad565b610b50828260405180602001604052806000815250611914565b6000818060011161165d5760015481101561165d5760008181526005602052604081205490600160e01b8216900361165b575b80600003611654575060001901600081815260056020526040902054611633565b9392505050565b505b604051636f96cda160e11b815260040160405180910390fd5b600080546001600160a01b038381166001600160a01b0319831681178455604051919092169283917f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e09190a35050565b6002600954036117185760405162461bcd60e51b815260206004820152601f60248201527f5265656e7472616e637947756172643a207265656e7472616e742063616c6c0060448201526064016111aa565b6002600955565b60006117a0611767856040516bffffffffffffffffffffffff19606083901b166020820152600090603401604051602081830303815290604052805190602001209050919050565b84848080602002602001604051908101604052809392919081815260200183836020028082843760009201919091525061197a92505050565b949350505050565b336001600160a01b038316036117d15760405163b06307db60e01b815260040160405180910390fd5b3360008181526008602090815260408083206001600160a01b03871680855290835292819020805460ff191686151590811790915590519081529192917f17307eab39ab6107e8899845ad3d59bd9653f200f220920489ca2b5937696c31910160405180910390a35050565b611848848484610a5e565b6001600160a01b0383163b15610a835761186484848484611989565b610a83576040516368d2bf6b60e11b815260040160405180910390fd5b6060600061188e83611a74565b600101905060008167ffffffffffffffff8111156118ae576118ae611e74565b6040519080825280601f01601f1916602001820160405280156118d8576020820181803683370190505b5090508181016020015b600019016f181899199a1a9b1b9c1cb0b131b232b360811b600a86061a8153600a85049450846118e257509392505050565b61191e8383611b4c565b6001600160a01b0383163b15610a4c576001548281035b6119486000868380600101945086611989565b611965576040516368d2bf6b60e11b815260040160405180910390fd5b8181106119355781600154146110d357600080fd5b60006116548260135485611c2c565b604051630a85bd0160e11b81526000906001600160a01b0385169063150b7a02906119be903390899088908890600401612368565b6020604051808303816000875af19250505080156119f9575060408051601f3d908101601f191682019092526119f6918101906123a4565b60015b611a57573d808015611a27576040519150601f19603f3d011682016040523d82523d6000602084013e611a2c565b606091505b508051600003611a4f576040516368d2bf6b60e11b815260040160405180910390fd5b805181602001fd5b6001600160e01b031916630a85bd0160e11b149050949350505050565b60008072184f03e93ff9f4daa797ed6e38ed64bf6a1f0160401b8310611ab35772184f03e93ff9f4daa797ed6e38ed64bf6a1f0160401b830492506040015b6d04ee2d6d415b85acef81000000008310611adf576d04ee2d6d415b85acef8100000000830492506020015b662386f26fc100008310611afd57662386f26fc10000830492506010015b6305f5e1008310611b15576305f5e100830492506008015b6127108310611b2957612710830492506004015b60648310611b3b576064830492506002015b600a83106109205760010192915050565b6001546001600160a01b038316611b7557604051622e076360e81b815260040160405180910390fd5b81600003611b965760405163b562e8dd60e01b815260040160405180910390fd5b6001600160a01b038316600081815260066020526040902080546801000000000000000185020190554260a01b6001841460e11b1717600082815260056020526040902055808281015b6040516001830192906001600160a01b038716906000907fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef908290a4808210611be05760015550505050565b600082611c398584611c42565b14949350505050565b600081815b8451811015611c8757611c7382868381518110611c6657611c666123c1565b6020026020010151611c8f565b915080611c7f816123d7565b915050611c47565b509392505050565b6000818310611cab576000828152602084905260409020611654565b6000838152602083905260409020611654565b6001600160e01b031981168114610e5757600080fd5b600060208284031215611ce657600080fd5b813561165481611cbe565b80356001600160a01b0381168114611d0857600080fd5b919050565b60008060408385031215611d2057600080fd5b611d2983611cf1565b915060208301356bffffffffffffffffffffffff81168114611d4a57600080fd5b809150509250929050565b60005b83811015611d70578181015183820152602001611d58565b50506000910152565b60008151808452611d91816020860160208601611d55565b601f01601f19169290920160200192915050565b6020815260006116546020830184611d79565b600060208284031215611dca57600080fd5b5035919050565b60008060408385031215611de457600080fd5b611ded83611cf1565b946020939093013593505050565b600080600060608486031215611e1057600080fd5b611e1984611cf1565b9250611e2760208501611cf1565b9150604084013590509250925092565b60008060408385031215611e4a57600080fd5b50508035926020909101359150565b600060208284031215611e6b57600080fd5b61165482611cf1565b634e487b7160e01b600052604160045260246000fd5b600067ffffffffffffffff80841115611ea557611ea5611e74565b604051601f8501601f19908116603f01168101908282118183101715611ecd57611ecd611e74565b81604052809350858152868686011115611ee657600080fd5b858560208301376000602087830101525050509392505050565b600060208284031215611f1257600080fd5b813567ffffffffffffffff811115611f2957600080fd5b8201601f81018413611f3a57600080fd5b6117a084823560208401611e8a565b600080600060408486031215611f5e57600080fd5b83359250602084013567ffffffffffffffff80821115611f7d57600080fd5b818601915086601f830112611f9157600080fd5b813581811115611fa057600080fd5b8760208260051b8501011115611fb557600080fd5b6020830194508093505050509250925092565b8015158114610e5757600080fd5b60008060408385031215611fe957600080fd5b611ff283611cf1565b91506020830135611d4a81611fc8565b6000806000806080858703121561201857600080fd5b61202185611cf1565b935061202f60208601611cf1565b925060408501359150606085013567ffffffffffffffff81111561205257600080fd5b8501601f8101871361206357600080fd5b61207287823560208401611e8a565b91505092959194509250565b634e487b7160e01b600052602160045260246000fd5b60208101600483106120b657634e487b7160e01b600052602160045260246000fd5b91905290565b600080604083850312156120cf57600080fd5b6120d883611cf1565b91506120e660208401611cf1565b90509250929050565b60006020828403121561210157600080fd5b813560ff8116811461165457600080fd5b600181811c9082168061212657607f821691505b60208210810361214657634e487b7160e01b600052602260045260246000fd5b50919050565b634e487b7160e01b600052601160045260246000fd5b808201808211156109205761092061214c565b601f821115610a4c57600081815260208120601f850160051c8101602086101561219c5750805b601f850160051c820191505b818110156115c3578281556001016121a8565b815167ffffffffffffffff8111156121d5576121d5611e74565b6121e9816121e38454612112565b84612175565b602080601f83116001811461221e57600084156122065750858301515b600019600386901b1c1916600185901b1785556115c3565b600085815260208120601f198616915b8281101561224d5788860151825594840194600190910190840161222e565b508582101561226b5787850151600019600388901b60f8161c191681555b5050505050600190811b01905550565b80820281158282048414176109205761092061214c565b6000826122af57634e487b7160e01b600052601260045260246000fd5b500490565b60008084546122c281612112565b600182811680156122da57600181146122ef5761231e565b60ff198416875282151583028701945061231e565b8860005260208060002060005b858110156123155781548a8201529084019082016122fc565b50505082870194505b505050508351612332818360208801611d55565b64173539b7b760d91b9101908152600501949350505050565b60006020828403121561235d57600080fd5b815161165481611fc8565b60006001600160a01b0380871683528086166020840152508360408301526080606083015261239a6080830184611d79565b9695505050505050565b6000602082840312156123b657600080fd5b815161165481611cbe565b634e487b7160e01b600052603260045260246000fd5b6000600182016123e9576123e961214c565b506001019056fea2646970667358221220d59f1301015b9d3b3d5ea1575afee6846314d1a3036f900f905a9512a7ffcb2a64736f6c63430008110033

Constructor Arguments (ABI-Encoded and is the last bytes of the Contract Creation Code above)

000000000000000000000000287085f5e6760c422e0f8dc6e42ab2d6ad27b604aceb0d88a70e706566170ca5537fa17b5adbbf68240bc149698dd5d72b77832500000000000000000000000000000000000000000000000000000000000000c000000000000000000000000000000000000000000000000000000000000003e800000000000000000000000036b4936f9caf50e0be537dd91353e90acd7c5ff600000000000000000000000036b4936f9caf50e0be537dd91353e90acd7c5ff6000000000000000000000000000000000000000000000000000000000000000c747275646f70652e6172742f0000000000000000000000000000000000000000

-----Decoded View---------------
Arg [0] : blacklist_ (address): 0x287085F5E6760c422E0F8dc6e42ab2d6AD27b604
Arg [1] : merkleRootDopeInflationReduction_ (bytes32): 0xaceb0d88a70e706566170ca5537fa17b5adbbf68240bc149698dd5d72b778325
Arg [2] : baseURI_ (string): trudope.art/
Arg [3] : royaltyFeesInBips_ (uint96): 1000
Arg [4] : royaltyReceiver_ (address): 0x36B4936F9CAf50E0bE537dd91353E90Acd7c5ff6
Arg [5] : payments_ (address): 0x36B4936F9CAf50E0bE537dd91353E90Acd7c5ff6

-----Encoded View---------------
8 Constructor Arguments found :
Arg [0] : 000000000000000000000000287085f5e6760c422e0f8dc6e42ab2d6ad27b604
Arg [1] : aceb0d88a70e706566170ca5537fa17b5adbbf68240bc149698dd5d72b778325
Arg [2] : 00000000000000000000000000000000000000000000000000000000000000c0
Arg [3] : 00000000000000000000000000000000000000000000000000000000000003e8
Arg [4] : 00000000000000000000000036b4936f9caf50e0be537dd91353e90acd7c5ff6
Arg [5] : 00000000000000000000000036b4936f9caf50e0be537dd91353e90acd7c5ff6
Arg [6] : 000000000000000000000000000000000000000000000000000000000000000c
Arg [7] : 747275646f70652e6172742f0000000000000000000000000000000000000000


Loading...
Loading
[ Download: CSV Export  ]

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