Feature Tip: Add private address tag to any address under My Name Tag !
ERC-721
Overview
Max Total Supply
300 EncyrptxD
Holders
173
Market
Volume (24H)
N/A
Min Price (24H)
N/A
Max Price (24H)
N/A
Other Info
Token Contract
Balance
2 EncyrptxDLoading...
Loading
Loading...
Loading
Loading...
Loading
# | Exchange | Pair | Price | 24H Volume | % Volume |
---|
Contract Name:
EncryptxD
Compiler Version
v0.8.7+commit.e28d00a7
Optimization Enabled:
Yes with 200 runs
Other Settings:
default evmVersion
Contract Source Code (Solidity Standard Json-Input format)
// SPDX-License-Identifier: GPL-3.0 pragma solidity ^0.8.4; import "@openzeppelin/contracts/access/Ownable.sol"; import "@openzeppelin/contracts/utils/cryptography/MerkleProof.sol"; import "@openzeppelin/contracts/utils/Strings.sol"; import "./ERC721A.sol"; // @@@@@@@@ @@@ @@@ @@@@@@@ @@@@@@@ @@@ @@@ @@@@@@@ @@@@@@@ @@@ @@@ @@@@@@@ // @@@@@@@@ @@@@ @@@ @@@@@@@@ @@@@@@@@ @@@ @@@ @@@@@@@@ @@@@@@@ @@@ @@@ @@@@@@@@ // @@! @@!@!@@@ !@@ @@! @@@ @@! !@@ @@! @@@ @@! @@! !@@ @@! @@@ // !@! !@!!@!@! !@! !@! @!@ !@! @!! !@! @!@ !@! !@! @!! !@! @!@ // @!!!:! @!@ !!@! !@! @!@!!@! !@!@! @!@@!@! @!! !@@!@! @!@ !@! // !!!!!: !@! !!! !!! !!@!@! @!!! !!@!!! !!! @!!! !@! !!! // !!: !!: !!! :!! !!: :!! !!: !!: !!: !: :!! !!: !!! // :!: :!: !:! :!: :!: !:! :!: :!: :!: :!: !:! :!: !:! // :: :::: :: :: ::: ::: :: ::: :: :: :: :: ::: :::: :: // : :: :: :: : :: :: : : : : : : : : :: :: : : contract EncryptxD is Ownable, ERC721A { constructor() ERC721A("EncryptxD", "EncyrptxD") {} uint256 collectionSize = 300; uint256 price = 0.04 ether; bool allowlistOpen = false; bool waitlistOpen = false; string private _baseTokenURI = ""; bool public isPaused = true; bytes32 public allowlistMerkleRoot; bytes32 public waitlistMerkleRoot; mapping(address => bool) public mintClaimed; modifier isAllowlistOpen { require(allowlistOpen, "Allowlist is closed!"); _; } modifier isWaitlistOpen { require(waitlistOpen, "Waitlist is closed!"); _; } modifier callerIsUser { require(tx.origin == msg.sender, "The caller is another contract"); _; } modifier isValidMint(uint256 mintAmount) { require(mintAmount > 0, "Mint Amount Incorrect"); require(msg.value >= price * mintAmount, "Incorrect payment amount!"); require(totalSupply() + mintAmount < collectionSize + 1, "Reached max supply"); require(!isPaused, "Mint paused"); _; } function allowlistMint(uint256 mintAmount, bytes32[] calldata _merkleProof) external payable callerIsUser isAllowlistOpen isValidMint(mintAmount) { bytes32 leaf = keccak256(abi.encodePacked(msg.sender)); require(MerkleProof.verify(_merkleProof, allowlistMerkleRoot, leaf), "Proof not on allowlist!"); require(mintAmount == 1, "Mint Amount Incorrect"); require(!mintClaimed[msg.sender], "Exceeds max mint amount!"); mintClaimed[msg.sender] = true; _safeMint(msg.sender, mintAmount); } function waitlistMint(uint256 mintAmount, bytes32[] calldata _merkleProof) external payable callerIsUser isWaitlistOpen isValidMint(mintAmount) { bytes32 leaf = keccak256(abi.encodePacked(msg.sender)); require(MerkleProof.verify(_merkleProof, waitlistMerkleRoot, leaf), "Proof not on waitlist!"); require(mintAmount == 1, "Mint Amount Incorrect"); require(!mintClaimed[msg.sender], "Exceeds max mint amount!"); mintClaimed[msg.sender] = true; _safeMint(msg.sender, mintAmount); } // VIEW FUNCTIONS function _baseURI() internal view virtual override returns (string memory) { return _baseTokenURI; } // ADMIN FUNCTIONS function setBaseURI(string calldata baseURI) external onlyOwner { _baseTokenURI = baseURI; } function airdrop(address[] memory addresses, uint256[] memory numMints) external onlyOwner { require(addresses.length == numMints.length, "Arrays dont match"); for (uint i = 0; i < addresses.length; i++) { require(totalSupply() + numMints[i] < collectionSize + 1, "Reached max supply"); require(numMints[i] > 0, "Cannot mint 0!"); _safeMint(addresses[i], numMints[i]); } } function setAllowlistMerkleRoot(bytes32 root) external onlyOwner { allowlistMerkleRoot = root; } function setWaitlistMerkleRoot(bytes32 root) external onlyOwner { waitlistMerkleRoot = root; } //NOTE: price must be in ethers (value * 10**18) function setPrice(uint256 newPrice) external onlyOwner { price = newPrice; } function setMaxSupply(uint256 size) external onlyOwner { collectionSize = size; } function setPaused(bool paused) external onlyOwner { isPaused = paused; } function setSaleStates(bool allowlistState, bool waitlistState) external onlyOwner { allowlistOpen = allowlistState; waitlistOpen = waitlistState; } function withdrawMoney() external onlyOwner { require(address(this).balance > 0); (bool success, ) = payable(msg.sender).call{value: address(this).balance}(""); require(success, "Transfer failed."); } }
// SPDX-License-Identifier: MIT // ERC721A Contracts v4.1.0 // Creator: Chiru Labs pragma solidity ^0.8.4; import './IERC721A.sol'; /** * @dev ERC721 token receiver interface. */ interface ERC721A__IERC721Receiver { function onERC721Received( address operator, address from, uint256 tokenId, bytes calldata data ) external returns (bytes4); } /** * @dev Implementation of https://eips.ethereum.org/EIPS/eip-721[ERC721] Non-Fungible Token Standard, * including the Metadata extension. Built to optimize for lower gas during batch mints. * * Assumes serials are sequentially minted starting at `_startTokenId()` * (defaults to 0, e.g. 0, 1, 2, 3..). * * Assumes that an owner cannot have more than 2**64 - 1 (max value of uint64) of supply. * * Assumes that the maximum token id cannot exceed 2**256 - 1 (max value of uint256). */ contract ERC721A is IERC721A { // Reference type for token approval. struct TokenApprovalRef { address value; } // Mask of an entry in packed address data. uint256 private constant BITMASK_ADDRESS_DATA_ENTRY = (1 << 64) - 1; // The bit position of `numberMinted` in packed address data. uint256 private constant BITPOS_NUMBER_MINTED = 64; // The bit position of `numberBurned` in packed address data. uint256 private constant BITPOS_NUMBER_BURNED = 128; // The bit position of `aux` in packed address data. uint256 private constant BITPOS_AUX = 192; // Mask of all 256 bits in packed address data except the 64 bits for `aux`. uint256 private constant BITMASK_AUX_COMPLEMENT = (1 << 192) - 1; // The bit position of `startTimestamp` in packed ownership. uint256 private constant BITPOS_START_TIMESTAMP = 160; // The bit mask of the `burned` bit in packed ownership. uint256 private constant BITMASK_BURNED = 1 << 224; // The bit position of the `nextInitialized` bit in packed ownership. uint256 private constant BITPOS_NEXT_INITIALIZED = 225; // The bit mask of the `nextInitialized` bit in packed ownership. uint256 private constant BITMASK_NEXT_INITIALIZED = 1 << 225; // The bit position of `extraData` in packed ownership. uint256 private constant BITPOS_EXTRA_DATA = 232; // Mask of all 256 bits in a packed ownership except the 24 bits for `extraData`. uint256 private constant BITMASK_EXTRA_DATA_COMPLEMENT = (1 << 232) - 1; // The mask of the lower 160 bits for addresses. uint256 private constant BITMASK_ADDRESS = (1 << 160) - 1; // The maximum `quantity` that can be minted with `_mintERC2309`. // This limit is to prevent overflows on the address data entries. // For a limit of 5000, a total of 3.689e15 calls to `_mintERC2309` // is required to cause an overflow, which is unrealistic. uint256 private constant MAX_MINT_ERC2309_QUANTITY_LIMIT = 5000; // The tokenId of the next token to be minted. uint256 private _currentIndex; // The number of tokens burned. uint256 private _burnCounter; // Token name string private _name; // Token symbol string private _symbol; // Mapping from token ID to ownership details // An empty struct value does not necessarily mean the token is unowned. // See `_packedOwnershipOf` implementation for details. // // Bits Layout: // - [0..159] `addr` // - [160..223] `startTimestamp` // - [224] `burned` // - [225] `nextInitialized` // - [232..255] `extraData` mapping(uint256 => uint256) private _packedOwnerships; // Mapping owner address to address data. // // Bits Layout: // - [0..63] `balance` // - [64..127] `numberMinted` // - [128..191] `numberBurned` // - [192..255] `aux` mapping(address => uint256) private _packedAddressData; // Mapping from token ID to approved address. mapping(uint256 => TokenApprovalRef) private _tokenApprovals; // Mapping from owner to operator approvals mapping(address => mapping(address => bool)) private _operatorApprovals; constructor(string memory name_, string memory symbol_) { _name = name_; _symbol = symbol_; _currentIndex = _startTokenId(); } /** * @dev Returns the starting token ID. * To change the starting token ID, please override this function. */ function _startTokenId() internal view virtual returns (uint256) { return 1; } /** * @dev Returns the next token ID to be minted. */ function _nextTokenId() internal view 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; } /** * @dev See {IERC165-supportsInterface}. */ function supportsInterface(bytes4 interfaceId) public view virtual override returns (bool) { // The interface IDs are constants representing the first 4 bytes of the XOR of // all function selectors in the interface. See: https://eips.ethereum.org/EIPS/eip-165 // e.g. `bytes4(i.functionA.selector ^ i.functionB.selector ^ ...)` return interfaceId == 0x01ffc9a7 || // ERC165 interface ID for ERC165. interfaceId == 0x80ac58cd || // ERC165 interface ID for ERC721. interfaceId == 0x5b5e139f; // ERC165 interface ID for ERC721Metadata. } /** * @dev See {IERC721-balanceOf}. */ 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 virtual 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 virtual 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 virtual 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; } /** * Returns the packed ownership data of `tokenId`. */ function _packedOwnershipOf(uint256 tokenId) private view returns (uint256) { uint256 curr = tokenId; unchecked { if (_startTokenId() <= curr) if (curr < _currentIndex) { uint256 packed = _packedOwnerships[curr]; // If not burned. if (packed & BITMASK_BURNED == 0) { // Invariant: // There will always be an ownership that has an address and is not burned // before an ownership that does not have an address and is not burned. // Hence, curr will not underflow. // // We can directly compare the packed value. // If the address is zero, packed is zero. while (packed == 0) { packed = _packedOwnerships[--curr]; } return packed; } } } revert OwnerQueryForNonexistentToken(); } /** * Returns the unpacked `TokenOwnership` struct from `packed`. */ function _unpackedOwnership(uint256 packed) private pure returns (TokenOwnership memory ownership) { ownership.addr = address(uint160(packed)); ownership.startTimestamp = uint64(packed >> BITPOS_START_TIMESTAMP); ownership.burned = packed & BITMASK_BURNED != 0; ownership.extraData = uint24(packed >> BITPOS_EXTRA_DATA); } /** * Returns the unpacked `TokenOwnership` struct at `index`. */ function _ownershipAt(uint256 index) internal view 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); } } /** * Gas spent here starts off proportional to the maximum mint batch size. * It gradually moves to O(1) as tokens get transferred around in the collection over time. */ function _ownershipOf(uint256 tokenId) internal view virtual returns (TokenOwnership memory) { return _unpackedOwnership(_packedOwnershipOf(tokenId)); } /** * @dev Packs ownership data into a single uint256. */ function _packOwnershipData(address owner, uint256 flags) private view returns (uint256 result) { assembly { // Mask `owner` to the lower 160 bits, in case the upper bits somehow aren't clean. owner := and(owner, BITMASK_ADDRESS) // `owner | (block.timestamp << BITPOS_START_TIMESTAMP) | flags`. result := or(owner, or(shl(BITPOS_START_TIMESTAMP, timestamp()), flags)) } } /** * @dev See {IERC721-ownerOf}. */ function ownerOf(uint256 tokenId) public view virtual override returns (address) { return address(uint160(_packedOwnershipOf(tokenId))); } /** * @dev See {IERC721Metadata-name}. */ function name() public view virtual override returns (string memory) { return _name; } /** * @dev See {IERC721Metadata-symbol}. */ function symbol() public view virtual override returns (string memory) { return _symbol; } /** * @dev See {IERC721Metadata-tokenURI}. */ function tokenURI(uint256 tokenId) public view virtual override returns (string memory) { if (!_exists(tokenId)) revert URIQueryForNonexistentToken(); string memory baseURI = _baseURI(); return bytes(baseURI).length != 0 ? string(abi.encodePacked(baseURI, _toString(tokenId))) : ''; } /** * @dev Base URI for computing {tokenURI}. If set, the resulting URI for each * token will be the concatenation of the `baseURI` and the `tokenId`. Empty * by default, it can be overridden in child contracts. */ function _baseURI() internal view virtual returns (string memory) { return ''; } /** * @dev Returns the `nextInitialized` flag set if `quantity` equals 1. */ function _nextInitializedFlag(uint256 quantity) private pure returns (uint256 result) { // For branchless setting of the `nextInitialized` flag. assembly { // `(quantity == 1) << BITPOS_NEXT_INITIALIZED`. result := shl(BITPOS_NEXT_INITIALIZED, eq(quantity, 1)) } } /** * @dev See {IERC721-approve}. */ function approve(address to, uint256 tokenId) public virtual override { address owner = ownerOf(tokenId); if (_msgSenderERC721A() != owner) if (!isApprovedForAll(owner, _msgSenderERC721A())) { revert ApprovalCallerNotOwnerNorApproved(); } _tokenApprovals[tokenId].value = to; emit Approval(owner, to, tokenId); } /** * @dev See {IERC721-getApproved}. */ function getApproved(uint256 tokenId) public view virtual override returns (address) { if (!_exists(tokenId)) revert ApprovalQueryForNonexistentToken(); return _tokenApprovals[tokenId].value; } /** * @dev See {IERC721-setApprovalForAll}. */ function setApprovalForAll(address operator, bool approved) public virtual override { if (operator == _msgSenderERC721A()) revert ApproveToCaller(); _operatorApprovals[_msgSenderERC721A()][operator] = approved; emit ApprovalForAll(_msgSenderERC721A(), operator, approved); } /** * @dev See {IERC721-isApprovedForAll}. */ function isApprovedForAll(address owner, address operator) public view virtual override returns (bool) { return _operatorApprovals[owner][operator]; } /** * @dev See {IERC721-safeTransferFrom}. */ function safeTransferFrom( address from, address to, uint256 tokenId ) public virtual override { safeTransferFrom(from, to, tokenId, ''); } /** * @dev See {IERC721-safeTransferFrom}. */ function safeTransferFrom( address from, address to, uint256 tokenId, bytes memory _data ) public virtual override { transferFrom(from, to, tokenId); if (to.code.length != 0) if (!_checkContractOnERC721Received(from, to, tokenId, _data)) { revert TransferToNonERC721ReceiverImplementer(); } } /** * @dev Returns whether `tokenId` exists. * * Tokens can be managed by their owner or approved accounts via {approve} or {setApprovalForAll}. * * Tokens start existing when they are minted (`_mint`), */ function _exists(uint256 tokenId) internal view virtual returns (bool) { return _startTokenId() <= tokenId && tokenId < _currentIndex && // If within bounds, _packedOwnerships[tokenId] & BITMASK_BURNED == 0; // and not burned. } /** * @dev Equivalent to `_safeMint(to, quantity, '')`. */ function _safeMint(address to, uint256 quantity) internal virtual { _safeMint(to, quantity, ''); } /** * @dev Safely mints `quantity` tokens and transfers them to `to`. * * Requirements: * * - If `to` refers to a smart contract, it must implement * {IERC721Receiver-onERC721Received}, which is called for each safe transfer. * - `quantity` must be greater than 0. * * See {_mint}. * * Emits a {Transfer} event for each mint. */ function _safeMint( address to, uint256 quantity, bytes memory _data ) internal 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 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 (to == address(0)) revert MintToZeroAddress(); if (quantity == 0) revert MintZeroQuantity(); _beforeTokenTransfers(address(0), to, startTokenId, quantity); // Overflows are incredibly unrealistic. // `balance` and `numberMinted` have a maximum limit of 2**64. // `tokenId` has a maximum limit of 2**256. unchecked { // Updates: // - `balance += quantity`. // - `numberMinted += quantity`. // // We can directly add to the `balance` and `numberMinted`. _packedAddressData[to] += quantity * ((1 << BITPOS_NUMBER_MINTED) | 1); // Updates: // - `address` to the owner. // - `startTimestamp` to the timestamp of minting. // - `burned` to `false`. // - `nextInitialized` to `quantity == 1`. _packedOwnerships[startTokenId] = _packOwnershipData( to, _nextInitializedFlag(quantity) | _nextExtraData(address(0), to, 0) ); uint256 tokenId = startTokenId; uint256 end = startTokenId + quantity; do { emit Transfer(address(0), to, tokenId++); } while (tokenId < end); _currentIndex = end; } _afterTokenTransfers(address(0), to, startTokenId, quantity); } /** * @dev Mints `quantity` tokens and transfers them to `to`. * * This function is intended for efficient minting only during contract creation. * * It emits only one {ConsecutiveTransfer} as defined in * [ERC2309](https://eips.ethereum.org/EIPS/eip-2309), * instead of a sequence of {Transfer} event(s). * * Calling this function outside of contract creation WILL make your contract * non-compliant with the ERC721 standard. * For full ERC721 compliance, substituting ERC721 {Transfer} event(s) with the ERC2309 * {ConsecutiveTransfer} event is only permissible during contract creation. * * Requirements: * * - `to` cannot be the zero address. * - `quantity` must be greater than 0. * * Emits a {ConsecutiveTransfer} event. */ function _mintERC2309(address to, uint256 quantity) internal 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 Returns the storage slot and value for the approved address of `tokenId`. */ function _getApprovedAddress(uint256 tokenId) private view returns (uint256 approvedAddressSlot, address approvedAddress) { TokenApprovalRef storage tokenApproval = _tokenApprovals[tokenId]; // The following is equivalent to `approvedAddress = _tokenApprovals[tokenId]`. assembly { approvedAddressSlot := tokenApproval.slot approvedAddress := sload(approvedAddressSlot) } } /** * @dev Returns whether the `approvedAddress` is equals to `from` or `msgSender`. */ function _isOwnerOrApproved( address approvedAddress, address from, address msgSender ) private pure returns (bool result) { assembly { // Mask `from` to the lower 160 bits, in case the upper bits somehow aren't clean. from := and(from, BITMASK_ADDRESS) // Mask `msgSender` to the lower 160 bits, in case the upper bits somehow aren't clean. msgSender := and(msgSender, BITMASK_ADDRESS) // `msgSender == from || msgSender == approvedAddress`. result := or(eq(msgSender, from), eq(msgSender, approvedAddress)) } } /** * @dev Transfers `tokenId` from `from` to `to`. * * Requirements: * * - `to` cannot be the zero address. * - `tokenId` token must be owned by `from`. * * Emits a {Transfer} event. */ function transferFrom( address from, address to, uint256 tokenId ) public virtual override { uint256 prevOwnershipPacked = _packedOwnershipOf(tokenId); if (address(uint160(prevOwnershipPacked)) != from) revert TransferFromIncorrectOwner(); (uint256 approvedAddressSlot, address approvedAddress) = _getApprovedAddress(tokenId); // The nested ifs save around 20+ gas over a compound boolean condition. if (!_isOwnerOrApproved(approvedAddress, from, _msgSenderERC721A())) if (!isApprovedForAll(from, _msgSenderERC721A())) revert TransferCallerNotOwnerNorApproved(); if (to == address(0)) revert TransferToZeroAddress(); _beforeTokenTransfers(from, to, tokenId, 1); // Clear approvals from the previous owner. assembly { if approvedAddress { // This is equivalent to `delete _tokenApprovals[tokenId]`. sstore(approvedAddressSlot, 0) } } // Underflow of the sender's balance is impossible because we check for // ownership above and the recipient's balance can't realistically overflow. // Counter overflow is incredibly unrealistic as tokenId would have to be 2**256. unchecked { // We can directly increment and decrement the balances. --_packedAddressData[from]; // Updates: `balance -= 1`. ++_packedAddressData[to]; // Updates: `balance += 1`. // Updates: // - `address` to the next owner. // - `startTimestamp` to the timestamp of transfering. // - `burned` to `false`. // - `nextInitialized` to `true`. _packedOwnerships[tokenId] = _packOwnershipData( to, BITMASK_NEXT_INITIALIZED | _nextExtraData(from, to, prevOwnershipPacked) ); // If the next slot may not have been initialized (i.e. `nextInitialized == false`) . if (prevOwnershipPacked & BITMASK_NEXT_INITIALIZED == 0) { uint256 nextTokenId = tokenId + 1; // If the next slot's address is zero and not burned (i.e. packed value is zero). if (_packedOwnerships[nextTokenId] == 0) { // If the next slot is within bounds. if (nextTokenId != _currentIndex) { // Initialize the next slot to maintain correctness for `ownerOf(tokenId + 1)`. _packedOwnerships[nextTokenId] = prevOwnershipPacked; } } } } emit Transfer(from, to, tokenId); _afterTokenTransfers(from, to, tokenId, 1); } /** * @dev Equivalent to `_burn(tokenId, false)`. */ function _burn(uint256 tokenId) internal virtual { _burn(tokenId, false); } /** * @dev Destroys `tokenId`. * The approval is cleared when the token is burned. * * Requirements: * * - `tokenId` must exist. * * Emits a {Transfer} event. */ function _burn(uint256 tokenId, bool approvalCheck) internal virtual { uint256 prevOwnershipPacked = _packedOwnershipOf(tokenId); address from = address(uint160(prevOwnershipPacked)); (uint256 approvedAddressSlot, address approvedAddress) = _getApprovedAddress(tokenId); if (approvalCheck) { // The nested ifs save around 20+ gas over a compound boolean condition. if (!_isOwnerOrApproved(approvedAddress, from, _msgSenderERC721A())) if (!isApprovedForAll(from, _msgSenderERC721A())) revert TransferCallerNotOwnerNorApproved(); } _beforeTokenTransfers(from, address(0), tokenId, 1); // Clear approvals from the previous owner. assembly { if approvedAddress { // This is equivalent to `delete _tokenApprovals[tokenId]`. sstore(approvedAddressSlot, 0) } } // Underflow of the sender's balance is impossible because we check for // ownership above and the recipient's balance can't realistically overflow. // Counter overflow is incredibly unrealistic as `tokenId` would have to be 2**256. unchecked { // Updates: // - `balance -= 1`. // - `numberBurned += 1`. // // We can directly decrement the balance, and increment the number burned. // This is equivalent to `packed -= 1; packed += 1 << BITPOS_NUMBER_BURNED;`. _packedAddressData[from] += (1 << BITPOS_NUMBER_BURNED) - 1; // Updates: // - `address` to the last owner. // - `startTimestamp` to the timestamp of burning. // - `burned` to `true`. // - `nextInitialized` to `true`. _packedOwnerships[tokenId] = _packOwnershipData( from, (BITMASK_BURNED | BITMASK_NEXT_INITIALIZED) | _nextExtraData(from, address(0), prevOwnershipPacked) ); // If the next slot may not have been initialized (i.e. `nextInitialized == false`) . if (prevOwnershipPacked & BITMASK_NEXT_INITIALIZED == 0) { uint256 nextTokenId = tokenId + 1; // If the next slot's address is zero and not burned (i.e. packed value is zero). if (_packedOwnerships[nextTokenId] == 0) { // If the next slot is within bounds. if (nextTokenId != _currentIndex) { // Initialize the next slot to maintain correctness for `ownerOf(tokenId + 1)`. _packedOwnerships[nextTokenId] = prevOwnershipPacked; } } } } emit Transfer(from, address(0), tokenId); _afterTokenTransfers(from, address(0), tokenId, 1); // Overflow not possible, as _burnCounter cannot be exceed _currentIndex times. unchecked { _burnCounter++; } } /** * @dev Internal function to invoke {IERC721Receiver-onERC721Received} on a target contract. * * @param from address representing the previous owner of the given token ID * @param to target address that will receive the tokens * @param tokenId uint256 ID of the token to be transferred * @param _data bytes optional data to send along with the call * @return bool whether the call correctly returned the expected magic value */ function _checkContractOnERC721Received( address from, address to, uint256 tokenId, bytes memory _data ) private returns (bool) { try ERC721A__IERC721Receiver(to).onERC721Received(_msgSenderERC721A(), from, tokenId, _data) returns ( bytes4 retval ) { return retval == ERC721A__IERC721Receiver(to).onERC721Received.selector; } catch (bytes memory reason) { if (reason.length == 0) { revert TransferToNonERC721ReceiverImplementer(); } else { assembly { revert(add(32, reason), mload(reason)) } } } } /** * @dev Directly sets the extra data for the ownership data `index`. */ function _setExtraDataAt(uint256 index, uint24 extraData) internal 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 Returns the next extra data for the packed ownership data. * The returned result is shifted into position. */ function _nextExtraData( address from, address to, uint256 prevOwnershipPacked ) private view returns (uint256) { uint24 extraData = uint24(prevOwnershipPacked >> BITPOS_EXTRA_DATA); return uint256(_extraData(from, to, extraData)) << BITPOS_EXTRA_DATA; } /** * @dev Called during each token transfer to set the 24bit `extraData` field. * Intended to be overridden by the cosumer contract. * * `previousExtraData` - the value of `extraData` before transfer. * * Calling conditions: * * - When `from` and `to` are both non-zero, `from`'s `tokenId` will be * transferred to `to`. * - When `from` is zero, `tokenId` will be minted for `to`. * - When `to` is zero, `tokenId` will be burned by `from`. * - `from` and `to` are never both zero. */ function _extraData( address from, address to, uint24 previousExtraData ) internal view virtual returns (uint24) {} /** * @dev Hook that is called before a set of serially-ordered token ids are about to be transferred. * This includes minting. * And also called before burning one token. * * startTokenId - the first token id to be transferred * quantity - the amount to be transferred * * Calling conditions: * * - When `from` and `to` are both non-zero, `from`'s `tokenId` will be * transferred to `to`. * - When `from` is zero, `tokenId` will be minted for `to`. * - When `to` is zero, `tokenId` will be burned by `from`. * - `from` and `to` are never both zero. */ function _beforeTokenTransfers( address from, address to, uint256 startTokenId, uint256 quantity ) internal virtual {} /** * @dev Hook that is called after a set of serially-ordered token ids have been transferred. * This includes minting. * And also called after one token has been burned. * * startTokenId - the first token id to be transferred * quantity - the amount to be transferred * * Calling conditions: * * - When `from` and `to` are both non-zero, `from`'s `tokenId` has been * transferred to `to`. * - When `from` is zero, `tokenId` has been minted for `to`. * - When `to` is zero, `tokenId` has been burned by `from`. * - `from` and `to` are never both zero. */ function _afterTokenTransfers( address from, address to, uint256 startTokenId, uint256 quantity ) internal virtual {} /** * @dev Returns the message sender (defaults to `msg.sender`). * * If you are writing GSN compatible contracts, you need to override this function. */ function _msgSenderERC721A() internal view virtual returns (address) { return msg.sender; } /** * @dev Converts a `uint256` to its ASCII `string` decimal representation. */ function _toString(uint256 value) internal pure virtual returns (string memory ptr) { assembly { // The maximum value of a uint256 contains 78 digits (1 byte per digit), // but we allocate 128 bytes to keep the free memory pointer 32-byte word aliged. // We will need 1 32-byte word to store the length, // and 3 32-byte words to store a maximum of 78 digits. Total: 32 + 3 * 32 = 128. ptr := add(mload(0x40), 128) // Update the free memory pointer to allocate. mstore(0x40, ptr) // Cache the end of the memory to calculate the length later. let end := ptr // We write the string from the rightmost digit to the leftmost digit. // The following is essentially a do-while loop that also handles the zero case. // Costs a bit more than early returning for the zero case, // but cheaper in terms of deployment and overall runtime costs. for { // Initialize and perform the first pass without check. let temp := value // Move the pointer 1 byte leftwards to point to an empty character slot. ptr := sub(ptr, 1) // Write the character to the pointer. 48 is the ASCII index of '0'. mstore8(ptr, add(48, mod(temp, 10))) temp := div(temp, 10) } temp { // Keep dividing `temp` until zero. temp := div(temp, 10) } { // Body of the for loop. ptr := sub(ptr, 1) mstore8(ptr, add(48, mod(temp, 10))) } let length := sub(end, ptr) // Move the pointer 32 bytes leftwards to make room for the length. ptr := sub(ptr, 32) // Store the length. mstore(ptr, length) } } }
// SPDX-License-Identifier: MIT // OpenZeppelin Contracts (last updated v4.8.0) (utils/Strings.sol) pragma solidity ^0.8.0; import "./math/Math.sol"; /** * @dev String operations. */ library Strings { bytes16 private constant _SYMBOLS = "0123456789abcdef"; uint8 private constant _ADDRESS_LENGTH = 20; /** * @dev Converts a `uint256` to its ASCII `string` decimal representation. */ function toString(uint256 value) internal pure returns (string memory) { unchecked { uint256 length = Math.log10(value) + 1; string memory buffer = new string(length); uint256 ptr; /// @solidity memory-safe-assembly assembly { ptr := add(buffer, add(32, length)) } while (true) { ptr--; /// @solidity memory-safe-assembly assembly { mstore8(ptr, byte(mod(value, 10), _SYMBOLS)) } value /= 10; if (value == 0) break; } return buffer; } } /** * @dev Converts a `uint256` to its ASCII `string` hexadecimal representation. */ function toHexString(uint256 value) internal pure returns (string memory) { unchecked { return toHexString(value, Math.log256(value) + 1); } } /** * @dev Converts a `uint256` to its ASCII `string` hexadecimal representation with fixed length. */ function toHexString(uint256 value, uint256 length) internal pure returns (string memory) { bytes memory buffer = new bytes(2 * length + 2); buffer[0] = "0"; buffer[1] = "x"; for (uint256 i = 2 * length + 1; i > 1; --i) { buffer[i] = _SYMBOLS[value & 0xf]; value >>= 4; } require(value == 0, "Strings: hex length insufficient"); return string(buffer); } /** * @dev Converts an `address` with fixed length of 20 bytes to its not checksummed ASCII `string` hexadecimal representation. */ function toHexString(address addr) internal pure returns (string memory) { return toHexString(uint256(uint160(addr)), _ADDRESS_LENGTH); } }
// SPDX-License-Identifier: MIT // OpenZeppelin Contracts (last updated v4.8.0) (utils/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.7.0) (access/Ownable.sol) pragma solidity ^0.8.0; import "../utils/Context.sol"; /** * @dev Contract module which provides a basic access control mechanism, where * there is an account (an owner) that can be granted exclusive access to * specific functions. * * By default, the owner account will be the one that deploys the contract. This * can later be changed with {transferOwnership}. * * This module is used through inheritance. It will make available the modifier * `onlyOwner`, which can be applied to your functions to restrict their use to * the owner. */ abstract contract Ownable is Context { address private _owner; event OwnershipTransferred(address indexed previousOwner, address indexed newOwner); /** * @dev Initializes the contract setting the deployer as the initial owner. */ constructor() { _transferOwnership(_msgSender()); } /** * @dev Throws if called by any account other than the owner. */ modifier onlyOwner() { _checkOwner(); _; } /** * @dev Returns the address of the current owner. */ function owner() public view virtual returns (address) { return _owner; } /** * @dev Throws if the sender is not the owner. */ function _checkOwner() internal view virtual { require(owner() == _msgSender(), "Ownable: caller is not the owner"); } /** * @dev Leaves the contract without owner. It will not be possible to call * `onlyOwner` functions anymore. Can only be called by the current owner. * * NOTE: Renouncing ownership will leave the contract without an owner, * thereby removing any functionality that is only available to the owner. */ function renounceOwnership() public virtual onlyOwner { _transferOwnership(address(0)); } /** * @dev Transfers ownership of the contract to a new account (`newOwner`). * Can only be called by the current owner. */ function transferOwnership(address newOwner) public virtual onlyOwner { require(newOwner != address(0), "Ownable: new owner is the zero address"); _transferOwnership(newOwner); } /** * @dev Transfers ownership of the contract to a new account (`newOwner`). * Internal function without access restriction. */ function _transferOwnership(address newOwner) internal virtual { address oldOwner = _owner; _owner = newOwner; emit OwnershipTransferred(oldOwner, newOwner); } }
// SPDX-License-Identifier: MIT // ERC721A Contracts v4.1.0 // Creator: Chiru Labs pragma solidity ^0.8.4; /** * @dev Interface of an ERC721A compliant contract. */ interface IERC721A { /** * The caller must own the token or be an approved operator. */ error ApprovalCallerNotOwnerNorApproved(); /** * The token does not exist. */ error ApprovalQueryForNonexistentToken(); /** * The caller cannot approve to their own address. */ error ApproveToCaller(); /** * Cannot query the balance for the zero address. */ error BalanceQueryForZeroAddress(); /** * Cannot mint to the zero address. */ error MintToZeroAddress(); /** * The quantity of tokens minted must be more than zero. */ error MintZeroQuantity(); /** * The token does not exist. */ error OwnerQueryForNonexistentToken(); /** * The caller must own the token or be an approved operator. */ error TransferCallerNotOwnerNorApproved(); /** * The token must be owned by `from`. */ error TransferFromIncorrectOwner(); /** * Cannot safely transfer to a contract that does not implement the ERC721Receiver interface. */ error TransferToNonERC721ReceiverImplementer(); /** * Cannot transfer to the zero address. */ error TransferToZeroAddress(); /** * The token does not exist. */ error URIQueryForNonexistentToken(); /** * The `quantity` minted with ERC2309 exceeds the safety limit. */ error MintERC2309QuantityExceedsLimit(); /** * The `extraData` cannot be set on an unintialized ownership slot. */ error OwnershipNotInitializedForExtraData(); struct TokenOwnership { // The address of the owner. address addr; // Keeps track of the start time of ownership with minimal overhead for tokenomics. uint64 startTimestamp; // Whether the token has been burned. bool burned; // Arbitrary data similar to `startTimestamp` that can be set through `_extraData`. uint24 extraData; } /** * @dev Returns the total amount of tokens stored by the contract. * * Burned tokens are calculated here, use `_totalMinted()` if you want to count just minted tokens. */ function totalSupply() external view returns (uint256); // ============================== // IERC165 // ============================== /** * @dev Returns true if this contract implements the interface defined by * `interfaceId`. See the corresponding * https://eips.ethereum.org/EIPS/eip-165#how-interfaces-are-identified[EIP section] * to learn more about how these ids are created. * * This function call must use less than 30 000 gas. */ function supportsInterface(bytes4 interfaceId) external view returns (bool); // ============================== // IERC721 // ============================== /** * @dev Emitted when `tokenId` token is transferred from `from` to `to`. */ event Transfer(address indexed from, address indexed to, uint256 indexed tokenId); /** * @dev Emitted when `owner` enables `approved` to manage the `tokenId` token. */ event Approval(address indexed owner, address indexed approved, uint256 indexed tokenId); /** * @dev Emitted when `owner` enables or disables (`approved`) `operator` to manage all of its assets. */ event ApprovalForAll(address indexed owner, address indexed operator, bool approved); /** * @dev Returns the number of tokens in ``owner``'s account. */ function balanceOf(address owner) external view returns (uint256 balance); /** * @dev Returns the owner of the `tokenId` token. * * Requirements: * * - `tokenId` must exist. */ function ownerOf(uint256 tokenId) external view returns (address owner); /** * @dev Safely transfers `tokenId` token from `from` to `to`. * * Requirements: * * - `from` cannot be the zero address. * - `to` cannot be the zero address. * - `tokenId` token must exist and be owned by `from`. * - If the caller is not `from`, it must be approved to move this token by either {approve} or {setApprovalForAll}. * - If `to` refers to a smart contract, it must implement {IERC721Receiver-onERC721Received}, which is called upon a safe transfer. * * Emits a {Transfer} event. */ function safeTransferFrom( address from, address to, uint256 tokenId, bytes calldata data ) external; /** * @dev Safely transfers `tokenId` token from `from` to `to`, checking first that contract recipients * are aware of the ERC721 protocol to prevent tokens from being forever locked. * * Requirements: * * - `from` cannot be the zero address. * - `to` cannot be the zero address. * - `tokenId` token must exist and be owned by `from`. * - If the caller is not `from`, it must be have been allowed to move this token by either {approve} or {setApprovalForAll}. * - If `to` refers to a smart contract, it must implement {IERC721Receiver-onERC721Received}, which is called upon a safe transfer. * * Emits a {Transfer} event. */ function safeTransferFrom( address from, address to, uint256 tokenId ) external; /** * @dev Transfers `tokenId` token from `from` to `to`. * * WARNING: Usage of this method is discouraged, use {safeTransferFrom} whenever possible. * * Requirements: * * - `from` cannot be the zero address. * - `to` cannot be the zero address. * - `tokenId` token must be owned by `from`. * - If the caller is not `from`, it must be approved to move this token by either {approve} or {setApprovalForAll}. * * Emits a {Transfer} event. */ function transferFrom( address from, address to, uint256 tokenId ) external; /** * @dev Gives permission to `to` to transfer `tokenId` token to another account. * The approval is cleared when the token is transferred. * * Only a single account can be approved at a time, so approving the zero address clears previous approvals. * * Requirements: * * - The caller must own the token or be an approved operator. * - `tokenId` must exist. * * Emits an {Approval} event. */ function approve(address to, uint256 tokenId) external; /** * @dev Approve or remove `operator` as an operator for the caller. * Operators can call {transferFrom} or {safeTransferFrom} for any token owned by the caller. * * Requirements: * * - The `operator` cannot be the caller. * * Emits an {ApprovalForAll} event. */ function setApprovalForAll(address operator, bool _approved) external; /** * @dev Returns the account approved for `tokenId` token. * * Requirements: * * - `tokenId` must exist. */ function getApproved(uint256 tokenId) external view returns (address operator); /** * @dev Returns if the `operator` is allowed to manage all of the assets of `owner`. * * See {setApprovalForAll} */ function isApprovedForAll(address owner, address operator) external view returns (bool); // ============================== // IERC721Metadata // ============================== /** * @dev Returns the token collection name. */ function name() external view returns (string memory); /** * @dev Returns the token collection symbol. */ function symbol() external view returns (string memory); /** * @dev Returns the Uniform Resource Identifier (URI) for `tokenId` token. */ function tokenURI(uint256 tokenId) external view returns (string memory); // ============================== // IERC2309 // ============================== /** * @dev Emitted when tokens in `fromTokenId` to `toTokenId` (inclusive) is transferred from `from` to `to`, * as defined in the ERC2309 standard. See `_mintERC2309` for more details. */ event ConsecutiveTransfer(uint256 indexed fromTokenId, uint256 toTokenId, address indexed from, address indexed to); }
// 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 // OpenZeppelin Contracts v4.4.1 (utils/Context.sol) pragma solidity ^0.8.0; /** * @dev Provides information about the current execution context, including the * sender of the transaction and its data. While these are generally available * via msg.sender and msg.data, they should not be accessed in such a direct * manner, since when dealing with meta-transactions the account sending and * paying for execution may not be the actual sender (as far as an application * is concerned). * * This contract is only required for intermediate, library-like contracts. */ abstract contract Context { function _msgSender() internal view virtual returns (address) { return msg.sender; } function _msgData() internal view virtual returns (bytes calldata) { return msg.data; } }
{ "optimizer": { "enabled": true, "runs": 200 }, "outputSelection": { "*": { "*": [ "evm.bytecode", "evm.deployedBytecode", "devdoc", "userdoc", "metadata", "abi" ] } } }
Contract Security Audit
- No Contract Security Audit Submitted- Submit Audit Here
[{"inputs":[],"stateMutability":"nonpayable","type":"constructor"},{"inputs":[],"name":"ApprovalCallerNotOwnerNorApproved","type":"error"},{"inputs":[],"name":"ApprovalQueryForNonexistentToken","type":"error"},{"inputs":[],"name":"ApproveToCaller","type":"error"},{"inputs":[],"name":"BalanceQueryForZeroAddress","type":"error"},{"inputs":[],"name":"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":true,"internalType":"address","name":"previousOwner","type":"address"},{"indexed":true,"internalType":"address","name":"newOwner","type":"address"}],"name":"OwnershipTransferred","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"from","type":"address"},{"indexed":true,"internalType":"address","name":"to","type":"address"},{"indexed":true,"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"Transfer","type":"event"},{"inputs":[{"internalType":"address[]","name":"addresses","type":"address[]"},{"internalType":"uint256[]","name":"numMints","type":"uint256[]"}],"name":"airdrop","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"allowlistMerkleRoot","outputs":[{"internalType":"bytes32","name":"","type":"bytes32"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"mintAmount","type":"uint256"},{"internalType":"bytes32[]","name":"_merkleProof","type":"bytes32[]"}],"name":"allowlistMint","outputs":[],"stateMutability":"payable","type":"function"},{"inputs":[{"internalType":"address","name":"to","type":"address"},{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"approve","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"owner","type":"address"}],"name":"balanceOf","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"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":"isPaused","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"","type":"address"}],"name":"mintClaimed","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"name","outputs":[{"internalType":"string","name":"","type":"string"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"owner","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"ownerOf","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"renounceOwnership","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"from","type":"address"},{"internalType":"address","name":"to","type":"address"},{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"safeTransferFrom","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"from","type":"address"},{"internalType":"address","name":"to","type":"address"},{"internalType":"uint256","name":"tokenId","type":"uint256"},{"internalType":"bytes","name":"_data","type":"bytes"}],"name":"safeTransferFrom","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"bytes32","name":"root","type":"bytes32"}],"name":"setAllowlistMerkleRoot","outputs":[],"stateMutability":"nonpayable","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":"baseURI","type":"string"}],"name":"setBaseURI","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"size","type":"uint256"}],"name":"setMaxSupply","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"bool","name":"paused","type":"bool"}],"name":"setPaused","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"newPrice","type":"uint256"}],"name":"setPrice","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"bool","name":"allowlistState","type":"bool"},{"internalType":"bool","name":"waitlistState","type":"bool"}],"name":"setSaleStates","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"bytes32","name":"root","type":"bytes32"}],"name":"setWaitlistMerkleRoot","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"bytes4","name":"interfaceId","type":"bytes4"}],"name":"supportsInterface","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"symbol","outputs":[{"internalType":"string","name":"","type":"string"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"tokenURI","outputs":[{"internalType":"string","name":"","type":"string"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"totalSupply","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"from","type":"address"},{"internalType":"address","name":"to","type":"address"},{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"transferFrom","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"newOwner","type":"address"}],"name":"transferOwnership","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"waitlistMerkleRoot","outputs":[{"internalType":"bytes32","name":"","type":"bytes32"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"mintAmount","type":"uint256"},{"internalType":"bytes32[]","name":"_merkleProof","type":"bytes32[]"}],"name":"waitlistMint","outputs":[],"stateMutability":"payable","type":"function"},{"inputs":[],"name":"withdrawMoney","outputs":[],"stateMutability":"nonpayable","type":"function"}]
Contract Creation Code
61012c600955668e1bc9bf040000600a55600b805461ffff1916905560a06040819052600060808190526200003791600c916200013d565b50600d805460ff191660011790553480156200005257600080fd5b5060405180604001604052806009815260200168115b98dc9e5c1d1e1160ba1b81525060405180604001604052806009815260200168115b98de5c9c1d1e1160ba1b815250620000b1620000ab620000e960201b60201c565b620000ed565b8151620000c69060039060208501906200013d565b508051620000dc9060049060208401906200013d565b5050600180555062000220565b3390565b600080546001600160a01b038381166001600160a01b0319831681178455604051919092169283917f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e09190a35050565b8280546200014b90620001e3565b90600052602060002090601f0160209004810192826200016f5760008555620001ba565b82601f106200018a57805160ff1916838001178555620001ba565b82800160010185558215620001ba579182015b82811115620001ba5782518255916020019190600101906200019d565b50620001c8929150620001cc565b5090565b5b80821115620001c85760008155600101620001cd565b600181811c90821680620001f857607f821691505b602082108114156200021a57634e487b7160e01b600052602260045260246000fd5b50919050565b61201e80620002306000396000f3fe6080604052600436106101e35760003560e01c80637bc9200e11610102578063ac44600211610095578063d15e2ee311610064578063d15e2ee31461055e578063e985e9c51461057e578063f2fde38b146105c7578063f95df414146105e757600080fd5b8063ac446002146104ef578063b187bd2614610504578063b88d4fde1461051e578063c87b56dd1461053e57600080fd5b806395d89b41116100d157806395d89b411461048457806399bf40da14610499578063a22cb465146104af578063a3f3b3b2146104cf57600080fd5b80637bc9200e146104205780638da5cb5b1461043357806391b7f5ed146104515780639592e8991461047157600080fd5b8063293108e01161017a578063672434821161014957806367243482146103ab5780636f8b44b0146103cb57806370a08231146103eb578063715018a61461040b57600080fd5b8063293108e01461033557806342842e0e1461034b57806355f804b31461036b5780636352211e1461038b57600080fd5b80631237e5e8116101b65780631237e5e81461029957806316c38b3c146102c957806318160ddd146102e957806323b872dd1461031557600080fd5b806301ffc9a7146101e857806306fdde031461021d578063081812fc1461023f578063095ea7b314610277575b600080fd5b3480156101f457600080fd5b50610208610203366004611c51565b610607565b60405190151581526020015b60405180910390f35b34801561022957600080fd5b50610232610659565b6040516102149190611e14565b34801561024b57600080fd5b5061025f61025a366004611c38565b6106eb565b6040516001600160a01b039091168152602001610214565b34801561028357600080fd5b50610297610292366004611b10565b61072f565b005b3480156102a557600080fd5b506102086102b436600461199c565b60106020526000908152604090205460ff1681565b3480156102d557600080fd5b506102976102e4366004611c01565b6107cf565b3480156102f557600080fd5b50610307600254600154036000190190565b604051908152602001610214565b34801561032157600080fd5b506102976103303660046119ea565b6107ea565b34801561034157600080fd5b50610307600e5481565b34801561035757600080fd5b506102976103663660046119ea565b61097b565b34801561037757600080fd5b50610297610386366004611c8b565b61099b565b34801561039757600080fd5b5061025f6103a6366004611c38565b6109af565b3480156103b757600080fd5b506102976103c6366004611b3a565b6109ba565b3480156103d757600080fd5b506102976103e6366004611c38565b610b20565b3480156103f757600080fd5b5061030761040636600461199c565b610b2d565b34801561041757600080fd5b50610297610b7c565b61029761042e366004611cfd565b610b90565b34801561043f57600080fd5b506000546001600160a01b031661025f565b34801561045d57600080fd5b5061029761046c366004611c38565b610e9b565b61029761047f366004611cfd565b610ea8565b34801561049057600080fd5b50610232611105565b3480156104a557600080fd5b50610307600f5481565b3480156104bb57600080fd5b506102976104ca366004611ae6565b611114565b3480156104db57600080fd5b506102976104ea366004611c38565b6111aa565b3480156104fb57600080fd5b506102976111b7565b34801561051057600080fd5b50600d546102089060ff1681565b34801561052a57600080fd5b50610297610539366004611a26565b61125a565b34801561054a57600080fd5b50610232610559366004611c38565b6112a4565b34801561056a57600080fd5b50610297610579366004611c1c565b611329565b34801561058a57600080fd5b506102086105993660046119b7565b6001600160a01b03918216600090815260086020908152604080832093909416825291909152205460ff1690565b3480156105d357600080fd5b506102976105e236600461199c565b611355565b3480156105f357600080fd5b50610297610602366004611c38565b6113cb565b60006301ffc9a760e01b6001600160e01b03198316148061063857506380ac58cd60e01b6001600160e01b03198316145b806106535750635b5e139f60e01b6001600160e01b03198316145b92915050565b60606003805461066890611f3a565b80601f016020809104026020016040519081016040528092919081815260200182805461069490611f3a565b80156106e15780601f106106b6576101008083540402835291602001916106e1565b820191906000526020600020905b8154815290600101906020018083116106c457829003601f168201915b5050505050905090565b60006106f6826113d8565b610713576040516333d1c03960e21b815260040160405180910390fd5b506000908152600760205260409020546001600160a01b031690565b600061073a826109af565b9050336001600160a01b03821614610773576107568133610599565b610773576040516367d9dca160e11b815260040160405180910390fd5b60008281526007602052604080822080546001600160a01b0319166001600160a01b0387811691821790925591518593918516917f8c5be1e5ebec7d5bd14f71427d1e84f3dd0314c0f7b2291e5b200ac8c7c3b92591a4505050565b6107d761140d565b600d805460ff1916911515919091179055565b60006107f582611467565b9050836001600160a01b0316816001600160a01b0316146108285760405162a1148160e81b815260040160405180910390fd5b60008281526007602052604090208054338082146001600160a01b03881690911417610875576108588633610599565b61087557604051632ce44b5f60e11b815260040160405180910390fd5b6001600160a01b03851661089c57604051633a954ecd60e21b815260040160405180910390fd5b80156108a757600082555b6001600160a01b038681166000908152600660205260408082208054600019019055918716808252919020805460010190554260a01b17600160e11b17600085815260056020526040902055600160e11b831661093257600184016000818152600560205260409020546109305760015481146109305760008181526005602052604090208490555b505b83856001600160a01b0316876001600160a01b03167fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef60405160405180910390a4505050505050565b6109968383836040518060200160405280600081525061125a565b505050565b6109a361140d565b610996600c8383611865565b600061065382611467565b6109c261140d565b8051825114610a0c5760405162461bcd60e51b8152602060048201526011602482015270082e4e4c2f2e640c8dedce840dac2e8c6d607b1b60448201526064015b60405180910390fd5b60005b825181101561099657600954610a26906001611ed7565b828281518110610a3857610a38611fa6565b6020026020010151610a51600254600154036000190190565b610a5b9190611ed7565b10610a785760405162461bcd60e51b8152600401610a0390611e27565b6000828281518110610a8c57610a8c611fa6565b602002602001015111610ad25760405162461bcd60e51b815260206004820152600e60248201526d43616e6e6f74206d696e7420302160901b6044820152606401610a03565b610b0e838281518110610ae757610ae7611fa6565b6020026020010151838381518110610b0157610b01611fa6565b60200260200101516114d0565b80610b1881611f75565b915050610a0f565b610b2861140d565b600955565b60006001600160a01b038216610b56576040516323d3ad8160e21b815260040160405180910390fd5b506001600160a01b031660009081526006602052604090205467ffffffffffffffff1690565b610b8461140d565b610b8e60006114ee565b565b323314610bdf5760405162461bcd60e51b815260206004820152601e60248201527f5468652063616c6c657220697320616e6f7468657220636f6e747261637400006044820152606401610a03565b600b5460ff16610c285760405162461bcd60e51b8152602060048201526014602482015273416c6c6f776c69737420697320636c6f7365642160601b6044820152606401610a03565b8260008111610c495760405162461bcd60e51b8152600401610a0390611e53565b80600a54610c579190611eef565b341015610ca25760405162461bcd60e51b8152602060048201526019602482015278496e636f7272656374207061796d656e7420616d6f756e742160381b6044820152606401610a03565b600954610cb0906001611ed7565b81610cc2600254600154036000190190565b610ccc9190611ed7565b10610ce95760405162461bcd60e51b8152600401610a0390611e27565b600d5460ff1615610d2a5760405162461bcd60e51b815260206004820152600b60248201526a135a5b9d081c185d5cd95960aa1b6044820152606401610a03565b6040516bffffffffffffffffffffffff193360601b166020820152600090603401604051602081830303815290604052805190602001209050610da484848080602002602001604051908101604052809392919081815260200183836020028082843760009201919091525050600e54915084905061153e565b610df05760405162461bcd60e51b815260206004820152601760248201527f50726f6f66206e6f74206f6e20616c6c6f776c697374210000000000000000006044820152606401610a03565b84600114610e105760405162461bcd60e51b8152600401610a0390611e53565b3360009081526010602052604090205460ff1615610e705760405162461bcd60e51b815260206004820152601860248201527f45786365656473206d6178206d696e7420616d6f756e742100000000000000006044820152606401610a03565b336000818152601060205260409020805460ff19166001179055610e9490866114d0565b5050505050565b610ea361140d565b600a55565b323314610ef75760405162461bcd60e51b815260206004820152601e60248201527f5468652063616c6c657220697320616e6f7468657220636f6e747261637400006044820152606401610a03565b600b54610100900460ff16610f445760405162461bcd60e51b8152602060048201526013602482015272576169746c69737420697320636c6f7365642160681b6044820152606401610a03565b8260008111610f655760405162461bcd60e51b8152600401610a0390611e53565b80600a54610f739190611eef565b341015610fbe5760405162461bcd60e51b8152602060048201526019602482015278496e636f7272656374207061796d656e7420616d6f756e742160381b6044820152606401610a03565b600954610fcc906001611ed7565b81610fde600254600154036000190190565b610fe89190611ed7565b106110055760405162461bcd60e51b8152600401610a0390611e27565b600d5460ff16156110465760405162461bcd60e51b815260206004820152600b60248201526a135a5b9d081c185d5cd95960aa1b6044820152606401610a03565b6040516bffffffffffffffffffffffff193360601b1660208201526000906034016040516020818303038152906040528051906020012090506110c084848080602002602001604051908101604052809392919081815260200183836020028082843760009201919091525050600f54915084905061153e565b610df05760405162461bcd60e51b815260206004820152601660248201527550726f6f66206e6f74206f6e20776169746c6973742160501b6044820152606401610a03565b60606004805461066890611f3a565b6001600160a01b03821633141561113e5760405163b06307db60e01b815260040160405180910390fd5b3360008181526008602090815260408083206001600160a01b03871680855290835292819020805460ff191686151590811790915590519081529192917f17307eab39ab6107e8899845ad3d59bd9653f200f220920489ca2b5937696c31910160405180910390a35050565b6111b261140d565b600f55565b6111bf61140d565b600047116111cc57600080fd5b604051600090339047908381818185875af1925050503d806000811461120e576040519150601f19603f3d011682016040523d82523d6000602084013e611213565b606091505b50509050806112575760405162461bcd60e51b815260206004820152601060248201526f2a3930b739b332b9103330b4b632b21760811b6044820152606401610a03565b50565b6112658484846107ea565b6001600160a01b0383163b1561129e5761128184848484611554565b61129e576040516368d2bf6b60e11b815260040160405180910390fd5b50505050565b60606112af826113d8565b6112cc57604051630a14c4b560e41b815260040160405180910390fd5b60006112d661164b565b90508051600014156112f75760405180602001604052806000815250611322565b806113018461165a565b604051602001611312929190611da8565b6040516020818303038152906040525b9392505050565b61133161140d565b600b805461ffff191692151561ff0019169290921761010091151591909102179055565b61135d61140d565b6001600160a01b0381166113c25760405162461bcd60e51b815260206004820152602660248201527f4f776e61626c653a206e6577206f776e657220697320746865207a65726f206160448201526564647265737360d01b6064820152608401610a03565b611257816114ee565b6113d361140d565b600e55565b6000816001111580156113ec575060015482105b8015610653575050600090815260056020526040902054600160e01b161590565b6000546001600160a01b03163314610b8e5760405162461bcd60e51b815260206004820181905260248201527f4f776e61626c653a2063616c6c6572206973206e6f7420746865206f776e65726044820152606401610a03565b600081806001116114b7576001548110156114b757600081815260056020526040902054600160e01b81166114b5575b80611322575060001901600081815260056020526040902054611497565b505b604051636f96cda160e11b815260040160405180910390fd5b6114ea8282604051806020016040528060008152506116a9565b5050565b600080546001600160a01b038381166001600160a01b0319831681178455604051919092169283917f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e09190a35050565b60008261154b858461170f565b14949350505050565b604051630a85bd0160e11b81526000906001600160a01b0385169063150b7a0290611589903390899088908890600401611dd7565b602060405180830381600087803b1580156115a357600080fd5b505af19250505080156115d3575060408051601f3d908101601f191682019092526115d091810190611c6e565b60015b61162e573d808015611601576040519150601f19603f3d011682016040523d82523d6000602084013e611606565b606091505b508051611626576040516368d2bf6b60e11b815260040160405180910390fd5b805181602001fd5b6001600160e01b031916630a85bd0160e11b149050949350505050565b6060600c805461066890611f3a565b604080516080810191829052607f0190826030600a8206018353600a90045b801561169757600183039250600a81066030018353600a9004611679565b50819003601f19909101908152919050565b6116b3838361175c565b6001600160a01b0383163b15610996576001548281035b6116dd6000868380600101945086611554565b6116fa576040516368d2bf6b60e11b815260040160405180910390fd5b8181106116ca578160015414610e9457600080fd5b600081815b8451811015611754576117408286838151811061173357611733611fa6565b6020026020010151611839565b91508061174c81611f75565b915050611714565b509392505050565b6001546001600160a01b03831661178557604051622e076360e81b815260040160405180910390fd5b816117a35760405163b562e8dd60e01b815260040160405180910390fd5b6001600160a01b038316600081815260066020526040902080546801000000000000000185020190554260a01b6001841460e11b1717600082815260056020526040902055808281015b6040516001830192906001600160a01b038716906000907fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef908290a48082106117ed5760015550505050565b6000818310611855576000828152602084905260409020611322565b5060009182526020526040902090565b82805461187190611f3a565b90600052602060002090601f01602090048101928261189357600085556118d9565b82601f106118ac5782800160ff198235161785556118d9565b828001600101855582156118d9579182015b828111156118d95782358255916020019190600101906118be565b506118e59291506118e9565b5090565b5b808211156118e557600081556001016118ea565b80356001600160a01b038116811461191557600080fd5b919050565b600082601f83011261192b57600080fd5b8135602061194061193b83611eb3565b611e82565b80838252828201915082860187848660051b890101111561196057600080fd5b60005b8581101561197f57813584529284019290840190600101611963565b5090979650505050505050565b8035801515811461191557600080fd5b6000602082840312156119ae57600080fd5b611322826118fe565b600080604083850312156119ca57600080fd5b6119d3836118fe565b91506119e1602084016118fe565b90509250929050565b6000806000606084860312156119ff57600080fd5b611a08846118fe565b9250611a16602085016118fe565b9150604084013590509250925092565b60008060008060808587031215611a3c57600080fd5b611a45856118fe565b93506020611a548187016118fe565b935060408601359250606086013567ffffffffffffffff80821115611a7857600080fd5b818801915088601f830112611a8c57600080fd5b813581811115611a9e57611a9e611fbc565b611ab0601f8201601f19168501611e82565b91508082528984828501011115611ac657600080fd5b808484018584013760008482840101525080935050505092959194509250565b60008060408385031215611af957600080fd5b611b02836118fe565b91506119e16020840161198c565b60008060408385031215611b2357600080fd5b611b2c836118fe565b946020939093013593505050565b60008060408385031215611b4d57600080fd5b823567ffffffffffffffff80821115611b6557600080fd5b818501915085601f830112611b7957600080fd5b81356020611b8961193b83611eb3565b8083825282820191508286018a848660051b8901011115611ba957600080fd5b600096505b84871015611bd357611bbf816118fe565b835260019690960195918301918301611bae565b5096505086013592505080821115611bea57600080fd5b50611bf78582860161191a565b9150509250929050565b600060208284031215611c1357600080fd5b6113228261198c565b60008060408385031215611c2f57600080fd5b611b028361198c565b600060208284031215611c4a57600080fd5b5035919050565b600060208284031215611c6357600080fd5b813561132281611fd2565b600060208284031215611c8057600080fd5b815161132281611fd2565b60008060208385031215611c9e57600080fd5b823567ffffffffffffffff80821115611cb657600080fd5b818501915085601f830112611cca57600080fd5b813581811115611cd957600080fd5b866020828501011115611ceb57600080fd5b60209290920196919550909350505050565b600080600060408486031215611d1257600080fd5b83359250602084013567ffffffffffffffff80821115611d3157600080fd5b818601915086601f830112611d4557600080fd5b813581811115611d5457600080fd5b8760208260051b8501011115611d6957600080fd5b6020830194508093505050509250925092565b60008151808452611d94816020860160208601611f0e565b601f01601f19169290920160200192915050565b60008351611dba818460208801611f0e565b835190830190611dce818360208801611f0e565b01949350505050565b6001600160a01b0385811682528416602082015260408101839052608060608201819052600090611e0a90830184611d7c565b9695505050505050565b6020815260006113226020830184611d7c565b60208082526012908201527152656163686564206d617820737570706c7960701b604082015260600190565b602080825260159082015274135a5b9d08105b5bdd5b9d08125b98dbdc9c9958dd605a1b604082015260600190565b604051601f8201601f1916810167ffffffffffffffff81118282101715611eab57611eab611fbc565b604052919050565b600067ffffffffffffffff821115611ecd57611ecd611fbc565b5060051b60200190565b60008219821115611eea57611eea611f90565b500190565b6000816000190483118215151615611f0957611f09611f90565b500290565b60005b83811015611f29578181015183820152602001611f11565b8381111561129e5750506000910152565b600181811c90821680611f4e57607f821691505b60208210811415611f6f57634e487b7160e01b600052602260045260246000fd5b50919050565b6000600019821415611f8957611f89611f90565b5060010190565b634e487b7160e01b600052601160045260246000fd5b634e487b7160e01b600052603260045260246000fd5b634e487b7160e01b600052604160045260246000fd5b6001600160e01b03198116811461125757600080fdfea2646970667358221220a2cd1824576bd11f65c565309c753540f85c5cb650110087bed8a2b71ec22ddc64736f6c63430008070033
Deployed Bytecode
0x6080604052600436106101e35760003560e01c80637bc9200e11610102578063ac44600211610095578063d15e2ee311610064578063d15e2ee31461055e578063e985e9c51461057e578063f2fde38b146105c7578063f95df414146105e757600080fd5b8063ac446002146104ef578063b187bd2614610504578063b88d4fde1461051e578063c87b56dd1461053e57600080fd5b806395d89b41116100d157806395d89b411461048457806399bf40da14610499578063a22cb465146104af578063a3f3b3b2146104cf57600080fd5b80637bc9200e146104205780638da5cb5b1461043357806391b7f5ed146104515780639592e8991461047157600080fd5b8063293108e01161017a578063672434821161014957806367243482146103ab5780636f8b44b0146103cb57806370a08231146103eb578063715018a61461040b57600080fd5b8063293108e01461033557806342842e0e1461034b57806355f804b31461036b5780636352211e1461038b57600080fd5b80631237e5e8116101b65780631237e5e81461029957806316c38b3c146102c957806318160ddd146102e957806323b872dd1461031557600080fd5b806301ffc9a7146101e857806306fdde031461021d578063081812fc1461023f578063095ea7b314610277575b600080fd5b3480156101f457600080fd5b50610208610203366004611c51565b610607565b60405190151581526020015b60405180910390f35b34801561022957600080fd5b50610232610659565b6040516102149190611e14565b34801561024b57600080fd5b5061025f61025a366004611c38565b6106eb565b6040516001600160a01b039091168152602001610214565b34801561028357600080fd5b50610297610292366004611b10565b61072f565b005b3480156102a557600080fd5b506102086102b436600461199c565b60106020526000908152604090205460ff1681565b3480156102d557600080fd5b506102976102e4366004611c01565b6107cf565b3480156102f557600080fd5b50610307600254600154036000190190565b604051908152602001610214565b34801561032157600080fd5b506102976103303660046119ea565b6107ea565b34801561034157600080fd5b50610307600e5481565b34801561035757600080fd5b506102976103663660046119ea565b61097b565b34801561037757600080fd5b50610297610386366004611c8b565b61099b565b34801561039757600080fd5b5061025f6103a6366004611c38565b6109af565b3480156103b757600080fd5b506102976103c6366004611b3a565b6109ba565b3480156103d757600080fd5b506102976103e6366004611c38565b610b20565b3480156103f757600080fd5b5061030761040636600461199c565b610b2d565b34801561041757600080fd5b50610297610b7c565b61029761042e366004611cfd565b610b90565b34801561043f57600080fd5b506000546001600160a01b031661025f565b34801561045d57600080fd5b5061029761046c366004611c38565b610e9b565b61029761047f366004611cfd565b610ea8565b34801561049057600080fd5b50610232611105565b3480156104a557600080fd5b50610307600f5481565b3480156104bb57600080fd5b506102976104ca366004611ae6565b611114565b3480156104db57600080fd5b506102976104ea366004611c38565b6111aa565b3480156104fb57600080fd5b506102976111b7565b34801561051057600080fd5b50600d546102089060ff1681565b34801561052a57600080fd5b50610297610539366004611a26565b61125a565b34801561054a57600080fd5b50610232610559366004611c38565b6112a4565b34801561056a57600080fd5b50610297610579366004611c1c565b611329565b34801561058a57600080fd5b506102086105993660046119b7565b6001600160a01b03918216600090815260086020908152604080832093909416825291909152205460ff1690565b3480156105d357600080fd5b506102976105e236600461199c565b611355565b3480156105f357600080fd5b50610297610602366004611c38565b6113cb565b60006301ffc9a760e01b6001600160e01b03198316148061063857506380ac58cd60e01b6001600160e01b03198316145b806106535750635b5e139f60e01b6001600160e01b03198316145b92915050565b60606003805461066890611f3a565b80601f016020809104026020016040519081016040528092919081815260200182805461069490611f3a565b80156106e15780601f106106b6576101008083540402835291602001916106e1565b820191906000526020600020905b8154815290600101906020018083116106c457829003601f168201915b5050505050905090565b60006106f6826113d8565b610713576040516333d1c03960e21b815260040160405180910390fd5b506000908152600760205260409020546001600160a01b031690565b600061073a826109af565b9050336001600160a01b03821614610773576107568133610599565b610773576040516367d9dca160e11b815260040160405180910390fd5b60008281526007602052604080822080546001600160a01b0319166001600160a01b0387811691821790925591518593918516917f8c5be1e5ebec7d5bd14f71427d1e84f3dd0314c0f7b2291e5b200ac8c7c3b92591a4505050565b6107d761140d565b600d805460ff1916911515919091179055565b60006107f582611467565b9050836001600160a01b0316816001600160a01b0316146108285760405162a1148160e81b815260040160405180910390fd5b60008281526007602052604090208054338082146001600160a01b03881690911417610875576108588633610599565b61087557604051632ce44b5f60e11b815260040160405180910390fd5b6001600160a01b03851661089c57604051633a954ecd60e21b815260040160405180910390fd5b80156108a757600082555b6001600160a01b038681166000908152600660205260408082208054600019019055918716808252919020805460010190554260a01b17600160e11b17600085815260056020526040902055600160e11b831661093257600184016000818152600560205260409020546109305760015481146109305760008181526005602052604090208490555b505b83856001600160a01b0316876001600160a01b03167fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef60405160405180910390a4505050505050565b6109968383836040518060200160405280600081525061125a565b505050565b6109a361140d565b610996600c8383611865565b600061065382611467565b6109c261140d565b8051825114610a0c5760405162461bcd60e51b8152602060048201526011602482015270082e4e4c2f2e640c8dedce840dac2e8c6d607b1b60448201526064015b60405180910390fd5b60005b825181101561099657600954610a26906001611ed7565b828281518110610a3857610a38611fa6565b6020026020010151610a51600254600154036000190190565b610a5b9190611ed7565b10610a785760405162461bcd60e51b8152600401610a0390611e27565b6000828281518110610a8c57610a8c611fa6565b602002602001015111610ad25760405162461bcd60e51b815260206004820152600e60248201526d43616e6e6f74206d696e7420302160901b6044820152606401610a03565b610b0e838281518110610ae757610ae7611fa6565b6020026020010151838381518110610b0157610b01611fa6565b60200260200101516114d0565b80610b1881611f75565b915050610a0f565b610b2861140d565b600955565b60006001600160a01b038216610b56576040516323d3ad8160e21b815260040160405180910390fd5b506001600160a01b031660009081526006602052604090205467ffffffffffffffff1690565b610b8461140d565b610b8e60006114ee565b565b323314610bdf5760405162461bcd60e51b815260206004820152601e60248201527f5468652063616c6c657220697320616e6f7468657220636f6e747261637400006044820152606401610a03565b600b5460ff16610c285760405162461bcd60e51b8152602060048201526014602482015273416c6c6f776c69737420697320636c6f7365642160601b6044820152606401610a03565b8260008111610c495760405162461bcd60e51b8152600401610a0390611e53565b80600a54610c579190611eef565b341015610ca25760405162461bcd60e51b8152602060048201526019602482015278496e636f7272656374207061796d656e7420616d6f756e742160381b6044820152606401610a03565b600954610cb0906001611ed7565b81610cc2600254600154036000190190565b610ccc9190611ed7565b10610ce95760405162461bcd60e51b8152600401610a0390611e27565b600d5460ff1615610d2a5760405162461bcd60e51b815260206004820152600b60248201526a135a5b9d081c185d5cd95960aa1b6044820152606401610a03565b6040516bffffffffffffffffffffffff193360601b166020820152600090603401604051602081830303815290604052805190602001209050610da484848080602002602001604051908101604052809392919081815260200183836020028082843760009201919091525050600e54915084905061153e565b610df05760405162461bcd60e51b815260206004820152601760248201527f50726f6f66206e6f74206f6e20616c6c6f776c697374210000000000000000006044820152606401610a03565b84600114610e105760405162461bcd60e51b8152600401610a0390611e53565b3360009081526010602052604090205460ff1615610e705760405162461bcd60e51b815260206004820152601860248201527f45786365656473206d6178206d696e7420616d6f756e742100000000000000006044820152606401610a03565b336000818152601060205260409020805460ff19166001179055610e9490866114d0565b5050505050565b610ea361140d565b600a55565b323314610ef75760405162461bcd60e51b815260206004820152601e60248201527f5468652063616c6c657220697320616e6f7468657220636f6e747261637400006044820152606401610a03565b600b54610100900460ff16610f445760405162461bcd60e51b8152602060048201526013602482015272576169746c69737420697320636c6f7365642160681b6044820152606401610a03565b8260008111610f655760405162461bcd60e51b8152600401610a0390611e53565b80600a54610f739190611eef565b341015610fbe5760405162461bcd60e51b8152602060048201526019602482015278496e636f7272656374207061796d656e7420616d6f756e742160381b6044820152606401610a03565b600954610fcc906001611ed7565b81610fde600254600154036000190190565b610fe89190611ed7565b106110055760405162461bcd60e51b8152600401610a0390611e27565b600d5460ff16156110465760405162461bcd60e51b815260206004820152600b60248201526a135a5b9d081c185d5cd95960aa1b6044820152606401610a03565b6040516bffffffffffffffffffffffff193360601b1660208201526000906034016040516020818303038152906040528051906020012090506110c084848080602002602001604051908101604052809392919081815260200183836020028082843760009201919091525050600f54915084905061153e565b610df05760405162461bcd60e51b815260206004820152601660248201527550726f6f66206e6f74206f6e20776169746c6973742160501b6044820152606401610a03565b60606004805461066890611f3a565b6001600160a01b03821633141561113e5760405163b06307db60e01b815260040160405180910390fd5b3360008181526008602090815260408083206001600160a01b03871680855290835292819020805460ff191686151590811790915590519081529192917f17307eab39ab6107e8899845ad3d59bd9653f200f220920489ca2b5937696c31910160405180910390a35050565b6111b261140d565b600f55565b6111bf61140d565b600047116111cc57600080fd5b604051600090339047908381818185875af1925050503d806000811461120e576040519150601f19603f3d011682016040523d82523d6000602084013e611213565b606091505b50509050806112575760405162461bcd60e51b815260206004820152601060248201526f2a3930b739b332b9103330b4b632b21760811b6044820152606401610a03565b50565b6112658484846107ea565b6001600160a01b0383163b1561129e5761128184848484611554565b61129e576040516368d2bf6b60e11b815260040160405180910390fd5b50505050565b60606112af826113d8565b6112cc57604051630a14c4b560e41b815260040160405180910390fd5b60006112d661164b565b90508051600014156112f75760405180602001604052806000815250611322565b806113018461165a565b604051602001611312929190611da8565b6040516020818303038152906040525b9392505050565b61133161140d565b600b805461ffff191692151561ff0019169290921761010091151591909102179055565b61135d61140d565b6001600160a01b0381166113c25760405162461bcd60e51b815260206004820152602660248201527f4f776e61626c653a206e6577206f776e657220697320746865207a65726f206160448201526564647265737360d01b6064820152608401610a03565b611257816114ee565b6113d361140d565b600e55565b6000816001111580156113ec575060015482105b8015610653575050600090815260056020526040902054600160e01b161590565b6000546001600160a01b03163314610b8e5760405162461bcd60e51b815260206004820181905260248201527f4f776e61626c653a2063616c6c6572206973206e6f7420746865206f776e65726044820152606401610a03565b600081806001116114b7576001548110156114b757600081815260056020526040902054600160e01b81166114b5575b80611322575060001901600081815260056020526040902054611497565b505b604051636f96cda160e11b815260040160405180910390fd5b6114ea8282604051806020016040528060008152506116a9565b5050565b600080546001600160a01b038381166001600160a01b0319831681178455604051919092169283917f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e09190a35050565b60008261154b858461170f565b14949350505050565b604051630a85bd0160e11b81526000906001600160a01b0385169063150b7a0290611589903390899088908890600401611dd7565b602060405180830381600087803b1580156115a357600080fd5b505af19250505080156115d3575060408051601f3d908101601f191682019092526115d091810190611c6e565b60015b61162e573d808015611601576040519150601f19603f3d011682016040523d82523d6000602084013e611606565b606091505b508051611626576040516368d2bf6b60e11b815260040160405180910390fd5b805181602001fd5b6001600160e01b031916630a85bd0160e11b149050949350505050565b6060600c805461066890611f3a565b604080516080810191829052607f0190826030600a8206018353600a90045b801561169757600183039250600a81066030018353600a9004611679565b50819003601f19909101908152919050565b6116b3838361175c565b6001600160a01b0383163b15610996576001548281035b6116dd6000868380600101945086611554565b6116fa576040516368d2bf6b60e11b815260040160405180910390fd5b8181106116ca578160015414610e9457600080fd5b600081815b8451811015611754576117408286838151811061173357611733611fa6565b6020026020010151611839565b91508061174c81611f75565b915050611714565b509392505050565b6001546001600160a01b03831661178557604051622e076360e81b815260040160405180910390fd5b816117a35760405163b562e8dd60e01b815260040160405180910390fd5b6001600160a01b038316600081815260066020526040902080546801000000000000000185020190554260a01b6001841460e11b1717600082815260056020526040902055808281015b6040516001830192906001600160a01b038716906000907fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef908290a48082106117ed5760015550505050565b6000818310611855576000828152602084905260409020611322565b5060009182526020526040902090565b82805461187190611f3a565b90600052602060002090601f01602090048101928261189357600085556118d9565b82601f106118ac5782800160ff198235161785556118d9565b828001600101855582156118d9579182015b828111156118d95782358255916020019190600101906118be565b506118e59291506118e9565b5090565b5b808211156118e557600081556001016118ea565b80356001600160a01b038116811461191557600080fd5b919050565b600082601f83011261192b57600080fd5b8135602061194061193b83611eb3565b611e82565b80838252828201915082860187848660051b890101111561196057600080fd5b60005b8581101561197f57813584529284019290840190600101611963565b5090979650505050505050565b8035801515811461191557600080fd5b6000602082840312156119ae57600080fd5b611322826118fe565b600080604083850312156119ca57600080fd5b6119d3836118fe565b91506119e1602084016118fe565b90509250929050565b6000806000606084860312156119ff57600080fd5b611a08846118fe565b9250611a16602085016118fe565b9150604084013590509250925092565b60008060008060808587031215611a3c57600080fd5b611a45856118fe565b93506020611a548187016118fe565b935060408601359250606086013567ffffffffffffffff80821115611a7857600080fd5b818801915088601f830112611a8c57600080fd5b813581811115611a9e57611a9e611fbc565b611ab0601f8201601f19168501611e82565b91508082528984828501011115611ac657600080fd5b808484018584013760008482840101525080935050505092959194509250565b60008060408385031215611af957600080fd5b611b02836118fe565b91506119e16020840161198c565b60008060408385031215611b2357600080fd5b611b2c836118fe565b946020939093013593505050565b60008060408385031215611b4d57600080fd5b823567ffffffffffffffff80821115611b6557600080fd5b818501915085601f830112611b7957600080fd5b81356020611b8961193b83611eb3565b8083825282820191508286018a848660051b8901011115611ba957600080fd5b600096505b84871015611bd357611bbf816118fe565b835260019690960195918301918301611bae565b5096505086013592505080821115611bea57600080fd5b50611bf78582860161191a565b9150509250929050565b600060208284031215611c1357600080fd5b6113228261198c565b60008060408385031215611c2f57600080fd5b611b028361198c565b600060208284031215611c4a57600080fd5b5035919050565b600060208284031215611c6357600080fd5b813561132281611fd2565b600060208284031215611c8057600080fd5b815161132281611fd2565b60008060208385031215611c9e57600080fd5b823567ffffffffffffffff80821115611cb657600080fd5b818501915085601f830112611cca57600080fd5b813581811115611cd957600080fd5b866020828501011115611ceb57600080fd5b60209290920196919550909350505050565b600080600060408486031215611d1257600080fd5b83359250602084013567ffffffffffffffff80821115611d3157600080fd5b818601915086601f830112611d4557600080fd5b813581811115611d5457600080fd5b8760208260051b8501011115611d6957600080fd5b6020830194508093505050509250925092565b60008151808452611d94816020860160208601611f0e565b601f01601f19169290920160200192915050565b60008351611dba818460208801611f0e565b835190830190611dce818360208801611f0e565b01949350505050565b6001600160a01b0385811682528416602082015260408101839052608060608201819052600090611e0a90830184611d7c565b9695505050505050565b6020815260006113226020830184611d7c565b60208082526012908201527152656163686564206d617820737570706c7960701b604082015260600190565b602080825260159082015274135a5b9d08105b5bdd5b9d08125b98dbdc9c9958dd605a1b604082015260600190565b604051601f8201601f1916810167ffffffffffffffff81118282101715611eab57611eab611fbc565b604052919050565b600067ffffffffffffffff821115611ecd57611ecd611fbc565b5060051b60200190565b60008219821115611eea57611eea611f90565b500190565b6000816000190483118215151615611f0957611f09611f90565b500290565b60005b83811015611f29578181015183820152602001611f11565b8381111561129e5750506000910152565b600181811c90821680611f4e57607f821691505b60208210811415611f6f57634e487b7160e01b600052602260045260246000fd5b50919050565b6000600019821415611f8957611f89611f90565b5060010190565b634e487b7160e01b600052601160045260246000fd5b634e487b7160e01b600052603260045260246000fd5b634e487b7160e01b600052604160045260246000fd5b6001600160e01b03198116811461125757600080fdfea2646970667358221220a2cd1824576bd11f65c565309c753540f85c5cb650110087bed8a2b71ec22ddc64736f6c63430008070033
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.