Overview
TokenID
220
Total Transfers
-
Market
Onchain Market Cap
$0.00
Circulating Supply Market Cap
-
Other Info
Token Contract
Loading...
Loading
Loading...
Loading
Loading...
Loading
This contract may be a proxy contract. Click on More Options and select Is this a proxy? to confirm and enable the "Read as Proxy" & "Write as Proxy" tabs.
Contract Source Code Verified (Exact Match)
Contract Name:
AbstractFluffs
Compiler Version
v0.8.24+commit.e11b9ed9
ZkSolc Version
v1.5.7
Optimization Enabled:
Yes with Mode 3
Other Settings:
paris EvmVersion
Contract Source Code (Solidity Standard Json-Input format)
// SPDX-License-Identifier: MIT
// File: @openzeppelin/contracts/utils/introspection/IERC165.sol
// OpenZeppelin Contracts (last updated v5.1.0) (utils/introspection/IERC165.sol)
pragma solidity ^0.8.20;
/**
* @dev Interface of the ERC-165 standard, as defined in the
* https://eips.ethereum.org/EIPS/eip-165[ERC].
*
* 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[ERC 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);
}
// File: @openzeppelin/contracts/token/ERC721/IERC721.sol
// OpenZeppelin Contracts (last updated v5.1.0) (token/ERC721/IERC721.sol)
pragma solidity ^0.8.20;
/**
* @dev Required interface of an ERC-721 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 ERC-721 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 ERC-721
* 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 address zero.
*
* 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);
}
// File: @openzeppelin/contracts/token/ERC721/extensions/IERC721Metadata.sol
// OpenZeppelin Contracts (last updated v5.0.0) (token/ERC721/extensions/IERC721Metadata.sol)
pragma solidity ^0.8.20;
/**
* @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);
}
// File: @openzeppelin/contracts/token/ERC721/IERC721Receiver.sol
// OpenZeppelin Contracts (last updated v5.1.0) (token/ERC721/IERC721Receiver.sol)
pragma solidity ^0.8.20;
/**
* @title ERC-721 token receiver interface
* @dev Interface for any contract that wants to support safeTransfers
* from ERC-721 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);
}
// File: @openzeppelin/contracts/interfaces/draft-IERC6093.sol
// OpenZeppelin Contracts (last updated v5.1.0) (interfaces/draft-IERC6093.sol)
pragma solidity ^0.8.20;
/**
* @dev Standard ERC-20 Errors
* Interface of the https://eips.ethereum.org/EIPS/eip-6093[ERC-6093] custom errors for ERC-20 tokens.
*/
interface IERC20Errors {
/**
* @dev Indicates an error related to the current `balance` of a `sender`. Used in transfers.
* @param sender Address whose tokens are being transferred.
* @param balance Current balance for the interacting account.
* @param needed Minimum amount required to perform a transfer.
*/
error ERC20InsufficientBalance(address sender, uint256 balance, uint256 needed);
/**
* @dev Indicates a failure with the token `sender`. Used in transfers.
* @param sender Address whose tokens are being transferred.
*/
error ERC20InvalidSender(address sender);
/**
* @dev Indicates a failure with the token `receiver`. Used in transfers.
* @param receiver Address to which tokens are being transferred.
*/
error ERC20InvalidReceiver(address receiver);
/**
* @dev Indicates a failure with the `spender`’s `allowance`. Used in transfers.
* @param spender Address that may be allowed to operate on tokens without being their owner.
* @param allowance Amount of tokens a `spender` is allowed to operate with.
* @param needed Minimum amount required to perform a transfer.
*/
error ERC20InsufficientAllowance(address spender, uint256 allowance, uint256 needed);
/**
* @dev Indicates a failure with the `approver` of a token to be approved. Used in approvals.
* @param approver Address initiating an approval operation.
*/
error ERC20InvalidApprover(address approver);
/**
* @dev Indicates a failure with the `spender` to be approved. Used in approvals.
* @param spender Address that may be allowed to operate on tokens without being their owner.
*/
error ERC20InvalidSpender(address spender);
}
/**
* @dev Standard ERC-721 Errors
* Interface of the https://eips.ethereum.org/EIPS/eip-6093[ERC-6093] custom errors for ERC-721 tokens.
*/
interface IERC721Errors {
/**
* @dev Indicates that an address can't be an owner. For example, `address(0)` is a forbidden owner in ERC-20.
* Used in balance queries.
* @param owner Address of the current owner of a token.
*/
error ERC721InvalidOwner(address owner);
/**
* @dev Indicates a `tokenId` whose `owner` is the zero address.
* @param tokenId Identifier number of a token.
*/
error ERC721NonexistentToken(uint256 tokenId);
/**
* @dev Indicates an error related to the ownership over a particular token. Used in transfers.
* @param sender Address whose tokens are being transferred.
* @param tokenId Identifier number of a token.
* @param owner Address of the current owner of a token.
*/
error ERC721IncorrectOwner(address sender, uint256 tokenId, address owner);
/**
* @dev Indicates a failure with the token `sender`. Used in transfers.
* @param sender Address whose tokens are being transferred.
*/
error ERC721InvalidSender(address sender);
/**
* @dev Indicates a failure with the token `receiver`. Used in transfers.
* @param receiver Address to which tokens are being transferred.
*/
error ERC721InvalidReceiver(address receiver);
/**
* @dev Indicates a failure with the `operator`’s approval. Used in transfers.
* @param operator Address that may be allowed to operate on tokens without being their owner.
* @param tokenId Identifier number of a token.
*/
error ERC721InsufficientApproval(address operator, uint256 tokenId);
/**
* @dev Indicates a failure with the `approver` of a token to be approved. Used in approvals.
* @param approver Address initiating an approval operation.
*/
error ERC721InvalidApprover(address approver);
/**
* @dev Indicates a failure with the `operator` to be approved. Used in approvals.
* @param operator Address that may be allowed to operate on tokens without being their owner.
*/
error ERC721InvalidOperator(address operator);
}
/**
* @dev Standard ERC-1155 Errors
* Interface of the https://eips.ethereum.org/EIPS/eip-6093[ERC-6093] custom errors for ERC-1155 tokens.
*/
interface IERC1155Errors {
/**
* @dev Indicates an error related to the current `balance` of a `sender`. Used in transfers.
* @param sender Address whose tokens are being transferred.
* @param balance Current balance for the interacting account.
* @param needed Minimum amount required to perform a transfer.
* @param tokenId Identifier number of a token.
*/
error ERC1155InsufficientBalance(address sender, uint256 balance, uint256 needed, uint256 tokenId);
/**
* @dev Indicates a failure with the token `sender`. Used in transfers.
* @param sender Address whose tokens are being transferred.
*/
error ERC1155InvalidSender(address sender);
/**
* @dev Indicates a failure with the token `receiver`. Used in transfers.
* @param receiver Address to which tokens are being transferred.
*/
error ERC1155InvalidReceiver(address receiver);
/**
* @dev Indicates a failure with the `operator`’s approval. Used in transfers.
* @param operator Address that may be allowed to operate on tokens without being their owner.
* @param owner Address of the current owner of a token.
*/
error ERC1155MissingApprovalForAll(address operator, address owner);
/**
* @dev Indicates a failure with the `approver` of a token to be approved. Used in approvals.
* @param approver Address initiating an approval operation.
*/
error ERC1155InvalidApprover(address approver);
/**
* @dev Indicates a failure with the `operator` to be approved. Used in approvals.
* @param operator Address that may be allowed to operate on tokens without being their owner.
*/
error ERC1155InvalidOperator(address operator);
/**
* @dev Indicates an array length mismatch between ids and values in a safeBatchTransferFrom operation.
* Used in batch transfers.
* @param idsLength Length of the array of token identifiers
* @param valuesLength Length of the array of token amounts
*/
error ERC1155InvalidArrayLength(uint256 idsLength, uint256 valuesLength);
}
// File: @openzeppelin/contracts/token/ERC721/utils/ERC721Utils.sol
// OpenZeppelin Contracts (last updated v5.1.0) (token/ERC721/utils/ERC721Utils.sol)
pragma solidity ^0.8.20;
/**
* @dev Library that provide common ERC-721 utility functions.
*
* See https://eips.ethereum.org/EIPS/eip-721[ERC-721].
*
* _Available since v5.1._
*/
library ERC721Utils {
/**
* @dev Performs an acceptance check for the provided `operator` by calling {IERC721-onERC721Received}
* on the `to` address. The `operator` is generally the address that initiated the token transfer (i.e. `msg.sender`).
*
* The acceptance call is not executed and treated as a no-op if the target address doesn't contain code (i.e. an EOA).
* Otherwise, the recipient must implement {IERC721Receiver-onERC721Received} and return the acceptance magic value to accept
* the transfer.
*/
function checkOnERC721Received(
address operator,
address from,
address to,
uint256 tokenId,
bytes memory data
) internal {
if (to.code.length > 0) {
try IERC721Receiver(to).onERC721Received(operator, from, tokenId, data) returns (bytes4 retval) {
if (retval != IERC721Receiver.onERC721Received.selector) {
// Token rejected
revert IERC721Errors.ERC721InvalidReceiver(to);
}
} catch (bytes memory reason) {
if (reason.length == 0) {
// non-IERC721Receiver implementer
revert IERC721Errors.ERC721InvalidReceiver(to);
} else {
assembly ("memory-safe") {
revert(add(32, reason), mload(reason))
}
}
}
}
}
}
// File: @openzeppelin/contracts/utils/Context.sol
// OpenZeppelin Contracts (last updated v5.0.1) (utils/Context.sol)
pragma solidity ^0.8.20;
/**
* @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;
}
function _contextSuffixLength() internal view virtual returns (uint256) {
return 0;
}
}
// File: @openzeppelin/contracts/utils/Panic.sol
// OpenZeppelin Contracts (last updated v5.1.0) (utils/Panic.sol)
pragma solidity ^0.8.20;
/**
* @dev Helper library for emitting standardized panic codes.
*
* ```solidity
* contract Example {
* using Panic for uint256;
*
* // Use any of the declared internal constants
* function foo() { Panic.GENERIC.panic(); }
*
* // Alternatively
* function foo() { Panic.panic(Panic.GENERIC); }
* }
* ```
*
* Follows the list from https://github.com/ethereum/solidity/blob/v0.8.24/libsolutil/ErrorCodes.h[libsolutil].
*
* _Available since v5.1._
*/
// slither-disable-next-line unused-state
library Panic {
/// @dev generic / unspecified error
uint256 internal constant GENERIC = 0x00;
/// @dev used by the assert() builtin
uint256 internal constant ASSERT = 0x01;
/// @dev arithmetic underflow or overflow
uint256 internal constant UNDER_OVERFLOW = 0x11;
/// @dev division or modulo by zero
uint256 internal constant DIVISION_BY_ZERO = 0x12;
/// @dev enum conversion error
uint256 internal constant ENUM_CONVERSION_ERROR = 0x21;
/// @dev invalid encoding in storage
uint256 internal constant STORAGE_ENCODING_ERROR = 0x22;
/// @dev empty array pop
uint256 internal constant EMPTY_ARRAY_POP = 0x31;
/// @dev array out of bounds access
uint256 internal constant ARRAY_OUT_OF_BOUNDS = 0x32;
/// @dev resource error (too large allocation or too large array)
uint256 internal constant RESOURCE_ERROR = 0x41;
/// @dev calling invalid internal function
uint256 internal constant INVALID_INTERNAL_FUNCTION = 0x51;
/// @dev Reverts with a panic code. Recommended to use with
/// the internal constants with predefined codes.
function panic(uint256 code) internal pure {
assembly ("memory-safe") {
mstore(0x00, 0x4e487b71)
mstore(0x20, code)
revert(0x1c, 0x24)
}
}
}
// File: @openzeppelin/contracts/utils/math/SafeCast.sol
// OpenZeppelin Contracts (last updated v5.1.0) (utils/math/SafeCast.sol)
// This file was procedurally generated from scripts/generate/templates/SafeCast.js.
pragma solidity ^0.8.20;
/**
* @dev Wrappers over Solidity's uintXX/intXX/bool casting operators with added overflow
* checks.
*
* Downcasting from uint256/int256 in Solidity does not revert on overflow. This can
* easily result in undesired exploitation or bugs, since developers usually
* assume that overflows raise errors. `SafeCast` restores this intuition by
* reverting the transaction when such an operation overflows.
*
* Using this library instead of the unchecked operations eliminates an entire
* class of bugs, so it's recommended to use it always.
*/
library SafeCast {
/**
* @dev Value doesn't fit in an uint of `bits` size.
*/
error SafeCastOverflowedUintDowncast(uint8 bits, uint256 value);
/**
* @dev An int value doesn't fit in an uint of `bits` size.
*/
error SafeCastOverflowedIntToUint(int256 value);
/**
* @dev Value doesn't fit in an int of `bits` size.
*/
error SafeCastOverflowedIntDowncast(uint8 bits, int256 value);
/**
* @dev An uint value doesn't fit in an int of `bits` size.
*/
error SafeCastOverflowedUintToInt(uint256 value);
/**
* @dev Returns the downcasted uint248 from uint256, reverting on
* overflow (when the input is greater than largest uint248).
*
* Counterpart to Solidity's `uint248` operator.
*
* Requirements:
*
* - input must fit into 248 bits
*/
function toUint248(uint256 value) internal pure returns (uint248) {
if (value > type(uint248).max) {
revert SafeCastOverflowedUintDowncast(248, value);
}
return uint248(value);
}
/**
* @dev Returns the downcasted uint240 from uint256, reverting on
* overflow (when the input is greater than largest uint240).
*
* Counterpart to Solidity's `uint240` operator.
*
* Requirements:
*
* - input must fit into 240 bits
*/
function toUint240(uint256 value) internal pure returns (uint240) {
if (value > type(uint240).max) {
revert SafeCastOverflowedUintDowncast(240, value);
}
return uint240(value);
}
/**
* @dev Returns the downcasted uint232 from uint256, reverting on
* overflow (when the input is greater than largest uint232).
*
* Counterpart to Solidity's `uint232` operator.
*
* Requirements:
*
* - input must fit into 232 bits
*/
function toUint232(uint256 value) internal pure returns (uint232) {
if (value > type(uint232).max) {
revert SafeCastOverflowedUintDowncast(232, value);
}
return uint232(value);
}
/**
* @dev Returns the downcasted uint224 from uint256, reverting on
* overflow (when the input is greater than largest uint224).
*
* Counterpart to Solidity's `uint224` operator.
*
* Requirements:
*
* - input must fit into 224 bits
*/
function toUint224(uint256 value) internal pure returns (uint224) {
if (value > type(uint224).max) {
revert SafeCastOverflowedUintDowncast(224, value);
}
return uint224(value);
}
/**
* @dev Returns the downcasted uint216 from uint256, reverting on
* overflow (when the input is greater than largest uint216).
*
* Counterpart to Solidity's `uint216` operator.
*
* Requirements:
*
* - input must fit into 216 bits
*/
function toUint216(uint256 value) internal pure returns (uint216) {
if (value > type(uint216).max) {
revert SafeCastOverflowedUintDowncast(216, value);
}
return uint216(value);
}
/**
* @dev Returns the downcasted uint208 from uint256, reverting on
* overflow (when the input is greater than largest uint208).
*
* Counterpart to Solidity's `uint208` operator.
*
* Requirements:
*
* - input must fit into 208 bits
*/
function toUint208(uint256 value) internal pure returns (uint208) {
if (value > type(uint208).max) {
revert SafeCastOverflowedUintDowncast(208, value);
}
return uint208(value);
}
/**
* @dev Returns the downcasted uint200 from uint256, reverting on
* overflow (when the input is greater than largest uint200).
*
* Counterpart to Solidity's `uint200` operator.
*
* Requirements:
*
* - input must fit into 200 bits
*/
function toUint200(uint256 value) internal pure returns (uint200) {
if (value > type(uint200).max) {
revert SafeCastOverflowedUintDowncast(200, value);
}
return uint200(value);
}
/**
* @dev Returns the downcasted uint192 from uint256, reverting on
* overflow (when the input is greater than largest uint192).
*
* Counterpart to Solidity's `uint192` operator.
*
* Requirements:
*
* - input must fit into 192 bits
*/
function toUint192(uint256 value) internal pure returns (uint192) {
if (value > type(uint192).max) {
revert SafeCastOverflowedUintDowncast(192, value);
}
return uint192(value);
}
/**
* @dev Returns the downcasted uint184 from uint256, reverting on
* overflow (when the input is greater than largest uint184).
*
* Counterpart to Solidity's `uint184` operator.
*
* Requirements:
*
* - input must fit into 184 bits
*/
function toUint184(uint256 value) internal pure returns (uint184) {
if (value > type(uint184).max) {
revert SafeCastOverflowedUintDowncast(184, value);
}
return uint184(value);
}
/**
* @dev Returns the downcasted uint176 from uint256, reverting on
* overflow (when the input is greater than largest uint176).
*
* Counterpart to Solidity's `uint176` operator.
*
* Requirements:
*
* - input must fit into 176 bits
*/
function toUint176(uint256 value) internal pure returns (uint176) {
if (value > type(uint176).max) {
revert SafeCastOverflowedUintDowncast(176, value);
}
return uint176(value);
}
/**
* @dev Returns the downcasted uint168 from uint256, reverting on
* overflow (when the input is greater than largest uint168).
*
* Counterpart to Solidity's `uint168` operator.
*
* Requirements:
*
* - input must fit into 168 bits
*/
function toUint168(uint256 value) internal pure returns (uint168) {
if (value > type(uint168).max) {
revert SafeCastOverflowedUintDowncast(168, value);
}
return uint168(value);
}
/**
* @dev Returns the downcasted uint160 from uint256, reverting on
* overflow (when the input is greater than largest uint160).
*
* Counterpart to Solidity's `uint160` operator.
*
* Requirements:
*
* - input must fit into 160 bits
*/
function toUint160(uint256 value) internal pure returns (uint160) {
if (value > type(uint160).max) {
revert SafeCastOverflowedUintDowncast(160, value);
}
return uint160(value);
}
/**
* @dev Returns the downcasted uint152 from uint256, reverting on
* overflow (when the input is greater than largest uint152).
*
* Counterpart to Solidity's `uint152` operator.
*
* Requirements:
*
* - input must fit into 152 bits
*/
function toUint152(uint256 value) internal pure returns (uint152) {
if (value > type(uint152).max) {
revert SafeCastOverflowedUintDowncast(152, value);
}
return uint152(value);
}
/**
* @dev Returns the downcasted uint144 from uint256, reverting on
* overflow (when the input is greater than largest uint144).
*
* Counterpart to Solidity's `uint144` operator.
*
* Requirements:
*
* - input must fit into 144 bits
*/
function toUint144(uint256 value) internal pure returns (uint144) {
if (value > type(uint144).max) {
revert SafeCastOverflowedUintDowncast(144, value);
}
return uint144(value);
}
/**
* @dev Returns the downcasted uint136 from uint256, reverting on
* overflow (when the input is greater than largest uint136).
*
* Counterpart to Solidity's `uint136` operator.
*
* Requirements:
*
* - input must fit into 136 bits
*/
function toUint136(uint256 value) internal pure returns (uint136) {
if (value > type(uint136).max) {
revert SafeCastOverflowedUintDowncast(136, value);
}
return uint136(value);
}
/**
* @dev Returns the downcasted uint128 from uint256, reverting on
* overflow (when the input is greater than largest uint128).
*
* Counterpart to Solidity's `uint128` operator.
*
* Requirements:
*
* - input must fit into 128 bits
*/
function toUint128(uint256 value) internal pure returns (uint128) {
if (value > type(uint128).max) {
revert SafeCastOverflowedUintDowncast(128, value);
}
return uint128(value);
}
/**
* @dev Returns the downcasted uint120 from uint256, reverting on
* overflow (when the input is greater than largest uint120).
*
* Counterpart to Solidity's `uint120` operator.
*
* Requirements:
*
* - input must fit into 120 bits
*/
function toUint120(uint256 value) internal pure returns (uint120) {
if (value > type(uint120).max) {
revert SafeCastOverflowedUintDowncast(120, value);
}
return uint120(value);
}
/**
* @dev Returns the downcasted uint112 from uint256, reverting on
* overflow (when the input is greater than largest uint112).
*
* Counterpart to Solidity's `uint112` operator.
*
* Requirements:
*
* - input must fit into 112 bits
*/
function toUint112(uint256 value) internal pure returns (uint112) {
if (value > type(uint112).max) {
revert SafeCastOverflowedUintDowncast(112, value);
}
return uint112(value);
}
/**
* @dev Returns the downcasted uint104 from uint256, reverting on
* overflow (when the input is greater than largest uint104).
*
* Counterpart to Solidity's `uint104` operator.
*
* Requirements:
*
* - input must fit into 104 bits
*/
function toUint104(uint256 value) internal pure returns (uint104) {
if (value > type(uint104).max) {
revert SafeCastOverflowedUintDowncast(104, value);
}
return uint104(value);
}
/**
* @dev Returns the downcasted uint96 from uint256, reverting on
* overflow (when the input is greater than largest uint96).
*
* Counterpart to Solidity's `uint96` operator.
*
* Requirements:
*
* - input must fit into 96 bits
*/
function toUint96(uint256 value) internal pure returns (uint96) {
if (value > type(uint96).max) {
revert SafeCastOverflowedUintDowncast(96, value);
}
return uint96(value);
}
/**
* @dev Returns the downcasted uint88 from uint256, reverting on
* overflow (when the input is greater than largest uint88).
*
* Counterpart to Solidity's `uint88` operator.
*
* Requirements:
*
* - input must fit into 88 bits
*/
function toUint88(uint256 value) internal pure returns (uint88) {
if (value > type(uint88).max) {
revert SafeCastOverflowedUintDowncast(88, value);
}
return uint88(value);
}
/**
* @dev Returns the downcasted uint80 from uint256, reverting on
* overflow (when the input is greater than largest uint80).
*
* Counterpart to Solidity's `uint80` operator.
*
* Requirements:
*
* - input must fit into 80 bits
*/
function toUint80(uint256 value) internal pure returns (uint80) {
if (value > type(uint80).max) {
revert SafeCastOverflowedUintDowncast(80, value);
}
return uint80(value);
}
/**
* @dev Returns the downcasted uint72 from uint256, reverting on
* overflow (when the input is greater than largest uint72).
*
* Counterpart to Solidity's `uint72` operator.
*
* Requirements:
*
* - input must fit into 72 bits
*/
function toUint72(uint256 value) internal pure returns (uint72) {
if (value > type(uint72).max) {
revert SafeCastOverflowedUintDowncast(72, value);
}
return uint72(value);
}
/**
* @dev Returns the downcasted uint64 from uint256, reverting on
* overflow (when the input is greater than largest uint64).
*
* Counterpart to Solidity's `uint64` operator.
*
* Requirements:
*
* - input must fit into 64 bits
*/
function toUint64(uint256 value) internal pure returns (uint64) {
if (value > type(uint64).max) {
revert SafeCastOverflowedUintDowncast(64, value);
}
return uint64(value);
}
/**
* @dev Returns the downcasted uint56 from uint256, reverting on
* overflow (when the input is greater than largest uint56).
*
* Counterpart to Solidity's `uint56` operator.
*
* Requirements:
*
* - input must fit into 56 bits
*/
function toUint56(uint256 value) internal pure returns (uint56) {
if (value > type(uint56).max) {
revert SafeCastOverflowedUintDowncast(56, value);
}
return uint56(value);
}
/**
* @dev Returns the downcasted uint48 from uint256, reverting on
* overflow (when the input is greater than largest uint48).
*
* Counterpart to Solidity's `uint48` operator.
*
* Requirements:
*
* - input must fit into 48 bits
*/
function toUint48(uint256 value) internal pure returns (uint48) {
if (value > type(uint48).max) {
revert SafeCastOverflowedUintDowncast(48, value);
}
return uint48(value);
}
/**
* @dev Returns the downcasted uint40 from uint256, reverting on
* overflow (when the input is greater than largest uint40).
*
* Counterpart to Solidity's `uint40` operator.
*
* Requirements:
*
* - input must fit into 40 bits
*/
function toUint40(uint256 value) internal pure returns (uint40) {
if (value > type(uint40).max) {
revert SafeCastOverflowedUintDowncast(40, value);
}
return uint40(value);
}
/**
* @dev Returns the downcasted uint32 from uint256, reverting on
* overflow (when the input is greater than largest uint32).
*
* Counterpart to Solidity's `uint32` operator.
*
* Requirements:
*
* - input must fit into 32 bits
*/
function toUint32(uint256 value) internal pure returns (uint32) {
if (value > type(uint32).max) {
revert SafeCastOverflowedUintDowncast(32, value);
}
return uint32(value);
}
/**
* @dev Returns the downcasted uint24 from uint256, reverting on
* overflow (when the input is greater than largest uint24).
*
* Counterpart to Solidity's `uint24` operator.
*
* Requirements:
*
* - input must fit into 24 bits
*/
function toUint24(uint256 value) internal pure returns (uint24) {
if (value > type(uint24).max) {
revert SafeCastOverflowedUintDowncast(24, value);
}
return uint24(value);
}
/**
* @dev Returns the downcasted uint16 from uint256, reverting on
* overflow (when the input is greater than largest uint16).
*
* Counterpart to Solidity's `uint16` operator.
*
* Requirements:
*
* - input must fit into 16 bits
*/
function toUint16(uint256 value) internal pure returns (uint16) {
if (value > type(uint16).max) {
revert SafeCastOverflowedUintDowncast(16, value);
}
return uint16(value);
}
/**
* @dev Returns the downcasted uint8 from uint256, reverting on
* overflow (when the input is greater than largest uint8).
*
* Counterpart to Solidity's `uint8` operator.
*
* Requirements:
*
* - input must fit into 8 bits
*/
function toUint8(uint256 value) internal pure returns (uint8) {
if (value > type(uint8).max) {
revert SafeCastOverflowedUintDowncast(8, value);
}
return uint8(value);
}
/**
* @dev Converts a signed int256 into an unsigned uint256.
*
* Requirements:
*
* - input must be greater than or equal to 0.
*/
function toUint256(int256 value) internal pure returns (uint256) {
if (value < 0) {
revert SafeCastOverflowedIntToUint(value);
}
return uint256(value);
}
/**
* @dev Returns the downcasted int248 from int256, reverting on
* overflow (when the input is less than smallest int248 or
* greater than largest int248).
*
* Counterpart to Solidity's `int248` operator.
*
* Requirements:
*
* - input must fit into 248 bits
*/
function toInt248(int256 value) internal pure returns (int248 downcasted) {
downcasted = int248(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(248, value);
}
}
/**
* @dev Returns the downcasted int240 from int256, reverting on
* overflow (when the input is less than smallest int240 or
* greater than largest int240).
*
* Counterpart to Solidity's `int240` operator.
*
* Requirements:
*
* - input must fit into 240 bits
*/
function toInt240(int256 value) internal pure returns (int240 downcasted) {
downcasted = int240(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(240, value);
}
}
/**
* @dev Returns the downcasted int232 from int256, reverting on
* overflow (when the input is less than smallest int232 or
* greater than largest int232).
*
* Counterpart to Solidity's `int232` operator.
*
* Requirements:
*
* - input must fit into 232 bits
*/
function toInt232(int256 value) internal pure returns (int232 downcasted) {
downcasted = int232(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(232, value);
}
}
/**
* @dev Returns the downcasted int224 from int256, reverting on
* overflow (when the input is less than smallest int224 or
* greater than largest int224).
*
* Counterpart to Solidity's `int224` operator.
*
* Requirements:
*
* - input must fit into 224 bits
*/
function toInt224(int256 value) internal pure returns (int224 downcasted) {
downcasted = int224(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(224, value);
}
}
/**
* @dev Returns the downcasted int216 from int256, reverting on
* overflow (when the input is less than smallest int216 or
* greater than largest int216).
*
* Counterpart to Solidity's `int216` operator.
*
* Requirements:
*
* - input must fit into 216 bits
*/
function toInt216(int256 value) internal pure returns (int216 downcasted) {
downcasted = int216(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(216, value);
}
}
/**
* @dev Returns the downcasted int208 from int256, reverting on
* overflow (when the input is less than smallest int208 or
* greater than largest int208).
*
* Counterpart to Solidity's `int208` operator.
*
* Requirements:
*
* - input must fit into 208 bits
*/
function toInt208(int256 value) internal pure returns (int208 downcasted) {
downcasted = int208(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(208, value);
}
}
/**
* @dev Returns the downcasted int200 from int256, reverting on
* overflow (when the input is less than smallest int200 or
* greater than largest int200).
*
* Counterpart to Solidity's `int200` operator.
*
* Requirements:
*
* - input must fit into 200 bits
*/
function toInt200(int256 value) internal pure returns (int200 downcasted) {
downcasted = int200(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(200, value);
}
}
/**
* @dev Returns the downcasted int192 from int256, reverting on
* overflow (when the input is less than smallest int192 or
* greater than largest int192).
*
* Counterpart to Solidity's `int192` operator.
*
* Requirements:
*
* - input must fit into 192 bits
*/
function toInt192(int256 value) internal pure returns (int192 downcasted) {
downcasted = int192(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(192, value);
}
}
/**
* @dev Returns the downcasted int184 from int256, reverting on
* overflow (when the input is less than smallest int184 or
* greater than largest int184).
*
* Counterpart to Solidity's `int184` operator.
*
* Requirements:
*
* - input must fit into 184 bits
*/
function toInt184(int256 value) internal pure returns (int184 downcasted) {
downcasted = int184(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(184, value);
}
}
/**
* @dev Returns the downcasted int176 from int256, reverting on
* overflow (when the input is less than smallest int176 or
* greater than largest int176).
*
* Counterpart to Solidity's `int176` operator.
*
* Requirements:
*
* - input must fit into 176 bits
*/
function toInt176(int256 value) internal pure returns (int176 downcasted) {
downcasted = int176(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(176, value);
}
}
/**
* @dev Returns the downcasted int168 from int256, reverting on
* overflow (when the input is less than smallest int168 or
* greater than largest int168).
*
* Counterpart to Solidity's `int168` operator.
*
* Requirements:
*
* - input must fit into 168 bits
*/
function toInt168(int256 value) internal pure returns (int168 downcasted) {
downcasted = int168(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(168, value);
}
}
/**
* @dev Returns the downcasted int160 from int256, reverting on
* overflow (when the input is less than smallest int160 or
* greater than largest int160).
*
* Counterpart to Solidity's `int160` operator.
*
* Requirements:
*
* - input must fit into 160 bits
*/
function toInt160(int256 value) internal pure returns (int160 downcasted) {
downcasted = int160(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(160, value);
}
}
/**
* @dev Returns the downcasted int152 from int256, reverting on
* overflow (when the input is less than smallest int152 or
* greater than largest int152).
*
* Counterpart to Solidity's `int152` operator.
*
* Requirements:
*
* - input must fit into 152 bits
*/
function toInt152(int256 value) internal pure returns (int152 downcasted) {
downcasted = int152(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(152, value);
}
}
/**
* @dev Returns the downcasted int144 from int256, reverting on
* overflow (when the input is less than smallest int144 or
* greater than largest int144).
*
* Counterpart to Solidity's `int144` operator.
*
* Requirements:
*
* - input must fit into 144 bits
*/
function toInt144(int256 value) internal pure returns (int144 downcasted) {
downcasted = int144(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(144, value);
}
}
/**
* @dev Returns the downcasted int136 from int256, reverting on
* overflow (when the input is less than smallest int136 or
* greater than largest int136).
*
* Counterpart to Solidity's `int136` operator.
*
* Requirements:
*
* - input must fit into 136 bits
*/
function toInt136(int256 value) internal pure returns (int136 downcasted) {
downcasted = int136(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(136, value);
}
}
/**
* @dev Returns the downcasted int128 from int256, reverting on
* overflow (when the input is less than smallest int128 or
* greater than largest int128).
*
* Counterpart to Solidity's `int128` operator.
*
* Requirements:
*
* - input must fit into 128 bits
*/
function toInt128(int256 value) internal pure returns (int128 downcasted) {
downcasted = int128(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(128, value);
}
}
/**
* @dev Returns the downcasted int120 from int256, reverting on
* overflow (when the input is less than smallest int120 or
* greater than largest int120).
*
* Counterpart to Solidity's `int120` operator.
*
* Requirements:
*
* - input must fit into 120 bits
*/
function toInt120(int256 value) internal pure returns (int120 downcasted) {
downcasted = int120(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(120, value);
}
}
/**
* @dev Returns the downcasted int112 from int256, reverting on
* overflow (when the input is less than smallest int112 or
* greater than largest int112).
*
* Counterpart to Solidity's `int112` operator.
*
* Requirements:
*
* - input must fit into 112 bits
*/
function toInt112(int256 value) internal pure returns (int112 downcasted) {
downcasted = int112(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(112, value);
}
}
/**
* @dev Returns the downcasted int104 from int256, reverting on
* overflow (when the input is less than smallest int104 or
* greater than largest int104).
*
* Counterpart to Solidity's `int104` operator.
*
* Requirements:
*
* - input must fit into 104 bits
*/
function toInt104(int256 value) internal pure returns (int104 downcasted) {
downcasted = int104(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(104, value);
}
}
/**
* @dev Returns the downcasted int96 from int256, reverting on
* overflow (when the input is less than smallest int96 or
* greater than largest int96).
*
* Counterpart to Solidity's `int96` operator.
*
* Requirements:
*
* - input must fit into 96 bits
*/
function toInt96(int256 value) internal pure returns (int96 downcasted) {
downcasted = int96(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(96, value);
}
}
/**
* @dev Returns the downcasted int88 from int256, reverting on
* overflow (when the input is less than smallest int88 or
* greater than largest int88).
*
* Counterpart to Solidity's `int88` operator.
*
* Requirements:
*
* - input must fit into 88 bits
*/
function toInt88(int256 value) internal pure returns (int88 downcasted) {
downcasted = int88(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(88, value);
}
}
/**
* @dev Returns the downcasted int80 from int256, reverting on
* overflow (when the input is less than smallest int80 or
* greater than largest int80).
*
* Counterpart to Solidity's `int80` operator.
*
* Requirements:
*
* - input must fit into 80 bits
*/
function toInt80(int256 value) internal pure returns (int80 downcasted) {
downcasted = int80(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(80, value);
}
}
/**
* @dev Returns the downcasted int72 from int256, reverting on
* overflow (when the input is less than smallest int72 or
* greater than largest int72).
*
* Counterpart to Solidity's `int72` operator.
*
* Requirements:
*
* - input must fit into 72 bits
*/
function toInt72(int256 value) internal pure returns (int72 downcasted) {
downcasted = int72(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(72, value);
}
}
/**
* @dev Returns the downcasted int64 from int256, reverting on
* overflow (when the input is less than smallest int64 or
* greater than largest int64).
*
* Counterpart to Solidity's `int64` operator.
*
* Requirements:
*
* - input must fit into 64 bits
*/
function toInt64(int256 value) internal pure returns (int64 downcasted) {
downcasted = int64(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(64, value);
}
}
/**
* @dev Returns the downcasted int56 from int256, reverting on
* overflow (when the input is less than smallest int56 or
* greater than largest int56).
*
* Counterpart to Solidity's `int56` operator.
*
* Requirements:
*
* - input must fit into 56 bits
*/
function toInt56(int256 value) internal pure returns (int56 downcasted) {
downcasted = int56(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(56, value);
}
}
/**
* @dev Returns the downcasted int48 from int256, reverting on
* overflow (when the input is less than smallest int48 or
* greater than largest int48).
*
* Counterpart to Solidity's `int48` operator.
*
* Requirements:
*
* - input must fit into 48 bits
*/
function toInt48(int256 value) internal pure returns (int48 downcasted) {
downcasted = int48(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(48, value);
}
}
/**
* @dev Returns the downcasted int40 from int256, reverting on
* overflow (when the input is less than smallest int40 or
* greater than largest int40).
*
* Counterpart to Solidity's `int40` operator.
*
* Requirements:
*
* - input must fit into 40 bits
*/
function toInt40(int256 value) internal pure returns (int40 downcasted) {
downcasted = int40(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(40, value);
}
}
/**
* @dev Returns the downcasted int32 from int256, reverting on
* overflow (when the input is less than smallest int32 or
* greater than largest int32).
*
* Counterpart to Solidity's `int32` operator.
*
* Requirements:
*
* - input must fit into 32 bits
*/
function toInt32(int256 value) internal pure returns (int32 downcasted) {
downcasted = int32(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(32, value);
}
}
/**
* @dev Returns the downcasted int24 from int256, reverting on
* overflow (when the input is less than smallest int24 or
* greater than largest int24).
*
* Counterpart to Solidity's `int24` operator.
*
* Requirements:
*
* - input must fit into 24 bits
*/
function toInt24(int256 value) internal pure returns (int24 downcasted) {
downcasted = int24(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(24, value);
}
}
/**
* @dev Returns the downcasted int16 from int256, reverting on
* overflow (when the input is less than smallest int16 or
* greater than largest int16).
*
* Counterpart to Solidity's `int16` operator.
*
* Requirements:
*
* - input must fit into 16 bits
*/
function toInt16(int256 value) internal pure returns (int16 downcasted) {
downcasted = int16(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(16, value);
}
}
/**
* @dev Returns the downcasted int8 from int256, reverting on
* overflow (when the input is less than smallest int8 or
* greater than largest int8).
*
* Counterpart to Solidity's `int8` operator.
*
* Requirements:
*
* - input must fit into 8 bits
*/
function toInt8(int256 value) internal pure returns (int8 downcasted) {
downcasted = int8(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(8, value);
}
}
/**
* @dev Converts an unsigned uint256 into a signed int256.
*
* Requirements:
*
* - input must be less than or equal to maxInt256.
*/
function toInt256(uint256 value) internal pure returns (int256) {
// Note: Unsafe cast below is okay because `type(int256).max` is guaranteed to be positive
if (value > uint256(type(int256).max)) {
revert SafeCastOverflowedUintToInt(value);
}
return int256(value);
}
/**
* @dev Cast a boolean (false or true) to a uint256 (0 or 1) with no jump.
*/
function toUint(bool b) internal pure returns (uint256 u) {
assembly ("memory-safe") {
u := iszero(iszero(b))
}
}
}
// File: @openzeppelin/contracts/utils/math/Math.sol
// OpenZeppelin Contracts (last updated v5.1.0) (utils/math/Math.sol)
pragma solidity ^0.8.20;
/**
* @dev Standard math utilities missing in the Solidity language.
*/
library Math {
enum Rounding {
Floor, // Toward negative infinity
Ceil, // Toward positive infinity
Trunc, // Toward zero
Expand // Away from zero
}
/**
* @dev Returns the addition of two unsigned integers, with an success flag (no overflow).
*/
function tryAdd(uint256 a, uint256 b) internal pure returns (bool success, uint256 result) {
unchecked {
uint256 c = a + b;
if (c < a) return (false, 0);
return (true, c);
}
}
/**
* @dev Returns the subtraction of two unsigned integers, with an success flag (no overflow).
*/
function trySub(uint256 a, uint256 b) internal pure returns (bool success, uint256 result) {
unchecked {
if (b > a) return (false, 0);
return (true, a - b);
}
}
/**
* @dev Returns the multiplication of two unsigned integers, with an success flag (no overflow).
*/
function tryMul(uint256 a, uint256 b) internal pure returns (bool success, uint256 result) {
unchecked {
// Gas optimization: this is cheaper than requiring 'a' not being zero, but the
// benefit is lost if 'b' is also tested.
// See: https://github.com/OpenZeppelin/openzeppelin-contracts/pull/522
if (a == 0) return (true, 0);
uint256 c = a * b;
if (c / a != b) return (false, 0);
return (true, c);
}
}
/**
* @dev Returns the division of two unsigned integers, with a success flag (no division by zero).
*/
function tryDiv(uint256 a, uint256 b) internal pure returns (bool success, uint256 result) {
unchecked {
if (b == 0) return (false, 0);
return (true, a / b);
}
}
/**
* @dev Returns the remainder of dividing two unsigned integers, with a success flag (no division by zero).
*/
function tryMod(uint256 a, uint256 b) internal pure returns (bool success, uint256 result) {
unchecked {
if (b == 0) return (false, 0);
return (true, a % b);
}
}
/**
* @dev Branchless ternary evaluation for `a ? b : c`. Gas costs are constant.
*
* IMPORTANT: This function may reduce bytecode size and consume less gas when used standalone.
* However, the compiler may optimize Solidity ternary operations (i.e. `a ? b : c`) to only compute
* one branch when needed, making this function more expensive.
*/
function ternary(bool condition, uint256 a, uint256 b) internal pure returns (uint256) {
unchecked {
// branchless ternary works because:
// b ^ (a ^ b) == a
// b ^ 0 == b
return b ^ ((a ^ b) * SafeCast.toUint(condition));
}
}
/**
* @dev Returns the largest of two numbers.
*/
function max(uint256 a, uint256 b) internal pure returns (uint256) {
return ternary(a > b, a, b);
}
/**
* @dev Returns the smallest of two numbers.
*/
function min(uint256 a, uint256 b) internal pure returns (uint256) {
return ternary(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 towards infinity instead
* of rounding towards zero.
*/
function ceilDiv(uint256 a, uint256 b) internal pure returns (uint256) {
if (b == 0) {
// Guarantee the same behavior as in a regular Solidity division.
Panic.panic(Panic.DIVISION_BY_ZERO);
}
// The following calculation ensures accurate ceiling division without overflow.
// Since a is non-zero, (a - 1) / b will not overflow.
// The largest possible result occurs when (a - 1) / b is type(uint256).max,
// but the largest value we can obtain is type(uint256).max - 1, which happens
// when a = type(uint256).max and b = 1.
unchecked {
return SafeCast.toUint(a > 0) * ((a - 1) / b + 1);
}
}
/**
* @dev Calculates floor(x * y / denominator) with full precision. Throws if result overflows a uint256 or
* denominator == 0.
*
* 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²⁵⁶ and mod 2²⁵⁶ - 1, then use
// the Chinese Remainder Theorem to reconstruct the 512 bit result. The result is stored in two 256
// variables such that product = prod1 * 2²⁵⁶ + prod0.
uint256 prod0 = x * y; // Least significant 256 bits of the product
uint256 prod1; // Most significant 256 bits of the product
assembly {
let mm := mulmod(x, y, not(0))
prod1 := sub(sub(mm, prod0), lt(mm, prod0))
}
// Handle non-overflow cases, 256 by 256 division.
if (prod1 == 0) {
// Solidity will revert if denominator == 0, unlike the div opcode on its own.
// The surrounding unchecked block does not change this fact.
// See https://docs.soliditylang.org/en/latest/control-structures.html#checked-or-unchecked-arithmetic.
return prod0 / denominator;
}
// Make sure the result is less than 2²⁵⁶. Also prevents denominator == 0.
if (denominator <= prod1) {
Panic.panic(ternary(denominator == 0, Panic.DIVISION_BY_ZERO, Panic.UNDER_OVERFLOW));
}
///////////////////////////////////////////////
// 512 by 256 division.
///////////////////////////////////////////////
// Make division exact by subtracting the remainder from [prod1 prod0].
uint256 remainder;
assembly {
// Compute remainder using mulmod.
remainder := mulmod(x, y, denominator)
// Subtract 256 bit number from 512 bit number.
prod1 := sub(prod1, gt(remainder, prod0))
prod0 := sub(prod0, remainder)
}
// Factor powers of two out of denominator and compute largest power of two divisor of denominator.
// Always >= 1. See https://cs.stackexchange.com/q/138556/92363.
uint256 twos = denominator & (0 - denominator);
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²⁵⁶ / 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²⁵⁶. Now that denominator is an odd number, it has an inverse modulo 2²⁵⁶ such
// that denominator * inv ≡ 1 mod 2²⁵⁶. Compute the inverse by starting with a seed that is correct for
// four bits. That is, denominator * inv ≡ 1 mod 2⁴.
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⁸
inverse *= 2 - denominator * inverse; // inverse mod 2¹⁶
inverse *= 2 - denominator * inverse; // inverse mod 2³²
inverse *= 2 - denominator * inverse; // inverse mod 2⁶⁴
inverse *= 2 - denominator * inverse; // inverse mod 2¹²⁸
inverse *= 2 - denominator * inverse; // inverse mod 2²⁵⁶
// 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²⁵⁶. Since the preconditions guarantee that the outcome is
// less than 2²⁵⁶, 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;
}
}
/**
* @dev 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) {
return mulDiv(x, y, denominator) + SafeCast.toUint(unsignedRoundsUp(rounding) && mulmod(x, y, denominator) > 0);
}
/**
* @dev Calculate the modular multiplicative inverse of a number in Z/nZ.
*
* If n is a prime, then Z/nZ is a field. In that case all elements are inversible, except 0.
* If n is not a prime, then Z/nZ is not a field, and some elements might not be inversible.
*
* If the input value is not inversible, 0 is returned.
*
* NOTE: If you know for sure that n is (big) a prime, it may be cheaper to use Fermat's little theorem and get the
* inverse using `Math.modExp(a, n - 2, n)`. See {invModPrime}.
*/
function invMod(uint256 a, uint256 n) internal pure returns (uint256) {
unchecked {
if (n == 0) return 0;
// The inverse modulo is calculated using the Extended Euclidean Algorithm (iterative version)
// Used to compute integers x and y such that: ax + ny = gcd(a, n).
// When the gcd is 1, then the inverse of a modulo n exists and it's x.
// ax + ny = 1
// ax = 1 + (-y)n
// ax ≡ 1 (mod n) # x is the inverse of a modulo n
// If the remainder is 0 the gcd is n right away.
uint256 remainder = a % n;
uint256 gcd = n;
// Therefore the initial coefficients are:
// ax + ny = gcd(a, n) = n
// 0a + 1n = n
int256 x = 0;
int256 y = 1;
while (remainder != 0) {
uint256 quotient = gcd / remainder;
(gcd, remainder) = (
// The old remainder is the next gcd to try.
remainder,
// Compute the next remainder.
// Can't overflow given that (a % gcd) * (gcd // (a % gcd)) <= gcd
// where gcd is at most n (capped to type(uint256).max)
gcd - remainder * quotient
);
(x, y) = (
// Increment the coefficient of a.
y,
// Decrement the coefficient of n.
// Can overflow, but the result is casted to uint256 so that the
// next value of y is "wrapped around" to a value between 0 and n - 1.
x - y * int256(quotient)
);
}
if (gcd != 1) return 0; // No inverse exists.
return ternary(x < 0, n - uint256(-x), uint256(x)); // Wrap the result if it's negative.
}
}
/**
* @dev Variant of {invMod}. More efficient, but only works if `p` is known to be a prime greater than `2`.
*
* From https://en.wikipedia.org/wiki/Fermat%27s_little_theorem[Fermat's little theorem], we know that if p is
* prime, then `a**(p-1) ≡ 1 mod p`. As a consequence, we have `a * a**(p-2) ≡ 1 mod p`, which means that
* `a**(p-2)` is the modular multiplicative inverse of a in Fp.
*
* NOTE: this function does NOT check that `p` is a prime greater than `2`.
*/
function invModPrime(uint256 a, uint256 p) internal view returns (uint256) {
unchecked {
return Math.modExp(a, p - 2, p);
}
}
/**
* @dev Returns the modular exponentiation of the specified base, exponent and modulus (b ** e % m)
*
* Requirements:
* - modulus can't be zero
* - underlying staticcall to precompile must succeed
*
* IMPORTANT: The result is only valid if the underlying call succeeds. When using this function, make
* sure the chain you're using it on supports the precompiled contract for modular exponentiation
* at address 0x05 as specified in https://eips.ethereum.org/EIPS/eip-198[EIP-198]. Otherwise,
* the underlying function will succeed given the lack of a revert, but the result may be incorrectly
* interpreted as 0.
*/
function modExp(uint256 b, uint256 e, uint256 m) internal view returns (uint256) {
(bool success, uint256 result) = tryModExp(b, e, m);
if (!success) {
Panic.panic(Panic.DIVISION_BY_ZERO);
}
return result;
}
/**
* @dev Returns the modular exponentiation of the specified base, exponent and modulus (b ** e % m).
* It includes a success flag indicating if the operation succeeded. Operation will be marked as failed if trying
* to operate modulo 0 or if the underlying precompile reverted.
*
* IMPORTANT: The result is only valid if the success flag is true. When using this function, make sure the chain
* you're using it on supports the precompiled contract for modular exponentiation at address 0x05 as specified in
* https://eips.ethereum.org/EIPS/eip-198[EIP-198]. Otherwise, the underlying function will succeed given the lack
* of a revert, but the result may be incorrectly interpreted as 0.
*/
function tryModExp(uint256 b, uint256 e, uint256 m) internal view returns (bool success, uint256 result) {
if (m == 0) return (false, 0);
assembly ("memory-safe") {
let ptr := mload(0x40)
// | Offset | Content | Content (Hex) |
// |-----------|------------|--------------------------------------------------------------------|
// | 0x00:0x1f | size of b | 0x0000000000000000000000000000000000000000000000000000000000000020 |
// | 0x20:0x3f | size of e | 0x0000000000000000000000000000000000000000000000000000000000000020 |
// | 0x40:0x5f | size of m | 0x0000000000000000000000000000000000000000000000000000000000000020 |
// | 0x60:0x7f | value of b | 0x<.............................................................b> |
// | 0x80:0x9f | value of e | 0x<.............................................................e> |
// | 0xa0:0xbf | value of m | 0x<.............................................................m> |
mstore(ptr, 0x20)
mstore(add(ptr, 0x20), 0x20)
mstore(add(ptr, 0x40), 0x20)
mstore(add(ptr, 0x60), b)
mstore(add(ptr, 0x80), e)
mstore(add(ptr, 0xa0), m)
// Given the result < m, it's guaranteed to fit in 32 bytes,
// so we can use the memory scratch space located at offset 0.
success := staticcall(gas(), 0x05, ptr, 0xc0, 0x00, 0x20)
result := mload(0x00)
}
}
/**
* @dev Variant of {modExp} that supports inputs of arbitrary length.
*/
function modExp(bytes memory b, bytes memory e, bytes memory m) internal view returns (bytes memory) {
(bool success, bytes memory result) = tryModExp(b, e, m);
if (!success) {
Panic.panic(Panic.DIVISION_BY_ZERO);
}
return result;
}
/**
* @dev Variant of {tryModExp} that supports inputs of arbitrary length.
*/
function tryModExp(
bytes memory b,
bytes memory e,
bytes memory m
) internal view returns (bool success, bytes memory result) {
if (_zeroBytes(m)) return (false, new bytes(0));
uint256 mLen = m.length;
// Encode call args in result and move the free memory pointer
result = abi.encodePacked(b.length, e.length, mLen, b, e, m);
assembly ("memory-safe") {
let dataPtr := add(result, 0x20)
// Write result on top of args to avoid allocating extra memory.
success := staticcall(gas(), 0x05, dataPtr, mload(result), dataPtr, mLen)
// Overwrite the length.
// result.length > returndatasize() is guaranteed because returndatasize() == m.length
mstore(result, mLen)
// Set the memory pointer after the returned data.
mstore(0x40, add(dataPtr, mLen))
}
}
/**
* @dev Returns whether the provided byte array is zero.
*/
function _zeroBytes(bytes memory byteArray) private pure returns (bool) {
for (uint256 i = 0; i < byteArray.length; ++i) {
if (byteArray[i] != 0) {
return false;
}
}
return true;
}
/**
* @dev Returns the square root of a number. If the number is not a perfect square, the value is rounded
* towards zero.
*
* This method is based on Newton's method for computing square roots; the algorithm is restricted to only
* using integer operations.
*/
function sqrt(uint256 a) internal pure returns (uint256) {
unchecked {
// Take care of easy edge cases when a == 0 or a == 1
if (a <= 1) {
return a;
}
// In this function, we use Newton's method to get a root of `f(x) := x² - a`. It involves building a
// sequence x_n that converges toward sqrt(a). For each iteration x_n, we also define the error between
// the current value as `ε_n = | x_n - sqrt(a) |`.
//
// For our first estimation, we consider `e` the smallest power of 2 which is bigger than the square root
// of the target. (i.e. `2**(e-1) ≤ sqrt(a) < 2**e`). We know that `e ≤ 128` because `(2¹²⁸)² = 2²⁵⁶` is
// bigger than any uint256.
//
// By noticing that
// `2**(e-1) ≤ sqrt(a) < 2**e → (2**(e-1))² ≤ a < (2**e)² → 2**(2*e-2) ≤ a < 2**(2*e)`
// we can deduce that `e - 1` is `log2(a) / 2`. We can thus compute `x_n = 2**(e-1)` using a method similar
// to the msb function.
uint256 aa = a;
uint256 xn = 1;
if (aa >= (1 << 128)) {
aa >>= 128;
xn <<= 64;
}
if (aa >= (1 << 64)) {
aa >>= 64;
xn <<= 32;
}
if (aa >= (1 << 32)) {
aa >>= 32;
xn <<= 16;
}
if (aa >= (1 << 16)) {
aa >>= 16;
xn <<= 8;
}
if (aa >= (1 << 8)) {
aa >>= 8;
xn <<= 4;
}
if (aa >= (1 << 4)) {
aa >>= 4;
xn <<= 2;
}
if (aa >= (1 << 2)) {
xn <<= 1;
}
// We now have x_n such that `x_n = 2**(e-1) ≤ sqrt(a) < 2**e = 2 * x_n`. This implies ε_n ≤ 2**(e-1).
//
// We can refine our estimation by noticing that the middle of that interval minimizes the error.
// If we move x_n to equal 2**(e-1) + 2**(e-2), then we reduce the error to ε_n ≤ 2**(e-2).
// This is going to be our x_0 (and ε_0)
xn = (3 * xn) >> 1; // ε_0 := | x_0 - sqrt(a) | ≤ 2**(e-2)
// From here, Newton's method give us:
// x_{n+1} = (x_n + a / x_n) / 2
//
// One should note that:
// x_{n+1}² - a = ((x_n + a / x_n) / 2)² - a
// = ((x_n² + a) / (2 * x_n))² - a
// = (x_n⁴ + 2 * a * x_n² + a²) / (4 * x_n²) - a
// = (x_n⁴ + 2 * a * x_n² + a² - 4 * a * x_n²) / (4 * x_n²)
// = (x_n⁴ - 2 * a * x_n² + a²) / (4 * x_n²)
// = (x_n² - a)² / (2 * x_n)²
// = ((x_n² - a) / (2 * x_n))²
// ≥ 0
// Which proves that for all n ≥ 1, sqrt(a) ≤ x_n
//
// This gives us the proof of quadratic convergence of the sequence:
// ε_{n+1} = | x_{n+1} - sqrt(a) |
// = | (x_n + a / x_n) / 2 - sqrt(a) |
// = | (x_n² + a - 2*x_n*sqrt(a)) / (2 * x_n) |
// = | (x_n - sqrt(a))² / (2 * x_n) |
// = | ε_n² / (2 * x_n) |
// = ε_n² / | (2 * x_n) |
//
// For the first iteration, we have a special case where x_0 is known:
// ε_1 = ε_0² / | (2 * x_0) |
// ≤ (2**(e-2))² / (2 * (2**(e-1) + 2**(e-2)))
// ≤ 2**(2*e-4) / (3 * 2**(e-1))
// ≤ 2**(e-3) / 3
// ≤ 2**(e-3-log2(3))
// ≤ 2**(e-4.5)
//
// For the following iterations, we use the fact that, 2**(e-1) ≤ sqrt(a) ≤ x_n:
// ε_{n+1} = ε_n² / | (2 * x_n) |
// ≤ (2**(e-k))² / (2 * 2**(e-1))
// ≤ 2**(2*e-2*k) / 2**e
// ≤ 2**(e-2*k)
xn = (xn + a / xn) >> 1; // ε_1 := | x_1 - sqrt(a) | ≤ 2**(e-4.5) -- special case, see above
xn = (xn + a / xn) >> 1; // ε_2 := | x_2 - sqrt(a) | ≤ 2**(e-9) -- general case with k = 4.5
xn = (xn + a / xn) >> 1; // ε_3 := | x_3 - sqrt(a) | ≤ 2**(e-18) -- general case with k = 9
xn = (xn + a / xn) >> 1; // ε_4 := | x_4 - sqrt(a) | ≤ 2**(e-36) -- general case with k = 18
xn = (xn + a / xn) >> 1; // ε_5 := | x_5 - sqrt(a) | ≤ 2**(e-72) -- general case with k = 36
xn = (xn + a / xn) >> 1; // ε_6 := | x_6 - sqrt(a) | ≤ 2**(e-144) -- general case with k = 72
// Because e ≤ 128 (as discussed during the first estimation phase), we know have reached a precision
// ε_6 ≤ 2**(e-144) < 1. Given we're operating on integers, then we can ensure that xn is now either
// sqrt(a) or sqrt(a) + 1.
return xn - SafeCast.toUint(xn > a / xn);
}
}
/**
* @dev 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 + SafeCast.toUint(unsignedRoundsUp(rounding) && result * result < a);
}
}
/**
* @dev Return the log in base 2 of a positive value rounded towards zero.
* Returns 0 if given 0.
*/
function log2(uint256 value) internal pure returns (uint256) {
uint256 result = 0;
uint256 exp;
unchecked {
exp = 128 * SafeCast.toUint(value > (1 << 128) - 1);
value >>= exp;
result += exp;
exp = 64 * SafeCast.toUint(value > (1 << 64) - 1);
value >>= exp;
result += exp;
exp = 32 * SafeCast.toUint(value > (1 << 32) - 1);
value >>= exp;
result += exp;
exp = 16 * SafeCast.toUint(value > (1 << 16) - 1);
value >>= exp;
result += exp;
exp = 8 * SafeCast.toUint(value > (1 << 8) - 1);
value >>= exp;
result += exp;
exp = 4 * SafeCast.toUint(value > (1 << 4) - 1);
value >>= exp;
result += exp;
exp = 2 * SafeCast.toUint(value > (1 << 2) - 1);
value >>= exp;
result += exp;
result += SafeCast.toUint(value > 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 + SafeCast.toUint(unsignedRoundsUp(rounding) && 1 << result < value);
}
}
/**
* @dev Return the log in base 10 of a positive value rounded towards zero.
* 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 + SafeCast.toUint(unsignedRoundsUp(rounding) && 10 ** result < value);
}
}
/**
* @dev Return the log in base 256 of a positive value rounded towards zero.
* 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;
uint256 isGt;
unchecked {
isGt = SafeCast.toUint(value > (1 << 128) - 1);
value >>= isGt * 128;
result += isGt * 16;
isGt = SafeCast.toUint(value > (1 << 64) - 1);
value >>= isGt * 64;
result += isGt * 8;
isGt = SafeCast.toUint(value > (1 << 32) - 1);
value >>= isGt * 32;
result += isGt * 4;
isGt = SafeCast.toUint(value > (1 << 16) - 1);
value >>= isGt * 16;
result += isGt * 2;
result += SafeCast.toUint(value > (1 << 8) - 1);
}
return result;
}
/**
* @dev Return the log in base 256, 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 + SafeCast.toUint(unsignedRoundsUp(rounding) && 1 << (result << 3) < value);
}
}
/**
* @dev Returns whether a provided rounding mode is considered rounding up for unsigned integers.
*/
function unsignedRoundsUp(Rounding rounding) internal pure returns (bool) {
return uint8(rounding) % 2 == 1;
}
}
// File: @openzeppelin/contracts/utils/math/SignedMath.sol
// OpenZeppelin Contracts (last updated v5.1.0) (utils/math/SignedMath.sol)
pragma solidity ^0.8.20;
/**
* @dev Standard signed math utilities missing in the Solidity language.
*/
library SignedMath {
/**
* @dev Branchless ternary evaluation for `a ? b : c`. Gas costs are constant.
*
* IMPORTANT: This function may reduce bytecode size and consume less gas when used standalone.
* However, the compiler may optimize Solidity ternary operations (i.e. `a ? b : c`) to only compute
* one branch when needed, making this function more expensive.
*/
function ternary(bool condition, int256 a, int256 b) internal pure returns (int256) {
unchecked {
// branchless ternary works because:
// b ^ (a ^ b) == a
// b ^ 0 == b
return b ^ ((a ^ b) * int256(SafeCast.toUint(condition)));
}
}
/**
* @dev Returns the largest of two signed numbers.
*/
function max(int256 a, int256 b) internal pure returns (int256) {
return ternary(a > b, a, b);
}
/**
* @dev Returns the smallest of two signed numbers.
*/
function min(int256 a, int256 b) internal pure returns (int256) {
return ternary(a < b, a, b);
}
/**
* @dev Returns the average of two signed numbers without overflow.
* The result is rounded towards zero.
*/
function average(int256 a, int256 b) internal pure returns (int256) {
// Formula from the book "Hacker's Delight"
int256 x = (a & b) + ((a ^ b) >> 1);
return x + (int256(uint256(x) >> 255) & (a ^ b));
}
/**
* @dev Returns the absolute unsigned value of a signed value.
*/
function abs(int256 n) internal pure returns (uint256) {
unchecked {
// Formula from the "Bit Twiddling Hacks" by Sean Eron Anderson.
// Since `n` is a signed integer, the generated bytecode will use the SAR opcode to perform the right shift,
// taking advantage of the most significant (or "sign" bit) in two's complement representation.
// This opcode adds new most significant bits set to the value of the previous most significant bit. As a result,
// the mask will either be `bytes32(0)` (if n is positive) or `~bytes32(0)` (if n is negative).
int256 mask = n >> 255;
// A `bytes32(0)` mask leaves the input unchanged, while a `~bytes32(0)` mask complements it.
return uint256((n + mask) ^ mask);
}
}
}
// File: @openzeppelin/contracts/utils/Strings.sol
// OpenZeppelin Contracts (last updated v5.2.0) (utils/Strings.sol)
pragma solidity ^0.8.20;
/**
* @dev String operations.
*/
library Strings {
using SafeCast for *;
bytes16 private constant HEX_DIGITS = "0123456789abcdef";
uint8 private constant ADDRESS_LENGTH = 20;
/**
* @dev The `value` string doesn't fit in the specified `length`.
*/
error StringsInsufficientHexLength(uint256 value, uint256 length);
/**
* @dev The string being parsed contains characters that are not in scope of the given base.
*/
error StringsInvalidChar();
/**
* @dev The string being parsed is not a properly formatted address.
*/
error StringsInvalidAddressFormat();
/**
* @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;
assembly ("memory-safe") {
ptr := add(buffer, add(32, length))
}
while (true) {
ptr--;
assembly ("memory-safe") {
mstore8(ptr, byte(mod(value, 10), HEX_DIGITS))
}
value /= 10;
if (value == 0) break;
}
return buffer;
}
}
/**
* @dev Converts a `int256` to its ASCII `string` decimal representation.
*/
function toStringSigned(int256 value) internal pure returns (string memory) {
return string.concat(value < 0 ? "-" : "", toString(SignedMath.abs(value)));
}
/**
* @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) {
uint256 localValue = value;
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] = HEX_DIGITS[localValue & 0xf];
localValue >>= 4;
}
if (localValue != 0) {
revert StringsInsufficientHexLength(value, length);
}
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);
}
/**
* @dev Converts an `address` with fixed length of 20 bytes to its checksummed ASCII `string` hexadecimal
* representation, according to EIP-55.
*/
function toChecksumHexString(address addr) internal pure returns (string memory) {
bytes memory buffer = bytes(toHexString(addr));
// hash the hex part of buffer (skip length + 2 bytes, length 40)
uint256 hashValue;
assembly ("memory-safe") {
hashValue := shr(96, keccak256(add(buffer, 0x22), 40))
}
for (uint256 i = 41; i > 1; --i) {
// possible values for buffer[i] are 48 (0) to 57 (9) and 97 (a) to 102 (f)
if (hashValue & 0xf > 7 && uint8(buffer[i]) > 96) {
// case shift by xoring with 0x20
buffer[i] ^= 0x20;
}
hashValue >>= 4;
}
return string(buffer);
}
/**
* @dev Returns true if the two strings are equal.
*/
function equal(string memory a, string memory b) internal pure returns (bool) {
return bytes(a).length == bytes(b).length && keccak256(bytes(a)) == keccak256(bytes(b));
}
/**
* @dev Parse a decimal string and returns the value as a `uint256`.
*
* Requirements:
* - The string must be formatted as `[0-9]*`
* - The result must fit into an `uint256` type
*/
function parseUint(string memory input) internal pure returns (uint256) {
return parseUint(input, 0, bytes(input).length);
}
/**
* @dev Variant of {parseUint} that parses a substring of `input` located between position `begin` (included) and
* `end` (excluded).
*
* Requirements:
* - The substring must be formatted as `[0-9]*`
* - The result must fit into an `uint256` type
*/
function parseUint(string memory input, uint256 begin, uint256 end) internal pure returns (uint256) {
(bool success, uint256 value) = tryParseUint(input, begin, end);
if (!success) revert StringsInvalidChar();
return value;
}
/**
* @dev Variant of {parseUint-string} that returns false if the parsing fails because of an invalid character.
*
* NOTE: This function will revert if the result does not fit in a `uint256`.
*/
function tryParseUint(string memory input) internal pure returns (bool success, uint256 value) {
return _tryParseUintUncheckedBounds(input, 0, bytes(input).length);
}
/**
* @dev Variant of {parseUint-string-uint256-uint256} that returns false if the parsing fails because of an invalid
* character.
*
* NOTE: This function will revert if the result does not fit in a `uint256`.
*/
function tryParseUint(
string memory input,
uint256 begin,
uint256 end
) internal pure returns (bool success, uint256 value) {
if (end > bytes(input).length || begin > end) return (false, 0);
return _tryParseUintUncheckedBounds(input, begin, end);
}
/**
* @dev Implementation of {tryParseUint} that does not check bounds. Caller should make sure that
* `begin <= end <= input.length`. Other inputs would result in undefined behavior.
*/
function _tryParseUintUncheckedBounds(
string memory input,
uint256 begin,
uint256 end
) private pure returns (bool success, uint256 value) {
bytes memory buffer = bytes(input);
uint256 result = 0;
for (uint256 i = begin; i < end; ++i) {
uint8 chr = _tryParseChr(bytes1(_unsafeReadBytesOffset(buffer, i)));
if (chr > 9) return (false, 0);
result *= 10;
result += chr;
}
return (true, result);
}
/**
* @dev Parse a decimal string and returns the value as a `int256`.
*
* Requirements:
* - The string must be formatted as `[-+]?[0-9]*`
* - The result must fit in an `int256` type.
*/
function parseInt(string memory input) internal pure returns (int256) {
return parseInt(input, 0, bytes(input).length);
}
/**
* @dev Variant of {parseInt-string} that parses a substring of `input` located between position `begin` (included) and
* `end` (excluded).
*
* Requirements:
* - The substring must be formatted as `[-+]?[0-9]*`
* - The result must fit in an `int256` type.
*/
function parseInt(string memory input, uint256 begin, uint256 end) internal pure returns (int256) {
(bool success, int256 value) = tryParseInt(input, begin, end);
if (!success) revert StringsInvalidChar();
return value;
}
/**
* @dev Variant of {parseInt-string} that returns false if the parsing fails because of an invalid character or if
* the result does not fit in a `int256`.
*
* NOTE: This function will revert if the absolute value of the result does not fit in a `uint256`.
*/
function tryParseInt(string memory input) internal pure returns (bool success, int256 value) {
return _tryParseIntUncheckedBounds(input, 0, bytes(input).length);
}
uint256 private constant ABS_MIN_INT256 = 2 ** 255;
/**
* @dev Variant of {parseInt-string-uint256-uint256} that returns false if the parsing fails because of an invalid
* character or if the result does not fit in a `int256`.
*
* NOTE: This function will revert if the absolute value of the result does not fit in a `uint256`.
*/
function tryParseInt(
string memory input,
uint256 begin,
uint256 end
) internal pure returns (bool success, int256 value) {
if (end > bytes(input).length || begin > end) return (false, 0);
return _tryParseIntUncheckedBounds(input, begin, end);
}
/**
* @dev Implementation of {tryParseInt} that does not check bounds. Caller should make sure that
* `begin <= end <= input.length`. Other inputs would result in undefined behavior.
*/
function _tryParseIntUncheckedBounds(
string memory input,
uint256 begin,
uint256 end
) private pure returns (bool success, int256 value) {
bytes memory buffer = bytes(input);
// Check presence of a negative sign.
bytes1 sign = begin == end ? bytes1(0) : bytes1(_unsafeReadBytesOffset(buffer, begin)); // don't do out-of-bound (possibly unsafe) read if sub-string is empty
bool positiveSign = sign == bytes1("+");
bool negativeSign = sign == bytes1("-");
uint256 offset = (positiveSign || negativeSign).toUint();
(bool absSuccess, uint256 absValue) = tryParseUint(input, begin + offset, end);
if (absSuccess && absValue < ABS_MIN_INT256) {
return (true, negativeSign ? -int256(absValue) : int256(absValue));
} else if (absSuccess && negativeSign && absValue == ABS_MIN_INT256) {
return (true, type(int256).min);
} else return (false, 0);
}
/**
* @dev Parse a hexadecimal string (with or without "0x" prefix), and returns the value as a `uint256`.
*
* Requirements:
* - The string must be formatted as `(0x)?[0-9a-fA-F]*`
* - The result must fit in an `uint256` type.
*/
function parseHexUint(string memory input) internal pure returns (uint256) {
return parseHexUint(input, 0, bytes(input).length);
}
/**
* @dev Variant of {parseHexUint} that parses a substring of `input` located between position `begin` (included) and
* `end` (excluded).
*
* Requirements:
* - The substring must be formatted as `(0x)?[0-9a-fA-F]*`
* - The result must fit in an `uint256` type.
*/
function parseHexUint(string memory input, uint256 begin, uint256 end) internal pure returns (uint256) {
(bool success, uint256 value) = tryParseHexUint(input, begin, end);
if (!success) revert StringsInvalidChar();
return value;
}
/**
* @dev Variant of {parseHexUint-string} that returns false if the parsing fails because of an invalid character.
*
* NOTE: This function will revert if the result does not fit in a `uint256`.
*/
function tryParseHexUint(string memory input) internal pure returns (bool success, uint256 value) {
return _tryParseHexUintUncheckedBounds(input, 0, bytes(input).length);
}
/**
* @dev Variant of {parseHexUint-string-uint256-uint256} that returns false if the parsing fails because of an
* invalid character.
*
* NOTE: This function will revert if the result does not fit in a `uint256`.
*/
function tryParseHexUint(
string memory input,
uint256 begin,
uint256 end
) internal pure returns (bool success, uint256 value) {
if (end > bytes(input).length || begin > end) return (false, 0);
return _tryParseHexUintUncheckedBounds(input, begin, end);
}
/**
* @dev Implementation of {tryParseHexUint} that does not check bounds. Caller should make sure that
* `begin <= end <= input.length`. Other inputs would result in undefined behavior.
*/
function _tryParseHexUintUncheckedBounds(
string memory input,
uint256 begin,
uint256 end
) private pure returns (bool success, uint256 value) {
bytes memory buffer = bytes(input);
// skip 0x prefix if present
bool hasPrefix = (end > begin + 1) && bytes2(_unsafeReadBytesOffset(buffer, begin)) == bytes2("0x"); // don't do out-of-bound (possibly unsafe) read if sub-string is empty
uint256 offset = hasPrefix.toUint() * 2;
uint256 result = 0;
for (uint256 i = begin + offset; i < end; ++i) {
uint8 chr = _tryParseChr(bytes1(_unsafeReadBytesOffset(buffer, i)));
if (chr > 15) return (false, 0);
result *= 16;
unchecked {
// Multiplying by 16 is equivalent to a shift of 4 bits (with additional overflow check).
// This guaratees that adding a value < 16 will not cause an overflow, hence the unchecked.
result += chr;
}
}
return (true, result);
}
/**
* @dev Parse a hexadecimal string (with or without "0x" prefix), and returns the value as an `address`.
*
* Requirements:
* - The string must be formatted as `(0x)?[0-9a-fA-F]{40}`
*/
function parseAddress(string memory input) internal pure returns (address) {
return parseAddress(input, 0, bytes(input).length);
}
/**
* @dev Variant of {parseAddress} that parses a substring of `input` located between position `begin` (included) and
* `end` (excluded).
*
* Requirements:
* - The substring must be formatted as `(0x)?[0-9a-fA-F]{40}`
*/
function parseAddress(string memory input, uint256 begin, uint256 end) internal pure returns (address) {
(bool success, address value) = tryParseAddress(input, begin, end);
if (!success) revert StringsInvalidAddressFormat();
return value;
}
/**
* @dev Variant of {parseAddress-string} that returns false if the parsing fails because the input is not a properly
* formatted address. See {parseAddress} requirements.
*/
function tryParseAddress(string memory input) internal pure returns (bool success, address value) {
return tryParseAddress(input, 0, bytes(input).length);
}
/**
* @dev Variant of {parseAddress-string-uint256-uint256} that returns false if the parsing fails because input is not a properly
* formatted address. See {parseAddress} requirements.
*/
function tryParseAddress(
string memory input,
uint256 begin,
uint256 end
) internal pure returns (bool success, address value) {
if (end > bytes(input).length || begin > end) return (false, address(0));
bool hasPrefix = (end > begin + 1) && bytes2(_unsafeReadBytesOffset(bytes(input), begin)) == bytes2("0x"); // don't do out-of-bound (possibly unsafe) read if sub-string is empty
uint256 expectedLength = 40 + hasPrefix.toUint() * 2;
// check that input is the correct length
if (end - begin == expectedLength) {
// length guarantees that this does not overflow, and value is at most type(uint160).max
(bool s, uint256 v) = _tryParseHexUintUncheckedBounds(input, begin, end);
return (s, address(uint160(v)));
} else {
return (false, address(0));
}
}
function _tryParseChr(bytes1 chr) private pure returns (uint8) {
uint8 value = uint8(chr);
// Try to parse `chr`:
// - Case 1: [0-9]
// - Case 2: [a-f]
// - Case 3: [A-F]
// - otherwise not supported
unchecked {
if (value > 47 && value < 58) value -= 48;
else if (value > 96 && value < 103) value -= 87;
else if (value > 64 && value < 71) value -= 55;
else return type(uint8).max;
}
return value;
}
/**
* @dev Reads a bytes32 from a bytes array without bounds checking.
*
* NOTE: making this function internal would mean it could be used with memory unsafe offset, and marking the
* assembly block as such would prevent some optimizations.
*/
function _unsafeReadBytesOffset(bytes memory buffer, uint256 offset) private pure returns (bytes32 value) {
// This is not memory safe in the general case, but all calls to this private function are within bounds.
assembly ("memory-safe") {
value := mload(add(buffer, add(0x20, offset)))
}
}
}
// File: @openzeppelin/contracts/utils/introspection/ERC165.sol
// OpenZeppelin Contracts (last updated v5.1.0) (utils/introspection/ERC165.sol)
pragma solidity ^0.8.20;
/**
* @dev Implementation of the {IERC165} interface.
*
* Contracts that want to implement ERC-165 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);
* }
* ```
*/
abstract contract ERC165 is IERC165 {
/**
* @dev See {IERC165-supportsInterface}.
*/
function supportsInterface(bytes4 interfaceId) public view virtual returns (bool) {
return interfaceId == type(IERC165).interfaceId;
}
}
// File: @openzeppelin/contracts/token/ERC721/ERC721.sol
// OpenZeppelin Contracts (last updated v5.1.0) (token/ERC721/ERC721.sol)
pragma solidity ^0.8.20;
/**
* @dev Implementation of https://eips.ethereum.org/EIPS/eip-721[ERC-721] Non-Fungible Token Standard, including
* the Metadata extension, but not including the Enumerable extension, which is available separately as
* {ERC721Enumerable}.
*/
abstract contract ERC721 is Context, ERC165, IERC721, IERC721Metadata, IERC721Errors {
using Strings for uint256;
// Token name
string private _name;
// Token symbol
string private _symbol;
mapping(uint256 tokenId => address) private _owners;
mapping(address owner => uint256) private _balances;
mapping(uint256 tokenId => address) private _tokenApprovals;
mapping(address owner => mapping(address operator => 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_) {
_name = name_;
_symbol = symbol_;
}
/**
* @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);
}
/**
* @dev See {IERC721-balanceOf}.
*/
function balanceOf(address owner) public view virtual returns (uint256) {
if (owner == address(0)) {
revert ERC721InvalidOwner(address(0));
}
return _balances[owner];
}
/**
* @dev See {IERC721-ownerOf}.
*/
function ownerOf(uint256 tokenId) public view virtual returns (address) {
return _requireOwned(tokenId);
}
/**
* @dev See {IERC721Metadata-name}.
*/
function name() public view virtual returns (string memory) {
return _name;
}
/**
* @dev See {IERC721Metadata-symbol}.
*/
function symbol() public view virtual returns (string memory) {
return _symbol;
}
/**
* @dev See {IERC721Metadata-tokenURI}.
*/
function tokenURI(uint256 tokenId) public view virtual returns (string memory) {
_requireOwned(tokenId);
string memory baseURI = _baseURI();
return bytes(baseURI).length > 0 ? string.concat(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 {
_approve(to, tokenId, _msgSender());
}
/**
* @dev See {IERC721-getApproved}.
*/
function getApproved(uint256 tokenId) public view virtual returns (address) {
_requireOwned(tokenId);
return _getApproved(tokenId);
}
/**
* @dev See {IERC721-setApprovalForAll}.
*/
function setApprovalForAll(address operator, bool approved) public virtual {
_setApprovalForAll(_msgSender(), operator, approved);
}
/**
* @dev See {IERC721-isApprovedForAll}.
*/
function isApprovedForAll(address owner, address operator) public view virtual returns (bool) {
return _operatorApprovals[owner][operator];
}
/**
* @dev See {IERC721-transferFrom}.
*/
function transferFrom(address from, address to, uint256 tokenId) public virtual {
if (to == address(0)) {
revert ERC721InvalidReceiver(address(0));
}
// Setting an "auth" arguments enables the `_isAuthorized` check which verifies that the token exists
// (from != 0). Therefore, it is not needed to verify that the return value is not 0 here.
address previousOwner = _update(to, tokenId, _msgSender());
if (previousOwner != from) {
revert ERC721IncorrectOwner(from, tokenId, previousOwner);
}
}
/**
* @dev See {IERC721-safeTransferFrom}.
*/
function safeTransferFrom(address from, address to, uint256 tokenId) public {
safeTransferFrom(from, to, tokenId, "");
}
/**
* @dev See {IERC721-safeTransferFrom}.
*/
function safeTransferFrom(address from, address to, uint256 tokenId, bytes memory data) public virtual {
transferFrom(from, to, tokenId);
ERC721Utils.checkOnERC721Received(_msgSender(), from, to, tokenId, data);
}
/**
* @dev Returns the owner of the `tokenId`. Does NOT revert if token doesn't exist
*
* IMPORTANT: Any overrides to this function that add ownership of tokens not tracked by the
* core ERC-721 logic MUST be matched with the use of {_increaseBalance} to keep balances
* consistent with ownership. The invariant to preserve is that for any address `a` the value returned by
* `balanceOf(a)` must be equal to the number of tokens such that `_ownerOf(tokenId)` is `a`.
*/
function _ownerOf(uint256 tokenId) internal view virtual returns (address) {
return _owners[tokenId];
}
/**
* @dev Returns the approved address for `tokenId`. Returns 0 if `tokenId` is not minted.
*/
function _getApproved(uint256 tokenId) internal view virtual returns (address) {
return _tokenApprovals[tokenId];
}
/**
* @dev Returns whether `spender` is allowed to manage `owner`'s tokens, or `tokenId` in
* particular (ignoring whether it is owned by `owner`).
*
* WARNING: This function assumes that `owner` is the actual owner of `tokenId` and does not verify this
* assumption.
*/
function _isAuthorized(address owner, address spender, uint256 tokenId) internal view virtual returns (bool) {
return
spender != address(0) &&
(owner == spender || isApprovedForAll(owner, spender) || _getApproved(tokenId) == spender);
}
/**
* @dev Checks if `spender` can operate on `tokenId`, assuming the provided `owner` is the actual owner.
* Reverts if:
* - `spender` does not have approval from `owner` for `tokenId`.
* - `spender` does not have approval to manage all of `owner`'s assets.
*
* WARNING: This function assumes that `owner` is the actual owner of `tokenId` and does not verify this
* assumption.
*/
function _checkAuthorized(address owner, address spender, uint256 tokenId) internal view virtual {
if (!_isAuthorized(owner, spender, tokenId)) {
if (owner == address(0)) {
revert ERC721NonexistentToken(tokenId);
} else {
revert ERC721InsufficientApproval(spender, tokenId);
}
}
}
/**
* @dev Unsafe write access to the balances, used by extensions that "mint" tokens using an {ownerOf} override.
*
* NOTE: the value is limited to type(uint128).max. This protect against _balance overflow. It is unrealistic that
* a uint256 would ever overflow from increments when these increments are bounded to uint128 values.
*
* WARNING: Increasing an account's balance using this function tends to be paired with an override of the
* {_ownerOf} function to resolve the ownership of the corresponding tokens so that balances and ownership
* remain consistent with one another.
*/
function _increaseBalance(address account, uint128 value) internal virtual {
unchecked {
_balances[account] += value;
}
}
/**
* @dev Transfers `tokenId` from its current owner to `to`, or alternatively mints (or burns) if the current owner
* (or `to`) is the zero address. Returns the owner of the `tokenId` before the update.
*
* The `auth` argument is optional. If the value passed is non 0, then this function will check that
* `auth` is either the owner of the token, or approved to operate on the token (by the owner).
*
* Emits a {Transfer} event.
*
* NOTE: If overriding this function in a way that tracks balances, see also {_increaseBalance}.
*/
function _update(address to, uint256 tokenId, address auth) internal virtual returns (address) {
address from = _ownerOf(tokenId);
// Perform (optional) operator check
if (auth != address(0)) {
_checkAuthorized(from, auth, tokenId);
}
// Execute the update
if (from != address(0)) {
// Clear approval. No need to re-authorize or emit the Approval event
_approve(address(0), tokenId, address(0), false);
unchecked {
_balances[from] -= 1;
}
}
if (to != address(0)) {
unchecked {
_balances[to] += 1;
}
}
_owners[tokenId] = to;
emit Transfer(from, to, tokenId);
return from;
}
/**
* @dev Mints `tokenId` and transfers it to `to`.
*
* WARNING: Usage of this method is discouraged, use {_safeMint} whenever possible
*
* Requirements:
*
* - `tokenId` must not exist.
* - `to` cannot be the zero address.
*
* Emits a {Transfer} event.
*/
function _mint(address to, uint256 tokenId) internal {
if (to == address(0)) {
revert ERC721InvalidReceiver(address(0));
}
address previousOwner = _update(to, tokenId, address(0));
if (previousOwner != address(0)) {
revert ERC721InvalidSender(address(0));
}
}
/**
* @dev Mints `tokenId`, transfers it to `to` and checks for `to` acceptance.
*
* Requirements:
*
* - `tokenId` must not exist.
* - If `to` refers to a smart contract, it must implement {IERC721Receiver-onERC721Received}, which is called upon a safe transfer.
*
* Emits a {Transfer} event.
*/
function _safeMint(address to, uint256 tokenId) internal {
_safeMint(to, tokenId, "");
}
/**
* @dev Same as {xref-ERC721-_safeMint-address-uint256-}[`_safeMint`], with an additional `data` parameter which is
* forwarded in {IERC721Receiver-onERC721Received} to contract recipients.
*/
function _safeMint(address to, uint256 tokenId, bytes memory data) internal virtual {
_mint(to, tokenId);
ERC721Utils.checkOnERC721Received(_msgSender(), address(0), to, tokenId, data);
}
/**
* @dev Destroys `tokenId`.
* The approval is cleared when the token is burned.
* This is an internal function that does not check if the sender is authorized to operate on the token.
*
* Requirements:
*
* - `tokenId` must exist.
*
* Emits a {Transfer} event.
*/
function _burn(uint256 tokenId) internal {
address previousOwner = _update(address(0), tokenId, address(0));
if (previousOwner == address(0)) {
revert ERC721NonexistentToken(tokenId);
}
}
/**
* @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 {
if (to == address(0)) {
revert ERC721InvalidReceiver(address(0));
}
address previousOwner = _update(to, tokenId, address(0));
if (previousOwner == address(0)) {
revert ERC721NonexistentToken(tokenId);
} else if (previousOwner != from) {
revert ERC721IncorrectOwner(from, tokenId, previousOwner);
}
}
/**
* @dev Safely transfers `tokenId` token from `from` to `to`, checking that contract recipients
* are aware of the ERC-721 standard 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 like {safeTransferFrom} in the sense that it invokes
* {IERC721Receiver-onERC721Received} on the receiver, and can be used to e.g.
* implement alternative mechanisms to perform token transfer, such as signature-based.
*
* Requirements:
*
* - `tokenId` token must exist and be owned by `from`.
* - `to` cannot be the zero address.
* - `from` cannot be the zero address.
* - 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) internal {
_safeTransfer(from, to, tokenId, "");
}
/**
* @dev Same as {xref-ERC721-_safeTransfer-address-address-uint256-}[`_safeTransfer`], with an additional `data` parameter which is
* forwarded in {IERC721Receiver-onERC721Received} to contract recipients.
*/
function _safeTransfer(address from, address to, uint256 tokenId, bytes memory data) internal virtual {
_transfer(from, to, tokenId);
ERC721Utils.checkOnERC721Received(_msgSender(), from, to, tokenId, data);
}
/**
* @dev Approve `to` to operate on `tokenId`
*
* The `auth` argument is optional. If the value passed is non 0, then this function will check that `auth` is
* either the owner of the token, or approved to operate on all tokens held by this owner.
*
* Emits an {Approval} event.
*
* Overrides to this logic should be done to the variant with an additional `bool emitEvent` argument.
*/
function _approve(address to, uint256 tokenId, address auth) internal {
_approve(to, tokenId, auth, true);
}
/**
* @dev Variant of `_approve` with an optional flag to enable or disable the {Approval} event. The event is not
* emitted in the context of transfers.
*/
function _approve(address to, uint256 tokenId, address auth, bool emitEvent) internal virtual {
// Avoid reading the owner unless necessary
if (emitEvent || auth != address(0)) {
address owner = _requireOwned(tokenId);
// We do not use _isAuthorized because single-token approvals should not be able to call approve
if (auth != address(0) && owner != auth && !isApprovedForAll(owner, auth)) {
revert ERC721InvalidApprover(auth);
}
if (emitEvent) {
emit Approval(owner, to, tokenId);
}
}
_tokenApprovals[tokenId] = to;
}
/**
* @dev Approve `operator` to operate on all of `owner` tokens
*
* Requirements:
* - operator can't be the address zero.
*
* Emits an {ApprovalForAll} event.
*/
function _setApprovalForAll(address owner, address operator, bool approved) internal virtual {
if (operator == address(0)) {
revert ERC721InvalidOperator(operator);
}
_operatorApprovals[owner][operator] = approved;
emit ApprovalForAll(owner, operator, approved);
}
/**
* @dev Reverts if the `tokenId` doesn't have a current owner (it hasn't been minted, or it has been burned).
* Returns the owner.
*
* Overrides to ownership logic should be done to {_ownerOf}.
*/
function _requireOwned(uint256 tokenId) internal view returns (address) {
address owner = _ownerOf(tokenId);
if (owner == address(0)) {
revert ERC721NonexistentToken(tokenId);
}
return owner;
}
}
// File: @openzeppelin/contracts/token/ERC721/extensions/IERC721Enumerable.sol
// OpenZeppelin Contracts (last updated v5.0.0) (token/ERC721/extensions/IERC721Enumerable.sol)
pragma solidity ^0.8.20;
/**
* @title ERC-721 Non-Fungible Token Standard, optional enumeration extension
* @dev See https://eips.ethereum.org/EIPS/eip-721
*/
interface IERC721Enumerable is IERC721 {
/**
* @dev Returns the total amount of tokens stored by the contract.
*/
function totalSupply() external view returns (uint256);
/**
* @dev Returns a token ID owned by `owner` at a given `index` of its token list.
* Use along with {balanceOf} to enumerate all of ``owner``'s tokens.
*/
function tokenOfOwnerByIndex(address owner, uint256 index) external view returns (uint256);
/**
* @dev Returns a token ID at a given `index` of all the tokens stored by the contract.
* Use along with {totalSupply} to enumerate all tokens.
*/
function tokenByIndex(uint256 index) external view returns (uint256);
}
// File: @openzeppelin/contracts/token/ERC721/extensions/ERC721Enumerable.sol
// OpenZeppelin Contracts (last updated v5.1.0) (token/ERC721/extensions/ERC721Enumerable.sol)
pragma solidity ^0.8.20;
/**
* @dev This implements an optional extension of {ERC721} defined in the ERC that adds enumerability
* of all the token ids in the contract as well as all token ids owned by each account.
*
* CAUTION: {ERC721} extensions that implement custom `balanceOf` logic, such as {ERC721Consecutive},
* interfere with enumerability and should not be used together with {ERC721Enumerable}.
*/
abstract contract ERC721Enumerable is ERC721, IERC721Enumerable {
mapping(address owner => mapping(uint256 index => uint256)) private _ownedTokens;
mapping(uint256 tokenId => uint256) private _ownedTokensIndex;
uint256[] private _allTokens;
mapping(uint256 tokenId => uint256) private _allTokensIndex;
/**
* @dev An `owner`'s token query was out of bounds for `index`.
*
* NOTE: The owner being `address(0)` indicates a global out of bounds index.
*/
error ERC721OutOfBoundsIndex(address owner, uint256 index);
/**
* @dev Batch mint is not allowed.
*/
error ERC721EnumerableForbiddenBatchMint();
/**
* @dev See {IERC165-supportsInterface}.
*/
function supportsInterface(bytes4 interfaceId) public view virtual override(IERC165, ERC721) returns (bool) {
return interfaceId == type(IERC721Enumerable).interfaceId || super.supportsInterface(interfaceId);
}
/**
* @dev See {IERC721Enumerable-tokenOfOwnerByIndex}.
*/
function tokenOfOwnerByIndex(address owner, uint256 index) public view virtual returns (uint256) {
if (index >= balanceOf(owner)) {
revert ERC721OutOfBoundsIndex(owner, index);
}
return _ownedTokens[owner][index];
}
/**
* @dev See {IERC721Enumerable-totalSupply}.
*/
function totalSupply() public view virtual returns (uint256) {
return _allTokens.length;
}
/**
* @dev See {IERC721Enumerable-tokenByIndex}.
*/
function tokenByIndex(uint256 index) public view virtual returns (uint256) {
if (index >= totalSupply()) {
revert ERC721OutOfBoundsIndex(address(0), index);
}
return _allTokens[index];
}
/**
* @dev See {ERC721-_update}.
*/
function _update(address to, uint256 tokenId, address auth) internal virtual override returns (address) {
address previousOwner = super._update(to, tokenId, auth);
if (previousOwner == address(0)) {
_addTokenToAllTokensEnumeration(tokenId);
} else if (previousOwner != to) {
_removeTokenFromOwnerEnumeration(previousOwner, tokenId);
}
if (to == address(0)) {
_removeTokenFromAllTokensEnumeration(tokenId);
} else if (previousOwner != to) {
_addTokenToOwnerEnumeration(to, tokenId);
}
return previousOwner;
}
/**
* @dev Private function to add a token to this extension's ownership-tracking data structures.
* @param to address representing the new owner of the given token ID
* @param tokenId uint256 ID of the token to be added to the tokens list of the given address
*/
function _addTokenToOwnerEnumeration(address to, uint256 tokenId) private {
uint256 length = balanceOf(to) - 1;
_ownedTokens[to][length] = tokenId;
_ownedTokensIndex[tokenId] = length;
}
/**
* @dev Private function to add a token to this extension's token tracking data structures.
* @param tokenId uint256 ID of the token to be added to the tokens list
*/
function _addTokenToAllTokensEnumeration(uint256 tokenId) private {
_allTokensIndex[tokenId] = _allTokens.length;
_allTokens.push(tokenId);
}
/**
* @dev Private function to remove a token from this extension's ownership-tracking data structures. Note that
* while the token is not assigned a new owner, the `_ownedTokensIndex` mapping is _not_ updated: this allows for
* gas optimizations e.g. when performing a transfer operation (avoiding double writes).
* This has O(1) time complexity, but alters the order of the _ownedTokens array.
* @param from address representing the previous owner of the given token ID
* @param tokenId uint256 ID of the token to be removed from the tokens list of the given address
*/
function _removeTokenFromOwnerEnumeration(address from, uint256 tokenId) private {
// To prevent a gap in from's tokens array, we store the last token in the index of the token to delete, and
// then delete the last slot (swap and pop).
uint256 lastTokenIndex = balanceOf(from);
uint256 tokenIndex = _ownedTokensIndex[tokenId];
mapping(uint256 index => uint256) storage _ownedTokensByOwner = _ownedTokens[from];
// When the token to delete is the last token, the swap operation is unnecessary
if (tokenIndex != lastTokenIndex) {
uint256 lastTokenId = _ownedTokensByOwner[lastTokenIndex];
_ownedTokensByOwner[tokenIndex] = lastTokenId; // Move the last token to the slot of the to-delete token
_ownedTokensIndex[lastTokenId] = tokenIndex; // Update the moved token's index
}
// This also deletes the contents at the last position of the array
delete _ownedTokensIndex[tokenId];
delete _ownedTokensByOwner[lastTokenIndex];
}
/**
* @dev Private function to remove a token from this extension's token tracking data structures.
* This has O(1) time complexity, but alters the order of the _allTokens array.
* @param tokenId uint256 ID of the token to be removed from the tokens list
*/
function _removeTokenFromAllTokensEnumeration(uint256 tokenId) private {
// To prevent a gap in the tokens array, we store the last token in the index of the token to delete, and
// then delete the last slot (swap and pop).
uint256 lastTokenIndex = _allTokens.length - 1;
uint256 tokenIndex = _allTokensIndex[tokenId];
// When the token to delete is the last token, the swap operation is unnecessary. However, since this occurs so
// rarely (when the last minted token is burnt) that we still do the swap here to avoid the gas cost of adding
// an 'if' statement (like in _removeTokenFromOwnerEnumeration)
uint256 lastTokenId = _allTokens[lastTokenIndex];
_allTokens[tokenIndex] = lastTokenId; // Move the last token to the slot of the to-delete token
_allTokensIndex[lastTokenId] = tokenIndex; // Update the moved token's index
// This also deletes the contents at the last position of the array
delete _allTokensIndex[tokenId];
_allTokens.pop();
}
/**
* See {ERC721-_increaseBalance}. We need that to account tokens that were minted in batch
*/
function _increaseBalance(address account, uint128 amount) internal virtual override {
if (amount > 0) {
revert ERC721EnumerableForbiddenBatchMint();
}
super._increaseBalance(account, amount);
}
}
// File: @openzeppelin/contracts/access/Ownable.sol
// OpenZeppelin Contracts (last updated v5.0.0) (access/Ownable.sol)
pragma solidity ^0.8.20;
/**
* @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.
*
* The initial owner is set to the address provided by the deployer. 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;
/**
* @dev The caller account is not authorized to perform an operation.
*/
error OwnableUnauthorizedAccount(address account);
/**
* @dev The owner is not a valid owner account. (eg. `address(0)`)
*/
error OwnableInvalidOwner(address owner);
event OwnershipTransferred(address indexed previousOwner, address indexed newOwner);
/**
* @dev Initializes the contract setting the address provided by the deployer as the initial owner.
*/
constructor(address initialOwner) {
if (initialOwner == address(0)) {
revert OwnableInvalidOwner(address(0));
}
_transferOwnership(initialOwner);
}
/**
* @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 {
if (owner() != _msgSender()) {
revert OwnableUnauthorizedAccount(_msgSender());
}
}
/**
* @dev Leaves the contract without owner. It will not be possible to call
* `onlyOwner` functions. Can only be called by the current owner.
*
* NOTE: Renouncing ownership will leave the contract without an owner,
* thereby disabling any functionality that is only available to the owner.
*/
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 {
if (newOwner == address(0)) {
revert OwnableInvalidOwner(address(0));
}
_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);
}
}
// File: @openzeppelin/contracts/utils/cryptography/Hashes.sol
// OpenZeppelin Contracts (last updated v5.1.0) (utils/cryptography/Hashes.sol)
pragma solidity ^0.8.20;
/**
* @dev Library of standard hash functions.
*
* _Available since v5.1._
*/
library Hashes {
/**
* @dev Commutative Keccak256 hash of a sorted pair of bytes32. Frequently used when working with merkle proofs.
*
* NOTE: Equivalent to the `standardNodeHash` in our https://github.com/OpenZeppelin/merkle-tree[JavaScript library].
*/
function commutativeKeccak256(bytes32 a, bytes32 b) internal pure returns (bytes32) {
return a < b ? _efficientKeccak256(a, b) : _efficientKeccak256(b, a);
}
/**
* @dev Implementation of keccak256(abi.encode(a, b)) that doesn't allocate or expand memory.
*/
function _efficientKeccak256(bytes32 a, bytes32 b) private pure returns (bytes32 value) {
assembly ("memory-safe") {
mstore(0x00, a)
mstore(0x20, b)
value := keccak256(0x00, 0x40)
}
}
}
// File: @openzeppelin/contracts/utils/cryptography/MerkleProof.sol
// OpenZeppelin Contracts (last updated v5.1.0) (utils/cryptography/MerkleProof.sol)
// This file was procedurally generated from scripts/generate/templates/MerkleProof.js.
pragma solidity ^0.8.20;
/**
* @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.
*
* IMPORTANT: Consider memory side-effects when using custom hashing functions
* that access memory in an unsafe way.
*
* NOTE: This library supports proof verification for merkle trees built using
* custom _commutative_ hashing functions (i.e. `H(a, b) == H(b, a)`). Proving
* leaf inclusion in trees built using non-commutative hashing functions requires
* additional logic that is not supported by this library.
*/
library MerkleProof {
/**
*@dev The multiproof provided is not valid.
*/
error MerkleProofInvalidMultiproof();
/**
* @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.
*
* This version handles proofs in memory with the default hashing function.
*/
function verify(bytes32[] memory proof, bytes32 root, bytes32 leaf) internal pure returns (bool) {
return processProof(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 leaves & pre-images are assumed to be sorted.
*
* This version handles proofs in memory with the default hashing function.
*/
function processProof(bytes32[] memory proof, bytes32 leaf) internal pure returns (bytes32) {
bytes32 computedHash = leaf;
for (uint256 i = 0; i < proof.length; i++) {
computedHash = Hashes.commutativeKeccak256(computedHash, proof[i]);
}
return computedHash;
}
/**
* @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.
*
* This version handles proofs in memory with a custom hashing function.
*/
function verify(
bytes32[] memory proof,
bytes32 root,
bytes32 leaf,
function(bytes32, bytes32) view returns (bytes32) hasher
) internal view returns (bool) {
return processProof(proof, leaf, hasher) == 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 leaves & pre-images are assumed to be sorted.
*
* This version handles proofs in memory with a custom hashing function.
*/
function processProof(
bytes32[] memory proof,
bytes32 leaf,
function(bytes32, bytes32) view returns (bytes32) hasher
) internal view returns (bytes32) {
bytes32 computedHash = leaf;
for (uint256 i = 0; i < proof.length; i++) {
computedHash = hasher(computedHash, proof[i]);
}
return computedHash;
}
/**
* @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.
*
* This version handles proofs in calldata with the default hashing function.
*/
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 leaves & pre-images are assumed to be sorted.
*
* This version handles proofs in calldata with the default hashing function.
*/
function processProofCalldata(bytes32[] calldata proof, bytes32 leaf) internal pure returns (bytes32) {
bytes32 computedHash = leaf;
for (uint256 i = 0; i < proof.length; i++) {
computedHash = Hashes.commutativeKeccak256(computedHash, proof[i]);
}
return computedHash;
}
/**
* @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.
*
* This version handles proofs in calldata with a custom hashing function.
*/
function verifyCalldata(
bytes32[] calldata proof,
bytes32 root,
bytes32 leaf,
function(bytes32, bytes32) view returns (bytes32) hasher
) internal view returns (bool) {
return processProofCalldata(proof, leaf, hasher) == 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 leaves & pre-images are assumed to be sorted.
*
* This version handles proofs in calldata with a custom hashing function.
*/
function processProofCalldata(
bytes32[] calldata proof,
bytes32 leaf,
function(bytes32, bytes32) view returns (bytes32) hasher
) internal view returns (bytes32) {
bytes32 computedHash = leaf;
for (uint256 i = 0; i < proof.length; i++) {
computedHash = hasher(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}.
*
* This version handles multiproofs in memory with the default hashing function.
*
* CAUTION: Not all Merkle trees admit multiproofs. See {processMultiProof} for details.
*
* NOTE: Consider the case where `root == proof[0] && leaves.length == 0` as it will return `true`.
* The `leaves` must be validated independently. See {processMultiProof}.
*/
function multiProofVerify(
bytes32[] memory proof,
bool[] memory proofFlags,
bytes32 root,
bytes32[] memory leaves
) internal pure returns (bool) {
return processMultiProof(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.
*
* This version handles multiproofs in memory with the default hashing function.
*
* 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).
*
* NOTE: The _empty set_ (i.e. the case where `proof.length == 1 && leaves.length == 0`) is considered a no-op,
* and therefore a valid multiproof (i.e. it returns `proof[0]`). Consider disallowing this case if you're not
* validating the leaves elsewhere.
*/
function processMultiProof(
bytes32[] memory proof,
bool[] memory proofFlags,
bytes32[] memory leaves
) internal pure returns (bytes32 merkleRoot) {
// This function rebuilds 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 proofFlagsLen = proofFlags.length;
// Check proof validity.
if (leavesLen + proof.length != proofFlagsLen + 1) {
revert MerkleProofInvalidMultiproof();
}
// 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[](proofFlagsLen);
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 from the "main queue" (merging branches) or an element from the
// `proof` array.
for (uint256 i = 0; i < proofFlagsLen; i++) {
bytes32 a = leafPos < leavesLen ? leaves[leafPos++] : hashes[hashPos++];
bytes32 b = proofFlags[i]
? (leafPos < leavesLen ? leaves[leafPos++] : hashes[hashPos++])
: proof[proofPos++];
hashes[i] = Hashes.commutativeKeccak256(a, b);
}
if (proofFlagsLen > 0) {
if (proofPos != proof.length) {
revert MerkleProofInvalidMultiproof();
}
unchecked {
return hashes[proofFlagsLen - 1];
}
} else if (leavesLen > 0) {
return leaves[0];
} else {
return proof[0];
}
}
/**
* @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}.
*
* This version handles multiproofs in memory with a custom hashing function.
*
* CAUTION: Not all Merkle trees admit multiproofs. See {processMultiProof} for details.
*
* NOTE: Consider the case where `root == proof[0] && leaves.length == 0` as it will return `true`.
* The `leaves` must be validated independently. See {processMultiProof}.
*/
function multiProofVerify(
bytes32[] memory proof,
bool[] memory proofFlags,
bytes32 root,
bytes32[] memory leaves,
function(bytes32, bytes32) view returns (bytes32) hasher
) internal view returns (bool) {
return processMultiProof(proof, proofFlags, leaves, hasher) == 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.
*
* This version handles multiproofs in memory with a custom hashing function.
*
* 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).
*
* NOTE: The _empty set_ (i.e. the case where `proof.length == 1 && leaves.length == 0`) is considered a no-op,
* and therefore a valid multiproof (i.e. it returns `proof[0]`). Consider disallowing this case if you're not
* validating the leaves elsewhere.
*/
function processMultiProof(
bytes32[] memory proof,
bool[] memory proofFlags,
bytes32[] memory leaves,
function(bytes32, bytes32) view returns (bytes32) hasher
) internal view returns (bytes32 merkleRoot) {
// This function rebuilds 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 proofFlagsLen = proofFlags.length;
// Check proof validity.
if (leavesLen + proof.length != proofFlagsLen + 1) {
revert MerkleProofInvalidMultiproof();
}
// 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[](proofFlagsLen);
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 from the "main queue" (merging branches) or an element from the
// `proof` array.
for (uint256 i = 0; i < proofFlagsLen; i++) {
bytes32 a = leafPos < leavesLen ? leaves[leafPos++] : hashes[hashPos++];
bytes32 b = proofFlags[i]
? (leafPos < leavesLen ? leaves[leafPos++] : hashes[hashPos++])
: proof[proofPos++];
hashes[i] = hasher(a, b);
}
if (proofFlagsLen > 0) {
if (proofPos != proof.length) {
revert MerkleProofInvalidMultiproof();
}
unchecked {
return hashes[proofFlagsLen - 1];
}
} else if (leavesLen > 0) {
return leaves[0];
} else {
return proof[0];
}
}
/**
* @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}.
*
* This version handles multiproofs in calldata with the default hashing function.
*
* CAUTION: Not all Merkle trees admit multiproofs. See {processMultiProof} for details.
*
* NOTE: Consider the case where `root == proof[0] && leaves.length == 0` as it will return `true`.
* The `leaves` must be validated independently. See {processMultiProofCalldata}.
*/
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.
*
* This version handles multiproofs in calldata with the default hashing function.
*
* 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).
*
* NOTE: The _empty set_ (i.e. the case where `proof.length == 1 && leaves.length == 0`) is considered a no-op,
* and therefore a valid multiproof (i.e. it returns `proof[0]`). Consider disallowing this case if you're not
* validating the leaves elsewhere.
*/
function processMultiProofCalldata(
bytes32[] calldata proof,
bool[] calldata proofFlags,
bytes32[] memory leaves
) internal pure returns (bytes32 merkleRoot) {
// This function rebuilds 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 proofFlagsLen = proofFlags.length;
// Check proof validity.
if (leavesLen + proof.length != proofFlagsLen + 1) {
revert MerkleProofInvalidMultiproof();
}
// 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[](proofFlagsLen);
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 from the "main queue" (merging branches) or an element from the
// `proof` array.
for (uint256 i = 0; i < proofFlagsLen; i++) {
bytes32 a = leafPos < leavesLen ? leaves[leafPos++] : hashes[hashPos++];
bytes32 b = proofFlags[i]
? (leafPos < leavesLen ? leaves[leafPos++] : hashes[hashPos++])
: proof[proofPos++];
hashes[i] = Hashes.commutativeKeccak256(a, b);
}
if (proofFlagsLen > 0) {
if (proofPos != proof.length) {
revert MerkleProofInvalidMultiproof();
}
unchecked {
return hashes[proofFlagsLen - 1];
}
} else if (leavesLen > 0) {
return leaves[0];
} else {
return proof[0];
}
}
/**
* @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}.
*
* This version handles multiproofs in calldata with a custom hashing function.
*
* CAUTION: Not all Merkle trees admit multiproofs. See {processMultiProof} for details.
*
* NOTE: Consider the case where `root == proof[0] && leaves.length == 0` as it will return `true`.
* The `leaves` must be validated independently. See {processMultiProofCalldata}.
*/
function multiProofVerifyCalldata(
bytes32[] calldata proof,
bool[] calldata proofFlags,
bytes32 root,
bytes32[] memory leaves,
function(bytes32, bytes32) view returns (bytes32) hasher
) internal view returns (bool) {
return processMultiProofCalldata(proof, proofFlags, leaves, hasher) == 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.
*
* This version handles multiproofs in calldata with a custom hashing function.
*
* 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).
*
* NOTE: The _empty set_ (i.e. the case where `proof.length == 1 && leaves.length == 0`) is considered a no-op,
* and therefore a valid multiproof (i.e. it returns `proof[0]`). Consider disallowing this case if you're not
* validating the leaves elsewhere.
*/
function processMultiProofCalldata(
bytes32[] calldata proof,
bool[] calldata proofFlags,
bytes32[] memory leaves,
function(bytes32, bytes32) view returns (bytes32) hasher
) internal view returns (bytes32 merkleRoot) {
// This function rebuilds 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 proofFlagsLen = proofFlags.length;
// Check proof validity.
if (leavesLen + proof.length != proofFlagsLen + 1) {
revert MerkleProofInvalidMultiproof();
}
// 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[](proofFlagsLen);
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 from the "main queue" (merging branches) or an element from the
// `proof` array.
for (uint256 i = 0; i < proofFlagsLen; i++) {
bytes32 a = leafPos < leavesLen ? leaves[leafPos++] : hashes[hashPos++];
bytes32 b = proofFlags[i]
? (leafPos < leavesLen ? leaves[leafPos++] : hashes[hashPos++])
: proof[proofPos++];
hashes[i] = hasher(a, b);
}
if (proofFlagsLen > 0) {
if (proofPos != proof.length) {
revert MerkleProofInvalidMultiproof();
}
unchecked {
return hashes[proofFlagsLen - 1];
}
} else if (leavesLen > 0) {
return leaves[0];
} else {
return proof[0];
}
}
}
// File: @openzeppelin/contracts/security/ReentrancyGuard.sol
// OpenZeppelin Contracts (last updated v4.9.0) (security/ReentrancyGuard.sol)
pragma solidity ^0.8.0;
/**
* @dev Contract module that helps prevent reentrant calls to a function.
*
* Inheriting from `ReentrancyGuard` will make the {nonReentrant} modifier
* available, which can be applied to functions to make sure there are no nested
* (reentrant) calls to them.
*
* Note that because there is a single `nonReentrant` guard, functions marked as
* `nonReentrant` may not call one another. This can be worked around by making
* those functions `private`, and then adding `external` `nonReentrant` entry
* points to them.
*
* TIP: If you would like to learn more about reentrancy and alternative ways
* to protect against it, check out our blog post
* https://blog.openzeppelin.com/reentrancy-after-istanbul/[Reentrancy After Istanbul].
*/
abstract contract ReentrancyGuard {
// Booleans are more expensive than uint256 or any type that takes up a full
// word because each write operation emits an extra SLOAD to first read the
// slot's contents, replace the bits taken up by the boolean, and then write
// back. This is the compiler's defense against contract upgrades and
// pointer aliasing, and it cannot be disabled.
// The values being non-zero value makes deployment a bit more expensive,
// but in exchange the refund on every call to nonReentrant will be lower in
// amount. Since refunds are capped to a percentage of the total
// transaction's gas, it is best to keep them low in cases like this one, to
// increase the likelihood of the full refund coming into effect.
uint256 private constant _NOT_ENTERED = 1;
uint256 private constant _ENTERED = 2;
uint256 private _status;
constructor() {
_status = _NOT_ENTERED;
}
/**
* @dev Prevents a contract from calling itself, directly or indirectly.
* Calling a `nonReentrant` function from another `nonReentrant`
* function is not supported. It is possible to prevent this from happening
* by making the `nonReentrant` function external, and making it call a
* `private` function that does the actual work.
*/
modifier nonReentrant() {
_nonReentrantBefore();
_;
_nonReentrantAfter();
}
function _nonReentrantBefore() private {
// On the first call to nonReentrant, _status will be _NOT_ENTERED
require(_status != _ENTERED, "ReentrancyGuard: reentrant call");
// Any calls to nonReentrant after this point will fail
_status = _ENTERED;
}
function _nonReentrantAfter() private {
// By storing the original value once again, a refund is triggered (see
// https://eips.ethereum.org/EIPS/eip-2200)
_status = _NOT_ENTERED;
}
/**
* @dev Returns true if the reentrancy guard is currently set to "entered", which indicates there is a
* `nonReentrant` function in the call stack.
*/
function _reentrancyGuardEntered() internal view returns (bool) {
return _status == _ENTERED;
}
}
// File: @openzeppelin/contracts/interfaces/IERC2981.sol
// OpenZeppelin Contracts (last updated v5.1.0) (interfaces/IERC2981.sol)
pragma solidity ^0.8.20;
/**
* @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.
*/
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.
*
* NOTE: ERC-2981 allows setting the royalty to 100% of the price. In that case all the price would be sent to the
* royalty receiver and 0 tokens to the seller. Contracts dealing with royalty should consider empty transfers.
*/
function royaltyInfo(
uint256 tokenId,
uint256 salePrice
) external view returns (address receiver, uint256 royaltyAmount);
}
// File: @openzeppelin/contracts/token/common/ERC2981.sol
// OpenZeppelin Contracts (last updated v5.1.0) (token/common/ERC2981.sol)
pragma solidity ^0.8.20;
/**
* @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 ERC. Marketplaces are expected to
* voluntarily pay royalties together with sales, but note that this standard is not yet widely supported.
*/
abstract contract ERC2981 is IERC2981, ERC165 {
struct RoyaltyInfo {
address receiver;
uint96 royaltyFraction;
}
RoyaltyInfo private _defaultRoyaltyInfo;
mapping(uint256 tokenId => RoyaltyInfo) private _tokenRoyaltyInfo;
/**
* @dev The default royalty set is invalid (eg. (numerator / denominator) >= 1).
*/
error ERC2981InvalidDefaultRoyalty(uint256 numerator, uint256 denominator);
/**
* @dev The default royalty receiver is invalid.
*/
error ERC2981InvalidDefaultRoyaltyReceiver(address receiver);
/**
* @dev The royalty set for an specific `tokenId` is invalid (eg. (numerator / denominator) >= 1).
*/
error ERC2981InvalidTokenRoyalty(uint256 tokenId, uint256 numerator, uint256 denominator);
/**
* @dev The royalty receiver for `tokenId` is invalid.
*/
error ERC2981InvalidTokenRoyaltyReceiver(uint256 tokenId, address receiver);
/**
* @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 returns (address receiver, uint256 amount) {
RoyaltyInfo storage _royaltyInfo = _tokenRoyaltyInfo[tokenId];
address royaltyReceiver = _royaltyInfo.receiver;
uint96 royaltyFraction = _royaltyInfo.royaltyFraction;
if (royaltyReceiver == address(0)) {
royaltyReceiver = _defaultRoyaltyInfo.receiver;
royaltyFraction = _defaultRoyaltyInfo.royaltyFraction;
}
uint256 royaltyAmount = (salePrice * royaltyFraction) / _feeDenominator();
return (royaltyReceiver, 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 {
uint256 denominator = _feeDenominator();
if (feeNumerator > denominator) {
// Royalty fee will exceed the sale price
revert ERC2981InvalidDefaultRoyalty(feeNumerator, denominator);
}
if (receiver == address(0)) {
revert ERC2981InvalidDefaultRoyaltyReceiver(address(0));
}
_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 {
uint256 denominator = _feeDenominator();
if (feeNumerator > denominator) {
// Royalty fee will exceed the sale price
revert ERC2981InvalidTokenRoyalty(tokenId, feeNumerator, denominator);
}
if (receiver == address(0)) {
revert ERC2981InvalidTokenRoyaltyReceiver(tokenId, address(0));
}
_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];
}
}
// File: contract.sol
pragma solidity ^0.8.19;
contract AbstractFluffs is ERC721, ERC721Enumerable, Ownable, ReentrancyGuard, ERC2981 {
using Strings for uint256;
// Constants
uint256 public constant MAX_SUPPLY = 2999;
uint256 public constant OG_MAX_SUPPLY = 1000;
uint256 public constant WL_MAX_SUPPLY = 600;
uint256 public constant OG_MAX_PER_WALLET = 2;
uint256 public constant WL_MAX_PER_WALLET = 1;
uint256 public maxPublicPerWallet = 5;
// Sale state
enum SaleState { Paused, OGSale, WLSale, PublicSale }
SaleState public saleState = SaleState.Paused;
// Prices
uint256 public ogPrice = 0;
uint256 public wlPrice = 0;
uint256 public publicPrice = 0.004 ether;
// Counters
uint256 public totalOGMinted = 0;
uint256 public totalWLMinted = 0;
// Merkle roots
bytes32 public ogMerkleRoot;
bytes32 public wlMerkleRoot;
// Mapping for minted counts
mapping(address => uint256) public ogMintedCount;
mapping(address => uint256) public wlMintedCount;
mapping(address => uint256) public publicMintedCount;
// Base URI
string private _baseTokenURI;
// Events
event SaleStateChanged(SaleState newState);
event PriceChanged(string saleType, uint256 newPrice);
event MerkleRootChanged(string saleType, bytes32 newRoot);
event BaseURIChanged(string newBaseURI);
event RoyaltyInfoChanged(address receiver, uint96 feeNumerator);
constructor(address initialOwner)
ERC721("Abstract Fluffs", "FLUFF")
Ownable(initialOwner)
{
_setDefaultRoyalty(initialOwner, 500);
}
function mintOG(uint256 quantity, bytes32[] calldata proof) external payable nonReentrant {
require(saleState == SaleState.OGSale, "OG sale not active");
require(totalOGMinted + quantity <= OG_MAX_SUPPLY, "Exceeds OG supply");
require(ogMintedCount[msg.sender] + quantity <= OG_MAX_PER_WALLET, "Exceeds max per wallet for OG");
require(msg.value >= ogPrice * quantity, "Insufficient payment");
bytes32 leaf = keccak256(abi.encodePacked(msg.sender));
require(MerkleProof.verify(proof, ogMerkleRoot, leaf), "Invalid proof for OG");
ogMintedCount[msg.sender] += quantity;
totalOGMinted += quantity;
for (uint256 i = 0; i < quantity; i++) {
_safeMint(msg.sender, totalSupply() + 1);
}
}
function mintWL(uint256 quantity, bytes32[] calldata proof) external payable nonReentrant {
require(saleState == SaleState.WLSale, "WL sale not active");
require(totalWLMinted + quantity <= WL_MAX_SUPPLY, "Exceeds WL supply");
require(wlMintedCount[msg.sender] + quantity <= WL_MAX_PER_WALLET, "Exceeds max per wallet for WL");
require(msg.value >= wlPrice * quantity, "Insufficient payment");
bytes32 leaf = keccak256(abi.encodePacked(msg.sender));
require(MerkleProof.verify(proof, wlMerkleRoot, leaf), "Invalid proof for WL");
wlMintedCount[msg.sender] += quantity;
totalWLMinted += quantity;
for (uint256 i = 0; i < quantity; i++) {
_safeMint(msg.sender, totalSupply() + 1);
}
}
function mintPublic(uint256 quantity) external payable nonReentrant {
require(saleState == SaleState.PublicSale, "Public sale not active");
require(totalSupply() + quantity <= MAX_SUPPLY, "Exceeds max supply");
require(publicMintedCount[msg.sender] + quantity <= maxPublicPerWallet, "Exceeds max per wallet for public");
require(msg.value >= publicPrice * quantity, "Insufficient payment");
publicMintedCount[msg.sender] += quantity;
for (uint256 i = 0; i < quantity; i++) {
_safeMint(msg.sender, totalSupply() + 1);
}
}
function setSaleState(SaleState _saleState) external onlyOwner {
saleState = _saleState;
emit SaleStateChanged(_saleState);
}
function setOGMerkleRoot(bytes32 _merkleRoot) external onlyOwner {
ogMerkleRoot = _merkleRoot;
emit MerkleRootChanged("OG", _merkleRoot);
}
function setWLMerkleRoot(bytes32 _merkleRoot) external onlyOwner {
wlMerkleRoot = _merkleRoot;
emit MerkleRootChanged("WL", _merkleRoot);
}
function setPublicMaxPerWallet(uint256 _maxPerWallet) external onlyOwner {
require(_maxPerWallet > 0, "Max per wallet must be > 0");
maxPublicPerWallet = _maxPerWallet;
}
function setOGPrice(uint256 _price) external onlyOwner {
ogPrice = _price;
emit PriceChanged("OG", _price);
}
function setWLPrice(uint256 _price) external onlyOwner {
wlPrice = _price;
emit PriceChanged("WL", _price);
}
function setPublicPrice(uint256 _price) external onlyOwner {
publicPrice = _price;
emit PriceChanged("Public", _price);
}
function setBaseURI(string calldata baseURI) external onlyOwner {
_baseTokenURI = baseURI;
emit BaseURIChanged(baseURI);
}
function setDefaultRoyalty(address receiver, uint96 feeNumerator) external onlyOwner {
_setDefaultRoyalty(receiver, feeNumerator);
emit RoyaltyInfoChanged(receiver, feeNumerator);
}
function withdraw() external onlyOwner {
uint256 balance = address(this).balance;
(bool success, ) = payable(owner()).call{value: balance}("");
require(success, "Withdrawal failed");
}
function totalMinted() public view returns (uint256) {
return totalSupply();
}
function availableSupply() public view returns (uint256) {
return MAX_SUPPLY - totalSupply();
}
// Required overrides
function _update(address to, uint256 tokenId, address auth)
internal
override(ERC721, ERC721Enumerable)
returns (address)
{
return super._update(to, tokenId, auth);
}
function _increaseBalance(address account, uint128 value)
internal
override(ERC721, ERC721Enumerable)
{
super._increaseBalance(account, value);
}
function supportsInterface(bytes4 interfaceId)
public
view
override(ERC721, ERC721Enumerable, ERC2981)
returns (bool)
{
return super.supportsInterface(interfaceId);
}
function _baseURI() internal view override returns (string memory) {
return _baseTokenURI;
}
}{
"evmVersion": "paris",
"optimizer": {
"enabled": true,
"mode": "3"
},
"outputSelection": {
"*": {
"*": [
"abi",
"metadata"
],
"": [
"ast"
]
}
},
"detectMissingLibraries": false,
"forceEVMLA": false,
"enableEraVMExtensions": false,
"libraries": {}
}Contract Security Audit
- No Contract Security Audit Submitted- Submit Audit Here
[{"inputs":[{"internalType":"address","name":"initialOwner","type":"address"}],"stateMutability":"nonpayable","type":"constructor"},{"inputs":[{"internalType":"uint256","name":"numerator","type":"uint256"},{"internalType":"uint256","name":"denominator","type":"uint256"}],"name":"ERC2981InvalidDefaultRoyalty","type":"error"},{"inputs":[{"internalType":"address","name":"receiver","type":"address"}],"name":"ERC2981InvalidDefaultRoyaltyReceiver","type":"error"},{"inputs":[{"internalType":"uint256","name":"tokenId","type":"uint256"},{"internalType":"uint256","name":"numerator","type":"uint256"},{"internalType":"uint256","name":"denominator","type":"uint256"}],"name":"ERC2981InvalidTokenRoyalty","type":"error"},{"inputs":[{"internalType":"uint256","name":"tokenId","type":"uint256"},{"internalType":"address","name":"receiver","type":"address"}],"name":"ERC2981InvalidTokenRoyaltyReceiver","type":"error"},{"inputs":[],"name":"ERC721EnumerableForbiddenBatchMint","type":"error"},{"inputs":[{"internalType":"address","name":"sender","type":"address"},{"internalType":"uint256","name":"tokenId","type":"uint256"},{"internalType":"address","name":"owner","type":"address"}],"name":"ERC721IncorrectOwner","type":"error"},{"inputs":[{"internalType":"address","name":"operator","type":"address"},{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"ERC721InsufficientApproval","type":"error"},{"inputs":[{"internalType":"address","name":"approver","type":"address"}],"name":"ERC721InvalidApprover","type":"error"},{"inputs":[{"internalType":"address","name":"operator","type":"address"}],"name":"ERC721InvalidOperator","type":"error"},{"inputs":[{"internalType":"address","name":"owner","type":"address"}],"name":"ERC721InvalidOwner","type":"error"},{"inputs":[{"internalType":"address","name":"receiver","type":"address"}],"name":"ERC721InvalidReceiver","type":"error"},{"inputs":[{"internalType":"address","name":"sender","type":"address"}],"name":"ERC721InvalidSender","type":"error"},{"inputs":[{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"ERC721NonexistentToken","type":"error"},{"inputs":[{"internalType":"address","name":"owner","type":"address"},{"internalType":"uint256","name":"index","type":"uint256"}],"name":"ERC721OutOfBoundsIndex","type":"error"},{"inputs":[{"internalType":"address","name":"owner","type":"address"}],"name":"OwnableInvalidOwner","type":"error"},{"inputs":[{"internalType":"address","name":"account","type":"address"}],"name":"OwnableUnauthorizedAccount","type":"error"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"owner","type":"address"},{"indexed":true,"internalType":"address","name":"approved","type":"address"},{"indexed":true,"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"Approval","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"owner","type":"address"},{"indexed":true,"internalType":"address","name":"operator","type":"address"},{"indexed":false,"internalType":"bool","name":"approved","type":"bool"}],"name":"ApprovalForAll","type":"event"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"string","name":"newBaseURI","type":"string"}],"name":"BaseURIChanged","type":"event"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"string","name":"saleType","type":"string"},{"indexed":false,"internalType":"bytes32","name":"newRoot","type":"bytes32"}],"name":"MerkleRootChanged","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":false,"internalType":"string","name":"saleType","type":"string"},{"indexed":false,"internalType":"uint256","name":"newPrice","type":"uint256"}],"name":"PriceChanged","type":"event"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"address","name":"receiver","type":"address"},{"indexed":false,"internalType":"uint96","name":"feeNumerator","type":"uint96"}],"name":"RoyaltyInfoChanged","type":"event"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"enum AbstractFluffs.SaleState","name":"newState","type":"uint8"}],"name":"SaleStateChanged","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"from","type":"address"},{"indexed":true,"internalType":"address","name":"to","type":"address"},{"indexed":true,"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"Transfer","type":"event"},{"inputs":[],"name":"MAX_SUPPLY","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"OG_MAX_PER_WALLET","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"OG_MAX_SUPPLY","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"WL_MAX_PER_WALLET","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"WL_MAX_SUPPLY","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"to","type":"address"},{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"approve","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"availableSupply","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"owner","type":"address"}],"name":"balanceOf","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"getApproved","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"owner","type":"address"},{"internalType":"address","name":"operator","type":"address"}],"name":"isApprovedForAll","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"maxPublicPerWallet","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"quantity","type":"uint256"},{"internalType":"bytes32[]","name":"proof","type":"bytes32[]"}],"name":"mintOG","outputs":[],"stateMutability":"payable","type":"function"},{"inputs":[{"internalType":"uint256","name":"quantity","type":"uint256"}],"name":"mintPublic","outputs":[],"stateMutability":"payable","type":"function"},{"inputs":[{"internalType":"uint256","name":"quantity","type":"uint256"},{"internalType":"bytes32[]","name":"proof","type":"bytes32[]"}],"name":"mintWL","outputs":[],"stateMutability":"payable","type":"function"},{"inputs":[],"name":"name","outputs":[{"internalType":"string","name":"","type":"string"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"ogMerkleRoot","outputs":[{"internalType":"bytes32","name":"","type":"bytes32"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"","type":"address"}],"name":"ogMintedCount","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"ogPrice","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"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":[{"internalType":"address","name":"","type":"address"}],"name":"publicMintedCount","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"publicPrice","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":"receiver","type":"address"},{"internalType":"uint256","name":"amount","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":[],"name":"saleState","outputs":[{"internalType":"enum AbstractFluffs.SaleState","name":"","type":"uint8"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"operator","type":"address"},{"internalType":"bool","name":"approved","type":"bool"}],"name":"setApprovalForAll","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"string","name":"baseURI","type":"string"}],"name":"setBaseURI","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"receiver","type":"address"},{"internalType":"uint96","name":"feeNumerator","type":"uint96"}],"name":"setDefaultRoyalty","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"bytes32","name":"_merkleRoot","type":"bytes32"}],"name":"setOGMerkleRoot","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"_price","type":"uint256"}],"name":"setOGPrice","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"_maxPerWallet","type":"uint256"}],"name":"setPublicMaxPerWallet","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"_price","type":"uint256"}],"name":"setPublicPrice","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"enum AbstractFluffs.SaleState","name":"_saleState","type":"uint8"}],"name":"setSaleState","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"bytes32","name":"_merkleRoot","type":"bytes32"}],"name":"setWLMerkleRoot","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"_price","type":"uint256"}],"name":"setWLPrice","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"bytes4","name":"interfaceId","type":"bytes4"}],"name":"supportsInterface","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"symbol","outputs":[{"internalType":"string","name":"","type":"string"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"index","type":"uint256"}],"name":"tokenByIndex","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"owner","type":"address"},{"internalType":"uint256","name":"index","type":"uint256"}],"name":"tokenOfOwnerByIndex","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"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":"totalMinted","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"totalOGMinted","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"totalSupply","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"totalWLMinted","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":"withdraw","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"wlMerkleRoot","outputs":[{"internalType":"bytes32","name":"","type":"bytes32"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"","type":"address"}],"name":"wlMintedCount","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"wlPrice","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"}]Contract Creation Code
9c4d535b0000000000000000000000000000000000000000000000000000000000000000010004bb8f8f865bad532f933e0c07110e6bb2e3728237aed351358f17b42d7100000000000000000000000000000000000000000000000000000000000000600000000000000000000000000000000000000000000000000000000000000020000000000000000000000000744fda359ff21907d02ef7e9dd496a264657e696
Deployed Bytecode
0x000400000000000200080000000000020000006004100270000003fe0340019700030000003103550002000000010355000003fe0040019d0000000100200190000000350000c13d0000008002000039000000400020043f000000040030008c000000580000413d000000000201043b000000e002200270000004150020009c0000005a0000213d000004390020009c000000670000213d0000044b0020009c000000c70000a13d0000044c0020009c000001520000a13d0000044d0020009c000001d90000213d000004500020009c0000024e0000613d000004510020009c000000580000c13d000000240030008c000000580000413d0000000002000416000000000002004b000000580000c13d0000000a02000039000000000202041a00000401032001970000000002000411000000000023004b000004930000c13d0000000401100370000000000101043b0000001502000039000000000012041b0000004002000039000000800020043f0000000202000039000000c00020043f0000047102000041000000e00020043f000000a00010043f0000000001000414000004870000013d0000000002000416000000000002004b000000580000c13d0000001f02300039000003ff022001970000008002200039000000400020043f0000001f0430018f00000400053001980000008002500039000000460000613d0000008006000039000000000701034f000000007807043c0000000006860436000000000026004b000000420000c13d000000000004004b000000530000613d000000000151034f0000000304400210000000000502043300000000054501cf000000000545022f000000000101043b0000010004400089000000000141022f00000000014101cf000000000151019f0000000000120435000000200030008c000000580000413d000000800100043d000004010010009c0000008f0000a13d000000000100001900000ff500010430000004160020009c000000aa0000213d000004280020009c000000ed0000a13d000004290020009c000001640000a13d0000042a0020009c000001ee0000213d0000042d0020009c000002560000613d0000042e0020009c000002270000613d000000580000013d0000043a0020009c0000010a0000a13d0000043b0020009c000001710000a13d0000043c0020009c000001f70000213d0000043f0020009c0000026c0000613d000004400020009c000000580000c13d000000240030008c000000580000413d0000000002000416000000000002004b000000580000c13d0000000401100370000000000101043b000000030010008c000000580000213d0000000a02000039000000000202041a00000401032001970000000002000411000000000023004b000004930000c13d0000000f02000039000000000302041a000004a903300197000000000313019f000000000032041b000000800010043f0000000001000414000003fe0010009c000003fe01008041000000c0011002100000048c011001c70000800d0200003900000001030000390000048d040000410000048e0000013d000000400400043d000004020040009c000000a40000813d0000004002400039000000400020043f0000000f02000039000000000624043600000403020000410000000000260435000000400200043d000004040020009c000000a40000213d0000004003200039000000400030043f00000005030000390000000003320436000004050500004100000000005304350000000005040433000004060050009c0000022c0000a13d0000048901000041000000000010043f0000004101000039000000040010043f000004140100004100000ff500010430000004170020009c000001320000a13d000004180020009c0000017c0000a13d000004190020009c000002040000213d0000041c0020009c000002ab0000613d0000041d0020009c000000580000c13d000000240030008c000000580000413d0000000401100370000000000101043b000700000001001d0000000b01000039000000000201041a000000020020008c0000054c0000c13d0000046101000041000000800010043f0000002001000039000000840010043f0000001f01000039000000a40010043f0000048401000041000000c40010043f000004630100004100000ff500010430000004550020009c000001890000213d000004590020009c000002c40000613d0000045a0020009c000002d70000613d0000045b0020009c000000580000c13d0000000001000416000000000001004b000000580000c13d000000000200041a000000010320019000000001012002700000007f0110618f0000001f0010008c00000000040000390000000104002039000000000442013f0000000100400190000005df0000c13d000000800010043f000000000003004b000005640000613d000000000000043f000000000001004b000003cc0000613d000004080200004100000000040000190000000003040019000000000402041a000000a005300039000000000045043500000001022000390000002004300039000000000014004b000000e40000413d0000064b0000013d000004320020009c000001940000213d000004360020009c000002f40000613d000004370020009c000003000000613d000004380020009c000000580000c13d0000000001000416000000000001004b000000580000c13d0000000a01000039000000000201041a00000401052001970000000003000411000000000035004b0000053c0000c13d0000040d02200197000000000021041b0000000001000414000003fe0010009c000003fe01008041000000c0011002100000040e011001c70000800d0200003900000003030000390000040f0400004100000000060000190000048e0000013d000004440020009c000001a30000213d000004480020009c0000030b0000613d000004490020009c000003120000613d0000044a0020009c000000580000c13d0000000001000416000000000001004b000000580000c13d0000000a01000039000000000101041a00000401021001970000000001000411000000000012004b000005590000c13d00000495010000410000000000100443000000000100041000000004001004430000000001000414000003fe0010009c000003fe01008041000000c00110021000000496011001c70000800a020000390ff30fee0000040f0000000100200190000005ae0000613d000000000301043b0000000a01000039000000000201041a00000000010004140000040104200197000000040040008c000006090000c13d000000010200003900000001010000310000076e0000013d000004210020009c000001bb0000213d000004250020009c000003220000613d000004260020009c000003760000613d000004270020009c000000580000c13d000000240030008c000000580000413d0000000002000416000000000002004b000000580000c13d0000000a02000039000000000202041a00000401032001970000000002000411000000000023004b000004930000c13d0000000401100370000000000101043b0000001202000039000000000012041b0000004002000039000000800020043f0000000602000039000000c00020043f0000047e02000041000000e00020043f000000a00010043f00000000010004140000021f0000013d000004520020009c000003ae0000613d000004530020009c000002270000613d000004540020009c000000580000c13d000000240030008c000000580000413d0000000002000416000000000002004b000000580000c13d0000000401100370000000000101043b000004010010009c000000580000213d000000000010043f00000017010000390000031d0000013d0000042f0020009c000003b30000613d000004300020009c000003b80000613d000004310020009c000000580000c13d0000000001000416000000000001004b000000580000c13d0000000101000039000000800010043f0000046a0100004100000ff40001042e000004410020009c000003ce0000613d000004420020009c000003d50000613d000004430020009c000000580000c13d0000000001000416000000000001004b000000580000c13d00000016010000390000051c0000013d0000041e0020009c000003da0000613d0000041f0020009c000004120000613d000004200020009c000000580000c13d0000000001000416000000000001004b000000580000c13d000003e801000039000000800010043f0000046a0100004100000ff40001042e000004560020009c000004330000613d000004570020009c0000044c0000613d000004580020009c000000580000c13d0000000001000416000000000001004b000000580000c13d00000015010000390000051c0000013d000004330020009c000004700000613d000004340020009c000004980000613d000004350020009c000000580000c13d0000000001000416000000000001004b000000580000c13d0000000a01000039000000000101041a0000040101100197000000800010043f0000046a0100004100000ff40001042e000004450020009c000004a50000613d000004460020009c000004be0000613d000004470020009c000000580000c13d000000240030008c000000580000413d0000000002000416000000000002004b000000580000c13d0000000401100370000000000101043b0000000802000039000000000202041a000000000021004b0000055e0000813d0ff30c6e0000040f0000000302200210000000000101041a000000000121022f000000ff0020008c0000000001002019000004450000013d000004220020009c000004c50000613d000004230020009c000004ca0000613d000004240020009c000000580000c13d000000240030008c000000580000413d0000000002000416000000000002004b000000580000c13d0000000a02000039000000000202041a00000401032001970000000002000411000000000023004b000004930000c13d0000000401100370000000000101043b0000001002000039000000000012041b0000004002000039000000800020043f0000000202000039000000c00020043f0000047102000041000000e00020043f000000a00010043f00000000010004140000021f0000013d0000044e0020009c000004ed0000613d0000044f0020009c000000580000c13d000000440030008c000000580000413d0000000002000416000000000002004b000000580000c13d0000000402100370000000000202043b000800000002001d000004010020009c000000580000213d0000002401100370000000000201043b0000000801000029000000000001004b000005af0000c13d00000499010000410000072b0000013d0000042b0020009c000005180000613d0000042c0020009c000000580000c13d0000000001000416000000000001004b000000580000c13d00000014010000390000051c0000013d0000043d0020009c000005200000613d0000043e0020009c000000580000c13d000000240030008c000000580000413d0000000002000416000000000002004b000000580000c13d0000000401100370000000000101043b0ff30c990000040f000004450000013d0000041a0020009c000005290000613d0000041b0020009c000000580000c13d000000240030008c000000580000413d0000000002000416000000000002004b000000580000c13d0000000a02000039000000000202041a00000401032001970000000002000411000000000023004b000004930000c13d0000000401100370000000000101043b0000001102000039000000000012041b0000004002000039000000800020043f0000000202000039000000c00020043f0000045e02000041000000e00020043f000000a00010043f0000000001000414000003fe0010009c000003fe01008041000000c0011002100000045f011001c70000800d02000039000000010300003900000460040000410000048e0000013d0000000001000416000000000001004b000000580000c13d00000008010000390000051c0000013d000000000700041a000000010970019000000001087002700000007f0880618f0000001f0080008c00000000070000390000000107002039000000000079004b000005df0000c13d000000200080008c000002460000413d0000001f075000390000000507700270000004070770009a000000200050008c0000040807004041000000000000043f0000001f088000390000000508800270000004070880009a000000000087004b000002460000813d000000000007041b0000000107700039000000000087004b000002420000413d0000001f0050008c000005410000a13d000004aa08500198000000000000043f0000056e0000c13d000000200700003900000408060000410000057a0000013d0000000001000416000000000001004b000000580000c13d00000000010300190ff30a660000040f0ff30a950000040f000000000100001900000ff40001042e000000440030008c000000580000413d0000000002000416000000000002004b000000580000c13d0000000402100370000000000202043b000800000002001d000004010020009c000000580000213d0000002401100370000000000201043b000000000002004b0000000001000039000000010100c039000700000002001d000000000012004b000000580000c13d000000080000006b000006100000c13d00000488010000410000072b0000013d000000240030008c000000580000413d0000000002000416000000000002004b000000580000c13d0000000402100370000000000502043b000004060050009c000000580000213d0000002302500039000000000032004b000000580000813d0000000404500039000000000241034f000000000202043b000004060020009c000000580000213d00000024065000390000000005620019000000000035004b000000580000213d0000000a03000039000000000303041a00000401053001970000000003000411000000000035004b0000053c0000c13d0000001a05000039000000000305041a000000010030019000000001073002700000007f0770618f0000001f0070008c00000000080000390000000108002039000000000383013f0000000100300190000005df0000c13d000000200070008c0000001f03200039000002a30000413d000000000050043f00000005083002700000048e0880009a000000200020008c00000472080040410000001f0770003900000005077002700000048e0770009a000000000078004b000002a30000813d000000000008041b0000000108800039000000000078004b0000029f0000413d0000001f0020008c000007df0000a13d000000000050043f000004aa082001980000087a0000c13d00000472070000410000000009000019000008840000013d000000240030008c000000580000413d0000000002000416000000000002004b000000580000c13d0000000401100370000000000101043b0000000a02000039000000000202041a00000401032001970000000002000411000000000023004b000004930000c13d000000000001004b000005d00000c13d0000046101000041000000800010043f0000002001000039000000840010043f0000001a01000039000000a40010043f0000046901000041000000c40010043f000004630100004100000ff500010430000000240030008c000000580000413d0000000002000416000000000002004b000000580000c13d0000000401100370000000000201043b000004a200200198000000580000c13d0000000101000039000004a30020009c000005f70000a13d000004a40020009c0000056b0000613d000004a50020009c0000056b0000613d000004a60020009c0000056b0000613d000005fb0000013d000000440030008c000000580000413d0000000002000416000000000002004b000000580000c13d0000000402100370000000000202043b000004010020009c000000580000213d0000002401100370000000000101043b0000049d0010009c000000580000213d0000000a03000039000000000303041a00000401043001970000000003000411000000000034004b0000053c0000c13d0000049d03100197000027110030008c000007280000413d000004a101000041000000800010043f000000840030043f0000271001000039000000a40010043f000004940100004100000ff500010430000000240030008c000000580000413d0000000002000416000000000002004b000000580000c13d0000000401100370000000000101043b000004010010009c000000580000213d000000000010043f00000018010000390000031d0000013d000000240030008c000000580000413d0000000002000416000000000002004b000000580000c13d0000000401100370000000000101043b000004010010009c000000580000213d0ff30c7c0000040f000004450000013d0000000001000416000000000001004b000000580000c13d00000bb701000039000000800010043f0000046a0100004100000ff40001042e000000240030008c000000580000413d0000000002000416000000000002004b000000580000c13d0000000401100370000000000101043b000004010010009c000000580000213d000000000010043f0000001901000039000000200010043f000000400200003900000000010000190ff30fd40000040f0000051c0000013d000000840030008c000000580000413d0000000002000416000000000002004b000000580000c13d0000000402100370000000000202043b000004010020009c000000580000213d00000000090200190000002402100370000000000202043b000004010020009c000000580000213d000000000a0200190000004402100370000000000b02043b0000006402100370000000000402043b000004060040009c000000580000213d0000002302400039000000000032004b000000580000813d0000000405400039000000000251034f000000000202043b000004060020009c000000a40000213d0000001f07200039000004aa077001970000003f07700039000004aa07700197000004850070009c000000a40000213d0000008007700039000000400070043f000000800020043f00000000042400190000002404400039000000000034004b000000580000213d0000002003500039000000000331034f000004aa042001980000001f0520018f000000a001400039000003580000613d000000a006000039000000000703034f000000007807043c0000000006860436000000000016004b000003540000c13d000000000005004b000003650000613d000000000343034f0000000304500210000000000501043300000000054501cf000000000545022f000000000303043b0000010004400089000000000343022f00000000034301cf000000000353019f0000000000310435000000a00120003900000000000104350000000001090019000800000009001d00000000020a001900070000000a001d00000000030b001900060000000b001d0ff30a950000040f000000000100041100000080050000390000000802000029000000070300002900000006040000290ff30cb90000040f000000000100001900000ff40001042e000000440030008c000000580000413d0000000402100370000000000202043b000500000002001d0000002402100370000000000202043b000004060020009c000000580000213d0000002304200039000000000034004b000000580000813d000400040020003d0000000401100360000000000101043b000800000001001d000004060010009c000000580000213d000000240120003900000008020000290000000502200210000200000001001d000700000002001d000300000012001d000000030030006b000000580000213d0000000b01000039000000000201041a000000020020008c000000bd0000613d0000000202000039000000000021041b0000000f01000039000000000101041a000000ff0110018f000000030010008c000005530000213d000000010010008c000007eb0000c13d0000001301000039000000000101041a000000050010002a0000049f0000413d0000000501100029000003e90010008c000008bf0000413d0000046101000041000000800010043f0000002001000039000000840010043f0000001101000039000000a40010043f0000048301000041000000c40010043f000004630100004100000ff5000104300000000001000416000000000001004b000000580000c13d00000010010000390000051c0000013d0000000001000416000000000001004b000000580000c13d0000000e010000390000051c0000013d0000000001000416000000000001004b000000580000c13d0000000103000039000000000203041a000000010420019000000001012002700000007f0110618f0000001f0010008c00000000050000390000000105002039000000000552013f0000000100500190000005df0000c13d000000800010043f000000000004004b000005640000613d000000000030043f000000000001004b000006410000c13d000000a0010000390000064c0000013d0000000001000416000000000001004b000000580000c13d0000025801000039000000800010043f0000046a0100004100000ff40001042e0000000001000416000000000001004b000000580000c13d00000013010000390000051c0000013d000000440030008c000000580000413d0000000402100370000000000202043b000500000002001d0000002402100370000000000202043b000004060020009c000000580000213d0000002304200039000000000034004b000000580000813d000400040020003d0000000401100360000000000101043b000800000001001d000004060010009c000000580000213d000000240120003900000008020000290000000502200210000200000001001d000700000002001d000300000012001d000000030030006b000000580000213d0000000b01000039000000000201041a000000020020008c000000bd0000613d0000000202000039000000000021041b0000000f01000039000000000101041a000000ff0110018f000000030010008c000005530000213d000000020010008c000007f50000c13d0000001401000039000000000101041a000000050010002a0000049f0000413d0000000501100029000002590010008c000008d70000413d0000046101000041000000800010043f0000002001000039000000840010043f0000001101000039000000a40010043f0000047001000041000000c40010043f000004630100004100000ff500010430000000440030008c000000580000413d0000000002000416000000000002004b000000580000c13d0000000402100370000000000202043b000004010020009c000000580000213d0000002401100370000000000101043b000800000001001d000004010010009c000000580000213d000000000020043f0000000501000039000000200010043f000000400200003900000000010000190ff30fd40000040f0000000802000029000000000020043f000000200010043f000000000100001900000040020000390ff30fd40000040f000000000101041a000000ff001001900000000001000039000000010100c039000000800010043f0000046a0100004100000ff40001042e000000240030008c000000580000413d0000000002000416000000000002004b000000580000c13d0000000401100370000000000101043b000800000001001d0ff30c990000040f0000000801000029000000000010043f0000000401000039000000200010043f000000400200003900000000010000190ff30fd40000040f000000000101041a0000040101100197000000400200043d0000000000120435000003fe0020009c000003fe0200804100000040012002100000048b011001c700000ff40001042e000000440030008c000000580000413d0000000002000416000000000002004b000000580000c13d0000000402100370000000000202043b000800000002001d000004010020009c000000580000213d0000002401100370000000000101043b000700000001001d000000000010043f0000000201000039000000200010043f0000000001000414000003fe0010009c000003fe01008041000000c00110021000000464011001c700008010020000390ff30fee0000040f0000000100200190000000580000613d000000000101043b000000000101041a00000401051001980000065f0000c13d000000400100043d0000047d020000410000000000210435000000040210003900000007030000290000000000320435000006d00000013d000000240030008c000000580000413d0000000002000416000000000002004b000000580000c13d0000000a02000039000000000202041a00000401032001970000000002000411000000000023004b000004930000c13d0000000401100370000000000101043b0000001602000039000000000012041b0000004002000039000000800020043f0000000202000039000000c00020043f0000045e02000041000000e00020043f000000a00010043f0000000001000414000003fe0010009c000003fe01008041000000c0011002100000045f011001c70000800d0200003900000001030000390000048a040000410ff30fe90000040f0000000100200190000000580000613d000000000100001900000ff40001042e0000045c01000041000000800010043f000000840020043f0000045d0100004100000ff5000104300000000001000416000000000001004b000000580000c13d0000000801000039000000000101041a00000bb80010008c0000056a0000413d0000048901000041000000000010043f0000001101000039000000040010043f000004140100004100000ff5000104300000000001000416000000000001004b000000580000c13d00000000010300190ff30a660000040f000800000001001d000700000002001d000600000003001d000000400100043d000500000001001d0ff30a780000040f000000050100002900000000000104350000000801000029000000070200002900000006030000290ff30a950000040f000000000100041100000008020000290000000703000029000000060400002900000005050000290ff30cb90000040f000000000100001900000ff40001042e0000000001000416000000000001004b000000580000c13d0000000201000039000000800010043f0000046a0100004100000ff40001042e0000000001000416000000000001004b000000580000c13d00000011010000390000051c0000013d000000240030008c000000580000413d0000000002000416000000000002004b000000580000c13d0000000401100370000000000101043b000800000001001d000000000010043f0000000201000039000000200010043f0000000001000414000003fe0010009c000003fe01008041000000c00110021000000464011001c700008010020000390ff30fee0000040f0000000100200190000000580000613d000000400200043d000000000101043b000000000101041a0000040100100198000005d40000c13d0000047d010000410000000000120435000000040120003900000008030000290000000000310435000003fe0020009c000003fe02008041000000400120021000000414011001c700000ff500010430000000440030008c000000580000413d0000000002000416000000000002004b000000580000c13d0000000401100370000000000101043b000000000010043f0000000d01000039000000200010043f0000000001000414000003fe0010009c000003fe01008041000000c00110021000000464011001c700008010020000390ff30fee0000040f0000000100200190000000580000613d000000000101043b000000000201041a0000040101200198000005070000c13d0000000c01000039000000000201041a0000040101200197000800000001001d00000024010000390000000201100367000000000101043b000000a0022002700ff30c600000040f000027100110011a000000400200043d0000002003200039000000000013043500000008010000290000000000120435000003fe0020009c000003fe0200804100000040012002100000049a011001c700000ff40001042e0000000001000416000000000001004b000000580000c13d0000001201000039000000000101041a000000800010043f0000046a0100004100000ff40001042e0000000001000416000000000001004b000000580000c13d0000000f01000039000000000101041a000000ff0110018f000000040010008c000005530000813d0000056b0000013d000000240030008c000000580000413d0000000002000416000000000002004b000000580000c13d0000000401100370000000000601043b000004010060009c000000580000213d0000000a01000039000000000201041a00000401052001970000000003000411000000000035004b0000053c0000c13d000000000006004b000006890000c13d00000413010000410000072b0000013d0000045c01000041000000800010043f000000840030043f0000045d0100004100000ff500010430000000000005004b0000000004000019000005450000613d00000000040604330000000306500210000004ab0660027f000004ab06600167000000000464016f0000000105500210000000000454019f000005860000013d0000000202000039000000000021041b0000000f01000039000000000101041a000000ff0110018f000000030010008c000005e50000a13d0000048901000041000000000010043f0000002101000039000000040010043f000004140100004100000ff5000104300000045c02000041000000800020043f000000840010043f0000045d0100004100000ff5000104300000049302000041000000800020043f000000840000043f000000a40010043f000004940100004100000ff500010430000004a902200197000000a00020043f000000000001004b000000c001000039000000a0010060390000064c0000013d00000bb701100089000000800010043f0000046a0100004100000ff40001042e00000408060000410000002007000039000000010980008a0000000509900270000004090990009a000000000a470019000000000a0a04330000000000a6041b00000020077000390000000106600039000000000096004b000005730000c13d000000000058004b000005840000813d0000000308500210000000f80880018f000004ab0880027f000004ab0880016700000000044700190000000004040433000000000484016f000000000046041b000000010450021000000001044001bf000000000040041b0000000004020433000004060040009c000000a40000213d0000000109000039000000000609041a000000010060019000000001056002700000007f0550618f0000001f0050008c00000000070000390000000107002039000000000676013f0000000100600190000005df0000c13d000000200050008c000005a60000413d000000000090043f0000001f0640003900000005066002700000040a0660009a000000200040008c0000040b060040410000001f0550003900000005055002700000040a0550009a000000000056004b000005a60000813d000000000006041b0000000106600039000000000056004b000005a20000413d0000001f0040008c000005fe0000a13d000000000090043f000004aa06400198000006b00000c13d00000020050000390000040b03000041000006bc0000013d000000000001042f000700000002001d000000000010043f0000000301000039000000200010043f0000000001000414000003fe0010009c000003fe01008041000000c00110021000000464011001c700008010020000390ff30fee0000040f0000000100200190000000580000613d000000000101043b000000000101041a0000000703000029000000000013004b0000072f0000813d0000000801000029000000000010043f0000000601000039000000200010043f000000400200003900000000010000190ff30fd40000040f0000000702000029000000000020043f000000200010043f000000000100001900000040020000390ff30fd40000040f000000000101041a000004450000013d0000000e02000039000000000012041b000000000100001900000ff40001042e0000001a05000039000000000405041a000000010640019000000001014002700000007f0110618f0000001f0010008c00000000030000390000000103002039000000000334013f0000000100300190000006950000613d0000048901000041000000000010043f0000002201000039000000040010043f000004140100004100000ff500010430000006a60000c13d0000000801000039000000000101041a000000070010002a0000049f0000413d000000070110002900000bb80010008c0000073c0000413d0000046101000041000000800010043f0000002001000039000000840010043f0000001201000039000000a40010043f0000046801000041000000c40010043f000004630100004100000ff500010430000004a70020009c0000056b0000613d000004a80020009c0000056b0000613d000000800000043f0000046a0100004100000ff40001042e000000000004004b0000000002000019000006020000613d00000000020304330000000303400210000004ab0330027f000004ab03300167000000000232016f0000000103400210000000000232019f000006c80000013d000003fe0010009c000003fe01008041000000c001100210000000000003004b000007660000c13d0000000002040019000007690000013d0000000001000411000000000010043f0000000501000039000000200010043f0000000001000414000003fe0010009c000003fe01008041000000c00110021000000464011001c700008010020000390ff30fee0000040f0000000100200190000000580000613d000000000101043b0000000802000029000000000020043f000000200010043f0000000001000414000003fe0010009c000003fe01008041000000c00110021000000464011001c700008010020000390ff30fee0000040f0000000100200190000000580000613d000000000101043b000000000201041a000004a9022001970000000703000029000000000232019f000000000021041b000000400100043d0000000000310435000003fe0010009c000003fe0100804100000040011002100000000002000414000003fe0020009c000003fe02008041000000c002200210000000000112019f00000486011001c70000800d0200003900000003030000390000048704000041000000000500041100000008060000290000048e0000013d0000040b0200004100000000040000190000000003040019000000000402041a000000a005300039000000000045043500000001022000390000002004300039000000000014004b000006430000413d000000c001300039000000800210008a00000080010000390ff30a830000040f0000002001000039000000400200043d000800000002001d000000000212043600000080010000390ff30a540000040f00000008020000290000000001210049000003fe0010009c000003fe010080410000006001100210000003fe0020009c000003fe020080410000004002200210000000000121019f00000ff40001042e0000000001000411000000000001004b0000070e0000613d000000000015004b0000070e0000613d000600000005001d000000000050043f0000000501000039000000200010043f0000000001000414000003fe0010009c000003fe01008041000000c00110021000000464011001c700008010020000390ff30fee0000040f0000000100200190000000580000613d000000000101043b0000000002000411000000000020043f000000200010043f0000000001000414000003fe0010009c000003fe01008041000000c00110021000000464011001c700008010020000390ff30fee0000040f0000000100200190000000580000613d000000000101043b000000000101041a000000ff00100190000000060500002900000000030004110000070e0000c13d000000400100043d0000049b02000041000000000021043500000004021000390000046e0000013d0000040d02200197000000000262019f000000000021041b0000000001000414000003fe0010009c000003fe01008041000000c0011002100000040e011001c70000800d0200003900000003030000390000040f040000410000048e0000013d0000000003120436000000000006004b000007ac0000613d000000000050043f000000000001004b0000000004000019000007b10000613d000004720500004100000000040000190000000006340019000000000705041a000000000076043500000001055000390000002004400039000000000014004b0000069e0000413d000007b10000013d0000046101000041000000800010043f0000002001000039000000840010043f0000001601000039000000a40010043f0000046201000041000000c40010043f000004630100004100000ff5000104300000040b030000410000002005000039000000010760008a00000005077002700000040c0770009a00000000082500190000000008080433000000000083041b00000020055000390000000103300039000000000073004b000006b50000c13d000000000046004b000006c60000813d0000000306400210000000f80660018f000004ab0660027f000004ab0660016700000000022500190000000002020433000000000262016f000000000023041b000000010240021000000001022001bf000000000029041b0000040106100198000006d50000c13d000000400100043d0000041302000041000000000021043500000004021000390000000000020435000003fe0010009c000003fe01008041000000400110021000000414011001c700000ff5000104300000000a01000039000000000201041a0000040d03200197000000000363019f000000000031041b00000000010004140000040105200197000003fe0010009c000003fe01008041000000c0011002100000040e011001c70000800d0200003900000003030000390000040f04000041000800000006001d0ff30fe90000040f0000000100200190000000580000613d0000000b010000390000000102000039000000000021041b0000000e010000390000000502000039000000000021041b0000000f03000039000000000103041a000004a901100197000000000013041b0000001001000039000000000001041b0000001101000039000000000001041b00000410010000410000001202000039000000000012041b0000001301000039000000000001041b0000001401000039000000000001041b000000400100043d000004040010009c000000a40000213d0000004002100039000000400020043f0000002002100039000001f40300003900000000003204350000000802000029000000000021043500000411012001c70000000c02000039000000000012041b000000200100003900000100001004430000012000000443000004120100004100000ff40001042e0000000001000414000003fe0010009c000003fe01008041000000c0011002100000040e011001c70000800d0200003900000004030000390000049c04000041000000080600002900000007070000290ff30fe90000040f0000000100200190000000580000613d0000000701000029000000000010043f0000000401000039000000200010043f000000400200003900000000010000190ff30fd40000040f000000000201041a0000040d0220019700000008022001af000000000021041b000000000100001900000ff40001042e000000000002004b000007c60000c13d000004a001000041000000800010043f000000840000043f0000045d0100004100000ff500010430000000400100043d0000002402100039000000000032043500000493020000410000000000210435000000040210003900000008030000290000000000320435000003fe0010009c000003fe01008041000000400110021000000498011001c700000ff5000104300000000001000411000000000010043f0000001901000039000000200010043f0000000001000414000003fe0010009c000003fe01008041000000c00110021000000464011001c700008010020000390ff30fee0000040f0000000100200190000000580000613d000000000101043b000000000101041a000000070010002a0000049f0000413d00000007011000290000000e02000039000000000202041a000000000021004b000007ff0000a13d000000400100043d00000064021000390000046503000041000000000032043500000044021000390000046603000041000000000032043500000024021000390000002103000039000000000032043500000461020000410000000000210435000000040210003900000020030000390000000000320435000003fe0010009c000003fe01008041000000400110021000000467011001c700000ff5000104300000040e011001c7000080090200003900000000050000190ff30fe90000040f00030000000103550000006001100270000103fe0010019d000003fe01100197000000000001004b000007830000c13d0000000100200190000004910000c13d000000400100043d00000044021000390000049703000041000000000032043500000024021000390000001103000039000000000032043500000461020000410000000000210435000000040210003900000020030000390000000000320435000003fe0010009c000003fe0100804100000040011002100000046e011001c700000ff500010430000004060010009c000000a40000213d0000001f04100039000004aa044001970000003f04400039000004aa05400197000000400400043d0000000005540019000000000045004b00000000060000390000000106004039000004060050009c000000a40000213d0000000100600190000000a40000c13d000000400050043f0000000006140436000004aa031001980000001f0410018f000000000136001900000003050003670000079e0000613d000000000705034f000000007807043c0000000006860436000000000016004b0000079a0000c13d000000000004004b000007700000613d000000000335034f0000000304400210000000000501043300000000054501cf000000000545022f000000000303043b0000010004400089000000000343022f00000000034301cf000000000353019f0000000000310435000007700000013d000004a9044001970000000000430435000000000001004b000000200400003900000000040060390000003f01400039000004aa051001970000000001250019000000000051004b00000000050000390000000105004039000004060010009c000000a40000213d0000000100500190000000a40000c13d000000400010043f0000000005020433000000000005004b000007d90000c13d0000047c0010009c000000a40000213d0000002002100039000000400020043f0000000000010435000000400300043d000008760000013d000000c004000039000000400040043f000000800020043f000000a00030043f000000a001100210000000000121019f0000000c04000039000000000014041b000000c00020043f000000e00030043f0000000001000414000003fe0010009c000003fe01008041000000c0011002100000049e011001c70000800d0200003900000001030000390000049f040000410000048e0000013d0000000806000029000004730060009c000008110000413d0000004005000039000004730660012a000008190000013d000000000002004b0000000007000019000007e40000613d000000000661034f000000000706043b0000000306200210000004ab0660027f000004ab06600167000000000667016f0000000107200210000000000676019f000008910000013d0000046101000041000000800010043f0000002001000039000000840010043f0000001201000039000000a40010043f0000047f01000041000000c40010043f000004630100004100000ff5000104300000046101000041000000800010043f0000002001000039000000840010043f0000001201000039000000a40010043f0000046b01000041000000c40010043f000004630100004100000ff5000104300000001201000039000000000201041a00000007012000b9000000000002004b000008070000613d00000000022100d9000000070020006c0000049f0000c13d0000000002000416000000000012004b000008f20000813d000000400100043d00000044021000390000048103000041000000000032043500000024021000390000001403000039000007780000013d000004750060009c000004740660212a00000000050000390000002005002039000004760060009c00000010055081bf0000047706608197000004760660812a000004780060009c00000008055080390000040606608197000004780660812a000027100060008c0000000405508039000003fe06608197000027100660811a000000640060008c00000002055080390000ffff0660818f000000640660811a000000090060008c0000000105502039000004aa075001970000005f06700039000004aa066001970000000006160019000004060060009c000000a40000213d000000400060043f000000010650003900000000066104360000002007700039000004aa087001980000001f0770018f0000083c0000613d000000000886001900000000090000310000000209900367000000000a060019000000009b09043c000000000aba043600000000008a004b000008380000c13d000000000007004b000000000551001900000021055000390000000809000029000000090090008c0000000a7990011a0000000307700210000000010550008a000000000805043300000479088001970000047a0770021f0000047b07700197000000000787019f0000000000750435000008400000213d000000400500043d00000020075000390000000002020433000000000002004b000008580000613d00000000080000190000000009780019000000000a380019000000000a0a04330000000000a904350000002008800039000000000028004b000008510000413d000000000372001900000000000304350000000001010433000000000001004b000008650000613d000000000700001900000000083700190000000009670019000000000909043300000000009804350000002007700039000000000017004b0000085e0000413d00000000033100190000000000030435000000000121001900000000001504350000003f01100039000004aa011001970000000002510019000000000012004b00000000010000390000000101004039000004060020009c000000a40000213d0000000100100190000000a40000c13d0000000003020019000000400020043f00000000010500190000002002000039000800000003001d0000000002230436000006540000013d00000472070000410000000009000019000000000a690019000000000aa1034f000000000a0a043b0000000000a7041b00000001077000390000002009900039000000000089004b0000087c0000413d000000000028004b0000088f0000813d0000000308200210000000f80880018f000004ab0880027f000004ab088001670000000006690019000000000661034f000000000606043b000000000686016f000000000067041b000000010620021000000001066001bf000000000065041b0000002005000039000000800050043f0000002004400039000000000541034f000000a00020043f000004aa062001980000001f0720018f000000c004600039000008a10000613d000000c008000039000000000905034f000000009a09043c0000000008a80436000000000048004b0000089d0000c13d000000000007004b000008ae0000613d000000000565034f0000000306700210000000000704043300000000076701cf000000000767022f000000000505043b0000010006600089000000000565022f00000000056501cf000000000575019f0000000000540435000000c0022000390000000000020435000004aa01300197000000400110003900000060021002100000048f0220009a000004900010009c00000491020080410000000001000414000003fe0010009c000003fe01008041000000c00110021000000000012100190000800d02000039000000010300003900000492040000410000048e0000013d0000000001000411000000000010043f0000001701000039000000200010043f0000000001000414000003fe0010009c000003fe01008041000000c00110021000000464011001c700008010020000390ff30fee0000040f0000000100200190000000580000613d000000000101043b000000000101041a000000050010002a0000049f0000413d0000000501100029000000030010008c000009180000413d000000400100043d00000044021000390000048203000041000008ee0000013d0000000001000411000000000010043f0000001801000039000000200010043f0000000001000414000003fe0010009c000003fe01008041000000c00110021000000464011001c700008010020000390ff30fee0000040f0000000100200190000000580000613d000000000101043b000000000101041a000000050010002a0000049f0000413d0000000501100029000000020010008c000009b20000413d000000400100043d00000044021000390000046f03000041000000000032043500000024021000390000001d03000039000007780000013d0000000001000411000000000010043f0000001901000039000000200010043f0000000001000414000003fe0010009c000003fe01008041000000c00110021000000464011001c700008010020000390ff30fee0000040f0000000100200190000000580000613d000000000101043b000000000201041a000000070020002a0000049f0000413d0000000702200029000000000021041b000000070000006b000009130000613d0000000002000019000800000002001d0000000801000039000000000101041a000000010210003a0000049f0000613d00000000010004110ff30d9c0000040f00000008020000290000000102200039000000070020006c000009080000413d00000001010000390000000b02000039000000000012041b000000000100001900000ff40001042e0000001001000039000000000201041a00000005012000b9000000000002004b000009200000613d00000000022100d9000000050020006c0000049f0000c13d0000000002000416000000000012004b0000080a0000413d000000400100043d00000014020000390000000002210436000000000300041100000060033002100000000000320435000004040010009c000000a40000213d0000004003100039000000400030043f000003fe0020009c000003fe0200804100000040022002100000000001010433000003fe0010009c000003fe010080410000006001100210000000000121019f0000000002000414000003fe0020009c000003fe02008041000000c002200210000000000112019f0000040e011001c700008010020000390ff30fee0000040f0000000100200190000000580000613d0000001502000039000000000202041a000100000002001d000000000101043b00000007020000290000003f022000390000046c02200197000000400300043d0000000002230019000700000003001d000000000032004b00000000030000390000000103004039000004060020009c000000a40000213d0000000100300190000000a40000c13d000000400020043f000000080200002900000007040000290000000002240436000600000002001d0000000302000029000000000020007c000000580000213d000000080000006b000009870000613d0000000402000029000000200220003900000002022003670000000703000029000000020500002900000003060000290000002003300039000000002402043c00000000004304350000002005500039000000000065004b000009600000413d00000007020000290000000002020433000000000002004b000009870000613d0000000003000019000800000003001d000000050230021000000006022000290000000002020433000000000021004b000009750000813d000000000010043f000000200020043f0000000001000414000009780000013d000000000020043f000000200010043f0000000001000414000003fe0010009c000003fe01008041000000c00110021000000464011001c700008010020000390ff30fee0000040f0000000100200190000000580000613d000000000101043b0000000803000029000000010330003900000007020000290000000002020433000000000023004b0000096b0000413d000000010010006c00000a4c0000c13d0000000001000411000000000010043f0000001701000039000000200010043f0000000001000414000003fe0010009c000003fe01008041000000c00110021000000464011001c700008010020000390ff30fee0000040f0000000100200190000000580000613d000000000101043b000000000201041a000000050020002a0000049f0000413d0000000502200029000000000021041b0000001301000039000000000101041a000000050010002a0000049f0000413d00000005011000290000001303000039000000000013041b000000050000006b000009130000613d0000000002000019000800000002001d0000000801000039000000000101041a000000010210003a0000049f0000613d00000000010004110ff30d9c0000040f00000008020000290000000102200039000000050020006c000009a60000413d000009130000013d0000001101000039000000000201041a00000005012000b9000000000002004b000009ba0000613d00000000022100d9000000050020006c0000049f0000c13d0000000002000416000000000012004b0000080a0000413d000000400100043d00000014020000390000000002210436000000000300041100000060033002100000000000320435000004040010009c000000a40000213d0000004003100039000000400030043f000003fe0020009c000003fe0200804100000040022002100000000001010433000003fe0010009c000003fe010080410000006001100210000000000121019f0000000002000414000003fe0020009c000003fe02008041000000c002200210000000000112019f0000040e011001c700008010020000390ff30fee0000040f0000000100200190000000580000613d0000001602000039000000000202041a000100000002001d000000000101043b00000007020000290000003f022000390000046c02200197000000400300043d0000000002230019000700000003001d000000000032004b00000000030000390000000103004039000004060020009c000000a40000213d0000000100300190000000a40000c13d000000400020043f000000080200002900000007040000290000000002240436000600000002001d0000000302000029000000000020007c000000580000213d000000080000006b00000a210000613d0000000402000029000000200220003900000002022003670000000703000029000000020500002900000003060000290000002003300039000000002402043c00000000004304350000002005500039000000000065004b000009fa0000413d00000007020000290000000002020433000000000002004b00000a210000613d0000000003000019000800000003001d000000050230021000000006022000290000000002020433000000000021004b00000a0f0000813d000000000010043f000000200020043f000000000100041400000a120000013d000000000020043f000000200010043f0000000001000414000003fe0010009c000003fe01008041000000c00110021000000464011001c700008010020000390ff30fee0000040f0000000100200190000000580000613d000000000101043b0000000803000029000000010330003900000007020000290000000002020433000000000023004b00000a050000413d000000010010006c00000a500000c13d0000000001000411000000000010043f0000001801000039000000200010043f0000000001000414000003fe0010009c000003fe01008041000000c00110021000000464011001c700008010020000390ff30fee0000040f0000000100200190000000580000613d000000000101043b000000000201041a000000050020002a0000049f0000413d0000000502200029000000000021041b0000001401000039000000000101041a000000050010002a0000049f0000413d00000005011000290000001403000039000000000013041b000000050000006b000009130000613d0000000002000019000800000002001d0000000801000039000000000101041a000000010210003a0000049f0000613d00000000010004110ff30d9c0000040f00000008020000290000000102200039000000050020006c00000a400000413d000009130000013d000000400100043d000000440210003900000480030000410000080d0000013d000000400100043d00000044021000390000046d030000410000080d0000013d00000000430104340000000001320436000000000003004b00000a600000613d000000000200001900000000051200190000000006240019000000000606043300000000006504350000002002200039000000000032004b00000a590000413d000000000213001900000000000204350000001f02300039000004aa022001970000000001210019000000000001042d000004ac0010009c00000a760000213d000000630010008c00000a760000a13d00000002030003670000000401300370000000000101043b000004010010009c00000a760000213d0000002402300370000000000202043b000004010020009c00000a760000213d0000004403300370000000000303043b000000000001042d000000000100001900000ff500010430000004ad0010009c00000a7d0000813d0000002001100039000000400010043f000000000001042d0000048901000041000000000010043f0000004101000039000000040010043f000004140100004100000ff5000104300000001f02200039000004aa022001970000000001120019000000000021004b00000000020000390000000102004039000004060010009c00000a8f0000213d000000010020019000000a8f0000c13d000000400010043f000000000001042d0000048901000041000000000010043f0000004101000039000000040010043f000004140100004100000ff5000104300008000000000002000500000001001d000604010020019c00000c240000613d000800000003001d000000000030043f0000000201000039000000200010043f0000000001000414000003fe0010009c000003fe01008041000000c00110021000000464011001c700008010020000390ff30fee0000040f000000010020019000000c220000613d000000000101043b000000000101041a00000401041001970000000001000411000000000001004b000700000004001d00000ae10000613d000000000014004b00000ae10000613d000000000040043f0000000501000039000000200010043f0000000001000414000003fe0010009c000003fe01008041000000c00110021000000464011001c700008010020000390ff30fee0000040f000000010020019000000c220000613d000000000101043b0000000002000411000000000020043f000000200010043f0000000001000414000003fe0010009c000003fe01008041000000c00110021000000464011001c700008010020000390ff30fee0000040f000000010020019000000c220000613d000000000101043b000000000101041a000000ff00100190000000070400002900000ae10000c13d0000000801000029000000000010043f0000000401000039000000200010043f0000000001000414000003fe0010009c000003fe01008041000000c00110021000000464011001c700008010020000390ff30fee0000040f000000010020019000000c220000613d000000000101043b000000000101041a00000401011001970000000002000411000000000021004b000000070400002900000c480000c13d000000000004004b00000b050000613d0000000801000029000000000010043f0000000401000039000000200010043f0000000001000414000003fe0010009c000003fe01008041000000c00110021000000464011001c700008010020000390ff30fee0000040f000000010020019000000c220000613d000000000101043b000000000201041a0000040d02200197000000000021041b0000000701000029000000000010043f0000000301000039000000200010043f0000000001000414000003fe0010009c000003fe01008041000000c00110021000000464011001c700008010020000390ff30fee0000040f000000010020019000000c220000613d000000000101043b000000000201041a000000010220008a000000000021041b0000000601000029000000000010043f0000000301000039000000200010043f0000000001000414000003fe0010009c000003fe01008041000000c00110021000000464011001c700008010020000390ff30fee0000040f000000010020019000000c220000613d000000000101043b000000000201041a0000000102200039000000000021041b0000000801000029000000000010043f0000000201000039000000200010043f0000000001000414000003fe0010009c000003fe01008041000000c00110021000000464011001c700008010020000390ff30fee0000040f000000010020019000000c220000613d000000000101043b000000000201041a0000040d022001970000000606000029000000000262019f000000000021041b0000000001000414000003fe0010009c000003fe01008041000000c0011002100000040e011001c70000800d020000390000000403000039000004af04000041000000070500002900000008070000290ff30fe90000040f000000010020019000000c220000613d0000000705000029000000000005004b00000bbb0000613d0000000603000029000000000035004b000000080400002900000bda0000613d000000000050043f0000000301000039000000200010043f0000000001000414000003fe0010009c000003fe01008041000000c00110021000000464011001c700008010020000390ff30fee0000040f000000010020019000000c220000613d000000000101043b000000000101041a000400000001001d0000000801000029000000000010043f0000000701000039000000200010043f0000000001000414000003fe0010009c000003fe01008041000000c00110021000000464011001c700008010020000390ff30fee0000040f000000010020019000000c220000613d000000000101043b000000000101041a000300000001001d0000000701000029000000000010043f0000000601000039000000200010043f0000000001000414000003fe0010009c000003fe01008041000000c00110021000000464011001c700008010020000390ff30fee0000040f000000010020019000000c220000613d000000000101043b000200000001001d0000000302000029000000040020006c00000b9b0000613d0000000401000029000000000010043f0000000201000029000000200010043f0000000001000414000003fe0010009c000003fe01008041000000c00110021000000464011001c700008010020000390ff30fee0000040f000000010020019000000c220000613d000000000101043b000000000101041a000100000001001d0000000301000029000000000010043f0000000001000414000003fe0010009c000003fe01008041000000c00110021000000464011001c700008010020000390ff30fee0000040f000000010020019000000c220000613d000000000101043b0000000102000029000000000021041b000000000020043f0000000701000039000000200010043f0000000001000414000003fe0010009c000003fe01008041000000c00110021000000464011001c700008010020000390ff30fee0000040f000000010020019000000c220000613d000000000101043b0000000302000029000000000021041b0000000801000029000000000010043f0000000701000039000000200010043f0000000001000414000003fe0010009c000003fe01008041000000c00110021000000464011001c700008010020000390ff30fee0000040f000000010020019000000c220000613d000000000101043b000000000001041b0000000401000029000000000010043f0000000201000029000000200010043f0000000001000414000003fe0010009c000003fe01008041000000c00110021000000464011001c700008010020000390ff30fee0000040f000000010020019000000c220000613d000000000101043b0000000002000019000000080400002900000bd70000013d0000000801000039000000000101041a000400000001001d0000000801000029000000000010043f0000000901000039000000200010043f0000000001000414000003fe0010009c000003fe01008041000000c00110021000000464011001c700008010020000390ff30fee0000040f000000010020019000000c220000613d000000000101043b0000000402000029000000000021041b000004b00020009c00000c420000813d00000001012000390000000803000039000000000013041b000000000030043f000004b10120009a000000080400002900000000020400190000000603000029000000000021041b0000000705000029000000000035004b00000c1d0000613d000000000030043f0000000301000039000000200010043f0000000001000414000003fe0010009c000003fe01008041000000c00110021000000464011001c700008010020000390ff30fee0000040f000000010020019000000c220000613d000000000101043b000000000101041a000400000001001d000000000001004b00000c3c0000613d0000000601000029000000000010043f0000000601000039000000200010043f0000000001000414000003fe0010009c000003fe01008041000000c00110021000000464011001c700008010020000390ff30fee0000040f000000010020019000000c220000613d0000000402000029000000010220008a000000000101043b000600000002001d000000000020043f000000200010043f0000000001000414000003fe0010009c000003fe01008041000000c00110021000000464011001c700008010020000390ff30fee0000040f000000010020019000000c220000613d000000000101043b0000000802000029000000000021041b000000000020043f0000000701000039000000200010043f0000000001000414000003fe0010009c000003fe01008041000000c00110021000000464011001c700008010020000390ff30fee0000040f000000010020019000000c220000613d000000000101043b0000000602000029000000000021041b0000000804000029000000070500002900000005010000290000040101100197000000000015004b00000c2e0000c13d000000000001042d000000000100001900000ff500010430000000400100043d000004b302000041000000000021043500000004021000390000000000020435000003fe0010009c000003fe01008041000000400110021000000414011001c700000ff500010430000000400200043d0000004403200039000000000053043500000024032000390000000000430435000004b203000041000000000032043500000004032000390000000000130435000003fe0020009c000003fe0200804100000040012002100000046e011001c700000ff5000104300000048901000041000000000010043f0000001101000039000000040010043f000004140100004100000ff5000104300000048901000041000000000010043f0000004101000039000000040010043f000004140100004100000ff500010430000000400100043d0000000403100039000003fe0010009c000003fe0200004100000000020140190000004002200210000000000004004b00000c560000c13d0000047d0400004100000000004104350000000801000029000000000013043500000414012001c700000ff500010430000004ae04000041000000000041043500000000040004110000040104400197000000000043043500000024011000390000000803000029000000000031043500000498012001c700000ff500010430000000000301001900000000011200a9000000000003004b00000c670000613d00000000033100d9000000000023004b00000c680000c13d000000000001042d0000048901000041000000000010043f0000001101000039000000040010043f000004140100004100000ff5000104300000000802000039000000000302041a000000000013004b00000c760000a13d000000000020043f000004b10110009a0000000002000019000000000001042d0000048901000041000000000010043f0000003201000039000000040010043f000004140100004100000ff500010430000004010110019800000c8d0000613d000000000010043f0000000301000039000000200010043f0000000001000414000003fe0010009c000003fe01008041000000c00110021000000464011001c700008010020000390ff30fee0000040f000000010020019000000c970000613d000000000101043b000000000101041a000000000001042d000000400100043d0000049902000041000000000021043500000004021000390000000000020435000003fe0010009c000003fe01008041000000400110021000000414011001c700000ff500010430000000000100001900000ff5000104300001000000000002000100000001001d000000000010043f0000000201000039000000200010043f0000000001000414000003fe0010009c000003fe01008041000000c00110021000000464011001c700008010020000390ff30fee0000040f000000010020019000000cac0000613d000000000101043b000000000101041a000004010110019800000cae0000613d000000000001042d000000000100001900000ff500010430000000400100043d0000047d020000410000000000210435000000040210003900000001030000290000000000320435000003fe0010009c000003fe01008041000000400110021000000414011001c700000ff5000104300007000000000002000400000005001d000200000004001d000100000002001d000300000001001d000004b4010000410000000000100443000500000003001d00000004003004430000000001000414000003fe0010009c000003fe01008041000000c00110021000000496011001c700008002020000390ff30fee0000040f000000010020019000000d4e0000613d000000000101043b000000000001004b00000d4b0000613d000000400b00043d0000006401b00039000000800800003900000000008104350000004401b0003900000002020000290000000000210435000000010100002900000401011001970000002402b000390000000000120435000004b50100004100000000001b0435000000030100002900000401011001970000000402b0003900000000001204350000008403b00039000000040100002900000000210104340000000000130435000000a403b0003900000005040000290000040107400197000000000001004b00000cf00000613d000000000400001900000000053400190000000006420019000000000606043300000000006504350000002004400039000000000014004b00000ce90000413d000000000231001900000000000204350000000002000414000000040070008c00000cfd0000c13d0000000005000415000000070550008a00000005055002100000000103000031000000200030008c0000002004000039000000000403401900000d360000013d000300000008001d0000001f01100039000004aa01100197000000a401100039000003fe0010009c000003fe010080410000006001100210000003fe00b0009c000003fe0300004100000000030b40190000004003300210000000000131019f000003fe0020009c000003fe02008041000000c002200210000000000112019f000400000007001d000000000207001900050000000b001d0ff30fe90000040f000000050b0000290000006003100270000003fe03300197000000200030008c000000200400003900000000040340190000001f0640018f000000200740019000000000057b001900000d210000613d000000000801034f00000000090b0019000000008a08043c0000000009a90436000000000059004b00000d1d0000c13d000000000006004b00000d2e0000613d000000000771034f0000000306600210000000000805043300000000086801cf000000000868022f000000000707043b0000010006600089000000000767022f00000000066701cf000000000686019f0000000000650435000100000003001f00030000000103550000000005000415000000060550008a0000000505500210000000010020019000000d580000613d00000004070000290000001f01400039000000600210018f0000000001b20019000000000021004b00000000020000390000000102004039000004060010009c00000d8d0000213d000000010020019000000d8d0000c13d000000400010043f0000001f0030008c00000d4c0000a13d00000000020b0433000004a20020019800000d4c0000c13d0000000503500270000000000302001f000004b702200197000004b50020009c00000d4f0000c13d000000000001042d000000000100001900000ff500010430000000000001042f000004b302000041000000000021043500000004021000390000000000720435000003fe0010009c000003fe01008041000000400110021000000414011001c700000ff500010430000000000003004b00000d5c0000c13d000000600200003900000d830000013d0000001f02300039000003ff022001970000003f02200039000004b604200197000000400200043d0000000004420019000000000024004b00000000050000390000000105004039000004060040009c00000d8d0000213d000000010050019000000d8d0000c13d000000400040043f0000001f0430018f00000000063204360000040005300198000300000006001d000000000356001900000d760000613d000000000601034f0000000307000029000000006806043c0000000007870436000000000037004b00000d720000c13d000000000004004b00000d830000613d000000000151034f0000000304400210000000000503043300000000054501cf000000000545022f000000000101043b0000010004400089000000000141022f00000000014101cf000000000151019f00000000001304350000000001020433000000000001004b00000d930000c13d000000400100043d000004b302000041000000000021043500000004021000390000000403000029000000000032043500000d530000013d0000048901000041000000000010043f0000004101000039000000040010043f000004140100004100000ff5000104300000000302000029000003fe0020009c000003fe020080410000004002200210000003fe0010009c000003fe010080410000006001100210000000000121019f00000ff500010430000c000000000002000a00000002001d000000400200043d000004ad0020009c00000fc40000813d0000002003200039000600000003001d000000400030043f000500000002001d0000000000020435000700000001001d000904010010019c00000f7b0000613d0000000a01000029000000000010043f0000000201000039000000200010043f0000000001000414000003fe0010009c000003fe01008041000000c00110021000000464011001c700008010020000390ff30fee0000040f000000010020019000000f790000613d000000000101043b000000000101041a000804010010019c00000ddc0000613d0000000a01000029000000000010043f0000000401000039000000200010043f0000000001000414000003fe0010009c000003fe01008041000000c00110021000000464011001c700008010020000390ff30fee0000040f000000010020019000000f790000613d000000000101043b000000000201041a0000040d02200197000000000021041b0000000801000029000000000010043f0000000301000039000000200010043f0000000001000414000003fe0010009c000003fe01008041000000c00110021000000464011001c700008010020000390ff30fee0000040f000000010020019000000f790000613d000000000101043b000000000201041a000000010220008a000000000021041b0000000901000029000000000010043f0000000301000039000000200010043f0000000001000414000003fe0010009c000003fe01008041000000c00110021000000464011001c700008010020000390ff30fee0000040f000000010020019000000f790000613d000000000101043b000000000201041a0000000102200039000000000021041b0000000a01000029000000000010043f0000000201000039000000200010043f0000000001000414000003fe0010009c000003fe01008041000000c00110021000000464011001c700008010020000390ff30fee0000040f000000010020019000000f790000613d000000000101043b000000000201041a0000040d022001970000000906000029000000000262019f000000000021041b0000000001000414000003fe0010009c000003fe01008041000000c0011002100000040e011001c70000800d020000390000000403000039000004af0400004100000008050000290000000a070000290ff30fe90000040f000000010020019000000f790000613d0000000801000029000000000001004b00000e900000613d0000000903000029000000000031004b00000eae0000613d000000000010043f0000000301000039000000200010043f0000000001000414000003fe0010009c000003fe01008041000000c00110021000000464011001c700008010020000390ff30fee0000040f000000010020019000000f790000613d000000000101043b000000000101041a000400000001001d0000000a01000029000000000010043f0000000701000039000000200010043f0000000001000414000003fe0010009c000003fe01008041000000c00110021000000464011001c700008010020000390ff30fee0000040f000000010020019000000f790000613d000000000101043b000000000101041a000300000001001d0000000801000029000000000010043f0000000601000039000000200010043f0000000001000414000003fe0010009c000003fe01008041000000c00110021000000464011001c700008010020000390ff30fee0000040f000000010020019000000f790000613d000000000101043b000200000001001d0000000302000029000000040020006c00000e710000613d0000000401000029000000000010043f0000000201000029000000200010043f0000000001000414000003fe0010009c000003fe01008041000000c00110021000000464011001c700008010020000390ff30fee0000040f000000010020019000000f790000613d000000000101043b000000000101041a000100000001001d0000000301000029000000000010043f0000000001000414000003fe0010009c000003fe01008041000000c00110021000000464011001c700008010020000390ff30fee0000040f000000010020019000000f790000613d000000000101043b0000000102000029000000000021041b000000000020043f0000000701000039000000200010043f0000000001000414000003fe0010009c000003fe01008041000000c00110021000000464011001c700008010020000390ff30fee0000040f000000010020019000000f790000613d000000000101043b0000000302000029000000000021041b0000000a01000029000000000010043f0000000701000039000000200010043f0000000001000414000003fe0010009c000003fe01008041000000c00110021000000464011001c700008010020000390ff30fee0000040f000000010020019000000f790000613d000000000101043b000000000001041b0000000401000029000000000010043f0000000201000029000000200010043f0000000001000414000003fe0010009c000003fe01008041000000c00110021000000464011001c700008010020000390ff30fee0000040f000000010020019000000f790000613d000000000101043b000000000200001900000eab0000013d0000000801000039000000000101041a000400000001001d0000000a01000029000000000010043f0000000901000039000000200010043f0000000001000414000003fe0010009c000003fe01008041000000c00110021000000464011001c700008010020000390ff30fee0000040f000000010020019000000f790000613d000000000101043b0000000402000029000000000021041b000004060020009c00000fc40000213d00000001012000390000000803000039000000000013041b000000000030043f000004b10120009a0000000a020000290000000903000029000000000021041b0000000801000029000000000031004b00000ef00000613d000000000030043f0000000301000039000000200010043f0000000001000414000003fe0010009c000003fe01008041000000c00110021000000464011001c700008010020000390ff30fee0000040f000000010020019000000f790000613d000000000101043b000000000101041a000400000001001d000000000001004b00000f850000613d0000000901000029000000000010043f0000000601000039000000200010043f0000000001000414000003fe0010009c000003fe01008041000000c00110021000000464011001c700008010020000390ff30fee0000040f000000010020019000000f790000613d0000000402000029000000010220008a000000000101043b000400000002001d000000000020043f000000200010043f0000000001000414000003fe0010009c000003fe01008041000000c00110021000000464011001c700008010020000390ff30fee0000040f000000010020019000000f790000613d000000000101043b0000000a02000029000000000021041b000000000020043f0000000701000039000000200010043f0000000001000414000003fe0010009c000003fe01008041000000c00110021000000464011001c700008010020000390ff30fee0000040f000000010020019000000f790000613d000000000101043b0000000402000029000000000021041b0000000801000029000000000001004b00000f7e0000c13d000004b4010000410000000000100443000000070100002900000004001004430000000001000414000003fe0010009c000003fe01008041000000c00110021000000496011001c700008002020000390ff30fee0000040f000000010020019000000f840000613d000000000101043b000000000001004b000000060700002900000f780000613d000000400b00043d0000006401b00039000000800800003900000000008104350000004401b000390000000a020000290000000000210435000004b50100004100000000001b04350000000401b00039000000000200041100000000002104350000002401b000390000000000010435000000050100002900000000010104330000008402b000390000000000120435000000a406b00039000000000001004b000000090200002900000f210000613d000000000300001900000000046300190000000005730019000000000505043300000000005404350000002003300039000000000013004b00000f1a0000413d000000000361001900000000000304350000000004000414000000040020008c00000f2d0000c13d00000000050004150000000c0550008a00000005055002100000000104000031000000200040008c000000200400803900000f630000013d000800000008001d0000001f01100039000004aa01100197000000a401100039000003fe0010009c000003fe010080410000006001100210000003fe00b0009c000003fe0300004100000000030b40190000004003300210000000000131019f000003fe0040009c000003fe04008041000000c003400210000000000113019f000a0000000b001d0ff30fe90000040f0000000a0b0000290000006003100270000003fe03300197000000200030008c000000200400003900000000040340190000001f0640018f000000200740019000000000057b001900000f4f0000613d000000000801034f00000000090b0019000000008a08043c0000000009a90436000000000059004b00000f4b0000c13d000000000006004b00000f5c0000613d000000000771034f0000000306600210000000000805043300000000086801cf000000000868022f000000000707043b0000010006600089000000000767022f00000000066701cf000000000686019f0000000000650435000100000003001f000300000001035500000000050004150000000b0550008a0000000505500210000000010020019000000f8b0000613d0000001f01400039000000600210018f0000000001b20019000000000021004b00000000020000390000000102004039000004060010009c00000fc40000213d000000010020019000000fc40000c13d000000400010043f000000200040008c00000f790000413d00000000020b0433000004a20020019800000f790000c13d0000000503500270000000000302001f000004b702200197000004b50020009c00000fba0000c13d000000000001042d000000000100001900000ff500010430000000400100043d000004b30200004100000f800000013d000000400100043d000004b80200004100000000002104350000000402100039000000000002043500000fbf0000013d000000000001042f0000048901000041000000000010043f0000001101000039000000040010043f000004140100004100000ff500010430000000000003004b00000f8f0000c13d000000600200003900000fb60000013d0000001f02300039000003ff022001970000003f02200039000004b604200197000000400200043d0000000004420019000000000024004b00000000050000390000000105004039000004060040009c00000fc40000213d000000010050019000000fc40000c13d000000400040043f0000001f0430018f00000000063204360000040005300198000800000006001d000000000356001900000fa90000613d000000000601034f0000000807000029000000006806043c0000000007870436000000000037004b00000fa50000c13d000000000004004b00000fb60000613d000000000151034f0000000304400210000000000503043300000000054501cf000000000545022f000000000101043b0000010004400089000000000141022f00000000014101cf000000000151019f00000000001304350000000001020433000000000001004b00000fca0000c13d000000400100043d000004b3020000410000000000210435000000040210003900000009030000290000000000320435000003fe0010009c000003fe01008041000000400110021000000414011001c700000ff5000104300000048901000041000000000010043f0000004101000039000000040010043f000004140100004100000ff5000104300000000802000029000003fe0020009c000003fe020080410000004002200210000003fe0010009c000003fe010080410000006001100210000000000121019f00000ff500010430000000000001042f000003fe0010009c000003fe010080410000004001100210000003fe0020009c000003fe020080410000006002200210000000000112019f0000000002000414000003fe0020009c000003fe02008041000000c002200210000000000112019f0000040e011001c700008010020000390ff30fee0000040f000000010020019000000fe70000613d000000000101043b000000000001042d000000000100001900000ff50001043000000fec002104210000000102000039000000000001042d0000000002000019000000000001042d00000ff1002104230000000102000039000000000001042d0000000002000019000000000001042d00000ff30000043200000ff40001042e00000ff5000104300000000000000000000000000000000000000000000000000000000000000000000000000000000000000000ffffffff00000000000000000000000000000000000000000000000000000001ffffffe000000000000000000000000000000000000000000000000000000000ffffffe0000000000000000000000000ffffffffffffffffffffffffffffffffffffffff000000000000000000000000000000000000000000000000ffffffffffffffc0416273747261637420466c756666730000000000000000000000000000000000000000000000000000000000000000000000000000000000ffffffffffffffbf464c554646000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000ffffffffffffffffd6f21326ab749d5729fcba5677c79037b459436ab7bff709c9d06ce9f10c1a9d290decd9548b62a8d60345a988386fc84ba6bc95484008f6362f93160ef3e563d6f21326ab749d5729fcba5677c79037b459436ab7bff709c9d06ce9f10c1a9c4ef1d2ad89edf8c4d91132028e8195cdf30bb4b5053d4f8cd260341d4805f30ab10e2d527612073b26eecdfd717e6a320cf44b4afac2b0732d9fcbe2b7fa0cf64ef1d2ad89edf8c4d91132028e8195cdf30bb4b5053d4f8cd260341d4805f309ffffffffffffffffffffffff000000000000000000000000000000000000000002000000000000000000000000000000000000000000000000000000000000008be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e0000000000000000000000000000000000000000000000000000e35fa931a00000000000000000000000001f4000000000000000000000000000000000000000000000002000000000000000000000000000000400000010000000000000000001e4fbdf7000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000024000000000000000000000000000000000000000000000000000000000000000000000000000000006463188200000000000000000000000000000000000000000000000000000000b88d4fdd00000000000000000000000000000000000000000000000000000000d0bfb80f00000000000000000000000000000000000000000000000000000000ed75fbe300000000000000000000000000000000000000000000000000000000f2fde38a00000000000000000000000000000000000000000000000000000000f2fde38b00000000000000000000000000000000000000000000000000000000f6a5b8e600000000000000000000000000000000000000000000000000000000ed75fbe400000000000000000000000000000000000000000000000000000000efd0cbf900000000000000000000000000000000000000000000000000000000d0bfb81000000000000000000000000000000000000000000000000000000000e985e9c500000000000000000000000000000000000000000000000000000000e994a66e00000000000000000000000000000000000000000000000000000000c7f8d01900000000000000000000000000000000000000000000000000000000c7f8d01a00000000000000000000000000000000000000000000000000000000c87b56dd00000000000000000000000000000000000000000000000000000000cb2bbdd600000000000000000000000000000000000000000000000000000000b88d4fde00000000000000000000000000000000000000000000000000000000bd2f92a100000000000000000000000000000000000000000000000000000000c62752550000000000000000000000000000000000000000000000000000000093ce003200000000000000000000000000000000000000000000000000000000a22cb46400000000000000000000000000000000000000000000000000000000a945bf7f00000000000000000000000000000000000000000000000000000000a945bf8000000000000000000000000000000000000000000000000000000000abccc31e00000000000000000000000000000000000000000000000000000000a22cb46500000000000000000000000000000000000000000000000000000000a2309ff80000000000000000000000000000000000000000000000000000000093ce00330000000000000000000000000000000000000000000000000000000095d89b41000000000000000000000000000000000000000000000000000000009d7b4d6f000000000000000000000000000000000000000000000000000000007d44fd10000000000000000000000000000000000000000000000000000000007d44fd11000000000000000000000000000000000000000000000000000000007ecc2b56000000000000000000000000000000000000000000000000000000008da5cb5b00000000000000000000000000000000000000000000000000000000646318830000000000000000000000000000000000000000000000000000000070a0823100000000000000000000000000000000000000000000000000000000715018a60000000000000000000000000000000000000000000000000000000032cb6b0b0000000000000000000000000000000000000000000000000000000050c965080000000000000000000000000000000000000000000000000000000055f804b200000000000000000000000000000000000000000000000000000000603f4d5100000000000000000000000000000000000000000000000000000000603f4d52000000000000000000000000000000000000000000000000000000006352211e0000000000000000000000000000000000000000000000000000000055f804b3000000000000000000000000000000000000000000000000000000005a67de070000000000000000000000000000000000000000000000000000000050c9650900000000000000000000000000000000000000000000000000000000518b1db70000000000000000000000000000000000000000000000000000000054c06aee0000000000000000000000000000000000000000000000000000000042842e0d0000000000000000000000000000000000000000000000000000000042842e0e0000000000000000000000000000000000000000000000000000000047a6326f000000000000000000000000000000000000000000000000000000004f6ccce70000000000000000000000000000000000000000000000000000000032cb6b0c0000000000000000000000000000000000000000000000000000000034c48943000000000000000000000000000000000000000000000000000000003ccfd60b0000000000000000000000000000000000000000000000000000000015f5d89f0000000000000000000000000000000000000000000000000000000023b872dc000000000000000000000000000000000000000000000000000000002a552059000000000000000000000000000000000000000000000000000000002a55205a000000000000000000000000000000000000000000000000000000002f745c590000000000000000000000000000000000000000000000000000000023b872dd0000000000000000000000000000000000000000000000000000000025c2c0200000000000000000000000000000000000000000000000000000000015f5d8a00000000000000000000000000000000000000000000000000000000018160ddd000000000000000000000000000000000000000000000000000000001e88584400000000000000000000000000000000000000000000000000000000081812fb00000000000000000000000000000000000000000000000000000000081812fc00000000000000000000000000000000000000000000000000000000095ea7b3000000000000000000000000000000000000000000000000000000000a3025300000000000000000000000000000000000000000000000000000000001ffc9a70000000000000000000000000000000000000000000000000000000004634d8d0000000000000000000000000000000000000000000000000000000006fdde03118cdaa7000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000024000000800000000000000000574c000000000000000000000000000000000000000000000000000000000000020000000000000000000000000000000000008000000080000000000000000029ecd1e0988af1492e43256007437db411881757b3e6e808c9f04847b264178c08c379a0000000000000000000000000000000000000000000000000000000005075626c69632073616c65206e6f74206163746976650000000000000000000000000000000000000000000000000000000000640000008000000000000000000200000000000000000000000000000000000040000000000000000000000000630000000000000000000000000000000000000000000000000000000000000045786365656473206d6178207065722077616c6c657420666f72207075626c69000000000000000000000000000000000000008400000000000000000000000045786365656473206d617820737570706c7900000000000000000000000000004d6178207065722077616c6c6574206d757374206265203e20300000000000000000000000000000000000000000000000000020000000800000000000000000574c2073616c65206e6f742061637469766500000000000000000000000000007fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffe0496e76616c69642070726f6f6620666f7220574c000000000000000000000000000000000000000000000000000000000000006400000000000000000000000045786365656473206d6178207065722077616c6c657420666f7220574c0000004578636565647320574c20737570706c790000000000000000000000000000004f47000000000000000000000000000000000000000000000000000000000000057c384a7d1c54f3a1b2e5e67b2617b8224fdfd1ea7234eea573a6ff665ff63e0000000000184f03e93ff9f4daa797ed6e38ed64bf6a1f01000000000000000000000000000000000000000000000000000004ee2d6d415b85acef810000000000000000000000000000000000000000000004ee2d6d415b85acef80ffffffff000000000000000000000000000000000000000000000000002386f26fc1000000000000000000000000000000000000ffffffffffffffffffffffffffffffff0000000000000000000000000000000000000000000000000000000005f5e10000ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff30313233343536373839616263646566000000000000000000000000000000007f00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000ffffffffffffffdf7e273289000000000000000000000000000000000000000000000000000000005075626c696300000000000000000000000000000000000000000000000000004f472073616c65206e6f74206163746976650000000000000000000000000000496e76616c69642070726f6f6620666f72204f47000000000000000000000000496e73756666696369656e74207061796d656e7400000000000000000000000045786365656473206d6178207065722077616c6c657420666f72204f4700000045786365656473204f4720737570706c790000000000000000000000000000005265656e7472616e637947756172643a207265656e7472616e742063616c6c00000000000000000000000000000000000000000000000000ffffffffffffff7f020000000000000000000000000000000000002000000000000000000000000017307eab39ab6107e8899845ad3d59bd9653f200f220920489ca2b5937696c315b08ba18000000000000000000000000000000000000000000000000000000004e487b710000000000000000000000000000000000000000000000000000000005451cee928ce06d75c4e27308285002ef30153bfbabe61352de88575267e8900000000000000000000000000000000000000020000000000000000000000000020000000000000000000000000000000000002000000080000000000000000092a17b827ee9d42ea9454bb4ca941a1800870e6d01c0842d09ba23ccc0190ee1fa83c7b582e3ab0c5e4d1a1984d9e847ddb0202e158dcb115a8c590099a009c2fdffffffffffffffffffffffffffffffffffffffffffff800000000000000000000000000000000000000000000000000000000000000000000000010000000002000000000000000000000000000000ffffffff0000008000000000000000005411e8ebf1636d9e83d5fc4900bf80cbac82e8790da2a4c94db4895e889eedf6a57d13dc0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000440000008000000000000000009cc7f708afc65944829bd487b90b72536b1951864fbfc14e125fc972a6507f3902000002000000000000000000000000000000240000000000000000000000005769746864726177616c206661696c6564000000000000000000000000000000000000000000000000000000000000000000004400000000000000000000000089c62b64000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000040000000000000000000000000a9fbf51f000000000000000000000000000000000000000000000000000000008c5be1e5ebec7d5bd14f71427d1e84f3dd0314c0f7b2291e5b200ac8c7c3b9250000000000000000000000000000000000000000ffffffffffffffffffffffff0200000000000000000000000000000000000040000000c00000000000000000649787d44a877bdd8d255fbfdaba9927f56be0ec7aae8fb86cd16841966479d2b6d9900a000000000000000000000000000000000000000000000000000000006f483d090000000000000000000000000000000000000000000000000000000000000000ffffffffffffffffffffffffffffffffffffffffffffffffffffffff5b5e139effffffffffffffffffffffffffffffffffffffffffffffffffffffff5b5e139f0000000000000000000000000000000000000000000000000000000080ac58cd00000000000000000000000000000000000000000000000000000000780e9d630000000000000000000000000000000000000000000000000000000001ffc9a7000000000000000000000000000000000000000000000000000000002a55205a00000000000000000000000000000000000000000000000000000000ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff00ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffe0ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff7fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff000000000000000000000000000000000000000000000000ffffffffffffffe0177e802f00000000000000000000000000000000000000000000000000000000ddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef00000000000000000000000000000000000000000000000100000000000000000c085601c9b05546c4de925af5cdebeab0dd5f5d4bea4dc57b37e961749c911d64283d7b0000000000000000000000000000000000000000000000000000000064a0ae92000000000000000000000000000000000000000000000000000000001806aa1896bbf26568e884a7374b41e002500962caba6a15023a8d90e8508b83150b7a020000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003ffffffe0ffffffff0000000000000000000000000000000000000000000000000000000073c6ac6e00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000032027c84824018486ef77d99ff4cbf6571fbd93fe1ae35c27fa07bdcf84739ac
Constructor Arguments (ABI-Encoded and is the last bytes of the Contract Creation Code above)
000000000000000000000000744fda359ff21907d02ef7e9dd496a264657e696
-----Decoded View---------------
Arg [0] : initialOwner (address): 0x744FdA359FF21907D02Ef7e9DD496a264657E696
-----Encoded View---------------
1 Constructor Arguments found :
Arg [0] : 000000000000000000000000744fda359ff21907d02ef7e9dd496a264657e696
[ Download: CSV Export ]
A token is a representation of an on-chain or off-chain asset. The token page shows information such as price, total supply, holders, transfers and social links. Learn more about this page in our Knowledge Base.