// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v4.8.0) (utils/Address.sol)
pragma solidity ^0.8.1;
/**
* @dev Collection of functions related to the address type
*/
library Address {
/**
* @dev Returns true if `account` is a contract.
*
* [IMPORTANT]
* ====
* It is unsafe to assume that an address for which this function returns
* false is an externally-owned account (EOA) and not a contract.
*
* Among others, `isContract` will return false for the following
* types of addresses:
*
* - an externally-owned account
* - a contract in construction
* - an address where a contract will be created
* - an address where a contract lived, but was destroyed
* ====
*
* [IMPORTANT]
* ====
* You shouldn't rely on `isContract` to protect against flash loan attacks!
*
* Preventing calls from contracts is highly discouraged. It breaks composability, breaks support for smart wallets
* like Gnosis Safe, and does not provide security since it can be circumvented by calling from a contract
* constructor.
* ====
*/
function isContract(address account) internal view returns (bool) {
// This method relies on extcodesize/address.code.length, which returns 0
// for contracts in construction, since the code is only stored at the end
// of the constructor execution.
return account.code.length > 0;
}
/**
* @dev Replacement for Solidity's `transfer`: sends `amount` wei to
* `recipient`, forwarding all available gas and reverting on errors.
*
* https://eips.ethereum.org/EIPS/eip-1884[EIP1884] increases the gas cost
* of certain opcodes, possibly making contracts go over the 2300 gas limit
* imposed by `transfer`, making them unable to receive funds via
* `transfer`. {sendValue} removes this limitation.
*
* https://diligence.consensys.net/posts/2019/09/stop-using-soliditys-transfer-now/[Learn more].
*
* IMPORTANT: because control is transferred to `recipient`, care must be
* taken to not create reentrancy vulnerabilities. Consider using
* {ReentrancyGuard} or the
* https://solidity.readthedocs.io/en/v0.5.11/security-considerations.html#use-the-checks-effects-interactions-pattern[checks-effects-interactions pattern].
*/
function sendValue(address payable recipient, uint256 amount) internal {
require(address(this).balance >= amount, "Address: insufficient balance");
(bool success, ) = recipient.call{value: amount}("");
require(success, "Address: unable to send value, recipient may have reverted");
}
/**
* @dev Performs a Solidity function call using a low level `call`. A
* plain `call` is an unsafe replacement for a function call: use this
* function instead.
*
* If `target` reverts with a revert reason, it is bubbled up by this
* function (like regular Solidity function calls).
*
* Returns the raw returned data. To convert to the expected return value,
* use https://solidity.readthedocs.io/en/latest/units-and-global-variables.html?highlight=abi.decode#abi-encoding-and-decoding-functions[`abi.decode`].
*
* Requirements:
*
* - `target` must be a contract.
* - calling `target` with `data` must not revert.
*
* _Available since v3.1._
*/
function functionCall(address target, bytes memory data) internal returns (bytes memory) {
return functionCallWithValue(target, data, 0, "Address: low-level call failed");
}
/**
* @dev Same as {xref-Address-functionCall-address-bytes-}[`functionCall`], but with
* `errorMessage` as a fallback revert reason when `target` reverts.
*
* _Available since v3.1._
*/
function functionCall(
address target,
bytes memory data,
string memory errorMessage
) internal returns (bytes memory) {
return functionCallWithValue(target, data, 0, errorMessage);
}
/**
* @dev Same as {xref-Address-functionCall-address-bytes-}[`functionCall`],
* but also transferring `value` wei to `target`.
*
* Requirements:
*
* - the calling contract must have an ETH balance of at least `value`.
* - the called Solidity function must be `payable`.
*
* _Available since v3.1._
*/
function functionCallWithValue(
address target,
bytes memory data,
uint256 value
) internal returns (bytes memory) {
return functionCallWithValue(target, data, value, "Address: low-level call with value failed");
}
/**
* @dev Same as {xref-Address-functionCallWithValue-address-bytes-uint256-}[`functionCallWithValue`], but
* with `errorMessage` as a fallback revert reason when `target` reverts.
*
* _Available since v3.1._
*/
function functionCallWithValue(
address target,
bytes memory data,
uint256 value,
string memory errorMessage
) internal returns (bytes memory) {
require(address(this).balance >= value, "Address: insufficient balance for call");
(bool success, bytes memory returndata) = target.call{value: value}(data);
return verifyCallResultFromTarget(target, success, returndata, errorMessage);
}
/**
* @dev Same as {xref-Address-functionCall-address-bytes-}[`functionCall`],
* but performing a static call.
*
* _Available since v3.3._
*/
function functionStaticCall(address target, bytes memory data) internal view returns (bytes memory) {
return functionStaticCall(target, data, "Address: low-level static call failed");
}
/**
* @dev Same as {xref-Address-functionCall-address-bytes-string-}[`functionCall`],
* but performing a static call.
*
* _Available since v3.3._
*/
function functionStaticCall(
address target,
bytes memory data,
string memory errorMessage
) internal view returns (bytes memory) {
(bool success, bytes memory returndata) = target.staticcall(data);
return verifyCallResultFromTarget(target, success, returndata, errorMessage);
}
/**
* @dev Same as {xref-Address-functionCall-address-bytes-}[`functionCall`],
* but performing a delegate call.
*
* _Available since v3.4._
*/
function functionDelegateCall(address target, bytes memory data) internal returns (bytes memory) {
return functionDelegateCall(target, data, "Address: low-level delegate call failed");
}
/**
* @dev Same as {xref-Address-functionCall-address-bytes-string-}[`functionCall`],
* but performing a delegate call.
*
* _Available since v3.4._
*/
function functionDelegateCall(
address target,
bytes memory data,
string memory errorMessage
) internal returns (bytes memory) {
(bool success, bytes memory returndata) = target.delegatecall(data);
return verifyCallResultFromTarget(target, success, returndata, errorMessage);
}
/**
* @dev Tool to verify that a low level call to smart-contract was successful, and revert (either by bubbling
* the revert reason or using the provided one) in case of unsuccessful call or if target was not a contract.
*
* _Available since v4.8._
*/
function verifyCallResultFromTarget(
address target,
bool success,
bytes memory returndata,
string memory errorMessage
) internal view returns (bytes memory) {
if (success) {
if (returndata.length == 0) {
// only check isContract if the call was successful and the return data is empty
// otherwise we already know that it was a contract
require(isContract(target), "Address: call to non-contract");
}
return returndata;
} else {
_revert(returndata, errorMessage);
}
}
/**
* @dev Tool to verify that a low level call was successful, and revert if it wasn't, either by bubbling the
* revert reason or using the provided one.
*
* _Available since v4.3._
*/
function verifyCallResult(
bool success,
bytes memory returndata,
string memory errorMessage
) internal pure returns (bytes memory) {
if (success) {
return returndata;
} else {
_revert(returndata, errorMessage);
}
}
function _revert(bytes memory returndata, string memory errorMessage) private pure {
// Look for revert reason and bubble it up if present
if (returndata.length > 0) {
// The easiest way to bubble the revert reason is using memory via assembly
/// @solidity memory-safe-assembly
assembly {
let returndata_size := mload(returndata)
revert(add(32, returndata), returndata_size)
}
} else {
revert(errorMessage);
}
}
}
// 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
pragma solidity ^0.8.18;
/*
*@@@=
-%@@+-+*--#@@#:
.+@@#:-*@@@#@@@@#=-=@@%-
*@@=::*@@*====#@#+++*@@%---#@@=
=@@#=:+@@@*======++*@#*+++===+%@@*--+@@%:
.*@@%--#@@@+====-=====++#@%**++======-=%@@%=-+@@@=
:#@@=:-#@@*=-=====+%@@*=++++#@%#*+++==---=-----+@@@+--#@@+.
-@@+:.=@@#========+@@#%@ @*+++**#@%#**++===========-==-=#@@*--=@@@.
.#@@*:-#@@#=--=--==#@@*: .#% @*+++++#@@##*+++=======-===========#@@@=-+%@@=
-%@@-:+@@@+-----==+@@@=:+ .%%.@*++++*#@@##**++===================----+@@@#=-#@@*:
.=@@+::+@@#----=-==*@@# :+ :#@% @*++***%@@##**++============================#@@#=-=@@%:
.%@@=:-@@@+=------=@@@-..* :*=*: .#@ @#++***%@@%#**++================================+@@@+-=#@@-
=@@%-:*@@%=-------*@@@- .* :+=++ .#@ @#+**#*%@@%#**++====================================+%@@%=-#@@%:
:*@@*:-#@@#-------=#@@+ .% -%++ :+ .%@.@#+****%@@%#**+++========================================#@@#+-+@@%-
.@@@:.-@@@=-------=@@@% .% .+%..* :+ :%@@ @#****#%@@%#**++++==============+++=====+++===================@@@+--*@@=
*@@*-:#@@#+--=-=--#@@+. .% +@=. .* :*=*:. .#@ @#***#*%@@%##*+++================+++=+++=. .-=============+#@@%=-+@@@:
:#@@*:=%@@#------=+@@@**. .% .=== .% .* :++*+ .#@ @#****#%@@%##*+++============++++=++++- :++- :+++++===========#@@@*-+@@@=
-@@%::+@@@=------=+@@%. *. :*@: .% -%+* :+ .%@.@#**#*#%@@%##*++++========+=====++++- @@@@@@@@: :=++++++++++========%@@*=-*@@+.
+@@+-:#@@*=----===#@@=.+ *.-#=. .% .@ .=#::* .+ .%@@ @#****#%@@%##*+++===+====+++++++++: @@@@@@@@@@@@- .++++++++++++++++++==+*@@@--+@@%.
=@@@@@@#+======*@@%- + .++%. .% +@=: .* :*=+-. .#@ @#*#***%@@%%#**+++========+++++=. -@@@@@@@@@@@@@@@@# .=++++++++++++++++++++=+*@@@*-+%@@=
=@..@+=====*@@#. * *-=+: *. .% .=== .% .* :++*+ .#@ @#*#***%@@%%#**+++==+=+==++++=. +@@@@@@@@@@@@@@@@@@@@%. -+++++++++++++++++++++++++%@@%+-#@@*.
=@.:@++====@@ * -#=+ *. .*@: .% :%** :+ .#@.@%*#*##%@@@%#**++++==+++++=- *@@@@@@@@@@@@%@@@@@@@@@@@@. -++++++++++++++++++++++++++++@@@=-=@@#.
-@..@++++++@@ %*+. + *.-#-. .% .% .=#::+ :+ :%@@ @%#####%@@@%##***++++++++- @@@@@@@@@@@@% +@@@@@@@@@@@@: .+++++++++++++++++++++++++++++*%@@#=+#@@-
=@.:@*+++++@@-*=:# + .++%. .% +@=: .+ :*=+=. .%@.@%#####%@@@%%#***++++++: -@@@@@@@@@@@@* -@@@@@@@@@@@@+ +*******************+++++++++++++%@@@@@
=@.:@*+++++@@ # *:=#: *. .% .-++ .% .+ .=**- .:=*#@@@@%##*****+. -@@@@@@@@@@@@= .++: .@@@@@@@@@@@@ .***********************+*++++++++@@@@@
=@.:@*+++++@@ * -%=+ *. .*@: .% :%*= :####** +@@@@@@@@@@@@ :++++++- @@@@@@@@@@ .***************************++****@@@@@
=@.:@*****+@@ %*+: + *.-*-: .% .% .=*: .*@@@@@@@@@@@@@@@@@*. : @@@@@@@@@@@@@@# =*+++++++= #@@@@@* +*********************************@@@@@
=@.:@#**+*+@@-++:* + .=+@. .% +@+- -%@@@@@@@@@@@@@@@@@@@@@@@@@@@%- .@@@@@@@@@@@@@@@@@@@ -*+**++**=. .+**********************************@@@@@
=@.:@#*****@@ * *:=%: *. .% .-+* .: .*@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@=-@@@@@@@@@@@@@@@@@@@@@@@: :+********=.. ..+*************************************@@@@@
=@.:@#*****@@ * -#-* *. .#@: =@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@- =@@@@@@@@@@@@: -*****************************************************@@@@@
=@.:@#*****@@ %++- + #:-*-: .@ #@@@@@@@@@@@@@@@+- -+@@@@@@@@@@@@@@@@@@@@: -@@@@@@@@@@@@. +*********************************####**######*######@@@@@
=@.:@******@@-+*:# + .=*@. .@ *@@@@@@@@@@@@# .@@@@@@@@@@@@@@. : .@@@@@@@@@@* -*****************************#######################@@@@@
=@.:@******@@ # *:+@: #. .@ .@@@@@@@@@@@# .++++++++++++: .@@@@@@@@@@@@@ =%%#+ @@@@@@@@ *###############****#################################@@@@@
=@.-@#*****@@ # -%-# #. -*@- .@@@@@@@@@@= =+++++=++++++=. :@@@@@@@@@@@@+ =++++**#*. .:-: *#####################################################@@@@@
=@.:@#*****@@ @+++. * .@+@@@*: +@@@@@@@@@@ .+++++++++++++=. =@@@@@@@@@@@@= .=++++++++++++: :+#######################################################@@@@@
=@:-@#*****@@-+#:# * :*@@@=-*@@% .@@@@@@@@@+ +++++++++++++- *@@@@@@@@@@@@: .+++++++++++++++++++*%@%%%######%#####%%##########################################@@@@@
=@::@%#####@@ # @*@@*::@@@*### @@@@@@@@@* .++++++++++=+- @@@@@@@@@@@@@ -++++++++++++++++++++*+**+@@@%%%%%%%%%%%%%%%%%%%%%##################################@@@@@
=@::@%#####@@ # .=@@@*:%@@@#######= +@@@@@@@@@ +++++++++++: @@@@@@@@@@@@# =+++++++++++++++++++++*++++*+*+#@@@@%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%###%%######%@@@@@
=@::@%#%#%%@@ :@@@@=+@@@%########@@@: @@@@@@@@@. =+++++++++= -@@@@@@@@@@@@* .=++++++++++++++++++*++++++*++++++++++*@@@@@%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%@@@@@
=@:-@@%%%%%@@*@@#==@@@######%%@@@@@*++. @@@@@@@@@. =+++++++++. @@@@@@@@@@@@- .++++++++++*+++++++++*++*++*++*++++*++*+*+****@@@@%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%@@@@@
=@:-@@%%%@%@@=@@@%%##%##%#%@@@#**+++++ @@@@@@@@@ ++++++++++. @@@@@@@@@@. :+++++++++++++++++++*++*+*+++++++++*++++*+*******+**@@@@%@%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%@@@@@
=@--@@@@@@%@@%%%%%%%%%@@@@#+++++++++++. @@@@@@@@@. =+++++++++- .@@@@@@%. -+++++++++++++++++++++++++++++++++++++++++++*++******+****@@@@@@@@@@@@@@@@@@@@@@%%%%%%%%%%%%%%%@@@@@
=@--@@@@@@@%%%%%@@@@@@++++++++++++++++: *@@@@@@@@* :++++++++++= =++++++++++++++++++*+++++++++++*+++++++++*++*+***+******+*******#@@@@@@@@@@@@@@@@@@@@@@@@%%%%%%%%@@@@@
=@--@@@@@@@@@@@@@*++++++++++++++++++++= @@@@@@@@@: :++++++++++++: :++++++++++++++++++++++++++++++**++++++*+++++*+*+*+***+**+**+***********@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@
=@--@@@@@@@@%*+++++++++++++++++++++++++- -@@@@@@@@@. :+++++++++++++++++++++*++++++++++++++++++++++++++++++++*+++++++++++*++*+++**+*******************#@@@@@@@@@@@@@@@@@@@@@@@@@@@@
=@--@@@@@***++++++++++++++++++++++++++++. @@@@@@@@@@- =++++++++++++++++++++++++++++: :+++++++++++++*+++++++*+*****+++*****+*+*+*******************#@@@@@@@@@@@@@@@@@@@@@@@@
=@++@@@%****++++++++++++++++++++++++++++= %@@@@@@@@@@. -+++++++++++++++++++++++= =+++++++++++**+++*+*++++++++**+++*******+**********************@@@@@@@@@@@@@@@@@@@@
-@@%+++#@@@++++++++++++++++++++++++++++++ *@@@@@@@@@@@ :++++++++++++++++*: @@@@@@@ -+++++*+++++*++*++**+**+++++*+*+**++***+*+************************#@@@@@@@@@@@@@@@
-@@@*++#@@@#++++++++++++++++++++++++++. @@@@@@@@@@@@# ...:::::... %@@@@@@@@@@ .+++++++++++++++++*++***+*****+**+*********************************#**%@@@@@@@@@@@
.%@@%++*@@@@*++++++++++++++++++++++- -@@@@@@@@@@@@@@*: :*@@@@@@@@@@@@@@ .++++++*+++++**+++++***+****+****+****************************************#@@@@@@@
+@@%****@@@*++++++++++++++++++++: .@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@. +*+++*++++++*+++*+++*+*+++***+****+*********************************##**#@@@@@@@@@
:@@@*++*%@@#++++++++++++++++++- +@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@+ -++++*+++++++++*++**++++++*****+**************************#***********#@@@@@@@@@@-
.*@@@+**@@@@*+++++++++++++++=. =@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@= .=+++++*+++++**++++++++***++***+*+***********************************@@@@@@@@@@%=
+@@@#+*#@@@%++++++++++++++=. .#@@@@@@@@@@@@@@@@@@@@@#. .=+*+++++*+++++++***+++***+*++++*************+*********************#@@@@@@@@@@%.
.@@@**+*%@@%*+++++++++++++- ... =+++*++++++++++++**++++*+*+****+**+**+****+***********************#@@@@@@@@@@-
.+@@%***%@@@*+++++*++++++++=-. .-=++++++++++*+*++++*+**+***+++**+*********+*************************@@@@@@@@@@%-
+@@@#**#@@@@+++++++++*+++++++++++++++++*++++++++++++**++++**+*+*+***+*+*++*++*****************************#@@@@@@@@@@#.
.@@@#***@@@@#*+*+++*++++*+++++*++++++***+++++***++**+*****+*+***********+*************************%@@@@@@@@@@=
=@@#***#@@@*+++++*+*++**+++**+***++*+++**+*+*+*+****+**+*+**********+********************%@@@@@@@@@#.
=%@@#**#@@@@**+*++*+++++*+*+**+++**+*****++***+++******+************************#@@@@@@@@@@*.
.%@@@***%@@@#++*****************+**++***+++*****************************@@@@@@@@@@@+
=@@@#*#*@@@#******+***+*++*************************************@@@@@@@@@@@.
:@@@#**#%@@@*************+*****************************@@@@@@@@@@=.
:#@@@***%@@@%*********************************@@@@@@@@@@@+
+@@@%**#@@@@#***********************#@@@@@@@@@@@:
.@@@##*##@@@#***************#@@@@@@@@@@+
.*@@@#*##@@@%*******@@@@@@@@@@@-
+@@@%###@@@@@@@@@@@@@%-
:@@@%#@@@@@@@*
=@@@:
=@@@@@@@@@- .@@@@@@@@@@%: @@@: :@@@ @@@@@@@@@@@- @@@@@@@@@@@@@@@@- -%@@@@@@@@= .@@@@@@@@@@@@@: *@@* =@@@ @@@@@@@@@@@@@@@@. .*@@@@@@@@%-
@@@@@@@@@@@@@@% =@@@@@@@@@@@@@. @@@@# #@@@@ @@@@@@@@@@@@@= #@@@@@@@@@@@@@@@. @@@@@@@@@@@@@@@. :@@@@@@@@@@@@@ @@@@ =@@@@@ @@@@@@@@@@@@@@@@ @@@@@@@@@@@@@@:
-@@@@: -@@: =@@@- .@@@@ +@@@@ @@@@+ @@@# %@@@ %@@@ :@@@@: .@@@@* :@@@= @@@@ =@@@@@@@ @@@@ #@@@- ..
.@@@@ =@@@- @@@@ .@@@@=-@@@@: @@@# #@@@ %@@@ @@@@ %@@@: :@@@+..... @@@@ -@@@%:@@@@. @@@@ =@@@@@@#+:
:@@@* =@@@@@@@@@@@@@- #@@@@@@# @@@@@@@@@@@@@* %@@@ .@@@@ -@@@- :@@@@@@@@@@@@ @@@@ =@@@@ .@@@@ @@@@ @@@@@@@@@@@%
@@@@. =@@@@@@@@@@@: .@@@@. @@@@@@@@@@@= %@@@ @@@@: @@@@. :@@@+....... @@@@ :@@@@@@@@@@@@@ @@@@ .-%@@@@:
@@@@@. :@@@% =@@@- @@@@# @@@@ @@@# %@@@ @@@@@: #@@@@: :@@@= @@@@ -@@@@@@@@@@@@@@@ @@@@ :@@= %@@@:
=@@@@@@@@@@@@@: =@@@- =@@@@ @@@@ @@@# %@@@ -@@@@@@@@@@@@@+ :@@@= @@@@@@@@@@@@@@% @@@@ :@@@@ @@@@ #@@@@@@@@@@@@@+
*@@@@@+ =@= .%@. .@@. :@* #%. =@@@@@#. -@= .#@@@@@@@@@@@# =@= .%% .## .*@@@@@%:
*/
import "@openzeppelin/contracts/utils/cryptography/MerkleProof.sol";
import "@openzeppelin/contracts/token/common/ERC2981.sol";
import "@openzeppelin/contracts/token/ERC721/IERC721.sol";
import "@openzeppelin/contracts/access/Ownable.sol";
import "@openzeppelin/contracts/utils/Strings.sol";
import "../utils/ERC721BalanceMemory.sol";
import "../utils/Locker.sol";
import "./ICryptoflatsNFTGen.sol";
import "./ERC721R.sol";
contract CryptoflatsNFT is
ICryptoflatsNFTGen,
ERC721R,
ERC2981,
Ownable,
Locker,
ERC721BalanceMemory
{
event Received(address indexed from, uint256 amount);
event CNRSMinted(uint256 quantity);
event OwnerMinted(uint256 quantity);
using Strings for uint256;
string private _baseURIOption;
Type[] private _raritiesArray;
/*********************************************************************************/
/* CRYPTOFLATS GEN OPTIONS */
/*********************************************************************************/
uint8 public constant MAX_ALLOWED_MINT_FOR_FREE_WHITELIST = 1;
uint8 public constant MAX_ALLOWED_MINT_FOR_DISCOUNT_WHITELIST = 3;
uint96 public constant DEFAULT_ROYALTY = 500; // 5%
// Owner can change price once a week for 1 - 0.001 ether
uint256 public constant LOCK_PERIOD = 604800; // One week in seconds
uint256 public constant MAX_INITIAL_PRICE_FOR_PUBLIC_SALE = 1 ether;
uint256 public constant MIN_INITIAL_PRICE_FOR_PUBLIC_SALE = 0.001 ether;
uint256 public constant MAX_INITIAL_PRICE_FOR_EARLY_ACCESS_SALE = 0.5 ether;
uint256 public constant MIN_INITIAL_PRICE_FOR_EARLY_ACCESS_SALE = MIN_INITIAL_PRICE_FOR_PUBLIC_SALE;
uint16 public immutable PLACES_FOR_FREE_ACCESS_WHITELIST;
uint16 public immutable PLACES_FOR_EARLY_ACCESS_WHITELIST;
uint256 public immutable MAX_SUPPLY;
/*********************************************************************************/
/* CRYPTOFLATS GEN DYNAMIC OPTIONS */
/*********************************************************************************/
uint16 public earlyAccessPlacesCounter;
uint16 public freeAccessPlacesCounter;
address payable public teamWallet;
uint256 public gen;
uint256 public earlyAccessPrice;
uint256 public publicSalePrice;
bytes32 public whitelistFreePurchaseRoot;
bytes32 public whitelistEarlyAccessRoot;
mapping(address => bool) public isWhitelistFreePurchaseUserMintedOnce;
mapping(address => uint256) public getMintCountForEarlyAccessUser;
bool public isPublicSaleActive;
constructor(
string memory name_,
string memory symbol_,
string memory baseURI_,
address payable teamWallet_,
uint256 gen_,
uint256 maxSupply_,
uint256 publicSalePrice_,
uint256 earlyAccessPrice_,
uint16 placesForFreeAccessWhitelist_,
uint16 placesForEarlyAccessWhitelist_
) ERC721R(name_, symbol_, maxSupply_) {
gen = gen_;
_baseURIOption = baseURI_;
teamWallet = teamWallet_;
earlyAccessPrice = earlyAccessPrice_;
publicSalePrice = publicSalePrice_;
MAX_SUPPLY = maxSupply_;
PLACES_FOR_FREE_ACCESS_WHITELIST = placesForFreeAccessWhitelist_;
PLACES_FOR_EARLY_ACCESS_WHITELIST = placesForEarlyAccessWhitelist_;
isPublicSaleActive = false;
_setDefaultRoyalty(msg.sender, DEFAULT_ROYALTY);
}
receive() external payable {
emit Received(msg.sender, msg.value);
}
function tokenURI(
uint256 tokenId
) public view virtual override returns (string memory) {
require(
_exists(tokenId),
"ERC721Metadata: URI query for nonexistent token"
);
string memory baseURI = _baseURI();
return bytes(baseURI).length > 0 ? string(abi.encodePacked(baseURI, "/", tokenId.toString(), ".json")) : "";
}
function supportsInterface(bytes4 interfaceId)
public
view
virtual
override(ERC2981, ERC721R)
returns (bool) {
return super.supportsInterface(interfaceId);
}
function getNFTType(uint256 _id) external view returns (Type) {
require(_exists(_id), string(abi.encodePacked(symbol(), ": Token doesn't exsits")));
Type rarity;
if(gen == 0) {
rarity = _id < 999 ? Type.Gold: Type.Diamond;
} else {
rarity = _raritiesArray[_id];
}
return rarity;
}
function mint(uint256 quantity) external payable {
require(quantity > 0, string(abi.encodePacked(symbol(), ": Quantity should be greather then zero!")));
if(msg.sender != owner()) {
require(isPublicSaleActive == true, string(abi.encodePacked(symbol(), ": Public sale is inactive!")));
assert(msg.value >= (publicSalePrice * quantity));
} else {
emit OwnerMinted(quantity);
}
_mintRandom(msg.sender, quantity);
emit CNRSMinted(quantity);
}
function mintFreeAccess(bytes32[] calldata whitelistFreePurchaseProof) external {
require(
isUserFreePurchaseWhitelist(whitelistFreePurchaseProof, msg.sender),
string(abi.encodePacked(symbol(), ": Unfortunately, you are not in a free purchase whitelist!"))
);
isWhitelistFreePurchaseUserMintedOnce[msg.sender] = true;
_mintRandom(msg.sender, 1);
emit CNRSMinted(1);
}
function mintEarlyAccess(
bytes32[] calldata whitelistEarlyAccessProof,
uint256 quantity
) external payable {
require(
quantity > 0,
string(abi.encodePacked(symbol(), ": Insufficient quantity"))
);
require(
isUserEarlyAccessWhitelist(whitelistEarlyAccessProof, msg.sender),
string(abi.encodePacked(symbol(), ": Unfortunately, you are not in early access whitelist!"))
);
require(
getMintCountForEarlyAccessUser[msg.sender] + quantity <= MAX_ALLOWED_MINT_FOR_DISCOUNT_WHITELIST,
string(abi.encodePacked(symbol(), ": Early access mint is only possible in the amount of 3 pieces!"))
);
assert(msg.value >= (earlyAccessPrice * quantity));
unchecked {
getMintCountForEarlyAccessUser[msg.sender] += quantity;
}
_mintRandom(msg.sender, quantity);
emit CNRSMinted(quantity);
}
function isUserFreePurchaseWhitelist(
bytes32[] calldata whitelistMerkleProof,
address account
) public view returns (bool) {
if(
whitelistFreePurchaseRoot == bytes32(0) ||
whitelistMerkleProof.length == 0 ||
account == address(0) ||
isWhitelistFreePurchaseUserMintedOnce[account] == true
) {
return false;
}
return MerkleProof.verify(
whitelistMerkleProof,
whitelistFreePurchaseRoot,
keccak256(abi.encodePacked(account))
);
}
function isUserEarlyAccessWhitelist(
bytes32[] calldata whitelistMerkleProof,
address account
) public view returns (bool) {
if(
whitelistEarlyAccessRoot == bytes32(0) ||
whitelistMerkleProof.length == 0 ||
account == address(0) ||
getMintCountForEarlyAccessUser[account] >= MAX_ALLOWED_MINT_FOR_DISCOUNT_WHITELIST
) {
return false;
}
return MerkleProof.verify(
whitelistMerkleProof,
whitelistEarlyAccessRoot,
keccak256(abi.encodePacked(account))
);
}
/*********************************************************************************/
/* CRYPTOFLATS GEN OWNABLE FUNCTIONS */
/*********************************************************************************/
function airdrop(address to, uint256 tokenId) external onlyOwner {
require(_exists(tokenId) == false, string(abi.encodePacked(symbol(), ": token ID is already minted!")));
_mintAtIndex(to, tokenId);
}
function setRaritiesArray(Type[] memory rarityArray) external onlyOwner {
if(_raritiesArray.length == 0) {
_raritiesArray = rarityArray;
} else {
for(uint256 i = 0; i < rarityArray.length;){
_raritiesArray.push(rarityArray[i]);
unchecked{ ++i; }
}
}
}
function clearRaritiesArray() external onlyOwner {
delete _raritiesArray;
}
function getRaritiesArray() external onlyOwner view returns (Type[] memory) {
return _raritiesArray;
}
function setNewTeamWallet(address payable newTeamWallet) external onlyOwner {
teamWallet = newTeamWallet;
emit TeamWalletTransferred(msg.sender, teamWallet, newTeamWallet);
}
function setNewFreePurchaseWhitelistRoot(bytes32 newFreePurchaseWhitelistRoot, int16 value) external onlyOwner {
if(value >= 0) {
_addInFreeAccessCounter(uint16(value));
} else {
_subFromFreeAccessCounter(uint16(-value));
}
emit WhitelistRootChanged(
msg.sender,
whitelistFreePurchaseRoot,
newFreePurchaseWhitelistRoot,
"Free Purchase"
);
whitelistFreePurchaseRoot = newFreePurchaseWhitelistRoot;
}
function setNewEarlyAccessWhitelistRoot(bytes32 newEarlyAccessWhitelistRoot, int16 value) external onlyOwner {
if(value >= 0) {
_addInEarlyAccessCounter(uint16(value));
} else {
_subFromEarlyAccessCounter(uint16(-value));
}
emit WhitelistRootChanged(
msg.sender,
whitelistFreePurchaseRoot,
newEarlyAccessWhitelistRoot,
"Early Access"
);
whitelistEarlyAccessRoot = newEarlyAccessWhitelistRoot;
}
function activatePublicSale() external onlyOwner
{
isPublicSaleActive = true;
}
function deactivatePublicSale() external onlyOwner
{
isPublicSaleActive = false;
}
function changePublicSalePrice(uint256 newPublicSalePrice)
external
onlyOwner
lockWithDelayBySelector(
LOCK_PERIOD,
bytes4(keccak256("changePublicSalePrice(uint256)")
)) {
require(
newPublicSalePrice <= MAX_INITIAL_PRICE_FOR_PUBLIC_SALE &&
newPublicSalePrice >= MIN_INITIAL_PRICE_FOR_PUBLIC_SALE,
string(abi.encodePacked(symbol(), ": New public sale price is not in limit diapason"))
);
publicSalePrice = newPublicSalePrice;
}
function changeEarlyAccessSalePrice(uint256 newEarlyAccessSalePrice)
external
onlyOwner
lockWithDelayBySelector(
LOCK_PERIOD,
bytes4(keccak256("changeEarlyAccessSalePrice(uint256)")
)) {
require(
newEarlyAccessSalePrice <= MAX_INITIAL_PRICE_FOR_EARLY_ACCESS_SALE &&
newEarlyAccessSalePrice >= MIN_INITIAL_PRICE_FOR_EARLY_ACCESS_SALE,
string(abi.encodePacked(symbol(), ": New early access sale price is not in limit diapason"))
);
earlyAccessPrice = newEarlyAccessSalePrice;
}
function withdrawBalance()
external
onlyOwner
returns (bool) {
uint256 balance = address(this).balance;
require(balance > 0, string(abi.encodePacked(symbol(), ": zero balance")));
(bool sent, ) = teamWallet.call{value: balance}("");
require(sent, string(abi.encodePacked(symbol(), ": Failed to send Ether")));
return sent;
}
/*********************************************************************************/
/* CRYPTOFLATS GEN HELPERS */
/*********************************************************************************/
function _addInEarlyAccessCounter(uint16 term) private {
require((earlyAccessPlacesCounter + term) <= PLACES_FOR_EARLY_ACCESS_WHITELIST, string(abi.encodePacked(symbol(), ": it's not possible to add a term, since the limit for early access places will be exceeded!")));
unchecked {
earlyAccessPlacesCounter += term;
}
}
function _subFromEarlyAccessCounter(uint16 substract) private {
require(earlyAccessPlacesCounter > substract, string(abi.encodePacked(symbol(), ": It's impossible to subtract the difference because the subtracted value exceeds the reduced value!")));
unchecked {
earlyAccessPlacesCounter -= substract;
}
}
function _addInFreeAccessCounter(uint16 term) private {
require((freeAccessPlacesCounter + term) <= PLACES_FOR_FREE_ACCESS_WHITELIST, string(abi.encodePacked(symbol(), ": it's not possible to add a term, since the limit for free access places will be exceeded!")));
unchecked {
freeAccessPlacesCounter += term;
}
}
function _subFromFreeAccessCounter(uint16 substract) private {
require(freeAccessPlacesCounter > substract, string(abi.encodePacked(symbol(), ": It's impossible to subtract the difference because the subtracted value exceeds the reduced value!")));
unchecked {
freeAccessPlacesCounter -= substract;
}
}
/*********************************************************************************/
/* CRYPTOFLATS GEN OVERRIDINGS */
/*********************************************************************************/
function _beforeTokenTransfer(
address from,
address to,
uint256 tokenId
) internal override {
if(from == address(0)) {
_addId(to, tokenId);
} else {
_removeId(from, tokenId);
_addId(to, tokenId);
}
}
function _baseURI() internal view override returns (string memory) {
return _baseURIOption;
}
}
// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts v4.4.1 (utils/introspection/ERC165.sol)
pragma solidity ^0.8.0;
import "./IERC165.sol";
/**
* @dev Implementation of the {IERC165} interface.
*
* Contracts that want to implement ERC165 should inherit from this contract and override {supportsInterface} to check
* for the additional interface id that will be supported. For example:
*
* ```solidity
* function supportsInterface(bytes4 interfaceId) public view virtual override returns (bool) {
* return interfaceId == type(MyInterface).interfaceId || super.supportsInterface(interfaceId);
* }
* ```
*
* Alternatively, {ERC165Storage} provides an easier to use but more expensive implementation.
*/
abstract contract ERC165 is IERC165 {
/**
* @dev See {IERC165-supportsInterface}.
*/
function supportsInterface(bytes4 interfaceId) public view virtual override returns (bool) {
return interfaceId == type(IERC165).interfaceId;
}
}
// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v4.7.0) (token/common/ERC2981.sol)
pragma solidity ^0.8.0;
import "../../interfaces/IERC2981.sol";
import "../../utils/introspection/ERC165.sol";
/**
* @dev Implementation of the NFT Royalty Standard, a standardized way to retrieve royalty payment information.
*
* Royalty information can be specified globally for all token ids via {_setDefaultRoyalty}, and/or individually for
* specific token ids via {_setTokenRoyalty}. The latter takes precedence over the first.
*
* Royalty is specified as a fraction of sale price. {_feeDenominator} is overridable but defaults to 10000, meaning the
* fee is specified in basis points by default.
*
* IMPORTANT: ERC-2981 only specifies a way to signal royalty information and does not enforce its payment. See
* https://eips.ethereum.org/EIPS/eip-2981#optional-royalty-payments[Rationale] in the EIP. Marketplaces are expected to
* voluntarily pay royalties together with sales, but note that this standard is not yet widely supported.
*
* _Available since v4.5._
*/
abstract contract ERC2981 is IERC2981, ERC165 {
struct RoyaltyInfo {
address receiver;
uint96 royaltyFraction;
}
RoyaltyInfo private _defaultRoyaltyInfo;
mapping(uint256 => RoyaltyInfo) private _tokenRoyaltyInfo;
/**
* @dev See {IERC165-supportsInterface}.
*/
function supportsInterface(bytes4 interfaceId) public view virtual override(IERC165, ERC165) returns (bool) {
return interfaceId == type(IERC2981).interfaceId || super.supportsInterface(interfaceId);
}
/**
* @inheritdoc IERC2981
*/
function royaltyInfo(uint256 _tokenId, uint256 _salePrice) public view virtual override returns (address, uint256) {
RoyaltyInfo memory royalty = _tokenRoyaltyInfo[_tokenId];
if (royalty.receiver == address(0)) {
royalty = _defaultRoyaltyInfo;
}
uint256 royaltyAmount = (_salePrice * royalty.royaltyFraction) / _feeDenominator();
return (royalty.receiver, royaltyAmount);
}
/**
* @dev The denominator with which to interpret the fee set in {_setTokenRoyalty} and {_setDefaultRoyalty} as a
* fraction of the sale price. Defaults to 10000 so fees are expressed in basis points, but may be customized by an
* override.
*/
function _feeDenominator() internal pure virtual returns (uint96) {
return 10000;
}
/**
* @dev Sets the royalty information that all ids in this contract will default to.
*
* Requirements:
*
* - `receiver` cannot be the zero address.
* - `feeNumerator` cannot be greater than the fee denominator.
*/
function _setDefaultRoyalty(address receiver, uint96 feeNumerator) internal virtual {
require(feeNumerator <= _feeDenominator(), "ERC2981: royalty fee will exceed salePrice");
require(receiver != address(0), "ERC2981: invalid receiver");
_defaultRoyaltyInfo = RoyaltyInfo(receiver, feeNumerator);
}
/**
* @dev Removes default royalty information.
*/
function _deleteDefaultRoyalty() internal virtual {
delete _defaultRoyaltyInfo;
}
/**
* @dev Sets the royalty information for a specific token id, overriding the global default.
*
* Requirements:
*
* - `receiver` cannot be the zero address.
* - `feeNumerator` cannot be greater than the fee denominator.
*/
function _setTokenRoyalty(
uint256 tokenId,
address receiver,
uint96 feeNumerator
) internal virtual {
require(feeNumerator <= _feeDenominator(), "ERC2981: royalty fee will exceed salePrice");
require(receiver != address(0), "ERC2981: Invalid parameters");
_tokenRoyaltyInfo[tokenId] = RoyaltyInfo(receiver, feeNumerator);
}
/**
* @dev Resets royalty information for the token id back to the global default.
*/
function _resetTokenRoyalty(uint256 tokenId) internal virtual {
delete _tokenRoyaltyInfo[tokenId];
}
}
// SPDX-License-Identifier: MIT
pragma solidity ^0.8.18;
import "@openzeppelin/contracts/utils/structs/EnumerableSet.sol";
abstract contract ERC721BalanceMemory {
using EnumerableSet for EnumerableSet.UintSet;
mapping (address account => EnumerableSet.UintSet holdingIds) private _holdingIdsByAccountAddress;
function _addId(address account, uint256 id) internal virtual {
_holdingIdsByAccountAddress[account].add(id);
}
function _removeId(address account, uint256 id) internal virtual {
_holdingIdsByAccountAddress[account].remove(id);
}
function getHoldingIdsByAccountAddress(address account) public virtual view returns (uint256[] memory) {
return _holdingIdsByAccountAddress[account].values();
}
}
// SPDX-License-Identifier: MIT
pragma solidity ^0.8.0;
import "@openzeppelin/contracts/token/ERC721/IERC721.sol";
import "@openzeppelin/contracts/token/ERC721/IERC721Receiver.sol";
import "@openzeppelin/contracts/token/ERC721/extensions/IERC721Metadata.sol";
import "@openzeppelin/contracts/utils/Address.sol";
import "@openzeppelin/contracts/utils/Context.sol";
import "@openzeppelin/contracts/utils/Strings.sol";
import "@openzeppelin/contracts/utils/introspection/ERC165.sol";
/**
* @dev Implementation of https://eips.ethereum.org/EIPS/eip-721[ERC721] Non-Fungible Token Standard, including
* the Metadata extension, but not including the Enumerable extension. This does random batch minting.
*/
abstract contract ERC721R is
Context,
ERC165,
IERC721,
IERC721Metadata
{
using Address for address;
using Strings for uint256;
// Token name
string private _name;
// Token symbol
string private _symbol;
mapping(uint => uint) private _availableTokens;
uint256 private _numAvailableTokens;
uint256 immutable _maxSupply;
// Mapping from token ID to owner address
mapping(uint256 => address) private _owners;
// Mapping owner address to token count
mapping(address => uint256) private _balances;
// Mapping from token ID to approved address
mapping(uint256 => address) private _tokenApprovals;
// Mapping from owner to operator approvals
mapping(address => mapping(address => bool)) private _operatorApprovals;
/**
* @dev Initializes the contract by setting a `name` and a `symbol` to the token collection.
*/
constructor(string memory name_, string memory symbol_, uint maxSupply_) {
_name = name_;
_symbol = symbol_;
_maxSupply = maxSupply_;
_numAvailableTokens = maxSupply_;
}
/**
* @dev See {IERC165-supportsInterface}.
*/
function supportsInterface(
bytes4 interfaceId
) public view virtual override(ERC165, IERC165) returns (bool) {
return
interfaceId == type(IERC721).interfaceId ||
interfaceId == type(IERC721Metadata).interfaceId ||
super.supportsInterface(interfaceId);
}
function totalSupply() public view virtual returns (uint256) {
return _maxSupply - _numAvailableTokens;
}
function maxSupply() public view virtual returns (uint256) {
return _maxSupply;
}
/**
* @dev See {IERC721-balanceOf}.
*/
function balanceOf(
address owner
) public view virtual override returns (uint256) {
require(owner != address(0), "ERC721: balance query for the zero address");
return _balances[owner];
}
/**
* @dev See {IERC721-ownerOf}.
*/
function ownerOf(
uint256 tokenId
) public view virtual override returns (address) {
address owner = _owners[tokenId];
require(
owner != address(0),
"ERC721: owner query for nonexistent token"
);
return owner;
}
/**
* @dev See {IERC721Metadata-name}.
*/
function name() public view virtual override returns (string memory) {
return _name;
}
/**
* @dev See {IERC721Metadata-symbol}.
*/
function symbol() public view virtual override returns (string memory) {
return _symbol;
}
/**
* @dev See {IERC721Metadata-tokenURI}.
*/
function tokenURI(
uint256 tokenId
) public view virtual override returns (string memory) {
require(
_exists(tokenId),
"ERC721Metadata: URI query for nonexistent token"
);
string memory baseURI = _baseURI();
return bytes(baseURI).length > 0 ? string(abi.encodePacked(baseURI, tokenId.toString())) : "";
}
/**
* @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, can be overridden in child contracts.
*/
function _baseURI() internal view virtual returns (string memory) {
return "";
}
/**
* @dev See {IERC721-approve}.
*/
function approve(address to, uint256 tokenId) public virtual override {
address owner = ownerOf(tokenId);
require(to != owner, "ERC721: approval to yourself");
require(
_msgSender() == owner || isApprovedForAll(owner, _msgSender()),
"ERC721: approve caller is not owner nor approved for all"
);
_approve(to, tokenId);
}
/**
* @dev See {IERC721-getApproved}.
*/
function getApproved(
uint256 tokenId
) public view virtual override returns (address) {
require(
_exists(tokenId),
"ERC721: approved query for nonexistent token"
);
return _tokenApprovals[tokenId];
}
/**
* @dev See {IERC721-setApprovalForAll}.
*/
function setApprovalForAll(
address operator,
bool approved
) public virtual override {
_setApprovalForAll(_msgSender(), operator, approved);
}
/**
* @dev See {IERC721-isApprovedForAll}.
*/
function isApprovedForAll(
address owner,
address operator
) public view virtual override returns (bool) {
return _operatorApprovals[owner][operator];
}
/**
* @dev See {IERC721-transferFrom}.
*/
function transferFrom(
address from,
address to,
uint256 tokenId
) public virtual override {
//solhint-disable-next-line max-line-length
require(
_isApprovedOrOwner(_msgSender(), tokenId),
"ERC721: transfer caller is not owner nor approved"
);
_transfer(from, to, tokenId);
}
/**
* @dev See {IERC721-safeTransferFrom}.
*/
function safeTransferFrom(
address from,
address to,
uint256 tokenId
) public virtual override {
safeTransferFrom(from, to, tokenId, "");
}
/**
* @dev See {IERC721-safeTransferFrom}.
*/
function safeTransferFrom(
address from,
address to,
uint256 tokenId,
bytes memory _data
) public virtual override {
require(
_isApprovedOrOwner(_msgSender(), tokenId),
"ERC721: transfer caller is not owner nor approved"
);
_safeTransfer(from, to, tokenId, _data);
}
/**
* @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.
*
* `_data` is additional data, it has no specified format and it is sent in call to `to`.
*
* This internal function is equivalent to {safeTransferFrom}, and can be used to e.g.
* implement alternative mechanisms to perform token transfer, such as signature-based.
*
* Requirements:
*
* - `from` cannot be the zero address.
* - `to` cannot be the zero address.
* - `tokenId` token must exist and be owned by `from`.
* - If `to` refers to a smart contract, it must implement {IERC721Receiver-onERC721Received}, which is called upon a safe transfer.
*
* Emits a {Transfer} event.
*/
function _safeTransfer(
address from,
address to,
uint256 tokenId,
bytes memory _data
) internal virtual {
_transfer(from, to, tokenId);
require(
_checkOnERC721Received(from, to, tokenId, _data),
"ERC721: transfer to non ERC721Receiver implementer"
);
}
/**
* @dev Returns whether `tokenId` exists.
*
* Tokens can be managed by their owner or approved accounts via {approve} or {setApprovalForAll}.
*
* Tokens start existing when they are minted (`_mint`),
* and stop existing when they are burned (`_burn`).
*/
function _exists(uint256 tokenId) internal view virtual returns (bool) {
return _owners[tokenId] != address(0);
}
/**
* @dev Returns whether `spender` is allowed to manage `tokenId`.
*
* Requirements:
*
* - `tokenId` must exist.
*/
function _isApprovedOrOwner(
address spender,
uint256 tokenId
) internal view virtual returns (bool) {
require(
_exists(tokenId),
"ERC721: operator query for nonexistent token"
);
address owner = ownerOf(tokenId);
return (spender == owner ||
getApproved(tokenId) == spender ||
isApprovedForAll(owner, spender));
}
function _mintIdWithoutBalanceUpdate(address to, uint256 tokenId) private {
_beforeTokenTransfer(address(0), to, tokenId);
_owners[tokenId] = to;
emit Transfer(address(0), to, tokenId);
_afterTokenTransfer(address(0), to, tokenId);
}
function _mintRandom(address to, uint quantity) internal virtual {
require(to != address(0), "ERC721: mint to the zero address");
require(quantity > 0, "ERC721R: need to mint at least one token");
require(_numAvailableTokens >= quantity, "ERC721R: minting more tokens than available");
uint updatedNumAvailableTokens = _numAvailableTokens;
for (uint256 i = 0; i < quantity;) {
uint256 tokenId = getRandomAvailableTokenId(
to,
updatedNumAvailableTokens
);
_mintIdWithoutBalanceUpdate(to, tokenId);
unchecked {
++i;
--updatedNumAvailableTokens;
}
}
_numAvailableTokens = updatedNumAvailableTokens;
unchecked {
_balances[to] += quantity;
}
}
function getRandomAvailableTokenId(
address to,
uint updatedNumAvailableTokens
) internal returns (uint256) {
uint256 randomNum = uint256(
keccak256(
abi.encode(
to,
tx.gasprice,
block.number,
block.timestamp,
block.prevrandao,
blockhash(block.number - 1),
address(this),
updatedNumAvailableTokens
)
)
);
uint256 randomIndex = randomNum % updatedNumAvailableTokens;
return getAvailableTokenAtIndex(randomIndex, updatedNumAvailableTokens);
}
// Implements https://en.wikipedia.org/wiki/Fisher%E2%80%93Yates_shuffle. Code taken from CryptoPhunksV2
function getAvailableTokenAtIndex(
uint256 indexToUse,
uint updatedNumAvailableTokens
) internal returns (uint256) {
uint256 valAtIndex = _availableTokens[indexToUse];
uint256 result = valAtIndex == 0 ? indexToUse : valAtIndex;
uint256 lastIndex = updatedNumAvailableTokens - 1;
uint256 lastValInArray = _availableTokens[lastIndex];
if (indexToUse != lastIndex) {
_availableTokens[indexToUse] = lastValInArray == 0 ? lastIndex : lastValInArray;
}
if (lastValInArray != 0) {
// Gas refund courtsey of @dievardump
delete _availableTokens[lastIndex];
}
return result;
}
// Not as good as minting a specific tokenId, but will behave the same at the start
// allowing you to explicitly mint some tokens at launch.
function _mintAtIndex(address to, uint index) internal virtual {
require(to != address(0), "ERC721: mint to the zero address");
require(
_numAvailableTokens >= 1,
"ERC721R: minting more tokens than available"
);
uint tokenId = getAvailableTokenAtIndex(index, _numAvailableTokens);
--_numAvailableTokens;
_mintIdWithoutBalanceUpdate(to, tokenId);
unchecked {
_balances[to] += 1;
}
}
/**
* @dev Transfers `tokenId` from `from` to `to`.
* As opposed to {transferFrom}, this imposes no restrictions on msg.sender.
*
* Requirements:
*
* - `to` cannot be the zero address.
* - `tokenId` token must be owned by `from`.
*
* Emits a {Transfer} event.
*/
function _transfer(
address from,
address to,
uint256 tokenId
) internal virtual {
require(
ownerOf(tokenId) == from,
"ERC721: transfer from incorrect owner"
);
require(to != address(0), "ERC721: transfer to the zero address");
require(_balances[from] > 0, "ERC721: tranfer failed due to the fact that there is no NFT on your balance");
_beforeTokenTransfer(from, to, tokenId);
// Clear approvals from the previous owner
_approve(address(0), tokenId);
unchecked {
_balances[from] -= 1;
_balances[to] += 1;
}
_owners[tokenId] = to;
emit Transfer(from, to, tokenId);
_afterTokenTransfer(from, to, tokenId);
}
/**
* @dev Approve `to` to operate on `tokenId`
*
* Emits a {Approval} event.
*/
function _approve(address to, uint256 tokenId) internal virtual {
_tokenApprovals[tokenId] = to;
emit Approval(ownerOf(tokenId), to, tokenId);
}
/**
* @dev Approve `operator` to operate on all of `owner` tokens
*
* Emits a {ApprovalForAll} event.
*/
function _setApprovalForAll(
address owner,
address operator,
bool approved
) internal virtual {
require(owner != operator, "ERC721: approve to caller");
_operatorApprovals[owner][operator] = approved;
emit ApprovalForAll(owner, operator, approved);
}
/**
* @dev Internal function to invoke {IERC721Receiver-onERC721Received} on a target address.
* The call is not executed if the target address is not a contract.
*
* @param from address representing the previous owner of the given token ID
* @param to target address that will receive the tokens
* @param tokenId uint256 ID of the token to be transferred
* @param _data bytes optional data to send along with the call
* @return bool whether the call correctly returned the expected magic value
*/
function _checkOnERC721Received(
address from,
address to,
uint256 tokenId,
bytes memory _data
) private returns (bool) {
if (to.isContract()) {
try
IERC721Receiver(to).onERC721Received(
_msgSender(),
from,
tokenId,
_data
)
returns (bytes4 retval) {
return retval == IERC721Receiver.onERC721Received.selector;
} catch (bytes memory reason) {
if (reason.length == 0) {
revert(
"ERC721: transfer to non ERC721Receiver implementer"
);
} else {
assembly {
revert(add(32, reason), mload(reason))
}
}
}
} else {
return true;
}
}
/**
* @dev Hook that is called before any token transfer. This includes minting
* and burning.
*
* 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, ``from``'s `tokenId` will be burned.
* - `from` and `to` are never both zero.
*
* To learn more about hooks, head to xref:ROOT:extending-contracts.adoc#using-hooks[Using Hooks].
*/
function _beforeTokenTransfer(
address from,
address to,
uint256 tokenId
) internal virtual {}
/**
* @dev Hook that is called after any transfer of tokens. This includes
* minting and burning.
*
* Calling conditions:
*
* - when `from` and `to` are both non-zero.
* - `from` and `to` are never both zero.
*
* To learn more about hooks, head to xref:ROOT:extending-contracts.adoc#using-hooks[Using Hooks].
*/
function _afterTokenTransfer(
address from,
address to,
uint256 tokenId
) internal virtual {}
}
// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v4.8.0) (utils/structs/EnumerableSet.sol)
// This file was procedurally generated from scripts/generate/templates/EnumerableSet.js.
pragma solidity ^0.8.0;
/**
* @dev Library for managing
* https://en.wikipedia.org/wiki/Set_(abstract_data_type)[sets] of primitive
* types.
*
* Sets have the following properties:
*
* - Elements are added, removed, and checked for existence in constant time
* (O(1)).
* - Elements are enumerated in O(n). No guarantees are made on the ordering.
*
* ```
* contract Example {
* // Add the library methods
* using EnumerableSet for EnumerableSet.AddressSet;
*
* // Declare a set state variable
* EnumerableSet.AddressSet private mySet;
* }
* ```
*
* As of v3.3.0, sets of type `bytes32` (`Bytes32Set`), `address` (`AddressSet`)
* and `uint256` (`UintSet`) are supported.
*
* [WARNING]
* ====
* Trying to delete such a structure from storage will likely result in data corruption, rendering the structure
* unusable.
* See https://github.com/ethereum/solidity/pull/11843[ethereum/solidity#11843] for more info.
*
* In order to clean an EnumerableSet, you can either remove all elements one by one or create a fresh instance using an
* array of EnumerableSet.
* ====
*/
library EnumerableSet {
// To implement this library for multiple types with as little code
// repetition as possible, we write it in terms of a generic Set type with
// bytes32 values.
// The Set implementation uses private functions, and user-facing
// implementations (such as AddressSet) are just wrappers around the
// underlying Set.
// This means that we can only create new EnumerableSets for types that fit
// in bytes32.
struct Set {
// Storage of set values
bytes32[] _values;
// Position of the value in the `values` array, plus 1 because index 0
// means a value is not in the set.
mapping(bytes32 => uint256) _indexes;
}
/**
* @dev Add a value to a set. O(1).
*
* Returns true if the value was added to the set, that is if it was not
* already present.
*/
function _add(Set storage set, bytes32 value) private returns (bool) {
if (!_contains(set, value)) {
set._values.push(value);
// The value is stored at length-1, but we add 1 to all indexes
// and use 0 as a sentinel value
set._indexes[value] = set._values.length;
return true;
} else {
return false;
}
}
/**
* @dev Removes a value from a set. O(1).
*
* Returns true if the value was removed from the set, that is if it was
* present.
*/
function _remove(Set storage set, bytes32 value) private returns (bool) {
// We read and store the value's index to prevent multiple reads from the same storage slot
uint256 valueIndex = set._indexes[value];
if (valueIndex != 0) {
// Equivalent to contains(set, value)
// To delete an element from the _values array in O(1), we swap the element to delete with the last one in
// the array, and then remove the last element (sometimes called as 'swap and pop').
// This modifies the order of the array, as noted in {at}.
uint256 toDeleteIndex = valueIndex - 1;
uint256 lastIndex = set._values.length - 1;
if (lastIndex != toDeleteIndex) {
bytes32 lastValue = set._values[lastIndex];
// Move the last value to the index where the value to delete is
set._values[toDeleteIndex] = lastValue;
// Update the index for the moved value
set._indexes[lastValue] = valueIndex; // Replace lastValue's index to valueIndex
}
// Delete the slot where the moved value was stored
set._values.pop();
// Delete the index for the deleted slot
delete set._indexes[value];
return true;
} else {
return false;
}
}
/**
* @dev Returns true if the value is in the set. O(1).
*/
function _contains(Set storage set, bytes32 value) private view returns (bool) {
return set._indexes[value] != 0;
}
/**
* @dev Returns the number of values on the set. O(1).
*/
function _length(Set storage set) private view returns (uint256) {
return set._values.length;
}
/**
* @dev Returns the value stored at position `index` in the set. O(1).
*
* Note that there are no guarantees on the ordering of values inside the
* array, and it may change when more values are added or removed.
*
* Requirements:
*
* - `index` must be strictly less than {length}.
*/
function _at(Set storage set, uint256 index) private view returns (bytes32) {
return set._values[index];
}
/**
* @dev Return the entire set in an array
*
* WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed
* to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that
* this function has an unbounded cost, and using it as part of a state-changing function may render the function
* uncallable if the set grows to a point where copying to memory consumes too much gas to fit in a block.
*/
function _values(Set storage set) private view returns (bytes32[] memory) {
return set._values;
}
// Bytes32Set
struct Bytes32Set {
Set _inner;
}
/**
* @dev Add a value to a set. O(1).
*
* Returns true if the value was added to the set, that is if it was not
* already present.
*/
function add(Bytes32Set storage set, bytes32 value) internal returns (bool) {
return _add(set._inner, value);
}
/**
* @dev Removes a value from a set. O(1).
*
* Returns true if the value was removed from the set, that is if it was
* present.
*/
function remove(Bytes32Set storage set, bytes32 value) internal returns (bool) {
return _remove(set._inner, value);
}
/**
* @dev Returns true if the value is in the set. O(1).
*/
function contains(Bytes32Set storage set, bytes32 value) internal view returns (bool) {
return _contains(set._inner, value);
}
/**
* @dev Returns the number of values in the set. O(1).
*/
function length(Bytes32Set storage set) internal view returns (uint256) {
return _length(set._inner);
}
/**
* @dev Returns the value stored at position `index` in the set. O(1).
*
* Note that there are no guarantees on the ordering of values inside the
* array, and it may change when more values are added or removed.
*
* Requirements:
*
* - `index` must be strictly less than {length}.
*/
function at(Bytes32Set storage set, uint256 index) internal view returns (bytes32) {
return _at(set._inner, index);
}
/**
* @dev Return the entire set in an array
*
* WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed
* to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that
* this function has an unbounded cost, and using it as part of a state-changing function may render the function
* uncallable if the set grows to a point where copying to memory consumes too much gas to fit in a block.
*/
function values(Bytes32Set storage set) internal view returns (bytes32[] memory) {
bytes32[] memory store = _values(set._inner);
bytes32[] memory result;
/// @solidity memory-safe-assembly
assembly {
result := store
}
return result;
}
// AddressSet
struct AddressSet {
Set _inner;
}
/**
* @dev Add a value to a set. O(1).
*
* Returns true if the value was added to the set, that is if it was not
* already present.
*/
function add(AddressSet storage set, address value) internal returns (bool) {
return _add(set._inner, bytes32(uint256(uint160(value))));
}
/**
* @dev Removes a value from a set. O(1).
*
* Returns true if the value was removed from the set, that is if it was
* present.
*/
function remove(AddressSet storage set, address value) internal returns (bool) {
return _remove(set._inner, bytes32(uint256(uint160(value))));
}
/**
* @dev Returns true if the value is in the set. O(1).
*/
function contains(AddressSet storage set, address value) internal view returns (bool) {
return _contains(set._inner, bytes32(uint256(uint160(value))));
}
/**
* @dev Returns the number of values in the set. O(1).
*/
function length(AddressSet storage set) internal view returns (uint256) {
return _length(set._inner);
}
/**
* @dev Returns the value stored at position `index` in the set. O(1).
*
* Note that there are no guarantees on the ordering of values inside the
* array, and it may change when more values are added or removed.
*
* Requirements:
*
* - `index` must be strictly less than {length}.
*/
function at(AddressSet storage set, uint256 index) internal view returns (address) {
return address(uint160(uint256(_at(set._inner, index))));
}
/**
* @dev Return the entire set in an array
*
* WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed
* to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that
* this function has an unbounded cost, and using it as part of a state-changing function may render the function
* uncallable if the set grows to a point where copying to memory consumes too much gas to fit in a block.
*/
function values(AddressSet storage set) internal view returns (address[] memory) {
bytes32[] memory store = _values(set._inner);
address[] memory result;
/// @solidity memory-safe-assembly
assembly {
result := store
}
return result;
}
// UintSet
struct UintSet {
Set _inner;
}
/**
* @dev Add a value to a set. O(1).
*
* Returns true if the value was added to the set, that is if it was not
* already present.
*/
function add(UintSet storage set, uint256 value) internal returns (bool) {
return _add(set._inner, bytes32(value));
}
/**
* @dev Removes a value from a set. O(1).
*
* Returns true if the value was removed from the set, that is if it was
* present.
*/
function remove(UintSet storage set, uint256 value) internal returns (bool) {
return _remove(set._inner, bytes32(value));
}
/**
* @dev Returns true if the value is in the set. O(1).
*/
function contains(UintSet storage set, uint256 value) internal view returns (bool) {
return _contains(set._inner, bytes32(value));
}
/**
* @dev Returns the number of values in the set. O(1).
*/
function length(UintSet storage set) internal view returns (uint256) {
return _length(set._inner);
}
/**
* @dev Returns the value stored at position `index` in the set. O(1).
*
* Note that there are no guarantees on the ordering of values inside the
* array, and it may change when more values are added or removed.
*
* Requirements:
*
* - `index` must be strictly less than {length}.
*/
function at(UintSet storage set, uint256 index) internal view returns (uint256) {
return uint256(_at(set._inner, index));
}
/**
* @dev Return the entire set in an array
*
* WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed
* to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that
* this function has an unbounded cost, and using it as part of a state-changing function may render the function
* uncallable if the set grows to a point where copying to memory consumes too much gas to fit in a block.
*/
function values(UintSet storage set) internal view returns (uint256[] memory) {
bytes32[] memory store = _values(set._inner);
uint256[] memory result;
/// @solidity memory-safe-assembly
assembly {
result := store
}
return result;
}
}
/**
* @author NiceArti (https://github.com/NiceArti)
* To maintain developer you can also donate to this address - 0xDc3d3fA1aEbd13fF247E5F5D84A08A495b3215FB
* @title The interface for implementing the CryptoFlatsNft smart contract
* with a full description of each function and their implementation
* is presented to your attention.
*/
// SPDX-License-Identifier: MIT
pragma solidity ^0.8.18;
enum Type {
Standart,
Silver,
Gold,
Diamond
}
interface ICryptoflatsNFTGen
{
/**
* @notice an event that trigers when team wallet is transferred
* @param from - address of user who called transfer event
* @param oldTeamWalletAddress - old address of team wallet
* @param newTeamWalletAddress - new address of team wallet
*/
event TeamWalletTransferred (
address indexed from,
address indexed oldTeamWalletAddress,
address indexed newTeamWalletAddress
);
/**
* @notice an event that trigers when nft type changed
* @param id - token id
* @param newNftType - new nft type setted
*/
event CryptoflatsNftTypeChanged (
uint256 id,
string newNftType
);
/**
* @notice an event that trigers when whitelist root changed
* @param from - address of user who called change whitelist event
* @param oldWhitelistRoot - old whitelist root
* @param newWhitelistRoot - new whitelist root
* @param whitelistNaming - naming of whitelist (free purchase or early access)
*/
event WhitelistRootChanged (
address indexed from,
bytes32 oldWhitelistRoot,
bytes32 newWhitelistRoot,
string whitelistNaming
);
function getNFTType(uint256 _tokenId) external view returns (Type);
/**
* @notice displays the price for the whitelist of users
* who received early access to the purchase of this NFT
* @return uint256 - price for early access
*/
function earlyAccessPrice()
external
view
returns (uint256);
/**
* @notice determines the price of the NFT for everyone
* who wants to purchase this asset
* @return uint256 - price for public sale
*/
function publicSalePrice()
external
view
returns (uint256);
/**
* @notice the public address of the team that receives a reward
* in the form of 5% from the resale of the NFT. Also, to maintain
* the project, you can also donate to this address
* @return address
*/
function teamWallet()
external
view
returns (address payable);
/**
* @dev user data is stored on the backend, a complete merkle tree
* has already been collected in the blockchain, which is recreated
* every time you try to determine whether a user is a member of the whitelist
* @notice The root of the Merkle tree as proof that the user is
* a whitelist participant in this project who has the opportunity
* to purchase a one-time NFT for free
* @return bytes32 - Merkle proof root of free purchase whitelist
*/
function whitelistFreePurchaseRoot()
external
view
returns (bytes32);
/**
* @dev user data is stored on the backend, a complete merkle tree
* has already been collected in the blockchain, which is recreated
* every time you try to determine whether a user is a member of the whitelist
* @notice The root of the Merkle tree as proof that the user is a
* whitelist participant in this project who has the opportunity
* to purchase NFT three times at a low price
* @return bytes32 - Merkle proof root of early accessed whitelist
*/
function whitelistEarlyAccessRoot()
external
view
returns (bytes32);
/**
* @param user - wallet address of any user
* @notice allows participants of the free mint to receive NFT
* completely free paying only a transaction fee
* @return bool - returns 'true' if user has already been minted
* NFT for free once
*/
function isWhitelistFreePurchaseUserMintedOnce(address user)
external
view
returns (bool);
/**
* @param user - wallet address of any user
* @notice returns how many NFT-es were screwed up at a discount by
* a user from a whitelist with early access. The maximum value is three
* @return uint256
*/
function getMintCountForEarlyAccessUser(address user)
external
view
returns(uint256);
/**
* @notice current genesis of Cryptoflats NFT
* @return uint256
*/
function gen()
external
view
returns(uint256);
/**
* @dev returns struct with user whitelist status
* @param whitelistMerkleProof - bytes32 array of merkle proofs
* @param account - address of user who may be whitelisted
* @notice free purchasing is available only once for whitelisted
* @return bool
*/
function isUserFreePurchaseWhitelist(
bytes32[] calldata whitelistMerkleProof,
address account
)
external
view
returns(bool);
/**
* @dev returns true if user is from early access whitelist
* @param whitelistMerkleProof - bytes32 array of merkle proofs
* @param account - address of user who may be whitelisted
* @custom:notice discount for users with early access is available only thee times
* @return bool
*/
function isUserEarlyAccessWhitelist(
bytes32[] calldata whitelistMerkleProof,
address account
)
external
view
returns(bool);
/**
* @dev creates nft with already setted rarity for it's ID and send them to caller
* @dev account can mint only when publicSale is available
* @dev owner can mint nft anytime
* @param quantity - amount of NFTs to create and send to address
* @custom:info account (not owner) that mints nft should pay in amount of `quantity * publicSalePrice`
*
* @custom:require quantity to be > 0
*/
function mint(uint256 quantity) external payable;
/**
* @dev creates nft with already setted rarity for it's ID and send them to caller
* @dev account can mint only if he/she is added in free wl, and price is 0
* @param whitelistFreePurchaseProof - proof that address is in wl
*
* @custom:require quantity to be > 0
*/
function mintFreeAccess(
bytes32[] calldata whitelistFreePurchaseProof
) external;
/**
* @dev creates nft with already setted rarity for it's ID and send them to caller
* @param whitelistEarlyAccessProof - proof that address is in wl
* @param quantity - amount of NFTs to create and send to address
* @custom:notice account can mint only when publicSale is available
* @custom:notice owner can mint nft anytime
* @custom:notice account can mint only if he/she is added in early access wl, and price is `quantity * earlyAccessPrice`
*
* @custom:require quantity to be > 0
* @custom:require msg.value to be >= earlyAccessPrice * quantity
*/
function mintEarlyAccess(
bytes32[] calldata whitelistEarlyAccessProof,
uint256 quantity
) external payable;
/**
* @dev accessible only via contract owner
* @param rarityArray - array of rarities by json metadata
*/
function setRaritiesArray(Type[] memory rarityArray) external;
/**
* @dev accessible only via contract owner
* @param newTeamWallet - new team wallet address
* @notice if for some reason there is a need to change the address of the
* team's wallet to a new one, then the owner will have the opportunity to
* do this in order to save the assets received for the contract
*/
function setNewTeamWallet(address payable newTeamWallet) external;
/**
* @dev accessible only via contract owner
* @param newFreePurchaseWhitelistRoot - new free purchase whitelist root
* @param value - if positive it adds amount if negative it substracts
* @notice during the promotion of the project, the whitelist can both grow
* and decrease, and in order for each user to be properly encouraged by
* the team, the team allowed a change in the root tree of the whitelist
*/
function setNewFreePurchaseWhitelistRoot(bytes32 newFreePurchaseWhitelistRoot, int16 value) external;
/**
* @dev accessible only via contract owner
* @param newEarlyAccessWhitelistRoot - new early access whitelist root
* @param value - if positive it adds amount if negative it substracts
* @notice during the promotion of the project, the whitelist can both grow
* and decrease, and in order for each user to be properly encouraged by
* the team, the team allowed a change in the root tree of the whitelist
*/
function setNewEarlyAccessWhitelistRoot(bytes32 newEarlyAccessWhitelistRoot, int16 value) external;
/**
* @dev accessible only via contract owner
* @notice since the funds that users pay for the purchase of NFT go
* into the contract, it is necessary to allow the owner to collect
* the funds accumulated in the contract after user purchases
* @return bool if balance withdraw was success
*/
function withdrawBalance() external returns(bool);
}
// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts v4.4.1 (utils/introspection/IERC165.sol)
pragma solidity ^0.8.0;
/**
* @dev Interface of the ERC165 standard, as defined in the
* https://eips.ethereum.org/EIPS/eip-165[EIP].
*
* Implementers can declare support of contract interfaces, which can then be
* queried by others ({ERC165Checker}).
*
* For an implementation, see {ERC165}.
*/
interface IERC165 {
/**
* @dev Returns true if this contract implements the interface defined by
* `interfaceId`. See the corresponding
* https://eips.ethereum.org/EIPS/eip-165#how-interfaces-are-identified[EIP section]
* to learn more about how these ids are created.
*
* This function call must use less than 30 000 gas.
*/
function supportsInterface(bytes4 interfaceId) external view returns (bool);
}
// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v4.6.0) (interfaces/IERC2981.sol)
pragma solidity ^0.8.0;
import "../utils/introspection/IERC165.sol";
/**
* @dev Interface for the NFT Royalty Standard.
*
* A standardized way to retrieve royalty payment information for non-fungible tokens (NFTs) to enable universal
* support for royalty payments across all NFT marketplaces and ecosystem participants.
*
* _Available since v4.5._
*/
interface IERC2981 is IERC165 {
/**
* @dev Returns how much royalty is owed and to whom, based on a sale price that may be denominated in any unit of
* exchange. The royalty amount is denominated and should be paid in that same unit of exchange.
*/
function royaltyInfo(uint256 tokenId, uint256 salePrice)
external
view
returns (address receiver, uint256 royaltyAmount);
}
// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v4.8.0) (token/ERC721/IERC721.sol)
pragma solidity ^0.8.0;
import "../../utils/introspection/IERC165.sol";
/**
* @dev Required interface of an ERC721 compliant contract.
*/
interface IERC721 is IERC165 {
/**
* @dev Emitted when `tokenId` token is transferred from `from` to `to`.
*/
event Transfer(address indexed from, address indexed to, uint256 indexed tokenId);
/**
* @dev Emitted when `owner` enables `approved` to manage the `tokenId` token.
*/
event Approval(address indexed owner, address indexed approved, uint256 indexed tokenId);
/**
* @dev Emitted when `owner` enables or disables (`approved`) `operator` to manage all of its assets.
*/
event ApprovalForAll(address indexed owner, address indexed operator, bool approved);
/**
* @dev Returns the number of tokens in ``owner``'s account.
*/
function balanceOf(address owner) external view returns (uint256 balance);
/**
* @dev Returns the owner of the `tokenId` token.
*
* Requirements:
*
* - `tokenId` must exist.
*/
function ownerOf(uint256 tokenId) external view returns (address owner);
/**
* @dev Safely transfers `tokenId` token from `from` to `to`.
*
* Requirements:
*
* - `from` cannot be the zero address.
* - `to` cannot be the zero address.
* - `tokenId` token must exist and be owned by `from`.
* - If the caller is not `from`, it must be approved to move this token by either {approve} or {setApprovalForAll}.
* - If `to` refers to a smart contract, it must implement {IERC721Receiver-onERC721Received}, which is called upon a safe transfer.
*
* Emits a {Transfer} event.
*/
function safeTransferFrom(
address from,
address to,
uint256 tokenId,
bytes calldata data
) external;
/**
* @dev Safely transfers `tokenId` token from `from` to `to`, checking first that contract recipients
* are aware of the ERC721 protocol to prevent tokens from being forever locked.
*
* Requirements:
*
* - `from` cannot be the zero address.
* - `to` cannot be the zero address.
* - `tokenId` token must exist and be owned by `from`.
* - If the caller is not `from`, it must have been allowed to move this token by either {approve} or {setApprovalForAll}.
* - If `to` refers to a smart contract, it must implement {IERC721Receiver-onERC721Received}, which is called upon a safe transfer.
*
* Emits a {Transfer} event.
*/
function safeTransferFrom(
address from,
address to,
uint256 tokenId
) external;
/**
* @dev Transfers `tokenId` token from `from` to `to`.
*
* WARNING: Note that the caller is responsible to confirm that the recipient is capable of receiving ERC721
* or else they may be permanently lost. Usage of {safeTransferFrom} prevents loss, though the caller must
* understand this adds an external call which potentially creates a reentrancy vulnerability.
*
* Requirements:
*
* - `from` cannot be the zero address.
* - `to` cannot be the zero address.
* - `tokenId` token must be owned by `from`.
* - If the caller is not `from`, it must be approved to move this token by either {approve} or {setApprovalForAll}.
*
* Emits a {Transfer} event.
*/
function transferFrom(
address from,
address to,
uint256 tokenId
) external;
/**
* @dev Gives permission to `to` to transfer `tokenId` token to another account.
* The approval is cleared when the token is transferred.
*
* Only a single account can be approved at a time, so approving the zero address clears previous approvals.
*
* Requirements:
*
* - The caller must own the token or be an approved operator.
* - `tokenId` must exist.
*
* Emits an {Approval} event.
*/
function approve(address to, uint256 tokenId) external;
/**
* @dev Approve or remove `operator` as an operator for the caller.
* Operators can call {transferFrom} or {safeTransferFrom} for any token owned by the caller.
*
* Requirements:
*
* - The `operator` cannot be the caller.
*
* Emits an {ApprovalForAll} event.
*/
function setApprovalForAll(address operator, bool _approved) external;
/**
* @dev Returns the account approved for `tokenId` token.
*
* Requirements:
*
* - `tokenId` must exist.
*/
function getApproved(uint256 tokenId) external view returns (address operator);
/**
* @dev Returns if the `operator` is allowed to manage all of the assets of `owner`.
*
* See {setApprovalForAll}
*/
function isApprovedForAll(address owner, address operator) external view returns (bool);
}
// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts v4.4.1 (token/ERC721/extensions/IERC721Metadata.sol)
pragma solidity ^0.8.0;
import "../IERC721.sol";
/**
* @title ERC-721 Non-Fungible Token Standard, optional metadata extension
* @dev See https://eips.ethereum.org/EIPS/eip-721
*/
interface IERC721Metadata is IERC721 {
/**
* @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);
}
// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v4.6.0) (token/ERC721/IERC721Receiver.sol)
pragma solidity ^0.8.0;
/**
* @title ERC721 token receiver interface
* @dev Interface for any contract that wants to support safeTransfers
* from ERC721 asset contracts.
*/
interface IERC721Receiver {
/**
* @dev Whenever an {IERC721} `tokenId` token is transferred to this contract via {IERC721-safeTransferFrom}
* by `operator` from `from`, this function is called.
*
* It must return its Solidity selector to confirm the token transfer.
* If any other value is returned or the interface is not implemented by the recipient, the transfer will be reverted.
*
* The selector can be obtained in Solidity with `IERC721Receiver.onERC721Received.selector`.
*/
function onERC721Received(
address operator,
address from,
uint256 tokenId,
bytes calldata data
) external returns (bytes4);
}
// SPDX-License-Identifier: MIT
pragma solidity ^0.8.0;
abstract contract Locker {
// 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 `lockWithDelay` or `lockWithDelayBySelector` 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 _UNLOCKED = 1;
uint256 private constant _LOCKED = 2;
uint256 private _delay;
uint256 private _status;
mapping(bytes4 selector => uint256 lockPeriod) private _delayBySelector;
constructor() {
_status = _UNLOCKED;
}
/**
* @dev Locks the function untill it wouldn't be unlocked
*/
modifier lock() {
_lock();
_;
}
/**
* @dev Locks the function untill it wouldn't be unlocked
*/
modifier lockWithDelay(uint256 delay) {
uint256 currentTime = block.timestamp;
uint256 nextAprrovedDelay = currentTime + delay;
if(isLocked() == false)
{
_delay = nextAprrovedDelay;
_lock();
_;
}
else
{
require(_delay <= currentTime, "Locker: this function is locked!");
_unlock();
_delay = nextAprrovedDelay;
_lock();
_;
}
}
modifier lockWithDelayBySelector(uint256 delay, bytes4 selector) {
uint256 currentTime = block.timestamp;
uint256 nextAprrovedDelay = currentTime + delay;
uint256 delayBySelector = _delayBySelector[selector];
bool isNotLocked = delayBySelector == 0 || delayBySelector >= nextAprrovedDelay;
if(isNotLocked) {
_delayBySelector[selector] = nextAprrovedDelay;
} else {
require(delayBySelector <= currentTime, "Locker: this function is locked by selector!");
}
_;
}
/**
* @dev Unlocks the function
*/
modifier unlock() {
_unlock();
_;
}
function isLocked() public virtual view returns (bool)
{
return _status == _LOCKED;
}
function _lock() private {
// Verify if status is not locked otherwise exit function
require(_status != _LOCKED, "Locker: this function is locked!");
// Any calls to lock after this point will fail
_status = _LOCKED;
}
function _unlock() private {
// Verify if status is not locked otherwise exit function
require(_status != _UNLOCKED, "Locker: this function is not locked!");
_status = _UNLOCKED;
}
}
// 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/cryptography/MerkleProof.sol)
pragma solidity ^0.8.0;
/**
* @dev These functions deal with verification of Merkle Tree proofs.
*
* The tree and the proofs can be generated using our
* https://github.com/OpenZeppelin/merkle-tree[JavaScript library].
* You will find a quickstart guide in the readme.
*
* WARNING: You should avoid using leaf values that are 64 bytes long prior to
* hashing, or use a hash function other than keccak256 for hashing leaves.
* This is because the concatenation of a sorted pair of internal nodes in
* the merkle tree could be reinterpreted as a leaf value.
* OpenZeppelin's JavaScript library generates merkle trees that are safe
* against this attack out of the box.
*/
library MerkleProof {
/**
* @dev Returns true if a `leaf` can be proved to be a part of a Merkle tree
* defined by `root`. For this, a `proof` must be provided, containing
* sibling hashes on the branch from the leaf to the root of the tree. Each
* pair of leaves and each pair of pre-images are assumed to be sorted.
*/
function verify(
bytes32[] memory proof,
bytes32 root,
bytes32 leaf
) internal pure returns (bool) {
return processProof(proof, leaf) == root;
}
/**
* @dev Calldata version of {verify}
*
* _Available since v4.7._
*/
function verifyCalldata(
bytes32[] calldata proof,
bytes32 root,
bytes32 leaf
) internal pure returns (bool) {
return processProofCalldata(proof, leaf) == root;
}
/**
* @dev Returns the rebuilt hash obtained by traversing a Merkle tree up
* from `leaf` using `proof`. A `proof` is valid if and only if the rebuilt
* hash matches the root of the tree. When processing the proof, the pairs
* of leafs & pre-images are assumed to be sorted.
*
* _Available since v4.4._
*/
function processProof(bytes32[] memory proof, bytes32 leaf) internal pure returns (bytes32) {
bytes32 computedHash = leaf;
for (uint256 i = 0; i < proof.length; i++) {
computedHash = _hashPair(computedHash, proof[i]);
}
return computedHash;
}
/**
* @dev Calldata version of {processProof}
*
* _Available since v4.7._
*/
function processProofCalldata(bytes32[] calldata proof, bytes32 leaf) internal pure returns (bytes32) {
bytes32 computedHash = leaf;
for (uint256 i = 0; i < proof.length; i++) {
computedHash = _hashPair(computedHash, proof[i]);
}
return computedHash;
}
/**
* @dev Returns true if the `leaves` can be simultaneously proven to be a part of a merkle tree defined by
* `root`, according to `proof` and `proofFlags` as described in {processMultiProof}.
*
* CAUTION: Not all merkle trees admit multiproofs. See {processMultiProof} for details.
*
* _Available since v4.7._
*/
function multiProofVerify(
bytes32[] memory proof,
bool[] memory proofFlags,
bytes32 root,
bytes32[] memory leaves
) internal pure returns (bool) {
return processMultiProof(proof, proofFlags, leaves) == root;
}
/**
* @dev Calldata version of {multiProofVerify}
*
* CAUTION: Not all merkle trees admit multiproofs. See {processMultiProof} for details.
*
* _Available since v4.7._
*/
function multiProofVerifyCalldata(
bytes32[] calldata proof,
bool[] calldata proofFlags,
bytes32 root,
bytes32[] memory leaves
) internal pure returns (bool) {
return processMultiProofCalldata(proof, proofFlags, leaves) == root;
}
/**
* @dev Returns the root of a tree reconstructed from `leaves` and sibling nodes in `proof`. The reconstruction
* proceeds by incrementally reconstructing all inner nodes by combining a leaf/inner node with either another
* leaf/inner node or a proof sibling node, depending on whether each `proofFlags` item is true or false
* respectively.
*
* CAUTION: Not all merkle trees admit multiproofs. To use multiproofs, it is sufficient to ensure that: 1) the tree
* is complete (but not necessarily perfect), 2) the leaves to be proven are in the opposite order they are in the
* tree (i.e., as seen from right to left starting at the deepest layer and continuing at the next layer).
*
* _Available since v4.7._
*/
function processMultiProof(
bytes32[] memory proof,
bool[] memory proofFlags,
bytes32[] memory leaves
) internal pure returns (bytes32 merkleRoot) {
// This function rebuild the root hash by traversing the tree up from the leaves. The root is rebuilt by
// consuming and producing values on a queue. The queue starts with the `leaves` array, then goes onto the
// `hashes` array. At the end of the process, the last hash in the `hashes` array should contain the root of
// the merkle tree.
uint256 leavesLen = leaves.length;
uint256 totalHashes = proofFlags.length;
// Check proof validity.
require(leavesLen + proof.length - 1 == totalHashes, "MerkleProof: invalid multiproof");
// The xxxPos values are "pointers" to the next value to consume in each array. All accesses are done using
// `xxx[xxxPos++]`, which return the current value and increment the pointer, thus mimicking a queue's "pop".
bytes32[] memory hashes = new bytes32[](totalHashes);
uint256 leafPos = 0;
uint256 hashPos = 0;
uint256 proofPos = 0;
// At each step, we compute the next hash using two values:
// - a value from the "main queue". If not all leaves have been consumed, we get the next leaf, otherwise we
// get the next hash.
// - depending on the flag, either another value for the "main queue" (merging branches) or an element from the
// `proof` array.
for (uint256 i = 0; i < totalHashes; i++) {
bytes32 a = leafPos < leavesLen ? leaves[leafPos++] : hashes[hashPos++];
bytes32 b = proofFlags[i] ? leafPos < leavesLen ? leaves[leafPos++] : hashes[hashPos++] : proof[proofPos++];
hashes[i] = _hashPair(a, b);
}
if (totalHashes > 0) {
return hashes[totalHashes - 1];
} else if (leavesLen > 0) {
return leaves[0];
} else {
return proof[0];
}
}
/**
* @dev Calldata version of {processMultiProof}.
*
* CAUTION: Not all merkle trees admit multiproofs. See {processMultiProof} for details.
*
* _Available since v4.7._
*/
function processMultiProofCalldata(
bytes32[] calldata proof,
bool[] calldata proofFlags,
bytes32[] memory leaves
) internal pure returns (bytes32 merkleRoot) {
// This function rebuild the root hash by traversing the tree up from the leaves. The root is rebuilt by
// consuming and producing values on a queue. The queue starts with the `leaves` array, then goes onto the
// `hashes` array. At the end of the process, the last hash in the `hashes` array should contain the root of
// the merkle tree.
uint256 leavesLen = leaves.length;
uint256 totalHashes = proofFlags.length;
// Check proof validity.
require(leavesLen + proof.length - 1 == totalHashes, "MerkleProof: invalid multiproof");
// The xxxPos values are "pointers" to the next value to consume in each array. All accesses are done using
// `xxx[xxxPos++]`, which return the current value and increment the pointer, thus mimicking a queue's "pop".
bytes32[] memory hashes = new bytes32[](totalHashes);
uint256 leafPos = 0;
uint256 hashPos = 0;
uint256 proofPos = 0;
// At each step, we compute the next hash using two values:
// - a value from the "main queue". If not all leaves have been consumed, we get the next leaf, otherwise we
// get the next hash.
// - depending on the flag, either another value for the "main queue" (merging branches) or an element from the
// `proof` array.
for (uint256 i = 0; i < totalHashes; i++) {
bytes32 a = leafPos < leavesLen ? leaves[leafPos++] : hashes[hashPos++];
bytes32 b = proofFlags[i] ? leafPos < leavesLen ? leaves[leafPos++] : hashes[hashPos++] : proof[proofPos++];
hashes[i] = _hashPair(a, b);
}
if (totalHashes > 0) {
return hashes[totalHashes - 1];
} else if (leavesLen > 0) {
return leaves[0];
} else {
return proof[0];
}
}
function _hashPair(bytes32 a, bytes32 b) private pure returns (bytes32) {
return a < b ? _efficientHash(a, b) : _efficientHash(b, a);
}
function _efficientHash(bytes32 a, bytes32 b) private pure returns (bytes32 value) {
/// @solidity memory-safe-assembly
assembly {
mstore(0x00, a)
mstore(0x20, b)
value := keccak256(0x00, 0x40)
}
}
}
// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v4.7.0) (access/Ownable.sol)
pragma solidity ^0.8.0;
import "../utils/Context.sol";
/**
* @dev Contract module which provides a basic access control mechanism, where
* there is an account (an owner) that can be granted exclusive access to
* specific functions.
*
* By default, the owner account will be the one that deploys the contract. This
* can later be changed with {transferOwnership}.
*
* This module is used through inheritance. It will make available the modifier
* `onlyOwner`, which can be applied to your functions to restrict their use to
* the owner.
*/
abstract contract Ownable is Context {
address private _owner;
event OwnershipTransferred(address indexed previousOwner, address indexed newOwner);
/**
* @dev Initializes the contract setting the deployer as the initial owner.
*/
constructor() {
_transferOwnership(_msgSender());
}
/**
* @dev Throws if called by any account other than the owner.
*/
modifier onlyOwner() {
_checkOwner();
_;
}
/**
* @dev Returns the address of the current owner.
*/
function owner() public view virtual returns (address) {
return _owner;
}
/**
* @dev Throws if the sender is not the owner.
*/
function _checkOwner() internal view virtual {
require(owner() == _msgSender(), "Ownable: caller is not the owner");
}
/**
* @dev Leaves the contract without owner. It will not be possible to call
* `onlyOwner` functions anymore. Can only be called by the current owner.
*
* NOTE: Renouncing ownership will leave the contract without an owner,
* thereby removing any functionality that is only available to the owner.
*/
function renounceOwnership() public virtual onlyOwner {
_transferOwnership(address(0));
}
/**
* @dev Transfers ownership of the contract to a new account (`newOwner`).
* Can only be called by the current owner.
*/
function transferOwnership(address newOwner) public virtual onlyOwner {
require(newOwner != address(0), "Ownable: new owner is the zero address");
_transferOwnership(newOwner);
}
/**
* @dev Transfers ownership of the contract to a new account (`newOwner`).
* Internal function without access restriction.
*/
function _transferOwnership(address newOwner) internal virtual {
address oldOwner = _owner;
_owner = newOwner;
emit OwnershipTransferred(oldOwner, newOwner);
}
}
// SPDX-License-Identifier: MIT
// 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);
}
}
{
"compilationTarget": {
"contracts/pass/CryptoflatsNFT.sol": "CryptoflatsNFT"
},
"evmVersion": "paris",
"libraries": {},
"metadata": {
"bytecodeHash": "ipfs"
},
"optimizer": {
"enabled": true,
"runs": 1200
},
"remappings": []
}
[{"inputs":[{"internalType":"string","name":"name_","type":"string"},{"internalType":"string","name":"symbol_","type":"string"},{"internalType":"string","name":"baseURI_","type":"string"},{"internalType":"address payable","name":"teamWallet_","type":"address"},{"internalType":"uint256","name":"gen_","type":"uint256"},{"internalType":"uint256","name":"maxSupply_","type":"uint256"},{"internalType":"uint256","name":"publicSalePrice_","type":"uint256"},{"internalType":"uint256","name":"earlyAccessPrice_","type":"uint256"},{"internalType":"uint16","name":"placesForFreeAccessWhitelist_","type":"uint16"},{"internalType":"uint16","name":"placesForEarlyAccessWhitelist_","type":"uint16"}],"stateMutability":"nonpayable","type":"constructor"},{"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":false,"internalType":"uint256","name":"quantity","type":"uint256"}],"name":"CNRSMinted","type":"event"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"uint256","name":"id","type":"uint256"},{"indexed":false,"internalType":"string","name":"newNftType","type":"string"}],"name":"CryptoflatsNftTypeChanged","type":"event"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"uint256","name":"quantity","type":"uint256"}],"name":"OwnerMinted","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":false,"internalType":"uint256","name":"amount","type":"uint256"}],"name":"Received","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"from","type":"address"},{"indexed":true,"internalType":"address","name":"oldTeamWalletAddress","type":"address"},{"indexed":true,"internalType":"address","name":"newTeamWalletAddress","type":"address"}],"name":"TeamWalletTransferred","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"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"from","type":"address"},{"indexed":false,"internalType":"bytes32","name":"oldWhitelistRoot","type":"bytes32"},{"indexed":false,"internalType":"bytes32","name":"newWhitelistRoot","type":"bytes32"},{"indexed":false,"internalType":"string","name":"whitelistNaming","type":"string"}],"name":"WhitelistRootChanged","type":"event"},{"inputs":[],"name":"DEFAULT_ROYALTY","outputs":[{"internalType":"uint96","name":"","type":"uint96"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"LOCK_PERIOD","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"MAX_ALLOWED_MINT_FOR_DISCOUNT_WHITELIST","outputs":[{"internalType":"uint8","name":"","type":"uint8"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"MAX_ALLOWED_MINT_FOR_FREE_WHITELIST","outputs":[{"internalType":"uint8","name":"","type":"uint8"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"MAX_INITIAL_PRICE_FOR_EARLY_ACCESS_SALE","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"MAX_INITIAL_PRICE_FOR_PUBLIC_SALE","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"MAX_SUPPLY","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"MIN_INITIAL_PRICE_FOR_EARLY_ACCESS_SALE","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"MIN_INITIAL_PRICE_FOR_PUBLIC_SALE","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"PLACES_FOR_EARLY_ACCESS_WHITELIST","outputs":[{"internalType":"uint16","name":"","type":"uint16"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"PLACES_FOR_FREE_ACCESS_WHITELIST","outputs":[{"internalType":"uint16","name":"","type":"uint16"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"activatePublicSale","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"to","type":"address"},{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"airdrop","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"to","type":"address"},{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"approve","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"owner","type":"address"}],"name":"balanceOf","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"newEarlyAccessSalePrice","type":"uint256"}],"name":"changeEarlyAccessSalePrice","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"newPublicSalePrice","type":"uint256"}],"name":"changePublicSalePrice","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"clearRaritiesArray","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"deactivatePublicSale","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"earlyAccessPlacesCounter","outputs":[{"internalType":"uint16","name":"","type":"uint16"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"earlyAccessPrice","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"freeAccessPlacesCounter","outputs":[{"internalType":"uint16","name":"","type":"uint16"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"gen","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"getApproved","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"account","type":"address"}],"name":"getHoldingIdsByAccountAddress","outputs":[{"internalType":"uint256[]","name":"","type":"uint256[]"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"","type":"address"}],"name":"getMintCountForEarlyAccessUser","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"_id","type":"uint256"}],"name":"getNFTType","outputs":[{"internalType":"enum Type","name":"","type":"uint8"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"getRaritiesArray","outputs":[{"internalType":"enum Type[]","name":"","type":"uint8[]"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"owner","type":"address"},{"internalType":"address","name":"operator","type":"address"}],"name":"isApprovedForAll","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"isLocked","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"isPublicSaleActive","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"bytes32[]","name":"whitelistMerkleProof","type":"bytes32[]"},{"internalType":"address","name":"account","type":"address"}],"name":"isUserEarlyAccessWhitelist","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"bytes32[]","name":"whitelistMerkleProof","type":"bytes32[]"},{"internalType":"address","name":"account","type":"address"}],"name":"isUserFreePurchaseWhitelist","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"","type":"address"}],"name":"isWhitelistFreePurchaseUserMintedOnce","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"maxSupply","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"quantity","type":"uint256"}],"name":"mint","outputs":[],"stateMutability":"payable","type":"function"},{"inputs":[{"internalType":"bytes32[]","name":"whitelistEarlyAccessProof","type":"bytes32[]"},{"internalType":"uint256","name":"quantity","type":"uint256"}],"name":"mintEarlyAccess","outputs":[],"stateMutability":"payable","type":"function"},{"inputs":[{"internalType":"bytes32[]","name":"whitelistFreePurchaseProof","type":"bytes32[]"}],"name":"mintFreeAccess","outputs":[],"stateMutability":"nonpayable","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":"publicSalePrice","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"renounceOwnership","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"_tokenId","type":"uint256"},{"internalType":"uint256","name":"_salePrice","type":"uint256"}],"name":"royaltyInfo","outputs":[{"internalType":"address","name":"","type":"address"},{"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":"safeTransferFrom","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"from","type":"address"},{"internalType":"address","name":"to","type":"address"},{"internalType":"uint256","name":"tokenId","type":"uint256"},{"internalType":"bytes","name":"_data","type":"bytes"}],"name":"safeTransferFrom","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"operator","type":"address"},{"internalType":"bool","name":"approved","type":"bool"}],"name":"setApprovalForAll","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"bytes32","name":"newEarlyAccessWhitelistRoot","type":"bytes32"},{"internalType":"int16","name":"value","type":"int16"}],"name":"setNewEarlyAccessWhitelistRoot","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"bytes32","name":"newFreePurchaseWhitelistRoot","type":"bytes32"},{"internalType":"int16","name":"value","type":"int16"}],"name":"setNewFreePurchaseWhitelistRoot","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address payable","name":"newTeamWallet","type":"address"}],"name":"setNewTeamWallet","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"enum Type[]","name":"rarityArray","type":"uint8[]"}],"name":"setRaritiesArray","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":"teamWallet","outputs":[{"internalType":"address payable","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"tokenURI","outputs":[{"internalType":"string","name":"","type":"string"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"totalSupply","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"from","type":"address"},{"internalType":"address","name":"to","type":"address"},{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"transferFrom","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"newOwner","type":"address"}],"name":"transferOwnership","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"whitelistEarlyAccessRoot","outputs":[{"internalType":"bytes32","name":"","type":"bytes32"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"whitelistFreePurchaseRoot","outputs":[{"internalType":"bytes32","name":"","type":"bytes32"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"withdrawBalance","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"nonpayable","type":"function"},{"stateMutability":"payable","type":"receive"}]