ERC-721
Overview
Max Total Supply
1,213 MORTALS
Holders
144
Market
Volume (24H)
N/A
Min Price (24H)
N/A
Max Price (24H)
N/A
Other Info
Token Contract
Balance
9 MORTALSLoading...
Loading
Loading...
Loading
Loading...
Loading
# | Exchange | Pair | Price | 24H Volume | % Volume |
---|
This contract contains unverified libraries: ChainMortalsFactory
This contract may be a proxy contract. Click on More Options and select Is this a proxy? to confirm and enable the "Read as Proxy" & "Write as Proxy" tabs.
Contract Name:
ChainMortals
Compiler Version
v0.8.17+commit.8df45f5f
Optimization Enabled:
Yes with 200 runs
Other Settings:
default evmVersion
Contract Source Code (Solidity Standard Json-Input format)
// SPDX-License-Identifier: Unlicense pragma solidity ^0.8.4; import "erc721a/contracts/ERC721A.sol"; import "@openzeppelin/contracts/access/Ownable.sol"; import "@openzeppelin/contracts/security/ReentrancyGuard.sol"; import "./ChainmortalFactory.sol"; contract ChainMortals is ERC721A, Ownable, ReentrancyGuard { uint256 public price = 0.0032 ether; bool public forSale = false; uint256 supplyCap = 6000; mapping(uint256 => uint256) internal idToSeed; constructor() ERC721A("ChainMortals", "MORTALS") {} function mint(uint256 quantity) external payable { require(forSale, "ERROR: Mint not enabled"); require(quantity < 100, "ERROR: Mint limit Exceeds"); if(totalSupply() + quantity >= 1000){ require(msg.value >= price * quantity, "ERROR: insufficient balance"); } require( totalSupply() + quantity <= supplyCap, "ERORR: Supply cap reached" ); uint256 nextTokenId = _nextTokenId(); for (uint32 i; i < quantity; ) { idToSeed[nextTokenId] = generateSeed(nextTokenId); unchecked { ++nextTokenId; ++i; } } _mint(msg.sender, quantity); } function tokenURI( uint256 tokenId ) public view override returns (string memory) { require(_exists(tokenId), "ERROR: query for nonexistent token"); uint256 seed = idToSeed[tokenId]; return ChainMortalsFactory.art(seed, tokenId); } function toggleSale() external onlyOwner { forSale = true; } function changePrice(uint256 _newPrice) external onlyOwner { price = _newPrice; } function updateSeed(uint256 tokenId, uint256 seed) external onlyOwner { idToSeed[tokenId] = seed; } function generateSeed(uint256 tokenId) private view returns (uint256) { uint256 r = random(tokenId); uint256 topSeed = 100 * ((r % 7) + 10) + (((r >> 48) % 20) + 10); uint256 eyeSeed = 100 * (((r >> 96) % 6) + 10) + (((r >> 96) % 20) + 10); uint256 nodeSeed = 100 * (((r >> 144) % 7) + 10) + (((r >> 144) % 20) + 10); uint256 mouthSeed = 100 * (((r >> 192) % 2) + 10) + (((r >> 192) % 20) + 10); return 10000 * (10000 * (10000 * topSeed + eyeSeed) + nodeSeed) + mouthSeed; } function random( uint256 tokenId ) private view returns (uint256 pseudoRandomness) { pseudoRandomness = uint256( keccak256(abi.encodePacked(blockhash(block.number - 1), tokenId)) ); } function withdrawMoney() external onlyOwner nonReentrant { (bool success, ) = msg.sender.call{value: address(this).balance}(""); require(success, "Transfer failed."); } }
// 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 // OpenZeppelin Contracts (last updated v4.8.0) (security/ReentrancyGuard.sol) pragma solidity ^0.8.0; /** * @dev Contract module that helps prevent reentrant calls to a function. * * Inheriting from `ReentrancyGuard` will make the {nonReentrant} modifier * available, which can be applied to functions to make sure there are no nested * (reentrant) calls to them. * * Note that because there is a single `nonReentrant` guard, functions marked as * `nonReentrant` may not call one another. This can be worked around by making * those functions `private`, and then adding `external` `nonReentrant` entry * points to them. * * TIP: If you would like to learn more about reentrancy and alternative ways * to protect against it, check out our blog post * https://blog.openzeppelin.com/reentrancy-after-istanbul/[Reentrancy After Istanbul]. */ abstract contract ReentrancyGuard { // Booleans are more expensive than uint256 or any type that takes up a full // word because each write operation emits an extra SLOAD to first read the // slot's contents, replace the bits taken up by the boolean, and then write // back. This is the compiler's defense against contract upgrades and // pointer aliasing, and it cannot be disabled. // The values being non-zero value makes deployment a bit more expensive, // but in exchange the refund on every call to nonReentrant will be lower in // amount. Since refunds are capped to a percentage of the total // transaction's gas, it is best to keep them low in cases like this one, to // increase the likelihood of the full refund coming into effect. uint256 private constant _NOT_ENTERED = 1; uint256 private constant _ENTERED = 2; uint256 private _status; constructor() { _status = _NOT_ENTERED; } /** * @dev Prevents a contract from calling itself, directly or indirectly. * Calling a `nonReentrant` function from another `nonReentrant` * function is not supported. It is possible to prevent this from happening * by making the `nonReentrant` function external, and making it call a * `private` function that does the actual work. */ modifier nonReentrant() { _nonReentrantBefore(); _; _nonReentrantAfter(); } function _nonReentrantBefore() private { // On the first call to nonReentrant, _status will be _NOT_ENTERED require(_status != _ENTERED, "ReentrancyGuard: reentrant call"); // Any calls to nonReentrant after this point will fail _status = _ENTERED; } function _nonReentrantAfter() private { // By storing the original value once again, a refund is triggered (see // https://eips.ethereum.org/EIPS/eip-2200) _status = _NOT_ENTERED; } }
// 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; } }
// 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 (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 pragma solidity ^0.8.0; import "@openzeppelin/contracts/utils/Strings.sol"; library Base64 { string internal constant TABLE_ENCODE = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"; bytes internal constant TABLE_DECODE = hex"0000000000000000000000000000000000000000000000000000000000000000" hex"00000000000000000000003e0000003f3435363738393a3b3c3d000000000000" hex"00000102030405060708090a0b0c0d0e0f101112131415161718190000000000" hex"001a1b1c1d1e1f202122232425262728292a2b2c2d2e2f303132330000000000"; function encode(bytes memory data) internal pure returns (string memory) { if (data.length == 0) return ""; // load the table into memory string memory table = TABLE_ENCODE; // multiply by 4/3 rounded up uint256 encodedLen = 4 * ((data.length + 2) / 3); // add some extra buffer at the end required for the writing string memory result = new string(encodedLen + 32); assembly { // set the actual output length mstore(result, encodedLen) // prepare the lookup table let tablePtr := add(table, 1) // input ptr let dataPtr := data let endPtr := add(dataPtr, mload(data)) // result ptr, jump over length let resultPtr := add(result, 32) // run over the input, 3 bytes at a time for { } lt(dataPtr, endPtr) { } { // read 3 bytes dataPtr := add(dataPtr, 3) let input := mload(dataPtr) // write 4 characters mstore8( resultPtr, mload(add(tablePtr, and(shr(18, input), 0x3F))) ) resultPtr := add(resultPtr, 1) mstore8( resultPtr, mload(add(tablePtr, and(shr(12, input), 0x3F))) ) resultPtr := add(resultPtr, 1) mstore8( resultPtr, mload(add(tablePtr, and(shr(6, input), 0x3F))) ) resultPtr := add(resultPtr, 1) mstore8(resultPtr, mload(add(tablePtr, and(input, 0x3F)))) resultPtr := add(resultPtr, 1) } // padding with '=' switch mod(mload(data), 3) case 1 { mstore(sub(resultPtr, 2), shl(240, 0x3d3d)) } case 2 { mstore(sub(resultPtr, 1), shl(248, 0x3d)) } } return result; } function decode(string memory _data) internal pure returns (bytes memory) { bytes memory data = bytes(_data); if (data.length == 0) return new bytes(0); require(data.length % 4 == 0, "invalid base64 decoder input"); // load the table into memory bytes memory table = TABLE_DECODE; // every 4 characters represent 3 bytes uint256 decodedLen = (data.length / 4) * 3; // add some extra buffer at the end required for the writing bytes memory result = new bytes(decodedLen + 32); assembly { // padding with '=' let lastBytes := mload(add(data, mload(data))) if eq(and(lastBytes, 0xFF), 0x3d) { decodedLen := sub(decodedLen, 1) if eq(and(lastBytes, 0xFFFF), 0x3d3d) { decodedLen := sub(decodedLen, 1) } } // set the actual output length mstore(result, decodedLen) // prepare the lookup table let tablePtr := add(table, 1) // input ptr let dataPtr := data let endPtr := add(dataPtr, mload(data)) // result ptr, jump over length let resultPtr := add(result, 32) // run over the input, 4 characters at a time for { } lt(dataPtr, endPtr) { } { // read 4 characters dataPtr := add(dataPtr, 4) let input := mload(dataPtr) // write 3 bytes let output := add( add( shl( 18, and( mload(add(tablePtr, and(shr(24, input), 0xFF))), 0xFF ) ), shl( 12, and( mload(add(tablePtr, and(shr(16, input), 0xFF))), 0xFF ) ) ), add( shl( 6, and( mload(add(tablePtr, and(shr(8, input), 0xFF))), 0xFF ) ), and(mload(add(tablePtr, and(input, 0xFF))), 0xFF) ) ) mstore(resultPtr, shl(232, output)) resultPtr := add(resultPtr, 3) } } return result; } } library ChainMortalsFactory { using Strings for uint256; string private constant SVG_END_TAG = "</svg>"; function charcterType(uint256 _seed) public pure returns (string memory) { uint256 rand = uint256(keccak256(abi.encodePacked(_seed))) % 1e18; uint256 id = ((rand / 1e16) % 1e2) % 10; if (id == 0) { return "Face0"; } else if (id == 1) { return "Face1"; } else if (id == 2) { return "Face2"; } else if (id == 3) { return "Face3"; } else if (id == 4) { return "Face4"; } else if (id == 5) { return "Face5"; } else if (id == 6) { return "Face6"; } else if (id == 7) { return "Face7"; } else if (id == 8) { return "Face8"; } else if (id == 9) { return "Face9"; } else { return string(abi.encodePacked("ERROR")); } } function art(uint256 _seed,uint256 _tokenId) public pure returns (string memory) { uint256 characterDNA = uint256(keccak256(abi.encodePacked(_seed))) % 1e18; uint256 colorGene = ((characterDNA / 1e12) % 1e2) % 13; string[4][13] memory colors = [ [ unicode"#5f005f", unicode"#5f0087", unicode"#5f00af", unicode"#5f00d7" ], [ unicode"#af005f", unicode"#af0087", unicode"#af00af", unicode"#af00d7" ], [unicode"#FFF", unicode"#FFF", unicode"#FFF", unicode"#FFF"], [ unicode"#ff005f", unicode"#ff0087", unicode"#ff00af", unicode"#ff00d7" ], [ unicode"#ff5f00", unicode"#ff5f5f", unicode"#ff5f87", unicode"#ff5faf" ], [ unicode"#ff875f", unicode"#ff8787", unicode"#ff87af", unicode"#ff87d7" ], [unicode"#FFF", unicode"#FFF", unicode"#FFF", unicode"#FFF"], [ unicode"#0087ff", unicode"#5f87ff", unicode"#8787ff", unicode"#af87ff" ], [ unicode"#00af00", unicode"#5faf00", unicode"#87af00", unicode"#afaf00" ], [unicode"#FFF", unicode"#FFF", unicode"#FFF", unicode"#FFF"], [ unicode"#00ffff", unicode"#5fffff", unicode"#87ffff", unicode"#afffff" ], [ unicode"#00d7ff", unicode"#5fd7ff", unicode"#87d7ff", unicode"#afd7ff" ], [ unicode"#00ff5f", unicode"#5fff5f", unicode"#87ff5f", unicode"#afff5f" ] ]; string memory hair = _chooseTops(characterDNA, colors[colorGene][0]); string memory brows = _chooseEyeBrows(characterDNA); string memory eyes = _chooseEyes(characterDNA); string memory nose = _chooseNose(characterDNA, colors[colorGene][3]); string memory mouth = _chooseMouth(characterDNA, colors[colorGene][3]); string memory rawSvg = string( abi.encodePacked( '<svg width="320" height="320" viewBox="0 0 320 320" xmlns="http://www.w3.org/2000/svg">', '<rect width="100%" height="100%" fill="#121212"/>', '<text x="160" y="80" font-family="Courier,monospace" font-weight="700" font-size="20" text-anchor="middle" letter-spacing="1">', hair, string( abi.encodePacked( '<tspan dy="20" x="160" fill="', colors[colorGene][1], '">', brows, "</tspan>" ) ), string( abi.encodePacked( '<tspan dy="25" x="160" fill="', colors[colorGene][2], '">', eyes, "</tspan>" ) ), nose, mouth, "</text>", SVG_END_TAG ) ); string memory encodedSvg = Base64.encode(bytes(rawSvg)); string memory description = "ChainMortals"; return string( abi.encodePacked( "data:application/json;base64,", Base64.encode( bytes( abi.encodePacked( "{", '"name":"ChainMortals #', _tokenId.toString(), '",', '"description":"', description, '",', '"image": "', "data:image/svg+xml;base64,", encodedSvg, '"', "}" ) ) ) ) ); } function _chooseTops( uint256 characterDNA, string memory _color ) internal pure returns (string memory) { string[27] memory hairs = [ string( abi.encodePacked( '<tspan fill="', _color, '">', unicode" ", "</tspan>", '<tspan dy="20" x="160" fill="', _color, '">', "_______", "</tspan>" ) ), string( abi.encodePacked( '<tspan fill="', _color, '">', unicode" ", "</tspan>", '<tspan dy="20" x="160" fill="', _color, '">', "///////", "</tspan>" ) ), string( abi.encodePacked( '<tspan fill="', _color, '">', unicode" ", "</tspan>", '<tspan dy="20" x="160" fill="', _color, '">', "!!!!!!!", "</tspan>" ) ), string( abi.encodePacked( '<tspan fill="', _color, '">', unicode" ", "</tspan>", '<tspan dy="20" x="160" fill="', _color, '">', unicode"║║║║║║║", "</tspan>" ) ), string( abi.encodePacked( '<tspan fill="', _color, '">', unicode" ", "</tspan>", '<tspan dy="20" x="160" fill="', _color, '">', unicode"▄▄▄▄▄▄▄", "</tspan>" ) ), string( abi.encodePacked( '<tspan fill="', _color, '">', unicode" ", "</tspan>", '<tspan dy="20" x="160" fill="', _color, '">', unicode"███████", "</tspan>" ) ), string( abi.encodePacked( '<tspan fill="', _color, '">', unicode"┌─────┐", "</tspan>", '<tspan dy="20" x="160" fill="', _color, '">', unicode"│ │", "</tspan>", '<tspan dy="20" x="160" fill="', _color, '">', unicode"─┴─────┴─", "</tspan>" ) ), string( abi.encodePacked( '<tspan fill="', _color, '">', unicode"┌─────┐", "</tspan>", '<tspan dy="20" x="160" fill="', _color, '">', unicode"├─────│", "</tspan>", '<tspan dy="20" x="160" fill="', _color, '">', unicode"─┴─────┴─", "</tspan>" ) ), string( abi.encodePacked( '<tspan fill="', _color, '">', unicode"┌▄▄▄▄▄┐", "</tspan>", '<tspan dy="20" x="160" fill="', _color, '">', unicode"├─────┤", "</tspan>", '<tspan dy="20" x="160" fill="', _color, '">', unicode"─┴─────┴─", "</tspan>" ) ), string( abi.encodePacked( '<tspan fill="', _color, '">', unicode"┌─────┐", "</tspan>", '<tspan dy="20" x="160" fill="', _color, '">', unicode"├─────┤", "</tspan>", '<tspan dy="20" x="160" fill="', _color, '">', unicode"─┴▀▀▀▀▀┴─", "</tspan>" ) ), string( abi.encodePacked( '<tspan fill="', _color, '">', unicode"┌▄▄▄▄▄┐", "</tspan>", '<tspan dy="20" x="160" fill="', _color, '">', unicode"├─────┤", "</tspan>", '<tspan dy="20" x="160" fill="', _color, '">', unicode"─┴▀▀▀▀▀┴─", "</tspan>" ) ), string( abi.encodePacked( '<tspan fill="', _color, '">', unicode"┌▄▄▄▄▄┐", "</tspan>", '<tspan dy="20" x="160" fill="', _color, '">', unicode"├█████┤", "</tspan>", '<tspan dy="20" x="160" fill="', _color, '">', unicode"─┴▀▀▀▀▀┴─", "</tspan>" ) ), string( abi.encodePacked( '<tspan fill="', _color, '">', unicode"┌─────┐", "</tspan>", '<tspan dy="20" x="160" fill="', _color, '">', unicode"│ │", "</tspan>", '<tspan dy="20" x="160" fill="', _color, '">', unicode"─┴▀▀▀▀▀┴─", "</tspan>" ) ), string( abi.encodePacked( '<tspan fill="', _color, '">', unicode" ", "</tspan>", '<tspan dy="20" x="160" fill="', _color, '">', unicode"┌─────┐", "</tspan>", '<tspan dy="20" x="160" fill="', _color, '">', unicode"─┴─────┴─", "</tspan>" ) ), string( abi.encodePacked( '<tspan fill="', _color, '">', unicode" ", "</tspan>", '<tspan dy="20" x="160" fill="', _color, '">', unicode"┌─────┐", "</tspan>", '<tspan dy="20" x="160" fill="', _color, '">', unicode"─┴▀▀▀▀▀┴─", "</tspan>" ) ), string( abi.encodePacked( '<tspan fill="', _color, '">', unicode" ", "</tspan>", '<tspan dy="20" x="160" fill="', _color, '">', unicode" /███ ", "</tspan>", '<tspan dy="20" x="160" fill="', _color, '">', unicode"─┴▀▀▀▀▀┴─", "</tspan>" ) ), string( abi.encodePacked( '<tspan fill="', _color, '">', unicode" ", "</tspan>", '<tspan dy="20" x="160" fill="', _color, '">', unicode" /▓▓▓ ", "</tspan>", '<tspan dy="20" x="160" fill="', _color, '">', unicode"─┴▀▀▀▀▀┴─", "</tspan>" ) ), string( abi.encodePacked( '<tspan fill="', _color, '">', unicode" ", "</tspan>", '<tspan dy="20" x="160" fill="', _color, '">', unicode" ┌───┐ ", "</tspan>", '<tspan dy="20" x="160" fill="', _color, '">', unicode"└─┴─────┴──", "</tspan>" ) ), string( abi.encodePacked( '<tspan fill="', _color, '">', unicode" ", "</tspan>", '<tspan dy="20" x="160" fill="', _color, '">', unicode" ┌───┐/'", "</tspan>", '<tspan dy="20" x="160" fill="', _color, '">', unicode"└─┴─────┴──", "</tspan>" ) ), string( abi.encodePacked( '<tspan fill="', _color, '">', unicode" ", "</tspan>", '<tspan dy="20" x="160" fill="', _color, '">', unicode" .▄▄▄.", "</tspan>", '<tspan dy="20" x="160" fill="', _color, '">', unicode"└─┴▀▀▀▀▀┴──", "</tspan>" ) ), string( abi.encodePacked( '<tspan fill="', _color, '">', unicode" ,/", "</tspan>", '<tspan dy="20" x="160" fill="', _color, '">', unicode".▄▄▄./'", "</tspan>", '<tspan dy="20" x="160" fill="', _color, '">', unicode"└─┴▀▀▀▀▀┴──", "</tspan>" ) ), string( abi.encodePacked( '<tspan fill="', _color, '">', unicode" ", "</tspan>", '<tspan dy="20" x="160" fill="', _color, '">', unicode" /ˇˇˇ ", "</tspan>", '<tspan dy="20" x="160" fill="', _color, '">', unicode"┴─────┴", "</tspan>" ) ), string( abi.encodePacked( '<tspan fill="', _color, '">', unicode"┌─────┐", "</tspan>", '<tspan dy="20" x="160" fill="', _color, '">', unicode"┌┴─────┴┐", "</tspan>", '<tspan dy="20" x="160" fill="', _color, '">', unicode"└───────┘", "</tspan>" ) ), string( abi.encodePacked( '<tspan fill="', _color, '">', unicode" ", "</tspan>", '<tspan dy="20" x="160" fill="', _color, '">', unicode"┌─────┐", "</tspan>", '<tspan dy="20" x="160" fill="', _color, '">', unicode"|░░░░░░░|", "</tspan>" ) ), string( abi.encodePacked( '<tspan fill="', _color, '">', unicode" ,.O., ", "</tspan>", '<tspan dy="20" x="160" fill="', _color, '">', unicode" /»»»»» ", "</tspan>", '<tspan dy="20" x="160" fill="', _color, '">', unicode"/«««««««", "</tspan>" ) ), string( abi.encodePacked( '<tspan fill="', _color, '">', unicode" ,.O.,", "</tspan>", '<tspan dy="20" x="160" fill="', _color, '">', unicode"/AAAAA", "</tspan>", '<tspan dy="20" x="160" fill="', _color, '">', unicode"/VVVVVVV", "</tspan>" ) ), string( abi.encodePacked( '<tspan fill="', _color, '">', unicode" ,.O.,", "</tspan>", '<tspan dy="20" x="160" fill="', _color, '">', unicode"/WWWWW", "</tspan>", '<tspan dy="20" x="160" fill="', _color, '">', unicode"/MMMMMMM", "</tspan>" ) ) ]; uint256 topsGene = ((characterDNA / 1e8) % 1e2) % 27; return string(abi.encodePacked(hairs[topsGene])); } function _chooseEyeBrows( uint256 characterDNA ) internal pure returns (string memory) { uint256 id = ((characterDNA / 1e16) % 1e2) % 10; uint256 browsGene = ((characterDNA / 1e6) % 1e2) % 3; string[3] memory brows = [unicode"_", unicode"~", unicode"¬"]; string memory leftBrow = brows[browsGene]; string memory rightBrow = brows[browsGene]; if (id == 0) { return string( abi.encodePacked("# ", leftBrow, " ", rightBrow, " #") ); } else if (id == 1) { return string( abi.encodePacked("! ", leftBrow, " ", rightBrow, " !") ); } else if (id == 2) { return string( abi.encodePacked("| ", leftBrow, " ", rightBrow, " |") ); } else if (id == 3) { return string( abi.encodePacked("{ ", leftBrow, " ", rightBrow, " }") ); } else if (id == 4) { return string( abi.encodePacked( unicode"║ ", leftBrow, " ", rightBrow, unicode" ║" ) ); } else if (id == 5) { return string( abi.encodePacked( unicode"# ", leftBrow, " ", rightBrow, unicode" #" ) ); } else if (id == 6) { return string( abi.encodePacked( unicode") ", leftBrow, " ", rightBrow, unicode" )" ) ); } else if (id == 7) { return string( abi.encodePacked("(# ", leftBrow, " ", rightBrow, " #)") ); } else if (id == 8) { return string( abi.encodePacked( unicode"| ", leftBrow, " ", rightBrow, unicode" |" ) ); } else if (id == 9) { return string( abi.encodePacked( unicode"| ", leftBrow, " ", rightBrow, unicode" |" ) ); } else { return string(abi.encodePacked("ERROR")); } } function _chooseEyes( uint256 characterDNA ) internal pure returns (string memory) { uint256 id = ((characterDNA / 1e16) % 1e2) % 10; uint256 eyeGene = ((characterDNA / 1e4) % 1e2) % 22; uint256 isEyeOrGlassGene = ((characterDNA / 1e10) % 1e2) % 2; if (isEyeOrGlassGene % 2 == 0 && id != 9) { return _chooseGlasses(characterDNA, id); } string[22] memory Eyes = [ unicode"0", unicode"9", unicode"o", unicode"O", unicode"p", unicode"P", unicode"q", unicode"°", unicode"Q", unicode"Ö", unicode"ö", unicode"ó", unicode"Ô", unicode"■", unicode"Ó", unicode"Ő", unicode"ő", unicode"○", unicode"╬", unicode"♥", unicode"¤", unicode"đ" ]; string memory leftEye = Eyes[eyeGene]; string memory rightEye = Eyes[eyeGene]; if (id == 0) { return string( abi.encodePacked("d| ", leftEye, " ", rightEye, " |b") ); } else if (id == 1) { return string( abi.encodePacked( unicode"«│ ", leftEye, " ", rightEye, unicode" │»" ) ); } else if (id == 2) { return string(abi.encodePacked("( ", leftEye, " ", rightEye, " )")); } else if (id == 3) { return string( abi.encodePacked("d| ", leftEye, " ", rightEye, " |b") ); } else if (id == 4) { return string( abi.encodePacked( unicode"d║ ", leftEye, " ", rightEye, unicode" ║b" ) ); } else if (id == 5) { return string( abi.encodePacked( unicode"d| ", leftEye, " ", rightEye, unicode" |b" ) ); } else if (id == 6) { return string( abi.encodePacked( unicode"( ", leftEye, " ", rightEye, unicode" (" ) ); } else if (id == 7) { return string( abi.encodePacked( unicode"@| ", leftEye, " ", rightEye, unicode" |@" ) ); } else if (id == 8) { return string( abi.encodePacked( unicode"|\\| ", leftEye, " ", rightEye, unicode" |/|" ) ); } else if (id == 9) { return string( abi.encodePacked( unicode"\\ (", leftEye, " ", rightEye, unicode") /" ) ); } else { return string(abi.encodePacked("ERROR")); } } function _chooseNose( uint256 characterDNA, string memory _color ) internal pure returns (string memory) { uint256 id = ((characterDNA / 1e16) % 1e2) % 10; uint256 noseGene = characterDNA % 13; string[13] memory noses = [ ">", "V", "v", "u", "c", "C", unicode"┴", "L", unicode"Ł", unicode"└", unicode"┘", unicode"╚", unicode"╝" ]; if (id == 0) { return string( abi.encodePacked( '<tspan dy="25" x="160" fill="', _color, '">', "( ", noses[noseGene], " )", "</tspan>" ) ); } else if (id == 1) { return string( abi.encodePacked( '<tspan dy="25" x="160" fill="', _color, '">', "\\ ", noses[noseGene], " /", "</tspan>" ) ); } else if (id == 2) { return string( abi.encodePacked( '<tspan dy="25" x="160" fill="', _color, '">', "( ", noses[noseGene], " )", "</tspan>" ) ); } else if (id == 3) { return string( abi.encodePacked( '<tspan dy="25" x="160" fill="', _color, '">', "\\ ", noses[noseGene], " /", "</tspan>" ) ); } else if (id == 4) { return string( abi.encodePacked( '<tspan dy="25" x="160" fill="', _color, '">', unicode"║ ", noses[noseGene], unicode" ║", "</tspan>" ) ); } else if (id == 5) { return string( abi.encodePacked( '<tspan dy="25" x="160" fill="', _color, '">', unicode"( ", noses[noseGene], unicode" )", "</tspan>" ) ); } else if (id == 6) { return string( abi.encodePacked( '<tspan dy="25" x="160" fill="', _color, '">', unicode") ", noses[noseGene], unicode" )", "</tspan>" ) ); } else if (id == 7) { return string( abi.encodePacked( '<tspan dy="25" x="160" fill="', _color, '">', "(/ ", noses[noseGene], " \\)", "</tspan>" ) ); } else if (id == 8) { return string( abi.encodePacked( '<tspan dy="25" x="160" fill="', _color, '">', unicode"\\│ ", noses[noseGene], unicode" │/", "</tspan>" ) ); } else if (id == 9) { return string( abi.encodePacked( '<tspan dy="25" x="160" fill="', _color, '">', "'. /V\\ ,'", "</tspan>" ) ); } else { return string(abi.encodePacked("ERROR")); } } function _chooseMouth( uint256 characterDNA, string memory _color ) internal pure returns (string memory) { uint256 id = ((characterDNA / 1e16) % 1e2) % 10; uint256 mouthGene = ((characterDNA / 1e0) % 1e2) % 5; string[5] memory mouths = [ unicode"---", unicode"___", unicode"===", unicode"~~~", unicode"═══" ]; if (id == 0) { return string( abi.encodePacked( '<tspan dy="25" x="160" fill="', _color, '">', ") ", mouths[mouthGene], " (", "</tspan>", '<tspan dy="25" x="160" fill="', _color, '">', unicode"(_____)", "</tspan>" ) ); } else if (id == 1) { return string( abi.encodePacked( '<tspan dy="25" x="160" fill="', _color, '">', unicode"├ ", mouths[mouthGene], unicode" ┤", "</tspan>", '<tspan dy="25" x="160" fill=" ', _color, '">', unicode"'───'", "</tspan>" ) ); } else if (id == 2) { return string( abi.encodePacked( '<tspan dy="25" x="160" fill="', _color, '">', unicode"\\ ", mouths[mouthGene], unicode" /", "</tspan>", '<tspan dy="25" x="160" fill="', _color, '">', unicode"\\ˍˍˍ/", "</tspan>" ) ); } else if (id == 3) { return string( abi.encodePacked( '<tspan dy="25" x="160" fill="', _color, '">', unicode"{ ", mouths[mouthGene], unicode" }", "</tspan>", '<tspan dy="25" x="160" fill="', _color, '">', unicode"└~~~┘", "</tspan>" ) ); } else if (id == 4) { return string( abi.encodePacked( '<tspan dy="25" x="160" fill="', _color, '">', unicode"╚╗ ", mouths[mouthGene], unicode" ╔╝", "</tspan>", '<tspan dy="25" x="160" fill="', _color, '">', unicode"╚═════╝", "</tspan>" ) ); } else if (id == 5) { return string( abi.encodePacked( '<tspan dy="25" x="160" fill="', _color, '">', unicode"|\\ ", mouths[mouthGene], unicode" /|", "</tspan>", '<tspan dy="25" x="160" fill="', _color, '">', unicode"\\_‿_/", "</tspan>" ) ); } else if (id == 6) { return string( abi.encodePacked( '<tspan dy="25" x="160" fill="', _color, '">', unicode"( ", mouths[mouthGene], unicode" (", "</tspan>", '<tspan dy="25" x="160" fill="', _color, '">', unicode"`─ ─ ─ ─´", "</tspan>" ) ); } else if (id == 7) { return string( abi.encodePacked( '<tspan dy="25" x="160" fill="', _color, '">', unicode"(| ", mouths[mouthGene], unicode" |)", "</tspan>", '<tspan dy="25" x="160" fill="', _color, '">', unicode"`─────´", "</tspan>" ) ); } else if (id == 8) { return string( abi.encodePacked( '<tspan dy="25" x="160" fill="', _color, '">', unicode"\\ ", mouths[mouthGene], unicode" /", "</tspan>", '<tspan dy="25" x="160" fill="', _color, '">', unicode"\\___/", "</tspan>" ) ); } else if (id == 9) { return string( abi.encodePacked( '<tspan dy="25" x="160" fill="', _color, '">', unicode"\\ ", mouths[mouthGene], unicode" /", "</tspan>", '<tspan dy="25" x="160" fill="', _color, '">', unicode"'---'", "</tspan>" ) ); } else { return string(abi.encodePacked("ERROR")); } } function _chooseGlasses( uint256 characterDNA, uint256 id ) internal pure returns (string memory) { uint256 glassesGene = ((characterDNA / 1e4) % 1e2) % 16; string[16] memory glasses = [ unicode"-O---O-", unicode"-O-_-O-", unicode"-┴┴-┴┴-", unicode"-┬┬-┬┬-", unicode"-▄---▄-", unicode"-▄-_-▄-", unicode"-▀---▀-", unicode"-▀-_-▀-", unicode"-█---█-", unicode"-█-_-█-", unicode"-▓---▓-", unicode"-▓-_-▓-", unicode"-▒---▒-", unicode"-▒-_-▒-", unicode"-░---░-", unicode"-░-_-░-" ]; string memory glass = glasses[glassesGene]; if (id == 0) { return string(abi.encodePacked(" d|", glass, "|b", unicode" \n")); } else if (id == 1) { return string(abi.encodePacked(unicode"«│", glass, unicode"│»")); } else if (id == 2) { return string(abi.encodePacked("(", glass, ")")); } else if (id == 3) { return string(abi.encodePacked("d|", glass, "|b")); } else if (id == 4) { return string(abi.encodePacked(unicode"d║", glass, unicode"║b")); } else if (id == 5) { return string(abi.encodePacked(unicode"d|", glass, unicode"|b")); } else if (id == 6) { return string(abi.encodePacked(unicode"(", glass, unicode"(")); } else if (id == 7) { return string(abi.encodePacked(unicode"@| ", glass, unicode" |@")); } else if (id == 8) { return string(abi.encodePacked(unicode"|\\| ", glass, unicode" |/|")); } else if (id == 9) { return string(abi.encodePacked(unicode"\\ ", glass, unicode" /")); } else { return string(abi.encodePacked("ERROR")); } } }
// SPDX-License-Identifier: MIT // ERC721A Contracts v4.2.3 // Creator: Chiru Labs pragma solidity ^0.8.4; import './IERC721A.sol'; /** * @dev Interface of ERC721 token receiver. */ interface ERC721A__IERC721Receiver { function onERC721Received( address operator, address from, uint256 tokenId, bytes calldata data ) external returns (bytes4); } /** * @title ERC721A * * @dev Implementation of the [ERC721](https://eips.ethereum.org/EIPS/eip-721) * Non-Fungible Token Standard, including the Metadata extension. * Optimized for lower gas during batch mints. * * Token IDs are minted in sequential order (e.g. 0, 1, 2, 3, ...) * starting from `_startTokenId()`. * * Assumptions: * * - An owner cannot have more than 2**64 - 1 (max value of uint64) of supply. * - The maximum token ID cannot exceed 2**256 - 1 (max value of uint256). */ contract ERC721A is IERC721A { // Bypass for a `--via-ir` bug (https://github.com/chiru-labs/ERC721A/pull/364). struct TokenApprovalRef { address value; } // ============================================================= // CONSTANTS // ============================================================= // Mask of an entry in packed address data. uint256 private constant _BITMASK_ADDRESS_DATA_ENTRY = (1 << 64) - 1; // The bit position of `numberMinted` in packed address data. uint256 private constant _BITPOS_NUMBER_MINTED = 64; // The bit position of `numberBurned` in packed address data. uint256 private constant _BITPOS_NUMBER_BURNED = 128; // The bit position of `aux` in packed address data. uint256 private constant _BITPOS_AUX = 192; // Mask of all 256 bits in packed address data except the 64 bits for `aux`. uint256 private constant _BITMASK_AUX_COMPLEMENT = (1 << 192) - 1; // The bit position of `startTimestamp` in packed ownership. uint256 private constant _BITPOS_START_TIMESTAMP = 160; // The bit mask of the `burned` bit in packed ownership. uint256 private constant _BITMASK_BURNED = 1 << 224; // The bit position of the `nextInitialized` bit in packed ownership. uint256 private constant _BITPOS_NEXT_INITIALIZED = 225; // The bit mask of the `nextInitialized` bit in packed ownership. uint256 private constant _BITMASK_NEXT_INITIALIZED = 1 << 225; // The bit position of `extraData` in packed ownership. uint256 private constant _BITPOS_EXTRA_DATA = 232; // Mask of all 256 bits in a packed ownership except the 24 bits for `extraData`. uint256 private constant _BITMASK_EXTRA_DATA_COMPLEMENT = (1 << 232) - 1; // The mask of the lower 160 bits for addresses. uint256 private constant _BITMASK_ADDRESS = (1 << 160) - 1; // The maximum `quantity` that can be minted with {_mintERC2309}. // This limit is to prevent overflows on the address data entries. // For a limit of 5000, a total of 3.689e15 calls to {_mintERC2309} // is required to cause an overflow, which is unrealistic. uint256 private constant _MAX_MINT_ERC2309_QUANTITY_LIMIT = 5000; // The `Transfer` event signature is given by: // `keccak256(bytes("Transfer(address,address,uint256)"))`. bytes32 private constant _TRANSFER_EVENT_SIGNATURE = 0xddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef; // ============================================================= // STORAGE // ============================================================= // The next token ID to be minted. uint256 private _currentIndex; // The number of tokens burned. uint256 private _burnCounter; // Token name string private _name; // Token symbol string private _symbol; // Mapping from token ID to ownership details // An empty struct value does not necessarily mean the token is unowned. // See {_packedOwnershipOf} implementation for details. // // Bits Layout: // - [0..159] `addr` // - [160..223] `startTimestamp` // - [224] `burned` // - [225] `nextInitialized` // - [232..255] `extraData` mapping(uint256 => uint256) private _packedOwnerships; // Mapping owner address to address data. // // Bits Layout: // - [0..63] `balance` // - [64..127] `numberMinted` // - [128..191] `numberBurned` // - [192..255] `aux` mapping(address => uint256) private _packedAddressData; // Mapping from token ID to approved address. mapping(uint256 => TokenApprovalRef) private _tokenApprovals; // Mapping from owner to operator approvals mapping(address => mapping(address => bool)) private _operatorApprovals; // ============================================================= // CONSTRUCTOR // ============================================================= constructor(string memory name_, string memory symbol_) { _name = name_; _symbol = symbol_; _currentIndex = _startTokenId(); } // ============================================================= // TOKEN COUNTING OPERATIONS // ============================================================= /** * @dev Returns the starting token ID. * To change the starting token ID, please override this function. */ function _startTokenId() internal view virtual returns (uint256) { return 0; } /** * @dev Returns the next token ID to be minted. */ function _nextTokenId() internal view virtual returns (uint256) { return _currentIndex; } /** * @dev Returns the total number of tokens in existence. * Burned tokens will reduce the count. * To get the total number of tokens minted, please see {_totalMinted}. */ function totalSupply() public view virtual override returns (uint256) { // Counter underflow is impossible as _burnCounter cannot be incremented // more than `_currentIndex - _startTokenId()` times. unchecked { return _currentIndex - _burnCounter - _startTokenId(); } } /** * @dev Returns the total amount of tokens minted in the contract. */ function _totalMinted() internal view virtual returns (uint256) { // Counter underflow is impossible as `_currentIndex` does not decrement, // and it is initialized to `_startTokenId()`. unchecked { return _currentIndex - _startTokenId(); } } /** * @dev Returns the total number of tokens burned. */ function _totalBurned() internal view virtual returns (uint256) { return _burnCounter; } // ============================================================= // ADDRESS DATA OPERATIONS // ============================================================= /** * @dev Returns the number of tokens in `owner`'s account. */ function balanceOf(address owner) public view virtual override returns (uint256) { if (owner == address(0)) revert BalanceQueryForZeroAddress(); return _packedAddressData[owner] & _BITMASK_ADDRESS_DATA_ENTRY; } /** * Returns the number of tokens minted by `owner`. */ function _numberMinted(address owner) internal view returns (uint256) { return (_packedAddressData[owner] >> _BITPOS_NUMBER_MINTED) & _BITMASK_ADDRESS_DATA_ENTRY; } /** * Returns the number of tokens burned by or on behalf of `owner`. */ function _numberBurned(address owner) internal view returns (uint256) { return (_packedAddressData[owner] >> _BITPOS_NUMBER_BURNED) & _BITMASK_ADDRESS_DATA_ENTRY; } /** * Returns the auxiliary data for `owner`. (e.g. number of whitelist mint slots used). */ function _getAux(address owner) internal view returns (uint64) { return uint64(_packedAddressData[owner] >> _BITPOS_AUX); } /** * Sets the auxiliary data for `owner`. (e.g. number of whitelist mint slots used). * If there are multiple variables, please pack them into a uint64. */ function _setAux(address owner, uint64 aux) internal virtual { uint256 packed = _packedAddressData[owner]; uint256 auxCasted; // Cast `aux` with assembly to avoid redundant masking. assembly { auxCasted := aux } packed = (packed & _BITMASK_AUX_COMPLEMENT) | (auxCasted << _BITPOS_AUX); _packedAddressData[owner] = packed; } // ============================================================= // IERC165 // ============================================================= /** * @dev Returns true if this contract implements the interface defined by * `interfaceId`. See the corresponding * [EIP section](https://eips.ethereum.org/EIPS/eip-165#how-interfaces-are-identified) * to learn more about how these ids are created. * * This function call must use less than 30000 gas. */ function supportsInterface(bytes4 interfaceId) public view virtual override returns (bool) { // The interface IDs are constants representing the first 4 bytes // of the XOR of all function selectors in the interface. // See: [ERC165](https://eips.ethereum.org/EIPS/eip-165) // (e.g. `bytes4(i.functionA.selector ^ i.functionB.selector ^ ...)`) return interfaceId == 0x01ffc9a7 || // ERC165 interface ID for ERC165. interfaceId == 0x80ac58cd || // ERC165 interface ID for ERC721. interfaceId == 0x5b5e139f; // ERC165 interface ID for ERC721Metadata. } // ============================================================= // IERC721Metadata // ============================================================= /** * @dev Returns the token collection name. */ function name() public view virtual override returns (string memory) { return _name; } /** * @dev Returns the token collection symbol. */ function symbol() public view virtual override returns (string memory) { return _symbol; } /** * @dev Returns the Uniform Resource Identifier (URI) for `tokenId` token. */ function tokenURI(uint256 tokenId) public view virtual override returns (string memory) { if (!_exists(tokenId)) revert URIQueryForNonexistentToken(); string memory baseURI = _baseURI(); return bytes(baseURI).length != 0 ? string(abi.encodePacked(baseURI, _toString(tokenId))) : ''; } /** * @dev Base URI for computing {tokenURI}. If set, the resulting URI for each * token will be the concatenation of the `baseURI` and the `tokenId`. Empty * by default, it can be overridden in child contracts. */ function _baseURI() internal view virtual returns (string memory) { return ''; } // ============================================================= // OWNERSHIPS OPERATIONS // ============================================================= /** * @dev Returns the owner of the `tokenId` token. * * Requirements: * * - `tokenId` must exist. */ function ownerOf(uint256 tokenId) public view virtual override returns (address) { return address(uint160(_packedOwnershipOf(tokenId))); } /** * @dev Gas spent here starts off proportional to the maximum mint batch size. * It gradually moves to O(1) as tokens get transferred around over time. */ function _ownershipOf(uint256 tokenId) internal view virtual returns (TokenOwnership memory) { return _unpackedOwnership(_packedOwnershipOf(tokenId)); } /** * @dev Returns the unpacked `TokenOwnership` struct at `index`. */ function _ownershipAt(uint256 index) internal view virtual returns (TokenOwnership memory) { return _unpackedOwnership(_packedOwnerships[index]); } /** * @dev Initializes the ownership slot minted at `index` for efficiency purposes. */ function _initializeOwnershipAt(uint256 index) internal virtual { if (_packedOwnerships[index] == 0) { _packedOwnerships[index] = _packedOwnershipOf(index); } } /** * Returns the packed ownership data of `tokenId`. */ function _packedOwnershipOf(uint256 tokenId) private view returns (uint256) { uint256 curr = tokenId; unchecked { if (_startTokenId() <= curr) if (curr < _currentIndex) { uint256 packed = _packedOwnerships[curr]; // If not burned. if (packed & _BITMASK_BURNED == 0) { // Invariant: // There will always be an initialized ownership slot // (i.e. `ownership.addr != address(0) && ownership.burned == false`) // before an unintialized ownership slot // (i.e. `ownership.addr == address(0) && ownership.burned == false`) // Hence, `curr` will not underflow. // // We can directly compare the packed value. // If the address is zero, packed will be zero. while (packed == 0) { packed = _packedOwnerships[--curr]; } return packed; } } } revert OwnerQueryForNonexistentToken(); } /** * @dev Returns the unpacked `TokenOwnership` struct from `packed`. */ function _unpackedOwnership(uint256 packed) private pure returns (TokenOwnership memory ownership) { ownership.addr = address(uint160(packed)); ownership.startTimestamp = uint64(packed >> _BITPOS_START_TIMESTAMP); ownership.burned = packed & _BITMASK_BURNED != 0; ownership.extraData = uint24(packed >> _BITPOS_EXTRA_DATA); } /** * @dev Packs ownership data into a single uint256. */ function _packOwnershipData(address owner, uint256 flags) private view returns (uint256 result) { assembly { // Mask `owner` to the lower 160 bits, in case the upper bits somehow aren't clean. owner := and(owner, _BITMASK_ADDRESS) // `owner | (block.timestamp << _BITPOS_START_TIMESTAMP) | flags`. result := or(owner, or(shl(_BITPOS_START_TIMESTAMP, timestamp()), flags)) } } /** * @dev Returns the `nextInitialized` flag set if `quantity` equals 1. */ function _nextInitializedFlag(uint256 quantity) private pure returns (uint256 result) { // For branchless setting of the `nextInitialized` flag. assembly { // `(quantity == 1) << _BITPOS_NEXT_INITIALIZED`. result := shl(_BITPOS_NEXT_INITIALIZED, eq(quantity, 1)) } } // ============================================================= // APPROVAL OPERATIONS // ============================================================= /** * @dev Gives permission to `to` to transfer `tokenId` token to another account. * The approval is cleared when the token is transferred. * * Only a single account can be approved at a time, so approving the * zero address clears previous approvals. * * Requirements: * * - The caller must own the token or be an approved operator. * - `tokenId` must exist. * * Emits an {Approval} event. */ function approve(address to, uint256 tokenId) public payable virtual override { address owner = ownerOf(tokenId); if (_msgSenderERC721A() != owner) if (!isApprovedForAll(owner, _msgSenderERC721A())) { revert ApprovalCallerNotOwnerNorApproved(); } _tokenApprovals[tokenId].value = to; emit Approval(owner, to, tokenId); } /** * @dev Returns the account approved for `tokenId` token. * * Requirements: * * - `tokenId` must exist. */ function getApproved(uint256 tokenId) public view virtual override returns (address) { if (!_exists(tokenId)) revert ApprovalQueryForNonexistentToken(); return _tokenApprovals[tokenId].value; } /** * @dev Approve or remove `operator` as an operator for the caller. * Operators can call {transferFrom} or {safeTransferFrom} * for any token owned by the caller. * * Requirements: * * - The `operator` cannot be the caller. * * Emits an {ApprovalForAll} event. */ function setApprovalForAll(address operator, bool approved) public virtual override { _operatorApprovals[_msgSenderERC721A()][operator] = approved; emit ApprovalForAll(_msgSenderERC721A(), operator, approved); } /** * @dev Returns if the `operator` is allowed to manage all of the assets of `owner`. * * See {setApprovalForAll}. */ function isApprovedForAll(address owner, address operator) public view virtual override returns (bool) { return _operatorApprovals[owner][operator]; } /** * @dev Returns whether `tokenId` exists. * * Tokens can be managed by their owner or approved accounts via {approve} or {setApprovalForAll}. * * Tokens start existing when they are minted. See {_mint}. */ function _exists(uint256 tokenId) internal view virtual returns (bool) { return _startTokenId() <= tokenId && tokenId < _currentIndex && // If within bounds, _packedOwnerships[tokenId] & _BITMASK_BURNED == 0; // and not burned. } /** * @dev Returns whether `msgSender` is equal to `approvedAddress` or `owner`. */ function _isSenderApprovedOrOwner( address approvedAddress, address owner, address msgSender ) private pure returns (bool result) { assembly { // Mask `owner` to the lower 160 bits, in case the upper bits somehow aren't clean. owner := and(owner, _BITMASK_ADDRESS) // Mask `msgSender` to the lower 160 bits, in case the upper bits somehow aren't clean. msgSender := and(msgSender, _BITMASK_ADDRESS) // `msgSender == owner || msgSender == approvedAddress`. result := or(eq(msgSender, owner), eq(msgSender, approvedAddress)) } } /** * @dev Returns the storage slot and value for the approved address of `tokenId`. */ function _getApprovedSlotAndAddress(uint256 tokenId) private view returns (uint256 approvedAddressSlot, address approvedAddress) { TokenApprovalRef storage tokenApproval = _tokenApprovals[tokenId]; // The following is equivalent to `approvedAddress = _tokenApprovals[tokenId].value`. assembly { approvedAddressSlot := tokenApproval.slot approvedAddress := sload(approvedAddressSlot) } } // ============================================================= // TRANSFER OPERATIONS // ============================================================= /** * @dev Transfers `tokenId` from `from` to `to`. * * Requirements: * * - `from` cannot be the zero address. * - `to` cannot be the zero address. * - `tokenId` token must be owned by `from`. * - If the caller is not `from`, it must be approved to move this token * by either {approve} or {setApprovalForAll}. * * Emits a {Transfer} event. */ function transferFrom( address from, address to, uint256 tokenId ) public payable virtual override { uint256 prevOwnershipPacked = _packedOwnershipOf(tokenId); if (address(uint160(prevOwnershipPacked)) != from) revert TransferFromIncorrectOwner(); (uint256 approvedAddressSlot, address approvedAddress) = _getApprovedSlotAndAddress(tokenId); // The nested ifs save around 20+ gas over a compound boolean condition. if (!_isSenderApprovedOrOwner(approvedAddress, from, _msgSenderERC721A())) if (!isApprovedForAll(from, _msgSenderERC721A())) revert TransferCallerNotOwnerNorApproved(); if (to == address(0)) revert TransferToZeroAddress(); _beforeTokenTransfers(from, to, tokenId, 1); // Clear approvals from the previous owner. assembly { if approvedAddress { // This is equivalent to `delete _tokenApprovals[tokenId]`. sstore(approvedAddressSlot, 0) } } // Underflow of the sender's balance is impossible because we check for // ownership above and the recipient's balance can't realistically overflow. // Counter overflow is incredibly unrealistic as `tokenId` would have to be 2**256. unchecked { // We can directly increment and decrement the balances. --_packedAddressData[from]; // Updates: `balance -= 1`. ++_packedAddressData[to]; // Updates: `balance += 1`. // Updates: // - `address` to the next owner. // - `startTimestamp` to the timestamp of transfering. // - `burned` to `false`. // - `nextInitialized` to `true`. _packedOwnerships[tokenId] = _packOwnershipData( to, _BITMASK_NEXT_INITIALIZED | _nextExtraData(from, to, prevOwnershipPacked) ); // If the next slot may not have been initialized (i.e. `nextInitialized == false`) . if (prevOwnershipPacked & _BITMASK_NEXT_INITIALIZED == 0) { uint256 nextTokenId = tokenId + 1; // If the next slot's address is zero and not burned (i.e. packed value is zero). if (_packedOwnerships[nextTokenId] == 0) { // If the next slot is within bounds. if (nextTokenId != _currentIndex) { // Initialize the next slot to maintain correctness for `ownerOf(tokenId + 1)`. _packedOwnerships[nextTokenId] = prevOwnershipPacked; } } } } emit Transfer(from, to, tokenId); _afterTokenTransfers(from, to, tokenId, 1); } /** * @dev Equivalent to `safeTransferFrom(from, to, tokenId, '')`. */ function safeTransferFrom( address from, address to, uint256 tokenId ) public payable virtual override { safeTransferFrom(from, to, tokenId, ''); } /** * @dev Safely transfers `tokenId` token from `from` to `to`. * * Requirements: * * - `from` cannot be the zero address. * - `to` cannot be the zero address. * - `tokenId` token must exist and be owned by `from`. * - If the caller is not `from`, it must be approved to move this token * by either {approve} or {setApprovalForAll}. * - If `to` refers to a smart contract, it must implement * {IERC721Receiver-onERC721Received}, which is called upon a safe transfer. * * Emits a {Transfer} event. */ function safeTransferFrom( address from, address to, uint256 tokenId, bytes memory _data ) public payable virtual override { transferFrom(from, to, tokenId); if (to.code.length != 0) if (!_checkContractOnERC721Received(from, to, tokenId, _data)) { revert TransferToNonERC721ReceiverImplementer(); } } /** * @dev Hook that is called before a set of serially-ordered token IDs * are about to be transferred. This includes minting. * And also called before burning one token. * * `startTokenId` - the first token ID to be transferred. * `quantity` - the amount to be transferred. * * Calling conditions: * * - When `from` and `to` are both non-zero, `from`'s `tokenId` will be * transferred to `to`. * - When `from` is zero, `tokenId` will be minted for `to`. * - When `to` is zero, `tokenId` will be burned by `from`. * - `from` and `to` are never both zero. */ function _beforeTokenTransfers( address from, address to, uint256 startTokenId, uint256 quantity ) internal virtual {} /** * @dev Hook that is called after a set of serially-ordered token IDs * have been transferred. This includes minting. * And also called after one token has been burned. * * `startTokenId` - the first token ID to be transferred. * `quantity` - the amount to be transferred. * * Calling conditions: * * - When `from` and `to` are both non-zero, `from`'s `tokenId` has been * transferred to `to`. * - When `from` is zero, `tokenId` has been minted for `to`. * - When `to` is zero, `tokenId` has been burned by `from`. * - `from` and `to` are never both zero. */ function _afterTokenTransfers( address from, address to, uint256 startTokenId, uint256 quantity ) internal virtual {} /** * @dev Private function to invoke {IERC721Receiver-onERC721Received} on a target contract. * * `from` - Previous owner of the given token ID. * `to` - Target address that will receive the token. * `tokenId` - Token ID to be transferred. * `_data` - Optional data to send along with the call. * * Returns whether the call correctly returned the expected magic value. */ function _checkContractOnERC721Received( address from, address to, uint256 tokenId, bytes memory _data ) private returns (bool) { try ERC721A__IERC721Receiver(to).onERC721Received(_msgSenderERC721A(), from, tokenId, _data) returns ( bytes4 retval ) { return retval == ERC721A__IERC721Receiver(to).onERC721Received.selector; } catch (bytes memory reason) { if (reason.length == 0) { revert TransferToNonERC721ReceiverImplementer(); } else { assembly { revert(add(32, reason), mload(reason)) } } } } // ============================================================= // MINT OPERATIONS // ============================================================= /** * @dev Mints `quantity` tokens and transfers them to `to`. * * Requirements: * * - `to` cannot be the zero address. * - `quantity` must be greater than 0. * * Emits a {Transfer} event for each mint. */ function _mint(address to, uint256 quantity) internal virtual { uint256 startTokenId = _currentIndex; if (quantity == 0) revert MintZeroQuantity(); _beforeTokenTransfers(address(0), to, startTokenId, quantity); // Overflows are incredibly unrealistic. // `balance` and `numberMinted` have a maximum limit of 2**64. // `tokenId` has a maximum limit of 2**256. unchecked { // Updates: // - `balance += quantity`. // - `numberMinted += quantity`. // // We can directly add to the `balance` and `numberMinted`. _packedAddressData[to] += quantity * ((1 << _BITPOS_NUMBER_MINTED) | 1); // Updates: // - `address` to the owner. // - `startTimestamp` to the timestamp of minting. // - `burned` to `false`. // - `nextInitialized` to `quantity == 1`. _packedOwnerships[startTokenId] = _packOwnershipData( to, _nextInitializedFlag(quantity) | _nextExtraData(address(0), to, 0) ); uint256 toMasked; uint256 end = startTokenId + quantity; // Use assembly to loop and emit the `Transfer` event for gas savings. // The duplicated `log4` removes an extra check and reduces stack juggling. // The assembly, together with the surrounding Solidity code, have been // delicately arranged to nudge the compiler into producing optimized opcodes. assembly { // Mask `to` to the lower 160 bits, in case the upper bits somehow aren't clean. toMasked := and(to, _BITMASK_ADDRESS) // Emit the `Transfer` event. log4( 0, // Start of data (0, since no data). 0, // End of data (0, since no data). _TRANSFER_EVENT_SIGNATURE, // Signature. 0, // `address(0)`. toMasked, // `to`. startTokenId // `tokenId`. ) // The `iszero(eq(,))` check ensures that large values of `quantity` // that overflows uint256 will make the loop run out of gas. // The compiler will optimize the `iszero` away for performance. for { let tokenId := add(startTokenId, 1) } iszero(eq(tokenId, end)) { tokenId := add(tokenId, 1) } { // Emit the `Transfer` event. Similar to above. log4(0, 0, _TRANSFER_EVENT_SIGNATURE, 0, toMasked, tokenId) } } if (toMasked == 0) revert MintToZeroAddress(); _currentIndex = end; } _afterTokenTransfers(address(0), to, startTokenId, quantity); } /** * @dev Mints `quantity` tokens and transfers them to `to`. * * This function is intended for efficient minting only during contract creation. * * It emits only one {ConsecutiveTransfer} as defined in * [ERC2309](https://eips.ethereum.org/EIPS/eip-2309), * instead of a sequence of {Transfer} event(s). * * Calling this function outside of contract creation WILL make your contract * non-compliant with the ERC721 standard. * For full ERC721 compliance, substituting ERC721 {Transfer} event(s) with the ERC2309 * {ConsecutiveTransfer} event is only permissible during contract creation. * * Requirements: * * - `to` cannot be the zero address. * - `quantity` must be greater than 0. * * Emits a {ConsecutiveTransfer} event. */ function _mintERC2309(address to, uint256 quantity) internal virtual { uint256 startTokenId = _currentIndex; if (to == address(0)) revert MintToZeroAddress(); if (quantity == 0) revert MintZeroQuantity(); if (quantity > _MAX_MINT_ERC2309_QUANTITY_LIMIT) revert MintERC2309QuantityExceedsLimit(); _beforeTokenTransfers(address(0), to, startTokenId, quantity); // Overflows are unrealistic due to the above check for `quantity` to be below the limit. unchecked { // Updates: // - `balance += quantity`. // - `numberMinted += quantity`. // // We can directly add to the `balance` and `numberMinted`. _packedAddressData[to] += quantity * ((1 << _BITPOS_NUMBER_MINTED) | 1); // Updates: // - `address` to the owner. // - `startTimestamp` to the timestamp of minting. // - `burned` to `false`. // - `nextInitialized` to `quantity == 1`. _packedOwnerships[startTokenId] = _packOwnershipData( to, _nextInitializedFlag(quantity) | _nextExtraData(address(0), to, 0) ); emit ConsecutiveTransfer(startTokenId, startTokenId + quantity - 1, address(0), to); _currentIndex = startTokenId + quantity; } _afterTokenTransfers(address(0), to, startTokenId, quantity); } /** * @dev Safely mints `quantity` tokens and transfers them to `to`. * * Requirements: * * - If `to` refers to a smart contract, it must implement * {IERC721Receiver-onERC721Received}, which is called for each safe transfer. * - `quantity` must be greater than 0. * * See {_mint}. * * Emits a {Transfer} event for each mint. */ function _safeMint( address to, uint256 quantity, bytes memory _data ) internal virtual { _mint(to, quantity); unchecked { if (to.code.length != 0) { uint256 end = _currentIndex; uint256 index = end - quantity; do { if (!_checkContractOnERC721Received(address(0), to, index++, _data)) { revert TransferToNonERC721ReceiverImplementer(); } } while (index < end); // Reentrancy protection. if (_currentIndex != end) revert(); } } } /** * @dev Equivalent to `_safeMint(to, quantity, '')`. */ function _safeMint(address to, uint256 quantity) internal virtual { _safeMint(to, quantity, ''); } // ============================================================= // BURN OPERATIONS // ============================================================= /** * @dev Equivalent to `_burn(tokenId, false)`. */ function _burn(uint256 tokenId) internal virtual { _burn(tokenId, false); } /** * @dev Destroys `tokenId`. * The approval is cleared when the token is burned. * * Requirements: * * - `tokenId` must exist. * * Emits a {Transfer} event. */ function _burn(uint256 tokenId, bool approvalCheck) internal virtual { uint256 prevOwnershipPacked = _packedOwnershipOf(tokenId); address from = address(uint160(prevOwnershipPacked)); (uint256 approvedAddressSlot, address approvedAddress) = _getApprovedSlotAndAddress(tokenId); if (approvalCheck) { // The nested ifs save around 20+ gas over a compound boolean condition. if (!_isSenderApprovedOrOwner(approvedAddress, from, _msgSenderERC721A())) if (!isApprovedForAll(from, _msgSenderERC721A())) revert TransferCallerNotOwnerNorApproved(); } _beforeTokenTransfers(from, address(0), tokenId, 1); // Clear approvals from the previous owner. assembly { if approvedAddress { // This is equivalent to `delete _tokenApprovals[tokenId]`. sstore(approvedAddressSlot, 0) } } // Underflow of the sender's balance is impossible because we check for // ownership above and the recipient's balance can't realistically overflow. // Counter overflow is incredibly unrealistic as `tokenId` would have to be 2**256. unchecked { // Updates: // - `balance -= 1`. // - `numberBurned += 1`. // // We can directly decrement the balance, and increment the number burned. // This is equivalent to `packed -= 1; packed += 1 << _BITPOS_NUMBER_BURNED;`. _packedAddressData[from] += (1 << _BITPOS_NUMBER_BURNED) - 1; // Updates: // - `address` to the last owner. // - `startTimestamp` to the timestamp of burning. // - `burned` to `true`. // - `nextInitialized` to `true`. _packedOwnerships[tokenId] = _packOwnershipData( from, (_BITMASK_BURNED | _BITMASK_NEXT_INITIALIZED) | _nextExtraData(from, address(0), prevOwnershipPacked) ); // If the next slot may not have been initialized (i.e. `nextInitialized == false`) . if (prevOwnershipPacked & _BITMASK_NEXT_INITIALIZED == 0) { uint256 nextTokenId = tokenId + 1; // If the next slot's address is zero and not burned (i.e. packed value is zero). if (_packedOwnerships[nextTokenId] == 0) { // If the next slot is within bounds. if (nextTokenId != _currentIndex) { // Initialize the next slot to maintain correctness for `ownerOf(tokenId + 1)`. _packedOwnerships[nextTokenId] = prevOwnershipPacked; } } } } emit Transfer(from, address(0), tokenId); _afterTokenTransfers(from, address(0), tokenId, 1); // Overflow not possible, as _burnCounter cannot be exceed _currentIndex times. unchecked { _burnCounter++; } } // ============================================================= // EXTRA DATA OPERATIONS // ============================================================= /** * @dev Directly sets the extra data for the ownership data `index`. */ function _setExtraDataAt(uint256 index, uint24 extraData) internal virtual { uint256 packed = _packedOwnerships[index]; if (packed == 0) revert OwnershipNotInitializedForExtraData(); uint256 extraDataCasted; // Cast `extraData` with assembly to avoid redundant masking. assembly { extraDataCasted := extraData } packed = (packed & _BITMASK_EXTRA_DATA_COMPLEMENT) | (extraDataCasted << _BITPOS_EXTRA_DATA); _packedOwnerships[index] = packed; } /** * @dev Called during each token transfer to set the 24bit `extraData` field. * Intended to be overridden by the cosumer contract. * * `previousExtraData` - the value of `extraData` before transfer. * * Calling conditions: * * - When `from` and `to` are both non-zero, `from`'s `tokenId` will be * transferred to `to`. * - When `from` is zero, `tokenId` will be minted for `to`. * - When `to` is zero, `tokenId` will be burned by `from`. * - `from` and `to` are never both zero. */ function _extraData( address from, address to, uint24 previousExtraData ) internal view virtual returns (uint24) {} /** * @dev Returns the next extra data for the packed ownership data. * The returned result is shifted into position. */ function _nextExtraData( address from, address to, uint256 prevOwnershipPacked ) private view returns (uint256) { uint24 extraData = uint24(prevOwnershipPacked >> _BITPOS_EXTRA_DATA); return uint256(_extraData(from, to, extraData)) << _BITPOS_EXTRA_DATA; } // ============================================================= // OTHER OPERATIONS // ============================================================= /** * @dev Returns the message sender (defaults to `msg.sender`). * * If you are writing GSN compatible contracts, you need to override this function. */ function _msgSenderERC721A() internal view virtual returns (address) { return msg.sender; } /** * @dev Converts a uint256 to its ASCII string decimal representation. */ function _toString(uint256 value) internal pure virtual returns (string memory str) { assembly { // The maximum value of a uint256 contains 78 digits (1 byte per digit), but // we allocate 0xa0 bytes to keep the free memory pointer 32-byte word aligned. // We will need 1 word for the trailing zeros padding, 1 word for the length, // and 3 words for a maximum of 78 digits. Total: 5 * 0x20 = 0xa0. let m := add(mload(0x40), 0xa0) // Update the free memory pointer to allocate. mstore(0x40, m) // Assign the `str` to the end. str := sub(m, 0x20) // Zeroize the slot after the string. mstore(str, 0) // Cache the end of the memory to calculate the length later. let end := str // We write the string from rightmost digit to leftmost digit. // The following is essentially a do-while loop that also handles the zero case. // prettier-ignore for { let temp := value } 1 {} { str := sub(str, 1) // Write the character to the pointer. // The ASCII index of the '0' character is 48. mstore8(str, add(48, mod(temp, 10))) // Keep dividing `temp` until zero. temp := div(temp, 10) // prettier-ignore if iszero(temp) { break } } let length := sub(end, str) // Move the pointer 32 bytes leftwards to make room for the length. str := sub(str, 0x20) // Store the length. mstore(str, length) } } }
// SPDX-License-Identifier: MIT // ERC721A Contracts v4.2.3 // Creator: Chiru Labs pragma solidity ^0.8.4; /** * @dev Interface of ERC721A. */ interface IERC721A { /** * The caller must own the token or be an approved operator. */ error ApprovalCallerNotOwnerNorApproved(); /** * The token does not exist. */ error ApprovalQueryForNonexistentToken(); /** * Cannot query the balance for the zero address. */ error BalanceQueryForZeroAddress(); /** * Cannot mint to the zero address. */ error MintToZeroAddress(); /** * The quantity of tokens minted must be more than zero. */ error MintZeroQuantity(); /** * The token does not exist. */ error OwnerQueryForNonexistentToken(); /** * The caller must own the token or be an approved operator. */ error TransferCallerNotOwnerNorApproved(); /** * The token must be owned by `from`. */ error TransferFromIncorrectOwner(); /** * Cannot safely transfer to a contract that does not implement the * ERC721Receiver interface. */ error TransferToNonERC721ReceiverImplementer(); /** * Cannot transfer to the zero address. */ error TransferToZeroAddress(); /** * The token does not exist. */ error URIQueryForNonexistentToken(); /** * The `quantity` minted with ERC2309 exceeds the safety limit. */ error MintERC2309QuantityExceedsLimit(); /** * The `extraData` cannot be set on an unintialized ownership slot. */ error OwnershipNotInitializedForExtraData(); // ============================================================= // STRUCTS // ============================================================= struct TokenOwnership { // The address of the owner. address addr; // Stores the start time of ownership with minimal overhead for tokenomics. uint64 startTimestamp; // Whether the token has been burned. bool burned; // Arbitrary data similar to `startTimestamp` that can be set via {_extraData}. uint24 extraData; } // ============================================================= // TOKEN COUNTERS // ============================================================= /** * @dev Returns the total number of tokens in existence. * Burned tokens will reduce the count. * To get the total number of tokens minted, please see {_totalMinted}. */ function totalSupply() external view returns (uint256); // ============================================================= // IERC165 // ============================================================= /** * @dev Returns true if this contract implements the interface defined by * `interfaceId`. See the corresponding * [EIP section](https://eips.ethereum.org/EIPS/eip-165#how-interfaces-are-identified) * to learn more about how these ids are created. * * This function call must use less than 30000 gas. */ function supportsInterface(bytes4 interfaceId) external view returns (bool); // ============================================================= // IERC721 // ============================================================= /** * @dev Emitted when `tokenId` token is transferred from `from` to `to`. */ event Transfer(address indexed from, address indexed to, uint256 indexed tokenId); /** * @dev Emitted when `owner` enables `approved` to manage the `tokenId` token. */ event Approval(address indexed owner, address indexed approved, uint256 indexed tokenId); /** * @dev Emitted when `owner` enables or disables * (`approved`) `operator` to manage all of its assets. */ event ApprovalForAll(address indexed owner, address indexed operator, bool approved); /** * @dev Returns the number of tokens in `owner`'s account. */ function balanceOf(address owner) external view returns (uint256 balance); /** * @dev Returns the owner of the `tokenId` token. * * Requirements: * * - `tokenId` must exist. */ function ownerOf(uint256 tokenId) external view returns (address owner); /** * @dev Safely transfers `tokenId` token from `from` to `to`, * checking first that contract recipients are aware of the ERC721 protocol * to prevent tokens from being forever locked. * * Requirements: * * - `from` cannot be the zero address. * - `to` cannot be the zero address. * - `tokenId` token must exist and be owned by `from`. * - If the caller is not `from`, it must be have been allowed to move * this token by either {approve} or {setApprovalForAll}. * - If `to` refers to a smart contract, it must implement * {IERC721Receiver-onERC721Received}, which is called upon a safe transfer. * * Emits a {Transfer} event. */ function safeTransferFrom( address from, address to, uint256 tokenId, bytes calldata data ) external payable; /** * @dev Equivalent to `safeTransferFrom(from, to, tokenId, '')`. */ function safeTransferFrom( address from, address to, uint256 tokenId ) external payable; /** * @dev Transfers `tokenId` from `from` to `to`. * * WARNING: Usage of this method is discouraged, use {safeTransferFrom} * whenever possible. * * Requirements: * * - `from` cannot be the zero address. * - `to` cannot be the zero address. * - `tokenId` token must be owned by `from`. * - If the caller is not `from`, it must be approved to move this token * by either {approve} or {setApprovalForAll}. * * Emits a {Transfer} event. */ function transferFrom( address from, address to, uint256 tokenId ) external payable; /** * @dev Gives permission to `to` to transfer `tokenId` token to another account. * The approval is cleared when the token is transferred. * * Only a single account can be approved at a time, so approving the * zero address clears previous approvals. * * Requirements: * * - The caller must own the token or be an approved operator. * - `tokenId` must exist. * * Emits an {Approval} event. */ function approve(address to, uint256 tokenId) external payable; /** * @dev Approve or remove `operator` as an operator for the caller. * Operators can call {transferFrom} or {safeTransferFrom} * for any token owned by the caller. * * Requirements: * * - The `operator` cannot be the caller. * * Emits an {ApprovalForAll} event. */ function setApprovalForAll(address operator, bool _approved) external; /** * @dev Returns the account approved for `tokenId` token. * * Requirements: * * - `tokenId` must exist. */ function getApproved(uint256 tokenId) external view returns (address operator); /** * @dev Returns if the `operator` is allowed to manage all of the assets of `owner`. * * See {setApprovalForAll}. */ function isApprovedForAll(address owner, address operator) external view returns (bool); // ============================================================= // IERC721Metadata // ============================================================= /** * @dev Returns the token collection name. */ function name() external view returns (string memory); /** * @dev Returns the token collection symbol. */ function symbol() external view returns (string memory); /** * @dev Returns the Uniform Resource Identifier (URI) for `tokenId` token. */ function tokenURI(uint256 tokenId) external view returns (string memory); // ============================================================= // IERC2309 // ============================================================= /** * @dev Emitted when tokens in `fromTokenId` to `toTokenId` * (inclusive) is transferred from `from` to `to`, as defined in the * [ERC2309](https://eips.ethereum.org/EIPS/eip-2309) standard. * * See {_mintERC2309} for more details. */ event ConsecutiveTransfer(uint256 indexed fromTokenId, uint256 toTokenId, address indexed from, address indexed to); }
{ "viaIR": true, "metadata": { "bytecodeHash": "none" }, "optimizer": { "enabled": true, "runs": 200 }, "outputSelection": { "*": { "*": [ "evm.bytecode", "evm.deployedBytecode", "devdoc", "userdoc", "metadata", "abi" ] } }, "libraries": { "contracts/ChainmortalFactory.sol": { "ChainMortalsFactory": "0x9d5a18bc66e64c58fb55b060ffb9cc3950779a0f" } } }
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":"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":"to","type":"address"},{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"approve","outputs":[],"stateMutability":"payable","type":"function"},{"inputs":[{"internalType":"address","name":"owner","type":"address"}],"name":"balanceOf","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"_newPrice","type":"uint256"}],"name":"changePrice","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"forSale","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"getApproved","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"owner","type":"address"},{"internalType":"address","name":"operator","type":"address"}],"name":"isApprovedForAll","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"quantity","type":"uint256"}],"name":"mint","outputs":[],"stateMutability":"payable","type":"function"},{"inputs":[],"name":"name","outputs":[{"internalType":"string","name":"","type":"string"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"owner","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"ownerOf","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"price","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"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":"payable","type":"function"},{"inputs":[{"internalType":"address","name":"from","type":"address"},{"internalType":"address","name":"to","type":"address"},{"internalType":"uint256","name":"tokenId","type":"uint256"},{"internalType":"bytes","name":"_data","type":"bytes"}],"name":"safeTransferFrom","outputs":[],"stateMutability":"payable","type":"function"},{"inputs":[{"internalType":"address","name":"operator","type":"address"},{"internalType":"bool","name":"approved","type":"bool"}],"name":"setApprovalForAll","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"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":[],"name":"toggleSale","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"tokenURI","outputs":[{"internalType":"string","name":"","type":"string"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"totalSupply","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"from","type":"address"},{"internalType":"address","name":"to","type":"address"},{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"transferFrom","outputs":[],"stateMutability":"payable","type":"function"},{"inputs":[{"internalType":"address","name":"newOwner","type":"address"}],"name":"transferOwnership","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"tokenId","type":"uint256"},{"internalType":"uint256","name":"seed","type":"uint256"}],"name":"updateSeed","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"withdrawMoney","outputs":[],"stateMutability":"nonpayable","type":"function"}]
Contract Creation Code
6080346200036f576001600160401b03906040908082018381118282101762000281578252600c815260206b436861696e4d6f7274616c7360a01b81830152825193838501858110828211176200028157845260078552664d4f5254414c5360c81b8286015282518181116200028157600254906001948583811c9316801562000364575b8584101462000260578190601f938481116200030d575b508590848311600114620002a35760009262000297575b5050600019600383901b1c191690851b176002555b8551918211620002815760039283548581811c9116801562000276575b82821014620002605782811162000215575b5080918311600114620001aa575081929394956000926200019e575b505060001982841b1c191690831b1790555b600080805560088054336001600160a01b03198216811790925593519390916001600160a01b03909116907f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e09080a3600955660b5e620f480000600a5560ff19600b5416600b55611770600c556115e69081620003758239f35b01519050388062000112565b90601f198316968460005282600020926000905b898210620001fd5750508386979896959610620001e4575b505050811b01905562000124565b015160001983861b60f8161c19169055388080620001d6565b808885968294968601518155019501930190620001be565b84600052816000208380860160051c82019284871062000256575b0160051c019086905b82811062000249575050620000f6565b6000815501869062000239565b9250819262000230565b634e487b7160e01b600052602260045260246000fd5b90607f1690620000e4565b634e487b7160e01b600052604160045260246000fd5b015190503880620000b2565b90879350601f198316916002600052876000209260005b89828210620002f65750508411620002dc575b505050811b01600255620000c7565b015160001960f88460031b161c19169055388080620002cd565b8385015186558b97909501949384019301620002ba565b9091506002600052856000208480850160051c8201928886106200035a575b918991869594930160051c01915b8281106200034a5750506200009b565b600081558594508991016200033a565b925081926200032c565b92607f169262000084565b600080fdfe60806040526004361015610013575b600080fd5b60003560e01c806301ffc9a7146101f357806306fdde03146101ea578063081812fc146101e1578063095ea7b3146101d8578063176b72b4146101cf57806318160ddd146101c657806323b872dd146101bd57806342842e0e146101b4578063466ccac0146101ab5780636352211e146101a257806370a0823114610199578063715018a6146101905780637d8966e4146101875780638da5cb5b1461017e57806395d89b4114610175578063a035b1fe1461016c578063a0712d6814610163578063a22cb4651461015a578063a2b40d1914610151578063ac44600214610148578063b88d4fde1461013f578063c87b56dd14610136578063e985e9c51461012d5763f2fde38b1461012557600080fd5b61000e610d29565b5061000e610ccb565b5061000e610bad565b5061000e610b28565b5061000e6109d1565b5061000e6109af565b5061000e610920565b5061000e610849565b5061000e61082a565b5061000e610766565b5061000e61073c565b5061000e610713565b5061000e6106b4565b5061000e610657565b5061000e610627565b5061000e610603565b5061000e6105c0565b5061000e6105ab565b5061000e610552565b5061000e61051f565b5061000e610467565b5061000e6103e6565b5061000e6102d9565b5061000e61020e565b6001600160e01b031981160361000e57565b503461000e57602036600319011261000e57602060043561022e816101fc565b63ffffffff60e01b166301ffc9a760e01b811490811561026c575b811561025b575b506040519015158152f35b635b5e139f60e01b14905038610250565b6380ac58cd60e01b81149150610249565b60005b8381106102905750506000910152565b8181015183820152602001610280565b906020916102b98151809281855285808601910161027d565b601f01601f1916010190565b9060206102d69281815201906102a0565b90565b503461000e576000806003193601126103e35760405190806002549060019180831c928082169283156103d9575b60209283861085146103c55785885260208801949081156103a4575060011461034b575b6103478761033b81890382610adb565b604051918291826102c5565b0390f35b600260005294509192917f405787fa12a823e0f2b7631cc41b3ba8828b3321ca811111fa75cd3aa3bb5ace5b838610610393575050509101905061033b82610347388061032b565b805485870152948201948101610377565b60ff191685525050505090151560051b01905061033b82610347388061032b565b634e487b7160e01b82526022600452602482fd5b93607f1693610307565b80fd5b503461000e57602036600319011261000e57600435610404816111d6565b15610429576000526006602052602060018060a01b0360406000205416604051908152f35b6040516333d1c03960e21b8152600490fd5b600435906001600160a01b038216820361000e57565b602435906001600160a01b038216820361000e57565b50604036600319011261000e5761047c61043b565b6024356001600160a01b038061049183611168565b16908133036104ec575b600083815260066020526040812080546001600160a01b0319166001600160a01b0387161790559316907f8c5be1e5ebec7d5bd14f71427d1e84f3dd0314c0f7b2291e5b200ac8c7c3b9258480a480f35b600082815260076020908152604080832033845290915290205460ff1661049b576040516367d9dca160e11b8152600490fd5b503461000e57604036600319011261000e57610539610df3565b600435600052600d602052602435604060002055600080f35b503461000e57600036600319011261000e5760206000546001549003604051908152f35b606090600319011261000e576001600160a01b0390600435828116810361000e5791602435908116810361000e579060443590565b506105be6105b836610576565b916111ff565b005b506105be6105cd36610576565b90604051926020840184811067ffffffffffffffff8211176105f6575b604052600084526113d1565b6105fe610a9b565b6105ea565b503461000e57600036600319011261000e57602060ff600b54166040519015158152f35b503461000e57602036600319011261000e5760206001600160a01b0361064e600435611168565b16604051908152f35b503461000e57602036600319011261000e576001600160a01b0361067961043b565b1680156106a2576000526005602052602067ffffffffffffffff60406000205416604051908152f35b6040516323d3ad8160e21b8152600490fd5b503461000e576000806003193601126103e3576106cf610df3565b600880546001600160a01b0319811690915581906001600160a01b03167f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e08280a380f35b503461000e57600036600319011261000e5761072d610df3565b600b805460ff19166001179055005b503461000e57600036600319011261000e576008546040516001600160a01b039091168152602090f35b503461000e576000806003193601126103e35760405190806003549060019180831c92808216928315610820575b60209283861085146103c55785885260208801949081156103a457506001146107c7576103478761033b81890382610adb565b600360005294509192917fc2575a0e9e593c00f959f8c92f12db2869c3395a3b0502d05e2516446f71f85b5b83861061080f575050509101905061033b82610347388061032b565b8054858701529482019481016107f3565b93607f1693610794565b503461000e57600036600319011261000e576020600a54604051908152f35b50602036600319011261000e5760043561086d610868600b5460ff1690565b610e4b565b61087960648210610e97565b6103e86108938261088e600054600154900390565b610f12565b1015610904575b6108b96108af8261088e600054600154900390565b600c541015610fa1565b600080545b63ffffffff908382841610156108fa576108d781611059565b6108eb82600052600d602052604060002090565b556001809101920116906108be565b6105be8433611504565b61091b61091382600a54610f42565b341015610f55565b61089a565b503461000e57604036600319011261000e5761093a61043b565b6024359081151580920361000e573360009081526007602090815260408083206001600160a01b0385168452909152902060ff1981541660ff841617905560405191825260018060a01b0316907f17307eab39ab6107e8899845ad3d59bd9653f200f220920489ca2b5937696c3160203392a3005b503461000e57602036600319011261000e576109c9610df3565b600435600a55005b503461000e576000806003193601126103e3576109ec610df3565b600260095414610a565760026009558080808047335af1610a0b611138565b5015610a1e57610a1b6001600955565b80f35b60405162461bcd60e51b815260206004820152601060248201526f2a3930b739b332b9103330b4b632b21760811b6044820152606490fd5b60405162461bcd60e51b815260206004820152601f60248201527f5265656e7472616e637947756172643a207265656e7472616e742063616c6c006044820152606490fd5b50634e487b7160e01b600052604160045260246000fd5b6060810190811067ffffffffffffffff821117610ace57604052565b610ad6610a9b565b604052565b90601f8019910116810190811067ffffffffffffffff821117610ace57604052565b60209067ffffffffffffffff8111610b1b575b601f01601f19160190565b610b23610a9b565b610b10565b50608036600319011261000e57610b3d61043b565b610b45610451565b6064359167ffffffffffffffff831161000e573660238401121561000e57826004013591610b7283610afd565b92610b806040519485610adb565b808452366024828701011161000e5760208160009260246105be98018388013785010152604435916113d1565b503461000e57602036600319011261000e57600435610bcb816111d6565b15610c7b57610c17600082610bed61034794600052600d602052604060002090565b5460405163d62f7a6760e01b81526004810191909152602481019190915291829081906044820190565b0381739d5a18bc66e64c58fb55b060ffb9cc3950779a0f5af4908115610c6e575b600091610c4d575b50604051918291826102c5565b610c68913d8091833e610c608183610adb565b810190610fed565b38610c40565b610c7661104c565b610c38565b60405162461bcd60e51b815260206004820152602260248201527f4552524f523a20717565727920666f72206e6f6e6578697374656e7420746f6b60448201526132b760f11b6064820152608490fd5b503461000e57604036600319011261000e57602060ff610d1d610cec61043b565b610cf4610451565b6001600160a01b0391821660009081526007865260408082209290931681526020919091522090565b54166040519015158152f35b503461000e57602036600319011261000e57610d4361043b565b610d4b610df3565b6001600160a01b03908116908115610d9f57600854826bffffffffffffffffffffffff60a01b821617600855167f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e0600080a3005b60405162461bcd60e51b815260206004820152602660248201527f4f776e61626c653a206e6577206f776e657220697320746865207a65726f206160448201526564647265737360d01b6064820152608490fd5b6008546001600160a01b03163303610e0757565b606460405162461bcd60e51b815260206004820152602060248201527f4f776e61626c653a2063616c6c6572206973206e6f7420746865206f776e65726044820152fd5b15610e5257565b60405162461bcd60e51b815260206004820152601760248201527f4552524f523a204d696e74206e6f7420656e61626c65640000000000000000006044820152606490fd5b15610e9e57565b60405162461bcd60e51b815260206004820152601960248201527f4552524f523a204d696e74206c696d69742045786365656473000000000000006044820152606490fd5b50634e487b7160e01b600052601160045260246000fd5b90600a8201809211610f0857565b610f10610ee3565b565b91908201809211610f0857565b9081606402916064830403610f0857565b906127109180830292830403610f0857565b81810292918115918404141715610f0857565b15610f5c57565b60405162461bcd60e51b815260206004820152601b60248201527f4552524f523a20696e73756666696369656e742062616c616e636500000000006044820152606490fd5b15610fa857565b60405162461bcd60e51b815260206004820152601960248201527f45524f52523a20537570706c79206361702072656163686564000000000000006044820152606490fd5b60208183031261000e5780519067ffffffffffffffff821161000e570181601f8201121561000e57805161102081610afd565b9261102e6040519485610adb565b8184526020828401011161000e576102d6916020808501910161027d565b506040513d6000823e3d90fd5b6102d69060001943019043821161112b575b60405190602082019240835260408201526040815261108981610ab2565b51902061088e6111266110be6110a96110a460078606610efa565b610f1f565b6110b860148660301c06610efa565b90610f12565b9261088e6111266110e78360601c6110b860146110e06110a460068506610efa565b9206610efa565b61088e6111206111088660901c6110b860146110e06110a460078506610efa565b9560c01c6110b860146110e06110a460018516610efa565b97610f30565b610f30565b611133610ee3565b61106b565b3d15611163573d9061114982610afd565b916111576040519384610adb565b82523d6000602084013e565b606090565b60008181548110611186575b604051636f96cda160e11b8152600490fd5b81526004906020918083526040928383205494600160e01b8616156111ad57505050611174565b93929190935b85156111c157505050505090565b600019018083528185528383205495506111b3565b600054811090816111e5575090565b90506000526004602052600160e01b604060002054161590565b9061120983611168565b6001600160a01b03838116928282168490036113c05760008681526006602052604090208054909261124e6001600160a01b03881633908114908414171590565b1590565b611365575b8216958615611353576112a69361128492611349575b506001600160a01b0316600090815260056020526040902090565b80546000190190556001600160a01b0316600090815260056020526040902090565b80546001019055600160e11b804260a01b8517176112ce866000526004602052604060002090565b558116156112ff575b507fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef600080a4565b60018401611317816000526004602052604060002090565b5415611324575b506112d7565b600054811461131e57611341906000526004602052604060002090565b55388061131e565b6000905538611269565b604051633a954ecd60e21b8152600490fd5b6113a961124a6113a23361138b8b60018060a01b03166000526007602052604060002090565b9060018060a01b0316600052602052604060002090565b5460ff1690565b1561125357604051632ce44b5f60e11b8152600490fd5b60405162a1148160e81b8152600490fd5b9291906113df8282866111ff565b803b6113ec575b50505050565b6113f59361145b565b1561140357388080806113e6565b6040516368d2bf6b60e11b8152600490fd5b9081602091031261000e57516102d6816101fc565b6001600160a01b0391821681529116602082015260408101919091526080606082018190526102d6929101906102a0565b92602091611484936000604051809681958294630a85bd0160e11b9a8b8552336004860161142a565b03926001600160a01b03165af1600091816114d4575b506114c6576114a7611138565b805190816114c1576040516368d2bf6b60e11b8152600490fd5b602001fd5b6001600160e01b0319161490565b6114f691925060203d81116114fd575b6114ee8183610adb565b810190611415565b903861149a565b503d6114e4565b9060009081549281156115c7576001600160a01b0381166000908152600560205260409020805468010000000000000001840201905560008481526004602052604090206001600160a01b03909116916001914260a01b83831460e11b1784179055840193817fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef91808587858180a4015b8581036115b857505050156115a75755565b604051622e076360e81b8152600490fd5b8083918587858180a401611595565b60405163b562e8dd60e01b8152600490fdfea164736f6c6343000811000a
Deployed Bytecode
0x60806040526004361015610013575b600080fd5b60003560e01c806301ffc9a7146101f357806306fdde03146101ea578063081812fc146101e1578063095ea7b3146101d8578063176b72b4146101cf57806318160ddd146101c657806323b872dd146101bd57806342842e0e146101b4578063466ccac0146101ab5780636352211e146101a257806370a0823114610199578063715018a6146101905780637d8966e4146101875780638da5cb5b1461017e57806395d89b4114610175578063a035b1fe1461016c578063a0712d6814610163578063a22cb4651461015a578063a2b40d1914610151578063ac44600214610148578063b88d4fde1461013f578063c87b56dd14610136578063e985e9c51461012d5763f2fde38b1461012557600080fd5b61000e610d29565b5061000e610ccb565b5061000e610bad565b5061000e610b28565b5061000e6109d1565b5061000e6109af565b5061000e610920565b5061000e610849565b5061000e61082a565b5061000e610766565b5061000e61073c565b5061000e610713565b5061000e6106b4565b5061000e610657565b5061000e610627565b5061000e610603565b5061000e6105c0565b5061000e6105ab565b5061000e610552565b5061000e61051f565b5061000e610467565b5061000e6103e6565b5061000e6102d9565b5061000e61020e565b6001600160e01b031981160361000e57565b503461000e57602036600319011261000e57602060043561022e816101fc565b63ffffffff60e01b166301ffc9a760e01b811490811561026c575b811561025b575b506040519015158152f35b635b5e139f60e01b14905038610250565b6380ac58cd60e01b81149150610249565b60005b8381106102905750506000910152565b8181015183820152602001610280565b906020916102b98151809281855285808601910161027d565b601f01601f1916010190565b9060206102d69281815201906102a0565b90565b503461000e576000806003193601126103e35760405190806002549060019180831c928082169283156103d9575b60209283861085146103c55785885260208801949081156103a4575060011461034b575b6103478761033b81890382610adb565b604051918291826102c5565b0390f35b600260005294509192917f405787fa12a823e0f2b7631cc41b3ba8828b3321ca811111fa75cd3aa3bb5ace5b838610610393575050509101905061033b82610347388061032b565b805485870152948201948101610377565b60ff191685525050505090151560051b01905061033b82610347388061032b565b634e487b7160e01b82526022600452602482fd5b93607f1693610307565b80fd5b503461000e57602036600319011261000e57600435610404816111d6565b15610429576000526006602052602060018060a01b0360406000205416604051908152f35b6040516333d1c03960e21b8152600490fd5b600435906001600160a01b038216820361000e57565b602435906001600160a01b038216820361000e57565b50604036600319011261000e5761047c61043b565b6024356001600160a01b038061049183611168565b16908133036104ec575b600083815260066020526040812080546001600160a01b0319166001600160a01b0387161790559316907f8c5be1e5ebec7d5bd14f71427d1e84f3dd0314c0f7b2291e5b200ac8c7c3b9258480a480f35b600082815260076020908152604080832033845290915290205460ff1661049b576040516367d9dca160e11b8152600490fd5b503461000e57604036600319011261000e57610539610df3565b600435600052600d602052602435604060002055600080f35b503461000e57600036600319011261000e5760206000546001549003604051908152f35b606090600319011261000e576001600160a01b0390600435828116810361000e5791602435908116810361000e579060443590565b506105be6105b836610576565b916111ff565b005b506105be6105cd36610576565b90604051926020840184811067ffffffffffffffff8211176105f6575b604052600084526113d1565b6105fe610a9b565b6105ea565b503461000e57600036600319011261000e57602060ff600b54166040519015158152f35b503461000e57602036600319011261000e5760206001600160a01b0361064e600435611168565b16604051908152f35b503461000e57602036600319011261000e576001600160a01b0361067961043b565b1680156106a2576000526005602052602067ffffffffffffffff60406000205416604051908152f35b6040516323d3ad8160e21b8152600490fd5b503461000e576000806003193601126103e3576106cf610df3565b600880546001600160a01b0319811690915581906001600160a01b03167f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e08280a380f35b503461000e57600036600319011261000e5761072d610df3565b600b805460ff19166001179055005b503461000e57600036600319011261000e576008546040516001600160a01b039091168152602090f35b503461000e576000806003193601126103e35760405190806003549060019180831c92808216928315610820575b60209283861085146103c55785885260208801949081156103a457506001146107c7576103478761033b81890382610adb565b600360005294509192917fc2575a0e9e593c00f959f8c92f12db2869c3395a3b0502d05e2516446f71f85b5b83861061080f575050509101905061033b82610347388061032b565b8054858701529482019481016107f3565b93607f1693610794565b503461000e57600036600319011261000e576020600a54604051908152f35b50602036600319011261000e5760043561086d610868600b5460ff1690565b610e4b565b61087960648210610e97565b6103e86108938261088e600054600154900390565b610f12565b1015610904575b6108b96108af8261088e600054600154900390565b600c541015610fa1565b600080545b63ffffffff908382841610156108fa576108d781611059565b6108eb82600052600d602052604060002090565b556001809101920116906108be565b6105be8433611504565b61091b61091382600a54610f42565b341015610f55565b61089a565b503461000e57604036600319011261000e5761093a61043b565b6024359081151580920361000e573360009081526007602090815260408083206001600160a01b0385168452909152902060ff1981541660ff841617905560405191825260018060a01b0316907f17307eab39ab6107e8899845ad3d59bd9653f200f220920489ca2b5937696c3160203392a3005b503461000e57602036600319011261000e576109c9610df3565b600435600a55005b503461000e576000806003193601126103e3576109ec610df3565b600260095414610a565760026009558080808047335af1610a0b611138565b5015610a1e57610a1b6001600955565b80f35b60405162461bcd60e51b815260206004820152601060248201526f2a3930b739b332b9103330b4b632b21760811b6044820152606490fd5b60405162461bcd60e51b815260206004820152601f60248201527f5265656e7472616e637947756172643a207265656e7472616e742063616c6c006044820152606490fd5b50634e487b7160e01b600052604160045260246000fd5b6060810190811067ffffffffffffffff821117610ace57604052565b610ad6610a9b565b604052565b90601f8019910116810190811067ffffffffffffffff821117610ace57604052565b60209067ffffffffffffffff8111610b1b575b601f01601f19160190565b610b23610a9b565b610b10565b50608036600319011261000e57610b3d61043b565b610b45610451565b6064359167ffffffffffffffff831161000e573660238401121561000e57826004013591610b7283610afd565b92610b806040519485610adb565b808452366024828701011161000e5760208160009260246105be98018388013785010152604435916113d1565b503461000e57602036600319011261000e57600435610bcb816111d6565b15610c7b57610c17600082610bed61034794600052600d602052604060002090565b5460405163d62f7a6760e01b81526004810191909152602481019190915291829081906044820190565b0381739d5a18bc66e64c58fb55b060ffb9cc3950779a0f5af4908115610c6e575b600091610c4d575b50604051918291826102c5565b610c68913d8091833e610c608183610adb565b810190610fed565b38610c40565b610c7661104c565b610c38565b60405162461bcd60e51b815260206004820152602260248201527f4552524f523a20717565727920666f72206e6f6e6578697374656e7420746f6b60448201526132b760f11b6064820152608490fd5b503461000e57604036600319011261000e57602060ff610d1d610cec61043b565b610cf4610451565b6001600160a01b0391821660009081526007865260408082209290931681526020919091522090565b54166040519015158152f35b503461000e57602036600319011261000e57610d4361043b565b610d4b610df3565b6001600160a01b03908116908115610d9f57600854826bffffffffffffffffffffffff60a01b821617600855167f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e0600080a3005b60405162461bcd60e51b815260206004820152602660248201527f4f776e61626c653a206e6577206f776e657220697320746865207a65726f206160448201526564647265737360d01b6064820152608490fd5b6008546001600160a01b03163303610e0757565b606460405162461bcd60e51b815260206004820152602060248201527f4f776e61626c653a2063616c6c6572206973206e6f7420746865206f776e65726044820152fd5b15610e5257565b60405162461bcd60e51b815260206004820152601760248201527f4552524f523a204d696e74206e6f7420656e61626c65640000000000000000006044820152606490fd5b15610e9e57565b60405162461bcd60e51b815260206004820152601960248201527f4552524f523a204d696e74206c696d69742045786365656473000000000000006044820152606490fd5b50634e487b7160e01b600052601160045260246000fd5b90600a8201809211610f0857565b610f10610ee3565b565b91908201809211610f0857565b9081606402916064830403610f0857565b906127109180830292830403610f0857565b81810292918115918404141715610f0857565b15610f5c57565b60405162461bcd60e51b815260206004820152601b60248201527f4552524f523a20696e73756666696369656e742062616c616e636500000000006044820152606490fd5b15610fa857565b60405162461bcd60e51b815260206004820152601960248201527f45524f52523a20537570706c79206361702072656163686564000000000000006044820152606490fd5b60208183031261000e5780519067ffffffffffffffff821161000e570181601f8201121561000e57805161102081610afd565b9261102e6040519485610adb565b8184526020828401011161000e576102d6916020808501910161027d565b506040513d6000823e3d90fd5b6102d69060001943019043821161112b575b60405190602082019240835260408201526040815261108981610ab2565b51902061088e6111266110be6110a96110a460078606610efa565b610f1f565b6110b860148660301c06610efa565b90610f12565b9261088e6111266110e78360601c6110b860146110e06110a460068506610efa565b9206610efa565b61088e6111206111088660901c6110b860146110e06110a460078506610efa565b9560c01c6110b860146110e06110a460018516610efa565b97610f30565b610f30565b611133610ee3565b61106b565b3d15611163573d9061114982610afd565b916111576040519384610adb565b82523d6000602084013e565b606090565b60008181548110611186575b604051636f96cda160e11b8152600490fd5b81526004906020918083526040928383205494600160e01b8616156111ad57505050611174565b93929190935b85156111c157505050505090565b600019018083528185528383205495506111b3565b600054811090816111e5575090565b90506000526004602052600160e01b604060002054161590565b9061120983611168565b6001600160a01b03838116928282168490036113c05760008681526006602052604090208054909261124e6001600160a01b03881633908114908414171590565b1590565b611365575b8216958615611353576112a69361128492611349575b506001600160a01b0316600090815260056020526040902090565b80546000190190556001600160a01b0316600090815260056020526040902090565b80546001019055600160e11b804260a01b8517176112ce866000526004602052604060002090565b558116156112ff575b507fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef600080a4565b60018401611317816000526004602052604060002090565b5415611324575b506112d7565b600054811461131e57611341906000526004602052604060002090565b55388061131e565b6000905538611269565b604051633a954ecd60e21b8152600490fd5b6113a961124a6113a23361138b8b60018060a01b03166000526007602052604060002090565b9060018060a01b0316600052602052604060002090565b5460ff1690565b1561125357604051632ce44b5f60e11b8152600490fd5b60405162a1148160e81b8152600490fd5b9291906113df8282866111ff565b803b6113ec575b50505050565b6113f59361145b565b1561140357388080806113e6565b6040516368d2bf6b60e11b8152600490fd5b9081602091031261000e57516102d6816101fc565b6001600160a01b0391821681529116602082015260408101919091526080606082018190526102d6929101906102a0565b92602091611484936000604051809681958294630a85bd0160e11b9a8b8552336004860161142a565b03926001600160a01b03165af1600091816114d4575b506114c6576114a7611138565b805190816114c1576040516368d2bf6b60e11b8152600490fd5b602001fd5b6001600160e01b0319161490565b6114f691925060203d81116114fd575b6114ee8183610adb565b810190611415565b903861149a565b503d6114e4565b9060009081549281156115c7576001600160a01b0381166000908152600560205260409020805468010000000000000001840201905560008481526004602052604090206001600160a01b03909116916001914260a01b83831460e11b1784179055840193817fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef91808587858180a4015b8581036115b857505050156115a75755565b604051622e076360e81b8152600490fd5b8083918587858180a401611595565b60405163b562e8dd60e01b8152600490fdfea164736f6c6343000811000a
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.