// SPDX-License-Identifier: MIT// OpenZeppelin Contracts v4.4.1 (utils/Context.sol)pragmasolidity ^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.
*/abstractcontractContext{
function_msgSender() internalviewvirtualreturns (address) {
returnmsg.sender;
}
function_msgData() internalviewvirtualreturns (bytescalldata) {
returnmsg.data;
}
}
Contract Source Code
File 2 of 7: ECDSA.sol
// SPDX-License-Identifier: MIT// OpenZeppelin Contracts (last updated v4.9.0) (utils/cryptography/ECDSA.sol)pragmasolidity ^0.8.0;import"../Strings.sol";
/**
* @dev Elliptic Curve Digital Signature Algorithm (ECDSA) operations.
*
* These functions can be used to verify that a message was signed by the holder
* of the private keys of a given address.
*/libraryECDSA{
enumRecoverError {
NoError,
InvalidSignature,
InvalidSignatureLength,
InvalidSignatureS,
InvalidSignatureV // Deprecated in v4.8
}
function_throwError(RecoverError error) privatepure{
if (error == RecoverError.NoError) {
return; // no error: do nothing
} elseif (error == RecoverError.InvalidSignature) {
revert("ECDSA: invalid signature");
} elseif (error == RecoverError.InvalidSignatureLength) {
revert("ECDSA: invalid signature length");
} elseif (error == RecoverError.InvalidSignatureS) {
revert("ECDSA: invalid signature 's' value");
}
}
/**
* @dev Returns the address that signed a hashed message (`hash`) with
* `signature` or error string. This address can then be used for verification purposes.
*
* The `ecrecover` EVM opcode allows for malleable (non-unique) signatures:
* this function rejects them by requiring the `s` value to be in the lower
* half order, and the `v` value to be either 27 or 28.
*
* IMPORTANT: `hash` _must_ be the result of a hash operation for the
* verification to be secure: it is possible to craft signatures that
* recover to arbitrary addresses for non-hashed data. A safe way to ensure
* this is by receiving a hash of the original message (which may otherwise
* be too long), and then calling {toEthSignedMessageHash} on it.
*
* Documentation for signature generation:
* - with https://web3js.readthedocs.io/en/v1.3.4/web3-eth-accounts.html#sign[Web3.js]
* - with https://docs.ethers.io/v5/api/signer/#Signer-signMessage[ethers]
*
* _Available since v4.3._
*/functiontryRecover(bytes32 hash, bytesmemory signature) internalpurereturns (address, RecoverError) {
if (signature.length==65) {
bytes32 r;
bytes32 s;
uint8 v;
// ecrecover takes the signature parameters, and the only way to get them// currently is to use assembly./// @solidity memory-safe-assemblyassembly {
r :=mload(add(signature, 0x20))
s :=mload(add(signature, 0x40))
v :=byte(0, mload(add(signature, 0x60)))
}
return tryRecover(hash, v, r, s);
} else {
return (address(0), RecoverError.InvalidSignatureLength);
}
}
/**
* @dev Returns the address that signed a hashed message (`hash`) with
* `signature`. This address can then be used for verification purposes.
*
* The `ecrecover` EVM opcode allows for malleable (non-unique) signatures:
* this function rejects them by requiring the `s` value to be in the lower
* half order, and the `v` value to be either 27 or 28.
*
* IMPORTANT: `hash` _must_ be the result of a hash operation for the
* verification to be secure: it is possible to craft signatures that
* recover to arbitrary addresses for non-hashed data. A safe way to ensure
* this is by receiving a hash of the original message (which may otherwise
* be too long), and then calling {toEthSignedMessageHash} on it.
*/functionrecover(bytes32 hash, bytesmemory signature) internalpurereturns (address) {
(address recovered, RecoverError error) = tryRecover(hash, signature);
_throwError(error);
return recovered;
}
/**
* @dev Overload of {ECDSA-tryRecover} that receives the `r` and `vs` short-signature fields separately.
*
* See https://eips.ethereum.org/EIPS/eip-2098[EIP-2098 short signatures]
*
* _Available since v4.3._
*/functiontryRecover(bytes32 hash, bytes32 r, bytes32 vs) internalpurereturns (address, RecoverError) {
bytes32 s = vs &bytes32(0x7fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff);
uint8 v =uint8((uint256(vs) >>255) +27);
return tryRecover(hash, v, r, s);
}
/**
* @dev Overload of {ECDSA-recover} that receives the `r and `vs` short-signature fields separately.
*
* _Available since v4.2._
*/functionrecover(bytes32 hash, bytes32 r, bytes32 vs) internalpurereturns (address) {
(address recovered, RecoverError error) = tryRecover(hash, r, vs);
_throwError(error);
return recovered;
}
/**
* @dev Overload of {ECDSA-tryRecover} that receives the `v`,
* `r` and `s` signature fields separately.
*
* _Available since v4.3._
*/functiontryRecover(bytes32 hash, uint8 v, bytes32 r, bytes32 s) internalpurereturns (address, RecoverError) {
// EIP-2 still allows signature malleability for ecrecover(). Remove this possibility and make the signature// unique. Appendix F in the Ethereum Yellow paper (https://ethereum.github.io/yellowpaper/paper.pdf), defines// the valid range for s in (301): 0 < s < secp256k1n ÷ 2 + 1, and for v in (302): v ∈ {27, 28}. Most// signatures from current libraries generate a unique signature with an s-value in the lower half order.//// If your library generates malleable signatures, such as s-values in the upper range, calculate a new s-value// with 0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEBAAEDCE6AF48A03BBFD25E8CD0364141 - s1 and flip v from 27 to 28 or// vice versa. If your library also generates signatures with 0/1 for v instead 27/28, add 27 to v to accept// these malleable signatures as well.if (uint256(s) >0x7FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF5D576E7357A4501DDFE92F46681B20A0) {
return (address(0), RecoverError.InvalidSignatureS);
}
// If the signature is valid (and not malleable), return the signer addressaddress signer =ecrecover(hash, v, r, s);
if (signer ==address(0)) {
return (address(0), RecoverError.InvalidSignature);
}
return (signer, RecoverError.NoError);
}
/**
* @dev Overload of {ECDSA-recover} that receives the `v`,
* `r` and `s` signature fields separately.
*/functionrecover(bytes32 hash, uint8 v, bytes32 r, bytes32 s) internalpurereturns (address) {
(address recovered, RecoverError error) = tryRecover(hash, v, r, s);
_throwError(error);
return recovered;
}
/**
* @dev Returns an Ethereum Signed Message, created from a `hash`. This
* produces hash corresponding to the one signed with the
* https://eth.wiki/json-rpc/API#eth_sign[`eth_sign`]
* JSON-RPC method as part of EIP-191.
*
* See {recover}.
*/functiontoEthSignedMessageHash(bytes32 hash) internalpurereturns (bytes32 message) {
// 32 is the length in bytes of hash,// enforced by the type signature above/// @solidity memory-safe-assemblyassembly {
mstore(0x00, "\x19Ethereum Signed Message:\n32")
mstore(0x1c, hash)
message :=keccak256(0x00, 0x3c)
}
}
/**
* @dev Returns an Ethereum Signed Message, created from `s`. This
* produces hash corresponding to the one signed with the
* https://eth.wiki/json-rpc/API#eth_sign[`eth_sign`]
* JSON-RPC method as part of EIP-191.
*
* See {recover}.
*/functiontoEthSignedMessageHash(bytesmemory s) internalpurereturns (bytes32) {
returnkeccak256(abi.encodePacked("\x19Ethereum Signed Message:\n", Strings.toString(s.length), s));
}
/**
* @dev Returns an Ethereum Signed Typed Data, created from a
* `domainSeparator` and a `structHash`. This produces hash corresponding
* to the one signed with the
* https://eips.ethereum.org/EIPS/eip-712[`eth_signTypedData`]
* JSON-RPC method as part of EIP-712.
*
* See {recover}.
*/functiontoTypedDataHash(bytes32 domainSeparator, bytes32 structHash) internalpurereturns (bytes32 data) {
/// @solidity memory-safe-assemblyassembly {
let ptr :=mload(0x40)
mstore(ptr, "\x19\x01")
mstore(add(ptr, 0x02), domainSeparator)
mstore(add(ptr, 0x22), structHash)
data :=keccak256(ptr, 0x42)
}
}
/**
* @dev Returns an Ethereum Signed Data with intended validator, created from a
* `validator` and `data` according to the version 0 of EIP-191.
*
* See {recover}.
*/functiontoDataWithIntendedValidatorHash(address validator, bytesmemory data) internalpurereturns (bytes32) {
returnkeccak256(abi.encodePacked("\x19\x00", validator, data));
}
}
Contract Source Code
File 3 of 7: Math.sol
// SPDX-License-Identifier: MIT// OpenZeppelin Contracts (last updated v4.9.0) (utils/math/Math.sol)pragmasolidity ^0.8.0;/**
* @dev Standard math utilities missing in the Solidity language.
*/libraryMath{
enumRounding {
Down, // Toward negative infinity
Up, // Toward infinity
Zero // Toward zero
}
/**
* @dev Returns the largest of two numbers.
*/functionmax(uint256 a, uint256 b) internalpurereturns (uint256) {
return a > b ? a : b;
}
/**
* @dev Returns the smallest of two numbers.
*/functionmin(uint256 a, uint256 b) internalpurereturns (uint256) {
return a < b ? a : b;
}
/**
* @dev Returns the average of two numbers. The result is rounded towards
* zero.
*/functionaverage(uint256 a, uint256 b) internalpurereturns (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.
*/functionceilDiv(uint256 a, uint256 b) internalpurereturns (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.
*/functionmulDiv(uint256 x, uint256 y, uint256 denominator) internalpurereturns (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 productuint256 prod1; // Most significant 256 bits of the productassembly {
let mm :=mulmod(x, y, not(0))
prod0 :=mul(x, y)
prod1 :=sub(sub(mm, prod0), lt(mm, prod0))
}
// Handle non-overflow cases, 256 by 256 division.if (prod1 ==0) {
// Solidity will revert if denominator == 0, unlike the div opcode on its own.// The surrounding unchecked block does not change this fact.// See https://docs.soliditylang.org/en/latest/control-structures.html#checked-or-unchecked-arithmetic.return prod0 / denominator;
}
// Make sure the result is less than 2^256. Also prevents denominator == 0.require(denominator > prod1, "Math: mulDiv overflow");
///////////////////////////////////////////////// 512 by 256 division.///////////////////////////////////////////////// Make division exact by subtracting the remainder from [prod1 prod0].uint256 remainder;
assembly {
// Compute remainder using mulmod.
remainder :=mulmod(x, y, denominator)
// Subtract 256 bit number from 512 bit number.
prod1 :=sub(prod1, gt(remainder, prod0))
prod0 :=sub(prod0, remainder)
}
// Factor powers of two out of denominator and compute largest power of two divisor of denominator. Always >= 1.// See https://cs.stackexchange.com/q/138556/92363.// Does not overflow because the denominator cannot be zero at this stage in the function.uint256 twos = denominator & (~denominator +1);
assembly {
// Divide denominator by twos.
denominator :=div(denominator, twos)
// Divide [prod1 prod0] by twos.
prod0 :=div(prod0, twos)
// Flip twos such that it is 2^256 / twos. If twos is zero, then it becomes one.
twos :=add(div(sub(0, twos), twos), 1)
}
// Shift in bits from prod1 into prod0.
prod0 |= prod1 * twos;
// Invert denominator mod 2^256. Now that denominator is an odd number, it has an inverse modulo 2^256 such// that denominator * inv = 1 mod 2^256. Compute the inverse by starting with a seed that is correct for// four bits. That is, denominator * inv = 1 mod 2^4.uint256 inverse = (3* denominator) ^2;
// Use the Newton-Raphson iteration to improve the precision. Thanks to Hensel's lifting lemma, this also works// in modular arithmetic, doubling the correct bits in each step.
inverse *=2- denominator * inverse; // inverse mod 2^8
inverse *=2- denominator * inverse; // inverse mod 2^16
inverse *=2- denominator * inverse; // inverse mod 2^32
inverse *=2- denominator * inverse; // inverse mod 2^64
inverse *=2- denominator * inverse; // inverse mod 2^128
inverse *=2- denominator * inverse; // inverse mod 2^256// Because the division is now exact we can divide by multiplying with the modular inverse of denominator.// This will give us the correct result modulo 2^256. Since the preconditions guarantee that the outcome is// less than 2^256, this is the final result. We don't need to compute the high bits of the result and prod1// is no longer required.
result = prod0 * inverse;
return result;
}
}
/**
* @notice Calculates x * y / denominator with full precision, following the selected rounding direction.
*/functionmulDiv(uint256 x, uint256 y, uint256 denominator, Rounding rounding) internalpurereturns (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).
*/functionsqrt(uint256 a) internalpurereturns (uint256) {
if (a ==0) {
return0;
}
// 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.
*/functionsqrt(uint256 a, Rounding rounding) internalpurereturns (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.
*/functionlog2(uint256 value) internalpurereturns (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.
*/functionlog2(uint256 value, Rounding rounding) internalpurereturns (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.
*/functionlog10(uint256 value) internalpurereturns (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.
*/functionlog10(uint256 value, Rounding rounding) internalpurereturns (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.
*/functionlog256(uint256 value) internalpurereturns (uint256) {
uint256 result =0;
unchecked {
if (value >>128>0) {
value >>=128;
result +=16;
}
if (value >>64>0) {
value >>=64;
result +=8;
}
if (value >>32>0) {
value >>=32;
result +=4;
}
if (value >>16>0) {
value >>=16;
result +=2;
}
if (value >>8>0) {
result +=1;
}
}
return result;
}
/**
* @dev Return the log in base 256, following the selected rounding direction, of a positive value.
* Returns 0 if given 0.
*/functionlog256(uint256 value, Rounding rounding) internalpurereturns (uint256) {
unchecked {
uint256 result = log256(value);
return result + (rounding == Rounding.Up &&1<< (result <<3) < value ? 1 : 0);
}
}
}
Contract Source Code
File 4 of 7: MintTZRKT.sol
// SPDX-License-Identifier: MIT////// ________ ________ ________ ________ ________ _________// |\ __ \|\ __ \|\ __ \|\ __ \|\ ____\|\___ ___\// \ \ \|\ /\ \ \|\ \ \ \|\ \ \ \|\ \ \ \___|\|___ \ \_|// \ \ __ \ \ \\\ \ \ \\\ \ \ \\\ \ \_____ \ \ \ \// \ \ \|\ \ \ \\\ \ \ \\\ \ \ \\\ \|____|\ \ \ \ \// \ \_______\ \_______\ \_______\ \_______\____\_\ \ \ \__\// \|_______|\|_______|\|_______|\|_______|\_________\ \|__|// \|_________|////pragmasolidity ^0.8.0;import"@openzeppelin/contracts/access/Ownable.sol";
import"@openzeppelin/contracts/utils/cryptography/ECDSA.sol";
interfaceITZRKT{
functionmint(address to, uint256 amount) external;
functiontotalSupply() externalviewreturns (uint256);
}
contractMintTZRKTisOwnable{
usingECDSAforbytes32;
// TZRKT Contract addressaddressprivate _tzrktContract;
// users mint countmapping(address=>uint256) private _userMintCount;
/**
* whitelist check signer address
*/addressprivate _ogBillySignerAddress;
addressprivate _billyPlusSignerAddress;
addressprivate _billySignerAddress;
/**
* mint start/end time
*/uint256private _ogBillyMintStartTime;
uint256private _ogBillyMintEndTime;
uint256private _billyPlusMintStartTime;
uint256private _billyPlusMintEndTime;
uint256private _billyMintStartTime;
uint256private _billyMintEndTime;
// eventseventTZRKTContractChanged(addressindexed previousContract, addressindexed newContract);
constructor() {
// Minting Time
_ogBillyMintStartTime =1688014800; // 2023-06-29 05:00:00 UTC
_ogBillyMintEndTime =1688057999; // 2023-06-29 16:59:59 UTC
_billyPlusMintStartTime =1688058000; // 2023-06-29 17:00:00 UTC
_billyPlusMintEndTime =1688101199; // 2023-06-30 04:59:59 UTC
_billyMintStartTime =1688101200; // 2023-06-30 05:00:00 UTC
_billyMintEndTime =1688144400; // 2023-06-30 17:20:00 UTC
}
/**
* @notice set address of the TZRKT NFT contract.
* can only be called by the owner
* @param newTzrktContract TZRKT NFT contract address
*/functionsetTZRKTContract(address newTzrktContract) publiconlyOwner{
require(newTzrktContract !=address(0), "setTZRKTContract: contract address is the zero address");
address oldTzrktContract = _tzrktContract;
_tzrktContract = newTzrktContract;
emit TZRKTContractChanged(oldTzrktContract, newTzrktContract);
}
/**
* @notice set address of the OG Billy Signer
* can only be called by the owner
* @param newSigner address of digital signature signer
*/functionsetOgBillySignerAddress(address newSigner) publiconlyOwner{
require(newSigner !=address(0), "setOgBillySignerAddress: signer address is the zero address");
_ogBillySignerAddress = newSigner;
}
/**
* @notice set address of the Billy Plus Signer
* can only be called by the owner
* @param newSigner address of digital signature signer
*/functionsetBillyPlusSignerAddress(address newSigner) publiconlyOwner{
require(newSigner !=address(0), "setBillyPlusSignerAddress: signer address is the zero address");
_billyPlusSignerAddress = newSigner;
}
/**
* @notice set address of the Billy Signer
* can only be called by the owner
* @param newSigner address of digital signature signer
*/functionsetBillySignerAddress(address newSigner) publiconlyOwner{
require(newSigner !=address(0), "setBillySignerAddress: signer address is the zero address");
_billySignerAddress = newSigner;
}
/**
* @notice set OG Billy Mint Time
* can only be called by the owner
* @param startTime mint start epoch time
* @param endTime mint end epoch time
*/functionsetOgBillyMintTime(uint256 startTime, uint256 endTime) publiconlyOwner{
require(startTime < endTime, "setOgBillyMintTime: startTime is greater than endTime");
_ogBillyMintStartTime = startTime;
_ogBillyMintEndTime = endTime;
}
/**
* @notice set Billy Plus Mint Time
* can only be called by the owner
* @param startTime mint start epoch time
* @param endTime mint end epoch time
*/functionsetBillyPlusMintTime(uint256 startTime, uint256 endTime) publiconlyOwner{
require(startTime < endTime, "setBillyPlusMintTime: startTime is greater than endTime");
_billyPlusMintStartTime = startTime;
_billyPlusMintEndTime = endTime;
}
/**
* @notice set Billy Mint Time
* can only be called by the owner
* @param startTime mint start epoch time
* @param endTime mint end epoch time
*/functionsetBillyMintTime(uint256 startTime, uint256 endTime) publiconlyOwner{
require(startTime < endTime, "setBillyMintTime: startTime is greater than endTime");
_billyMintStartTime = startTime;
_billyMintEndTime = endTime;
}
/**
* @notice mint for og billy
* @param amount amount of mint TZRKT
* @param ogBillySignature digital signature of og billy
* @param billyPlusSignature digital signature of billy plus
* @param billySignature digital signature of billy
*/functionmintOgBilly(uint256 amount,
bytesmemory ogBillySignature,
bytesmemory billyPlusSignature,
bytesmemory billySignature
) public{
require(_tzrktContract !=address(0), "mintOgBilly: _tzrktContract is the zero address.");
require(checkOgBillyMintTime(), "mintOgBilly: not minting time");
// signature validate// need og billy signaturebool ogBillyVerified =!_isEmptyStringBytes(ogBillySignature) &&
_verifyAddressSigner(_msgSender(), _ogBillySignerAddress, ogBillySignature);
require(ogBillyVerified, "mintOgBilly: signature invalid");
uint256 mintAvailableCount = getMintAvailableCount(
_msgSender(),
ogBillySignature,
billyPlusSignature,
billySignature
);
require(amount <= mintAvailableCount, "mintOgBilly: exceeded mint supply.");
ITZRKT(_tzrktContract).mint(_msgSender(), amount);
_userMintCount[_msgSender()] += amount;
}
/**
* @notice mint for billy plus
* @param amount amount of mint TZRKT
* @param ogBillySignature digital signature of og billy
* @param billyPlusSignature digital signature of billy plus
* @param billySignature digital signature of billy
*/functionmintBillyPlus(uint256 amount,
bytesmemory ogBillySignature,
bytesmemory billyPlusSignature,
bytesmemory billySignature
) public{
require(_tzrktContract !=address(0), "mintBillyPlus: _tzrktContract is the zero address.");
require(checkBillyPlusMintTime(), "mintBillyPlus: not minting time");
// signature validate// need og billy or billy plusbool ogBillyVerified =!_isEmptyStringBytes(ogBillySignature) &&
_verifyAddressSigner(_msgSender(), _ogBillySignerAddress, ogBillySignature);
bool billyPlusVerified =!_isEmptyStringBytes(billyPlusSignature) &&
_verifyAddressSigner(_msgSender(), _billyPlusSignerAddress, billyPlusSignature);
require(ogBillyVerified || billyPlusVerified, "mintBillyPlus: signature invalid");
uint256 mintAvailableCount = getMintAvailableCount(
_msgSender(),
ogBillySignature,
billyPlusSignature,
billySignature
);
require(amount <= mintAvailableCount, "mintBillyPlus: exceeded mint supply.");
ITZRKT(_tzrktContract).mint(_msgSender(), amount);
_userMintCount[_msgSender()] += amount;
}
/**
* @notice mint for billy
* @param amount amount of mint TZRKT
* @param ogBillySignature digital signature of og billy
* @param billyPlusSignature digital signature of billy plus
* @param billySignature digital signature of billy
*/functionmintBilly(uint256 amount,
bytesmemory ogBillySignature,
bytesmemory billyPlusSignature,
bytesmemory billySignature
) public{
require(_tzrktContract !=address(0), "mintBilly: _tzrktContract is the zero address.");
require(checkBillyMintTime(), "mintBilly: not minting time");
// signature validate// need og billy or billy plus or billybool ogBillyVerified =!_isEmptyStringBytes(ogBillySignature) &&
_verifyAddressSigner(_msgSender(), _ogBillySignerAddress, ogBillySignature);
bool billyPlusVerified =!_isEmptyStringBytes(billyPlusSignature) &&
_verifyAddressSigner(_msgSender(), _billyPlusSignerAddress, billyPlusSignature);
bool billyVerified =!_isEmptyStringBytes(billySignature) &&
_verifyAddressSigner(_msgSender(), _billySignerAddress, billySignature);
require(ogBillyVerified || billyPlusVerified || billyVerified, "mintBilly: signature invalid");
uint256 mintAvailableCount = getMintAvailableCount(
_msgSender(),
ogBillySignature,
billyPlusSignature,
billySignature
);
require(amount <= mintAvailableCount, "mintBilly: exceeded mint supply.");
ITZRKT(_tzrktContract).mint(_msgSender(), amount);
_userMintCount[_msgSender()] += amount;
}
/**
* @notice get current block timestamp
*/functiongetCurrentBlockTime() publicviewreturns (uint) {
returnblock.timestamp;
}
/**
* @notice check start time of OG Billy
*/functioncheckOgBillyMintTime() publicviewreturns (bool) {
return _ogBillyMintStartTime <=block.timestamp&& _ogBillyMintEndTime >=block.timestamp;
}
/**
* @notice check start time of Billy Plus
*/functioncheckBillyPlusMintTime() publicviewreturns (bool) {
return _billyPlusMintStartTime <=block.timestamp&& _billyPlusMintEndTime >=block.timestamp;
}
/**
* @notice check start time of Billy
*/functioncheckBillyMintTime() publicviewreturns (bool) {
return _billyMintStartTime <=block.timestamp&& _billyMintEndTime >=block.timestamp;
}
/**
* @notice get users mint available count by role
* @param sender address of wallet
* @param ogBillySignature digital signature of og billy
* @param billyPlusSignature digital signature of billy plus
* @param billySignature digital signature of billy
*/functiongetMintAvailableCount(address sender,
bytesmemory ogBillySignature,
bytesmemory billyPlusSignature,
bytesmemory billySignature
) publicviewreturns (uint256) {
require(sender !=address(0), "getMintAvailableCount: sender address is the zero address");
uint256 totalMintAvailableCount = _getTotalMintAvailableCount(
sender,
ogBillySignature,
billyPlusSignature,
billySignature
);
return totalMintAvailableCount - _userMintCount[sender];
}
/**
* @notice verify signer
* @param sender address of wallet
* @param signerAddress address of signer
* @param signature digital signature
*/function_verifyAddressSigner(address sender,
address signerAddress,
bytesmemory signature
) privatepurereturns (bool) {
bytes32 messageHash =keccak256(abi.encodePacked(sender));
return signerAddress == messageHash.toEthSignedMessageHash().recover(signature);
}
/**
* @notice get total mint available count by role
* OG Billy: 2, Billy Plus: 1, Billy: 1
* @param sender address of wallet
* @param ogBillySignature digital signature of og billy
* @param billyPlusSignature digital signature of billy plus
* @param billySignature digital signature of billy
*/function_getTotalMintAvailableCount(address sender,
bytesmemory ogBillySignature,
bytesmemory billyPlusSignature,
bytesmemory billySignature
) privateviewreturns (uint256) {
uint256 availableMintAmount =0;
if (
!_isEmptyStringBytes(ogBillySignature) &&
_verifyAddressSigner(sender, _ogBillySignerAddress, ogBillySignature)
) {
availableMintAmount +=2;
}
if (
!_isEmptyStringBytes(billyPlusSignature) &&
_verifyAddressSigner(sender, _billyPlusSignerAddress, billyPlusSignature)
) {
availableMintAmount +=1;
}
if (!_isEmptyStringBytes(billySignature) && _verifyAddressSigner(sender, _billySignerAddress, billySignature)) {
availableMintAmount +=1;
}
return availableMintAmount;
}
/**
* @notice check bytes is empty string
* @param data bytes data
*/function_isEmptyStringBytes(bytesmemory data) privatepurereturns (bool) {
if (data.length==0) {
returntrue;
}
for (uint256 i =0; i < data.length; i++) {
if (data[i] !=0x00) {
returnfalse;
}
}
returntrue;
}
}
Contract Source Code
File 5 of 7: Ownable.sol
// SPDX-License-Identifier: MIT// OpenZeppelin Contracts (last updated v4.9.0) (access/Ownable.sol)pragmasolidity ^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.
*/abstractcontractOwnableisContext{
addressprivate _owner;
eventOwnershipTransferred(addressindexed previousOwner, addressindexed 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.
*/modifieronlyOwner() {
_checkOwner();
_;
}
/**
* @dev Returns the address of the current owner.
*/functionowner() publicviewvirtualreturns (address) {
return _owner;
}
/**
* @dev Throws if the sender is not the owner.
*/function_checkOwner() internalviewvirtual{
require(owner() == _msgSender(), "Ownable: caller is not the owner");
}
/**
* @dev Leaves the contract without owner. It will not be possible to call
* `onlyOwner` functions. Can only be called by the current owner.
*
* NOTE: Renouncing ownership will leave the contract without an owner,
* thereby disabling any functionality that is only available to the owner.
*/functionrenounceOwnership() publicvirtualonlyOwner{
_transferOwnership(address(0));
}
/**
* @dev Transfers ownership of the contract to a new account (`newOwner`).
* Can only be called by the current owner.
*/functiontransferOwnership(address newOwner) publicvirtualonlyOwner{
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) internalvirtual{
address oldOwner = _owner;
_owner = newOwner;
emit OwnershipTransferred(oldOwner, newOwner);
}
}
Contract Source Code
File 6 of 7: SignedMath.sol
// SPDX-License-Identifier: MIT// OpenZeppelin Contracts (last updated v4.8.0) (utils/math/SignedMath.sol)pragmasolidity ^0.8.0;/**
* @dev Standard signed math utilities missing in the Solidity language.
*/librarySignedMath{
/**
* @dev Returns the largest of two signed numbers.
*/functionmax(int256 a, int256 b) internalpurereturns (int256) {
return a > b ? a : b;
}
/**
* @dev Returns the smallest of two signed numbers.
*/functionmin(int256 a, int256 b) internalpurereturns (int256) {
return a < b ? a : b;
}
/**
* @dev Returns the average of two signed numbers without overflow.
* The result is rounded towards zero.
*/functionaverage(int256 a, int256 b) internalpurereturns (int256) {
// Formula from the book "Hacker's Delight"int256 x = (a & b) + ((a ^ b) >>1);
return x + (int256(uint256(x) >>255) & (a ^ b));
}
/**
* @dev Returns the absolute unsigned value of a signed value.
*/functionabs(int256 n) internalpurereturns (uint256) {
unchecked {
// must be unchecked in order to support `n = type(int256).min`returnuint256(n >=0 ? n : -n);
}
}
}
Contract Source Code
File 7 of 7: Strings.sol
// SPDX-License-Identifier: MIT// OpenZeppelin Contracts (last updated v4.9.0) (utils/Strings.sol)pragmasolidity ^0.8.0;import"./math/Math.sol";
import"./math/SignedMath.sol";
/**
* @dev String operations.
*/libraryStrings{
bytes16privateconstant _SYMBOLS ="0123456789abcdef";
uint8privateconstant _ADDRESS_LENGTH =20;
/**
* @dev Converts a `uint256` to its ASCII `string` decimal representation.
*/functiontoString(uint256 value) internalpurereturns (stringmemory) {
unchecked {
uint256 length = Math.log10(value) +1;
stringmemory buffer =newstring(length);
uint256 ptr;
/// @solidity memory-safe-assemblyassembly {
ptr :=add(buffer, add(32, length))
}
while (true) {
ptr--;
/// @solidity memory-safe-assemblyassembly {
mstore8(ptr, byte(mod(value, 10), _SYMBOLS))
}
value /=10;
if (value ==0) break;
}
return buffer;
}
}
/**
* @dev Converts a `int256` to its ASCII `string` decimal representation.
*/functiontoString(int256 value) internalpurereturns (stringmemory) {
returnstring(abi.encodePacked(value <0 ? "-" : "", toString(SignedMath.abs(value))));
}
/**
* @dev Converts a `uint256` to its ASCII `string` hexadecimal representation.
*/functiontoHexString(uint256 value) internalpurereturns (stringmemory) {
unchecked {
return toHexString(value, Math.log256(value) +1);
}
}
/**
* @dev Converts a `uint256` to its ASCII `string` hexadecimal representation with fixed length.
*/functiontoHexString(uint256 value, uint256 length) internalpurereturns (stringmemory) {
bytesmemory buffer =newbytes(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");
returnstring(buffer);
}
/**
* @dev Converts an `address` with fixed length of 20 bytes to its not checksummed ASCII `string` hexadecimal representation.
*/functiontoHexString(address addr) internalpurereturns (stringmemory) {
return toHexString(uint256(uint160(addr)), _ADDRESS_LENGTH);
}
/**
* @dev Returns true if the two strings are equal.
*/functionequal(stringmemory a, stringmemory b) internalpurereturns (bool) {
returnkeccak256(bytes(a)) ==keccak256(bytes(b));
}
}