ERC-20
Source Code
Add Token to MetaMask (Web3)Overview
Max Total Supply
100,000,000,000 ROGUE
Holders
28,391
Market
Price
$0.00 @ 0.000000 ETH
Onchain Market Cap
-
Circulating Supply Market Cap
-
Other Info
Token Contract (WITH 18 Decimals)
Balance
10.071936078619782047 ROGUEValue
$0.00Loading...
Loading
Loading...
Loading
Loading...
Loading
Contract Name:
Rogue
Compiler Version
v0.8.20+commit.a1b79de6
Contract Source Code (Solidity)
/**
*Submitted for verification at Arbiscan.io on 2025-09-13
*/
// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.0.0) (governance/utils/IVotes.sol)
pragma solidity ^0.8.20;
/**
* @dev Common interface for {ERC20Votes}, {ERC721Votes}, and other {Votes}-enabled contracts.
*/
interface IVotes {
/**
* @dev The signature used has expired.
*/
error VotesExpiredSignature(uint256 expiry);
/**
* @dev Emitted when an account changes their delegate.
*/
event DelegateChanged(address indexed delegator, address indexed fromDelegate, address indexed toDelegate);
/**
* @dev Emitted when a token transfer or delegate change results in changes to a delegate's number of voting units.
*/
event DelegateVotesChanged(address indexed delegate, uint256 previousVotes, uint256 newVotes);
/**
* @dev Returns the current amount of votes that `account` has.
*/
function getVotes(address account) external view returns (uint256);
/**
* @dev Returns the amount of votes that `account` had at a specific moment in the past. If the `clock()` is
* configured to use block numbers, this will return the value at the end of the corresponding block.
*/
function getPastVotes(address account, uint256 timepoint) external view returns (uint256);
/**
* @dev Returns the total supply of votes available at a specific moment in the past. If the `clock()` is
* configured to use block numbers, this will return the value at the end of the corresponding block.
*
* NOTE: This value is the sum of all available votes, which is not necessarily the sum of all delegated votes.
* Votes that have not been delegated are still part of total supply, even though they would not participate in a
* vote.
*/
function getPastTotalSupply(uint256 timepoint) external view returns (uint256);
/**
* @dev Returns the delegate that `account` has chosen.
*/
function delegates(address account) external view returns (address);
/**
* @dev Delegates votes from the sender to `delegatee`.
*/
function delegate(address delegatee) external;
/**
* @dev Delegates votes from signer to `delegatee`.
*/
function delegateBySig(address delegatee, uint256 nonce, uint256 expiry, uint8 v, bytes32 r, bytes32 s) external;
}
interface IERC6372 {
/**
* @dev Clock used for flagging checkpoints. Can be overridden to implement timestamp based checkpoints (and voting).
*/
function clock() external view returns (uint48);
/**
* @dev Description of the clock
*/
// solhint-disable-next-line func-name-mixedcase
function CLOCK_MODE() external view returns (string memory);
}
interface IERC5805 is IERC6372, IVotes {}
/**
* @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;
}
}
/**
* @dev Elliptic Curve Digital Signature Algorithm (ECDSA) operations.
*
* These functions can be used to verify that a message was signed by the holder
* of the private keys of a given address.
*/
library ECDSA {
enum RecoverError {
NoError,
InvalidSignature,
InvalidSignatureLength,
InvalidSignatureS
}
/**
* @dev The signature derives the `address(0)`.
*/
error ECDSAInvalidSignature();
/**
* @dev The signature has an invalid length.
*/
error ECDSAInvalidSignatureLength(uint256 length);
/**
* @dev The signature has an S value that is in the upper half order.
*/
error ECDSAInvalidSignatureS(bytes32 s);
/**
* @dev Returns the address that signed a hashed message (`hash`) with `signature` or an error. This will not
* return address(0) without also returning an error description. Errors are documented using an enum (error type)
* and a bytes32 providing additional information about the error.
*
* If no error is returned, then the address can be used for verification purposes.
*
* The `ecrecover` EVM precompile allows for malleable (non-unique) signatures:
* this function rejects them by requiring the `s` value to be in the lower
* half order, and the `v` value to be either 27 or 28.
*
* IMPORTANT: `hash` _must_ be the result of a hash operation for the
* verification to be secure: it is possible to craft signatures that
* recover to arbitrary addresses for non-hashed data. A safe way to ensure
* this is by receiving a hash of the original message (which may otherwise
* be too long), and then calling {MessageHashUtils-toEthSignedMessageHash} on it.
*
* Documentation for signature generation:
* - with https://web3js.readthedocs.io/en/v1.3.4/web3-eth-accounts.html#sign[Web3.js]
* - with https://docs.ethers.io/v5/api/signer/#Signer-signMessage[ethers]
*/
function tryRecover(bytes32 hash, bytes memory signature) internal pure returns (address, RecoverError, bytes32) {
if (signature.length == 65) {
bytes32 r;
bytes32 s;
uint8 v;
// ecrecover takes the signature parameters, and the only way to get them
// currently is to use assembly.
/// @solidity memory-safe-assembly
assembly {
r := mload(add(signature, 0x20))
s := mload(add(signature, 0x40))
v := byte(0, mload(add(signature, 0x60)))
}
return tryRecover(hash, v, r, s);
} else {
return (address(0), RecoverError.InvalidSignatureLength, bytes32(signature.length));
}
}
/**
* @dev Returns the address that signed a hashed message (`hash`) with
* `signature`. This address can then be used for verification purposes.
*
* The `ecrecover` EVM precompile allows for malleable (non-unique) signatures:
* this function rejects them by requiring the `s` value to be in the lower
* half order, and the `v` value to be either 27 or 28.
*
* IMPORTANT: `hash` _must_ be the result of a hash operation for the
* verification to be secure: it is possible to craft signatures that
* recover to arbitrary addresses for non-hashed data. A safe way to ensure
* this is by receiving a hash of the original message (which may otherwise
* be too long), and then calling {MessageHashUtils-toEthSignedMessageHash} on it.
*/
function recover(bytes32 hash, bytes memory signature) internal pure returns (address) {
(address recovered, RecoverError error, bytes32 errorArg) = tryRecover(hash, signature);
_throwError(error, errorArg);
return recovered;
}
/**
* @dev Overload of {ECDSA-tryRecover} that receives the `r` and `vs` short-signature fields separately.
*
* See https://eips.ethereum.org/EIPS/eip-2098[EIP-2098 short signatures]
*/
function tryRecover(bytes32 hash, bytes32 r, bytes32 vs) internal pure returns (address, RecoverError, bytes32) {
unchecked {
bytes32 s = vs & bytes32(0x7fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff);
// We do not check for an overflow here since the shift operation results in 0 or 1.
uint8 v = uint8((uint256(vs) >> 255) + 27);
return tryRecover(hash, v, r, s);
}
}
/**
* @dev Overload of {ECDSA-recover} that receives the `r and `vs` short-signature fields separately.
*/
function recover(bytes32 hash, bytes32 r, bytes32 vs) internal pure returns (address) {
(address recovered, RecoverError error, bytes32 errorArg) = tryRecover(hash, r, vs);
_throwError(error, errorArg);
return recovered;
}
/**
* @dev Overload of {ECDSA-tryRecover} that receives the `v`,
* `r` and `s` signature fields separately.
*/
function tryRecover(
bytes32 hash,
uint8 v,
bytes32 r,
bytes32 s
) internal pure returns (address, RecoverError, bytes32) {
// EIP-2 still allows signature malleability for ecrecover(). Remove this possibility and make the signature
// unique. Appendix F in the Ethereum Yellow paper (https://ethereum.github.io/yellowpaper/paper.pdf), defines
// the valid range for s in (301): 0 < s < secp256k1n ÷ 2 + 1, and for v in (302): v ∈ {27, 28}. Most
// signatures from current libraries generate a unique signature with an s-value in the lower half order.
//
// If your library generates malleable signatures, such as s-values in the upper range, calculate a new s-value
// with 0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEBAAEDCE6AF48A03BBFD25E8CD0364141 - s1 and flip v from 27 to 28 or
// vice versa. If your library also generates signatures with 0/1 for v instead 27/28, add 27 to v to accept
// these malleable signatures as well.
if (uint256(s) > 0x7FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF5D576E7357A4501DDFE92F46681B20A0) {
return (address(0), RecoverError.InvalidSignatureS, s);
}
// If the signature is valid (and not malleable), return the signer address
address signer = ecrecover(hash, v, r, s);
if (signer == address(0)) {
return (address(0), RecoverError.InvalidSignature, bytes32(0));
}
return (signer, RecoverError.NoError, bytes32(0));
}
/**
* @dev Overload of {ECDSA-recover} that receives the `v`,
* `r` and `s` signature fields separately.
*/
function recover(bytes32 hash, uint8 v, bytes32 r, bytes32 s) internal pure returns (address) {
(address recovered, RecoverError error, bytes32 errorArg) = tryRecover(hash, v, r, s);
_throwError(error, errorArg);
return recovered;
}
/**
* @dev Optionally reverts with the corresponding custom error according to the `error` argument provided.
*/
function _throwError(RecoverError error, bytes32 errorArg) private pure {
if (error == RecoverError.NoError) {
return; // no error: do nothing
} else if (error == RecoverError.InvalidSignature) {
revert ECDSAInvalidSignature();
} else if (error == RecoverError.InvalidSignatureLength) {
revert ECDSAInvalidSignatureLength(uint256(errorArg));
} else if (error == RecoverError.InvalidSignatureS) {
revert ECDSAInvalidSignatureS(errorArg);
}
}
}
interface IERC5267 {
/**
* @dev MAY be emitted to signal that the domain could have changed.
*/
event EIP712DomainChanged();
/**
* @dev returns the fields and values that describe the domain separator used by this contract for EIP-712
* signature.
*/
function eip712Domain()
external
view
returns (
bytes1 fields,
string memory name,
string memory version,
uint256 chainId,
address verifyingContract,
bytes32 salt,
uint256[] memory extensions
);
}
/**
* @dev Standard math utilities missing in the Solidity language.
*/
library Math {
/**
* @dev Muldiv operation overflow.
*/
error MathOverflowedMulDiv();
enum Rounding {
Floor, // Toward negative infinity
Ceil, // Toward positive infinity
Trunc, // Toward zero
Expand // Away from zero
}
/**
* @dev Returns the addition of two unsigned integers, with an overflow flag.
*/
function tryAdd(uint256 a, uint256 b) internal pure returns (bool, uint256) {
unchecked {
uint256 c = a + b;
if (c < a) return (false, 0);
return (true, c);
}
}
/**
* @dev Returns the subtraction of two unsigned integers, with an overflow flag.
*/
function trySub(uint256 a, uint256 b) internal pure returns (bool, uint256) {
unchecked {
if (b > a) return (false, 0);
return (true, a - b);
}
}
/**
* @dev Returns the multiplication of two unsigned integers, with an overflow flag.
*/
function tryMul(uint256 a, uint256 b) internal pure returns (bool, uint256) {
unchecked {
// Gas optimization: this is cheaper than requiring 'a' not being zero, but the
// benefit is lost if 'b' is also tested.
// See: https://github.com/OpenZeppelin/openzeppelin-contracts/pull/522
if (a == 0) return (true, 0);
uint256 c = a * b;
if (c / a != b) return (false, 0);
return (true, c);
}
}
/**
* @dev Returns the division of two unsigned integers, with a division by zero flag.
*/
function tryDiv(uint256 a, uint256 b) internal pure returns (bool, uint256) {
unchecked {
if (b == 0) return (false, 0);
return (true, a / b);
}
}
/**
* @dev Returns the remainder of dividing two unsigned integers, with a division by zero flag.
*/
function tryMod(uint256 a, uint256 b) internal pure returns (bool, uint256) {
unchecked {
if (b == 0) return (false, 0);
return (true, a % b);
}
}
/**
* @dev Returns the largest of two numbers.
*/
function max(uint256 a, uint256 b) internal pure returns (uint256) {
return a > b ? a : b;
}
/**
* @dev Returns the smallest of two numbers.
*/
function min(uint256 a, uint256 b) internal pure returns (uint256) {
return a < b ? a : b;
}
/**
* @dev Returns the average of two numbers. The result is rounded towards
* zero.
*/
function average(uint256 a, uint256 b) internal pure returns (uint256) {
// (a + b) / 2 can overflow.
return (a & b) + (a ^ b) / 2;
}
/**
* @dev Returns the ceiling of the division of two numbers.
*
* This differs from standard division with `/` in that it rounds 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.
return a / b;
}
// (a + b - 1) / b can overflow on addition, so we distribute.
return a == 0 ? 0 : (a - 1) / b + 1;
}
/**
* @notice Calculates floor(x * y / denominator) with full precision. Throws if result overflows a uint256 or
* denominator == 0.
* @dev Original credit to Remco Bloemen under MIT license (https://xn--2-umb.com/21/muldiv) with further edits by
* Uniswap Labs also under MIT license.
*/
function mulDiv(uint256 x, uint256 y, uint256 denominator) internal pure returns (uint256 result) {
unchecked {
// 512-bit multiply [prod1 prod0] = x * y. Compute the product mod 2^256 and mod 2^256 - 1, then use
// use the Chinese Remainder Theorem to reconstruct the 512 bit result. The result is stored in two 256
// variables such that product = prod1 * 2^256 + prod0.
uint256 prod0 = x * y; // Least significant 256 bits of the product
uint256 prod1; // Most significant 256 bits of the product
assembly {
let mm := mulmod(x, y, not(0))
prod1 := sub(sub(mm, prod0), lt(mm, prod0))
}
// Handle non-overflow cases, 256 by 256 division.
if (prod1 == 0) {
// Solidity will revert if denominator == 0, unlike the div opcode on its own.
// The surrounding unchecked block does not change this fact.
// See https://docs.soliditylang.org/en/latest/control-structures.html#checked-or-unchecked-arithmetic.
return prod0 / denominator;
}
// Make sure the result is less than 2^256. Also prevents denominator == 0.
if (denominator <= prod1) {
revert MathOverflowedMulDiv();
}
///////////////////////////////////////////////
// 512 by 256 division.
///////////////////////////////////////////////
// Make division exact by subtracting the remainder from [prod1 prod0].
uint256 remainder;
assembly {
// Compute remainder using mulmod.
remainder := mulmod(x, y, denominator)
// Subtract 256 bit number from 512 bit number.
prod1 := sub(prod1, gt(remainder, prod0))
prod0 := sub(prod0, remainder)
}
// Factor powers of two out of denominator and compute largest power of two divisor of denominator.
// Always >= 1. See https://cs.stackexchange.com/q/138556/92363.
uint256 twos = denominator & (0 - denominator);
assembly {
// Divide denominator by twos.
denominator := div(denominator, twos)
// Divide [prod1 prod0] by twos.
prod0 := div(prod0, twos)
// Flip twos such that it is 2^256 / twos. If twos is zero, then it becomes one.
twos := add(div(sub(0, twos), twos), 1)
}
// Shift in bits from prod1 into prod0.
prod0 |= prod1 * twos;
// Invert denominator mod 2^256. Now that denominator is an odd number, it has an inverse modulo 2^256 such
// that denominator * inv = 1 mod 2^256. Compute the inverse by starting with a seed that is correct for
// four bits. That is, denominator * inv = 1 mod 2^4.
uint256 inverse = (3 * denominator) ^ 2;
// Use the Newton-Raphson iteration to improve the precision. Thanks to Hensel's lifting lemma, this also
// works in modular arithmetic, doubling the correct bits in each step.
inverse *= 2 - denominator * inverse; // inverse mod 2^8
inverse *= 2 - denominator * inverse; // inverse mod 2^16
inverse *= 2 - denominator * inverse; // inverse mod 2^32
inverse *= 2 - denominator * inverse; // inverse mod 2^64
inverse *= 2 - denominator * inverse; // inverse mod 2^128
inverse *= 2 - denominator * inverse; // inverse mod 2^256
// Because the division is now exact we can divide by multiplying with the modular inverse of denominator.
// This will give us the correct result modulo 2^256. Since the preconditions guarantee that the outcome is
// less than 2^256, this is the final result. We don't need to compute the high bits of the result and prod1
// is no longer required.
result = prod0 * inverse;
return result;
}
}
/**
* @notice Calculates x * y / denominator with full precision, following the selected rounding direction.
*/
function mulDiv(uint256 x, uint256 y, uint256 denominator, Rounding rounding) internal pure returns (uint256) {
uint256 result = mulDiv(x, y, denominator);
if (unsignedRoundsUp(rounding) && mulmod(x, y, denominator) > 0) {
result += 1;
}
return result;
}
/**
* @dev Returns the square root of a number. If the number is not a perfect square, the value is rounded
* towards zero.
*
* Inspired by Henry S. Warren, Jr.'s "Hacker's Delight" (Chapter 11).
*/
function sqrt(uint256 a) internal pure returns (uint256) {
if (a == 0) {
return 0;
}
// For our first guess, we get the biggest power of 2 which is smaller than the square root of the target.
//
// We know that the "msb" (most significant bit) of our target number `a` is a power of 2 such that we have
// `msb(a) <= a < 2*msb(a)`. This value can be written `msb(a)=2**k` with `k=log2(a)`.
//
// This can be rewritten `2**log2(a) <= a < 2**(log2(a) + 1)`
// → `sqrt(2**k) <= sqrt(a) < sqrt(2**(k+1))`
// → `2**(k/2) <= sqrt(a) < 2**((k+1)/2) <= 2**(k/2 + 1)`
//
// Consequently, `2**(log2(a) / 2)` is a good first approximation of `sqrt(a)` with at least 1 correct bit.
uint256 result = 1 << (log2(a) >> 1);
// At this point `result` is an estimation with one bit of precision. We know the true value is a uint128,
// since it is the square root of a uint256. Newton's method converges quadratically (precision doubles at
// every iteration). We thus need at most 7 iteration to turn our partial result with one bit of precision
// into the expected uint128 result.
unchecked {
result = (result + a / result) >> 1;
result = (result + a / result) >> 1;
result = (result + a / result) >> 1;
result = (result + a / result) >> 1;
result = (result + a / result) >> 1;
result = (result + a / result) >> 1;
result = (result + a / result) >> 1;
return min(result, a / result);
}
}
/**
* @notice Calculates sqrt(a), following the selected rounding direction.
*/
function sqrt(uint256 a, Rounding rounding) internal pure returns (uint256) {
unchecked {
uint256 result = sqrt(a);
return result + (unsignedRoundsUp(rounding) && result * result < a ? 1 : 0);
}
}
/**
* @dev Return the log in base 2 of a positive value rounded towards zero.
* Returns 0 if given 0.
*/
function log2(uint256 value) internal pure returns (uint256) {
uint256 result = 0;
unchecked {
if (value >> 128 > 0) {
value >>= 128;
result += 128;
}
if (value >> 64 > 0) {
value >>= 64;
result += 64;
}
if (value >> 32 > 0) {
value >>= 32;
result += 32;
}
if (value >> 16 > 0) {
value >>= 16;
result += 16;
}
if (value >> 8 > 0) {
value >>= 8;
result += 8;
}
if (value >> 4 > 0) {
value >>= 4;
result += 4;
}
if (value >> 2 > 0) {
value >>= 2;
result += 2;
}
if (value >> 1 > 0) {
result += 1;
}
}
return result;
}
/**
* @dev Return the log in base 2, following the selected rounding direction, of a positive value.
* Returns 0 if given 0.
*/
function log2(uint256 value, Rounding rounding) internal pure returns (uint256) {
unchecked {
uint256 result = log2(value);
return result + (unsignedRoundsUp(rounding) && 1 << result < value ? 1 : 0);
}
}
/**
* @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 + (unsignedRoundsUp(rounding) && 10 ** result < value ? 1 : 0);
}
}
/**
* @dev Return the log in base 256 of a positive value rounded towards zero.
* Returns 0 if given 0.
*
* Adding one to the result gives the number of pairs of hex symbols needed to represent `value` as a hex string.
*/
function log256(uint256 value) internal pure returns (uint256) {
uint256 result = 0;
unchecked {
if (value >> 128 > 0) {
value >>= 128;
result += 16;
}
if (value >> 64 > 0) {
value >>= 64;
result += 8;
}
if (value >> 32 > 0) {
value >>= 32;
result += 4;
}
if (value >> 16 > 0) {
value >>= 16;
result += 2;
}
if (value >> 8 > 0) {
result += 1;
}
}
return result;
}
/**
* @dev Return the log in base 256, following the selected rounding direction, of a positive value.
* Returns 0 if given 0.
*/
function log256(uint256 value, Rounding rounding) internal pure returns (uint256) {
unchecked {
uint256 result = log256(value);
return result + (unsignedRoundsUp(rounding) && 1 << (result << 3) < value ? 1 : 0);
}
}
/**
* @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 Standard signed math utilities missing in the Solidity language.
*/
library SignedMath {
/**
* @dev Returns the largest of two signed numbers.
*/
function max(int256 a, int256 b) internal pure returns (int256) {
return a > b ? a : b;
}
/**
* @dev Returns the smallest of two signed numbers.
*/
function min(int256 a, int256 b) internal pure returns (int256) {
return 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 {
// must be unchecked in order to support `n = type(int256).min`
return uint256(n >= 0 ? n : -n);
}
}
}
/**
* @dev String operations.
*/
library Strings {
bytes16 private constant HEX_DIGITS = "0123456789abcdef";
uint8 private constant ADDRESS_LENGTH = 20;
/**
* @dev The `value` string doesn't fit in the specified `length`.
*/
error StringsInsufficientHexLength(uint256 value, uint256 length);
/**
* @dev Converts a `uint256` to its ASCII `string` decimal representation.
*/
function toString(uint256 value) internal pure returns (string memory) {
unchecked {
uint256 length = Math.log10(value) + 1;
string memory buffer = new string(length);
uint256 ptr;
/// @solidity memory-safe-assembly
assembly {
ptr := add(buffer, add(32, length))
}
while (true) {
ptr--;
/// @solidity memory-safe-assembly
assembly {
mstore8(ptr, byte(mod(value, 10), 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 Returns true if the two strings are equal.
*/
function equal(string memory a, string memory b) internal pure returns (bool) {
return bytes(a).length == bytes(b).length && keccak256(bytes(a)) == keccak256(bytes(b));
}
}
/**
* @dev Signature message hash utilities for producing digests to be consumed by {ECDSA} recovery or signing.
*
* The library provides methods for generating a hash of a message that conforms to the
* https://eips.ethereum.org/EIPS/eip-191[EIP 191] and https://eips.ethereum.org/EIPS/eip-712[EIP 712]
* specifications.
*/
library MessageHashUtils {
/**
* @dev Returns the keccak256 digest of an EIP-191 signed data with version
* `0x45` (`personal_sign` messages).
*
* The digest is calculated by prefixing a bytes32 `messageHash` with
* `"\x19Ethereum Signed Message:\n32"` and hashing the result. It corresponds with the
* hash signed when using the https://eth.wiki/json-rpc/API#eth_sign[`eth_sign`] JSON-RPC method.
*
* NOTE: The `messageHash` parameter is intended to be the result of hashing a raw message with
* keccak256, although any bytes32 value can be safely used because the final digest will
* be re-hashed.
*
* See {ECDSA-recover}.
*/
function toEthSignedMessageHash(bytes32 messageHash) internal pure returns (bytes32 digest) {
/// @solidity memory-safe-assembly
assembly {
mstore(0x00, "\x19Ethereum Signed Message:\n32") // 32 is the bytes-length of messageHash
mstore(0x1c, messageHash) // 0x1c (28) is the length of the prefix
digest := keccak256(0x00, 0x3c) // 0x3c is the length of the prefix (0x1c) + messageHash (0x20)
}
}
/**
* @dev Returns the keccak256 digest of an EIP-191 signed data with version
* `0x45` (`personal_sign` messages).
*
* The digest is calculated by prefixing an arbitrary `message` with
* `"\x19Ethereum Signed Message:\n" + len(message)` and hashing the result. It corresponds with the
* hash signed when using the https://eth.wiki/json-rpc/API#eth_sign[`eth_sign`] JSON-RPC method.
*
* See {ECDSA-recover}.
*/
function toEthSignedMessageHash(bytes memory message) internal pure returns (bytes32) {
return
keccak256(bytes.concat("\x19Ethereum Signed Message:\n", bytes(Strings.toString(message.length)), message));
}
/**
* @dev Returns the keccak256 digest of an EIP-191 signed data with version
* `0x00` (data with intended validator).
*
* The digest is calculated by prefixing an arbitrary `data` with `"\x19\x00"` and the intended
* `validator` address. Then hashing the result.
*
* See {ECDSA-recover}.
*/
function toDataWithIntendedValidatorHash(address validator, bytes memory data) internal pure returns (bytes32) {
return keccak256(abi.encodePacked(hex"19_00", validator, data));
}
/**
* @dev Returns the keccak256 digest of an EIP-712 typed data (EIP-191 version `0x01`).
*
* The digest is calculated from a `domainSeparator` and a `structHash`, by prefixing them with
* `\x19\x01` and hashing the result. It corresponds to the hash signed by the
* https://eips.ethereum.org/EIPS/eip-712[`eth_signTypedData`] JSON-RPC method as part of EIP-712.
*
* See {ECDSA-recover}.
*/
function toTypedDataHash(bytes32 domainSeparator, bytes32 structHash) internal pure returns (bytes32 digest) {
/// @solidity memory-safe-assembly
assembly {
let ptr := mload(0x40)
mstore(ptr, hex"19_01")
mstore(add(ptr, 0x02), domainSeparator)
mstore(add(ptr, 0x22), structHash)
digest := keccak256(ptr, 0x42)
}
}
}
/**
* @dev Library for reading and writing primitive types to specific storage slots.
*
* Storage slots are often used to avoid storage conflict when dealing with upgradeable contracts.
* This library helps with reading and writing to such slots without the need for inline assembly.
*
* The functions in this library return Slot structs that contain a `value` member that can be used to read or write.
*
* Example usage to set ERC1967 implementation slot:
* ```solidity
* contract ERC1967 {
* bytes32 internal constant _IMPLEMENTATION_SLOT = 0x360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc;
*
* function _getImplementation() internal view returns (address) {
* return StorageSlot.getAddressSlot(_IMPLEMENTATION_SLOT).value;
* }
*
* function _setImplementation(address newImplementation) internal {
* require(newImplementation.code.length > 0);
* StorageSlot.getAddressSlot(_IMPLEMENTATION_SLOT).value = newImplementation;
* }
* }
* ```
*/
library StorageSlot {
struct AddressSlot {
address value;
}
struct BooleanSlot {
bool value;
}
struct Bytes32Slot {
bytes32 value;
}
struct Uint256Slot {
uint256 value;
}
struct StringSlot {
string value;
}
struct BytesSlot {
bytes value;
}
/**
* @dev Returns an `AddressSlot` with member `value` located at `slot`.
*/
function getAddressSlot(bytes32 slot) internal pure returns (AddressSlot storage r) {
/// @solidity memory-safe-assembly
assembly {
r.slot := slot
}
}
/**
* @dev Returns an `BooleanSlot` with member `value` located at `slot`.
*/
function getBooleanSlot(bytes32 slot) internal pure returns (BooleanSlot storage r) {
/// @solidity memory-safe-assembly
assembly {
r.slot := slot
}
}
/**
* @dev Returns an `Bytes32Slot` with member `value` located at `slot`.
*/
function getBytes32Slot(bytes32 slot) internal pure returns (Bytes32Slot storage r) {
/// @solidity memory-safe-assembly
assembly {
r.slot := slot
}
}
/**
* @dev Returns an `Uint256Slot` with member `value` located at `slot`.
*/
function getUint256Slot(bytes32 slot) internal pure returns (Uint256Slot storage r) {
/// @solidity memory-safe-assembly
assembly {
r.slot := slot
}
}
/**
* @dev Returns an `StringSlot` with member `value` located at `slot`.
*/
function getStringSlot(bytes32 slot) internal pure returns (StringSlot storage r) {
/// @solidity memory-safe-assembly
assembly {
r.slot := slot
}
}
/**
* @dev Returns an `StringSlot` representation of the string storage pointer `store`.
*/
function getStringSlot(string storage store) internal pure returns (StringSlot storage r) {
/// @solidity memory-safe-assembly
assembly {
r.slot := store.slot
}
}
/**
* @dev Returns an `BytesSlot` with member `value` located at `slot`.
*/
function getBytesSlot(bytes32 slot) internal pure returns (BytesSlot storage r) {
/// @solidity memory-safe-assembly
assembly {
r.slot := slot
}
}
/**
* @dev Returns an `BytesSlot` representation of the bytes storage pointer `store`.
*/
function getBytesSlot(bytes storage store) internal pure returns (BytesSlot storage r) {
/// @solidity memory-safe-assembly
assembly {
r.slot := store.slot
}
}
}
// | string | 0xAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA |
// | length | 0x BB |
type ShortString is bytes32;
/**
* @dev This library provides functions to convert short memory strings
* into a `ShortString` type that can be used as an immutable variable.
*
* Strings of arbitrary length can be optimized using this library if
* they are short enough (up to 31 bytes) by packing them with their
* length (1 byte) in a single EVM word (32 bytes). Additionally, a
* fallback mechanism can be used for every other case.
*
* Usage example:
*
* ```solidity
* contract Named {
* using ShortStrings for *;
*
* ShortString private immutable _name;
* string private _nameFallback;
*
* constructor(string memory contractName) {
* _name = contractName.toShortStringWithFallback(_nameFallback);
* }
*
* function name() external view returns (string memory) {
* return _name.toStringWithFallback(_nameFallback);
* }
* }
* ```
*/
library ShortStrings {
// Used as an identifier for strings longer than 31 bytes.
bytes32 private constant FALLBACK_SENTINEL = 0x00000000000000000000000000000000000000000000000000000000000000FF;
error StringTooLong(string str);
error InvalidShortString();
/**
* @dev Encode a string of at most 31 chars into a `ShortString`.
*
* This will trigger a `StringTooLong` error is the input string is too long.
*/
function toShortString(string memory str) internal pure returns (ShortString) {
bytes memory bstr = bytes(str);
if (bstr.length > 31) {
revert StringTooLong(str);
}
return ShortString.wrap(bytes32(uint256(bytes32(bstr)) | bstr.length));
}
/**
* @dev Decode a `ShortString` back to a "normal" string.
*/
function toString(ShortString sstr) internal pure returns (string memory) {
uint256 len = byteLength(sstr);
// using `new string(len)` would work locally but is not memory safe.
string memory str = new string(32);
/// @solidity memory-safe-assembly
assembly {
mstore(str, len)
mstore(add(str, 0x20), sstr)
}
return str;
}
/**
* @dev Return the length of a `ShortString`.
*/
function byteLength(ShortString sstr) internal pure returns (uint256) {
uint256 result = uint256(ShortString.unwrap(sstr)) & 0xFF;
if (result > 31) {
revert InvalidShortString();
}
return result;
}
/**
* @dev Encode a string into a `ShortString`, or write it to storage if it is too long.
*/
function toShortStringWithFallback(string memory value, string storage store) internal returns (ShortString) {
if (bytes(value).length < 32) {
return toShortString(value);
} else {
StorageSlot.getStringSlot(store).value = value;
return ShortString.wrap(FALLBACK_SENTINEL);
}
}
/**
* @dev Decode a string that was encoded to `ShortString` or written to storage using {setWithFallback}.
*/
function toStringWithFallback(ShortString value, string storage store) internal pure returns (string memory) {
if (ShortString.unwrap(value) != FALLBACK_SENTINEL) {
return toString(value);
} else {
return store;
}
}
/**
* @dev Return the length of a string that was encoded to `ShortString` or written to storage using
* {setWithFallback}.
*
* WARNING: This will return the "byte length" of the string. This may not reflect the actual length in terms of
* actual characters as the UTF-8 encoding of a single character can span over multiple bytes.
*/
function byteLengthWithFallback(ShortString value, string storage store) internal view returns (uint256) {
if (ShortString.unwrap(value) != FALLBACK_SENTINEL) {
return byteLength(value);
} else {
return bytes(store).length;
}
}
}
/**
* @dev https://eips.ethereum.org/EIPS/eip-712[EIP 712] is a standard for hashing and signing of typed structured data.
*
* The encoding scheme specified in the EIP requires a domain separator and a hash of the typed structured data, whose
* encoding is very generic and therefore its implementation in Solidity is not feasible, thus this contract
* does not implement the encoding itself. Protocols need to implement the type-specific encoding they need in order to
* produce the hash of their typed data using a combination of `abi.encode` and `keccak256`.
*
* This contract implements the EIP 712 domain separator ({_domainSeparatorV4}) that is used as part of the encoding
* scheme, and the final step of the encoding to obtain the message digest that is then signed via ECDSA
* ({_hashTypedDataV4}).
*
* The implementation of the domain separator was designed to be as efficient as possible while still properly updating
* the chain id to protect against replay attacks on an eventual fork of the chain.
*
* NOTE: This contract implements the version of the encoding known as "v4", as implemented by the JSON RPC method
* https://docs.metamask.io/guide/signing-data.html[`eth_signTypedDataV4` in MetaMask].
*
* NOTE: In the upgradeable version of this contract, the cached values will correspond to the address, and the domain
* separator of the implementation contract. This will cause the {_domainSeparatorV4} function to always rebuild the
* separator from the immutable values, which is cheaper than accessing a cached version in cold storage.
*
* @custom:oz-upgrades-unsafe-allow state-variable-immutable
*/
abstract contract EIP712 is IERC5267 {
using ShortStrings for *;
bytes32 private constant TYPE_HASH =
keccak256("EIP712Domain(string name,string version,uint256 chainId,address verifyingContract)");
// Cache the domain separator as an immutable value, but also store the chain id that it corresponds to, in order to
// invalidate the cached domain separator if the chain id changes.
bytes32 private immutable _cachedDomainSeparator;
uint256 private immutable _cachedChainId;
address private immutable _cachedThis;
bytes32 private immutable _hashedName;
bytes32 private immutable _hashedVersion;
ShortString private immutable _name;
ShortString private immutable _version;
string private _nameFallback;
string private _versionFallback;
/**
* @dev Initializes the domain separator and parameter caches.
*
* The meaning of `name` and `version` is specified in
* https://eips.ethereum.org/EIPS/eip-712#definition-of-domainseparator[EIP 712]:
*
* - `name`: the user readable name of the signing domain, i.e. the name of the DApp or the protocol.
* - `version`: the current major version of the signing domain.
*
* NOTE: These parameters cannot be changed except through a xref:learn::upgrading-smart-contracts.adoc[smart
* contract upgrade].
*/
constructor(string memory name, string memory version) {
_name = name.toShortStringWithFallback(_nameFallback);
_version = version.toShortStringWithFallback(_versionFallback);
_hashedName = keccak256(bytes(name));
_hashedVersion = keccak256(bytes(version));
_cachedChainId = block.chainid;
_cachedDomainSeparator = _buildDomainSeparator();
_cachedThis = address(this);
}
/**
* @dev Returns the domain separator for the current chain.
*/
function _domainSeparatorV4() internal view returns (bytes32) {
if (address(this) == _cachedThis && block.chainid == _cachedChainId) {
return _cachedDomainSeparator;
} else {
return _buildDomainSeparator();
}
}
function _buildDomainSeparator() private view returns (bytes32) {
return keccak256(abi.encode(TYPE_HASH, _hashedName, _hashedVersion, block.chainid, address(this)));
}
/**
* @dev Given an already https://eips.ethereum.org/EIPS/eip-712#definition-of-hashstruct[hashed struct], this
* function returns the hash of the fully encoded EIP712 message for this domain.
*
* This hash can be used together with {ECDSA-recover} to obtain the signer of a message. For example:
*
* ```solidity
* bytes32 digest = _hashTypedDataV4(keccak256(abi.encode(
* keccak256("Mail(address to,string contents)"),
* mailTo,
* keccak256(bytes(mailContents))
* )));
* address signer = ECDSA.recover(digest, signature);
* ```
*/
function _hashTypedDataV4(bytes32 structHash) internal view virtual returns (bytes32) {
return MessageHashUtils.toTypedDataHash(_domainSeparatorV4(), structHash);
}
/**
* @dev See {IERC-5267}.
*/
function eip712Domain()
public
view
virtual
returns (
bytes1 fields,
string memory name,
string memory version,
uint256 chainId,
address verifyingContract,
bytes32 salt,
uint256[] memory extensions
)
{
return (
hex"0f", // 01111
_EIP712Name(),
_EIP712Version(),
block.chainid,
address(this),
bytes32(0),
new uint256[](0)
);
}
/**
* @dev The name parameter for the EIP712 domain.
*
* NOTE: By default this function reads _name which is an immutable value.
* It only reads from storage if necessary (in case the value is too large to fit in a ShortString).
*/
// solhint-disable-next-line func-name-mixedcase
function _EIP712Name() internal view returns (string memory) {
return _name.toStringWithFallback(_nameFallback);
}
/**
* @dev The version parameter for the EIP712 domain.
*
* NOTE: By default this function reads _version which is an immutable value.
* It only reads from storage if necessary (in case the value is too large to fit in a ShortString).
*/
// solhint-disable-next-line func-name-mixedcase
function _EIP712Version() internal view returns (string memory) {
return _version.toStringWithFallback(_versionFallback);
}
}
/**
* @dev Wrappers over Solidity's uintXX/intXX casting operators with added overflow
* checks.
*
* Downcasting from uint256/int256 in Solidity does not revert on overflow. This can
* easily result in undesired exploitation or bugs, since developers usually
* assume that overflows raise errors. `SafeCast` restores this intuition by
* reverting the transaction when such an operation overflows.
*
* Using this library instead of the unchecked operations eliminates an entire
* class of bugs, so it's recommended to use it always.
*/
library SafeCast {
/**
* @dev Value doesn't fit in an uint of `bits` size.
*/
error SafeCastOverflowedUintDowncast(uint8 bits, uint256 value);
/**
* @dev An int value doesn't fit in an uint of `bits` size.
*/
error SafeCastOverflowedIntToUint(int256 value);
/**
* @dev Value doesn't fit in an int of `bits` size.
*/
error SafeCastOverflowedIntDowncast(uint8 bits, int256 value);
/**
* @dev An uint value doesn't fit in an int of `bits` size.
*/
error SafeCastOverflowedUintToInt(uint256 value);
/**
* @dev Returns the downcasted uint248 from uint256, reverting on
* overflow (when the input is greater than largest uint248).
*
* Counterpart to Solidity's `uint248` operator.
*
* Requirements:
*
* - input must fit into 248 bits
*/
function toUint248(uint256 value) internal pure returns (uint248) {
if (value > type(uint248).max) {
revert SafeCastOverflowedUintDowncast(248, value);
}
return uint248(value);
}
/**
* @dev Returns the downcasted uint240 from uint256, reverting on
* overflow (when the input is greater than largest uint240).
*
* Counterpart to Solidity's `uint240` operator.
*
* Requirements:
*
* - input must fit into 240 bits
*/
function toUint240(uint256 value) internal pure returns (uint240) {
if (value > type(uint240).max) {
revert SafeCastOverflowedUintDowncast(240, value);
}
return uint240(value);
}
/**
* @dev Returns the downcasted uint232 from uint256, reverting on
* overflow (when the input is greater than largest uint232).
*
* Counterpart to Solidity's `uint232` operator.
*
* Requirements:
*
* - input must fit into 232 bits
*/
function toUint232(uint256 value) internal pure returns (uint232) {
if (value > type(uint232).max) {
revert SafeCastOverflowedUintDowncast(232, value);
}
return uint232(value);
}
/**
* @dev Returns the downcasted uint224 from uint256, reverting on
* overflow (when the input is greater than largest uint224).
*
* Counterpart to Solidity's `uint224` operator.
*
* Requirements:
*
* - input must fit into 224 bits
*/
function toUint224(uint256 value) internal pure returns (uint224) {
if (value > type(uint224).max) {
revert SafeCastOverflowedUintDowncast(224, value);
}
return uint224(value);
}
/**
* @dev Returns the downcasted uint216 from uint256, reverting on
* overflow (when the input is greater than largest uint216).
*
* Counterpart to Solidity's `uint216` operator.
*
* Requirements:
*
* - input must fit into 216 bits
*/
function toUint216(uint256 value) internal pure returns (uint216) {
if (value > type(uint216).max) {
revert SafeCastOverflowedUintDowncast(216, value);
}
return uint216(value);
}
/**
* @dev Returns the downcasted uint208 from uint256, reverting on
* overflow (when the input is greater than largest uint208).
*
* Counterpart to Solidity's `uint208` operator.
*
* Requirements:
*
* - input must fit into 208 bits
*/
function toUint208(uint256 value) internal pure returns (uint208) {
if (value > type(uint208).max) {
revert SafeCastOverflowedUintDowncast(208, value);
}
return uint208(value);
}
/**
* @dev Returns the downcasted uint200 from uint256, reverting on
* overflow (when the input is greater than largest uint200).
*
* Counterpart to Solidity's `uint200` operator.
*
* Requirements:
*
* - input must fit into 200 bits
*/
function toUint200(uint256 value) internal pure returns (uint200) {
if (value > type(uint200).max) {
revert SafeCastOverflowedUintDowncast(200, value);
}
return uint200(value);
}
/**
* @dev Returns the downcasted uint192 from uint256, reverting on
* overflow (when the input is greater than largest uint192).
*
* Counterpart to Solidity's `uint192` operator.
*
* Requirements:
*
* - input must fit into 192 bits
*/
function toUint192(uint256 value) internal pure returns (uint192) {
if (value > type(uint192).max) {
revert SafeCastOverflowedUintDowncast(192, value);
}
return uint192(value);
}
/**
* @dev Returns the downcasted uint184 from uint256, reverting on
* overflow (when the input is greater than largest uint184).
*
* Counterpart to Solidity's `uint184` operator.
*
* Requirements:
*
* - input must fit into 184 bits
*/
function toUint184(uint256 value) internal pure returns (uint184) {
if (value > type(uint184).max) {
revert SafeCastOverflowedUintDowncast(184, value);
}
return uint184(value);
}
/**
* @dev Returns the downcasted uint176 from uint256, reverting on
* overflow (when the input is greater than largest uint176).
*
* Counterpart to Solidity's `uint176` operator.
*
* Requirements:
*
* - input must fit into 176 bits
*/
function toUint176(uint256 value) internal pure returns (uint176) {
if (value > type(uint176).max) {
revert SafeCastOverflowedUintDowncast(176, value);
}
return uint176(value);
}
/**
* @dev Returns the downcasted uint168 from uint256, reverting on
* overflow (when the input is greater than largest uint168).
*
* Counterpart to Solidity's `uint168` operator.
*
* Requirements:
*
* - input must fit into 168 bits
*/
function toUint168(uint256 value) internal pure returns (uint168) {
if (value > type(uint168).max) {
revert SafeCastOverflowedUintDowncast(168, value);
}
return uint168(value);
}
/**
* @dev Returns the downcasted uint160 from uint256, reverting on
* overflow (when the input is greater than largest uint160).
*
* Counterpart to Solidity's `uint160` operator.
*
* Requirements:
*
* - input must fit into 160 bits
*/
function toUint160(uint256 value) internal pure returns (uint160) {
if (value > type(uint160).max) {
revert SafeCastOverflowedUintDowncast(160, value);
}
return uint160(value);
}
/**
* @dev Returns the downcasted uint152 from uint256, reverting on
* overflow (when the input is greater than largest uint152).
*
* Counterpart to Solidity's `uint152` operator.
*
* Requirements:
*
* - input must fit into 152 bits
*/
function toUint152(uint256 value) internal pure returns (uint152) {
if (value > type(uint152).max) {
revert SafeCastOverflowedUintDowncast(152, value);
}
return uint152(value);
}
/**
* @dev Returns the downcasted uint144 from uint256, reverting on
* overflow (when the input is greater than largest uint144).
*
* Counterpart to Solidity's `uint144` operator.
*
* Requirements:
*
* - input must fit into 144 bits
*/
function toUint144(uint256 value) internal pure returns (uint144) {
if (value > type(uint144).max) {
revert SafeCastOverflowedUintDowncast(144, value);
}
return uint144(value);
}
/**
* @dev Returns the downcasted uint136 from uint256, reverting on
* overflow (when the input is greater than largest uint136).
*
* Counterpart to Solidity's `uint136` operator.
*
* Requirements:
*
* - input must fit into 136 bits
*/
function toUint136(uint256 value) internal pure returns (uint136) {
if (value > type(uint136).max) {
revert SafeCastOverflowedUintDowncast(136, value);
}
return uint136(value);
}
/**
* @dev Returns the downcasted uint128 from uint256, reverting on
* overflow (when the input is greater than largest uint128).
*
* Counterpart to Solidity's `uint128` operator.
*
* Requirements:
*
* - input must fit into 128 bits
*/
function toUint128(uint256 value) internal pure returns (uint128) {
if (value > type(uint128).max) {
revert SafeCastOverflowedUintDowncast(128, value);
}
return uint128(value);
}
/**
* @dev Returns the downcasted uint120 from uint256, reverting on
* overflow (when the input is greater than largest uint120).
*
* Counterpart to Solidity's `uint120` operator.
*
* Requirements:
*
* - input must fit into 120 bits
*/
function toUint120(uint256 value) internal pure returns (uint120) {
if (value > type(uint120).max) {
revert SafeCastOverflowedUintDowncast(120, value);
}
return uint120(value);
}
/**
* @dev Returns the downcasted uint112 from uint256, reverting on
* overflow (when the input is greater than largest uint112).
*
* Counterpart to Solidity's `uint112` operator.
*
* Requirements:
*
* - input must fit into 112 bits
*/
function toUint112(uint256 value) internal pure returns (uint112) {
if (value > type(uint112).max) {
revert SafeCastOverflowedUintDowncast(112, value);
}
return uint112(value);
}
/**
* @dev Returns the downcasted uint104 from uint256, reverting on
* overflow (when the input is greater than largest uint104).
*
* Counterpart to Solidity's `uint104` operator.
*
* Requirements:
*
* - input must fit into 104 bits
*/
function toUint104(uint256 value) internal pure returns (uint104) {
if (value > type(uint104).max) {
revert SafeCastOverflowedUintDowncast(104, value);
}
return uint104(value);
}
/**
* @dev Returns the downcasted uint96 from uint256, reverting on
* overflow (when the input is greater than largest uint96).
*
* Counterpart to Solidity's `uint96` operator.
*
* Requirements:
*
* - input must fit into 96 bits
*/
function toUint96(uint256 value) internal pure returns (uint96) {
if (value > type(uint96).max) {
revert SafeCastOverflowedUintDowncast(96, value);
}
return uint96(value);
}
/**
* @dev Returns the downcasted uint88 from uint256, reverting on
* overflow (when the input is greater than largest uint88).
*
* Counterpart to Solidity's `uint88` operator.
*
* Requirements:
*
* - input must fit into 88 bits
*/
function toUint88(uint256 value) internal pure returns (uint88) {
if (value > type(uint88).max) {
revert SafeCastOverflowedUintDowncast(88, value);
}
return uint88(value);
}
/**
* @dev Returns the downcasted uint80 from uint256, reverting on
* overflow (when the input is greater than largest uint80).
*
* Counterpart to Solidity's `uint80` operator.
*
* Requirements:
*
* - input must fit into 80 bits
*/
function toUint80(uint256 value) internal pure returns (uint80) {
if (value > type(uint80).max) {
revert SafeCastOverflowedUintDowncast(80, value);
}
return uint80(value);
}
/**
* @dev Returns the downcasted uint72 from uint256, reverting on
* overflow (when the input is greater than largest uint72).
*
* Counterpart to Solidity's `uint72` operator.
*
* Requirements:
*
* - input must fit into 72 bits
*/
function toUint72(uint256 value) internal pure returns (uint72) {
if (value > type(uint72).max) {
revert SafeCastOverflowedUintDowncast(72, value);
}
return uint72(value);
}
/**
* @dev Returns the downcasted uint64 from uint256, reverting on
* overflow (when the input is greater than largest uint64).
*
* Counterpart to Solidity's `uint64` operator.
*
* Requirements:
*
* - input must fit into 64 bits
*/
function toUint64(uint256 value) internal pure returns (uint64) {
if (value > type(uint64).max) {
revert SafeCastOverflowedUintDowncast(64, value);
}
return uint64(value);
}
/**
* @dev Returns the downcasted uint56 from uint256, reverting on
* overflow (when the input is greater than largest uint56).
*
* Counterpart to Solidity's `uint56` operator.
*
* Requirements:
*
* - input must fit into 56 bits
*/
function toUint56(uint256 value) internal pure returns (uint56) {
if (value > type(uint56).max) {
revert SafeCastOverflowedUintDowncast(56, value);
}
return uint56(value);
}
/**
* @dev Returns the downcasted uint48 from uint256, reverting on
* overflow (when the input is greater than largest uint48).
*
* Counterpart to Solidity's `uint48` operator.
*
* Requirements:
*
* - input must fit into 48 bits
*/
function toUint48(uint256 value) internal pure returns (uint48) {
if (value > type(uint48).max) {
revert SafeCastOverflowedUintDowncast(48, value);
}
return uint48(value);
}
/**
* @dev Returns the downcasted uint40 from uint256, reverting on
* overflow (when the input is greater than largest uint40).
*
* Counterpart to Solidity's `uint40` operator.
*
* Requirements:
*
* - input must fit into 40 bits
*/
function toUint40(uint256 value) internal pure returns (uint40) {
if (value > type(uint40).max) {
revert SafeCastOverflowedUintDowncast(40, value);
}
return uint40(value);
}
/**
* @dev Returns the downcasted uint32 from uint256, reverting on
* overflow (when the input is greater than largest uint32).
*
* Counterpart to Solidity's `uint32` operator.
*
* Requirements:
*
* - input must fit into 32 bits
*/
function toUint32(uint256 value) internal pure returns (uint32) {
if (value > type(uint32).max) {
revert SafeCastOverflowedUintDowncast(32, value);
}
return uint32(value);
}
/**
* @dev Returns the downcasted uint24 from uint256, reverting on
* overflow (when the input is greater than largest uint24).
*
* Counterpart to Solidity's `uint24` operator.
*
* Requirements:
*
* - input must fit into 24 bits
*/
function toUint24(uint256 value) internal pure returns (uint24) {
if (value > type(uint24).max) {
revert SafeCastOverflowedUintDowncast(24, value);
}
return uint24(value);
}
/**
* @dev Returns the downcasted uint16 from uint256, reverting on
* overflow (when the input is greater than largest uint16).
*
* Counterpart to Solidity's `uint16` operator.
*
* Requirements:
*
* - input must fit into 16 bits
*/
function toUint16(uint256 value) internal pure returns (uint16) {
if (value > type(uint16).max) {
revert SafeCastOverflowedUintDowncast(16, value);
}
return uint16(value);
}
/**
* @dev Returns the downcasted uint8 from uint256, reverting on
* overflow (when the input is greater than largest uint8).
*
* Counterpart to Solidity's `uint8` operator.
*
* Requirements:
*
* - input must fit into 8 bits
*/
function toUint8(uint256 value) internal pure returns (uint8) {
if (value > type(uint8).max) {
revert SafeCastOverflowedUintDowncast(8, value);
}
return uint8(value);
}
/**
* @dev Converts a signed int256 into an unsigned uint256.
*
* Requirements:
*
* - input must be greater than or equal to 0.
*/
function toUint256(int256 value) internal pure returns (uint256) {
if (value < 0) {
revert SafeCastOverflowedIntToUint(value);
}
return uint256(value);
}
/**
* @dev Returns the downcasted int248 from int256, reverting on
* overflow (when the input is less than smallest int248 or
* greater than largest int248).
*
* Counterpart to Solidity's `int248` operator.
*
* Requirements:
*
* - input must fit into 248 bits
*/
function toInt248(int256 value) internal pure returns (int248 downcasted) {
downcasted = int248(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(248, value);
}
}
/**
* @dev Returns the downcasted int240 from int256, reverting on
* overflow (when the input is less than smallest int240 or
* greater than largest int240).
*
* Counterpart to Solidity's `int240` operator.
*
* Requirements:
*
* - input must fit into 240 bits
*/
function toInt240(int256 value) internal pure returns (int240 downcasted) {
downcasted = int240(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(240, value);
}
}
/**
* @dev Returns the downcasted int232 from int256, reverting on
* overflow (when the input is less than smallest int232 or
* greater than largest int232).
*
* Counterpart to Solidity's `int232` operator.
*
* Requirements:
*
* - input must fit into 232 bits
*/
function toInt232(int256 value) internal pure returns (int232 downcasted) {
downcasted = int232(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(232, value);
}
}
/**
* @dev Returns the downcasted int224 from int256, reverting on
* overflow (when the input is less than smallest int224 or
* greater than largest int224).
*
* Counterpart to Solidity's `int224` operator.
*
* Requirements:
*
* - input must fit into 224 bits
*/
function toInt224(int256 value) internal pure returns (int224 downcasted) {
downcasted = int224(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(224, value);
}
}
/**
* @dev Returns the downcasted int216 from int256, reverting on
* overflow (when the input is less than smallest int216 or
* greater than largest int216).
*
* Counterpart to Solidity's `int216` operator.
*
* Requirements:
*
* - input must fit into 216 bits
*/
function toInt216(int256 value) internal pure returns (int216 downcasted) {
downcasted = int216(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(216, value);
}
}
/**
* @dev Returns the downcasted int208 from int256, reverting on
* overflow (when the input is less than smallest int208 or
* greater than largest int208).
*
* Counterpart to Solidity's `int208` operator.
*
* Requirements:
*
* - input must fit into 208 bits
*/
function toInt208(int256 value) internal pure returns (int208 downcasted) {
downcasted = int208(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(208, value);
}
}
/**
* @dev Returns the downcasted int200 from int256, reverting on
* overflow (when the input is less than smallest int200 or
* greater than largest int200).
*
* Counterpart to Solidity's `int200` operator.
*
* Requirements:
*
* - input must fit into 200 bits
*/
function toInt200(int256 value) internal pure returns (int200 downcasted) {
downcasted = int200(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(200, value);
}
}
/**
* @dev Returns the downcasted int192 from int256, reverting on
* overflow (when the input is less than smallest int192 or
* greater than largest int192).
*
* Counterpart to Solidity's `int192` operator.
*
* Requirements:
*
* - input must fit into 192 bits
*/
function toInt192(int256 value) internal pure returns (int192 downcasted) {
downcasted = int192(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(192, value);
}
}
/**
* @dev Returns the downcasted int184 from int256, reverting on
* overflow (when the input is less than smallest int184 or
* greater than largest int184).
*
* Counterpart to Solidity's `int184` operator.
*
* Requirements:
*
* - input must fit into 184 bits
*/
function toInt184(int256 value) internal pure returns (int184 downcasted) {
downcasted = int184(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(184, value);
}
}
/**
* @dev Returns the downcasted int176 from int256, reverting on
* overflow (when the input is less than smallest int176 or
* greater than largest int176).
*
* Counterpart to Solidity's `int176` operator.
*
* Requirements:
*
* - input must fit into 176 bits
*/
function toInt176(int256 value) internal pure returns (int176 downcasted) {
downcasted = int176(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(176, value);
}
}
/**
* @dev Returns the downcasted int168 from int256, reverting on
* overflow (when the input is less than smallest int168 or
* greater than largest int168).
*
* Counterpart to Solidity's `int168` operator.
*
* Requirements:
*
* - input must fit into 168 bits
*/
function toInt168(int256 value) internal pure returns (int168 downcasted) {
downcasted = int168(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(168, value);
}
}
/**
* @dev Returns the downcasted int160 from int256, reverting on
* overflow (when the input is less than smallest int160 or
* greater than largest int160).
*
* Counterpart to Solidity's `int160` operator.
*
* Requirements:
*
* - input must fit into 160 bits
*/
function toInt160(int256 value) internal pure returns (int160 downcasted) {
downcasted = int160(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(160, value);
}
}
/**
* @dev Returns the downcasted int152 from int256, reverting on
* overflow (when the input is less than smallest int152 or
* greater than largest int152).
*
* Counterpart to Solidity's `int152` operator.
*
* Requirements:
*
* - input must fit into 152 bits
*/
function toInt152(int256 value) internal pure returns (int152 downcasted) {
downcasted = int152(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(152, value);
}
}
/**
* @dev Returns the downcasted int144 from int256, reverting on
* overflow (when the input is less than smallest int144 or
* greater than largest int144).
*
* Counterpart to Solidity's `int144` operator.
*
* Requirements:
*
* - input must fit into 144 bits
*/
function toInt144(int256 value) internal pure returns (int144 downcasted) {
downcasted = int144(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(144, value);
}
}
/**
* @dev Returns the downcasted int136 from int256, reverting on
* overflow (when the input is less than smallest int136 or
* greater than largest int136).
*
* Counterpart to Solidity's `int136` operator.
*
* Requirements:
*
* - input must fit into 136 bits
*/
function toInt136(int256 value) internal pure returns (int136 downcasted) {
downcasted = int136(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(136, value);
}
}
/**
* @dev Returns the downcasted int128 from int256, reverting on
* overflow (when the input is less than smallest int128 or
* greater than largest int128).
*
* Counterpart to Solidity's `int128` operator.
*
* Requirements:
*
* - input must fit into 128 bits
*/
function toInt128(int256 value) internal pure returns (int128 downcasted) {
downcasted = int128(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(128, value);
}
}
/**
* @dev Returns the downcasted int120 from int256, reverting on
* overflow (when the input is less than smallest int120 or
* greater than largest int120).
*
* Counterpart to Solidity's `int120` operator.
*
* Requirements:
*
* - input must fit into 120 bits
*/
function toInt120(int256 value) internal pure returns (int120 downcasted) {
downcasted = int120(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(120, value);
}
}
/**
* @dev Returns the downcasted int112 from int256, reverting on
* overflow (when the input is less than smallest int112 or
* greater than largest int112).
*
* Counterpart to Solidity's `int112` operator.
*
* Requirements:
*
* - input must fit into 112 bits
*/
function toInt112(int256 value) internal pure returns (int112 downcasted) {
downcasted = int112(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(112, value);
}
}
/**
* @dev Returns the downcasted int104 from int256, reverting on
* overflow (when the input is less than smallest int104 or
* greater than largest int104).
*
* Counterpart to Solidity's `int104` operator.
*
* Requirements:
*
* - input must fit into 104 bits
*/
function toInt104(int256 value) internal pure returns (int104 downcasted) {
downcasted = int104(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(104, value);
}
}
/**
* @dev Returns the downcasted int96 from int256, reverting on
* overflow (when the input is less than smallest int96 or
* greater than largest int96).
*
* Counterpart to Solidity's `int96` operator.
*
* Requirements:
*
* - input must fit into 96 bits
*/
function toInt96(int256 value) internal pure returns (int96 downcasted) {
downcasted = int96(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(96, value);
}
}
/**
* @dev Returns the downcasted int88 from int256, reverting on
* overflow (when the input is less than smallest int88 or
* greater than largest int88).
*
* Counterpart to Solidity's `int88` operator.
*
* Requirements:
*
* - input must fit into 88 bits
*/
function toInt88(int256 value) internal pure returns (int88 downcasted) {
downcasted = int88(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(88, value);
}
}
/**
* @dev Returns the downcasted int80 from int256, reverting on
* overflow (when the input is less than smallest int80 or
* greater than largest int80).
*
* Counterpart to Solidity's `int80` operator.
*
* Requirements:
*
* - input must fit into 80 bits
*/
function toInt80(int256 value) internal pure returns (int80 downcasted) {
downcasted = int80(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(80, value);
}
}
/**
* @dev Returns the downcasted int72 from int256, reverting on
* overflow (when the input is less than smallest int72 or
* greater than largest int72).
*
* Counterpart to Solidity's `int72` operator.
*
* Requirements:
*
* - input must fit into 72 bits
*/
function toInt72(int256 value) internal pure returns (int72 downcasted) {
downcasted = int72(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(72, value);
}
}
/**
* @dev Returns the downcasted int64 from int256, reverting on
* overflow (when the input is less than smallest int64 or
* greater than largest int64).
*
* Counterpart to Solidity's `int64` operator.
*
* Requirements:
*
* - input must fit into 64 bits
*/
function toInt64(int256 value) internal pure returns (int64 downcasted) {
downcasted = int64(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(64, value);
}
}
/**
* @dev Returns the downcasted int56 from int256, reverting on
* overflow (when the input is less than smallest int56 or
* greater than largest int56).
*
* Counterpart to Solidity's `int56` operator.
*
* Requirements:
*
* - input must fit into 56 bits
*/
function toInt56(int256 value) internal pure returns (int56 downcasted) {
downcasted = int56(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(56, value);
}
}
/**
* @dev Returns the downcasted int48 from int256, reverting on
* overflow (when the input is less than smallest int48 or
* greater than largest int48).
*
* Counterpart to Solidity's `int48` operator.
*
* Requirements:
*
* - input must fit into 48 bits
*/
function toInt48(int256 value) internal pure returns (int48 downcasted) {
downcasted = int48(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(48, value);
}
}
/**
* @dev Returns the downcasted int40 from int256, reverting on
* overflow (when the input is less than smallest int40 or
* greater than largest int40).
*
* Counterpart to Solidity's `int40` operator.
*
* Requirements:
*
* - input must fit into 40 bits
*/
function toInt40(int256 value) internal pure returns (int40 downcasted) {
downcasted = int40(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(40, value);
}
}
/**
* @dev Returns the downcasted int32 from int256, reverting on
* overflow (when the input is less than smallest int32 or
* greater than largest int32).
*
* Counterpart to Solidity's `int32` operator.
*
* Requirements:
*
* - input must fit into 32 bits
*/
function toInt32(int256 value) internal pure returns (int32 downcasted) {
downcasted = int32(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(32, value);
}
}
/**
* @dev Returns the downcasted int24 from int256, reverting on
* overflow (when the input is less than smallest int24 or
* greater than largest int24).
*
* Counterpart to Solidity's `int24` operator.
*
* Requirements:
*
* - input must fit into 24 bits
*/
function toInt24(int256 value) internal pure returns (int24 downcasted) {
downcasted = int24(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(24, value);
}
}
/**
* @dev Returns the downcasted int16 from int256, reverting on
* overflow (when the input is less than smallest int16 or
* greater than largest int16).
*
* Counterpart to Solidity's `int16` operator.
*
* Requirements:
*
* - input must fit into 16 bits
*/
function toInt16(int256 value) internal pure returns (int16 downcasted) {
downcasted = int16(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(16, value);
}
}
/**
* @dev Returns the downcasted int8 from int256, reverting on
* overflow (when the input is less than smallest int8 or
* greater than largest int8).
*
* Counterpart to Solidity's `int8` operator.
*
* Requirements:
*
* - input must fit into 8 bits
*/
function toInt8(int256 value) internal pure returns (int8 downcasted) {
downcasted = int8(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(8, value);
}
}
/**
* @dev Converts an unsigned uint256 into a signed int256.
*
* Requirements:
*
* - input must be less than or equal to maxInt256.
*/
function toInt256(uint256 value) internal pure returns (int256) {
// Note: Unsafe cast below is okay because `type(int256).max` is guaranteed to be positive
if (value > uint256(type(int256).max)) {
revert SafeCastOverflowedUintToInt(value);
}
return int256(value);
}
}
/**
* @dev Provides tracking nonces for addresses. Nonces will only increment.
*/
abstract contract Nonces {
/**
* @dev The nonce used for an `account` is not the expected current nonce.
*/
error InvalidAccountNonce(address account, uint256 currentNonce);
mapping(address account => uint256) private _nonces;
/**
* @dev Returns the next unused nonce for an address.
*/
function nonces(address owner) public view virtual returns (uint256) {
return _nonces[owner];
}
/**
* @dev Consumes a nonce.
*
* Returns the current value and increments nonce.
*/
function _useNonce(address owner) internal virtual returns (uint256) {
// For each account, the nonce has an initial value of 0, can only be incremented by one, and cannot be
// decremented or reset. This guarantees that the nonce never overflows.
unchecked {
// It is important to do x++ and not ++x here.
return _nonces[owner]++;
}
}
/**
* @dev Same as {_useNonce} but checking that `nonce` is the next valid for `owner`.
*/
function _useCheckedNonce(address owner, uint256 nonce) internal virtual {
uint256 current = _useNonce(owner);
if (nonce != current) {
revert InvalidAccountNonce(owner, current);
}
}
}
/**
* @dev This library defines the `Trace*` struct, for checkpointing values as they change at different points in
* time, and later looking up past values by block number. See {Votes} as an example.
*
* To create a history of checkpoints define a variable type `Checkpoints.Trace*` in your contract, and store a new
* checkpoint for the current transaction block using the {push} function.
*/
library Checkpoints {
/**
* @dev A value was attempted to be inserted on a past checkpoint.
*/
error CheckpointUnorderedInsertion();
struct Trace224 {
Checkpoint224[] _checkpoints;
}
struct Checkpoint224 {
uint32 _key;
uint224 _value;
}
/**
* @dev Pushes a (`key`, `value`) pair into a Trace224 so that it is stored as the checkpoint.
*
* Returns previous value and new value.
*
* IMPORTANT: Never accept `key` as a user input, since an arbitrary `type(uint32).max` key set will disable the
* library.
*/
function push(Trace224 storage self, uint32 key, uint224 value) internal returns (uint224, uint224) {
return _insert(self._checkpoints, key, value);
}
/**
* @dev Returns the value in the first (oldest) checkpoint with key greater or equal than the search key, or zero if
* there is none.
*/
function lowerLookup(Trace224 storage self, uint32 key) internal view returns (uint224) {
uint256 len = self._checkpoints.length;
uint256 pos = _lowerBinaryLookup(self._checkpoints, key, 0, len);
return pos == len ? 0 : _unsafeAccess(self._checkpoints, pos)._value;
}
/**
* @dev Returns the value in the last (most recent) checkpoint with key lower or equal than the search key, or zero
* if there is none.
*/
function upperLookup(Trace224 storage self, uint32 key) internal view returns (uint224) {
uint256 len = self._checkpoints.length;
uint256 pos = _upperBinaryLookup(self._checkpoints, key, 0, len);
return pos == 0 ? 0 : _unsafeAccess(self._checkpoints, pos - 1)._value;
}
/**
* @dev Returns the value in the last (most recent) checkpoint with key lower or equal than the search key, or zero
* if there is none.
*
* NOTE: This is a variant of {upperLookup} that is optimised to find "recent" checkpoint (checkpoints with high
* keys).
*/
function upperLookupRecent(Trace224 storage self, uint32 key) internal view returns (uint224) {
uint256 len = self._checkpoints.length;
uint256 low = 0;
uint256 high = len;
if (len > 5) {
uint256 mid = len - Math.sqrt(len);
if (key < _unsafeAccess(self._checkpoints, mid)._key) {
high = mid;
} else {
low = mid + 1;
}
}
uint256 pos = _upperBinaryLookup(self._checkpoints, key, low, high);
return pos == 0 ? 0 : _unsafeAccess(self._checkpoints, pos - 1)._value;
}
/**
* @dev Returns the value in the most recent checkpoint, or zero if there are no checkpoints.
*/
function latest(Trace224 storage self) internal view returns (uint224) {
uint256 pos = self._checkpoints.length;
return pos == 0 ? 0 : _unsafeAccess(self._checkpoints, pos - 1)._value;
}
/**
* @dev Returns whether there is a checkpoint in the structure (i.e. it is not empty), and if so the key and value
* in the most recent checkpoint.
*/
function latestCheckpoint(Trace224 storage self) internal view returns (bool exists, uint32 _key, uint224 _value) {
uint256 pos = self._checkpoints.length;
if (pos == 0) {
return (false, 0, 0);
} else {
Checkpoint224 memory ckpt = _unsafeAccess(self._checkpoints, pos - 1);
return (true, ckpt._key, ckpt._value);
}
}
/**
* @dev Returns the number of checkpoint.
*/
function length(Trace224 storage self) internal view returns (uint256) {
return self._checkpoints.length;
}
/**
* @dev Returns checkpoint at given position.
*/
function at(Trace224 storage self, uint32 pos) internal view returns (Checkpoint224 memory) {
return self._checkpoints[pos];
}
/**
* @dev Pushes a (`key`, `value`) pair into an ordered list of checkpoints, either by inserting a new checkpoint,
* or by updating the last one.
*/
function _insert(Checkpoint224[] storage self, uint32 key, uint224 value) private returns (uint224, uint224) {
uint256 pos = self.length;
if (pos > 0) {
// Copying to memory is important here.
Checkpoint224 memory last = _unsafeAccess(self, pos - 1);
// Checkpoint keys must be non-decreasing.
if (last._key > key) {
revert CheckpointUnorderedInsertion();
}
// Update or push new checkpoint
if (last._key == key) {
_unsafeAccess(self, pos - 1)._value = value;
} else {
self.push(Checkpoint224({_key: key, _value: value}));
}
return (last._value, value);
} else {
self.push(Checkpoint224({_key: key, _value: value}));
return (0, value);
}
}
/**
* @dev Return the index of the last (most recent) checkpoint with key lower or equal than the search key, or `high`
* if there is none. `low` and `high` define a section where to do the search, with inclusive `low` and exclusive
* `high`.
*
* WARNING: `high` should not be greater than the array's length.
*/
function _upperBinaryLookup(
Checkpoint224[] storage self,
uint32 key,
uint256 low,
uint256 high
) private view returns (uint256) {
while (low < high) {
uint256 mid = Math.average(low, high);
if (_unsafeAccess(self, mid)._key > key) {
high = mid;
} else {
low = mid + 1;
}
}
return high;
}
/**
* @dev Return the index of the first (oldest) checkpoint with key is greater or equal than the search key, or
* `high` if there is none. `low` and `high` define a section where to do the search, with inclusive `low` and
* exclusive `high`.
*
* WARNING: `high` should not be greater than the array's length.
*/
function _lowerBinaryLookup(
Checkpoint224[] storage self,
uint32 key,
uint256 low,
uint256 high
) private view returns (uint256) {
while (low < high) {
uint256 mid = Math.average(low, high);
if (_unsafeAccess(self, mid)._key < key) {
low = mid + 1;
} else {
high = mid;
}
}
return high;
}
/**
* @dev Access an element of the array without performing bounds check. The position is assumed to be within bounds.
*/
function _unsafeAccess(
Checkpoint224[] storage self,
uint256 pos
) private pure returns (Checkpoint224 storage result) {
assembly {
mstore(0, self.slot)
result.slot := add(keccak256(0, 0x20), pos)
}
}
struct Trace208 {
Checkpoint208[] _checkpoints;
}
struct Checkpoint208 {
uint48 _key;
uint208 _value;
}
/**
* @dev Pushes a (`key`, `value`) pair into a Trace208 so that it is stored as the checkpoint.
*
* Returns previous value and new value.
*
* IMPORTANT: Never accept `key` as a user input, since an arbitrary `type(uint48).max` key set will disable the
* library.
*/
function push(Trace208 storage self, uint48 key, uint208 value) internal returns (uint208, uint208) {
return _insert(self._checkpoints, key, value);
}
/**
* @dev Returns the value in the first (oldest) checkpoint with key greater or equal than the search key, or zero if
* there is none.
*/
function lowerLookup(Trace208 storage self, uint48 key) internal view returns (uint208) {
uint256 len = self._checkpoints.length;
uint256 pos = _lowerBinaryLookup(self._checkpoints, key, 0, len);
return pos == len ? 0 : _unsafeAccess(self._checkpoints, pos)._value;
}
/**
* @dev Returns the value in the last (most recent) checkpoint with key lower or equal than the search key, or zero
* if there is none.
*/
function upperLookup(Trace208 storage self, uint48 key) internal view returns (uint208) {
uint256 len = self._checkpoints.length;
uint256 pos = _upperBinaryLookup(self._checkpoints, key, 0, len);
return pos == 0 ? 0 : _unsafeAccess(self._checkpoints, pos - 1)._value;
}
/**
* @dev Returns the value in the last (most recent) checkpoint with key lower or equal than the search key, or zero
* if there is none.
*
* NOTE: This is a variant of {upperLookup} that is optimised to find "recent" checkpoint (checkpoints with high
* keys).
*/
function upperLookupRecent(Trace208 storage self, uint48 key) internal view returns (uint208) {
uint256 len = self._checkpoints.length;
uint256 low = 0;
uint256 high = len;
if (len > 5) {
uint256 mid = len - Math.sqrt(len);
if (key < _unsafeAccess(self._checkpoints, mid)._key) {
high = mid;
} else {
low = mid + 1;
}
}
uint256 pos = _upperBinaryLookup(self._checkpoints, key, low, high);
return pos == 0 ? 0 : _unsafeAccess(self._checkpoints, pos - 1)._value;
}
/**
* @dev Returns the value in the most recent checkpoint, or zero if there are no checkpoints.
*/
function latest(Trace208 storage self) internal view returns (uint208) {
uint256 pos = self._checkpoints.length;
return pos == 0 ? 0 : _unsafeAccess(self._checkpoints, pos - 1)._value;
}
/**
* @dev Returns whether there is a checkpoint in the structure (i.e. it is not empty), and if so the key and value
* in the most recent checkpoint.
*/
function latestCheckpoint(Trace208 storage self) internal view returns (bool exists, uint48 _key, uint208 _value) {
uint256 pos = self._checkpoints.length;
if (pos == 0) {
return (false, 0, 0);
} else {
Checkpoint208 memory ckpt = _unsafeAccess(self._checkpoints, pos - 1);
return (true, ckpt._key, ckpt._value);
}
}
/**
* @dev Returns the number of checkpoint.
*/
function length(Trace208 storage self) internal view returns (uint256) {
return self._checkpoints.length;
}
/**
* @dev Returns checkpoint at given position.
*/
function at(Trace208 storage self, uint32 pos) internal view returns (Checkpoint208 memory) {
return self._checkpoints[pos];
}
/**
* @dev Pushes a (`key`, `value`) pair into an ordered list of checkpoints, either by inserting a new checkpoint,
* or by updating the last one.
*/
function _insert(Checkpoint208[] storage self, uint48 key, uint208 value) private returns (uint208, uint208) {
uint256 pos = self.length;
if (pos > 0) {
// Copying to memory is important here.
Checkpoint208 memory last = _unsafeAccess(self, pos - 1);
// Checkpoint keys must be non-decreasing.
if (last._key > key) {
revert CheckpointUnorderedInsertion();
}
// Update or push new checkpoint
if (last._key == key) {
_unsafeAccess(self, pos - 1)._value = value;
} else {
self.push(Checkpoint208({_key: key, _value: value}));
}
return (last._value, value);
} else {
self.push(Checkpoint208({_key: key, _value: value}));
return (0, value);
}
}
/**
* @dev Return the index of the last (most recent) checkpoint with key lower or equal than the search key, or `high`
* if there is none. `low` and `high` define a section where to do the search, with inclusive `low` and exclusive
* `high`.
*
* WARNING: `high` should not be greater than the array's length.
*/
function _upperBinaryLookup(
Checkpoint208[] storage self,
uint48 key,
uint256 low,
uint256 high
) private view returns (uint256) {
while (low < high) {
uint256 mid = Math.average(low, high);
if (_unsafeAccess(self, mid)._key > key) {
high = mid;
} else {
low = mid + 1;
}
}
return high;
}
/**
* @dev Return the index of the first (oldest) checkpoint with key is greater or equal than the search key, or
* `high` if there is none. `low` and `high` define a section where to do the search, with inclusive `low` and
* exclusive `high`.
*
* WARNING: `high` should not be greater than the array's length.
*/
function _lowerBinaryLookup(
Checkpoint208[] storage self,
uint48 key,
uint256 low,
uint256 high
) private view returns (uint256) {
while (low < high) {
uint256 mid = Math.average(low, high);
if (_unsafeAccess(self, mid)._key < key) {
low = mid + 1;
} else {
high = mid;
}
}
return high;
}
/**
* @dev Access an element of the array without performing bounds check. The position is assumed to be within bounds.
*/
function _unsafeAccess(
Checkpoint208[] storage self,
uint256 pos
) private pure returns (Checkpoint208 storage result) {
assembly {
mstore(0, self.slot)
result.slot := add(keccak256(0, 0x20), pos)
}
}
struct Trace160 {
Checkpoint160[] _checkpoints;
}
struct Checkpoint160 {
uint96 _key;
uint160 _value;
}
/**
* @dev Pushes a (`key`, `value`) pair into a Trace160 so that it is stored as the checkpoint.
*
* Returns previous value and new value.
*
* IMPORTANT: Never accept `key` as a user input, since an arbitrary `type(uint96).max` key set will disable the
* library.
*/
function push(Trace160 storage self, uint96 key, uint160 value) internal returns (uint160, uint160) {
return _insert(self._checkpoints, key, value);
}
/**
* @dev Returns the value in the first (oldest) checkpoint with key greater or equal than the search key, or zero if
* there is none.
*/
function lowerLookup(Trace160 storage self, uint96 key) internal view returns (uint160) {
uint256 len = self._checkpoints.length;
uint256 pos = _lowerBinaryLookup(self._checkpoints, key, 0, len);
return pos == len ? 0 : _unsafeAccess(self._checkpoints, pos)._value;
}
/**
* @dev Returns the value in the last (most recent) checkpoint with key lower or equal than the search key, or zero
* if there is none.
*/
function upperLookup(Trace160 storage self, uint96 key) internal view returns (uint160) {
uint256 len = self._checkpoints.length;
uint256 pos = _upperBinaryLookup(self._checkpoints, key, 0, len);
return pos == 0 ? 0 : _unsafeAccess(self._checkpoints, pos - 1)._value;
}
/**
* @dev Returns the value in the last (most recent) checkpoint with key lower or equal than the search key, or zero
* if there is none.
*
* NOTE: This is a variant of {upperLookup} that is optimised to find "recent" checkpoint (checkpoints with high
* keys).
*/
function upperLookupRecent(Trace160 storage self, uint96 key) internal view returns (uint160) {
uint256 len = self._checkpoints.length;
uint256 low = 0;
uint256 high = len;
if (len > 5) {
uint256 mid = len - Math.sqrt(len);
if (key < _unsafeAccess(self._checkpoints, mid)._key) {
high = mid;
} else {
low = mid + 1;
}
}
uint256 pos = _upperBinaryLookup(self._checkpoints, key, low, high);
return pos == 0 ? 0 : _unsafeAccess(self._checkpoints, pos - 1)._value;
}
/**
* @dev Returns the value in the most recent checkpoint, or zero if there are no checkpoints.
*/
function latest(Trace160 storage self) internal view returns (uint160) {
uint256 pos = self._checkpoints.length;
return pos == 0 ? 0 : _unsafeAccess(self._checkpoints, pos - 1)._value;
}
/**
* @dev Returns whether there is a checkpoint in the structure (i.e. it is not empty), and if so the key and value
* in the most recent checkpoint.
*/
function latestCheckpoint(Trace160 storage self) internal view returns (bool exists, uint96 _key, uint160 _value) {
uint256 pos = self._checkpoints.length;
if (pos == 0) {
return (false, 0, 0);
} else {
Checkpoint160 memory ckpt = _unsafeAccess(self._checkpoints, pos - 1);
return (true, ckpt._key, ckpt._value);
}
}
/**
* @dev Returns the number of checkpoint.
*/
function length(Trace160 storage self) internal view returns (uint256) {
return self._checkpoints.length;
}
/**
* @dev Returns checkpoint at given position.
*/
function at(Trace160 storage self, uint32 pos) internal view returns (Checkpoint160 memory) {
return self._checkpoints[pos];
}
/**
* @dev Pushes a (`key`, `value`) pair into an ordered list of checkpoints, either by inserting a new checkpoint,
* or by updating the last one.
*/
function _insert(Checkpoint160[] storage self, uint96 key, uint160 value) private returns (uint160, uint160) {
uint256 pos = self.length;
if (pos > 0) {
// Copying to memory is important here.
Checkpoint160 memory last = _unsafeAccess(self, pos - 1);
// Checkpoint keys must be non-decreasing.
if (last._key > key) {
revert CheckpointUnorderedInsertion();
}
// Update or push new checkpoint
if (last._key == key) {
_unsafeAccess(self, pos - 1)._value = value;
} else {
self.push(Checkpoint160({_key: key, _value: value}));
}
return (last._value, value);
} else {
self.push(Checkpoint160({_key: key, _value: value}));
return (0, value);
}
}
/**
* @dev Return the index of the last (most recent) checkpoint with key lower or equal than the search key, or `high`
* if there is none. `low` and `high` define a section where to do the search, with inclusive `low` and exclusive
* `high`.
*
* WARNING: `high` should not be greater than the array's length.
*/
function _upperBinaryLookup(
Checkpoint160[] storage self,
uint96 key,
uint256 low,
uint256 high
) private view returns (uint256) {
while (low < high) {
uint256 mid = Math.average(low, high);
if (_unsafeAccess(self, mid)._key > key) {
high = mid;
} else {
low = mid + 1;
}
}
return high;
}
/**
* @dev Return the index of the first (oldest) checkpoint with key is greater or equal than the search key, or
* `high` if there is none. `low` and `high` define a section where to do the search, with inclusive `low` and
* exclusive `high`.
*
* WARNING: `high` should not be greater than the array's length.
*/
function _lowerBinaryLookup(
Checkpoint160[] storage self,
uint96 key,
uint256 low,
uint256 high
) private view returns (uint256) {
while (low < high) {
uint256 mid = Math.average(low, high);
if (_unsafeAccess(self, mid)._key < key) {
low = mid + 1;
} else {
high = mid;
}
}
return high;
}
/**
* @dev Access an element of the array without performing bounds check. The position is assumed to be within bounds.
*/
function _unsafeAccess(
Checkpoint160[] storage self,
uint256 pos
) private pure returns (Checkpoint160 storage result) {
assembly {
mstore(0, self.slot)
result.slot := add(keccak256(0, 0x20), pos)
}
}
}
/**
* @dev This library provides helpers for manipulating time-related objects.
*
* It uses the following types:
* - `uint48` for timepoints
* - `uint32` for durations
*
* While the library doesn't provide specific types for timepoints and duration, it does provide:
* - a `Delay` type to represent duration that can be programmed to change value automatically at a given point
* - additional helper functions
*/
library Time {
using Time for *;
/**
* @dev Get the block timestamp as a Timepoint.
*/
function timestamp() internal view returns (uint48) {
return SafeCast.toUint48(block.timestamp);
}
/**
* @dev Get the block number as a Timepoint.
*/
function blockNumber() internal view returns (uint48) {
return SafeCast.toUint48(block.number);
}
// ==================================================== Delay =====================================================
/**
* @dev A `Delay` is a uint32 duration that can be programmed to change value automatically at a given point in the
* future. The "effect" timepoint describes when the transitions happens from the "old" value to the "new" value.
* This allows updating the delay applied to some operation while keeping some guarantees.
*
* In particular, the {update} function guarantees that if the delay is reduced, the old delay still applies for
* some time. For example if the delay is currently 7 days to do an upgrade, the admin should not be able to set
* the delay to 0 and upgrade immediately. If the admin wants to reduce the delay, the old delay (7 days) should
* still apply for some time.
*
*
* The `Delay` type is 112 bits long, and packs the following:
*
* ```
* | [uint48]: effect date (timepoint)
* | | [uint32]: value before (duration)
* ↓ ↓ ↓ [uint32]: value after (duration)
* 0xAAAAAAAAAAAABBBBBBBBCCCCCCCC
* ```
*
* NOTE: The {get} and {withUpdate} functions operate using timestamps. Block number based delays are not currently
* supported.
*/
type Delay is uint112;
/**
* @dev Wrap a duration into a Delay to add the one-step "update in the future" feature
*/
function toDelay(uint32 duration) internal pure returns (Delay) {
return Delay.wrap(duration);
}
/**
* @dev Get the value at a given timepoint plus the pending value and effect timepoint if there is a scheduled
* change after this timepoint. If the effect timepoint is 0, then the pending value should not be considered.
*/
function _getFullAt(Delay self, uint48 timepoint) private pure returns (uint32, uint32, uint48) {
(uint32 valueBefore, uint32 valueAfter, uint48 effect) = self.unpack();
return effect <= timepoint ? (valueAfter, 0, 0) : (valueBefore, valueAfter, effect);
}
/**
* @dev Get the current value plus the pending value and effect timepoint if there is a scheduled change. If the
* effect timepoint is 0, then the pending value should not be considered.
*/
function getFull(Delay self) internal view returns (uint32, uint32, uint48) {
return _getFullAt(self, timestamp());
}
/**
* @dev Get the current value.
*/
function get(Delay self) internal view returns (uint32) {
(uint32 delay, , ) = self.getFull();
return delay;
}
/**
* @dev Update a Delay object so that it takes a new duration after a timepoint that is automatically computed to
* enforce the old delay at the moment of the update. Returns the updated Delay object and the timestamp when the
* new delay becomes effective.
*/
function withUpdate(
Delay self,
uint32 newValue,
uint32 minSetback
) internal view returns (Delay updatedDelay, uint48 effect) {
uint32 value = self.get();
uint32 setback = uint32(Math.max(minSetback, value > newValue ? value - newValue : 0));
effect = timestamp() + setback;
return (pack(value, newValue, effect), effect);
}
/**
* @dev Split a delay into its components: valueBefore, valueAfter and effect (transition timepoint).
*/
function unpack(Delay self) internal pure returns (uint32 valueBefore, uint32 valueAfter, uint48 effect) {
uint112 raw = Delay.unwrap(self);
valueAfter = uint32(raw);
valueBefore = uint32(raw >> 32);
effect = uint48(raw >> 64);
return (valueBefore, valueAfter, effect);
}
/**
* @dev pack the components into a Delay object.
*/
function pack(uint32 valueBefore, uint32 valueAfter, uint48 effect) internal pure returns (Delay) {
return Delay.wrap((uint112(effect) << 64) | (uint112(valueBefore) << 32) | uint112(valueAfter));
}
}
/**
* @dev This is a base abstract contract that tracks voting units, which are a measure of voting power that can be
* transferred, and provides a system of vote delegation, where an account can delegate its voting units to a sort of
* "representative" that will pool delegated voting units from different accounts and can then use it to vote in
* decisions. In fact, voting units _must_ be delegated in order to count as actual votes, and an account has to
* delegate those votes to itself if it wishes to participate in decisions and does not have a trusted representative.
*
* This contract is often combined with a token contract such that voting units correspond to token units. For an
* example, see {ERC721Votes}.
*
* The full history of delegate votes is tracked on-chain so that governance protocols can consider votes as distributed
* at a particular block number to protect against flash loans and double voting. The opt-in delegate system makes the
* cost of this history tracking optional.
*
* When using this module the derived contract must implement {_getVotingUnits} (for example, make it return
* {ERC721-balanceOf}), and can use {_transferVotingUnits} to track a change in the distribution of those units (in the
* previous example, it would be included in {ERC721-_update}).
*/
abstract contract Votes is Context, EIP712, Nonces, IERC5805 {
using Checkpoints for Checkpoints.Trace208;
bytes32 private constant DELEGATION_TYPEHASH =
keccak256("Delegation(address delegatee,uint256 nonce,uint256 expiry)");
mapping(address account => address) private _delegatee;
mapping(address delegatee => Checkpoints.Trace208) private _delegateCheckpoints;
Checkpoints.Trace208 private _totalCheckpoints;
/**
* @dev The clock was incorrectly modified.
*/
error ERC6372InconsistentClock();
/**
* @dev Lookup to future votes is not available.
*/
error ERC5805FutureLookup(uint256 timepoint, uint48 clock);
/**
* @dev Clock used for flagging checkpoints. Can be overridden to implement timestamp based
* checkpoints (and voting), in which case {CLOCK_MODE} should be overridden as well to match.
*/
function clock() public view virtual returns (uint48) {
return Time.blockNumber();
}
/**
* @dev Machine-readable description of the clock as specified in EIP-6372.
*/
// solhint-disable-next-line func-name-mixedcase
function CLOCK_MODE() public view virtual returns (string memory) {
// Check that the clock was not modified
if (clock() != Time.blockNumber()) {
revert ERC6372InconsistentClock();
}
return "mode=blocknumber&from=default";
}
/**
* @dev Returns the current amount of votes that `account` has.
*/
function getVotes(address account) public view virtual returns (uint256) {
return _delegateCheckpoints[account].latest();
}
/**
* @dev Returns the amount of votes that `account` had at a specific moment in the past. If the `clock()` is
* configured to use block numbers, this will return the value at the end of the corresponding block.
*
* Requirements:
*
* - `timepoint` must be in the past. If operating using block numbers, the block must be already mined.
*/
function getPastVotes(address account, uint256 timepoint) public view virtual returns (uint256) {
uint48 currentTimepoint = clock();
if (timepoint >= currentTimepoint) {
revert ERC5805FutureLookup(timepoint, currentTimepoint);
}
return _delegateCheckpoints[account].upperLookupRecent(SafeCast.toUint48(timepoint));
}
/**
* @dev Returns the total supply of votes available at a specific moment in the past. If the `clock()` is
* configured to use block numbers, this will return the value at the end of the corresponding block.
*
* NOTE: This value is the sum of all available votes, which is not necessarily the sum of all delegated votes.
* Votes that have not been delegated are still part of total supply, even though they would not participate in a
* vote.
*
* Requirements:
*
* - `timepoint` must be in the past. If operating using block numbers, the block must be already mined.
*/
function getPastTotalSupply(uint256 timepoint) public view virtual returns (uint256) {
uint48 currentTimepoint = clock();
if (timepoint >= currentTimepoint) {
revert ERC5805FutureLookup(timepoint, currentTimepoint);
}
return _totalCheckpoints.upperLookupRecent(SafeCast.toUint48(timepoint));
}
/**
* @dev Returns the current total supply of votes.
*/
function _getTotalSupply() internal view virtual returns (uint256) {
return _totalCheckpoints.latest();
}
/**
* @dev Returns the delegate that `account` has chosen.
*/
function delegates(address account) public view virtual returns (address) {
return _delegatee[account];
}
/**
* @dev Delegates votes from the sender to `delegatee`.
*/
function delegate(address delegatee) public virtual {
address account = _msgSender();
_delegate(account, delegatee);
}
/**
* @dev Delegates votes from signer to `delegatee`.
*/
function delegateBySig(
address delegatee,
uint256 nonce,
uint256 expiry,
uint8 v,
bytes32 r,
bytes32 s
) public virtual {
if (block.timestamp > expiry) {
revert VotesExpiredSignature(expiry);
}
address signer = ECDSA.recover(
_hashTypedDataV4(keccak256(abi.encode(DELEGATION_TYPEHASH, delegatee, nonce, expiry))),
v,
r,
s
);
_useCheckedNonce(signer, nonce);
_delegate(signer, delegatee);
}
/**
* @dev Delegate all of `account`'s voting units to `delegatee`.
*
* Emits events {IVotes-DelegateChanged} and {IVotes-DelegateVotesChanged}.
*/
function _delegate(address account, address delegatee) internal virtual {
address oldDelegate = delegates(account);
_delegatee[account] = delegatee;
emit DelegateChanged(account, oldDelegate, delegatee);
_moveDelegateVotes(oldDelegate, delegatee, _getVotingUnits(account));
}
/**
* @dev Transfers, mints, or burns voting units. To register a mint, `from` should be zero. To register a burn, `to`
* should be zero. Total supply of voting units will be adjusted with mints and burns.
*/
function _transferVotingUnits(address from, address to, uint256 amount) internal virtual {
if (from == address(0)) {
_push(_totalCheckpoints, _add, SafeCast.toUint208(amount));
}
if (to == address(0)) {
_push(_totalCheckpoints, _subtract, SafeCast.toUint208(amount));
}
_moveDelegateVotes(delegates(from), delegates(to), amount);
}
/**
* @dev Moves delegated votes from one delegate to another.
*/
function _moveDelegateVotes(address from, address to, uint256 amount) private {
if (from != to && amount > 0) {
if (from != address(0)) {
(uint256 oldValue, uint256 newValue) = _push(
_delegateCheckpoints[from],
_subtract,
SafeCast.toUint208(amount)
);
emit DelegateVotesChanged(from, oldValue, newValue);
}
if (to != address(0)) {
(uint256 oldValue, uint256 newValue) = _push(
_delegateCheckpoints[to],
_add,
SafeCast.toUint208(amount)
);
emit DelegateVotesChanged(to, oldValue, newValue);
}
}
}
/**
* @dev Get number of checkpoints for `account`.
*/
function _numCheckpoints(address account) internal view virtual returns (uint32) {
return SafeCast.toUint32(_delegateCheckpoints[account].length());
}
/**
* @dev Get the `pos`-th checkpoint for `account`.
*/
function _checkpoints(
address account,
uint32 pos
) internal view virtual returns (Checkpoints.Checkpoint208 memory) {
return _delegateCheckpoints[account].at(pos);
}
function _push(
Checkpoints.Trace208 storage store,
function(uint208, uint208) view returns (uint208) op,
uint208 delta
) private returns (uint208, uint208) {
return store.push(clock(), op(store.latest(), delta));
}
function _add(uint208 a, uint208 b) private pure returns (uint208) {
return a + b;
}
function _subtract(uint208 a, uint208 b) private pure returns (uint208) {
return a - b;
}
/**
* @dev Must return the voting units held by an account.
*/
function _getVotingUnits(address) internal view virtual returns (uint256);
}
/**
* @dev Standard ERC20 Errors
* Interface of the https://eips.ethereum.org/EIPS/eip-6093[ERC-6093] custom errors for ERC20 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 ERC721 Errors
* Interface of the https://eips.ethereum.org/EIPS/eip-6093[ERC-6093] custom errors for ERC721 tokens.
*/
interface IERC721Errors {
/**
* @dev Indicates that an address can't be an owner. For example, `address(0)` is a forbidden owner in EIP-20.
* Used in balance queries.
* @param owner Address of the current owner of a token.
*/
error ERC721InvalidOwner(address owner);
/**
* @dev Indicates a `tokenId` whose `owner` is the zero address.
* @param tokenId Identifier number of a token.
*/
error ERC721NonexistentToken(uint256 tokenId);
/**
* @dev Indicates an error related to the ownership over a particular token. Used in transfers.
* @param sender Address whose tokens are being transferred.
* @param tokenId Identifier number of a token.
* @param owner Address of the current owner of a token.
*/
error ERC721IncorrectOwner(address sender, uint256 tokenId, address owner);
/**
* @dev Indicates a failure with the token `sender`. Used in transfers.
* @param sender Address whose tokens are being transferred.
*/
error ERC721InvalidSender(address sender);
/**
* @dev Indicates a failure with the token `receiver`. Used in transfers.
* @param receiver Address to which tokens are being transferred.
*/
error ERC721InvalidReceiver(address receiver);
/**
* @dev Indicates a failure with the `operator`’s approval. Used in transfers.
* @param operator Address that may be allowed to operate on tokens without being their owner.
* @param tokenId Identifier number of a token.
*/
error ERC721InsufficientApproval(address operator, uint256 tokenId);
/**
* @dev Indicates a failure with the `approver` of a token to be approved. Used in approvals.
* @param approver Address initiating an approval operation.
*/
error ERC721InvalidApprover(address approver);
/**
* @dev Indicates a failure with the `operator` to be approved. Used in approvals.
* @param operator Address that may be allowed to operate on tokens without being their owner.
*/
error ERC721InvalidOperator(address operator);
}
/**
* @dev Standard ERC1155 Errors
* Interface of the https://eips.ethereum.org/EIPS/eip-6093[ERC-6093] custom errors for ERC1155 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);
}
/**
* @dev Interface of the ERC20 standard as defined in the EIP.
*/
interface IERC20 {
/**
* @dev Emitted when `value` tokens are moved from one account (`from`) to
* another (`to`).
*
* Note that `value` may be zero.
*/
event Transfer(address indexed from, address indexed to, uint256 value);
/**
* @dev Emitted when the allowance of a `spender` for an `owner` is set by
* a call to {approve}. `value` is the new allowance.
*/
event Approval(address indexed owner, address indexed spender, uint256 value);
/**
* @dev Returns the value of tokens in existence.
*/
function totalSupply() external view returns (uint256);
/**
* @dev Returns the value of tokens owned by `account`.
*/
function balanceOf(address account) external view returns (uint256);
/**
* @dev Moves a `value` amount of tokens from the caller's account to `to`.
*
* Returns a boolean value indicating whether the operation succeeded.
*
* Emits a {Transfer} event.
*/
function transfer(address to, uint256 value) external returns (bool);
/**
* @dev Returns the remaining number of tokens that `spender` will be
* allowed to spend on behalf of `owner` through {transferFrom}. This is
* zero by default.
*
* This value changes when {approve} or {transferFrom} are called.
*/
function allowance(address owner, address spender) external view returns (uint256);
/**
* @dev Sets a `value` amount of tokens as the allowance of `spender` over the
* caller's tokens.
*
* Returns a boolean value indicating whether the operation succeeded.
*
* IMPORTANT: Beware that changing an allowance with this method brings the risk
* that someone may use both the old and the new allowance by unfortunate
* transaction ordering. One possible solution to mitigate this race
* condition is to first reduce the spender's allowance to 0 and set the
* desired value afterwards:
* https://github.com/ethereum/EIPs/issues/20#issuecomment-263524729
*
* Emits an {Approval} event.
*/
function approve(address spender, uint256 value) external returns (bool);
/**
* @dev Moves a `value` amount of tokens from `from` to `to` using the
* allowance mechanism. `value` is then deducted from the caller's
* allowance.
*
* Returns a boolean value indicating whether the operation succeeded.
*
* Emits a {Transfer} event.
*/
function transferFrom(address from, address to, uint256 value) external returns (bool);
}
/**
* @dev Interface for the optional metadata functions from the ERC20 standard.
*/
interface IERC20Metadata is IERC20 {
/**
* @dev Returns the name of the token.
*/
function name() external view returns (string memory);
/**
* @dev Returns the symbol of the token.
*/
function symbol() external view returns (string memory);
/**
* @dev Returns the decimals places of the token.
*/
function decimals() external view returns (uint8);
}
/**
* @dev Implementation of the {IERC20} interface.
*
* This implementation is agnostic to the way tokens are created. This means
* that a supply mechanism has to be added in a derived contract using {_mint}.
*
* TIP: For a detailed writeup see our guide
* https://forum.openzeppelin.com/t/how-to-implement-erc20-supply-mechanisms/226[How
* to implement supply mechanisms].
*
* The default value of {decimals} is 18. To change this, you should override
* this function so it returns a different value.
*
* We have followed general OpenZeppelin Contracts guidelines: functions revert
* instead returning `false` on failure. This behavior is nonetheless
* conventional and does not conflict with the expectations of ERC20
* applications.
*
* Additionally, an {Approval} event is emitted on calls to {transferFrom}.
* This allows applications to reconstruct the allowance for all accounts just
* by listening to said events. Other implementations of the EIP may not emit
* these events, as it isn't required by the specification.
*/
abstract contract ERC20 is Context, IERC20, IERC20Metadata, IERC20Errors {
mapping(address account => uint256) private _balances;
mapping(address account => mapping(address spender => uint256)) private _allowances;
uint256 private _totalSupply;
string private _name;
string private _symbol;
/**
* @dev Sets the values for {name} and {symbol}.
*
* All two of these values are immutable: they can only be set once during
* construction.
*/
constructor(string memory name_, string memory symbol_) {
_name = name_;
_symbol = symbol_;
}
/**
* @dev Returns the name of the token.
*/
function name() public view virtual returns (string memory) {
return _name;
}
/**
* @dev Returns the symbol of the token, usually a shorter version of the
* name.
*/
function symbol() public view virtual returns (string memory) {
return _symbol;
}
/**
* @dev Returns the number of decimals used to get its user representation.
* For example, if `decimals` equals `2`, a balance of `505` tokens should
* be displayed to a user as `5.05` (`505 / 10 ** 2`).
*
* Tokens usually opt for a value of 18, imitating the relationship between
* Ether and Wei. This is the default value returned by this function, unless
* it's overridden.
*
* NOTE: This information is only used for _display_ purposes: it in
* no way affects any of the arithmetic of the contract, including
* {IERC20-balanceOf} and {IERC20-transfer}.
*/
function decimals() public view virtual returns (uint8) {
return 18;
}
/**
* @dev See {IERC20-totalSupply}.
*/
function totalSupply() public view virtual returns (uint256) {
return _totalSupply;
}
/**
* @dev See {IERC20-balanceOf}.
*/
function balanceOf(address account) public view virtual returns (uint256) {
return _balances[account];
}
/**
* @dev See {IERC20-transfer}.
*
* Requirements:
*
* - `to` cannot be the zero address.
* - the caller must have a balance of at least `value`.
*/
function transfer(address to, uint256 value) public virtual returns (bool) {
address owner = _msgSender();
_transfer(owner, to, value);
return true;
}
/**
* @dev See {IERC20-allowance}.
*/
function allowance(address owner, address spender) public view virtual returns (uint256) {
return _allowances[owner][spender];
}
/**
* @dev See {IERC20-approve}.
*
* NOTE: If `value` is the maximum `uint256`, the allowance is not updated on
* `transferFrom`. This is semantically equivalent to an infinite approval.
*
* Requirements:
*
* - `spender` cannot be the zero address.
*/
function approve(address spender, uint256 value) public virtual returns (bool) {
address owner = _msgSender();
_approve(owner, spender, value);
return true;
}
/**
* @dev See {IERC20-transferFrom}.
*
* Emits an {Approval} event indicating the updated allowance. This is not
* required by the EIP. See the note at the beginning of {ERC20}.
*
* NOTE: Does not update the allowance if the current allowance
* is the maximum `uint256`.
*
* Requirements:
*
* - `from` and `to` cannot be the zero address.
* - `from` must have a balance of at least `value`.
* - the caller must have allowance for ``from``'s tokens of at least
* `value`.
*/
function transferFrom(address from, address to, uint256 value) public virtual returns (bool) {
address spender = _msgSender();
_spendAllowance(from, spender, value);
_transfer(from, to, value);
return true;
}
/**
* @dev Moves a `value` amount of tokens from `from` to `to`.
*
* This internal function is equivalent to {transfer}, and can be used to
* e.g. implement automatic token fees, slashing mechanisms, etc.
*
* Emits a {Transfer} event.
*
* NOTE: This function is not virtual, {_update} should be overridden instead.
*/
function _transfer(address from, address to, uint256 value) internal {
if (from == address(0)) {
revert ERC20InvalidSender(address(0));
}
if (to == address(0)) {
revert ERC20InvalidReceiver(address(0));
}
_update(from, to, value);
}
/**
* @dev Transfers a `value` amount of tokens from `from` to `to`, or alternatively mints (or burns) if `from`
* (or `to`) is the zero address. All customizations to transfers, mints, and burns should be done by overriding
* this function.
*
* Emits a {Transfer} event.
*/
function _update(address from, address to, uint256 value) internal virtual {
if (from == address(0)) {
// Overflow check required: The rest of the code assumes that totalSupply never overflows
_totalSupply += value;
} else {
uint256 fromBalance = _balances[from];
if (fromBalance < value) {
revert ERC20InsufficientBalance(from, fromBalance, value);
}
unchecked {
// Overflow not possible: value <= fromBalance <= totalSupply.
_balances[from] = fromBalance - value;
}
}
if (to == address(0)) {
unchecked {
// Overflow not possible: value <= totalSupply or value <= fromBalance <= totalSupply.
_totalSupply -= value;
}
} else {
unchecked {
// Overflow not possible: balance + value is at most totalSupply, which we know fits into a uint256.
_balances[to] += value;
}
}
emit Transfer(from, to, value);
}
/**
* @dev Creates a `value` amount of tokens and assigns them to `account`, by transferring it from address(0).
* Relies on the `_update` mechanism
*
* Emits a {Transfer} event with `from` set to the zero address.
*
* NOTE: This function is not virtual, {_update} should be overridden instead.
*/
function _mint(address account, uint256 value) internal {
if (account == address(0)) {
revert ERC20InvalidReceiver(address(0));
}
_update(address(0), account, value);
}
/**
* @dev Destroys a `value` amount of tokens from `account`, lowering the total supply.
* Relies on the `_update` mechanism.
*
* Emits a {Transfer} event with `to` set to the zero address.
*
* NOTE: This function is not virtual, {_update} should be overridden instead
*/
function _burn(address account, uint256 value) internal {
if (account == address(0)) {
revert ERC20InvalidSender(address(0));
}
_update(account, address(0), value);
}
/**
* @dev Sets `value` as the allowance of `spender` over the `owner` s tokens.
*
* This internal function is equivalent to `approve`, and can be used to
* e.g. set automatic allowances for certain subsystems, etc.
*
* Emits an {Approval} event.
*
* Requirements:
*
* - `owner` cannot be the zero address.
* - `spender` cannot be the zero address.
*
* Overrides to this logic should be done to the variant with an additional `bool emitEvent` argument.
*/
function _approve(address owner, address spender, uint256 value) internal {
_approve(owner, spender, value, true);
}
/**
* @dev Variant of {_approve} with an optional flag to enable or disable the {Approval} event.
*
* By default (when calling {_approve}) the flag is set to true. On the other hand, approval changes made by
* `_spendAllowance` during the `transferFrom` operation set the flag to false. This saves gas by not emitting any
* `Approval` event during `transferFrom` operations.
*
* Anyone who wishes to continue emitting `Approval` events on the`transferFrom` operation can force the flag to
* true using the following override:
* ```
* function _approve(address owner, address spender, uint256 value, bool) internal virtual override {
* super._approve(owner, spender, value, true);
* }
* ```
*
* Requirements are the same as {_approve}.
*/
function _approve(address owner, address spender, uint256 value, bool emitEvent) internal virtual {
if (owner == address(0)) {
revert ERC20InvalidApprover(address(0));
}
if (spender == address(0)) {
revert ERC20InvalidSpender(address(0));
}
_allowances[owner][spender] = value;
if (emitEvent) {
emit Approval(owner, spender, value);
}
}
/**
* @dev Updates `owner` s allowance for `spender` based on spent `value`.
*
* Does not update the allowance value in case of infinite allowance.
* Revert if not enough allowance is available.
*
* Does not emit an {Approval} event.
*/
function _spendAllowance(address owner, address spender, uint256 value) internal virtual {
uint256 currentAllowance = allowance(owner, spender);
if (currentAllowance != type(uint256).max) {
if (currentAllowance < value) {
revert ERC20InsufficientAllowance(spender, currentAllowance, value);
}
unchecked {
_approve(owner, spender, currentAllowance - value, false);
}
}
}
}
/**
* @dev Extension of {ERC20} that allows token holders to destroy both their own
* tokens and those that they have an allowance for, in a way that can be
* recognized off-chain (via event analysis).
*/
abstract contract ERC20Burnable is Context, ERC20 {
/**
* @dev Destroys a `value` amount of tokens from the caller.
*
* See {ERC20-_burn}.
*/
function burn(uint256 value) public virtual {
_burn(_msgSender(), value);
}
/**
* @dev Destroys a `value` amount of tokens from `account`, deducting from
* the caller's allowance.
*
* See {ERC20-_burn} and {ERC20-allowance}.
*
* Requirements:
*
* - the caller must have allowance for ``accounts``'s tokens of at least
* `value`.
*/
function burnFrom(address account, uint256 value) public virtual {
_spendAllowance(account, _msgSender(), value);
_burn(account, value);
}
}
/**
* @dev Interface of the ERC20 Permit extension allowing approvals to be made via signatures, as defined in
* https://eips.ethereum.org/EIPS/eip-2612[EIP-2612].
*
* Adds the {permit} method, which can be used to change an account's ERC20 allowance (see {IERC20-allowance}) by
* presenting a message signed by the account. By not relying on {IERC20-approve}, the token holder account doesn't
* need to send a transaction, and thus is not required to hold Ether at all.
*
* ==== Security Considerations
*
* There are two important considerations concerning the use of `permit`. The first is that a valid permit signature
* expresses an allowance, and it should not be assumed to convey additional meaning. In particular, it should not be
* considered as an intention to spend the allowance in any specific way. The second is that because permits have
* built-in replay protection and can be submitted by anyone, they can be frontrun. A protocol that uses permits should
* take this into consideration and allow a `permit` call to fail. Combining these two aspects, a pattern that may be
* generally recommended is:
*
* ```solidity
* function doThingWithPermit(..., uint256 value, uint256 deadline, uint8 v, bytes32 r, bytes32 s) public {
* try token.permit(msg.sender, address(this), value, deadline, v, r, s) {} catch {}
* doThing(..., value);
* }
*
* function doThing(..., uint256 value) public {
* token.safeTransferFrom(msg.sender, address(this), value);
* ...
* }
* ```
*
* Observe that: 1) `msg.sender` is used as the owner, leaving no ambiguity as to the signer intent, and 2) the use of
* `try/catch` allows the permit to fail and makes the code tolerant to frontrunning. (See also
* {SafeERC20-safeTransferFrom}).
*
* Additionally, note that smart contract wallets (such as Argent or Safe) are not able to produce permit signatures, so
* contracts should have entry points that don't rely on permit.
*/
interface IERC20Permit {
/**
* @dev Sets `value` as the allowance of `spender` over ``owner``'s tokens,
* given ``owner``'s signed approval.
*
* IMPORTANT: The same issues {IERC20-approve} has related to transaction
* ordering also apply here.
*
* Emits an {Approval} event.
*
* Requirements:
*
* - `spender` cannot be the zero address.
* - `deadline` must be a timestamp in the future.
* - `v`, `r` and `s` must be a valid `secp256k1` signature from `owner`
* over the EIP712-formatted function arguments.
* - the signature must use ``owner``'s current nonce (see {nonces}).
*
* For more information on the signature format, see the
* https://eips.ethereum.org/EIPS/eip-2612#specification[relevant EIP
* section].
*
* CAUTION: See Security Considerations above.
*/
function permit(
address owner,
address spender,
uint256 value,
uint256 deadline,
uint8 v,
bytes32 r,
bytes32 s
) external;
/**
* @dev Returns the current nonce for `owner`. This value must be
* included whenever a signature is generated for {permit}.
*
* Every successful call to {permit} increases ``owner``'s nonce by one. This
* prevents a signature from being used multiple times.
*/
function nonces(address owner) external view returns (uint256);
/**
* @dev Returns the domain separator used in the encoding of the signature for {permit}, as defined by {EIP712}.
*/
// solhint-disable-next-line func-name-mixedcase
function DOMAIN_SEPARATOR() external view returns (bytes32);
}
/**
* @dev Implementation of the ERC20 Permit extension allowing approvals to be made via signatures, as defined in
* https://eips.ethereum.org/EIPS/eip-2612[EIP-2612].
*
* Adds the {permit} method, which can be used to change an account's ERC20 allowance (see {IERC20-allowance}) by
* presenting a message signed by the account. By not relying on `{IERC20-approve}`, the token holder account doesn't
* need to send a transaction, and thus is not required to hold Ether at all.
*/
abstract contract ERC20Permit is ERC20, IERC20Permit, EIP712, Nonces {
bytes32 private constant PERMIT_TYPEHASH =
keccak256("Permit(address owner,address spender,uint256 value,uint256 nonce,uint256 deadline)");
/**
* @dev Permit deadline has expired.
*/
error ERC2612ExpiredSignature(uint256 deadline);
/**
* @dev Mismatched signature.
*/
error ERC2612InvalidSigner(address signer, address owner);
/**
* @dev Initializes the {EIP712} domain separator using the `name` parameter, and setting `version` to `"1"`.
*
* It's a good idea to use the same `name` that is defined as the ERC20 token name.
*/
constructor(string memory name) EIP712(name, "1") {}
/**
* @inheritdoc IERC20Permit
*/
function permit(
address owner,
address spender,
uint256 value,
uint256 deadline,
uint8 v,
bytes32 r,
bytes32 s
) public virtual {
if (block.timestamp > deadline) {
revert ERC2612ExpiredSignature(deadline);
}
bytes32 structHash = keccak256(abi.encode(PERMIT_TYPEHASH, owner, spender, value, _useNonce(owner), deadline));
bytes32 hash = _hashTypedDataV4(structHash);
address signer = ECDSA.recover(hash, v, r, s);
if (signer != owner) {
revert ERC2612InvalidSigner(signer, owner);
}
_approve(owner, spender, value);
}
/**
* @inheritdoc IERC20Permit
*/
function nonces(address owner) public view virtual override(IERC20Permit, Nonces) returns (uint256) {
return super.nonces(owner);
}
/**
* @inheritdoc IERC20Permit
*/
// solhint-disable-next-line func-name-mixedcase
function DOMAIN_SEPARATOR() external view virtual returns (bytes32) {
return _domainSeparatorV4();
}
}
/**
* @dev Extension of ERC20 to support Compound-like voting and delegation. This version is more generic than Compound's,
* and supports token supply up to 2^208^ - 1, while COMP is limited to 2^96^ - 1.
*
* NOTE: This contract does not provide interface compatibility with Compound's COMP token.
*
* This extension keeps a history (checkpoints) of each account's vote power. Vote power can be delegated either
* by calling the {delegate} function directly, or by providing a signature to be used with {delegateBySig}. Voting
* power can be queried through the public accessors {getVotes} and {getPastVotes}.
*
* By default, token balance does not account for voting power. This makes transfers cheaper. The downside is that it
* requires users to delegate to themselves in order to activate checkpoints and have their voting power tracked.
*/
abstract contract ERC20Votes is ERC20, Votes {
/**
* @dev Total supply cap has been exceeded, introducing a risk of votes overflowing.
*/
error ERC20ExceededSafeSupply(uint256 increasedSupply, uint256 cap);
/**
* @dev Maximum token supply. Defaults to `type(uint208).max` (2^208^ - 1).
*
* This maximum is enforced in {_update}. It limits the total supply of the token, which is otherwise a uint256,
* so that checkpoints can be stored in the Trace208 structure used by {{Votes}}. Increasing this value will not
* remove the underlying limitation, and will cause {_update} to fail because of a math overflow in
* {_transferVotingUnits}. An override could be used to further restrict the total supply (to a lower value) if
* additional logic requires it. When resolving override conflicts on this function, the minimum should be
* returned.
*/
function _maxSupply() internal view virtual returns (uint256) {
return type(uint208).max;
}
/**
* @dev Move voting power when tokens are transferred.
*
* Emits a {IVotes-DelegateVotesChanged} event.
*/
function _update(address from, address to, uint256 value) internal virtual override {
super._update(from, to, value);
if (from == address(0)) {
uint256 supply = totalSupply();
uint256 cap = _maxSupply();
if (supply > cap) {
revert ERC20ExceededSafeSupply(supply, cap);
}
}
_transferVotingUnits(from, to, value);
}
/**
* @dev Returns the voting units of an `account`.
*
* WARNING: Overriding this function may compromise the internal vote accounting.
* `ERC20Votes` assumes tokens map to voting units 1:1 and this is not easy to change.
*/
function _getVotingUnits(address account) internal view virtual override returns (uint256) {
return balanceOf(account);
}
/**
* @dev Get number of checkpoints for `account`.
*/
function numCheckpoints(address account) public view virtual returns (uint32) {
return _numCheckpoints(account);
}
/**
* @dev Get the `pos`-th checkpoint for `account`.
*/
function checkpoints(address account, uint32 pos) public view virtual returns (Checkpoints.Checkpoint208 memory) {
return _checkpoints(account, pos);
}
}
contract Rogue is ERC20, ERC20Burnable, ERC20Permit, ERC20Votes {
constructor() ERC20("Rogue", "ROGUE") ERC20Permit("Rogue") {
_mint(msg.sender, 100000000000 * 10 ** decimals());
}
// The following functions are overrides required by Solidity.
function _update(address from, address to, uint256 value)
internal
override(ERC20, ERC20Votes)
{
super._update(from, to, value);
}
function nonces(address owner)
public
view
override(ERC20Permit, Nonces)
returns (uint256)
{
return super.nonces(owner);
}
}Contract Security Audit
- No Contract Security Audit Submitted- Submit Audit Here
Contract ABI
API[{"inputs":[],"stateMutability":"nonpayable","type":"constructor"},{"inputs":[],"name":"CheckpointUnorderedInsertion","type":"error"},{"inputs":[],"name":"ECDSAInvalidSignature","type":"error"},{"inputs":[{"internalType":"uint256","name":"length","type":"uint256"}],"name":"ECDSAInvalidSignatureLength","type":"error"},{"inputs":[{"internalType":"bytes32","name":"s","type":"bytes32"}],"name":"ECDSAInvalidSignatureS","type":"error"},{"inputs":[{"internalType":"uint256","name":"increasedSupply","type":"uint256"},{"internalType":"uint256","name":"cap","type":"uint256"}],"name":"ERC20ExceededSafeSupply","type":"error"},{"inputs":[{"internalType":"address","name":"spender","type":"address"},{"internalType":"uint256","name":"allowance","type":"uint256"},{"internalType":"uint256","name":"needed","type":"uint256"}],"name":"ERC20InsufficientAllowance","type":"error"},{"inputs":[{"internalType":"address","name":"sender","type":"address"},{"internalType":"uint256","name":"balance","type":"uint256"},{"internalType":"uint256","name":"needed","type":"uint256"}],"name":"ERC20InsufficientBalance","type":"error"},{"inputs":[{"internalType":"address","name":"approver","type":"address"}],"name":"ERC20InvalidApprover","type":"error"},{"inputs":[{"internalType":"address","name":"receiver","type":"address"}],"name":"ERC20InvalidReceiver","type":"error"},{"inputs":[{"internalType":"address","name":"sender","type":"address"}],"name":"ERC20InvalidSender","type":"error"},{"inputs":[{"internalType":"address","name":"spender","type":"address"}],"name":"ERC20InvalidSpender","type":"error"},{"inputs":[{"internalType":"uint256","name":"deadline","type":"uint256"}],"name":"ERC2612ExpiredSignature","type":"error"},{"inputs":[{"internalType":"address","name":"signer","type":"address"},{"internalType":"address","name":"owner","type":"address"}],"name":"ERC2612InvalidSigner","type":"error"},{"inputs":[{"internalType":"uint256","name":"timepoint","type":"uint256"},{"internalType":"uint48","name":"clock","type":"uint48"}],"name":"ERC5805FutureLookup","type":"error"},{"inputs":[],"name":"ERC6372InconsistentClock","type":"error"},{"inputs":[{"internalType":"address","name":"account","type":"address"},{"internalType":"uint256","name":"currentNonce","type":"uint256"}],"name":"InvalidAccountNonce","type":"error"},{"inputs":[],"name":"InvalidShortString","type":"error"},{"inputs":[{"internalType":"uint8","name":"bits","type":"uint8"},{"internalType":"uint256","name":"value","type":"uint256"}],"name":"SafeCastOverflowedUintDowncast","type":"error"},{"inputs":[{"internalType":"string","name":"str","type":"string"}],"name":"StringTooLong","type":"error"},{"inputs":[{"internalType":"uint256","name":"expiry","type":"uint256"}],"name":"VotesExpiredSignature","type":"error"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"owner","type":"address"},{"indexed":true,"internalType":"address","name":"spender","type":"address"},{"indexed":false,"internalType":"uint256","name":"value","type":"uint256"}],"name":"Approval","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"delegator","type":"address"},{"indexed":true,"internalType":"address","name":"fromDelegate","type":"address"},{"indexed":true,"internalType":"address","name":"toDelegate","type":"address"}],"name":"DelegateChanged","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"delegate","type":"address"},{"indexed":false,"internalType":"uint256","name":"previousVotes","type":"uint256"},{"indexed":false,"internalType":"uint256","name":"newVotes","type":"uint256"}],"name":"DelegateVotesChanged","type":"event"},{"anonymous":false,"inputs":[],"name":"EIP712DomainChanged","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"from","type":"address"},{"indexed":true,"internalType":"address","name":"to","type":"address"},{"indexed":false,"internalType":"uint256","name":"value","type":"uint256"}],"name":"Transfer","type":"event"},{"inputs":[],"name":"CLOCK_MODE","outputs":[{"internalType":"string","name":"","type":"string"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"DOMAIN_SEPARATOR","outputs":[{"internalType":"bytes32","name":"","type":"bytes32"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"owner","type":"address"},{"internalType":"address","name":"spender","type":"address"}],"name":"allowance","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"spender","type":"address"},{"internalType":"uint256","name":"value","type":"uint256"}],"name":"approve","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"account","type":"address"}],"name":"balanceOf","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"value","type":"uint256"}],"name":"burn","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"account","type":"address"},{"internalType":"uint256","name":"value","type":"uint256"}],"name":"burnFrom","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"account","type":"address"},{"internalType":"uint32","name":"pos","type":"uint32"}],"name":"checkpoints","outputs":[{"components":[{"internalType":"uint48","name":"_key","type":"uint48"},{"internalType":"uint208","name":"_value","type":"uint208"}],"internalType":"struct Checkpoints.Checkpoint208","name":"","type":"tuple"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"clock","outputs":[{"internalType":"uint48","name":"","type":"uint48"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"decimals","outputs":[{"internalType":"uint8","name":"","type":"uint8"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"delegatee","type":"address"}],"name":"delegate","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"delegatee","type":"address"},{"internalType":"uint256","name":"nonce","type":"uint256"},{"internalType":"uint256","name":"expiry","type":"uint256"},{"internalType":"uint8","name":"v","type":"uint8"},{"internalType":"bytes32","name":"r","type":"bytes32"},{"internalType":"bytes32","name":"s","type":"bytes32"}],"name":"delegateBySig","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"account","type":"address"}],"name":"delegates","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"eip712Domain","outputs":[{"internalType":"bytes1","name":"fields","type":"bytes1"},{"internalType":"string","name":"name","type":"string"},{"internalType":"string","name":"version","type":"string"},{"internalType":"uint256","name":"chainId","type":"uint256"},{"internalType":"address","name":"verifyingContract","type":"address"},{"internalType":"bytes32","name":"salt","type":"bytes32"},{"internalType":"uint256[]","name":"extensions","type":"uint256[]"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"timepoint","type":"uint256"}],"name":"getPastTotalSupply","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"account","type":"address"},{"internalType":"uint256","name":"timepoint","type":"uint256"}],"name":"getPastVotes","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"account","type":"address"}],"name":"getVotes","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"name","outputs":[{"internalType":"string","name":"","type":"string"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"owner","type":"address"}],"name":"nonces","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"account","type":"address"}],"name":"numCheckpoints","outputs":[{"internalType":"uint32","name":"","type":"uint32"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"owner","type":"address"},{"internalType":"address","name":"spender","type":"address"},{"internalType":"uint256","name":"value","type":"uint256"},{"internalType":"uint256","name":"deadline","type":"uint256"},{"internalType":"uint8","name":"v","type":"uint8"},{"internalType":"bytes32","name":"r","type":"bytes32"},{"internalType":"bytes32","name":"s","type":"bytes32"}],"name":"permit","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"symbol","outputs":[{"internalType":"string","name":"","type":"string"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"totalSupply","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"to","type":"address"},{"internalType":"uint256","name":"value","type":"uint256"}],"name":"transfer","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"from","type":"address"},{"internalType":"address","name":"to","type":"address"},{"internalType":"uint256","name":"value","type":"uint256"}],"name":"transferFrom","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"nonpayable","type":"function"}]Contract Creation Code
61016060405234801562000011575f80fd5b5060405180604001604052806005815260200164526f67756560d81b81525080604051806040016040528060018152602001603160f81b81525060405180604001604052806005815260200164526f67756560d81b81525060405180604001604052806005815260200164524f47554560d81b815250816003908162000098919062000961565b506004620000a7828262000961565b50620000b99150839050600562000191565b61012052620000ca81600662000191565b61014052815160208084019190912060e052815190820120610100524660a0526200015760e05161010051604080517f8b73c3c69bb8fe3d512ecc4cf759cc79239f7b179b0ffacaa9a75d522b39400f60208201529081019290925260608201524660808201523060a08201525f9060c00160405160208183030381529060405280519060200120905090565b60805250503060c052506200018b33620001746012600a62000b36565b620001859064174876e80062000b46565b620001c9565b62000c4a565b5f602083511015620001b057620001a88362000209565b9050620001c3565b81620001bd848262000961565b5060ff90505b92915050565b6001600160a01b038216620001f85760405163ec442f0560e01b81525f60048201526024015b60405180910390fd5b620002055f83836200024b565b5050565b5f80829050601f8151111562000236578260405163305a27a960e01b8152600401620001ef919062000b60565b8051620002438262000bad565b179392505050565b620002588383836200025d565b505050565b6200026a838383620002cb565b6001600160a01b038316620002be575f6200028460025490565b90506001600160d01b0380821115620002bb57604051630e58ae9360e11b81526004810183905260248101829052604401620001ef565b50505b62000258838383620003fa565b6001600160a01b038316620002f9578060025f828254620002ed919062000bd1565b909155506200036b9050565b6001600160a01b0383165f90815260208190526040902054818110156200034d5760405163391434e360e21b81526001600160a01b03851660048201526024810182905260448101839052606401620001ef565b6001600160a01b0384165f9081526020819052604090209082900390555b6001600160a01b0382166200038957600280548290039055620003a7565b6001600160a01b0382165f9081526020819052604090208054820190555b816001600160a01b0316836001600160a01b03167fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef83604051620003ed91815260200190565b60405180910390a3505050565b6001600160a01b0383166200042f576200042c600a620009326200049160201b176200042684620004a5565b620004de565b50505b6001600160a01b0382166200045e576200045b600a6200093d6200051a60201b176200042684620004a5565b50505b6001600160a01b038381165f90815260086020526040808220548584168352912054620002589291821691168362000527565b5f6200049e828462000be7565b9392505050565b5f6001600160d01b03821115620004da576040516306dfcc6560e41b815260d0600482015260248101839052604401620001ef565b5090565b5f806200050d620004ee62000689565b62000504620004fd8862000699565b868860201c565b879190620006e5565b915091505b935093915050565b5f6200049e828462000c11565b816001600160a01b0316836001600160a01b0316141580156200054957505f81115b1562000258576001600160a01b03831615620005ea576001600160a01b0383165f908152600960209081526040822082916200059691906200051a901b6200093d176200042686620004a5565b6001600160d01b031691506001600160d01b03169150846001600160a01b03165f8051602062002ad08339815191528383604051620005df929190918252602082015260400190565b60405180910390a250505b6001600160a01b0382161562000258576001600160a01b0382165f9081526009602090815260408220829162000631919062000491901b62000932176200042686620004a5565b6001600160d01b031691506001600160d01b03169150836001600160a01b03165f8051602062002ad083398151915283836040516200067a929190918252602082015260400190565b60405180910390a25050505050565b5f62000694620006f4565b905090565b80545f908015620006dd57620006c383620006b660018462000c34565b5f91825260209091200190565b54660100000000000090046001600160d01b03166200049e565b5f9392505050565b5f806200050d85858562000700565b5f62000694436200088e565b82545f908190801562000830575f6200072087620006b660018562000c34565b60408051808201909152905465ffffffffffff80821680845266010000000000009092046001600160d01b0316602084015291925090871610156200077857604051632520601d60e01b815260040160405180910390fd5b805165ffffffffffff808816911603620007cc57846200079f88620006b660018662000c34565b80546001600160d01b039290921666010000000000000265ffffffffffff9092169190911790556200081f565b6040805180820190915265ffffffffffff80881682526001600160d01b0380881660208085019182528b54600181018d555f8d815291909120945191519092166601000000000000029216919091179101555b602001519250839150620005129050565b50506040805180820190915265ffffffffffff80851682526001600160d01b0380851660208085019182528854600181018a555f8a815291822095519251909316660100000000000002919093161792019190915590508162000512565b5f65ffffffffffff821115620004da576040516306dfcc6560e41b81526030600482015260248101839052604401620001ef565b634e487b7160e01b5f52604160045260245ffd5b600181811c90821680620008eb57607f821691505b6020821081036200090a57634e487b7160e01b5f52602260045260245ffd5b50919050565b601f82111562000258575f81815260208120601f850160051c81016020861015620009385750805b601f850160051c820191505b81811015620009595782815560010162000944565b505050505050565b81516001600160401b038111156200097d576200097d620008c2565b62000995816200098e8454620008d6565b8462000910565b602080601f831160018114620009cb575f8415620009b35750858301515b5f19600386901b1c1916600185901b17855562000959565b5f85815260208120601f198616915b82811015620009fb57888601518255948401946001909101908401620009da565b508582101562000a1957878501515f19600388901b60f8161c191681555b5050505050600190811b01905550565b634e487b7160e01b5f52601160045260245ffd5b600181815b8085111562000a7d57815f190482111562000a615762000a6162000a29565b8085161562000a6f57918102915b93841c939080029062000a42565b509250929050565b5f8262000a9557506001620001c3565b8162000aa357505f620001c3565b816001811462000abc576002811462000ac75762000ae7565b6001915050620001c3565b60ff84111562000adb5762000adb62000a29565b50506001821b620001c3565b5060208310610133831016604e8410600b841016171562000b0c575081810a620001c3565b62000b18838362000a3d565b805f190482111562000b2e5762000b2e62000a29565b029392505050565b5f6200049e60ff84168362000a85565b8082028115828204841417620001c357620001c362000a29565b5f6020808352835180828501525f5b8181101562000b8d5785810183015185820160400152820162000b6f565b505f604082860101526040601f19601f8301168501019250505092915050565b805160208083015191908110156200090a575f1960209190910360031b1b16919050565b80820180821115620001c357620001c362000a29565b6001600160d01b0381811683821601908082111562000c0a5762000c0a62000a29565b5092915050565b6001600160d01b0382811682821603908082111562000c0a5762000c0a62000a29565b81810381811115620001c357620001c362000a29565b60805160a05160c05160e051610100516101205161014051611e3462000c9c5f395f610d6201525f610d3501525f610b0b01525f610ae301525f610a3e01525f610a6801525f610a920152611e345ff3fe608060405234801561000f575f80fd5b506004361061016d575f3560e01c806370a08231116100d957806395d89b4111610093578063c3cda5201161006e578063c3cda52014610365578063d505accf14610378578063dd62ed3e1461038b578063f1127ed8146103c3575f80fd5b806395d89b41146103375780639ab24eb01461033f578063a9059cbb14610352575f80fd5b806370a082311461029c57806379cc6790146102c45780637ecebe00146102d757806384b0196e146102ea5780638e539e8c1461030557806391ddadf414610318575f80fd5b80633a46b1a81161012a5780633a46b1a8146101ee57806342966c68146102015780634bf5d7e914610216578063587cde1e1461021e5780635c19a95c146102615780636fcfff4514610274575f80fd5b806306fdde0314610171578063095ea7b31461018f57806318160ddd146101b257806323b872dd146101c4578063313ce567146101d75780633644e515146101e6575b5f80fd5b610179610402565b6040516101869190611a61565b60405180910390f35b6101a261019d366004611a8e565b610492565b6040519015158152602001610186565b6002545b604051908152602001610186565b6101a26101d2366004611ab6565b6104ab565b60405160128152602001610186565b6101b66104ce565b6101b66101fc366004611a8e565b6104dc565b61021461020f366004611aef565b610560565b005b61017961056d565b61024961022c366004611b06565b6001600160a01b039081165f908152600860205260409020541690565b6040516001600160a01b039091168152602001610186565b61021461026f366004611b06565b6105e5565b610287610282366004611b06565b6105f4565b60405163ffffffff9091168152602001610186565b6101b66102aa366004611b06565b6001600160a01b03165f9081526020819052604090205490565b6102146102d2366004611a8e565b6105fe565b6101b66102e5366004611b06565b610613565b6102f261061d565b6040516101869796959493929190611b1f565b6101b6610313366004611aef565b61065f565b6103206106c8565b60405165ffffffffffff9091168152602001610186565b6101796106d1565b6101b661034d366004611b06565b6106e0565b6101a2610360366004611a8e565b61070f565b610214610373366004611bc3565b61071c565b610214610386366004611c17565b6107d8565b6101b6610399366004611c7c565b6001600160a01b039182165f90815260016020908152604080832093909416825291909152205490565b6103d66103d1366004611cad565b61090e565b60408051825165ffffffffffff1681526020928301516001600160d01b03169281019290925201610186565b60606003805461041190611cea565b80601f016020809104026020016040519081016040528092919081815260200182805461043d90611cea565b80156104885780601f1061045f57610100808354040283529160200191610488565b820191905f5260205f20905b81548152906001019060200180831161046b57829003601f168201915b5050505050905090565b5f3361049f818585610948565b60019150505b92915050565b5f336104b885828561095a565b6104c38585856109d5565b506001949350505050565b5f6104d7610a32565b905090565b5f806104e66106c8565b90508065ffffffffffff16831061052657604051637669fc0f60e11b81526004810184905265ffffffffffff821660248201526044015b60405180910390fd5b61054f61053284610b5b565b6001600160a01b0386165f90815260096020526040902090610b91565b6001600160d01b0316949350505050565b61056a3382610c41565b50565b6060610577610c75565b65ffffffffffff166105876106c8565b65ffffffffffff16146105ad576040516301bfc1c560e61b815260040160405180910390fd5b5060408051808201909152601d81527f6d6f64653d626c6f636b6e756d6265722666726f6d3d64656661756c74000000602082015290565b336105f08183610c7f565b5050565b5f6104a582610cf0565b61060982338361095a565b6105f08282610c41565b5f6104a582610d11565b5f6060805f805f606061062e610d2e565b610636610d5b565b604080515f80825260208201909252600f60f81b9b939a50919850469750309650945092509050565b5f806106696106c8565b90508065ffffffffffff1683106106a457604051637669fc0f60e11b81526004810184905265ffffffffffff8216602482015260440161051d565b6106b86106b084610b5b565b600a90610b91565b6001600160d01b03169392505050565b5f6104d7610c75565b60606004805461041190611cea565b6001600160a01b0381165f90815260096020526040812061070090610d88565b6001600160d01b031692915050565b5f3361049f8185856109d5565b8342111561074057604051632341d78760e11b81526004810185905260240161051d565b604080517fe48329057bfd03d55e49b547132e39cffd9c1820ad7b9d4c5307691425d15adf60208201526001600160a01b0388169181019190915260608101869052608081018590525f906107b9906107b19060a00160405160208183030381529060405280519060200120610dbf565b858585610deb565b90506107c58187610e17565b6107cf8188610c7f565b50505050505050565b834211156107fc5760405163313c898160e11b81526004810185905260240161051d565b5f7f6e71edae12b1b97f4d1f60370fef10105fa2faae0126114a169c64845d6126c98888886108478c6001600160a01b03165f90815260076020526040902080546001810190915590565b6040805160208101969096526001600160a01b0394851690860152929091166060840152608083015260a082015260c0810186905260e0016040516020818303038152906040528051906020012090505f6108a182610dbf565b90505f6108b082878787610deb565b9050896001600160a01b0316816001600160a01b0316146108f7576040516325c0072360e11b81526001600160a01b0380831660048301528b16602482015260440161051d565b6109028a8a8a610948565b50505050505050505050565b604080518082019091525f808252602082015261092b8383610e69565b9392505050565b5f61092b8284611d36565b5f61092b8284611d5d565b6109558383836001610e9d565b505050565b6001600160a01b038381165f908152600160209081526040808320938616835292905220545f1981146109cf57818110156109c157604051637dc7a0d960e11b81526001600160a01b0384166004820152602481018290526044810183905260640161051d565b6109cf84848484035f610e9d565b50505050565b6001600160a01b0383166109fe57604051634b637e8f60e11b81525f600482015260240161051d565b6001600160a01b038216610a275760405163ec442f0560e01b81525f600482015260240161051d565b610955838383610f6f565b5f306001600160a01b037f000000000000000000000000000000000000000000000000000000000000000016148015610a8a57507f000000000000000000000000000000000000000000000000000000000000000046145b15610ab457507f000000000000000000000000000000000000000000000000000000000000000090565b6104d7604080517f8b73c3c69bb8fe3d512ecc4cf759cc79239f7b179b0ffacaa9a75d522b39400f60208201527f0000000000000000000000000000000000000000000000000000000000000000918101919091527f000000000000000000000000000000000000000000000000000000000000000060608201524660808201523060a08201525f9060c00160405160208183030381529060405280519060200120905090565b5f65ffffffffffff821115610b8d576040516306dfcc6560e41b8152603060048201526024810183905260440161051d565b5090565b81545f9081816005811115610bed575f610baa84610f7a565b610bb49085611d7d565b5f8881526020902090915081015465ffffffffffff9081169087161015610bdd57809150610beb565b610be8816001611d90565b92505b505b5f610bfa8787858561105e565b90508015610c3457610c1e87610c11600184611d7d565b5f91825260209091200190565b54600160301b90046001600160d01b0316610c36565b5f5b979650505050505050565b6001600160a01b038216610c6a57604051634b637e8f60e11b81525f600482015260240161051d565b6105f0825f83610f6f565b5f6104d743610b5b565b6001600160a01b038281165f8181526008602052604080822080548686166001600160a01b0319821681179092559151919094169392849290917f3134e8a2e6d97e929a7e54011ea5485d7d196dd5f0ba4d4ef95803e8e3fc257f9190a46109558183610ceb866110bd565b6110da565b6001600160a01b0381165f908152600960205260408120546104a590611243565b6001600160a01b0381165f908152600760205260408120546104a5565b60606104d77f00000000000000000000000000000000000000000000000000000000000000006005611273565b60606104d77f00000000000000000000000000000000000000000000000000000000000000006006611273565b80545f908015610db757610da183610c11600184611d7d565b54600160301b90046001600160d01b031661092b565b5f9392505050565b5f6104a5610dcb610a32565b8360405161190160f01b8152600281019290925260228201526042902090565b5f805f80610dfb8888888861131c565b925092509250610e0b82826113e4565b50909695505050505050565b6001600160a01b0382165f908152600760205260409020805460018101909155818114610955576040516301d4b62360e61b81526001600160a01b03841660048201526024810182905260440161051d565b604080518082019091525f80825260208201526001600160a01b0383165f90815260096020526040902061092b908361149c565b6001600160a01b038416610ec65760405163e602df0560e01b81525f600482015260240161051d565b6001600160a01b038316610eef57604051634a1406b160e11b81525f600482015260240161051d565b6001600160a01b038085165f90815260016020908152604080832093871683529290522082905580156109cf57826001600160a01b0316846001600160a01b03167f8c5be1e5ebec7d5bd14f71427d1e84f3dd0314c0f7b2291e5b200ac8c7c3b92584604051610f6191815260200190565b60405180910390a350505050565b610955838383611509565b5f815f03610f8957505f919050565b5f6001610f958461156f565b901c6001901b90506001818481610fae57610fae611da3565b048201901c90506001818481610fc657610fc6611da3565b048201901c90506001818481610fde57610fde611da3565b048201901c90506001818481610ff657610ff6611da3565b048201901c9050600181848161100e5761100e611da3565b048201901c9050600181848161102657611026611da3565b048201901c9050600181848161103e5761103e611da3565b048201901c905061092b8182858161105857611058611da3565b04611602565b5f5b818310156110b5575f6110738484611617565b5f8781526020902090915065ffffffffffff86169082015465ffffffffffff1611156110a1578092506110af565b6110ac816001611d90565b93505b50611060565b509392505050565b6001600160a01b0381165f908152602081905260408120546104a5565b816001600160a01b0316836001600160a01b0316141580156110fb57505f81115b15610955576001600160a01b038316156111a2576001600160a01b0383165f908152600960205260408120819061113d9061093d61113886611631565b611664565b6001600160d01b031691506001600160d01b03169150846001600160a01b03167fdec2bacdd2f05b59de34da9b523dff8be42e5e38e818c82fdb0bae774387a7248383604051611197929190918252602082015260400190565b60405180910390a250505b6001600160a01b03821615610955576001600160a01b0382165f90815260096020526040812081906111da9061093261113886611631565b6001600160d01b031691506001600160d01b03169150836001600160a01b03167fdec2bacdd2f05b59de34da9b523dff8be42e5e38e818c82fdb0bae774387a7248383604051611234929190918252602082015260400190565b60405180910390a25050505050565b5f63ffffffff821115610b8d576040516306dfcc6560e41b8152602060048201526024810183905260440161051d565b606060ff831461128d576112868361169c565b90506104a5565b81805461129990611cea565b80601f01602080910402602001604051908101604052809291908181526020018280546112c590611cea565b80156113105780601f106112e757610100808354040283529160200191611310565b820191905f5260205f20905b8154815290600101906020018083116112f357829003601f168201915b505050505090506104a5565b5f80807f7fffffffffffffffffffffffffffffff5d576e7357a4501ddfe92f46681b20a084111561135557505f915060039050826113da565b604080515f808252602082018084528a905260ff891692820192909252606081018790526080810186905260019060a0016020604051602081039080840390855afa1580156113a6573d5f803e3d5ffd5b5050604051601f1901519150506001600160a01b0381166113d157505f9250600191508290506113da565b92505f91508190505b9450945094915050565b5f8260038111156113f7576113f7611db7565b03611400575050565b600182600381111561141457611414611db7565b036114325760405163f645eedf60e01b815260040160405180910390fd5b600282600381111561144657611446611db7565b036114675760405163fce698f760e01b81526004810182905260240161051d565b600382600381111561147b5761147b611db7565b036105f0576040516335e2f38360e21b81526004810182905260240161051d565b604080518082019091525f8082526020820152825f018263ffffffff16815481106114c9576114c9611dcb565b5f9182526020918290206040805180820190915291015465ffffffffffff81168252600160301b90046001600160d01b0316918101919091529392505050565b6115148383836116d9565b6001600160a01b038316611564575f61152c60025490565b90506001600160d01b038082111561156157604051630e58ae9360e11b8152600481018390526024810182905260440161051d565b50505b6109558383836117ff565b5f80608083901c1561158357608092831c92015b604083901c1561159557604092831c92015b602083901c156115a757602092831c92015b601083901c156115b957601092831c92015b600883901c156115cb57600892831c92015b600483901c156115dd57600492831c92015b600283901c156115ef57600292831c92015b600183901c156104a55760010192915050565b5f818310611610578161092b565b5090919050565b5f6116256002848418611ddf565b61092b90848416611d90565b5f6001600160d01b03821115610b8d576040516306dfcc6560e41b815260d060048201526024810183905260440161051d565b5f8061168f6116716106c8565b61168761167d88610d88565b868863ffffffff16565b879190611874565b915091505b935093915050565b60605f6116a883611881565b6040805160208082528183019092529192505f91906020820181803683375050509182525060208101929092525090565b6001600160a01b038316611703578060025f8282546116f89190611d90565b909155506117739050565b6001600160a01b0383165f90815260208190526040902054818110156117555760405163391434e360e21b81526001600160a01b0385166004820152602481018290526044810183905260640161051d565b6001600160a01b0384165f9081526020819052604090209082900390555b6001600160a01b03821661178f576002805482900390556117ad565b6001600160a01b0382165f9081526020819052604090208054820190555b816001600160a01b0316836001600160a01b03167fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef836040516117f291815260200190565b60405180910390a3505050565b6001600160a01b0383166118215761181e600a61093261113884611631565b50505b6001600160a01b03821661184357611840600a61093d61113884611631565b50505b6001600160a01b038381165f90815260086020526040808220548584168352912054610955929182169116836110da565b5f8061168f8585856118a8565b5f60ff8216601f8111156104a557604051632cd44ac360e21b815260040160405180910390fd5b82545f90819080156119c4575f6118c487610c11600185611d7d565b60408051808201909152905465ffffffffffff808216808452600160301b9092046001600160d01b03166020840152919250908716101561191857604051632520601d60e01b815260040160405180910390fd5b805165ffffffffffff808816911603611964578461193b88610c11600186611d7d565b80546001600160d01b0392909216600160301b0265ffffffffffff9092169190911790556119b4565b6040805180820190915265ffffffffffff80881682526001600160d01b0380881660208085019182528b54600181018d555f8d81529190912094519151909216600160301b029216919091179101555b6020015192508391506116949050565b50506040805180820190915265ffffffffffff80851682526001600160d01b0380851660208085019182528854600181018a555f8a815291822095519251909316600160301b029190931617920191909155905081611694565b5f81518084525f5b81811015611a4257602081850181015186830182015201611a26565b505f602082860101526020601f19601f83011685010191505092915050565b602081525f61092b6020830184611a1e565b80356001600160a01b0381168114611a89575f80fd5b919050565b5f8060408385031215611a9f575f80fd5b611aa883611a73565b946020939093013593505050565b5f805f60608486031215611ac8575f80fd5b611ad184611a73565b9250611adf60208501611a73565b9150604084013590509250925092565b5f60208284031215611aff575f80fd5b5035919050565b5f60208284031215611b16575f80fd5b61092b82611a73565b60ff60f81b881681525f602060e081840152611b3e60e084018a611a1e565b8381036040850152611b50818a611a1e565b606085018990526001600160a01b038816608086015260a0850187905284810360c086015285518082528387019250908301905f5b81811015611ba157835183529284019291840191600101611b85565b50909c9b505050505050505050505050565b803560ff81168114611a89575f80fd5b5f805f805f8060c08789031215611bd8575f80fd5b611be187611a73565b95506020870135945060408701359350611bfd60608801611bb3565b92506080870135915060a087013590509295509295509295565b5f805f805f805f60e0888a031215611c2d575f80fd5b611c3688611a73565b9650611c4460208901611a73565b95506040880135945060608801359350611c6060808901611bb3565b925060a0880135915060c0880135905092959891949750929550565b5f8060408385031215611c8d575f80fd5b611c9683611a73565b9150611ca460208401611a73565b90509250929050565b5f8060408385031215611cbe575f80fd5b611cc783611a73565b9150602083013563ffffffff81168114611cdf575f80fd5b809150509250929050565b600181811c90821680611cfe57607f821691505b602082108103611d1c57634e487b7160e01b5f52602260045260245ffd5b50919050565b634e487b7160e01b5f52601160045260245ffd5b6001600160d01b03818116838216019080821115611d5657611d56611d22565b5092915050565b6001600160d01b03828116828216039080821115611d5657611d56611d22565b818103818111156104a5576104a5611d22565b808201808211156104a5576104a5611d22565b634e487b7160e01b5f52601260045260245ffd5b634e487b7160e01b5f52602160045260245ffd5b634e487b7160e01b5f52603260045260245ffd5b5f82611df957634e487b7160e01b5f52601260045260245ffd5b50049056fea26469706673582212202c47e5fd32e706ad1f580a114db2812cf49b3f8ad83c58579bfa27b843c133c264736f6c63430008140033dec2bacdd2f05b59de34da9b523dff8be42e5e38e818c82fdb0bae774387a724
Deployed Bytecode
0x608060405234801561000f575f80fd5b506004361061016d575f3560e01c806370a08231116100d957806395d89b4111610093578063c3cda5201161006e578063c3cda52014610365578063d505accf14610378578063dd62ed3e1461038b578063f1127ed8146103c3575f80fd5b806395d89b41146103375780639ab24eb01461033f578063a9059cbb14610352575f80fd5b806370a082311461029c57806379cc6790146102c45780637ecebe00146102d757806384b0196e146102ea5780638e539e8c1461030557806391ddadf414610318575f80fd5b80633a46b1a81161012a5780633a46b1a8146101ee57806342966c68146102015780634bf5d7e914610216578063587cde1e1461021e5780635c19a95c146102615780636fcfff4514610274575f80fd5b806306fdde0314610171578063095ea7b31461018f57806318160ddd146101b257806323b872dd146101c4578063313ce567146101d75780633644e515146101e6575b5f80fd5b610179610402565b6040516101869190611a61565b60405180910390f35b6101a261019d366004611a8e565b610492565b6040519015158152602001610186565b6002545b604051908152602001610186565b6101a26101d2366004611ab6565b6104ab565b60405160128152602001610186565b6101b66104ce565b6101b66101fc366004611a8e565b6104dc565b61021461020f366004611aef565b610560565b005b61017961056d565b61024961022c366004611b06565b6001600160a01b039081165f908152600860205260409020541690565b6040516001600160a01b039091168152602001610186565b61021461026f366004611b06565b6105e5565b610287610282366004611b06565b6105f4565b60405163ffffffff9091168152602001610186565b6101b66102aa366004611b06565b6001600160a01b03165f9081526020819052604090205490565b6102146102d2366004611a8e565b6105fe565b6101b66102e5366004611b06565b610613565b6102f261061d565b6040516101869796959493929190611b1f565b6101b6610313366004611aef565b61065f565b6103206106c8565b60405165ffffffffffff9091168152602001610186565b6101796106d1565b6101b661034d366004611b06565b6106e0565b6101a2610360366004611a8e565b61070f565b610214610373366004611bc3565b61071c565b610214610386366004611c17565b6107d8565b6101b6610399366004611c7c565b6001600160a01b039182165f90815260016020908152604080832093909416825291909152205490565b6103d66103d1366004611cad565b61090e565b60408051825165ffffffffffff1681526020928301516001600160d01b03169281019290925201610186565b60606003805461041190611cea565b80601f016020809104026020016040519081016040528092919081815260200182805461043d90611cea565b80156104885780601f1061045f57610100808354040283529160200191610488565b820191905f5260205f20905b81548152906001019060200180831161046b57829003601f168201915b5050505050905090565b5f3361049f818585610948565b60019150505b92915050565b5f336104b885828561095a565b6104c38585856109d5565b506001949350505050565b5f6104d7610a32565b905090565b5f806104e66106c8565b90508065ffffffffffff16831061052657604051637669fc0f60e11b81526004810184905265ffffffffffff821660248201526044015b60405180910390fd5b61054f61053284610b5b565b6001600160a01b0386165f90815260096020526040902090610b91565b6001600160d01b0316949350505050565b61056a3382610c41565b50565b6060610577610c75565b65ffffffffffff166105876106c8565b65ffffffffffff16146105ad576040516301bfc1c560e61b815260040160405180910390fd5b5060408051808201909152601d81527f6d6f64653d626c6f636b6e756d6265722666726f6d3d64656661756c74000000602082015290565b336105f08183610c7f565b5050565b5f6104a582610cf0565b61060982338361095a565b6105f08282610c41565b5f6104a582610d11565b5f6060805f805f606061062e610d2e565b610636610d5b565b604080515f80825260208201909252600f60f81b9b939a50919850469750309650945092509050565b5f806106696106c8565b90508065ffffffffffff1683106106a457604051637669fc0f60e11b81526004810184905265ffffffffffff8216602482015260440161051d565b6106b86106b084610b5b565b600a90610b91565b6001600160d01b03169392505050565b5f6104d7610c75565b60606004805461041190611cea565b6001600160a01b0381165f90815260096020526040812061070090610d88565b6001600160d01b031692915050565b5f3361049f8185856109d5565b8342111561074057604051632341d78760e11b81526004810185905260240161051d565b604080517fe48329057bfd03d55e49b547132e39cffd9c1820ad7b9d4c5307691425d15adf60208201526001600160a01b0388169181019190915260608101869052608081018590525f906107b9906107b19060a00160405160208183030381529060405280519060200120610dbf565b858585610deb565b90506107c58187610e17565b6107cf8188610c7f565b50505050505050565b834211156107fc5760405163313c898160e11b81526004810185905260240161051d565b5f7f6e71edae12b1b97f4d1f60370fef10105fa2faae0126114a169c64845d6126c98888886108478c6001600160a01b03165f90815260076020526040902080546001810190915590565b6040805160208101969096526001600160a01b0394851690860152929091166060840152608083015260a082015260c0810186905260e0016040516020818303038152906040528051906020012090505f6108a182610dbf565b90505f6108b082878787610deb565b9050896001600160a01b0316816001600160a01b0316146108f7576040516325c0072360e11b81526001600160a01b0380831660048301528b16602482015260440161051d565b6109028a8a8a610948565b50505050505050505050565b604080518082019091525f808252602082015261092b8383610e69565b9392505050565b5f61092b8284611d36565b5f61092b8284611d5d565b6109558383836001610e9d565b505050565b6001600160a01b038381165f908152600160209081526040808320938616835292905220545f1981146109cf57818110156109c157604051637dc7a0d960e11b81526001600160a01b0384166004820152602481018290526044810183905260640161051d565b6109cf84848484035f610e9d565b50505050565b6001600160a01b0383166109fe57604051634b637e8f60e11b81525f600482015260240161051d565b6001600160a01b038216610a275760405163ec442f0560e01b81525f600482015260240161051d565b610955838383610f6f565b5f306001600160a01b037f00000000000000000000000088b8d272b9f1bab7d7896f5f88f8825ce14b05bd16148015610a8a57507f000000000000000000000000000000000000000000000000000000000000a4b146145b15610ab457507fcb133e0cd503fa1727b2ff99b126d0afe6c76ed66d0bde28457500178b8ba78390565b6104d7604080517f8b73c3c69bb8fe3d512ecc4cf759cc79239f7b179b0ffacaa9a75d522b39400f60208201527f82e11a8b1211ad30078f4b2a88f90fda53d9d49f3a8042a6bc1ee16e72af12bd918101919091527fc89efdaa54c0f20c7adf612882df0950f5a951637e0307cdcb4c672f298b8bc660608201524660808201523060a08201525f9060c00160405160208183030381529060405280519060200120905090565b5f65ffffffffffff821115610b8d576040516306dfcc6560e41b8152603060048201526024810183905260440161051d565b5090565b81545f9081816005811115610bed575f610baa84610f7a565b610bb49085611d7d565b5f8881526020902090915081015465ffffffffffff9081169087161015610bdd57809150610beb565b610be8816001611d90565b92505b505b5f610bfa8787858561105e565b90508015610c3457610c1e87610c11600184611d7d565b5f91825260209091200190565b54600160301b90046001600160d01b0316610c36565b5f5b979650505050505050565b6001600160a01b038216610c6a57604051634b637e8f60e11b81525f600482015260240161051d565b6105f0825f83610f6f565b5f6104d743610b5b565b6001600160a01b038281165f8181526008602052604080822080548686166001600160a01b0319821681179092559151919094169392849290917f3134e8a2e6d97e929a7e54011ea5485d7d196dd5f0ba4d4ef95803e8e3fc257f9190a46109558183610ceb866110bd565b6110da565b6001600160a01b0381165f908152600960205260408120546104a590611243565b6001600160a01b0381165f908152600760205260408120546104a5565b60606104d77f526f6775650000000000000000000000000000000000000000000000000000056005611273565b60606104d77f31000000000000000000000000000000000000000000000000000000000000016006611273565b80545f908015610db757610da183610c11600184611d7d565b54600160301b90046001600160d01b031661092b565b5f9392505050565b5f6104a5610dcb610a32565b8360405161190160f01b8152600281019290925260228201526042902090565b5f805f80610dfb8888888861131c565b925092509250610e0b82826113e4565b50909695505050505050565b6001600160a01b0382165f908152600760205260409020805460018101909155818114610955576040516301d4b62360e61b81526001600160a01b03841660048201526024810182905260440161051d565b604080518082019091525f80825260208201526001600160a01b0383165f90815260096020526040902061092b908361149c565b6001600160a01b038416610ec65760405163e602df0560e01b81525f600482015260240161051d565b6001600160a01b038316610eef57604051634a1406b160e11b81525f600482015260240161051d565b6001600160a01b038085165f90815260016020908152604080832093871683529290522082905580156109cf57826001600160a01b0316846001600160a01b03167f8c5be1e5ebec7d5bd14f71427d1e84f3dd0314c0f7b2291e5b200ac8c7c3b92584604051610f6191815260200190565b60405180910390a350505050565b610955838383611509565b5f815f03610f8957505f919050565b5f6001610f958461156f565b901c6001901b90506001818481610fae57610fae611da3565b048201901c90506001818481610fc657610fc6611da3565b048201901c90506001818481610fde57610fde611da3565b048201901c90506001818481610ff657610ff6611da3565b048201901c9050600181848161100e5761100e611da3565b048201901c9050600181848161102657611026611da3565b048201901c9050600181848161103e5761103e611da3565b048201901c905061092b8182858161105857611058611da3565b04611602565b5f5b818310156110b5575f6110738484611617565b5f8781526020902090915065ffffffffffff86169082015465ffffffffffff1611156110a1578092506110af565b6110ac816001611d90565b93505b50611060565b509392505050565b6001600160a01b0381165f908152602081905260408120546104a5565b816001600160a01b0316836001600160a01b0316141580156110fb57505f81115b15610955576001600160a01b038316156111a2576001600160a01b0383165f908152600960205260408120819061113d9061093d61113886611631565b611664565b6001600160d01b031691506001600160d01b03169150846001600160a01b03167fdec2bacdd2f05b59de34da9b523dff8be42e5e38e818c82fdb0bae774387a7248383604051611197929190918252602082015260400190565b60405180910390a250505b6001600160a01b03821615610955576001600160a01b0382165f90815260096020526040812081906111da9061093261113886611631565b6001600160d01b031691506001600160d01b03169150836001600160a01b03167fdec2bacdd2f05b59de34da9b523dff8be42e5e38e818c82fdb0bae774387a7248383604051611234929190918252602082015260400190565b60405180910390a25050505050565b5f63ffffffff821115610b8d576040516306dfcc6560e41b8152602060048201526024810183905260440161051d565b606060ff831461128d576112868361169c565b90506104a5565b81805461129990611cea565b80601f01602080910402602001604051908101604052809291908181526020018280546112c590611cea565b80156113105780601f106112e757610100808354040283529160200191611310565b820191905f5260205f20905b8154815290600101906020018083116112f357829003601f168201915b505050505090506104a5565b5f80807f7fffffffffffffffffffffffffffffff5d576e7357a4501ddfe92f46681b20a084111561135557505f915060039050826113da565b604080515f808252602082018084528a905260ff891692820192909252606081018790526080810186905260019060a0016020604051602081039080840390855afa1580156113a6573d5f803e3d5ffd5b5050604051601f1901519150506001600160a01b0381166113d157505f9250600191508290506113da565b92505f91508190505b9450945094915050565b5f8260038111156113f7576113f7611db7565b03611400575050565b600182600381111561141457611414611db7565b036114325760405163f645eedf60e01b815260040160405180910390fd5b600282600381111561144657611446611db7565b036114675760405163fce698f760e01b81526004810182905260240161051d565b600382600381111561147b5761147b611db7565b036105f0576040516335e2f38360e21b81526004810182905260240161051d565b604080518082019091525f8082526020820152825f018263ffffffff16815481106114c9576114c9611dcb565b5f9182526020918290206040805180820190915291015465ffffffffffff81168252600160301b90046001600160d01b0316918101919091529392505050565b6115148383836116d9565b6001600160a01b038316611564575f61152c60025490565b90506001600160d01b038082111561156157604051630e58ae9360e11b8152600481018390526024810182905260440161051d565b50505b6109558383836117ff565b5f80608083901c1561158357608092831c92015b604083901c1561159557604092831c92015b602083901c156115a757602092831c92015b601083901c156115b957601092831c92015b600883901c156115cb57600892831c92015b600483901c156115dd57600492831c92015b600283901c156115ef57600292831c92015b600183901c156104a55760010192915050565b5f818310611610578161092b565b5090919050565b5f6116256002848418611ddf565b61092b90848416611d90565b5f6001600160d01b03821115610b8d576040516306dfcc6560e41b815260d060048201526024810183905260440161051d565b5f8061168f6116716106c8565b61168761167d88610d88565b868863ffffffff16565b879190611874565b915091505b935093915050565b60605f6116a883611881565b6040805160208082528183019092529192505f91906020820181803683375050509182525060208101929092525090565b6001600160a01b038316611703578060025f8282546116f89190611d90565b909155506117739050565b6001600160a01b0383165f90815260208190526040902054818110156117555760405163391434e360e21b81526001600160a01b0385166004820152602481018290526044810183905260640161051d565b6001600160a01b0384165f9081526020819052604090209082900390555b6001600160a01b03821661178f576002805482900390556117ad565b6001600160a01b0382165f9081526020819052604090208054820190555b816001600160a01b0316836001600160a01b03167fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef836040516117f291815260200190565b60405180910390a3505050565b6001600160a01b0383166118215761181e600a61093261113884611631565b50505b6001600160a01b03821661184357611840600a61093d61113884611631565b50505b6001600160a01b038381165f90815260086020526040808220548584168352912054610955929182169116836110da565b5f8061168f8585856118a8565b5f60ff8216601f8111156104a557604051632cd44ac360e21b815260040160405180910390fd5b82545f90819080156119c4575f6118c487610c11600185611d7d565b60408051808201909152905465ffffffffffff808216808452600160301b9092046001600160d01b03166020840152919250908716101561191857604051632520601d60e01b815260040160405180910390fd5b805165ffffffffffff808816911603611964578461193b88610c11600186611d7d565b80546001600160d01b0392909216600160301b0265ffffffffffff9092169190911790556119b4565b6040805180820190915265ffffffffffff80881682526001600160d01b0380881660208085019182528b54600181018d555f8d81529190912094519151909216600160301b029216919091179101555b6020015192508391506116949050565b50506040805180820190915265ffffffffffff80851682526001600160d01b0380851660208085019182528854600181018a555f8a815291822095519251909316600160301b029190931617920191909155905081611694565b5f81518084525f5b81811015611a4257602081850181015186830182015201611a26565b505f602082860101526020601f19601f83011685010191505092915050565b602081525f61092b6020830184611a1e565b80356001600160a01b0381168114611a89575f80fd5b919050565b5f8060408385031215611a9f575f80fd5b611aa883611a73565b946020939093013593505050565b5f805f60608486031215611ac8575f80fd5b611ad184611a73565b9250611adf60208501611a73565b9150604084013590509250925092565b5f60208284031215611aff575f80fd5b5035919050565b5f60208284031215611b16575f80fd5b61092b82611a73565b60ff60f81b881681525f602060e081840152611b3e60e084018a611a1e565b8381036040850152611b50818a611a1e565b606085018990526001600160a01b038816608086015260a0850187905284810360c086015285518082528387019250908301905f5b81811015611ba157835183529284019291840191600101611b85565b50909c9b505050505050505050505050565b803560ff81168114611a89575f80fd5b5f805f805f8060c08789031215611bd8575f80fd5b611be187611a73565b95506020870135945060408701359350611bfd60608801611bb3565b92506080870135915060a087013590509295509295509295565b5f805f805f805f60e0888a031215611c2d575f80fd5b611c3688611a73565b9650611c4460208901611a73565b95506040880135945060608801359350611c6060808901611bb3565b925060a0880135915060c0880135905092959891949750929550565b5f8060408385031215611c8d575f80fd5b611c9683611a73565b9150611ca460208401611a73565b90509250929050565b5f8060408385031215611cbe575f80fd5b611cc783611a73565b9150602083013563ffffffff81168114611cdf575f80fd5b809150509250929050565b600181811c90821680611cfe57607f821691505b602082108103611d1c57634e487b7160e01b5f52602260045260245ffd5b50919050565b634e487b7160e01b5f52601160045260245ffd5b6001600160d01b03818116838216019080821115611d5657611d56611d22565b5092915050565b6001600160d01b03828116828216039080821115611d5657611d56611d22565b818103818111156104a5576104a5611d22565b808201808211156104a5576104a5611d22565b634e487b7160e01b5f52601260045260245ffd5b634e487b7160e01b5f52602160045260245ffd5b634e487b7160e01b5f52603260045260245ffd5b5f82611df957634e487b7160e01b5f52601260045260245ffd5b50049056fea26469706673582212202c47e5fd32e706ad1f580a114db2812cf49b3f8ad83c58579bfa27b843c133c264736f6c63430008140033
Deployed Bytecode Sourcemap
154014:632:0:-:0;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;134188:91;;;:::i;:::-;;;;;;;:::i;:::-;;;;;;;;136481:190;;;;;;:::i;:::-;;:::i;:::-;;;1269:14:1;;1262:22;1244:41;;1232:2;1217:18;136481:190:0;1104:187:1;135290:99:0;135369:12;;135290:99;;;1442:25:1;;;1430:2;1415:18;135290:99:0;1296:177:1;137249:249:0;;;;;;:::i;:::-;;:::i;135141:84::-;;;135215:2;1953:36:1;;1941:2;1926:18;135141:84:0;1811:184:1;150551:114:0;;;:::i;116742:370::-;;;;;;:::i;:::-;;:::i;143908:89::-;;;;;;:::i;:::-;;:::i;:::-;;115837:278;;;:::i;118397:119::-;;;;;;:::i;:::-;-1:-1:-1;;;;;118489:19:0;;;118462:7;118489:19;;;:10;:19;;;;;;;;118397:119;;;;-1:-1:-1;;;;;2722:32:1;;;2704:51;;2692:2;2677:18;118397:119:0;2558:203:1;118603:141:0;;;;;;:::i;:::-;;:::i;153632:128::-;;;;;;:::i;:::-;;:::i;:::-;;;2940:10:1;2928:23;;;2910:42;;2898:2;2883:18;153632:128:0;2766:192:1;135452:118:0;;;;;;:::i;:::-;-1:-1:-1;;;;;135544:18:0;135517:7;135544:18;;;;;;;;;;;;135452:118;144326:161;;;;;;:::i;:::-;;:::i;154466:177::-;;;;;;:::i;:::-;;:::i;48301:580::-;;;:::i;:::-;;;;;;;;;;;;;:::i;117762:347::-;;;;;;:::i;:::-;;:::i;115578:98::-;;;:::i;:::-;;;4401:14:1;4389:27;;;4371:46;;4359:2;4344:18;115578:98:0;4227:196:1;134398:95:0;;;:::i;116210:137::-;;;;;;:::i;:::-;;:::i;135775:182::-;;;;;;:::i;:::-;;:::i;118827:573::-;;;;;;:::i;:::-;;:::i;149539:695::-;;;;;;:::i;:::-;;:::i;136020:142::-;;;;;;:::i;:::-;-1:-1:-1;;;;;136127:18:0;;;136100:7;136127:18;;;:11;:18;;;;;;;;:27;;;;;;;;;;;;;136020:142;153842:165;;;;;;:::i;:::-;;:::i;:::-;;;;6586:13:1;;6601:14;6582:34;6564:53;;6677:4;6665:17;;;6659:24;-1:-1:-1;;;;;6655:50:1;6633:20;;;6626:80;;;;6537:18;153842:165:0;6356:356:1;134188:91:0;134233:13;134266:5;134259:12;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;134188:91;:::o;136481:190::-;136554:4;3454:10;136610:31;3454:10;136626:7;136635:5;136610:8;:31::i;:::-;136659:4;136652:11;;;136481:190;;;;;:::o;137249:249::-;137336:4;3454:10;137394:37;137410:4;3454:10;137425:5;137394:15;:37::i;:::-;137442:26;137452:4;137458:2;137462:5;137442:9;:26::i;:::-;-1:-1:-1;137486:4:0;;137249:249;-1:-1:-1;;;;137249:249:0:o;150551:114::-;150610:7;150637:20;:18;:20::i;:::-;150630:27;;150551:114;:::o;116742:370::-;116829:7;116849:23;116875:7;:5;:7::i;:::-;116849:33;;116910:16;116897:29;;:9;:29;116893:117;;116950:48;;-1:-1:-1;;;116950:48:0;;;;;7274:25:1;;;7347:14;7335:27;;7315:18;;;7308:55;7247:18;;116950:48:0;;;;;;;;116893:117;117027:77;117075:28;117093:9;117075:17;:28::i;:::-;-1:-1:-1;;;;;117027:29:0;;;;;;:20;:29;;;;;;:47;:77::i;:::-;-1:-1:-1;;;;;117020:84:0;;116742:370;-1:-1:-1;;;;116742:370:0:o;143908:89::-;143963:26;3454:10;143983:5;143963;:26::i;:::-;143908:89;:::o;115837:278::-;115888:13;115979:18;:16;:18::i;:::-;115968:29;;:7;:5;:7::i;:::-;:29;;;115964:95;;116021:26;;-1:-1:-1;;;116021:26:0;;;;;;;;;;;115964:95;-1:-1:-1;116069:38:0;;;;;;;;;;;;;;;;;;115837:278::o;118603:141::-;3454:10;118707:29;3454:10;118726:9;118707;:29::i;:::-;118655:89;118603:141;:::o;153632:128::-;153702:6;153728:24;153744:7;153728:15;:24::i;144326:161::-;144402:45;144418:7;3454:10;144441:5;144402:15;:45::i;:::-;144458:21;144464:7;144473:5;144458;:21::i;154466:177::-;154584:7;154616:19;154629:5;154616:12;:19::i;48301:580::-;48404:13;48432:18;48465:21;48501:15;48531:25;48571:12;48598:27;48706:13;:11;:13::i;:::-;48734:16;:14;:16::i;:::-;48846;;;48829:1;48846:16;;;;;;;;;-1:-1:-1;;;48653:220:0;;;-1:-1:-1;48653:220:0;;-1:-1:-1;48765:13:0;;-1:-1:-1;48801:4:0;;-1:-1:-1;48829:1:0;-1:-1:-1;48846:16:0;-1:-1:-1;48653:220:0;-1:-1:-1;48301:580:0:o;117762:347::-;117838:7;117858:23;117884:7;:5;:7::i;:::-;117858:33;;117919:16;117906:29;;:9;:29;117902:117;;117959:48;;-1:-1:-1;;;117959:48:0;;;;;7274:25:1;;;7347:14;7335:27;;7315:18;;;7308:55;7247:18;;117959:48:0;7102:267:1;117902:117:0;118036:65;118072:28;118090:9;118072:17;:28::i;:::-;118036:17;;:35;:65::i;:::-;-1:-1:-1;;;;;118029:72:0;;117762:347;-1:-1:-1;;;117762:347:0:o;115578:98::-;115624:6;115650:18;:16;:18::i;134398:95::-;134445:13;134478:7;134471:14;;;;;:::i;116210:137::-;-1:-1:-1;;;;;116301:29:0;;116274:7;116301:29;;;:20;:29;;;;;:38;;:36;:38::i;:::-;-1:-1:-1;;;;;116294:45:0;;116210:137;-1:-1:-1;;116210:137:0:o;135775:182::-;135844:4;3454:10;135900:27;3454:10;135917:2;135921:5;135900:9;:27::i;118827:573::-;119040:6;119022:15;:24;119018:93;;;119070:29;;-1:-1:-1;;;119070:29:0;;;;;1442:25:1;;;1415:18;;119070:29:0;1296:177:1;119018:93:0;119193:57;;;114830:71;119193:57;;;7737:25:1;-1:-1:-1;;;;;7798:32:1;;7778:18;;;7771:60;;;;7847:18;;;7840:34;;;7890:18;;;7883:34;;;119121:14:0;;119138:173;;119166:86;;7709:19:1;;119193:57:0;;;;;;;;;;;;119183:68;;;;;;119166:16;:86::i;:::-;119267:1;119283;119299;119138:13;:173::i;:::-;119121:190;;119322:31;119339:6;119347:5;119322:16;:31::i;:::-;119364:28;119374:6;119382:9;119364;:28::i;:::-;119007:393;118827:573;;;;;;:::o;149539:695::-;149769:8;149751:15;:26;149747:99;;;149801:33;;-1:-1:-1;;;149801:33:0;;;;;1442:25:1;;;1415:18;;149801:33:0;1296:177:1;149747:99:0;149858:18;148859:95;149917:5;149924:7;149933:5;149940:16;149950:5;-1:-1:-1;;;;;86464:14:0;86157:7;86464:14;;;:7;:14;;;;;:16;;;;;;;;;86097:402;149940:16;149889:78;;;;;;8215:25:1;;;;-1:-1:-1;;;;;8314:15:1;;;8294:18;;;8287:43;8366:15;;;;8346:18;;;8339:43;8398:18;;;8391:34;8441:19;;;8434:35;8485:19;;;8478:35;;;8187:19;;149889:78:0;;;;;;;;;;;;149879:89;;;;;;149858:110;;149981:12;149996:28;150013:10;149996:16;:28::i;:::-;149981:43;;150037:14;150054:28;150068:4;150074:1;150077;150080;150054:13;:28::i;:::-;150037:45;;150107:5;-1:-1:-1;;;;;150097:15:0;:6;-1:-1:-1;;;;;150097:15:0;;150093:90;;150136:35;;-1:-1:-1;;;150136:35:0;;-1:-1:-1;;;;;8754:15:1;;;150136:35:0;;;8736:34:1;8806:15;;8786:18;;;8779:43;8671:18;;150136:35:0;8524:304:1;150093:90:0;150195:31;150204:5;150211:7;150220:5;150195:8;:31::i;:::-;149736:498;;;149539:695;;;;;;;:::o;153842:165::-;-1:-1:-1;;;;;;;;;;;;;;;;;153973:26:0;153986:7;153995:3;153973:12;:26::i;:::-;153966:33;153842:165;-1:-1:-1;;;153842:165:0:o;122247:98::-;122305:7;122332:5;122336:1;122332;:5;:::i;122353:103::-;122416:7;122443:5;122447:1;122443;:5;:::i;141308:130::-;141393:37;141402:5;141409:7;141418:5;141425:4;141393:8;:37::i;:::-;141308:130;;;:::o;143024:487::-;-1:-1:-1;;;;;136127:18:0;;;143124:24;136127:18;;;:11;:18;;;;;;;;:27;;;;;;;;;;-1:-1:-1;;143191:37:0;;143187:317;;143268:5;143249:16;:24;143245:132;;;143301:60;;-1:-1:-1;;;143301:60:0;;-1:-1:-1;;;;;9562:32:1;;143301:60:0;;;9544:51:1;9611:18;;;9604:34;;;9654:18;;;9647:34;;;9517:18;;143301:60:0;9342:345:1;143245:132:0;143420:57;143429:5;143436:7;143464:5;143445:16;:24;143471:5;143420:8;:57::i;:::-;143113:398;143024:487;;;:::o;137883:308::-;-1:-1:-1;;;;;137967:18:0;;137963:88;;138009:30;;-1:-1:-1;;;138009:30:0;;138036:1;138009:30;;;2704:51:1;2677:18;;138009:30:0;2558:203:1;137963:88:0;-1:-1:-1;;;;;138065:16:0;;138061:88;;138105:32;;-1:-1:-1;;;138105:32:0;;138134:1;138105:32;;;2704:51:1;2677:18;;138105:32:0;2558:203:1;138061:88:0;138159:24;138167:4;138173:2;138177:5;138159:7;:24::i;46968:268::-;47021:7;47053:4;-1:-1:-1;;;;;47062:11:0;47045:28;;:63;;;;;47094:14;47077:13;:31;47045:63;47041:188;;;-1:-1:-1;47132:22:0;;46968:268::o;47041:188::-;47194:23;47336:80;;;45160:95;47336:80;;;10764:25:1;47358:11:0;10805:18:1;;;10798:34;;;;47371:14:0;10848:18:1;;;10841:34;47387:13:0;10891:18:1;;;10884:34;47410:4:0;10934:19:1;;;10927:61;47299:7:0;;10736:19:1;;47336:80:0;;;;;;;;;;;;47326:91;;;;;;47319:98;;47244:181;;64358:218;64414:6;64445:16;64437:24;;64433:105;;;64485:41;;-1:-1:-1;;;64485:41:0;;64516:2;64485:41;;;9873:36:1;9925:18;;;9918:34;;;9846:18;;64485:41:0;9692:266:1;64433:105:0;-1:-1:-1;64562:5:0;64358:218::o;96278:624::-;96397:24;;96363:7;;;96397:24;96501:1;96495:7;;96491:241;;;96519:11;96539:14;96549:3;96539:9;:14::i;:::-;96533:20;;:3;:20;:::i;:::-;101185:28;101250:20;;;101316:4;101303:18;;96519:34;;-1:-1:-1;101299:28:0;;96578:42;;;;;96572:48;;;;96568:153;;;96648:3;96641:10;;96568:153;;;96698:7;:3;96704:1;96698:7;:::i;:::-;96692:13;;96568:153;96504:228;96491:241;96744:11;96758:53;96777:4;96796:3;96801;96806:4;96758:18;:53::i;:::-;96744:67;-1:-1:-1;96831:8:0;;:63;;96846:41;96860:4;96879:7;96885:1;96879:3;:7;:::i;:::-;101185:28;101250:20;;;101316:4;101303:18;;;101299:28;;101072:273;96846:41;:48;-1:-1:-1;;;96846:48:0;;-1:-1:-1;;;;;96846:48:0;96831:63;;;96842:1;96831:63;96824:70;96278:624;-1:-1:-1;;;;;;;96278:624:0:o;140544:211::-;-1:-1:-1;;;;;140615:21:0;;140611:91;;140660:30;;-1:-1:-1;;;140660:30:0;;140687:1;140660:30;;;2704:51:1;2677:18;;140660:30:0;2558:203:1;140611:91:0;140712:35;140720:7;140737:1;140741:5;140712:7;:35::i;109057:111::-;109103:6;109129:31;109147:12;109129:17;:31::i;119585:318::-;-1:-1:-1;;;;;118489:19:0;;;119668;118489;;;:10;:19;;;;;;;;119719:31;;;-1:-1:-1;;;;;;119719:31:0;;;;;;;119768:48;;118489:19;;;;;119719:31;118489:19;;;;119768:48;;119668:19;119768:48;119827:68;119846:11;119859:9;119870:24;119886:7;119870:15;:24::i;:::-;119827:18;:68::i;121520:164::-;-1:-1:-1;;;;;121637:29:0;;121593:6;121637:29;;;:20;:29;;;;;97979:24;121619:57;;:17;:57::i;150293:145::-;-1:-1:-1;;;;;85954:14:0;;150384:7;85954:14;;;:7;:14;;;;;;150411:19;85867:109;49210:128;49256:13;49289:41;:5;49316:13;49289:26;:41::i;49673:137::-;49722:13;49755:47;:8;49785:16;49755:29;:47::i;97027:209::-;97123:24;;97089:7;;97165:8;;:63;;97180:41;97194:4;97213:7;97219:1;97213:3;:7;:::i;97180:41::-;:48;-1:-1:-1;;;97180:48:0;;-1:-1:-1;;;;;97180:48:0;97165:63;;;97176:1;97158:70;97027:209;-1:-1:-1;;;97027:209:0:o;48067:178::-;48144:7;48171:66;48204:20;:18;:20::i;:::-;48226:10;35067:4;35061:11;-1:-1:-1;;;35086:23:0;;35139:4;35130:14;;35123:39;;;;35192:4;35183:14;;35176:34;35249:4;35234:20;;;34862:410;10508:264;10593:7;10614:17;10633:18;10653:16;10673:25;10684:4;10690:1;10693;10696;10673:10;:25::i;:::-;10613:85;;;;;;10709:28;10721:5;10728:8;10709:11;:28::i;:::-;-1:-1:-1;10755:9:0;;10508:264;-1:-1:-1;;;;;;10508:264:0:o;86615:227::-;-1:-1:-1;;;;;86464:14:0;;86699:15;86464:14;;;:7;:14;;;;;:16;;;;;;;;86748;;;86744:91;;86788:35;;-1:-1:-1;;;86788:35:0;;-1:-1:-1;;;;;10418:32:1;;86788:35:0;;;10400:51:1;10467:18;;;10460:34;;;10373:18;;86788:35:0;10226:274:1;121766:204:0;-1:-1:-1;;;;;;;;;;;;;;;;;;;;;;121925:29:0;;;;;;:20;:29;;;;;:37;;121958:3;121925:32;:37::i;142289:443::-;-1:-1:-1;;;;;142402:19:0;;142398:91;;142445:32;;-1:-1:-1;;;142445:32:0;;142474:1;142445:32;;;2704:51:1;2677:18;;142445:32:0;2558:203:1;142398:91:0;-1:-1:-1;;;;;142503:21:0;;142499:92;;142548:31;;-1:-1:-1;;;142548:31:0;;142576:1;142548:31;;;2704:51:1;2677:18;;142548:31:0;2558:203:1;142499:92:0;-1:-1:-1;;;;;142601:18:0;;;;;;;:11;:18;;;;;;;;:27;;;;;;;;;:35;;;142647:78;;;;142698:7;-1:-1:-1;;;;;142682:31:0;142691:5;-1:-1:-1;;;;;142682:31:0;;142707:5;142682:31;;;;1442:25:1;;1430:2;1415:18;;1296:177;142682:31:0;;;;;;;;142289:443;;;;:::o;154291:167::-;154420:30;154434:4;154440:2;154444:5;154420:13;:30::i;20763:1673::-;20811:7;20835:1;20840;20835:6;20831:47;;-1:-1:-1;20865:1:0;;20763:1673;-1:-1:-1;20763:1673:0:o;20831:47::-;21569:14;21603:1;21592:7;21597:1;21592:4;:7::i;:::-;:12;;21586:1;:19;;21569:36;;22071:1;22060:6;22056:1;:10;;;;;:::i;:::-;;22047:6;:19;22046:26;;22037:35;;22121:1;22110:6;22106:1;:10;;;;;:::i;:::-;;22097:6;:19;22096:26;;22087:35;;22171:1;22160:6;22156:1;:10;;;;;:::i;:::-;;22147:6;:19;22146:26;;22137:35;;22221:1;22210:6;22206:1;:10;;;;;:::i;:::-;;22197:6;:19;22196:26;;22187:35;;22271:1;22260:6;22256:1;:10;;;;;:::i;:::-;;22247:6;:19;22246:26;;22237:35;;22321:1;22310:6;22306:1;:10;;;;;:::i;:::-;;22297:6;:19;22296:26;;22287:35;;22371:1;22360:6;22356:1;:10;;;;;:::i;:::-;;22347:6;:19;22346:26;;22337:35;;22394:23;22398:6;22410;22406:1;:10;;;;;:::i;:::-;;22394:3;:23::i;99665:448::-;99827:7;99847:237;99860:4;99854:3;:10;99847:237;;;99881:11;99895:23;99908:3;99913:4;99895:12;:23::i;:::-;101185:28;101250:20;;;101316:4;101303:18;;99881:37;;-1:-1:-1;99937:35:0;;;;101299:28;;99937:29;;;:35;99933:140;;;100000:3;99993:10;;99933:140;;;100050:7;:3;100056:1;100050:7;:::i;:::-;100044:13;;99933:140;99866:218;99847:237;;;-1:-1:-1;100101:4:0;99665:448;-1:-1:-1;;;99665:448:0:o;153417:135::-;-1:-1:-1;;;;;135544:18:0;;153499:7;135544:18;;;;;;;;;;;153526;135452:118;120641:799;120742:2;-1:-1:-1;;;;;120734:10:0;:4;-1:-1:-1;;;;;120734:10:0;;;:24;;;;;120757:1;120748:6;:10;120734:24;120730:703;;;-1:-1:-1;;;;;120779:18:0;;;120775:322;;-1:-1:-1;;;;;120885:26:0;;120819:16;120885:26;;;:20;:26;;;;;120819:16;;120857:154;;120934:9;120966:26;120985:6;120966:18;:26::i;:::-;120857:5;:154::i;:::-;-1:-1:-1;;;;;120818:193:0;;;-1:-1:-1;;;;;120818:193:0;;;121056:4;-1:-1:-1;;;;;121035:46:0;;121062:8;121072;121035:46;;;;;;11305:25:1;;;11361:2;11346:18;;11339:34;11293:2;11278:18;;11131:248;121035:46:0;;;;;;;;120799:298;;120775:322;-1:-1:-1;;;;;121115:16:0;;;121111:311;;-1:-1:-1;;;;;121219:24:0;;121153:16;121219:24;;;:20;:24;;;;;121153:16;;121191:147;;121266:4;121293:26;121312:6;121293:18;:26::i;121191:147::-;-1:-1:-1;;;;;121152:186:0;;;-1:-1:-1;;;;;121152:186:0;;;121383:2;-1:-1:-1;;;;;121362:44:0;;121387:8;121397;121362:44;;;;;;11305:25:1;;;11361:2;11346:18;;11339:34;11293:2;11278:18;;11131:248;121362:44:0;;;;;;;;121133:289;;120641:799;;;:::o;65392:218::-;65448:6;65479:16;65471:24;;65467:105;;;65519:41;;-1:-1:-1;;;65519:41:0;;65550:2;65519:41;;;9873:36:1;9925:18;;;9918:34;;;9846:18;;65519:41:0;9692:266:1;42420:273:0;42514:13;40366:66;42544:46;;42540:146;;42614:15;42623:5;42614:8;:15::i;:::-;42607:22;;;;42540:146;42669:5;42662:12;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;8813:1556;8944:7;;;9887:66;9874:79;;9870:166;;;-1:-1:-1;9986:1:0;;-1:-1:-1;9990:30:0;;-1:-1:-1;10022:1:0;9970:54;;9870:166;10150:24;;;10133:14;10150:24;;;;;;;;;11882:25:1;;;11955:4;11943:17;;11923:18;;;11916:45;;;;11977:18;;;11970:34;;;12020:18;;;12013:34;;;10150:24:0;;11854:19:1;;10150:24:0;;;;;;;;;;;;;;;;;;;;;;;;;;;-1:-1:-1;;10150:24:0;;-1:-1:-1;;10150:24:0;;;-1:-1:-1;;;;;;;10189:20:0;;10185:115;;-1:-1:-1;10242:1:0;;-1:-1:-1;10246:29:0;;-1:-1:-1;10242:1:0;;-1:-1:-1;10226:62:0;;10185:115;10320:6;-1:-1:-1;10328:20:0;;-1:-1:-1;10328:20:0;;-1:-1:-1;8813:1556:0;;;;;;;;;:::o;10910:542::-;11006:20;10997:5;:29;;;;;;;;:::i;:::-;;10993:452;;10910:542;;:::o;10993:452::-;11104:29;11095:5;:38;;;;;;;;:::i;:::-;;11091:354;;11157:23;;-1:-1:-1;;;11157:23:0;;;;;;;;;;;11091:354;11211:35;11202:5;:44;;;;;;;;:::i;:::-;;11198:247;;11270:46;;-1:-1:-1;;;11270:46:0;;;;;1442:25:1;;;1415:18;;11270:46:0;1296:177:1;11198:247:0;11347:30;11338:5;:39;;;;;;;;:::i;:::-;;11334:111;;11401:32;;-1:-1:-1;;;11401:32:0;;;;;1442:25:1;;;1415:18;;11401:32:0;1296:177:1;98088:140:0;-1:-1:-1;;;;;;;;;;;;;;;;;98198:4:0;:17;;98216:3;98198:22;;;;;;;;;;:::i;:::-;;;;;;;;;;98191:29;;;;;;;;;98198:22;;98191:29;;;;;;-1:-1:-1;;;98191:29:0;;-1:-1:-1;;;;;98191:29:0;;;;;;;;;98088:140;-1:-1:-1;;;98088:140:0:o;152726:423::-;152821:30;152835:4;152841:2;152845:5;152821:13;:30::i;:::-;-1:-1:-1;;;;;152866:18:0;;152862:232;;152901:14;152918:13;135369:12;;;135290:99;152918:13;152901:30;-1:-1:-1;;;;;;152991:12:0;;;152987:96;;;153031:36;;-1:-1:-1;;;153031:36:0;;;;;11305:25:1;;;11346:18;;;11339:34;;;11278:18;;153031:36:0;11131:248:1;152987:96:0;152886:208;;152862:232;153104:37;153125:4;153131:2;153135:5;153104:20;:37::i;22922:1019::-;22974:7;;23061:3;23052:12;;;:16;23048:102;;23099:3;23089:13;;;;23121;23048:102;23177:2;23168:11;;;:15;23164:99;;23214:2;23204:12;;;;23235;23164:99;23290:2;23281:11;;;:15;23277:99;;23327:2;23317:12;;;;23348;23277:99;23403:2;23394:11;;;:15;23390:99;;23440:2;23430:12;;;;23461;23390:99;23516:1;23507:10;;;:14;23503:96;;23552:1;23542:11;;;;23572;23503:96;23626:1;23617:10;;;:14;23613:96;;23662:1;23652:11;;;;23682;23613:96;23736:1;23727:10;;;:14;23723:96;;23772:1;23762:11;;;;23792;23723:96;23846:1;23837:10;;;:14;23833:66;;23882:1;23872:11;23927:6;22922:1019;-1:-1:-1;;22922:1019:0:o;14600:106::-;14658:7;14689:1;14685;:5;:13;;14697:1;14685:13;;;-1:-1:-1;14693:1:0;;14600:106;-1:-1:-1;14600:106:0:o;14825:156::-;14887:7;14962:11;14972:1;14963:5;;;14962:11;:::i;:::-;14952:21;;14953:5;;;14952:21;:::i;53896:223::-;53953:7;-1:-1:-1;;;;;53977:25:0;;53973:107;;;54026:42;;-1:-1:-1;;;54026:42:0;;54057:3;54026:42;;;9873:36:1;9925:18;;;9918:34;;;9846:18;;54026:42:0;9692:266:1;121978:261:0;122149:7;122158;122185:46;122196:7;:5;:7::i;:::-;122205:25;122208:14;:5;:12;:14::i;:::-;122224:5;122205:2;:25;;:::i;:::-;122185:5;;:46;:10;:46::i;:::-;122178:53;;;;121978:261;;;;;;;:::o;41075:415::-;41134:13;41160:11;41174:16;41185:4;41174:10;:16::i;:::-;41300:14;;;41311:2;41300:14;;;;;;;;;41160:30;;-1:-1:-1;41280:17:0;;41300:14;;;;;;;;;-1:-1:-1;;;41393:16:0;;;-1:-1:-1;41439:4:0;41430:14;;41423:28;;;;-1:-1:-1;41393:16:0;41075:415::o;138515:1135::-;-1:-1:-1;;;;;138605:18:0;;138601:552;;138759:5;138743:12;;:21;;;;;;;:::i;:::-;;;;-1:-1:-1;138601:552:0;;-1:-1:-1;138601:552:0;;-1:-1:-1;;;;;138819:15:0;;138797:19;138819:15;;;;;;;;;;;138853:19;;;138849:117;;;138900:50;;-1:-1:-1;;;138900:50:0;;-1:-1:-1;;;;;9562:32:1;;138900:50:0;;;9544:51:1;9611:18;;;9604:34;;;9654:18;;;9647:34;;;9517:18;;138900:50:0;9342:345:1;138849:117:0;-1:-1:-1;;;;;139089:15:0;;:9;:15;;;;;;;;;;139107:19;;;;139089:37;;138601:552;-1:-1:-1;;;;;139169:16:0;;139165:435;;139335:12;:21;;;;;;;139165:435;;;-1:-1:-1;;;;;139551:13:0;;:9;:13;;;;;;;;;;:22;;;;;;139165:435;139632:2;-1:-1:-1;;;;;139617:25:0;139626:4;-1:-1:-1;;;;;139617:25:0;;139636:5;139617:25;;;;1442::1;;1430:2;1415:18;;1296:177;139617:25:0;;;;;;;;138515:1135;;;:::o;120143:407::-;-1:-1:-1;;;;;120247:18:0;;120243:109;;120282:58;120288:17;120307:4;120313:26;120332:6;120313:18;:26::i;120282:58::-;;;120243:109;-1:-1:-1;;;;;120366:16:0;;120362:112;;120399:63;120405:17;120424:9;120435:26;120454:6;120435:18;:26::i;120399:63::-;;;120362:112;-1:-1:-1;;;;;118489:19:0;;;118462:7;118489:19;;;:10;:19;;;;;;;;;;;;;;;120484:58;;118489:19;;;;;120535:6;120484:18;:58::i;94856:164::-;94938:7;;94974:38;94982:4;95001:3;95006:5;94974:7;:38::i;41567:251::-;41628:7;41701:4;41665:40;;41729:2;41720:11;;41716:71;;;41755:20;;-1:-1:-1;;;41755:20:0;;;;;;;;;;;98410:893;98544:11;;98501:7;;;;98572;;98568:728;;98649:25;98677:28;98691:4;98697:7;98703:1;98697:3;:7;:::i;98677:28::-;98649:56;;;;;;;;;;;;;;;;;;-1:-1:-1;;;98649:56:0;;;-1:-1:-1;;;;;98649:56:0;;;;;;;-1:-1:-1;98782:15:0;;;-1:-1:-1;98778:93:0;;;98825:30;;-1:-1:-1;;;98825:30:0;;;;;;;;;;;98778:93;98937:9;;:16;;;;;;;98933:193;;99012:5;98974:28;98988:4;98994:7;99000:1;98994:3;:7;:::i;98974:28::-;:43;;-1:-1:-1;;;;;98974:43:0;;;;-1:-1:-1;;;98974:43:0;;;;;;;;;;;98933:193;;;99068:41;;;;;;;;;;;;;;;-1:-1:-1;;;;;99068:41:0;;;;;;;;;;99058:52;;;;;;;-1:-1:-1;99058:52:0;;;;;;;;;;;;;;-1:-1:-1;;;99058:52:0;;;;;;;;;;98933:193;99148:11;;;;-1:-1:-1;99161:5:0;;-1:-1:-1;99140:27:0;;-1:-1:-1;99140:27:0;98568:728;-1:-1:-1;;99210:41:0;;;;;;;;;;;;;;;-1:-1:-1;;;;;99210:41:0;;;;;;;;;;99200:52;;;;;;;-1:-1:-1;99200:52:0;;;;;;;;;;;;;-1:-1:-1;;;99200:52:0;;;;;;;;;;;;-1:-1:-1;;99244:5:0;99267:17;;14:423:1;56:3;94:5;88:12;121:6;116:3;109:19;146:1;156:162;170:6;167:1;164:13;156:162;;;232:4;288:13;;;284:22;;278:29;260:11;;;256:20;;249:59;185:12;156:162;;;160:3;363:1;356:4;347:6;342:3;338:16;334:27;327:38;426:4;419:2;415:7;410:2;402:6;398:15;394:29;389:3;385:39;381:50;374:57;;;14:423;;;;:::o;442:220::-;591:2;580:9;573:21;554:4;611:45;652:2;641:9;637:18;629:6;611:45;:::i;667:173::-;735:20;;-1:-1:-1;;;;;784:31:1;;774:42;;764:70;;830:1;827;820:12;764:70;667:173;;;:::o;845:254::-;913:6;921;974:2;962:9;953:7;949:23;945:32;942:52;;;990:1;987;980:12;942:52;1013:29;1032:9;1013:29;:::i;:::-;1003:39;1089:2;1074:18;;;;1061:32;;-1:-1:-1;;;845:254:1:o;1478:328::-;1555:6;1563;1571;1624:2;1612:9;1603:7;1599:23;1595:32;1592:52;;;1640:1;1637;1630:12;1592:52;1663:29;1682:9;1663:29;:::i;:::-;1653:39;;1711:38;1745:2;1734:9;1730:18;1711:38;:::i;:::-;1701:48;;1796:2;1785:9;1781:18;1768:32;1758:42;;1478:328;;;;;:::o;2182:180::-;2241:6;2294:2;2282:9;2273:7;2269:23;2265:32;2262:52;;;2310:1;2307;2300:12;2262:52;-1:-1:-1;2333:23:1;;2182:180;-1:-1:-1;2182:180:1:o;2367:186::-;2426:6;2479:2;2467:9;2458:7;2454:23;2450:32;2447:52;;;2495:1;2492;2485:12;2447:52;2518:29;2537:9;2518:29;:::i;2963:1259::-;3369:3;3364;3360:13;3352:6;3348:26;3337:9;3330:45;3311:4;3394:2;3432:3;3427:2;3416:9;3412:18;3405:31;3459:46;3500:3;3489:9;3485:19;3477:6;3459:46;:::i;:::-;3553:9;3545:6;3541:22;3536:2;3525:9;3521:18;3514:50;3587:33;3613:6;3605;3587:33;:::i;:::-;3651:2;3636:18;;3629:34;;;-1:-1:-1;;;;;3700:32:1;;3694:3;3679:19;;3672:61;3720:3;3749:19;;3742:35;;;3814:22;;;3808:3;3793:19;;3786:51;3886:13;;3908:22;;;3984:15;;;;-1:-1:-1;3946:15:1;;;;-1:-1:-1;4027:169:1;4041:6;4038:1;4035:13;4027:169;;;4102:13;;4090:26;;4171:15;;;;4136:12;;;;4063:1;4056:9;4027:169;;;-1:-1:-1;4213:3:1;;2963:1259;-1:-1:-1;;;;;;;;;;;;2963:1259:1:o;4428:156::-;4494:20;;4554:4;4543:16;;4533:27;;4523:55;;4574:1;4571;4564:12;4589:531;4691:6;4699;4707;4715;4723;4731;4784:3;4772:9;4763:7;4759:23;4755:33;4752:53;;;4801:1;4798;4791:12;4752:53;4824:29;4843:9;4824:29;:::i;:::-;4814:39;;4900:2;4889:9;4885:18;4872:32;4862:42;;4951:2;4940:9;4936:18;4923:32;4913:42;;4974:36;5006:2;4995:9;4991:18;4974:36;:::i;:::-;4964:46;;5057:3;5046:9;5042:19;5029:33;5019:43;;5109:3;5098:9;5094:19;5081:33;5071:43;;4589:531;;;;;;;;:::o;5125:606::-;5236:6;5244;5252;5260;5268;5276;5284;5337:3;5325:9;5316:7;5312:23;5308:33;5305:53;;;5354:1;5351;5344:12;5305:53;5377:29;5396:9;5377:29;:::i;:::-;5367:39;;5425:38;5459:2;5448:9;5444:18;5425:38;:::i;:::-;5415:48;;5510:2;5499:9;5495:18;5482:32;5472:42;;5561:2;5550:9;5546:18;5533:32;5523:42;;5584:37;5616:3;5605:9;5601:19;5584:37;:::i;:::-;5574:47;;5668:3;5657:9;5653:19;5640:33;5630:43;;5720:3;5709:9;5705:19;5692:33;5682:43;;5125:606;;;;;;;;;;:::o;5736:260::-;5804:6;5812;5865:2;5853:9;5844:7;5840:23;5836:32;5833:52;;;5881:1;5878;5871:12;5833:52;5904:29;5923:9;5904:29;:::i;:::-;5894:39;;5952:38;5986:2;5975:9;5971:18;5952:38;:::i;:::-;5942:48;;5736:260;;;;;:::o;6001:350::-;6068:6;6076;6129:2;6117:9;6108:7;6104:23;6100:32;6097:52;;;6145:1;6142;6135:12;6097:52;6168:29;6187:9;6168:29;:::i;:::-;6158:39;;6247:2;6236:9;6232:18;6219:32;6291:10;6284:5;6280:22;6273:5;6270:33;6260:61;;6317:1;6314;6307:12;6260:61;6340:5;6330:15;;;6001:350;;;;;:::o;6717:380::-;6796:1;6792:12;;;;6839;;;6860:61;;6914:4;6906:6;6902:17;6892:27;;6860:61;6967:2;6959:6;6956:14;6936:18;6933:38;6930:161;;7013:10;7008:3;7004:20;7001:1;6994:31;7048:4;7045:1;7038:15;7076:4;7073:1;7066:15;6930:161;;6717:380;;;:::o;8833:127::-;8894:10;8889:3;8885:20;8882:1;8875:31;8925:4;8922:1;8915:15;8949:4;8946:1;8939:15;8965:182;-1:-1:-1;;;;;9072:10:1;;;9084;;;9068:27;;9107:11;;;9104:37;;;9121:18;;:::i;:::-;9104:37;8965:182;;;;:::o;9152:185::-;-1:-1:-1;;;;;9273:10:1;;;9261;;;9257:27;;9296:12;;;9293:38;;;9311:18;;:::i;9963:128::-;10030:9;;;10051:11;;;10048:37;;;10065:18;;:::i;10096:125::-;10161:9;;;10182:10;;;10179:36;;;10195:18;;:::i;10999:127::-;11060:10;11055:3;11051:20;11048:1;11041:31;11091:4;11088:1;11081:15;11115:4;11112:1;11105:15;12058:127;12119:10;12114:3;12110:20;12107:1;12100:31;12150:4;12147:1;12140:15;12174:4;12171:1;12164:15;12190:127;12251:10;12246:3;12242:20;12239:1;12232:31;12282:4;12279:1;12272:15;12306:4;12303:1;12296:15;12322:217;12362:1;12388;12378:132;;12432:10;12427:3;12423:20;12420:1;12413:31;12467:4;12464:1;12457:15;12495:4;12492:1;12485:15;12378:132;-1:-1:-1;12524:9:1;;12322:217::o
Swarm Source
ipfs://2c47e5fd32e706ad1f580a114db2812cf49b3f8ad83c58579bfa27b843c133c2
Loading...
Loading
Loading...
Loading
[ Download: CSV Export ]
[ Download: CSV Export ]
A token is a representation of an on-chain or off-chain asset. The token page shows information such as price, total supply, holders, transfers and social links. Learn more about this page in our Knowledge Base.