File size: 99,477 Bytes
f998fcd |
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 |
{
"language": "Solidity",
"sources": {
"/var/app/current/contracts/IndelibleERC721A.sol": {
"content": "\n // SPDX-License-Identifier: MIT\n pragma solidity ^0.8.4;\n\n import \"erc721a/contracts/ERC721A.sol\";\n import \"@openzeppelin/contracts/security/ReentrancyGuard.sol\";\n import \"@openzeppelin/contracts/access/Ownable.sol\";\n import \"@openzeppelin/contracts/utils/Base64.sol\";\n import \"@openzeppelin/contracts/utils/cryptography/MerkleProof.sol\";\n import \"@openzeppelin/contracts/utils/Address.sol\";\n import \"./SSTORE2.sol\";\n import \"./DynamicBuffer.sol\";\n import \"./HelperLib.sol\";\n\n contract IndelibleERC721A is ERC721A, ReentrancyGuard, Ownable {\n using HelperLib for uint256;\n using DynamicBuffer for bytes;\n\n struct TraitDTO {\n string name;\n string mimetype;\n bytes data;\n }\n \n struct Trait {\n string name;\n string mimetype;\n }\n\n struct ContractData {\n string name;\n string description;\n string image;\n string banner;\n string website;\n uint256 royalties;\n string royaltiesRecipient;\n }\n\n mapping(uint256 => address[]) internal _traitDataPointers;\n mapping(uint256 => mapping(uint256 => Trait)) internal _traitDetails;\n mapping(uint256 => bool) internal _renderTokenOffChain;\n\n uint256 private constant DEVELOPER_FEE = 250; // of 10,000 = 2.5%\n uint256 private constant NUM_LAYERS = 10;\n uint256 private constant MAX_BATCH_MINT = 20;\n uint256[][NUM_LAYERS] private TIERS;\n string[] private LAYER_NAMES = [unicode\"Head\", unicode\"Ears\", unicode\"Eyes\", unicode\"Hair\", unicode\"Face\", unicode\"Mouth\", unicode\"Neck\", unicode\"Body\", unicode\"Jacket\", unicode\"Background\"];\n bool private shouldWrapSVG = true;\n string private backgroundColor = \"transparent\";\n\n bool public isContractSealed;\n uint256 public constant maxSupply = 10000;\n uint256 public maxPerAddress = 5;\n uint256 public publicMintPrice = 0.006 ether;\n string public baseURI = \"\";\n bool public isPublicMintActive;\n \n bytes32 private merkleRoot;\n uint256 public allowListPrice = 0.003 ether;\n uint256 public maxPerAllowList = 1;\n bool public isAllowListActive;\n \n ContractData public contractData = ContractData(unicode\"Aliens vs Punks\", unicode\"On-chain CC0 lore driven collection about the fight against the end of the world.\", \"https://indeliblelabs-prod.s3.us-east-2.amazonaws.com/profile/c0837a26-451a-4c65-a5b6-57d32d207d15\", \"https://indeliblelabs-prod.s3.us-east-2.amazonaws.com/banner/c0837a26-451a-4c65-a5b6-57d32d207d15\", \"https://www.aliensvspunks.xyz\", 500, \"0x96790b276759a0b779DA852F3235d682B44316B5\");\n\n constructor() ERC721A(unicode\"Aliens vs Punks\", unicode\"ALVSPKS\") {\n TIERS[0] = [53,129,182,205,210,213,215,242,244,252,262,263,280,280,301,6669];\nTIERS[1] = [101,139,150,155,168,181,201,311,385,470,499,582,6658];\nTIERS[2] = [115,127,130,148,153,157,159,160,167,167,171,180,188,191,193,221,223,224,228,243,254,332,337,346,358,379,424,566,635,671,683,708,762];\nTIERS[3] = [31,31,41,41,43,46,47,50,52,53,53,54,54,55,62,63,65,66,67,70,71,72,72,72,72,73,73,74,74,77,79,81,82,84,84,85,90,98,98,98,99,100,102,102,107,107,107,107,108,108,109,109,110,110,111,111,112,115,120,120,121,124,124,127,128,130,132,133,134,136,137,139,141,142,143,143,144,146,147,147,149,149,152,152,154,155,156,157,157,157,161,162,164,430];\nTIERS[4] = [194,527,628,1012,7639];\nTIERS[5] = [160,177,181,258,262,285,313,323,357,373,415,560,619,672,753,892,3400];\nTIERS[6] = [354,579,718,883,886,968,974,4638];\nTIERS[7] = [223,224,226,278,430,434,442,449,471,481,486,494,496,503,515,520,528,528,553,561,562,596];\nTIERS[8] = [185,510,512,599,621,683,745,765,765,771,3844];\nTIERS[9] = [679,1005,1594,1661,1667,1685,1709];\n }\n\n modifier whenMintActive() {\n require(isMintActive(), \"Minting is not active\");\n _;\n }\n\n modifier whenUnsealed() {\n require(!isContractSealed, \"Contract is sealed\");\n _;\n }\n\n function rarityGen(uint256 _randinput, uint256 _rarityTier)\n internal\n view\n returns (uint256)\n {\n uint256 currentLowerBound = 0;\n for (uint256 i = 0; i < TIERS[_rarityTier].length; i++) {\n uint256 thisPercentage = TIERS[_rarityTier][i];\n if (\n _randinput >= currentLowerBound &&\n _randinput < currentLowerBound + thisPercentage\n ) return i;\n currentLowerBound = currentLowerBound + thisPercentage;\n }\n\n revert();\n }\n \n function entropyForExtraData() internal view returns (uint24) {\n uint256 randomNumber = uint256(\n keccak256(\n abi.encodePacked(\n tx.gasprice,\n block.number,\n block.timestamp,\n block.difficulty,\n blockhash(block.number - 1),\n msg.sender\n )\n )\n );\n return uint24(randomNumber);\n }\n \n function stringCompare(string memory a, string memory b) internal pure returns (bool) {\n return keccak256(abi.encodePacked(a)) == keccak256(abi.encodePacked(b));\n }\n\n function tokensAreDuplicates(uint tokenIdA, uint tokenIdB) public view returns (bool) {\n return stringCompare(\n tokenIdToHash(tokenIdA),\n tokenIdToHash(tokenIdB)\n );\n }\n \n function reRollDuplicate(\n uint tokenIdA,\n uint tokenIdB\n ) public whenUnsealed {\n require(tokensAreDuplicates(tokenIdA, tokenIdB), \"All tokens must be duplicates\");\n\n uint largerTokenId = tokenIdA > tokenIdB ? tokenIdA : tokenIdB;\n\n if (msg.sender != owner()) {\n require(msg.sender == ownerOf(largerTokenId), \"Only the token owner or contract owner can re-roll\");\n }\n \n _initializeOwnershipAt(largerTokenId);\n if (_exists(largerTokenId + 1)) {\n _initializeOwnershipAt(largerTokenId + 1);\n }\n\n _setExtraDataAt(largerTokenId, entropyForExtraData());\n }\n \n function _extraData(\n address from,\n address to,\n uint24 previousExtraData\n ) internal view virtual override returns (uint24) {\n return from == address(0) ? entropyForExtraData() : previousExtraData;\n }\n\n function getTokenSeed(uint256 _tokenId) internal view returns (uint24) {\n return _ownershipOf(_tokenId).extraData;\n }\n\n function tokenIdToHash(\n uint256 _tokenId\n ) public view returns (string memory) {\n require(_exists(_tokenId), \"Invalid token\");\n // This will generate a NUM_LAYERS * 3 character string.\n bytes memory hashBytes = DynamicBuffer.allocate(NUM_LAYERS * 4);\n\n for (uint256 i = 0; i < NUM_LAYERS; i++) {\n uint256 _randinput = uint256(\n uint256(\n keccak256(\n abi.encodePacked(\n getTokenSeed(_tokenId),\n _tokenId,\n _tokenId + i\n )\n )\n ) % maxSupply\n );\n\n uint256 rarity = rarityGen(_randinput, i);\n\n if (rarity < 10) {\n hashBytes.appendSafe(\"00\");\n } else if (rarity < 100) {\n hashBytes.appendSafe(\"0\");\n }\n if (rarity > 999) {\n hashBytes.appendSafe(\"999\");\n } else {\n hashBytes.appendSafe(bytes(_toString(rarity)));\n }\n }\n\n return string(hashBytes);\n }\n\n function mint(uint64 _count, bytes32[] calldata merkleProof)\n external\n payable\n nonReentrant\n whenMintActive\n returns (uint256)\n {\n uint256 totalMinted = _totalMinted();\n require(_count > 0, \"Invalid token count\");\n require(totalMinted + _count <= maxSupply, \"All tokens are gone\");\n \n if (isPublicMintActive) {\n if (msg.sender != owner()) {\n require(_numberMinted(msg.sender) + _count <= maxPerAddress, \"Exceeded max mints allowed\");\n }\n require(_count * publicMintPrice == msg.value, \"Incorrect amount of ether sent\");\n } else {\n if (msg.sender != owner()) {\n require(onAllowList(msg.sender, merkleProof), \"Not on allow list\");\n require(_numberMinted(msg.sender) + _count <= maxPerAllowList, \"Exceeded max mints allowed\");\n }\n require(_count * allowListPrice == msg.value, \"Incorrect amount of ether sent\");\n }\n \n\n uint256 batchCount = _count / MAX_BATCH_MINT;\n uint256 remainder = _count % MAX_BATCH_MINT;\n\n for (uint256 i = 0; i < batchCount; i++) {\n _mint(msg.sender, MAX_BATCH_MINT);\n }\n\n if (remainder > 0) {\n _mint(msg.sender, remainder);\n }\n\n return totalMinted;\n }\n\n function isMintActive() public view returns (bool) {\n return _totalMinted() < maxSupply && (isPublicMintActive || isAllowListActive);\n }\n\n function hashToSVG(string memory _hash)\n public\n view\n returns (string memory)\n {\n uint256 thisTraitIndex;\n \n bytes memory svgBytes = DynamicBuffer.allocate(1024 * 128);\n svgBytes.appendSafe('<svg width=\"1200\" height=\"1200\" viewBox=\"0 0 1200 1200\" version=\"1.2\" xmlns=\"http://www.w3.org/2000/svg\" style=\"background-color:');\n svgBytes.appendSafe(\n abi.encodePacked(\n backgroundColor,\n \";background-image:url(\"\n )\n );\n\n for (uint256 i = 0; i < NUM_LAYERS - 1; i++) {\n thisTraitIndex = HelperLib.parseInt(\n HelperLib._substring(_hash, (i * 3), (i * 3) + 3)\n );\n svgBytes.appendSafe(\n abi.encodePacked(\n \"data:\",\n _traitDetails[i][thisTraitIndex].mimetype,\n \";base64,\",\n Base64.encode(SSTORE2.read(_traitDataPointers[i][thisTraitIndex])),\n \"),url(\"\n )\n );\n }\n\n thisTraitIndex = HelperLib.parseInt(\n HelperLib._substring(_hash, (NUM_LAYERS * 3) - 3, NUM_LAYERS * 3)\n );\n\n svgBytes.appendSafe(\n abi.encodePacked(\n \"data:\",\n _traitDetails[NUM_LAYERS - 1][thisTraitIndex].mimetype,\n \";base64,\",\n Base64.encode(SSTORE2.read(_traitDataPointers[NUM_LAYERS - 1][thisTraitIndex])),\n ');background-repeat:no-repeat;background-size:contain;background-position:center;image-rendering:-webkit-optimize-contrast;-ms-interpolation-mode:nearest-neighbor;image-rendering:-moz-crisp-edges;image-rendering:pixelated;\"></svg>'\n )\n );\n\n return string(\n abi.encodePacked(\n \"data:image/svg+xml;base64,\",\n Base64.encode(svgBytes)\n )\n );\n }\n\n function hashToMetadata(string memory _hash)\n public\n view\n returns (string memory)\n {\n bytes memory metadataBytes = DynamicBuffer.allocate(1024 * 128);\n metadataBytes.appendSafe(\"[\");\n\n for (uint256 i = 0; i < NUM_LAYERS; i++) {\n uint256 thisTraitIndex = HelperLib.parseInt(\n HelperLib._substring(_hash, (i * 3), (i * 3) + 3)\n );\n metadataBytes.appendSafe(\n abi.encodePacked(\n '{\"trait_type\":\"',\n LAYER_NAMES[i],\n '\",\"value\":\"',\n _traitDetails[i][thisTraitIndex].name,\n '\"}'\n )\n );\n \n if (i == NUM_LAYERS - 1) {\n metadataBytes.appendSafe(\"]\");\n } else {\n metadataBytes.appendSafe(\",\");\n }\n }\n\n return string(metadataBytes);\n }\n\n \n function onAllowList(address addr, bytes32[] calldata merkleProof) public view returns (bool) {\n return MerkleProof.verify(merkleProof, merkleRoot, keccak256(abi.encodePacked(addr)));\n }\n \n\n function tokenURI(uint256 _tokenId)\n public\n view\n override\n returns (string memory)\n {\n require(_exists(_tokenId), \"Invalid token\");\n require(_traitDataPointers[0].length > 0, \"Traits have not been added\");\n\n string memory tokenHash = tokenIdToHash(_tokenId);\n\n bytes memory jsonBytes = DynamicBuffer.allocate(1024 * 128);\n jsonBytes.appendSafe(unicode\"{\\\"name\\\":\\\"Aliens vs Punks #\");\n\n jsonBytes.appendSafe(\n abi.encodePacked(\n _toString(_tokenId),\n \"\\\",\\\"description\\\":\\\"\",\n contractData.description,\n \"\\\",\"\n )\n );\n\n if (bytes(baseURI).length > 0 && _renderTokenOffChain[_tokenId]) {\n jsonBytes.appendSafe(\n abi.encodePacked(\n '\"image\":\"',\n baseURI,\n _toString(_tokenId),\n \"?dna=\",\n tokenHash,\n '&network=mainnet\",'\n )\n );\n } else {\n string memory svgCode = \"\";\n if (shouldWrapSVG) {\n string memory svgString = hashToSVG(tokenHash);\n svgCode = string(\n abi.encodePacked(\n \"data:image/svg+xml;base64,\",\n Base64.encode(\n abi.encodePacked(\n '<svg width=\"100%\" height=\"100%\" viewBox=\"0 0 1200 1200\" version=\"1.2\" xmlns=\"http://www.w3.org/2000/svg\"><image width=\"1200\" height=\"1200\" href=\"',\n svgString,\n '\"></image></svg>'\n )\n )\n )\n );\n jsonBytes.appendSafe(\n abi.encodePacked(\n '\"svg_image_data\":\"',\n svgString,\n '\",'\n )\n );\n } else {\n svgCode = hashToSVG(tokenHash);\n }\n\n jsonBytes.appendSafe(\n abi.encodePacked(\n '\"image_data\":\"',\n svgCode,\n '\",'\n )\n );\n }\n\n jsonBytes.appendSafe(\n abi.encodePacked(\n '\"attributes\":',\n hashToMetadata(tokenHash),\n \"}\"\n )\n );\n\n return string(\n abi.encodePacked(\n \"data:application/json;base64,\",\n Base64.encode(jsonBytes)\n )\n );\n }\n\n function contractURI()\n public\n view\n returns (string memory)\n {\n return string(\n abi.encodePacked(\n \"data:application/json;base64,\",\n Base64.encode(\n abi.encodePacked(\n '{\"name\":\"',\n contractData.name,\n '\",\"description\":\"',\n contractData.description,\n '\",\"image\":\"',\n contractData.image,\n '\",\"banner\":\"',\n contractData.banner,\n '\",\"external_link\":\"',\n contractData.website,\n '\",\"seller_fee_basis_points\":',\n _toString(contractData.royalties),\n ',\"fee_recipient\":\"',\n contractData.royaltiesRecipient,\n '\"}'\n )\n )\n )\n );\n }\n\n function tokenIdToSVG(uint256 _tokenId)\n public\n view\n returns (string memory)\n {\n return hashToSVG(tokenIdToHash(_tokenId));\n }\n\n function traitDetails(uint256 _layerIndex, uint256 _traitIndex)\n public\n view\n returns (Trait memory)\n {\n return _traitDetails[_layerIndex][_traitIndex];\n }\n\n function traitData(uint256 _layerIndex, uint256 _traitIndex)\n public\n view\n returns (string memory)\n {\n return string(SSTORE2.read(_traitDataPointers[_layerIndex][_traitIndex]));\n }\n\n function addLayer(uint256 _layerIndex, TraitDTO[] memory traits)\n public\n onlyOwner\n whenUnsealed\n {\n require(TIERS[_layerIndex].length == traits.length, \"Traits size does not match tiers for this index\");\n address[] memory dataPointers = new address[](traits.length);\n for (uint256 i = 0; i < traits.length; i++) {\n dataPointers[i] = SSTORE2.write(traits[i].data);\n _traitDetails[_layerIndex][i] = Trait(traits[i].name, traits[i].mimetype);\n }\n _traitDataPointers[_layerIndex] = dataPointers;\n return;\n }\n\n function addTrait(uint256 _layerIndex, uint256 _traitIndex, TraitDTO memory trait)\n public\n onlyOwner\n whenUnsealed\n {\n _traitDetails[_layerIndex][_traitIndex] = Trait(trait.name, trait.mimetype);\n address[] memory dataPointers = _traitDataPointers[_layerIndex];\n dataPointers[_traitIndex] = SSTORE2.write(trait.data);\n _traitDataPointers[_layerIndex] = dataPointers;\n return;\n }\n\n function setContractData(ContractData memory _contractData) external onlyOwner whenUnsealed {\n contractData = _contractData;\n }\n\n function setMaxPerAddress(uint256 _maxPerAddress) external onlyOwner {\n maxPerAddress = _maxPerAddress;\n }\n\n function setBaseURI(string memory _baseURI) external onlyOwner {\n baseURI = _baseURI;\n }\n\n function setBackgroundColor(string memory _backgroundColor) external onlyOwner whenUnsealed {\n backgroundColor = _backgroundColor;\n }\n\n function setRenderOfTokenId(uint256 _tokenId, bool _renderOffChain) external {\n require(msg.sender == ownerOf(_tokenId), \"Only the token owner can set the render method\");\n _renderTokenOffChain[_tokenId] = _renderOffChain;\n }\n\n \n function setMerkleRoot(bytes32 newMerkleRoot) external onlyOwner {\n merkleRoot = newMerkleRoot;\n }\n\n function setMaxPerAllowList(uint256 _maxPerAllowList) external onlyOwner {\n maxPerAllowList = _maxPerAllowList;\n }\n\n function toggleAllowListMint() external onlyOwner {\n isAllowListActive = !isAllowListActive;\n }\n \n\n function toggleWrapSVG() external onlyOwner {\n shouldWrapSVG = !shouldWrapSVG;\n }\n\n function togglePublicMint() external onlyOwner {\n isPublicMintActive = !isPublicMintActive;\n }\n\n function sealContract() external whenUnsealed onlyOwner {\n isContractSealed = true;\n }\n\n function withdraw() external onlyOwner nonReentrant {\n uint256 balance = address(this).balance;\n uint256 amount = (balance * (10000 - DEVELOPER_FEE)) / 10000;\n \n address payable receiver = payable(owner());\n address payable dev = payable(0xEA208Da933C43857683C04BC76e3FD331D7bfdf7);\n \n Address.sendValue(receiver, amount);\n Address.sendValue(dev, balance - amount);\n }\n }\n"
},
"/var/app/current/contracts/DynamicBuffer.sol": {
"content": "// SPDX-License-Identifier: MIT\n// Copyright (c) 2021 the ethier authors (github.com/divergencetech/ethier)\n\npragma solidity >=0.8.0;\n\n/// @title DynamicBuffer\n/// @author David Huber (@cxkoda) and Simon Fremaux (@dievardump). See also\n/// https://raw.githubusercontent.com/dievardump/solidity-dynamic-buffer\n/// @notice This library is used to allocate a big amount of container memory\n// which will be subsequently filled without needing to reallocate\n/// memory.\n/// @dev First, allocate memory.\n/// Then use `buffer.appendUnchecked(theBytes)` or `appendSafe()` if\n/// bounds checking is required.\nlibrary DynamicBuffer {\n /// @notice Allocates container space for the DynamicBuffer\n /// @param capacity The intended max amount of bytes in the buffer\n /// @return buffer The memory location of the buffer\n /// @dev Allocates `capacity + 0x60` bytes of space\n /// The buffer array starts at the first container data position,\n /// (i.e. `buffer = container + 0x20`)\n function allocate(uint256 capacity)\n internal\n pure\n returns (bytes memory buffer)\n {\n assembly {\n // Get next-free memory address\n let container := mload(0x40)\n\n // Allocate memory by setting a new next-free address\n {\n // Add 2 x 32 bytes in size for the two length fields\n // Add 32 bytes safety space for 32B chunked copy\n let size := add(capacity, 0x60)\n let newNextFree := add(container, size)\n mstore(0x40, newNextFree)\n }\n\n // Set the correct container length\n {\n let length := add(capacity, 0x40)\n mstore(container, length)\n }\n\n // The buffer starts at idx 1 in the container (0 is length)\n buffer := add(container, 0x20)\n\n // Init content with length 0\n mstore(buffer, 0)\n }\n\n return buffer;\n }\n\n /// @notice Appends data to buffer, and update buffer length\n /// @param buffer the buffer to append the data to\n /// @param data the data to append\n /// @dev Does not perform out-of-bound checks (container capacity)\n /// for efficiency.\n function appendUnchecked(bytes memory buffer, bytes memory data)\n internal\n pure\n {\n assembly {\n let length := mload(data)\n for {\n data := add(data, 0x20)\n let dataEnd := add(data, length)\n let copyTo := add(buffer, add(mload(buffer), 0x20))\n } lt(data, dataEnd) {\n data := add(data, 0x20)\n copyTo := add(copyTo, 0x20)\n } {\n // Copy 32B chunks from data to buffer.\n // This may read over data array boundaries and copy invalid\n // bytes, which doesn't matter in the end since we will\n // later set the correct buffer length, and have allocated an\n // additional word to avoid buffer overflow.\n mstore(copyTo, mload(data))\n }\n\n // Update buffer length\n mstore(buffer, add(mload(buffer), length))\n }\n }\n\n /// @notice Appends data to buffer, and update buffer length\n /// @param buffer the buffer to append the data to\n /// @param data the data to append\n /// @dev Performs out-of-bound checks and calls `appendUnchecked`.\n function appendSafe(bytes memory buffer, bytes memory data) internal pure {\n uint256 capacity;\n uint256 length;\n assembly {\n capacity := sub(mload(sub(buffer, 0x20)), 0x40)\n length := mload(buffer)\n }\n\n require(\n length + data.length <= capacity,\n \"DynamicBuffer: Appending out of bounds.\"\n );\n appendUnchecked(buffer, data);\n }\n}"
},
"/var/app/current/contracts/HelperLib.sol": {
"content": "// SPDX-License-Identifier: MIT\npragma solidity ^0.8.14;\n\nlibrary HelperLib {\n function parseInt(string memory _a)\n internal\n pure\n returns (uint8 _parsedInt)\n {\n bytes memory bresult = bytes(_a);\n uint8 mint = 0;\n for (uint8 i = 0; i < bresult.length; i++) {\n if (\n (uint8(uint8(bresult[i])) >= 48) &&\n (uint8(uint8(bresult[i])) <= 57)\n ) {\n mint *= 10;\n mint += uint8(bresult[i]) - 48;\n }\n }\n return mint;\n }\n\n function _substring(\n string memory str,\n uint256 startIndex,\n uint256 endIndex\n ) internal pure returns (string memory) {\n bytes memory strBytes = bytes(str);\n bytes memory result = new bytes(endIndex - startIndex);\n for (uint256 i = startIndex; i < endIndex; i++) {\n result[i - startIndex] = strBytes[i];\n }\n return string(result);\n }\n}"
},
"/var/app/current/contracts/SSTORE2.sol": {
"content": "// SPDX-License-Identifier: MIT\npragma solidity ^0.8.0;\n\nimport \"./utils/Bytecode.sol\";\n\n/**\n @title A key-value storage with auto-generated keys for storing chunks of data with a lower write & read cost.\n @author Agustin Aguilar <[email protected]>\n\n Readme: https://github.com/0xsequence/sstore2#readme\n*/\nlibrary SSTORE2 {\n error WriteError();\n\n /**\n @notice Stores `_data` and returns `pointer` as key for later retrieval\n @dev The pointer is a contract address with `_data` as code\n @param _data to be written\n @return pointer Pointer to the written `_data`\n */\n function write(bytes memory _data) internal returns (address pointer) {\n // Append 00 to _data so contract can't be called\n // Build init code\n bytes memory code = Bytecode.creationCodeFor(\n abi.encodePacked(\n hex'00',\n _data\n )\n );\n\n // Deploy contract using create\n assembly { pointer := create(0, add(code, 32), mload(code)) }\n\n // Address MUST be non-zero\n if (pointer == address(0)) revert WriteError();\n }\n\n /**\n @notice Reads the contents of the `_pointer` code as data, skips the first byte \n @dev The function is intended for reading pointers generated by `write`\n @param _pointer to be read\n @return data read from `_pointer` contract\n */\n function read(address _pointer) internal view returns (bytes memory) {\n return Bytecode.codeAt(_pointer, 1, type(uint256).max);\n }\n\n /**\n @notice Reads the contents of the `_pointer` code as data, skips the first byte \n @dev The function is intended for reading pointers generated by `write`\n @param _pointer to be read\n @param _start number of bytes to skip\n @return data read from `_pointer` contract\n */\n function read(address _pointer, uint256 _start) internal view returns (bytes memory) {\n return Bytecode.codeAt(_pointer, _start + 1, type(uint256).max);\n }\n\n /**\n @notice Reads the contents of the `_pointer` code as data, skips the first byte \n @dev The function is intended for reading pointers generated by `write`\n @param _pointer to be read\n @param _start number of bytes to skip\n @param _end index before which to end extraction\n @return data read from `_pointer` contract\n */\n function read(address _pointer, uint256 _start, uint256 _end) internal view returns (bytes memory) {\n return Bytecode.codeAt(_pointer, _start + 1, _end + 1);\n }\n}"
},
"/var/app/current/contracts/utils/Bytecode.sol": {
"content": "// SPDX-License-Identifier: MIT\npragma solidity ^0.8.0;\n\n\nlibrary Bytecode {\n error InvalidCodeAtRange(uint256 _size, uint256 _start, uint256 _end);\n\n /**\n @notice Generate a creation code that results on a contract with `_code` as bytecode\n @param _code The returning value of the resulting `creationCode`\n @return creationCode (constructor) for new contract\n */\n function creationCodeFor(bytes memory _code) internal pure returns (bytes memory) {\n /*\n 0x00 0x63 0x63XXXXXX PUSH4 _code.length size\n 0x01 0x80 0x80 DUP1 size size\n 0x02 0x60 0x600e PUSH1 14 14 size size\n 0x03 0x60 0x6000 PUSH1 00 0 14 size size\n 0x04 0x39 0x39 CODECOPY size\n 0x05 0x60 0x6000 PUSH1 00 0 size\n 0x06 0xf3 0xf3 RETURN\n <CODE>\n */\n\n return abi.encodePacked(\n hex\"63\",\n uint32(_code.length),\n hex\"80_60_0E_60_00_39_60_00_F3\",\n _code\n );\n }\n\n /**\n @notice Returns the size of the code on a given address\n @param _addr Address that may or may not contain code\n @return size of the code on the given `_addr`\n */\n function codeSize(address _addr) internal view returns (uint256 size) {\n assembly { size := extcodesize(_addr) }\n }\n\n /**\n @notice Returns the code of a given address\n @dev It will fail if `_end < _start`\n @param _addr Address that may or may not contain code\n @param _start number of bytes of code to skip on read\n @param _end index before which to end extraction\n @return oCode read from `_addr` deployed bytecode\n\n Forked from: https://gist.github.com/KardanovIR/fe98661df9338c842b4a30306d507fbd\n */\n function codeAt(address _addr, uint256 _start, uint256 _end) internal view returns (bytes memory oCode) {\n uint256 csize = codeSize(_addr);\n if (csize == 0) return bytes(\"\");\n\n if (_start > csize) return bytes(\"\");\n if (_end < _start) revert InvalidCodeAtRange(csize, _start, _end); \n\n unchecked {\n uint256 reqSize = _end - _start;\n uint256 maxSize = csize - _start;\n\n uint256 size = maxSize < reqSize ? maxSize : reqSize;\n\n assembly {\n // allocate output byte array - this could also be done without assembly\n // by using o_code = new bytes(size)\n oCode := mload(0x40)\n // new \"memory end\" including padding\n mstore(0x40, add(oCode, and(add(add(size, 0x20), 0x1f), not(0x1f))))\n // store length in memory\n mstore(oCode, size)\n // actually retrieve the code, this needs assembly\n extcodecopy(_addr, add(oCode, 0x20), _start, size)\n }\n }\n }\n}"
},
"@openzeppelin/contracts/access/Ownable.sol": {
"content": "// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts v4.4.1 (access/Ownable.sol)\n\npragma solidity ^0.8.0;\n\nimport \"../utils/Context.sol\";\n\n/**\n * @dev Contract module which provides a basic access control mechanism, where\n * there is an account (an owner) that can be granted exclusive access to\n * specific functions.\n *\n * By default, the owner account will be the one that deploys the contract. This\n * can later be changed with {transferOwnership}.\n *\n * This module is used through inheritance. It will make available the modifier\n * `onlyOwner`, which can be applied to your functions to restrict their use to\n * the owner.\n */\nabstract contract Ownable is Context {\n address private _owner;\n\n event OwnershipTransferred(address indexed previousOwner, address indexed newOwner);\n\n /**\n * @dev Initializes the contract setting the deployer as the initial owner.\n */\n constructor() {\n _transferOwnership(_msgSender());\n }\n\n /**\n * @dev Returns the address of the current owner.\n */\n function owner() public view virtual returns (address) {\n return _owner;\n }\n\n /**\n * @dev Throws if called by any account other than the owner.\n */\n modifier onlyOwner() {\n require(owner() == _msgSender(), \"Ownable: caller is not the owner\");\n _;\n }\n\n /**\n * @dev Leaves the contract without owner. It will not be possible to call\n * `onlyOwner` functions anymore. Can only be called by the current owner.\n *\n * NOTE: Renouncing ownership will leave the contract without an owner,\n * thereby removing any functionality that is only available to the owner.\n */\n function renounceOwnership() public virtual onlyOwner {\n _transferOwnership(address(0));\n }\n\n /**\n * @dev Transfers ownership of the contract to a new account (`newOwner`).\n * Can only be called by the current owner.\n */\n function transferOwnership(address newOwner) public virtual onlyOwner {\n require(newOwner != address(0), \"Ownable: new owner is the zero address\");\n _transferOwnership(newOwner);\n }\n\n /**\n * @dev Transfers ownership of the contract to a new account (`newOwner`).\n * Internal function without access restriction.\n */\n function _transferOwnership(address newOwner) internal virtual {\n address oldOwner = _owner;\n _owner = newOwner;\n emit OwnershipTransferred(oldOwner, newOwner);\n }\n}\n"
},
"@openzeppelin/contracts/security/ReentrancyGuard.sol": {
"content": "// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts v4.4.1 (security/ReentrancyGuard.sol)\n\npragma solidity ^0.8.0;\n\n/**\n * @dev Contract module that helps prevent reentrant calls to a function.\n *\n * Inheriting from `ReentrancyGuard` will make the {nonReentrant} modifier\n * available, which can be applied to functions to make sure there are no nested\n * (reentrant) calls to them.\n *\n * Note that because there is a single `nonReentrant` guard, functions marked as\n * `nonReentrant` may not call one another. This can be worked around by making\n * those functions `private`, and then adding `external` `nonReentrant` entry\n * points to them.\n *\n * TIP: If you would like to learn more about reentrancy and alternative ways\n * to protect against it, check out our blog post\n * https://blog.openzeppelin.com/reentrancy-after-istanbul/[Reentrancy After Istanbul].\n */\nabstract contract ReentrancyGuard {\n // Booleans are more expensive than uint256 or any type that takes up a full\n // word because each write operation emits an extra SLOAD to first read the\n // slot's contents, replace the bits taken up by the boolean, and then write\n // back. This is the compiler's defense against contract upgrades and\n // pointer aliasing, and it cannot be disabled.\n\n // The values being non-zero value makes deployment a bit more expensive,\n // but in exchange the refund on every call to nonReentrant will be lower in\n // amount. Since refunds are capped to a percentage of the total\n // transaction's gas, it is best to keep them low in cases like this one, to\n // increase the likelihood of the full refund coming into effect.\n uint256 private constant _NOT_ENTERED = 1;\n uint256 private constant _ENTERED = 2;\n\n uint256 private _status;\n\n constructor() {\n _status = _NOT_ENTERED;\n }\n\n /**\n * @dev Prevents a contract from calling itself, directly or indirectly.\n * Calling a `nonReentrant` function from another `nonReentrant`\n * function is not supported. It is possible to prevent this from happening\n * by making the `nonReentrant` function external, and making it call a\n * `private` function that does the actual work.\n */\n modifier nonReentrant() {\n // On the first call to nonReentrant, _notEntered will be true\n require(_status != _ENTERED, \"ReentrancyGuard: reentrant call\");\n\n // Any calls to nonReentrant after this point will fail\n _status = _ENTERED;\n\n _;\n\n // By storing the original value once again, a refund is triggered (see\n // https://eips.ethereum.org/EIPS/eip-2200)\n _status = _NOT_ENTERED;\n }\n}\n"
},
"@openzeppelin/contracts/utils/Address.sol": {
"content": "// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v4.5.0) (utils/Address.sol)\n\npragma solidity ^0.8.1;\n\n/**\n * @dev Collection of functions related to the address type\n */\nlibrary Address {\n /**\n * @dev Returns true if `account` is a contract.\n *\n * [IMPORTANT]\n * ====\n * It is unsafe to assume that an address for which this function returns\n * false is an externally-owned account (EOA) and not a contract.\n *\n * Among others, `isContract` will return false for the following\n * types of addresses:\n *\n * - an externally-owned account\n * - a contract in construction\n * - an address where a contract will be created\n * - an address where a contract lived, but was destroyed\n * ====\n *\n * [IMPORTANT]\n * ====\n * You shouldn't rely on `isContract` to protect against flash loan attacks!\n *\n * Preventing calls from contracts is highly discouraged. It breaks composability, breaks support for smart wallets\n * like Gnosis Safe, and does not provide security since it can be circumvented by calling from a contract\n * constructor.\n * ====\n */\n function isContract(address account) internal view returns (bool) {\n // This method relies on extcodesize/address.code.length, which returns 0\n // for contracts in construction, since the code is only stored at the end\n // of the constructor execution.\n\n return account.code.length > 0;\n }\n\n /**\n * @dev Replacement for Solidity's `transfer`: sends `amount` wei to\n * `recipient`, forwarding all available gas and reverting on errors.\n *\n * https://eips.ethereum.org/EIPS/eip-1884[EIP1884] increases the gas cost\n * of certain opcodes, possibly making contracts go over the 2300 gas limit\n * imposed by `transfer`, making them unable to receive funds via\n * `transfer`. {sendValue} removes this limitation.\n *\n * https://diligence.consensys.net/posts/2019/09/stop-using-soliditys-transfer-now/[Learn more].\n *\n * IMPORTANT: because control is transferred to `recipient`, care must be\n * taken to not create reentrancy vulnerabilities. Consider using\n * {ReentrancyGuard} or the\n * https://solidity.readthedocs.io/en/v0.5.11/security-considerations.html#use-the-checks-effects-interactions-pattern[checks-effects-interactions pattern].\n */\n function sendValue(address payable recipient, uint256 amount) internal {\n require(address(this).balance >= amount, \"Address: insufficient balance\");\n\n (bool success, ) = recipient.call{value: amount}(\"\");\n require(success, \"Address: unable to send value, recipient may have reverted\");\n }\n\n /**\n * @dev Performs a Solidity function call using a low level `call`. A\n * plain `call` is an unsafe replacement for a function call: use this\n * function instead.\n *\n * If `target` reverts with a revert reason, it is bubbled up by this\n * function (like regular Solidity function calls).\n *\n * Returns the raw returned data. To convert to the expected return value,\n * use https://solidity.readthedocs.io/en/latest/units-and-global-variables.html?highlight=abi.decode#abi-encoding-and-decoding-functions[`abi.decode`].\n *\n * Requirements:\n *\n * - `target` must be a contract.\n * - calling `target` with `data` must not revert.\n *\n * _Available since v3.1._\n */\n function functionCall(address target, bytes memory data) internal returns (bytes memory) {\n return functionCall(target, data, \"Address: low-level call failed\");\n }\n\n /**\n * @dev Same as {xref-Address-functionCall-address-bytes-}[`functionCall`], but with\n * `errorMessage` as a fallback revert reason when `target` reverts.\n *\n * _Available since v3.1._\n */\n function functionCall(\n address target,\n bytes memory data,\n string memory errorMessage\n ) internal returns (bytes memory) {\n return functionCallWithValue(target, data, 0, errorMessage);\n }\n\n /**\n * @dev Same as {xref-Address-functionCall-address-bytes-}[`functionCall`],\n * but also transferring `value` wei to `target`.\n *\n * Requirements:\n *\n * - the calling contract must have an ETH balance of at least `value`.\n * - the called Solidity function must be `payable`.\n *\n * _Available since v3.1._\n */\n function functionCallWithValue(\n address target,\n bytes memory data,\n uint256 value\n ) internal returns (bytes memory) {\n return functionCallWithValue(target, data, value, \"Address: low-level call with value failed\");\n }\n\n /**\n * @dev Same as {xref-Address-functionCallWithValue-address-bytes-uint256-}[`functionCallWithValue`], but\n * with `errorMessage` as a fallback revert reason when `target` reverts.\n *\n * _Available since v3.1._\n */\n function functionCallWithValue(\n address target,\n bytes memory data,\n uint256 value,\n string memory errorMessage\n ) internal returns (bytes memory) {\n require(address(this).balance >= value, \"Address: insufficient balance for call\");\n require(isContract(target), \"Address: call to non-contract\");\n\n (bool success, bytes memory returndata) = target.call{value: value}(data);\n return verifyCallResult(success, returndata, errorMessage);\n }\n\n /**\n * @dev Same as {xref-Address-functionCall-address-bytes-}[`functionCall`],\n * but performing a static call.\n *\n * _Available since v3.3._\n */\n function functionStaticCall(address target, bytes memory data) internal view returns (bytes memory) {\n return functionStaticCall(target, data, \"Address: low-level static call failed\");\n }\n\n /**\n * @dev Same as {xref-Address-functionCall-address-bytes-string-}[`functionCall`],\n * but performing a static call.\n *\n * _Available since v3.3._\n */\n function functionStaticCall(\n address target,\n bytes memory data,\n string memory errorMessage\n ) internal view returns (bytes memory) {\n require(isContract(target), \"Address: static call to non-contract\");\n\n (bool success, bytes memory returndata) = target.staticcall(data);\n return verifyCallResult(success, returndata, errorMessage);\n }\n\n /**\n * @dev Same as {xref-Address-functionCall-address-bytes-}[`functionCall`],\n * but performing a delegate call.\n *\n * _Available since v3.4._\n */\n function functionDelegateCall(address target, bytes memory data) internal returns (bytes memory) {\n return functionDelegateCall(target, data, \"Address: low-level delegate call failed\");\n }\n\n /**\n * @dev Same as {xref-Address-functionCall-address-bytes-string-}[`functionCall`],\n * but performing a delegate call.\n *\n * _Available since v3.4._\n */\n function functionDelegateCall(\n address target,\n bytes memory data,\n string memory errorMessage\n ) internal returns (bytes memory) {\n require(isContract(target), \"Address: delegate call to non-contract\");\n\n (bool success, bytes memory returndata) = target.delegatecall(data);\n return verifyCallResult(success, returndata, errorMessage);\n }\n\n /**\n * @dev Tool to verifies that a low level call was successful, and revert if it wasn't, either by bubbling the\n * revert reason using the provided one.\n *\n * _Available since v4.3._\n */\n function verifyCallResult(\n bool success,\n bytes memory returndata,\n string memory errorMessage\n ) internal pure returns (bytes memory) {\n if (success) {\n return returndata;\n } else {\n // Look for revert reason and bubble it up if present\n if (returndata.length > 0) {\n // The easiest way to bubble the revert reason is using memory via assembly\n\n assembly {\n let returndata_size := mload(returndata)\n revert(add(32, returndata), returndata_size)\n }\n } else {\n revert(errorMessage);\n }\n }\n }\n}\n"
},
"@openzeppelin/contracts/utils/Base64.sol": {
"content": "// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v4.5.0) (utils/Base64.sol)\n\npragma solidity ^0.8.0;\n\n/**\n * @dev Provides a set of functions to operate with Base64 strings.\n *\n * _Available since v4.5._\n */\nlibrary Base64 {\n /**\n * @dev Base64 Encoding/Decoding Table\n */\n string internal constant _TABLE = \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/\";\n\n /**\n * @dev Converts a `bytes` to its Bytes64 `string` representation.\n */\n function encode(bytes memory data) internal pure returns (string memory) {\n /**\n * Inspired by Brecht Devos (Brechtpd) implementation - MIT licence\n * https://github.com/Brechtpd/base64/blob/e78d9fd951e7b0977ddca77d92dc85183770daf4/base64.sol\n */\n if (data.length == 0) return \"\";\n\n // Loads the table into memory\n string memory table = _TABLE;\n\n // Encoding takes 3 bytes chunks of binary data from `bytes` data parameter\n // and split into 4 numbers of 6 bits.\n // The final Base64 length should be `bytes` data length multiplied by 4/3 rounded up\n // - `data.length + 2` -> Round up\n // - `/ 3` -> Number of 3-bytes chunks\n // - `4 *` -> 4 characters for each chunk\n string memory result = new string(4 * ((data.length + 2) / 3));\n\n assembly {\n // Prepare the lookup table (skip the first \"length\" byte)\n let tablePtr := add(table, 1)\n\n // Prepare result pointer, jump over length\n let resultPtr := add(result, 32)\n\n // Run over the input, 3 bytes at a time\n for {\n let dataPtr := data\n let endPtr := add(data, mload(data))\n } lt(dataPtr, endPtr) {\n\n } {\n // Advance 3 bytes\n dataPtr := add(dataPtr, 3)\n let input := mload(dataPtr)\n\n // To write each character, shift the 3 bytes (18 bits) chunk\n // 4 times in blocks of 6 bits for each character (18, 12, 6, 0)\n // and apply logical AND with 0x3F which is the number of\n // the previous character in the ASCII table prior to the Base64 Table\n // The result is then added to the table to get the character to write,\n // and finally write it in the result pointer but with a left shift\n // of 256 (1 byte) - 8 (1 ASCII char) = 248 bits\n\n mstore8(resultPtr, mload(add(tablePtr, and(shr(18, input), 0x3F))))\n resultPtr := add(resultPtr, 1) // Advance\n\n mstore8(resultPtr, mload(add(tablePtr, and(shr(12, input), 0x3F))))\n resultPtr := add(resultPtr, 1) // Advance\n\n mstore8(resultPtr, mload(add(tablePtr, and(shr(6, input), 0x3F))))\n resultPtr := add(resultPtr, 1) // Advance\n\n mstore8(resultPtr, mload(add(tablePtr, and(input, 0x3F))))\n resultPtr := add(resultPtr, 1) // Advance\n }\n\n // When data `bytes` is not exactly 3 bytes long\n // it is padded with `=` characters at the end\n switch mod(mload(data), 3)\n case 1 {\n mstore8(sub(resultPtr, 1), 0x3d)\n mstore8(sub(resultPtr, 2), 0x3d)\n }\n case 2 {\n mstore8(sub(resultPtr, 1), 0x3d)\n }\n }\n\n return result;\n }\n}\n"
},
"@openzeppelin/contracts/utils/Context.sol": {
"content": "// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts v4.4.1 (utils/Context.sol)\n\npragma solidity ^0.8.0;\n\n/**\n * @dev Provides information about the current execution context, including the\n * sender of the transaction and its data. While these are generally available\n * via msg.sender and msg.data, they should not be accessed in such a direct\n * manner, since when dealing with meta-transactions the account sending and\n * paying for execution may not be the actual sender (as far as an application\n * is concerned).\n *\n * This contract is only required for intermediate, library-like contracts.\n */\nabstract contract Context {\n function _msgSender() internal view virtual returns (address) {\n return msg.sender;\n }\n\n function _msgData() internal view virtual returns (bytes calldata) {\n return msg.data;\n }\n}\n"
},
"@openzeppelin/contracts/utils/cryptography/MerkleProof.sol": {
"content": "// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v4.6.0) (utils/cryptography/MerkleProof.sol)\n\npragma solidity ^0.8.0;\n\n/**\n * @dev These functions deal with verification of Merkle Trees proofs.\n *\n * The proofs can be generated using the JavaScript library\n * https://github.com/miguelmota/merkletreejs[merkletreejs].\n * Note: the hashing algorithm should be keccak256 and pair sorting should be enabled.\n *\n * See `test/utils/cryptography/MerkleProof.test.js` for some examples.\n *\n * WARNING: You should avoid using leaf values that are 64 bytes long prior to\n * hashing, or use a hash function other than keccak256 for hashing leaves.\n * This is because the concatenation of a sorted pair of internal nodes in\n * the merkle tree could be reinterpreted as a leaf value.\n */\nlibrary MerkleProof {\n /**\n * @dev Returns true if a `leaf` can be proved to be a part of a Merkle tree\n * defined by `root`. For this, a `proof` must be provided, containing\n * sibling hashes on the branch from the leaf to the root of the tree. Each\n * pair of leaves and each pair of pre-images are assumed to be sorted.\n */\n function verify(\n bytes32[] memory proof,\n bytes32 root,\n bytes32 leaf\n ) internal pure returns (bool) {\n return processProof(proof, leaf) == root;\n }\n\n /**\n * @dev Returns the rebuilt hash obtained by traversing a Merkle tree up\n * from `leaf` using `proof`. A `proof` is valid if and only if the rebuilt\n * hash matches the root of the tree. When processing the proof, the pairs\n * of leafs & pre-images are assumed to be sorted.\n *\n * _Available since v4.4._\n */\n function processProof(bytes32[] memory proof, bytes32 leaf) internal pure returns (bytes32) {\n bytes32 computedHash = leaf;\n for (uint256 i = 0; i < proof.length; i++) {\n bytes32 proofElement = proof[i];\n if (computedHash <= proofElement) {\n // Hash(current computed hash + current element of the proof)\n computedHash = _efficientHash(computedHash, proofElement);\n } else {\n // Hash(current element of the proof + current computed hash)\n computedHash = _efficientHash(proofElement, computedHash);\n }\n }\n return computedHash;\n }\n\n function _efficientHash(bytes32 a, bytes32 b) private pure returns (bytes32 value) {\n assembly {\n mstore(0x00, a)\n mstore(0x20, b)\n value := keccak256(0x00, 0x40)\n }\n }\n}\n"
},
"erc721a/contracts/ERC721A.sol": {
"content": "// SPDX-License-Identifier: MIT\n// ERC721A Contracts v4.1.0\n// Creator: Chiru Labs\n\npragma solidity ^0.8.4;\n\nimport './IERC721A.sol';\n\n/**\n * @dev ERC721 token receiver interface.\n */\ninterface ERC721A__IERC721Receiver {\n function onERC721Received(\n address operator,\n address from,\n uint256 tokenId,\n bytes calldata data\n ) external returns (bytes4);\n}\n\n/**\n * @dev Implementation of https://eips.ethereum.org/EIPS/eip-721[ERC721] Non-Fungible Token Standard,\n * including the Metadata extension. Built to optimize for lower gas during batch mints.\n *\n * Assumes serials are sequentially minted starting at `_startTokenId()`\n * (defaults to 0, e.g. 0, 1, 2, 3..).\n *\n * Assumes that an owner cannot have more than 2**64 - 1 (max value of uint64) of supply.\n *\n * Assumes that the maximum token id cannot exceed 2**256 - 1 (max value of uint256).\n */\ncontract ERC721A is IERC721A {\n // Mask of an entry in packed address data.\n uint256 private constant BITMASK_ADDRESS_DATA_ENTRY = (1 << 64) - 1;\n\n // The bit position of `numberMinted` in packed address data.\n uint256 private constant BITPOS_NUMBER_MINTED = 64;\n\n // The bit position of `numberBurned` in packed address data.\n uint256 private constant BITPOS_NUMBER_BURNED = 128;\n\n // The bit position of `aux` in packed address data.\n uint256 private constant BITPOS_AUX = 192;\n\n // Mask of all 256 bits in packed address data except the 64 bits for `aux`.\n uint256 private constant BITMASK_AUX_COMPLEMENT = (1 << 192) - 1;\n\n // The bit position of `startTimestamp` in packed ownership.\n uint256 private constant BITPOS_START_TIMESTAMP = 160;\n\n // The bit mask of the `burned` bit in packed ownership.\n uint256 private constant BITMASK_BURNED = 1 << 224;\n\n // The bit position of the `nextInitialized` bit in packed ownership.\n uint256 private constant BITPOS_NEXT_INITIALIZED = 225;\n\n // The bit mask of the `nextInitialized` bit in packed ownership.\n uint256 private constant BITMASK_NEXT_INITIALIZED = 1 << 225;\n\n // The bit position of `extraData` in packed ownership.\n uint256 private constant BITPOS_EXTRA_DATA = 232;\n\n // Mask of all 256 bits in a packed ownership except the 24 bits for `extraData`.\n uint256 private constant BITMASK_EXTRA_DATA_COMPLEMENT = (1 << 232) - 1;\n\n // The mask of the lower 160 bits for addresses.\n uint256 private constant BITMASK_ADDRESS = (1 << 160) - 1;\n\n // The maximum `quantity` that can be minted with `_mintERC2309`.\n // This limit is to prevent overflows on the address data entries.\n // For a limit of 5000, a total of 3.689e15 calls to `_mintERC2309`\n // is required to cause an overflow, which is unrealistic.\n uint256 private constant MAX_MINT_ERC2309_QUANTITY_LIMIT = 5000;\n\n // The tokenId of the next token to be minted.\n uint256 private _currentIndex;\n\n // The number of tokens burned.\n uint256 private _burnCounter;\n\n // Token name\n string private _name;\n\n // Token symbol\n string private _symbol;\n\n // Mapping from token ID to ownership details\n // An empty struct value does not necessarily mean the token is unowned.\n // See `_packedOwnershipOf` implementation for details.\n //\n // Bits Layout:\n // - [0..159] `addr`\n // - [160..223] `startTimestamp`\n // - [224] `burned`\n // - [225] `nextInitialized`\n // - [232..255] `extraData`\n mapping(uint256 => uint256) private _packedOwnerships;\n\n // Mapping owner address to address data.\n //\n // Bits Layout:\n // - [0..63] `balance`\n // - [64..127] `numberMinted`\n // - [128..191] `numberBurned`\n // - [192..255] `aux`\n mapping(address => uint256) private _packedAddressData;\n\n // Mapping from token ID to approved address.\n mapping(uint256 => address) private _tokenApprovals;\n\n // Mapping from owner to operator approvals\n mapping(address => mapping(address => bool)) private _operatorApprovals;\n\n constructor(string memory name_, string memory symbol_) {\n _name = name_;\n _symbol = symbol_;\n _currentIndex = _startTokenId();\n }\n\n /**\n * @dev Returns the starting token ID.\n * To change the starting token ID, please override this function.\n */\n function _startTokenId() internal view virtual returns (uint256) {\n return 0;\n }\n\n /**\n * @dev Returns the next token ID to be minted.\n */\n function _nextTokenId() internal view returns (uint256) {\n return _currentIndex;\n }\n\n /**\n * @dev Returns the total number of tokens in existence.\n * Burned tokens will reduce the count.\n * To get the total number of tokens minted, please see `_totalMinted`.\n */\n function totalSupply() public view override returns (uint256) {\n // Counter underflow is impossible as _burnCounter cannot be incremented\n // more than `_currentIndex - _startTokenId()` times.\n unchecked {\n return _currentIndex - _burnCounter - _startTokenId();\n }\n }\n\n /**\n * @dev Returns the total amount of tokens minted in the contract.\n */\n function _totalMinted() internal view returns (uint256) {\n // Counter underflow is impossible as _currentIndex does not decrement,\n // and it is initialized to `_startTokenId()`\n unchecked {\n return _currentIndex - _startTokenId();\n }\n }\n\n /**\n * @dev Returns the total number of tokens burned.\n */\n function _totalBurned() internal view returns (uint256) {\n return _burnCounter;\n }\n\n /**\n * @dev See {IERC165-supportsInterface}.\n */\n function supportsInterface(bytes4 interfaceId) public view virtual override returns (bool) {\n // The interface IDs are constants representing the first 4 bytes of the XOR of\n // all function selectors in the interface. See: https://eips.ethereum.org/EIPS/eip-165\n // e.g. `bytes4(i.functionA.selector ^ i.functionB.selector ^ ...)`\n return\n interfaceId == 0x01ffc9a7 || // ERC165 interface ID for ERC165.\n interfaceId == 0x80ac58cd || // ERC165 interface ID for ERC721.\n interfaceId == 0x5b5e139f; // ERC165 interface ID for ERC721Metadata.\n }\n\n /**\n * @dev See {IERC721-balanceOf}.\n */\n function balanceOf(address owner) public view override returns (uint256) {\n if (owner == address(0)) revert BalanceQueryForZeroAddress();\n return _packedAddressData[owner] & BITMASK_ADDRESS_DATA_ENTRY;\n }\n\n /**\n * Returns the number of tokens minted by `owner`.\n */\n function _numberMinted(address owner) internal view returns (uint256) {\n return (_packedAddressData[owner] >> BITPOS_NUMBER_MINTED) & BITMASK_ADDRESS_DATA_ENTRY;\n }\n\n /**\n * Returns the number of tokens burned by or on behalf of `owner`.\n */\n function _numberBurned(address owner) internal view returns (uint256) {\n return (_packedAddressData[owner] >> BITPOS_NUMBER_BURNED) & BITMASK_ADDRESS_DATA_ENTRY;\n }\n\n /**\n * Returns the auxiliary data for `owner`. (e.g. number of whitelist mint slots used).\n */\n function _getAux(address owner) internal view returns (uint64) {\n return uint64(_packedAddressData[owner] >> BITPOS_AUX);\n }\n\n /**\n * Sets the auxiliary data for `owner`. (e.g. number of whitelist mint slots used).\n * If there are multiple variables, please pack them into a uint64.\n */\n function _setAux(address owner, uint64 aux) internal {\n uint256 packed = _packedAddressData[owner];\n uint256 auxCasted;\n // Cast `aux` with assembly to avoid redundant masking.\n assembly {\n auxCasted := aux\n }\n packed = (packed & BITMASK_AUX_COMPLEMENT) | (auxCasted << BITPOS_AUX);\n _packedAddressData[owner] = packed;\n }\n\n /**\n * Returns the packed ownership data of `tokenId`.\n */\n function _packedOwnershipOf(uint256 tokenId) private view returns (uint256) {\n uint256 curr = tokenId;\n\n unchecked {\n if (_startTokenId() <= curr)\n if (curr < _currentIndex) {\n uint256 packed = _packedOwnerships[curr];\n // If not burned.\n if (packed & BITMASK_BURNED == 0) {\n // Invariant:\n // There will always be an ownership that has an address and is not burned\n // before an ownership that does not have an address and is not burned.\n // Hence, curr will not underflow.\n //\n // We can directly compare the packed value.\n // If the address is zero, packed is zero.\n while (packed == 0) {\n packed = _packedOwnerships[--curr];\n }\n return packed;\n }\n }\n }\n revert OwnerQueryForNonexistentToken();\n }\n\n /**\n * Returns the unpacked `TokenOwnership` struct from `packed`.\n */\n function _unpackedOwnership(uint256 packed) private pure returns (TokenOwnership memory ownership) {\n ownership.addr = address(uint160(packed));\n ownership.startTimestamp = uint64(packed >> BITPOS_START_TIMESTAMP);\n ownership.burned = packed & BITMASK_BURNED != 0;\n ownership.extraData = uint24(packed >> BITPOS_EXTRA_DATA);\n }\n\n /**\n * Returns the unpacked `TokenOwnership` struct at `index`.\n */\n function _ownershipAt(uint256 index) internal view returns (TokenOwnership memory) {\n return _unpackedOwnership(_packedOwnerships[index]);\n }\n\n /**\n * @dev Initializes the ownership slot minted at `index` for efficiency purposes.\n */\n function _initializeOwnershipAt(uint256 index) internal {\n if (_packedOwnerships[index] == 0) {\n _packedOwnerships[index] = _packedOwnershipOf(index);\n }\n }\n\n /**\n * Gas spent here starts off proportional to the maximum mint batch size.\n * It gradually moves to O(1) as tokens get transferred around in the collection over time.\n */\n function _ownershipOf(uint256 tokenId) internal view returns (TokenOwnership memory) {\n return _unpackedOwnership(_packedOwnershipOf(tokenId));\n }\n\n /**\n * @dev Packs ownership data into a single uint256.\n */\n function _packOwnershipData(address owner, uint256 flags) private view returns (uint256 result) {\n assembly {\n // Mask `owner` to the lower 160 bits, in case the upper bits somehow aren't clean.\n owner := and(owner, BITMASK_ADDRESS)\n // `owner | (block.timestamp << BITPOS_START_TIMESTAMP) | flags`.\n result := or(owner, or(shl(BITPOS_START_TIMESTAMP, timestamp()), flags))\n }\n }\n\n /**\n * @dev See {IERC721-ownerOf}.\n */\n function ownerOf(uint256 tokenId) public view override returns (address) {\n return address(uint160(_packedOwnershipOf(tokenId)));\n }\n\n /**\n * @dev See {IERC721Metadata-name}.\n */\n function name() public view virtual override returns (string memory) {\n return _name;\n }\n\n /**\n * @dev See {IERC721Metadata-symbol}.\n */\n function symbol() public view virtual override returns (string memory) {\n return _symbol;\n }\n\n /**\n * @dev See {IERC721Metadata-tokenURI}.\n */\n function tokenURI(uint256 tokenId) public view virtual override returns (string memory) {\n if (!_exists(tokenId)) revert URIQueryForNonexistentToken();\n\n string memory baseURI = _baseURI();\n return bytes(baseURI).length != 0 ? string(abi.encodePacked(baseURI, _toString(tokenId))) : '';\n }\n\n /**\n * @dev Base URI for computing {tokenURI}. If set, the resulting URI for each\n * token will be the concatenation of the `baseURI` and the `tokenId`. Empty\n * by default, it can be overridden in child contracts.\n */\n function _baseURI() internal view virtual returns (string memory) {\n return '';\n }\n\n /**\n * @dev Returns the `nextInitialized` flag set if `quantity` equals 1.\n */\n function _nextInitializedFlag(uint256 quantity) private pure returns (uint256 result) {\n // For branchless setting of the `nextInitialized` flag.\n assembly {\n // `(quantity == 1) << BITPOS_NEXT_INITIALIZED`.\n result := shl(BITPOS_NEXT_INITIALIZED, eq(quantity, 1))\n }\n }\n\n /**\n * @dev See {IERC721-approve}.\n */\n function approve(address to, uint256 tokenId) public override {\n address owner = ownerOf(tokenId);\n\n if (_msgSenderERC721A() != owner)\n if (!isApprovedForAll(owner, _msgSenderERC721A())) {\n revert ApprovalCallerNotOwnerNorApproved();\n }\n\n _tokenApprovals[tokenId] = to;\n emit Approval(owner, to, tokenId);\n }\n\n /**\n * @dev See {IERC721-getApproved}.\n */\n function getApproved(uint256 tokenId) public view override returns (address) {\n if (!_exists(tokenId)) revert ApprovalQueryForNonexistentToken();\n\n return _tokenApprovals[tokenId];\n }\n\n /**\n * @dev See {IERC721-setApprovalForAll}.\n */\n function setApprovalForAll(address operator, bool approved) public virtual override {\n if (operator == _msgSenderERC721A()) revert ApproveToCaller();\n\n _operatorApprovals[_msgSenderERC721A()][operator] = approved;\n emit ApprovalForAll(_msgSenderERC721A(), operator, approved);\n }\n\n /**\n * @dev See {IERC721-isApprovedForAll}.\n */\n function isApprovedForAll(address owner, address operator) public view virtual override returns (bool) {\n return _operatorApprovals[owner][operator];\n }\n\n /**\n * @dev See {IERC721-safeTransferFrom}.\n */\n function safeTransferFrom(\n address from,\n address to,\n uint256 tokenId\n ) public virtual override {\n safeTransferFrom(from, to, tokenId, '');\n }\n\n /**\n * @dev See {IERC721-safeTransferFrom}.\n */\n function safeTransferFrom(\n address from,\n address to,\n uint256 tokenId,\n bytes memory _data\n ) public virtual override {\n transferFrom(from, to, tokenId);\n if (to.code.length != 0)\n if (!_checkContractOnERC721Received(from, to, tokenId, _data)) {\n revert TransferToNonERC721ReceiverImplementer();\n }\n }\n\n /**\n * @dev Returns whether `tokenId` exists.\n *\n * Tokens can be managed by their owner or approved accounts via {approve} or {setApprovalForAll}.\n *\n * Tokens start existing when they are minted (`_mint`),\n */\n function _exists(uint256 tokenId) internal view returns (bool) {\n return\n _startTokenId() <= tokenId &&\n tokenId < _currentIndex && // If within bounds,\n _packedOwnerships[tokenId] & BITMASK_BURNED == 0; // and not burned.\n }\n\n /**\n * @dev Equivalent to `_safeMint(to, quantity, '')`.\n */\n function _safeMint(address to, uint256 quantity) internal {\n _safeMint(to, quantity, '');\n }\n\n /**\n * @dev Safely mints `quantity` tokens and transfers them to `to`.\n *\n * Requirements:\n *\n * - If `to` refers to a smart contract, it must implement\n * {IERC721Receiver-onERC721Received}, which is called for each safe transfer.\n * - `quantity` must be greater than 0.\n *\n * See {_mint}.\n *\n * Emits a {Transfer} event for each mint.\n */\n function _safeMint(\n address to,\n uint256 quantity,\n bytes memory _data\n ) internal {\n _mint(to, quantity);\n\n unchecked {\n if (to.code.length != 0) {\n uint256 end = _currentIndex;\n uint256 index = end - quantity;\n do {\n if (!_checkContractOnERC721Received(address(0), to, index++, _data)) {\n revert TransferToNonERC721ReceiverImplementer();\n }\n } while (index < end);\n // Reentrancy protection.\n if (_currentIndex != end) revert();\n }\n }\n }\n\n /**\n * @dev Mints `quantity` tokens and transfers them to `to`.\n *\n * Requirements:\n *\n * - `to` cannot be the zero address.\n * - `quantity` must be greater than 0.\n *\n * Emits a {Transfer} event for each mint.\n */\n function _mint(address to, uint256 quantity) internal {\n uint256 startTokenId = _currentIndex;\n if (to == address(0)) revert MintToZeroAddress();\n if (quantity == 0) revert MintZeroQuantity();\n\n _beforeTokenTransfers(address(0), to, startTokenId, quantity);\n\n // Overflows are incredibly unrealistic.\n // `balance` and `numberMinted` have a maximum limit of 2**64.\n // `tokenId` has a maximum limit of 2**256.\n unchecked {\n // Updates:\n // - `balance += quantity`.\n // - `numberMinted += quantity`.\n //\n // We can directly add to the `balance` and `numberMinted`.\n _packedAddressData[to] += quantity * ((1 << BITPOS_NUMBER_MINTED) | 1);\n\n // Updates:\n // - `address` to the owner.\n // - `startTimestamp` to the timestamp of minting.\n // - `burned` to `false`.\n // - `nextInitialized` to `quantity == 1`.\n _packedOwnerships[startTokenId] = _packOwnershipData(\n to,\n _nextInitializedFlag(quantity) | _nextExtraData(address(0), to, 0)\n );\n\n uint256 tokenId = startTokenId;\n uint256 end = startTokenId + quantity;\n do {\n emit Transfer(address(0), to, tokenId++);\n } while (tokenId < end);\n\n _currentIndex = end;\n }\n _afterTokenTransfers(address(0), to, startTokenId, quantity);\n }\n\n /**\n * @dev Mints `quantity` tokens and transfers them to `to`.\n *\n * This function is intended for efficient minting only during contract creation.\n *\n * It emits only one {ConsecutiveTransfer} as defined in\n * [ERC2309](https://eips.ethereum.org/EIPS/eip-2309),\n * instead of a sequence of {Transfer} event(s).\n *\n * Calling this function outside of contract creation WILL make your contract\n * non-compliant with the ERC721 standard.\n * For full ERC721 compliance, substituting ERC721 {Transfer} event(s) with the ERC2309\n * {ConsecutiveTransfer} event is only permissible during contract creation.\n *\n * Requirements:\n *\n * - `to` cannot be the zero address.\n * - `quantity` must be greater than 0.\n *\n * Emits a {ConsecutiveTransfer} event.\n */\n function _mintERC2309(address to, uint256 quantity) internal {\n uint256 startTokenId = _currentIndex;\n if (to == address(0)) revert MintToZeroAddress();\n if (quantity == 0) revert MintZeroQuantity();\n if (quantity > MAX_MINT_ERC2309_QUANTITY_LIMIT) revert MintERC2309QuantityExceedsLimit();\n\n _beforeTokenTransfers(address(0), to, startTokenId, quantity);\n\n // Overflows are unrealistic due to the above check for `quantity` to be below the limit.\n unchecked {\n // Updates:\n // - `balance += quantity`.\n // - `numberMinted += quantity`.\n //\n // We can directly add to the `balance` and `numberMinted`.\n _packedAddressData[to] += quantity * ((1 << BITPOS_NUMBER_MINTED) | 1);\n\n // Updates:\n // - `address` to the owner.\n // - `startTimestamp` to the timestamp of minting.\n // - `burned` to `false`.\n // - `nextInitialized` to `quantity == 1`.\n _packedOwnerships[startTokenId] = _packOwnershipData(\n to,\n _nextInitializedFlag(quantity) | _nextExtraData(address(0), to, 0)\n );\n\n emit ConsecutiveTransfer(startTokenId, startTokenId + quantity - 1, address(0), to);\n\n _currentIndex = startTokenId + quantity;\n }\n _afterTokenTransfers(address(0), to, startTokenId, quantity);\n }\n\n /**\n * @dev Returns the storage slot and value for the approved address of `tokenId`.\n */\n function _getApprovedAddress(uint256 tokenId)\n private\n view\n returns (uint256 approvedAddressSlot, address approvedAddress)\n {\n mapping(uint256 => address) storage tokenApprovalsPtr = _tokenApprovals;\n // The following is equivalent to `approvedAddress = _tokenApprovals[tokenId]`.\n assembly {\n // Compute the slot.\n mstore(0x00, tokenId)\n mstore(0x20, tokenApprovalsPtr.slot)\n approvedAddressSlot := keccak256(0x00, 0x40)\n // Load the slot's value from storage.\n approvedAddress := sload(approvedAddressSlot)\n }\n }\n\n /**\n * @dev Returns whether the `approvedAddress` is equals to `from` or `msgSender`.\n */\n function _isOwnerOrApproved(\n address approvedAddress,\n address from,\n address msgSender\n ) private pure returns (bool result) {\n assembly {\n // Mask `from` to the lower 160 bits, in case the upper bits somehow aren't clean.\n from := and(from, BITMASK_ADDRESS)\n // Mask `msgSender` to the lower 160 bits, in case the upper bits somehow aren't clean.\n msgSender := and(msgSender, BITMASK_ADDRESS)\n // `msgSender == from || msgSender == approvedAddress`.\n result := or(eq(msgSender, from), eq(msgSender, approvedAddress))\n }\n }\n\n /**\n * @dev Transfers `tokenId` from `from` to `to`.\n *\n * Requirements:\n *\n * - `to` cannot be the zero address.\n * - `tokenId` token must be owned by `from`.\n *\n * Emits a {Transfer} event.\n */\n function transferFrom(\n address from,\n address to,\n uint256 tokenId\n ) public virtual override {\n uint256 prevOwnershipPacked = _packedOwnershipOf(tokenId);\n\n if (address(uint160(prevOwnershipPacked)) != from) revert TransferFromIncorrectOwner();\n\n (uint256 approvedAddressSlot, address approvedAddress) = _getApprovedAddress(tokenId);\n\n // The nested ifs save around 20+ gas over a compound boolean condition.\n if (!_isOwnerOrApproved(approvedAddress, from, _msgSenderERC721A()))\n if (!isApprovedForAll(from, _msgSenderERC721A())) revert TransferCallerNotOwnerNorApproved();\n\n if (to == address(0)) revert TransferToZeroAddress();\n\n _beforeTokenTransfers(from, to, tokenId, 1);\n\n // Clear approvals from the previous owner.\n assembly {\n if approvedAddress {\n // This is equivalent to `delete _tokenApprovals[tokenId]`.\n sstore(approvedAddressSlot, 0)\n }\n }\n\n // Underflow of the sender's balance is impossible because we check for\n // ownership above and the recipient's balance can't realistically overflow.\n // Counter overflow is incredibly unrealistic as tokenId would have to be 2**256.\n unchecked {\n // We can directly increment and decrement the balances.\n --_packedAddressData[from]; // Updates: `balance -= 1`.\n ++_packedAddressData[to]; // Updates: `balance += 1`.\n\n // Updates:\n // - `address` to the next owner.\n // - `startTimestamp` to the timestamp of transfering.\n // - `burned` to `false`.\n // - `nextInitialized` to `true`.\n _packedOwnerships[tokenId] = _packOwnershipData(\n to,\n BITMASK_NEXT_INITIALIZED | _nextExtraData(from, to, prevOwnershipPacked)\n );\n\n // If the next slot may not have been initialized (i.e. `nextInitialized == false`) .\n if (prevOwnershipPacked & BITMASK_NEXT_INITIALIZED == 0) {\n uint256 nextTokenId = tokenId + 1;\n // If the next slot's address is zero and not burned (i.e. packed value is zero).\n if (_packedOwnerships[nextTokenId] == 0) {\n // If the next slot is within bounds.\n if (nextTokenId != _currentIndex) {\n // Initialize the next slot to maintain correctness for `ownerOf(tokenId + 1)`.\n _packedOwnerships[nextTokenId] = prevOwnershipPacked;\n }\n }\n }\n }\n\n emit Transfer(from, to, tokenId);\n _afterTokenTransfers(from, to, tokenId, 1);\n }\n\n /**\n * @dev Equivalent to `_burn(tokenId, false)`.\n */\n function _burn(uint256 tokenId) internal virtual {\n _burn(tokenId, false);\n }\n\n /**\n * @dev Destroys `tokenId`.\n * The approval is cleared when the token is burned.\n *\n * Requirements:\n *\n * - `tokenId` must exist.\n *\n * Emits a {Transfer} event.\n */\n function _burn(uint256 tokenId, bool approvalCheck) internal virtual {\n uint256 prevOwnershipPacked = _packedOwnershipOf(tokenId);\n\n address from = address(uint160(prevOwnershipPacked));\n\n (uint256 approvedAddressSlot, address approvedAddress) = _getApprovedAddress(tokenId);\n\n if (approvalCheck) {\n // The nested ifs save around 20+ gas over a compound boolean condition.\n if (!_isOwnerOrApproved(approvedAddress, from, _msgSenderERC721A()))\n if (!isApprovedForAll(from, _msgSenderERC721A())) revert TransferCallerNotOwnerNorApproved();\n }\n\n _beforeTokenTransfers(from, address(0), tokenId, 1);\n\n // Clear approvals from the previous owner.\n assembly {\n if approvedAddress {\n // This is equivalent to `delete _tokenApprovals[tokenId]`.\n sstore(approvedAddressSlot, 0)\n }\n }\n\n // Underflow of the sender's balance is impossible because we check for\n // ownership above and the recipient's balance can't realistically overflow.\n // Counter overflow is incredibly unrealistic as `tokenId` would have to be 2**256.\n unchecked {\n // Updates:\n // - `balance -= 1`.\n // - `numberBurned += 1`.\n //\n // We can directly decrement the balance, and increment the number burned.\n // This is equivalent to `packed -= 1; packed += 1 << BITPOS_NUMBER_BURNED;`.\n _packedAddressData[from] += (1 << BITPOS_NUMBER_BURNED) - 1;\n\n // Updates:\n // - `address` to the last owner.\n // - `startTimestamp` to the timestamp of burning.\n // - `burned` to `true`.\n // - `nextInitialized` to `true`.\n _packedOwnerships[tokenId] = _packOwnershipData(\n from,\n (BITMASK_BURNED | BITMASK_NEXT_INITIALIZED) | _nextExtraData(from, address(0), prevOwnershipPacked)\n );\n\n // If the next slot may not have been initialized (i.e. `nextInitialized == false`) .\n if (prevOwnershipPacked & BITMASK_NEXT_INITIALIZED == 0) {\n uint256 nextTokenId = tokenId + 1;\n // If the next slot's address is zero and not burned (i.e. packed value is zero).\n if (_packedOwnerships[nextTokenId] == 0) {\n // If the next slot is within bounds.\n if (nextTokenId != _currentIndex) {\n // Initialize the next slot to maintain correctness for `ownerOf(tokenId + 1)`.\n _packedOwnerships[nextTokenId] = prevOwnershipPacked;\n }\n }\n }\n }\n\n emit Transfer(from, address(0), tokenId);\n _afterTokenTransfers(from, address(0), tokenId, 1);\n\n // Overflow not possible, as _burnCounter cannot be exceed _currentIndex times.\n unchecked {\n _burnCounter++;\n }\n }\n\n /**\n * @dev Internal function to invoke {IERC721Receiver-onERC721Received} on a target contract.\n *\n * @param from address representing the previous owner of the given token ID\n * @param to target address that will receive the tokens\n * @param tokenId uint256 ID of the token to be transferred\n * @param _data bytes optional data to send along with the call\n * @return bool whether the call correctly returned the expected magic value\n */\n function _checkContractOnERC721Received(\n address from,\n address to,\n uint256 tokenId,\n bytes memory _data\n ) private returns (bool) {\n try ERC721A__IERC721Receiver(to).onERC721Received(_msgSenderERC721A(), from, tokenId, _data) returns (\n bytes4 retval\n ) {\n return retval == ERC721A__IERC721Receiver(to).onERC721Received.selector;\n } catch (bytes memory reason) {\n if (reason.length == 0) {\n revert TransferToNonERC721ReceiverImplementer();\n } else {\n assembly {\n revert(add(32, reason), mload(reason))\n }\n }\n }\n }\n\n /**\n * @dev Directly sets the extra data for the ownership data `index`.\n */\n function _setExtraDataAt(uint256 index, uint24 extraData) internal {\n uint256 packed = _packedOwnerships[index];\n if (packed == 0) revert OwnershipNotInitializedForExtraData();\n uint256 extraDataCasted;\n // Cast `extraData` with assembly to avoid redundant masking.\n assembly {\n extraDataCasted := extraData\n }\n packed = (packed & BITMASK_EXTRA_DATA_COMPLEMENT) | (extraDataCasted << BITPOS_EXTRA_DATA);\n _packedOwnerships[index] = packed;\n }\n\n /**\n * @dev Returns the next extra data for the packed ownership data.\n * The returned result is shifted into position.\n */\n function _nextExtraData(\n address from,\n address to,\n uint256 prevOwnershipPacked\n ) private view returns (uint256) {\n uint24 extraData = uint24(prevOwnershipPacked >> BITPOS_EXTRA_DATA);\n return uint256(_extraData(from, to, extraData)) << BITPOS_EXTRA_DATA;\n }\n\n /**\n * @dev Called during each token transfer to set the 24bit `extraData` field.\n * Intended to be overridden by the cosumer contract.\n *\n * `previousExtraData` - the value of `extraData` before transfer.\n *\n * Calling conditions:\n *\n * - When `from` and `to` are both non-zero, `from`'s `tokenId` will be\n * transferred to `to`.\n * - When `from` is zero, `tokenId` will be minted for `to`.\n * - When `to` is zero, `tokenId` will be burned by `from`.\n * - `from` and `to` are never both zero.\n */\n function _extraData(\n address from,\n address to,\n uint24 previousExtraData\n ) internal view virtual returns (uint24) {}\n\n /**\n * @dev Hook that is called before a set of serially-ordered token ids are about to be transferred.\n * This includes minting.\n * And also called before burning one token.\n *\n * startTokenId - the first token id to be transferred\n * quantity - the amount to be transferred\n *\n * Calling conditions:\n *\n * - When `from` and `to` are both non-zero, `from`'s `tokenId` will be\n * transferred to `to`.\n * - When `from` is zero, `tokenId` will be minted for `to`.\n * - When `to` is zero, `tokenId` will be burned by `from`.\n * - `from` and `to` are never both zero.\n */\n function _beforeTokenTransfers(\n address from,\n address to,\n uint256 startTokenId,\n uint256 quantity\n ) internal virtual {}\n\n /**\n * @dev Hook that is called after a set of serially-ordered token ids have been transferred.\n * This includes minting.\n * And also called after one token has been burned.\n *\n * startTokenId - the first token id to be transferred\n * quantity - the amount to be transferred\n *\n * Calling conditions:\n *\n * - When `from` and `to` are both non-zero, `from`'s `tokenId` has been\n * transferred to `to`.\n * - When `from` is zero, `tokenId` has been minted for `to`.\n * - When `to` is zero, `tokenId` has been burned by `from`.\n * - `from` and `to` are never both zero.\n */\n function _afterTokenTransfers(\n address from,\n address to,\n uint256 startTokenId,\n uint256 quantity\n ) internal virtual {}\n\n /**\n * @dev Returns the message sender (defaults to `msg.sender`).\n *\n * If you are writing GSN compatible contracts, you need to override this function.\n */\n function _msgSenderERC721A() internal view virtual returns (address) {\n return msg.sender;\n }\n\n /**\n * @dev Converts a `uint256` to its ASCII `string` decimal representation.\n */\n function _toString(uint256 value) internal pure returns (string memory ptr) {\n assembly {\n // The maximum value of a uint256 contains 78 digits (1 byte per digit),\n // but we allocate 128 bytes to keep the free memory pointer 32-byte word aliged.\n // We will need 1 32-byte word to store the length,\n // and 3 32-byte words to store a maximum of 78 digits. Total: 32 + 3 * 32 = 128.\n ptr := add(mload(0x40), 128)\n // Update the free memory pointer to allocate.\n mstore(0x40, ptr)\n\n // Cache the end of the memory to calculate the length later.\n let end := ptr\n\n // We write the string from the rightmost digit to the leftmost digit.\n // The following is essentially a do-while loop that also handles the zero case.\n // Costs a bit more than early returning for the zero case,\n // but cheaper in terms of deployment and overall runtime costs.\n for {\n // Initialize and perform the first pass without check.\n let temp := value\n // Move the pointer 1 byte leftwards to point to an empty character slot.\n ptr := sub(ptr, 1)\n // Write the character to the pointer. 48 is the ASCII index of '0'.\n mstore8(ptr, add(48, mod(temp, 10)))\n temp := div(temp, 10)\n } temp {\n // Keep dividing `temp` until zero.\n temp := div(temp, 10)\n } {\n // Body of the for loop.\n ptr := sub(ptr, 1)\n mstore8(ptr, add(48, mod(temp, 10)))\n }\n\n let length := sub(end, ptr)\n // Move the pointer 32 bytes leftwards to make room for the length.\n ptr := sub(ptr, 32)\n // Store the length.\n mstore(ptr, length)\n }\n }\n}\n"
},
"erc721a/contracts/IERC721A.sol": {
"content": "// SPDX-License-Identifier: MIT\n// ERC721A Contracts v4.1.0\n// Creator: Chiru Labs\n\npragma solidity ^0.8.4;\n\n/**\n * @dev Interface of an ERC721A compliant contract.\n */\ninterface IERC721A {\n /**\n * The caller must own the token or be an approved operator.\n */\n error ApprovalCallerNotOwnerNorApproved();\n\n /**\n * The token does not exist.\n */\n error ApprovalQueryForNonexistentToken();\n\n /**\n * The caller cannot approve to their own address.\n */\n error ApproveToCaller();\n\n /**\n * Cannot query the balance for the zero address.\n */\n error BalanceQueryForZeroAddress();\n\n /**\n * Cannot mint to the zero address.\n */\n error MintToZeroAddress();\n\n /**\n * The quantity of tokens minted must be more than zero.\n */\n error MintZeroQuantity();\n\n /**\n * The token does not exist.\n */\n error OwnerQueryForNonexistentToken();\n\n /**\n * The caller must own the token or be an approved operator.\n */\n error TransferCallerNotOwnerNorApproved();\n\n /**\n * The token must be owned by `from`.\n */\n error TransferFromIncorrectOwner();\n\n /**\n * Cannot safely transfer to a contract that does not implement the ERC721Receiver interface.\n */\n error TransferToNonERC721ReceiverImplementer();\n\n /**\n * Cannot transfer to the zero address.\n */\n error TransferToZeroAddress();\n\n /**\n * The token does not exist.\n */\n error URIQueryForNonexistentToken();\n\n /**\n * The `quantity` minted with ERC2309 exceeds the safety limit.\n */\n error MintERC2309QuantityExceedsLimit();\n\n /**\n * The `extraData` cannot be set on an unintialized ownership slot.\n */\n error OwnershipNotInitializedForExtraData();\n\n struct TokenOwnership {\n // The address of the owner.\n address addr;\n // Keeps track of the start time of ownership with minimal overhead for tokenomics.\n uint64 startTimestamp;\n // Whether the token has been burned.\n bool burned;\n // Arbitrary data similar to `startTimestamp` that can be set through `_extraData`.\n uint24 extraData;\n }\n\n /**\n * @dev Returns the total amount of tokens stored by the contract.\n *\n * Burned tokens are calculated here, use `_totalMinted()` if you want to count just minted tokens.\n */\n function totalSupply() external view returns (uint256);\n\n // ==============================\n // IERC165\n // ==============================\n\n /**\n * @dev Returns true if this contract implements the interface defined by\n * `interfaceId`. See the corresponding\n * https://eips.ethereum.org/EIPS/eip-165#how-interfaces-are-identified[EIP section]\n * to learn more about how these ids are created.\n *\n * This function call must use less than 30 000 gas.\n */\n function supportsInterface(bytes4 interfaceId) external view returns (bool);\n\n // ==============================\n // IERC721\n // ==============================\n\n /**\n * @dev Emitted when `tokenId` token is transferred from `from` to `to`.\n */\n event Transfer(address indexed from, address indexed to, uint256 indexed tokenId);\n\n /**\n * @dev Emitted when `owner` enables `approved` to manage the `tokenId` token.\n */\n event Approval(address indexed owner, address indexed approved, uint256 indexed tokenId);\n\n /**\n * @dev Emitted when `owner` enables or disables (`approved`) `operator` to manage all of its assets.\n */\n event ApprovalForAll(address indexed owner, address indexed operator, bool approved);\n\n /**\n * @dev Returns the number of tokens in ``owner``'s account.\n */\n function balanceOf(address owner) external view returns (uint256 balance);\n\n /**\n * @dev Returns the owner of the `tokenId` token.\n *\n * Requirements:\n *\n * - `tokenId` must exist.\n */\n function ownerOf(uint256 tokenId) external view returns (address owner);\n\n /**\n * @dev Safely transfers `tokenId` token from `from` to `to`.\n *\n * Requirements:\n *\n * - `from` cannot be the zero address.\n * - `to` cannot be the zero address.\n * - `tokenId` token must exist and be owned by `from`.\n * - If the caller is not `from`, it must be approved to move this token by either {approve} or {setApprovalForAll}.\n * - If `to` refers to a smart contract, it must implement {IERC721Receiver-onERC721Received}, which is called upon a safe transfer.\n *\n * Emits a {Transfer} event.\n */\n function safeTransferFrom(\n address from,\n address to,\n uint256 tokenId,\n bytes calldata data\n ) external;\n\n /**\n * @dev Safely transfers `tokenId` token from `from` to `to`, checking first that contract recipients\n * are aware of the ERC721 protocol to prevent tokens from being forever locked.\n *\n * Requirements:\n *\n * - `from` cannot be the zero address.\n * - `to` cannot be the zero address.\n * - `tokenId` token must exist and be owned by `from`.\n * - If the caller is not `from`, it must be have been allowed to move this token by either {approve} or {setApprovalForAll}.\n * - If `to` refers to a smart contract, it must implement {IERC721Receiver-onERC721Received}, which is called upon a safe transfer.\n *\n * Emits a {Transfer} event.\n */\n function safeTransferFrom(\n address from,\n address to,\n uint256 tokenId\n ) external;\n\n /**\n * @dev Transfers `tokenId` token from `from` to `to`.\n *\n * WARNING: Usage of this method is discouraged, use {safeTransferFrom} whenever possible.\n *\n * Requirements:\n *\n * - `from` cannot be the zero address.\n * - `to` cannot be the zero address.\n * - `tokenId` token must be owned by `from`.\n * - If the caller is not `from`, it must be approved to move this token by either {approve} or {setApprovalForAll}.\n *\n * Emits a {Transfer} event.\n */\n function transferFrom(\n address from,\n address to,\n uint256 tokenId\n ) external;\n\n /**\n * @dev Gives permission to `to` to transfer `tokenId` token to another account.\n * The approval is cleared when the token is transferred.\n *\n * Only a single account can be approved at a time, so approving the zero address clears previous approvals.\n *\n * Requirements:\n *\n * - The caller must own the token or be an approved operator.\n * - `tokenId` must exist.\n *\n * Emits an {Approval} event.\n */\n function approve(address to, uint256 tokenId) external;\n\n /**\n * @dev Approve or remove `operator` as an operator for the caller.\n * Operators can call {transferFrom} or {safeTransferFrom} for any token owned by the caller.\n *\n * Requirements:\n *\n * - The `operator` cannot be the caller.\n *\n * Emits an {ApprovalForAll} event.\n */\n function setApprovalForAll(address operator, bool _approved) external;\n\n /**\n * @dev Returns the account approved for `tokenId` token.\n *\n * Requirements:\n *\n * - `tokenId` must exist.\n */\n function getApproved(uint256 tokenId) external view returns (address operator);\n\n /**\n * @dev Returns if the `operator` is allowed to manage all of the assets of `owner`.\n *\n * See {setApprovalForAll}\n */\n function isApprovedForAll(address owner, address operator) external view returns (bool);\n\n // ==============================\n // IERC721Metadata\n // ==============================\n\n /**\n * @dev Returns the token collection name.\n */\n function name() external view returns (string memory);\n\n /**\n * @dev Returns the token collection symbol.\n */\n function symbol() external view returns (string memory);\n\n /**\n * @dev Returns the Uniform Resource Identifier (URI) for `tokenId` token.\n */\n function tokenURI(uint256 tokenId) external view returns (string memory);\n\n // ==============================\n // IERC2309\n // ==============================\n\n /**\n * @dev Emitted when tokens in `fromTokenId` to `toTokenId` (inclusive) is transferred from `from` to `to`,\n * as defined in the ERC2309 standard. See `_mintERC2309` for more details.\n */\n event ConsecutiveTransfer(uint256 indexed fromTokenId, uint256 toTokenId, address indexed from, address indexed to);\n}\n"
}
},
"settings": {
"outputSelection": {
"*": {
"*": [
"evm.bytecode",
"evm.deployedBytecode",
"devdoc",
"userdoc",
"metadata",
"abi"
]
}
},
"optimizer": {
"enabled": true,
"runs": 200
},
"metadata": {
"useLiteralContent": true
}
}
} |