ERC-721
Overview
Max Total Supply
1,402 BLURPUNK
Holders
689
Market
Volume (24H)
N/A
Min Price (24H)
N/A
Max Price (24H)
N/A
Other Info
Token Contract
Balance
2 BLURPUNKLoading...
Loading
Loading...
Loading
Loading...
Loading
# | Exchange | Pair | Price | 24H Volume | % Volume |
---|
Contract Name:
BlurPunk
Compiler Version
v0.8.15+commit.e14f2714
Optimization Enabled:
Yes with 200 runs
Other Settings:
default evmVersion
Contract Source Code (Solidity Standard Json-Input format)
//SPDX-License-Identifier: Unlicense pragma solidity 0.8.15; import "@openzeppelin/contracts/utils/cryptography/MerkleProof.sol"; import "@openzeppelin/contracts/utils/Strings.sol"; import "erc721a/contracts/ERC721A.sol"; contract BlurPunk is ERC721A { using Strings for uint256; uint256 public constant MAX_SUPPLY = 1402; uint256 public constant MAX_MINT_WHITELIST = 2; uint256 public constant MAX_MINT_PER_TX_PUBLIC = 3; uint256 public constant START_TOKEN_ID = 1; uint256 public price = 0.01402 ether; string public baseURI; string internal baseExtension = ".json"; Stage public stage = Stage.Pause; address private WITHDRAW_ADDRESS; bool public founderMintStatus = false; bytes32 public merkleRoot; mapping(address => uint256) public whitelistClaimed; enum Stage { Pause, Whitelist, Public } event StageChanged(Stage from, Stage to); function setStage(Stage _stage) external onlyOwner { require(stage != _stage, "BlurPunk: invalid stage."); Stage prevStage = stage; stage = _stage; emit StageChanged(prevStage, stage); } address public immutable owner; modifier onlyOwner() { require(owner == msg.sender, "BlurPunk: not owner"); _; } /** * @dev Constructor function * @param _merkleRoot bytes32 Merkle root */ constructor(bytes32 _merkleRoot) ERC721A("BlurPunk", "BLURPUNK") { owner = msg.sender; merkleRoot = _merkleRoot; } /** * @dev Returns the token ID * @return uint256 token ID * override start token id */ function _startTokenId() internal view virtual override returns (uint256) { return START_TOKEN_ID; } function toBytes32(address addr) internal pure returns (bytes32) { return bytes32(uint256(uint160(addr))); } function whitelistMint(bytes32[] calldata merkleProof, uint256 quantity) public payable { require(stage == Stage.Whitelist, "BlurPunk: not whitelist mint stage"); require( quantity <= MAX_MINT_WHITELIST, "BlurPunk: exceed max mint per account" ); require(msg.value == price * quantity, "BlurPunk: not enough ether"); require( whitelistClaimed[msg.sender] < MAX_MINT_WHITELIST, "BlurPunk: already claimed max quantity" ); require( whitelistClaimed[msg.sender] + quantity <= MAX_MINT_WHITELIST, "BlurPunk: already claimed max quantity" ); require( MerkleProof.verify( merkleProof, merkleRoot, toBytes32(msg.sender) ) == true, "invalid merkle proof" ); require( totalSupply() + quantity <= MAX_SUPPLY, "BlurPunk: exceed max supply" ); whitelistClaimed[msg.sender] = whitelistClaimed[msg.sender] + quantity; _mint(msg.sender, quantity); } function publicMint(uint256 quantity) public payable { require(stage == Stage.Public, "BlurPunk: not public mint stage"); require( quantity <= MAX_MINT_PER_TX_PUBLIC, "BlurPunk: exceed max mint per tx" ); require(msg.value == price * quantity, "BlurPunk: not enough ether"); require( totalSupply() + quantity <= MAX_SUPPLY, "BlurPunk: exceed max supply" ); _mint(msg.sender, quantity); } function founderMint(address _to, uint256 quantity) public onlyOwner { require(quantity == 50, "BlurPunk: founder mint quantity must be 50"); require( founderMintStatus == false, "BlurPunk: founder mint already minted" ); require( totalSupply() + quantity <= MAX_SUPPLY, "BlurPunk: exceed max supply" ); _mint(_to, quantity); founderMintStatus = true; } function tokenURI(uint256 tokenId) public view virtual override returns (string memory) { require(_exists(tokenId), "BlurPunk: not exist"); string memory currentBaseURI = _baseURI(); return ( bytes(currentBaseURI).length > 0 ? string( abi.encodePacked( currentBaseURI, tokenId.toString(), baseExtension ) ) : "" ); } function _baseURI() internal view virtual override returns (string memory) { return baseURI; } function setPrice(uint256 _price) external onlyOwner { price = _price; } function setBaseURI(string memory _newBaseURI) external onlyOwner { baseURI = _newBaseURI; } function setMerkleRoot(bytes32 _newMerkleRoot) external onlyOwner { merkleRoot = _newMerkleRoot; } function setWithdrawAddress(address _newWithdrawAddress) external onlyOwner { WITHDRAW_ADDRESS = _newWithdrawAddress; } function withdrawAll() external onlyOwner { uint256 balance = address(this).balance; require(balance > 0, "No ETH to withdraw"); require(WITHDRAW_ADDRESS != address(0), "No withdraw address"); _withdraw(WITHDRAW_ADDRESS, address(this).balance); } function _withdraw(address _address, uint256 _amount) private { (bool success, ) = _address.call{value: _amount}(""); require(success, "Transfer failed"); } }
// SPDX-License-Identifier: MIT // OpenZeppelin Contracts (last updated v4.8.0) (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 rebuild 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 totalHashes = proofFlags.length; // Check proof validity. require(leavesLen + proof.length - 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 for 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) { 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 rebuild 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 totalHashes = proofFlags.length; // Check proof validity. require(leavesLen + proof.length - 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 for 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) { 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) } } }
// SPDX-License-Identifier: MIT // OpenZeppelin Contracts (last updated v4.8.0) (utils/Strings.sol) pragma solidity ^0.8.0; import "./math/Math.sol"; /** * @dev String operations. */ library Strings { bytes16 private constant _SYMBOLS = "0123456789abcdef"; uint8 private constant _ADDRESS_LENGTH = 20; /** * @dev Converts a `uint256` to its ASCII `string` decimal representation. */ function toString(uint256 value) internal pure returns (string memory) { unchecked { uint256 length = Math.log10(value) + 1; string memory buffer = new string(length); uint256 ptr; /// @solidity memory-safe-assembly assembly { ptr := add(buffer, add(32, length)) } while (true) { ptr--; /// @solidity memory-safe-assembly assembly { mstore8(ptr, byte(mod(value, 10), _SYMBOLS)) } value /= 10; if (value == 0) break; } return buffer; } } /** * @dev Converts a `uint256` to its ASCII `string` hexadecimal representation. */ function toHexString(uint256 value) internal pure returns (string memory) { unchecked { return toHexString(value, Math.log256(value) + 1); } } /** * @dev Converts a `uint256` to its ASCII `string` hexadecimal representation with fixed length. */ function toHexString(uint256 value, uint256 length) internal pure returns (string memory) { bytes memory buffer = new bytes(2 * length + 2); buffer[0] = "0"; buffer[1] = "x"; for (uint256 i = 2 * length + 1; i > 1; --i) { buffer[i] = _SYMBOLS[value & 0xf]; value >>= 4; } require(value == 0, "Strings: hex length insufficient"); return string(buffer); } /** * @dev Converts an `address` with fixed length of 20 bytes to its not checksummed ASCII `string` hexadecimal representation. */ function toHexString(address addr) internal pure returns (string memory) { return toHexString(uint256(uint160(addr)), _ADDRESS_LENGTH); } }
// SPDX-License-Identifier: MIT // ERC721A Contracts v4.2.3 // Creator: Chiru Labs pragma solidity ^0.8.4; import './IERC721A.sol'; /** * @dev Interface of ERC721 token receiver. */ interface ERC721A__IERC721Receiver { function onERC721Received( address operator, address from, uint256 tokenId, bytes calldata data ) external returns (bytes4); } /** * @title ERC721A * * @dev Implementation of the [ERC721](https://eips.ethereum.org/EIPS/eip-721) * Non-Fungible Token Standard, including the Metadata extension. * Optimized for lower gas during batch mints. * * Token IDs are minted in sequential order (e.g. 0, 1, 2, 3, ...) * starting from `_startTokenId()`. * * Assumptions: * * - An owner cannot have more than 2**64 - 1 (max value of uint64) of supply. * - The maximum token ID cannot exceed 2**256 - 1 (max value of uint256). */ contract ERC721A is IERC721A { // Bypass for a `--via-ir` bug (https://github.com/chiru-labs/ERC721A/pull/364). struct TokenApprovalRef { address value; } // ============================================================= // CONSTANTS // ============================================================= // Mask of an entry in packed address data. uint256 private constant _BITMASK_ADDRESS_DATA_ENTRY = (1 << 64) - 1; // The bit position of `numberMinted` in packed address data. uint256 private constant _BITPOS_NUMBER_MINTED = 64; // The bit position of `numberBurned` in packed address data. uint256 private constant _BITPOS_NUMBER_BURNED = 128; // The bit position of `aux` in packed address data. uint256 private constant _BITPOS_AUX = 192; // Mask of all 256 bits in packed address data except the 64 bits for `aux`. uint256 private constant _BITMASK_AUX_COMPLEMENT = (1 << 192) - 1; // The bit position of `startTimestamp` in packed ownership. uint256 private constant _BITPOS_START_TIMESTAMP = 160; // The bit mask of the `burned` bit in packed ownership. uint256 private constant _BITMASK_BURNED = 1 << 224; // The bit position of the `nextInitialized` bit in packed ownership. uint256 private constant _BITPOS_NEXT_INITIALIZED = 225; // The bit mask of the `nextInitialized` bit in packed ownership. uint256 private constant _BITMASK_NEXT_INITIALIZED = 1 << 225; // The bit position of `extraData` in packed ownership. uint256 private constant _BITPOS_EXTRA_DATA = 232; // Mask of all 256 bits in a packed ownership except the 24 bits for `extraData`. uint256 private constant _BITMASK_EXTRA_DATA_COMPLEMENT = (1 << 232) - 1; // The mask of the lower 160 bits for addresses. uint256 private constant _BITMASK_ADDRESS = (1 << 160) - 1; // The maximum `quantity` that can be minted with {_mintERC2309}. // This limit is to prevent overflows on the address data entries. // For a limit of 5000, a total of 3.689e15 calls to {_mintERC2309} // is required to cause an overflow, which is unrealistic. uint256 private constant _MAX_MINT_ERC2309_QUANTITY_LIMIT = 5000; // The `Transfer` event signature is given by: // `keccak256(bytes("Transfer(address,address,uint256)"))`. bytes32 private constant _TRANSFER_EVENT_SIGNATURE = 0xddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef; // ============================================================= // STORAGE // ============================================================= // The next token ID to be minted. uint256 private _currentIndex; // The number of tokens burned. uint256 private _burnCounter; // Token name string private _name; // Token symbol string private _symbol; // Mapping from token ID to ownership details // An empty struct value does not necessarily mean the token is unowned. // See {_packedOwnershipOf} implementation for details. // // Bits Layout: // - [0..159] `addr` // - [160..223] `startTimestamp` // - [224] `burned` // - [225] `nextInitialized` // - [232..255] `extraData` mapping(uint256 => uint256) private _packedOwnerships; // Mapping owner address to address data. // // Bits Layout: // - [0..63] `balance` // - [64..127] `numberMinted` // - [128..191] `numberBurned` // - [192..255] `aux` mapping(address => uint256) private _packedAddressData; // Mapping from token ID to approved address. mapping(uint256 => TokenApprovalRef) private _tokenApprovals; // Mapping from owner to operator approvals mapping(address => mapping(address => bool)) private _operatorApprovals; // ============================================================= // CONSTRUCTOR // ============================================================= constructor(string memory name_, string memory symbol_) { _name = name_; _symbol = symbol_; _currentIndex = _startTokenId(); } // ============================================================= // TOKEN COUNTING OPERATIONS // ============================================================= /** * @dev Returns the starting token ID. * To change the starting token ID, please override this function. */ function _startTokenId() internal view virtual returns (uint256) { return 0; } /** * @dev Returns the next token ID to be minted. */ function _nextTokenId() internal view virtual returns (uint256) { return _currentIndex; } /** * @dev Returns the total number of tokens in existence. * Burned tokens will reduce the count. * To get the total number of tokens minted, please see {_totalMinted}. */ function totalSupply() public view virtual override returns (uint256) { // Counter underflow is impossible as _burnCounter cannot be incremented // more than `_currentIndex - _startTokenId()` times. unchecked { return _currentIndex - _burnCounter - _startTokenId(); } } /** * @dev Returns the total amount of tokens minted in the contract. */ function _totalMinted() internal view virtual returns (uint256) { // Counter underflow is impossible as `_currentIndex` does not decrement, // and it is initialized to `_startTokenId()`. unchecked { return _currentIndex - _startTokenId(); } } /** * @dev Returns the total number of tokens burned. */ function _totalBurned() internal view virtual returns (uint256) { return _burnCounter; } // ============================================================= // ADDRESS DATA OPERATIONS // ============================================================= /** * @dev Returns the number of tokens in `owner`'s account. */ function balanceOf(address owner) public view virtual override returns (uint256) { if (owner == address(0)) revert BalanceQueryForZeroAddress(); return _packedAddressData[owner] & _BITMASK_ADDRESS_DATA_ENTRY; } /** * Returns the number of tokens minted by `owner`. */ function _numberMinted(address owner) internal view returns (uint256) { return (_packedAddressData[owner] >> _BITPOS_NUMBER_MINTED) & _BITMASK_ADDRESS_DATA_ENTRY; } /** * Returns the number of tokens burned by or on behalf of `owner`. */ function _numberBurned(address owner) internal view returns (uint256) { return (_packedAddressData[owner] >> _BITPOS_NUMBER_BURNED) & _BITMASK_ADDRESS_DATA_ENTRY; } /** * Returns the auxiliary data for `owner`. (e.g. number of whitelist mint slots used). */ function _getAux(address owner) internal view returns (uint64) { return uint64(_packedAddressData[owner] >> _BITPOS_AUX); } /** * Sets the auxiliary data for `owner`. (e.g. number of whitelist mint slots used). * If there are multiple variables, please pack them into a uint64. */ function _setAux(address owner, uint64 aux) internal virtual { uint256 packed = _packedAddressData[owner]; uint256 auxCasted; // Cast `aux` with assembly to avoid redundant masking. assembly { auxCasted := aux } packed = (packed & _BITMASK_AUX_COMPLEMENT) | (auxCasted << _BITPOS_AUX); _packedAddressData[owner] = packed; } // ============================================================= // IERC165 // ============================================================= /** * @dev Returns true if this contract implements the interface defined by * `interfaceId`. See the corresponding * [EIP section](https://eips.ethereum.org/EIPS/eip-165#how-interfaces-are-identified) * to learn more about how these ids are created. * * This function call must use less than 30000 gas. */ function supportsInterface(bytes4 interfaceId) public view virtual override returns (bool) { // The interface IDs are constants representing the first 4 bytes // of the XOR of all function selectors in the interface. // See: [ERC165](https://eips.ethereum.org/EIPS/eip-165) // (e.g. `bytes4(i.functionA.selector ^ i.functionB.selector ^ ...)`) return interfaceId == 0x01ffc9a7 || // ERC165 interface ID for ERC165. interfaceId == 0x80ac58cd || // ERC165 interface ID for ERC721. interfaceId == 0x5b5e139f; // ERC165 interface ID for ERC721Metadata. } // ============================================================= // IERC721Metadata // ============================================================= /** * @dev Returns the token collection name. */ function name() public view virtual override returns (string memory) { return _name; } /** * @dev Returns the token collection symbol. */ function symbol() public view virtual override returns (string memory) { return _symbol; } /** * @dev Returns the Uniform Resource Identifier (URI) for `tokenId` token. */ function tokenURI(uint256 tokenId) public view virtual override returns (string memory) { if (!_exists(tokenId)) revert URIQueryForNonexistentToken(); string memory baseURI = _baseURI(); return bytes(baseURI).length != 0 ? string(abi.encodePacked(baseURI, _toString(tokenId))) : ''; } /** * @dev Base URI for computing {tokenURI}. If set, the resulting URI for each * token will be the concatenation of the `baseURI` and the `tokenId`. Empty * by default, it can be overridden in child contracts. */ function _baseURI() internal view virtual returns (string memory) { return ''; } // ============================================================= // OWNERSHIPS OPERATIONS // ============================================================= /** * @dev Returns the owner of the `tokenId` token. * * Requirements: * * - `tokenId` must exist. */ function ownerOf(uint256 tokenId) public view virtual override returns (address) { return address(uint160(_packedOwnershipOf(tokenId))); } /** * @dev Gas spent here starts off proportional to the maximum mint batch size. * It gradually moves to O(1) as tokens get transferred around over time. */ function _ownershipOf(uint256 tokenId) internal view virtual returns (TokenOwnership memory) { return _unpackedOwnership(_packedOwnershipOf(tokenId)); } /** * @dev Returns the unpacked `TokenOwnership` struct at `index`. */ function _ownershipAt(uint256 index) internal view virtual returns (TokenOwnership memory) { return _unpackedOwnership(_packedOwnerships[index]); } /** * @dev Initializes the ownership slot minted at `index` for efficiency purposes. */ function _initializeOwnershipAt(uint256 index) internal virtual { if (_packedOwnerships[index] == 0) { _packedOwnerships[index] = _packedOwnershipOf(index); } } /** * Returns the packed ownership data of `tokenId`. */ function _packedOwnershipOf(uint256 tokenId) private view returns (uint256) { uint256 curr = tokenId; unchecked { if (_startTokenId() <= curr) if (curr < _currentIndex) { uint256 packed = _packedOwnerships[curr]; // If not burned. if (packed & _BITMASK_BURNED == 0) { // Invariant: // There will always be an initialized ownership slot // (i.e. `ownership.addr != address(0) && ownership.burned == false`) // before an unintialized ownership slot // (i.e. `ownership.addr == address(0) && ownership.burned == false`) // Hence, `curr` will not underflow. // // We can directly compare the packed value. // If the address is zero, packed will be zero. while (packed == 0) { packed = _packedOwnerships[--curr]; } return packed; } } } revert OwnerQueryForNonexistentToken(); } /** * @dev Returns the unpacked `TokenOwnership` struct from `packed`. */ function _unpackedOwnership(uint256 packed) private pure returns (TokenOwnership memory ownership) { ownership.addr = address(uint160(packed)); ownership.startTimestamp = uint64(packed >> _BITPOS_START_TIMESTAMP); ownership.burned = packed & _BITMASK_BURNED != 0; ownership.extraData = uint24(packed >> _BITPOS_EXTRA_DATA); } /** * @dev Packs ownership data into a single uint256. */ function _packOwnershipData(address owner, uint256 flags) private view returns (uint256 result) { assembly { // Mask `owner` to the lower 160 bits, in case the upper bits somehow aren't clean. owner := and(owner, _BITMASK_ADDRESS) // `owner | (block.timestamp << _BITPOS_START_TIMESTAMP) | flags`. result := or(owner, or(shl(_BITPOS_START_TIMESTAMP, timestamp()), flags)) } } /** * @dev Returns the `nextInitialized` flag set if `quantity` equals 1. */ function _nextInitializedFlag(uint256 quantity) private pure returns (uint256 result) { // For branchless setting of the `nextInitialized` flag. assembly { // `(quantity == 1) << _BITPOS_NEXT_INITIALIZED`. result := shl(_BITPOS_NEXT_INITIALIZED, eq(quantity, 1)) } } // ============================================================= // APPROVAL OPERATIONS // ============================================================= /** * @dev Gives permission to `to` to transfer `tokenId` token to another account. * The approval is cleared when the token is transferred. * * Only a single account can be approved at a time, so approving the * zero address clears previous approvals. * * Requirements: * * - The caller must own the token or be an approved operator. * - `tokenId` must exist. * * Emits an {Approval} event. */ function approve(address to, uint256 tokenId) public payable virtual override { address owner = ownerOf(tokenId); if (_msgSenderERC721A() != owner) if (!isApprovedForAll(owner, _msgSenderERC721A())) { revert ApprovalCallerNotOwnerNorApproved(); } _tokenApprovals[tokenId].value = to; emit Approval(owner, to, tokenId); } /** * @dev Returns the account approved for `tokenId` token. * * Requirements: * * - `tokenId` must exist. */ function getApproved(uint256 tokenId) public view virtual override returns (address) { if (!_exists(tokenId)) revert ApprovalQueryForNonexistentToken(); return _tokenApprovals[tokenId].value; } /** * @dev Approve or remove `operator` as an operator for the caller. * Operators can call {transferFrom} or {safeTransferFrom} * for any token owned by the caller. * * Requirements: * * - The `operator` cannot be the caller. * * Emits an {ApprovalForAll} event. */ function setApprovalForAll(address operator, bool approved) public virtual override { _operatorApprovals[_msgSenderERC721A()][operator] = approved; emit ApprovalForAll(_msgSenderERC721A(), operator, approved); } /** * @dev Returns if the `operator` is allowed to manage all of the assets of `owner`. * * See {setApprovalForAll}. */ function isApprovedForAll(address owner, address operator) public view virtual override returns (bool) { return _operatorApprovals[owner][operator]; } /** * @dev Returns whether `tokenId` exists. * * Tokens can be managed by their owner or approved accounts via {approve} or {setApprovalForAll}. * * Tokens start existing when they are minted. See {_mint}. */ function _exists(uint256 tokenId) internal view virtual returns (bool) { return _startTokenId() <= tokenId && tokenId < _currentIndex && // If within bounds, _packedOwnerships[tokenId] & _BITMASK_BURNED == 0; // and not burned. } /** * @dev Returns whether `msgSender` is equal to `approvedAddress` or `owner`. */ function _isSenderApprovedOrOwner( address approvedAddress, address owner, address msgSender ) private pure returns (bool result) { assembly { // Mask `owner` to the lower 160 bits, in case the upper bits somehow aren't clean. owner := and(owner, _BITMASK_ADDRESS) // Mask `msgSender` to the lower 160 bits, in case the upper bits somehow aren't clean. msgSender := and(msgSender, _BITMASK_ADDRESS) // `msgSender == owner || msgSender == approvedAddress`. result := or(eq(msgSender, owner), eq(msgSender, approvedAddress)) } } /** * @dev Returns the storage slot and value for the approved address of `tokenId`. */ function _getApprovedSlotAndAddress(uint256 tokenId) private view returns (uint256 approvedAddressSlot, address approvedAddress) { TokenApprovalRef storage tokenApproval = _tokenApprovals[tokenId]; // The following is equivalent to `approvedAddress = _tokenApprovals[tokenId].value`. assembly { approvedAddressSlot := tokenApproval.slot approvedAddress := sload(approvedAddressSlot) } } // ============================================================= // TRANSFER OPERATIONS // ============================================================= /** * @dev Transfers `tokenId` from `from` to `to`. * * Requirements: * * - `from` cannot be the zero address. * - `to` cannot be the zero address. * - `tokenId` token must be owned by `from`. * - If the caller is not `from`, it must be approved to move this token * by either {approve} or {setApprovalForAll}. * * Emits a {Transfer} event. */ function transferFrom( address from, address to, uint256 tokenId ) public payable virtual override { uint256 prevOwnershipPacked = _packedOwnershipOf(tokenId); if (address(uint160(prevOwnershipPacked)) != from) revert TransferFromIncorrectOwner(); (uint256 approvedAddressSlot, address approvedAddress) = _getApprovedSlotAndAddress(tokenId); // The nested ifs save around 20+ gas over a compound boolean condition. if (!_isSenderApprovedOrOwner(approvedAddress, from, _msgSenderERC721A())) if (!isApprovedForAll(from, _msgSenderERC721A())) revert TransferCallerNotOwnerNorApproved(); if (to == address(0)) revert TransferToZeroAddress(); _beforeTokenTransfers(from, to, tokenId, 1); // Clear approvals from the previous owner. assembly { if approvedAddress { // This is equivalent to `delete _tokenApprovals[tokenId]`. sstore(approvedAddressSlot, 0) } } // Underflow of the sender's balance is impossible because we check for // ownership above and the recipient's balance can't realistically overflow. // Counter overflow is incredibly unrealistic as `tokenId` would have to be 2**256. unchecked { // We can directly increment and decrement the balances. --_packedAddressData[from]; // Updates: `balance -= 1`. ++_packedAddressData[to]; // Updates: `balance += 1`. // Updates: // - `address` to the next owner. // - `startTimestamp` to the timestamp of transfering. // - `burned` to `false`. // - `nextInitialized` to `true`. _packedOwnerships[tokenId] = _packOwnershipData( to, _BITMASK_NEXT_INITIALIZED | _nextExtraData(from, to, prevOwnershipPacked) ); // If the next slot may not have been initialized (i.e. `nextInitialized == false`) . if (prevOwnershipPacked & _BITMASK_NEXT_INITIALIZED == 0) { uint256 nextTokenId = tokenId + 1; // If the next slot's address is zero and not burned (i.e. packed value is zero). if (_packedOwnerships[nextTokenId] == 0) { // If the next slot is within bounds. if (nextTokenId != _currentIndex) { // Initialize the next slot to maintain correctness for `ownerOf(tokenId + 1)`. _packedOwnerships[nextTokenId] = prevOwnershipPacked; } } } } emit Transfer(from, to, tokenId); _afterTokenTransfers(from, to, tokenId, 1); } /** * @dev Equivalent to `safeTransferFrom(from, to, tokenId, '')`. */ function safeTransferFrom( address from, address to, uint256 tokenId ) public payable virtual override { safeTransferFrom(from, to, tokenId, ''); } /** * @dev Safely transfers `tokenId` token from `from` to `to`. * * Requirements: * * - `from` cannot be the zero address. * - `to` cannot be the zero address. * - `tokenId` token must exist and be owned by `from`. * - If the caller is not `from`, it must be approved to move this token * by either {approve} or {setApprovalForAll}. * - If `to` refers to a smart contract, it must implement * {IERC721Receiver-onERC721Received}, which is called upon a safe transfer. * * Emits a {Transfer} event. */ function safeTransferFrom( address from, address to, uint256 tokenId, bytes memory _data ) public payable virtual override { transferFrom(from, to, tokenId); if (to.code.length != 0) if (!_checkContractOnERC721Received(from, to, tokenId, _data)) { revert TransferToNonERC721ReceiverImplementer(); } } /** * @dev Hook that is called before a set of serially-ordered token IDs * are about to be transferred. This includes minting. * And also called before burning one token. * * `startTokenId` - the first token ID to be transferred. * `quantity` - the amount to be transferred. * * Calling conditions: * * - When `from` and `to` are both non-zero, `from`'s `tokenId` will be * transferred to `to`. * - When `from` is zero, `tokenId` will be minted for `to`. * - When `to` is zero, `tokenId` will be burned by `from`. * - `from` and `to` are never both zero. */ function _beforeTokenTransfers( address from, address to, uint256 startTokenId, uint256 quantity ) internal virtual {} /** * @dev Hook that is called after a set of serially-ordered token IDs * have been transferred. This includes minting. * And also called after one token has been burned. * * `startTokenId` - the first token ID to be transferred. * `quantity` - the amount to be transferred. * * Calling conditions: * * - When `from` and `to` are both non-zero, `from`'s `tokenId` has been * transferred to `to`. * - When `from` is zero, `tokenId` has been minted for `to`. * - When `to` is zero, `tokenId` has been burned by `from`. * - `from` and `to` are never both zero. */ function _afterTokenTransfers( address from, address to, uint256 startTokenId, uint256 quantity ) internal virtual {} /** * @dev Private function to invoke {IERC721Receiver-onERC721Received} on a target contract. * * `from` - Previous owner of the given token ID. * `to` - Target address that will receive the token. * `tokenId` - Token ID to be transferred. * `_data` - Optional data to send along with the call. * * Returns whether the call correctly returned the expected magic value. */ function _checkContractOnERC721Received( address from, address to, uint256 tokenId, bytes memory _data ) private returns (bool) { try ERC721A__IERC721Receiver(to).onERC721Received(_msgSenderERC721A(), from, tokenId, _data) returns ( bytes4 retval ) { return retval == ERC721A__IERC721Receiver(to).onERC721Received.selector; } catch (bytes memory reason) { if (reason.length == 0) { revert TransferToNonERC721ReceiverImplementer(); } else { assembly { revert(add(32, reason), mload(reason)) } } } } // ============================================================= // MINT OPERATIONS // ============================================================= /** * @dev Mints `quantity` tokens and transfers them to `to`. * * Requirements: * * - `to` cannot be the zero address. * - `quantity` must be greater than 0. * * Emits a {Transfer} event for each mint. */ function _mint(address to, uint256 quantity) internal virtual { uint256 startTokenId = _currentIndex; if (quantity == 0) revert MintZeroQuantity(); _beforeTokenTransfers(address(0), to, startTokenId, quantity); // Overflows are incredibly unrealistic. // `balance` and `numberMinted` have a maximum limit of 2**64. // `tokenId` has a maximum limit of 2**256. unchecked { // Updates: // - `balance += quantity`. // - `numberMinted += quantity`. // // We can directly add to the `balance` and `numberMinted`. _packedAddressData[to] += quantity * ((1 << _BITPOS_NUMBER_MINTED) | 1); // Updates: // - `address` to the owner. // - `startTimestamp` to the timestamp of minting. // - `burned` to `false`. // - `nextInitialized` to `quantity == 1`. _packedOwnerships[startTokenId] = _packOwnershipData( to, _nextInitializedFlag(quantity) | _nextExtraData(address(0), to, 0) ); uint256 toMasked; uint256 end = startTokenId + quantity; // Use assembly to loop and emit the `Transfer` event for gas savings. // The duplicated `log4` removes an extra check and reduces stack juggling. // The assembly, together with the surrounding Solidity code, have been // delicately arranged to nudge the compiler into producing optimized opcodes. assembly { // Mask `to` to the lower 160 bits, in case the upper bits somehow aren't clean. toMasked := and(to, _BITMASK_ADDRESS) // Emit the `Transfer` event. log4( 0, // Start of data (0, since no data). 0, // End of data (0, since no data). _TRANSFER_EVENT_SIGNATURE, // Signature. 0, // `address(0)`. toMasked, // `to`. startTokenId // `tokenId`. ) // The `iszero(eq(,))` check ensures that large values of `quantity` // that overflows uint256 will make the loop run out of gas. // The compiler will optimize the `iszero` away for performance. for { let tokenId := add(startTokenId, 1) } iszero(eq(tokenId, end)) { tokenId := add(tokenId, 1) } { // Emit the `Transfer` event. Similar to above. log4(0, 0, _TRANSFER_EVENT_SIGNATURE, 0, toMasked, tokenId) } } if (toMasked == 0) revert MintToZeroAddress(); _currentIndex = end; } _afterTokenTransfers(address(0), to, startTokenId, quantity); } /** * @dev Mints `quantity` tokens and transfers them to `to`. * * This function is intended for efficient minting only during contract creation. * * It emits only one {ConsecutiveTransfer} as defined in * [ERC2309](https://eips.ethereum.org/EIPS/eip-2309), * instead of a sequence of {Transfer} event(s). * * Calling this function outside of contract creation WILL make your contract * non-compliant with the ERC721 standard. * For full ERC721 compliance, substituting ERC721 {Transfer} event(s) with the ERC2309 * {ConsecutiveTransfer} event is only permissible during contract creation. * * Requirements: * * - `to` cannot be the zero address. * - `quantity` must be greater than 0. * * Emits a {ConsecutiveTransfer} event. */ function _mintERC2309(address to, uint256 quantity) internal virtual { uint256 startTokenId = _currentIndex; if (to == address(0)) revert MintToZeroAddress(); if (quantity == 0) revert MintZeroQuantity(); if (quantity > _MAX_MINT_ERC2309_QUANTITY_LIMIT) revert MintERC2309QuantityExceedsLimit(); _beforeTokenTransfers(address(0), to, startTokenId, quantity); // Overflows are unrealistic due to the above check for `quantity` to be below the limit. unchecked { // Updates: // - `balance += quantity`. // - `numberMinted += quantity`. // // We can directly add to the `balance` and `numberMinted`. _packedAddressData[to] += quantity * ((1 << _BITPOS_NUMBER_MINTED) | 1); // Updates: // - `address` to the owner. // - `startTimestamp` to the timestamp of minting. // - `burned` to `false`. // - `nextInitialized` to `quantity == 1`. _packedOwnerships[startTokenId] = _packOwnershipData( to, _nextInitializedFlag(quantity) | _nextExtraData(address(0), to, 0) ); emit ConsecutiveTransfer(startTokenId, startTokenId + quantity - 1, address(0), to); _currentIndex = startTokenId + quantity; } _afterTokenTransfers(address(0), to, startTokenId, quantity); } /** * @dev Safely mints `quantity` tokens and transfers them to `to`. * * Requirements: * * - If `to` refers to a smart contract, it must implement * {IERC721Receiver-onERC721Received}, which is called for each safe transfer. * - `quantity` must be greater than 0. * * See {_mint}. * * Emits a {Transfer} event for each mint. */ function _safeMint( address to, uint256 quantity, bytes memory _data ) internal virtual { _mint(to, quantity); unchecked { if (to.code.length != 0) { uint256 end = _currentIndex; uint256 index = end - quantity; do { if (!_checkContractOnERC721Received(address(0), to, index++, _data)) { revert TransferToNonERC721ReceiverImplementer(); } } while (index < end); // Reentrancy protection. if (_currentIndex != end) revert(); } } } /** * @dev Equivalent to `_safeMint(to, quantity, '')`. */ function _safeMint(address to, uint256 quantity) internal virtual { _safeMint(to, quantity, ''); } // ============================================================= // BURN OPERATIONS // ============================================================= /** * @dev Equivalent to `_burn(tokenId, false)`. */ function _burn(uint256 tokenId) internal virtual { _burn(tokenId, false); } /** * @dev Destroys `tokenId`. * The approval is cleared when the token is burned. * * Requirements: * * - `tokenId` must exist. * * Emits a {Transfer} event. */ function _burn(uint256 tokenId, bool approvalCheck) internal virtual { uint256 prevOwnershipPacked = _packedOwnershipOf(tokenId); address from = address(uint160(prevOwnershipPacked)); (uint256 approvedAddressSlot, address approvedAddress) = _getApprovedSlotAndAddress(tokenId); if (approvalCheck) { // The nested ifs save around 20+ gas over a compound boolean condition. if (!_isSenderApprovedOrOwner(approvedAddress, from, _msgSenderERC721A())) if (!isApprovedForAll(from, _msgSenderERC721A())) revert TransferCallerNotOwnerNorApproved(); } _beforeTokenTransfers(from, address(0), tokenId, 1); // Clear approvals from the previous owner. assembly { if approvedAddress { // This is equivalent to `delete _tokenApprovals[tokenId]`. sstore(approvedAddressSlot, 0) } } // Underflow of the sender's balance is impossible because we check for // ownership above and the recipient's balance can't realistically overflow. // Counter overflow is incredibly unrealistic as `tokenId` would have to be 2**256. unchecked { // Updates: // - `balance -= 1`. // - `numberBurned += 1`. // // We can directly decrement the balance, and increment the number burned. // This is equivalent to `packed -= 1; packed += 1 << _BITPOS_NUMBER_BURNED;`. _packedAddressData[from] += (1 << _BITPOS_NUMBER_BURNED) - 1; // Updates: // - `address` to the last owner. // - `startTimestamp` to the timestamp of burning. // - `burned` to `true`. // - `nextInitialized` to `true`. _packedOwnerships[tokenId] = _packOwnershipData( from, (_BITMASK_BURNED | _BITMASK_NEXT_INITIALIZED) | _nextExtraData(from, address(0), prevOwnershipPacked) ); // If the next slot may not have been initialized (i.e. `nextInitialized == false`) . if (prevOwnershipPacked & _BITMASK_NEXT_INITIALIZED == 0) { uint256 nextTokenId = tokenId + 1; // If the next slot's address is zero and not burned (i.e. packed value is zero). if (_packedOwnerships[nextTokenId] == 0) { // If the next slot is within bounds. if (nextTokenId != _currentIndex) { // Initialize the next slot to maintain correctness for `ownerOf(tokenId + 1)`. _packedOwnerships[nextTokenId] = prevOwnershipPacked; } } } } emit Transfer(from, address(0), tokenId); _afterTokenTransfers(from, address(0), tokenId, 1); // Overflow not possible, as _burnCounter cannot be exceed _currentIndex times. unchecked { _burnCounter++; } } // ============================================================= // EXTRA DATA OPERATIONS // ============================================================= /** * @dev Directly sets the extra data for the ownership data `index`. */ function _setExtraDataAt(uint256 index, uint24 extraData) internal virtual { uint256 packed = _packedOwnerships[index]; if (packed == 0) revert OwnershipNotInitializedForExtraData(); uint256 extraDataCasted; // Cast `extraData` with assembly to avoid redundant masking. assembly { extraDataCasted := extraData } packed = (packed & _BITMASK_EXTRA_DATA_COMPLEMENT) | (extraDataCasted << _BITPOS_EXTRA_DATA); _packedOwnerships[index] = packed; } /** * @dev Called during each token transfer to set the 24bit `extraData` field. * Intended to be overridden by the cosumer contract. * * `previousExtraData` - the value of `extraData` before transfer. * * Calling conditions: * * - When `from` and `to` are both non-zero, `from`'s `tokenId` will be * transferred to `to`. * - When `from` is zero, `tokenId` will be minted for `to`. * - When `to` is zero, `tokenId` will be burned by `from`. * - `from` and `to` are never both zero. */ function _extraData( address from, address to, uint24 previousExtraData ) internal view virtual returns (uint24) {} /** * @dev Returns the next extra data for the packed ownership data. * The returned result is shifted into position. */ function _nextExtraData( address from, address to, uint256 prevOwnershipPacked ) private view returns (uint256) { uint24 extraData = uint24(prevOwnershipPacked >> _BITPOS_EXTRA_DATA); return uint256(_extraData(from, to, extraData)) << _BITPOS_EXTRA_DATA; } // ============================================================= // OTHER OPERATIONS // ============================================================= /** * @dev Returns the message sender (defaults to `msg.sender`). * * If you are writing GSN compatible contracts, you need to override this function. */ function _msgSenderERC721A() internal view virtual returns (address) { return msg.sender; } /** * @dev Converts a uint256 to its ASCII string decimal representation. */ function _toString(uint256 value) internal pure virtual returns (string memory str) { assembly { // The maximum value of a uint256 contains 78 digits (1 byte per digit), but // we allocate 0xa0 bytes to keep the free memory pointer 32-byte word aligned. // We will need 1 word for the trailing zeros padding, 1 word for the length, // and 3 words for a maximum of 78 digits. Total: 5 * 0x20 = 0xa0. let m := add(mload(0x40), 0xa0) // Update the free memory pointer to allocate. mstore(0x40, m) // Assign the `str` to the end. str := sub(m, 0x20) // Zeroize the slot after the string. mstore(str, 0) // Cache the end of the memory to calculate the length later. let end := str // We write the string from rightmost digit to leftmost digit. // The following is essentially a do-while loop that also handles the zero case. // prettier-ignore for { let temp := value } 1 {} { str := sub(str, 1) // Write the character to the pointer. // The ASCII index of the '0' character is 48. mstore8(str, add(48, mod(temp, 10))) // Keep dividing `temp` until zero. temp := div(temp, 10) // prettier-ignore if iszero(temp) { break } } let length := sub(end, str) // Move the pointer 32 bytes leftwards to make room for the length. str := sub(str, 0x20) // Store the length. mstore(str, length) } } }
// SPDX-License-Identifier: MIT // OpenZeppelin Contracts (last updated v4.8.0) (utils/math/Math.sol) pragma solidity ^0.8.0; /** * @dev Standard math utilities missing in the Solidity language. */ library Math { enum Rounding { Down, // Toward negative infinity Up, // Toward infinity Zero // Toward zero } /** * @dev Returns the largest of two numbers. */ function max(uint256 a, uint256 b) internal pure returns (uint256) { return a > b ? a : b; } /** * @dev Returns the smallest of two numbers. */ function min(uint256 a, uint256 b) internal pure returns (uint256) { return a < b ? a : b; } /** * @dev Returns the average of two numbers. The result is rounded towards * zero. */ function average(uint256 a, uint256 b) internal pure returns (uint256) { // (a + b) / 2 can overflow. return (a & b) + (a ^ b) / 2; } /** * @dev Returns the ceiling of the division of two numbers. * * This differs from standard division with `/` in that it rounds up instead * of rounding down. */ function ceilDiv(uint256 a, uint256 b) internal pure returns (uint256) { // (a + b - 1) / b can overflow on addition, so we distribute. return a == 0 ? 0 : (a - 1) / b + 1; } /** * @notice Calculates floor(x * y / denominator) with full precision. Throws if result overflows a uint256 or denominator == 0 * @dev Original credit to Remco Bloemen under MIT license (https://xn--2-umb.com/21/muldiv) * with further edits by Uniswap Labs also under MIT license. */ function mulDiv( uint256 x, uint256 y, uint256 denominator ) internal pure returns (uint256 result) { unchecked { // 512-bit multiply [prod1 prod0] = x * y. Compute the product mod 2^256 and mod 2^256 - 1, then use // use the Chinese Remainder Theorem to reconstruct the 512 bit result. The result is stored in two 256 // variables such that product = prod1 * 2^256 + prod0. uint256 prod0; // Least significant 256 bits of the product uint256 prod1; // Most significant 256 bits of the product assembly { let mm := mulmod(x, y, not(0)) prod0 := mul(x, y) prod1 := sub(sub(mm, prod0), lt(mm, prod0)) } // Handle non-overflow cases, 256 by 256 division. if (prod1 == 0) { return prod0 / denominator; } // Make sure the result is less than 2^256. Also prevents denominator == 0. require(denominator > prod1); /////////////////////////////////////////////// // 512 by 256 division. /////////////////////////////////////////////// // Make division exact by subtracting the remainder from [prod1 prod0]. uint256 remainder; assembly { // Compute remainder using mulmod. remainder := mulmod(x, y, denominator) // Subtract 256 bit number from 512 bit number. prod1 := sub(prod1, gt(remainder, prod0)) prod0 := sub(prod0, remainder) } // Factor powers of two out of denominator and compute largest power of two divisor of denominator. Always >= 1. // See https://cs.stackexchange.com/q/138556/92363. // Does not overflow because the denominator cannot be zero at this stage in the function. uint256 twos = denominator & (~denominator + 1); assembly { // Divide denominator by twos. denominator := div(denominator, twos) // Divide [prod1 prod0] by twos. prod0 := div(prod0, twos) // Flip twos such that it is 2^256 / twos. If twos is zero, then it becomes one. twos := add(div(sub(0, twos), twos), 1) } // Shift in bits from prod1 into prod0. prod0 |= prod1 * twos; // Invert denominator mod 2^256. Now that denominator is an odd number, it has an inverse modulo 2^256 such // that denominator * inv = 1 mod 2^256. Compute the inverse by starting with a seed that is correct for // four bits. That is, denominator * inv = 1 mod 2^4. uint256 inverse = (3 * denominator) ^ 2; // Use the Newton-Raphson iteration to improve the precision. Thanks to Hensel's lifting lemma, this also works // in modular arithmetic, doubling the correct bits in each step. inverse *= 2 - denominator * inverse; // inverse mod 2^8 inverse *= 2 - denominator * inverse; // inverse mod 2^16 inverse *= 2 - denominator * inverse; // inverse mod 2^32 inverse *= 2 - denominator * inverse; // inverse mod 2^64 inverse *= 2 - denominator * inverse; // inverse mod 2^128 inverse *= 2 - denominator * inverse; // inverse mod 2^256 // Because the division is now exact we can divide by multiplying with the modular inverse of denominator. // This will give us the correct result modulo 2^256. Since the preconditions guarantee that the outcome is // less than 2^256, this is the final result. We don't need to compute the high bits of the result and prod1 // is no longer required. result = prod0 * inverse; return result; } } /** * @notice Calculates x * y / denominator with full precision, following the selected rounding direction. */ function mulDiv( uint256 x, uint256 y, uint256 denominator, Rounding rounding ) internal pure returns (uint256) { uint256 result = mulDiv(x, y, denominator); if (rounding == Rounding.Up && mulmod(x, y, denominator) > 0) { result += 1; } return result; } /** * @dev Returns the square root of a number. If the number is not a perfect square, the value is rounded down. * * Inspired by Henry S. Warren, Jr.'s "Hacker's Delight" (Chapter 11). */ function sqrt(uint256 a) internal pure returns (uint256) { if (a == 0) { return 0; } // For our first guess, we get the biggest power of 2 which is smaller than the square root of the target. // // We know that the "msb" (most significant bit) of our target number `a` is a power of 2 such that we have // `msb(a) <= a < 2*msb(a)`. This value can be written `msb(a)=2**k` with `k=log2(a)`. // // This can be rewritten `2**log2(a) <= a < 2**(log2(a) + 1)` // → `sqrt(2**k) <= sqrt(a) < sqrt(2**(k+1))` // → `2**(k/2) <= sqrt(a) < 2**((k+1)/2) <= 2**(k/2 + 1)` // // Consequently, `2**(log2(a) / 2)` is a good first approximation of `sqrt(a)` with at least 1 correct bit. uint256 result = 1 << (log2(a) >> 1); // At this point `result` is an estimation with one bit of precision. We know the true value is a uint128, // since it is the square root of a uint256. Newton's method converges quadratically (precision doubles at // every iteration). We thus need at most 7 iteration to turn our partial result with one bit of precision // into the expected uint128 result. unchecked { result = (result + a / result) >> 1; result = (result + a / result) >> 1; result = (result + a / result) >> 1; result = (result + a / result) >> 1; result = (result + a / result) >> 1; result = (result + a / result) >> 1; result = (result + a / result) >> 1; return min(result, a / result); } } /** * @notice Calculates sqrt(a), following the selected rounding direction. */ function sqrt(uint256 a, Rounding rounding) internal pure returns (uint256) { unchecked { uint256 result = sqrt(a); return result + (rounding == Rounding.Up && result * result < a ? 1 : 0); } } /** * @dev Return the log in base 2, rounded down, of a positive value. * Returns 0 if given 0. */ function log2(uint256 value) internal pure returns (uint256) { uint256 result = 0; unchecked { if (value >> 128 > 0) { value >>= 128; result += 128; } if (value >> 64 > 0) { value >>= 64; result += 64; } if (value >> 32 > 0) { value >>= 32; result += 32; } if (value >> 16 > 0) { value >>= 16; result += 16; } if (value >> 8 > 0) { value >>= 8; result += 8; } if (value >> 4 > 0) { value >>= 4; result += 4; } if (value >> 2 > 0) { value >>= 2; result += 2; } if (value >> 1 > 0) { result += 1; } } return result; } /** * @dev Return the log in base 2, following the selected rounding direction, of a positive value. * Returns 0 if given 0. */ function log2(uint256 value, Rounding rounding) internal pure returns (uint256) { unchecked { uint256 result = log2(value); return result + (rounding == Rounding.Up && 1 << result < value ? 1 : 0); } } /** * @dev Return the log in base 10, rounded down, of a positive value. * Returns 0 if given 0. */ function log10(uint256 value) internal pure returns (uint256) { uint256 result = 0; unchecked { if (value >= 10**64) { value /= 10**64; result += 64; } if (value >= 10**32) { value /= 10**32; result += 32; } if (value >= 10**16) { value /= 10**16; result += 16; } if (value >= 10**8) { value /= 10**8; result += 8; } if (value >= 10**4) { value /= 10**4; result += 4; } if (value >= 10**2) { value /= 10**2; result += 2; } if (value >= 10**1) { result += 1; } } return result; } /** * @dev Return the log in base 10, following the selected rounding direction, of a positive value. * Returns 0 if given 0. */ function log10(uint256 value, Rounding rounding) internal pure returns (uint256) { unchecked { uint256 result = log10(value); return result + (rounding == Rounding.Up && 10**result < value ? 1 : 0); } } /** * @dev Return the log in base 256, rounded down, of a positive value. * Returns 0 if given 0. * * Adding one to the result gives the number of pairs of hex symbols needed to represent `value` as a hex string. */ function log256(uint256 value) internal pure returns (uint256) { uint256 result = 0; unchecked { if (value >> 128 > 0) { value >>= 128; result += 16; } if (value >> 64 > 0) { value >>= 64; result += 8; } if (value >> 32 > 0) { value >>= 32; result += 4; } if (value >> 16 > 0) { value >>= 16; result += 2; } if (value >> 8 > 0) { result += 1; } } return result; } /** * @dev Return the log in base 10, following the selected rounding direction, of a positive value. * Returns 0 if given 0. */ function log256(uint256 value, Rounding rounding) internal pure returns (uint256) { unchecked { uint256 result = log256(value); return result + (rounding == Rounding.Up && 1 << (result * 8) < value ? 1 : 0); } } }
// SPDX-License-Identifier: MIT // ERC721A Contracts v4.2.3 // Creator: Chiru Labs pragma solidity ^0.8.4; /** * @dev Interface of ERC721A. */ interface IERC721A { /** * The caller must own the token or be an approved operator. */ error ApprovalCallerNotOwnerNorApproved(); /** * The token does not exist. */ error ApprovalQueryForNonexistentToken(); /** * Cannot query the balance for the zero address. */ error BalanceQueryForZeroAddress(); /** * Cannot mint to the zero address. */ error MintToZeroAddress(); /** * The quantity of tokens minted must be more than zero. */ error MintZeroQuantity(); /** * The token does not exist. */ error OwnerQueryForNonexistentToken(); /** * The caller must own the token or be an approved operator. */ error TransferCallerNotOwnerNorApproved(); /** * The token must be owned by `from`. */ error TransferFromIncorrectOwner(); /** * Cannot safely transfer to a contract that does not implement the * ERC721Receiver interface. */ error TransferToNonERC721ReceiverImplementer(); /** * Cannot transfer to the zero address. */ error TransferToZeroAddress(); /** * The token does not exist. */ error URIQueryForNonexistentToken(); /** * The `quantity` minted with ERC2309 exceeds the safety limit. */ error MintERC2309QuantityExceedsLimit(); /** * The `extraData` cannot be set on an unintialized ownership slot. */ error OwnershipNotInitializedForExtraData(); // ============================================================= // STRUCTS // ============================================================= struct TokenOwnership { // The address of the owner. address addr; // Stores the start time of ownership with minimal overhead for tokenomics. uint64 startTimestamp; // Whether the token has been burned. bool burned; // Arbitrary data similar to `startTimestamp` that can be set via {_extraData}. uint24 extraData; } // ============================================================= // TOKEN COUNTERS // ============================================================= /** * @dev Returns the total number of tokens in existence. * Burned tokens will reduce the count. * To get the total number of tokens minted, please see {_totalMinted}. */ function totalSupply() external view returns (uint256); // ============================================================= // IERC165 // ============================================================= /** * @dev Returns true if this contract implements the interface defined by * `interfaceId`. See the corresponding * [EIP section](https://eips.ethereum.org/EIPS/eip-165#how-interfaces-are-identified) * to learn more about how these ids are created. * * This function call must use less than 30000 gas. */ function supportsInterface(bytes4 interfaceId) external view returns (bool); // ============================================================= // IERC721 // ============================================================= /** * @dev Emitted when `tokenId` token is transferred from `from` to `to`. */ event Transfer(address indexed from, address indexed to, uint256 indexed tokenId); /** * @dev Emitted when `owner` enables `approved` to manage the `tokenId` token. */ event Approval(address indexed owner, address indexed approved, uint256 indexed tokenId); /** * @dev Emitted when `owner` enables or disables * (`approved`) `operator` to manage all of its assets. */ event ApprovalForAll(address indexed owner, address indexed operator, bool approved); /** * @dev Returns the number of tokens in `owner`'s account. */ function balanceOf(address owner) external view returns (uint256 balance); /** * @dev Returns the owner of the `tokenId` token. * * Requirements: * * - `tokenId` must exist. */ function ownerOf(uint256 tokenId) external view returns (address owner); /** * @dev Safely transfers `tokenId` token from `from` to `to`, * checking first that contract recipients are aware of the ERC721 protocol * to prevent tokens from being forever locked. * * Requirements: * * - `from` cannot be the zero address. * - `to` cannot be the zero address. * - `tokenId` token must exist and be owned by `from`. * - If the caller is not `from`, it must be have been allowed to move * this token by either {approve} or {setApprovalForAll}. * - If `to` refers to a smart contract, it must implement * {IERC721Receiver-onERC721Received}, which is called upon a safe transfer. * * Emits a {Transfer} event. */ function safeTransferFrom( address from, address to, uint256 tokenId, bytes calldata data ) external payable; /** * @dev Equivalent to `safeTransferFrom(from, to, tokenId, '')`. */ function safeTransferFrom( address from, address to, uint256 tokenId ) external payable; /** * @dev Transfers `tokenId` from `from` to `to`. * * WARNING: Usage of this method is discouraged, use {safeTransferFrom} * whenever possible. * * Requirements: * * - `from` cannot be the zero address. * - `to` cannot be the zero address. * - `tokenId` token must be owned by `from`. * - If the caller is not `from`, it must be approved to move this token * by either {approve} or {setApprovalForAll}. * * Emits a {Transfer} event. */ function transferFrom( address from, address to, uint256 tokenId ) external payable; /** * @dev Gives permission to `to` to transfer `tokenId` token to another account. * The approval is cleared when the token is transferred. * * Only a single account can be approved at a time, so approving the * zero address clears previous approvals. * * Requirements: * * - The caller must own the token or be an approved operator. * - `tokenId` must exist. * * Emits an {Approval} event. */ function approve(address to, uint256 tokenId) external payable; /** * @dev Approve or remove `operator` as an operator for the caller. * Operators can call {transferFrom} or {safeTransferFrom} * for any token owned by the caller. * * Requirements: * * - The `operator` cannot be the caller. * * Emits an {ApprovalForAll} event. */ function setApprovalForAll(address operator, bool _approved) external; /** * @dev Returns the account approved for `tokenId` token. * * Requirements: * * - `tokenId` must exist. */ function getApproved(uint256 tokenId) external view returns (address operator); /** * @dev Returns if the `operator` is allowed to manage all of the assets of `owner`. * * See {setApprovalForAll}. */ function isApprovedForAll(address owner, address operator) external view returns (bool); // ============================================================= // IERC721Metadata // ============================================================= /** * @dev Returns the token collection name. */ function name() external view returns (string memory); /** * @dev Returns the token collection symbol. */ function symbol() external view returns (string memory); /** * @dev Returns the Uniform Resource Identifier (URI) for `tokenId` token. */ function tokenURI(uint256 tokenId) external view returns (string memory); // ============================================================= // IERC2309 // ============================================================= /** * @dev Emitted when tokens in `fromTokenId` to `toTokenId` * (inclusive) is transferred from `from` to `to`, as defined in the * [ERC2309](https://eips.ethereum.org/EIPS/eip-2309) standard. * * See {_mintERC2309} for more details. */ event ConsecutiveTransfer(uint256 indexed fromTokenId, uint256 toTokenId, address indexed from, address indexed to); }
{ "optimizer": { "enabled": true, "runs": 200 }, "outputSelection": { "*": { "*": [ "evm.bytecode", "evm.deployedBytecode", "devdoc", "userdoc", "metadata", "abi" ] } }, "libraries": {} }
Contract Security Audit
- No Contract Security Audit Submitted- Submit Audit Here
[{"inputs":[{"internalType":"bytes32","name":"_merkleRoot","type":"bytes32"}],"stateMutability":"nonpayable","type":"constructor"},{"inputs":[],"name":"ApprovalCallerNotOwnerNorApproved","type":"error"},{"inputs":[],"name":"ApprovalQueryForNonexistentToken","type":"error"},{"inputs":[],"name":"BalanceQueryForZeroAddress","type":"error"},{"inputs":[],"name":"MintERC2309QuantityExceedsLimit","type":"error"},{"inputs":[],"name":"MintToZeroAddress","type":"error"},{"inputs":[],"name":"MintZeroQuantity","type":"error"},{"inputs":[],"name":"OwnerQueryForNonexistentToken","type":"error"},{"inputs":[],"name":"OwnershipNotInitializedForExtraData","type":"error"},{"inputs":[],"name":"TransferCallerNotOwnerNorApproved","type":"error"},{"inputs":[],"name":"TransferFromIncorrectOwner","type":"error"},{"inputs":[],"name":"TransferToNonERC721ReceiverImplementer","type":"error"},{"inputs":[],"name":"TransferToZeroAddress","type":"error"},{"inputs":[],"name":"URIQueryForNonexistentToken","type":"error"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"owner","type":"address"},{"indexed":true,"internalType":"address","name":"approved","type":"address"},{"indexed":true,"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"Approval","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"owner","type":"address"},{"indexed":true,"internalType":"address","name":"operator","type":"address"},{"indexed":false,"internalType":"bool","name":"approved","type":"bool"}],"name":"ApprovalForAll","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"uint256","name":"fromTokenId","type":"uint256"},{"indexed":false,"internalType":"uint256","name":"toTokenId","type":"uint256"},{"indexed":true,"internalType":"address","name":"from","type":"address"},{"indexed":true,"internalType":"address","name":"to","type":"address"}],"name":"ConsecutiveTransfer","type":"event"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"enum BlurPunk.Stage","name":"from","type":"uint8"},{"indexed":false,"internalType":"enum BlurPunk.Stage","name":"to","type":"uint8"}],"name":"StageChanged","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"from","type":"address"},{"indexed":true,"internalType":"address","name":"to","type":"address"},{"indexed":true,"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"Transfer","type":"event"},{"inputs":[],"name":"MAX_MINT_PER_TX_PUBLIC","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"MAX_MINT_WHITELIST","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"MAX_SUPPLY","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"START_TOKEN_ID","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"to","type":"address"},{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"approve","outputs":[],"stateMutability":"payable","type":"function"},{"inputs":[{"internalType":"address","name":"owner","type":"address"}],"name":"balanceOf","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"baseURI","outputs":[{"internalType":"string","name":"","type":"string"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"_to","type":"address"},{"internalType":"uint256","name":"quantity","type":"uint256"}],"name":"founderMint","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"founderMintStatus","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","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":"owner","type":"address"},{"internalType":"address","name":"operator","type":"address"}],"name":"isApprovedForAll","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"merkleRoot","outputs":[{"internalType":"bytes32","name":"","type":"bytes32"}],"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":"price","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"quantity","type":"uint256"}],"name":"publicMint","outputs":[],"stateMutability":"payable","type":"function"},{"inputs":[{"internalType":"address","name":"from","type":"address"},{"internalType":"address","name":"to","type":"address"},{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"safeTransferFrom","outputs":[],"stateMutability":"payable","type":"function"},{"inputs":[{"internalType":"address","name":"from","type":"address"},{"internalType":"address","name":"to","type":"address"},{"internalType":"uint256","name":"tokenId","type":"uint256"},{"internalType":"bytes","name":"_data","type":"bytes"}],"name":"safeTransferFrom","outputs":[],"stateMutability":"payable","type":"function"},{"inputs":[{"internalType":"address","name":"operator","type":"address"},{"internalType":"bool","name":"approved","type":"bool"}],"name":"setApprovalForAll","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"string","name":"_newBaseURI","type":"string"}],"name":"setBaseURI","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"bytes32","name":"_newMerkleRoot","type":"bytes32"}],"name":"setMerkleRoot","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"_price","type":"uint256"}],"name":"setPrice","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"enum BlurPunk.Stage","name":"_stage","type":"uint8"}],"name":"setStage","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"_newWithdrawAddress","type":"address"}],"name":"setWithdrawAddress","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"stage","outputs":[{"internalType":"enum BlurPunk.Stage","name":"","type":"uint8"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"bytes4","name":"interfaceId","type":"bytes4"}],"name":"supportsInterface","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"symbol","outputs":[{"internalType":"string","name":"","type":"string"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"tokenURI","outputs":[{"internalType":"string","name":"","type":"string"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"totalSupply","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"from","type":"address"},{"internalType":"address","name":"to","type":"address"},{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"transferFrom","outputs":[],"stateMutability":"payable","type":"function"},{"inputs":[{"internalType":"address","name":"","type":"address"}],"name":"whitelistClaimed","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"bytes32[]","name":"merkleProof","type":"bytes32[]"},{"internalType":"uint256","name":"quantity","type":"uint256"}],"name":"whitelistMint","outputs":[],"stateMutability":"payable","type":"function"},{"inputs":[],"name":"withdrawAll","outputs":[],"stateMutability":"nonpayable","type":"function"}]
Contract Creation Code
6631cf1d9fc0400060085560e0604052600560a090815264173539b7b760d91b60c052600a906200003190826200018e565b50600b805460ff60ff60a81b01191690553480156200004f57600080fd5b506040516200247e3803806200247e83398101604081905262000072916200025a565b60405180604001604052806008815260200167426c757250756e6b60c01b81525060405180604001604052806008815260200167424c555250554e4b60c01b8152508160029081620000c591906200018e565b506003620000d482826200018e565b506001600055505033608052600c5562000274565b634e487b7160e01b600052604160045260246000fd5b600181811c908216806200011457607f821691505b6020821081036200013557634e487b7160e01b600052602260045260246000fd5b50919050565b601f8211156200018957600081815260208120601f850160051c81016020861015620001645750805b601f850160051c820191505b81811015620001855782815560010162000170565b5050505b505050565b81516001600160401b03811115620001aa57620001aa620000e9565b620001c281620001bb8454620000ff565b846200013b565b602080601f831160018114620001fa5760008415620001e15750858301515b600019600386901b1c1916600185901b17855562000185565b600085815260208120601f198616915b828110156200022b578886015182559484019460019091019084016200020a565b50858210156200024a5787850151600019600388901b60f8161c191681555b5050505050600190811b01905550565b6000602082840312156200026d57600080fd5b5051919050565b6080516121bd620002c16000396000818161048201528181610d5501528181610de001528181610f2001528181610f6d0152818161106601528181611224015261139501526121bd6000f3fe6080604052600436106101f95760003560e01c80636c0360eb1161010d578063a035b1fe116100a0578063c87b56dd1161006f578063c87b56dd14610549578063cd26dcd214610569578063ce3cd99714610589578063db4bec44146105a9578063e985e9c5146105d657600080fd5b8063a035b1fe146104d9578063a22cb465146104ef578063b88d4fde1461050f578063c040e6b81461052257600080fd5b806387f65c91116100dc57806387f65c911461045b5780638da5cb5b1461047057806391b7f5ed146104a457806395d89b41146104c457600080fd5b80636c0360eb146103f157806370a08231146104065780637cb6475914610426578063853828b61461044657600080fd5b80632db115441161019057806342842e0e1161015f57806342842e0e146103685780634c88245c1461037b57806355f804b31461039c57806358941a4d146103bc5780636352211e146103d157600080fd5b80632db11544146103095780632eb4a7ab1461031c57806332cb6b0c146103325780633ab1a4941461034857600080fd5b806311a042c8116101cc57806311a042c8146102a257806318160ddd146102c557806323b872dd146102e35780632904e6d9146102f657600080fd5b806301ffc9a7146101fe57806306fdde0314610233578063081812fc14610255578063095ea7b31461028d575b600080fd5b34801561020a57600080fd5b5061021e610219366004611a2c565b6105f6565b60405190151581526020015b60405180910390f35b34801561023f57600080fd5b50610248610648565b60405161022a9190611aa1565b34801561026157600080fd5b50610275610270366004611ab4565b6106da565b6040516001600160a01b03909116815260200161022a565b6102a061029b366004611ae9565b61071e565b005b3480156102ae57600080fd5b506102b7600381565b60405190815260200161022a565b3480156102d157600080fd5b506102b7600154600054036000190190565b6102a06102f1366004611b13565b6107be565b6102a0610304366004611b4f565b610957565b6102a0610317366004611ab4565b610bf6565b34801561032857600080fd5b506102b7600c5481565b34801561033e57600080fd5b506102b761057a81565b34801561035457600080fd5b506102a0610363366004611bca565b610d53565b6102a0610376366004611b13565b610dc3565b34801561038757600080fd5b50600b5461021e90600160a81b900460ff1681565b3480156103a857600080fd5b506102a06103b7366004611c71565b610dde565b3480156103c857600080fd5b506102b7600281565b3480156103dd57600080fd5b506102756103ec366004611ab4565b610e36565b3480156103fd57600080fd5b50610248610e41565b34801561041257600080fd5b506102b7610421366004611bca565b610ecf565b34801561043257600080fd5b506102a0610441366004611ab4565b610f1e565b34801561045257600080fd5b506102a0610f6b565b34801561046757600080fd5b506102b7600181565b34801561047c57600080fd5b506102757f000000000000000000000000000000000000000000000000000000000000000081565b3480156104b057600080fd5b506102a06104bf366004611ab4565b611064565b3480156104d057600080fd5b506102486110b1565b3480156104e557600080fd5b506102b760085481565b3480156104fb57600080fd5b506102a061050a366004611cba565b6110c0565b6102a061051d366004611cf6565b61112c565b34801561052e57600080fd5b50600b5461053c9060ff1681565b60405161022a9190611daa565b34801561055557600080fd5b50610248610564366004611ab4565b611176565b34801561057557600080fd5b506102a0610584366004611ae9565b611222565b34801561059557600080fd5b506102a06105a4366004611db8565b611393565b3480156105b557600080fd5b506102b76105c4366004611bca565b600d6020526000908152604090205481565b3480156105e257600080fd5b5061021e6105f1366004611dd9565b6114bc565b60006301ffc9a760e01b6001600160e01b03198316148061062757506380ac58cd60e01b6001600160e01b03198316145b806106425750635b5e139f60e01b6001600160e01b03198316145b92915050565b60606002805461065790611e0c565b80601f016020809104026020016040519081016040528092919081815260200182805461068390611e0c565b80156106d05780601f106106a5576101008083540402835291602001916106d0565b820191906000526020600020905b8154815290600101906020018083116106b357829003601f168201915b5050505050905090565b60006106e5826114ea565b610702576040516333d1c03960e21b815260040160405180910390fd5b506000908152600660205260409020546001600160a01b031690565b600061072982610e36565b9050336001600160a01b038216146107625761074581336114bc565b610762576040516367d9dca160e11b815260040160405180910390fd5b60008281526006602052604080822080546001600160a01b0319166001600160a01b0387811691821790925591518593918516917f8c5be1e5ebec7d5bd14f71427d1e84f3dd0314c0f7b2291e5b200ac8c7c3b92591a4505050565b60006107c98261151f565b9050836001600160a01b0316816001600160a01b0316146107fc5760405162a1148160e81b815260040160405180910390fd5b60008281526006602052604090208054338082146001600160a01b038816909114176108495761082c86336114bc565b61084957604051632ce44b5f60e11b815260040160405180910390fd5b6001600160a01b03851661087057604051633a954ecd60e21b815260040160405180910390fd5b801561087b57600082555b6001600160a01b038681166000908152600560205260408082208054600019019055918716808252919020805460010190554260a01b17600160e11b17600085815260046020526040812091909155600160e11b8416900361090d5760018401600081815260046020526040812054900361090b57600054811461090b5760008181526004602052604090208490555b505b83856001600160a01b0316876001600160a01b03167fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef60405160405180910390a45b505050505050565b6001600b5460ff16600281111561097057610970611d72565b146109cd5760405162461bcd60e51b815260206004820152602260248201527f426c757250756e6b3a206e6f742077686974656c697374206d696e7420737461604482015261676560f01b60648201526084015b60405180910390fd5b6002811115610a2c5760405162461bcd60e51b815260206004820152602560248201527f426c757250756e6b3a20657863656564206d6178206d696e742070657220616360448201526418dbdd5b9d60da1b60648201526084016109c4565b80600854610a3a9190611e5c565b3414610a885760405162461bcd60e51b815260206004820152601a60248201527f426c757250756e6b3a206e6f7420656e6f75676820657468657200000000000060448201526064016109c4565b336000908152600d6020526040902054600211610ab75760405162461bcd60e51b81526004016109c490611e7b565b336000908152600d6020526040902054600290610ad5908390611ec1565b1115610af35760405162461bcd60e51b81526004016109c490611e7b565b610b3483838080602002602001604051908101604052809392919081815260200183836020028082843760009201919091525050600c54915033905061158e565b1515600114610b7c5760405162461bcd60e51b815260206004820152601460248201527334b73b30b634b21036b2b935b63290383937b7b360611b60448201526064016109c4565b61057a81610b91600154600054036000190190565b610b9b9190611ec1565b1115610bb95760405162461bcd60e51b81526004016109c490611ed9565b336000908152600d6020526040902054610bd4908290611ec1565b336000818152600d6020526040902091909155610bf190826115a4565b505050565b6002600b5460ff166002811115610c0f57610c0f611d72565b14610c5c5760405162461bcd60e51b815260206004820152601f60248201527f426c757250756e6b3a206e6f74207075626c6963206d696e742073746167650060448201526064016109c4565b6003811115610cad5760405162461bcd60e51b815260206004820181905260248201527f426c757250756e6b3a20657863656564206d6178206d696e742070657220747860448201526064016109c4565b80600854610cbb9190611e5c565b3414610d095760405162461bcd60e51b815260206004820152601a60248201527f426c757250756e6b3a206e6f7420656e6f75676820657468657200000000000060448201526064016109c4565b61057a81610d1e600154600054036000190190565b610d289190611ec1565b1115610d465760405162461bcd60e51b81526004016109c490611ed9565b610d5033826115a4565b50565b7f00000000000000000000000000000000000000000000000000000000000000006001600160a01b03163314610d9b5760405162461bcd60e51b81526004016109c490611f10565b600b80546001600160a01b0390921661010002610100600160a81b0319909216919091179055565b610bf18383836040518060200160405280600081525061112c565b7f00000000000000000000000000000000000000000000000000000000000000006001600160a01b03163314610e265760405162461bcd60e51b81526004016109c490611f10565b6009610e328282611f83565b5050565b60006106428261151f565b60098054610e4e90611e0c565b80601f0160208091040260200160405190810160405280929190818152602001828054610e7a90611e0c565b8015610ec75780601f10610e9c57610100808354040283529160200191610ec7565b820191906000526020600020905b815481529060010190602001808311610eaa57829003601f168201915b505050505081565b60006001600160a01b038216610ef8576040516323d3ad8160e21b815260040160405180910390fd5b506001600160a01b031660009081526005602052604090205467ffffffffffffffff1690565b7f00000000000000000000000000000000000000000000000000000000000000006001600160a01b03163314610f665760405162461bcd60e51b81526004016109c490611f10565b600c55565b7f00000000000000000000000000000000000000000000000000000000000000006001600160a01b03163314610fb35760405162461bcd60e51b81526004016109c490611f10565b4780610ff65760405162461bcd60e51b81526020600482015260126024820152714e6f2045544820746f20776974686472617760701b60448201526064016109c4565b600b5461010090046001600160a01b03166110495760405162461bcd60e51b81526020600482015260136024820152724e6f207769746864726177206164647265737360681b60448201526064016109c4565b600b54610d509061010090046001600160a01b0316476116a2565b7f00000000000000000000000000000000000000000000000000000000000000006001600160a01b031633146110ac5760405162461bcd60e51b81526004016109c490611f10565b600855565b60606003805461065790611e0c565b3360008181526007602090815260408083206001600160a01b03871680855290835292819020805460ff191686151590811790915590519081529192917f17307eab39ab6107e8899845ad3d59bd9653f200f220920489ca2b5937696c31910160405180910390a35050565b6111378484846107be565b6001600160a01b0383163b156111705761115384848484611737565b611170576040516368d2bf6b60e11b815260040160405180910390fd5b50505050565b6060611181826114ea565b6111c35760405162461bcd60e51b8152602060048201526013602482015272109b1d5c941d5b9ace881b9bdd08195e1a5cdd606a1b60448201526064016109c4565b60006111cd611823565b905060008151116111ed576040518060200160405280600081525061121b565b806111f784611832565b600a60405160200161120b93929190612043565b6040516020818303038152906040525b9392505050565b7f00000000000000000000000000000000000000000000000000000000000000006001600160a01b0316331461126a5760405162461bcd60e51b81526004016109c490611f10565b806032146112cd5760405162461bcd60e51b815260206004820152602a60248201527f426c757250756e6b3a20666f756e646572206d696e74207175616e746974792060448201526906d7573742062652035360b41b60648201526084016109c4565b600b54600160a81b900460ff16156113355760405162461bcd60e51b815260206004820152602560248201527f426c757250756e6b3a20666f756e646572206d696e7420616c7265616479206d6044820152641a5b9d195960da1b60648201526084016109c4565b61057a8161134a600154600054036000190190565b6113549190611ec1565b11156113725760405162461bcd60e51b81526004016109c490611ed9565b61137c82826115a4565b5050600b805460ff60a81b1916600160a81b179055565b7f00000000000000000000000000000000000000000000000000000000000000006001600160a01b031633146113db5760405162461bcd60e51b81526004016109c490611f10565b8060028111156113ed576113ed611d72565b600b5460ff16600281111561140457611404611d72565b036114515760405162461bcd60e51b815260206004820152601860248201527f426c757250756e6b3a20696e76616c69642073746167652e000000000000000060448201526064016109c4565b600b805460ff811691839160ff1916600183600281111561147457611474611d72565b0217905550600b546040517f0f63b8bffe147a0fe1362da0e6e3ae0fcffce5497482f4d438715fe53890acf1916114b091849160ff16906120e3565b60405180910390a15050565b6001600160a01b03918216600090815260076020908152604080832093909416825291909152205460ff1690565b6000816001111580156114fe575060005482105b8015610642575050600090815260046020526040902054600160e01b161590565b60008180600111611575576000548110156115755760008181526004602052604081205490600160e01b82169003611573575b8060000361121b575060001901600081815260046020526040902054611552565b505b604051636f96cda160e11b815260040160405180910390fd5b60008261159b85846118c5565b14949350505050565b60008054908290036115c95760405163b562e8dd60e01b815260040160405180910390fd5b6001600160a01b03831660008181526005602090815260408083208054680100000000000000018802019055848352600490915281206001851460e11b4260a01b178317905582840190839083907fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef8180a4600183015b81811461167857808360007fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef600080a4600101611640565b508160000361169957604051622e076360e81b815260040160405180910390fd5b60005550505050565b6000826001600160a01b03168260405160006040518083038185875af1925050503d80600081146116ef576040519150601f19603f3d011682016040523d82523d6000602084013e6116f4565b606091505b5050905080610bf15760405162461bcd60e51b815260206004820152600f60248201526e151c985b9cd9995c8819985a5b1959608a1b60448201526064016109c4565b604051630a85bd0160e11b81526000906001600160a01b0385169063150b7a029061176c9033908990889088906004016120fe565b6020604051808303816000875af19250505080156117a7575060408051601f3d908101601f191682019092526117a49181019061213b565b60015b611805573d8080156117d5576040519150601f19603f3d011682016040523d82523d6000602084013e6117da565b606091505b5080516000036117fd576040516368d2bf6b60e11b815260040160405180910390fd5b805181602001fd5b6001600160e01b031916630a85bd0160e11b1490505b949350505050565b60606009805461065790611e0c565b6060600061183f83611912565b600101905060008167ffffffffffffffff81111561185f5761185f611be5565b6040519080825280601f01601f191660200182016040528015611889576020820181803683370190505b5090508181016020015b600019016f181899199a1a9b1b9c1cb0b131b232b360811b600a86061a8153600a850494508461189357509392505050565b600081815b845181101561190a576118f6828683815181106118e9576118e9612158565b60200260200101516119ea565b9150806119028161216e565b9150506118ca565b509392505050565b60008072184f03e93ff9f4daa797ed6e38ed64bf6a1f0160401b83106119515772184f03e93ff9f4daa797ed6e38ed64bf6a1f0160401b830492506040015b6d04ee2d6d415b85acef8100000000831061197d576d04ee2d6d415b85acef8100000000830492506020015b662386f26fc10000831061199b57662386f26fc10000830492506010015b6305f5e10083106119b3576305f5e100830492506008015b61271083106119c757612710830492506004015b606483106119d9576064830492506002015b600a83106106425760010192915050565b6000818310611a0657600082815260208490526040902061121b565b5060009182526020526040902090565b6001600160e01b031981168114610d5057600080fd5b600060208284031215611a3e57600080fd5b813561121b81611a16565b60005b83811015611a64578181015183820152602001611a4c565b838111156111705750506000910152565b60008151808452611a8d816020860160208601611a49565b601f01601f19169290920160200192915050565b60208152600061121b6020830184611a75565b600060208284031215611ac657600080fd5b5035919050565b80356001600160a01b0381168114611ae457600080fd5b919050565b60008060408385031215611afc57600080fd5b611b0583611acd565b946020939093013593505050565b600080600060608486031215611b2857600080fd5b611b3184611acd565b9250611b3f60208501611acd565b9150604084013590509250925092565b600080600060408486031215611b6457600080fd5b833567ffffffffffffffff80821115611b7c57600080fd5b818601915086601f830112611b9057600080fd5b813581811115611b9f57600080fd5b8760208260051b8501011115611bb457600080fd5b6020928301989097509590910135949350505050565b600060208284031215611bdc57600080fd5b61121b82611acd565b634e487b7160e01b600052604160045260246000fd5b600067ffffffffffffffff80841115611c1657611c16611be5565b604051601f8501601f19908116603f01168101908282118183101715611c3e57611c3e611be5565b81604052809350858152868686011115611c5757600080fd5b858560208301376000602087830101525050509392505050565b600060208284031215611c8357600080fd5b813567ffffffffffffffff811115611c9a57600080fd5b8201601f81018413611cab57600080fd5b61181b84823560208401611bfb565b60008060408385031215611ccd57600080fd5b611cd683611acd565b915060208301358015158114611ceb57600080fd5b809150509250929050565b60008060008060808587031215611d0c57600080fd5b611d1585611acd565b9350611d2360208601611acd565b925060408501359150606085013567ffffffffffffffff811115611d4657600080fd5b8501601f81018713611d5757600080fd5b611d6687823560208401611bfb565b91505092959194509250565b634e487b7160e01b600052602160045260246000fd5b60038110611da657634e487b7160e01b600052602160045260246000fd5b9052565b602081016106428284611d88565b600060208284031215611dca57600080fd5b81356003811061121b57600080fd5b60008060408385031215611dec57600080fd5b611df583611acd565b9150611e0360208401611acd565b90509250929050565b600181811c90821680611e2057607f821691505b602082108103611e4057634e487b7160e01b600052602260045260246000fd5b50919050565b634e487b7160e01b600052601160045260246000fd5b6000816000190483118215151615611e7657611e76611e46565b500290565b60208082526026908201527f426c757250756e6b3a20616c726561647920636c61696d6564206d6178207175604082015265616e7469747960d01b606082015260800190565b60008219821115611ed457611ed4611e46565b500190565b6020808252601b908201527f426c757250756e6b3a20657863656564206d617820737570706c790000000000604082015260600190565b60208082526013908201527221363ab9283ab7359d103737ba1037bbb732b960691b604082015260600190565b601f821115610bf157600081815260208120601f850160051c81016020861015611f645750805b601f850160051c820191505b8181101561094f57828155600101611f70565b815167ffffffffffffffff811115611f9d57611f9d611be5565b611fb181611fab8454611e0c565b84611f3d565b602080601f831160018114611fe65760008415611fce5750858301515b600019600386901b1c1916600185901b17855561094f565b600085815260208120601f198616915b8281101561201557888601518255948401946001909101908401611ff6565b50858210156120335787850151600019600388901b60f8161c191681555b5050505050600190811b01905550565b6000845160206120568285838a01611a49565b8551918401916120698184848a01611a49565b855492019160009061207a81611e0c565b6001828116801561209257600181146120a7576120d3565b60ff19841687528215158302870194506120d3565b896000528560002060005b848110156120cb578154898201529083019087016120b2565b505082870194505b50929a9950505050505050505050565b604081016120f18285611d88565b61121b6020830184611d88565b6001600160a01b038581168252841660208201526040810183905260806060820181905260009061213190830184611a75565b9695505050505050565b60006020828403121561214d57600080fd5b815161121b81611a16565b634e487b7160e01b600052603260045260246000fd5b60006001820161218057612180611e46565b506001019056fea26469706673582212205f27f0fe59ce55971fb272338787021aa7e8fbada93b2428a2fcd70ddbaf17b464736f6c634300080f003366233c90d1272de85b063341ef878380e9f4bbbb97d5ffb3fb653dec508c93aa
Deployed Bytecode
0x6080604052600436106101f95760003560e01c80636c0360eb1161010d578063a035b1fe116100a0578063c87b56dd1161006f578063c87b56dd14610549578063cd26dcd214610569578063ce3cd99714610589578063db4bec44146105a9578063e985e9c5146105d657600080fd5b8063a035b1fe146104d9578063a22cb465146104ef578063b88d4fde1461050f578063c040e6b81461052257600080fd5b806387f65c91116100dc57806387f65c911461045b5780638da5cb5b1461047057806391b7f5ed146104a457806395d89b41146104c457600080fd5b80636c0360eb146103f157806370a08231146104065780637cb6475914610426578063853828b61461044657600080fd5b80632db115441161019057806342842e0e1161015f57806342842e0e146103685780634c88245c1461037b57806355f804b31461039c57806358941a4d146103bc5780636352211e146103d157600080fd5b80632db11544146103095780632eb4a7ab1461031c57806332cb6b0c146103325780633ab1a4941461034857600080fd5b806311a042c8116101cc57806311a042c8146102a257806318160ddd146102c557806323b872dd146102e35780632904e6d9146102f657600080fd5b806301ffc9a7146101fe57806306fdde0314610233578063081812fc14610255578063095ea7b31461028d575b600080fd5b34801561020a57600080fd5b5061021e610219366004611a2c565b6105f6565b60405190151581526020015b60405180910390f35b34801561023f57600080fd5b50610248610648565b60405161022a9190611aa1565b34801561026157600080fd5b50610275610270366004611ab4565b6106da565b6040516001600160a01b03909116815260200161022a565b6102a061029b366004611ae9565b61071e565b005b3480156102ae57600080fd5b506102b7600381565b60405190815260200161022a565b3480156102d157600080fd5b506102b7600154600054036000190190565b6102a06102f1366004611b13565b6107be565b6102a0610304366004611b4f565b610957565b6102a0610317366004611ab4565b610bf6565b34801561032857600080fd5b506102b7600c5481565b34801561033e57600080fd5b506102b761057a81565b34801561035457600080fd5b506102a0610363366004611bca565b610d53565b6102a0610376366004611b13565b610dc3565b34801561038757600080fd5b50600b5461021e90600160a81b900460ff1681565b3480156103a857600080fd5b506102a06103b7366004611c71565b610dde565b3480156103c857600080fd5b506102b7600281565b3480156103dd57600080fd5b506102756103ec366004611ab4565b610e36565b3480156103fd57600080fd5b50610248610e41565b34801561041257600080fd5b506102b7610421366004611bca565b610ecf565b34801561043257600080fd5b506102a0610441366004611ab4565b610f1e565b34801561045257600080fd5b506102a0610f6b565b34801561046757600080fd5b506102b7600181565b34801561047c57600080fd5b506102757f00000000000000000000000005ac899e78c7ebe87f5b92f9cdde71fa25cfe2cb81565b3480156104b057600080fd5b506102a06104bf366004611ab4565b611064565b3480156104d057600080fd5b506102486110b1565b3480156104e557600080fd5b506102b760085481565b3480156104fb57600080fd5b506102a061050a366004611cba565b6110c0565b6102a061051d366004611cf6565b61112c565b34801561052e57600080fd5b50600b5461053c9060ff1681565b60405161022a9190611daa565b34801561055557600080fd5b50610248610564366004611ab4565b611176565b34801561057557600080fd5b506102a0610584366004611ae9565b611222565b34801561059557600080fd5b506102a06105a4366004611db8565b611393565b3480156105b557600080fd5b506102b76105c4366004611bca565b600d6020526000908152604090205481565b3480156105e257600080fd5b5061021e6105f1366004611dd9565b6114bc565b60006301ffc9a760e01b6001600160e01b03198316148061062757506380ac58cd60e01b6001600160e01b03198316145b806106425750635b5e139f60e01b6001600160e01b03198316145b92915050565b60606002805461065790611e0c565b80601f016020809104026020016040519081016040528092919081815260200182805461068390611e0c565b80156106d05780601f106106a5576101008083540402835291602001916106d0565b820191906000526020600020905b8154815290600101906020018083116106b357829003601f168201915b5050505050905090565b60006106e5826114ea565b610702576040516333d1c03960e21b815260040160405180910390fd5b506000908152600660205260409020546001600160a01b031690565b600061072982610e36565b9050336001600160a01b038216146107625761074581336114bc565b610762576040516367d9dca160e11b815260040160405180910390fd5b60008281526006602052604080822080546001600160a01b0319166001600160a01b0387811691821790925591518593918516917f8c5be1e5ebec7d5bd14f71427d1e84f3dd0314c0f7b2291e5b200ac8c7c3b92591a4505050565b60006107c98261151f565b9050836001600160a01b0316816001600160a01b0316146107fc5760405162a1148160e81b815260040160405180910390fd5b60008281526006602052604090208054338082146001600160a01b038816909114176108495761082c86336114bc565b61084957604051632ce44b5f60e11b815260040160405180910390fd5b6001600160a01b03851661087057604051633a954ecd60e21b815260040160405180910390fd5b801561087b57600082555b6001600160a01b038681166000908152600560205260408082208054600019019055918716808252919020805460010190554260a01b17600160e11b17600085815260046020526040812091909155600160e11b8416900361090d5760018401600081815260046020526040812054900361090b57600054811461090b5760008181526004602052604090208490555b505b83856001600160a01b0316876001600160a01b03167fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef60405160405180910390a45b505050505050565b6001600b5460ff16600281111561097057610970611d72565b146109cd5760405162461bcd60e51b815260206004820152602260248201527f426c757250756e6b3a206e6f742077686974656c697374206d696e7420737461604482015261676560f01b60648201526084015b60405180910390fd5b6002811115610a2c5760405162461bcd60e51b815260206004820152602560248201527f426c757250756e6b3a20657863656564206d6178206d696e742070657220616360448201526418dbdd5b9d60da1b60648201526084016109c4565b80600854610a3a9190611e5c565b3414610a885760405162461bcd60e51b815260206004820152601a60248201527f426c757250756e6b3a206e6f7420656e6f75676820657468657200000000000060448201526064016109c4565b336000908152600d6020526040902054600211610ab75760405162461bcd60e51b81526004016109c490611e7b565b336000908152600d6020526040902054600290610ad5908390611ec1565b1115610af35760405162461bcd60e51b81526004016109c490611e7b565b610b3483838080602002602001604051908101604052809392919081815260200183836020028082843760009201919091525050600c54915033905061158e565b1515600114610b7c5760405162461bcd60e51b815260206004820152601460248201527334b73b30b634b21036b2b935b63290383937b7b360611b60448201526064016109c4565b61057a81610b91600154600054036000190190565b610b9b9190611ec1565b1115610bb95760405162461bcd60e51b81526004016109c490611ed9565b336000908152600d6020526040902054610bd4908290611ec1565b336000818152600d6020526040902091909155610bf190826115a4565b505050565b6002600b5460ff166002811115610c0f57610c0f611d72565b14610c5c5760405162461bcd60e51b815260206004820152601f60248201527f426c757250756e6b3a206e6f74207075626c6963206d696e742073746167650060448201526064016109c4565b6003811115610cad5760405162461bcd60e51b815260206004820181905260248201527f426c757250756e6b3a20657863656564206d6178206d696e742070657220747860448201526064016109c4565b80600854610cbb9190611e5c565b3414610d095760405162461bcd60e51b815260206004820152601a60248201527f426c757250756e6b3a206e6f7420656e6f75676820657468657200000000000060448201526064016109c4565b61057a81610d1e600154600054036000190190565b610d289190611ec1565b1115610d465760405162461bcd60e51b81526004016109c490611ed9565b610d5033826115a4565b50565b7f00000000000000000000000005ac899e78c7ebe87f5b92f9cdde71fa25cfe2cb6001600160a01b03163314610d9b5760405162461bcd60e51b81526004016109c490611f10565b600b80546001600160a01b0390921661010002610100600160a81b0319909216919091179055565b610bf18383836040518060200160405280600081525061112c565b7f00000000000000000000000005ac899e78c7ebe87f5b92f9cdde71fa25cfe2cb6001600160a01b03163314610e265760405162461bcd60e51b81526004016109c490611f10565b6009610e328282611f83565b5050565b60006106428261151f565b60098054610e4e90611e0c565b80601f0160208091040260200160405190810160405280929190818152602001828054610e7a90611e0c565b8015610ec75780601f10610e9c57610100808354040283529160200191610ec7565b820191906000526020600020905b815481529060010190602001808311610eaa57829003601f168201915b505050505081565b60006001600160a01b038216610ef8576040516323d3ad8160e21b815260040160405180910390fd5b506001600160a01b031660009081526005602052604090205467ffffffffffffffff1690565b7f00000000000000000000000005ac899e78c7ebe87f5b92f9cdde71fa25cfe2cb6001600160a01b03163314610f665760405162461bcd60e51b81526004016109c490611f10565b600c55565b7f00000000000000000000000005ac899e78c7ebe87f5b92f9cdde71fa25cfe2cb6001600160a01b03163314610fb35760405162461bcd60e51b81526004016109c490611f10565b4780610ff65760405162461bcd60e51b81526020600482015260126024820152714e6f2045544820746f20776974686472617760701b60448201526064016109c4565b600b5461010090046001600160a01b03166110495760405162461bcd60e51b81526020600482015260136024820152724e6f207769746864726177206164647265737360681b60448201526064016109c4565b600b54610d509061010090046001600160a01b0316476116a2565b7f00000000000000000000000005ac899e78c7ebe87f5b92f9cdde71fa25cfe2cb6001600160a01b031633146110ac5760405162461bcd60e51b81526004016109c490611f10565b600855565b60606003805461065790611e0c565b3360008181526007602090815260408083206001600160a01b03871680855290835292819020805460ff191686151590811790915590519081529192917f17307eab39ab6107e8899845ad3d59bd9653f200f220920489ca2b5937696c31910160405180910390a35050565b6111378484846107be565b6001600160a01b0383163b156111705761115384848484611737565b611170576040516368d2bf6b60e11b815260040160405180910390fd5b50505050565b6060611181826114ea565b6111c35760405162461bcd60e51b8152602060048201526013602482015272109b1d5c941d5b9ace881b9bdd08195e1a5cdd606a1b60448201526064016109c4565b60006111cd611823565b905060008151116111ed576040518060200160405280600081525061121b565b806111f784611832565b600a60405160200161120b93929190612043565b6040516020818303038152906040525b9392505050565b7f00000000000000000000000005ac899e78c7ebe87f5b92f9cdde71fa25cfe2cb6001600160a01b0316331461126a5760405162461bcd60e51b81526004016109c490611f10565b806032146112cd5760405162461bcd60e51b815260206004820152602a60248201527f426c757250756e6b3a20666f756e646572206d696e74207175616e746974792060448201526906d7573742062652035360b41b60648201526084016109c4565b600b54600160a81b900460ff16156113355760405162461bcd60e51b815260206004820152602560248201527f426c757250756e6b3a20666f756e646572206d696e7420616c7265616479206d6044820152641a5b9d195960da1b60648201526084016109c4565b61057a8161134a600154600054036000190190565b6113549190611ec1565b11156113725760405162461bcd60e51b81526004016109c490611ed9565b61137c82826115a4565b5050600b805460ff60a81b1916600160a81b179055565b7f00000000000000000000000005ac899e78c7ebe87f5b92f9cdde71fa25cfe2cb6001600160a01b031633146113db5760405162461bcd60e51b81526004016109c490611f10565b8060028111156113ed576113ed611d72565b600b5460ff16600281111561140457611404611d72565b036114515760405162461bcd60e51b815260206004820152601860248201527f426c757250756e6b3a20696e76616c69642073746167652e000000000000000060448201526064016109c4565b600b805460ff811691839160ff1916600183600281111561147457611474611d72565b0217905550600b546040517f0f63b8bffe147a0fe1362da0e6e3ae0fcffce5497482f4d438715fe53890acf1916114b091849160ff16906120e3565b60405180910390a15050565b6001600160a01b03918216600090815260076020908152604080832093909416825291909152205460ff1690565b6000816001111580156114fe575060005482105b8015610642575050600090815260046020526040902054600160e01b161590565b60008180600111611575576000548110156115755760008181526004602052604081205490600160e01b82169003611573575b8060000361121b575060001901600081815260046020526040902054611552565b505b604051636f96cda160e11b815260040160405180910390fd5b60008261159b85846118c5565b14949350505050565b60008054908290036115c95760405163b562e8dd60e01b815260040160405180910390fd5b6001600160a01b03831660008181526005602090815260408083208054680100000000000000018802019055848352600490915281206001851460e11b4260a01b178317905582840190839083907fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef8180a4600183015b81811461167857808360007fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef600080a4600101611640565b508160000361169957604051622e076360e81b815260040160405180910390fd5b60005550505050565b6000826001600160a01b03168260405160006040518083038185875af1925050503d80600081146116ef576040519150601f19603f3d011682016040523d82523d6000602084013e6116f4565b606091505b5050905080610bf15760405162461bcd60e51b815260206004820152600f60248201526e151c985b9cd9995c8819985a5b1959608a1b60448201526064016109c4565b604051630a85bd0160e11b81526000906001600160a01b0385169063150b7a029061176c9033908990889088906004016120fe565b6020604051808303816000875af19250505080156117a7575060408051601f3d908101601f191682019092526117a49181019061213b565b60015b611805573d8080156117d5576040519150601f19603f3d011682016040523d82523d6000602084013e6117da565b606091505b5080516000036117fd576040516368d2bf6b60e11b815260040160405180910390fd5b805181602001fd5b6001600160e01b031916630a85bd0160e11b1490505b949350505050565b60606009805461065790611e0c565b6060600061183f83611912565b600101905060008167ffffffffffffffff81111561185f5761185f611be5565b6040519080825280601f01601f191660200182016040528015611889576020820181803683370190505b5090508181016020015b600019016f181899199a1a9b1b9c1cb0b131b232b360811b600a86061a8153600a850494508461189357509392505050565b600081815b845181101561190a576118f6828683815181106118e9576118e9612158565b60200260200101516119ea565b9150806119028161216e565b9150506118ca565b509392505050565b60008072184f03e93ff9f4daa797ed6e38ed64bf6a1f0160401b83106119515772184f03e93ff9f4daa797ed6e38ed64bf6a1f0160401b830492506040015b6d04ee2d6d415b85acef8100000000831061197d576d04ee2d6d415b85acef8100000000830492506020015b662386f26fc10000831061199b57662386f26fc10000830492506010015b6305f5e10083106119b3576305f5e100830492506008015b61271083106119c757612710830492506004015b606483106119d9576064830492506002015b600a83106106425760010192915050565b6000818310611a0657600082815260208490526040902061121b565b5060009182526020526040902090565b6001600160e01b031981168114610d5057600080fd5b600060208284031215611a3e57600080fd5b813561121b81611a16565b60005b83811015611a64578181015183820152602001611a4c565b838111156111705750506000910152565b60008151808452611a8d816020860160208601611a49565b601f01601f19169290920160200192915050565b60208152600061121b6020830184611a75565b600060208284031215611ac657600080fd5b5035919050565b80356001600160a01b0381168114611ae457600080fd5b919050565b60008060408385031215611afc57600080fd5b611b0583611acd565b946020939093013593505050565b600080600060608486031215611b2857600080fd5b611b3184611acd565b9250611b3f60208501611acd565b9150604084013590509250925092565b600080600060408486031215611b6457600080fd5b833567ffffffffffffffff80821115611b7c57600080fd5b818601915086601f830112611b9057600080fd5b813581811115611b9f57600080fd5b8760208260051b8501011115611bb457600080fd5b6020928301989097509590910135949350505050565b600060208284031215611bdc57600080fd5b61121b82611acd565b634e487b7160e01b600052604160045260246000fd5b600067ffffffffffffffff80841115611c1657611c16611be5565b604051601f8501601f19908116603f01168101908282118183101715611c3e57611c3e611be5565b81604052809350858152868686011115611c5757600080fd5b858560208301376000602087830101525050509392505050565b600060208284031215611c8357600080fd5b813567ffffffffffffffff811115611c9a57600080fd5b8201601f81018413611cab57600080fd5b61181b84823560208401611bfb565b60008060408385031215611ccd57600080fd5b611cd683611acd565b915060208301358015158114611ceb57600080fd5b809150509250929050565b60008060008060808587031215611d0c57600080fd5b611d1585611acd565b9350611d2360208601611acd565b925060408501359150606085013567ffffffffffffffff811115611d4657600080fd5b8501601f81018713611d5757600080fd5b611d6687823560208401611bfb565b91505092959194509250565b634e487b7160e01b600052602160045260246000fd5b60038110611da657634e487b7160e01b600052602160045260246000fd5b9052565b602081016106428284611d88565b600060208284031215611dca57600080fd5b81356003811061121b57600080fd5b60008060408385031215611dec57600080fd5b611df583611acd565b9150611e0360208401611acd565b90509250929050565b600181811c90821680611e2057607f821691505b602082108103611e4057634e487b7160e01b600052602260045260246000fd5b50919050565b634e487b7160e01b600052601160045260246000fd5b6000816000190483118215151615611e7657611e76611e46565b500290565b60208082526026908201527f426c757250756e6b3a20616c726561647920636c61696d6564206d6178207175604082015265616e7469747960d01b606082015260800190565b60008219821115611ed457611ed4611e46565b500190565b6020808252601b908201527f426c757250756e6b3a20657863656564206d617820737570706c790000000000604082015260600190565b60208082526013908201527221363ab9283ab7359d103737ba1037bbb732b960691b604082015260600190565b601f821115610bf157600081815260208120601f850160051c81016020861015611f645750805b601f850160051c820191505b8181101561094f57828155600101611f70565b815167ffffffffffffffff811115611f9d57611f9d611be5565b611fb181611fab8454611e0c565b84611f3d565b602080601f831160018114611fe65760008415611fce5750858301515b600019600386901b1c1916600185901b17855561094f565b600085815260208120601f198616915b8281101561201557888601518255948401946001909101908401611ff6565b50858210156120335787850151600019600388901b60f8161c191681555b5050505050600190811b01905550565b6000845160206120568285838a01611a49565b8551918401916120698184848a01611a49565b855492019160009061207a81611e0c565b6001828116801561209257600181146120a7576120d3565b60ff19841687528215158302870194506120d3565b896000528560002060005b848110156120cb578154898201529083019087016120b2565b505082870194505b50929a9950505050505050505050565b604081016120f18285611d88565b61121b6020830184611d88565b6001600160a01b038581168252841660208201526040810183905260806060820181905260009061213190830184611a75565b9695505050505050565b60006020828403121561214d57600080fd5b815161121b81611a16565b634e487b7160e01b600052603260045260246000fd5b60006001820161218057612180611e46565b506001019056fea26469706673582212205f27f0fe59ce55971fb272338787021aa7e8fbada93b2428a2fcd70ddbaf17b464736f6c634300080f0033
Constructor Arguments (ABI-Encoded and is the last bytes of the Contract Creation Code above)
66233c90d1272de85b063341ef878380e9f4bbbb97d5ffb3fb653dec508c93aa
-----Decoded View---------------
Arg [0] : _merkleRoot (bytes32): 0x66233c90d1272de85b063341ef878380e9f4bbbb97d5ffb3fb653dec508c93aa
-----Encoded View---------------
1 Constructor Arguments found :
Arg [0] : 66233c90d1272de85b063341ef878380e9f4bbbb97d5ffb3fb653dec508c93aa
Loading...
Loading
Loading...
Loading
[ Download: CSV Export ]
[ Download: CSV Export ]
A token is a representation of an on-chain or off-chain asset. The token page shows information such as price, total supply, holders, transfers and social links. Learn more about this page in our Knowledge Base.