Token
GobsNFT (GOBS)
ERC-721
Overview
Max Total Supply
0 GOBS
Holders
1
Market
Onchain Market Cap
$0.00
Circulating Supply Market Cap
-
Other Info
Token Contract
Balance
1 GOBSLoading...
Loading
Loading...
Loading
Loading...
Loading
Contract Source Code Verified (Exact Match)
Contract Name:
Gobs
Compiler Version
v0.8.26+commit.8a97fa7a
Contract Source Code (Solidity)
/**
*Submitted for verification at curtis.apescan.io on 2024-12-21
*/
// File: @openzeppelin/contracts/utils/Base64.sol
// OpenZeppelin Contracts (last updated v5.1.0) (utils/Base64.sol)
pragma solidity ^0.8.20;
/**
* @dev Provides a set of functions to operate with Base64 strings.
*/
library Base64 {
/**
* @dev Base64 Encoding/Decoding Table
* See sections 4 and 5 of https://datatracker.ietf.org/doc/html/rfc4648
*/
string internal constant _TABLE = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
string internal constant _TABLE_URL = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_";
/**
* @dev Converts a `bytes` to its Bytes64 `string` representation.
*/
function encode(bytes memory data) internal pure returns (string memory) {
return _encode(data, _TABLE, true);
}
/**
* @dev Converts a `bytes` to its Bytes64Url `string` representation.
* Output is not padded with `=` as specified in https://www.rfc-editor.org/rfc/rfc4648[rfc4648].
*/
function encodeURL(bytes memory data) internal pure returns (string memory) {
return _encode(data, _TABLE_URL, false);
}
/**
* @dev Internal table-agnostic conversion
*/
function _encode(bytes memory data, string memory table, bool withPadding) private pure returns (string memory) {
/**
* Inspired by Brecht Devos (Brechtpd) implementation - MIT licence
* https://github.com/Brechtpd/base64/blob/e78d9fd951e7b0977ddca77d92dc85183770daf4/base64.sol
*/
if (data.length == 0) return "";
// If padding is enabled, the final length should be `bytes` data length divided by 3 rounded up and then
// multiplied by 4 so that it leaves room for padding the last chunk
// - `data.length + 2` -> Prepare for division rounding up
// - `/ 3` -> Number of 3-bytes chunks (rounded up)
// - `4 *` -> 4 characters for each chunk
// This is equivalent to: 4 * Math.ceil(data.length / 3)
//
// If padding is disabled, the final length should be `bytes` data length multiplied by 4/3 rounded up as
// opposed to when padding is required to fill the last chunk.
// - `4 * data.length` -> 4 characters for each chunk
// - ` + 2` -> Prepare for division rounding up
// - `/ 3` -> Number of 3-bytes chunks (rounded up)
// This is equivalent to: Math.ceil((4 * data.length) / 3)
uint256 resultLength = withPadding ? 4 * ((data.length + 2) / 3) : (4 * data.length + 2) / 3;
string memory result = new string(resultLength);
assembly ("memory-safe") {
// Prepare the lookup table (skip the first "length" byte)
let tablePtr := add(table, 1)
// Prepare result pointer, jump over length
let resultPtr := add(result, 0x20)
let dataPtr := data
let endPtr := add(data, mload(data))
// In some cases, the last iteration will read bytes after the end of the data. We cache the value, and
// set it to zero to make sure no dirty bytes are read in that section.
let afterPtr := add(endPtr, 0x20)
let afterCache := mload(afterPtr)
mstore(afterPtr, 0x00)
// Run over the input, 3 bytes at a time
for {
} lt(dataPtr, endPtr) {
} {
// Advance 3 bytes
dataPtr := add(dataPtr, 3)
let input := mload(dataPtr)
// To write each character, shift the 3 byte (24 bits) chunk
// 4 times in blocks of 6 bits for each character (18, 12, 6, 0)
// and apply logical AND with 0x3F to bitmask the least significant 6 bits.
// Use this as an index into the lookup table, mload an entire word
// so the desired character is in the least significant byte, and
// mstore8 this least significant byte into the result and continue.
mstore8(resultPtr, mload(add(tablePtr, and(shr(18, input), 0x3F))))
resultPtr := add(resultPtr, 1) // Advance
mstore8(resultPtr, mload(add(tablePtr, and(shr(12, input), 0x3F))))
resultPtr := add(resultPtr, 1) // Advance
mstore8(resultPtr, mload(add(tablePtr, and(shr(6, input), 0x3F))))
resultPtr := add(resultPtr, 1) // Advance
mstore8(resultPtr, mload(add(tablePtr, and(input, 0x3F))))
resultPtr := add(resultPtr, 1) // Advance
}
// Reset the value that was cached
mstore(afterPtr, afterCache)
if withPadding {
// When data `bytes` is not exactly 3 bytes long
// it is padded with `=` characters at the end
switch mod(mload(data), 3)
case 1 {
mstore8(sub(resultPtr, 1), 0x3d)
mstore8(sub(resultPtr, 2), 0x3d)
}
case 2 {
mstore8(sub(resultPtr, 1), 0x3d)
}
}
}
return result;
}
}
// File: @openzeppelin/contracts/utils/Panic.sol
// OpenZeppelin Contracts (last updated v5.1.0) (utils/Panic.sol)
pragma solidity ^0.8.20;
/**
* @dev Helper library for emitting standardized panic codes.
*
* ```solidity
* contract Example {
* using Panic for uint256;
*
* // Use any of the declared internal constants
* function foo() { Panic.GENERIC.panic(); }
*
* // Alternatively
* function foo() { Panic.panic(Panic.GENERIC); }
* }
* ```
*
* Follows the list from https://github.com/ethereum/solidity/blob/v0.8.24/libsolutil/ErrorCodes.h[libsolutil].
*
* _Available since v5.1._
*/
// slither-disable-next-line unused-state
library Panic {
/// @dev generic / unspecified error
uint256 internal constant GENERIC = 0x00;
/// @dev used by the assert() builtin
uint256 internal constant ASSERT = 0x01;
/// @dev arithmetic underflow or overflow
uint256 internal constant UNDER_OVERFLOW = 0x11;
/// @dev division or modulo by zero
uint256 internal constant DIVISION_BY_ZERO = 0x12;
/// @dev enum conversion error
uint256 internal constant ENUM_CONVERSION_ERROR = 0x21;
/// @dev invalid encoding in storage
uint256 internal constant STORAGE_ENCODING_ERROR = 0x22;
/// @dev empty array pop
uint256 internal constant EMPTY_ARRAY_POP = 0x31;
/// @dev array out of bounds access
uint256 internal constant ARRAY_OUT_OF_BOUNDS = 0x32;
/// @dev resource error (too large allocation or too large array)
uint256 internal constant RESOURCE_ERROR = 0x41;
/// @dev calling invalid internal function
uint256 internal constant INVALID_INTERNAL_FUNCTION = 0x51;
/// @dev Reverts with a panic code. Recommended to use with
/// the internal constants with predefined codes.
function panic(uint256 code) internal pure {
assembly ("memory-safe") {
mstore(0x00, 0x4e487b71)
mstore(0x20, code)
revert(0x1c, 0x24)
}
}
}
// File: @openzeppelin/contracts/utils/math/SafeCast.sol
// OpenZeppelin Contracts (last updated v5.1.0) (utils/math/SafeCast.sol)
// This file was procedurally generated from scripts/generate/templates/SafeCast.js.
pragma solidity ^0.8.20;
/**
* @dev Wrappers over Solidity's uintXX/intXX/bool casting operators with added overflow
* checks.
*
* Downcasting from uint256/int256 in Solidity does not revert on overflow. This can
* easily result in undesired exploitation or bugs, since developers usually
* assume that overflows raise errors. `SafeCast` restores this intuition by
* reverting the transaction when such an operation overflows.
*
* Using this library instead of the unchecked operations eliminates an entire
* class of bugs, so it's recommended to use it always.
*/
library SafeCast {
/**
* @dev Value doesn't fit in an uint of `bits` size.
*/
error SafeCastOverflowedUintDowncast(uint8 bits, uint256 value);
/**
* @dev An int value doesn't fit in an uint of `bits` size.
*/
error SafeCastOverflowedIntToUint(int256 value);
/**
* @dev Value doesn't fit in an int of `bits` size.
*/
error SafeCastOverflowedIntDowncast(uint8 bits, int256 value);
/**
* @dev An uint value doesn't fit in an int of `bits` size.
*/
error SafeCastOverflowedUintToInt(uint256 value);
/**
* @dev Returns the downcasted uint248 from uint256, reverting on
* overflow (when the input is greater than largest uint248).
*
* Counterpart to Solidity's `uint248` operator.
*
* Requirements:
*
* - input must fit into 248 bits
*/
function toUint248(uint256 value) internal pure returns (uint248) {
if (value > type(uint248).max) {
revert SafeCastOverflowedUintDowncast(248, value);
}
return uint248(value);
}
/**
* @dev Returns the downcasted uint240 from uint256, reverting on
* overflow (when the input is greater than largest uint240).
*
* Counterpart to Solidity's `uint240` operator.
*
* Requirements:
*
* - input must fit into 240 bits
*/
function toUint240(uint256 value) internal pure returns (uint240) {
if (value > type(uint240).max) {
revert SafeCastOverflowedUintDowncast(240, value);
}
return uint240(value);
}
/**
* @dev Returns the downcasted uint232 from uint256, reverting on
* overflow (when the input is greater than largest uint232).
*
* Counterpart to Solidity's `uint232` operator.
*
* Requirements:
*
* - input must fit into 232 bits
*/
function toUint232(uint256 value) internal pure returns (uint232) {
if (value > type(uint232).max) {
revert SafeCastOverflowedUintDowncast(232, value);
}
return uint232(value);
}
/**
* @dev Returns the downcasted uint224 from uint256, reverting on
* overflow (when the input is greater than largest uint224).
*
* Counterpart to Solidity's `uint224` operator.
*
* Requirements:
*
* - input must fit into 224 bits
*/
function toUint224(uint256 value) internal pure returns (uint224) {
if (value > type(uint224).max) {
revert SafeCastOverflowedUintDowncast(224, value);
}
return uint224(value);
}
/**
* @dev Returns the downcasted uint216 from uint256, reverting on
* overflow (when the input is greater than largest uint216).
*
* Counterpart to Solidity's `uint216` operator.
*
* Requirements:
*
* - input must fit into 216 bits
*/
function toUint216(uint256 value) internal pure returns (uint216) {
if (value > type(uint216).max) {
revert SafeCastOverflowedUintDowncast(216, value);
}
return uint216(value);
}
/**
* @dev Returns the downcasted uint208 from uint256, reverting on
* overflow (when the input is greater than largest uint208).
*
* Counterpart to Solidity's `uint208` operator.
*
* Requirements:
*
* - input must fit into 208 bits
*/
function toUint208(uint256 value) internal pure returns (uint208) {
if (value > type(uint208).max) {
revert SafeCastOverflowedUintDowncast(208, value);
}
return uint208(value);
}
/**
* @dev Returns the downcasted uint200 from uint256, reverting on
* overflow (when the input is greater than largest uint200).
*
* Counterpart to Solidity's `uint200` operator.
*
* Requirements:
*
* - input must fit into 200 bits
*/
function toUint200(uint256 value) internal pure returns (uint200) {
if (value > type(uint200).max) {
revert SafeCastOverflowedUintDowncast(200, value);
}
return uint200(value);
}
/**
* @dev Returns the downcasted uint192 from uint256, reverting on
* overflow (when the input is greater than largest uint192).
*
* Counterpart to Solidity's `uint192` operator.
*
* Requirements:
*
* - input must fit into 192 bits
*/
function toUint192(uint256 value) internal pure returns (uint192) {
if (value > type(uint192).max) {
revert SafeCastOverflowedUintDowncast(192, value);
}
return uint192(value);
}
/**
* @dev Returns the downcasted uint184 from uint256, reverting on
* overflow (when the input is greater than largest uint184).
*
* Counterpart to Solidity's `uint184` operator.
*
* Requirements:
*
* - input must fit into 184 bits
*/
function toUint184(uint256 value) internal pure returns (uint184) {
if (value > type(uint184).max) {
revert SafeCastOverflowedUintDowncast(184, value);
}
return uint184(value);
}
/**
* @dev Returns the downcasted uint176 from uint256, reverting on
* overflow (when the input is greater than largest uint176).
*
* Counterpart to Solidity's `uint176` operator.
*
* Requirements:
*
* - input must fit into 176 bits
*/
function toUint176(uint256 value) internal pure returns (uint176) {
if (value > type(uint176).max) {
revert SafeCastOverflowedUintDowncast(176, value);
}
return uint176(value);
}
/**
* @dev Returns the downcasted uint168 from uint256, reverting on
* overflow (when the input is greater than largest uint168).
*
* Counterpart to Solidity's `uint168` operator.
*
* Requirements:
*
* - input must fit into 168 bits
*/
function toUint168(uint256 value) internal pure returns (uint168) {
if (value > type(uint168).max) {
revert SafeCastOverflowedUintDowncast(168, value);
}
return uint168(value);
}
/**
* @dev Returns the downcasted uint160 from uint256, reverting on
* overflow (when the input is greater than largest uint160).
*
* Counterpart to Solidity's `uint160` operator.
*
* Requirements:
*
* - input must fit into 160 bits
*/
function toUint160(uint256 value) internal pure returns (uint160) {
if (value > type(uint160).max) {
revert SafeCastOverflowedUintDowncast(160, value);
}
return uint160(value);
}
/**
* @dev Returns the downcasted uint152 from uint256, reverting on
* overflow (when the input is greater than largest uint152).
*
* Counterpart to Solidity's `uint152` operator.
*
* Requirements:
*
* - input must fit into 152 bits
*/
function toUint152(uint256 value) internal pure returns (uint152) {
if (value > type(uint152).max) {
revert SafeCastOverflowedUintDowncast(152, value);
}
return uint152(value);
}
/**
* @dev Returns the downcasted uint144 from uint256, reverting on
* overflow (when the input is greater than largest uint144).
*
* Counterpart to Solidity's `uint144` operator.
*
* Requirements:
*
* - input must fit into 144 bits
*/
function toUint144(uint256 value) internal pure returns (uint144) {
if (value > type(uint144).max) {
revert SafeCastOverflowedUintDowncast(144, value);
}
return uint144(value);
}
/**
* @dev Returns the downcasted uint136 from uint256, reverting on
* overflow (when the input is greater than largest uint136).
*
* Counterpart to Solidity's `uint136` operator.
*
* Requirements:
*
* - input must fit into 136 bits
*/
function toUint136(uint256 value) internal pure returns (uint136) {
if (value > type(uint136).max) {
revert SafeCastOverflowedUintDowncast(136, value);
}
return uint136(value);
}
/**
* @dev Returns the downcasted uint128 from uint256, reverting on
* overflow (when the input is greater than largest uint128).
*
* Counterpart to Solidity's `uint128` operator.
*
* Requirements:
*
* - input must fit into 128 bits
*/
function toUint128(uint256 value) internal pure returns (uint128) {
if (value > type(uint128).max) {
revert SafeCastOverflowedUintDowncast(128, value);
}
return uint128(value);
}
/**
* @dev Returns the downcasted uint120 from uint256, reverting on
* overflow (when the input is greater than largest uint120).
*
* Counterpart to Solidity's `uint120` operator.
*
* Requirements:
*
* - input must fit into 120 bits
*/
function toUint120(uint256 value) internal pure returns (uint120) {
if (value > type(uint120).max) {
revert SafeCastOverflowedUintDowncast(120, value);
}
return uint120(value);
}
/**
* @dev Returns the downcasted uint112 from uint256, reverting on
* overflow (when the input is greater than largest uint112).
*
* Counterpart to Solidity's `uint112` operator.
*
* Requirements:
*
* - input must fit into 112 bits
*/
function toUint112(uint256 value) internal pure returns (uint112) {
if (value > type(uint112).max) {
revert SafeCastOverflowedUintDowncast(112, value);
}
return uint112(value);
}
/**
* @dev Returns the downcasted uint104 from uint256, reverting on
* overflow (when the input is greater than largest uint104).
*
* Counterpart to Solidity's `uint104` operator.
*
* Requirements:
*
* - input must fit into 104 bits
*/
function toUint104(uint256 value) internal pure returns (uint104) {
if (value > type(uint104).max) {
revert SafeCastOverflowedUintDowncast(104, value);
}
return uint104(value);
}
/**
* @dev Returns the downcasted uint96 from uint256, reverting on
* overflow (when the input is greater than largest uint96).
*
* Counterpart to Solidity's `uint96` operator.
*
* Requirements:
*
* - input must fit into 96 bits
*/
function toUint96(uint256 value) internal pure returns (uint96) {
if (value > type(uint96).max) {
revert SafeCastOverflowedUintDowncast(96, value);
}
return uint96(value);
}
/**
* @dev Returns the downcasted uint88 from uint256, reverting on
* overflow (when the input is greater than largest uint88).
*
* Counterpart to Solidity's `uint88` operator.
*
* Requirements:
*
* - input must fit into 88 bits
*/
function toUint88(uint256 value) internal pure returns (uint88) {
if (value > type(uint88).max) {
revert SafeCastOverflowedUintDowncast(88, value);
}
return uint88(value);
}
/**
* @dev Returns the downcasted uint80 from uint256, reverting on
* overflow (when the input is greater than largest uint80).
*
* Counterpart to Solidity's `uint80` operator.
*
* Requirements:
*
* - input must fit into 80 bits
*/
function toUint80(uint256 value) internal pure returns (uint80) {
if (value > type(uint80).max) {
revert SafeCastOverflowedUintDowncast(80, value);
}
return uint80(value);
}
/**
* @dev Returns the downcasted uint72 from uint256, reverting on
* overflow (when the input is greater than largest uint72).
*
* Counterpart to Solidity's `uint72` operator.
*
* Requirements:
*
* - input must fit into 72 bits
*/
function toUint72(uint256 value) internal pure returns (uint72) {
if (value > type(uint72).max) {
revert SafeCastOverflowedUintDowncast(72, value);
}
return uint72(value);
}
/**
* @dev Returns the downcasted uint64 from uint256, reverting on
* overflow (when the input is greater than largest uint64).
*
* Counterpart to Solidity's `uint64` operator.
*
* Requirements:
*
* - input must fit into 64 bits
*/
function toUint64(uint256 value) internal pure returns (uint64) {
if (value > type(uint64).max) {
revert SafeCastOverflowedUintDowncast(64, value);
}
return uint64(value);
}
/**
* @dev Returns the downcasted uint56 from uint256, reverting on
* overflow (when the input is greater than largest uint56).
*
* Counterpart to Solidity's `uint56` operator.
*
* Requirements:
*
* - input must fit into 56 bits
*/
function toUint56(uint256 value) internal pure returns (uint56) {
if (value > type(uint56).max) {
revert SafeCastOverflowedUintDowncast(56, value);
}
return uint56(value);
}
/**
* @dev Returns the downcasted uint48 from uint256, reverting on
* overflow (when the input is greater than largest uint48).
*
* Counterpart to Solidity's `uint48` operator.
*
* Requirements:
*
* - input must fit into 48 bits
*/
function toUint48(uint256 value) internal pure returns (uint48) {
if (value > type(uint48).max) {
revert SafeCastOverflowedUintDowncast(48, value);
}
return uint48(value);
}
/**
* @dev Returns the downcasted uint40 from uint256, reverting on
* overflow (when the input is greater than largest uint40).
*
* Counterpart to Solidity's `uint40` operator.
*
* Requirements:
*
* - input must fit into 40 bits
*/
function toUint40(uint256 value) internal pure returns (uint40) {
if (value > type(uint40).max) {
revert SafeCastOverflowedUintDowncast(40, value);
}
return uint40(value);
}
/**
* @dev Returns the downcasted uint32 from uint256, reverting on
* overflow (when the input is greater than largest uint32).
*
* Counterpart to Solidity's `uint32` operator.
*
* Requirements:
*
* - input must fit into 32 bits
*/
function toUint32(uint256 value) internal pure returns (uint32) {
if (value > type(uint32).max) {
revert SafeCastOverflowedUintDowncast(32, value);
}
return uint32(value);
}
/**
* @dev Returns the downcasted uint24 from uint256, reverting on
* overflow (when the input is greater than largest uint24).
*
* Counterpart to Solidity's `uint24` operator.
*
* Requirements:
*
* - input must fit into 24 bits
*/
function toUint24(uint256 value) internal pure returns (uint24) {
if (value > type(uint24).max) {
revert SafeCastOverflowedUintDowncast(24, value);
}
return uint24(value);
}
/**
* @dev Returns the downcasted uint16 from uint256, reverting on
* overflow (when the input is greater than largest uint16).
*
* Counterpart to Solidity's `uint16` operator.
*
* Requirements:
*
* - input must fit into 16 bits
*/
function toUint16(uint256 value) internal pure returns (uint16) {
if (value > type(uint16).max) {
revert SafeCastOverflowedUintDowncast(16, value);
}
return uint16(value);
}
/**
* @dev Returns the downcasted uint8 from uint256, reverting on
* overflow (when the input is greater than largest uint8).
*
* Counterpart to Solidity's `uint8` operator.
*
* Requirements:
*
* - input must fit into 8 bits
*/
function toUint8(uint256 value) internal pure returns (uint8) {
if (value > type(uint8).max) {
revert SafeCastOverflowedUintDowncast(8, value);
}
return uint8(value);
}
/**
* @dev Converts a signed int256 into an unsigned uint256.
*
* Requirements:
*
* - input must be greater than or equal to 0.
*/
function toUint256(int256 value) internal pure returns (uint256) {
if (value < 0) {
revert SafeCastOverflowedIntToUint(value);
}
return uint256(value);
}
/**
* @dev Returns the downcasted int248 from int256, reverting on
* overflow (when the input is less than smallest int248 or
* greater than largest int248).
*
* Counterpart to Solidity's `int248` operator.
*
* Requirements:
*
* - input must fit into 248 bits
*/
function toInt248(int256 value) internal pure returns (int248 downcasted) {
downcasted = int248(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(248, value);
}
}
/**
* @dev Returns the downcasted int240 from int256, reverting on
* overflow (when the input is less than smallest int240 or
* greater than largest int240).
*
* Counterpart to Solidity's `int240` operator.
*
* Requirements:
*
* - input must fit into 240 bits
*/
function toInt240(int256 value) internal pure returns (int240 downcasted) {
downcasted = int240(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(240, value);
}
}
/**
* @dev Returns the downcasted int232 from int256, reverting on
* overflow (when the input is less than smallest int232 or
* greater than largest int232).
*
* Counterpart to Solidity's `int232` operator.
*
* Requirements:
*
* - input must fit into 232 bits
*/
function toInt232(int256 value) internal pure returns (int232 downcasted) {
downcasted = int232(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(232, value);
}
}
/**
* @dev Returns the downcasted int224 from int256, reverting on
* overflow (when the input is less than smallest int224 or
* greater than largest int224).
*
* Counterpart to Solidity's `int224` operator.
*
* Requirements:
*
* - input must fit into 224 bits
*/
function toInt224(int256 value) internal pure returns (int224 downcasted) {
downcasted = int224(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(224, value);
}
}
/**
* @dev Returns the downcasted int216 from int256, reverting on
* overflow (when the input is less than smallest int216 or
* greater than largest int216).
*
* Counterpart to Solidity's `int216` operator.
*
* Requirements:
*
* - input must fit into 216 bits
*/
function toInt216(int256 value) internal pure returns (int216 downcasted) {
downcasted = int216(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(216, value);
}
}
/**
* @dev Returns the downcasted int208 from int256, reverting on
* overflow (when the input is less than smallest int208 or
* greater than largest int208).
*
* Counterpart to Solidity's `int208` operator.
*
* Requirements:
*
* - input must fit into 208 bits
*/
function toInt208(int256 value) internal pure returns (int208 downcasted) {
downcasted = int208(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(208, value);
}
}
/**
* @dev Returns the downcasted int200 from int256, reverting on
* overflow (when the input is less than smallest int200 or
* greater than largest int200).
*
* Counterpart to Solidity's `int200` operator.
*
* Requirements:
*
* - input must fit into 200 bits
*/
function toInt200(int256 value) internal pure returns (int200 downcasted) {
downcasted = int200(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(200, value);
}
}
/**
* @dev Returns the downcasted int192 from int256, reverting on
* overflow (when the input is less than smallest int192 or
* greater than largest int192).
*
* Counterpart to Solidity's `int192` operator.
*
* Requirements:
*
* - input must fit into 192 bits
*/
function toInt192(int256 value) internal pure returns (int192 downcasted) {
downcasted = int192(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(192, value);
}
}
/**
* @dev Returns the downcasted int184 from int256, reverting on
* overflow (when the input is less than smallest int184 or
* greater than largest int184).
*
* Counterpart to Solidity's `int184` operator.
*
* Requirements:
*
* - input must fit into 184 bits
*/
function toInt184(int256 value) internal pure returns (int184 downcasted) {
downcasted = int184(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(184, value);
}
}
/**
* @dev Returns the downcasted int176 from int256, reverting on
* overflow (when the input is less than smallest int176 or
* greater than largest int176).
*
* Counterpart to Solidity's `int176` operator.
*
* Requirements:
*
* - input must fit into 176 bits
*/
function toInt176(int256 value) internal pure returns (int176 downcasted) {
downcasted = int176(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(176, value);
}
}
/**
* @dev Returns the downcasted int168 from int256, reverting on
* overflow (when the input is less than smallest int168 or
* greater than largest int168).
*
* Counterpart to Solidity's `int168` operator.
*
* Requirements:
*
* - input must fit into 168 bits
*/
function toInt168(int256 value) internal pure returns (int168 downcasted) {
downcasted = int168(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(168, value);
}
}
/**
* @dev Returns the downcasted int160 from int256, reverting on
* overflow (when the input is less than smallest int160 or
* greater than largest int160).
*
* Counterpart to Solidity's `int160` operator.
*
* Requirements:
*
* - input must fit into 160 bits
*/
function toInt160(int256 value) internal pure returns (int160 downcasted) {
downcasted = int160(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(160, value);
}
}
/**
* @dev Returns the downcasted int152 from int256, reverting on
* overflow (when the input is less than smallest int152 or
* greater than largest int152).
*
* Counterpart to Solidity's `int152` operator.
*
* Requirements:
*
* - input must fit into 152 bits
*/
function toInt152(int256 value) internal pure returns (int152 downcasted) {
downcasted = int152(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(152, value);
}
}
/**
* @dev Returns the downcasted int144 from int256, reverting on
* overflow (when the input is less than smallest int144 or
* greater than largest int144).
*
* Counterpart to Solidity's `int144` operator.
*
* Requirements:
*
* - input must fit into 144 bits
*/
function toInt144(int256 value) internal pure returns (int144 downcasted) {
downcasted = int144(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(144, value);
}
}
/**
* @dev Returns the downcasted int136 from int256, reverting on
* overflow (when the input is less than smallest int136 or
* greater than largest int136).
*
* Counterpart to Solidity's `int136` operator.
*
* Requirements:
*
* - input must fit into 136 bits
*/
function toInt136(int256 value) internal pure returns (int136 downcasted) {
downcasted = int136(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(136, value);
}
}
/**
* @dev Returns the downcasted int128 from int256, reverting on
* overflow (when the input is less than smallest int128 or
* greater than largest int128).
*
* Counterpart to Solidity's `int128` operator.
*
* Requirements:
*
* - input must fit into 128 bits
*/
function toInt128(int256 value) internal pure returns (int128 downcasted) {
downcasted = int128(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(128, value);
}
}
/**
* @dev Returns the downcasted int120 from int256, reverting on
* overflow (when the input is less than smallest int120 or
* greater than largest int120).
*
* Counterpart to Solidity's `int120` operator.
*
* Requirements:
*
* - input must fit into 120 bits
*/
function toInt120(int256 value) internal pure returns (int120 downcasted) {
downcasted = int120(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(120, value);
}
}
/**
* @dev Returns the downcasted int112 from int256, reverting on
* overflow (when the input is less than smallest int112 or
* greater than largest int112).
*
* Counterpart to Solidity's `int112` operator.
*
* Requirements:
*
* - input must fit into 112 bits
*/
function toInt112(int256 value) internal pure returns (int112 downcasted) {
downcasted = int112(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(112, value);
}
}
/**
* @dev Returns the downcasted int104 from int256, reverting on
* overflow (when the input is less than smallest int104 or
* greater than largest int104).
*
* Counterpart to Solidity's `int104` operator.
*
* Requirements:
*
* - input must fit into 104 bits
*/
function toInt104(int256 value) internal pure returns (int104 downcasted) {
downcasted = int104(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(104, value);
}
}
/**
* @dev Returns the downcasted int96 from int256, reverting on
* overflow (when the input is less than smallest int96 or
* greater than largest int96).
*
* Counterpart to Solidity's `int96` operator.
*
* Requirements:
*
* - input must fit into 96 bits
*/
function toInt96(int256 value) internal pure returns (int96 downcasted) {
downcasted = int96(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(96, value);
}
}
/**
* @dev Returns the downcasted int88 from int256, reverting on
* overflow (when the input is less than smallest int88 or
* greater than largest int88).
*
* Counterpart to Solidity's `int88` operator.
*
* Requirements:
*
* - input must fit into 88 bits
*/
function toInt88(int256 value) internal pure returns (int88 downcasted) {
downcasted = int88(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(88, value);
}
}
/**
* @dev Returns the downcasted int80 from int256, reverting on
* overflow (when the input is less than smallest int80 or
* greater than largest int80).
*
* Counterpart to Solidity's `int80` operator.
*
* Requirements:
*
* - input must fit into 80 bits
*/
function toInt80(int256 value) internal pure returns (int80 downcasted) {
downcasted = int80(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(80, value);
}
}
/**
* @dev Returns the downcasted int72 from int256, reverting on
* overflow (when the input is less than smallest int72 or
* greater than largest int72).
*
* Counterpart to Solidity's `int72` operator.
*
* Requirements:
*
* - input must fit into 72 bits
*/
function toInt72(int256 value) internal pure returns (int72 downcasted) {
downcasted = int72(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(72, value);
}
}
/**
* @dev Returns the downcasted int64 from int256, reverting on
* overflow (when the input is less than smallest int64 or
* greater than largest int64).
*
* Counterpart to Solidity's `int64` operator.
*
* Requirements:
*
* - input must fit into 64 bits
*/
function toInt64(int256 value) internal pure returns (int64 downcasted) {
downcasted = int64(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(64, value);
}
}
/**
* @dev Returns the downcasted int56 from int256, reverting on
* overflow (when the input is less than smallest int56 or
* greater than largest int56).
*
* Counterpart to Solidity's `int56` operator.
*
* Requirements:
*
* - input must fit into 56 bits
*/
function toInt56(int256 value) internal pure returns (int56 downcasted) {
downcasted = int56(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(56, value);
}
}
/**
* @dev Returns the downcasted int48 from int256, reverting on
* overflow (when the input is less than smallest int48 or
* greater than largest int48).
*
* Counterpart to Solidity's `int48` operator.
*
* Requirements:
*
* - input must fit into 48 bits
*/
function toInt48(int256 value) internal pure returns (int48 downcasted) {
downcasted = int48(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(48, value);
}
}
/**
* @dev Returns the downcasted int40 from int256, reverting on
* overflow (when the input is less than smallest int40 or
* greater than largest int40).
*
* Counterpart to Solidity's `int40` operator.
*
* Requirements:
*
* - input must fit into 40 bits
*/
function toInt40(int256 value) internal pure returns (int40 downcasted) {
downcasted = int40(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(40, value);
}
}
/**
* @dev Returns the downcasted int32 from int256, reverting on
* overflow (when the input is less than smallest int32 or
* greater than largest int32).
*
* Counterpart to Solidity's `int32` operator.
*
* Requirements:
*
* - input must fit into 32 bits
*/
function toInt32(int256 value) internal pure returns (int32 downcasted) {
downcasted = int32(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(32, value);
}
}
/**
* @dev Returns the downcasted int24 from int256, reverting on
* overflow (when the input is less than smallest int24 or
* greater than largest int24).
*
* Counterpart to Solidity's `int24` operator.
*
* Requirements:
*
* - input must fit into 24 bits
*/
function toInt24(int256 value) internal pure returns (int24 downcasted) {
downcasted = int24(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(24, value);
}
}
/**
* @dev Returns the downcasted int16 from int256, reverting on
* overflow (when the input is less than smallest int16 or
* greater than largest int16).
*
* Counterpart to Solidity's `int16` operator.
*
* Requirements:
*
* - input must fit into 16 bits
*/
function toInt16(int256 value) internal pure returns (int16 downcasted) {
downcasted = int16(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(16, value);
}
}
/**
* @dev Returns the downcasted int8 from int256, reverting on
* overflow (when the input is less than smallest int8 or
* greater than largest int8).
*
* Counterpart to Solidity's `int8` operator.
*
* Requirements:
*
* - input must fit into 8 bits
*/
function toInt8(int256 value) internal pure returns (int8 downcasted) {
downcasted = int8(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(8, value);
}
}
/**
* @dev Converts an unsigned uint256 into a signed int256.
*
* Requirements:
*
* - input must be less than or equal to maxInt256.
*/
function toInt256(uint256 value) internal pure returns (int256) {
// Note: Unsafe cast below is okay because `type(int256).max` is guaranteed to be positive
if (value > uint256(type(int256).max)) {
revert SafeCastOverflowedUintToInt(value);
}
return int256(value);
}
/**
* @dev Cast a boolean (false or true) to a uint256 (0 or 1) with no jump.
*/
function toUint(bool b) internal pure returns (uint256 u) {
assembly ("memory-safe") {
u := iszero(iszero(b))
}
}
}
// File: @openzeppelin/contracts/utils/math/Math.sol
// OpenZeppelin Contracts (last updated v5.1.0) (utils/math/Math.sol)
pragma solidity ^0.8.20;
/**
* @dev Standard math utilities missing in the Solidity language.
*/
library Math {
enum Rounding {
Floor, // Toward negative infinity
Ceil, // Toward positive infinity
Trunc, // Toward zero
Expand // Away from zero
}
/**
* @dev Returns the addition of two unsigned integers, with an success flag (no overflow).
*/
function tryAdd(uint256 a, uint256 b) internal pure returns (bool success, uint256 result) {
unchecked {
uint256 c = a + b;
if (c < a) return (false, 0);
return (true, c);
}
}
/**
* @dev Returns the subtraction of two unsigned integers, with an success flag (no overflow).
*/
function trySub(uint256 a, uint256 b) internal pure returns (bool success, uint256 result) {
unchecked {
if (b > a) return (false, 0);
return (true, a - b);
}
}
/**
* @dev Returns the multiplication of two unsigned integers, with an success flag (no overflow).
*/
function tryMul(uint256 a, uint256 b) internal pure returns (bool success, uint256 result) {
unchecked {
// Gas optimization: this is cheaper than requiring 'a' not being zero, but the
// benefit is lost if 'b' is also tested.
// See: https://github.com/OpenZeppelin/openzeppelin-contracts/pull/522
if (a == 0) return (true, 0);
uint256 c = a * b;
if (c / a != b) return (false, 0);
return (true, c);
}
}
/**
* @dev Returns the division of two unsigned integers, with a success flag (no division by zero).
*/
function tryDiv(uint256 a, uint256 b) internal pure returns (bool success, uint256 result) {
unchecked {
if (b == 0) return (false, 0);
return (true, a / b);
}
}
/**
* @dev Returns the remainder of dividing two unsigned integers, with a success flag (no division by zero).
*/
function tryMod(uint256 a, uint256 b) internal pure returns (bool success, uint256 result) {
unchecked {
if (b == 0) return (false, 0);
return (true, a % b);
}
}
/**
* @dev Branchless ternary evaluation for `a ? b : c`. Gas costs are constant.
*
* IMPORTANT: This function may reduce bytecode size and consume less gas when used standalone.
* However, the compiler may optimize Solidity ternary operations (i.e. `a ? b : c`) to only compute
* one branch when needed, making this function more expensive.
*/
function ternary(bool condition, uint256 a, uint256 b) internal pure returns (uint256) {
unchecked {
// branchless ternary works because:
// b ^ (a ^ b) == a
// b ^ 0 == b
return b ^ ((a ^ b) * SafeCast.toUint(condition));
}
}
/**
* @dev Returns the largest of two numbers.
*/
function max(uint256 a, uint256 b) internal pure returns (uint256) {
return ternary(a > b, a, b);
}
/**
* @dev Returns the smallest of two numbers.
*/
function min(uint256 a, uint256 b) internal pure returns (uint256) {
return ternary(a < b, a, b);
}
/**
* @dev Returns the average of two numbers. The result is rounded towards
* zero.
*/
function average(uint256 a, uint256 b) internal pure returns (uint256) {
// (a + b) / 2 can overflow.
return (a & b) + (a ^ b) / 2;
}
/**
* @dev Returns the ceiling of the division of two numbers.
*
* This differs from standard division with `/` in that it rounds towards infinity instead
* of rounding towards zero.
*/
function ceilDiv(uint256 a, uint256 b) internal pure returns (uint256) {
if (b == 0) {
// Guarantee the same behavior as in a regular Solidity division.
Panic.panic(Panic.DIVISION_BY_ZERO);
}
// The following calculation ensures accurate ceiling division without overflow.
// Since a is non-zero, (a - 1) / b will not overflow.
// The largest possible result occurs when (a - 1) / b is type(uint256).max,
// but the largest value we can obtain is type(uint256).max - 1, which happens
// when a = type(uint256).max and b = 1.
unchecked {
return SafeCast.toUint(a > 0) * ((a - 1) / b + 1);
}
}
/**
* @dev Calculates floor(x * y / denominator) with full precision. Throws if result overflows a uint256 or
* denominator == 0.
*
* Original credit to Remco Bloemen under MIT license (https://xn--2-umb.com/21/muldiv) with further edits by
* Uniswap Labs also under MIT license.
*/
function mulDiv(uint256 x, uint256 y, uint256 denominator) internal pure returns (uint256 result) {
unchecked {
// 512-bit multiply [prod1 prod0] = x * y. Compute the product mod 2²⁵⁶ and mod 2²⁵⁶ - 1, then use
// the Chinese Remainder Theorem to reconstruct the 512 bit result. The result is stored in two 256
// variables such that product = prod1 * 2²⁵⁶ + prod0.
uint256 prod0 = x * y; // Least significant 256 bits of the product
uint256 prod1; // Most significant 256 bits of the product
assembly {
let mm := mulmod(x, y, not(0))
prod1 := sub(sub(mm, prod0), lt(mm, prod0))
}
// Handle non-overflow cases, 256 by 256 division.
if (prod1 == 0) {
// Solidity will revert if denominator == 0, unlike the div opcode on its own.
// The surrounding unchecked block does not change this fact.
// See https://docs.soliditylang.org/en/latest/control-structures.html#checked-or-unchecked-arithmetic.
return prod0 / denominator;
}
// Make sure the result is less than 2²⁵⁶. Also prevents denominator == 0.
if (denominator <= prod1) {
Panic.panic(ternary(denominator == 0, Panic.DIVISION_BY_ZERO, Panic.UNDER_OVERFLOW));
}
///////////////////////////////////////////////
// 512 by 256 division.
///////////////////////////////////////////////
// Make division exact by subtracting the remainder from [prod1 prod0].
uint256 remainder;
assembly {
// Compute remainder using mulmod.
remainder := mulmod(x, y, denominator)
// Subtract 256 bit number from 512 bit number.
prod1 := sub(prod1, gt(remainder, prod0))
prod0 := sub(prod0, remainder)
}
// Factor powers of two out of denominator and compute largest power of two divisor of denominator.
// Always >= 1. See https://cs.stackexchange.com/q/138556/92363.
uint256 twos = denominator & (0 - denominator);
assembly {
// Divide denominator by twos.
denominator := div(denominator, twos)
// Divide [prod1 prod0] by twos.
prod0 := div(prod0, twos)
// Flip twos such that it is 2²⁵⁶ / twos. If twos is zero, then it becomes one.
twos := add(div(sub(0, twos), twos), 1)
}
// Shift in bits from prod1 into prod0.
prod0 |= prod1 * twos;
// Invert denominator mod 2²⁵⁶. Now that denominator is an odd number, it has an inverse modulo 2²⁵⁶ such
// that denominator * inv ≡ 1 mod 2²⁵⁶. Compute the inverse by starting with a seed that is correct for
// four bits. That is, denominator * inv ≡ 1 mod 2⁴.
uint256 inverse = (3 * denominator) ^ 2;
// Use the Newton-Raphson iteration to improve the precision. Thanks to Hensel's lifting lemma, this also
// works in modular arithmetic, doubling the correct bits in each step.
inverse *= 2 - denominator * inverse; // inverse mod 2⁸
inverse *= 2 - denominator * inverse; // inverse mod 2¹⁶
inverse *= 2 - denominator * inverse; // inverse mod 2³²
inverse *= 2 - denominator * inverse; // inverse mod 2⁶⁴
inverse *= 2 - denominator * inverse; // inverse mod 2¹²⁸
inverse *= 2 - denominator * inverse; // inverse mod 2²⁵⁶
// Because the division is now exact we can divide by multiplying with the modular inverse of denominator.
// This will give us the correct result modulo 2²⁵⁶. Since the preconditions guarantee that the outcome is
// less than 2²⁵⁶, this is the final result. We don't need to compute the high bits of the result and prod1
// is no longer required.
result = prod0 * inverse;
return result;
}
}
/**
* @dev Calculates x * y / denominator with full precision, following the selected rounding direction.
*/
function mulDiv(uint256 x, uint256 y, uint256 denominator, Rounding rounding) internal pure returns (uint256) {
return mulDiv(x, y, denominator) + SafeCast.toUint(unsignedRoundsUp(rounding) && mulmod(x, y, denominator) > 0);
}
/**
* @dev Calculate the modular multiplicative inverse of a number in Z/nZ.
*
* If n is a prime, then Z/nZ is a field. In that case all elements are inversible, except 0.
* If n is not a prime, then Z/nZ is not a field, and some elements might not be inversible.
*
* If the input value is not inversible, 0 is returned.
*
* NOTE: If you know for sure that n is (big) a prime, it may be cheaper to use Fermat's little theorem and get the
* inverse using `Math.modExp(a, n - 2, n)`. See {invModPrime}.
*/
function invMod(uint256 a, uint256 n) internal pure returns (uint256) {
unchecked {
if (n == 0) return 0;
// The inverse modulo is calculated using the Extended Euclidean Algorithm (iterative version)
// Used to compute integers x and y such that: ax + ny = gcd(a, n).
// When the gcd is 1, then the inverse of a modulo n exists and it's x.
// ax + ny = 1
// ax = 1 + (-y)n
// ax ≡ 1 (mod n) # x is the inverse of a modulo n
// If the remainder is 0 the gcd is n right away.
uint256 remainder = a % n;
uint256 gcd = n;
// Therefore the initial coefficients are:
// ax + ny = gcd(a, n) = n
// 0a + 1n = n
int256 x = 0;
int256 y = 1;
while (remainder != 0) {
uint256 quotient = gcd / remainder;
(gcd, remainder) = (
// The old remainder is the next gcd to try.
remainder,
// Compute the next remainder.
// Can't overflow given that (a % gcd) * (gcd // (a % gcd)) <= gcd
// where gcd is at most n (capped to type(uint256).max)
gcd - remainder * quotient
);
(x, y) = (
// Increment the coefficient of a.
y,
// Decrement the coefficient of n.
// Can overflow, but the result is casted to uint256 so that the
// next value of y is "wrapped around" to a value between 0 and n - 1.
x - y * int256(quotient)
);
}
if (gcd != 1) return 0; // No inverse exists.
return ternary(x < 0, n - uint256(-x), uint256(x)); // Wrap the result if it's negative.
}
}
/**
* @dev Variant of {invMod}. More efficient, but only works if `p` is known to be a prime greater than `2`.
*
* From https://en.wikipedia.org/wiki/Fermat%27s_little_theorem[Fermat's little theorem], we know that if p is
* prime, then `a**(p-1) ≡ 1 mod p`. As a consequence, we have `a * a**(p-2) ≡ 1 mod p`, which means that
* `a**(p-2)` is the modular multiplicative inverse of a in Fp.
*
* NOTE: this function does NOT check that `p` is a prime greater than `2`.
*/
function invModPrime(uint256 a, uint256 p) internal view returns (uint256) {
unchecked {
return Math.modExp(a, p - 2, p);
}
}
/**
* @dev Returns the modular exponentiation of the specified base, exponent and modulus (b ** e % m)
*
* Requirements:
* - modulus can't be zero
* - underlying staticcall to precompile must succeed
*
* IMPORTANT: The result is only valid if the underlying call succeeds. When using this function, make
* sure the chain you're using it on supports the precompiled contract for modular exponentiation
* at address 0x05 as specified in https://eips.ethereum.org/EIPS/eip-198[EIP-198]. Otherwise,
* the underlying function will succeed given the lack of a revert, but the result may be incorrectly
* interpreted as 0.
*/
function modExp(uint256 b, uint256 e, uint256 m) internal view returns (uint256) {
(bool success, uint256 result) = tryModExp(b, e, m);
if (!success) {
Panic.panic(Panic.DIVISION_BY_ZERO);
}
return result;
}
/**
* @dev Returns the modular exponentiation of the specified base, exponent and modulus (b ** e % m).
* It includes a success flag indicating if the operation succeeded. Operation will be marked as failed if trying
* to operate modulo 0 or if the underlying precompile reverted.
*
* IMPORTANT: The result is only valid if the success flag is true. When using this function, make sure the chain
* you're using it on supports the precompiled contract for modular exponentiation at address 0x05 as specified in
* https://eips.ethereum.org/EIPS/eip-198[EIP-198]. Otherwise, the underlying function will succeed given the lack
* of a revert, but the result may be incorrectly interpreted as 0.
*/
function tryModExp(uint256 b, uint256 e, uint256 m) internal view returns (bool success, uint256 result) {
if (m == 0) return (false, 0);
assembly ("memory-safe") {
let ptr := mload(0x40)
// | Offset | Content | Content (Hex) |
// |-----------|------------|--------------------------------------------------------------------|
// | 0x00:0x1f | size of b | 0x0000000000000000000000000000000000000000000000000000000000000020 |
// | 0x20:0x3f | size of e | 0x0000000000000000000000000000000000000000000000000000000000000020 |
// | 0x40:0x5f | size of m | 0x0000000000000000000000000000000000000000000000000000000000000020 |
// | 0x60:0x7f | value of b | 0x<.............................................................b> |
// | 0x80:0x9f | value of e | 0x<.............................................................e> |
// | 0xa0:0xbf | value of m | 0x<.............................................................m> |
mstore(ptr, 0x20)
mstore(add(ptr, 0x20), 0x20)
mstore(add(ptr, 0x40), 0x20)
mstore(add(ptr, 0x60), b)
mstore(add(ptr, 0x80), e)
mstore(add(ptr, 0xa0), m)
// Given the result < m, it's guaranteed to fit in 32 bytes,
// so we can use the memory scratch space located at offset 0.
success := staticcall(gas(), 0x05, ptr, 0xc0, 0x00, 0x20)
result := mload(0x00)
}
}
/**
* @dev Variant of {modExp} that supports inputs of arbitrary length.
*/
function modExp(bytes memory b, bytes memory e, bytes memory m) internal view returns (bytes memory) {
(bool success, bytes memory result) = tryModExp(b, e, m);
if (!success) {
Panic.panic(Panic.DIVISION_BY_ZERO);
}
return result;
}
/**
* @dev Variant of {tryModExp} that supports inputs of arbitrary length.
*/
function tryModExp(
bytes memory b,
bytes memory e,
bytes memory m
) internal view returns (bool success, bytes memory result) {
if (_zeroBytes(m)) return (false, new bytes(0));
uint256 mLen = m.length;
// Encode call args in result and move the free memory pointer
result = abi.encodePacked(b.length, e.length, mLen, b, e, m);
assembly ("memory-safe") {
let dataPtr := add(result, 0x20)
// Write result on top of args to avoid allocating extra memory.
success := staticcall(gas(), 0x05, dataPtr, mload(result), dataPtr, mLen)
// Overwrite the length.
// result.length > returndatasize() is guaranteed because returndatasize() == m.length
mstore(result, mLen)
// Set the memory pointer after the returned data.
mstore(0x40, add(dataPtr, mLen))
}
}
/**
* @dev Returns whether the provided byte array is zero.
*/
function _zeroBytes(bytes memory byteArray) private pure returns (bool) {
for (uint256 i = 0; i < byteArray.length; ++i) {
if (byteArray[i] != 0) {
return false;
}
}
return true;
}
/**
* @dev Returns the square root of a number. If the number is not a perfect square, the value is rounded
* towards zero.
*
* This method is based on Newton's method for computing square roots; the algorithm is restricted to only
* using integer operations.
*/
function sqrt(uint256 a) internal pure returns (uint256) {
unchecked {
// Take care of easy edge cases when a == 0 or a == 1
if (a <= 1) {
return a;
}
// In this function, we use Newton's method to get a root of `f(x) := x² - a`. It involves building a
// sequence x_n that converges toward sqrt(a). For each iteration x_n, we also define the error between
// the current value as `ε_n = | x_n - sqrt(a) |`.
//
// For our first estimation, we consider `e` the smallest power of 2 which is bigger than the square root
// of the target. (i.e. `2**(e-1) ≤ sqrt(a) < 2**e`). We know that `e ≤ 128` because `(2¹²⁸)² = 2²⁵⁶` is
// bigger than any uint256.
//
// By noticing that
// `2**(e-1) ≤ sqrt(a) < 2**e → (2**(e-1))² ≤ a < (2**e)² → 2**(2*e-2) ≤ a < 2**(2*e)`
// we can deduce that `e - 1` is `log2(a) / 2`. We can thus compute `x_n = 2**(e-1)` using a method similar
// to the msb function.
uint256 aa = a;
uint256 xn = 1;
if (aa >= (1 << 128)) {
aa >>= 128;
xn <<= 64;
}
if (aa >= (1 << 64)) {
aa >>= 64;
xn <<= 32;
}
if (aa >= (1 << 32)) {
aa >>= 32;
xn <<= 16;
}
if (aa >= (1 << 16)) {
aa >>= 16;
xn <<= 8;
}
if (aa >= (1 << 8)) {
aa >>= 8;
xn <<= 4;
}
if (aa >= (1 << 4)) {
aa >>= 4;
xn <<= 2;
}
if (aa >= (1 << 2)) {
xn <<= 1;
}
// We now have x_n such that `x_n = 2**(e-1) ≤ sqrt(a) < 2**e = 2 * x_n`. This implies ε_n ≤ 2**(e-1).
//
// We can refine our estimation by noticing that the middle of that interval minimizes the error.
// If we move x_n to equal 2**(e-1) + 2**(e-2), then we reduce the error to ε_n ≤ 2**(e-2).
// This is going to be our x_0 (and ε_0)
xn = (3 * xn) >> 1; // ε_0 := | x_0 - sqrt(a) | ≤ 2**(e-2)
// From here, Newton's method give us:
// x_{n+1} = (x_n + a / x_n) / 2
//
// One should note that:
// x_{n+1}² - a = ((x_n + a / x_n) / 2)² - a
// = ((x_n² + a) / (2 * x_n))² - a
// = (x_n⁴ + 2 * a * x_n² + a²) / (4 * x_n²) - a
// = (x_n⁴ + 2 * a * x_n² + a² - 4 * a * x_n²) / (4 * x_n²)
// = (x_n⁴ - 2 * a * x_n² + a²) / (4 * x_n²)
// = (x_n² - a)² / (2 * x_n)²
// = ((x_n² - a) / (2 * x_n))²
// ≥ 0
// Which proves that for all n ≥ 1, sqrt(a) ≤ x_n
//
// This gives us the proof of quadratic convergence of the sequence:
// ε_{n+1} = | x_{n+1} - sqrt(a) |
// = | (x_n + a / x_n) / 2 - sqrt(a) |
// = | (x_n² + a - 2*x_n*sqrt(a)) / (2 * x_n) |
// = | (x_n - sqrt(a))² / (2 * x_n) |
// = | ε_n² / (2 * x_n) |
// = ε_n² / | (2 * x_n) |
//
// For the first iteration, we have a special case where x_0 is known:
// ε_1 = ε_0² / | (2 * x_0) |
// ≤ (2**(e-2))² / (2 * (2**(e-1) + 2**(e-2)))
// ≤ 2**(2*e-4) / (3 * 2**(e-1))
// ≤ 2**(e-3) / 3
// ≤ 2**(e-3-log2(3))
// ≤ 2**(e-4.5)
//
// For the following iterations, we use the fact that, 2**(e-1) ≤ sqrt(a) ≤ x_n:
// ε_{n+1} = ε_n² / | (2 * x_n) |
// ≤ (2**(e-k))² / (2 * 2**(e-1))
// ≤ 2**(2*e-2*k) / 2**e
// ≤ 2**(e-2*k)
xn = (xn + a / xn) >> 1; // ε_1 := | x_1 - sqrt(a) | ≤ 2**(e-4.5) -- special case, see above
xn = (xn + a / xn) >> 1; // ε_2 := | x_2 - sqrt(a) | ≤ 2**(e-9) -- general case with k = 4.5
xn = (xn + a / xn) >> 1; // ε_3 := | x_3 - sqrt(a) | ≤ 2**(e-18) -- general case with k = 9
xn = (xn + a / xn) >> 1; // ε_4 := | x_4 - sqrt(a) | ≤ 2**(e-36) -- general case with k = 18
xn = (xn + a / xn) >> 1; // ε_5 := | x_5 - sqrt(a) | ≤ 2**(e-72) -- general case with k = 36
xn = (xn + a / xn) >> 1; // ε_6 := | x_6 - sqrt(a) | ≤ 2**(e-144) -- general case with k = 72
// Because e ≤ 128 (as discussed during the first estimation phase), we know have reached a precision
// ε_6 ≤ 2**(e-144) < 1. Given we're operating on integers, then we can ensure that xn is now either
// sqrt(a) or sqrt(a) + 1.
return xn - SafeCast.toUint(xn > a / xn);
}
}
/**
* @dev Calculates sqrt(a), following the selected rounding direction.
*/
function sqrt(uint256 a, Rounding rounding) internal pure returns (uint256) {
unchecked {
uint256 result = sqrt(a);
return result + SafeCast.toUint(unsignedRoundsUp(rounding) && result * result < a);
}
}
/**
* @dev Return the log in base 2 of a positive value rounded towards zero.
* Returns 0 if given 0.
*/
function log2(uint256 value) internal pure returns (uint256) {
uint256 result = 0;
uint256 exp;
unchecked {
exp = 128 * SafeCast.toUint(value > (1 << 128) - 1);
value >>= exp;
result += exp;
exp = 64 * SafeCast.toUint(value > (1 << 64) - 1);
value >>= exp;
result += exp;
exp = 32 * SafeCast.toUint(value > (1 << 32) - 1);
value >>= exp;
result += exp;
exp = 16 * SafeCast.toUint(value > (1 << 16) - 1);
value >>= exp;
result += exp;
exp = 8 * SafeCast.toUint(value > (1 << 8) - 1);
value >>= exp;
result += exp;
exp = 4 * SafeCast.toUint(value > (1 << 4) - 1);
value >>= exp;
result += exp;
exp = 2 * SafeCast.toUint(value > (1 << 2) - 1);
value >>= exp;
result += exp;
result += SafeCast.toUint(value > 1);
}
return result;
}
/**
* @dev Return the log in base 2, following the selected rounding direction, of a positive value.
* Returns 0 if given 0.
*/
function log2(uint256 value, Rounding rounding) internal pure returns (uint256) {
unchecked {
uint256 result = log2(value);
return result + SafeCast.toUint(unsignedRoundsUp(rounding) && 1 << result < value);
}
}
/**
* @dev Return the log in base 10 of a positive value rounded towards zero.
* Returns 0 if given 0.
*/
function log10(uint256 value) internal pure returns (uint256) {
uint256 result = 0;
unchecked {
if (value >= 10 ** 64) {
value /= 10 ** 64;
result += 64;
}
if (value >= 10 ** 32) {
value /= 10 ** 32;
result += 32;
}
if (value >= 10 ** 16) {
value /= 10 ** 16;
result += 16;
}
if (value >= 10 ** 8) {
value /= 10 ** 8;
result += 8;
}
if (value >= 10 ** 4) {
value /= 10 ** 4;
result += 4;
}
if (value >= 10 ** 2) {
value /= 10 ** 2;
result += 2;
}
if (value >= 10 ** 1) {
result += 1;
}
}
return result;
}
/**
* @dev Return the log in base 10, following the selected rounding direction, of a positive value.
* Returns 0 if given 0.
*/
function log10(uint256 value, Rounding rounding) internal pure returns (uint256) {
unchecked {
uint256 result = log10(value);
return result + SafeCast.toUint(unsignedRoundsUp(rounding) && 10 ** result < value);
}
}
/**
* @dev Return the log in base 256 of a positive value rounded towards zero.
* Returns 0 if given 0.
*
* Adding one to the result gives the number of pairs of hex symbols needed to represent `value` as a hex string.
*/
function log256(uint256 value) internal pure returns (uint256) {
uint256 result = 0;
uint256 isGt;
unchecked {
isGt = SafeCast.toUint(value > (1 << 128) - 1);
value >>= isGt * 128;
result += isGt * 16;
isGt = SafeCast.toUint(value > (1 << 64) - 1);
value >>= isGt * 64;
result += isGt * 8;
isGt = SafeCast.toUint(value > (1 << 32) - 1);
value >>= isGt * 32;
result += isGt * 4;
isGt = SafeCast.toUint(value > (1 << 16) - 1);
value >>= isGt * 16;
result += isGt * 2;
result += SafeCast.toUint(value > (1 << 8) - 1);
}
return result;
}
/**
* @dev Return the log in base 256, following the selected rounding direction, of a positive value.
* Returns 0 if given 0.
*/
function log256(uint256 value, Rounding rounding) internal pure returns (uint256) {
unchecked {
uint256 result = log256(value);
return result + SafeCast.toUint(unsignedRoundsUp(rounding) && 1 << (result << 3) < value);
}
}
/**
* @dev Returns whether a provided rounding mode is considered rounding up for unsigned integers.
*/
function unsignedRoundsUp(Rounding rounding) internal pure returns (bool) {
return uint8(rounding) % 2 == 1;
}
}
// File: @openzeppelin/contracts/utils/math/SignedMath.sol
// OpenZeppelin Contracts (last updated v5.1.0) (utils/math/SignedMath.sol)
pragma solidity ^0.8.20;
/**
* @dev Standard signed math utilities missing in the Solidity language.
*/
library SignedMath {
/**
* @dev Branchless ternary evaluation for `a ? b : c`. Gas costs are constant.
*
* IMPORTANT: This function may reduce bytecode size and consume less gas when used standalone.
* However, the compiler may optimize Solidity ternary operations (i.e. `a ? b : c`) to only compute
* one branch when needed, making this function more expensive.
*/
function ternary(bool condition, int256 a, int256 b) internal pure returns (int256) {
unchecked {
// branchless ternary works because:
// b ^ (a ^ b) == a
// b ^ 0 == b
return b ^ ((a ^ b) * int256(SafeCast.toUint(condition)));
}
}
/**
* @dev Returns the largest of two signed numbers.
*/
function max(int256 a, int256 b) internal pure returns (int256) {
return ternary(a > b, a, b);
}
/**
* @dev Returns the smallest of two signed numbers.
*/
function min(int256 a, int256 b) internal pure returns (int256) {
return ternary(a < b, a, b);
}
/**
* @dev Returns the average of two signed numbers without overflow.
* The result is rounded towards zero.
*/
function average(int256 a, int256 b) internal pure returns (int256) {
// Formula from the book "Hacker's Delight"
int256 x = (a & b) + ((a ^ b) >> 1);
return x + (int256(uint256(x) >> 255) & (a ^ b));
}
/**
* @dev Returns the absolute unsigned value of a signed value.
*/
function abs(int256 n) internal pure returns (uint256) {
unchecked {
// Formula from the "Bit Twiddling Hacks" by Sean Eron Anderson.
// Since `n` is a signed integer, the generated bytecode will use the SAR opcode to perform the right shift,
// taking advantage of the most significant (or "sign" bit) in two's complement representation.
// This opcode adds new most significant bits set to the value of the previous most significant bit. As a result,
// the mask will either be `bytes32(0)` (if n is positive) or `~bytes32(0)` (if n is negative).
int256 mask = n >> 255;
// A `bytes32(0)` mask leaves the input unchanged, while a `~bytes32(0)` mask complements it.
return uint256((n + mask) ^ mask);
}
}
}
// File: @openzeppelin/contracts/utils/Strings.sol
// OpenZeppelin Contracts (last updated v5.1.0) (utils/Strings.sol)
pragma solidity ^0.8.20;
/**
* @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;
assembly ("memory-safe") {
ptr := add(buffer, add(32, length))
}
while (true) {
ptr--;
assembly ("memory-safe") {
mstore8(ptr, byte(mod(value, 10), HEX_DIGITS))
}
value /= 10;
if (value == 0) break;
}
return buffer;
}
}
/**
* @dev Converts a `int256` to its ASCII `string` decimal representation.
*/
function toStringSigned(int256 value) internal pure returns (string memory) {
return string.concat(value < 0 ? "-" : "", toString(SignedMath.abs(value)));
}
/**
* @dev Converts a `uint256` to its ASCII `string` hexadecimal representation.
*/
function toHexString(uint256 value) internal pure returns (string memory) {
unchecked {
return toHexString(value, Math.log256(value) + 1);
}
}
/**
* @dev Converts a `uint256` to its ASCII `string` hexadecimal representation with fixed length.
*/
function toHexString(uint256 value, uint256 length) internal pure returns (string memory) {
uint256 localValue = value;
bytes memory buffer = new bytes(2 * length + 2);
buffer[0] = "0";
buffer[1] = "x";
for (uint256 i = 2 * length + 1; i > 1; --i) {
buffer[i] = HEX_DIGITS[localValue & 0xf];
localValue >>= 4;
}
if (localValue != 0) {
revert StringsInsufficientHexLength(value, length);
}
return string(buffer);
}
/**
* @dev Converts an `address` with fixed length of 20 bytes to its not checksummed ASCII `string` hexadecimal
* representation.
*/
function toHexString(address addr) internal pure returns (string memory) {
return toHexString(uint256(uint160(addr)), ADDRESS_LENGTH);
}
/**
* @dev Converts an `address` with fixed length of 20 bytes to its checksummed ASCII `string` hexadecimal
* representation, according to EIP-55.
*/
function toChecksumHexString(address addr) internal pure returns (string memory) {
bytes memory buffer = bytes(toHexString(addr));
// hash the hex part of buffer (skip length + 2 bytes, length 40)
uint256 hashValue;
assembly ("memory-safe") {
hashValue := shr(96, keccak256(add(buffer, 0x22), 40))
}
for (uint256 i = 41; i > 1; --i) {
// possible values for buffer[i] are 48 (0) to 57 (9) and 97 (a) to 102 (f)
if (hashValue & 0xf > 7 && uint8(buffer[i]) > 96) {
// case shift by xoring with 0x20
buffer[i] ^= 0x20;
}
hashValue >>= 4;
}
return string(buffer);
}
/**
* @dev Returns true if the two strings are equal.
*/
function equal(string memory a, string memory b) internal pure returns (bool) {
return bytes(a).length == bytes(b).length && keccak256(bytes(a)) == keccak256(bytes(b));
}
}
// File: @openzeppelin/contracts/utils/introspection/IERC165.sol
// OpenZeppelin Contracts (last updated v5.1.0) (utils/introspection/IERC165.sol)
pragma solidity ^0.8.20;
/**
* @dev Interface of the ERC-165 standard, as defined in the
* https://eips.ethereum.org/EIPS/eip-165[ERC].
*
* Implementers can declare support of contract interfaces, which can then be
* queried by others ({ERC165Checker}).
*
* For an implementation, see {ERC165}.
*/
interface IERC165 {
/**
* @dev Returns true if this contract implements the interface defined by
* `interfaceId`. See the corresponding
* https://eips.ethereum.org/EIPS/eip-165#how-interfaces-are-identified[ERC section]
* to learn more about how these ids are created.
*
* This function call must use less than 30 000 gas.
*/
function supportsInterface(bytes4 interfaceId) external view returns (bool);
}
// File: @openzeppelin/contracts/token/ERC721/IERC721.sol
// OpenZeppelin Contracts (last updated v5.1.0) (token/ERC721/IERC721.sol)
pragma solidity ^0.8.20;
/**
* @dev Required interface of an ERC-721 compliant contract.
*/
interface IERC721 is IERC165 {
/**
* @dev Emitted when `tokenId` token is transferred from `from` to `to`.
*/
event Transfer(address indexed from, address indexed to, uint256 indexed tokenId);
/**
* @dev Emitted when `owner` enables `approved` to manage the `tokenId` token.
*/
event Approval(address indexed owner, address indexed approved, uint256 indexed tokenId);
/**
* @dev Emitted when `owner` enables or disables (`approved`) `operator` to manage all of its assets.
*/
event ApprovalForAll(address indexed owner, address indexed operator, bool approved);
/**
* @dev Returns the number of tokens in ``owner``'s account.
*/
function balanceOf(address owner) external view returns (uint256 balance);
/**
* @dev Returns the owner of the `tokenId` token.
*
* Requirements:
*
* - `tokenId` must exist.
*/
function ownerOf(uint256 tokenId) external view returns (address owner);
/**
* @dev Safely transfers `tokenId` token from `from` to `to`.
*
* Requirements:
*
* - `from` cannot be the zero address.
* - `to` cannot be the zero address.
* - `tokenId` token must exist and be owned by `from`.
* - If the caller is not `from`, it must be approved to move this token by either {approve} or {setApprovalForAll}.
* - If `to` refers to a smart contract, it must implement {IERC721Receiver-onERC721Received}, which is called upon
* a safe transfer.
*
* Emits a {Transfer} event.
*/
function safeTransferFrom(address from, address to, uint256 tokenId, bytes calldata data) external;
/**
* @dev Safely transfers `tokenId` token from `from` to `to`, checking first that contract recipients
* are aware of the ERC-721 protocol to prevent tokens from being forever locked.
*
* Requirements:
*
* - `from` cannot be the zero address.
* - `to` cannot be the zero address.
* - `tokenId` token must exist and be owned by `from`.
* - If the caller is not `from`, it must have been allowed to move this token by either {approve} or
* {setApprovalForAll}.
* - If `to` refers to a smart contract, it must implement {IERC721Receiver-onERC721Received}, which is called upon
* a safe transfer.
*
* Emits a {Transfer} event.
*/
function safeTransferFrom(address from, address to, uint256 tokenId) external;
/**
* @dev Transfers `tokenId` token from `from` to `to`.
*
* WARNING: Note that the caller is responsible to confirm that the recipient is capable of receiving ERC-721
* or else they may be permanently lost. Usage of {safeTransferFrom} prevents loss, though the caller must
* understand this adds an external call which potentially creates a reentrancy vulnerability.
*
* Requirements:
*
* - `from` cannot be the zero address.
* - `to` cannot be the zero address.
* - `tokenId` token must be owned by `from`.
* - If the caller is not `from`, it must be approved to move this token by either {approve} or {setApprovalForAll}.
*
* Emits a {Transfer} event.
*/
function transferFrom(address from, address to, uint256 tokenId) external;
/**
* @dev Gives permission to `to` to transfer `tokenId` token to another account.
* The approval is cleared when the token is transferred.
*
* Only a single account can be approved at a time, so approving the zero address clears previous approvals.
*
* Requirements:
*
* - The caller must own the token or be an approved operator.
* - `tokenId` must exist.
*
* Emits an {Approval} event.
*/
function approve(address to, uint256 tokenId) external;
/**
* @dev Approve or remove `operator` as an operator for the caller.
* Operators can call {transferFrom} or {safeTransferFrom} for any token owned by the caller.
*
* Requirements:
*
* - The `operator` cannot be the address zero.
*
* Emits an {ApprovalForAll} event.
*/
function setApprovalForAll(address operator, bool approved) external;
/**
* @dev Returns the account approved for `tokenId` token.
*
* Requirements:
*
* - `tokenId` must exist.
*/
function getApproved(uint256 tokenId) external view returns (address operator);
/**
* @dev Returns if the `operator` is allowed to manage all of the assets of `owner`.
*
* See {setApprovalForAll}
*/
function isApprovedForAll(address owner, address operator) external view returns (bool);
}
// File: @openzeppelin/contracts/token/ERC721/extensions/IERC721Metadata.sol
// OpenZeppelin Contracts (last updated v5.0.0) (token/ERC721/extensions/IERC721Metadata.sol)
pragma solidity ^0.8.20;
/**
* @title ERC-721 Non-Fungible Token Standard, optional metadata extension
* @dev See https://eips.ethereum.org/EIPS/eip-721
*/
interface IERC721Metadata is IERC721 {
/**
* @dev Returns the token collection name.
*/
function name() external view returns (string memory);
/**
* @dev Returns the token collection symbol.
*/
function symbol() external view returns (string memory);
/**
* @dev Returns the Uniform Resource Identifier (URI) for `tokenId` token.
*/
function tokenURI(uint256 tokenId) external view returns (string memory);
}
// File: @openzeppelin/contracts/token/ERC721/IERC721Receiver.sol
// OpenZeppelin Contracts (last updated v5.1.0) (token/ERC721/IERC721Receiver.sol)
pragma solidity ^0.8.20;
/**
* @title ERC-721 token receiver interface
* @dev Interface for any contract that wants to support safeTransfers
* from ERC-721 asset contracts.
*/
interface IERC721Receiver {
/**
* @dev Whenever an {IERC721} `tokenId` token is transferred to this contract via {IERC721-safeTransferFrom}
* by `operator` from `from`, this function is called.
*
* It must return its Solidity selector to confirm the token transfer.
* If any other value is returned or the interface is not implemented by the recipient, the transfer will be
* reverted.
*
* The selector can be obtained in Solidity with `IERC721Receiver.onERC721Received.selector`.
*/
function onERC721Received(
address operator,
address from,
uint256 tokenId,
bytes calldata data
) external returns (bytes4);
}
// File: @openzeppelin/contracts/interfaces/draft-IERC6093.sol
// OpenZeppelin Contracts (last updated v5.1.0) (interfaces/draft-IERC6093.sol)
pragma solidity ^0.8.20;
/**
* @dev Standard ERC-20 Errors
* Interface of the https://eips.ethereum.org/EIPS/eip-6093[ERC-6093] custom errors for ERC-20 tokens.
*/
interface IERC20Errors {
/**
* @dev Indicates an error related to the current `balance` of a `sender`. Used in transfers.
* @param sender Address whose tokens are being transferred.
* @param balance Current balance for the interacting account.
* @param needed Minimum amount required to perform a transfer.
*/
error ERC20InsufficientBalance(address sender, uint256 balance, uint256 needed);
/**
* @dev Indicates a failure with the token `sender`. Used in transfers.
* @param sender Address whose tokens are being transferred.
*/
error ERC20InvalidSender(address sender);
/**
* @dev Indicates a failure with the token `receiver`. Used in transfers.
* @param receiver Address to which tokens are being transferred.
*/
error ERC20InvalidReceiver(address receiver);
/**
* @dev Indicates a failure with the `spender`’s `allowance`. Used in transfers.
* @param spender Address that may be allowed to operate on tokens without being their owner.
* @param allowance Amount of tokens a `spender` is allowed to operate with.
* @param needed Minimum amount required to perform a transfer.
*/
error ERC20InsufficientAllowance(address spender, uint256 allowance, uint256 needed);
/**
* @dev Indicates a failure with the `approver` of a token to be approved. Used in approvals.
* @param approver Address initiating an approval operation.
*/
error ERC20InvalidApprover(address approver);
/**
* @dev Indicates a failure with the `spender` to be approved. Used in approvals.
* @param spender Address that may be allowed to operate on tokens without being their owner.
*/
error ERC20InvalidSpender(address spender);
}
/**
* @dev Standard ERC-721 Errors
* Interface of the https://eips.ethereum.org/EIPS/eip-6093[ERC-6093] custom errors for ERC-721 tokens.
*/
interface IERC721Errors {
/**
* @dev Indicates that an address can't be an owner. For example, `address(0)` is a forbidden owner in ERC-20.
* Used in balance queries.
* @param owner Address of the current owner of a token.
*/
error ERC721InvalidOwner(address owner);
/**
* @dev Indicates a `tokenId` whose `owner` is the zero address.
* @param tokenId Identifier number of a token.
*/
error ERC721NonexistentToken(uint256 tokenId);
/**
* @dev Indicates an error related to the ownership over a particular token. Used in transfers.
* @param sender Address whose tokens are being transferred.
* @param tokenId Identifier number of a token.
* @param owner Address of the current owner of a token.
*/
error ERC721IncorrectOwner(address sender, uint256 tokenId, address owner);
/**
* @dev Indicates a failure with the token `sender`. Used in transfers.
* @param sender Address whose tokens are being transferred.
*/
error ERC721InvalidSender(address sender);
/**
* @dev Indicates a failure with the token `receiver`. Used in transfers.
* @param receiver Address to which tokens are being transferred.
*/
error ERC721InvalidReceiver(address receiver);
/**
* @dev Indicates a failure with the `operator`’s approval. Used in transfers.
* @param operator Address that may be allowed to operate on tokens without being their owner.
* @param tokenId Identifier number of a token.
*/
error ERC721InsufficientApproval(address operator, uint256 tokenId);
/**
* @dev Indicates a failure with the `approver` of a token to be approved. Used in approvals.
* @param approver Address initiating an approval operation.
*/
error ERC721InvalidApprover(address approver);
/**
* @dev Indicates a failure with the `operator` to be approved. Used in approvals.
* @param operator Address that may be allowed to operate on tokens without being their owner.
*/
error ERC721InvalidOperator(address operator);
}
/**
* @dev Standard ERC-1155 Errors
* Interface of the https://eips.ethereum.org/EIPS/eip-6093[ERC-6093] custom errors for ERC-1155 tokens.
*/
interface IERC1155Errors {
/**
* @dev Indicates an error related to the current `balance` of a `sender`. Used in transfers.
* @param sender Address whose tokens are being transferred.
* @param balance Current balance for the interacting account.
* @param needed Minimum amount required to perform a transfer.
* @param tokenId Identifier number of a token.
*/
error ERC1155InsufficientBalance(address sender, uint256 balance, uint256 needed, uint256 tokenId);
/**
* @dev Indicates a failure with the token `sender`. Used in transfers.
* @param sender Address whose tokens are being transferred.
*/
error ERC1155InvalidSender(address sender);
/**
* @dev Indicates a failure with the token `receiver`. Used in transfers.
* @param receiver Address to which tokens are being transferred.
*/
error ERC1155InvalidReceiver(address receiver);
/**
* @dev Indicates a failure with the `operator`’s approval. Used in transfers.
* @param operator Address that may be allowed to operate on tokens without being their owner.
* @param owner Address of the current owner of a token.
*/
error ERC1155MissingApprovalForAll(address operator, address owner);
/**
* @dev Indicates a failure with the `approver` of a token to be approved. Used in approvals.
* @param approver Address initiating an approval operation.
*/
error ERC1155InvalidApprover(address approver);
/**
* @dev Indicates a failure with the `operator` to be approved. Used in approvals.
* @param operator Address that may be allowed to operate on tokens without being their owner.
*/
error ERC1155InvalidOperator(address operator);
/**
* @dev Indicates an array length mismatch between ids and values in a safeBatchTransferFrom operation.
* Used in batch transfers.
* @param idsLength Length of the array of token identifiers
* @param valuesLength Length of the array of token amounts
*/
error ERC1155InvalidArrayLength(uint256 idsLength, uint256 valuesLength);
}
// File: @openzeppelin/contracts/token/ERC721/utils/ERC721Utils.sol
// OpenZeppelin Contracts (last updated v5.1.0) (token/ERC721/utils/ERC721Utils.sol)
pragma solidity ^0.8.20;
/**
* @dev Library that provide common ERC-721 utility functions.
*
* See https://eips.ethereum.org/EIPS/eip-721[ERC-721].
*
* _Available since v5.1._
*/
library ERC721Utils {
/**
* @dev Performs an acceptance check for the provided `operator` by calling {IERC721-onERC721Received}
* on the `to` address. The `operator` is generally the address that initiated the token transfer (i.e. `msg.sender`).
*
* The acceptance call is not executed and treated as a no-op if the target address doesn't contain code (i.e. an EOA).
* Otherwise, the recipient must implement {IERC721Receiver-onERC721Received} and return the acceptance magic value to accept
* the transfer.
*/
function checkOnERC721Received(
address operator,
address from,
address to,
uint256 tokenId,
bytes memory data
) internal {
if (to.code.length > 0) {
try IERC721Receiver(to).onERC721Received(operator, from, tokenId, data) returns (bytes4 retval) {
if (retval != IERC721Receiver.onERC721Received.selector) {
// Token rejected
revert IERC721Errors.ERC721InvalidReceiver(to);
}
} catch (bytes memory reason) {
if (reason.length == 0) {
// non-IERC721Receiver implementer
revert IERC721Errors.ERC721InvalidReceiver(to);
} else {
assembly ("memory-safe") {
revert(add(32, reason), mload(reason))
}
}
}
}
}
}
// File: @openzeppelin/contracts/utils/Context.sol
// OpenZeppelin Contracts (last updated v5.0.1) (utils/Context.sol)
pragma solidity ^0.8.20;
/**
* @dev Provides information about the current execution context, including the
* sender of the transaction and its data. While these are generally available
* via msg.sender and msg.data, they should not be accessed in such a direct
* manner, since when dealing with meta-transactions the account sending and
* paying for execution may not be the actual sender (as far as an application
* is concerned).
*
* This contract is only required for intermediate, library-like contracts.
*/
abstract contract Context {
function _msgSender() internal view virtual returns (address) {
return msg.sender;
}
function _msgData() internal view virtual returns (bytes calldata) {
return msg.data;
}
function _contextSuffixLength() internal view virtual returns (uint256) {
return 0;
}
}
// File: @openzeppelin/contracts/utils/introspection/ERC165.sol
// OpenZeppelin Contracts (last updated v5.1.0) (utils/introspection/ERC165.sol)
pragma solidity ^0.8.20;
/**
* @dev Implementation of the {IERC165} interface.
*
* Contracts that want to implement ERC-165 should inherit from this contract and override {supportsInterface} to check
* for the additional interface id that will be supported. For example:
*
* ```solidity
* function supportsInterface(bytes4 interfaceId) public view virtual override returns (bool) {
* return interfaceId == type(MyInterface).interfaceId || super.supportsInterface(interfaceId);
* }
* ```
*/
abstract contract ERC165 is IERC165 {
/**
* @dev See {IERC165-supportsInterface}.
*/
function supportsInterface(bytes4 interfaceId) public view virtual returns (bool) {
return interfaceId == type(IERC165).interfaceId;
}
}
// File: @openzeppelin/contracts/token/ERC721/ERC721.sol
// OpenZeppelin Contracts (last updated v5.1.0) (token/ERC721/ERC721.sol)
pragma solidity ^0.8.20;
/**
* @dev Implementation of https://eips.ethereum.org/EIPS/eip-721[ERC-721] Non-Fungible Token Standard, including
* the Metadata extension, but not including the Enumerable extension, which is available separately as
* {ERC721Enumerable}.
*/
abstract contract ERC721 is Context, ERC165, IERC721, IERC721Metadata, IERC721Errors {
using Strings for uint256;
// Token name
string private _name;
// Token symbol
string private _symbol;
mapping(uint256 tokenId => address) private _owners;
mapping(address owner => uint256) private _balances;
mapping(uint256 tokenId => address) private _tokenApprovals;
mapping(address owner => mapping(address operator => bool)) private _operatorApprovals;
/**
* @dev Initializes the contract by setting a `name` and a `symbol` to the token collection.
*/
constructor(string memory name_, string memory symbol_) {
_name = name_;
_symbol = symbol_;
}
/**
* @dev See {IERC165-supportsInterface}.
*/
function supportsInterface(bytes4 interfaceId) public view virtual override(ERC165, IERC165) returns (bool) {
return
interfaceId == type(IERC721).interfaceId ||
interfaceId == type(IERC721Metadata).interfaceId ||
super.supportsInterface(interfaceId);
}
/**
* @dev See {IERC721-balanceOf}.
*/
function balanceOf(address owner) public view virtual returns (uint256) {
if (owner == address(0)) {
revert ERC721InvalidOwner(address(0));
}
return _balances[owner];
}
/**
* @dev See {IERC721-ownerOf}.
*/
function ownerOf(uint256 tokenId) public view virtual returns (address) {
return _requireOwned(tokenId);
}
/**
* @dev See {IERC721Metadata-name}.
*/
function name() public view virtual returns (string memory) {
return _name;
}
/**
* @dev See {IERC721Metadata-symbol}.
*/
function symbol() public view virtual returns (string memory) {
return _symbol;
}
/**
* @dev See {IERC721Metadata-tokenURI}.
*/
function tokenURI(uint256 tokenId) public view virtual returns (string memory) {
_requireOwned(tokenId);
string memory baseURI = _baseURI();
return bytes(baseURI).length > 0 ? string.concat(baseURI, tokenId.toString()) : "";
}
/**
* @dev Base URI for computing {tokenURI}. If set, the resulting URI for each
* token will be the concatenation of the `baseURI` and the `tokenId`. Empty
* by default, can be overridden in child contracts.
*/
function _baseURI() internal view virtual returns (string memory) {
return "";
}
/**
* @dev See {IERC721-approve}.
*/
function approve(address to, uint256 tokenId) public virtual {
_approve(to, tokenId, _msgSender());
}
/**
* @dev See {IERC721-getApproved}.
*/
function getApproved(uint256 tokenId) public view virtual returns (address) {
_requireOwned(tokenId);
return _getApproved(tokenId);
}
/**
* @dev See {IERC721-setApprovalForAll}.
*/
function setApprovalForAll(address operator, bool approved) public virtual {
_setApprovalForAll(_msgSender(), operator, approved);
}
/**
* @dev See {IERC721-isApprovedForAll}.
*/
function isApprovedForAll(address owner, address operator) public view virtual returns (bool) {
return _operatorApprovals[owner][operator];
}
/**
* @dev See {IERC721-transferFrom}.
*/
function transferFrom(address from, address to, uint256 tokenId) public virtual {
if (to == address(0)) {
revert ERC721InvalidReceiver(address(0));
}
// Setting an "auth" arguments enables the `_isAuthorized` check which verifies that the token exists
// (from != 0). Therefore, it is not needed to verify that the return value is not 0 here.
address previousOwner = _update(to, tokenId, _msgSender());
if (previousOwner != from) {
revert ERC721IncorrectOwner(from, tokenId, previousOwner);
}
}
/**
* @dev See {IERC721-safeTransferFrom}.
*/
function safeTransferFrom(address from, address to, uint256 tokenId) public {
safeTransferFrom(from, to, tokenId, "");
}
/**
* @dev See {IERC721-safeTransferFrom}.
*/
function safeTransferFrom(address from, address to, uint256 tokenId, bytes memory data) public virtual {
transferFrom(from, to, tokenId);
ERC721Utils.checkOnERC721Received(_msgSender(), from, to, tokenId, data);
}
/**
* @dev Returns the owner of the `tokenId`. Does NOT revert if token doesn't exist
*
* IMPORTANT: Any overrides to this function that add ownership of tokens not tracked by the
* core ERC-721 logic MUST be matched with the use of {_increaseBalance} to keep balances
* consistent with ownership. The invariant to preserve is that for any address `a` the value returned by
* `balanceOf(a)` must be equal to the number of tokens such that `_ownerOf(tokenId)` is `a`.
*/
function _ownerOf(uint256 tokenId) internal view virtual returns (address) {
return _owners[tokenId];
}
/**
* @dev Returns the approved address for `tokenId`. Returns 0 if `tokenId` is not minted.
*/
function _getApproved(uint256 tokenId) internal view virtual returns (address) {
return _tokenApprovals[tokenId];
}
/**
* @dev Returns whether `spender` is allowed to manage `owner`'s tokens, or `tokenId` in
* particular (ignoring whether it is owned by `owner`).
*
* WARNING: This function assumes that `owner` is the actual owner of `tokenId` and does not verify this
* assumption.
*/
function _isAuthorized(address owner, address spender, uint256 tokenId) internal view virtual returns (bool) {
return
spender != address(0) &&
(owner == spender || isApprovedForAll(owner, spender) || _getApproved(tokenId) == spender);
}
/**
* @dev Checks if `spender` can operate on `tokenId`, assuming the provided `owner` is the actual owner.
* Reverts if:
* - `spender` does not have approval from `owner` for `tokenId`.
* - `spender` does not have approval to manage all of `owner`'s assets.
*
* WARNING: This function assumes that `owner` is the actual owner of `tokenId` and does not verify this
* assumption.
*/
function _checkAuthorized(address owner, address spender, uint256 tokenId) internal view virtual {
if (!_isAuthorized(owner, spender, tokenId)) {
if (owner == address(0)) {
revert ERC721NonexistentToken(tokenId);
} else {
revert ERC721InsufficientApproval(spender, tokenId);
}
}
}
/**
* @dev Unsafe write access to the balances, used by extensions that "mint" tokens using an {ownerOf} override.
*
* NOTE: the value is limited to type(uint128).max. This protect against _balance overflow. It is unrealistic that
* a uint256 would ever overflow from increments when these increments are bounded to uint128 values.
*
* WARNING: Increasing an account's balance using this function tends to be paired with an override of the
* {_ownerOf} function to resolve the ownership of the corresponding tokens so that balances and ownership
* remain consistent with one another.
*/
function _increaseBalance(address account, uint128 value) internal virtual {
unchecked {
_balances[account] += value;
}
}
/**
* @dev Transfers `tokenId` from its current owner to `to`, or alternatively mints (or burns) if the current owner
* (or `to`) is the zero address. Returns the owner of the `tokenId` before the update.
*
* The `auth` argument is optional. If the value passed is non 0, then this function will check that
* `auth` is either the owner of the token, or approved to operate on the token (by the owner).
*
* Emits a {Transfer} event.
*
* NOTE: If overriding this function in a way that tracks balances, see also {_increaseBalance}.
*/
function _update(address to, uint256 tokenId, address auth) internal virtual returns (address) {
address from = _ownerOf(tokenId);
// Perform (optional) operator check
if (auth != address(0)) {
_checkAuthorized(from, auth, tokenId);
}
// Execute the update
if (from != address(0)) {
// Clear approval. No need to re-authorize or emit the Approval event
_approve(address(0), tokenId, address(0), false);
unchecked {
_balances[from] -= 1;
}
}
if (to != address(0)) {
unchecked {
_balances[to] += 1;
}
}
_owners[tokenId] = to;
emit Transfer(from, to, tokenId);
return from;
}
/**
* @dev Mints `tokenId` and transfers it to `to`.
*
* WARNING: Usage of this method is discouraged, use {_safeMint} whenever possible
*
* Requirements:
*
* - `tokenId` must not exist.
* - `to` cannot be the zero address.
*
* Emits a {Transfer} event.
*/
function _mint(address to, uint256 tokenId) internal {
if (to == address(0)) {
revert ERC721InvalidReceiver(address(0));
}
address previousOwner = _update(to, tokenId, address(0));
if (previousOwner != address(0)) {
revert ERC721InvalidSender(address(0));
}
}
/**
* @dev Mints `tokenId`, transfers it to `to` and checks for `to` acceptance.
*
* Requirements:
*
* - `tokenId` must not exist.
* - If `to` refers to a smart contract, it must implement {IERC721Receiver-onERC721Received}, which is called upon a safe transfer.
*
* Emits a {Transfer} event.
*/
function _safeMint(address to, uint256 tokenId) internal {
_safeMint(to, tokenId, "");
}
/**
* @dev Same as {xref-ERC721-_safeMint-address-uint256-}[`_safeMint`], with an additional `data` parameter which is
* forwarded in {IERC721Receiver-onERC721Received} to contract recipients.
*/
function _safeMint(address to, uint256 tokenId, bytes memory data) internal virtual {
_mint(to, tokenId);
ERC721Utils.checkOnERC721Received(_msgSender(), address(0), to, tokenId, data);
}
/**
* @dev Destroys `tokenId`.
* The approval is cleared when the token is burned.
* This is an internal function that does not check if the sender is authorized to operate on the token.
*
* Requirements:
*
* - `tokenId` must exist.
*
* Emits a {Transfer} event.
*/
function _burn(uint256 tokenId) internal {
address previousOwner = _update(address(0), tokenId, address(0));
if (previousOwner == address(0)) {
revert ERC721NonexistentToken(tokenId);
}
}
/**
* @dev Transfers `tokenId` from `from` to `to`.
* As opposed to {transferFrom}, this imposes no restrictions on msg.sender.
*
* Requirements:
*
* - `to` cannot be the zero address.
* - `tokenId` token must be owned by `from`.
*
* Emits a {Transfer} event.
*/
function _transfer(address from, address to, uint256 tokenId) internal {
if (to == address(0)) {
revert ERC721InvalidReceiver(address(0));
}
address previousOwner = _update(to, tokenId, address(0));
if (previousOwner == address(0)) {
revert ERC721NonexistentToken(tokenId);
} else if (previousOwner != from) {
revert ERC721IncorrectOwner(from, tokenId, previousOwner);
}
}
/**
* @dev Safely transfers `tokenId` token from `from` to `to`, checking that contract recipients
* are aware of the ERC-721 standard to prevent tokens from being forever locked.
*
* `data` is additional data, it has no specified format and it is sent in call to `to`.
*
* This internal function is like {safeTransferFrom} in the sense that it invokes
* {IERC721Receiver-onERC721Received} on the receiver, and can be used to e.g.
* implement alternative mechanisms to perform token transfer, such as signature-based.
*
* Requirements:
*
* - `tokenId` token must exist and be owned by `from`.
* - `to` cannot be the zero address.
* - `from` cannot be the zero address.
* - If `to` refers to a smart contract, it must implement {IERC721Receiver-onERC721Received}, which is called upon a safe transfer.
*
* Emits a {Transfer} event.
*/
function _safeTransfer(address from, address to, uint256 tokenId) internal {
_safeTransfer(from, to, tokenId, "");
}
/**
* @dev Same as {xref-ERC721-_safeTransfer-address-address-uint256-}[`_safeTransfer`], with an additional `data` parameter which is
* forwarded in {IERC721Receiver-onERC721Received} to contract recipients.
*/
function _safeTransfer(address from, address to, uint256 tokenId, bytes memory data) internal virtual {
_transfer(from, to, tokenId);
ERC721Utils.checkOnERC721Received(_msgSender(), from, to, tokenId, data);
}
/**
* @dev Approve `to` to operate on `tokenId`
*
* The `auth` argument is optional. If the value passed is non 0, then this function will check that `auth` is
* either the owner of the token, or approved to operate on all tokens held by this owner.
*
* Emits an {Approval} event.
*
* Overrides to this logic should be done to the variant with an additional `bool emitEvent` argument.
*/
function _approve(address to, uint256 tokenId, address auth) internal {
_approve(to, tokenId, auth, true);
}
/**
* @dev Variant of `_approve` with an optional flag to enable or disable the {Approval} event. The event is not
* emitted in the context of transfers.
*/
function _approve(address to, uint256 tokenId, address auth, bool emitEvent) internal virtual {
// Avoid reading the owner unless necessary
if (emitEvent || auth != address(0)) {
address owner = _requireOwned(tokenId);
// We do not use _isAuthorized because single-token approvals should not be able to call approve
if (auth != address(0) && owner != auth && !isApprovedForAll(owner, auth)) {
revert ERC721InvalidApprover(auth);
}
if (emitEvent) {
emit Approval(owner, to, tokenId);
}
}
_tokenApprovals[tokenId] = to;
}
/**
* @dev Approve `operator` to operate on all of `owner` tokens
*
* Requirements:
* - operator can't be the address zero.
*
* Emits an {ApprovalForAll} event.
*/
function _setApprovalForAll(address owner, address operator, bool approved) internal virtual {
if (operator == address(0)) {
revert ERC721InvalidOperator(operator);
}
_operatorApprovals[owner][operator] = approved;
emit ApprovalForAll(owner, operator, approved);
}
/**
* @dev Reverts if the `tokenId` doesn't have a current owner (it hasn't been minted, or it has been burned).
* Returns the owner.
*
* Overrides to ownership logic should be done to {_ownerOf}.
*/
function _requireOwned(uint256 tokenId) internal view returns (address) {
address owner = _ownerOf(tokenId);
if (owner == address(0)) {
revert ERC721NonexistentToken(tokenId);
}
return owner;
}
}
// File: @openzeppelin/contracts/access/Ownable.sol
// OpenZeppelin Contracts (last updated v5.0.0) (access/Ownable.sol)
pragma solidity ^0.8.20;
/**
* @dev Contract module which provides a basic access control mechanism, where
* there is an account (an owner) that can be granted exclusive access to
* specific functions.
*
* The initial owner is set to the address provided by the deployer. This can
* later be changed with {transferOwnership}.
*
* This module is used through inheritance. It will make available the modifier
* `onlyOwner`, which can be applied to your functions to restrict their use to
* the owner.
*/
abstract contract Ownable is Context {
address private _owner;
/**
* @dev The caller account is not authorized to perform an operation.
*/
error OwnableUnauthorizedAccount(address account);
/**
* @dev The owner is not a valid owner account. (eg. `address(0)`)
*/
error OwnableInvalidOwner(address owner);
event OwnershipTransferred(address indexed previousOwner, address indexed newOwner);
/**
* @dev Initializes the contract setting the address provided by the deployer as the initial owner.
*/
constructor(address initialOwner) {
if (initialOwner == address(0)) {
revert OwnableInvalidOwner(address(0));
}
_transferOwnership(initialOwner);
}
/**
* @dev Throws if called by any account other than the owner.
*/
modifier onlyOwner() {
_checkOwner();
_;
}
/**
* @dev Returns the address of the current owner.
*/
function owner() public view virtual returns (address) {
return _owner;
}
/**
* @dev Throws if the sender is not the owner.
*/
function _checkOwner() internal view virtual {
if (owner() != _msgSender()) {
revert OwnableUnauthorizedAccount(_msgSender());
}
}
/**
* @dev Leaves the contract without owner. It will not be possible to call
* `onlyOwner` functions. Can only be called by the current owner.
*
* NOTE: Renouncing ownership will leave the contract without an owner,
* thereby disabling any functionality that is only available to the owner.
*/
function renounceOwnership() public virtual onlyOwner {
_transferOwnership(address(0));
}
/**
* @dev Transfers ownership of the contract to a new account (`newOwner`).
* Can only be called by the current owner.
*/
function transferOwnership(address newOwner) public virtual onlyOwner {
if (newOwner == address(0)) {
revert OwnableInvalidOwner(address(0));
}
_transferOwnership(newOwner);
}
/**
* @dev Transfers ownership of the contract to a new account (`newOwner`).
* Internal function without access restriction.
*/
function _transferOwnership(address newOwner) internal virtual {
address oldOwner = _owner;
_owner = newOwner;
emit OwnershipTransferred(oldOwner, newOwner);
}
}
// File: @openzeppelin/contracts/token/ERC20/IERC20.sol
// OpenZeppelin Contracts (last updated v5.1.0) (token/ERC20/IERC20.sol)
pragma solidity ^0.8.20;
/**
* @dev Interface of the ERC-20 standard as defined in the ERC.
*/
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);
}
// File: @openzeppelin/contracts/utils/cryptography/Hashes.sol
// OpenZeppelin Contracts (last updated v5.1.0) (utils/cryptography/Hashes.sol)
pragma solidity ^0.8.20;
/**
* @dev Library of standard hash functions.
*
* _Available since v5.1._
*/
library Hashes {
/**
* @dev Commutative Keccak256 hash of a sorted pair of bytes32. Frequently used when working with merkle proofs.
*
* NOTE: Equivalent to the `standardNodeHash` in our https://github.com/OpenZeppelin/merkle-tree[JavaScript library].
*/
function commutativeKeccak256(bytes32 a, bytes32 b) internal pure returns (bytes32) {
return a < b ? _efficientKeccak256(a, b) : _efficientKeccak256(b, a);
}
/**
* @dev Implementation of keccak256(abi.encode(a, b)) that doesn't allocate or expand memory.
*/
function _efficientKeccak256(bytes32 a, bytes32 b) private pure returns (bytes32 value) {
assembly ("memory-safe") {
mstore(0x00, a)
mstore(0x20, b)
value := keccak256(0x00, 0x40)
}
}
}
// File: @openzeppelin/contracts/utils/cryptography/MerkleProof.sol
// OpenZeppelin Contracts (last updated v5.1.0) (utils/cryptography/MerkleProof.sol)
// This file was procedurally generated from scripts/generate/templates/MerkleProof.js.
pragma solidity ^0.8.20;
/**
* @dev These functions deal with verification of Merkle Tree proofs.
*
* The tree and the proofs can be generated using our
* https://github.com/OpenZeppelin/merkle-tree[JavaScript library].
* You will find a quickstart guide in the readme.
*
* WARNING: You should avoid using leaf values that are 64 bytes long prior to
* hashing, or use a hash function other than keccak256 for hashing leaves.
* This is because the concatenation of a sorted pair of internal nodes in
* the Merkle tree could be reinterpreted as a leaf value.
* OpenZeppelin's JavaScript library generates Merkle trees that are safe
* against this attack out of the box.
*
* IMPORTANT: Consider memory side-effects when using custom hashing functions
* that access memory in an unsafe way.
*
* NOTE: This library supports proof verification for merkle trees built using
* custom _commutative_ hashing functions (i.e. `H(a, b) == H(b, a)`). Proving
* leaf inclusion in trees built using non-commutative hashing functions requires
* additional logic that is not supported by this library.
*/
library MerkleProof {
/**
*@dev The multiproof provided is not valid.
*/
error MerkleProofInvalidMultiproof();
/**
* @dev Returns true if a `leaf` can be proved to be a part of a Merkle tree
* defined by `root`. For this, a `proof` must be provided, containing
* sibling hashes on the branch from the leaf to the root of the tree. Each
* pair of leaves and each pair of pre-images are assumed to be sorted.
*
* This version handles proofs in memory with the default hashing function.
*/
function verify(bytes32[] memory proof, bytes32 root, bytes32 leaf) internal pure returns (bool) {
return processProof(proof, leaf) == root;
}
/**
* @dev Returns the rebuilt hash obtained by traversing a Merkle tree up
* from `leaf` using `proof`. A `proof` is valid if and only if the rebuilt
* hash matches the root of the tree. When processing the proof, the pairs
* of leaves & pre-images are assumed to be sorted.
*
* This version handles proofs in memory with the default hashing function.
*/
function processProof(bytes32[] memory proof, bytes32 leaf) internal pure returns (bytes32) {
bytes32 computedHash = leaf;
for (uint256 i = 0; i < proof.length; i++) {
computedHash = Hashes.commutativeKeccak256(computedHash, proof[i]);
}
return computedHash;
}
/**
* @dev Returns true if a `leaf` can be proved to be a part of a Merkle tree
* defined by `root`. For this, a `proof` must be provided, containing
* sibling hashes on the branch from the leaf to the root of the tree. Each
* pair of leaves and each pair of pre-images are assumed to be sorted.
*
* This version handles proofs in memory with a custom hashing function.
*/
function verify(
bytes32[] memory proof,
bytes32 root,
bytes32 leaf,
function(bytes32, bytes32) view returns (bytes32) hasher
) internal view returns (bool) {
return processProof(proof, leaf, hasher) == root;
}
/**
* @dev Returns the rebuilt hash obtained by traversing a Merkle tree up
* from `leaf` using `proof`. A `proof` is valid if and only if the rebuilt
* hash matches the root of the tree. When processing the proof, the pairs
* of leaves & pre-images are assumed to be sorted.
*
* This version handles proofs in memory with a custom hashing function.
*/
function processProof(
bytes32[] memory proof,
bytes32 leaf,
function(bytes32, bytes32) view returns (bytes32) hasher
) internal view returns (bytes32) {
bytes32 computedHash = leaf;
for (uint256 i = 0; i < proof.length; i++) {
computedHash = hasher(computedHash, proof[i]);
}
return computedHash;
}
/**
* @dev Returns true if a `leaf` can be proved to be a part of a Merkle tree
* defined by `root`. For this, a `proof` must be provided, containing
* sibling hashes on the branch from the leaf to the root of the tree. Each
* pair of leaves and each pair of pre-images are assumed to be sorted.
*
* This version handles proofs in calldata with the default hashing function.
*/
function verifyCalldata(bytes32[] calldata proof, bytes32 root, bytes32 leaf) internal pure returns (bool) {
return processProofCalldata(proof, leaf) == root;
}
/**
* @dev Returns the rebuilt hash obtained by traversing a Merkle tree up
* from `leaf` using `proof`. A `proof` is valid if and only if the rebuilt
* hash matches the root of the tree. When processing the proof, the pairs
* of leaves & pre-images are assumed to be sorted.
*
* This version handles proofs in calldata with the default hashing function.
*/
function processProofCalldata(bytes32[] calldata proof, bytes32 leaf) internal pure returns (bytes32) {
bytes32 computedHash = leaf;
for (uint256 i = 0; i < proof.length; i++) {
computedHash = Hashes.commutativeKeccak256(computedHash, proof[i]);
}
return computedHash;
}
/**
* @dev Returns true if a `leaf` can be proved to be a part of a Merkle tree
* defined by `root`. For this, a `proof` must be provided, containing
* sibling hashes on the branch from the leaf to the root of the tree. Each
* pair of leaves and each pair of pre-images are assumed to be sorted.
*
* This version handles proofs in calldata with a custom hashing function.
*/
function verifyCalldata(
bytes32[] calldata proof,
bytes32 root,
bytes32 leaf,
function(bytes32, bytes32) view returns (bytes32) hasher
) internal view returns (bool) {
return processProofCalldata(proof, leaf, hasher) == root;
}
/**
* @dev Returns the rebuilt hash obtained by traversing a Merkle tree up
* from `leaf` using `proof`. A `proof` is valid if and only if the rebuilt
* hash matches the root of the tree. When processing the proof, the pairs
* of leaves & pre-images are assumed to be sorted.
*
* This version handles proofs in calldata with a custom hashing function.
*/
function processProofCalldata(
bytes32[] calldata proof,
bytes32 leaf,
function(bytes32, bytes32) view returns (bytes32) hasher
) internal view returns (bytes32) {
bytes32 computedHash = leaf;
for (uint256 i = 0; i < proof.length; i++) {
computedHash = hasher(computedHash, proof[i]);
}
return computedHash;
}
/**
* @dev Returns true if the `leaves` can be simultaneously proven to be a part of a Merkle tree defined by
* `root`, according to `proof` and `proofFlags` as described in {processMultiProof}.
*
* This version handles multiproofs in memory with the default hashing function.
*
* CAUTION: Not all Merkle trees admit multiproofs. See {processMultiProof} for details.
*
* NOTE: Consider the case where `root == proof[0] && leaves.length == 0` as it will return `true`.
* The `leaves` must be validated independently. See {processMultiProof}.
*/
function multiProofVerify(
bytes32[] memory proof,
bool[] memory proofFlags,
bytes32 root,
bytes32[] memory leaves
) internal pure returns (bool) {
return processMultiProof(proof, proofFlags, leaves) == root;
}
/**
* @dev Returns the root of a tree reconstructed from `leaves` and sibling nodes in `proof`. The reconstruction
* proceeds by incrementally reconstructing all inner nodes by combining a leaf/inner node with either another
* leaf/inner node or a proof sibling node, depending on whether each `proofFlags` item is true or false
* respectively.
*
* This version handles multiproofs in memory with the default hashing function.
*
* CAUTION: Not all Merkle trees admit multiproofs. To use multiproofs, it is sufficient to ensure that: 1) the tree
* is complete (but not necessarily perfect), 2) the leaves to be proven are in the opposite order they are in the
* tree (i.e., as seen from right to left starting at the deepest layer and continuing at the next layer).
*
* NOTE: The _empty set_ (i.e. the case where `proof.length == 1 && leaves.length == 0`) is considered a no-op,
* and therefore a valid multiproof (i.e. it returns `proof[0]`). Consider disallowing this case if you're not
* validating the leaves elsewhere.
*/
function processMultiProof(
bytes32[] memory proof,
bool[] memory proofFlags,
bytes32[] memory leaves
) internal pure returns (bytes32 merkleRoot) {
// This function rebuilds the root hash by traversing the tree up from the leaves. The root is rebuilt by
// consuming and producing values on a queue. The queue starts with the `leaves` array, then goes onto the
// `hashes` array. At the end of the process, the last hash in the `hashes` array should contain the root of
// the Merkle tree.
uint256 leavesLen = leaves.length;
uint256 proofFlagsLen = proofFlags.length;
// Check proof validity.
if (leavesLen + proof.length != proofFlagsLen + 1) {
revert MerkleProofInvalidMultiproof();
}
// The xxxPos values are "pointers" to the next value to consume in each array. All accesses are done using
// `xxx[xxxPos++]`, which return the current value and increment the pointer, thus mimicking a queue's "pop".
bytes32[] memory hashes = new bytes32[](proofFlagsLen);
uint256 leafPos = 0;
uint256 hashPos = 0;
uint256 proofPos = 0;
// At each step, we compute the next hash using two values:
// - a value from the "main queue". If not all leaves have been consumed, we get the next leaf, otherwise we
// get the next hash.
// - depending on the flag, either another value from the "main queue" (merging branches) or an element from the
// `proof` array.
for (uint256 i = 0; i < proofFlagsLen; i++) {
bytes32 a = leafPos < leavesLen ? leaves[leafPos++] : hashes[hashPos++];
bytes32 b = proofFlags[i]
? (leafPos < leavesLen ? leaves[leafPos++] : hashes[hashPos++])
: proof[proofPos++];
hashes[i] = Hashes.commutativeKeccak256(a, b);
}
if (proofFlagsLen > 0) {
if (proofPos != proof.length) {
revert MerkleProofInvalidMultiproof();
}
unchecked {
return hashes[proofFlagsLen - 1];
}
} else if (leavesLen > 0) {
return leaves[0];
} else {
return proof[0];
}
}
/**
* @dev Returns true if the `leaves` can be simultaneously proven to be a part of a Merkle tree defined by
* `root`, according to `proof` and `proofFlags` as described in {processMultiProof}.
*
* This version handles multiproofs in memory with a custom hashing function.
*
* CAUTION: Not all Merkle trees admit multiproofs. See {processMultiProof} for details.
*
* NOTE: Consider the case where `root == proof[0] && leaves.length == 0` as it will return `true`.
* The `leaves` must be validated independently. See {processMultiProof}.
*/
function multiProofVerify(
bytes32[] memory proof,
bool[] memory proofFlags,
bytes32 root,
bytes32[] memory leaves,
function(bytes32, bytes32) view returns (bytes32) hasher
) internal view returns (bool) {
return processMultiProof(proof, proofFlags, leaves, hasher) == root;
}
/**
* @dev Returns the root of a tree reconstructed from `leaves` and sibling nodes in `proof`. The reconstruction
* proceeds by incrementally reconstructing all inner nodes by combining a leaf/inner node with either another
* leaf/inner node or a proof sibling node, depending on whether each `proofFlags` item is true or false
* respectively.
*
* This version handles multiproofs in memory with a custom hashing function.
*
* CAUTION: Not all Merkle trees admit multiproofs. To use multiproofs, it is sufficient to ensure that: 1) the tree
* is complete (but not necessarily perfect), 2) the leaves to be proven are in the opposite order they are in the
* tree (i.e., as seen from right to left starting at the deepest layer and continuing at the next layer).
*
* NOTE: The _empty set_ (i.e. the case where `proof.length == 1 && leaves.length == 0`) is considered a no-op,
* and therefore a valid multiproof (i.e. it returns `proof[0]`). Consider disallowing this case if you're not
* validating the leaves elsewhere.
*/
function processMultiProof(
bytes32[] memory proof,
bool[] memory proofFlags,
bytes32[] memory leaves,
function(bytes32, bytes32) view returns (bytes32) hasher
) internal view returns (bytes32 merkleRoot) {
// This function rebuilds the root hash by traversing the tree up from the leaves. The root is rebuilt by
// consuming and producing values on a queue. The queue starts with the `leaves` array, then goes onto the
// `hashes` array. At the end of the process, the last hash in the `hashes` array should contain the root of
// the Merkle tree.
uint256 leavesLen = leaves.length;
uint256 proofFlagsLen = proofFlags.length;
// Check proof validity.
if (leavesLen + proof.length != proofFlagsLen + 1) {
revert MerkleProofInvalidMultiproof();
}
// The xxxPos values are "pointers" to the next value to consume in each array. All accesses are done using
// `xxx[xxxPos++]`, which return the current value and increment the pointer, thus mimicking a queue's "pop".
bytes32[] memory hashes = new bytes32[](proofFlagsLen);
uint256 leafPos = 0;
uint256 hashPos = 0;
uint256 proofPos = 0;
// At each step, we compute the next hash using two values:
// - a value from the "main queue". If not all leaves have been consumed, we get the next leaf, otherwise we
// get the next hash.
// - depending on the flag, either another value from the "main queue" (merging branches) or an element from the
// `proof` array.
for (uint256 i = 0; i < proofFlagsLen; i++) {
bytes32 a = leafPos < leavesLen ? leaves[leafPos++] : hashes[hashPos++];
bytes32 b = proofFlags[i]
? (leafPos < leavesLen ? leaves[leafPos++] : hashes[hashPos++])
: proof[proofPos++];
hashes[i] = hasher(a, b);
}
if (proofFlagsLen > 0) {
if (proofPos != proof.length) {
revert MerkleProofInvalidMultiproof();
}
unchecked {
return hashes[proofFlagsLen - 1];
}
} else if (leavesLen > 0) {
return leaves[0];
} else {
return proof[0];
}
}
/**
* @dev Returns true if the `leaves` can be simultaneously proven to be a part of a Merkle tree defined by
* `root`, according to `proof` and `proofFlags` as described in {processMultiProof}.
*
* This version handles multiproofs in calldata with the default hashing function.
*
* CAUTION: Not all Merkle trees admit multiproofs. See {processMultiProof} for details.
*
* NOTE: Consider the case where `root == proof[0] && leaves.length == 0` as it will return `true`.
* The `leaves` must be validated independently. See {processMultiProofCalldata}.
*/
function multiProofVerifyCalldata(
bytes32[] calldata proof,
bool[] calldata proofFlags,
bytes32 root,
bytes32[] memory leaves
) internal pure returns (bool) {
return processMultiProofCalldata(proof, proofFlags, leaves) == root;
}
/**
* @dev Returns the root of a tree reconstructed from `leaves` and sibling nodes in `proof`. The reconstruction
* proceeds by incrementally reconstructing all inner nodes by combining a leaf/inner node with either another
* leaf/inner node or a proof sibling node, depending on whether each `proofFlags` item is true or false
* respectively.
*
* This version handles multiproofs in calldata with the default hashing function.
*
* CAUTION: Not all Merkle trees admit multiproofs. To use multiproofs, it is sufficient to ensure that: 1) the tree
* is complete (but not necessarily perfect), 2) the leaves to be proven are in the opposite order they are in the
* tree (i.e., as seen from right to left starting at the deepest layer and continuing at the next layer).
*
* NOTE: The _empty set_ (i.e. the case where `proof.length == 1 && leaves.length == 0`) is considered a no-op,
* and therefore a valid multiproof (i.e. it returns `proof[0]`). Consider disallowing this case if you're not
* validating the leaves elsewhere.
*/
function processMultiProofCalldata(
bytes32[] calldata proof,
bool[] calldata proofFlags,
bytes32[] memory leaves
) internal pure returns (bytes32 merkleRoot) {
// This function rebuilds the root hash by traversing the tree up from the leaves. The root is rebuilt by
// consuming and producing values on a queue. The queue starts with the `leaves` array, then goes onto the
// `hashes` array. At the end of the process, the last hash in the `hashes` array should contain the root of
// the Merkle tree.
uint256 leavesLen = leaves.length;
uint256 proofFlagsLen = proofFlags.length;
// Check proof validity.
if (leavesLen + proof.length != proofFlagsLen + 1) {
revert MerkleProofInvalidMultiproof();
}
// The xxxPos values are "pointers" to the next value to consume in each array. All accesses are done using
// `xxx[xxxPos++]`, which return the current value and increment the pointer, thus mimicking a queue's "pop".
bytes32[] memory hashes = new bytes32[](proofFlagsLen);
uint256 leafPos = 0;
uint256 hashPos = 0;
uint256 proofPos = 0;
// At each step, we compute the next hash using two values:
// - a value from the "main queue". If not all leaves have been consumed, we get the next leaf, otherwise we
// get the next hash.
// - depending on the flag, either another value from the "main queue" (merging branches) or an element from the
// `proof` array.
for (uint256 i = 0; i < proofFlagsLen; i++) {
bytes32 a = leafPos < leavesLen ? leaves[leafPos++] : hashes[hashPos++];
bytes32 b = proofFlags[i]
? (leafPos < leavesLen ? leaves[leafPos++] : hashes[hashPos++])
: proof[proofPos++];
hashes[i] = Hashes.commutativeKeccak256(a, b);
}
if (proofFlagsLen > 0) {
if (proofPos != proof.length) {
revert MerkleProofInvalidMultiproof();
}
unchecked {
return hashes[proofFlagsLen - 1];
}
} else if (leavesLen > 0) {
return leaves[0];
} else {
return proof[0];
}
}
/**
* @dev Returns true if the `leaves` can be simultaneously proven to be a part of a Merkle tree defined by
* `root`, according to `proof` and `proofFlags` as described in {processMultiProof}.
*
* This version handles multiproofs in calldata with a custom hashing function.
*
* CAUTION: Not all Merkle trees admit multiproofs. See {processMultiProof} for details.
*
* NOTE: Consider the case where `root == proof[0] && leaves.length == 0` as it will return `true`.
* The `leaves` must be validated independently. See {processMultiProofCalldata}.
*/
function multiProofVerifyCalldata(
bytes32[] calldata proof,
bool[] calldata proofFlags,
bytes32 root,
bytes32[] memory leaves,
function(bytes32, bytes32) view returns (bytes32) hasher
) internal view returns (bool) {
return processMultiProofCalldata(proof, proofFlags, leaves, hasher) == root;
}
/**
* @dev Returns the root of a tree reconstructed from `leaves` and sibling nodes in `proof`. The reconstruction
* proceeds by incrementally reconstructing all inner nodes by combining a leaf/inner node with either another
* leaf/inner node or a proof sibling node, depending on whether each `proofFlags` item is true or false
* respectively.
*
* This version handles multiproofs in calldata with a custom hashing function.
*
* CAUTION: Not all Merkle trees admit multiproofs. To use multiproofs, it is sufficient to ensure that: 1) the tree
* is complete (but not necessarily perfect), 2) the leaves to be proven are in the opposite order they are in the
* tree (i.e., as seen from right to left starting at the deepest layer and continuing at the next layer).
*
* NOTE: The _empty set_ (i.e. the case where `proof.length == 1 && leaves.length == 0`) is considered a no-op,
* and therefore a valid multiproof (i.e. it returns `proof[0]`). Consider disallowing this case if you're not
* validating the leaves elsewhere.
*/
function processMultiProofCalldata(
bytes32[] calldata proof,
bool[] calldata proofFlags,
bytes32[] memory leaves,
function(bytes32, bytes32) view returns (bytes32) hasher
) internal view returns (bytes32 merkleRoot) {
// This function rebuilds the root hash by traversing the tree up from the leaves. The root is rebuilt by
// consuming and producing values on a queue. The queue starts with the `leaves` array, then goes onto the
// `hashes` array. At the end of the process, the last hash in the `hashes` array should contain the root of
// the Merkle tree.
uint256 leavesLen = leaves.length;
uint256 proofFlagsLen = proofFlags.length;
// Check proof validity.
if (leavesLen + proof.length != proofFlagsLen + 1) {
revert MerkleProofInvalidMultiproof();
}
// The xxxPos values are "pointers" to the next value to consume in each array. All accesses are done using
// `xxx[xxxPos++]`, which return the current value and increment the pointer, thus mimicking a queue's "pop".
bytes32[] memory hashes = new bytes32[](proofFlagsLen);
uint256 leafPos = 0;
uint256 hashPos = 0;
uint256 proofPos = 0;
// At each step, we compute the next hash using two values:
// - a value from the "main queue". If not all leaves have been consumed, we get the next leaf, otherwise we
// get the next hash.
// - depending on the flag, either another value from the "main queue" (merging branches) or an element from the
// `proof` array.
for (uint256 i = 0; i < proofFlagsLen; i++) {
bytes32 a = leafPos < leavesLen ? leaves[leafPos++] : hashes[hashPos++];
bytes32 b = proofFlags[i]
? (leafPos < leavesLen ? leaves[leafPos++] : hashes[hashPos++])
: proof[proofPos++];
hashes[i] = hasher(a, b);
}
if (proofFlagsLen > 0) {
if (proofPos != proof.length) {
revert MerkleProofInvalidMultiproof();
}
unchecked {
return hashes[proofFlagsLen - 1];
}
} else if (leavesLen > 0) {
return leaves[0];
} else {
return proof[0];
}
}
}
// File: @openzeppelin/contracts/utils/Errors.sol
// OpenZeppelin Contracts (last updated v5.1.0) (utils/Errors.sol)
pragma solidity ^0.8.20;
/**
* @dev Collection of common custom errors used in multiple contracts
*
* IMPORTANT: Backwards compatibility is not guaranteed in future versions of the library.
* It is recommended to avoid relying on the error API for critical functionality.
*
* _Available since v5.1._
*/
library Errors {
/**
* @dev The ETH balance of the account is not enough to perform the operation.
*/
error InsufficientBalance(uint256 balance, uint256 needed);
/**
* @dev A call to an address target failed. The target may have reverted.
*/
error FailedCall();
/**
* @dev The deployment failed.
*/
error FailedDeployment();
/**
* @dev A necessary precompile is missing.
*/
error MissingPrecompile(address);
}
// File: @openzeppelin/contracts/utils/Address.sol
// OpenZeppelin Contracts (last updated v5.1.0) (utils/Address.sol)
pragma solidity ^0.8.20;
/**
* @dev Collection of functions related to the address type
*/
library Address {
/**
* @dev There's no code at `target` (it is not a contract).
*/
error AddressEmptyCode(address target);
/**
* @dev Replacement for Solidity's `transfer`: sends `amount` wei to
* `recipient`, forwarding all available gas and reverting on errors.
*
* https://eips.ethereum.org/EIPS/eip-1884[EIP1884] increases the gas cost
* of certain opcodes, possibly making contracts go over the 2300 gas limit
* imposed by `transfer`, making them unable to receive funds via
* `transfer`. {sendValue} removes this limitation.
*
* https://consensys.net/diligence/blog/2019/09/stop-using-soliditys-transfer-now/[Learn more].
*
* IMPORTANT: because control is transferred to `recipient`, care must be
* taken to not create reentrancy vulnerabilities. Consider using
* {ReentrancyGuard} or the
* https://solidity.readthedocs.io/en/v0.8.20/security-considerations.html#use-the-checks-effects-interactions-pattern[checks-effects-interactions pattern].
*/
function sendValue(address payable recipient, uint256 amount) internal {
if (address(this).balance < amount) {
revert Errors.InsufficientBalance(address(this).balance, amount);
}
(bool success, ) = recipient.call{value: amount}("");
if (!success) {
revert Errors.FailedCall();
}
}
/**
* @dev Performs a Solidity function call using a low level `call`. A
* plain `call` is an unsafe replacement for a function call: use this
* function instead.
*
* If `target` reverts with a revert reason or custom error, it is bubbled
* up by this function (like regular Solidity function calls). However, if
* the call reverted with no returned reason, this function reverts with a
* {Errors.FailedCall} error.
*
* Returns the raw returned data. To convert to the expected return value,
* use https://solidity.readthedocs.io/en/latest/units-and-global-variables.html?highlight=abi.decode#abi-encoding-and-decoding-functions[`abi.decode`].
*
* Requirements:
*
* - `target` must be a contract.
* - calling `target` with `data` must not revert.
*/
function functionCall(address target, bytes memory data) internal returns (bytes memory) {
return functionCallWithValue(target, data, 0);
}
/**
* @dev Same as {xref-Address-functionCall-address-bytes-}[`functionCall`],
* but also transferring `value` wei to `target`.
*
* Requirements:
*
* - the calling contract must have an ETH balance of at least `value`.
* - the called Solidity function must be `payable`.
*/
function functionCallWithValue(address target, bytes memory data, uint256 value) internal returns (bytes memory) {
if (address(this).balance < value) {
revert Errors.InsufficientBalance(address(this).balance, value);
}
(bool success, bytes memory returndata) = target.call{value: value}(data);
return verifyCallResultFromTarget(target, success, returndata);
}
/**
* @dev Same as {xref-Address-functionCall-address-bytes-}[`functionCall`],
* but performing a static call.
*/
function functionStaticCall(address target, bytes memory data) internal view returns (bytes memory) {
(bool success, bytes memory returndata) = target.staticcall(data);
return verifyCallResultFromTarget(target, success, returndata);
}
/**
* @dev Same as {xref-Address-functionCall-address-bytes-}[`functionCall`],
* but performing a delegate call.
*/
function functionDelegateCall(address target, bytes memory data) internal returns (bytes memory) {
(bool success, bytes memory returndata) = target.delegatecall(data);
return verifyCallResultFromTarget(target, success, returndata);
}
/**
* @dev Tool to verify that a low level call to smart-contract was successful, and reverts if the target
* was not a contract or bubbling up the revert reason (falling back to {Errors.FailedCall}) in case
* of an unsuccessful call.
*/
function verifyCallResultFromTarget(
address target,
bool success,
bytes memory returndata
) internal view returns (bytes memory) {
if (!success) {
_revert(returndata);
} else {
// only check if target is a contract if the call was successful and the return data is empty
// otherwise we already know that it was a contract
if (returndata.length == 0 && target.code.length == 0) {
revert AddressEmptyCode(target);
}
return returndata;
}
}
/**
* @dev Tool to verify that a low level call was successful, and reverts if it wasn't, either by bubbling the
* revert reason or with a default {Errors.FailedCall} error.
*/
function verifyCallResult(bool success, bytes memory returndata) internal pure returns (bytes memory) {
if (!success) {
_revert(returndata);
} else {
return returndata;
}
}
/**
* @dev Reverts with returndata if present. Otherwise reverts with {Errors.FailedCall}.
*/
function _revert(bytes memory returndata) private pure {
// Look for revert reason and bubble it up if present
if (returndata.length > 0) {
// The easiest way to bubble the revert reason is using memory via assembly
assembly ("memory-safe") {
let returndata_size := mload(returndata)
revert(add(32, returndata), returndata_size)
}
} else {
revert Errors.FailedCall();
}
}
}
// File: contracts/Gobs.sol
pragma solidity ^0.8.0;
interface IGobsDataSource {
function getGobSVG(uint256 tokenId) external view returns (string memory);
function getTraits(uint256 tokenId) external view returns (string memory);
}
contract Gobs is ERC721, Ownable {
uint256 public constant MAX_SUPPLY = 2222;
uint256 private _tokenIdCounter;
address public dataSource;
using Strings for uint256;
bool public mintActive;
uint256 private hands;
mapping(address => uint256) public userTokenCount;
// Mapping to track which ERC721 contracts are allowed
mapping(address => bool) public allowedERC721Contracts;
// Mapping to track which token IDs of the allowed ERC721 contracts have been claimed
mapping(address => mapping(uint256 => bool)) public claimedTokens;
event OpenTheMine();
constructor(address _dataSource) ERC721("GobsNFT", "GOBS") Ownable(msg.sender){
dataSource = _dataSource;
}
function setDataSource(address _dataSource) public onlyOwner {
dataSource = _dataSource;
}
function addAllowedERC721Contract(address contractAddress) public onlyOwner {
allowedERC721Contracts[contractAddress] = true;
}
function removeAllowedERC721Contract(address contractAddress) public onlyOwner {
allowedERC721Contracts[contractAddress] = false;
}
function hasTokenClaimed(address contractAddress, uint256 tokenId) public view returns (bool) {
return claimedTokens[contractAddress][tokenId];
}
function mint(address erc721Contract, uint256 erc721TokenId) public {
require(mintActive == true, "Mint not active");
require(_tokenIdCounter < MAX_SUPPLY, "Max supply reached");
// Ensure the ERC721 contract is in the list of allowed contracts
require(allowedERC721Contracts[erc721Contract], "ERC721 contract not allowed");
// Check that the msg.sender is the owner of the ERC721 token
require(verifyTokenOwnership(erc721Contract, erc721TokenId), "You do not own the specified token");
// Check if this specific token has already been used to claim
require(!claimedTokens[erc721Contract][erc721TokenId], "This token has already been used to claim");
// Mark the token as claimed
claimedTokens[erc721Contract][erc721TokenId] = true;
_tokenIdCounter++;
_safeMint(msg.sender, _tokenIdCounter);
}
function toggleMintActive() public onlyOwner {
mintActive = !mintActive;
}
function tokenURI(uint256 tokenId) public view override returns (string memory) {
require(tokenId <= _tokenIdCounter, "Token does not exist");
string memory svg = IGobsDataSource(dataSource).getGobSVG(tokenId);
string memory traits = IGobsDataSource(dataSource).getTraits(tokenId);
bytes memory json = abi.encodePacked(
'{"name": "Gob #', tokenId.toString(),
'", "description": "On-chain Gob NFT", "image": "data:image/svg+xml;base64,',
Base64.encode(bytes(svg)),
'", "attributes": ', traits, '}'
);
return string(
abi.encodePacked(
"data:application/json;base64,",
Base64.encode(json)
)
);
}
function placeHand() public {
uint256 userBalance = balanceOf(msg.sender);
uint256 newTokens = userBalance - userTokenCount[msg.sender];
require(newTokens > 0, "No new tokens to place");
userTokenCount[msg.sender] = userBalance;
hands += newTokens;
if (hands >= 555) {
emit OpenTheMine();
}
}
function withdrawERC20(address tokenAddress, uint256 amount) public onlyOwner {
IERC20 token = IERC20(tokenAddress);
require(token.transfer(msg.sender, amount), "Transfer failed");
}
function withdrawNFT(address nftAddress, uint256 tokenId) public onlyOwner {
IERC721 nft = IERC721(nftAddress);
nft.safeTransferFrom(address(this), msg.sender, tokenId);
}
function verifyTokenOwnership(address erc721Contract, uint256 erc721TokenId) public view returns (bool) {
require(allowedERC721Contracts[erc721Contract], "ERC721 contract not allowed");
// Check if msg.sender owns the token
address tokenOwner = IERC721(erc721Contract).ownerOf(erc721TokenId);
return (tokenOwner == msg.sender);
}
}[{"inputs":[{"internalType":"address","name":"_dataSource","type":"address"}],"stateMutability":"nonpayable","type":"constructor"},{"inputs":[{"internalType":"address","name":"sender","type":"address"},{"internalType":"uint256","name":"tokenId","type":"uint256"},{"internalType":"address","name":"owner","type":"address"}],"name":"ERC721IncorrectOwner","type":"error"},{"inputs":[{"internalType":"address","name":"operator","type":"address"},{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"ERC721InsufficientApproval","type":"error"},{"inputs":[{"internalType":"address","name":"approver","type":"address"}],"name":"ERC721InvalidApprover","type":"error"},{"inputs":[{"internalType":"address","name":"operator","type":"address"}],"name":"ERC721InvalidOperator","type":"error"},{"inputs":[{"internalType":"address","name":"owner","type":"address"}],"name":"ERC721InvalidOwner","type":"error"},{"inputs":[{"internalType":"address","name":"receiver","type":"address"}],"name":"ERC721InvalidReceiver","type":"error"},{"inputs":[{"internalType":"address","name":"sender","type":"address"}],"name":"ERC721InvalidSender","type":"error"},{"inputs":[{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"ERC721NonexistentToken","type":"error"},{"inputs":[{"internalType":"address","name":"owner","type":"address"}],"name":"OwnableInvalidOwner","type":"error"},{"inputs":[{"internalType":"address","name":"account","type":"address"}],"name":"OwnableUnauthorizedAccount","type":"error"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"owner","type":"address"},{"indexed":true,"internalType":"address","name":"approved","type":"address"},{"indexed":true,"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"Approval","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"owner","type":"address"},{"indexed":true,"internalType":"address","name":"operator","type":"address"},{"indexed":false,"internalType":"bool","name":"approved","type":"bool"}],"name":"ApprovalForAll","type":"event"},{"anonymous":false,"inputs":[],"name":"OpenTheMine","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"previousOwner","type":"address"},{"indexed":true,"internalType":"address","name":"newOwner","type":"address"}],"name":"OwnershipTransferred","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"from","type":"address"},{"indexed":true,"internalType":"address","name":"to","type":"address"},{"indexed":true,"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"Transfer","type":"event"},{"inputs":[],"name":"MAX_SUPPLY","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"contractAddress","type":"address"}],"name":"addAllowedERC721Contract","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"","type":"address"}],"name":"allowedERC721Contracts","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"to","type":"address"},{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"approve","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"owner","type":"address"}],"name":"balanceOf","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"","type":"address"},{"internalType":"uint256","name":"","type":"uint256"}],"name":"claimedTokens","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"dataSource","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"getApproved","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"contractAddress","type":"address"},{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"hasTokenClaimed","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"owner","type":"address"},{"internalType":"address","name":"operator","type":"address"}],"name":"isApprovedForAll","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"erc721Contract","type":"address"},{"internalType":"uint256","name":"erc721TokenId","type":"uint256"}],"name":"mint","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"mintActive","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"name","outputs":[{"internalType":"string","name":"","type":"string"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"owner","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"ownerOf","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"placeHand","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"contractAddress","type":"address"}],"name":"removeAllowedERC721Contract","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"renounceOwnership","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"from","type":"address"},{"internalType":"address","name":"to","type":"address"},{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"safeTransferFrom","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"from","type":"address"},{"internalType":"address","name":"to","type":"address"},{"internalType":"uint256","name":"tokenId","type":"uint256"},{"internalType":"bytes","name":"data","type":"bytes"}],"name":"safeTransferFrom","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"operator","type":"address"},{"internalType":"bool","name":"approved","type":"bool"}],"name":"setApprovalForAll","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"_dataSource","type":"address"}],"name":"setDataSource","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"bytes4","name":"interfaceId","type":"bytes4"}],"name":"supportsInterface","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"symbol","outputs":[{"internalType":"string","name":"","type":"string"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"toggleMintActive","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"tokenURI","outputs":[{"internalType":"string","name":"","type":"string"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"from","type":"address"},{"internalType":"address","name":"to","type":"address"},{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"transferFrom","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"newOwner","type":"address"}],"name":"transferOwnership","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"","type":"address"}],"name":"userTokenCount","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"erc721Contract","type":"address"},{"internalType":"uint256","name":"erc721TokenId","type":"uint256"}],"name":"verifyTokenOwnership","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"tokenAddress","type":"address"},{"internalType":"uint256","name":"amount","type":"uint256"}],"name":"withdrawERC20","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"nftAddress","type":"address"},{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"withdrawNFT","outputs":[],"stateMutability":"nonpayable","type":"function"}]Contract Creation Code
608060405234801561000f575f80fd5b50604051613cf0380380613cf0833981810160405281019061003191906102a6565b336040518060400160405280600781526020017f476f62734e4654000000000000000000000000000000000000000000000000008152506040518060400160405280600481526020017f474f425300000000000000000000000000000000000000000000000000000000815250815f90816100ac919061050b565b5080600190816100bc919061050b565b5050505f73ffffffffffffffffffffffffffffffffffffffff168173ffffffffffffffffffffffffffffffffffffffff160361012f575f6040517f1e4fbdf700000000000000000000000000000000000000000000000000000000815260040161012691906105e9565b60405180910390fd5b61013e8161018560201b60201c565b508060085f6101000a81548173ffffffffffffffffffffffffffffffffffffffff021916908373ffffffffffffffffffffffffffffffffffffffff16021790555050610602565b5f60065f9054906101000a900473ffffffffffffffffffffffffffffffffffffffff1690508160065f6101000a81548173ffffffffffffffffffffffffffffffffffffffff021916908373ffffffffffffffffffffffffffffffffffffffff1602179055508173ffffffffffffffffffffffffffffffffffffffff168173ffffffffffffffffffffffffffffffffffffffff167f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e060405160405180910390a35050565b5f80fd5b5f73ffffffffffffffffffffffffffffffffffffffff82169050919050565b5f6102758261024c565b9050919050565b6102858161026b565b811461028f575f80fd5b50565b5f815190506102a08161027c565b92915050565b5f602082840312156102bb576102ba610248565b5b5f6102c884828501610292565b91505092915050565b5f81519050919050565b7f4e487b71000000000000000000000000000000000000000000000000000000005f52604160045260245ffd5b7f4e487b71000000000000000000000000000000000000000000000000000000005f52602260045260245ffd5b5f600282049050600182168061034c57607f821691505b60208210810361035f5761035e610308565b5b50919050565b5f819050815f5260205f209050919050565b5f6020601f8301049050919050565b5f82821b905092915050565b5f600883026103c17fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff82610386565b6103cb8683610386565b95508019841693508086168417925050509392505050565b5f819050919050565b5f819050919050565b5f61040f61040a610405846103e3565b6103ec565b6103e3565b9050919050565b5f819050919050565b610428836103f5565b61043c61043482610416565b848454610392565b825550505050565b5f90565b610450610444565b61045b81848461041f565b505050565b5b8181101561047e576104735f82610448565b600181019050610461565b5050565b601f8211156104c35761049481610365565b61049d84610377565b810160208510156104ac578190505b6104c06104b885610377565b830182610460565b50505b505050565b5f82821c905092915050565b5f6104e35f19846008026104c8565b1980831691505092915050565b5f6104fb83836104d4565b9150826002028217905092915050565b610514826102d1565b67ffffffffffffffff81111561052d5761052c6102db565b5b6105378254610335565b610542828285610482565b5f60209050601f831160018114610573575f8415610561578287015190505b61056b85826104f0565b8655506105d2565b601f19841661058186610365565b5f5b828110156105a857848901518255600182019150602085019450602081019050610583565b868310156105c557848901516105c1601f8916826104d4565b8355505b6001600288020188555050505b505050505050565b6105e38161026b565b82525050565b5f6020820190506105fc5f8301846105da565b92915050565b6136e18061060f5f395ff3fe608060405234801561000f575f80fd5b50600436106101ee575f3560e01c80638da5cb5b1161010d578063d199168d116100a0578063e985e9c51161006f578063e985e9c51461058c578063e9daa87e146105bc578063ef42c2d3146105ec578063f2fde38b14610608576101ee565b8063d199168d146104e0578063dc02743814610510578063e1eda59214610540578063e348da6214610570576101ee565b8063a22cb465116100dc578063a22cb4651461046e578063b88d4fde1461048a578063c87b56dd146104a6578063d02c2bf2146104d6576101ee565b80638da5cb5b146103e657806395d89b41146104045780639878982a14610422578063a1db978214610452576101ee565b806340c10f1911610185578063695b314b11610154578063695b314b1461038657806370a0823114610390578063715018a6146103c0578063755e67b1146103ca576101ee565b806340c10f191461030257806342842e0e1461031e5780636088e93a1461033a5780636352211e14610356576101ee565b80631b076edc116101c15780631b076edc1461028c57806323b872dd146102aa57806325fd90f3146102c657806332cb6b0c146102e4576101ee565b806301ffc9a7146101f257806306fdde0314610222578063081812fc14610240578063095ea7b314610270575b5f80fd5b61020c600480360381019061020791906126c5565b610624565b604051610219919061270a565b60405180910390f35b61022a610705565b6040516102379190612793565b60405180910390f35b61025a600480360381019061025591906127e6565b610794565b6040516102679190612850565b60405180910390f35b61028a60048036038101906102859190612893565b6107af565b005b6102946107c5565b6040516102a19190612850565b60405180910390f35b6102c460048036038101906102bf91906128d1565b6107ea565b005b6102ce6108e9565b6040516102db919061270a565b60405180910390f35b6102ec6108fc565b6040516102f99190612930565b60405180910390f35b61031c60048036038101906103179190612893565b610902565b005b610338600480360381019061033391906128d1565b610b94565b005b610354600480360381019061034f9190612893565b610bb3565b005b610370600480360381019061036b91906127e6565b610c2e565b60405161037d9190612850565b60405180910390f35b61038e610c3f565b005b6103aa60048036038101906103a59190612949565b610d6f565b6040516103b79190612930565b60405180910390f35b6103c8610e25565b005b6103e460048036038101906103df9190612949565b610e38565b005b6103ee610e83565b6040516103fb9190612850565b60405180910390f35b61040c610eab565b6040516104199190612793565b60405180910390f35b61043c60048036038101906104379190612949565b610f3b565b604051610449919061270a565b60405180910390f35b61046c60048036038101906104679190612893565b610f58565b005b6104886004803603810190610483919061299e565b611023565b005b6104a4600480360381019061049f9190612b08565b611039565b005b6104c060048036038101906104bb91906127e6565b61105e565b6040516104cd9190612793565b60405180910390f35b6104de61124c565b005b6104fa60048036038101906104f59190612893565b611280565b604051610507919061270a565b60405180910390f35b61052a60048036038101906105259190612949565b6112aa565b6040516105379190612930565b60405180910390f35b61055a60048036038101906105559190612893565b6112bf565b604051610567919061270a565b60405180910390f35b61058a60048036038101906105859190612949565b6113fc565b005b6105a660048036038101906105a19190612b88565b61145b565b6040516105b3919061270a565b60405180910390f35b6105d660048036038101906105d19190612893565b6114e9565b6040516105e3919061270a565b60405180910390f35b61060660048036038101906106019190612949565b61154b565b005b610622600480360381019061061d9190612949565b6115ab565b005b5f7f80ac58cd000000000000000000000000000000000000000000000000000000007bffffffffffffffffffffffffffffffffffffffffffffffffffffffff1916827bffffffffffffffffffffffffffffffffffffffffffffffffffffffff191614806106ee57507f5b5e139f000000000000000000000000000000000000000000000000000000007bffffffffffffffffffffffffffffffffffffffffffffffffffffffff1916827bffffffffffffffffffffffffffffffffffffffffffffffffffffffff1916145b806106fe57506106fd8261162f565b5b9050919050565b60605f805461071390612bf3565b80601f016020809104026020016040519081016040528092919081815260200182805461073f90612bf3565b801561078a5780601f106107615761010080835404028352916020019161078a565b820191905f5260205f20905b81548152906001019060200180831161076d57829003601f168201915b5050505050905090565b5f61079e82611698565b506107a88261171e565b9050919050565b6107c182826107bc611757565b61175e565b5050565b60085f9054906101000a900473ffffffffffffffffffffffffffffffffffffffff1681565b5f73ffffffffffffffffffffffffffffffffffffffff168273ffffffffffffffffffffffffffffffffffffffff160361085a575f6040517f64a0ae920000000000000000000000000000000000000000000000000000000081526004016108519190612850565b60405180910390fd5b5f61086d8383610868611757565b611770565b90508373ffffffffffffffffffffffffffffffffffffffff168173ffffffffffffffffffffffffffffffffffffffff16146108e3578382826040517f64283d7b0000000000000000000000000000000000000000000000000000000081526004016108da93929190612c23565b60405180910390fd5b50505050565b600860149054906101000a900460ff1681565b6108ae81565b60011515600860149054906101000a900460ff16151514610958576040517f08c379a000000000000000000000000000000000000000000000000000000000815260040161094f90612ca2565b60405180910390fd5b6108ae6007541061099e576040517f08c379a000000000000000000000000000000000000000000000000000000000815260040161099590612d0a565b60405180910390fd5b600b5f8373ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205f9054906101000a900460ff16610a27576040517f08c379a0000000000000000000000000000000000000000000000000000000008152600401610a1e90612d72565b60405180910390fd5b610a3182826112bf565b610a70576040517f08c379a0000000000000000000000000000000000000000000000000000000008152600401610a6790612e00565b60405180910390fd5b600c5f8373ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205f8281526020019081526020015f205f9054906101000a900460ff1615610b09576040517f08c379a0000000000000000000000000000000000000000000000000000000008152600401610b0090612e8e565b60405180910390fd5b6001600c5f8473ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205f8381526020019081526020015f205f6101000a81548160ff02191690831515021790555060075f815480929190610b7f90612ed9565b9190505550610b903360075461197b565b5050565b610bae83838360405180602001604052805f815250611039565b505050565b610bbb611998565b5f8290508073ffffffffffffffffffffffffffffffffffffffff166342842e0e3033856040518463ffffffff1660e01b8152600401610bfc93929190612f20565b5f604051808303815f87803b158015610c13575f80fd5b505af1158015610c25573d5f803e3d5ffd5b50505050505050565b5f610c3882611698565b9050919050565b5f610c4933610d6f565b90505f600a5f3373ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205482610c959190612f55565b90505f8111610cd9576040517f08c379a0000000000000000000000000000000000000000000000000000000008152600401610cd090612fd2565b60405180910390fd5b81600a5f3373ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f20819055508060095f828254610d2c9190612ff0565b9250508190555061022b60095410610d6b577f46b612c06ed0b37523aea4d54cebeaa959f59311bcce3201eeff7d4c84f2274760405160405180910390a15b5050565b5f8073ffffffffffffffffffffffffffffffffffffffff168273ffffffffffffffffffffffffffffffffffffffff1603610de0575f6040517f89c62b64000000000000000000000000000000000000000000000000000000008152600401610dd79190612850565b60405180910390fd5b60035f8373ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f20549050919050565b610e2d611998565b610e365f611a1f565b565b610e40611998565b8060085f6101000a81548173ffffffffffffffffffffffffffffffffffffffff021916908373ffffffffffffffffffffffffffffffffffffffff16021790555050565b5f60065f9054906101000a900473ffffffffffffffffffffffffffffffffffffffff16905090565b606060018054610eba90612bf3565b80601f0160208091040260200160405190810160405280929190818152602001828054610ee690612bf3565b8015610f315780601f10610f0857610100808354040283529160200191610f31565b820191905f5260205f20905b815481529060010190602001808311610f1457829003601f168201915b5050505050905090565b600b602052805f5260405f205f915054906101000a900460ff1681565b610f60611998565b5f8290508073ffffffffffffffffffffffffffffffffffffffff1663a9059cbb33846040518363ffffffff1660e01b8152600401610f9f929190613023565b6020604051808303815f875af1158015610fbb573d5f803e3d5ffd5b505050506040513d601f19601f82011682018060405250810190610fdf919061305e565b61101e576040517f08c379a0000000000000000000000000000000000000000000000000000000008152600401611015906130d3565b60405180910390fd5b505050565b61103561102e611757565b8383611ae2565b5050565b6110448484846107ea565b61105861104f611757565b85858585611c4b565b50505050565b60606007548211156110a5576040517f08c379a000000000000000000000000000000000000000000000000000000000815260040161109c9061313b565b60405180910390fd5b5f60085f9054906101000a900473ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff16633efabdf4846040518263ffffffff1660e01b81526004016111009190612930565b5f60405180830381865afa15801561111a573d5f803e3d5ffd5b505050506040513d5f823e3d601f19601f8201168201806040525081019061114291906131f7565b90505f60085f9054906101000a900473ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1663e1dc0761856040518263ffffffff1660e01b815260040161119f9190612930565b5f60405180830381865afa1580156111b9573d5f803e3d5ffd5b505050506040513d5f823e3d601f19601f820116820180604052508101906111e191906131f7565b90505f6111ed85611df7565b6111f684611ec1565b83604051602001611209939291906133ec565b604051602081830303815290604052905061122381611ec1565b6040516020016112339190613492565b6040516020818303038152906040529350505050919050565b611254611998565b600860149054906101000a900460ff1615600860146101000a81548160ff021916908315150217905550565b600c602052815f5260405f20602052805f5260405f205f915091509054906101000a900460ff1681565b600a602052805f5260405f205f915090505481565b5f600b5f8473ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205f9054906101000a900460ff16611349576040517f08c379a000000000000000000000000000000000000000000000000000000000815260040161134090612d72565b60405180910390fd5b5f8373ffffffffffffffffffffffffffffffffffffffff16636352211e846040518263ffffffff1660e01b81526004016113839190612930565b602060405180830381865afa15801561139e573d5f803e3d5ffd5b505050506040513d601f19601f820116820180604052508101906113c291906134c7565b90503373ffffffffffffffffffffffffffffffffffffffff168173ffffffffffffffffffffffffffffffffffffffff161491505092915050565b611404611998565b5f600b5f8373ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205f6101000a81548160ff02191690831515021790555050565b5f60055f8473ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205f8373ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205f9054906101000a900460ff16905092915050565b5f600c5f8473ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205f8381526020019081526020015f205f9054906101000a900460ff16905092915050565b611553611998565b6001600b5f8373ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205f6101000a81548160ff02191690831515021790555050565b6115b3611998565b5f73ffffffffffffffffffffffffffffffffffffffff168173ffffffffffffffffffffffffffffffffffffffff1603611623575f6040517f1e4fbdf700000000000000000000000000000000000000000000000000000000815260040161161a9190612850565b60405180910390fd5b61162c81611a1f565b50565b5f7f01ffc9a7000000000000000000000000000000000000000000000000000000007bffffffffffffffffffffffffffffffffffffffffffffffffffffffff1916827bffffffffffffffffffffffffffffffffffffffffffffffffffffffff1916149050919050565b5f806116a383611eee565b90505f73ffffffffffffffffffffffffffffffffffffffff168173ffffffffffffffffffffffffffffffffffffffff160361171557826040517f7e27328900000000000000000000000000000000000000000000000000000000815260040161170c9190612930565b60405180910390fd5b80915050919050565b5f60045f8381526020019081526020015f205f9054906101000a900473ffffffffffffffffffffffffffffffffffffffff169050919050565b5f33905090565b61176b8383836001611f27565b505050565b5f8061177b84611eee565b90505f73ffffffffffffffffffffffffffffffffffffffff168373ffffffffffffffffffffffffffffffffffffffff16146117bc576117bb8184866120e6565b5b5f73ffffffffffffffffffffffffffffffffffffffff168173ffffffffffffffffffffffffffffffffffffffff1614611847576117fb5f855f80611f27565b600160035f8373ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205f82825403925050819055505b5f73ffffffffffffffffffffffffffffffffffffffff168573ffffffffffffffffffffffffffffffffffffffff16146118c657600160035f8773ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205f82825401925050819055505b8460025f8681526020019081526020015f205f6101000a81548173ffffffffffffffffffffffffffffffffffffffff021916908373ffffffffffffffffffffffffffffffffffffffff160217905550838573ffffffffffffffffffffffffffffffffffffffff168273ffffffffffffffffffffffffffffffffffffffff167fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef60405160405180910390a4809150509392505050565b611994828260405180602001604052805f8152506121a9565b5050565b6119a0611757565b73ffffffffffffffffffffffffffffffffffffffff166119be610e83565b73ffffffffffffffffffffffffffffffffffffffff1614611a1d576119e1611757565b6040517f118cdaa7000000000000000000000000000000000000000000000000000000008152600401611a149190612850565b60405180910390fd5b565b5f60065f9054906101000a900473ffffffffffffffffffffffffffffffffffffffff1690508160065f6101000a81548173ffffffffffffffffffffffffffffffffffffffff021916908373ffffffffffffffffffffffffffffffffffffffff1602179055508173ffffffffffffffffffffffffffffffffffffffff168173ffffffffffffffffffffffffffffffffffffffff167f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e060405160405180910390a35050565b5f73ffffffffffffffffffffffffffffffffffffffff168273ffffffffffffffffffffffffffffffffffffffff1603611b5257816040517f5b08ba18000000000000000000000000000000000000000000000000000000008152600401611b499190612850565b60405180910390fd5b8060055f8573ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205f8473ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205f6101000a81548160ff0219169083151502179055508173ffffffffffffffffffffffffffffffffffffffff168373ffffffffffffffffffffffffffffffffffffffff167f17307eab39ab6107e8899845ad3d59bd9653f200f220920489ca2b5937696c3183604051611c3e919061270a565b60405180910390a3505050565b5f8373ffffffffffffffffffffffffffffffffffffffff163b1115611df0578273ffffffffffffffffffffffffffffffffffffffff1663150b7a02868685856040518563ffffffff1660e01b8152600401611ca99493929190613544565b6020604051808303815f875af1925050508015611ce457506040513d601f19601f82011682018060405250810190611ce191906135a2565b60015b611d65573d805f8114611d12576040519150601f19603f3d011682016040523d82523d5f602084013e611d17565b606091505b505f815103611d5d57836040517f64a0ae92000000000000000000000000000000000000000000000000000000008152600401611d549190612850565b60405180910390fd5b805181602001fd5b63150b7a0260e01b7bffffffffffffffffffffffffffffffffffffffffffffffffffffffff1916817bffffffffffffffffffffffffffffffffffffffffffffffffffffffff191614611dee57836040517f64a0ae92000000000000000000000000000000000000000000000000000000008152600401611de59190612850565b60405180910390fd5b505b5050505050565b60605f6001611e05846121cc565b0190505f8167ffffffffffffffff811115611e2357611e226129e4565b5b6040519080825280601f01601f191660200182016040528015611e555781602001600182028036833780820191505090505b5090505f82602001820190505b600115611eb6578080600190039150507f3031323334353637383961626364656600000000000000000000000000000000600a86061a8153600a8581611eab57611eaa6135cd565b5b0494505f8503611e62575b819350505050919050565b6060611ee78260405180606001604052806040815260200161366c60409139600161231d565b9050919050565b5f60025f8381526020019081526020015f205f9054906101000a900473ffffffffffffffffffffffffffffffffffffffff169050919050565b8080611f5f57505f73ffffffffffffffffffffffffffffffffffffffff168273ffffffffffffffffffffffffffffffffffffffff1614155b15612091575f611f6e84611698565b90505f73ffffffffffffffffffffffffffffffffffffffff168373ffffffffffffffffffffffffffffffffffffffff1614158015611fd857508273ffffffffffffffffffffffffffffffffffffffff168173ffffffffffffffffffffffffffffffffffffffff1614155b8015611feb5750611fe9818461145b565b155b1561202d57826040517fa9fbf51f0000000000000000000000000000000000000000000000000000000081526004016120249190612850565b60405180910390fd5b811561208f57838573ffffffffffffffffffffffffffffffffffffffff168273ffffffffffffffffffffffffffffffffffffffff167f8c5be1e5ebec7d5bd14f71427d1e84f3dd0314c0f7b2291e5b200ac8c7c3b92560405160405180910390a45b505b8360045f8581526020019081526020015f205f6101000a81548173ffffffffffffffffffffffffffffffffffffffff021916908373ffffffffffffffffffffffffffffffffffffffff16021790555050505050565b6120f18383836124ac565b6121a4575f73ffffffffffffffffffffffffffffffffffffffff168373ffffffffffffffffffffffffffffffffffffffff160361216557806040517f7e27328900000000000000000000000000000000000000000000000000000000815260040161215c9190612930565b60405180910390fd5b81816040517f177e802f00000000000000000000000000000000000000000000000000000000815260040161219b929190613023565b60405180910390fd5b505050565b6121b3838361256c565b6121c76121be611757565b5f858585611c4b565b505050565b5f805f90507a184f03e93ff9f4daa797ed6e38ed64bf6a1f0100000000000000008310612228577a184f03e93ff9f4daa797ed6e38ed64bf6a1f010000000000000000838161221e5761221d6135cd565b5b0492506040810190505b6d04ee2d6d415b85acef81000000008310612265576d04ee2d6d415b85acef8100000000838161225b5761225a6135cd565b5b0492506020810190505b662386f26fc10000831061229457662386f26fc10000838161228a576122896135cd565b5b0492506010810190505b6305f5e10083106122bd576305f5e10083816122b3576122b26135cd565b5b0492506008810190505b61271083106122e25761271083816122d8576122d76135cd565b5b0492506004810190505b6064831061230557606483816122fb576122fa6135cd565b5b0492506002810190505b600a8310612314576001810190505b80915050919050565b60605f84510361233d5760405180602001604052805f81525090506124a5565b5f8261236e57600360028651600461235591906135fa565b61235f9190612ff0565b612369919061363b565b612395565b60036002865161237e9190612ff0565b612388919061363b565b600461239491906135fa565b5b90505f8167ffffffffffffffff8111156123b2576123b16129e4565b5b6040519080825280601f01601f1916602001820160405280156123e45781602001600182028036833780820191505090505b509050600185016020820187885189016020810180515f82525b82841015612459576003840193508351603f8160121c168701518653600186019550603f81600c1c168701518653600186019550603f8160061c168701518653600186019550603f81168701518653600186019550506123fe565b80825289156124995760038c51066001811461247c576002811461248f57612497565b603d6001870353603d6002870353612497565b603d60018703535b505b50505050505080925050505b9392505050565b5f8073ffffffffffffffffffffffffffffffffffffffff168373ffffffffffffffffffffffffffffffffffffffff161415801561256357508273ffffffffffffffffffffffffffffffffffffffff168473ffffffffffffffffffffffffffffffffffffffff1614806125245750612523848461145b565b5b8061256257508273ffffffffffffffffffffffffffffffffffffffff1661254a8361171e565b73ffffffffffffffffffffffffffffffffffffffff16145b5b90509392505050565b5f73ffffffffffffffffffffffffffffffffffffffff168273ffffffffffffffffffffffffffffffffffffffff16036125dc575f6040517f64a0ae920000000000000000000000000000000000000000000000000000000081526004016125d39190612850565b60405180910390fd5b5f6125e883835f611770565b90505f73ffffffffffffffffffffffffffffffffffffffff168173ffffffffffffffffffffffffffffffffffffffff161461265a575f6040517f73c6ac6e0000000000000000000000000000000000000000000000000000000081526004016126519190612850565b60405180910390fd5b505050565b5f604051905090565b5f80fd5b5f80fd5b5f7fffffffff0000000000000000000000000000000000000000000000000000000082169050919050565b6126a481612670565b81146126ae575f80fd5b50565b5f813590506126bf8161269b565b92915050565b5f602082840312156126da576126d9612668565b5b5f6126e7848285016126b1565b91505092915050565b5f8115159050919050565b612704816126f0565b82525050565b5f60208201905061271d5f8301846126fb565b92915050565b5f81519050919050565b5f82825260208201905092915050565b8281835e5f83830152505050565b5f601f19601f8301169050919050565b5f61276582612723565b61276f818561272d565b935061277f81856020860161273d565b6127888161274b565b840191505092915050565b5f6020820190508181035f8301526127ab818461275b565b905092915050565b5f819050919050565b6127c5816127b3565b81146127cf575f80fd5b50565b5f813590506127e0816127bc565b92915050565b5f602082840312156127fb576127fa612668565b5b5f612808848285016127d2565b91505092915050565b5f73ffffffffffffffffffffffffffffffffffffffff82169050919050565b5f61283a82612811565b9050919050565b61284a81612830565b82525050565b5f6020820190506128635f830184612841565b92915050565b61287281612830565b811461287c575f80fd5b50565b5f8135905061288d81612869565b92915050565b5f80604083850312156128a9576128a8612668565b5b5f6128b68582860161287f565b92505060206128c7858286016127d2565b9150509250929050565b5f805f606084860312156128e8576128e7612668565b5b5f6128f58682870161287f565b93505060206129068682870161287f565b9250506040612917868287016127d2565b9150509250925092565b61292a816127b3565b82525050565b5f6020820190506129435f830184612921565b92915050565b5f6020828403121561295e5761295d612668565b5b5f61296b8482850161287f565b91505092915050565b61297d816126f0565b8114612987575f80fd5b50565b5f8135905061299881612974565b92915050565b5f80604083850312156129b4576129b3612668565b5b5f6129c18582860161287f565b92505060206129d28582860161298a565b9150509250929050565b5f80fd5b5f80fd5b7f4e487b71000000000000000000000000000000000000000000000000000000005f52604160045260245ffd5b612a1a8261274b565b810181811067ffffffffffffffff82111715612a3957612a386129e4565b5b80604052505050565b5f612a4b61265f565b9050612a578282612a11565b919050565b5f67ffffffffffffffff821115612a7657612a756129e4565b5b612a7f8261274b565b9050602081019050919050565b828183375f83830152505050565b5f612aac612aa784612a5c565b612a42565b905082815260208101848484011115612ac857612ac76129e0565b5b612ad3848285612a8c565b509392505050565b5f82601f830112612aef57612aee6129dc565b5b8135612aff848260208601612a9a565b91505092915050565b5f805f8060808587031215612b2057612b1f612668565b5b5f612b2d8782880161287f565b9450506020612b3e8782880161287f565b9350506040612b4f878288016127d2565b925050606085013567ffffffffffffffff811115612b7057612b6f61266c565b5b612b7c87828801612adb565b91505092959194509250565b5f8060408385031215612b9e57612b9d612668565b5b5f612bab8582860161287f565b9250506020612bbc8582860161287f565b9150509250929050565b7f4e487b71000000000000000000000000000000000000000000000000000000005f52602260045260245ffd5b5f6002820490506001821680612c0a57607f821691505b602082108103612c1d57612c1c612bc6565b5b50919050565b5f606082019050612c365f830186612841565b612c436020830185612921565b612c506040830184612841565b949350505050565b7f4d696e74206e6f742061637469766500000000000000000000000000000000005f82015250565b5f612c8c600f8361272d565b9150612c9782612c58565b602082019050919050565b5f6020820190508181035f830152612cb981612c80565b9050919050565b7f4d617820737570706c79207265616368656400000000000000000000000000005f82015250565b5f612cf460128361272d565b9150612cff82612cc0565b602082019050919050565b5f6020820190508181035f830152612d2181612ce8565b9050919050565b7f45524337323120636f6e7472616374206e6f7420616c6c6f77656400000000005f82015250565b5f612d5c601b8361272d565b9150612d6782612d28565b602082019050919050565b5f6020820190508181035f830152612d8981612d50565b9050919050565b7f596f7520646f206e6f74206f776e207468652073706563696669656420746f6b5f8201527f656e000000000000000000000000000000000000000000000000000000000000602082015250565b5f612dea60228361272d565b9150612df582612d90565b604082019050919050565b5f6020820190508181035f830152612e1781612dde565b9050919050565b7f5468697320746f6b656e2068617320616c7265616479206265656e20757365645f8201527f20746f20636c61696d0000000000000000000000000000000000000000000000602082015250565b5f612e7860298361272d565b9150612e8382612e1e565b604082019050919050565b5f6020820190508181035f830152612ea581612e6c565b9050919050565b7f4e487b71000000000000000000000000000000000000000000000000000000005f52601160045260245ffd5b5f612ee3826127b3565b91507fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff8203612f1557612f14612eac565b5b600182019050919050565b5f606082019050612f335f830186612841565b612f406020830185612841565b612f4d6040830184612921565b949350505050565b5f612f5f826127b3565b9150612f6a836127b3565b9250828203905081811115612f8257612f81612eac565b5b92915050565b7f4e6f206e657720746f6b656e7320746f20706c616365000000000000000000005f82015250565b5f612fbc60168361272d565b9150612fc782612f88565b602082019050919050565b5f6020820190508181035f830152612fe981612fb0565b9050919050565b5f612ffa826127b3565b9150613005836127b3565b925082820190508082111561301d5761301c612eac565b5b92915050565b5f6040820190506130365f830185612841565b6130436020830184612921565b9392505050565b5f8151905061305881612974565b92915050565b5f6020828403121561307357613072612668565b5b5f6130808482850161304a565b91505092915050565b7f5472616e73666572206661696c656400000000000000000000000000000000005f82015250565b5f6130bd600f8361272d565b91506130c882613089565b602082019050919050565b5f6020820190508181035f8301526130ea816130b1565b9050919050565b7f546f6b656e20646f6573206e6f742065786973740000000000000000000000005f82015250565b5f61312560148361272d565b9150613130826130f1565b602082019050919050565b5f6020820190508181035f83015261315281613119565b9050919050565b5f67ffffffffffffffff821115613173576131726129e4565b5b61317c8261274b565b9050602081019050919050565b5f61319b61319684613159565b612a42565b9050828152602081018484840111156131b7576131b66129e0565b5b6131c284828561273d565b509392505050565b5f82601f8301126131de576131dd6129dc565b5b81516131ee848260208601613189565b91505092915050565b5f6020828403121561320c5761320b612668565b5b5f82015167ffffffffffffffff8111156132295761322861266c565b5b613235848285016131ca565b91505092915050565b5f81905092915050565b7f7b226e616d65223a2022476f62202300000000000000000000000000000000005f82015250565b5f61327c600f8361323e565b915061328782613248565b600f82019050919050565b5f61329c82612723565b6132a6818561323e565b93506132b681856020860161273d565b80840191505092915050565b7f222c20226465736372697074696f6e223a20224f6e2d636861696e20476f62205f8201527f4e4654222c2022696d616765223a2022646174613a696d6167652f7376672b7860208201527f6d6c3b6261736536342c00000000000000000000000000000000000000000000604082015250565b5f613342604a8361323e565b915061334d826132c2565b604a82019050919050565b7f222c202261747472696275746573223a200000000000000000000000000000005f82015250565b5f61338c60118361323e565b915061339782613358565b601182019050919050565b7f7d000000000000000000000000000000000000000000000000000000000000005f82015250565b5f6133d660018361323e565b91506133e1826133a2565b600182019050919050565b5f6133f682613270565b91506134028286613292565b915061340d82613336565b91506134198285613292565b915061342482613380565b91506134308284613292565b915061343b826133ca565b9150819050949350505050565b7f646174613a6170706c69636174696f6e2f6a736f6e3b6261736536342c0000005f82015250565b5f61347c601d8361323e565b915061348782613448565b601d82019050919050565b5f61349c82613470565b91506134a88284613292565b915081905092915050565b5f815190506134c181612869565b92915050565b5f602082840312156134dc576134db612668565b5b5f6134e9848285016134b3565b91505092915050565b5f81519050919050565b5f82825260208201905092915050565b5f613516826134f2565b61352081856134fc565b935061353081856020860161273d565b6135398161274b565b840191505092915050565b5f6080820190506135575f830187612841565b6135646020830186612841565b6135716040830185612921565b8181036060830152613583818461350c565b905095945050505050565b5f8151905061359c8161269b565b92915050565b5f602082840312156135b7576135b6612668565b5b5f6135c48482850161358e565b91505092915050565b7f4e487b71000000000000000000000000000000000000000000000000000000005f52601260045260245ffd5b5f613604826127b3565b915061360f836127b3565b925082820261361d816127b3565b9150828204841483151761363457613633612eac565b5b5092915050565b5f613645826127b3565b9150613650836127b3565b9250826136605761365f6135cd565b5b82820490509291505056fe4142434445464748494a4b4c4d4e4f505152535455565758595a6162636465666768696a6b6c6d6e6f707172737475767778797a303132333435363738392b2fa264697066735822122066578d2d8438a6e4094965ffc067f3279fdf332c78c79f94a4b66a57c1f438a364736f6c634300081a0033000000000000000000000000c20d4ba1cce177b1f09fadd8f72f2e59109b1836
Deployed Bytecode
0x608060405234801561000f575f80fd5b50600436106101ee575f3560e01c80638da5cb5b1161010d578063d199168d116100a0578063e985e9c51161006f578063e985e9c51461058c578063e9daa87e146105bc578063ef42c2d3146105ec578063f2fde38b14610608576101ee565b8063d199168d146104e0578063dc02743814610510578063e1eda59214610540578063e348da6214610570576101ee565b8063a22cb465116100dc578063a22cb4651461046e578063b88d4fde1461048a578063c87b56dd146104a6578063d02c2bf2146104d6576101ee565b80638da5cb5b146103e657806395d89b41146104045780639878982a14610422578063a1db978214610452576101ee565b806340c10f1911610185578063695b314b11610154578063695b314b1461038657806370a0823114610390578063715018a6146103c0578063755e67b1146103ca576101ee565b806340c10f191461030257806342842e0e1461031e5780636088e93a1461033a5780636352211e14610356576101ee565b80631b076edc116101c15780631b076edc1461028c57806323b872dd146102aa57806325fd90f3146102c657806332cb6b0c146102e4576101ee565b806301ffc9a7146101f257806306fdde0314610222578063081812fc14610240578063095ea7b314610270575b5f80fd5b61020c600480360381019061020791906126c5565b610624565b604051610219919061270a565b60405180910390f35b61022a610705565b6040516102379190612793565b60405180910390f35b61025a600480360381019061025591906127e6565b610794565b6040516102679190612850565b60405180910390f35b61028a60048036038101906102859190612893565b6107af565b005b6102946107c5565b6040516102a19190612850565b60405180910390f35b6102c460048036038101906102bf91906128d1565b6107ea565b005b6102ce6108e9565b6040516102db919061270a565b60405180910390f35b6102ec6108fc565b6040516102f99190612930565b60405180910390f35b61031c60048036038101906103179190612893565b610902565b005b610338600480360381019061033391906128d1565b610b94565b005b610354600480360381019061034f9190612893565b610bb3565b005b610370600480360381019061036b91906127e6565b610c2e565b60405161037d9190612850565b60405180910390f35b61038e610c3f565b005b6103aa60048036038101906103a59190612949565b610d6f565b6040516103b79190612930565b60405180910390f35b6103c8610e25565b005b6103e460048036038101906103df9190612949565b610e38565b005b6103ee610e83565b6040516103fb9190612850565b60405180910390f35b61040c610eab565b6040516104199190612793565b60405180910390f35b61043c60048036038101906104379190612949565b610f3b565b604051610449919061270a565b60405180910390f35b61046c60048036038101906104679190612893565b610f58565b005b6104886004803603810190610483919061299e565b611023565b005b6104a4600480360381019061049f9190612b08565b611039565b005b6104c060048036038101906104bb91906127e6565b61105e565b6040516104cd9190612793565b60405180910390f35b6104de61124c565b005b6104fa60048036038101906104f59190612893565b611280565b604051610507919061270a565b60405180910390f35b61052a60048036038101906105259190612949565b6112aa565b6040516105379190612930565b60405180910390f35b61055a60048036038101906105559190612893565b6112bf565b604051610567919061270a565b60405180910390f35b61058a60048036038101906105859190612949565b6113fc565b005b6105a660048036038101906105a19190612b88565b61145b565b6040516105b3919061270a565b60405180910390f35b6105d660048036038101906105d19190612893565b6114e9565b6040516105e3919061270a565b60405180910390f35b61060660048036038101906106019190612949565b61154b565b005b610622600480360381019061061d9190612949565b6115ab565b005b5f7f80ac58cd000000000000000000000000000000000000000000000000000000007bffffffffffffffffffffffffffffffffffffffffffffffffffffffff1916827bffffffffffffffffffffffffffffffffffffffffffffffffffffffff191614806106ee57507f5b5e139f000000000000000000000000000000000000000000000000000000007bffffffffffffffffffffffffffffffffffffffffffffffffffffffff1916827bffffffffffffffffffffffffffffffffffffffffffffffffffffffff1916145b806106fe57506106fd8261162f565b5b9050919050565b60605f805461071390612bf3565b80601f016020809104026020016040519081016040528092919081815260200182805461073f90612bf3565b801561078a5780601f106107615761010080835404028352916020019161078a565b820191905f5260205f20905b81548152906001019060200180831161076d57829003601f168201915b5050505050905090565b5f61079e82611698565b506107a88261171e565b9050919050565b6107c182826107bc611757565b61175e565b5050565b60085f9054906101000a900473ffffffffffffffffffffffffffffffffffffffff1681565b5f73ffffffffffffffffffffffffffffffffffffffff168273ffffffffffffffffffffffffffffffffffffffff160361085a575f6040517f64a0ae920000000000000000000000000000000000000000000000000000000081526004016108519190612850565b60405180910390fd5b5f61086d8383610868611757565b611770565b90508373ffffffffffffffffffffffffffffffffffffffff168173ffffffffffffffffffffffffffffffffffffffff16146108e3578382826040517f64283d7b0000000000000000000000000000000000000000000000000000000081526004016108da93929190612c23565b60405180910390fd5b50505050565b600860149054906101000a900460ff1681565b6108ae81565b60011515600860149054906101000a900460ff16151514610958576040517f08c379a000000000000000000000000000000000000000000000000000000000815260040161094f90612ca2565b60405180910390fd5b6108ae6007541061099e576040517f08c379a000000000000000000000000000000000000000000000000000000000815260040161099590612d0a565b60405180910390fd5b600b5f8373ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205f9054906101000a900460ff16610a27576040517f08c379a0000000000000000000000000000000000000000000000000000000008152600401610a1e90612d72565b60405180910390fd5b610a3182826112bf565b610a70576040517f08c379a0000000000000000000000000000000000000000000000000000000008152600401610a6790612e00565b60405180910390fd5b600c5f8373ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205f8281526020019081526020015f205f9054906101000a900460ff1615610b09576040517f08c379a0000000000000000000000000000000000000000000000000000000008152600401610b0090612e8e565b60405180910390fd5b6001600c5f8473ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205f8381526020019081526020015f205f6101000a81548160ff02191690831515021790555060075f815480929190610b7f90612ed9565b9190505550610b903360075461197b565b5050565b610bae83838360405180602001604052805f815250611039565b505050565b610bbb611998565b5f8290508073ffffffffffffffffffffffffffffffffffffffff166342842e0e3033856040518463ffffffff1660e01b8152600401610bfc93929190612f20565b5f604051808303815f87803b158015610c13575f80fd5b505af1158015610c25573d5f803e3d5ffd5b50505050505050565b5f610c3882611698565b9050919050565b5f610c4933610d6f565b90505f600a5f3373ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205482610c959190612f55565b90505f8111610cd9576040517f08c379a0000000000000000000000000000000000000000000000000000000008152600401610cd090612fd2565b60405180910390fd5b81600a5f3373ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f20819055508060095f828254610d2c9190612ff0565b9250508190555061022b60095410610d6b577f46b612c06ed0b37523aea4d54cebeaa959f59311bcce3201eeff7d4c84f2274760405160405180910390a15b5050565b5f8073ffffffffffffffffffffffffffffffffffffffff168273ffffffffffffffffffffffffffffffffffffffff1603610de0575f6040517f89c62b64000000000000000000000000000000000000000000000000000000008152600401610dd79190612850565b60405180910390fd5b60035f8373ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f20549050919050565b610e2d611998565b610e365f611a1f565b565b610e40611998565b8060085f6101000a81548173ffffffffffffffffffffffffffffffffffffffff021916908373ffffffffffffffffffffffffffffffffffffffff16021790555050565b5f60065f9054906101000a900473ffffffffffffffffffffffffffffffffffffffff16905090565b606060018054610eba90612bf3565b80601f0160208091040260200160405190810160405280929190818152602001828054610ee690612bf3565b8015610f315780601f10610f0857610100808354040283529160200191610f31565b820191905f5260205f20905b815481529060010190602001808311610f1457829003601f168201915b5050505050905090565b600b602052805f5260405f205f915054906101000a900460ff1681565b610f60611998565b5f8290508073ffffffffffffffffffffffffffffffffffffffff1663a9059cbb33846040518363ffffffff1660e01b8152600401610f9f929190613023565b6020604051808303815f875af1158015610fbb573d5f803e3d5ffd5b505050506040513d601f19601f82011682018060405250810190610fdf919061305e565b61101e576040517f08c379a0000000000000000000000000000000000000000000000000000000008152600401611015906130d3565b60405180910390fd5b505050565b61103561102e611757565b8383611ae2565b5050565b6110448484846107ea565b61105861104f611757565b85858585611c4b565b50505050565b60606007548211156110a5576040517f08c379a000000000000000000000000000000000000000000000000000000000815260040161109c9061313b565b60405180910390fd5b5f60085f9054906101000a900473ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff16633efabdf4846040518263ffffffff1660e01b81526004016111009190612930565b5f60405180830381865afa15801561111a573d5f803e3d5ffd5b505050506040513d5f823e3d601f19601f8201168201806040525081019061114291906131f7565b90505f60085f9054906101000a900473ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1663e1dc0761856040518263ffffffff1660e01b815260040161119f9190612930565b5f60405180830381865afa1580156111b9573d5f803e3d5ffd5b505050506040513d5f823e3d601f19601f820116820180604052508101906111e191906131f7565b90505f6111ed85611df7565b6111f684611ec1565b83604051602001611209939291906133ec565b604051602081830303815290604052905061122381611ec1565b6040516020016112339190613492565b6040516020818303038152906040529350505050919050565b611254611998565b600860149054906101000a900460ff1615600860146101000a81548160ff021916908315150217905550565b600c602052815f5260405f20602052805f5260405f205f915091509054906101000a900460ff1681565b600a602052805f5260405f205f915090505481565b5f600b5f8473ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205f9054906101000a900460ff16611349576040517f08c379a000000000000000000000000000000000000000000000000000000000815260040161134090612d72565b60405180910390fd5b5f8373ffffffffffffffffffffffffffffffffffffffff16636352211e846040518263ffffffff1660e01b81526004016113839190612930565b602060405180830381865afa15801561139e573d5f803e3d5ffd5b505050506040513d601f19601f820116820180604052508101906113c291906134c7565b90503373ffffffffffffffffffffffffffffffffffffffff168173ffffffffffffffffffffffffffffffffffffffff161491505092915050565b611404611998565b5f600b5f8373ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205f6101000a81548160ff02191690831515021790555050565b5f60055f8473ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205f8373ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205f9054906101000a900460ff16905092915050565b5f600c5f8473ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205f8381526020019081526020015f205f9054906101000a900460ff16905092915050565b611553611998565b6001600b5f8373ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205f6101000a81548160ff02191690831515021790555050565b6115b3611998565b5f73ffffffffffffffffffffffffffffffffffffffff168173ffffffffffffffffffffffffffffffffffffffff1603611623575f6040517f1e4fbdf700000000000000000000000000000000000000000000000000000000815260040161161a9190612850565b60405180910390fd5b61162c81611a1f565b50565b5f7f01ffc9a7000000000000000000000000000000000000000000000000000000007bffffffffffffffffffffffffffffffffffffffffffffffffffffffff1916827bffffffffffffffffffffffffffffffffffffffffffffffffffffffff1916149050919050565b5f806116a383611eee565b90505f73ffffffffffffffffffffffffffffffffffffffff168173ffffffffffffffffffffffffffffffffffffffff160361171557826040517f7e27328900000000000000000000000000000000000000000000000000000000815260040161170c9190612930565b60405180910390fd5b80915050919050565b5f60045f8381526020019081526020015f205f9054906101000a900473ffffffffffffffffffffffffffffffffffffffff169050919050565b5f33905090565b61176b8383836001611f27565b505050565b5f8061177b84611eee565b90505f73ffffffffffffffffffffffffffffffffffffffff168373ffffffffffffffffffffffffffffffffffffffff16146117bc576117bb8184866120e6565b5b5f73ffffffffffffffffffffffffffffffffffffffff168173ffffffffffffffffffffffffffffffffffffffff1614611847576117fb5f855f80611f27565b600160035f8373ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205f82825403925050819055505b5f73ffffffffffffffffffffffffffffffffffffffff168573ffffffffffffffffffffffffffffffffffffffff16146118c657600160035f8773ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205f82825401925050819055505b8460025f8681526020019081526020015f205f6101000a81548173ffffffffffffffffffffffffffffffffffffffff021916908373ffffffffffffffffffffffffffffffffffffffff160217905550838573ffffffffffffffffffffffffffffffffffffffff168273ffffffffffffffffffffffffffffffffffffffff167fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef60405160405180910390a4809150509392505050565b611994828260405180602001604052805f8152506121a9565b5050565b6119a0611757565b73ffffffffffffffffffffffffffffffffffffffff166119be610e83565b73ffffffffffffffffffffffffffffffffffffffff1614611a1d576119e1611757565b6040517f118cdaa7000000000000000000000000000000000000000000000000000000008152600401611a149190612850565b60405180910390fd5b565b5f60065f9054906101000a900473ffffffffffffffffffffffffffffffffffffffff1690508160065f6101000a81548173ffffffffffffffffffffffffffffffffffffffff021916908373ffffffffffffffffffffffffffffffffffffffff1602179055508173ffffffffffffffffffffffffffffffffffffffff168173ffffffffffffffffffffffffffffffffffffffff167f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e060405160405180910390a35050565b5f73ffffffffffffffffffffffffffffffffffffffff168273ffffffffffffffffffffffffffffffffffffffff1603611b5257816040517f5b08ba18000000000000000000000000000000000000000000000000000000008152600401611b499190612850565b60405180910390fd5b8060055f8573ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205f8473ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205f6101000a81548160ff0219169083151502179055508173ffffffffffffffffffffffffffffffffffffffff168373ffffffffffffffffffffffffffffffffffffffff167f17307eab39ab6107e8899845ad3d59bd9653f200f220920489ca2b5937696c3183604051611c3e919061270a565b60405180910390a3505050565b5f8373ffffffffffffffffffffffffffffffffffffffff163b1115611df0578273ffffffffffffffffffffffffffffffffffffffff1663150b7a02868685856040518563ffffffff1660e01b8152600401611ca99493929190613544565b6020604051808303815f875af1925050508015611ce457506040513d601f19601f82011682018060405250810190611ce191906135a2565b60015b611d65573d805f8114611d12576040519150601f19603f3d011682016040523d82523d5f602084013e611d17565b606091505b505f815103611d5d57836040517f64a0ae92000000000000000000000000000000000000000000000000000000008152600401611d549190612850565b60405180910390fd5b805181602001fd5b63150b7a0260e01b7bffffffffffffffffffffffffffffffffffffffffffffffffffffffff1916817bffffffffffffffffffffffffffffffffffffffffffffffffffffffff191614611dee57836040517f64a0ae92000000000000000000000000000000000000000000000000000000008152600401611de59190612850565b60405180910390fd5b505b5050505050565b60605f6001611e05846121cc565b0190505f8167ffffffffffffffff811115611e2357611e226129e4565b5b6040519080825280601f01601f191660200182016040528015611e555781602001600182028036833780820191505090505b5090505f82602001820190505b600115611eb6578080600190039150507f3031323334353637383961626364656600000000000000000000000000000000600a86061a8153600a8581611eab57611eaa6135cd565b5b0494505f8503611e62575b819350505050919050565b6060611ee78260405180606001604052806040815260200161366c60409139600161231d565b9050919050565b5f60025f8381526020019081526020015f205f9054906101000a900473ffffffffffffffffffffffffffffffffffffffff169050919050565b8080611f5f57505f73ffffffffffffffffffffffffffffffffffffffff168273ffffffffffffffffffffffffffffffffffffffff1614155b15612091575f611f6e84611698565b90505f73ffffffffffffffffffffffffffffffffffffffff168373ffffffffffffffffffffffffffffffffffffffff1614158015611fd857508273ffffffffffffffffffffffffffffffffffffffff168173ffffffffffffffffffffffffffffffffffffffff1614155b8015611feb5750611fe9818461145b565b155b1561202d57826040517fa9fbf51f0000000000000000000000000000000000000000000000000000000081526004016120249190612850565b60405180910390fd5b811561208f57838573ffffffffffffffffffffffffffffffffffffffff168273ffffffffffffffffffffffffffffffffffffffff167f8c5be1e5ebec7d5bd14f71427d1e84f3dd0314c0f7b2291e5b200ac8c7c3b92560405160405180910390a45b505b8360045f8581526020019081526020015f205f6101000a81548173ffffffffffffffffffffffffffffffffffffffff021916908373ffffffffffffffffffffffffffffffffffffffff16021790555050505050565b6120f18383836124ac565b6121a4575f73ffffffffffffffffffffffffffffffffffffffff168373ffffffffffffffffffffffffffffffffffffffff160361216557806040517f7e27328900000000000000000000000000000000000000000000000000000000815260040161215c9190612930565b60405180910390fd5b81816040517f177e802f00000000000000000000000000000000000000000000000000000000815260040161219b929190613023565b60405180910390fd5b505050565b6121b3838361256c565b6121c76121be611757565b5f858585611c4b565b505050565b5f805f90507a184f03e93ff9f4daa797ed6e38ed64bf6a1f0100000000000000008310612228577a184f03e93ff9f4daa797ed6e38ed64bf6a1f010000000000000000838161221e5761221d6135cd565b5b0492506040810190505b6d04ee2d6d415b85acef81000000008310612265576d04ee2d6d415b85acef8100000000838161225b5761225a6135cd565b5b0492506020810190505b662386f26fc10000831061229457662386f26fc10000838161228a576122896135cd565b5b0492506010810190505b6305f5e10083106122bd576305f5e10083816122b3576122b26135cd565b5b0492506008810190505b61271083106122e25761271083816122d8576122d76135cd565b5b0492506004810190505b6064831061230557606483816122fb576122fa6135cd565b5b0492506002810190505b600a8310612314576001810190505b80915050919050565b60605f84510361233d5760405180602001604052805f81525090506124a5565b5f8261236e57600360028651600461235591906135fa565b61235f9190612ff0565b612369919061363b565b612395565b60036002865161237e9190612ff0565b612388919061363b565b600461239491906135fa565b5b90505f8167ffffffffffffffff8111156123b2576123b16129e4565b5b6040519080825280601f01601f1916602001820160405280156123e45781602001600182028036833780820191505090505b509050600185016020820187885189016020810180515f82525b82841015612459576003840193508351603f8160121c168701518653600186019550603f81600c1c168701518653600186019550603f8160061c168701518653600186019550603f81168701518653600186019550506123fe565b80825289156124995760038c51066001811461247c576002811461248f57612497565b603d6001870353603d6002870353612497565b603d60018703535b505b50505050505080925050505b9392505050565b5f8073ffffffffffffffffffffffffffffffffffffffff168373ffffffffffffffffffffffffffffffffffffffff161415801561256357508273ffffffffffffffffffffffffffffffffffffffff168473ffffffffffffffffffffffffffffffffffffffff1614806125245750612523848461145b565b5b8061256257508273ffffffffffffffffffffffffffffffffffffffff1661254a8361171e565b73ffffffffffffffffffffffffffffffffffffffff16145b5b90509392505050565b5f73ffffffffffffffffffffffffffffffffffffffff168273ffffffffffffffffffffffffffffffffffffffff16036125dc575f6040517f64a0ae920000000000000000000000000000000000000000000000000000000081526004016125d39190612850565b60405180910390fd5b5f6125e883835f611770565b90505f73ffffffffffffffffffffffffffffffffffffffff168173ffffffffffffffffffffffffffffffffffffffff161461265a575f6040517f73c6ac6e0000000000000000000000000000000000000000000000000000000081526004016126519190612850565b60405180910390fd5b505050565b5f604051905090565b5f80fd5b5f80fd5b5f7fffffffff0000000000000000000000000000000000000000000000000000000082169050919050565b6126a481612670565b81146126ae575f80fd5b50565b5f813590506126bf8161269b565b92915050565b5f602082840312156126da576126d9612668565b5b5f6126e7848285016126b1565b91505092915050565b5f8115159050919050565b612704816126f0565b82525050565b5f60208201905061271d5f8301846126fb565b92915050565b5f81519050919050565b5f82825260208201905092915050565b8281835e5f83830152505050565b5f601f19601f8301169050919050565b5f61276582612723565b61276f818561272d565b935061277f81856020860161273d565b6127888161274b565b840191505092915050565b5f6020820190508181035f8301526127ab818461275b565b905092915050565b5f819050919050565b6127c5816127b3565b81146127cf575f80fd5b50565b5f813590506127e0816127bc565b92915050565b5f602082840312156127fb576127fa612668565b5b5f612808848285016127d2565b91505092915050565b5f73ffffffffffffffffffffffffffffffffffffffff82169050919050565b5f61283a82612811565b9050919050565b61284a81612830565b82525050565b5f6020820190506128635f830184612841565b92915050565b61287281612830565b811461287c575f80fd5b50565b5f8135905061288d81612869565b92915050565b5f80604083850312156128a9576128a8612668565b5b5f6128b68582860161287f565b92505060206128c7858286016127d2565b9150509250929050565b5f805f606084860312156128e8576128e7612668565b5b5f6128f58682870161287f565b93505060206129068682870161287f565b9250506040612917868287016127d2565b9150509250925092565b61292a816127b3565b82525050565b5f6020820190506129435f830184612921565b92915050565b5f6020828403121561295e5761295d612668565b5b5f61296b8482850161287f565b91505092915050565b61297d816126f0565b8114612987575f80fd5b50565b5f8135905061299881612974565b92915050565b5f80604083850312156129b4576129b3612668565b5b5f6129c18582860161287f565b92505060206129d28582860161298a565b9150509250929050565b5f80fd5b5f80fd5b7f4e487b71000000000000000000000000000000000000000000000000000000005f52604160045260245ffd5b612a1a8261274b565b810181811067ffffffffffffffff82111715612a3957612a386129e4565b5b80604052505050565b5f612a4b61265f565b9050612a578282612a11565b919050565b5f67ffffffffffffffff821115612a7657612a756129e4565b5b612a7f8261274b565b9050602081019050919050565b828183375f83830152505050565b5f612aac612aa784612a5c565b612a42565b905082815260208101848484011115612ac857612ac76129e0565b5b612ad3848285612a8c565b509392505050565b5f82601f830112612aef57612aee6129dc565b5b8135612aff848260208601612a9a565b91505092915050565b5f805f8060808587031215612b2057612b1f612668565b5b5f612b2d8782880161287f565b9450506020612b3e8782880161287f565b9350506040612b4f878288016127d2565b925050606085013567ffffffffffffffff811115612b7057612b6f61266c565b5b612b7c87828801612adb565b91505092959194509250565b5f8060408385031215612b9e57612b9d612668565b5b5f612bab8582860161287f565b9250506020612bbc8582860161287f565b9150509250929050565b7f4e487b71000000000000000000000000000000000000000000000000000000005f52602260045260245ffd5b5f6002820490506001821680612c0a57607f821691505b602082108103612c1d57612c1c612bc6565b5b50919050565b5f606082019050612c365f830186612841565b612c436020830185612921565b612c506040830184612841565b949350505050565b7f4d696e74206e6f742061637469766500000000000000000000000000000000005f82015250565b5f612c8c600f8361272d565b9150612c9782612c58565b602082019050919050565b5f6020820190508181035f830152612cb981612c80565b9050919050565b7f4d617820737570706c79207265616368656400000000000000000000000000005f82015250565b5f612cf460128361272d565b9150612cff82612cc0565b602082019050919050565b5f6020820190508181035f830152612d2181612ce8565b9050919050565b7f45524337323120636f6e7472616374206e6f7420616c6c6f77656400000000005f82015250565b5f612d5c601b8361272d565b9150612d6782612d28565b602082019050919050565b5f6020820190508181035f830152612d8981612d50565b9050919050565b7f596f7520646f206e6f74206f776e207468652073706563696669656420746f6b5f8201527f656e000000000000000000000000000000000000000000000000000000000000602082015250565b5f612dea60228361272d565b9150612df582612d90565b604082019050919050565b5f6020820190508181035f830152612e1781612dde565b9050919050565b7f5468697320746f6b656e2068617320616c7265616479206265656e20757365645f8201527f20746f20636c61696d0000000000000000000000000000000000000000000000602082015250565b5f612e7860298361272d565b9150612e8382612e1e565b604082019050919050565b5f6020820190508181035f830152612ea581612e6c565b9050919050565b7f4e487b71000000000000000000000000000000000000000000000000000000005f52601160045260245ffd5b5f612ee3826127b3565b91507fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff8203612f1557612f14612eac565b5b600182019050919050565b5f606082019050612f335f830186612841565b612f406020830185612841565b612f4d6040830184612921565b949350505050565b5f612f5f826127b3565b9150612f6a836127b3565b9250828203905081811115612f8257612f81612eac565b5b92915050565b7f4e6f206e657720746f6b656e7320746f20706c616365000000000000000000005f82015250565b5f612fbc60168361272d565b9150612fc782612f88565b602082019050919050565b5f6020820190508181035f830152612fe981612fb0565b9050919050565b5f612ffa826127b3565b9150613005836127b3565b925082820190508082111561301d5761301c612eac565b5b92915050565b5f6040820190506130365f830185612841565b6130436020830184612921565b9392505050565b5f8151905061305881612974565b92915050565b5f6020828403121561307357613072612668565b5b5f6130808482850161304a565b91505092915050565b7f5472616e73666572206661696c656400000000000000000000000000000000005f82015250565b5f6130bd600f8361272d565b91506130c882613089565b602082019050919050565b5f6020820190508181035f8301526130ea816130b1565b9050919050565b7f546f6b656e20646f6573206e6f742065786973740000000000000000000000005f82015250565b5f61312560148361272d565b9150613130826130f1565b602082019050919050565b5f6020820190508181035f83015261315281613119565b9050919050565b5f67ffffffffffffffff821115613173576131726129e4565b5b61317c8261274b565b9050602081019050919050565b5f61319b61319684613159565b612a42565b9050828152602081018484840111156131b7576131b66129e0565b5b6131c284828561273d565b509392505050565b5f82601f8301126131de576131dd6129dc565b5b81516131ee848260208601613189565b91505092915050565b5f6020828403121561320c5761320b612668565b5b5f82015167ffffffffffffffff8111156132295761322861266c565b5b613235848285016131ca565b91505092915050565b5f81905092915050565b7f7b226e616d65223a2022476f62202300000000000000000000000000000000005f82015250565b5f61327c600f8361323e565b915061328782613248565b600f82019050919050565b5f61329c82612723565b6132a6818561323e565b93506132b681856020860161273d565b80840191505092915050565b7f222c20226465736372697074696f6e223a20224f6e2d636861696e20476f62205f8201527f4e4654222c2022696d616765223a2022646174613a696d6167652f7376672b7860208201527f6d6c3b6261736536342c00000000000000000000000000000000000000000000604082015250565b5f613342604a8361323e565b915061334d826132c2565b604a82019050919050565b7f222c202261747472696275746573223a200000000000000000000000000000005f82015250565b5f61338c60118361323e565b915061339782613358565b601182019050919050565b7f7d000000000000000000000000000000000000000000000000000000000000005f82015250565b5f6133d660018361323e565b91506133e1826133a2565b600182019050919050565b5f6133f682613270565b91506134028286613292565b915061340d82613336565b91506134198285613292565b915061342482613380565b91506134308284613292565b915061343b826133ca565b9150819050949350505050565b7f646174613a6170706c69636174696f6e2f6a736f6e3b6261736536342c0000005f82015250565b5f61347c601d8361323e565b915061348782613448565b601d82019050919050565b5f61349c82613470565b91506134a88284613292565b915081905092915050565b5f815190506134c181612869565b92915050565b5f602082840312156134dc576134db612668565b5b5f6134e9848285016134b3565b91505092915050565b5f81519050919050565b5f82825260208201905092915050565b5f613516826134f2565b61352081856134fc565b935061353081856020860161273d565b6135398161274b565b840191505092915050565b5f6080820190506135575f830187612841565b6135646020830186612841565b6135716040830185612921565b8181036060830152613583818461350c565b905095945050505050565b5f8151905061359c8161269b565b92915050565b5f602082840312156135b7576135b6612668565b5b5f6135c48482850161358e565b91505092915050565b7f4e487b71000000000000000000000000000000000000000000000000000000005f52601260045260245ffd5b5f613604826127b3565b915061360f836127b3565b925082820261361d816127b3565b9150828204841483151761363457613633612eac565b5b5092915050565b5f613645826127b3565b9150613650836127b3565b9250826136605761365f6135cd565b5b82820490509291505056fe4142434445464748494a4b4c4d4e4f505152535455565758595a6162636465666768696a6b6c6d6e6f707172737475767778797a303132333435363738392b2fa264697066735822122066578d2d8438a6e4094965ffc067f3279fdf332c78c79f94a4b66a57c1f438a364736f6c634300081a0033
Constructor Arguments (ABI-Encoded and is the last bytes of the Contract Creation Code above)
000000000000000000000000c20d4ba1cce177b1f09fadd8f72f2e59109b1836
-----Decoded View---------------
Arg [0] : _dataSource (address): 0xC20d4bA1ccE177B1f09FaDD8F72F2E59109B1836
-----Encoded View---------------
1 Constructor Arguments found :
Arg [0] : 000000000000000000000000c20d4ba1cce177b1f09fadd8f72f2e59109b1836
Deployed Bytecode Sourcemap
153550:4356:0:-:0;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;98821:305;;;;;;;;;;;;;:::i;:::-;;:::i;:::-;;;;;;;:::i;:::-;;;;;;;;99652:91;;;:::i;:::-;;;;;;;:::i;:::-;;;;;;;;100824:158;;;;;;;;;;;;;:::i;:::-;;:::i;:::-;;;;;;;:::i;:::-;;;;;;;;100643:115;;;;;;;;;;;;;:::i;:::-;;:::i;:::-;;153676:25;;;:::i;:::-;;;;;;;:::i;:::-;;;;;;;;101493:588;;;;;;;;;;;;;:::i;:::-;;:::i;:::-;;153740:22;;;:::i;:::-;;;;;;;:::i;:::-;;;;;;;;153590:41;;;:::i;:::-;;;;;;;:::i;:::-;;;;;;;;154891:948;;;;;;;;;;;;;:::i;:::-;;:::i;:::-;;102152:134;;;;;;;;;;;;;:::i;:::-;;:::i;:::-;;157329:194;;;;;;;;;;;;;:::i;:::-;;:::i;:::-;;99465:120;;;;;;;;;;;;;:::i;:::-;;:::i;:::-;;;;;;;:::i;:::-;;;;;;;;156729:379;;;:::i;:::-;;99190:213;;;;;;;;;;;;;:::i;:::-;;:::i;:::-;;;;;;;:::i;:::-;;;;;;;;116474:103;;;:::i;:::-;;154310:104;;;;;;;;;;;;;:::i;:::-;;:::i;:::-;;115799:87;;;:::i;:::-;;;;;;;:::i;:::-;;;;;;;;99812:95;;;:::i;:::-;;;;;;;:::i;:::-;;;;;;;;153921:54;;;;;;;;;;;;;:::i;:::-;;:::i;:::-;;;;;;;:::i;:::-;;;;;;;;157116:205;;;;;;;;;;;;;:::i;:::-;;:::i;:::-;;101054:146;;;;;;;;;;;;;:::i;:::-;;:::i;:::-;;102357:236;;;;;;;;;;;;;:::i;:::-;;:::i;:::-;;155943:778;;;;;;;;;;;;;:::i;:::-;;:::i;:::-;;;;;;;:::i;:::-;;;;;;;;155847:88;;;:::i;:::-;;154079:65;;;;;;;;;;;;;:::i;:::-;;:::i;:::-;;;;;;;:::i;:::-;;;;;;;;153799:49;;;;;;;;;;;;;:::i;:::-;;:::i;:::-;;;;;;;:::i;:::-;;;;;;;;157531:372;;;;;;;;;;;;;:::i;:::-;;:::i;:::-;;;;;;;:::i;:::-;;;;;;;;154571:145;;;;;;;;;;;;;:::i;:::-;;:::i;:::-;;101271:155;;;;;;;;;;;;;:::i;:::-;;:::i;:::-;;;;;;;:::i;:::-;;;;;;;;154724:159;;;;;;;;;;;;;:::i;:::-;;:::i;:::-;;;;;;;:::i;:::-;;;;;;;;154422:141;;;;;;;;;;;;;:::i;:::-;;:::i;:::-;;116732:220;;;;;;;;;;;;;:::i;:::-;;:::i;:::-;;98821:305;98923:4;98975:25;98960:40;;;:11;:40;;;;:105;;;;99032:33;99017:48;;;:11;:48;;;;98960:105;:158;;;;99082:36;99106:11;99082:23;:36::i;:::-;98960:158;98940:178;;98821:305;;;:::o;99652:91::-;99697:13;99730:5;99723:12;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;99652:91;:::o;100824:158::-;100891:7;100911:22;100925:7;100911:13;:22::i;:::-;;100953:21;100966:7;100953:12;:21::i;:::-;100946:28;;100824:158;;;:::o;100643:115::-;100715:35;100724:2;100728:7;100737:12;:10;:12::i;:::-;100715:8;:35::i;:::-;100643:115;;:::o;153676:25::-;;;;;;;;;;;;;:::o;101493:588::-;101602:1;101588:16;;:2;:16;;;101584:89;;101658:1;101628:33;;;;;;;;;;;:::i;:::-;;;;;;;;101584:89;101894:21;101918:34;101926:2;101930:7;101939:12;:10;:12::i;:::-;101918:7;:34::i;:::-;101894:58;;101984:4;101967:21;;:13;:21;;;101963:111;;102033:4;102039:7;102048:13;102012:50;;;;;;;;;;;;;:::i;:::-;;;;;;;;101963:111;101573:508;101493:588;;;:::o;153740:22::-;;;;;;;;;;;;;:::o;153590:41::-;153627:4;153590:41;:::o;154891:948::-;154992:4;154978:18;;:10;;;;;;;;;;;:18;;;154970:46;;;;;;;;;;;;:::i;:::-;;;;;;;;;153627:4;155035:15;;:28;155027:59;;;;;;;;;;;;:::i;:::-;;;;;;;;;155190:22;:38;155213:14;155190:38;;;;;;;;;;;;;;;;;;;;;;;;;155182:78;;;;;;;;;;;;:::i;:::-;;;;;;;;;155360:51;155381:14;155397:13;155360:20;:51::i;:::-;155352:98;;;;;;;;;;;;:::i;:::-;;;;;;;;;155552:13;:29;155566:14;155552:29;;;;;;;;;;;;;;;:44;155582:13;155552:44;;;;;;;;;;;;;;;;;;;;;155551:45;155543:99;;;;;;;;;;;;:::i;:::-;;;;;;;;;155740:4;155693:13;:29;155707:14;155693:29;;;;;;;;;;;;;;;:44;155723:13;155693:44;;;;;;;;;;;;:51;;;;;;;;;;;;;;;;;;155765:15;;:17;;;;;;;;;:::i;:::-;;;;;;155793:38;155803:10;155815:15;;155793:9;:38::i;:::-;154891:948;;:::o;102152:134::-;102239:39;102256:4;102262:2;102266:7;102239:39;;;;;;;;;;;;:16;:39::i;:::-;102152:134;;;:::o;157329:194::-;115685:13;:11;:13::i;:::-;157415:11:::1;157437:10;157415:33;;157459:3;:20;;;157488:4;157495:10;157507:7;157459:56;;;;;;;;;;;;;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;::::0;::::1;;;;;;;;;;;;::::0;::::1;;;;;;;;;157404:119;157329:194:::0;;:::o;99465:120::-;99528:7;99555:22;99569:7;99555:13;:22::i;:::-;99548:29;;99465:120;;;:::o;156729:379::-;156768:19;156790:21;156800:10;156790:9;:21::i;:::-;156768:43;;156822:17;156856:14;:26;156871:10;156856:26;;;;;;;;;;;;;;;;156842:11;:40;;;;:::i;:::-;156822:60;;156915:1;156903:9;:13;156895:48;;;;;;;;;;;;:::i;:::-;;;;;;;;;156985:11;156956:14;:26;156971:10;156956:26;;;;;;;;;;;;;;;:40;;;;157016:9;157007:5;;:18;;;;;;;:::i;:::-;;;;;;;;157051:3;157042:5;;:12;157038:63;;157076:13;;;;;;;;;;157038:63;156757:351;;156729:379::o;99190:213::-;99253:7;99294:1;99277:19;;:5;:19;;;99273:89;;99347:1;99320:30;;;;;;;;;;;:::i;:::-;;;;;;;;99273:89;99379:9;:16;99389:5;99379:16;;;;;;;;;;;;;;;;99372:23;;99190:213;;;:::o;116474:103::-;115685:13;:11;:13::i;:::-;116539:30:::1;116566:1;116539:18;:30::i;:::-;116474:103::o:0;154310:104::-;115685:13;:11;:13::i;:::-;154395:11:::1;154382:10;;:24;;;;;;;;;;;;;;;;;;154310:104:::0;:::o;115799:87::-;115845:7;115872:6;;;;;;;;;;;115865:13;;115799:87;:::o;99812:95::-;99859:13;99892:7;99885:14;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;99812:95;:::o;153921:54::-;;;;;;;;;;;;;;;;;;;;;;:::o;157116:205::-;115685:13;:11;:13::i;:::-;157205:12:::1;157227;157205:35;;157259:5;:14;;;157274:10;157286:6;157259:34;;;;;;;;;;;;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;::::0;::::1;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;157251:62;;;;;;;;;;;;:::i;:::-;;;;;;;;;157194:127;157116:205:::0;;:::o;101054:146::-;101140:52;101159:12;:10;:12::i;:::-;101173:8;101183;101140:18;:52::i;:::-;101054:146;;:::o;102357:236::-;102471:31;102484:4;102490:2;102494:7;102471:12;:31::i;:::-;102513:72;102547:12;:10;:12::i;:::-;102561:4;102567:2;102571:7;102580:4;102513:33;:72::i;:::-;102357:236;;;;:::o;155943:778::-;156008:13;156053:15;;156042:7;:26;;156034:59;;;;;;;;;;;;:::i;:::-;;;;;;;;;156106:17;156142:10;;;;;;;;;;;156126:37;;;156164:7;156126:46;;;;;;;;;;;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;156106:66;;156183:20;156222:10;;;;;;;;;;;156206:37;;;156244:7;156206:46;;;;;;;;;;;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;156183:69;;156265:17;156335:18;:7;:16;:18::i;:::-;156459:25;156479:3;156459:13;:25::i;:::-;156520:6;156285:257;;;;;;;;;;:::i;:::-;;;;;;;;;;;;;156265:277;;156668:19;156682:4;156668:13;:19::i;:::-;156583:119;;;;;;;;:::i;:::-;;;;;;;;;;;;;156555:158;;;;;155943:778;;;:::o;155847:88::-;115685:13;:11;:13::i;:::-;155917:10:::1;;;;;;;;;;;155916:11;155903:10;;:24;;;;;;;;;;;;;;;;;;155847:88::o:0;154079:65::-;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::o;153799:49::-;;;;;;;;;;;;;;;;;:::o;157531:372::-;157629:4;157654:22;:38;157677:14;157654:38;;;;;;;;;;;;;;;;;;;;;;;;;157646:78;;;;;;;;;;;;:::i;:::-;;;;;;;;;157784:18;157813:14;157805:31;;;157837:13;157805:46;;;;;;;;;;;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;157784:67;;157884:10;157870:24;;:10;:24;;;157862:33;;;157531:372;;;;:::o;154571:145::-;115685:13;:11;:13::i;:::-;154703:5:::1;154661:22;:39;154684:15;154661:39;;;;;;;;;;;;;;;;:47;;;;;;;;;;;;;;;;;;154571:145:::0;:::o;101271:155::-;101359:4;101383:18;:25;101402:5;101383:25;;;;;;;;;;;;;;;:35;101409:8;101383:35;;;;;;;;;;;;;;;;;;;;;;;;;101376:42;;101271:155;;;;:::o;154724:159::-;154812:4;154836:13;:30;154850:15;154836:30;;;;;;;;;;;;;;;:39;154867:7;154836:39;;;;;;;;;;;;;;;;;;;;;154829:46;;154724:159;;;;:::o;154422:141::-;115685:13;:11;:13::i;:::-;154551:4:::1;154509:22;:39;154532:15;154509:39;;;;;;;;;;;;;;;;:46;;;;;;;;;;;;;;;;;;154422:141:::0;:::o;116732:220::-;115685:13;:11;:13::i;:::-;116837:1:::1;116817:22;;:8;:22;;::::0;116813:93:::1;;116891:1;116863:31;;;;;;;;;;;:::i;:::-;;;;;;;;116813:93;116916:28;116935:8;116916:18;:28::i;:::-;116732:220:::0;:::o;97419:148::-;97495:4;97534:25;97519:40;;;:11;:40;;;;97512:47;;97419:148;;;:::o;113875:247::-;113938:7;113958:13;113974:17;113983:7;113974:8;:17::i;:::-;113958:33;;114023:1;114006:19;;:5;:19;;;114002:90;;114072:7;114049:31;;;;;;;;;;;:::i;:::-;;;;;;;;114002:90;114109:5;114102:12;;;113875:247;;;:::o;103356:129::-;103426:7;103453:15;:24;103469:7;103453:24;;;;;;;;;;;;;;;;;;;;;103446:31;;103356:129;;;:::o;96316:98::-;96369:7;96396:10;96389:17;;96316:98;:::o;112107:122::-;112188:33;112197:2;112201:7;112210:4;112216;112188:8;:33::i;:::-;112107:122;;;:::o;106317:824::-;106403:7;106423:12;106438:17;106447:7;106438:8;:17::i;:::-;106423:32;;106534:1;106518:18;;:4;:18;;;106514:88;;106553:37;106570:4;106576;106582:7;106553:16;:37::i;:::-;106514:88;106665:1;106649:18;;:4;:18;;;106645:263;;106767:48;106784:1;106788:7;106805:1;106809:5;106767:8;:48::i;:::-;106880:1;106861:9;:15;106871:4;106861:15;;;;;;;;;;;;;;;;:20;;;;;;;;;;;106645:263;106938:1;106924:16;;:2;:16;;;106920:111;;107003:1;106986:9;:13;106996:2;106986:13;;;;;;;;;;;;;;;;:18;;;;;;;;;;;106920:111;107062:2;107043:7;:16;107051:7;107043:16;;;;;;;;;;;;:21;;;;;;;;;;;;;;;;;;107101:7;107097:2;107082:27;;107091:4;107082:27;;;;;;;;;;;;107129:4;107122:11;;;106317:824;;;;;:::o;108175:102::-;108243:26;108253:2;108257:7;108243:26;;;;;;;;;;;;:9;:26::i;:::-;108175:102;;:::o;115964:166::-;116035:12;:10;:12::i;:::-;116024:23;;:7;:5;:7::i;:::-;:23;;;116020:103;;116098:12;:10;:12::i;:::-;116071:40;;;;;;;;;;;:::i;:::-;;;;;;;;116020:103;115964:166::o;117112:191::-;117186:16;117205:6;;;;;;;;;;;117186:25;;117231:8;117222:6;;:17;;;;;;;;;;;;;;;;;;117286:8;117255:40;;117276:8;117255:40;;;;;;;;;;;;117175:128;117112:191;:::o;113314:318::-;113442:1;113422:22;;:8;:22;;;113418:93;;113490:8;113468:31;;;;;;;;;;;:::i;:::-;;;;;;;;113418:93;113559:8;113521:18;:25;113540:5;113521:25;;;;;;;;;;;;;;;:35;113547:8;113521:35;;;;;;;;;;;;;;;;:46;;;;;;;;;;;;;;;;;;113605:8;113583:41;;113598:5;113583:41;;;113615:8;113583:41;;;;;;:::i;:::-;;;;;;;;113314:318;;;:::o;94666:948::-;94870:1;94853:2;:14;;;:18;94849:758;;;94908:2;94892:36;;;94929:8;94939:4;94945:7;94954:4;94892:67;;;;;;;;;;;;;;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;;;94888:708;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;95272:1;95255:6;:13;:18;95251:330;;95397:2;95361:39;;;;;;;;;;;:::i;:::-;;;;;;;;95251:330;95531:6;95525:13;95516:6;95512:2;95508:15;95501:38;94888:708;95017:41;;;95007:51;;;:6;:51;;;;95003:185;;95165:2;95129:39;;;;;;;;;;;:::i;:::-;;;;;;;;95003:185;94960:243;94849:758;94666:948;;;;;:::o;75757:650::-;75813:13;75864:14;75901:1;75881:17;75892:5;75881:10;:17::i;:::-;:21;75864:38;;75917:20;75951:6;75940:18;;;;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;75917:41;;75973:11;76070:6;76066:2;76062:15;76054:6;76050:28;76043:35;;76107:254;76114:4;76107:254;;;76139:5;;;;;;;;76245:10;76240:2;76233:5;76229:14;76224:32;76219:3;76211:46;76303:2;76294:11;;;;;;:::i;:::-;;;;;76337:1;76328:5;:10;76107:254;76324:21;76107:254;76382:6;76375:13;;;;;75757:650;;;:::o;704:126::-;762:13;795:27;803:4;809:6;;;;;;;;;;;;;;;;;817:4;795:7;:27::i;:::-;788:34;;704:126;;;:::o;103118:117::-;103184:7;103211;:16;103219:7;103211:16;;;;;;;;;;;;;;;;;;;;;103204:23;;103118:117;;;:::o;112417:678::-;112579:9;:31;;;;112608:1;112592:18;;:4;:18;;;;112579:31;112575:471;;;112627:13;112643:22;112657:7;112643:13;:22::i;:::-;112627:38;;112812:1;112796:18;;:4;:18;;;;:35;;;;;112827:4;112818:13;;:5;:13;;;;112796:35;:69;;;;;112836:29;112853:5;112860:4;112836:16;:29::i;:::-;112835:30;112796:69;112792:144;;;112915:4;112893:27;;;;;;;;;;;:::i;:::-;;;;;;;;112792:144;112956:9;112952:83;;;113011:7;113007:2;112991:28;;113000:5;112991:28;;;;;;;;;;;;112952:83;112612:434;112575:471;113085:2;113058:15;:24;113074:7;113058:24;;;;;;;;;;;;:29;;;;;;;;;;;;;;;;;;112417:678;;;;:::o;104524:376::-;104637:38;104651:5;104658:7;104667;104637:13;:38::i;:::-;104632:261;;104713:1;104696:19;;:5;:19;;;104692:190;;104766:7;104743:31;;;;;;;;;;;:::i;:::-;;;;;;;;104692:190;104849:7;104858;104822:44;;;;;;;;;;;;:::i;:::-;;;;;;;;104632:261;104524:376;;;:::o;108504:210::-;108599:18;108605:2;108609:7;108599:5;:18::i;:::-;108628:78;108662:12;:10;:12::i;:::-;108684:1;108688:2;108692:7;108701:4;108628:33;:78::i;:::-;108504:210;;;:::o;69402:948::-;69455:7;69475:14;69492:1;69475:18;;69542:8;69533:5;:17;69529:106;;69580:8;69571:17;;;;;;:::i;:::-;;;;;69617:2;69607:12;;;;69529:106;69662:8;69653:5;:17;69649:106;;69700:8;69691:17;;;;;;:::i;:::-;;;;;69737:2;69727:12;;;;69649:106;69782:8;69773:5;:17;69769:106;;69820:8;69811:17;;;;;;:::i;:::-;;;;;69857:2;69847:12;;;;69769:106;69902:7;69893:5;:16;69889:103;;69939:7;69930:16;;;;;;:::i;:::-;;;;;69975:1;69965:11;;;;69889:103;70019:7;70010:5;:16;70006:103;;70056:7;70047:16;;;;;;:::i;:::-;;;;;70092:1;70082:11;;;;70006:103;70136:7;70127:5;:16;70123:103;;70173:7;70164:16;;;;;;:::i;:::-;;;;;70209:1;70199:11;;;;70123:103;70253:7;70244:5;:16;70240:68;;70291:1;70281:11;;;;70240:68;70336:6;70329:13;;;69402:948;;;:::o;1242:4109::-;1339:13;1591:1;1576:4;:11;:16;1572:31;;1594:9;;;;;;;;;;;;;;;;1572:31;2556:20;2579:11;:69;;2647:1;2642;2628:4;:11;2624:1;:15;;;;:::i;:::-;:19;;;;:::i;:::-;2623:25;;;;:::i;:::-;2579:69;;;2618:1;2613;2599:4;:11;:15;;;;:::i;:::-;2598:21;;;;:::i;:::-;2593:1;:27;;;;:::i;:::-;2579:69;2556:92;;2661:20;2695:12;2684:24;;;;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;2661:47;;2860:1;2853:5;2849:13;2964:4;2956:6;2952:17;2998:4;3046;3040:11;3034:4;3030:22;3298:4;3290:6;3286:17;3341:8;3335:15;3381:4;3371:8;3364:22;3456:1286;3491:6;3482:7;3479:19;3456:1286;;;3597:1;3588:7;3584:15;3573:26;;3636:7;3630:14;4232:4;4224:5;4220:2;4216:14;4212:25;4202:8;4198:40;4192:47;4181:9;4173:67;4286:1;4275:9;4271:17;4258:30;;4378:4;4370:5;4366:2;4362:14;4358:25;4348:8;4344:40;4338:47;4327:9;4319:67;4432:1;4421:9;4417:17;4404:30;;4523:4;4515:5;4512:1;4508:13;4504:24;4494:8;4490:39;4484:46;4473:9;4465:66;4577:1;4566:9;4562:17;4549:30;;4660:4;4653:5;4649:16;4639:8;4635:31;4629:38;4618:9;4610:58;4714:1;4703:9;4699:17;4686:30;;3518:1224;3456:1286;;;4823:10;4813:8;4806:28;4853:11;4850:457;;;5038:1;5031:4;5025:11;5021:19;5063:1;5058:135;;;;5216:1;5211:81;;;;5014:278;;5058:135;5115:4;5111:1;5100:9;5096:17;5088:32;5169:4;5165:1;5154:9;5150:17;5142:32;5058:135;;5211:81;5268:4;5264:1;5253:9;5249:17;5241:32;5014:278;;4850:457;2746:2572;;;;;;5337:6;5330:13;;;;1242:4109;;;;;;:::o;103805:276::-;103908:4;103964:1;103945:21;;:7;:21;;;;:128;;;;;103993:7;103984:16;;:5;:16;;;:52;;;;104004:32;104021:5;104028:7;104004:16;:32::i;:::-;103984:52;:88;;;;104065:7;104040:32;;:21;104053:7;104040:12;:21::i;:::-;:32;;;103984:88;103945:128;103925:148;;103805:276;;;;;:::o;107477:335::-;107559:1;107545:16;;:2;:16;;;107541:89;;107615:1;107585:33;;;;;;;;;;;:::i;:::-;;;;;;;;107541:89;107640:21;107664:32;107672:2;107676:7;107693:1;107664:7;:32::i;:::-;107640:56;;107736:1;107711:27;;:13;:27;;;107707:98;;107790:1;107762:31;;;;;;;;;;;:::i;:::-;;;;;;;;107707:98;107530:282;107477:335;;:::o;7:75:1:-;40:6;73:2;67:9;57:19;;7:75;:::o;88:117::-;197:1;194;187:12;211:117;320:1;317;310:12;334:149;370:7;410:66;403:5;399:78;388:89;;334:149;;;:::o;489:120::-;561:23;578:5;561:23;:::i;:::-;554:5;551:34;541:62;;599:1;596;589:12;541:62;489:120;:::o;615:137::-;660:5;698:6;685:20;676:29;;714:32;740:5;714:32;:::i;:::-;615:137;;;;:::o;758:327::-;816:6;865:2;853:9;844:7;840:23;836:32;833:119;;;871:79;;:::i;:::-;833:119;991:1;1016:52;1060:7;1051:6;1040:9;1036:22;1016:52;:::i;:::-;1006:62;;962:116;758:327;;;;:::o;1091:90::-;1125:7;1168:5;1161:13;1154:21;1143:32;;1091:90;;;:::o;1187:109::-;1268:21;1283:5;1268:21;:::i;:::-;1263:3;1256:34;1187:109;;:::o;1302:210::-;1389:4;1427:2;1416:9;1412:18;1404:26;;1440:65;1502:1;1491:9;1487:17;1478:6;1440:65;:::i;:::-;1302:210;;;;:::o;1518:99::-;1570:6;1604:5;1598:12;1588:22;;1518:99;;;:::o;1623:169::-;1707:11;1741:6;1736:3;1729:19;1781:4;1776:3;1772:14;1757:29;;1623:169;;;;:::o;1798:139::-;1887:6;1882:3;1877;1871:23;1928:1;1919:6;1914:3;1910:16;1903:27;1798:139;;;:::o;1943:102::-;1984:6;2035:2;2031:7;2026:2;2019:5;2015:14;2011:28;2001:38;;1943:102;;;:::o;2051:377::-;2139:3;2167:39;2200:5;2167:39;:::i;:::-;2222:71;2286:6;2281:3;2222:71;:::i;:::-;2215:78;;2302:65;2360:6;2355:3;2348:4;2341:5;2337:16;2302:65;:::i;:::-;2392:29;2414:6;2392:29;:::i;:::-;2387:3;2383:39;2376:46;;2143:285;2051:377;;;;:::o;2434:313::-;2547:4;2585:2;2574:9;2570:18;2562:26;;2634:9;2628:4;2624:20;2620:1;2609:9;2605:17;2598:47;2662:78;2735:4;2726:6;2662:78;:::i;:::-;2654:86;;2434:313;;;;:::o;2753:77::-;2790:7;2819:5;2808:16;;2753:77;;;:::o;2836:122::-;2909:24;2927:5;2909:24;:::i;:::-;2902:5;2899:35;2889:63;;2948:1;2945;2938:12;2889:63;2836:122;:::o;2964:139::-;3010:5;3048:6;3035:20;3026:29;;3064:33;3091:5;3064:33;:::i;:::-;2964:139;;;;:::o;3109:329::-;3168:6;3217:2;3205:9;3196:7;3192:23;3188:32;3185:119;;;3223:79;;:::i;:::-;3185:119;3343:1;3368:53;3413:7;3404:6;3393:9;3389:22;3368:53;:::i;:::-;3358:63;;3314:117;3109:329;;;;:::o;3444:126::-;3481:7;3521:42;3514:5;3510:54;3499:65;;3444:126;;;:::o;3576:96::-;3613:7;3642:24;3660:5;3642:24;:::i;:::-;3631:35;;3576:96;;;:::o;3678:118::-;3765:24;3783:5;3765:24;:::i;:::-;3760:3;3753:37;3678:118;;:::o;3802:222::-;3895:4;3933:2;3922:9;3918:18;3910:26;;3946:71;4014:1;4003:9;3999:17;3990:6;3946:71;:::i;:::-;3802:222;;;;:::o;4030:122::-;4103:24;4121:5;4103:24;:::i;:::-;4096:5;4093:35;4083:63;;4142:1;4139;4132:12;4083:63;4030:122;:::o;4158:139::-;4204:5;4242:6;4229:20;4220:29;;4258:33;4285:5;4258:33;:::i;:::-;4158:139;;;;:::o;4303:474::-;4371:6;4379;4428:2;4416:9;4407:7;4403:23;4399:32;4396:119;;;4434:79;;:::i;:::-;4396:119;4554:1;4579:53;4624:7;4615:6;4604:9;4600:22;4579:53;:::i;:::-;4569:63;;4525:117;4681:2;4707:53;4752:7;4743:6;4732:9;4728:22;4707:53;:::i;:::-;4697:63;;4652:118;4303:474;;;;;:::o;4783:619::-;4860:6;4868;4876;4925:2;4913:9;4904:7;4900:23;4896:32;4893:119;;;4931:79;;:::i;:::-;4893:119;5051:1;5076:53;5121:7;5112:6;5101:9;5097:22;5076:53;:::i;:::-;5066:63;;5022:117;5178:2;5204:53;5249:7;5240:6;5229:9;5225:22;5204:53;:::i;:::-;5194:63;;5149:118;5306:2;5332:53;5377:7;5368:6;5357:9;5353:22;5332:53;:::i;:::-;5322:63;;5277:118;4783:619;;;;;:::o;5408:118::-;5495:24;5513:5;5495:24;:::i;:::-;5490:3;5483:37;5408:118;;:::o;5532:222::-;5625:4;5663:2;5652:9;5648:18;5640:26;;5676:71;5744:1;5733:9;5729:17;5720:6;5676:71;:::i;:::-;5532:222;;;;:::o;5760:329::-;5819:6;5868:2;5856:9;5847:7;5843:23;5839:32;5836:119;;;5874:79;;:::i;:::-;5836:119;5994:1;6019:53;6064:7;6055:6;6044:9;6040:22;6019:53;:::i;:::-;6009:63;;5965:117;5760:329;;;;:::o;6095:116::-;6165:21;6180:5;6165:21;:::i;:::-;6158:5;6155:32;6145:60;;6201:1;6198;6191:12;6145:60;6095:116;:::o;6217:133::-;6260:5;6298:6;6285:20;6276:29;;6314:30;6338:5;6314:30;:::i;:::-;6217:133;;;;:::o;6356:468::-;6421:6;6429;6478:2;6466:9;6457:7;6453:23;6449:32;6446:119;;;6484:79;;:::i;:::-;6446:119;6604:1;6629:53;6674:7;6665:6;6654:9;6650:22;6629:53;:::i;:::-;6619:63;;6575:117;6731:2;6757:50;6799:7;6790:6;6779:9;6775:22;6757:50;:::i;:::-;6747:60;;6702:115;6356:468;;;;;:::o;6830:117::-;6939:1;6936;6929:12;6953:117;7062:1;7059;7052:12;7076:180;7124:77;7121:1;7114:88;7221:4;7218:1;7211:15;7245:4;7242:1;7235:15;7262:281;7345:27;7367:4;7345:27;:::i;:::-;7337:6;7333:40;7475:6;7463:10;7460:22;7439:18;7427:10;7424:34;7421:62;7418:88;;;7486:18;;:::i;:::-;7418:88;7526:10;7522:2;7515:22;7305:238;7262:281;;:::o;7549:129::-;7583:6;7610:20;;:::i;:::-;7600:30;;7639:33;7667:4;7659:6;7639:33;:::i;:::-;7549:129;;;:::o;7684:307::-;7745:4;7835:18;7827:6;7824:30;7821:56;;;7857:18;;:::i;:::-;7821:56;7895:29;7917:6;7895:29;:::i;:::-;7887:37;;7979:4;7973;7969:15;7961:23;;7684:307;;;:::o;7997:148::-;8095:6;8090:3;8085;8072:30;8136:1;8127:6;8122:3;8118:16;8111:27;7997:148;;;:::o;8151:423::-;8228:5;8253:65;8269:48;8310:6;8269:48;:::i;:::-;8253:65;:::i;:::-;8244:74;;8341:6;8334:5;8327:21;8379:4;8372:5;8368:16;8417:3;8408:6;8403:3;8399:16;8396:25;8393:112;;;8424:79;;:::i;:::-;8393:112;8514:54;8561:6;8556:3;8551;8514:54;:::i;:::-;8234:340;8151:423;;;;;:::o;8593:338::-;8648:5;8697:3;8690:4;8682:6;8678:17;8674:27;8664:122;;8705:79;;:::i;:::-;8664:122;8822:6;8809:20;8847:78;8921:3;8913:6;8906:4;8898:6;8894:17;8847:78;:::i;:::-;8838:87;;8654:277;8593:338;;;;:::o;8937:943::-;9032:6;9040;9048;9056;9105:3;9093:9;9084:7;9080:23;9076:33;9073:120;;;9112:79;;:::i;:::-;9073:120;9232:1;9257:53;9302:7;9293:6;9282:9;9278:22;9257:53;:::i;:::-;9247:63;;9203:117;9359:2;9385:53;9430:7;9421:6;9410:9;9406:22;9385:53;:::i;:::-;9375:63;;9330:118;9487:2;9513:53;9558:7;9549:6;9538:9;9534:22;9513:53;:::i;:::-;9503:63;;9458:118;9643:2;9632:9;9628:18;9615:32;9674:18;9666:6;9663:30;9660:117;;;9696:79;;:::i;:::-;9660:117;9801:62;9855:7;9846:6;9835:9;9831:22;9801:62;:::i;:::-;9791:72;;9586:287;8937:943;;;;;;;:::o;9886:474::-;9954:6;9962;10011:2;9999:9;9990:7;9986:23;9982:32;9979:119;;;10017:79;;:::i;:::-;9979:119;10137:1;10162:53;10207:7;10198:6;10187:9;10183:22;10162:53;:::i;:::-;10152:63;;10108:117;10264:2;10290:53;10335:7;10326:6;10315:9;10311:22;10290:53;:::i;:::-;10280:63;;10235:118;9886:474;;;;;:::o;10366:180::-;10414:77;10411:1;10404:88;10511:4;10508:1;10501:15;10535:4;10532:1;10525:15;10552:320;10596:6;10633:1;10627:4;10623:12;10613:22;;10680:1;10674:4;10670:12;10701:18;10691:81;;10757:4;10749:6;10745:17;10735:27;;10691:81;10819:2;10811:6;10808:14;10788:18;10785:38;10782:84;;10838:18;;:::i;:::-;10782:84;10603:269;10552:320;;;:::o;10878:442::-;11027:4;11065:2;11054:9;11050:18;11042:26;;11078:71;11146:1;11135:9;11131:17;11122:6;11078:71;:::i;:::-;11159:72;11227:2;11216:9;11212:18;11203:6;11159:72;:::i;:::-;11241;11309:2;11298:9;11294:18;11285:6;11241:72;:::i;:::-;10878:442;;;;;;:::o;11326:165::-;11466:17;11462:1;11454:6;11450:14;11443:41;11326:165;:::o;11497:366::-;11639:3;11660:67;11724:2;11719:3;11660:67;:::i;:::-;11653:74;;11736:93;11825:3;11736:93;:::i;:::-;11854:2;11849:3;11845:12;11838:19;;11497:366;;;:::o;11869:419::-;12035:4;12073:2;12062:9;12058:18;12050:26;;12122:9;12116:4;12112:20;12108:1;12097:9;12093:17;12086:47;12150:131;12276:4;12150:131;:::i;:::-;12142:139;;11869:419;;;:::o;12294:168::-;12434:20;12430:1;12422:6;12418:14;12411:44;12294:168;:::o;12468:366::-;12610:3;12631:67;12695:2;12690:3;12631:67;:::i;:::-;12624:74;;12707:93;12796:3;12707:93;:::i;:::-;12825:2;12820:3;12816:12;12809:19;;12468:366;;;:::o;12840:419::-;13006:4;13044:2;13033:9;13029:18;13021:26;;13093:9;13087:4;13083:20;13079:1;13068:9;13064:17;13057:47;13121:131;13247:4;13121:131;:::i;:::-;13113:139;;12840:419;;;:::o;13265:177::-;13405:29;13401:1;13393:6;13389:14;13382:53;13265:177;:::o;13448:366::-;13590:3;13611:67;13675:2;13670:3;13611:67;:::i;:::-;13604:74;;13687:93;13776:3;13687:93;:::i;:::-;13805:2;13800:3;13796:12;13789:19;;13448:366;;;:::o;13820:419::-;13986:4;14024:2;14013:9;14009:18;14001:26;;14073:9;14067:4;14063:20;14059:1;14048:9;14044:17;14037:47;14101:131;14227:4;14101:131;:::i;:::-;14093:139;;13820:419;;;:::o;14245:221::-;14385:34;14381:1;14373:6;14369:14;14362:58;14454:4;14449:2;14441:6;14437:15;14430:29;14245:221;:::o;14472:366::-;14614:3;14635:67;14699:2;14694:3;14635:67;:::i;:::-;14628:74;;14711:93;14800:3;14711:93;:::i;:::-;14829:2;14824:3;14820:12;14813:19;;14472:366;;;:::o;14844:419::-;15010:4;15048:2;15037:9;15033:18;15025:26;;15097:9;15091:4;15087:20;15083:1;15072:9;15068:17;15061:47;15125:131;15251:4;15125:131;:::i;:::-;15117:139;;14844:419;;;:::o;15269:228::-;15409:34;15405:1;15397:6;15393:14;15386:58;15478:11;15473:2;15465:6;15461:15;15454:36;15269:228;:::o;15503:366::-;15645:3;15666:67;15730:2;15725:3;15666:67;:::i;:::-;15659:74;;15742:93;15831:3;15742:93;:::i;:::-;15860:2;15855:3;15851:12;15844:19;;15503:366;;;:::o;15875:419::-;16041:4;16079:2;16068:9;16064:18;16056:26;;16128:9;16122:4;16118:20;16114:1;16103:9;16099:17;16092:47;16156:131;16282:4;16156:131;:::i;:::-;16148:139;;15875:419;;;:::o;16300:180::-;16348:77;16345:1;16338:88;16445:4;16442:1;16435:15;16469:4;16466:1;16459:15;16486:233;16525:3;16548:24;16566:5;16548:24;:::i;:::-;16539:33;;16594:66;16587:5;16584:77;16581:103;;16664:18;;:::i;:::-;16581:103;16711:1;16704:5;16700:13;16693:20;;16486:233;;;:::o;16725:442::-;16874:4;16912:2;16901:9;16897:18;16889:26;;16925:71;16993:1;16982:9;16978:17;16969:6;16925:71;:::i;:::-;17006:72;17074:2;17063:9;17059:18;17050:6;17006:72;:::i;:::-;17088;17156:2;17145:9;17141:18;17132:6;17088:72;:::i;:::-;16725:442;;;;;;:::o;17173:194::-;17213:4;17233:20;17251:1;17233:20;:::i;:::-;17228:25;;17267:20;17285:1;17267:20;:::i;:::-;17262:25;;17311:1;17308;17304:9;17296:17;;17335:1;17329:4;17326:11;17323:37;;;17340:18;;:::i;:::-;17323:37;17173:194;;;;:::o;17373:172::-;17513:24;17509:1;17501:6;17497:14;17490:48;17373:172;:::o;17551:366::-;17693:3;17714:67;17778:2;17773:3;17714:67;:::i;:::-;17707:74;;17790:93;17879:3;17790:93;:::i;:::-;17908:2;17903:3;17899:12;17892:19;;17551:366;;;:::o;17923:419::-;18089:4;18127:2;18116:9;18112:18;18104:26;;18176:9;18170:4;18166:20;18162:1;18151:9;18147:17;18140:47;18204:131;18330:4;18204:131;:::i;:::-;18196:139;;17923:419;;;:::o;18348:191::-;18388:3;18407:20;18425:1;18407:20;:::i;:::-;18402:25;;18441:20;18459:1;18441:20;:::i;:::-;18436:25;;18484:1;18481;18477:9;18470:16;;18505:3;18502:1;18499:10;18496:36;;;18512:18;;:::i;:::-;18496:36;18348:191;;;;:::o;18545:332::-;18666:4;18704:2;18693:9;18689:18;18681:26;;18717:71;18785:1;18774:9;18770:17;18761:6;18717:71;:::i;:::-;18798:72;18866:2;18855:9;18851:18;18842:6;18798:72;:::i;:::-;18545:332;;;;;:::o;18883:137::-;18937:5;18968:6;18962:13;18953:22;;18984:30;19008:5;18984:30;:::i;:::-;18883:137;;;;:::o;19026:345::-;19093:6;19142:2;19130:9;19121:7;19117:23;19113:32;19110:119;;;19148:79;;:::i;:::-;19110:119;19268:1;19293:61;19346:7;19337:6;19326:9;19322:22;19293:61;:::i;:::-;19283:71;;19239:125;19026:345;;;;:::o;19377:165::-;19517:17;19513:1;19505:6;19501:14;19494:41;19377:165;:::o;19548:366::-;19690:3;19711:67;19775:2;19770:3;19711:67;:::i;:::-;19704:74;;19787:93;19876:3;19787:93;:::i;:::-;19905:2;19900:3;19896:12;19889:19;;19548:366;;;:::o;19920:419::-;20086:4;20124:2;20113:9;20109:18;20101:26;;20173:9;20167:4;20163:20;20159:1;20148:9;20144:17;20137:47;20201:131;20327:4;20201:131;:::i;:::-;20193:139;;19920:419;;;:::o;20345:170::-;20485:22;20481:1;20473:6;20469:14;20462:46;20345:170;:::o;20521:366::-;20663:3;20684:67;20748:2;20743:3;20684:67;:::i;:::-;20677:74;;20760:93;20849:3;20760:93;:::i;:::-;20878:2;20873:3;20869:12;20862:19;;20521:366;;;:::o;20893:419::-;21059:4;21097:2;21086:9;21082:18;21074:26;;21146:9;21140:4;21136:20;21132:1;21121:9;21117:17;21110:47;21174:131;21300:4;21174:131;:::i;:::-;21166:139;;20893:419;;;:::o;21318:308::-;21380:4;21470:18;21462:6;21459:30;21456:56;;;21492:18;;:::i;:::-;21456:56;21530:29;21552:6;21530:29;:::i;:::-;21522:37;;21614:4;21608;21604:15;21596:23;;21318:308;;;:::o;21632:434::-;21721:5;21746:66;21762:49;21804:6;21762:49;:::i;:::-;21746:66;:::i;:::-;21737:75;;21835:6;21828:5;21821:21;21873:4;21866:5;21862:16;21911:3;21902:6;21897:3;21893:16;21890:25;21887:112;;;21918:79;;:::i;:::-;21887:112;22008:52;22053:6;22048:3;22043;22008:52;:::i;:::-;21727:339;21632:434;;;;;:::o;22086:355::-;22153:5;22202:3;22195:4;22187:6;22183:17;22179:27;22169:122;;22210:79;;:::i;:::-;22169:122;22320:6;22314:13;22345:90;22431:3;22423:6;22416:4;22408:6;22404:17;22345:90;:::i;:::-;22336:99;;22159:282;22086:355;;;;:::o;22447:524::-;22527:6;22576:2;22564:9;22555:7;22551:23;22547:32;22544:119;;;22582:79;;:::i;:::-;22544:119;22723:1;22712:9;22708:17;22702:24;22753:18;22745:6;22742:30;22739:117;;;22775:79;;:::i;:::-;22739:117;22880:74;22946:7;22937:6;22926:9;22922:22;22880:74;:::i;:::-;22870:84;;22673:291;22447:524;;;;:::o;22977:148::-;23079:11;23116:3;23101:18;;22977:148;;;;:::o;23131:214::-;23271:66;23267:1;23259:6;23255:14;23248:90;23131:214;:::o;23351:402::-;23511:3;23532:85;23614:2;23609:3;23532:85;:::i;:::-;23525:92;;23626:93;23715:3;23626:93;:::i;:::-;23744:2;23739:3;23735:12;23728:19;;23351:402;;;:::o;23759:390::-;23865:3;23893:39;23926:5;23893:39;:::i;:::-;23948:89;24030:6;24025:3;23948:89;:::i;:::-;23941:96;;24046:65;24104:6;24099:3;24092:4;24085:5;24081:16;24046:65;:::i;:::-;24136:6;24131:3;24127:16;24120:23;;23869:280;23759:390;;;;:::o;24155:362::-;24295:66;24291:1;24283:6;24279:14;24272:90;24396:66;24391:2;24383:6;24379:15;24372:91;24497:12;24492:2;24484:6;24480:15;24473:37;24155:362;:::o;24523:402::-;24683:3;24704:85;24786:2;24781:3;24704:85;:::i;:::-;24697:92;;24798:93;24887:3;24798:93;:::i;:::-;24916:2;24911:3;24907:12;24900:19;;24523:402;;;:::o;24931:214::-;25071:66;25067:1;25059:6;25055:14;25048:90;24931:214;:::o;25151:402::-;25311:3;25332:85;25414:2;25409:3;25332:85;:::i;:::-;25325:92;;25426:93;25515:3;25426:93;:::i;:::-;25544:2;25539:3;25535:12;25528:19;;25151:402;;;:::o;25559:143::-;25695:3;25691:1;25683:6;25679:14;25672:27;25559:143;:::o;25704:384::-;25864:3;25881:84;25963:1;25958:3;25881:84;:::i;:::-;25874:91;;25970:93;26059:3;25970:93;:::i;:::-;26084:1;26079:3;26075:11;26068:18;;25704:384;;;:::o;26090:1623::-;26722:3;26740:148;26884:3;26740:148;:::i;:::-;26733:155;;26901:95;26992:3;26983:6;26901:95;:::i;:::-;26894:102;;27009:148;27153:3;27009:148;:::i;:::-;27002:155;;27170:95;27261:3;27252:6;27170:95;:::i;:::-;27163:102;;27278:148;27422:3;27278:148;:::i;:::-;27271:155;;27439:95;27530:3;27521:6;27439:95;:::i;:::-;27432:102;;27547:148;27691:3;27547:148;:::i;:::-;27540:155;;27708:3;27701:10;;26090:1623;;;;;;:::o;27715:171::-;27851:31;27847:1;27839:6;27835:14;27828:55;27715:171;:::o;27888:386::-;28048:3;28065:85;28147:2;28142:3;28065:85;:::i;:::-;28058:92;;28155:93;28244:3;28155:93;:::i;:::-;28269:2;28264:3;28260:12;28253:19;;27888:386;;;:::o;28276:525::-;28509:3;28527:148;28671:3;28527:148;:::i;:::-;28520:155;;28688:95;28779:3;28770:6;28688:95;:::i;:::-;28681:102;;28796:3;28789:10;;28276:525;;;;:::o;28803:131::-;28860:5;28887:6;28881:13;28872:22;;28899:33;28926:5;28899:33;:::i;:::-;28803:131;;;;:::o;28936:327::-;29006:6;29051:2;29039:9;29030:7;29026:23;29022:32;29019:119;;;29057:79;;:::i;:::-;29019:119;29169:1;29190:64;29246:7;29237:6;29226:9;29222:22;29190:64;:::i;:::-;29180:74;;29144:116;28936:327;;;;:::o;29265:90::-;29316:6;29346:5;29340:12;29330:22;;29265:90;;;:::o;29357:156::-;29440:11;29470:6;29465:3;29458:19;29506:4;29501:3;29497:14;29482:29;;29357:156;;;;:::o;29515:353::-;29601:3;29625:38;29657:5;29625:38;:::i;:::-;29675:70;29738:6;29733:3;29675:70;:::i;:::-;29668:77;;29750:65;29808:6;29803:3;29796:4;29789:5;29785:16;29750:65;:::i;:::-;29836:29;29858:6;29836:29;:::i;:::-;29831:3;29827:39;29820:46;;29605:263;29515:353;;;;:::o;29870:612::-;30065:4;30099:3;30088:9;30084:19;30076:27;;30109:71;30177:1;30166:9;30162:17;30153:6;30109:71;:::i;:::-;30186:72;30254:2;30243:9;30239:18;30230:6;30186:72;:::i;:::-;30264;30332:2;30321:9;30317:18;30308:6;30264:72;:::i;:::-;30379:9;30373:4;30369:20;30364:2;30353:9;30349:18;30342:48;30403:76;30474:4;30465:6;30403:76;:::i;:::-;30395:84;;29870:612;;;;;;;:::o;30484:129::-;30540:5;30567:6;30561:13;30552:22;;30579:32;30605:5;30579:32;:::i;:::-;30484:129;;;;:::o;30615:325::-;30684:6;30729:2;30717:9;30708:7;30704:23;30700:32;30697:119;;;30735:79;;:::i;:::-;30697:119;30847:1;30868:63;30923:7;30914:6;30903:9;30899:22;30868:63;:::i;:::-;30858:73;;30822:115;30615:325;;;;:::o;30942:164::-;30986:77;30983:1;30976:88;31079:4;31076:1;31069:15;31099:4;31096:1;31089:15;31108:362;31148:7;31167:20;31185:1;31167:20;:::i;:::-;31162:25;;31197:20;31215:1;31197:20;:::i;:::-;31192:25;;31248:1;31245;31241:9;31266:30;31284:11;31266:30;:::i;:::-;31255:41;;31425:1;31416:7;31412:15;31409:1;31406:22;31390:1;31383:9;31367:71;31348:119;;31447:18;;:::i;:::-;31348:119;31156:314;31108:362;;;;:::o;31472:165::-;31512:1;31525:20;31543:1;31525:20;:::i;:::-;31520:25;;31555:20;31573:1;31555:20;:::i;:::-;31550:25;;31590:1;31580:35;;31595:18;;:::i;:::-;31580:35;31633:1;31630;31626:9;31621:14;;31472:165;;;;:::o
Swarm Source
ipfs://66578d2d8438a6e4094965ffc067f3279fdf332c78c79f94a4b66a57c1f438a3
[ 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.