hood// SPDX-License-Identifier: MIT
pragma solidity ^0.8.24;
// OpenZeppelin Contracts (last updated v5.4.0) (utils/introspection/IERC165.sol)
/**
* @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);
}
// OpenZeppelin Contracts (last updated v5.4.0) (token/ERC721/IERC721.sol)
/**
* @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);
}
// OpenZeppelin Contracts (last updated v5.4.0) (token/ERC721/extensions/IERC721Metadata.sol)
/**
* @title ERC-721 Non-Fungible Token Standard, optional metadata extension
* @dev See https://eips.ethereum.org/EIPS/eip-721
*/
interface IERC721Metadata is IERC721 {
/**
* @dev Returns the token collection name.
*/
function name() external view returns (string memory);
/**
* @dev Returns the token collection symbol.
*/
function symbol() external view returns (string memory);
/**
* @dev Returns the Uniform Resource Identifier (URI) for `tokenId` token.
*/
function tokenURI(uint256 tokenId) external view returns (string memory);
}
// OpenZeppelin Contracts (last updated v5.4.0) (token/ERC721/IERC721Receiver.sol)
/**
* @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);
}
// OpenZeppelin Contracts (last updated v5.5.0) (interfaces/draft-IERC6093.sol)
/**
* @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-721.
* 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);
}
// OpenZeppelin Contracts (last updated v5.5.0) (token/ERC721/utils/ERC721Utils.sol)
/**
* @dev Library that provides 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 {IERC721Receiver-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(reason, 0x20), mload(reason))
}
}
}
}
}
}
// OpenZeppelin Contracts (last updated v5.0.1) (utils/Context.sol)
/**
* @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;
}
}
// OpenZeppelin Contracts (last updated v5.1.0) (utils/Panic.sol)
/**
* @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)
}
}
}
// OpenZeppelin Contracts (last updated v5.6.0) (utils/math/SafeCast.sol)
// This file was procedurally generated from scripts/generate/templates/SafeCast.js.
/**
* @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 a uint of `bits` size.
*/
error SafeCastOverflowedUintDowncast(uint8 bits, uint256 value);
/**
* @dev An int value doesn't fit in a 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 A 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))
}
}
}
// OpenZeppelin Contracts (last updated v5.6.0) (utils/math/Math.sol)
/**
* @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 Return the 512-bit addition of two uint256.
*
* The result is stored in two 256 variables such that sum = high * 2²⁵⁶ + low.
*/
function add512(uint256 a, uint256 b) internal pure returns (uint256 high, uint256 low) {
assembly ("memory-safe") {
low := add(a, b)
high := lt(low, a)
}
}
/**
* @dev Return the 512-bit multiplication of two uint256.
*
* The result is stored in two 256 variables such that product = high * 2²⁵⁶ + low.
*/
function mul512(uint256 a, uint256 b) internal pure returns (uint256 high, uint256 low) {
// 512-bit multiply [high low] = 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 = high * 2²⁵⁶ + low.
assembly ("memory-safe") {
let mm := mulmod(a, b, not(0))
low := mul(a, b)
high := sub(sub(mm, low), lt(mm, low))
}
}
/**
* @dev Returns the addition of two unsigned integers, with a success flag (no overflow).
*/
function tryAdd(uint256 a, uint256 b) internal pure returns (bool success, uint256 result) {
unchecked {
uint256 c = a + b;
success = c >= a;
result = c * SafeCast.toUint(success);
}
}
/**
* @dev Returns the subtraction of two unsigned integers, with a success flag (no overflow).
*/
function trySub(uint256 a, uint256 b) internal pure returns (bool success, uint256 result) {
unchecked {
uint256 c = a - b;
success = c <= a;
result = c * SafeCast.toUint(success);
}
}
/**
* @dev Returns the multiplication of two unsigned integers, with a success flag (no overflow).
*/
function tryMul(uint256 a, uint256 b) internal pure returns (bool success, uint256 result) {
unchecked {
uint256 c = a * b;
assembly ("memory-safe") {
// Only true when the multiplication doesn't overflow
// (c / a == b) || (a == 0)
success := or(eq(div(c, a), b), iszero(a))
}
// equivalent to: success ? c : 0
result = c * SafeCast.toUint(success);
}
}
/**
* @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 {
success = b > 0;
assembly ("memory-safe") {
// The `DIV` opcode returns zero when the denominator is 0.
result := div(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 {
success = b > 0;
assembly ("memory-safe") {
// The `MOD` opcode returns zero when the denominator is 0.
result := mod(a, b)
}
}
}
/**
* @dev Unsigned saturating addition, bounds to `2²⁵⁶ - 1` instead of overflowing.
*/
function saturatingAdd(uint256 a, uint256 b) internal pure returns (uint256) {
(bool success, uint256 result) = tryAdd(a, b);
return ternary(success, result, type(uint256).max);
}
/**
* @dev Unsigned saturating subtraction, bounds to zero instead of overflowing.
*/
function saturatingSub(uint256 a, uint256 b) internal pure returns (uint256) {
(, uint256 result) = trySub(a, b);
return result;
}
/**
* @dev Unsigned saturating multiplication, bounds to `2²⁵⁶ - 1` instead of overflowing.
*/
function saturatingMul(uint256 a, uint256 b) internal pure returns (uint256) {
(bool success, uint256 result) = tryMul(a, b);
return ternary(success, result, type(uint256).max);
}
/**
* @dev Branchless ternary evaluation for `condition ? a : b`. 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. `condition ? a : b`) 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) {
unchecked {
// (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 {
(uint256 high, uint256 low) = mul512(x, y);
// Handle non-overflow cases, 256 by 256 division.
if (high == 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 low / denominator;
}
// Make sure the result is less than 2²⁵⁶. Also prevents denominator == 0.
if (denominator <= high) {
Panic.panic(ternary(denominator == 0, Panic.DIVISION_BY_ZERO, Panic.UNDER_OVERFLOW));
}
///////////////////////////////////////////////
// 512 by 256 division.
///////////////////////////////////////////////
// Make division exact by subtracting the remainder from [high low].
uint256 remainder;
assembly ("memory-safe") {
// Compute remainder using mulmod.
remainder := mulmod(x, y, denominator)
// Subtract 256 bit number from 512 bit number.
high := sub(high, gt(remainder, low))
low := sub(low, 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 ("memory-safe") {
// Divide denominator by twos.
denominator := div(denominator, twos)
// Divide [high low] by twos.
low := div(low, 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 high into low.
low |= high * 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 high
// is no longer required.
result = low * 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 Calculates floor(x * y >> n) with full precision. Throws if result overflows a uint256.
*/
function mulShr(uint256 x, uint256 y, uint8 n) internal pure returns (uint256 result) {
unchecked {
(uint256 high, uint256 low) = mul512(x, y);
if (high >= 1 << n) {
Panic.panic(Panic.UNDER_OVERFLOW);
}
return (high << (256 - n)) | (low >> n);
}
}
/**
* @dev Calculates x * y >> n with full precision, following the selected rounding direction.
*/
function mulShr(uint256 x, uint256 y, uint8 n, Rounding rounding) internal pure returns (uint256) {
return mulShr(x, y, n) + SafeCast.toUint(unsignedRoundsUp(rounding) && mulmod(x, y, 1 << n) > 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 buffer) private pure returns (bool) {
uint256 chunk;
for (uint256 i = 0; i < buffer.length; i += 0x20) {
// See _unsafeReadBytesOffset from utils/Bytes.sol
assembly ("memory-safe") {
chunk := mload(add(add(buffer, 0x20), i))
}
if (chunk >> (8 * saturatingSub(i + 0x20, buffer.length)) != 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 x) internal pure returns (uint256 r) {
// If value has upper 128 bits set, log2 result is at least 128
r = SafeCast.toUint(x > 0xffffffffffffffffffffffffffffffff) << 7;
// If upper 64 bits of 128-bit half set, add 64 to result
r |= SafeCast.toUint((x >> r) > 0xffffffffffffffff) << 6;
// If upper 32 bits of 64-bit half set, add 32 to result
r |= SafeCast.toUint((x >> r) > 0xffffffff) << 5;
// If upper 16 bits of 32-bit half set, add 16 to result
r |= SafeCast.toUint((x >> r) > 0xffff) << 4;
// If upper 8 bits of 16-bit half set, add 8 to result
r |= SafeCast.toUint((x >> r) > 0xff) << 3;
// If upper 4 bits of 8-bit half set, add 4 to result
r |= SafeCast.toUint((x >> r) > 0xf) << 2;
// Shifts value right by the current result and use it as an index into this lookup table:
//
// | x (4 bits) | index | table[index] = MSB position |
// |------------|---------|-----------------------------|
// | 0000 | 0 | table[0] = 0 |
// | 0001 | 1 | table[1] = 0 |
// | 0010 | 2 | table[2] = 1 |
// | 0011 | 3 | table[3] = 1 |
// | 0100 | 4 | table[4] = 2 |
// | 0101 | 5 | table[5] = 2 |
// | 0110 | 6 | table[6] = 2 |
// | 0111 | 7 | table[7] = 2 |
// | 1000 | 8 | table[8] = 3 |
// | 1001 | 9 | table[9] = 3 |
// | 1010 | 10 | table[10] = 3 |
// | 1011 | 11 | table[11] = 3 |
// | 1100 | 12 | table[12] = 3 |
// | 1101 | 13 | table[13] = 3 |
// | 1110 | 14 | table[14] = 3 |
// | 1111 | 15 | table[15] = 3 |
//
// The lookup table is represented as a 32-byte value with the MSB positions for 0-15 in the first 16 bytes (most significant half).
assembly ("memory-safe") {
r := or(r, byte(shr(r, x), 0x0000010102020202030303030303030300000000000000000000000000000000))
}
}
/**
* @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 x) internal pure returns (uint256 r) {
// If value has upper 128 bits set, log2 result is at least 128
r = SafeCast.toUint(x > 0xffffffffffffffffffffffffffffffff) << 7;
// If upper 64 bits of 128-bit half set, add 64 to result
r |= SafeCast.toUint((x >> r) > 0xffffffffffffffff) << 6;
// If upper 32 bits of 64-bit half set, add 32 to result
r |= SafeCast.toUint((x >> r) > 0xffffffff) << 5;
// If upper 16 bits of 32-bit half set, add 16 to result
r |= SafeCast.toUint((x >> r) > 0xffff) << 4;
// Add 1 if upper 8 bits of 16-bit half set, and divide accumulated result by 8
return (r >> 3) | SafeCast.toUint((x >> r) > 0xff);
}
/**
* @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;
}
/**
* @dev Counts the number of leading zero bits in a uint256.
*/
function clz(uint256 x) internal pure returns (uint256) {
return ternary(x == 0, 256, 255 - log2(x));
}
}
// OpenZeppelin Contracts (last updated v5.1.0) (utils/math/SignedMath.sol)
/**
* @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);
}
}
}
// OpenZeppelin Contracts (last updated v5.6.0) (utils/Bytes.sol)
/**
* @dev Bytes operations.
*/
library Bytes {
/**
* @dev Forward search for `s` in `buffer`
* * If `s` is present in the buffer, returns the index of the first instance
* * If `s` is not present in the buffer, returns type(uint256).max
*
* NOTE: replicates the behavior of https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/indexOf[Javascript's `Array.indexOf`]
*/
function indexOf(bytes memory buffer, bytes1 s) internal pure returns (uint256) {
return indexOf(buffer, s, 0);
}
/**
* @dev Forward search for `s` in `buffer` starting at position `pos`
* * If `s` is present in the buffer (at or after `pos`), returns the index of the next instance
* * If `s` is not present in the buffer (at or after `pos`), returns type(uint256).max
*
* NOTE: replicates the behavior of https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/indexOf[Javascript's `Array.indexOf`]
*/
function indexOf(bytes memory buffer, bytes1 s, uint256 pos) internal pure returns (uint256) {
uint256 length = buffer.length;
for (uint256 i = pos; i < length; ++i) {
if (bytes1(_unsafeReadBytesOffset(buffer, i)) == s) {
return i;
}
}
return type(uint256).max;
}
/**
* @dev Backward search for `s` in `buffer`
* * If `s` is present in the buffer, returns the index of the last instance
* * If `s` is not present in the buffer, returns type(uint256).max
*
* NOTE: replicates the behavior of https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/lastIndexOf[Javascript's `Array.lastIndexOf`]
*/
function lastIndexOf(bytes memory buffer, bytes1 s) internal pure returns (uint256) {
return lastIndexOf(buffer, s, type(uint256).max);
}
/**
* @dev Backward search for `s` in `buffer` starting at position `pos`
* * If `s` is present in the buffer (at or before `pos`), returns the index of the previous instance
* * If `s` is not present in the buffer (at or before `pos`), returns type(uint256).max
*
* NOTE: replicates the behavior of https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/lastIndexOf[Javascript's `Array.lastIndexOf`]
*/
function lastIndexOf(bytes memory buffer, bytes1 s, uint256 pos) internal pure returns (uint256) {
unchecked {
uint256 length = buffer.length;
for (uint256 i = Math.min(Math.saturatingAdd(pos, 1), length); i > 0; --i) {
if (bytes1(_unsafeReadBytesOffset(buffer, i - 1)) == s) {
return i - 1;
}
}
return type(uint256).max;
}
}
/**
* @dev Copies the content of `buffer`, from `start` (included) to the end of `buffer` into a new bytes object in
* memory.
*
* NOTE: replicates the behavior of https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/slice[Javascript's `Array.slice`]
*/
function slice(bytes memory buffer, uint256 start) internal pure returns (bytes memory) {
return slice(buffer, start, buffer.length);
}
/**
* @dev Copies the content of `buffer`, from `start` (included) to `end` (excluded) into a new bytes object in
* memory. The `end` argument is truncated to the length of the `buffer`.
*
* NOTE: replicates the behavior of https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/slice[Javascript's `Array.slice`]
*/
function slice(bytes memory buffer, uint256 start, uint256 end) internal pure returns (bytes memory) {
// sanitize
end = Math.min(end, buffer.length);
start = Math.min(start, end);
// allocate and copy
bytes memory result = new bytes(end - start);
assembly ("memory-safe") {
mcopy(add(result, 0x20), add(add(buffer, 0x20), start), sub(end, start))
}
return result;
}
/**
* @dev Moves the content of `buffer`, from `start` (included) to the end of `buffer` to the start of that buffer,
* and shrinks the buffer length accordingly, effectively overriding the content of buffer with buffer[start:].
*
* NOTE: This function modifies the provided buffer in place. If you need to preserve the original buffer, use {slice} instead
*/
function splice(bytes memory buffer, uint256 start) internal pure returns (bytes memory) {
return splice(buffer, start, buffer.length);
}
/**
* @dev Moves the content of `buffer`, from `start` (included) to `end` (excluded) to the start of that buffer,
* and shrinks the buffer length accordingly, effectively overriding the content of buffer with buffer[start:end].
* The `end` argument is truncated to the length of the `buffer`.
*
* NOTE: This function modifies the provided buffer in place. If you need to preserve the original buffer, use {slice} instead
*/
function splice(bytes memory buffer, uint256 start, uint256 end) internal pure returns (bytes memory) {
// sanitize
end = Math.min(end, buffer.length);
start = Math.min(start, end);
// move and resize
assembly ("memory-safe") {
mcopy(add(buffer, 0x20), add(add(buffer, 0x20), start), sub(end, start))
mstore(buffer, sub(end, start))
}
return buffer;
}
/**
* @dev Replaces bytes in `buffer` starting at `pos` with all bytes from `replacement`.
*
* Parameters are clamped to valid ranges (i.e. `pos` is clamped to `[0, buffer.length]`).
* If `pos >= buffer.length`, no replacement occurs and the buffer is returned unchanged.
*
* NOTE: This function modifies the provided buffer in place.
*/
function replace(bytes memory buffer, uint256 pos, bytes memory replacement) internal pure returns (bytes memory) {
return replace(buffer, pos, replacement, 0, replacement.length);
}
/**
* @dev Replaces bytes in `buffer` starting at `pos` with bytes from `replacement` starting at `offset`.
* Copies at most `length` bytes from `replacement` to `buffer`.
*
* Parameters are clamped to valid ranges (i.e. `pos` is clamped to `[0, buffer.length]`, `offset` is
* clamped to `[0, replacement.length]`, and `length` is clamped to `min(length, replacement.length - offset,
* buffer.length - pos))`. If `pos >= buffer.length` or `offset >= replacement.length`, no replacement occurs
* and the buffer is returned unchanged.
*
* NOTE: This function modifies the provided buffer in place.
*/
function replace(
bytes memory buffer,
uint256 pos,
bytes memory replacement,
uint256 offset,
uint256 length
) internal pure returns (bytes memory) {
// sanitize
pos = Math.min(pos, buffer.length);
offset = Math.min(offset, replacement.length);
length = Math.min(length, Math.min(replacement.length - offset, buffer.length - pos));
// replace
assembly ("memory-safe") {
mcopy(add(add(buffer, 0x20), pos), add(add(replacement, 0x20), offset), length)
}
return buffer;
}
/**
* @dev Concatenate an array of bytes into a single bytes object.
*
* For fixed bytes types, we recommend using the solidity built-in `bytes.concat` or (equivalent)
* `abi.encodePacked`.
*
* NOTE: this could be done in assembly with a single loop that expands starting at the FMP, but that would be
* significantly less readable. It might be worth benchmarking the savings of the full-assembly approach.
*/
function concat(bytes[] memory buffers) internal pure returns (bytes memory) {
uint256 length = 0;
for (uint256 i = 0; i < buffers.length; ++i) {
length += buffers[i].length;
}
bytes memory result = new bytes(length);
uint256 offset = 0x20;
for (uint256 i = 0; i < buffers.length; ++i) {
bytes memory input = buffers[i];
assembly ("memory-safe") {
mcopy(add(result, offset), add(input, 0x20), mload(input))
}
unchecked {
offset += input.length;
}
}
return result;
}
/**
* @dev Split each byte in `input` into two nibbles (4 bits each)
*
* Example: hex"01234567" → hex"0001020304050607"
*/
function toNibbles(bytes memory input) internal pure returns (bytes memory output) {
assembly ("memory-safe") {
let length := mload(input)
output := mload(0x40)
mstore(0x40, add(add(output, 0x20), mul(length, 2)))
mstore(output, mul(length, 2))
for {
let i := 0
} lt(i, length) {
i := add(i, 0x10)
} {
let chunk := shr(128, mload(add(add(input, 0x20), i)))
chunk := and(
0x0000000000000000ffffffffffffffff0000000000000000ffffffffffffffff,
or(shl(64, chunk), chunk)
)
chunk := and(
0x00000000ffffffff00000000ffffffff00000000ffffffff00000000ffffffff,
or(shl(32, chunk), chunk)
)
chunk := and(
0x0000ffff0000ffff0000ffff0000ffff0000ffff0000ffff0000ffff0000ffff,
or(shl(16, chunk), chunk)
)
chunk := and(
0x00ff00ff00ff00ff00ff00ff00ff00ff00ff00ff00ff00ff00ff00ff00ff00ff,
or(shl(8, chunk), chunk)
)
chunk := and(
0x0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f,
or(shl(4, chunk), chunk)
)
mstore(add(add(output, 0x20), mul(i, 2)), chunk)
}
}
}
/**
* @dev Returns true if the two byte buffers are equal.
*/
function equal(bytes memory a, bytes memory b) internal pure returns (bool) {
return a.length == b.length && keccak256(a) == keccak256(b);
}
/**
* @dev Reverses the byte order of a bytes32 value, converting between little-endian and big-endian.
* Inspired by https://graphics.stanford.edu/~seander/bithacks.html#ReverseParallel[Reverse Parallel]
*/
function reverseBytes32(bytes32 value) internal pure returns (bytes32) {
value = // swap bytes
((value >> 8) & 0x00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF) |
((value & 0x00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF) << 8);
value = // swap 2-byte long pairs
((value >> 16) & 0x0000FFFF0000FFFF0000FFFF0000FFFF0000FFFF0000FFFF0000FFFF0000FFFF) |
((value & 0x0000FFFF0000FFFF0000FFFF0000FFFF0000FFFF0000FFFF0000FFFF0000FFFF) << 16);
value = // swap 4-byte long pairs
((value >> 32) & 0x00000000FFFFFFFF00000000FFFFFFFF00000000FFFFFFFF00000000FFFFFFFF) |
((value & 0x00000000FFFFFFFF00000000FFFFFFFF00000000FFFFFFFF00000000FFFFFFFF) << 32);
value = // swap 8-byte long pairs
((value >> 64) & 0x0000000000000000FFFFFFFFFFFFFFFF0000000000000000FFFFFFFFFFFFFFFF) |
((value & 0x0000000000000000FFFFFFFFFFFFFFFF0000000000000000FFFFFFFFFFFFFFFF) << 64);
return (value >> 128) | (value << 128); // swap 16-byte long pairs
}
/// @dev Same as {reverseBytes32} but optimized for 128-bit values.
function reverseBytes16(bytes16 value) internal pure returns (bytes16) {
value = // swap bytes
((value & 0xFF00FF00FF00FF00FF00FF00FF00FF00) >> 8) |
((value & 0x00FF00FF00FF00FF00FF00FF00FF00FF) << 8);
value = // swap 2-byte long pairs
((value & 0xFFFF0000FFFF0000FFFF0000FFFF0000) >> 16) |
((value & 0x0000FFFF0000FFFF0000FFFF0000FFFF) << 16);
value = // swap 4-byte long pairs
((value & 0xFFFFFFFF00000000FFFFFFFF00000000) >> 32) |
((value & 0x00000000FFFFFFFF00000000FFFFFFFF) << 32);
return (value >> 64) | (value << 64); // swap 8-byte long pairs
}
/// @dev Same as {reverseBytes32} but optimized for 64-bit values.
function reverseBytes8(bytes8 value) internal pure returns (bytes8) {
value = ((value & 0xFF00FF00FF00FF00) >> 8) | ((value & 0x00FF00FF00FF00FF) << 8); // swap bytes
value = ((value & 0xFFFF0000FFFF0000) >> 16) | ((value & 0x0000FFFF0000FFFF) << 16); // swap 2-byte long pairs
return (value >> 32) | (value << 32); // swap 4-byte long pairs
}
/// @dev Same as {reverseBytes32} but optimized for 32-bit values.
function reverseBytes4(bytes4 value) internal pure returns (bytes4) {
value = ((value & 0xFF00FF00) >> 8) | ((value & 0x00FF00FF) << 8); // swap bytes
return (value >> 16) | (value << 16); // swap 2-byte long pairs
}
/// @dev Same as {reverseBytes32} but optimized for 16-bit values.
function reverseBytes2(bytes2 value) internal pure returns (bytes2) {
return (value >> 8) | (value << 8);
}
/**
* @dev Counts the number of leading zero bits a bytes array. Returns `8 * buffer.length`
* if the buffer is all zeros.
*/
function clz(bytes memory buffer) internal pure returns (uint256) {
for (uint256 i = 0; i < buffer.length; i += 0x20) {
bytes32 chunk = _unsafeReadBytesOffset(buffer, i);
if (chunk != bytes32(0)) {
return Math.min(8 * i + Math.clz(uint256(chunk)), 8 * buffer.length);
}
}
return 8 * buffer.length;
}
/**
* @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(add(buffer, 0x20), offset))
}
}
}
// OpenZeppelin Contracts (last updated v5.6.0) (utils/Strings.sol)
/**
* @dev String operations.
*/
library Strings {
using SafeCast for *;
bytes16 private constant HEX_DIGITS = "0123456789abcdef";
uint8 private constant ADDRESS_LENGTH = 20;
uint256 private constant SPECIAL_CHARS_LOOKUP =
0xffffffff | // first 32 bits corresponding to the control characters (U+0000 to U+001F)
(1 << 0x22) | // double quote
(1 << 0x5c); // backslash
/**
* @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(add(buffer, 0x20), 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 Converts a `bytes` buffer to its ASCII `string` hexadecimal representation.
*/
function toHexString(bytes memory input) internal pure returns (string memory) {
unchecked {
bytes memory buffer = new bytes(2 * input.length + 2);
buffer[0] = "0";
buffer[1] = "x";
for (uint256 i = 0; i < input.length; ++i) {
uint8 v = uint8(input[i]);
buffer[2 * i + 2] = HEX_DIGITS[v >> 4];
buffer[2 * i + 3] = HEX_DIGITS[v & 0xf];
}
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.equal(bytes(a), 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-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 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-string-uint256-uint256} 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-string-uint256-uint256} 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-string} 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-string-uint256-uint256} 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 guarantees 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-string} 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-string} 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-string-uint256-uint256} 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 Escape special characters in JSON strings. This can be useful to prevent JSON injection in NFT metadata.
*
* WARNING: This function should only be used in double quoted JSON strings. Single quotes are not escaped.
*
* NOTE: This function escapes backslashes (including those in \uXXXX sequences) and the characters in ranges
* defined in section 2.5 of RFC-4627 (U+0000 to U+001F, U+0022 and U+005C). All control characters in U+0000
* to U+001F are escaped (\b, \t, \n, \f, \r use short form; others use \u00XX). ECMAScript's `JSON.parse` does
* recover escaped unicode characters that are not in this range, but other tooling may provide different results.
*/
function escapeJSON(string memory input) internal pure returns (string memory) {
bytes memory buffer = bytes(input);
// Put output at the FMP. Memory will be reserved later when we figure out the actual length of the escaped
// string. All write are done using _unsafeWriteBytesOffset, which avoid the (expensive) length checks for
// each character written.
bytes memory output;
assembly ("memory-safe") {
output := mload(0x40)
}
uint256 outputLength = 0;
for (uint256 i = 0; i < buffer.length; ++i) {
uint8 char = uint8(bytes1(_unsafeReadBytesOffset(buffer, i)));
if (((SPECIAL_CHARS_LOOKUP & (1 << char)) != 0)) {
_unsafeWriteBytesOffset(output, outputLength++, "\\");
if (char == 0x08) _unsafeWriteBytesOffset(output, outputLength++, "b");
else if (char == 0x09) _unsafeWriteBytesOffset(output, outputLength++, "t");
else if (char == 0x0a) _unsafeWriteBytesOffset(output, outputLength++, "n");
else if (char == 0x0c) _unsafeWriteBytesOffset(output, outputLength++, "f");
else if (char == 0x0d) _unsafeWriteBytesOffset(output, outputLength++, "r");
else if (char == 0x5c) _unsafeWriteBytesOffset(output, outputLength++, "\\");
else if (char == 0x22) {
// solhint-disable-next-line quotes
_unsafeWriteBytesOffset(output, outputLength++, '"');
} else {
// U+0000 to U+001F without short form: output \u00XX
_unsafeWriteBytesOffset(output, outputLength++, "u");
_unsafeWriteBytesOffset(output, outputLength++, "0");
_unsafeWriteBytesOffset(output, outputLength++, "0");
_unsafeWriteBytesOffset(output, outputLength++, HEX_DIGITS[char >> 4]);
_unsafeWriteBytesOffset(output, outputLength++, HEX_DIGITS[char & 0x0f]);
}
} else {
_unsafeWriteBytesOffset(output, outputLength++, bytes1(char));
}
}
// write the actual length and reserve memory
assembly ("memory-safe") {
mstore(output, outputLength)
mstore(0x40, add(output, add(outputLength, 0x20)))
}
return string(output);
}
/**
* @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(add(buffer, 0x20), offset))
}
}
/**
* @dev Write a bytes1 to 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 _unsafeWriteBytesOffset(bytes memory buffer, uint256 offset, bytes1 value) private pure {
// This is not memory safe in the general case, but all calls to this private function are within bounds.
assembly ("memory-safe") {
mstore8(add(add(buffer, 0x20), offset), shr(248, value))
}
}
}
// OpenZeppelin Contracts (last updated v5.4.0) (utils/introspection/ERC165.sol)
/**
* @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 {
/// @inheritdoc IERC165
function supportsInterface(bytes4 interfaceId) public view virtual returns (bool) {
return interfaceId == type(IERC165).interfaceId;
}
}
// OpenZeppelin Contracts (last updated v5.6.0) (token/ERC721/ERC721.sol)
/**
* @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_;
}
/// @inheritdoc IERC165
function supportsInterface(bytes4 interfaceId) public view virtual override(ERC165, IERC165) returns (bool) {
return
interfaceId == type(IERC721).interfaceId ||
interfaceId == type(IERC721Metadata).interfaceId ||
super.supportsInterface(interfaceId);
}
/// @inheritdoc IERC721
function balanceOf(address owner) public view virtual returns (uint256) {
if (owner == address(0)) {
revert ERC721InvalidOwner(address(0));
}
return _balances[owner];
}
/// @inheritdoc IERC721
function ownerOf(uint256 tokenId) public view virtual returns (address) {
return _requireOwned(tokenId);
}
/// @inheritdoc IERC721Metadata
function name() public view virtual returns (string memory) {
return _name;
}
/// @inheritdoc IERC721Metadata
function symbol() public view virtual returns (string memory) {
return _symbol;
}
/// @inheritdoc IERC721Metadata
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 "";
}
/// @inheritdoc IERC721
function approve(address to, uint256 tokenId) public virtual {
_approve(to, tokenId, _msgSender());
}
/// @inheritdoc IERC721
function getApproved(uint256 tokenId) public view virtual returns (address) {
_requireOwned(tokenId);
return _getApproved(tokenId);
}
/// @inheritdoc IERC721
function setApprovalForAll(address operator, bool approved) public virtual {
_setApprovalForAll(_msgSender(), operator, approved);
}
/// @inheritdoc IERC721
function isApprovedForAll(address owner, address operator) public view virtual returns (bool) {
return _operatorApprovals[owner][operator];
}
/// @inheritdoc IERC721
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);
}
}
/// @inheritdoc IERC721
function safeTransferFrom(address from, address to, uint256 tokenId) public {
safeTransferFrom(from, to, tokenId, "");
}
/// @inheritdoc IERC721
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 (owner == address(0)) {
revert ERC721InvalidApprover(address(0));
}
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;
}
}
// OpenZeppelin Contracts (last updated v5.4.0) (interfaces/IERC2981.sol)
/**
* @dev Interface for the NFT Royalty Standard.
*
* A standardized way to retrieve royalty payment information for non-fungible tokens (NFTs) to enable universal
* support for royalty payments across all NFT marketplaces and ecosystem participants.
*/
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);
}
// OpenZeppelin Contracts (last updated v5.4.0) (token/common/ERC2981.sol)
/**
* @dev Implementation of the NFT Royalty Standard, a standardized way to retrieve royalty payment information.
*
* Royalty information can be specified globally for all token ids via {_setDefaultRoyalty}, and/or individually for
* specific token ids via {_setTokenRoyalty}. The latter takes precedence over the first.
*
* Royalty is specified as a fraction of sale price. {_feeDenominator} is overridable but defaults to 10000, meaning the
* fee is specified in basis points by default.
*
* IMPORTANT: ERC-2981 only specifies a way to signal royalty information and does not enforce its payment. See
* https://eips.ethereum.org/EIPS/eip-2981#optional-royalty-payments[Rationale] in the 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 a 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);
/// @inheritdoc IERC165
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];
}
}
// OpenZeppelin Contracts (last updated v5.0.0) (access/Ownable.sol)
/**
* @dev Contract module which provides a basic access control mechanism, where
* there is an account (an owner) that can be granted exclusive access to
* specific functions.
*
* 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);
}
}
// OpenZeppelin Contracts (last updated v5.6.0) (utils/Base64.sol)
/**
* @dev Provides a set of functions to operate with Base64 strings.
*/
library Base64 {
using SafeCast for bool;
error InvalidBase64Char(bytes1);
/**
* @dev Converts a `bytes` to its Base64 `string` representation.
*/
function encode(bytes memory data) internal pure returns (string memory) {
return string(_encode(data, false));
}
/**
* @dev Converts a `bytes` to its Base64Url `string` representation.
* Output is not padded with `=` as specified in https://www.rfc-editor.org/rfc/rfc4648[rfc4648].
*/
function encodeURL(bytes memory data) internal pure returns (string memory) {
return string(_encode(data, true));
}
/**
* @dev Converts a Base64 `string` to the `bytes` it represents.
*
* * Supports padded and unpadded inputs.
* * Supports both encoding ({encode} and {encodeURL}) seamlessly.
* * Reverts with {InvalidBase64Char} if the input contains an invalid character.
*/
function decode(string memory data) internal pure returns (bytes memory) {
return _decode(bytes(data));
}
/**
* @dev Internal table-agnostic encoding
*
* Padding is enabled when using the Base64 table, and disabled when using the Base64Url table.
* See sections 4 and 5 of https://datatracker.ietf.org/doc/html/rfc4648
*/
function _encode(bytes memory data, bool urlAndFilenameSafe) private pure returns (bytes memory result) {
/**
* Inspired by Brecht Devos (Brechtpd) implementation - MIT license
* https://github.com/Brechtpd/base64/blob/e78d9fd951e7b0977ddca77d92dc85183770daf4/base64.sol
*/
if (data.length == 0) return "";
// Padding is enabled by default, but disabled when the "urlAndFilenameSafe" alphabet is used
//
// If padding is enabled, the final length should be `bytes` data length divided by 3 rounded up and then
// multiplied by 4 so that it leaves room for padding the last chunk
// - `data.length + 2` -> Prepare for division rounding up
// - `/ 3` -> Number of 3-bytes chunks (rounded up)
// - `4 *` -> 4 characters for each chunk
// This is equivalent to: 4 * Math.ceil(data.length / 3)
//
// If padding is disabled, the final length should be `bytes` data length multiplied by 4/3 rounded up as
// opposed to when padding is required to fill the last chunk.
// - `4 * data.length` -> 4 characters for each chunk
// - ` + 2` -> Prepare for division rounding up
// - `/ 3` -> Number of 3-bytes chunks (rounded up)
// This is equivalent to: Math.ceil((4 * data.length) / 3)
uint256 resultLength = urlAndFilenameSafe ? (4 * data.length + 2) / 3 : 4 * ((data.length + 2) / 3);
assembly ("memory-safe") {
result := mload(0x40)
// Store the encoding table in the scratch space (and fmp ptr) to avoid memory allocation
//
// Base64 (ascii) A B C D E F G H I J K L M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m n o p q r s t u v w x y z 0 1 2 3 4 5 6 7 8 9 + /
// Base64 (hex) 4142434445464748494a4b4c4d4e4f505152535455565758595a6162636465666768696a6b6c6d6e6f707172737475767778797a303132333435363738392b2f
// Base64Url (ascii) A B C D E F G H I J K L M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m n o p q r s t u v w x y z 0 1 2 3 4 5 6 7 8 9 - _
// Base64Url (hex) 4142434445464748494a4b4c4d4e4f505152535455565758595a6162636465666768696a6b6c6d6e6f707172737475767778797a303132333435363738392d5f
// xor (hex) 00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000670
mstore(0x1f, "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdef")
mstore(0x3f, xor("ghijklmnopqrstuvwxyz0123456789+/", mul(urlAndFilenameSafe, 0x670)))
// Prepare result pointer, jump over length
let resultPtr := add(result, 0x20)
let resultEnd := add(resultPtr, resultLength)
let dataPtr := data
let endPtr := add(data, mload(data))
// In some cases, the last iteration will read bytes after the end of the data. We cache the value, and
// set it to zero to make sure no dirty bytes are read in that section.
let afterPtr := add(endPtr, 0x20)
let afterCache := mload(afterPtr)
mstore(afterPtr, 0x00)
// Run over the input, 3 bytes at a time
for {} lt(dataPtr, endPtr) {} {
// Advance 3 bytes
dataPtr := add(dataPtr, 3)
let input := mload(dataPtr)
// To write each character, shift the 3 byte (24 bits) chunk
// 4 times in blocks of 6 bits for each character (18, 12, 6, 0)
// and apply logical AND with 0x3F to bitmask the least significant 6 bits.
// Use this as an index into the lookup table, mload an entire word
// so the desired character is in the least significant byte, and
// mstore8 this least significant byte into the result and continue.
mstore8(resultPtr, mload(and(shr(18, input), 0x3F)))
resultPtr := add(resultPtr, 1) // Advance
mstore8(resultPtr, mload(and(shr(12, input), 0x3F)))
resultPtr := add(resultPtr, 1) // Advance
mstore8(resultPtr, mload(and(shr(6, input), 0x3F)))
resultPtr := add(resultPtr, 1) // Advance
mstore8(resultPtr, mload(and(input, 0x3F)))
resultPtr := add(resultPtr, 1) // Advance
}
// Reset the value that was cached
mstore(afterPtr, afterCache)
if iszero(urlAndFilenameSafe) {
// When data `bytes` is not exactly 3 bytes long
// it is padded with `=` characters at the end
switch mod(mload(data), 3)
case 1 {
mstore8(sub(resultPtr, 1), 0x3d)
mstore8(sub(resultPtr, 2), 0x3d)
}
case 2 {
mstore8(sub(resultPtr, 1), 0x3d)
}
}
// Store result length and update FMP to reserve allocated space
mstore(result, resultLength)
mstore(0x40, resultEnd)
}
}
/**
* @dev Internal decoding
*/
function _decode(bytes memory data) private pure returns (bytes memory result) {
bytes4 errorSelector = InvalidBase64Char.selector;
uint256 dataLength = data.length;
if (dataLength == 0) return "";
uint256 resultLength = (dataLength / 4) * 3;
if (dataLength % 4 == 0) {
resultLength -= (data[dataLength - 1] == "=").toUint() + (data[dataLength - 2] == "=").toUint();
} else {
resultLength += (dataLength % 4) - 1;
}
assembly ("memory-safe") {
result := mload(0x40)
// Temporarily store the reverse lookup table between in memory. This spans from 0x00 to 0x50, Using:
// - all 64bytes of scratch space
// - part of the FMP (at location 0x40)
mstore(0x30, 0x2425262728292a2b2c2d2e2f30313233)
mstore(0x20, 0x0a0b0c0d0e0f10111213141516171819ffffffff3fff1a1b1c1d1e1f20212223)
mstore(0x00, 0x3eff3eff3f3435363738393a3b3c3dffffff00ffffff00010203040506070809)
// Prepare result pointer, jump over length
let dataPtr := data
let resultPtr := add(result, 0x20)
let endPtr := add(resultPtr, resultLength)
// In some cases, the last iteration will read bytes after the end of the data. We cache the value, and
// set it to "==" (fake padding) to make sure no dirty bytes are read in that section.
let afterPtr := add(add(data, 0x20), dataLength)
let afterCache := mload(afterPtr)
mstore(afterPtr, shl(240, 0x3d3d))
// loop while not everything is decoded
for {} lt(resultPtr, endPtr) {} {
dataPtr := add(dataPtr, 4)
// Read a 4 bytes chunk of data
let input := mload(dataPtr)
// Decode each byte in the chunk as a 6 bit block, and align them to form a block of 3 bytes
let a := sub(byte(28, input), 43)
// slither-disable-next-line incorrect-shift
if iszero(and(shl(a, 1), 0xffffffd0ffffffc47ff5)) {
mstore(0, errorSelector)
mstore(4, shl(248, add(a, 43)))
revert(0, 0x24)
}
let b := sub(byte(29, input), 43)
// slither-disable-next-line incorrect-shift
if iszero(and(shl(b, 1), 0xffffffd0ffffffc47ff5)) {
mstore(0, errorSelector)
mstore(4, shl(248, add(b, 43)))
revert(0, 0x24)
}
let c := sub(byte(30, input), 43)
// slither-disable-next-line incorrect-shift
if iszero(and(shl(c, 1), 0xffffffd0ffffffc47ff5)) {
mstore(0, errorSelector)
mstore(4, shl(248, add(c, 43)))
revert(0, 0x24)
}
let d := sub(byte(31, input), 43)
// slither-disable-next-line incorrect-shift
if iszero(and(shl(d, 1), 0xffffffd0ffffffc47ff5)) {
mstore(0, errorSelector)
mstore(4, shl(248, add(d, 43)))
revert(0, 0x24)
}
mstore(
resultPtr,
or(
or(shl(250, byte(0, mload(a))), shl(244, byte(0, mload(b)))),
or(shl(238, byte(0, mload(c))), shl(232, byte(0, mload(d))))
)
)
resultPtr := add(resultPtr, 3)
}
// Reset the value that was cached
mstore(afterPtr, afterCache)
// Store result length and update FMP to reserve allocated space
mstore(result, resultLength)
mstore(0x40, endPtr)
}
}
}
/**
* Terminals — 3333 fully on-chain generative CRT creatures.
*
* 画像もメタデータも完全にオンチェーン。外部ホスティングに依存しないため
* サイトが消えても作品は残る。
*
* seed = keccak256(前ブロックのhash, tokenId, ミント者) から各パーツを決定。
*/
contract Terminals is ERC721, ERC2981, Ownable {
using Strings for uint256;
uint256 public constant MAX_SUPPLY = 3333;
uint256 public constant MAX_PER_WALLET = 1;
uint256 public totalSupply;
bool public mintOpen = true;
mapping(uint256 => bytes32) private _seed;
mapping(address => uint256) public minted;
error SoldOut();
error MintClosed();
error AlreadyMinted();
error NoContracts();
constructor(address royaltyReceiver)
ERC721("Terminals", "TERM")
Ownable(msg.sender)
{
// 2.5% royalty (250 / 10000)
_setDefaultRoyalty(royaltyReceiver, 250);
}
// ------------------------------------------------------------------
// Mint
// ------------------------------------------------------------------
function mint() external {
if (!mintOpen) revert MintClosed();
if (totalSupply >= MAX_SUPPLY) revert SoldOut();
if (minted[msg.sender] >= MAX_PER_WALLET) revert AlreadyMinted();
unchecked {
uint256 id = ++totalSupply;
minted[msg.sender] += 1;
_seed[id] = keccak256(
abi.encodePacked(blockhash(block.number - 1), id, msg.sender)
);
_safeMint(msg.sender, id);
}
}
function setMintOpen(bool open) external onlyOwner {
mintOpen = open;
}
function setRoyalty(address receiver, uint96 feeNumerator) external onlyOwner {
_setDefaultRoyalty(receiver, feeNumerator);
}
// ------------------------------------------------------------------
// Traits
// ------------------------------------------------------------------
function _bits(bytes32 s, uint256 byteIndex) private pure returns (uint256) {
return uint256(uint8(s[byteIndex]));
}
struct Traits {
uint8 chassis;
uint8 phosphor;
uint8 backdrop;
uint8 eyes;
uint8 mouth;
uint8 antenna;
bool stat;
int256 tilt;
}
function traitsOf(uint256 id) public view returns (Traits memory t) {
bytes32 s = _seed[id];
t.chassis = uint8(_bits(s, 0) % 6);
t.phosphor = uint8(_bits(s, 1) % 6);
t.backdrop = uint8(_bits(s, 2) % 6);
t.eyes = uint8(_bits(s, 3) % 6);
t.mouth = uint8(_bits(s, 4) % 6);
t.antenna = uint8(_bits(s, 5) % 5);
t.stat = _bits(s, 6) < 20; // 約7.8%
t.tilt = int256(_bits(s, 7) % 9) - 4; // -4〜+4
}
// --- パレット ---
function _chassis(uint8 i) private pure returns (string memory nm, string memory c, string memory d) {
if (i == 0) return ("Bone", "#E8E2D4", "#C4BCA8");
if (i == 1) return ("Graphite", "#3A3A3E", "#26262A");
if (i == 2) return ("Rust", "#A85434", "#7E3D26");
if (i == 3) return ("Sea", "#3F6E6B", "#2C4F4D");
if (i == 4) return ("Plum", "#6B4562", "#4E3148");
return ("Sand", "#C9A574", "#A38356");
}
function _phosphor(uint8 i) private pure returns (string memory nm, string memory c) {
if (i == 0) return ("Amber", "#FFB13B");
if (i == 1) return ("Green", "#5BE58A");
if (i == 2) return ("Cyan", "#61D6E8");
if (i == 3) return ("Rose", "#FF7A9C");
if (i == 4) return ("Violet", "#B58CFF");
return ("Paper", "#F2EFE6");
}
function _backdrop(uint8 i) private pure returns (string memory nm, string memory c) {
if (i == 0) return ("Cream", "#EDE6D6");
if (i == 1) return ("Dust", "#D9C7C0");
if (i == 2) return ("Sky", "#BFD3DE");
if (i == 3) return ("Lichen", "#C6CFB4");
if (i == 4) return ("Butter", "#EFD9A3");
return ("Blush", "#E5BFC4");
}
function _eyeName(uint8 i) private pure returns (string memory) {
string[6] memory n = ["Dot", "Wide", "Sleepy", "Cross", "Ring", "Scan"];
return n[i];
}
function _mouthName(uint8 i) private pure returns (string memory) {
string[6] memory n = ["Line", "Grin", "Oh", "Wave", "Grid", "None"];
return n[i];
}
function _antName(uint8 i) private pure returns (string memory) {
string[5] memory n = ["None", "Single", "Twin", "Loop", "Rabbit"];
return n[i];
}
// ------------------------------------------------------------------
// SVG
// ------------------------------------------------------------------
function _eyes(uint8 k, string memory c) private pure returns (string memory) {
if (k == 0)
return string.concat('<circle cx="185" cy="228" r="11" fill="', c,
'"/><circle cx="265" cy="228" r="11" fill="', c, '"/>');
if (k == 1)
return string.concat('<rect x="168" y="212" width="34" height="34" rx="4" fill="', c,
'"/><rect x="248" y="212" width="34" height="34" rx="4" fill="', c, '"/>');
if (k == 2)
return string.concat('<rect x="168" y="226" width="34" height="7" rx="3.5" fill="', c,
'"/><rect x="248" y="226" width="34" height="7" rx="3.5" fill="', c, '"/>');
if (k == 3)
return string.concat('<g stroke="', c,
'" stroke-width="7" stroke-linecap="round"><path d="M172 214 L200 242 M200 214 L172 242"/>',
'<path d="M252 214 L280 242 M280 214 L252 242"/></g>');
if (k == 4)
return string.concat('<g fill="none" stroke="', c,
'" stroke-width="6"><circle cx="185" cy="228" r="15"/><circle cx="265" cy="228" r="15"/></g>');
return string.concat('<rect x="160" y="224" width="130" height="9" rx="4.5" fill="', c, '"/>');
}
function _mouth(uint8 k, string memory c) private pure returns (string memory) {
if (k == 0)
return string.concat('<rect x="200" y="284" width="50" height="7" rx="3.5" fill="', c, '"/>');
if (k == 1)
return string.concat('<path d="M196 278 Q225 306 254 278" fill="none" stroke="', c,
'" stroke-width="7" stroke-linecap="round"/>');
if (k == 2)
return string.concat('<circle cx="225" cy="288" r="15" fill="none" stroke="', c, '" stroke-width="6"/>');
if (k == 3)
return string.concat('<path d="M192 288 q11 -12 22 0 t22 0 t22 0" fill="none" stroke="', c,
'" stroke-width="6" stroke-linecap="round"/>');
if (k == 4)
return string.concat('<rect x="196" y="278" width="58" height="20" rx="3" fill="', c,
'"/><g stroke="#00000055" stroke-width="3"><path d="M215 278 V298 M235 278 V298 M196 288 H254"/></g>');
return "";
}
function _antenna(uint8 k, string memory caseC, string memory glow)
private pure returns (string memory)
{
if (k == 0) return "";
string memory s = string.concat('stroke="', caseC,
'" stroke-width="8" stroke-linecap="round" fill="none"');
if (k == 1)
return string.concat('<path d="M225 132 V92" ', s, '/><circle cx="225" cy="84" r="12" fill="', glow, '"/>');
if (k == 2)
return string.concat('<path d="M190 132 V100 M260 132 V100" ', s,
'/><circle cx="190" cy="92" r="9" fill="', glow,
'"/><circle cx="260" cy="92" r="9" fill="', glow, '"/>');
if (k == 3)
return string.concat('<path d="M225 132 V104" ', s,
'/><circle cx="225" cy="88" r="17" fill="none" stroke="', glow, '" stroke-width="7"/>');
return string.concat('<path d="M196 134 L170 88 M254 134 L280 88" ', s,
'/><circle cx="170" cy="82" r="9" fill="', glow,
'"/><circle cx="280" cy="82" r="9" fill="', glow, '"/>');
}
function _scanlines() private pure returns (string memory out) {
out = '<g fill="#000000" fill-opacity="0.16">';
for (uint256 i = 0; i < 24; i++) {
out = string.concat(out, '<rect x="146" y="',
(158 + i * 6).toString(), '" width="158" height="3"/>');
}
out = string.concat(out, "</g>");
}
function _static(string memory glow) private pure returns (string memory out) {
out = string.concat('<g fill="', glow, '" fill-opacity="0.14">');
for (uint256 i = 0; i < 8; i++) {
out = string.concat(out, '<rect x="146" y="',
(164 + i * 18).toString(), '" width="158" height="6"/>');
}
out = string.concat(out, "</g>");
}
function _tiltStr(int256 t) private pure returns (string memory) {
if (t < 0) return string.concat("-", uint256(-t).toString());
return uint256(t).toString();
}
function renderSVG(uint256 id) public view returns (string memory) {
Traits memory t = traitsOf(id);
(, string memory caseC, string memory caseD) = _chassis(t.chassis);
(, string memory glow) = _phosphor(t.phosphor);
(, string memory bg) = _backdrop(t.backdrop);
string memory head = string.concat(
'<svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 450 450" width="450" height="450">',
'<rect width="450" height="450" fill="', bg, '"/>',
'<ellipse cx="225" cy="404" rx="116" ry="16" fill="#00000030"/>',
'<g transform="rotate(', _tiltStr(t.tilt), ' 225 250)">',
'<rect x="196" y="360" width="18" height="30" rx="6" fill="', caseD, '"/>',
'<rect x="236" y="360" width="18" height="30" rx="6" fill="', caseD, '"/>',
'<rect x="176" y="330" width="98" height="42" rx="14" fill="', caseD, '"/>'
);
string memory body = string.concat(
'<rect x="120" y="132" width="210" height="200" rx="30" fill="', caseC, '"/>',
'<rect x="120" y="132" width="210" height="200" rx="30" fill="none" stroke="', caseD,
'" stroke-width="6"/>',
'<rect x="146" y="158" width="158" height="148" rx="18" fill="#10131A"/>',
'<rect x="146" y="158" width="158" height="148" rx="18" fill="none" stroke="', glow,
'" stroke-opacity="0.25" stroke-width="3"/>'
);
return string.concat(
head, body,
_eyes(t.eyes, glow),
_mouth(t.mouth, glow),
t.stat ? _static(glow) : "",
_scanlines(),
_antenna(t.antenna, caseC, glow),
'<circle cx="225" cy="320" r="5" fill="', glow, '"/></g></svg>'
);
}
// ------------------------------------------------------------------
// Metadata
// ------------------------------------------------------------------
function _attributes(uint256 id) private view returns (string memory) {
Traits memory t = traitsOf(id);
(string memory cn,,) = _chassis(t.chassis);
(string memory pn,) = _phosphor(t.phosphor);
(string memory bn,) = _backdrop(t.backdrop);
return string.concat(
'[{"trait_type":"Chassis","value":"', cn,
'"},{"trait_type":"Phosphor","value":"', pn,
'"},{"trait_type":"Backdrop","value":"', bn,
'"},{"trait_type":"Eyes","value":"', _eyeName(t.eyes),
'"},{"trait_type":"Mouth","value":"', _mouthName(t.mouth),
'"},{"trait_type":"Antenna","value":"', _antName(t.antenna),
'"},{"trait_type":"Signal","value":"', t.stat ? "Static" : "Clear", '"}]'
);
}
function tokenURI(uint256 id) public view override returns (string memory) {
_requireOwned(id);
string memory json = string.concat(
'{"name":"Terminal #', id.toString(),
'","description":"A small CRT creature, generated and stored entirely on Robinhood Chain. ',
'No servers, no IPFS - the image lives in the contract.","image":"data:image/svg+xml;base64,',
Base64.encode(bytes(renderSVG(id))),
'","attributes":', _attributes(id), '}'
);
return string.concat("data:application/json;base64,", Base64.encode(bytes(json)));
}
// コレクション情報(OpenSea等が参照)
function contractURI() public pure returns (string memory) {
string memory json = '{"name":"Terminals","description":"3333 small CRT creatures, fully on-chain on Robinhood Chain.","seller_fee_basis_points":250}';
return string.concat("data:application/json;base64,", Base64.encode(bytes(json)));
}
function supportsInterface(bytes4 iid) public view override(ERC721, ERC2981) returns (bool) {
return super.supportsInterface(iid);
}
}[
{
"type": "constructor",
"inputs": [
{
"name": "royaltyReceiver",
"type": "address",
"internalType": "address"
}
],
"stateMutability": "nonpayable"
},
{
"name": "AlreadyMinted",
"type": "error",
"inputs": []
},
{
"name": "ERC2981InvalidDefaultRoyalty",
"type": "error",
"inputs": [
{
"name": "numerator",
"type": "uint256",
"internalType": "uint256"
},
{
"name": "denominator",
"type": "uint256",
"internalType": "uint256"
}
]
},
{
"name": "ERC2981InvalidDefaultRoyaltyReceiver",
"type": "error",
"inputs": [
{
"name": "receiver",
"type": "address",
"internalType": "address"
}
]
},
{
"name": "ERC2981InvalidTokenRoyalty",
"type": "error",
"inputs": [
{
"name": "tokenId",
"type": "uint256",
"internalType": "uint256"
},
{
"name": "numerator",
"type": "uint256",
"internalType": "uint256"
},
{
"name": "denominator",
"type": "uint256",
"internalType": "uint256"
}
]
},
{
"name": "ERC2981InvalidTokenRoyaltyReceiver",
"type": "error",
"inputs": [
{
"name": "tokenId",
"type": "uint256",
"internalType": "uint256"
},
{
"name": "receiver",
"type": "address",
"internalType": "address"
}
]
},
{
"name": "ERC721IncorrectOwner",
"type": "error",
"inputs": [
{
"name": "sender",
"type": "address",
"internalType": "address"
},
{
"name": "tokenId",
"type": "uint256",
"internalType": "uint256"
},
{
"name": "owner",
"type": "address",
"internalType": "address"
}
]
},
{
"name": "ERC721InsufficientApproval",
"type": "error",
"inputs": [
{
"name": "operator",
"type": "address",
"internalType": "address"
},
{
"name": "tokenId",
"type": "uint256",
"internalType": "uint256"
}
]
},
{
"name": "ERC721InvalidApprover",
"type": "error",
"inputs": [
{
"name": "approver",
"type": "address",
"internalType": "address"
}
]
},
{
"name": "ERC721InvalidOperator",
"type": "error",
"inputs": [
{
"name": "operator",
"type": "address",
"internalType": "address"
}
]
},
{
"name": "ERC721InvalidOwner",
"type": "error",
"inputs": [
{
"name": "owner",
"type": "address",
"internalType": "address"
}
]
},
{
"name": "ERC721InvalidReceiver",
"type": "error",
"inputs": [
{
"name": "receiver",
"type": "address",
"internalType": "address"
}
]
},
{
"name": "ERC721InvalidSender",
"type": "error",
"inputs": [
{
"name": "sender",
"type": "address",
"internalType": "address"
}
]
},
{
"name": "ERC721NonexistentToken",
"type": "error",
"inputs": [
{
"name": "tokenId",
"type": "uint256",
"internalType": "uint256"
}
]
},
{
"name": "MintClosed",
"type": "error",
"inputs": []
},
{
"name": "NoContracts",
"type": "error",
"inputs": []
},
{
"name": "OwnableInvalidOwner",
"type": "error",
"inputs": [
{
"name": "owner",
"type": "address",
"internalType": "address"
}
]
},
{
"name": "OwnableUnauthorizedAccount",
"type": "error",
"inputs": [
{
"name": "account",
"type": "address",
"internalType": "address"
}
]
},
{
"name": "SoldOut",
"type": "error",
"inputs": []
},
{
"name": "Approval",
"type": "event",
"inputs": [
{
"name": "owner",
"type": "address",
"indexed": true,
"internalType": "address"
},
{
"name": "approved",
"type": "address",
"indexed": true,
"internalType": "address"
},
{
"name": "tokenId",
"type": "uint256",
"indexed": true,
"internalType": "uint256"
}
],
"anonymous": false
},
{
"name": "ApprovalForAll",
"type": "event",
"inputs": [
{
"name": "owner",
"type": "address",
"indexed": true,
"internalType": "address"
},
{
"name": "operator",
"type": "address",
"indexed": true,
"internalType": "address"
},
{
"name": "approved",
"type": "bool",
"indexed": false,
"internalType": "bool"
}
],
"anonymous": false
},
{
"name": "OwnershipTransferred",
"type": "event",
"inputs": [
{
"name": "previousOwner",
"type": "address",
"indexed": true,
"internalType": "address"
},
{
"name": "newOwner",
"type": "address",
"indexed": true,
"internalType": "address"
}
],
"anonymous": false
},
{
"name": "Transfer",
"type": "event",
"inputs": [
{
"name": "from",
"type": "address",
"indexed": true,
"internalType": "address"
},
{
"name": "to",
"type": "address",
"indexed": true,
"internalType": "address"
},
{
"name": "tokenId",
"type": "uint256",
"indexed": true,
"internalType": "uint256"
}
],
"anonymous": false
},
{
"name": "MAX_PER_WALLET",
"type": "function",
"inputs": [],
"outputs": [
{
"name": "",
"type": "uint256",
"internalType": "uint256"
}
],
"stateMutability": "view"
},
{
"name": "MAX_SUPPLY",
"type": "function",
"inputs": [],
"outputs": [
{
"name": "",
"type": "uint256",
"internalType": "uint256"
}
],
"stateMutability": "view"
},
{
"name": "approve",
"type": "function",
"inputs": [
{
"name": "to",
"type": "address",
"internalType": "address"
},
{
"name": "tokenId",
"type": "uint256",
"internalType": "uint256"
}
],
"outputs": [],
"stateMutability": "nonpayable"
},
{
"name": "balanceOf",
"type": "function",
"inputs": [
{
"name": "owner",
"type": "address",
"internalType": "address"
}
],
"outputs": [
{
"name": "",
"type": "uint256",
"internalType": "uint256"
}
],
"stateMutability": "view"
},
{
"name": "contractURI",
"type": "function",
"inputs": [],
"outputs": [
{
"name": "",
"type": "string",
"internalType": "string"
}
],
"stateMutability": "pure"
},
{
"name": "getApproved",
"type": "function",
"inputs": [
{
"name": "tokenId",
"type": "uint256",
"internalType": "uint256"
}
],
"outputs": [
{
"name": "",
"type": "address",
"internalType": "address"
}
],
"stateMutability": "view"
},
{
"name": "isApprovedForAll",
"type": "function",
"inputs": [
{
"name": "owner",
"type": "address",
"internalType": "address"
},
{
"name": "operator",
"type": "address",
"internalType": "address"
}
],
"outputs": [
{
"name": "",
"type": "bool",
"internalType": "bool"
}
],
"stateMutability": "view"
},
{
"name": "mint",
"type": "function",
"inputs": [],
"outputs": [],
"stateMutability": "nonpayable"
},
{
"name": "mintOpen",
"type": "function",
"inputs": [],
"outputs": [
{
"name": "",
"type": "bool",
"internalType": "bool"
}
],
"stateMutability": "view"
},
{
"name": "minted",
"type": "function",
"inputs": [
{
"name": "",
"type": "address",
"internalType": "address"
}
],
"outputs": [
{
"name": "",
"type": "uint256",
"internalType": "uint256"
}
],
"stateMutability": "view"
},
{
"name": "name",
"type": "function",
"inputs": [],
"outputs": [
{
"name": "",
"type": "string",
"internalType": "string"
}
],
"stateMutability": "view"
},
{
"name": "owner",
"type": "function",
"inputs": [],
"outputs": [
{
"name": "",
"type": "address",
"internalType": "address"
}
],
"stateMutability": "view"
},
{
"name": "ownerOf",
"type": "function",
"inputs": [
{
"name": "tokenId",
"type": "uint256",
"internalType": "uint256"
}
],
"outputs": [
{
"name": "",
"type": "address",
"internalType": "address"
}
],
"stateMutability": "view"
},
{
"name": "renderSVG",
"type": "function",
"inputs": [
{
"name": "id",
"type": "uint256",
"internalType": "uint256"
}
],
"outputs": [
{
"name": "",
"type": "string",
"internalType": "string"
}
],
"stateMutability": "view"
},
{
"name": "renounceOwnership",
"type": "function",
"inputs": [],
"outputs": [],
"stateMutability": "nonpayable"
},
{
"name": "royaltyInfo",
"type": "function",
"inputs": [
{
"name": "tokenId",
"type": "uint256",
"internalType": "uint256"
},
{
"name": "salePrice",
"type": "uint256",
"internalType": "uint256"
}
],
"outputs": [
{
"name": "receiver",
"type": "address",
"internalType": "address"
},
{
"name": "amount",
"type": "uint256",
"internalType": "uint256"
}
],
"stateMutability": "view"
},
{
"name": "safeTransferFrom",
"type": "function",
"inputs": [
{
"name": "from",
"type": "address",
"internalType": "address"
},
{
"name": "to",
"type": "address",
"internalType": "address"
},
{
"name": "tokenId",
"type": "uint256",
"internalType": "uint256"
}
],
"outputs": [],
"stateMutability": "nonpayable"
},
{
"name": "safeTransferFrom",
"type": "function",
"inputs": [
{
"name": "from",
"type": "address",
"internalType": "address"
},
{
"name": "to",
"type": "address",
"internalType": "address"
},
{
"name": "tokenId",
"type": "uint256",
"internalType": "uint256"
},
{
"name": "data",
"type": "bytes",
"internalType": "bytes"
}
],
"outputs": [],
"stateMutability": "nonpayable"
},
{
"name": "setApprovalForAll",
"type": "function",
"inputs": [
{
"name": "operator",
"type": "address",
"internalType": "address"
},
{
"name": "approved",
"type": "bool",
"internalType": "bool"
}
],
"outputs": [],
"stateMutability": "nonpayable"
},
{
"name": "setMintOpen",
"type": "function",
"inputs": [
{
"name": "open",
"type": "bool",
"internalType": "bool"
}
],
"outputs": [],
"stateMutability": "nonpayable"
},
{
"name": "setRoyalty",
"type": "function",
"inputs": [
{
"name": "receiver",
"type": "address",
"internalType": "address"
},
{
"name": "feeNumerator",
"type": "uint96",
"internalType": "uint96"
}
],
"outputs": [],
"stateMutability": "nonpayable"
},
{
"name": "supportsInterface",
"type": "function",
"inputs": [
{
"name": "iid",
"type": "bytes4",
"internalType": "bytes4"
}
],
"outputs": [
{
"name": "",
"type": "bool",
"internalType": "bool"
}
],
"stateMutability": "view"
},
{
"name": "symbol",
"type": "function",
"inputs": [],
"outputs": [
{
"name": "",
"type": "string",
"internalType": "string"
}
],
"stateMutability": "view"
},
{
"name": "tokenURI",
"type": "function",
"inputs": [
{
"name": "id",
"type": "uint256",
"internalType": "uint256"
}
],
"outputs": [
{
"name": "",
"type": "string",
"internalType": "string"
}
],
"stateMutability": "view"
},
{
"name": "totalSupply",
"type": "function",
"inputs": [],
"outputs": [
{
"name": "",
"type": "uint256",
"internalType": "uint256"
}
],
"stateMutability": "view"
},
{
"name": "traitsOf",
"type": "function",
"inputs": [
{
"name": "id",
"type": "uint256",
"internalType": "uint256"
}
],
"outputs": [
{
"name": "t",
"type": "tuple",
"components": [
{
"name": "chassis",
"type": "uint8",
"internalType": "uint8"
},
{
"name": "phosphor",
"type": "uint8",
"internalType": "uint8"
},
{
"name": "backdrop",
"type": "uint8",
"internalType": "uint8"
},
{
"name": "eyes",
"type": "uint8",
"internalType": "uint8"
},
{
"name": "mouth",
"type": "uint8",
"internalType": "uint8"
},
{
"name": "antenna",
"type": "uint8",
"internalType": "uint8"
},
{
"name": "stat",
"type": "bool",
"internalType": "bool"
},
{
"name": "tilt",
"type": "int256",
"internalType": "int256"
}
],
"internalType": "struct Terminals.Traits"
}
],
"stateMutability": "view"
},
{
"name": "transferFrom",
"type": "function",
"inputs": [
{
"name": "from",
"type": "address",
"internalType": "address"
},
{
"name": "to",
"type": "address",
"internalType": "address"
},
{
"name": "tokenId",
"type": "uint256",
"internalType": "uint256"
}
],
"outputs": [],
"stateMutability": "nonpayable"
},
{
"name": "transferOwnership",
"type": "function",
"inputs": [
{
"name": "newOwner",
"type": "address",
"internalType": "address"
}
],
"outputs": [],
"stateMutability": "nonpayable"
}
]0x6080604052346103f957613cf86020813803918261001c816103fd565b9384928339810103126103f957516001600160a01b038116908190036103f95761004660406103fd565b9060098252685465726d696e616c7360b81b602083015261006760406103fd565b60048152635445524d60e01b602082015282519091906001600160401b0381116101e4575f54600181811c911680156103ef575b60208210146102f857601f8111610382575b506020601f821160011461032157819293945f92610316575b50508160011b915f199060031b1c1916175f555b81516001600160401b0381116101e457600154600181811c9116801561030c575b60208210146102f857601f811161028a575b50602092601f821160011461022957928192935f9261021e575b50508160011b915f199060031b1c1916176001555b331561020b5760088054336001600160a01b0319821681179092556001600160a01b03167f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e05f80a3600160ff19600a541617600a5580156101f857604080519081016001600160401b038111828210176101e457604090815282825260fa6020909201919091526001600160a01b03909116607d60a11b17600655516138d590816104238239f35b634e487b7160e01b5f52604160045260245ffd5b635b6cc80560e11b5f525f60045260245ffd5b631e4fbdf760e01b5f525f60045260245ffd5b015190505f80610127565b601f1982169360015f52805f20915f5b868110610272575083600195961061025a575b505050811b0160015561013c565b01515f1960f88460031b161c191690555f808061024c565b91926020600181928685015181550194019201610239565b8181111561010d5760015f52601f820160051c7fb10e2d527612073b26eecdfd717e6a320cf44b4afac2b0732d9fcbe2b7fa0cf6602084106102f0575b81601f9101920160051c03905f5b8281106102e357505061010d565b5f828201556001016102d5565b5f91506102c7565b634e487b7160e01b5f52602260045260245ffd5b90607f16906100fb565b015190505f806100c6565b601f198216905f8052805f20915f5b81811061036a57509583600195969710610352575b505050811b015f556100da565b01515f1960f88460031b161c191690555f8080610345565b9192602060018192868b015181550194019201610330565b818111156100ad575f8052601f820160051c7f290decd9548b62a8d60345a988386fc84ba6bc95484008f6362f93160ef3e563602084106103e7575b81601f9101920160051c03905f5b8281106103da5750506100ad565b5f828201556001016103cc565b5f91506103be565b90607f169061009b565b5f80fd5b6040519190601f01601f191682016001600160401b038111838210176101e45760405256fe6080806040526004361015610012575f80fd5b5f3560e01c90816301ffc9a7146114db5750806306fdde0314611423578063081812fc146113e7578063095ea7b3146112fd5780630f2cdd6c146112e25780631249c58b1461104657806318160ddd146110295780631e7269c514610ff157806323b872dd14610fda57806324bbd04914610fb85780632a55205a14610f1857806332cb6b0c14610efc57806342842e0e14610ecd5780635efab6e414610e4b5780636352211e14610e1b57806370a0823114610dca578063715018a614610d825780638da5cb5b14610d5a5780638f2fc60b14610c9857806395d89b4114610ba4578063a22cb46514610af0578063b88d4fde14610a5a578063c87b56dd1461035a578063d12a4c981461033b578063e8a3d48514610256578063e985e9c5146101ff578063f2fde38b1461018c5763f8004d3114610150575f80fd5b3461018857602036600319011261018857600435801515809103610188576101766120e6565b60ff8019600a5416911617600a555f80f35b5f80fd5b34610188576020366003190112610188576101a5611584565b6101ad6120e6565b6001600160a01b031680156101ec57600880546001600160a01b0319811683179091556001600160a01b03165f5160206138005f395f51905f525f80a3005b631e4fbdf760e01b5f525f60045260245ffd5b3461018857604036600319011261018857610218611584565b61022061159a565b9060018060a01b03165f52600560205260405f209060018060a01b03165f52602052602060ff60405f2054166040519015158152f35b34610188575f3660031901126101885761033761032361031e60405161027d60a082611605565b607f81527f7b226e616d65223a225465726d696e616c73222c226465736372697074696f6e60208201527f223a223333333320736d616c6c20435254206372656174757265732c2066756c60408201527f6c79206f6e2d636861696e206f6e20526f62696e686f6f6420436861696e2e2260608201527f2c2273656c6c65725f6665655f62617369735f706f696e7473223a3235307d00608082015261369d565b611872565b604051918291602083526020830190611560565b0390f35b34610188576020366003190112610188576103376103236004356118c8565b3461018857602036600319011261018857600435610377816120b2565b5061038181612243565b9061039c610396610391836118c8565b61369d565b916117a3565b916103aa60ff8451166123b0565b50506103bc60ff602086015116612637565b506103cd60ff604087015116612800565b509060ff606087015116956104ba604051976103e8896115ea565b60409889516103f78b82611605565b6003815262111bdd60ea1b6020820152815289516104158b82611605565b60048152635769646560e01b6020820152602082015289516104378b82611605565b6006815265536c6565707960d01b60208201528a820152895161045a8b82611605565b600581526443726f737360d81b60208201526060820152895161047d8b82611605565b600481526352696e6760e01b60208201526080820152895161049f8b82611605565b600481526329b1b0b760e11b602082015260a08201526137cc565b519061058860ff60808301511689516104d2816115ea565b8a516104de8c82611605565b60048152634c696e6560e01b602082015281528a516104fd8c82611605565b600481526323b934b760e11b602082015260208201528a5161051f8c82611605565b600281526109ed60f31b60208201528b8201528a5161053e8c82611605565b60048152635761766560e01b602082015260608201528a516105608c82611605565b600481526311dc9a5960e21b6020820152608082015261057e6137dd565b60a08201526137cc565b5160a0828101518a51909181016001600160401b03811182821017610a46578b526105b16137dd565b81528a516105bf8c82611605565b600681526553696e676c6560d01b602082015260208201528a516105e38c82611605565b60048152632a3bb4b760e11b60208201528b8201528a516106048c82611605565b600481526304c6f6f760e41b602082015260608201528a516106268c82611605565b6006815265149858989a5d60d21b60208201526080820152600560ff83161015610a3257611fe060c09260051b16015192015115155f14610a0e57885161066d8a82611605565b600681526553746174696360d01b6020820152925b895195869560208701987f5b7b2274726169745f74797065223a2243686173736973222c2276616c7565228a52611d1160f11b8d8901528051602081920160428a015e8701604281017f227d2c7b2274726169745f74797065223a2250686f7370686f72222c2276616c9052643ab2911d1160d91b606282015281516020819301606783015e01604201602581017f227d2c7b2274726169745f74797065223a224261636b64726f70222c2276616c9052643ab2911d1160d91b604582015281516020819301604a83015e01602501602581017f227d2c7b2274726169745f74797065223a2245796573222c2276616c7565223a9052601160f91b604582015281516020819301604683015e01602501602181017f227d2c7b2274726169745f74797065223a224d6f757468222c2276616c7565229052611d1160f11b604182015281516020819301604383015e01602101602281017f227d2c7b2274726169745f74797065223a22416e74656e6e61222c2276616c7590526332911d1160e11b604282015281516020819301604683015e01602201602481017f227d2c7b2274726169745f74797065223a225369676e616c222c2276616c7565905262111d1160e91b604482015281516020819301604783015e0160240162227d5d60e81b602382015203602301601c198101825260030161087f9082611605565b8451938493727b226e616d65223a225465726d696e616c202360681b602086015280516020819201603387015e7f222c226465736372697074696f6e223a224120736d616c6c20435254206372656033918601918201527f61747572652c2067656e65726174656420616e642073746f72656420656e746960538201527803932b63c9037b7102937b134b73437b7b21021b430b4b7171603d1b60738201527f4e6f20736572766572732c206e6f2049504653202d2074686520696d61676520608c8201527f6c6976657320696e2074686520636f6e74726163742e222c22696d616765223a60ac8201527a0899185d184e9a5b5859d94bdcdd99cade1b5b0ed8985cd94d8d0b602a1b60cc820152815191829060200160e783015e01603301906e11161130ba3a3934b13aba32b9911d60891b60b483015251809260c383015e0160b401600f8101607d60f81b905203600f01601e19810182526001016109e79082611605565b6109f09061369d565b6109f990611872565b90518091602082526020820161033791611560565b8851610a1a8a82611605565b600581526421b632b0b960d91b602082015292610682565b634e487b7160e01b5f52603260045260245ffd5b634e487b7160e01b5f52604160045260245ffd5b3461018857608036600319011261018857610a73611584565b610a7b61159a565b6064359190604435906001600160401b038411610188573660238501121561018857836004013592610aac84611628565b93610aba6040519586611605565b8085523660248288010111610188576020815f926024610aee99018389013786010152610ae8838383611643565b3361210d565b005b3461018857604036600319011261018857610b09611584565b60243590811515809203610188573315610b91576001600160a01b0316908115610b7e57335f52600560205260405f20825f5260205260405f2060ff1981541660ff83161790556040519081527f17307eab39ab6107e8899845ad3d59bd9653f200f220920489ca2b5937696c3160203392a3005b50630b61174360e31b5f5260045260245ffd5b63a9fbf51f60e01b5f525f60045260245ffd5b34610188575f366003190112610188576040515f6001548060011c90600181168015610c8e575b602083108114610c7a57828552908115610c565750600114610bf8575b6103378361032381850382611605565b60015f9081527fb10e2d527612073b26eecdfd717e6a320cf44b4afac2b0732d9fcbe2b7fa0cf6939250905b808210610c3c57509091508101602001610323610be8565b919260018160209254838588010152019101909291610c24565b60ff191660208086019190915291151560051b840190910191506103239050610be8565b634e487b7160e01b5f52602260045260245ffd5b91607f1691610bcb565b3461018857604036600319011261018857610cb1611584565b602435906001600160601b0382169081830361018857610ccf6120e6565b6127108211610d41576001600160a01b0316908115610d2e5760408051908101906001600160401b03821181831017610a4657604091909152828152602001526001600160a01b031660a09190911b6001600160a01b03191617600655005b635b6cc80560e11b5f525f60045260245ffd5b50636f483d0960e01b5f5260045261271060245260445ffd5b34610188575f366003190112610188576008546040516001600160a01b039091168152602090f35b34610188575f36600319011261018857610d9a6120e6565b600880546001600160a01b031981169091555f906001600160a01b03165f5160206138005f395f51905f528280a3005b34610188576020366003190112610188576001600160a01b03610deb611584565b168015610e08575f526003602052602060405f2054604051908152f35b6322718ad960e21b5f525f60045260245ffd5b34610188576020366003190112610188576020610e396004356120b2565b6040516001600160a01b039091168152f35b3461018857602036600319011261018857610100610e6a6004356117a3565b60e06040519160ff815116835260ff602082015116602084015260ff604082015116604084015260ff606082015116606084015260ff608082015116608084015260ff60a08201511660a084015260c0810151151560c0840152015160e0820152f35b3461018857610aee610ede366115b0565b9060405192610eee602085611605565b5f8452610ae8838383611643565b34610188575f366003190112610188576020604051610d058152f35b34610188576040366003190112610188576004355f90815260076020526040902054602435906001600160a01b0381169060a01c8115610fa0575b6001600160601b03168281029280159084049091141715610f8c57604080516001600160a01b0390921682526127109092046020820152f35b634e487b7160e01b5f52601160045260245ffd5b50506006546001600160a01b0381169060a01c610f53565b34610188575f36600319011261018857602060ff600a54166040519015158152f35b3461018857610aee610feb366115b0565b91611643565b34610188576020366003190112610188576001600160a01b03611012611584565b165f52600c602052602060405f2054604051908152f35b34610188575f366003190112610188576020600954604051908152f35b34610188575f3660031901126101885760ff600a5416156112d357600954610d058110156112c457335f52600c602052600160405f205410156112b55760010180600955335f52600c60205260405f206001815401905560405160208101905f1943014082528260408201523360601b6060820152605481526110ca607482611605565b519020815f52600b60205260405f2055602090604051906110eb8383611605565b5f825233156112a2575f8181526002845260409020546001600160a01b03168015159081611282575b335f8181526003875260408082208054600101905585825260028852812080546001600160a01b0319168317905584919083905f5160206138205f395f51905f529080a45061126f57333b61116557005b61119f9183916040519384928392630a85bd0160e11b84523360048501525f60248501526044840152608060648401526084830190611560565b03815f335af15f918161122f575b5061120157503d156111f9573d906111c482611628565b916111d26040519384611605565b82523d5f8284013e5b815191826111f657633250574960e11b5f523360045260245ffd5b01fd5b6060906111db565b6001600160e01b03191663757a42ff60e11b01905061121c57005b633250574960e11b5f523360045260245ffd5b9091508281813d8311611268575b6112478183611605565b8101031261018857516001600160e01b0319811681036101885790836111ad565b503d61123d565b6339e3563760e11b5f525f60045260245ffd5b61128b83613680565b805f526003855260405f205f198154019055611114565b633250574960e11b5f525f60045260245ffd5b631bbdf5c560e31b5f5260045ffd5b6352df9fe560e01b5f5260045ffd5b63589ed34b60e01b5f5260045ffd5b34610188575f36600319011261018857602060405160018152f35b3461018857604036600319011261018857611316611584565b602435611322816120b2565b331515806113d4575b806113a7575b6113945781906001600160a01b0384811691167f8c5be1e5ebec7d5bd14f71427d1e84f3dd0314c0f7b2291e5b200ac8c7c3b9255f80a45f90815260046020526040902080546001600160a01b0319166001600160a01b03909216919091179055005b63a9fbf51f60e01b5f523360045260245ffd5b506001600160a01b0381165f90815260056020908152604080832033845290915290205460ff1615611331565b506001600160a01b03811633141561132b565b3461018857602036600319011261018857600435611404816120b2565b505f526004602052602060018060a01b0360405f205416604051908152f35b34610188575f366003190112610188576040515f5f548060011c906001811680156114d1575b602083108114610c7a57828552908115610c565750600114611475576103378361032381850382611605565b5f8080527f290decd9548b62a8d60345a988386fc84ba6bc95484008f6362f93160ef3e563939250905b8082106114b757509091508101602001610323610be8565b91926001816020925483858801015201910190929161149f565b91607f1691611449565b34610188576020366003190112610188576004359063ffffffff60e01b82168092036101885760209163152a902d60e11b811490811561151d575b5015158152f35b6380ac58cd60e01b81149150811561154f575b811561153e575b5083611516565b6301ffc9a760e01b14905083611537565b635b5e139f60e01b81149150611530565b805180835260209291819084018484015e5f828201840152601f01601f1916010190565b600435906001600160a01b038216820361018857565b602435906001600160a01b038216820361018857565b6060906003190112610188576004356001600160a01b038116810361018857906024356001600160a01b0381168103610188579060443590565b60c081019081106001600160401b03821117610a4657604052565b601f909101601f19168101906001600160401b03821190821017610a4657604052565b6001600160401b038111610a4657601f01601f191660200190565b6001600160a01b03909116919082156112a2575f828152600260205260409020546001600160a01b03169282903315158061170e575b50846116ed575b805f52600360205260405f2060018154019055815f52600260205260405f208160018060a01b0319825416179055845f5160206138205f395f51905f525f80a46001600160a01b03168083036116d557505050565b6364283d7b60e01b5f5260045260245260445260645ffd5b6116f682613680565b845f52600360205260405f205f198154019055611680565b90915080611752575b156117245782905f611679565b828461173c57637e27328960e01b5f5260045260245ffd5b63177e802f60e01b5f523360045260245260445ffd5b503384148015611781575b8061171757505f838152600460205260409020546001600160a01b03163314611717565b505f84815260056020908152604080832033845290915290205460ff1661175d565b60405190919061010081016001600160401b03811182821017610a46576040525f8152600960208201915f8352604081015f8152606082015f8152608083015f815260a08401915f835260c08501935f855260e08601975f8952869a5f52600b60205260405f20549660ff6006895f1a0616905260ff60068860011a0616905260ff60068760021a0616905260ff60068660031a0616905260ff60068560041a0616905260ff600584811a0616905260148260061a10905260071a06906003198201918213600116610f8c5752565b906118c6603d6020936040519485917f646174613a6170706c69636174696f6e2f6a736f6e3b6261736536342c000000828401528051918291018484015e81015f838201520301601f198101845283611605565b565b6118d1906117a3565b6118de60ff8251166123b0565b909291506118f260ff602084015116612637565b905061190460ff604085015116612800565b94905061191460e08501516129c9565b93609c60206040519681808901997f3c73766720786d6c6e733d22687474703a2f2f7777772e77332e6f72672f32308b527f30302f737667222076696577426f783d2230203020343530203435302220776960408b015276323a341e911a1a9811103432b4b3b43a1e911a1a98111f60491b60608b01527f3c726563742077696474683d2234353022206865696768743d2234353022206660778b01526434b6361e9160d91b60978b0152805191829101858b015e8801906211179f60e91b848301527f3c656c6c697073652063783d22323235222063793d22343034222072783d2231609f8301527f3136222072793d223136222066696c6c3d22233030303030303330222f3e000060bf83015274078ce40e8e4c2dce6ccdee4da7a44e4dee8c2e8ca5605b1b60dd83015280519283910160f283015e0101916a1019191a90191a9814911f60a91b60568401527f3c7265637420783d223139362220793d22333630222077696474683d22313822606184015279103432b4b3b43a1e9119981110393c1e911b11103334b6361e9160311b6081840152611ba66003603e88603d604560568b5160208d019a818c609b83015e01016211179f60e91b828201527f3c7265637420783d223233362220793d22333630222077696474683d22313822604882015279103432b4b3b43a1e9119981110393c1e911b11103334b6361e9160311b60688201528b5190818b608283015e01016211179f60e91b828201527f3c7265637420783d223137362220793d22333330222077696474683d2239382260408201527a103432b4b3b43a1e911a191110393c1e91189a11103334b6361e9160291b60608201528a5190818a607b83015e01016211179f60e91b838201520301601c19810189520187611605565b605d6040519360208501965f5160206138405f395f51905f5288527f22206865696768743d22323030222072783d223330222066696c6c3d220000006040870152835180602086018589015e8601906211179f60e91b848301525f5160206138405f395f51905f5260608301527f22206865696768743d22323030222072783d223330222066696c6c3d226e6f6e60808301526a32911039ba3937b5b29e9160a91b60a083015251809260ab83015e01019473111039ba3937b5b296bbb4b23a341e911b11179f60611b604e8701525f5160206138805f395f51905f5260628701527f22206865696768743d22313438222072783d223138222066696c6c3d22233130608287015266189998a091179f60c91b60a28701525f5160206138805f395f51905f5260a98701527f22206865696768743d22313438222072783d223138222066696c6c3d226e6f6e60c98701526a32911039ba3937b5b29e9160a91b60e9870152611d6c602a60a686604e895160208b019b818d60f483015e01017f22207374726f6b652d6f7061636974793d22302e323522207374726f6b652d77838201526934b23a341e911991179f60b11b60c68201520301600a810187520185611605565b611d7d8560ff606086015116612a25565b611d8e8660ff608087015116612ecc565b60c08501519092901561209b57604051681e33903334b6361e9160b91b6020820152611df160166029838c8c5180918484015e81017511103334b63616b7b830b1b4ba3c9e911817189a111f60511b838201520301600919810184520182611605565b5f905b60088210611ff357611e06915061324e565b935b87604051611e17606082611605565b602681527f3c672066696c6c3d2223303030303030222066696c6c2d6f7061636974793d226020820152651817189b111f60d11b60408201525f5b60188110611f475750611e649061324e565b9660a0015160ff1691611e7692613286565b956040519a8b9a51809160208d015e8a019060208201905f8252519283915e016020015f815281516020819301825e015f815281516020819301825e015f815281516020819301825e015f815281516020819301825e015f815281516020819301825e01907f3c636972636c652063783d22323235222063793d223332302220723d223522208252653334b6361e9160d11b6020830152518092602683015e016c11179f1e17b39f1e17b9bb339f60991b60268201520360260160121981018252600d01611f449082611605565b90565b91506006820282810460061483151715610f8c57609e019081609e11610f8c57611fe9601a60116020938480611f7e600198612243565b6040519784899551918291018487015e840190701e3932b1ba103c1e91189a1b11103c9e9160791b83830152805192839101603183015e01017911103bb4b23a341e91189a9c11103432b4b3b43a1e911991179f60311b838201520301600519810184520182611605565b9101908991611e52565b6012820282810460121483151715610f8c5760a401908160a411610f8c57612093601a60116020938480612028600198612243565b6040519784899551918291018487015e840190701e3932b1ba103c1e91189a1b11103c9e9160791b83830152805192839101603183015e01017911103bb4b23a341e91189a9c11103432b4b3b43a1e911b11179f60311b838201520301600519810184520182611605565b910190611df4565b6040516120a9602082611605565b5f815293611e08565b5f818152600260205260409020546001600160a01b03169081156120d4575090565b637e27328960e01b5f5260045260245ffd5b6008546001600160a01b031633036120fa57565b63118cdaa760e01b5f523360045260245ffd5b823b61211b575b5050505050565b604051630a85bd0160e11b81526001600160a01b039182166004820152918116602483015260448201939093526080606482015291169160209082908190612167906084830190611560565b03815f865af15f91816121fe575b506121ca57503d156121c3573d61218b81611628565b906121996040519283611605565b81523d5f602083013e5b805190816121be5782633250574960e11b5f5260045260245ffd5b602001fd5b60606121a3565b6001600160e01b03191663757a42ff60e11b016121ec57505f80808080612114565b633250574960e11b5f5260045260245ffd5b9091506020813d60201161223b575b8161221a60209383611605565b8101031261018857516001600160e01b03198116810361018857905f612175565b3d915061220d565b5f908072184f03e93ff9f4daa797ed6e38ed64bf6a1f0160401b81101561238d575b600a906904ee2d6d415b85acef8160201b811015612371575b662386f26fc1000081101561235d575b6305f5e10081101561234c575b61271081101561233d575b606481101561232f575b1015612324575b600a602160018401936122c985611628565b946122d76040519687611605565b8086526122e6601f1991611628565b013660208701378401015b5f1901916f181899199a1a9b1b9c1cb0b131b232b360811b8282061a835304801561231f57600a90916122f1565b505090565b6001909101906122b7565b6064600291049301926122b0565b612710600491049301926122a6565b6305f5e1006008910493019261229b565b662386f26fc100006010910493019261228e565b602093909301926904ee2d6d415b85acef8160201b900461227e565b506040915072184f03e93ff9f4daa797ed6e38ed64bf6a1f0160401b8104612265565b60ff1680156125d25760018114612569576002811461250457600381146124a05760041461243c57604080516123e68282611605565b600481526314d85b9960e21b60208201529181516124048382611605565b600781526608d0ce504d4dcd60ca1b60208201529161242581519182611605565b600781526611a0999c199a9b60c91b602082015290565b6040805161244a8282611605565b6004815263506c756d60e01b60208201529181516124688382611605565b6007815266119b211a1a9b1960c91b60208201529161248981519182611605565b6007815266046688a666268760cb1b602082015290565b50604080516124af8282611605565b600381526253656160e81b60208201529181516124cc8382611605565b60078152661199a31b229b2160c91b6020820152916124ed81519182611605565b600781526608cc90cd118d1160ca1b602082015290565b50604080516125138282611605565b6004815263149d5cdd60e21b60208201529181516125318382611605565b600781526608d04e0d4d0ccd60ca1b60208201529161255281519182611605565b6007815266119ba299a2191b60c91b602082015290565b50604080516125788282611605565b6008815267477261706869746560c01b602082015291815161259a8382611605565b60078152662333413341334560c81b6020820152916125bb81519182611605565b60078152662332363236324160c81b602082015290565b50604080516125e18282611605565b6004815263426f6e6560e01b60208201529181516125ff8382611605565b600781526608d14e114c910d60ca1b60208201529161262081519182611605565b60078152660468668848682760cb1b602082015290565b60ff1680156127ba5760018114612774576002811461272f57600381146126ea576004146126a457604090815161266e8382611605565b60058152642830b832b960d91b60208201529161268d81519182611605565b600781526611a31922a3229b60c91b602082015290565b60409081516126b38382611605565b6006815265159a5bdb195d60d21b6020820152916126d381519182611605565b600781526611a11a9c21a32360c91b602082015290565b5060409081516126fa8382611605565b6004815263526f736560e01b60208201529161271881519182611605565b60078152662346463741394360c81b602082015290565b50604090815161273f8382611605565b600481526321bcb0b760e11b60208201529161275d81519182611605565b60078152660466c62886c8a760cb1b602082015290565b5060409081516127848382611605565b600581526423b932b2b760d91b6020820152916127a381519182611605565b60078152662335424535384160c81b602082015290565b5060409081516127ca8382611605565b600581526420b6b132b960d91b6020820152916127e981519182611605565b600781526611a323211899a160c91b602082015290565b60ff168015612983576001811461293e57600281146128fa57600381146128b35760041461286d5760409081516128378382611605565b6005815264084d8eae6d60db1b60208201529161285681519182611605565b600781526608d14d509190cd60ca1b602082015290565b604090815161287c8382611605565b6006815265213aba3a32b960d11b60208201529161289c81519182611605565b60078152662345464439413360c81b602082015290565b5060409081516128c38382611605565b60068152652634b1b432b760d11b6020820152916128e381519182611605565b600781526608d0cd90d1908d60ca1b602082015290565b50604090815161290a8382611605565b6003815262536b7960e81b60208201529161292781519182611605565b60078152662342464433444560c81b602082015290565b50604090815161294e8382611605565b6004815263111d5cdd60e21b60208201529161296c81519182611605565b60078152660234439433743360cc1b602082015290565b5060409081516129938382611605565b6005815264437265616d60d81b6020820152916129b281519182611605565b600781526611a2a2229b221b60c91b602082015290565b5f81126129d957611f4490612243565b600160ff1b8114610f8c57611f4460216129f66020935f03612243565b604051938491602d60f81b828401528051918291018484015e81015f838201520301601f198101835282611605565b60ff168015612e175760018114612d3c5760028114612c60579081600360209314612b8757600414612ad0576003605c611f44926040519485917f3c7265637420783d223136302220793d22323234222077696474683d22313330828401527b11103432b4b3b43a1e911c9110393c1e911a171a91103334b6361e9160211b60408401528051918291018484015e81016211179f60e91b838201520301601c19810184520182611605565b605b6037611f4492604051948591761e33903334b6361e913737b732911039ba3937b5b29e9160491b828401528051918291018484015e81017f22207374726f6b652d77696474683d2236223e3c636972636c652063783d2231838201527f3835222063793d223232382220723d223135222f3e3c636972636c652063783d60578201527a11191b1a911031bc9e9119191c1110391e91189a91179f1e17b39f60291b60778201520301603b810184520182611605565b50608c602b611f44926040519485916a1e339039ba3937b5b29e9160a91b828401528051918291018484015e81015f5160206138605f395f51905f52838201527f703d22726f756e64223e3c7061746820643d224d31373220323134204c323030604b8201527810191a1910269918181019189a1026189b9910191a1911179f60391b606b8201527f3c7061746820643d224d32353220323134204c32383020323432204d3238302060848201527219189a1026191a9910191a1911179f1e17b39f60691b60a48201520301606c810184520182611605565b50611f446003603e605b936040519485917f3c7265637420783d223136382220793d22323236222077696474683d2233342260208401527a103432b4b3b43a1e911b9110393c1e9119971a91103334b6361e9160291b6040840152805190602081019180838587015e8401907f222f3e3c7265637420783d223234382220793d22323236222077696474683d22848301527f333422206865696768743d2237222072783d22332e35222066696c6c3d220000607b830152518092609983015e01016211179f60e91b838201520301601c19810184520182611605565b50611f446003603d605a936040519485917f3c7265637420783d223136382220793d22323132222077696474683d22333422602084015279103432b4b3b43a1e91199a1110393c1e911a11103334b6361e9160311b6040840152805190602081019180838587015e8401907f222f3e3c7265637420783d223234382220793d22323132222077696474683d22848301527f333422206865696768743d223334222072783d2234222066696c6c3d22000000607a830152518092609783015e01016211179f60e91b838201520301601c19810184520182611605565b50611f446003602a6047936040519485917f3c636972636c652063783d22313835222063793d223232382220723d22313122602084015266103334b6361e9160c91b6040840152805190602081019180838587015e8401907f222f3e3c636972636c652063783d22323635222063793d223232382220723d228483015269189891103334b6361e9160b11b6067830152518092607183015e01016211179f60e91b838201520301601c19810184520182611605565b60ff1680156131cd576001811461313557600281146130a95760038114612ff957600414612f095750604051612f03602082611605565b5f815290565b611f446063605a6020936040519485917f3c7265637420783d223139362220793d22323738222077696474683d223538228284015279103432b4b3b43a1e9119181110393c1e911991103334b6361e9160311b60408401528051918291018484015e81017f222f3e3c67207374726f6b653d2223303030303030353522207374726f6b652d838201527f77696474683d2233223e3c7061746820643d224d323135203237382056323938607a8201527f204d323335203237382056323938204d313936203238382048323534222f3e3c609a8201526217b39f60e91b60ba82015203016043810184520182611605565b50611f44602b60606020936040519485917f3c7061746820643d224d3139322032383820713131202d313220323220302074828401527f32322030207432322030222066696c6c3d226e6f6e6522207374726f6b653d2260408401528051918291018484015e81017f22207374726f6b652d77696474683d223622207374726f6b652d6c696e656361838201526a381e913937bab73211179f60a91b60808201520301600b810184520182611605565b50611f44601460556020936040519485917f3c636972636c652063783d22323235222063793d223238382220723d223135228284015274103334b6361e913737b732911039ba3937b5b29e9160591b60408401528051918291018484015e810173111039ba3937b5b296bbb4b23a341e911b11179f60611b838201520301600b19810184520182611605565b50611f44602b60586020936040519485917f3c7061746820643d224d3139362032373820513232352033303620323534203282840152771b9c11103334b6361e913737b732911039ba3937b5b29e9160411b60408401528051918291018484015e81015f5160206138605f395f51905f52838201526a381e913937bab73211179f60a91b60788201520301600b810184520182611605565b50611f446003605b6020936040519485917f3c7265637420783d223230302220793d22323834222077696474683d22353022828401527a103432b4b3b43a1e911b9110393c1e9119971a91103334b6361e9160291b60408401528051918291018484015e81016211179f60e91b838201520301601c19810184520182611605565b906118c66004602080946040519581879251918291018484015e8101631e17b39f60e11b838201520301601b19810185520183611605565b60ff909291921690811561366f576040519161331260356028856020808201986739ba3937b5b29e9160c11b8a528051918291018484015e81017f22207374726f6b652d77696474683d223822207374726f6b652d6c696e6563618382015274381e913937bab73211103334b6361e913737b7329160591b604882015203016015810186520184611605565b600181146135d457600281146134de57600314613424576028611f449260276003936040519687937f3c7061746820643d224d31393620313334204c313730203838204d323534203160208601526b0199a1026191c18101c1c11160a51b6040860152518091604c86015e8301907f2f3e3c636972636c652063783d22313730222063793d2238322220723d223922604c83015266103334b6361e9160c91b606c830152604c815160208301938185607383015e0101907f222f3e3c636972636c652063783d22323830222063793d2238322220723d2239848301526711103334b6361e9160c11b6047830152518092604f83015e01016211179f60e91b838201520301601c19810184520182611605565b6036611f4492603860206014946040519788947701e3830ba3410321e912699191a90189999102b18981a11160451b848701525180918587015e8401907f2f3e3c636972636c652063783d22323235222063793d2238382220723d223137848301527511103334b6361e913737b732911039ba3937b5b29e9160511b6058830152805192839101606e83015e010173111039ba3937b5b296bbb4b23a341e911b91179f60611b838201520301600b19810184520182611605565b506028611f449260276003936040519687937f3c7061746820643d224d313930203133322056313030204d323630203133322060208601526502b18981811160d51b6040860152518091604686015e8301907f2f3e3c636972636c652063783d22313930222063793d2239322220723d223922604683015266103334b6361e9160c91b60668301526046815160208301938185606d83015e0101907f222f3e3c636972636c652063783d22323630222063793d2239322220723d2239848301526711103334b6361e9160c11b6047830152518092604f83015e01016211179f60e91b838201520301601c19810184520182611605565b506028611f4492603760206003946040519788947601e3830ba3410321e912699191a90189999102b1c99111604d1b848701525180918587015e8401907f2f3e3c636972636c652063783d22323235222063793d2238342220723d223132848301526711103334b6361e9160c11b6057830152805192839101605f83015e01016211179f60e91b838201520301601c19810184520182611605565b505050604051612f03602082611605565b5f90815260046020526040902080546001600160a01b0319169055565b908151156137bc57815160028101809111610f8c5760039004600281901b91906001600160fe1b03811603610f8c57604051917f4142434445464748494a4b4c4d4e4f505152535455565758595a616263646566601f527f6768696a6b6c6d6e6f707172737475767778797a303132333435363738392b2f603f52602083018480518101602081018051915f82525b808910613780575060209596975090600392915251068060011461376b5760021461375e575b50808452830101604052565b603d905f1901535f613752565b50603d90815f1982015360011901535f613752565b939760036004910198603f8a51818160121c165183538181600c1c16516001840153818160061c1651600284015316516003820153019361372c565b9050604051612f03602082611605565b906006811015610a325760051b0190565b604051906137ec604083611605565b60048252634e6f6e6560e01b602083015256fe8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e0ddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef3c7265637420783d223132302220793d22313332222077696474683d2232313022207374726f6b652d77696474683d223722207374726f6b652d6c696e6563613c7265637420783d223134362220793d22313538222077696474683d22313538a2646970667358221220532655ff2004b7ba35a66b4faf11b814b533a066b5823679776237ca2d5b0ef364736f6c634300082400330000000000000000000000009a1ce21625194beaafaf55ecc974ffddcda2ec0e
0x6080806040526004361015610012575f80fd5b5f3560e01c90816301ffc9a7146114db5750806306fdde0314611423578063081812fc146113e7578063095ea7b3146112fd5780630f2cdd6c146112e25780631249c58b1461104657806318160ddd146110295780631e7269c514610ff157806323b872dd14610fda57806324bbd04914610fb85780632a55205a14610f1857806332cb6b0c14610efc57806342842e0e14610ecd5780635efab6e414610e4b5780636352211e14610e1b57806370a0823114610dca578063715018a614610d825780638da5cb5b14610d5a5780638f2fc60b14610c9857806395d89b4114610ba4578063a22cb46514610af0578063b88d4fde14610a5a578063c87b56dd1461035a578063d12a4c981461033b578063e8a3d48514610256578063e985e9c5146101ff578063f2fde38b1461018c5763f8004d3114610150575f80fd5b3461018857602036600319011261018857600435801515809103610188576101766120e6565b60ff8019600a5416911617600a555f80f35b5f80fd5b34610188576020366003190112610188576101a5611584565b6101ad6120e6565b6001600160a01b031680156101ec57600880546001600160a01b0319811683179091556001600160a01b03165f5160206138005f395f51905f525f80a3005b631e4fbdf760e01b5f525f60045260245ffd5b3461018857604036600319011261018857610218611584565b61022061159a565b9060018060a01b03165f52600560205260405f209060018060a01b03165f52602052602060ff60405f2054166040519015158152f35b34610188575f3660031901126101885761033761032361031e60405161027d60a082611605565b607f81527f7b226e616d65223a225465726d696e616c73222c226465736372697074696f6e60208201527f223a223333333320736d616c6c20435254206372656174757265732c2066756c60408201527f6c79206f6e2d636861696e206f6e20526f62696e686f6f6420436861696e2e2260608201527f2c2273656c6c65725f6665655f62617369735f706f696e7473223a3235307d00608082015261369d565b611872565b604051918291602083526020830190611560565b0390f35b34610188576020366003190112610188576103376103236004356118c8565b3461018857602036600319011261018857600435610377816120b2565b5061038181612243565b9061039c610396610391836118c8565b61369d565b916117a3565b916103aa60ff8451166123b0565b50506103bc60ff602086015116612637565b506103cd60ff604087015116612800565b509060ff606087015116956104ba604051976103e8896115ea565b60409889516103f78b82611605565b6003815262111bdd60ea1b6020820152815289516104158b82611605565b60048152635769646560e01b6020820152602082015289516104378b82611605565b6006815265536c6565707960d01b60208201528a820152895161045a8b82611605565b600581526443726f737360d81b60208201526060820152895161047d8b82611605565b600481526352696e6760e01b60208201526080820152895161049f8b82611605565b600481526329b1b0b760e11b602082015260a08201526137cc565b519061058860ff60808301511689516104d2816115ea565b8a516104de8c82611605565b60048152634c696e6560e01b602082015281528a516104fd8c82611605565b600481526323b934b760e11b602082015260208201528a5161051f8c82611605565b600281526109ed60f31b60208201528b8201528a5161053e8c82611605565b60048152635761766560e01b602082015260608201528a516105608c82611605565b600481526311dc9a5960e21b6020820152608082015261057e6137dd565b60a08201526137cc565b5160a0828101518a51909181016001600160401b03811182821017610a46578b526105b16137dd565b81528a516105bf8c82611605565b600681526553696e676c6560d01b602082015260208201528a516105e38c82611605565b60048152632a3bb4b760e11b60208201528b8201528a516106048c82611605565b600481526304c6f6f760e41b602082015260608201528a516106268c82611605565b6006815265149858989a5d60d21b60208201526080820152600560ff83161015610a3257611fe060c09260051b16015192015115155f14610a0e57885161066d8a82611605565b600681526553746174696360d01b6020820152925b895195869560208701987f5b7b2274726169745f74797065223a2243686173736973222c2276616c7565228a52611d1160f11b8d8901528051602081920160428a015e8701604281017f227d2c7b2274726169745f74797065223a2250686f7370686f72222c2276616c9052643ab2911d1160d91b606282015281516020819301606783015e01604201602581017f227d2c7b2274726169745f74797065223a224261636b64726f70222c2276616c9052643ab2911d1160d91b604582015281516020819301604a83015e01602501602581017f227d2c7b2274726169745f74797065223a2245796573222c2276616c7565223a9052601160f91b604582015281516020819301604683015e01602501602181017f227d2c7b2274726169745f74797065223a224d6f757468222c2276616c7565229052611d1160f11b604182015281516020819301604383015e01602101602281017f227d2c7b2274726169745f74797065223a22416e74656e6e61222c2276616c7590526332911d1160e11b604282015281516020819301604683015e01602201602481017f227d2c7b2274726169745f74797065223a225369676e616c222c2276616c7565905262111d1160e91b604482015281516020819301604783015e0160240162227d5d60e81b602382015203602301601c198101825260030161087f9082611605565b8451938493727b226e616d65223a225465726d696e616c202360681b602086015280516020819201603387015e7f222c226465736372697074696f6e223a224120736d616c6c20435254206372656033918601918201527f61747572652c2067656e65726174656420616e642073746f72656420656e746960538201527803932b63c9037b7102937b134b73437b7b21021b430b4b7171603d1b60738201527f4e6f20736572766572732c206e6f2049504653202d2074686520696d61676520608c8201527f6c6976657320696e2074686520636f6e74726163742e222c22696d616765223a60ac8201527a0899185d184e9a5b5859d94bdcdd99cade1b5b0ed8985cd94d8d0b602a1b60cc820152815191829060200160e783015e01603301906e11161130ba3a3934b13aba32b9911d60891b60b483015251809260c383015e0160b401600f8101607d60f81b905203600f01601e19810182526001016109e79082611605565b6109f09061369d565b6109f990611872565b90518091602082526020820161033791611560565b8851610a1a8a82611605565b600581526421b632b0b960d91b602082015292610682565b634e487b7160e01b5f52603260045260245ffd5b634e487b7160e01b5f52604160045260245ffd5b3461018857608036600319011261018857610a73611584565b610a7b61159a565b6064359190604435906001600160401b038411610188573660238501121561018857836004013592610aac84611628565b93610aba6040519586611605565b8085523660248288010111610188576020815f926024610aee99018389013786010152610ae8838383611643565b3361210d565b005b3461018857604036600319011261018857610b09611584565b60243590811515809203610188573315610b91576001600160a01b0316908115610b7e57335f52600560205260405f20825f5260205260405f2060ff1981541660ff83161790556040519081527f17307eab39ab6107e8899845ad3d59bd9653f200f220920489ca2b5937696c3160203392a3005b50630b61174360e31b5f5260045260245ffd5b63a9fbf51f60e01b5f525f60045260245ffd5b34610188575f366003190112610188576040515f6001548060011c90600181168015610c8e575b602083108114610c7a57828552908115610c565750600114610bf8575b6103378361032381850382611605565b60015f9081527fb10e2d527612073b26eecdfd717e6a320cf44b4afac2b0732d9fcbe2b7fa0cf6939250905b808210610c3c57509091508101602001610323610be8565b919260018160209254838588010152019101909291610c24565b60ff191660208086019190915291151560051b840190910191506103239050610be8565b634e487b7160e01b5f52602260045260245ffd5b91607f1691610bcb565b3461018857604036600319011261018857610cb1611584565b602435906001600160601b0382169081830361018857610ccf6120e6565b6127108211610d41576001600160a01b0316908115610d2e5760408051908101906001600160401b03821181831017610a4657604091909152828152602001526001600160a01b031660a09190911b6001600160a01b03191617600655005b635b6cc80560e11b5f525f60045260245ffd5b50636f483d0960e01b5f5260045261271060245260445ffd5b34610188575f366003190112610188576008546040516001600160a01b039091168152602090f35b34610188575f36600319011261018857610d9a6120e6565b600880546001600160a01b031981169091555f906001600160a01b03165f5160206138005f395f51905f528280a3005b34610188576020366003190112610188576001600160a01b03610deb611584565b168015610e08575f526003602052602060405f2054604051908152f35b6322718ad960e21b5f525f60045260245ffd5b34610188576020366003190112610188576020610e396004356120b2565b6040516001600160a01b039091168152f35b3461018857602036600319011261018857610100610e6a6004356117a3565b60e06040519160ff815116835260ff602082015116602084015260ff604082015116604084015260ff606082015116606084015260ff608082015116608084015260ff60a08201511660a084015260c0810151151560c0840152015160e0820152f35b3461018857610aee610ede366115b0565b9060405192610eee602085611605565b5f8452610ae8838383611643565b34610188575f366003190112610188576020604051610d058152f35b34610188576040366003190112610188576004355f90815260076020526040902054602435906001600160a01b0381169060a01c8115610fa0575b6001600160601b03168281029280159084049091141715610f8c57604080516001600160a01b0390921682526127109092046020820152f35b634e487b7160e01b5f52601160045260245ffd5b50506006546001600160a01b0381169060a01c610f53565b34610188575f36600319011261018857602060ff600a54166040519015158152f35b3461018857610aee610feb366115b0565b91611643565b34610188576020366003190112610188576001600160a01b03611012611584565b165f52600c602052602060405f2054604051908152f35b34610188575f366003190112610188576020600954604051908152f35b34610188575f3660031901126101885760ff600a5416156112d357600954610d058110156112c457335f52600c602052600160405f205410156112b55760010180600955335f52600c60205260405f206001815401905560405160208101905f1943014082528260408201523360601b6060820152605481526110ca607482611605565b519020815f52600b60205260405f2055602090604051906110eb8383611605565b5f825233156112a2575f8181526002845260409020546001600160a01b03168015159081611282575b335f8181526003875260408082208054600101905585825260028852812080546001600160a01b0319168317905584919083905f5160206138205f395f51905f529080a45061126f57333b61116557005b61119f9183916040519384928392630a85bd0160e11b84523360048501525f60248501526044840152608060648401526084830190611560565b03815f335af15f918161122f575b5061120157503d156111f9573d906111c482611628565b916111d26040519384611605565b82523d5f8284013e5b815191826111f657633250574960e11b5f523360045260245ffd5b01fd5b6060906111db565b6001600160e01b03191663757a42ff60e11b01905061121c57005b633250574960e11b5f523360045260245ffd5b9091508281813d8311611268575b6112478183611605565b8101031261018857516001600160e01b0319811681036101885790836111ad565b503d61123d565b6339e3563760e11b5f525f60045260245ffd5b61128b83613680565b805f526003855260405f205f198154019055611114565b633250574960e11b5f525f60045260245ffd5b631bbdf5c560e31b5f5260045ffd5b6352df9fe560e01b5f5260045ffd5b63589ed34b60e01b5f5260045ffd5b34610188575f36600319011261018857602060405160018152f35b3461018857604036600319011261018857611316611584565b602435611322816120b2565b331515806113d4575b806113a7575b6113945781906001600160a01b0384811691167f8c5be1e5ebec7d5bd14f71427d1e84f3dd0314c0f7b2291e5b200ac8c7c3b9255f80a45f90815260046020526040902080546001600160a01b0319166001600160a01b03909216919091179055005b63a9fbf51f60e01b5f523360045260245ffd5b506001600160a01b0381165f90815260056020908152604080832033845290915290205460ff1615611331565b506001600160a01b03811633141561132b565b3461018857602036600319011261018857600435611404816120b2565b505f526004602052602060018060a01b0360405f205416604051908152f35b34610188575f366003190112610188576040515f5f548060011c906001811680156114d1575b602083108114610c7a57828552908115610c565750600114611475576103378361032381850382611605565b5f8080527f290decd9548b62a8d60345a988386fc84ba6bc95484008f6362f93160ef3e563939250905b8082106114b757509091508101602001610323610be8565b91926001816020925483858801015201910190929161149f565b91607f1691611449565b34610188576020366003190112610188576004359063ffffffff60e01b82168092036101885760209163152a902d60e11b811490811561151d575b5015158152f35b6380ac58cd60e01b81149150811561154f575b811561153e575b5083611516565b6301ffc9a760e01b14905083611537565b635b5e139f60e01b81149150611530565b805180835260209291819084018484015e5f828201840152601f01601f1916010190565b600435906001600160a01b038216820361018857565b602435906001600160a01b038216820361018857565b6060906003190112610188576004356001600160a01b038116810361018857906024356001600160a01b0381168103610188579060443590565b60c081019081106001600160401b03821117610a4657604052565b601f909101601f19168101906001600160401b03821190821017610a4657604052565b6001600160401b038111610a4657601f01601f191660200190565b6001600160a01b03909116919082156112a2575f828152600260205260409020546001600160a01b03169282903315158061170e575b50846116ed575b805f52600360205260405f2060018154019055815f52600260205260405f208160018060a01b0319825416179055845f5160206138205f395f51905f525f80a46001600160a01b03168083036116d557505050565b6364283d7b60e01b5f5260045260245260445260645ffd5b6116f682613680565b845f52600360205260405f205f198154019055611680565b90915080611752575b156117245782905f611679565b828461173c57637e27328960e01b5f5260045260245ffd5b63177e802f60e01b5f523360045260245260445ffd5b503384148015611781575b8061171757505f838152600460205260409020546001600160a01b03163314611717565b505f84815260056020908152604080832033845290915290205460ff1661175d565b60405190919061010081016001600160401b03811182821017610a46576040525f8152600960208201915f8352604081015f8152606082015f8152608083015f815260a08401915f835260c08501935f855260e08601975f8952869a5f52600b60205260405f20549660ff6006895f1a0616905260ff60068860011a0616905260ff60068760021a0616905260ff60068660031a0616905260ff60068560041a0616905260ff600584811a0616905260148260061a10905260071a06906003198201918213600116610f8c5752565b906118c6603d6020936040519485917f646174613a6170706c69636174696f6e2f6a736f6e3b6261736536342c000000828401528051918291018484015e81015f838201520301601f198101845283611605565b565b6118d1906117a3565b6118de60ff8251166123b0565b909291506118f260ff602084015116612637565b905061190460ff604085015116612800565b94905061191460e08501516129c9565b93609c60206040519681808901997f3c73766720786d6c6e733d22687474703a2f2f7777772e77332e6f72672f32308b527f30302f737667222076696577426f783d2230203020343530203435302220776960408b015276323a341e911a1a9811103432b4b3b43a1e911a1a98111f60491b60608b01527f3c726563742077696474683d2234353022206865696768743d2234353022206660778b01526434b6361e9160d91b60978b0152805191829101858b015e8801906211179f60e91b848301527f3c656c6c697073652063783d22323235222063793d22343034222072783d2231609f8301527f3136222072793d223136222066696c6c3d22233030303030303330222f3e000060bf83015274078ce40e8e4c2dce6ccdee4da7a44e4dee8c2e8ca5605b1b60dd83015280519283910160f283015e0101916a1019191a90191a9814911f60a91b60568401527f3c7265637420783d223139362220793d22333630222077696474683d22313822606184015279103432b4b3b43a1e9119981110393c1e911b11103334b6361e9160311b6081840152611ba66003603e88603d604560568b5160208d019a818c609b83015e01016211179f60e91b828201527f3c7265637420783d223233362220793d22333630222077696474683d22313822604882015279103432b4b3b43a1e9119981110393c1e911b11103334b6361e9160311b60688201528b5190818b608283015e01016211179f60e91b828201527f3c7265637420783d223137362220793d22333330222077696474683d2239382260408201527a103432b4b3b43a1e911a191110393c1e91189a11103334b6361e9160291b60608201528a5190818a607b83015e01016211179f60e91b838201520301601c19810189520187611605565b605d6040519360208501965f5160206138405f395f51905f5288527f22206865696768743d22323030222072783d223330222066696c6c3d220000006040870152835180602086018589015e8601906211179f60e91b848301525f5160206138405f395f51905f5260608301527f22206865696768743d22323030222072783d223330222066696c6c3d226e6f6e60808301526a32911039ba3937b5b29e9160a91b60a083015251809260ab83015e01019473111039ba3937b5b296bbb4b23a341e911b11179f60611b604e8701525f5160206138805f395f51905f5260628701527f22206865696768743d22313438222072783d223138222066696c6c3d22233130608287015266189998a091179f60c91b60a28701525f5160206138805f395f51905f5260a98701527f22206865696768743d22313438222072783d223138222066696c6c3d226e6f6e60c98701526a32911039ba3937b5b29e9160a91b60e9870152611d6c602a60a686604e895160208b019b818d60f483015e01017f22207374726f6b652d6f7061636974793d22302e323522207374726f6b652d77838201526934b23a341e911991179f60b11b60c68201520301600a810187520185611605565b611d7d8560ff606086015116612a25565b611d8e8660ff608087015116612ecc565b60c08501519092901561209b57604051681e33903334b6361e9160b91b6020820152611df160166029838c8c5180918484015e81017511103334b63616b7b830b1b4ba3c9e911817189a111f60511b838201520301600919810184520182611605565b5f905b60088210611ff357611e06915061324e565b935b87604051611e17606082611605565b602681527f3c672066696c6c3d2223303030303030222066696c6c2d6f7061636974793d226020820152651817189b111f60d11b60408201525f5b60188110611f475750611e649061324e565b9660a0015160ff1691611e7692613286565b956040519a8b9a51809160208d015e8a019060208201905f8252519283915e016020015f815281516020819301825e015f815281516020819301825e015f815281516020819301825e015f815281516020819301825e015f815281516020819301825e01907f3c636972636c652063783d22323235222063793d223332302220723d223522208252653334b6361e9160d11b6020830152518092602683015e016c11179f1e17b39f1e17b9bb339f60991b60268201520360260160121981018252600d01611f449082611605565b90565b91506006820282810460061483151715610f8c57609e019081609e11610f8c57611fe9601a60116020938480611f7e600198612243565b6040519784899551918291018487015e840190701e3932b1ba103c1e91189a1b11103c9e9160791b83830152805192839101603183015e01017911103bb4b23a341e91189a9c11103432b4b3b43a1e911991179f60311b838201520301600519810184520182611605565b9101908991611e52565b6012820282810460121483151715610f8c5760a401908160a411610f8c57612093601a60116020938480612028600198612243565b6040519784899551918291018487015e840190701e3932b1ba103c1e91189a1b11103c9e9160791b83830152805192839101603183015e01017911103bb4b23a341e91189a9c11103432b4b3b43a1e911b11179f60311b838201520301600519810184520182611605565b910190611df4565b6040516120a9602082611605565b5f815293611e08565b5f818152600260205260409020546001600160a01b03169081156120d4575090565b637e27328960e01b5f5260045260245ffd5b6008546001600160a01b031633036120fa57565b63118cdaa760e01b5f523360045260245ffd5b823b61211b575b5050505050565b604051630a85bd0160e11b81526001600160a01b039182166004820152918116602483015260448201939093526080606482015291169160209082908190612167906084830190611560565b03815f865af15f91816121fe575b506121ca57503d156121c3573d61218b81611628565b906121996040519283611605565b81523d5f602083013e5b805190816121be5782633250574960e11b5f5260045260245ffd5b602001fd5b60606121a3565b6001600160e01b03191663757a42ff60e11b016121ec57505f80808080612114565b633250574960e11b5f5260045260245ffd5b9091506020813d60201161223b575b8161221a60209383611605565b8101031261018857516001600160e01b03198116810361018857905f612175565b3d915061220d565b5f908072184f03e93ff9f4daa797ed6e38ed64bf6a1f0160401b81101561238d575b600a906904ee2d6d415b85acef8160201b811015612371575b662386f26fc1000081101561235d575b6305f5e10081101561234c575b61271081101561233d575b606481101561232f575b1015612324575b600a602160018401936122c985611628565b946122d76040519687611605565b8086526122e6601f1991611628565b013660208701378401015b5f1901916f181899199a1a9b1b9c1cb0b131b232b360811b8282061a835304801561231f57600a90916122f1565b505090565b6001909101906122b7565b6064600291049301926122b0565b612710600491049301926122a6565b6305f5e1006008910493019261229b565b662386f26fc100006010910493019261228e565b602093909301926904ee2d6d415b85acef8160201b900461227e565b506040915072184f03e93ff9f4daa797ed6e38ed64bf6a1f0160401b8104612265565b60ff1680156125d25760018114612569576002811461250457600381146124a05760041461243c57604080516123e68282611605565b600481526314d85b9960e21b60208201529181516124048382611605565b600781526608d0ce504d4dcd60ca1b60208201529161242581519182611605565b600781526611a0999c199a9b60c91b602082015290565b6040805161244a8282611605565b6004815263506c756d60e01b60208201529181516124688382611605565b6007815266119b211a1a9b1960c91b60208201529161248981519182611605565b6007815266046688a666268760cb1b602082015290565b50604080516124af8282611605565b600381526253656160e81b60208201529181516124cc8382611605565b60078152661199a31b229b2160c91b6020820152916124ed81519182611605565b600781526608cc90cd118d1160ca1b602082015290565b50604080516125138282611605565b6004815263149d5cdd60e21b60208201529181516125318382611605565b600781526608d04e0d4d0ccd60ca1b60208201529161255281519182611605565b6007815266119ba299a2191b60c91b602082015290565b50604080516125788282611605565b6008815267477261706869746560c01b602082015291815161259a8382611605565b60078152662333413341334560c81b6020820152916125bb81519182611605565b60078152662332363236324160c81b602082015290565b50604080516125e18282611605565b6004815263426f6e6560e01b60208201529181516125ff8382611605565b600781526608d14e114c910d60ca1b60208201529161262081519182611605565b60078152660468668848682760cb1b602082015290565b60ff1680156127ba5760018114612774576002811461272f57600381146126ea576004146126a457604090815161266e8382611605565b60058152642830b832b960d91b60208201529161268d81519182611605565b600781526611a31922a3229b60c91b602082015290565b60409081516126b38382611605565b6006815265159a5bdb195d60d21b6020820152916126d381519182611605565b600781526611a11a9c21a32360c91b602082015290565b5060409081516126fa8382611605565b6004815263526f736560e01b60208201529161271881519182611605565b60078152662346463741394360c81b602082015290565b50604090815161273f8382611605565b600481526321bcb0b760e11b60208201529161275d81519182611605565b60078152660466c62886c8a760cb1b602082015290565b5060409081516127848382611605565b600581526423b932b2b760d91b6020820152916127a381519182611605565b60078152662335424535384160c81b602082015290565b5060409081516127ca8382611605565b600581526420b6b132b960d91b6020820152916127e981519182611605565b600781526611a323211899a160c91b602082015290565b60ff168015612983576001811461293e57600281146128fa57600381146128b35760041461286d5760409081516128378382611605565b6005815264084d8eae6d60db1b60208201529161285681519182611605565b600781526608d14d509190cd60ca1b602082015290565b604090815161287c8382611605565b6006815265213aba3a32b960d11b60208201529161289c81519182611605565b60078152662345464439413360c81b602082015290565b5060409081516128c38382611605565b60068152652634b1b432b760d11b6020820152916128e381519182611605565b600781526608d0cd90d1908d60ca1b602082015290565b50604090815161290a8382611605565b6003815262536b7960e81b60208201529161292781519182611605565b60078152662342464433444560c81b602082015290565b50604090815161294e8382611605565b6004815263111d5cdd60e21b60208201529161296c81519182611605565b60078152660234439433743360cc1b602082015290565b5060409081516129938382611605565b6005815264437265616d60d81b6020820152916129b281519182611605565b600781526611a2a2229b221b60c91b602082015290565b5f81126129d957611f4490612243565b600160ff1b8114610f8c57611f4460216129f66020935f03612243565b604051938491602d60f81b828401528051918291018484015e81015f838201520301601f198101835282611605565b60ff168015612e175760018114612d3c5760028114612c60579081600360209314612b8757600414612ad0576003605c611f44926040519485917f3c7265637420783d223136302220793d22323234222077696474683d22313330828401527b11103432b4b3b43a1e911c9110393c1e911a171a91103334b6361e9160211b60408401528051918291018484015e81016211179f60e91b838201520301601c19810184520182611605565b605b6037611f4492604051948591761e33903334b6361e913737b732911039ba3937b5b29e9160491b828401528051918291018484015e81017f22207374726f6b652d77696474683d2236223e3c636972636c652063783d2231838201527f3835222063793d223232382220723d223135222f3e3c636972636c652063783d60578201527a11191b1a911031bc9e9119191c1110391e91189a91179f1e17b39f60291b60778201520301603b810184520182611605565b50608c602b611f44926040519485916a1e339039ba3937b5b29e9160a91b828401528051918291018484015e81015f5160206138605f395f51905f52838201527f703d22726f756e64223e3c7061746820643d224d31373220323134204c323030604b8201527810191a1910269918181019189a1026189b9910191a1911179f60391b606b8201527f3c7061746820643d224d32353220323134204c32383020323432204d3238302060848201527219189a1026191a9910191a1911179f1e17b39f60691b60a48201520301606c810184520182611605565b50611f446003603e605b936040519485917f3c7265637420783d223136382220793d22323236222077696474683d2233342260208401527a103432b4b3b43a1e911b9110393c1e9119971a91103334b6361e9160291b6040840152805190602081019180838587015e8401907f222f3e3c7265637420783d223234382220793d22323236222077696474683d22848301527f333422206865696768743d2237222072783d22332e35222066696c6c3d220000607b830152518092609983015e01016211179f60e91b838201520301601c19810184520182611605565b50611f446003603d605a936040519485917f3c7265637420783d223136382220793d22323132222077696474683d22333422602084015279103432b4b3b43a1e91199a1110393c1e911a11103334b6361e9160311b6040840152805190602081019180838587015e8401907f222f3e3c7265637420783d223234382220793d22323132222077696474683d22848301527f333422206865696768743d223334222072783d2234222066696c6c3d22000000607a830152518092609783015e01016211179f60e91b838201520301601c19810184520182611605565b50611f446003602a6047936040519485917f3c636972636c652063783d22313835222063793d223232382220723d22313122602084015266103334b6361e9160c91b6040840152805190602081019180838587015e8401907f222f3e3c636972636c652063783d22323635222063793d223232382220723d228483015269189891103334b6361e9160b11b6067830152518092607183015e01016211179f60e91b838201520301601c19810184520182611605565b60ff1680156131cd576001811461313557600281146130a95760038114612ff957600414612f095750604051612f03602082611605565b5f815290565b611f446063605a6020936040519485917f3c7265637420783d223139362220793d22323738222077696474683d223538228284015279103432b4b3b43a1e9119181110393c1e911991103334b6361e9160311b60408401528051918291018484015e81017f222f3e3c67207374726f6b653d2223303030303030353522207374726f6b652d838201527f77696474683d2233223e3c7061746820643d224d323135203237382056323938607a8201527f204d323335203237382056323938204d313936203238382048323534222f3e3c609a8201526217b39f60e91b60ba82015203016043810184520182611605565b50611f44602b60606020936040519485917f3c7061746820643d224d3139322032383820713131202d313220323220302074828401527f32322030207432322030222066696c6c3d226e6f6e6522207374726f6b653d2260408401528051918291018484015e81017f22207374726f6b652d77696474683d223622207374726f6b652d6c696e656361838201526a381e913937bab73211179f60a91b60808201520301600b810184520182611605565b50611f44601460556020936040519485917f3c636972636c652063783d22323235222063793d223238382220723d223135228284015274103334b6361e913737b732911039ba3937b5b29e9160591b60408401528051918291018484015e810173111039ba3937b5b296bbb4b23a341e911b11179f60611b838201520301600b19810184520182611605565b50611f44602b60586020936040519485917f3c7061746820643d224d3139362032373820513232352033303620323534203282840152771b9c11103334b6361e913737b732911039ba3937b5b29e9160411b60408401528051918291018484015e81015f5160206138605f395f51905f52838201526a381e913937bab73211179f60a91b60788201520301600b810184520182611605565b50611f446003605b6020936040519485917f3c7265637420783d223230302220793d22323834222077696474683d22353022828401527a103432b4b3b43a1e911b9110393c1e9119971a91103334b6361e9160291b60408401528051918291018484015e81016211179f60e91b838201520301601c19810184520182611605565b906118c66004602080946040519581879251918291018484015e8101631e17b39f60e11b838201520301601b19810185520183611605565b60ff909291921690811561366f576040519161331260356028856020808201986739ba3937b5b29e9160c11b8a528051918291018484015e81017f22207374726f6b652d77696474683d223822207374726f6b652d6c696e6563618382015274381e913937bab73211103334b6361e913737b7329160591b604882015203016015810186520184611605565b600181146135d457600281146134de57600314613424576028611f449260276003936040519687937f3c7061746820643d224d31393620313334204c313730203838204d323534203160208601526b0199a1026191c18101c1c11160a51b6040860152518091604c86015e8301907f2f3e3c636972636c652063783d22313730222063793d2238322220723d223922604c83015266103334b6361e9160c91b606c830152604c815160208301938185607383015e0101907f222f3e3c636972636c652063783d22323830222063793d2238322220723d2239848301526711103334b6361e9160c11b6047830152518092604f83015e01016211179f60e91b838201520301601c19810184520182611605565b6036611f4492603860206014946040519788947701e3830ba3410321e912699191a90189999102b18981a11160451b848701525180918587015e8401907f2f3e3c636972636c652063783d22323235222063793d2238382220723d223137848301527511103334b6361e913737b732911039ba3937b5b29e9160511b6058830152805192839101606e83015e010173111039ba3937b5b296bbb4b23a341e911b91179f60611b838201520301600b19810184520182611605565b506028611f449260276003936040519687937f3c7061746820643d224d313930203133322056313030204d323630203133322060208601526502b18981811160d51b6040860152518091604686015e8301907f2f3e3c636972636c652063783d22313930222063793d2239322220723d223922604683015266103334b6361e9160c91b60668301526046815160208301938185606d83015e0101907f222f3e3c636972636c652063783d22323630222063793d2239322220723d2239848301526711103334b6361e9160c11b6047830152518092604f83015e01016211179f60e91b838201520301601c19810184520182611605565b506028611f4492603760206003946040519788947601e3830ba3410321e912699191a90189999102b1c99111604d1b848701525180918587015e8401907f2f3e3c636972636c652063783d22323235222063793d2238342220723d223132848301526711103334b6361e9160c11b6057830152805192839101605f83015e01016211179f60e91b838201520301601c19810184520182611605565b505050604051612f03602082611605565b5f90815260046020526040902080546001600160a01b0319169055565b908151156137bc57815160028101809111610f8c5760039004600281901b91906001600160fe1b03811603610f8c57604051917f4142434445464748494a4b4c4d4e4f505152535455565758595a616263646566601f527f6768696a6b6c6d6e6f707172737475767778797a303132333435363738392b2f603f52602083018480518101602081018051915f82525b808910613780575060209596975090600392915251068060011461376b5760021461375e575b50808452830101604052565b603d905f1901535f613752565b50603d90815f1982015360011901535f613752565b939760036004910198603f8a51818160121c165183538181600c1c16516001840153818160061c1651600284015316516003820153019361372c565b9050604051612f03602082611605565b906006811015610a325760051b0190565b604051906137ec604083611605565b60048252634e6f6e6560e01b602083015256fe8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e0ddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef3c7265637420783d223132302220793d22313332222077696474683d2232313022207374726f6b652d77696474683d223722207374726f6b652d6c696e6563613c7265637420783d223134362220793d22313538222077696474683d22313538a2646970667358221220532655ff2004b7ba35a66b4faf11b814b533a066b5823679776237ca2d5b0ef364736f6c63430008240033
| Token | Symbol | Balance | Price | Value |
|---|---|---|---|---|
| no token holdings | ||||
| Transaction Hash | Method | Block | Age | From | To | Type | Item | ||
|---|---|---|---|---|---|---|---|---|---|
| no NFT transfers for this address yet | |||||||||
| Block | Age | Parent Transaction Hash | Type | Method | From | To | Value | |
|---|---|---|---|---|---|---|---|---|
| no internal transactions found for this address yet (traced blocks + on-demand) | ||||||||
| Type | Age | Block | Details |
|---|---|---|---|
| no cross-chain L1↔L2 transactions for this address | |||
| Txn Hash | Age | Event | Topics / Data |
|---|---|---|---|
| 0x4272c3…0c5724 | 6 hrs agoMon, 17 Aug 2026 13:44:10 UTC | ApprovalForAll | [0] 0x000000000000…fb055c5f [1] 0x000000000000…0000c300 data: 0x000000000000000000…00000001 |
| 0x1077cf…1662ad | 7 hrs agoMon, 17 Aug 2026 13:22:25 UTC | Transfer | [0] 0x000000000000…dfa01e4f [1] 0x000000000000…30b66224 [2] 0x000000000000…00000236 |
| 0x771386…1785d0 | 7 hrs agoMon, 17 Aug 2026 13:21:46 UTC | Transfer | [0] 0x000000000000…c9f6a357 [1] 0x000000000000…30b66224 [2] 0x000000000000…000001fd |
| 0x771386…1785d0 | 7 hrs agoMon, 17 Aug 2026 13:21:46 UTC | Transfer | [0] 0x000000000000…a9d54dd8 [1] 0x000000000000…30b66224 [2] 0x000000000000…0000000d |
| 0xcb6390…db87f0 | 7 hrs agoMon, 17 Aug 2026 13:16:59 UTC | ApprovalForAll | [0] 0x000000000000…c812e0d3 [1] 0x000000000000…0000c300 data: 0x000000000000000000…00000001 |
| 0x6355c5…854c39 | 7 hrs agoMon, 17 Aug 2026 13:15:56 UTC | ApprovalForAll | [0] 0x000000000000…c9f6a357 [1] 0x000000000000…0000c300 data: 0x000000000000000000…00000001 |
| 0x864904…e39b36 | 7 hrs agoMon, 17 Aug 2026 13:15:56 UTC | ApprovalForAll | [0] 0x000000000000…6428521a [1] 0x000000000000…0000c300 data: 0x000000000000000000…00000001 |
| 0xc7bf9c…e44bc1 | 7 hrs agoMon, 17 Aug 2026 13:15:56 UTC | ApprovalForAll | [0] 0x000000000000…d00865cd [1] 0x000000000000…0000c300 data: 0x000000000000000000…00000001 |
| 0x05eada…aecab2 | 7 hrs agoMon, 17 Aug 2026 13:15:56 UTC | ApprovalForAll | [0] 0x000000000000…2f22b68e [1] 0x000000000000…0000c300 data: 0x000000000000000000…00000001 |
| 0x95a033…cb277f | 7 hrs agoMon, 17 Aug 2026 13:15:56 UTC | ApprovalForAll | [0] 0x000000000000…096a1dba [1] 0x000000000000…0000c300 data: 0x000000000000000000…00000001 |
| 0xcea141…a88a43 | 7 hrs agoMon, 17 Aug 2026 13:15:56 UTC | ApprovalForAll | [0] 0x000000000000…aee22736 [1] 0x000000000000…0000c300 data: 0x000000000000000000…00000001 |
| 0x01850b…843c96 | 7 hrs agoMon, 17 Aug 2026 13:15:56 UTC | ApprovalForAll | [0] 0x000000000000…08dca80f [1] 0x000000000000…0000c300 data: 0x000000000000000000…00000001 |
| 0x9612f7…c1110f | 7 hrs agoMon, 17 Aug 2026 13:13:00 UTC | ApprovalForAll | [0] 0x000000000000…90273b3e [1] 0x000000000000…0000c300 data: 0x000000000000000000…00000001 |
| 0x881b69…b51bab | 7 hrs agoMon, 17 Aug 2026 12:57:16 UTC | Transfer | [0] 0x000000000000…2346e974 [1] 0x000000000000…7676289d [2] 0x000000000000…0000051f |
| 0x881b69…b51bab | 7 hrs agoMon, 17 Aug 2026 12:57:16 UTC | Transfer | [0] 0x000000000000…2346e974 [1] 0x000000000000…7676289d [2] 0x000000000000…00000539 |
| 0x881b69…b51bab | 7 hrs agoMon, 17 Aug 2026 12:57:16 UTC | Transfer | [0] 0x000000000000…2346e974 [1] 0x000000000000…7676289d [2] 0x000000000000…00000520 |
| 0xcf8d58…70f4ba | 7 hrs agoMon, 17 Aug 2026 12:56:59 UTC | Transfer | [0] 0x000000000000…2346e974 [1] 0x000000000000…7676289d [2] 0x000000000000…0000051d |
| 0xcf8d58…70f4ba | 7 hrs agoMon, 17 Aug 2026 12:56:59 UTC | Transfer | [0] 0x000000000000…2346e974 [1] 0x000000000000…7676289d [2] 0x000000000000…0000051e |
| 0xcf8d58…70f4ba | 7 hrs agoMon, 17 Aug 2026 12:56:59 UTC | Transfer | [0] 0x000000000000…2346e974 [1] 0x000000000000…7676289d [2] 0x000000000000…00000528 |
| 0xee04ba…0ede78 | 7 hrs agoMon, 17 Aug 2026 12:56:16 UTC | Transfer | [0] 0x000000000000…91f2a309 [1] 0x000000000000…f1486608 [2] 0x000000000000…000001b3 |
| 0xee04ba…0ede78 | 7 hrs agoMon, 17 Aug 2026 12:56:16 UTC | Transfer | [0] 0x000000000000…2346e974 [1] 0x000000000000…f1486608 [2] 0x000000000000…0000052e |
| 0xee04ba…0ede78 | 7 hrs agoMon, 17 Aug 2026 12:56:16 UTC | Transfer | [0] 0x000000000000…dd57f5fd [1] 0x000000000000…f1486608 [2] 0x000000000000…0000022a |
| 0xee04ba…0ede78 | 7 hrs agoMon, 17 Aug 2026 12:56:16 UTC | Transfer | [0] 0x000000000000…f3e90706 [1] 0x000000000000…f1486608 [2] 0x000000000000…00000230 |
| 0xee04ba…0ede78 | 7 hrs agoMon, 17 Aug 2026 12:56:16 UTC | Transfer | [0] 0x000000000000…7c4f7fa8 [1] 0x000000000000…f1486608 [2] 0x000000000000…0000022e |
| 0xee04ba…0ede78 | 7 hrs agoMon, 17 Aug 2026 12:56:16 UTC | Transfer | [0] 0x000000000000…2346e974 [1] 0x000000000000…f1486608 [2] 0x000000000000…00000546 |
| Transaction Hash | Method | Block | Age | From | To | Amount | Token | ||
|---|---|---|---|---|---|---|---|---|---|
| no token transfers for this address yet | |||||||||
| Transaction Hash | Method ? | Block | Age | From | To | Amount | Txn Fee ? | ||
|---|---|---|---|---|---|---|---|---|---|
| 0x4272c3…0c5724 | Set Approval For All | 38,881,960 | 6 hrs agoMon, 17 Aug 2026 13:44:10 UTC | 0x31ef…5c5f | IN | Terminals | $0.000 ETH | 0.00000097 | |
| 0xcb6390…db87f0 | Set Approval For All | 38,865,633 | 7 hrs agoMon, 17 Aug 2026 13:16:59 UTC | 0xe266…e0d3 | IN | Terminals | $0.000 ETH | 0.00000096 | |
| 0x6355c5…854c39 | Set Approval For All | 38,865,004 | 7 hrs agoMon, 17 Aug 2026 13:15:56 UTC | 0x99ad…a357 | IN | Terminals | $0.000 ETH | 0.00000095 | |
| 0x864904…e39b36 | Set Approval For All | 38,865,004 | 7 hrs agoMon, 17 Aug 2026 13:15:56 UTC | 0x0f63…521a | IN | Terminals | $0.000 ETH | 0.00000095 | |
| 0xc7bf9c…e44bc1 | Set Approval For All | 38,865,003 | 7 hrs agoMon, 17 Aug 2026 13:15:56 UTC | 0xd22d…65cd | IN | Terminals | $0.000 ETH | 0.00000095 | |
| 0x05eada…aecab2 | Set Approval For All | 38,865,003 | 7 hrs agoMon, 17 Aug 2026 13:15:56 UTC | 0x7d18…b68e | IN | Terminals | $0.000 ETH | 0.00000095 | |
| 0x01850b…843c96 | Set Approval For All | 38,865,001 | 7 hrs agoMon, 17 Aug 2026 13:15:56 UTC | 0x2d68…a80f | IN | Terminals | $0.000 ETH | 0.00000095 | |
| 0x95a033…cb277f | Set Approval For All | 38,865,001 | 7 hrs agoMon, 17 Aug 2026 13:15:56 UTC | 0xb804…1dba | IN | Terminals | $0.000 ETH | 0.00000095 | |
| 0xcea141…a88a43 | Set Approval For All | 38,865,001 | 7 hrs agoMon, 17 Aug 2026 13:15:56 UTC | 0xed76…2736 | IN | Terminals | $0.000 ETH | 0.00000095 | |
| 0x9612f7…c1110f | Set Approval For All | 38,863,249 | 7 hrs agoMon, 17 Aug 2026 13:13:00 UTC | 0xc9fa…3b3e | IN | Terminals | $0.000 ETH | 0.00000094 | |
| 0x5182a6…18ca61 | Set Approval For All | 38,851,184 | 7 hrs agoMon, 17 Aug 2026 12:52:50 UTC | 0xe7ef…c489 | IN | Terminals | $0.000 ETH | 0.00000048 | |
| 0x4f9896…b93ee4 | Safe Transfer From | 38,818,686 | 8 hrs agoMon, 17 Aug 2026 11:58:29 UTC | 0x5869…a373 | IN | Terminals | $0.000 ETH | 0.00000082 | |
| 0x87e96f…048be2 | Safe Transfer From | 38,818,686 | 8 hrs agoMon, 17 Aug 2026 11:58:29 UTC | 0x2948…50e0 | IN | Terminals | $0.000 ETH | 0.00000082 | |
| 0x6c5ae4…b8eb39 | Safe Transfer From | 38,818,686 | 8 hrs agoMon, 17 Aug 2026 11:58:29 UTC | 0xa840…bc0e | IN | Terminals | $0.000 ETH | 0.00000082 | |
| 0x4a029d…e32d8f | Safe Transfer From | 38,818,686 | 8 hrs agoMon, 17 Aug 2026 11:58:29 UTC | 0x9168…a1ae | IN | Terminals | $0.000 ETH | 0.00000082 | |
| 0xa9d95f…239021 | Safe Transfer From | 38,818,685 | 8 hrs agoMon, 17 Aug 2026 11:58:28 UTC | 0xdb22…774a | IN | Terminals | $0.000 ETH | 0.00000082 | |
| 0xd3d172…65d24c | Safe Transfer From | 38,818,685 | 8 hrs agoMon, 17 Aug 2026 11:58:28 UTC | 0x289c…fcb2 | IN | Terminals | $0.000 ETH | 0.00000082 | |
| 0x1ac281…392816 | Safe Transfer From | 38,818,685 | 8 hrs agoMon, 17 Aug 2026 11:58:28 UTC | 0x1b25…e3eb | IN | Terminals | $0.000 ETH | 0.00000082 | |
| 0xa88cd3…346a6b | Safe Transfer From | 38,818,685 | 8 hrs agoMon, 17 Aug 2026 11:58:28 UTC | 0xfd91…e801 | IN | Terminals | $0.000 ETH | 0.00000082 | |
| 0x44fe9f…dbbca5 | Safe Transfer From | 38,818,685 | 8 hrs agoMon, 17 Aug 2026 11:58:28 UTC | 0xc5fa…c5ba | IN | Terminals | $0.000 ETH | 0.00000082 | |
| 0x2cdeb1…028778 | Set Approval For All | 38,817,232 | 8 hrs agoMon, 17 Aug 2026 11:56:02 UTC | 0x540b…84f5 | IN | Terminals | $0.000 ETH | 0.00000093 | |
| 0x91a1e2…7533b9 | Set Approval For All | 38,817,231 | 8 hrs agoMon, 17 Aug 2026 11:56:02 UTC | 0xe4f5…350c | IN | Terminals | $0.000 ETH | 0.00000093 | |
| 0x2fc0ef…b85618 | Set Approval For All | 38,817,231 | 8 hrs agoMon, 17 Aug 2026 11:56:02 UTC | 0xe81d…b417 | IN | Terminals | $0.000 ETH | 0.00000093 | |
| 0x01e52d…6405fc | Set Approval For All | 38,817,230 | 8 hrs agoMon, 17 Aug 2026 11:56:02 UTC | 0xf851…50a9 | IN | Terminals | $0.000 ETH | 0.00000093 | |
| 0xd34a0f…ef13b7 | Set Approval For All | 38,817,230 | 8 hrs agoMon, 17 Aug 2026 11:56:02 UTC | 0xfb31…9304 | IN | Terminals | $0.000 ETH | 0.00000093 |