Source Code
Overview
APE Balance
0 APEMore Info
ContractCreator
TokenTracker
Latest 7 from a total of 7 transactions
| Transaction Hash |
Method
|
Block
|
From
|
To
|
|||||
|---|---|---|---|---|---|---|---|---|---|
| Mint | 13567622 | 24 days ago | IN | 0 APE | 0.00000068 | ||||
| Place Hand | 13563490 | 24 days ago | IN | 0 APE | 0.00000068 | ||||
| Mint | 13563383 | 24 days ago | IN | 0 APE | 0.0000012 | ||||
| Set Merkle Root | 13563378 | 24 days ago | IN | 0 APE | 0.00000029 | ||||
| Set Merkle Root | 13563360 | 24 days ago | IN | 0 APE | 0.00000046 | ||||
| Set Data Source | 13562633 | 24 days ago | IN | 0 APE | 0.00000026 | ||||
| Toggle Mint Acti... | 13562300 | 24 days ago | IN | 0 APE | 0.00000028 |
Latest 1 internal transaction
| Parent Transaction Hash | Block | From | To | |||
|---|---|---|---|---|---|---|
| 14100823 | 9 days ago | 0 APE |
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-05
*/
// 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: 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 = 0;
address public dataSource;
using Strings for uint256;
bool public mintActive;
bytes32 public merkleRoot;
uint256 private hands;
mapping(address => uint256) public userTokenCount;
mapping(address => uint256) public mintedTokens;
event OpenTheMine();
constructor(address _dataSource) ERC721("GobsNFT", "GOBS") Ownable(msg.sender){
dataSource = _dataSource;
}
function setDataSource(address _dataSource) public onlyOwner {
dataSource = _dataSource;
}
function setMerkleRoot(bytes32 _merkleRoot) public onlyOwner {
merkleRoot = _merkleRoot;
}
function verifyMerkleProof(address account, bytes32[] calldata proof) public view returns (bool) {
bytes32 leaf = keccak256(abi.encodePacked(account));
return MerkleProof.verify(proof, merkleRoot, leaf);
}
function mint(bytes32[] calldata proof) public {
require(mintActive, "Mint not active");
require(_tokenIdCounter < MAX_SUPPLY, "Max supply reached");
require(mintedTokens[msg.sender] < 2, "Max 3 mints per address allowed");
require(verifyMerkleProof(msg.sender, proof), "Address not whitelisted");
uint256 tokenId = _tokenIdCounter;
_tokenIdCounter++;
mintedTokens[msg.sender]++;
_safeMint(msg.sender, tokenId);
}
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 to check owned tokens and update count
// /mine
function placeHand() public {
uint256 userBalance = balanceOf(msg.sender); // Get the current number of tokens owned by the user
uint256 newTokens = userBalance - userTokenCount[msg.sender]; // Calculate new tokens since the last call
require(newTokens > 0, "No new tokens to place");
// Update the user's token count and the cumulative total
userTokenCount[msg.sender] = userBalance;
hands += newTokens;
// Check if the cumulative count reaches or exceeds 555
if (hands >= 555) {
emit OpenTheMine();
}
}
// Function to withdraw ERC20 tokens
function withdrawERC20(address tokenAddress, uint256 amount) public onlyOwner {
IERC20 token = IERC20(tokenAddress); // Initialize the ERC20 token interface
require(token.transfer(msg.sender, amount), "Transfer failed");
}
// Function to withdraw NFTs
function withdrawNFT(address nftAddress, uint256 tokenId) public onlyOwner {
IERC721 nft = IERC721(nftAddress); // Initialize the ERC721 token interface
nft.safeTransferFrom(address(this), msg.sender, tokenId); // Transfer the NFT to the owner
}
}[{"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":"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":[],"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":"owner","type":"address"},{"internalType":"address","name":"operator","type":"address"}],"name":"isApprovedForAll","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"merkleRoot","outputs":[{"internalType":"bytes32","name":"","type":"bytes32"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"bytes32[]","name":"proof","type":"bytes32[]"}],"name":"mint","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"mintActive","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"","type":"address"}],"name":"mintedTokens","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"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":[],"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":"bytes32","name":"_merkleRoot","type":"bytes32"}],"name":"setMerkleRoot","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":"account","type":"address"},{"internalType":"bytes32[]","name":"proof","type":"bytes32[]"}],"name":"verifyMerkleProof","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
60806040525f600755348015610013575f80fd5b50604051613b9b380380613b9b833981810160405281019061003591906102aa565b336040518060400160405280600781526020017f476f62734e4654000000000000000000000000000000000000000000000000008152506040518060400160405280600481526020017f474f425300000000000000000000000000000000000000000000000000000000815250815f90816100b0919061050f565b5080600190816100c0919061050f565b5050505f73ffffffffffffffffffffffffffffffffffffffff168173ffffffffffffffffffffffffffffffffffffffff1603610133575f6040517f1e4fbdf700000000000000000000000000000000000000000000000000000000815260040161012a91906105ed565b60405180910390fd5b6101428161018960201b60201c565b508060085f6101000a81548173ffffffffffffffffffffffffffffffffffffffff021916908373ffffffffffffffffffffffffffffffffffffffff16021790555050610606565b5f60065f9054906101000a900473ffffffffffffffffffffffffffffffffffffffff1690508160065f6101000a81548173ffffffffffffffffffffffffffffffffffffffff021916908373ffffffffffffffffffffffffffffffffffffffff1602179055508173ffffffffffffffffffffffffffffffffffffffff168173ffffffffffffffffffffffffffffffffffffffff167f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e060405160405180910390a35050565b5f80fd5b5f73ffffffffffffffffffffffffffffffffffffffff82169050919050565b5f61027982610250565b9050919050565b6102898161026f565b8114610293575f80fd5b50565b5f815190506102a481610280565b92915050565b5f602082840312156102bf576102be61024c565b5b5f6102cc84828501610296565b91505092915050565b5f81519050919050565b7f4e487b71000000000000000000000000000000000000000000000000000000005f52604160045260245ffd5b7f4e487b71000000000000000000000000000000000000000000000000000000005f52602260045260245ffd5b5f600282049050600182168061035057607f821691505b6020821081036103635761036261030c565b5b50919050565b5f819050815f5260205f209050919050565b5f6020601f8301049050919050565b5f82821b905092915050565b5f600883026103c57fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff8261038a565b6103cf868361038a565b95508019841693508086168417925050509392505050565b5f819050919050565b5f819050919050565b5f61041361040e610409846103e7565b6103f0565b6103e7565b9050919050565b5f819050919050565b61042c836103f9565b6104406104388261041a565b848454610396565b825550505050565b5f90565b610454610448565b61045f818484610423565b505050565b5b81811015610482576104775f8261044c565b600181019050610465565b5050565b601f8211156104c75761049881610369565b6104a18461037b565b810160208510156104b0578190505b6104c46104bc8561037b565b830182610464565b50505b505050565b5f82821c905092915050565b5f6104e75f19846008026104cc565b1980831691505092915050565b5f6104ff83836104d8565b9150826002028217905092915050565b610518826102d5565b67ffffffffffffffff811115610531576105306102df565b5b61053b8254610339565b610546828285610486565b5f60209050601f831160018114610577575f8415610565578287015190505b61056f85826104f4565b8655506105d6565b601f19841661058586610369565b5f5b828110156105ac57848901518255600182019150602085019450602081019050610587565b868310156105c957848901516105c5601f8916826104d8565b8355505b6001600288020188555050505b505050505050565b6105e78161026f565b82525050565b5f6020820190506106005f8301846105de565b92915050565b613588806106135f395ff3fe608060405234801561000f575f80fd5b50600436106101d8575f3560e01c8063715018a611610102578063a22cb465116100a0578063d02c2bf21161006f578063d02c2bf21461052a578063dc02743814610534578063e985e9c514610564578063f2fde38b14610594576101d8565b8063a22cb465146104a6578063b77a147b146104c2578063b88d4fde146104de578063c87b56dd146104fa576101d8565b80637cb64759116100dc5780637cb64759146104325780638da5cb5b1461044e57806395d89b411461046c578063a1db97821461048a576101d8565b8063715018a6146103dc5780637241dfa0146103e6578063755e67b114610416576101d8565b80632eb4a7ab1161017a57806360eb674b1161014957806360eb674b146103425780636352211e14610372578063695b314b146103a257806370a08231146103ac576101d8565b80632eb4a7ab146102ce57806332cb6b0c146102ec57806342842e0e1461030a5780636088e93a14610326576101d8565b8063095ea7b3116101b6578063095ea7b31461025a5780631b076edc1461027657806323b872dd1461029457806325fd90f3146102b0576101d8565b806301ffc9a7146101dc57806306fdde031461020c578063081812fc1461022a575b5f80fd5b6101f660048036038101906101f19190612448565b6105b0565b604051610203919061248d565b60405180910390f35b610214610691565b6040516102219190612516565b60405180910390f35b610244600480360381019061023f9190612569565b610720565b60405161025191906125d3565b60405180910390f35b610274600480360381019061026f9190612616565b61073b565b005b61027e610751565b60405161028b91906125d3565b60405180910390f35b6102ae60048036038101906102a99190612654565b610776565b005b6102b8610875565b6040516102c5919061248d565b60405180910390f35b6102d6610888565b6040516102e391906126bc565b60405180910390f35b6102f461088e565b60405161030191906126e4565b60405180910390f35b610324600480360381019061031f9190612654565b610894565b005b610340600480360381019061033b9190612616565b6108b3565b005b61035c6004803603810190610357919061275e565b61092e565b604051610369919061248d565b60405180910390f35b61038c60048036038101906103879190612569565b6109b0565b60405161039991906125d3565b60405180910390f35b6103aa6109c1565b005b6103c660048036038101906103c191906127bb565b610af1565b6040516103d391906126e4565b60405180910390f35b6103e4610ba7565b005b61040060048036038101906103fb91906127bb565b610bba565b60405161040d91906126e4565b60405180910390f35b610430600480360381019061042b91906127bb565b610bcf565b005b61044c60048036038101906104479190612810565b610c1a565b005b610456610c2c565b60405161046391906125d3565b60405180910390f35b610474610c54565b6040516104819190612516565b60405180910390f35b6104a4600480360381019061049f9190612616565b610ce4565b005b6104c060048036038101906104bb9190612865565b610daf565b005b6104dc60048036038101906104d791906128a3565b610dc5565b005b6104f860048036038101906104f39190612a16565b610fa2565b005b610514600480360381019061050f9190612569565b610fc7565b6040516105219190612516565b60405180910390f35b6105326111b5565b005b61054e600480360381019061054991906127bb565b6111e9565b60405161055b91906126e4565b60405180910390f35b61057e60048036038101906105799190612a96565b6111fe565b60405161058b919061248d565b60405180910390f35b6105ae60048036038101906105a991906127bb565b61128c565b005b5f7f80ac58cd000000000000000000000000000000000000000000000000000000007bffffffffffffffffffffffffffffffffffffffffffffffffffffffff1916827bffffffffffffffffffffffffffffffffffffffffffffffffffffffff1916148061067a57507f5b5e139f000000000000000000000000000000000000000000000000000000007bffffffffffffffffffffffffffffffffffffffffffffffffffffffff1916827bffffffffffffffffffffffffffffffffffffffffffffffffffffffff1916145b8061068a575061068982611310565b5b9050919050565b60605f805461069f90612b01565b80601f01602080910402602001604051908101604052809291908181526020018280546106cb90612b01565b80156107165780601f106106ed57610100808354040283529160200191610716565b820191905f5260205f20905b8154815290600101906020018083116106f957829003601f168201915b5050505050905090565b5f61072a82611379565b50610734826113ff565b9050919050565b61074d8282610748611438565b61143f565b5050565b60085f9054906101000a900473ffffffffffffffffffffffffffffffffffffffff1681565b5f73ffffffffffffffffffffffffffffffffffffffff168273ffffffffffffffffffffffffffffffffffffffff16036107e6575f6040517f64a0ae920000000000000000000000000000000000000000000000000000000081526004016107dd91906125d3565b60405180910390fd5b5f6107f983836107f4611438565b611451565b90508373ffffffffffffffffffffffffffffffffffffffff168173ffffffffffffffffffffffffffffffffffffffff161461086f578382826040517f64283d7b00000000000000000000000000000000000000000000000000000000815260040161086693929190612b31565b60405180910390fd5b50505050565b600860149054906101000a900460ff1681565b60095481565b6108ae81565b6108ae83838360405180602001604052805f815250610fa2565b505050565b6108bb61165c565b5f8290508073ffffffffffffffffffffffffffffffffffffffff166342842e0e3033856040518463ffffffff1660e01b81526004016108fc93929190612b66565b5f604051808303815f87803b158015610913575f80fd5b505af1158015610925573d5f803e3d5ffd5b50505050505050565b5f80846040516020016109419190612be0565b6040516020818303038152906040528051906020012090506109a68484808060200260200160405190810160405280939291908181526020018383602002808284375f81840152601f19601f82011690508083019250505050505050600954836116e3565b9150509392505050565b5f6109ba82611379565b9050919050565b5f6109cb33610af1565b90505f600b5f3373ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205482610a179190612c27565b90505f8111610a5b576040517f08c379a0000000000000000000000000000000000000000000000000000000008152600401610a5290612ca4565b60405180910390fd5b81600b5f3373ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f208190555080600a5f828254610aae9190612cc2565b9250508190555061022b600a5410610aed577f46b612c06ed0b37523aea4d54cebeaa959f59311bcce3201eeff7d4c84f2274760405160405180910390a15b5050565b5f8073ffffffffffffffffffffffffffffffffffffffff168273ffffffffffffffffffffffffffffffffffffffff1603610b62575f6040517f89c62b64000000000000000000000000000000000000000000000000000000008152600401610b5991906125d3565b60405180910390fd5b60035f8373ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f20549050919050565b610baf61165c565b610bb85f6116f9565b565b600c602052805f5260405f205f915090505481565b610bd761165c565b8060085f6101000a81548173ffffffffffffffffffffffffffffffffffffffff021916908373ffffffffffffffffffffffffffffffffffffffff16021790555050565b610c2261165c565b8060098190555050565b5f60065f9054906101000a900473ffffffffffffffffffffffffffffffffffffffff16905090565b606060018054610c6390612b01565b80601f0160208091040260200160405190810160405280929190818152602001828054610c8f90612b01565b8015610cda5780601f10610cb157610100808354040283529160200191610cda565b820191905f5260205f20905b815481529060010190602001808311610cbd57829003601f168201915b5050505050905090565b610cec61165c565b5f8290508073ffffffffffffffffffffffffffffffffffffffff1663a9059cbb33846040518363ffffffff1660e01b8152600401610d2b929190612cf5565b6020604051808303815f875af1158015610d47573d5f803e3d5ffd5b505050506040513d601f19601f82011682018060405250810190610d6b9190612d30565b610daa576040517f08c379a0000000000000000000000000000000000000000000000000000000008152600401610da190612da5565b60405180910390fd5b505050565b610dc1610dba611438565b83836117bc565b5050565b600860149054906101000a900460ff16610e14576040517f08c379a0000000000000000000000000000000000000000000000000000000008152600401610e0b90612e0d565b60405180910390fd5b6108ae60075410610e5a576040517f08c379a0000000000000000000000000000000000000000000000000000000008152600401610e5190612e75565b60405180910390fd5b6002600c5f3373ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205410610eda576040517f08c379a0000000000000000000000000000000000000000000000000000000008152600401610ed190612edd565b60405180910390fd5b610ee533838361092e565b610f24576040517f08c379a0000000000000000000000000000000000000000000000000000000008152600401610f1b90612f45565b60405180910390fd5b5f600754905060075f815480929190610f3c90612f63565b9190505550600c5f3373ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205f815480929190610f8e90612f63565b9190505550610f9d3382611925565b505050565b610fad848484610776565b610fc1610fb8611438565b85858585611942565b50505050565b606060075482111561100e576040517f08c379a000000000000000000000000000000000000000000000000000000000815260040161100590612ff4565b60405180910390fd5b5f60085f9054906101000a900473ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff16633efabdf4846040518263ffffffff1660e01b815260040161106991906126e4565b5f60405180830381865afa158015611083573d5f803e3d5ffd5b505050506040513d5f823e3d601f19601f820116820180604052508101906110ab91906130b0565b90505f60085f9054906101000a900473ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1663e1dc0761856040518263ffffffff1660e01b815260040161110891906126e4565b5f60405180830381865afa158015611122573d5f803e3d5ffd5b505050506040513d5f823e3d601f19601f8201168201806040525081019061114a91906130b0565b90505f61115685611aee565b61115f84611bb8565b83604051602001611172939291906132a5565b604051602081830303815290604052905061118c81611bb8565b60405160200161119c919061334b565b6040516020818303038152906040529350505050919050565b6111bd61165c565b600860149054906101000a900460ff1615600860146101000a81548160ff021916908315150217905550565b600b602052805f5260405f205f915090505481565b5f60055f8473ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205f8373ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205f9054906101000a900460ff16905092915050565b61129461165c565b5f73ffffffffffffffffffffffffffffffffffffffff168173ffffffffffffffffffffffffffffffffffffffff1603611304575f6040517f1e4fbdf70000000000000000000000000000000000000000000000000000000081526004016112fb91906125d3565b60405180910390fd5b61130d816116f9565b50565b5f7f01ffc9a7000000000000000000000000000000000000000000000000000000007bffffffffffffffffffffffffffffffffffffffffffffffffffffffff1916827bffffffffffffffffffffffffffffffffffffffffffffffffffffffff1916149050919050565b5f8061138483611be5565b90505f73ffffffffffffffffffffffffffffffffffffffff168173ffffffffffffffffffffffffffffffffffffffff16036113f657826040517f7e2732890000000000000000000000000000000000000000000000000000000081526004016113ed91906126e4565b60405180910390fd5b80915050919050565b5f60045f8381526020019081526020015f205f9054906101000a900473ffffffffffffffffffffffffffffffffffffffff169050919050565b5f33905090565b61144c8383836001611c1e565b505050565b5f8061145c84611be5565b90505f73ffffffffffffffffffffffffffffffffffffffff168373ffffffffffffffffffffffffffffffffffffffff161461149d5761149c818486611ddd565b5b5f73ffffffffffffffffffffffffffffffffffffffff168173ffffffffffffffffffffffffffffffffffffffff1614611528576114dc5f855f80611c1e565b600160035f8373ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205f82825403925050819055505b5f73ffffffffffffffffffffffffffffffffffffffff168573ffffffffffffffffffffffffffffffffffffffff16146115a757600160035f8773ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205f82825401925050819055505b8460025f8681526020019081526020015f205f6101000a81548173ffffffffffffffffffffffffffffffffffffffff021916908373ffffffffffffffffffffffffffffffffffffffff160217905550838573ffffffffffffffffffffffffffffffffffffffff168273ffffffffffffffffffffffffffffffffffffffff167fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef60405160405180910390a4809150509392505050565b611664611438565b73ffffffffffffffffffffffffffffffffffffffff16611682610c2c565b73ffffffffffffffffffffffffffffffffffffffff16146116e1576116a5611438565b6040517f118cdaa70000000000000000000000000000000000000000000000000000000081526004016116d891906125d3565b60405180910390fd5b565b5f826116ef8584611ea0565b1490509392505050565b5f60065f9054906101000a900473ffffffffffffffffffffffffffffffffffffffff1690508160065f6101000a81548173ffffffffffffffffffffffffffffffffffffffff021916908373ffffffffffffffffffffffffffffffffffffffff1602179055508173ffffffffffffffffffffffffffffffffffffffff168173ffffffffffffffffffffffffffffffffffffffff167f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e060405160405180910390a35050565b5f73ffffffffffffffffffffffffffffffffffffffff168273ffffffffffffffffffffffffffffffffffffffff160361182c57816040517f5b08ba1800000000000000000000000000000000000000000000000000000000815260040161182391906125d3565b60405180910390fd5b8060055f8573ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205f8473ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205f6101000a81548160ff0219169083151502179055508173ffffffffffffffffffffffffffffffffffffffff168373ffffffffffffffffffffffffffffffffffffffff167f17307eab39ab6107e8899845ad3d59bd9653f200f220920489ca2b5937696c3183604051611918919061248d565b60405180910390a3505050565b61193e828260405180602001604052805f815250611eee565b5050565b5f8373ffffffffffffffffffffffffffffffffffffffff163b1115611ae7578273ffffffffffffffffffffffffffffffffffffffff1663150b7a02868685856040518563ffffffff1660e01b81526004016119a094939291906133be565b6020604051808303815f875af19250505080156119db57506040513d601f19601f820116820180604052508101906119d8919061341c565b60015b611a5c573d805f8114611a09576040519150601f19603f3d011682016040523d82523d5f602084013e611a0e565b606091505b505f815103611a5457836040517f64a0ae92000000000000000000000000000000000000000000000000000000008152600401611a4b91906125d3565b60405180910390fd5b805181602001fd5b63150b7a0260e01b7bffffffffffffffffffffffffffffffffffffffffffffffffffffffff1916817bffffffffffffffffffffffffffffffffffffffffffffffffffffffff191614611ae557836040517f64a0ae92000000000000000000000000000000000000000000000000000000008152600401611adc91906125d3565b60405180910390fd5b505b5050505050565b60605f6001611afc84611f11565b0190505f8167ffffffffffffffff811115611b1a57611b196128f2565b5b6040519080825280601f01601f191660200182016040528015611b4c5781602001600182028036833780820191505090505b5090505f82602001820190505b600115611bad578080600190039150507f3031323334353637383961626364656600000000000000000000000000000000600a86061a8153600a8581611ba257611ba1613447565b5b0494505f8503611b59575b819350505050919050565b6060611bde82604051806060016040528060408152602001613513604091396001612062565b9050919050565b5f60025f8381526020019081526020015f205f9054906101000a900473ffffffffffffffffffffffffffffffffffffffff169050919050565b8080611c5657505f73ffffffffffffffffffffffffffffffffffffffff168273ffffffffffffffffffffffffffffffffffffffff1614155b15611d88575f611c6584611379565b90505f73ffffffffffffffffffffffffffffffffffffffff168373ffffffffffffffffffffffffffffffffffffffff1614158015611ccf57508273ffffffffffffffffffffffffffffffffffffffff168173ffffffffffffffffffffffffffffffffffffffff1614155b8015611ce25750611ce081846111fe565b155b15611d2457826040517fa9fbf51f000000000000000000000000000000000000000000000000000000008152600401611d1b91906125d3565b60405180910390fd5b8115611d8657838573ffffffffffffffffffffffffffffffffffffffff168273ffffffffffffffffffffffffffffffffffffffff167f8c5be1e5ebec7d5bd14f71427d1e84f3dd0314c0f7b2291e5b200ac8c7c3b92560405160405180910390a45b505b8360045f8581526020019081526020015f205f6101000a81548173ffffffffffffffffffffffffffffffffffffffff021916908373ffffffffffffffffffffffffffffffffffffffff16021790555050505050565b611de88383836121f1565b611e9b575f73ffffffffffffffffffffffffffffffffffffffff168373ffffffffffffffffffffffffffffffffffffffff1603611e5c57806040517f7e273289000000000000000000000000000000000000000000000000000000008152600401611e5391906126e4565b60405180910390fd5b81816040517f177e802f000000000000000000000000000000000000000000000000000000008152600401611e92929190612cf5565b60405180910390fd5b505050565b5f808290505f5b8451811015611ee357611ed482868381518110611ec757611ec6613474565b5b60200260200101516122b1565b91508080600101915050611ea7565b508091505092915050565b611ef883836122db565b611f0c611f03611438565b5f858585611942565b505050565b5f805f90507a184f03e93ff9f4daa797ed6e38ed64bf6a1f0100000000000000008310611f6d577a184f03e93ff9f4daa797ed6e38ed64bf6a1f0100000000000000008381611f6357611f62613447565b5b0492506040810190505b6d04ee2d6d415b85acef81000000008310611faa576d04ee2d6d415b85acef81000000008381611fa057611f9f613447565b5b0492506020810190505b662386f26fc100008310611fd957662386f26fc100008381611fcf57611fce613447565b5b0492506010810190505b6305f5e1008310612002576305f5e1008381611ff857611ff7613447565b5b0492506008810190505b612710831061202757612710838161201d5761201c613447565b5b0492506004810190505b6064831061204a57606483816120405761203f613447565b5b0492506002810190505b600a8310612059576001810190505b80915050919050565b60605f8451036120825760405180602001604052805f81525090506121ea565b5f826120b357600360028651600461209a91906134a1565b6120a49190612cc2565b6120ae91906134e2565b6120da565b6003600286516120c39190612cc2565b6120cd91906134e2565b60046120d991906134a1565b5b90505f8167ffffffffffffffff8111156120f7576120f66128f2565b5b6040519080825280601f01601f1916602001820160405280156121295781602001600182028036833780820191505090505b509050600185016020820187885189016020810180515f82525b8284101561219e576003840193508351603f8160121c168701518653600186019550603f81600c1c168701518653600186019550603f8160061c168701518653600186019550603f8116870151865360018601955050612143565b80825289156121de5760038c5106600181146121c157600281146121d4576121dc565b603d6001870353603d60028703536121dc565b603d60018703535b505b50505050505080925050505b9392505050565b5f8073ffffffffffffffffffffffffffffffffffffffff168373ffffffffffffffffffffffffffffffffffffffff16141580156122a857508273ffffffffffffffffffffffffffffffffffffffff168473ffffffffffffffffffffffffffffffffffffffff161480612269575061226884846111fe565b5b806122a757508273ffffffffffffffffffffffffffffffffffffffff1661228f836113ff565b73ffffffffffffffffffffffffffffffffffffffff16145b5b90509392505050565b5f8183106122c8576122c382846123ce565b6122d3565b6122d283836123ce565b5b905092915050565b5f73ffffffffffffffffffffffffffffffffffffffff168273ffffffffffffffffffffffffffffffffffffffff160361234b575f6040517f64a0ae9200000000000000000000000000000000000000000000000000000000815260040161234291906125d3565b60405180910390fd5b5f61235783835f611451565b90505f73ffffffffffffffffffffffffffffffffffffffff168173ffffffffffffffffffffffffffffffffffffffff16146123c9575f6040517f73c6ac6e0000000000000000000000000000000000000000000000000000000081526004016123c091906125d3565b60405180910390fd5b505050565b5f825f528160205260405f20905092915050565b5f604051905090565b5f80fd5b5f80fd5b5f7fffffffff0000000000000000000000000000000000000000000000000000000082169050919050565b612427816123f3565b8114612431575f80fd5b50565b5f813590506124428161241e565b92915050565b5f6020828403121561245d5761245c6123eb565b5b5f61246a84828501612434565b91505092915050565b5f8115159050919050565b61248781612473565b82525050565b5f6020820190506124a05f83018461247e565b92915050565b5f81519050919050565b5f82825260208201905092915050565b8281835e5f83830152505050565b5f601f19601f8301169050919050565b5f6124e8826124a6565b6124f281856124b0565b93506125028185602086016124c0565b61250b816124ce565b840191505092915050565b5f6020820190508181035f83015261252e81846124de565b905092915050565b5f819050919050565b61254881612536565b8114612552575f80fd5b50565b5f813590506125638161253f565b92915050565b5f6020828403121561257e5761257d6123eb565b5b5f61258b84828501612555565b91505092915050565b5f73ffffffffffffffffffffffffffffffffffffffff82169050919050565b5f6125bd82612594565b9050919050565b6125cd816125b3565b82525050565b5f6020820190506125e65f8301846125c4565b92915050565b6125f5816125b3565b81146125ff575f80fd5b50565b5f81359050612610816125ec565b92915050565b5f806040838503121561262c5761262b6123eb565b5b5f61263985828601612602565b925050602061264a85828601612555565b9150509250929050565b5f805f6060848603121561266b5761266a6123eb565b5b5f61267886828701612602565b935050602061268986828701612602565b925050604061269a86828701612555565b9150509250925092565b5f819050919050565b6126b6816126a4565b82525050565b5f6020820190506126cf5f8301846126ad565b92915050565b6126de81612536565b82525050565b5f6020820190506126f75f8301846126d5565b92915050565b5f80fd5b5f80fd5b5f80fd5b5f8083601f84011261271e5761271d6126fd565b5b8235905067ffffffffffffffff81111561273b5761273a612701565b5b60208301915083602082028301111561275757612756612705565b5b9250929050565b5f805f60408486031215612775576127746123eb565b5b5f61278286828701612602565b935050602084013567ffffffffffffffff8111156127a3576127a26123ef565b5b6127af86828701612709565b92509250509250925092565b5f602082840312156127d0576127cf6123eb565b5b5f6127dd84828501612602565b91505092915050565b6127ef816126a4565b81146127f9575f80fd5b50565b5f8135905061280a816127e6565b92915050565b5f60208284031215612825576128246123eb565b5b5f612832848285016127fc565b91505092915050565b61284481612473565b811461284e575f80fd5b50565b5f8135905061285f8161283b565b92915050565b5f806040838503121561287b5761287a6123eb565b5b5f61288885828601612602565b925050602061289985828601612851565b9150509250929050565b5f80602083850312156128b9576128b86123eb565b5b5f83013567ffffffffffffffff8111156128d6576128d56123ef565b5b6128e285828601612709565b92509250509250929050565b5f80fd5b7f4e487b71000000000000000000000000000000000000000000000000000000005f52604160045260245ffd5b612928826124ce565b810181811067ffffffffffffffff82111715612947576129466128f2565b5b80604052505050565b5f6129596123e2565b9050612965828261291f565b919050565b5f67ffffffffffffffff821115612984576129836128f2565b5b61298d826124ce565b9050602081019050919050565b828183375f83830152505050565b5f6129ba6129b58461296a565b612950565b9050828152602081018484840111156129d6576129d56128ee565b5b6129e184828561299a565b509392505050565b5f82601f8301126129fd576129fc6126fd565b5b8135612a0d8482602086016129a8565b91505092915050565b5f805f8060808587031215612a2e57612a2d6123eb565b5b5f612a3b87828801612602565b9450506020612a4c87828801612602565b9350506040612a5d87828801612555565b925050606085013567ffffffffffffffff811115612a7e57612a7d6123ef565b5b612a8a878288016129e9565b91505092959194509250565b5f8060408385031215612aac57612aab6123eb565b5b5f612ab985828601612602565b9250506020612aca85828601612602565b9150509250929050565b7f4e487b71000000000000000000000000000000000000000000000000000000005f52602260045260245ffd5b5f6002820490506001821680612b1857607f821691505b602082108103612b2b57612b2a612ad4565b5b50919050565b5f606082019050612b445f8301866125c4565b612b5160208301856126d5565b612b5e60408301846125c4565b949350505050565b5f606082019050612b795f8301866125c4565b612b8660208301856125c4565b612b9360408301846126d5565b949350505050565b5f8160601b9050919050565b5f612bb182612b9b565b9050919050565b5f612bc282612ba7565b9050919050565b612bda612bd5826125b3565b612bb8565b82525050565b5f612beb8284612bc9565b60148201915081905092915050565b7f4e487b71000000000000000000000000000000000000000000000000000000005f52601160045260245ffd5b5f612c3182612536565b9150612c3c83612536565b9250828203905081811115612c5457612c53612bfa565b5b92915050565b7f4e6f206e657720746f6b656e7320746f20706c616365000000000000000000005f82015250565b5f612c8e6016836124b0565b9150612c9982612c5a565b602082019050919050565b5f6020820190508181035f830152612cbb81612c82565b9050919050565b5f612ccc82612536565b9150612cd783612536565b9250828201905080821115612cef57612cee612bfa565b5b92915050565b5f604082019050612d085f8301856125c4565b612d1560208301846126d5565b9392505050565b5f81519050612d2a8161283b565b92915050565b5f60208284031215612d4557612d446123eb565b5b5f612d5284828501612d1c565b91505092915050565b7f5472616e73666572206661696c656400000000000000000000000000000000005f82015250565b5f612d8f600f836124b0565b9150612d9a82612d5b565b602082019050919050565b5f6020820190508181035f830152612dbc81612d83565b9050919050565b7f4d696e74206e6f742061637469766500000000000000000000000000000000005f82015250565b5f612df7600f836124b0565b9150612e0282612dc3565b602082019050919050565b5f6020820190508181035f830152612e2481612deb565b9050919050565b7f4d617820737570706c79207265616368656400000000000000000000000000005f82015250565b5f612e5f6012836124b0565b9150612e6a82612e2b565b602082019050919050565b5f6020820190508181035f830152612e8c81612e53565b9050919050565b7f4d61782033206d696e747320706572206164647265737320616c6c6f776564005f82015250565b5f612ec7601f836124b0565b9150612ed282612e93565b602082019050919050565b5f6020820190508181035f830152612ef481612ebb565b9050919050565b7f41646472657373206e6f742077686974656c69737465640000000000000000005f82015250565b5f612f2f6017836124b0565b9150612f3a82612efb565b602082019050919050565b5f6020820190508181035f830152612f5c81612f23565b9050919050565b5f612f6d82612536565b91507fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff8203612f9f57612f9e612bfa565b5b600182019050919050565b7f546f6b656e20646f6573206e6f742065786973740000000000000000000000005f82015250565b5f612fde6014836124b0565b9150612fe982612faa565b602082019050919050565b5f6020820190508181035f83015261300b81612fd2565b9050919050565b5f67ffffffffffffffff82111561302c5761302b6128f2565b5b613035826124ce565b9050602081019050919050565b5f61305461304f84613012565b612950565b9050828152602081018484840111156130705761306f6128ee565b5b61307b8482856124c0565b509392505050565b5f82601f830112613097576130966126fd565b5b81516130a7848260208601613042565b91505092915050565b5f602082840312156130c5576130c46123eb565b5b5f82015167ffffffffffffffff8111156130e2576130e16123ef565b5b6130ee84828501613083565b91505092915050565b5f81905092915050565b7f7b226e616d65223a2022476f62202300000000000000000000000000000000005f82015250565b5f613135600f836130f7565b915061314082613101565b600f82019050919050565b5f613155826124a6565b61315f81856130f7565b935061316f8185602086016124c0565b80840191505092915050565b7f222c20226465736372697074696f6e223a20224f6e2d636861696e20476f62205f8201527f4e4654222c2022696d616765223a2022646174613a696d6167652f7376672b7860208201527f6d6c3b6261736536342c00000000000000000000000000000000000000000000604082015250565b5f6131fb604a836130f7565b91506132068261317b565b604a82019050919050565b7f222c202261747472696275746573223a200000000000000000000000000000005f82015250565b5f6132456011836130f7565b915061325082613211565b601182019050919050565b7f7d000000000000000000000000000000000000000000000000000000000000005f82015250565b5f61328f6001836130f7565b915061329a8261325b565b600182019050919050565b5f6132af82613129565b91506132bb828661314b565b91506132c6826131ef565b91506132d2828561314b565b91506132dd82613239565b91506132e9828461314b565b91506132f482613283565b9150819050949350505050565b7f646174613a6170706c69636174696f6e2f6a736f6e3b6261736536342c0000005f82015250565b5f613335601d836130f7565b915061334082613301565b601d82019050919050565b5f61335582613329565b9150613361828461314b565b915081905092915050565b5f81519050919050565b5f82825260208201905092915050565b5f6133908261336c565b61339a8185613376565b93506133aa8185602086016124c0565b6133b3816124ce565b840191505092915050565b5f6080820190506133d15f8301876125c4565b6133de60208301866125c4565b6133eb60408301856126d5565b81810360608301526133fd8184613386565b905095945050505050565b5f815190506134168161241e565b92915050565b5f60208284031215613431576134306123eb565b5b5f61343e84828501613408565b91505092915050565b7f4e487b71000000000000000000000000000000000000000000000000000000005f52601260045260245ffd5b7f4e487b71000000000000000000000000000000000000000000000000000000005f52603260045260245ffd5b5f6134ab82612536565b91506134b683612536565b92508282026134c481612536565b915082820484148315176134db576134da612bfa565b5b5092915050565b5f6134ec82612536565b91506134f783612536565b92508261350757613506613447565b5b82820490509291505056fe4142434445464748494a4b4c4d4e4f505152535455565758595a6162636465666768696a6b6c6d6e6f707172737475767778797a303132333435363738392b2fa2646970667358221220eaa4277fc588b14047871bd0f6879b583482a1e4b43499877ad6f68083bfe40764736f6c634300081a0033000000000000000000000000c20d4ba1cce177b1f09fadd8f72f2e59109b1836
Deployed Bytecode
0x608060405234801561000f575f80fd5b50600436106101d8575f3560e01c8063715018a611610102578063a22cb465116100a0578063d02c2bf21161006f578063d02c2bf21461052a578063dc02743814610534578063e985e9c514610564578063f2fde38b14610594576101d8565b8063a22cb465146104a6578063b77a147b146104c2578063b88d4fde146104de578063c87b56dd146104fa576101d8565b80637cb64759116100dc5780637cb64759146104325780638da5cb5b1461044e57806395d89b411461046c578063a1db97821461048a576101d8565b8063715018a6146103dc5780637241dfa0146103e6578063755e67b114610416576101d8565b80632eb4a7ab1161017a57806360eb674b1161014957806360eb674b146103425780636352211e14610372578063695b314b146103a257806370a08231146103ac576101d8565b80632eb4a7ab146102ce57806332cb6b0c146102ec57806342842e0e1461030a5780636088e93a14610326576101d8565b8063095ea7b3116101b6578063095ea7b31461025a5780631b076edc1461027657806323b872dd1461029457806325fd90f3146102b0576101d8565b806301ffc9a7146101dc57806306fdde031461020c578063081812fc1461022a575b5f80fd5b6101f660048036038101906101f19190612448565b6105b0565b604051610203919061248d565b60405180910390f35b610214610691565b6040516102219190612516565b60405180910390f35b610244600480360381019061023f9190612569565b610720565b60405161025191906125d3565b60405180910390f35b610274600480360381019061026f9190612616565b61073b565b005b61027e610751565b60405161028b91906125d3565b60405180910390f35b6102ae60048036038101906102a99190612654565b610776565b005b6102b8610875565b6040516102c5919061248d565b60405180910390f35b6102d6610888565b6040516102e391906126bc565b60405180910390f35b6102f461088e565b60405161030191906126e4565b60405180910390f35b610324600480360381019061031f9190612654565b610894565b005b610340600480360381019061033b9190612616565b6108b3565b005b61035c6004803603810190610357919061275e565b61092e565b604051610369919061248d565b60405180910390f35b61038c60048036038101906103879190612569565b6109b0565b60405161039991906125d3565b60405180910390f35b6103aa6109c1565b005b6103c660048036038101906103c191906127bb565b610af1565b6040516103d391906126e4565b60405180910390f35b6103e4610ba7565b005b61040060048036038101906103fb91906127bb565b610bba565b60405161040d91906126e4565b60405180910390f35b610430600480360381019061042b91906127bb565b610bcf565b005b61044c60048036038101906104479190612810565b610c1a565b005b610456610c2c565b60405161046391906125d3565b60405180910390f35b610474610c54565b6040516104819190612516565b60405180910390f35b6104a4600480360381019061049f9190612616565b610ce4565b005b6104c060048036038101906104bb9190612865565b610daf565b005b6104dc60048036038101906104d791906128a3565b610dc5565b005b6104f860048036038101906104f39190612a16565b610fa2565b005b610514600480360381019061050f9190612569565b610fc7565b6040516105219190612516565b60405180910390f35b6105326111b5565b005b61054e600480360381019061054991906127bb565b6111e9565b60405161055b91906126e4565b60405180910390f35b61057e60048036038101906105799190612a96565b6111fe565b60405161058b919061248d565b60405180910390f35b6105ae60048036038101906105a991906127bb565b61128c565b005b5f7f80ac58cd000000000000000000000000000000000000000000000000000000007bffffffffffffffffffffffffffffffffffffffffffffffffffffffff1916827bffffffffffffffffffffffffffffffffffffffffffffffffffffffff1916148061067a57507f5b5e139f000000000000000000000000000000000000000000000000000000007bffffffffffffffffffffffffffffffffffffffffffffffffffffffff1916827bffffffffffffffffffffffffffffffffffffffffffffffffffffffff1916145b8061068a575061068982611310565b5b9050919050565b60605f805461069f90612b01565b80601f01602080910402602001604051908101604052809291908181526020018280546106cb90612b01565b80156107165780601f106106ed57610100808354040283529160200191610716565b820191905f5260205f20905b8154815290600101906020018083116106f957829003601f168201915b5050505050905090565b5f61072a82611379565b50610734826113ff565b9050919050565b61074d8282610748611438565b61143f565b5050565b60085f9054906101000a900473ffffffffffffffffffffffffffffffffffffffff1681565b5f73ffffffffffffffffffffffffffffffffffffffff168273ffffffffffffffffffffffffffffffffffffffff16036107e6575f6040517f64a0ae920000000000000000000000000000000000000000000000000000000081526004016107dd91906125d3565b60405180910390fd5b5f6107f983836107f4611438565b611451565b90508373ffffffffffffffffffffffffffffffffffffffff168173ffffffffffffffffffffffffffffffffffffffff161461086f578382826040517f64283d7b00000000000000000000000000000000000000000000000000000000815260040161086693929190612b31565b60405180910390fd5b50505050565b600860149054906101000a900460ff1681565b60095481565b6108ae81565b6108ae83838360405180602001604052805f815250610fa2565b505050565b6108bb61165c565b5f8290508073ffffffffffffffffffffffffffffffffffffffff166342842e0e3033856040518463ffffffff1660e01b81526004016108fc93929190612b66565b5f604051808303815f87803b158015610913575f80fd5b505af1158015610925573d5f803e3d5ffd5b50505050505050565b5f80846040516020016109419190612be0565b6040516020818303038152906040528051906020012090506109a68484808060200260200160405190810160405280939291908181526020018383602002808284375f81840152601f19601f82011690508083019250505050505050600954836116e3565b9150509392505050565b5f6109ba82611379565b9050919050565b5f6109cb33610af1565b90505f600b5f3373ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205482610a179190612c27565b90505f8111610a5b576040517f08c379a0000000000000000000000000000000000000000000000000000000008152600401610a5290612ca4565b60405180910390fd5b81600b5f3373ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f208190555080600a5f828254610aae9190612cc2565b9250508190555061022b600a5410610aed577f46b612c06ed0b37523aea4d54cebeaa959f59311bcce3201eeff7d4c84f2274760405160405180910390a15b5050565b5f8073ffffffffffffffffffffffffffffffffffffffff168273ffffffffffffffffffffffffffffffffffffffff1603610b62575f6040517f89c62b64000000000000000000000000000000000000000000000000000000008152600401610b5991906125d3565b60405180910390fd5b60035f8373ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f20549050919050565b610baf61165c565b610bb85f6116f9565b565b600c602052805f5260405f205f915090505481565b610bd761165c565b8060085f6101000a81548173ffffffffffffffffffffffffffffffffffffffff021916908373ffffffffffffffffffffffffffffffffffffffff16021790555050565b610c2261165c565b8060098190555050565b5f60065f9054906101000a900473ffffffffffffffffffffffffffffffffffffffff16905090565b606060018054610c6390612b01565b80601f0160208091040260200160405190810160405280929190818152602001828054610c8f90612b01565b8015610cda5780601f10610cb157610100808354040283529160200191610cda565b820191905f5260205f20905b815481529060010190602001808311610cbd57829003601f168201915b5050505050905090565b610cec61165c565b5f8290508073ffffffffffffffffffffffffffffffffffffffff1663a9059cbb33846040518363ffffffff1660e01b8152600401610d2b929190612cf5565b6020604051808303815f875af1158015610d47573d5f803e3d5ffd5b505050506040513d601f19601f82011682018060405250810190610d6b9190612d30565b610daa576040517f08c379a0000000000000000000000000000000000000000000000000000000008152600401610da190612da5565b60405180910390fd5b505050565b610dc1610dba611438565b83836117bc565b5050565b600860149054906101000a900460ff16610e14576040517f08c379a0000000000000000000000000000000000000000000000000000000008152600401610e0b90612e0d565b60405180910390fd5b6108ae60075410610e5a576040517f08c379a0000000000000000000000000000000000000000000000000000000008152600401610e5190612e75565b60405180910390fd5b6002600c5f3373ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205410610eda576040517f08c379a0000000000000000000000000000000000000000000000000000000008152600401610ed190612edd565b60405180910390fd5b610ee533838361092e565b610f24576040517f08c379a0000000000000000000000000000000000000000000000000000000008152600401610f1b90612f45565b60405180910390fd5b5f600754905060075f815480929190610f3c90612f63565b9190505550600c5f3373ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205f815480929190610f8e90612f63565b9190505550610f9d3382611925565b505050565b610fad848484610776565b610fc1610fb8611438565b85858585611942565b50505050565b606060075482111561100e576040517f08c379a000000000000000000000000000000000000000000000000000000000815260040161100590612ff4565b60405180910390fd5b5f60085f9054906101000a900473ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff16633efabdf4846040518263ffffffff1660e01b815260040161106991906126e4565b5f60405180830381865afa158015611083573d5f803e3d5ffd5b505050506040513d5f823e3d601f19601f820116820180604052508101906110ab91906130b0565b90505f60085f9054906101000a900473ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1663e1dc0761856040518263ffffffff1660e01b815260040161110891906126e4565b5f60405180830381865afa158015611122573d5f803e3d5ffd5b505050506040513d5f823e3d601f19601f8201168201806040525081019061114a91906130b0565b90505f61115685611aee565b61115f84611bb8565b83604051602001611172939291906132a5565b604051602081830303815290604052905061118c81611bb8565b60405160200161119c919061334b565b6040516020818303038152906040529350505050919050565b6111bd61165c565b600860149054906101000a900460ff1615600860146101000a81548160ff021916908315150217905550565b600b602052805f5260405f205f915090505481565b5f60055f8473ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205f8373ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205f9054906101000a900460ff16905092915050565b61129461165c565b5f73ffffffffffffffffffffffffffffffffffffffff168173ffffffffffffffffffffffffffffffffffffffff1603611304575f6040517f1e4fbdf70000000000000000000000000000000000000000000000000000000081526004016112fb91906125d3565b60405180910390fd5b61130d816116f9565b50565b5f7f01ffc9a7000000000000000000000000000000000000000000000000000000007bffffffffffffffffffffffffffffffffffffffffffffffffffffffff1916827bffffffffffffffffffffffffffffffffffffffffffffffffffffffff1916149050919050565b5f8061138483611be5565b90505f73ffffffffffffffffffffffffffffffffffffffff168173ffffffffffffffffffffffffffffffffffffffff16036113f657826040517f7e2732890000000000000000000000000000000000000000000000000000000081526004016113ed91906126e4565b60405180910390fd5b80915050919050565b5f60045f8381526020019081526020015f205f9054906101000a900473ffffffffffffffffffffffffffffffffffffffff169050919050565b5f33905090565b61144c8383836001611c1e565b505050565b5f8061145c84611be5565b90505f73ffffffffffffffffffffffffffffffffffffffff168373ffffffffffffffffffffffffffffffffffffffff161461149d5761149c818486611ddd565b5b5f73ffffffffffffffffffffffffffffffffffffffff168173ffffffffffffffffffffffffffffffffffffffff1614611528576114dc5f855f80611c1e565b600160035f8373ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205f82825403925050819055505b5f73ffffffffffffffffffffffffffffffffffffffff168573ffffffffffffffffffffffffffffffffffffffff16146115a757600160035f8773ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205f82825401925050819055505b8460025f8681526020019081526020015f205f6101000a81548173ffffffffffffffffffffffffffffffffffffffff021916908373ffffffffffffffffffffffffffffffffffffffff160217905550838573ffffffffffffffffffffffffffffffffffffffff168273ffffffffffffffffffffffffffffffffffffffff167fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef60405160405180910390a4809150509392505050565b611664611438565b73ffffffffffffffffffffffffffffffffffffffff16611682610c2c565b73ffffffffffffffffffffffffffffffffffffffff16146116e1576116a5611438565b6040517f118cdaa70000000000000000000000000000000000000000000000000000000081526004016116d891906125d3565b60405180910390fd5b565b5f826116ef8584611ea0565b1490509392505050565b5f60065f9054906101000a900473ffffffffffffffffffffffffffffffffffffffff1690508160065f6101000a81548173ffffffffffffffffffffffffffffffffffffffff021916908373ffffffffffffffffffffffffffffffffffffffff1602179055508173ffffffffffffffffffffffffffffffffffffffff168173ffffffffffffffffffffffffffffffffffffffff167f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e060405160405180910390a35050565b5f73ffffffffffffffffffffffffffffffffffffffff168273ffffffffffffffffffffffffffffffffffffffff160361182c57816040517f5b08ba1800000000000000000000000000000000000000000000000000000000815260040161182391906125d3565b60405180910390fd5b8060055f8573ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205f8473ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205f6101000a81548160ff0219169083151502179055508173ffffffffffffffffffffffffffffffffffffffff168373ffffffffffffffffffffffffffffffffffffffff167f17307eab39ab6107e8899845ad3d59bd9653f200f220920489ca2b5937696c3183604051611918919061248d565b60405180910390a3505050565b61193e828260405180602001604052805f815250611eee565b5050565b5f8373ffffffffffffffffffffffffffffffffffffffff163b1115611ae7578273ffffffffffffffffffffffffffffffffffffffff1663150b7a02868685856040518563ffffffff1660e01b81526004016119a094939291906133be565b6020604051808303815f875af19250505080156119db57506040513d601f19601f820116820180604052508101906119d8919061341c565b60015b611a5c573d805f8114611a09576040519150601f19603f3d011682016040523d82523d5f602084013e611a0e565b606091505b505f815103611a5457836040517f64a0ae92000000000000000000000000000000000000000000000000000000008152600401611a4b91906125d3565b60405180910390fd5b805181602001fd5b63150b7a0260e01b7bffffffffffffffffffffffffffffffffffffffffffffffffffffffff1916817bffffffffffffffffffffffffffffffffffffffffffffffffffffffff191614611ae557836040517f64a0ae92000000000000000000000000000000000000000000000000000000008152600401611adc91906125d3565b60405180910390fd5b505b5050505050565b60605f6001611afc84611f11565b0190505f8167ffffffffffffffff811115611b1a57611b196128f2565b5b6040519080825280601f01601f191660200182016040528015611b4c5781602001600182028036833780820191505090505b5090505f82602001820190505b600115611bad578080600190039150507f3031323334353637383961626364656600000000000000000000000000000000600a86061a8153600a8581611ba257611ba1613447565b5b0494505f8503611b59575b819350505050919050565b6060611bde82604051806060016040528060408152602001613513604091396001612062565b9050919050565b5f60025f8381526020019081526020015f205f9054906101000a900473ffffffffffffffffffffffffffffffffffffffff169050919050565b8080611c5657505f73ffffffffffffffffffffffffffffffffffffffff168273ffffffffffffffffffffffffffffffffffffffff1614155b15611d88575f611c6584611379565b90505f73ffffffffffffffffffffffffffffffffffffffff168373ffffffffffffffffffffffffffffffffffffffff1614158015611ccf57508273ffffffffffffffffffffffffffffffffffffffff168173ffffffffffffffffffffffffffffffffffffffff1614155b8015611ce25750611ce081846111fe565b155b15611d2457826040517fa9fbf51f000000000000000000000000000000000000000000000000000000008152600401611d1b91906125d3565b60405180910390fd5b8115611d8657838573ffffffffffffffffffffffffffffffffffffffff168273ffffffffffffffffffffffffffffffffffffffff167f8c5be1e5ebec7d5bd14f71427d1e84f3dd0314c0f7b2291e5b200ac8c7c3b92560405160405180910390a45b505b8360045f8581526020019081526020015f205f6101000a81548173ffffffffffffffffffffffffffffffffffffffff021916908373ffffffffffffffffffffffffffffffffffffffff16021790555050505050565b611de88383836121f1565b611e9b575f73ffffffffffffffffffffffffffffffffffffffff168373ffffffffffffffffffffffffffffffffffffffff1603611e5c57806040517f7e273289000000000000000000000000000000000000000000000000000000008152600401611e5391906126e4565b60405180910390fd5b81816040517f177e802f000000000000000000000000000000000000000000000000000000008152600401611e92929190612cf5565b60405180910390fd5b505050565b5f808290505f5b8451811015611ee357611ed482868381518110611ec757611ec6613474565b5b60200260200101516122b1565b91508080600101915050611ea7565b508091505092915050565b611ef883836122db565b611f0c611f03611438565b5f858585611942565b505050565b5f805f90507a184f03e93ff9f4daa797ed6e38ed64bf6a1f0100000000000000008310611f6d577a184f03e93ff9f4daa797ed6e38ed64bf6a1f0100000000000000008381611f6357611f62613447565b5b0492506040810190505b6d04ee2d6d415b85acef81000000008310611faa576d04ee2d6d415b85acef81000000008381611fa057611f9f613447565b5b0492506020810190505b662386f26fc100008310611fd957662386f26fc100008381611fcf57611fce613447565b5b0492506010810190505b6305f5e1008310612002576305f5e1008381611ff857611ff7613447565b5b0492506008810190505b612710831061202757612710838161201d5761201c613447565b5b0492506004810190505b6064831061204a57606483816120405761203f613447565b5b0492506002810190505b600a8310612059576001810190505b80915050919050565b60605f8451036120825760405180602001604052805f81525090506121ea565b5f826120b357600360028651600461209a91906134a1565b6120a49190612cc2565b6120ae91906134e2565b6120da565b6003600286516120c39190612cc2565b6120cd91906134e2565b60046120d991906134a1565b5b90505f8167ffffffffffffffff8111156120f7576120f66128f2565b5b6040519080825280601f01601f1916602001820160405280156121295781602001600182028036833780820191505090505b509050600185016020820187885189016020810180515f82525b8284101561219e576003840193508351603f8160121c168701518653600186019550603f81600c1c168701518653600186019550603f8160061c168701518653600186019550603f8116870151865360018601955050612143565b80825289156121de5760038c5106600181146121c157600281146121d4576121dc565b603d6001870353603d60028703536121dc565b603d60018703535b505b50505050505080925050505b9392505050565b5f8073ffffffffffffffffffffffffffffffffffffffff168373ffffffffffffffffffffffffffffffffffffffff16141580156122a857508273ffffffffffffffffffffffffffffffffffffffff168473ffffffffffffffffffffffffffffffffffffffff161480612269575061226884846111fe565b5b806122a757508273ffffffffffffffffffffffffffffffffffffffff1661228f836113ff565b73ffffffffffffffffffffffffffffffffffffffff16145b5b90509392505050565b5f8183106122c8576122c382846123ce565b6122d3565b6122d283836123ce565b5b905092915050565b5f73ffffffffffffffffffffffffffffffffffffffff168273ffffffffffffffffffffffffffffffffffffffff160361234b575f6040517f64a0ae9200000000000000000000000000000000000000000000000000000000815260040161234291906125d3565b60405180910390fd5b5f61235783835f611451565b90505f73ffffffffffffffffffffffffffffffffffffffff168173ffffffffffffffffffffffffffffffffffffffff16146123c9575f6040517f73c6ac6e0000000000000000000000000000000000000000000000000000000081526004016123c091906125d3565b60405180910390fd5b505050565b5f825f528160205260405f20905092915050565b5f604051905090565b5f80fd5b5f80fd5b5f7fffffffff0000000000000000000000000000000000000000000000000000000082169050919050565b612427816123f3565b8114612431575f80fd5b50565b5f813590506124428161241e565b92915050565b5f6020828403121561245d5761245c6123eb565b5b5f61246a84828501612434565b91505092915050565b5f8115159050919050565b61248781612473565b82525050565b5f6020820190506124a05f83018461247e565b92915050565b5f81519050919050565b5f82825260208201905092915050565b8281835e5f83830152505050565b5f601f19601f8301169050919050565b5f6124e8826124a6565b6124f281856124b0565b93506125028185602086016124c0565b61250b816124ce565b840191505092915050565b5f6020820190508181035f83015261252e81846124de565b905092915050565b5f819050919050565b61254881612536565b8114612552575f80fd5b50565b5f813590506125638161253f565b92915050565b5f6020828403121561257e5761257d6123eb565b5b5f61258b84828501612555565b91505092915050565b5f73ffffffffffffffffffffffffffffffffffffffff82169050919050565b5f6125bd82612594565b9050919050565b6125cd816125b3565b82525050565b5f6020820190506125e65f8301846125c4565b92915050565b6125f5816125b3565b81146125ff575f80fd5b50565b5f81359050612610816125ec565b92915050565b5f806040838503121561262c5761262b6123eb565b5b5f61263985828601612602565b925050602061264a85828601612555565b9150509250929050565b5f805f6060848603121561266b5761266a6123eb565b5b5f61267886828701612602565b935050602061268986828701612602565b925050604061269a86828701612555565b9150509250925092565b5f819050919050565b6126b6816126a4565b82525050565b5f6020820190506126cf5f8301846126ad565b92915050565b6126de81612536565b82525050565b5f6020820190506126f75f8301846126d5565b92915050565b5f80fd5b5f80fd5b5f80fd5b5f8083601f84011261271e5761271d6126fd565b5b8235905067ffffffffffffffff81111561273b5761273a612701565b5b60208301915083602082028301111561275757612756612705565b5b9250929050565b5f805f60408486031215612775576127746123eb565b5b5f61278286828701612602565b935050602084013567ffffffffffffffff8111156127a3576127a26123ef565b5b6127af86828701612709565b92509250509250925092565b5f602082840312156127d0576127cf6123eb565b5b5f6127dd84828501612602565b91505092915050565b6127ef816126a4565b81146127f9575f80fd5b50565b5f8135905061280a816127e6565b92915050565b5f60208284031215612825576128246123eb565b5b5f612832848285016127fc565b91505092915050565b61284481612473565b811461284e575f80fd5b50565b5f8135905061285f8161283b565b92915050565b5f806040838503121561287b5761287a6123eb565b5b5f61288885828601612602565b925050602061289985828601612851565b9150509250929050565b5f80602083850312156128b9576128b86123eb565b5b5f83013567ffffffffffffffff8111156128d6576128d56123ef565b5b6128e285828601612709565b92509250509250929050565b5f80fd5b7f4e487b71000000000000000000000000000000000000000000000000000000005f52604160045260245ffd5b612928826124ce565b810181811067ffffffffffffffff82111715612947576129466128f2565b5b80604052505050565b5f6129596123e2565b9050612965828261291f565b919050565b5f67ffffffffffffffff821115612984576129836128f2565b5b61298d826124ce565b9050602081019050919050565b828183375f83830152505050565b5f6129ba6129b58461296a565b612950565b9050828152602081018484840111156129d6576129d56128ee565b5b6129e184828561299a565b509392505050565b5f82601f8301126129fd576129fc6126fd565b5b8135612a0d8482602086016129a8565b91505092915050565b5f805f8060808587031215612a2e57612a2d6123eb565b5b5f612a3b87828801612602565b9450506020612a4c87828801612602565b9350506040612a5d87828801612555565b925050606085013567ffffffffffffffff811115612a7e57612a7d6123ef565b5b612a8a878288016129e9565b91505092959194509250565b5f8060408385031215612aac57612aab6123eb565b5b5f612ab985828601612602565b9250506020612aca85828601612602565b9150509250929050565b7f4e487b71000000000000000000000000000000000000000000000000000000005f52602260045260245ffd5b5f6002820490506001821680612b1857607f821691505b602082108103612b2b57612b2a612ad4565b5b50919050565b5f606082019050612b445f8301866125c4565b612b5160208301856126d5565b612b5e60408301846125c4565b949350505050565b5f606082019050612b795f8301866125c4565b612b8660208301856125c4565b612b9360408301846126d5565b949350505050565b5f8160601b9050919050565b5f612bb182612b9b565b9050919050565b5f612bc282612ba7565b9050919050565b612bda612bd5826125b3565b612bb8565b82525050565b5f612beb8284612bc9565b60148201915081905092915050565b7f4e487b71000000000000000000000000000000000000000000000000000000005f52601160045260245ffd5b5f612c3182612536565b9150612c3c83612536565b9250828203905081811115612c5457612c53612bfa565b5b92915050565b7f4e6f206e657720746f6b656e7320746f20706c616365000000000000000000005f82015250565b5f612c8e6016836124b0565b9150612c9982612c5a565b602082019050919050565b5f6020820190508181035f830152612cbb81612c82565b9050919050565b5f612ccc82612536565b9150612cd783612536565b9250828201905080821115612cef57612cee612bfa565b5b92915050565b5f604082019050612d085f8301856125c4565b612d1560208301846126d5565b9392505050565b5f81519050612d2a8161283b565b92915050565b5f60208284031215612d4557612d446123eb565b5b5f612d5284828501612d1c565b91505092915050565b7f5472616e73666572206661696c656400000000000000000000000000000000005f82015250565b5f612d8f600f836124b0565b9150612d9a82612d5b565b602082019050919050565b5f6020820190508181035f830152612dbc81612d83565b9050919050565b7f4d696e74206e6f742061637469766500000000000000000000000000000000005f82015250565b5f612df7600f836124b0565b9150612e0282612dc3565b602082019050919050565b5f6020820190508181035f830152612e2481612deb565b9050919050565b7f4d617820737570706c79207265616368656400000000000000000000000000005f82015250565b5f612e5f6012836124b0565b9150612e6a82612e2b565b602082019050919050565b5f6020820190508181035f830152612e8c81612e53565b9050919050565b7f4d61782033206d696e747320706572206164647265737320616c6c6f776564005f82015250565b5f612ec7601f836124b0565b9150612ed282612e93565b602082019050919050565b5f6020820190508181035f830152612ef481612ebb565b9050919050565b7f41646472657373206e6f742077686974656c69737465640000000000000000005f82015250565b5f612f2f6017836124b0565b9150612f3a82612efb565b602082019050919050565b5f6020820190508181035f830152612f5c81612f23565b9050919050565b5f612f6d82612536565b91507fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff8203612f9f57612f9e612bfa565b5b600182019050919050565b7f546f6b656e20646f6573206e6f742065786973740000000000000000000000005f82015250565b5f612fde6014836124b0565b9150612fe982612faa565b602082019050919050565b5f6020820190508181035f83015261300b81612fd2565b9050919050565b5f67ffffffffffffffff82111561302c5761302b6128f2565b5b613035826124ce565b9050602081019050919050565b5f61305461304f84613012565b612950565b9050828152602081018484840111156130705761306f6128ee565b5b61307b8482856124c0565b509392505050565b5f82601f830112613097576130966126fd565b5b81516130a7848260208601613042565b91505092915050565b5f602082840312156130c5576130c46123eb565b5b5f82015167ffffffffffffffff8111156130e2576130e16123ef565b5b6130ee84828501613083565b91505092915050565b5f81905092915050565b7f7b226e616d65223a2022476f62202300000000000000000000000000000000005f82015250565b5f613135600f836130f7565b915061314082613101565b600f82019050919050565b5f613155826124a6565b61315f81856130f7565b935061316f8185602086016124c0565b80840191505092915050565b7f222c20226465736372697074696f6e223a20224f6e2d636861696e20476f62205f8201527f4e4654222c2022696d616765223a2022646174613a696d6167652f7376672b7860208201527f6d6c3b6261736536342c00000000000000000000000000000000000000000000604082015250565b5f6131fb604a836130f7565b91506132068261317b565b604a82019050919050565b7f222c202261747472696275746573223a200000000000000000000000000000005f82015250565b5f6132456011836130f7565b915061325082613211565b601182019050919050565b7f7d000000000000000000000000000000000000000000000000000000000000005f82015250565b5f61328f6001836130f7565b915061329a8261325b565b600182019050919050565b5f6132af82613129565b91506132bb828661314b565b91506132c6826131ef565b91506132d2828561314b565b91506132dd82613239565b91506132e9828461314b565b91506132f482613283565b9150819050949350505050565b7f646174613a6170706c69636174696f6e2f6a736f6e3b6261736536342c0000005f82015250565b5f613335601d836130f7565b915061334082613301565b601d82019050919050565b5f61335582613329565b9150613361828461314b565b915081905092915050565b5f81519050919050565b5f82825260208201905092915050565b5f6133908261336c565b61339a8185613376565b93506133aa8185602086016124c0565b6133b3816124ce565b840191505092915050565b5f6080820190506133d15f8301876125c4565b6133de60208301866125c4565b6133eb60408301856126d5565b81810360608301526133fd8184613386565b905095945050505050565b5f815190506134168161241e565b92915050565b5f60208284031215613431576134306123eb565b5b5f61343e84828501613408565b91505092915050565b7f4e487b71000000000000000000000000000000000000000000000000000000005f52601260045260245ffd5b7f4e487b71000000000000000000000000000000000000000000000000000000005f52603260045260245ffd5b5f6134ab82612536565b91506134b683612536565b92508282026134c481612536565b915082820484148315176134db576134da612bfa565b5b5092915050565b5f6134ec82612536565b91506134f783612536565b92508261350757613506613447565b5b82820490509291505056fe4142434445464748494a4b4c4d4e4f505152535455565758595a6162636465666768696a6b6c6d6e6f707172737475767778797a303132333435363738392b2fa2646970667358221220eaa4277fc588b14047871bd0f6879b583482a1e4b43499877ad6f68083bfe40764736f6c634300081a0033
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
146424:3696:0:-:0;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;98821:305;;;;;;;;;;;;;:::i;:::-;;:::i;:::-;;;;;;;:::i;:::-;;;;;;;;99652:91;;;:::i;:::-;;;;;;;:::i;:::-;;;;;;;;100824:158;;;;;;;;;;;;;:::i;:::-;;:::i;:::-;;;;;;;:::i;:::-;;;;;;;;100643:115;;;;;;;;;;;;;:::i;:::-;;:::i;:::-;;146560:25;;;:::i;:::-;;;;;;;:::i;:::-;;;;;;;;101493:588;;;;;;;;;;;;;:::i;:::-;;:::i;:::-;;146624:22;;;:::i;:::-;;;;;;;:::i;:::-;;;;;;;;146653:25;;;:::i;:::-;;;;;;;:::i;:::-;;;;;;;;146464:41;;;:::i;:::-;;;;;;;:::i;:::-;;;;;;;;102152:134;;;;;;;;;;;;;:::i;:::-;;:::i;:::-;;149849:268;;;;;;;;;;;;;:::i;:::-;;:::i;:::-;;147210:228;;;;;;;;;;;;;:::i;:::-;;:::i;:::-;;;;;;;:::i;:::-;;;;;;;;99465:120;;;;;;;;;;;;;:::i;:::-;;:::i;:::-;;;;;;;:::i;:::-;;;;;;;;148901:609;;;:::i;:::-;;99190:213;;;;;;;;;;;;;:::i;:::-;;:::i;:::-;;;;;;;:::i;:::-;;;;;;;;116474:103;;;:::i;:::-;;146771:47;;;;;;;;;;;;;:::i;:::-;;:::i;:::-;;;;;;;:::i;:::-;;;;;;;;146986:104;;;;;;;;;;;;;:::i;:::-;;:::i;:::-;;147098;;;;;;;;;;;;;:::i;:::-;;:::i;:::-;;115799:87;;;:::i;:::-;;;;;;;:::i;:::-;;;;;;;;99812:95;;;:::i;:::-;;;;;;;:::i;:::-;;;;;;;;149562:245;;;;;;;;;;;;;:::i;:::-;;:::i;:::-;;101054:146;;;;;;;;;;;;;:::i;:::-;;:::i;:::-;;147448:494;;;;;;;;;;;;;:::i;:::-;;:::i;:::-;;102357:236;;;;;;;;;;;;;:::i;:::-;;:::i;:::-;;148045:778;;;;;;;;;;;;;:::i;:::-;;:::i;:::-;;;;;;;:::i;:::-;;;;;;;;147950:87;;;:::i;:::-;;146715:49;;;;;;;;;;;;;:::i;:::-;;:::i;:::-;;;;;;;:::i;:::-;;;;;;;;101271:155;;;;;;;;;;;;;:::i;:::-;;:::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;146560: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;146624:22::-;;;;;;;;;;;;;:::o;146653:25::-;;;;:::o;146464:41::-;146501:4;146464:41;:::o;102152:134::-;102239:39;102256:4;102262:2;102266:7;102239:39;;;;;;;;;;;;:16;:39::i;:::-;102152:134;;;:::o;149849:268::-;115685:13;:11;:13::i;:::-;149935:11:::1;149957:10;149935:33;;150020:3;:20;;;150049:4;150056:10;150068:7;150020:56;;;;;;;;;;;;;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;::::0;::::1;;;;;;;;;;;;::::0;::::1;;;;;;;;;149924:193;149849:268:::0;;:::o;147210:228::-;147301:4;147318:12;147360:7;147343:25;;;;;;;;:::i;:::-;;;;;;;;;;;;;147333:36;;;;;;147318:51;;147387:43;147406:5;;147387:43;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;147413:10;;147425:4;147387:18;:43::i;:::-;147380:50;;;147210:228;;;;;:::o;99465:120::-;99528:7;99555:22;99569:7;99555:13;:22::i;:::-;99548:29;;99465:120;;;:::o;148901:609::-;148940:19;148962:21;148972:10;148962:9;:21::i;:::-;148940:43;;149048:17;149082:14;:26;149097:10;149082:26;;;;;;;;;;;;;;;;149068:11;:40;;;;:::i;:::-;149048:60;;149185:1;149173:9;:13;149165:48;;;;;;;;;;;;:::i;:::-;;;;;;;;;149322:11;149293:14;:26;149308:10;149293:26;;;;;;;;;;;;;;;:40;;;;149353:9;149344:5;;:18;;;;;;;:::i;:::-;;;;;;;;149453:3;149444:5;;:12;149440:63;;149478:13;;;;;;;;;;149440:63;148929:581;;148901:609::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;146771:47::-;;;;;;;;;;;;;;;;;:::o;146986:104::-;115685:13;:11;:13::i;:::-;147071:11:::1;147058:10;;:24;;;;;;;;;;;;;;;;;;146986:104:::0;:::o;147098:::-;115685:13;:11;:13::i;:::-;147183:11:::1;147170:10;:24;;;;147098: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;149562:245::-;115685:13;:11;:13::i;:::-;149651:12:::1;149673;149651:35;;149745:5;:14;;;149760:10;149772:6;149745:34;;;;;;;;;;;;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;::::0;::::1;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;149737:62;;;;;;;;;;;;:::i;:::-;;;;;;;;;149640:167;149562:245:::0;;:::o;101054:146::-;101140:52;101159:12;:10;:12::i;:::-;101173:8;101183;101140:18;:52::i;:::-;101054:146;;:::o;147448:494::-;147514:10;;;;;;;;;;;147506:38;;;;;;;;;;;;:::i;:::-;;;;;;;;;146501:4;147563:15;;:28;147555:59;;;;;;;;;;;;:::i;:::-;;;;;;;;;147660:1;147633:12;:24;147646:10;147633:24;;;;;;;;;;;;;;;;:28;147625:72;;;;;;;;;;;;:::i;:::-;;;;;;;;;147716:36;147734:10;147746:5;;147716:17;:36::i;:::-;147708:72;;;;;;;;;;;;:::i;:::-;;;;;;;;;147793:15;147811;;147793:33;;147837:15;;:17;;;;;;;;;:::i;:::-;;;;;;147865:12;:24;147878:10;147865:24;;;;;;;;;;;;;;;;:26;;;;;;;;;:::i;:::-;;;;;;147904:30;147914:10;147926:7;147904:9;:30::i;:::-;147495:447;147448:494;;:::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;148045:778::-;148110:13;148155:15;;148144:7;:26;;148136:59;;;;;;;;;;;;:::i;:::-;;;;;;;;;148208:17;148244:10;;;;;;;;;;;148228:37;;;148266:7;148228:46;;;;;;;;;;;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;148208:66;;148285:20;148324:10;;;;;;;;;;;148308:37;;;148346:7;148308:46;;;;;;;;;;;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;148285:69;;148367:17;148437:18;:7;:16;:18::i;:::-;148561:25;148581:3;148561:13;:25::i;:::-;148622:6;148387:257;;;;;;;;;;:::i;:::-;;;;;;;;;;;;;148367:277;;148770:19;148784:4;148770:13;:19::i;:::-;148685:119;;;;;;;;:::i;:::-;;;;;;;;;;;;;148657:158;;;;;148045:778;;;:::o;147950:87::-;115685:13;:11;:13::i;:::-;148019:10:::1;;;;;;;;;;;148018:11;148005:10;;:24;;;;;;;;;;;;;;;;;;147950:87::o:0;146715:49::-;;;;;;;;;;;;;;;;;:::o;101271:155::-;101359:4;101383:18;:25;101402:5;101383:25;;;;;;;;;;;;;;;:35;101409:8;101383:35;;;;;;;;;;;;;;;;;;;;;;;;;101376:42;;101271:155;;;;:::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;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;123250:156::-;123341:4;123394;123365:25;123378:5;123385:4;123365:12;:25::i;:::-;:33;123358:40;;123250:156;;;;;:::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;108175:102::-;108243:26;108253:2;108257:7;108243:26;;;;;;;;;;;;:9;:26::i;:::-;108175:102;;:::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;123817:314::-;123900:7;123920:20;123943:4;123920:27;;123963:9;123958:136;123982:5;:12;123978:1;:16;123958:136;;;124031:51;124059:12;124073:5;124079:1;124073:8;;;;;;;;:::i;:::-;;;;;;;;124031:27;:51::i;:::-;124016:66;;123996:3;;;;;;;123958:136;;;;124111:12;124104:19;;;123817:314;;;;:::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;120754:171::-;120829:7;120860:1;120856;:5;:61;;120892:25;120912:1;120915;120892:19;:25::i;:::-;120856:61;;;120864:25;120884:1;120887;120864:19;:25::i;:::-;120856:61;120849:68;;120754:171;;;;:::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;121050:245::-;121123:13;121202:1;121196:4;121189:15;121231:1;121225:4;121218:15;121272:4;121266;121256:21;121247:30;;121050:245;;;;:::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:77::-;5445:7;5474:5;5463:16;;5408:77;;;:::o;5491:118::-;5578:24;5596:5;5578:24;:::i;:::-;5573:3;5566:37;5491:118;;:::o;5615:222::-;5708:4;5746:2;5735:9;5731:18;5723:26;;5759:71;5827:1;5816:9;5812:17;5803:6;5759:71;:::i;:::-;5615:222;;;;:::o;5843:118::-;5930:24;5948:5;5930:24;:::i;:::-;5925:3;5918:37;5843:118;;:::o;5967:222::-;6060:4;6098:2;6087:9;6083:18;6075:26;;6111:71;6179:1;6168:9;6164:17;6155:6;6111:71;:::i;:::-;5967:222;;;;:::o;6195:117::-;6304:1;6301;6294:12;6318:117;6427:1;6424;6417:12;6441:117;6550:1;6547;6540:12;6581:568;6654:8;6664:6;6714:3;6707:4;6699:6;6695:17;6691:27;6681:122;;6722:79;;:::i;:::-;6681:122;6835:6;6822:20;6812:30;;6865:18;6857:6;6854:30;6851:117;;;6887:79;;:::i;:::-;6851:117;7001:4;6993:6;6989:17;6977:29;;7055:3;7047:4;7039:6;7035:17;7025:8;7021:32;7018:41;7015:128;;;7062:79;;:::i;:::-;7015:128;6581:568;;;;;:::o;7155:704::-;7250:6;7258;7266;7315:2;7303:9;7294:7;7290:23;7286:32;7283:119;;;7321:79;;:::i;:::-;7283:119;7441:1;7466:53;7511:7;7502:6;7491:9;7487:22;7466:53;:::i;:::-;7456:63;;7412:117;7596:2;7585:9;7581:18;7568:32;7627:18;7619:6;7616:30;7613:117;;;7649:79;;:::i;:::-;7613:117;7762:80;7834:7;7825:6;7814:9;7810:22;7762:80;:::i;:::-;7744:98;;;;7539:313;7155:704;;;;;:::o;7865:329::-;7924:6;7973:2;7961:9;7952:7;7948:23;7944:32;7941:119;;;7979:79;;:::i;:::-;7941:119;8099:1;8124:53;8169:7;8160:6;8149:9;8145:22;8124:53;:::i;:::-;8114:63;;8070:117;7865:329;;;;:::o;8200:122::-;8273:24;8291:5;8273:24;:::i;:::-;8266:5;8263:35;8253:63;;8312:1;8309;8302:12;8253:63;8200:122;:::o;8328:139::-;8374:5;8412:6;8399:20;8390:29;;8428:33;8455:5;8428:33;:::i;:::-;8328:139;;;;:::o;8473:329::-;8532:6;8581:2;8569:9;8560:7;8556:23;8552:32;8549:119;;;8587:79;;:::i;:::-;8549:119;8707:1;8732:53;8777:7;8768:6;8757:9;8753:22;8732:53;:::i;:::-;8722:63;;8678:117;8473:329;;;;:::o;8808:116::-;8878:21;8893:5;8878:21;:::i;:::-;8871:5;8868:32;8858:60;;8914:1;8911;8904:12;8858:60;8808:116;:::o;8930:133::-;8973:5;9011:6;8998:20;8989:29;;9027:30;9051:5;9027:30;:::i;:::-;8930:133;;;;:::o;9069:468::-;9134:6;9142;9191:2;9179:9;9170:7;9166:23;9162:32;9159:119;;;9197:79;;:::i;:::-;9159:119;9317:1;9342:53;9387:7;9378:6;9367:9;9363:22;9342:53;:::i;:::-;9332:63;;9288:117;9444:2;9470:50;9512:7;9503:6;9492:9;9488:22;9470:50;:::i;:::-;9460:60;;9415:115;9069:468;;;;;:::o;9543:559::-;9629:6;9637;9686:2;9674:9;9665:7;9661:23;9657:32;9654:119;;;9692:79;;:::i;:::-;9654:119;9840:1;9829:9;9825:17;9812:31;9870:18;9862:6;9859:30;9856:117;;;9892:79;;:::i;:::-;9856:117;10005:80;10077:7;10068:6;10057:9;10053:22;10005:80;:::i;:::-;9987:98;;;;9783:312;9543:559;;;;;:::o;10108:117::-;10217:1;10214;10207:12;10231:180;10279:77;10276:1;10269:88;10376:4;10373:1;10366:15;10400:4;10397:1;10390:15;10417:281;10500:27;10522:4;10500:27;:::i;:::-;10492:6;10488:40;10630:6;10618:10;10615:22;10594:18;10582:10;10579:34;10576:62;10573:88;;;10641:18;;:::i;:::-;10573:88;10681:10;10677:2;10670:22;10460:238;10417:281;;:::o;10704:129::-;10738:6;10765:20;;:::i;:::-;10755:30;;10794:33;10822:4;10814:6;10794:33;:::i;:::-;10704:129;;;:::o;10839:307::-;10900:4;10990:18;10982:6;10979:30;10976:56;;;11012:18;;:::i;:::-;10976:56;11050:29;11072:6;11050:29;:::i;:::-;11042:37;;11134:4;11128;11124:15;11116:23;;10839:307;;;:::o;11152:148::-;11250:6;11245:3;11240;11227:30;11291:1;11282:6;11277:3;11273:16;11266:27;11152:148;;;:::o;11306:423::-;11383:5;11408:65;11424:48;11465:6;11424:48;:::i;:::-;11408:65;:::i;:::-;11399:74;;11496:6;11489:5;11482:21;11534:4;11527:5;11523:16;11572:3;11563:6;11558:3;11554:16;11551:25;11548:112;;;11579:79;;:::i;:::-;11548:112;11669:54;11716:6;11711:3;11706;11669:54;:::i;:::-;11389:340;11306:423;;;;;:::o;11748:338::-;11803:5;11852:3;11845:4;11837:6;11833:17;11829:27;11819:122;;11860:79;;:::i;:::-;11819:122;11977:6;11964:20;12002:78;12076:3;12068:6;12061:4;12053:6;12049:17;12002:78;:::i;:::-;11993:87;;11809:277;11748:338;;;;:::o;12092:943::-;12187:6;12195;12203;12211;12260:3;12248:9;12239:7;12235:23;12231:33;12228:120;;;12267:79;;:::i;:::-;12228:120;12387:1;12412:53;12457:7;12448:6;12437:9;12433:22;12412:53;:::i;:::-;12402:63;;12358:117;12514:2;12540:53;12585:7;12576:6;12565:9;12561:22;12540:53;:::i;:::-;12530:63;;12485:118;12642:2;12668:53;12713:7;12704:6;12693:9;12689:22;12668:53;:::i;:::-;12658:63;;12613:118;12798:2;12787:9;12783:18;12770:32;12829:18;12821:6;12818:30;12815:117;;;12851:79;;:::i;:::-;12815:117;12956:62;13010:7;13001:6;12990:9;12986:22;12956:62;:::i;:::-;12946:72;;12741:287;12092:943;;;;;;;:::o;13041:474::-;13109:6;13117;13166:2;13154:9;13145:7;13141:23;13137:32;13134:119;;;13172:79;;:::i;:::-;13134:119;13292:1;13317:53;13362:7;13353:6;13342:9;13338:22;13317:53;:::i;:::-;13307:63;;13263:117;13419:2;13445:53;13490:7;13481:6;13470:9;13466:22;13445:53;:::i;:::-;13435:63;;13390:118;13041:474;;;;;:::o;13521:180::-;13569:77;13566:1;13559:88;13666:4;13663:1;13656:15;13690:4;13687:1;13680:15;13707:320;13751:6;13788:1;13782:4;13778:12;13768:22;;13835:1;13829:4;13825:12;13856:18;13846:81;;13912:4;13904:6;13900:17;13890:27;;13846:81;13974:2;13966:6;13963:14;13943:18;13940:38;13937:84;;13993:18;;:::i;:::-;13937:84;13758:269;13707:320;;;:::o;14033:442::-;14182:4;14220:2;14209:9;14205:18;14197:26;;14233:71;14301:1;14290:9;14286:17;14277:6;14233:71;:::i;:::-;14314:72;14382:2;14371:9;14367:18;14358:6;14314:72;:::i;:::-;14396;14464:2;14453:9;14449:18;14440:6;14396:72;:::i;:::-;14033:442;;;;;;:::o;14481:::-;14630:4;14668:2;14657:9;14653:18;14645:26;;14681:71;14749:1;14738:9;14734:17;14725:6;14681:71;:::i;:::-;14762:72;14830:2;14819:9;14815:18;14806:6;14762:72;:::i;:::-;14844;14912:2;14901:9;14897:18;14888:6;14844:72;:::i;:::-;14481:442;;;;;;:::o;14929:94::-;14962:8;15010:5;15006:2;15002:14;14981:35;;14929:94;;;:::o;15029:::-;15068:7;15097:20;15111:5;15097:20;:::i;:::-;15086:31;;15029:94;;;:::o;15129:100::-;15168:7;15197:26;15217:5;15197:26;:::i;:::-;15186:37;;15129:100;;;:::o;15235:157::-;15340:45;15360:24;15378:5;15360:24;:::i;:::-;15340:45;:::i;:::-;15335:3;15328:58;15235:157;;:::o;15398:256::-;15510:3;15525:75;15596:3;15587:6;15525:75;:::i;:::-;15625:2;15620:3;15616:12;15609:19;;15645:3;15638:10;;15398:256;;;;:::o;15660:180::-;15708:77;15705:1;15698:88;15805:4;15802:1;15795:15;15829:4;15826:1;15819:15;15846:194;15886:4;15906:20;15924:1;15906:20;:::i;:::-;15901:25;;15940:20;15958:1;15940:20;:::i;:::-;15935:25;;15984:1;15981;15977:9;15969:17;;16008:1;16002:4;15999:11;15996:37;;;16013:18;;:::i;:::-;15996:37;15846:194;;;;:::o;16046:172::-;16186:24;16182:1;16174:6;16170:14;16163:48;16046:172;:::o;16224:366::-;16366:3;16387:67;16451:2;16446:3;16387:67;:::i;:::-;16380:74;;16463:93;16552:3;16463:93;:::i;:::-;16581:2;16576:3;16572:12;16565:19;;16224:366;;;:::o;16596:419::-;16762:4;16800:2;16789:9;16785:18;16777:26;;16849:9;16843:4;16839:20;16835:1;16824:9;16820:17;16813:47;16877:131;17003:4;16877:131;:::i;:::-;16869:139;;16596:419;;;:::o;17021:191::-;17061:3;17080:20;17098:1;17080:20;:::i;:::-;17075:25;;17114:20;17132:1;17114:20;:::i;:::-;17109:25;;17157:1;17154;17150:9;17143:16;;17178:3;17175:1;17172:10;17169:36;;;17185:18;;:::i;:::-;17169:36;17021:191;;;;:::o;17218:332::-;17339:4;17377:2;17366:9;17362:18;17354:26;;17390:71;17458:1;17447:9;17443:17;17434:6;17390:71;:::i;:::-;17471:72;17539:2;17528:9;17524:18;17515:6;17471:72;:::i;:::-;17218:332;;;;;:::o;17556:137::-;17610:5;17641:6;17635:13;17626:22;;17657:30;17681:5;17657:30;:::i;:::-;17556:137;;;;:::o;17699:345::-;17766:6;17815:2;17803:9;17794:7;17790:23;17786:32;17783:119;;;17821:79;;:::i;:::-;17783:119;17941:1;17966:61;18019:7;18010:6;17999:9;17995:22;17966:61;:::i;:::-;17956:71;;17912:125;17699:345;;;;:::o;18050:165::-;18190:17;18186:1;18178:6;18174:14;18167:41;18050:165;:::o;18221:366::-;18363:3;18384:67;18448:2;18443:3;18384:67;:::i;:::-;18377:74;;18460:93;18549:3;18460:93;:::i;:::-;18578:2;18573:3;18569:12;18562:19;;18221:366;;;:::o;18593:419::-;18759:4;18797:2;18786:9;18782:18;18774:26;;18846:9;18840:4;18836:20;18832:1;18821:9;18817:17;18810:47;18874:131;19000:4;18874:131;:::i;:::-;18866:139;;18593:419;;;:::o;19018:165::-;19158:17;19154:1;19146:6;19142:14;19135:41;19018:165;:::o;19189:366::-;19331:3;19352:67;19416:2;19411:3;19352:67;:::i;:::-;19345:74;;19428:93;19517:3;19428:93;:::i;:::-;19546:2;19541:3;19537:12;19530:19;;19189:366;;;:::o;19561:419::-;19727:4;19765:2;19754:9;19750:18;19742:26;;19814:9;19808:4;19804:20;19800:1;19789:9;19785:17;19778:47;19842:131;19968:4;19842:131;:::i;:::-;19834:139;;19561:419;;;:::o;19986:168::-;20126:20;20122:1;20114:6;20110:14;20103:44;19986:168;:::o;20160:366::-;20302:3;20323:67;20387:2;20382:3;20323:67;:::i;:::-;20316:74;;20399:93;20488:3;20399:93;:::i;:::-;20517:2;20512:3;20508:12;20501:19;;20160:366;;;:::o;20532:419::-;20698:4;20736:2;20725:9;20721:18;20713:26;;20785:9;20779:4;20775:20;20771:1;20760:9;20756:17;20749:47;20813:131;20939:4;20813:131;:::i;:::-;20805:139;;20532:419;;;:::o;20957:181::-;21097:33;21093:1;21085:6;21081:14;21074:57;20957:181;:::o;21144:366::-;21286:3;21307:67;21371:2;21366:3;21307:67;:::i;:::-;21300:74;;21383:93;21472:3;21383:93;:::i;:::-;21501:2;21496:3;21492:12;21485:19;;21144:366;;;:::o;21516:419::-;21682:4;21720:2;21709:9;21705:18;21697:26;;21769:9;21763:4;21759:20;21755:1;21744:9;21740:17;21733:47;21797:131;21923:4;21797:131;:::i;:::-;21789:139;;21516:419;;;:::o;21941:173::-;22081:25;22077:1;22069:6;22065:14;22058:49;21941:173;:::o;22120:366::-;22262:3;22283:67;22347:2;22342:3;22283:67;:::i;:::-;22276:74;;22359:93;22448:3;22359:93;:::i;:::-;22477:2;22472:3;22468:12;22461:19;;22120:366;;;:::o;22492:419::-;22658:4;22696:2;22685:9;22681:18;22673:26;;22745:9;22739:4;22735:20;22731:1;22720:9;22716:17;22709:47;22773:131;22899:4;22773:131;:::i;:::-;22765:139;;22492:419;;;:::o;22917:233::-;22956:3;22979:24;22997:5;22979:24;:::i;:::-;22970:33;;23025:66;23018:5;23015:77;23012:103;;23095:18;;:::i;:::-;23012:103;23142:1;23135:5;23131:13;23124:20;;22917:233;;;:::o;23156:170::-;23296:22;23292:1;23284:6;23280:14;23273:46;23156:170;:::o;23332:366::-;23474:3;23495:67;23559:2;23554:3;23495:67;:::i;:::-;23488:74;;23571:93;23660:3;23571:93;:::i;:::-;23689:2;23684:3;23680:12;23673:19;;23332:366;;;:::o;23704:419::-;23870:4;23908:2;23897:9;23893:18;23885:26;;23957:9;23951:4;23947:20;23943:1;23932:9;23928:17;23921:47;23985:131;24111:4;23985:131;:::i;:::-;23977:139;;23704:419;;;:::o;24129:308::-;24191:4;24281:18;24273:6;24270:30;24267:56;;;24303:18;;:::i;:::-;24267:56;24341:29;24363:6;24341:29;:::i;:::-;24333:37;;24425:4;24419;24415:15;24407:23;;24129:308;;;:::o;24443:434::-;24532:5;24557:66;24573:49;24615:6;24573:49;:::i;:::-;24557:66;:::i;:::-;24548:75;;24646:6;24639:5;24632:21;24684:4;24677:5;24673:16;24722:3;24713:6;24708:3;24704:16;24701:25;24698:112;;;24729:79;;:::i;:::-;24698:112;24819:52;24864:6;24859:3;24854;24819:52;:::i;:::-;24538:339;24443:434;;;;;:::o;24897:355::-;24964:5;25013:3;25006:4;24998:6;24994:17;24990:27;24980:122;;25021:79;;:::i;:::-;24980:122;25131:6;25125:13;25156:90;25242:3;25234:6;25227:4;25219:6;25215:17;25156:90;:::i;:::-;25147:99;;24970:282;24897:355;;;;:::o;25258:524::-;25338:6;25387:2;25375:9;25366:7;25362:23;25358:32;25355:119;;;25393:79;;:::i;:::-;25355:119;25534:1;25523:9;25519:17;25513:24;25564:18;25556:6;25553:30;25550:117;;;25586:79;;:::i;:::-;25550:117;25691:74;25757:7;25748:6;25737:9;25733:22;25691:74;:::i;:::-;25681:84;;25484:291;25258:524;;;;:::o;25788:148::-;25890:11;25927:3;25912:18;;25788:148;;;;:::o;25942:214::-;26082:66;26078:1;26070:6;26066:14;26059:90;25942:214;:::o;26162:402::-;26322:3;26343:85;26425:2;26420:3;26343:85;:::i;:::-;26336:92;;26437:93;26526:3;26437:93;:::i;:::-;26555:2;26550:3;26546:12;26539:19;;26162:402;;;:::o;26570:390::-;26676:3;26704:39;26737:5;26704:39;:::i;:::-;26759:89;26841:6;26836:3;26759:89;:::i;:::-;26752:96;;26857:65;26915:6;26910:3;26903:4;26896:5;26892:16;26857:65;:::i;:::-;26947:6;26942:3;26938:16;26931:23;;26680:280;26570:390;;;;:::o;26966:362::-;27106:66;27102:1;27094:6;27090:14;27083:90;27207:66;27202:2;27194:6;27190:15;27183:91;27308:12;27303:2;27295:6;27291:15;27284:37;26966:362;:::o;27334:402::-;27494:3;27515:85;27597:2;27592:3;27515:85;:::i;:::-;27508:92;;27609:93;27698:3;27609:93;:::i;:::-;27727:2;27722:3;27718:12;27711:19;;27334:402;;;:::o;27742:214::-;27882:66;27878:1;27870:6;27866:14;27859:90;27742:214;:::o;27962:402::-;28122:3;28143:85;28225:2;28220:3;28143:85;:::i;:::-;28136:92;;28237:93;28326:3;28237:93;:::i;:::-;28355:2;28350:3;28346:12;28339:19;;27962:402;;;:::o;28370:143::-;28506:3;28502:1;28494:6;28490:14;28483:27;28370:143;:::o;28515:384::-;28675:3;28692:84;28774:1;28769:3;28692:84;:::i;:::-;28685:91;;28781:93;28870:3;28781:93;:::i;:::-;28895:1;28890:3;28886:11;28879:18;;28515:384;;;:::o;28901:1623::-;29533:3;29551:148;29695:3;29551:148;:::i;:::-;29544:155;;29712:95;29803:3;29794:6;29712:95;:::i;:::-;29705:102;;29820:148;29964:3;29820:148;:::i;:::-;29813:155;;29981:95;30072:3;30063:6;29981:95;:::i;:::-;29974:102;;30089:148;30233:3;30089:148;:::i;:::-;30082:155;;30250:95;30341:3;30332:6;30250:95;:::i;:::-;30243:102;;30358:148;30502:3;30358:148;:::i;:::-;30351:155;;30519:3;30512:10;;28901:1623;;;;;;:::o;30526:171::-;30662:31;30658:1;30650:6;30646:14;30639:55;30526:171;:::o;30699:386::-;30859:3;30876:85;30958:2;30953:3;30876:85;:::i;:::-;30869:92;;30966:93;31055:3;30966:93;:::i;:::-;31080:2;31075:3;31071:12;31064:19;;30699:386;;;:::o;31087:525::-;31320:3;31338:148;31482:3;31338:148;:::i;:::-;31331:155;;31499:95;31590:3;31581:6;31499:95;:::i;:::-;31492:102;;31607:3;31600:10;;31087:525;;;;:::o;31614:90::-;31665:6;31695:5;31689:12;31679:22;;31614:90;;;:::o;31706:156::-;31789:11;31819:6;31814:3;31807:19;31855:4;31850:3;31846:14;31831:29;;31706:156;;;;:::o;31864:353::-;31950:3;31974:38;32006:5;31974:38;:::i;:::-;32024:70;32087:6;32082:3;32024:70;:::i;:::-;32017:77;;32099:65;32157:6;32152:3;32145:4;32138:5;32134:16;32099:65;:::i;:::-;32185:29;32207:6;32185:29;:::i;:::-;32180:3;32176:39;32169:46;;31954:263;31864:353;;;;:::o;32219:612::-;32414:4;32448:3;32437:9;32433:19;32425:27;;32458:71;32526:1;32515:9;32511:17;32502:6;32458:71;:::i;:::-;32535:72;32603:2;32592:9;32588:18;32579:6;32535:72;:::i;:::-;32613;32681:2;32670:9;32666:18;32657:6;32613:72;:::i;:::-;32728:9;32722:4;32718:20;32713:2;32702:9;32698:18;32691:48;32752:76;32823:4;32814:6;32752:76;:::i;:::-;32744:84;;32219:612;;;;;;;:::o;32833:129::-;32889:5;32916:6;32910:13;32901:22;;32928:32;32954:5;32928:32;:::i;:::-;32833:129;;;;:::o;32964:325::-;33033:6;33078:2;33066:9;33057:7;33053:23;33049:32;33046:119;;;33084:79;;:::i;:::-;33046:119;33196:1;33217:63;33272:7;33263:6;33252:9;33248:22;33217:63;:::i;:::-;33207:73;;33171:115;32964:325;;;;:::o;33291:164::-;33335:77;33332:1;33325:88;33428:4;33425:1;33418:15;33448:4;33445:1;33438:15;33457:164;33501:77;33498:1;33491:88;33594:4;33591:1;33584:15;33614:4;33611:1;33604:15;33623:362;33663:7;33682:20;33700:1;33682:20;:::i;:::-;33677:25;;33712:20;33730:1;33712:20;:::i;:::-;33707:25;;33763:1;33760;33756:9;33781:30;33799:11;33781:30;:::i;:::-;33770:41;;33940:1;33931:7;33927:15;33924:1;33921:22;33905:1;33898:9;33882:71;33863:119;;33962:18;;:::i;:::-;33863:119;33671:314;33623:362;;;;:::o;33987:165::-;34027:1;34040:20;34058:1;34040:20;:::i;:::-;34035:25;;34070:20;34088:1;34070:20;:::i;:::-;34065:25;;34105:1;34095:35;;34110:18;;:::i;:::-;34095:35;34148:1;34145;34141:9;34136:14;;33987:165;;;;:::o
Swarm Source
ipfs://eaa4277fc588b14047871bd0f6879b583482a1e4b43499877ad6f68083bfe407
Loading...
Loading
Loading...
Loading
Multichain Portfolio | 30 Chains
| Chain | Token | Portfolio % | Price | Amount | Value |
|---|
[ Download: CSV Export ]
[ Download: CSV Export ]
A contract address hosts a smart contract, which is a set of code stored on the blockchain that runs when predetermined conditions are met. Learn more about addresses in our Knowledge Base.