Token
StakedSuccinct (stPROVE)
ERC-20
Overview
Max Total Supply
813,029.681687370934629076 stPROVE
Holders
18,367
Market
Onchain Market Cap
-
Circulating Supply Market Cap
-
Other Info
Token Contract (WITH 18 Decimals)
Balance
58.645798208139056994 stPROVELoading...
Loading
Loading...
Loading
Loading...
Loading
| # | Exchange | Pair | Price | 24H Volume | % Volume |
|---|
Contract Source Code Verified (Exact Match)
Contract Name:
SuccinctStaking
Compiler Version
v0.8.28+commit.7893614a
Contract Source Code (Solidity)
/**
*Submitted for verification at Etherscan.io on 2025-07-02
*/
// SPDX-License-Identifier: MIT
pragma solidity ^0.8.20 ^0.8.28;
// lib/openzeppelin-contracts/contracts/utils/Context.sol
// OpenZeppelin Contracts (last updated v5.0.1) (utils/Context.sol)
/**
* @dev Provides information about the current execution context, including the
* sender of the transaction and its data. While these are generally available
* via msg.sender and msg.data, they should not be accessed in such a direct
* manner, since when dealing with meta-transactions the account sending and
* paying for execution may not be the actual sender (as far as an application
* is concerned).
*
* This contract is only required for intermediate, library-like contracts.
*/
abstract contract Context {
function _msgSender() internal view virtual returns (address) {
return msg.sender;
}
function _msgData() internal view virtual returns (bytes calldata) {
return msg.data;
}
function _contextSuffixLength() internal view virtual returns (uint256) {
return 0;
}
}
// lib/openzeppelin-contracts/contracts/utils/cryptography/ECDSA.sol
// OpenZeppelin Contracts (last updated v5.1.0) (utils/cryptography/ECDSA.sol)
/**
* @dev Elliptic Curve Digital Signature Algorithm (ECDSA) operations.
*
* These functions can be used to verify that a message was signed by the holder
* of the private keys of a given address.
*/
library ECDSA {
enum RecoverError {
NoError,
InvalidSignature,
InvalidSignatureLength,
InvalidSignatureS
}
/**
* @dev The signature derives the `address(0)`.
*/
error ECDSAInvalidSignature();
/**
* @dev The signature has an invalid length.
*/
error ECDSAInvalidSignatureLength(uint256 length);
/**
* @dev The signature has an S value that is in the upper half order.
*/
error ECDSAInvalidSignatureS(bytes32 s);
/**
* @dev Returns the address that signed a hashed message (`hash`) with `signature` or an error. This will not
* return address(0) without also returning an error description. Errors are documented using an enum (error type)
* and a bytes32 providing additional information about the error.
*
* If no error is returned, then the address can be used for verification purposes.
*
* The `ecrecover` EVM precompile allows for malleable (non-unique) signatures:
* this function rejects them by requiring the `s` value to be in the lower
* half order, and the `v` value to be either 27 or 28.
*
* IMPORTANT: `hash` _must_ be the result of a hash operation for the
* verification to be secure: it is possible to craft signatures that
* recover to arbitrary addresses for non-hashed data. A safe way to ensure
* this is by receiving a hash of the original message (which may otherwise
* be too long), and then calling {MessageHashUtils-toEthSignedMessageHash} on it.
*
* Documentation for signature generation:
* - with https://web3js.readthedocs.io/en/v1.3.4/web3-eth-accounts.html#sign[Web3.js]
* - with https://docs.ethers.io/v5/api/signer/#Signer-signMessage[ethers]
*/
function tryRecover(
bytes32 hash,
bytes memory signature
) internal pure returns (address recovered, RecoverError err, bytes32 errArg) {
if (signature.length == 65) {
bytes32 r;
bytes32 s;
uint8 v;
// ecrecover takes the signature parameters, and the only way to get them
// currently is to use assembly.
assembly ("memory-safe") {
r := mload(add(signature, 0x20))
s := mload(add(signature, 0x40))
v := byte(0, mload(add(signature, 0x60)))
}
return tryRecover(hash, v, r, s);
} else {
return (address(0), RecoverError.InvalidSignatureLength, bytes32(signature.length));
}
}
/**
* @dev Returns the address that signed a hashed message (`hash`) with
* `signature`. This address can then be used for verification purposes.
*
* The `ecrecover` EVM precompile allows for malleable (non-unique) signatures:
* this function rejects them by requiring the `s` value to be in the lower
* half order, and the `v` value to be either 27 or 28.
*
* IMPORTANT: `hash` _must_ be the result of a hash operation for the
* verification to be secure: it is possible to craft signatures that
* recover to arbitrary addresses for non-hashed data. A safe way to ensure
* this is by receiving a hash of the original message (which may otherwise
* be too long), and then calling {MessageHashUtils-toEthSignedMessageHash} on it.
*/
function recover(bytes32 hash, bytes memory signature) internal pure returns (address) {
(address recovered, RecoverError error, bytes32 errorArg) = tryRecover(hash, signature);
_throwError(error, errorArg);
return recovered;
}
/**
* @dev Overload of {ECDSA-tryRecover} that receives the `r` and `vs` short-signature fields separately.
*
* See https://eips.ethereum.org/EIPS/eip-2098[ERC-2098 short signatures]
*/
function tryRecover(
bytes32 hash,
bytes32 r,
bytes32 vs
) internal pure returns (address recovered, RecoverError err, bytes32 errArg) {
unchecked {
bytes32 s = vs & bytes32(0x7fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff);
// We do not check for an overflow here since the shift operation results in 0 or 1.
uint8 v = uint8((uint256(vs) >> 255) + 27);
return tryRecover(hash, v, r, s);
}
}
/**
* @dev Overload of {ECDSA-recover} that receives the `r and `vs` short-signature fields separately.
*/
function recover(bytes32 hash, bytes32 r, bytes32 vs) internal pure returns (address) {
(address recovered, RecoverError error, bytes32 errorArg) = tryRecover(hash, r, vs);
_throwError(error, errorArg);
return recovered;
}
/**
* @dev Overload of {ECDSA-tryRecover} that receives the `v`,
* `r` and `s` signature fields separately.
*/
function tryRecover(
bytes32 hash,
uint8 v,
bytes32 r,
bytes32 s
) internal pure returns (address recovered, RecoverError err, bytes32 errArg) {
// EIP-2 still allows signature malleability for ecrecover(). Remove this possibility and make the signature
// unique. Appendix F in the Ethereum Yellow paper (https://ethereum.github.io/yellowpaper/paper.pdf), defines
// the valid range for s in (301): 0 < s < secp256k1n ÷ 2 + 1, and for v in (302): v ∈ {27, 28}. Most
// signatures from current libraries generate a unique signature with an s-value in the lower half order.
//
// If your library generates malleable signatures, such as s-values in the upper range, calculate a new s-value
// with 0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEBAAEDCE6AF48A03BBFD25E8CD0364141 - s1 and flip v from 27 to 28 or
// vice versa. If your library also generates signatures with 0/1 for v instead 27/28, add 27 to v to accept
// these malleable signatures as well.
if (uint256(s) > 0x7FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF5D576E7357A4501DDFE92F46681B20A0) {
return (address(0), RecoverError.InvalidSignatureS, s);
}
// If the signature is valid (and not malleable), return the signer address
address signer = ecrecover(hash, v, r, s);
if (signer == address(0)) {
return (address(0), RecoverError.InvalidSignature, bytes32(0));
}
return (signer, RecoverError.NoError, bytes32(0));
}
/**
* @dev Overload of {ECDSA-recover} that receives the `v`,
* `r` and `s` signature fields separately.
*/
function recover(bytes32 hash, uint8 v, bytes32 r, bytes32 s) internal pure returns (address) {
(address recovered, RecoverError error, bytes32 errorArg) = tryRecover(hash, v, r, s);
_throwError(error, errorArg);
return recovered;
}
/**
* @dev Optionally reverts with the corresponding custom error according to the `error` argument provided.
*/
function _throwError(RecoverError error, bytes32 errorArg) private pure {
if (error == RecoverError.NoError) {
return; // no error: do nothing
} else if (error == RecoverError.InvalidSignature) {
revert ECDSAInvalidSignature();
} else if (error == RecoverError.InvalidSignatureLength) {
revert ECDSAInvalidSignatureLength(uint256(errorArg));
} else if (error == RecoverError.InvalidSignatureS) {
revert ECDSAInvalidSignatureS(errorArg);
}
}
}
// lib/openzeppelin-contracts/contracts/utils/Errors.sol
// OpenZeppelin Contracts (last updated v5.1.0) (utils/Errors.sol)
/**
* @dev Collection of common custom errors used in multiple contracts
*
* IMPORTANT: Backwards compatibility is not guaranteed in future versions of the library.
* It is recommended to avoid relying on the error API for critical functionality.
*
* _Available since v5.1._
*/
library Errors {
/**
* @dev The ETH balance of the account is not enough to perform the operation.
*/
error InsufficientBalance(uint256 balance, uint256 needed);
/**
* @dev A call to an address target failed. The target may have reverted.
*/
error FailedCall();
/**
* @dev The deployment failed.
*/
error FailedDeployment();
/**
* @dev A necessary precompile is missing.
*/
error MissingPrecompile(address);
}
// lib/openzeppelin-contracts/contracts/utils/introspection/IERC165.sol
// OpenZeppelin Contracts (last updated v5.1.0) (utils/introspection/IERC165.sol)
/**
* @dev Interface of the ERC-165 standard, as defined in the
* https://eips.ethereum.org/EIPS/eip-165[ERC].
*
* Implementers can declare support of contract interfaces, which can then be
* queried by others ({ERC165Checker}).
*
* For an implementation, see {ERC165}.
*/
interface IERC165 {
/**
* @dev Returns true if this contract implements the interface defined by
* `interfaceId`. See the corresponding
* https://eips.ethereum.org/EIPS/eip-165#how-interfaces-are-identified[ERC section]
* to learn more about how these ids are created.
*
* This function call must use less than 30 000 gas.
*/
function supportsInterface(bytes4 interfaceId) external view returns (bool);
}
// lib/openzeppelin-contracts/contracts/token/ERC20/IERC20.sol
// OpenZeppelin Contracts (last updated v5.1.0) (token/ERC20/IERC20.sol)
/**
* @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);
}
// lib/openzeppelin-contracts/contracts/token/ERC20/extensions/IERC20Permit.sol
// OpenZeppelin Contracts (last updated v5.1.0) (token/ERC20/extensions/IERC20Permit.sol)
/**
* @dev Interface of the ERC-20 Permit extension allowing approvals to be made via signatures, as defined in
* https://eips.ethereum.org/EIPS/eip-2612[ERC-2612].
*
* Adds the {permit} method, which can be used to change an account's ERC-20 allowance (see {IERC20-allowance}) by
* presenting a message signed by the account. By not relying on {IERC20-approve}, the token holder account doesn't
* need to send a transaction, and thus is not required to hold Ether at all.
*
* ==== Security Considerations
*
* There are two important considerations concerning the use of `permit`. The first is that a valid permit signature
* expresses an allowance, and it should not be assumed to convey additional meaning. In particular, it should not be
* considered as an intention to spend the allowance in any specific way. The second is that because permits have
* built-in replay protection and can be submitted by anyone, they can be frontrun. A protocol that uses permits should
* take this into consideration and allow a `permit` call to fail. Combining these two aspects, a pattern that may be
* generally recommended is:
*
* ```solidity
* function doThingWithPermit(..., uint256 value, uint256 deadline, uint8 v, bytes32 r, bytes32 s) public {
* try token.permit(msg.sender, address(this), value, deadline, v, r, s) {} catch {}
* doThing(..., value);
* }
*
* function doThing(..., uint256 value) public {
* token.safeTransferFrom(msg.sender, address(this), value);
* ...
* }
* ```
*
* Observe that: 1) `msg.sender` is used as the owner, leaving no ambiguity as to the signer intent, and 2) the use of
* `try/catch` allows the permit to fail and makes the code tolerant to frontrunning. (See also
* {SafeERC20-safeTransferFrom}).
*
* Additionally, note that smart contract wallets (such as Argent or Safe) are not able to produce permit signatures, so
* contracts should have entry points that don't rely on permit.
*/
interface IERC20Permit {
/**
* @dev Sets `value` as the allowance of `spender` over ``owner``'s tokens,
* given ``owner``'s signed approval.
*
* IMPORTANT: The same issues {IERC20-approve} has related to transaction
* ordering also apply here.
*
* Emits an {Approval} event.
*
* Requirements:
*
* - `spender` cannot be the zero address.
* - `deadline` must be a timestamp in the future.
* - `v`, `r` and `s` must be a valid `secp256k1` signature from `owner`
* over the EIP712-formatted function arguments.
* - the signature must use ``owner``'s current nonce (see {nonces}).
*
* For more information on the signature format, see the
* https://eips.ethereum.org/EIPS/eip-2612#specification[relevant EIP
* section].
*
* CAUTION: See Security Considerations above.
*/
function permit(
address owner,
address spender,
uint256 value,
uint256 deadline,
uint8 v,
bytes32 r,
bytes32 s
) external;
/**
* @dev Returns the current nonce for `owner`. This value must be
* included whenever a signature is generated for {permit}.
*
* Every successful call to {permit} increases ``owner``'s nonce by one. This
* prevents a signature from being used multiple times.
*/
function nonces(address owner) external view returns (uint256);
/**
* @dev Returns the domain separator used in the encoding of the signature for {permit}, as defined by {EIP712}.
*/
// solhint-disable-next-line func-name-mixedcase
function DOMAIN_SEPARATOR() external view returns (bytes32);
}
// lib/openzeppelin-contracts/contracts/interfaces/IERC5267.sol
// OpenZeppelin Contracts (last updated v5.0.0) (interfaces/IERC5267.sol)
interface IERC5267 {
/**
* @dev MAY be emitted to signal that the domain could have changed.
*/
event EIP712DomainChanged();
/**
* @dev returns the fields and values that describe the domain separator used by this contract for EIP-712
* signature.
*/
function eip712Domain()
external
view
returns (
bytes1 fields,
string memory name,
string memory version,
uint256 chainId,
address verifyingContract,
bytes32 salt,
uint256[] memory extensions
);
}
// lib/openzeppelin-contracts/contracts/interfaces/IERC6372.sol
// OpenZeppelin Contracts (last updated v5.0.0) (interfaces/IERC6372.sol)
interface IERC6372 {
/**
* @dev Clock used for flagging checkpoints. Can be overridden to implement timestamp based checkpoints (and voting).
*/
function clock() external view returns (uint48);
/**
* @dev Description of the clock
*/
// solhint-disable-next-line func-name-mixedcase
function CLOCK_MODE() external view returns (string memory);
}
// src/interfaces/IIntermediateSuccinct.sol
interface IIntermediateSuccinct {
/// @dev Thrown when a transfer is attempted.
error NonTransferable();
/// @notice Returns the address of the staking contract.
function staking() external view returns (address);
/// @notice Burn $iPROVE. Only callable by the staking contract.
/// @param from The address of the staker.
/// @param iPROVE The amount of $iPROVE to burn.
/// @return The amount of $PROVE burned.
function burn(address from, uint256 iPROVE) external returns (uint256);
}
// src/interfaces/IProver.sol
interface IProver {
/// @dev Thrown when a zero address is provided.
error ZeroAddress();
/// @dev Thrown when the caller is not the prover owner.
error NotProverOwner();
/// @dev Thrown when the caller is not the staking contract.
error NotStaking();
/// @dev Thrown when a transfer is attempted.
error NonTransferable();
/// @notice The staking contract that corresponding to this prover.
/// @dev This address cannot be changed.
/// @return The address of the staking contract.
function staking() external view returns (address);
/// @notice The governor used in protocol governance.
/// @dev This address cannot be changed.
/// @return The address of the governor contract.
function governor() external view returns (address);
/// @notice The $PROVE token
/// @dev This address cannot be changed.
/// @return The address of the $PROVE token.
function prove() external view returns (address);
/// @notice The owner of this prover. The owner was the address that created this prover by
/// calling `createProver()` on the staking contract. The owner has control over
/// particpiation in governance, collection of prover owner rewards, and the signing
/// rights of verifiable prover network actions such as bidding and fulfilling proofs.
/// @dev This address cannot be changed.
/// @return The address of the prover owner.
function owner() external view returns (address);
/// @notice The ID of this prover. IDs are assigned sequentially, incrementing
/// each time a prover is created.
/// @dev This is purely for informational purposes. This ID cannot be changed.
/// @return The ID of the prover.
function id() external view returns (uint256);
/// @notice The staker fee percentage in basis points (one-hundredth of a percent). For a
/// given $PROVE reward for fulfilling proofs, this much goes into this prover.
/// @dev This fee cannot be changed.
/// @return The staker fee percentage in basis points.
function stakerFeeBips() external view returns (uint256);
/// @notice Create a governance proposal. Only callable by the prover owner.
/// @dev This function is a wrapper around `IGovernor.propose`.
/// @param targets The addresses of the contracts to call.
/// @param values The amounts of ETH to send.
/// @param calldatas The calldata for each call.
/// @param description The proposal description.
/// @return The proposal ID.
function propose(
address[] memory targets,
uint256[] memory values,
bytes[] memory calldatas,
string memory description
) external returns (uint256);
/// @notice Cancel a governance proposal. Only callable by the prover owner.
/// @dev This function is a wrapper around `IGovernor.cancel`.
/// @param targets The addresses of the contracts to call.
/// @param values The amounts of ETH to send.
/// @param calldatas The calldata for each call.
/// @param descriptionHash The hash of the proposal description.
/// @return The proposal ID.
function cancel(
address[] memory targets,
uint256[] memory values,
bytes[] memory calldatas,
bytes32 descriptionHash
) external returns (uint256);
/// @notice Cast a vote on a governance proposal. Only callable by the prover owner.
/// @dev This function is a wrapper around `IGovernor.castVote`.
/// @param proposalId The ID of the proposal.
/// @param support The vote type (0 = Against, 1 = For, 2 = Abstain).
/// @return The voting weight used.
function castVote(uint256 proposalId, uint8 support) external returns (uint256);
/// @notice Transfer $PROVE to the staking contract. Only callable by the staking contract.
/// @dev Since in `SuccinctStaking.permitAndStake()`, the staker approves the prover to spend $PROVE, the
/// staking contract needs to transfer the $PROVE utilizing this contract as the spender.
/// @param from The address to transfer $PROVE from.
/// @param amount The amount of $PROVE to transfer.
function transferProveToStaking(address from, uint256 amount) external;
}
// src/interfaces/IProverRegistry.sol
interface IProverRegistry {
/// @dev Emitted when a prover is deployed.
event ProverDeploy(address indexed prover, address owner, uint256 stakerFeeBips);
/// @dev Thrown creating a prover before the registry is initialized.
error NotInitialized();
/// @dev Thrown if the caller is not authorized to perform the action.
error NotAuthorized();
/// @dev Thrown when an address parameter is zero.
error ZeroAddress();
/// @dev Thrown if the specified prover does not exist.
error ProverNotFound();
/// @dev Thrown if a prover already exists for this owner.
error ProverAlreadyExists();
/// @dev Thrown if the staker fee is greater than 100%.
error InvalidStakerFeeBips();
/// @notice The address of the governor contract.
function governor() external view returns (address);
/// @notice The address of the VApp.
function vapp() external view returns (address);
/// @notice The address of the $PROVE token.
function prove() external view returns (address);
/// @notice The address of the $iPROVE token.
function iProve() external view returns (address);
/// @notice The number of provers in the registry.
function proverCount() external view returns (uint256);
/// @notice The owner of a given prover.
/// @param prover The address of the prover.
/// @return The address of the owner.
function ownerOf(address prover) external view returns (address);
/// @notice Check if a given address is a prover.
/// @param prover The address of the prover.
/// @return True if the address is a prover, false otherwise.
function isProver(address prover) external view returns (bool);
/// @notice Get the address of a prover for a given owner.
/// @param owner The address of the owner.
/// @return The address of the prover.
function getProver(address owner) external view returns (address);
/// @notice Check if a given address is the owner of a prover.
/// @param owner The address of the owner.
/// @return True if the address is the owner of a prover, false otherwise.
function hasProver(address owner) external view returns (bool);
/// @notice Create a new prover.
/// @dev The caller becomes the owner of the new prover. Only one prover can be created per
/// owner. It is recommended to use a cold wallet to create a prover, and then
/// immediately set a delegated signer to a hot wallet for the prover.
/// @param stakerFeeBips The reward percentage in basis points (one-hundredth of a percent) that
/// goes to the prover's stakers. This cannot be changed after the prover is created.
/// @return The address of the new prover.
function createProver(uint256 stakerFeeBips) external returns (address);
}
// lib/openzeppelin-contracts/contracts/governance/utils/IVotes.sol
// OpenZeppelin Contracts (last updated v5.0.0) (governance/utils/IVotes.sol)
/**
* @dev Common interface for {ERC20Votes}, {ERC721Votes}, and other {Votes}-enabled contracts.
*/
interface IVotes {
/**
* @dev The signature used has expired.
*/
error VotesExpiredSignature(uint256 expiry);
/**
* @dev Emitted when an account changes their delegate.
*/
event DelegateChanged(address indexed delegator, address indexed fromDelegate, address indexed toDelegate);
/**
* @dev Emitted when a token transfer or delegate change results in changes to a delegate's number of voting units.
*/
event DelegateVotesChanged(address indexed delegate, uint256 previousVotes, uint256 newVotes);
/**
* @dev Returns the current amount of votes that `account` has.
*/
function getVotes(address account) external view returns (uint256);
/**
* @dev Returns the amount of votes that `account` had at a specific moment in the past. If the `clock()` is
* configured to use block numbers, this will return the value at the end of the corresponding block.
*/
function getPastVotes(address account, uint256 timepoint) external view returns (uint256);
/**
* @dev Returns the total supply of votes available at a specific moment in the past. If the `clock()` is
* configured to use block numbers, this will return the value at the end of the corresponding block.
*
* NOTE: This value is the sum of all available votes, which is not necessarily the sum of all delegated votes.
* Votes that have not been delegated are still part of total supply, even though they would not participate in a
* vote.
*/
function getPastTotalSupply(uint256 timepoint) external view returns (uint256);
/**
* @dev Returns the delegate that `account` has chosen.
*/
function delegates(address account) external view returns (address);
/**
* @dev Delegates votes from the sender to `delegatee`.
*/
function delegate(address delegatee) external;
/**
* @dev Delegates votes from signer to `delegatee`.
*/
function delegateBySig(address delegatee, uint256 nonce, uint256 expiry, uint8 v, bytes32 r, bytes32 s) external;
}
// lib/openzeppelin-contracts/contracts/proxy/utils/Initializable.sol
// OpenZeppelin Contracts (last updated v5.0.0) (proxy/utils/Initializable.sol)
/**
* @dev This is a base contract to aid in writing upgradeable contracts, or any kind of contract that will be deployed
* behind a proxy. Since proxied contracts do not make use of a constructor, it's common to move constructor logic to an
* external initializer function, usually called `initialize`. It then becomes necessary to protect this initializer
* function so it can only be called once. The {initializer} modifier provided by this contract will have this effect.
*
* The initialization functions use a version number. Once a version number is used, it is consumed and cannot be
* reused. This mechanism prevents re-execution of each "step" but allows the creation of new initialization steps in
* case an upgrade adds a module that needs to be initialized.
*
* For example:
*
* [.hljs-theme-light.nopadding]
* ```solidity
* contract MyToken is ERC20Upgradeable {
* function initialize() initializer public {
* __ERC20_init("MyToken", "MTK");
* }
* }
*
* contract MyTokenV2 is MyToken, ERC20PermitUpgradeable {
* function initializeV2() reinitializer(2) public {
* __ERC20Permit_init("MyToken");
* }
* }
* ```
*
* TIP: To avoid leaving the proxy in an uninitialized state, the initializer function should be called as early as
* possible by providing the encoded function call as the `_data` argument to {ERC1967Proxy-constructor}.
*
* CAUTION: When used with inheritance, manual care must be taken to not invoke a parent initializer twice, or to ensure
* that all initializers are idempotent. This is not verified automatically as constructors are by Solidity.
*
* [CAUTION]
* ====
* Avoid leaving a contract uninitialized.
*
* An uninitialized contract can be taken over by an attacker. This applies to both a proxy and its implementation
* contract, which may impact the proxy. To prevent the implementation contract from being used, you should invoke
* the {_disableInitializers} function in the constructor to automatically lock it when it is deployed:
*
* [.hljs-theme-light.nopadding]
* ```
* /// @custom:oz-upgrades-unsafe-allow constructor
* constructor() {
* _disableInitializers();
* }
* ```
* ====
*/
abstract contract Initializable {
/**
* @dev Storage of the initializable contract.
*
* It's implemented on a custom ERC-7201 namespace to reduce the risk of storage collisions
* when using with upgradeable contracts.
*
* @custom:storage-location erc7201:openzeppelin.storage.Initializable
*/
struct InitializableStorage {
/**
* @dev Indicates that the contract has been initialized.
*/
uint64 _initialized;
/**
* @dev Indicates that the contract is in the process of being initialized.
*/
bool _initializing;
}
// keccak256(abi.encode(uint256(keccak256("openzeppelin.storage.Initializable")) - 1)) & ~bytes32(uint256(0xff))
bytes32 private constant INITIALIZABLE_STORAGE = 0xf0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a00;
/**
* @dev The contract is already initialized.
*/
error InvalidInitialization();
/**
* @dev The contract is not initializing.
*/
error NotInitializing();
/**
* @dev Triggered when the contract has been initialized or reinitialized.
*/
event Initialized(uint64 version);
/**
* @dev A modifier that defines a protected initializer function that can be invoked at most once. In its scope,
* `onlyInitializing` functions can be used to initialize parent contracts.
*
* Similar to `reinitializer(1)`, except that in the context of a constructor an `initializer` may be invoked any
* number of times. This behavior in the constructor can be useful during testing and is not expected to be used in
* production.
*
* Emits an {Initialized} event.
*/
modifier initializer() {
// solhint-disable-next-line var-name-mixedcase
InitializableStorage storage $ = _getInitializableStorage();
// Cache values to avoid duplicated sloads
bool isTopLevelCall = !$._initializing;
uint64 initialized = $._initialized;
// Allowed calls:
// - initialSetup: the contract is not in the initializing state and no previous version was
// initialized
// - construction: the contract is initialized at version 1 (no reininitialization) and the
// current contract is just being deployed
bool initialSetup = initialized == 0 && isTopLevelCall;
bool construction = initialized == 1 && address(this).code.length == 0;
if (!initialSetup && !construction) {
revert InvalidInitialization();
}
$._initialized = 1;
if (isTopLevelCall) {
$._initializing = true;
}
_;
if (isTopLevelCall) {
$._initializing = false;
emit Initialized(1);
}
}
/**
* @dev A modifier that defines a protected reinitializer function that can be invoked at most once, and only if the
* contract hasn't been initialized to a greater version before. In its scope, `onlyInitializing` functions can be
* used to initialize parent contracts.
*
* A reinitializer may be used after the original initialization step. This is essential to configure modules that
* are added through upgrades and that require initialization.
*
* When `version` is 1, this modifier is similar to `initializer`, except that functions marked with `reinitializer`
* cannot be nested. If one is invoked in the context of another, execution will revert.
*
* Note that versions can jump in increments greater than 1; this implies that if multiple reinitializers coexist in
* a contract, executing them in the right order is up to the developer or operator.
*
* WARNING: Setting the version to 2**64 - 1 will prevent any future reinitialization.
*
* Emits an {Initialized} event.
*/
modifier reinitializer(uint64 version) {
// solhint-disable-next-line var-name-mixedcase
InitializableStorage storage $ = _getInitializableStorage();
if ($._initializing || $._initialized >= version) {
revert InvalidInitialization();
}
$._initialized = version;
$._initializing = true;
_;
$._initializing = false;
emit Initialized(version);
}
/**
* @dev Modifier to protect an initialization function so that it can only be invoked by functions with the
* {initializer} and {reinitializer} modifiers, directly or indirectly.
*/
modifier onlyInitializing() {
_checkInitializing();
_;
}
/**
* @dev Reverts if the contract is not in an initializing state. See {onlyInitializing}.
*/
function _checkInitializing() internal view virtual {
if (!_isInitializing()) {
revert NotInitializing();
}
}
/**
* @dev Locks the contract, preventing any future reinitialization. This cannot be part of an initializer call.
* Calling this in the constructor of a contract will prevent that contract from being initialized or reinitialized
* to any version. It is recommended to use this to lock implementation contracts that are designed to be called
* through proxies.
*
* Emits an {Initialized} event the first time it is successfully executed.
*/
function _disableInitializers() internal virtual {
// solhint-disable-next-line var-name-mixedcase
InitializableStorage storage $ = _getInitializableStorage();
if ($._initializing) {
revert InvalidInitialization();
}
if ($._initialized != type(uint64).max) {
$._initialized = type(uint64).max;
emit Initialized(type(uint64).max);
}
}
/**
* @dev Returns the highest version that has been initialized. See {reinitializer}.
*/
function _getInitializedVersion() internal view returns (uint64) {
return _getInitializableStorage()._initialized;
}
/**
* @dev Returns `true` if the contract is currently initializing. See {onlyInitializing}.
*/
function _isInitializing() internal view returns (bool) {
return _getInitializableStorage()._initializing;
}
/**
* @dev Returns a pointer to the storage namespace.
*/
// solhint-disable-next-line var-name-mixedcase
function _getInitializableStorage() private pure returns (InitializableStorage storage $) {
assembly {
$.slot := INITIALIZABLE_STORAGE
}
}
}
// lib/openzeppelin-contracts/contracts/utils/Nonces.sol
// OpenZeppelin Contracts (last updated v5.0.0) (utils/Nonces.sol)
/**
* @dev Provides tracking nonces for addresses. Nonces will only increment.
*/
abstract contract Nonces {
/**
* @dev The nonce used for an `account` is not the expected current nonce.
*/
error InvalidAccountNonce(address account, uint256 currentNonce);
mapping(address account => uint256) private _nonces;
/**
* @dev Returns the next unused nonce for an address.
*/
function nonces(address owner) public view virtual returns (uint256) {
return _nonces[owner];
}
/**
* @dev Consumes a nonce.
*
* Returns the current value and increments nonce.
*/
function _useNonce(address owner) internal virtual returns (uint256) {
// For each account, the nonce has an initial value of 0, can only be incremented by one, and cannot be
// decremented or reset. This guarantees that the nonce never overflows.
unchecked {
// It is important to do x++ and not ++x here.
return _nonces[owner]++;
}
}
/**
* @dev Same as {_useNonce} but checking that `nonce` is the next valid for `owner`.
*/
function _useCheckedNonce(address owner, uint256 nonce) internal virtual {
uint256 current = _useNonce(owner);
if (nonce != current) {
revert InvalidAccountNonce(owner, current);
}
}
}
// lib/openzeppelin-contracts/contracts/utils/Panic.sol
// OpenZeppelin Contracts (last updated v5.1.0) (utils/Panic.sol)
/**
* @dev Helper library for emitting standardized panic codes.
*
* ```solidity
* contract Example {
* using Panic for uint256;
*
* // Use any of the declared internal constants
* function foo() { Panic.GENERIC.panic(); }
*
* // Alternatively
* function foo() { Panic.panic(Panic.GENERIC); }
* }
* ```
*
* Follows the list from https://github.com/ethereum/solidity/blob/v0.8.24/libsolutil/ErrorCodes.h[libsolutil].
*
* _Available since v5.1._
*/
// slither-disable-next-line unused-state
library Panic {
/// @dev generic / unspecified error
uint256 internal constant GENERIC = 0x00;
/// @dev used by the assert() builtin
uint256 internal constant ASSERT = 0x01;
/// @dev arithmetic underflow or overflow
uint256 internal constant UNDER_OVERFLOW = 0x11;
/// @dev division or modulo by zero
uint256 internal constant DIVISION_BY_ZERO = 0x12;
/// @dev enum conversion error
uint256 internal constant ENUM_CONVERSION_ERROR = 0x21;
/// @dev invalid encoding in storage
uint256 internal constant STORAGE_ENCODING_ERROR = 0x22;
/// @dev empty array pop
uint256 internal constant EMPTY_ARRAY_POP = 0x31;
/// @dev array out of bounds access
uint256 internal constant ARRAY_OUT_OF_BOUNDS = 0x32;
/// @dev resource error (too large allocation or too large array)
uint256 internal constant RESOURCE_ERROR = 0x41;
/// @dev calling invalid internal function
uint256 internal constant INVALID_INTERNAL_FUNCTION = 0x51;
/// @dev Reverts with a panic code. Recommended to use with
/// the internal constants with predefined codes.
function panic(uint256 code) internal pure {
assembly ("memory-safe") {
mstore(0x00, 0x4e487b71)
mstore(0x20, code)
revert(0x1c, 0x24)
}
}
}
// src/libraries/PublicValues.sol
/// @notice A transaction.
struct Transaction {
/// @notice The variant of the transaction.
TransactionVariant variant;
/// @notice The status of the transaction.
TransactionStatus status;
/// @notice The onchain transaction ID.
uint64 onchainTxId;
/// @notice The action of one of {Deposit, Withdraw, CreateProver}.
bytes action;
}
/// @notice The receipt for a transaction.
struct Receipt {
/// @notice The variant of the transaction.
TransactionVariant variant;
/// @notice The status of the transaction.
TransactionStatus status;
/// @notice The onchain transaction ID.
uint64 onchainTxId;
/// @notice The action of one of {Deposit, Withdraw, CreateProver}.
bytes action;
}
/// @notice The type of transaction.
enum TransactionVariant {
Deposit,
Withdraw,
CreateProver
}
/// @notice The status of a transaction.
enum TransactionStatus {
/// The transaction has no initialiezd status.
None,
/// The transaction has been included in the ledger but is not yet executed.
Pending,
/// The transaction executed successfully.
Completed,
/// The transaction reverted during execution.
Reverted
}
/// @notice The action data for a deposit.
struct Deposit {
address account;
uint256 amount;
}
/// @notice The action data for a withdraw.
struct Withdraw {
address account;
uint256 amount;
}
/// @notice The action data for an add signer.
struct CreateProver {
address prover;
address owner;
uint256 stakerFeeBips;
}
/// @notice The public values encoded as a struct that can be easily deserialized inside Solidity.
struct StepPublicValues {
bytes32 oldRoot;
bytes32 newRoot;
uint64 timestamp;
Receipt[] receipts;
}
// lib/openzeppelin-contracts/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.
/**
* @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))
}
}
}
// lib/openzeppelin-contracts/contracts/utils/StorageSlot.sol
// OpenZeppelin Contracts (last updated v5.1.0) (utils/StorageSlot.sol)
// This file was procedurally generated from scripts/generate/templates/StorageSlot.js.
/**
* @dev Library for reading and writing primitive types to specific storage slots.
*
* Storage slots are often used to avoid storage conflict when dealing with upgradeable contracts.
* This library helps with reading and writing to such slots without the need for inline assembly.
*
* The functions in this library return Slot structs that contain a `value` member that can be used to read or write.
*
* Example usage to set ERC-1967 implementation slot:
* ```solidity
* contract ERC1967 {
* // Define the slot. Alternatively, use the SlotDerivation library to derive the slot.
* bytes32 internal constant _IMPLEMENTATION_SLOT = 0x360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc;
*
* function _getImplementation() internal view returns (address) {
* return StorageSlot.getAddressSlot(_IMPLEMENTATION_SLOT).value;
* }
*
* function _setImplementation(address newImplementation) internal {
* require(newImplementation.code.length > 0);
* StorageSlot.getAddressSlot(_IMPLEMENTATION_SLOT).value = newImplementation;
* }
* }
* ```
*
* TIP: Consider using this library along with {SlotDerivation}.
*/
library StorageSlot {
struct AddressSlot {
address value;
}
struct BooleanSlot {
bool value;
}
struct Bytes32Slot {
bytes32 value;
}
struct Uint256Slot {
uint256 value;
}
struct Int256Slot {
int256 value;
}
struct StringSlot {
string value;
}
struct BytesSlot {
bytes value;
}
/**
* @dev Returns an `AddressSlot` with member `value` located at `slot`.
*/
function getAddressSlot(bytes32 slot) internal pure returns (AddressSlot storage r) {
assembly ("memory-safe") {
r.slot := slot
}
}
/**
* @dev Returns a `BooleanSlot` with member `value` located at `slot`.
*/
function getBooleanSlot(bytes32 slot) internal pure returns (BooleanSlot storage r) {
assembly ("memory-safe") {
r.slot := slot
}
}
/**
* @dev Returns a `Bytes32Slot` with member `value` located at `slot`.
*/
function getBytes32Slot(bytes32 slot) internal pure returns (Bytes32Slot storage r) {
assembly ("memory-safe") {
r.slot := slot
}
}
/**
* @dev Returns a `Uint256Slot` with member `value` located at `slot`.
*/
function getUint256Slot(bytes32 slot) internal pure returns (Uint256Slot storage r) {
assembly ("memory-safe") {
r.slot := slot
}
}
/**
* @dev Returns a `Int256Slot` with member `value` located at `slot`.
*/
function getInt256Slot(bytes32 slot) internal pure returns (Int256Slot storage r) {
assembly ("memory-safe") {
r.slot := slot
}
}
/**
* @dev Returns a `StringSlot` with member `value` located at `slot`.
*/
function getStringSlot(bytes32 slot) internal pure returns (StringSlot storage r) {
assembly ("memory-safe") {
r.slot := slot
}
}
/**
* @dev Returns an `StringSlot` representation of the string storage pointer `store`.
*/
function getStringSlot(string storage store) internal pure returns (StringSlot storage r) {
assembly ("memory-safe") {
r.slot := store.slot
}
}
/**
* @dev Returns a `BytesSlot` with member `value` located at `slot`.
*/
function getBytesSlot(bytes32 slot) internal pure returns (BytesSlot storage r) {
assembly ("memory-safe") {
r.slot := slot
}
}
/**
* @dev Returns an `BytesSlot` representation of the bytes storage pointer `store`.
*/
function getBytesSlot(bytes storage store) internal pure returns (BytesSlot storage r) {
assembly ("memory-safe") {
r.slot := store.slot
}
}
}
// lib/openzeppelin-contracts/contracts/interfaces/draft-IERC6093.sol
// OpenZeppelin Contracts (last updated v5.1.0) (interfaces/draft-IERC6093.sol)
/**
* @dev Standard ERC-20 Errors
* Interface of the https://eips.ethereum.org/EIPS/eip-6093[ERC-6093] custom errors for ERC-20 tokens.
*/
interface IERC20Errors {
/**
* @dev Indicates an error related to the current `balance` of a `sender`. Used in transfers.
* @param sender Address whose tokens are being transferred.
* @param balance Current balance for the interacting account.
* @param needed Minimum amount required to perform a transfer.
*/
error ERC20InsufficientBalance(address sender, uint256 balance, uint256 needed);
/**
* @dev Indicates a failure with the token `sender`. Used in transfers.
* @param sender Address whose tokens are being transferred.
*/
error ERC20InvalidSender(address sender);
/**
* @dev Indicates a failure with the token `receiver`. Used in transfers.
* @param receiver Address to which tokens are being transferred.
*/
error ERC20InvalidReceiver(address receiver);
/**
* @dev Indicates a failure with the `spender`’s `allowance`. Used in transfers.
* @param spender Address that may be allowed to operate on tokens without being their owner.
* @param allowance Amount of tokens a `spender` is allowed to operate with.
* @param needed Minimum amount required to perform a transfer.
*/
error ERC20InsufficientAllowance(address spender, uint256 allowance, uint256 needed);
/**
* @dev Indicates a failure with the `approver` of a token to be approved. Used in approvals.
* @param approver Address initiating an approval operation.
*/
error ERC20InvalidApprover(address approver);
/**
* @dev Indicates a failure with the `spender` to be approved. Used in approvals.
* @param spender Address that may be allowed to operate on tokens without being their owner.
*/
error ERC20InvalidSpender(address spender);
}
/**
* @dev Standard ERC-721 Errors
* Interface of the https://eips.ethereum.org/EIPS/eip-6093[ERC-6093] custom errors for ERC-721 tokens.
*/
interface IERC721Errors {
/**
* @dev Indicates that an address can't be an owner. For example, `address(0)` is a forbidden owner in ERC-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);
}
// lib/openzeppelin-contracts/contracts/utils/Create2.sol
// OpenZeppelin Contracts (last updated v5.1.0) (utils/Create2.sol)
/**
* @dev Helper to make usage of the `CREATE2` EVM opcode easier and safer.
* `CREATE2` can be used to compute in advance the address where a smart
* contract will be deployed, which allows for interesting new mechanisms known
* as 'counterfactual interactions'.
*
* See the https://eips.ethereum.org/EIPS/eip-1014#motivation[EIP] for more
* information.
*/
library Create2 {
/**
* @dev There's no code to deploy.
*/
error Create2EmptyBytecode();
/**
* @dev Deploys a contract using `CREATE2`. The address where the contract
* will be deployed can be known in advance via {computeAddress}.
*
* The bytecode for a contract can be obtained from Solidity with
* `type(contractName).creationCode`.
*
* Requirements:
*
* - `bytecode` must not be empty.
* - `salt` must have not been used for `bytecode` already.
* - the factory must have a balance of at least `amount`.
* - if `amount` is non-zero, `bytecode` must have a `payable` constructor.
*/
function deploy(uint256 amount, bytes32 salt, bytes memory bytecode) internal returns (address addr) {
if (address(this).balance < amount) {
revert Errors.InsufficientBalance(address(this).balance, amount);
}
if (bytecode.length == 0) {
revert Create2EmptyBytecode();
}
assembly ("memory-safe") {
addr := create2(amount, add(bytecode, 0x20), mload(bytecode), salt)
// if no address was created, and returndata is not empty, bubble revert
if and(iszero(addr), not(iszero(returndatasize()))) {
let p := mload(0x40)
returndatacopy(p, 0, returndatasize())
revert(p, returndatasize())
}
}
if (addr == address(0)) {
revert Errors.FailedDeployment();
}
}
/**
* @dev Returns the address where a contract will be stored if deployed via {deploy}. Any change in the
* `bytecodeHash` or `salt` will result in a new destination address.
*/
function computeAddress(bytes32 salt, bytes32 bytecodeHash) internal view returns (address) {
return computeAddress(salt, bytecodeHash, address(this));
}
/**
* @dev Returns the address where a contract will be stored if deployed via {deploy} from a contract located at
* `deployer`. If `deployer` is this contract's address, returns the same value as {computeAddress}.
*/
function computeAddress(bytes32 salt, bytes32 bytecodeHash, address deployer) internal pure returns (address addr) {
assembly ("memory-safe") {
let ptr := mload(0x40) // Get free memory pointer
// | | ↓ ptr ... ↓ ptr + 0x0B (start) ... ↓ ptr + 0x20 ... ↓ ptr + 0x40 ... |
// |-------------------|---------------------------------------------------------------------------|
// | bytecodeHash | CCCCCCCCCCCCC...CC |
// | salt | BBBBBBBBBBBBB...BB |
// | deployer | 000000...0000AAAAAAAAAAAAAAAAAAA...AA |
// | 0xFF | FF |
// |-------------------|---------------------------------------------------------------------------|
// | memory | 000000...00FFAAAAAAAAAAAAAAAAAAA...AABBBBBBBBBBBBB...BBCCCCCCCCCCCCC...CC |
// | keccak(start, 85) | ↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑ |
mstore(add(ptr, 0x40), bytecodeHash)
mstore(add(ptr, 0x20), salt)
mstore(ptr, deployer) // Right-aligned with 12 preceding garbage bytes
let start := add(ptr, 0x0b) // The hashed data starts at the final garbage byte which we will set to 0xff
mstore8(start, 0xff)
addr := and(keccak256(start, 85), 0xffffffffffffffffffffffffffffffffffffffff)
}
}
}
// lib/openzeppelin-contracts/contracts/interfaces/IERC165.sol
// OpenZeppelin Contracts (last updated v5.0.0) (interfaces/IERC165.sol)
// lib/openzeppelin-contracts/contracts/interfaces/IERC20.sol
// OpenZeppelin Contracts (last updated v5.0.0) (interfaces/IERC20.sol)
// lib/openzeppelin-contracts/contracts/token/ERC20/extensions/IERC20Metadata.sol
// OpenZeppelin Contracts (last updated v5.1.0) (token/ERC20/extensions/IERC20Metadata.sol)
/**
* @dev Interface for the optional metadata functions from the ERC-20 standard.
*/
interface IERC20Metadata is IERC20 {
/**
* @dev Returns the name of the token.
*/
function name() external view returns (string memory);
/**
* @dev Returns the symbol of the token.
*/
function symbol() external view returns (string memory);
/**
* @dev Returns the decimals places of the token.
*/
function decimals() external view returns (uint8);
}
// src/interfaces/ISuccinctStaking.sol
interface ISuccinctStaking is IProverRegistry {
/// @dev Represents a claim for unstaking some amount of $stPROVE.
/// @param stPROVE The requested amount of $stPROVE to unstake.
/// @param iPROVESnapshot The expected $iPROVE to be received at time of unstake request.
/// @param timestamp The timestamp when the unstake was requested. Used for comparing against
/// the `unstakePeriod()` to determine if the claim can be finished.
struct UnstakeClaim {
uint256 stPROVE;
uint256 iPROVESnapshot;
uint256 timestamp;
}
/// @dev Represents a claim to slash a prover for some amount of $iPROVE.
/// @param iPROVE The requested amount of $iPROVE to slash.
/// @param timestamp The timestamp when the slash was requested. Used for comparing against
/// the `slashPeriod()` to determine if the claim can be finished.
struct SlashClaim {
uint256 iPROVE;
uint256 timestamp;
}
/// @dev Emitted when a staker stakes into a prover.
event Stake(
address indexed staker,
address indexed prover,
uint256 PROVE,
uint256 iPROVE,
uint256 stPROVE
);
/// @dev Emitted when a staker requests to unstake $stPROVE from a prover.
event UnstakeRequest(
address indexed staker, address indexed prover, uint256 stPROVE, uint256 iPROVESnapshot
);
/// @dev Emitted when a staker unstakes from a prover.
event Unstake(
address indexed staker,
address indexed prover,
uint256 PROVE,
uint256 iPROVE,
uint256 stPROVE
);
/// @dev Emitted when a $PROVE reward is distributed to a prover.
event Reward(address indexed prover, uint256 PROVE);
/// @dev Emitted when a prover is requested to be slashed.
event SlashRequest(address indexed prover, uint256 iPROVE, uint256 index);
/// @dev Emitted when a prover slash request is canceled.
event SlashCancel(address indexed prover, uint256 iPROVE, uint256 index);
/// @dev Emitted when a prover slash request is executed.
event Slash(address indexed prover, uint256 PROVE, uint256 iPROVE, uint256 index);
/// @dev Emitted when stakers are dispensed $PROVE.
event Dispense(uint256 PROVE);
/// @dev Emitted when the dispense rate is updated.
event DispenseRateUpdate(uint256 oldDispenseRate, uint256 newDispenseRate);
/// @dev Thrown if the staker has insufficient balance to unstake, or if attempting to slash
/// more than the prover has.
error InsufficientStakeBalance();
/// @dev Thrown if the staker tries to unstake while not staked with the prover.
error NotStaked();
/// @dev Thrown if the staker tries to unstake while there is no unstake requests.
error NoUnstakeRequests();
/// @dev Thrown if the staker tries to unstake while there are unstakes requests, but none
/// of them are ready to be finished (have passed the `unstakePeriod()`).
error NoReadyUnstakeRequests();
/// @dev Thrown if the staker tries to unstake while they already have too many unstake
/// requests.
error TooManyUnstakeRequests();
/// @dev Thrown if the staker tries to stake or unstake a zero amount.
error ZeroAmount();
/// @dev Thrown if staking would result in a receipt token with a zero amount.
error ZeroReceiptAmount();
/// @dev Thrown if the staker tries to stake less than the minimum stake amount.
error StakeBelowMinimum();
/// @dev Thrown if the staker tries to deposit while already staked with a different prover.
error AlreadyStakedWithDifferentProver(address existingProver);
/// @dev Thrown if staking or unstaking while the prover has one or more pending slash requests.
error ProverHasSlashRequest();
/// @dev Thrown if the slash request is not ready to be completed.
error SlashNotReady();
/// @dev Thrown if the specified dispense amount exceeds the maximum dispense amount.
error AmountExceedsAvailableDispense();
/// @notice The minimum amount of $PROVE that a staker needs to stake.
function minStakeAmount() external view returns (uint256);
/// @notice The maximum number of unstake requests that a staker can have at once.
function maxUnstakeRequests() external view returns (uint256);
/// @notice The minimum amount of time needed between `requestUnstake()` and `finishUnstake()`.
function unstakePeriod() external view returns (uint256);
/// @notice The minimum amount of time needed between `requestSlash()` and `finishSlash()`.
function slashPeriod() external view returns (uint256);
/// @notice The maximum amount of $PROVE that can be dispensed per second.
function dispenseRate() external view returns (uint256);
/// @notice The last time $PROVE was dispensed.
function lastDispenseTimestamp() external view returns (uint256);
/// @notice The prover that a staker is staked with.
/// @dev A staker can only be staked with one prover at a time. To switch provers, they must
/// fully unstake from their current prover first.
/// @param staker The address of the staker.
/// @return The address of the prover.
function stakedTo(address staker) external view returns (address);
/// @notice The amount $PROVE that a staker would receive if their full $stPROVE balance was
/// unstaked.
/// @dev This does not account for any slashing that could occur during the unstaking period.
/// @param staker The address of the staker.
/// @return The amount of $PROVE.
function staked(address staker) external view returns (uint256);
/// @notice The amount of $PROVE that a prover has staked to them.
/// @param prover The address of the prover.
/// @return The amount of $PROVE.
function proverStaked(address prover) external view returns (uint256);
/// @notice The unstake requests for a staker.
/// @param staker The address of the staker.
/// @return The unstake requests.
function unstakeRequests(address staker) external view returns (UnstakeClaim[] memory);
/// @notice The slash requests for a prover.
/// @param prover The address of the prover.
/// @return The slash requests.
function slashRequests(address prover) external view returns (SlashClaim[] memory);
/// @notice The amount of $PROVE that a staker would receive with their pending unstake requests.
/// @dev Returns the sum of snapshotted $PROVE values for all pending unstake claims, adjusted
/// for any slashing that occurred after the requests were made.
/// @param staker The address of the staker.
/// @return The amount of $PROVE.
function unstakePending(address staker) external view returns (uint256);
/// @notice The amount of $PROVE that a staker would receive if they unstaked from a prover.
/// @param prover The address of the prover.
/// @param stPROVE The amount of $stPROVE to unstake.
/// @return The amount of $PROVE.
function previewUnstake(address prover, uint256 stPROVE) external view returns (uint256);
/// @notice The maximum amount of $PROVE that can be dispensed currently.
/// @return The maximum amount of $PROVE.
function maxDispense() external view returns (uint256);
/// @notice Stake $PROVE to a prover. Must have approved $PROVE with this contract as the
/// spender. You may only stake to one prover at a time.
/// @dev Deposits $PROVE into the iPROVE vault to mint $iPROVE, then deposits $iPROVE into the
/// chosen prover to mint $PROVER-N/$stPROVE.
/// @param prover The address of the prover to delegate $iPROVE to.
/// @param PROVE The amount of $PROVE to deposit.
/// @return The amount of $stPROVE received.
function stake(address prover, uint256 PROVE) external returns (uint256);
/// @notice Stake $PROVE to a prover. You may only stake to one prover at a time.
/// @dev Deposits $PROVE to mint $iPROVE, then deposits $iPROVE into the chosen
/// prover to mint $PROVER-N/$stPROVE. The prover is the spender of the permit, rather
/// than the staking contract, to avoid someone using the permit signature for an
/// unintended prover.
/// @param prover The address of the prover to delegate $PROVE to.
/// @param staker The address if the staker. Must correspond to the signer of the permit
/// signature.
/// @param PROVE The amount of $PROVE to spend for the deposit.
/// @param deadline The deadline for the permit signature.
/// @param v The v component of the permit signature.
/// @param r The r component of the permit signature.
/// @param s The s component of the permit signature.
/// @return The amount of $stPROVE the staker received.
function permitAndStake(
address prover,
address staker,
uint256 PROVE,
uint256 deadline,
uint8 v,
bytes32 r,
bytes32 s
) external returns (uint256);
/// @notice Creates a request to unstake $stPROVE from the prover for the specified amount.
/// @dev The staker must have enough $stPROVE that is not already in the unstake request queue.
/// The $iPROVE value is snapshotted at request time to prevent earning rewards during
/// the unstaking period.
/// @param stPROVE The amount of $stPROVE to unstake.
function requestUnstake(uint256 stPROVE) external;
/// @notice Finishes the unstaking process for the specified address. Can be called by anyone.
/// Must have first called `requestUnstake()` and waited for the unstake period to pass.
/// @dev For each claim, if any snapshotted $iPROVE is lower than the actual $iPROVE that was
/// received, then the difference is given back to the prover.
/// @param staker The address whose unstake claims to finish.
/// @return The amount of $PROVE received.
function finishUnstake(address staker) external returns (uint256);
/// @notice Creates a request to slash a prover for the specified amount. Only callable by the
/// VApp.
/// @param prover The address of the prover to slash.
/// @param iPROVE The amount of $iPROVE to slash.
/// @return The index of the new slash request in this prover's slash requests storage array.
/// Because when slash requests are processed, it alters the order of the array, it is
/// best to first call `slashRequests(prover)` to get the index of the specific slash
/// request that is intended to be executed.
function requestSlash(address prover, uint256 iPROVE) external returns (uint256);
/// @notice Cancels a slash request. Only callable by the owner.
/// @dev The index may not match what was originally returned by `requestSlash()`, and
/// should be re-calculated by calling `slashRequests(prover)` first.
/// @param prover The address of the prover to slash.
/// @param index The index of the slash request to cancel.
function cancelSlash(address prover, uint256 index) external;
/// @notice Finishes the slashing process. Must have first called `requestSlash()` and waited
/// for the slash period to pass. Decreases the value of $stPROVE for all stakers of that
/// prover. Only callable by the owner.
/// @dev The index may not match what was originally returned by `requestSlash()`, and
/// should be re-calculated by calling `slashRequests(prover)` first.
/// @param prover The address of the prover to slash.
/// @param index The index of the slash request to finish.
/// @return The amount of $iPROVE slashed.
function finishSlash(address prover, uint256 index) external returns (uint256);
/// @notice Rewards all stakers ($iPROVE holders) with $PROVE. Only callable by the owner.
/// @dev The amount MUST be less than or equal to maxDispense() (if not type(uint256).max), and
/// the amount MUST be less than or equal to the amount of $PROVE balance of this contract.
/// @param PROVE The amount of $PROVE to dispense. If this is `type(uint256).max`, dispense the
/// maximum available amount.
function dispense(uint256 PROVE) external;
/// @notice Updates the dispense rate. Only callable by the owner.
/// @param dispenseRate The new dispense rate.
function updateDispenseRate(uint256 dispenseRate) external;
}
// src/interfaces/ISuccinctVApp.sol
interface ISuccinctVApp {
/// @notice Emitted when a receipt is completed.
event TransactionCompleted(
uint64 indexed onchainTx, TransactionVariant indexed variant, bytes data
);
/// @notice Emitted when a receipt is failed.
event TransactionReverted(
uint64 indexed onchainTx, TransactionVariant indexed variant, bytes data
);
/// @notice Emitted when a receipt is pending.
event TransactionPending(
uint64 indexed onchainTx, TransactionVariant indexed variant, bytes data
);
/// @notice Emitted when a new block was committed.
event Block(uint64 indexed block, bytes32 oldRoot, bytes32 newRoot);
/// @notice Emitted when the program was forked.
event Fork(uint64 indexed block, bytes32 oldVkey, bytes32 newVkey);
/// @notice Emitted when a withdrawal is claimed.
event Withdrawal(address indexed account, uint256 amount);
/// @notice Emitted when the auctioneer address was updated.
event AuctioneerUpdate(address oldAuctioneer, address newAuctioneer);
/// @notice Emitted when the staking address was updated.
event StakingUpdate(address oldStaking, address newStaking);
/// @notice Emitted when the verifier address was updated.
event VerifierUpdate(address oldVerifier, address newVerifier);
/// @notice Emitted when the minimum deposit was updated.
event MinDepositAmountUpdate(uint256 oldMinDepositAmount, uint256 newMinDepositAmount);
/// @dev Thrown when the caller is not the auctioneer.
error NotAuctioneer();
/// @dev Thrown when the caller is not the staking contract.
error NotStaking();
/// @dev Thrown when an address parameter is zero.
error ZeroAddress();
/// @dev Thrown when a hash parameter is zero.
error ZeroHash();
/// @dev Thrown if the actual balance does not match the expected balance.
error BalanceMismatch();
/// @dev Thrown when an amount parameter is invalid.
error InvalidAmount();
/// @dev Thrown when a root parameter is invalid.
error InvalidRoot();
/// @dev Thrown when an old root parameter is invalid.
error InvalidOldRoot();
/// @dev Thrown when a sweep transfer fails.
error SweepTransferFailed();
/// @dev Thrown when an invalid vkey is encountered.
error InvalidVkey();
/// @dev Thrown when the state is not frozen.
error NotFrozen();
/// @dev Thrown when an invalid proof is encountered.
error InvalidProof();
/// @dev Thrown when an invalid timestamp is encountered.
error InvalidTimestamp();
/// @dev Thrown when a timestamp is in the past.
error TimestampInPast();
/// @dev Thrown when a timestamp is too far in the past (more than 1 hour before the current block time).
error TimestampTooOld();
/// @dev Thrown when a proof fails.
error ProofFailed();
/// @dev Thrown when a deposit is below the minimum.
error TransferBelowMinimum();
/// @dev Thrown when trying to register a prover and the owner mismatches the staking contract's
/// owner of the prover.
error ProverNotOwned();
/// @dev Thrown when public values receipts are sent in an order that does not match the
/// onchain transaction order.
error ReceiptOutOfOrder(uint64 expected, uint64 given);
/// @dev Thrown when a receipt status is invalid.
error ReceiptStatusInvalid(TransactionStatus status);
/// @dev Thrown when a transaction variant is invalid.
error TransactionVariantInvalid();
/// @notice The verification key for the vApp program.
function vkey() external view returns (bytes32);
/// @notice The address of the $PROVE token.
function prove() external view returns (address);
/// @notice The address of the $iPROVE token.
function iProve() external view returns (address);
/// @notice The address of the network auctioneer.
function auctioneer() external view returns (address);
/// @notice The address of the staking contract.
function staking() external view returns (address);
/// @notice The address of the SP1 verifier contract.
/// @dev This can either be a specific SP1Verifier for a specific version, or the
/// SP1VerifierGateway which can be used to verify proofs for any version of SP1.
/// For the list of supported verifiers on each chain, see:
/// https://github.com/succinctlabs/sp1-contracts/tree/main/contracts/deployments
function verifier() external view returns (address);
/// @notice The block number of the last state update.
function blockNumber() external view returns (uint64);
/// @notice The minimum amount for deposit/withdraw operations.
function minDepositAmount() external view returns (uint256);
/// @notice The state root for the current block.
function root() external view returns (bytes32);
/// @notice The timestamp for the current block.
function timestamp() external view returns (uint64);
/// @notice Tracks the incrementing onchainTx counter.
function currentOnchainTxId() external view returns (uint64);
/// @notice The onchainTx of the last finalized deposit.
function finalizedOnchainTxId() external view returns (uint64);
/// @notice State root for each block.
function roots(uint64 block) external view returns (bytes32);
/// @notice Timestamp for each block.
function timestamps(uint64 block) external view returns (uint64);
/// @notice Transactions for pending actions.
function transactions(uint64 onchainTx)
external
view
returns (
TransactionVariant action,
TransactionStatus status,
uint64 timestamp,
bytes memory data
);
/// @notice Deposit funds into the vApp, must have already approved the contract as a spender.
/// @param amount The amount of $PROVE to deposit.
/// @return receipt The receipt for the deposit.
function deposit(uint256 amount) external returns (uint64 receipt);
/// @notice Approve and deposit $PROVE in a single call using a permit signature.
/// @dev Assumes $PROVE implements permit (https://eips.ethereum.org/EIPS/eip-2612).
/// @param from The address to spend the $PROVE from. Must correspond to the signer of the permit
/// signature.
/// @param amount The amount of $PROVE to spend for the deposit.
/// @param deadline The deadline for the permit signature.
/// @param v The v component of the permit signature.
/// @param r The r component of the permit signature.
/// @param s The s component of the permit signature.
/// @return receipt The receipt for the deposit.
function permitAndDeposit(
address from,
uint256 amount,
uint256 deadline,
uint8 v,
bytes32 r,
bytes32 s
) external returns (uint64 receipt);
/// @notice Register a newly created prover. Only callable by the staking contract.
/// @param prover The address of the prover.
/// @param owner The address of the prover owner.
/// @param stakerFeeBips The staker fee in basis points.
function createProver(address prover, address owner, uint256 stakerFeeBips)
external
returns (uint64 receipt);
/// @notice Update the state of the vApp.
/// @dev Reverts if the committed actions are invalid.
/// @param publicValues The public values for the state update.
/// @param proofBytes The proof bytes for the state update.
/// @return block The new block number.
/// @return oldRoot The old state root.
/// @return newRoot The new state root.
function step(bytes calldata publicValues, bytes calldata proofBytes)
external
returns (uint64 block, bytes32 oldRoot, bytes32 newRoot);
/// @notice Updates the vapp program verification key, forks the state root.
/// @dev Only callable by the owner, executes a state update. Also increments
/// the block number.
/// @param vkey The new vkey.
/// @param root The new root.
/// @return block The new block number.
/// @return oldRoot The old state root.
/// @return newRoot The new state root.
function fork(bytes32 vkey, bytes32 root)
external
returns (uint64 block, bytes32 oldRoot, bytes32 newRoot);
/// @notice Updates the auctioneer address.
/// @dev Only callable by the owner.
/// @param auctioneer The new auctioneer address.
function updateAuctioneer(address auctioneer) external;
/// @notice Updates the succinct staking contract address.
/// @dev Only callable by the owner.
/// @param staking The new staking contract address.
function updateStaking(address staking) external;
/// @notice Updates the verifier address.
/// @dev Only callable by the owner.
/// @param verifier The new verifier address.
function updateVerifier(address verifier) external;
/// @notice Updates the minimum amount for deposit operations.
/// @dev Only callable by the owner.
/// @param amount The new minimum amount.
function updateMinDepositAmount(uint256 amount) external;
/// @notice Pauses deposit, prover creation, and step.
/// @dev Only callable by the owner.
function pause() external;
/// @notice Unpauses deposit, prover creation, and step.
/// @dev Only callable by the owner.
function unpause() external;
}
// lib/openzeppelin-contracts/contracts/access/Ownable.sol
// OpenZeppelin Contracts (last updated v5.0.0) (access/Ownable.sol)
/**
* @dev Contract module which provides a basic access control mechanism, where
* there is an account (an owner) that can be granted exclusive access to
* specific functions.
*
* The initial owner is set to the address provided by the deployer. This can
* later be changed with {transferOwnership}.
*
* This module is used through inheritance. It will make available the modifier
* `onlyOwner`, which can be applied to your functions to restrict their use to
* the owner.
*/
abstract contract Ownable is Context {
address private _owner;
/**
* @dev The caller account is not authorized to perform an operation.
*/
error OwnableUnauthorizedAccount(address account);
/**
* @dev The owner is not a valid owner account. (eg. `address(0)`)
*/
error OwnableInvalidOwner(address owner);
event OwnershipTransferred(address indexed previousOwner, address indexed newOwner);
/**
* @dev Initializes the contract setting the address provided by the deployer as the initial owner.
*/
constructor(address initialOwner) {
if (initialOwner == address(0)) {
revert OwnableInvalidOwner(address(0));
}
_transferOwnership(initialOwner);
}
/**
* @dev Throws if called by any account other than the owner.
*/
modifier onlyOwner() {
_checkOwner();
_;
}
/**
* @dev Returns the address of the current owner.
*/
function owner() public view virtual returns (address) {
return _owner;
}
/**
* @dev Throws if the sender is not the owner.
*/
function _checkOwner() internal view virtual {
if (owner() != _msgSender()) {
revert OwnableUnauthorizedAccount(_msgSender());
}
}
/**
* @dev Leaves the contract without owner. It will not be possible to call
* `onlyOwner` functions. Can only be called by the current owner.
*
* NOTE: Renouncing ownership will leave the contract without an owner,
* thereby disabling any functionality that is only available to the owner.
*/
function renounceOwnership() public virtual onlyOwner {
_transferOwnership(address(0));
}
/**
* @dev Transfers ownership of the contract to a new account (`newOwner`).
* Can only be called by the current owner.
*/
function transferOwnership(address newOwner) public virtual onlyOwner {
if (newOwner == address(0)) {
revert OwnableInvalidOwner(address(0));
}
_transferOwnership(newOwner);
}
/**
* @dev Transfers ownership of the contract to a new account (`newOwner`).
* Internal function without access restriction.
*/
function _transferOwnership(address newOwner) internal virtual {
address oldOwner = _owner;
_owner = newOwner;
emit OwnershipTransferred(oldOwner, newOwner);
}
}
// lib/openzeppelin-contracts/contracts/utils/ShortStrings.sol
// OpenZeppelin Contracts (last updated v5.1.0) (utils/ShortStrings.sol)
// | string | 0xAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA |
// | length | 0x BB |
type ShortString is bytes32;
/**
* @dev This library provides functions to convert short memory strings
* into a `ShortString` type that can be used as an immutable variable.
*
* Strings of arbitrary length can be optimized using this library if
* they are short enough (up to 31 bytes) by packing them with their
* length (1 byte) in a single EVM word (32 bytes). Additionally, a
* fallback mechanism can be used for every other case.
*
* Usage example:
*
* ```solidity
* contract Named {
* using ShortStrings for *;
*
* ShortString private immutable _name;
* string private _nameFallback;
*
* constructor(string memory contractName) {
* _name = contractName.toShortStringWithFallback(_nameFallback);
* }
*
* function name() external view returns (string memory) {
* return _name.toStringWithFallback(_nameFallback);
* }
* }
* ```
*/
library ShortStrings {
// Used as an identifier for strings longer than 31 bytes.
bytes32 private constant FALLBACK_SENTINEL = 0x00000000000000000000000000000000000000000000000000000000000000FF;
error StringTooLong(string str);
error InvalidShortString();
/**
* @dev Encode a string of at most 31 chars into a `ShortString`.
*
* This will trigger a `StringTooLong` error is the input string is too long.
*/
function toShortString(string memory str) internal pure returns (ShortString) {
bytes memory bstr = bytes(str);
if (bstr.length > 31) {
revert StringTooLong(str);
}
return ShortString.wrap(bytes32(uint256(bytes32(bstr)) | bstr.length));
}
/**
* @dev Decode a `ShortString` back to a "normal" string.
*/
function toString(ShortString sstr) internal pure returns (string memory) {
uint256 len = byteLength(sstr);
// using `new string(len)` would work locally but is not memory safe.
string memory str = new string(32);
assembly ("memory-safe") {
mstore(str, len)
mstore(add(str, 0x20), sstr)
}
return str;
}
/**
* @dev Return the length of a `ShortString`.
*/
function byteLength(ShortString sstr) internal pure returns (uint256) {
uint256 result = uint256(ShortString.unwrap(sstr)) & 0xFF;
if (result > 31) {
revert InvalidShortString();
}
return result;
}
/**
* @dev Encode a string into a `ShortString`, or write it to storage if it is too long.
*/
function toShortStringWithFallback(string memory value, string storage store) internal returns (ShortString) {
if (bytes(value).length < 32) {
return toShortString(value);
} else {
StorageSlot.getStringSlot(store).value = value;
return ShortString.wrap(FALLBACK_SENTINEL);
}
}
/**
* @dev Decode a string that was encoded to `ShortString` or written to storage using {setWithFallback}.
*/
function toStringWithFallback(ShortString value, string storage store) internal pure returns (string memory) {
if (ShortString.unwrap(value) != FALLBACK_SENTINEL) {
return toString(value);
} else {
return store;
}
}
/**
* @dev Return the length of a string that was encoded to `ShortString` or written to storage using
* {setWithFallback}.
*
* WARNING: This will return the "byte length" of the string. This may not reflect the actual length in terms of
* actual characters as the UTF-8 encoding of a single character can span over multiple bytes.
*/
function byteLengthWithFallback(ShortString value, string storage store) internal view returns (uint256) {
if (ShortString.unwrap(value) != FALLBACK_SENTINEL) {
return byteLength(value);
} else {
return bytes(store).length;
}
}
}
// lib/openzeppelin-contracts/contracts/utils/math/SignedMath.sol
// OpenZeppelin Contracts (last updated v5.1.0) (utils/math/SignedMath.sol)
/**
* @dev Standard signed math utilities missing in the Solidity language.
*/
library SignedMath {
/**
* @dev Branchless ternary evaluation for `a ? b : c`. Gas costs are constant.
*
* IMPORTANT: This function may reduce bytecode size and consume less gas when used standalone.
* However, the compiler may optimize Solidity ternary operations (i.e. `a ? b : c`) to only compute
* one branch when needed, making this function more expensive.
*/
function ternary(bool condition, int256 a, int256 b) internal pure returns (int256) {
unchecked {
// branchless ternary works because:
// b ^ (a ^ b) == a
// b ^ 0 == b
return b ^ ((a ^ b) * int256(SafeCast.toUint(condition)));
}
}
/**
* @dev Returns the largest of two signed numbers.
*/
function max(int256 a, int256 b) internal pure returns (int256) {
return ternary(a > b, a, b);
}
/**
* @dev Returns the smallest of two signed numbers.
*/
function min(int256 a, int256 b) internal pure returns (int256) {
return ternary(a < b, a, b);
}
/**
* @dev Returns the average of two signed numbers without overflow.
* The result is rounded towards zero.
*/
function average(int256 a, int256 b) internal pure returns (int256) {
// Formula from the book "Hacker's Delight"
int256 x = (a & b) + ((a ^ b) >> 1);
return x + (int256(uint256(x) >> 255) & (a ^ b));
}
/**
* @dev Returns the absolute unsigned value of a signed value.
*/
function abs(int256 n) internal pure returns (uint256) {
unchecked {
// Formula from the "Bit Twiddling Hacks" by Sean Eron Anderson.
// Since `n` is a signed integer, the generated bytecode will use the SAR opcode to perform the right shift,
// taking advantage of the most significant (or "sign" bit) in two's complement representation.
// This opcode adds new most significant bits set to the value of the previous most significant bit. As a result,
// the mask will either be `bytes32(0)` (if n is positive) or `~bytes32(0)` (if n is negative).
int256 mask = n >> 255;
// A `bytes32(0)` mask leaves the input unchanged, while a `~bytes32(0)` mask complements it.
return uint256((n + mask) ^ mask);
}
}
}
// lib/openzeppelin-contracts/contracts/interfaces/IERC4626.sol
// OpenZeppelin Contracts (last updated v5.1.0) (interfaces/IERC4626.sol)
/**
* @dev Interface of the ERC-4626 "Tokenized Vault Standard", as defined in
* https://eips.ethereum.org/EIPS/eip-4626[ERC-4626].
*/
interface IERC4626 is IERC20, IERC20Metadata {
event Deposit(address indexed sender, address indexed owner, uint256 assets, uint256 shares);
event Withdraw(
address indexed sender,
address indexed receiver,
address indexed owner,
uint256 assets,
uint256 shares
);
/**
* @dev Returns the address of the underlying token used for the Vault for accounting, depositing, and withdrawing.
*
* - MUST be an ERC-20 token contract.
* - MUST NOT revert.
*/
function asset() external view returns (address assetTokenAddress);
/**
* @dev Returns the total amount of the underlying asset that is “managed” by Vault.
*
* - SHOULD include any compounding that occurs from yield.
* - MUST be inclusive of any fees that are charged against assets in the Vault.
* - MUST NOT revert.
*/
function totalAssets() external view returns (uint256 totalManagedAssets);
/**
* @dev Returns the amount of shares that the Vault would exchange for the amount of assets provided, in an ideal
* scenario where all the conditions are met.
*
* - MUST NOT be inclusive of any fees that are charged against assets in the Vault.
* - MUST NOT show any variations depending on the caller.
* - MUST NOT reflect slippage or other on-chain conditions, when performing the actual exchange.
* - MUST NOT revert.
*
* NOTE: This calculation MAY NOT reflect the “per-user” price-per-share, and instead should reflect the
* “average-user’s” price-per-share, meaning what the average user should expect to see when exchanging to and
* from.
*/
function convertToShares(uint256 assets) external view returns (uint256 shares);
/**
* @dev Returns the amount of assets that the Vault would exchange for the amount of shares provided, in an ideal
* scenario where all the conditions are met.
*
* - MUST NOT be inclusive of any fees that are charged against assets in the Vault.
* - MUST NOT show any variations depending on the caller.
* - MUST NOT reflect slippage or other on-chain conditions, when performing the actual exchange.
* - MUST NOT revert.
*
* NOTE: This calculation MAY NOT reflect the “per-user” price-per-share, and instead should reflect the
* “average-user’s” price-per-share, meaning what the average user should expect to see when exchanging to and
* from.
*/
function convertToAssets(uint256 shares) external view returns (uint256 assets);
/**
* @dev Returns the maximum amount of the underlying asset that can be deposited into the Vault for the receiver,
* through a deposit call.
*
* - MUST return a limited value if receiver is subject to some deposit limit.
* - MUST return 2 ** 256 - 1 if there is no limit on the maximum amount of assets that may be deposited.
* - MUST NOT revert.
*/
function maxDeposit(address receiver) external view returns (uint256 maxAssets);
/**
* @dev Allows an on-chain or off-chain user to simulate the effects of their deposit at the current block, given
* current on-chain conditions.
*
* - MUST return as close to and no more than the exact amount of Vault shares that would be minted in a deposit
* call in the same transaction. I.e. deposit should return the same or more shares as previewDeposit if called
* in the same transaction.
* - MUST NOT account for deposit limits like those returned from maxDeposit and should always act as though the
* deposit would be accepted, regardless if the user has enough tokens approved, etc.
* - MUST be inclusive of deposit fees. Integrators should be aware of the existence of deposit fees.
* - MUST NOT revert.
*
* NOTE: any unfavorable discrepancy between convertToShares and previewDeposit SHOULD be considered slippage in
* share price or some other type of condition, meaning the depositor will lose assets by depositing.
*/
function previewDeposit(uint256 assets) external view returns (uint256 shares);
/**
* @dev Mints shares Vault shares to receiver by depositing exactly amount of underlying tokens.
*
* - MUST emit the Deposit event.
* - MAY support an additional flow in which the underlying tokens are owned by the Vault contract before the
* deposit execution, and are accounted for during deposit.
* - MUST revert if all of assets cannot be deposited (due to deposit limit being reached, slippage, the user not
* approving enough underlying tokens to the Vault contract, etc).
*
* NOTE: most implementations will require pre-approval of the Vault with the Vault’s underlying asset token.
*/
function deposit(uint256 assets, address receiver) external returns (uint256 shares);
/**
* @dev Returns the maximum amount of the Vault shares that can be minted for the receiver, through a mint call.
* - MUST return a limited value if receiver is subject to some mint limit.
* - MUST return 2 ** 256 - 1 if there is no limit on the maximum amount of shares that may be minted.
* - MUST NOT revert.
*/
function maxMint(address receiver) external view returns (uint256 maxShares);
/**
* @dev Allows an on-chain or off-chain user to simulate the effects of their mint at the current block, given
* current on-chain conditions.
*
* - MUST return as close to and no fewer than the exact amount of assets that would be deposited in a mint call
* in the same transaction. I.e. mint should return the same or fewer assets as previewMint if called in the
* same transaction.
* - MUST NOT account for mint limits like those returned from maxMint and should always act as though the mint
* would be accepted, regardless if the user has enough tokens approved, etc.
* - MUST be inclusive of deposit fees. Integrators should be aware of the existence of deposit fees.
* - MUST NOT revert.
*
* NOTE: any unfavorable discrepancy between convertToAssets and previewMint SHOULD be considered slippage in
* share price or some other type of condition, meaning the depositor will lose assets by minting.
*/
function previewMint(uint256 shares) external view returns (uint256 assets);
/**
* @dev Mints exactly shares Vault shares to receiver by depositing amount of underlying tokens.
*
* - MUST emit the Deposit event.
* - MAY support an additional flow in which the underlying tokens are owned by the Vault contract before the mint
* execution, and are accounted for during mint.
* - MUST revert if all of shares cannot be minted (due to deposit limit being reached, slippage, the user not
* approving enough underlying tokens to the Vault contract, etc).
*
* NOTE: most implementations will require pre-approval of the Vault with the Vault’s underlying asset token.
*/
function mint(uint256 shares, address receiver) external returns (uint256 assets);
/**
* @dev Returns the maximum amount of the underlying asset that can be withdrawn from the owner balance in the
* Vault, through a withdraw call.
*
* - MUST return a limited value if owner is subject to some withdrawal limit or timelock.
* - MUST NOT revert.
*/
function maxWithdraw(address owner) external view returns (uint256 maxAssets);
/**
* @dev Allows an on-chain or off-chain user to simulate the effects of their withdrawal at the current block,
* given current on-chain conditions.
*
* - MUST return as close to and no fewer than the exact amount of Vault shares that would be burned in a withdraw
* call in the same transaction. I.e. withdraw should return the same or fewer shares as previewWithdraw if
* called
* in the same transaction.
* - MUST NOT account for withdrawal limits like those returned from maxWithdraw and should always act as though
* the withdrawal would be accepted, regardless if the user has enough shares, etc.
* - MUST be inclusive of withdrawal fees. Integrators should be aware of the existence of withdrawal fees.
* - MUST NOT revert.
*
* NOTE: any unfavorable discrepancy between convertToShares and previewWithdraw SHOULD be considered slippage in
* share price or some other type of condition, meaning the depositor will lose assets by depositing.
*/
function previewWithdraw(uint256 assets) external view returns (uint256 shares);
/**
* @dev Burns shares from owner and sends exactly assets of underlying tokens to receiver.
*
* - MUST emit the Withdraw event.
* - MAY support an additional flow in which the underlying tokens are owned by the Vault contract before the
* withdraw execution, and are accounted for during withdraw.
* - MUST revert if all of assets cannot be withdrawn (due to withdrawal limit being reached, slippage, the owner
* not having enough shares, etc).
*
* Note that some implementations will require pre-requesting to the Vault before a withdrawal may be performed.
* Those methods should be performed separately.
*/
function withdraw(uint256 assets, address receiver, address owner) external returns (uint256 shares);
/**
* @dev Returns the maximum amount of Vault shares that can be redeemed from the owner balance in the Vault,
* through a redeem call.
*
* - MUST return a limited value if owner is subject to some withdrawal limit or timelock.
* - MUST return balanceOf(owner) if owner is not subject to any withdrawal limit or timelock.
* - MUST NOT revert.
*/
function maxRedeem(address owner) external view returns (uint256 maxShares);
/**
* @dev Allows an on-chain or off-chain user to simulate the effects of their redeemption at the current block,
* given current on-chain conditions.
*
* - MUST return as close to and no more than the exact amount of assets that would be withdrawn in a redeem call
* in the same transaction. I.e. redeem should return the same or more assets as previewRedeem if called in the
* same transaction.
* - MUST NOT account for redemption limits like those returned from maxRedeem and should always act as though the
* redemption would be accepted, regardless if the user has enough shares, etc.
* - MUST be inclusive of withdrawal fees. Integrators should be aware of the existence of withdrawal fees.
* - MUST NOT revert.
*
* NOTE: any unfavorable discrepancy between convertToAssets and previewRedeem SHOULD be considered slippage in
* share price or some other type of condition, meaning the depositor will lose assets by redeeming.
*/
function previewRedeem(uint256 shares) external view returns (uint256 assets);
/**
* @dev Burns exactly shares from owner and sends assets of underlying tokens to receiver.
*
* - MUST emit the Withdraw event.
* - MAY support an additional flow in which the underlying tokens are owned by the Vault contract before the
* redeem execution, and are accounted for during redeem.
* - MUST revert if all of shares cannot be redeemed (due to withdrawal limit being reached, slippage, the owner
* not having enough shares, etc).
*
* NOTE: some implementations will require pre-requesting to the Vault before a withdrawal may be performed.
* Those methods should be performed separately.
*/
function redeem(uint256 shares, address receiver, address owner) external returns (uint256 assets);
}
// lib/openzeppelin-contracts/contracts/interfaces/IERC5805.sol
// OpenZeppelin Contracts (last updated v5.0.0) (interfaces/IERC5805.sol)
interface IERC5805 is IERC6372, IVotes {}
// lib/openzeppelin-contracts/contracts/utils/math/Math.sol
// OpenZeppelin Contracts (last updated v5.1.0) (utils/math/Math.sol)
/**
* @dev Standard math utilities missing in the Solidity language.
*/
library Math {
enum Rounding {
Floor, // Toward negative infinity
Ceil, // Toward positive infinity
Trunc, // Toward zero
Expand // Away from zero
}
/**
* @dev 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;
}
}
// lib/openzeppelin-contracts/contracts/utils/structs/Checkpoints.sol
// OpenZeppelin Contracts (last updated v5.1.0) (utils/structs/Checkpoints.sol)
// This file was procedurally generated from scripts/generate/templates/Checkpoints.js.
/**
* @dev This library defines the `Trace*` struct, for checkpointing values as they change at different points in
* time, and later looking up past values by block number. See {Votes} as an example.
*
* To create a history of checkpoints define a variable type `Checkpoints.Trace*` in your contract, and store a new
* checkpoint for the current transaction block using the {push} function.
*/
library Checkpoints {
/**
* @dev A value was attempted to be inserted on a past checkpoint.
*/
error CheckpointUnorderedInsertion();
struct Trace224 {
Checkpoint224[] _checkpoints;
}
struct Checkpoint224 {
uint32 _key;
uint224 _value;
}
/**
* @dev Pushes a (`key`, `value`) pair into a Trace224 so that it is stored as the checkpoint.
*
* Returns previous value and new value.
*
* IMPORTANT: Never accept `key` as a user input, since an arbitrary `type(uint32).max` key set will disable the
* library.
*/
function push(
Trace224 storage self,
uint32 key,
uint224 value
) internal returns (uint224 oldValue, uint224 newValue) {
return _insert(self._checkpoints, key, value);
}
/**
* @dev Returns the value in the first (oldest) checkpoint with key greater or equal than the search key, or zero if
* there is none.
*/
function lowerLookup(Trace224 storage self, uint32 key) internal view returns (uint224) {
uint256 len = self._checkpoints.length;
uint256 pos = _lowerBinaryLookup(self._checkpoints, key, 0, len);
return pos == len ? 0 : _unsafeAccess(self._checkpoints, pos)._value;
}
/**
* @dev Returns the value in the last (most recent) checkpoint with key lower or equal than the search key, or zero
* if there is none.
*/
function upperLookup(Trace224 storage self, uint32 key) internal view returns (uint224) {
uint256 len = self._checkpoints.length;
uint256 pos = _upperBinaryLookup(self._checkpoints, key, 0, len);
return pos == 0 ? 0 : _unsafeAccess(self._checkpoints, pos - 1)._value;
}
/**
* @dev Returns the value in the last (most recent) checkpoint with key lower or equal than the search key, or zero
* if there is none.
*
* NOTE: This is a variant of {upperLookup} that is optimised to find "recent" checkpoint (checkpoints with high
* keys).
*/
function upperLookupRecent(Trace224 storage self, uint32 key) internal view returns (uint224) {
uint256 len = self._checkpoints.length;
uint256 low = 0;
uint256 high = len;
if (len > 5) {
uint256 mid = len - Math.sqrt(len);
if (key < _unsafeAccess(self._checkpoints, mid)._key) {
high = mid;
} else {
low = mid + 1;
}
}
uint256 pos = _upperBinaryLookup(self._checkpoints, key, low, high);
return pos == 0 ? 0 : _unsafeAccess(self._checkpoints, pos - 1)._value;
}
/**
* @dev Returns the value in the most recent checkpoint, or zero if there are no checkpoints.
*/
function latest(Trace224 storage self) internal view returns (uint224) {
uint256 pos = self._checkpoints.length;
return pos == 0 ? 0 : _unsafeAccess(self._checkpoints, pos - 1)._value;
}
/**
* @dev Returns whether there is a checkpoint in the structure (i.e. it is not empty), and if so the key and value
* in the most recent checkpoint.
*/
function latestCheckpoint(Trace224 storage self) internal view returns (bool exists, uint32 _key, uint224 _value) {
uint256 pos = self._checkpoints.length;
if (pos == 0) {
return (false, 0, 0);
} else {
Checkpoint224 storage ckpt = _unsafeAccess(self._checkpoints, pos - 1);
return (true, ckpt._key, ckpt._value);
}
}
/**
* @dev Returns the number of checkpoint.
*/
function length(Trace224 storage self) internal view returns (uint256) {
return self._checkpoints.length;
}
/**
* @dev Returns checkpoint at given position.
*/
function at(Trace224 storage self, uint32 pos) internal view returns (Checkpoint224 memory) {
return self._checkpoints[pos];
}
/**
* @dev Pushes a (`key`, `value`) pair into an ordered list of checkpoints, either by inserting a new checkpoint,
* or by updating the last one.
*/
function _insert(
Checkpoint224[] storage self,
uint32 key,
uint224 value
) private returns (uint224 oldValue, uint224 newValue) {
uint256 pos = self.length;
if (pos > 0) {
Checkpoint224 storage last = _unsafeAccess(self, pos - 1);
uint32 lastKey = last._key;
uint224 lastValue = last._value;
// Checkpoint keys must be non-decreasing.
if (lastKey > key) {
revert CheckpointUnorderedInsertion();
}
// Update or push new checkpoint
if (lastKey == key) {
last._value = value;
} else {
self.push(Checkpoint224({_key: key, _value: value}));
}
return (lastValue, value);
} else {
self.push(Checkpoint224({_key: key, _value: value}));
return (0, value);
}
}
/**
* @dev Return the index of the first (oldest) checkpoint with key strictly bigger than the search key, or `high`
* if there is none. `low` and `high` define a section where to do the search, with inclusive `low` and exclusive
* `high`.
*
* WARNING: `high` should not be greater than the array's length.
*/
function _upperBinaryLookup(
Checkpoint224[] storage self,
uint32 key,
uint256 low,
uint256 high
) private view returns (uint256) {
while (low < high) {
uint256 mid = Math.average(low, high);
if (_unsafeAccess(self, mid)._key > key) {
high = mid;
} else {
low = mid + 1;
}
}
return high;
}
/**
* @dev Return the index of the first (oldest) checkpoint with key greater or equal than the search key, or `high`
* if there is none. `low` and `high` define a section where to do the search, with inclusive `low` and exclusive
* `high`.
*
* WARNING: `high` should not be greater than the array's length.
*/
function _lowerBinaryLookup(
Checkpoint224[] storage self,
uint32 key,
uint256 low,
uint256 high
) private view returns (uint256) {
while (low < high) {
uint256 mid = Math.average(low, high);
if (_unsafeAccess(self, mid)._key < key) {
low = mid + 1;
} else {
high = mid;
}
}
return high;
}
/**
* @dev Access an element of the array without performing bounds check. The position is assumed to be within bounds.
*/
function _unsafeAccess(
Checkpoint224[] storage self,
uint256 pos
) private pure returns (Checkpoint224 storage result) {
assembly {
mstore(0, self.slot)
result.slot := add(keccak256(0, 0x20), pos)
}
}
struct Trace208 {
Checkpoint208[] _checkpoints;
}
struct Checkpoint208 {
uint48 _key;
uint208 _value;
}
/**
* @dev Pushes a (`key`, `value`) pair into a Trace208 so that it is stored as the checkpoint.
*
* Returns previous value and new value.
*
* IMPORTANT: Never accept `key` as a user input, since an arbitrary `type(uint48).max` key set will disable the
* library.
*/
function push(
Trace208 storage self,
uint48 key,
uint208 value
) internal returns (uint208 oldValue, uint208 newValue) {
return _insert(self._checkpoints, key, value);
}
/**
* @dev Returns the value in the first (oldest) checkpoint with key greater or equal than the search key, or zero if
* there is none.
*/
function lowerLookup(Trace208 storage self, uint48 key) internal view returns (uint208) {
uint256 len = self._checkpoints.length;
uint256 pos = _lowerBinaryLookup(self._checkpoints, key, 0, len);
return pos == len ? 0 : _unsafeAccess(self._checkpoints, pos)._value;
}
/**
* @dev Returns the value in the last (most recent) checkpoint with key lower or equal than the search key, or zero
* if there is none.
*/
function upperLookup(Trace208 storage self, uint48 key) internal view returns (uint208) {
uint256 len = self._checkpoints.length;
uint256 pos = _upperBinaryLookup(self._checkpoints, key, 0, len);
return pos == 0 ? 0 : _unsafeAccess(self._checkpoints, pos - 1)._value;
}
/**
* @dev Returns the value in the last (most recent) checkpoint with key lower or equal than the search key, or zero
* if there is none.
*
* NOTE: This is a variant of {upperLookup} that is optimised to find "recent" checkpoint (checkpoints with high
* keys).
*/
function upperLookupRecent(Trace208 storage self, uint48 key) internal view returns (uint208) {
uint256 len = self._checkpoints.length;
uint256 low = 0;
uint256 high = len;
if (len > 5) {
uint256 mid = len - Math.sqrt(len);
if (key < _unsafeAccess(self._checkpoints, mid)._key) {
high = mid;
} else {
low = mid + 1;
}
}
uint256 pos = _upperBinaryLookup(self._checkpoints, key, low, high);
return pos == 0 ? 0 : _unsafeAccess(self._checkpoints, pos - 1)._value;
}
/**
* @dev Returns the value in the most recent checkpoint, or zero if there are no checkpoints.
*/
function latest(Trace208 storage self) internal view returns (uint208) {
uint256 pos = self._checkpoints.length;
return pos == 0 ? 0 : _unsafeAccess(self._checkpoints, pos - 1)._value;
}
/**
* @dev Returns whether there is a checkpoint in the structure (i.e. it is not empty), and if so the key and value
* in the most recent checkpoint.
*/
function latestCheckpoint(Trace208 storage self) internal view returns (bool exists, uint48 _key, uint208 _value) {
uint256 pos = self._checkpoints.length;
if (pos == 0) {
return (false, 0, 0);
} else {
Checkpoint208 storage ckpt = _unsafeAccess(self._checkpoints, pos - 1);
return (true, ckpt._key, ckpt._value);
}
}
/**
* @dev Returns the number of checkpoint.
*/
function length(Trace208 storage self) internal view returns (uint256) {
return self._checkpoints.length;
}
/**
* @dev Returns checkpoint at given position.
*/
function at(Trace208 storage self, uint32 pos) internal view returns (Checkpoint208 memory) {
return self._checkpoints[pos];
}
/**
* @dev Pushes a (`key`, `value`) pair into an ordered list of checkpoints, either by inserting a new checkpoint,
* or by updating the last one.
*/
function _insert(
Checkpoint208[] storage self,
uint48 key,
uint208 value
) private returns (uint208 oldValue, uint208 newValue) {
uint256 pos = self.length;
if (pos > 0) {
Checkpoint208 storage last = _unsafeAccess(self, pos - 1);
uint48 lastKey = last._key;
uint208 lastValue = last._value;
// Checkpoint keys must be non-decreasing.
if (lastKey > key) {
revert CheckpointUnorderedInsertion();
}
// Update or push new checkpoint
if (lastKey == key) {
last._value = value;
} else {
self.push(Checkpoint208({_key: key, _value: value}));
}
return (lastValue, value);
} else {
self.push(Checkpoint208({_key: key, _value: value}));
return (0, value);
}
}
/**
* @dev Return the index of the first (oldest) checkpoint with key strictly bigger than the search key, or `high`
* if there is none. `low` and `high` define a section where to do the search, with inclusive `low` and exclusive
* `high`.
*
* WARNING: `high` should not be greater than the array's length.
*/
function _upperBinaryLookup(
Checkpoint208[] storage self,
uint48 key,
uint256 low,
uint256 high
) private view returns (uint256) {
while (low < high) {
uint256 mid = Math.average(low, high);
if (_unsafeAccess(self, mid)._key > key) {
high = mid;
} else {
low = mid + 1;
}
}
return high;
}
/**
* @dev Return the index of the first (oldest) checkpoint with key greater or equal than the search key, or `high`
* if there is none. `low` and `high` define a section where to do the search, with inclusive `low` and exclusive
* `high`.
*
* WARNING: `high` should not be greater than the array's length.
*/
function _lowerBinaryLookup(
Checkpoint208[] storage self,
uint48 key,
uint256 low,
uint256 high
) private view returns (uint256) {
while (low < high) {
uint256 mid = Math.average(low, high);
if (_unsafeAccess(self, mid)._key < key) {
low = mid + 1;
} else {
high = mid;
}
}
return high;
}
/**
* @dev Access an element of the array without performing bounds check. The position is assumed to be within bounds.
*/
function _unsafeAccess(
Checkpoint208[] storage self,
uint256 pos
) private pure returns (Checkpoint208 storage result) {
assembly {
mstore(0, self.slot)
result.slot := add(keccak256(0, 0x20), pos)
}
}
struct Trace160 {
Checkpoint160[] _checkpoints;
}
struct Checkpoint160 {
uint96 _key;
uint160 _value;
}
/**
* @dev Pushes a (`key`, `value`) pair into a Trace160 so that it is stored as the checkpoint.
*
* Returns previous value and new value.
*
* IMPORTANT: Never accept `key` as a user input, since an arbitrary `type(uint96).max` key set will disable the
* library.
*/
function push(
Trace160 storage self,
uint96 key,
uint160 value
) internal returns (uint160 oldValue, uint160 newValue) {
return _insert(self._checkpoints, key, value);
}
/**
* @dev Returns the value in the first (oldest) checkpoint with key greater or equal than the search key, or zero if
* there is none.
*/
function lowerLookup(Trace160 storage self, uint96 key) internal view returns (uint160) {
uint256 len = self._checkpoints.length;
uint256 pos = _lowerBinaryLookup(self._checkpoints, key, 0, len);
return pos == len ? 0 : _unsafeAccess(self._checkpoints, pos)._value;
}
/**
* @dev Returns the value in the last (most recent) checkpoint with key lower or equal than the search key, or zero
* if there is none.
*/
function upperLookup(Trace160 storage self, uint96 key) internal view returns (uint160) {
uint256 len = self._checkpoints.length;
uint256 pos = _upperBinaryLookup(self._checkpoints, key, 0, len);
return pos == 0 ? 0 : _unsafeAccess(self._checkpoints, pos - 1)._value;
}
/**
* @dev Returns the value in the last (most recent) checkpoint with key lower or equal than the search key, or zero
* if there is none.
*
* NOTE: This is a variant of {upperLookup} that is optimised to find "recent" checkpoint (checkpoints with high
* keys).
*/
function upperLookupRecent(Trace160 storage self, uint96 key) internal view returns (uint160) {
uint256 len = self._checkpoints.length;
uint256 low = 0;
uint256 high = len;
if (len > 5) {
uint256 mid = len - Math.sqrt(len);
if (key < _unsafeAccess(self._checkpoints, mid)._key) {
high = mid;
} else {
low = mid + 1;
}
}
uint256 pos = _upperBinaryLookup(self._checkpoints, key, low, high);
return pos == 0 ? 0 : _unsafeAccess(self._checkpoints, pos - 1)._value;
}
/**
* @dev Returns the value in the most recent checkpoint, or zero if there are no checkpoints.
*/
function latest(Trace160 storage self) internal view returns (uint160) {
uint256 pos = self._checkpoints.length;
return pos == 0 ? 0 : _unsafeAccess(self._checkpoints, pos - 1)._value;
}
/**
* @dev Returns whether there is a checkpoint in the structure (i.e. it is not empty), and if so the key and value
* in the most recent checkpoint.
*/
function latestCheckpoint(Trace160 storage self) internal view returns (bool exists, uint96 _key, uint160 _value) {
uint256 pos = self._checkpoints.length;
if (pos == 0) {
return (false, 0, 0);
} else {
Checkpoint160 storage ckpt = _unsafeAccess(self._checkpoints, pos - 1);
return (true, ckpt._key, ckpt._value);
}
}
/**
* @dev Returns the number of checkpoint.
*/
function length(Trace160 storage self) internal view returns (uint256) {
return self._checkpoints.length;
}
/**
* @dev Returns checkpoint at given position.
*/
function at(Trace160 storage self, uint32 pos) internal view returns (Checkpoint160 memory) {
return self._checkpoints[pos];
}
/**
* @dev Pushes a (`key`, `value`) pair into an ordered list of checkpoints, either by inserting a new checkpoint,
* or by updating the last one.
*/
function _insert(
Checkpoint160[] storage self,
uint96 key,
uint160 value
) private returns (uint160 oldValue, uint160 newValue) {
uint256 pos = self.length;
if (pos > 0) {
Checkpoint160 storage last = _unsafeAccess(self, pos - 1);
uint96 lastKey = last._key;
uint160 lastValue = last._value;
// Checkpoint keys must be non-decreasing.
if (lastKey > key) {
revert CheckpointUnorderedInsertion();
}
// Update or push new checkpoint
if (lastKey == key) {
last._value = value;
} else {
self.push(Checkpoint160({_key: key, _value: value}));
}
return (lastValue, value);
} else {
self.push(Checkpoint160({_key: key, _value: value}));
return (0, value);
}
}
/**
* @dev Return the index of the first (oldest) checkpoint with key strictly bigger than the search key, or `high`
* if there is none. `low` and `high` define a section where to do the search, with inclusive `low` and exclusive
* `high`.
*
* WARNING: `high` should not be greater than the array's length.
*/
function _upperBinaryLookup(
Checkpoint160[] storage self,
uint96 key,
uint256 low,
uint256 high
) private view returns (uint256) {
while (low < high) {
uint256 mid = Math.average(low, high);
if (_unsafeAccess(self, mid)._key > key) {
high = mid;
} else {
low = mid + 1;
}
}
return high;
}
/**
* @dev Return the index of the first (oldest) checkpoint with key greater or equal than the search key, or `high`
* if there is none. `low` and `high` define a section where to do the search, with inclusive `low` and exclusive
* `high`.
*
* WARNING: `high` should not be greater than the array's length.
*/
function _lowerBinaryLookup(
Checkpoint160[] storage self,
uint96 key,
uint256 low,
uint256 high
) private view returns (uint256) {
while (low < high) {
uint256 mid = Math.average(low, high);
if (_unsafeAccess(self, mid)._key < key) {
low = mid + 1;
} else {
high = mid;
}
}
return high;
}
/**
* @dev Access an element of the array without performing bounds check. The position is assumed to be within bounds.
*/
function _unsafeAccess(
Checkpoint160[] storage self,
uint256 pos
) private pure returns (Checkpoint160 storage result) {
assembly {
mstore(0, self.slot)
result.slot := add(keccak256(0, 0x20), pos)
}
}
}
// lib/openzeppelin-contracts/contracts/governance/IGovernor.sol
// OpenZeppelin Contracts (last updated v5.1.0) (governance/IGovernor.sol)
/**
* @dev Interface of the {Governor} core.
*
* NOTE: Event parameters lack the `indexed` keyword for compatibility with GovernorBravo events.
* Making event parameters `indexed` affects how events are decoded, potentially breaking existing indexers.
*/
interface IGovernor is IERC165, IERC6372 {
enum ProposalState {
Pending,
Active,
Canceled,
Defeated,
Succeeded,
Queued,
Expired,
Executed
}
/**
* @dev Empty proposal or a mismatch between the parameters length for a proposal call.
*/
error GovernorInvalidProposalLength(uint256 targets, uint256 calldatas, uint256 values);
/**
* @dev The vote was already cast.
*/
error GovernorAlreadyCastVote(address voter);
/**
* @dev Token deposits are disabled in this contract.
*/
error GovernorDisabledDeposit();
/**
* @dev The `account` is not a proposer.
*/
error GovernorOnlyProposer(address account);
/**
* @dev The `account` is not the governance executor.
*/
error GovernorOnlyExecutor(address account);
/**
* @dev The `proposalId` doesn't exist.
*/
error GovernorNonexistentProposal(uint256 proposalId);
/**
* @dev The current state of a proposal is not the required for performing an operation.
* The `expectedStates` is a bitmap with the bits enabled for each ProposalState enum position
* counting from right to left.
*
* NOTE: If `expectedState` is `bytes32(0)`, the proposal is expected to not be in any state (i.e. not exist).
* This is the case when a proposal that is expected to be unset is already initiated (the proposal is duplicated).
*
* See {Governor-_encodeStateBitmap}.
*/
error GovernorUnexpectedProposalState(uint256 proposalId, ProposalState current, bytes32 expectedStates);
/**
* @dev The voting period set is not a valid period.
*/
error GovernorInvalidVotingPeriod(uint256 votingPeriod);
/**
* @dev The `proposer` does not have the required votes to create a proposal.
*/
error GovernorInsufficientProposerVotes(address proposer, uint256 votes, uint256 threshold);
/**
* @dev The `proposer` is not allowed to create a proposal.
*/
error GovernorRestrictedProposer(address proposer);
/**
* @dev The vote type used is not valid for the corresponding counting module.
*/
error GovernorInvalidVoteType();
/**
* @dev The provided params buffer is not supported by the counting module.
*/
error GovernorInvalidVoteParams();
/**
* @dev Queue operation is not implemented for this governor. Execute should be called directly.
*/
error GovernorQueueNotImplemented();
/**
* @dev The proposal hasn't been queued yet.
*/
error GovernorNotQueuedProposal(uint256 proposalId);
/**
* @dev The proposal has already been queued.
*/
error GovernorAlreadyQueuedProposal(uint256 proposalId);
/**
* @dev The provided signature is not valid for the expected `voter`.
* If the `voter` is a contract, the signature is not valid using {IERC1271-isValidSignature}.
*/
error GovernorInvalidSignature(address voter);
/**
* @dev Emitted when a proposal is created.
*/
event ProposalCreated(
uint256 proposalId,
address proposer,
address[] targets,
uint256[] values,
string[] signatures,
bytes[] calldatas,
uint256 voteStart,
uint256 voteEnd,
string description
);
/**
* @dev Emitted when a proposal is queued.
*/
event ProposalQueued(uint256 proposalId, uint256 etaSeconds);
/**
* @dev Emitted when a proposal is executed.
*/
event ProposalExecuted(uint256 proposalId);
/**
* @dev Emitted when a proposal is canceled.
*/
event ProposalCanceled(uint256 proposalId);
/**
* @dev Emitted when a vote is cast without params.
*
* Note: `support` values should be seen as buckets. Their interpretation depends on the voting module used.
*/
event VoteCast(address indexed voter, uint256 proposalId, uint8 support, uint256 weight, string reason);
/**
* @dev Emitted when a vote is cast with params.
*
* Note: `support` values should be seen as buckets. Their interpretation depends on the voting module used.
* `params` are additional encoded parameters. Their interpretation also depends on the voting module used.
*/
event VoteCastWithParams(
address indexed voter,
uint256 proposalId,
uint8 support,
uint256 weight,
string reason,
bytes params
);
/**
* @notice module:core
* @dev Name of the governor instance (used in building the EIP-712 domain separator).
*/
function name() external view returns (string memory);
/**
* @notice module:core
* @dev Version of the governor instance (used in building the EIP-712 domain separator). Default: "1"
*/
function version() external view returns (string memory);
/**
* @notice module:voting
* @dev A description of the possible `support` values for {castVote} and the way these votes are counted, meant to
* be consumed by UIs to show correct vote options and interpret the results. The string is a URL-encoded sequence of
* key-value pairs that each describe one aspect, for example `support=bravo&quorum=for,abstain`.
*
* There are 2 standard keys: `support` and `quorum`.
*
* - `support=bravo` refers to the vote options 0 = Against, 1 = For, 2 = Abstain, as in `GovernorBravo`.
* - `quorum=bravo` means that only For votes are counted towards quorum.
* - `quorum=for,abstain` means that both For and Abstain votes are counted towards quorum.
*
* If a counting module makes use of encoded `params`, it should include this under a `params` key with a unique
* name that describes the behavior. For example:
*
* - `params=fractional` might refer to a scheme where votes are divided fractionally between for/against/abstain.
* - `params=erc721` might refer to a scheme where specific NFTs are delegated to vote.
*
* NOTE: The string can be decoded by the standard
* https://developer.mozilla.org/en-US/docs/Web/API/URLSearchParams[`URLSearchParams`]
* JavaScript class.
*/
// solhint-disable-next-line func-name-mixedcase
function COUNTING_MODE() external view returns (string memory);
/**
* @notice module:core
* @dev Hashing function used to (re)build the proposal id from the proposal details..
*/
function hashProposal(
address[] memory targets,
uint256[] memory values,
bytes[] memory calldatas,
bytes32 descriptionHash
) external pure returns (uint256);
/**
* @notice module:core
* @dev Current state of a proposal, following Compound's convention
*/
function state(uint256 proposalId) external view returns (ProposalState);
/**
* @notice module:core
* @dev The number of votes required in order for a voter to become a proposer.
*/
function proposalThreshold() external view returns (uint256);
/**
* @notice module:core
* @dev Timepoint used to retrieve user's votes and quorum. If using block number (as per Compound's Comp), the
* snapshot is performed at the end of this block. Hence, voting for this proposal starts at the beginning of the
* following block.
*/
function proposalSnapshot(uint256 proposalId) external view returns (uint256);
/**
* @notice module:core
* @dev Timepoint at which votes close. If using block number, votes close at the end of this block, so it is
* possible to cast a vote during this block.
*/
function proposalDeadline(uint256 proposalId) external view returns (uint256);
/**
* @notice module:core
* @dev The account that created a proposal.
*/
function proposalProposer(uint256 proposalId) external view returns (address);
/**
* @notice module:core
* @dev The time when a queued proposal becomes executable ("ETA"). Unlike {proposalSnapshot} and
* {proposalDeadline}, this doesn't use the governor clock, and instead relies on the executor's clock which may be
* different. In most cases this will be a timestamp.
*/
function proposalEta(uint256 proposalId) external view returns (uint256);
/**
* @notice module:core
* @dev Whether a proposal needs to be queued before execution.
*/
function proposalNeedsQueuing(uint256 proposalId) external view returns (bool);
/**
* @notice module:user-config
* @dev Delay, between the proposal is created and the vote starts. The unit this duration is expressed in depends
* on the clock (see ERC-6372) this contract uses.
*
* This can be increased to leave time for users to buy voting power, or delegate it, before the voting of a
* proposal starts.
*
* NOTE: While this interface returns a uint256, timepoints are stored as uint48 following the ERC-6372 clock type.
* Consequently this value must fit in a uint48 (when added to the current clock). See {IERC6372-clock}.
*/
function votingDelay() external view returns (uint256);
/**
* @notice module:user-config
* @dev Delay between the vote start and vote end. The unit this duration is expressed in depends on the clock
* (see ERC-6372) this contract uses.
*
* NOTE: The {votingDelay} can delay the start of the vote. This must be considered when setting the voting
* duration compared to the voting delay.
*
* NOTE: This value is stored when the proposal is submitted so that possible changes to the value do not affect
* proposals that have already been submitted. The type used to save it is a uint32. Consequently, while this
* interface returns a uint256, the value it returns should fit in a uint32.
*/
function votingPeriod() external view returns (uint256);
/**
* @notice module:user-config
* @dev Minimum number of cast voted required for a proposal to be successful.
*
* NOTE: The `timepoint` parameter corresponds to the snapshot used for counting vote. This allows to scale the
* quorum depending on values such as the totalSupply of a token at this timepoint (see {ERC20Votes}).
*/
function quorum(uint256 timepoint) external view returns (uint256);
/**
* @notice module:reputation
* @dev Voting power of an `account` at a specific `timepoint`.
*
* Note: this can be implemented in a number of ways, for example by reading the delegated balance from one (or
* multiple), {ERC20Votes} tokens.
*/
function getVotes(address account, uint256 timepoint) external view returns (uint256);
/**
* @notice module:reputation
* @dev Voting power of an `account` at a specific `timepoint` given additional encoded parameters.
*/
function getVotesWithParams(
address account,
uint256 timepoint,
bytes memory params
) external view returns (uint256);
/**
* @notice module:voting
* @dev Returns whether `account` has cast a vote on `proposalId`.
*/
function hasVoted(uint256 proposalId, address account) external view returns (bool);
/**
* @dev Create a new proposal. Vote start after a delay specified by {IGovernor-votingDelay} and lasts for a
* duration specified by {IGovernor-votingPeriod}.
*
* Emits a {ProposalCreated} event.
*
* NOTE: The state of the Governor and `targets` may change between the proposal creation and its execution.
* This may be the result of third party actions on the targeted contracts, or other governor proposals.
* For example, the balance of this contract could be updated or its access control permissions may be modified,
* possibly compromising the proposal's ability to execute successfully (e.g. the governor doesn't have enough
* value to cover a proposal with multiple transfers).
*/
function propose(
address[] memory targets,
uint256[] memory values,
bytes[] memory calldatas,
string memory description
) external returns (uint256 proposalId);
/**
* @dev Queue a proposal. Some governors require this step to be performed before execution can happen. If queuing
* is not necessary, this function may revert.
* Queuing a proposal requires the quorum to be reached, the vote to be successful, and the deadline to be reached.
*
* Emits a {ProposalQueued} event.
*/
function queue(
address[] memory targets,
uint256[] memory values,
bytes[] memory calldatas,
bytes32 descriptionHash
) external returns (uint256 proposalId);
/**
* @dev Execute a successful proposal. This requires the quorum to be reached, the vote to be successful, and the
* deadline to be reached. Depending on the governor it might also be required that the proposal was queued and
* that some delay passed.
*
* Emits a {ProposalExecuted} event.
*
* NOTE: Some modules can modify the requirements for execution, for example by adding an additional timelock.
*/
function execute(
address[] memory targets,
uint256[] memory values,
bytes[] memory calldatas,
bytes32 descriptionHash
) external payable returns (uint256 proposalId);
/**
* @dev Cancel a proposal. A proposal is cancellable by the proposer, but only while it is Pending state, i.e.
* before the vote starts.
*
* Emits a {ProposalCanceled} event.
*/
function cancel(
address[] memory targets,
uint256[] memory values,
bytes[] memory calldatas,
bytes32 descriptionHash
) external returns (uint256 proposalId);
/**
* @dev Cast a vote
*
* Emits a {VoteCast} event.
*/
function castVote(uint256 proposalId, uint8 support) external returns (uint256 balance);
/**
* @dev Cast a vote with a reason
*
* Emits a {VoteCast} event.
*/
function castVoteWithReason(
uint256 proposalId,
uint8 support,
string calldata reason
) external returns (uint256 balance);
/**
* @dev Cast a vote with a reason and additional encoded parameters
*
* Emits a {VoteCast} or {VoteCastWithParams} event depending on the length of params.
*/
function castVoteWithReasonAndParams(
uint256 proposalId,
uint8 support,
string calldata reason,
bytes memory params
) external returns (uint256 balance);
/**
* @dev Cast a vote using the voter's signature, including ERC-1271 signature support.
*
* Emits a {VoteCast} event.
*/
function castVoteBySig(
uint256 proposalId,
uint8 support,
address voter,
bytes memory signature
) external returns (uint256 balance);
/**
* @dev Cast a vote with a reason and additional encoded parameters using the voter's signature,
* including ERC-1271 signature support.
*
* Emits a {VoteCast} or {VoteCastWithParams} event depending on the length of params.
*/
function castVoteWithReasonAndParamsBySig(
uint256 proposalId,
uint8 support,
address voter,
string calldata reason,
bytes memory params,
bytes memory signature
) external returns (uint256 balance);
}
// lib/openzeppelin-contracts/contracts/utils/types/Time.sol
// OpenZeppelin Contracts (last updated v5.1.0) (utils/types/Time.sol)
/**
* @dev This library provides helpers for manipulating time-related objects.
*
* It uses the following types:
* - `uint48` for timepoints
* - `uint32` for durations
*
* While the library doesn't provide specific types for timepoints and duration, it does provide:
* - a `Delay` type to represent duration that can be programmed to change value automatically at a given point
* - additional helper functions
*/
library Time {
using Time for *;
/**
* @dev Get the block timestamp as a Timepoint.
*/
function timestamp() internal view returns (uint48) {
return SafeCast.toUint48(block.timestamp);
}
/**
* @dev Get the block number as a Timepoint.
*/
function blockNumber() internal view returns (uint48) {
return SafeCast.toUint48(block.number);
}
// ==================================================== Delay =====================================================
/**
* @dev A `Delay` is a uint32 duration that can be programmed to change value automatically at a given point in the
* future. The "effect" timepoint describes when the transitions happens from the "old" value to the "new" value.
* This allows updating the delay applied to some operation while keeping some guarantees.
*
* In particular, the {update} function guarantees that if the delay is reduced, the old delay still applies for
* some time. For example if the delay is currently 7 days to do an upgrade, the admin should not be able to set
* the delay to 0 and upgrade immediately. If the admin wants to reduce the delay, the old delay (7 days) should
* still apply for some time.
*
*
* The `Delay` type is 112 bits long, and packs the following:
*
* ```
* | [uint48]: effect date (timepoint)
* | | [uint32]: value before (duration)
* ↓ ↓ ↓ [uint32]: value after (duration)
* 0xAAAAAAAAAAAABBBBBBBBCCCCCCCC
* ```
*
* NOTE: The {get} and {withUpdate} functions operate using timestamps. Block number based delays are not currently
* supported.
*/
type Delay is uint112;
/**
* @dev Wrap a duration into a Delay to add the one-step "update in the future" feature
*/
function toDelay(uint32 duration) internal pure returns (Delay) {
return Delay.wrap(duration);
}
/**
* @dev Get the value at a given timepoint plus the pending value and effect timepoint if there is a scheduled
* change after this timepoint. If the effect timepoint is 0, then the pending value should not be considered.
*/
function _getFullAt(
Delay self,
uint48 timepoint
) private pure returns (uint32 valueBefore, uint32 valueAfter, uint48 effect) {
(valueBefore, valueAfter, effect) = self.unpack();
return effect <= timepoint ? (valueAfter, 0, 0) : (valueBefore, valueAfter, effect);
}
/**
* @dev Get the current value plus the pending value and effect timepoint if there is a scheduled change. If the
* effect timepoint is 0, then the pending value should not be considered.
*/
function getFull(Delay self) internal view returns (uint32 valueBefore, uint32 valueAfter, uint48 effect) {
return _getFullAt(self, timestamp());
}
/**
* @dev Get the current value.
*/
function get(Delay self) internal view returns (uint32) {
(uint32 delay, , ) = self.getFull();
return delay;
}
/**
* @dev Update a Delay object so that it takes a new duration after a timepoint that is automatically computed to
* enforce the old delay at the moment of the update. Returns the updated Delay object and the timestamp when the
* new delay becomes effective.
*/
function withUpdate(
Delay self,
uint32 newValue,
uint32 minSetback
) internal view returns (Delay updatedDelay, uint48 effect) {
uint32 value = self.get();
uint32 setback = uint32(Math.max(minSetback, value > newValue ? value - newValue : 0));
effect = timestamp() + setback;
return (pack(value, newValue, effect), effect);
}
/**
* @dev Split a delay into its components: valueBefore, valueAfter and effect (transition timepoint).
*/
function unpack(Delay self) internal pure returns (uint32 valueBefore, uint32 valueAfter, uint48 effect) {
uint112 raw = Delay.unwrap(self);
valueAfter = uint32(raw);
valueBefore = uint32(raw >> 32);
effect = uint48(raw >> 64);
return (valueBefore, valueAfter, effect);
}
/**
* @dev pack the components into a Delay object.
*/
function pack(uint32 valueBefore, uint32 valueAfter, uint48 effect) internal pure returns (Delay) {
return Delay.wrap((uint112(effect) << 64) | (uint112(valueBefore) << 32) | uint112(valueAfter));
}
}
// lib/openzeppelin-contracts/contracts/token/ERC20/ERC20.sol
// OpenZeppelin Contracts (last updated v5.2.0) (token/ERC20/ERC20.sol)
/**
* @dev Implementation of the {IERC20} interface.
*
* This implementation is agnostic to the way tokens are created. This means
* that a supply mechanism has to be added in a derived contract using {_mint}.
*
* TIP: For a detailed writeup see our guide
* https://forum.openzeppelin.com/t/how-to-implement-erc20-supply-mechanisms/226[How
* to implement supply mechanisms].
*
* The default value of {decimals} is 18. To change this, you should override
* this function so it returns a different value.
*
* We have followed general OpenZeppelin Contracts guidelines: functions revert
* instead returning `false` on failure. This behavior is nonetheless
* conventional and does not conflict with the expectations of ERC-20
* applications.
*/
abstract contract ERC20 is Context, IERC20, IERC20Metadata, IERC20Errors {
mapping(address account => uint256) private _balances;
mapping(address account => mapping(address spender => uint256)) private _allowances;
uint256 private _totalSupply;
string private _name;
string private _symbol;
/**
* @dev Sets the values for {name} and {symbol}.
*
* All two of these values are immutable: they can only be set once during
* construction.
*/
constructor(string memory name_, string memory symbol_) {
_name = name_;
_symbol = symbol_;
}
/**
* @dev Returns the name of the token.
*/
function name() public view virtual returns (string memory) {
return _name;
}
/**
* @dev Returns the symbol of the token, usually a shorter version of the
* name.
*/
function symbol() public view virtual returns (string memory) {
return _symbol;
}
/**
* @dev Returns the number of decimals used to get its user representation.
* For example, if `decimals` equals `2`, a balance of `505` tokens should
* be displayed to a user as `5.05` (`505 / 10 ** 2`).
*
* Tokens usually opt for a value of 18, imitating the relationship between
* Ether and Wei. This is the default value returned by this function, unless
* it's overridden.
*
* NOTE: This information is only used for _display_ purposes: it in
* no way affects any of the arithmetic of the contract, including
* {IERC20-balanceOf} and {IERC20-transfer}.
*/
function decimals() public view virtual returns (uint8) {
return 18;
}
/**
* @dev See {IERC20-totalSupply}.
*/
function totalSupply() public view virtual returns (uint256) {
return _totalSupply;
}
/**
* @dev See {IERC20-balanceOf}.
*/
function balanceOf(address account) public view virtual returns (uint256) {
return _balances[account];
}
/**
* @dev See {IERC20-transfer}.
*
* Requirements:
*
* - `to` cannot be the zero address.
* - the caller must have a balance of at least `value`.
*/
function transfer(address to, uint256 value) public virtual returns (bool) {
address owner = _msgSender();
_transfer(owner, to, value);
return true;
}
/**
* @dev See {IERC20-allowance}.
*/
function allowance(address owner, address spender) public view virtual returns (uint256) {
return _allowances[owner][spender];
}
/**
* @dev See {IERC20-approve}.
*
* NOTE: If `value` is the maximum `uint256`, the allowance is not updated on
* `transferFrom`. This is semantically equivalent to an infinite approval.
*
* Requirements:
*
* - `spender` cannot be the zero address.
*/
function approve(address spender, uint256 value) public virtual returns (bool) {
address owner = _msgSender();
_approve(owner, spender, value);
return true;
}
/**
* @dev See {IERC20-transferFrom}.
*
* Skips emitting an {Approval} event indicating an allowance update. This is not
* required by the ERC. See {xref-ERC20-_approve-address-address-uint256-bool-}[_approve].
*
* NOTE: Does not update the allowance if the current allowance
* is the maximum `uint256`.
*
* Requirements:
*
* - `from` and `to` cannot be the zero address.
* - `from` must have a balance of at least `value`.
* - the caller must have allowance for ``from``'s tokens of at least
* `value`.
*/
function transferFrom(address from, address to, uint256 value) public virtual returns (bool) {
address spender = _msgSender();
_spendAllowance(from, spender, value);
_transfer(from, to, value);
return true;
}
/**
* @dev Moves a `value` amount of tokens from `from` to `to`.
*
* This internal function is equivalent to {transfer}, and can be used to
* e.g. implement automatic token fees, slashing mechanisms, etc.
*
* Emits a {Transfer} event.
*
* NOTE: This function is not virtual, {_update} should be overridden instead.
*/
function _transfer(address from, address to, uint256 value) internal {
if (from == address(0)) {
revert ERC20InvalidSender(address(0));
}
if (to == address(0)) {
revert ERC20InvalidReceiver(address(0));
}
_update(from, to, value);
}
/**
* @dev Transfers a `value` amount of tokens from `from` to `to`, or alternatively mints (or burns) if `from`
* (or `to`) is the zero address. All customizations to transfers, mints, and burns should be done by overriding
* this function.
*
* Emits a {Transfer} event.
*/
function _update(address from, address to, uint256 value) internal virtual {
if (from == address(0)) {
// Overflow check required: The rest of the code assumes that totalSupply never overflows
_totalSupply += value;
} else {
uint256 fromBalance = _balances[from];
if (fromBalance < value) {
revert ERC20InsufficientBalance(from, fromBalance, value);
}
unchecked {
// Overflow not possible: value <= fromBalance <= totalSupply.
_balances[from] = fromBalance - value;
}
}
if (to == address(0)) {
unchecked {
// Overflow not possible: value <= totalSupply or value <= fromBalance <= totalSupply.
_totalSupply -= value;
}
} else {
unchecked {
// Overflow not possible: balance + value is at most totalSupply, which we know fits into a uint256.
_balances[to] += value;
}
}
emit Transfer(from, to, value);
}
/**
* @dev Creates a `value` amount of tokens and assigns them to `account`, by transferring it from address(0).
* Relies on the `_update` mechanism
*
* Emits a {Transfer} event with `from` set to the zero address.
*
* NOTE: This function is not virtual, {_update} should be overridden instead.
*/
function _mint(address account, uint256 value) internal {
if (account == address(0)) {
revert ERC20InvalidReceiver(address(0));
}
_update(address(0), account, value);
}
/**
* @dev Destroys a `value` amount of tokens from `account`, lowering the total supply.
* Relies on the `_update` mechanism.
*
* Emits a {Transfer} event with `to` set to the zero address.
*
* NOTE: This function is not virtual, {_update} should be overridden instead
*/
function _burn(address account, uint256 value) internal {
if (account == address(0)) {
revert ERC20InvalidSender(address(0));
}
_update(account, address(0), value);
}
/**
* @dev Sets `value` as the allowance of `spender` over the `owner` s tokens.
*
* This internal function is equivalent to `approve`, and can be used to
* e.g. set automatic allowances for certain subsystems, etc.
*
* Emits an {Approval} event.
*
* Requirements:
*
* - `owner` cannot be the zero address.
* - `spender` cannot be the zero address.
*
* Overrides to this logic should be done to the variant with an additional `bool emitEvent` argument.
*/
function _approve(address owner, address spender, uint256 value) internal {
_approve(owner, spender, value, true);
}
/**
* @dev Variant of {_approve} with an optional flag to enable or disable the {Approval} event.
*
* By default (when calling {_approve}) the flag is set to true. On the other hand, approval changes made by
* `_spendAllowance` during the `transferFrom` operation set the flag to false. This saves gas by not emitting any
* `Approval` event during `transferFrom` operations.
*
* Anyone who wishes to continue emitting `Approval` events on the`transferFrom` operation can force the flag to
* true using the following override:
*
* ```solidity
* function _approve(address owner, address spender, uint256 value, bool) internal virtual override {
* super._approve(owner, spender, value, true);
* }
* ```
*
* Requirements are the same as {_approve}.
*/
function _approve(address owner, address spender, uint256 value, bool emitEvent) internal virtual {
if (owner == address(0)) {
revert ERC20InvalidApprover(address(0));
}
if (spender == address(0)) {
revert ERC20InvalidSpender(address(0));
}
_allowances[owner][spender] = value;
if (emitEvent) {
emit Approval(owner, spender, value);
}
}
/**
* @dev Updates `owner` s allowance for `spender` based on spent `value`.
*
* Does not update the allowance value in case of infinite allowance.
* Revert if not enough allowance is available.
*
* Does not emit an {Approval} event.
*/
function _spendAllowance(address owner, address spender, uint256 value) internal virtual {
uint256 currentAllowance = allowance(owner, spender);
if (currentAllowance < type(uint256).max) {
if (currentAllowance < value) {
revert ERC20InsufficientAllowance(spender, currentAllowance, value);
}
unchecked {
_approve(owner, spender, currentAllowance - value, false);
}
}
}
}
// lib/openzeppelin-contracts/contracts/interfaces/IERC1363.sol
// OpenZeppelin Contracts (last updated v5.1.0) (interfaces/IERC1363.sol)
/**
* @title IERC1363
* @dev Interface of the ERC-1363 standard as defined in the https://eips.ethereum.org/EIPS/eip-1363[ERC-1363].
*
* Defines an extension interface for ERC-20 tokens that supports executing code on a recipient contract
* after `transfer` or `transferFrom`, or code on a spender contract after `approve`, in a single transaction.
*/
interface IERC1363 is IERC20, IERC165 {
/*
* Note: the ERC-165 identifier for this interface is 0xb0202a11.
* 0xb0202a11 ===
* bytes4(keccak256('transferAndCall(address,uint256)')) ^
* bytes4(keccak256('transferAndCall(address,uint256,bytes)')) ^
* bytes4(keccak256('transferFromAndCall(address,address,uint256)')) ^
* bytes4(keccak256('transferFromAndCall(address,address,uint256,bytes)')) ^
* bytes4(keccak256('approveAndCall(address,uint256)')) ^
* bytes4(keccak256('approveAndCall(address,uint256,bytes)'))
*/
/**
* @dev Moves a `value` amount of tokens from the caller's account to `to`
* and then calls {IERC1363Receiver-onTransferReceived} on `to`.
* @param to The address which you want to transfer to.
* @param value The amount of tokens to be transferred.
* @return A boolean value indicating whether the operation succeeded unless throwing.
*/
function transferAndCall(address to, uint256 value) external returns (bool);
/**
* @dev Moves a `value` amount of tokens from the caller's account to `to`
* and then calls {IERC1363Receiver-onTransferReceived} on `to`.
* @param to The address which you want to transfer to.
* @param value The amount of tokens to be transferred.
* @param data Additional data with no specified format, sent in call to `to`.
* @return A boolean value indicating whether the operation succeeded unless throwing.
*/
function transferAndCall(address to, uint256 value, bytes calldata data) external returns (bool);
/**
* @dev Moves a `value` amount of tokens from `from` to `to` using the allowance mechanism
* and then calls {IERC1363Receiver-onTransferReceived} on `to`.
* @param from The address which you want to send tokens from.
* @param to The address which you want to transfer to.
* @param value The amount of tokens to be transferred.
* @return A boolean value indicating whether the operation succeeded unless throwing.
*/
function transferFromAndCall(address from, address to, uint256 value) external returns (bool);
/**
* @dev Moves a `value` amount of tokens from `from` to `to` using the allowance mechanism
* and then calls {IERC1363Receiver-onTransferReceived} on `to`.
* @param from The address which you want to send tokens from.
* @param to The address which you want to transfer to.
* @param value The amount of tokens to be transferred.
* @param data Additional data with no specified format, sent in call to `to`.
* @return A boolean value indicating whether the operation succeeded unless throwing.
*/
function transferFromAndCall(address from, address to, uint256 value, bytes calldata data) external returns (bool);
/**
* @dev Sets a `value` amount of tokens as the allowance of `spender` over the
* caller's tokens and then calls {IERC1363Spender-onApprovalReceived} on `spender`.
* @param spender The address which will spend the funds.
* @param value The amount of tokens to be spent.
* @return A boolean value indicating whether the operation succeeded unless throwing.
*/
function approveAndCall(address spender, uint256 value) external returns (bool);
/**
* @dev Sets a `value` amount of tokens as the allowance of `spender` over the
* caller's tokens and then calls {IERC1363Spender-onApprovalReceived} on `spender`.
* @param spender The address which will spend the funds.
* @param value The amount of tokens to be spent.
* @param data Additional data with no specified format, sent in call to `spender`.
* @return A boolean value indicating whether the operation succeeded unless throwing.
*/
function approveAndCall(address spender, uint256 value, bytes calldata data) external returns (bool);
}
// lib/openzeppelin-contracts/contracts/utils/Strings.sol
// OpenZeppelin Contracts (last updated v5.2.0) (utils/Strings.sol)
/**
* @dev String operations.
*/
library Strings {
using SafeCast for *;
bytes16 private constant HEX_DIGITS = "0123456789abcdef";
uint8 private constant ADDRESS_LENGTH = 20;
/**
* @dev The `value` string doesn't fit in the specified `length`.
*/
error StringsInsufficientHexLength(uint256 value, uint256 length);
/**
* @dev The string being parsed contains characters that are not in scope of the given base.
*/
error StringsInvalidChar();
/**
* @dev The string being parsed is not a properly formatted address.
*/
error StringsInvalidAddressFormat();
/**
* @dev Converts a `uint256` to its ASCII `string` decimal representation.
*/
function toString(uint256 value) internal pure returns (string memory) {
unchecked {
uint256 length = Math.log10(value) + 1;
string memory buffer = new string(length);
uint256 ptr;
assembly ("memory-safe") {
ptr := add(buffer, add(32, length))
}
while (true) {
ptr--;
assembly ("memory-safe") {
mstore8(ptr, byte(mod(value, 10), HEX_DIGITS))
}
value /= 10;
if (value == 0) break;
}
return buffer;
}
}
/**
* @dev Converts a `int256` to its ASCII `string` decimal representation.
*/
function toStringSigned(int256 value) internal pure returns (string memory) {
return string.concat(value < 0 ? "-" : "", toString(SignedMath.abs(value)));
}
/**
* @dev Converts a `uint256` to its ASCII `string` hexadecimal representation.
*/
function toHexString(uint256 value) internal pure returns (string memory) {
unchecked {
return toHexString(value, Math.log256(value) + 1);
}
}
/**
* @dev Converts a `uint256` to its ASCII `string` hexadecimal representation with fixed length.
*/
function toHexString(uint256 value, uint256 length) internal pure returns (string memory) {
uint256 localValue = value;
bytes memory buffer = new bytes(2 * length + 2);
buffer[0] = "0";
buffer[1] = "x";
for (uint256 i = 2 * length + 1; i > 1; --i) {
buffer[i] = HEX_DIGITS[localValue & 0xf];
localValue >>= 4;
}
if (localValue != 0) {
revert StringsInsufficientHexLength(value, length);
}
return string(buffer);
}
/**
* @dev Converts an `address` with fixed length of 20 bytes to its not checksummed ASCII `string` hexadecimal
* representation.
*/
function toHexString(address addr) internal pure returns (string memory) {
return toHexString(uint256(uint160(addr)), ADDRESS_LENGTH);
}
/**
* @dev Converts an `address` with fixed length of 20 bytes to its checksummed ASCII `string` hexadecimal
* representation, according to EIP-55.
*/
function toChecksumHexString(address addr) internal pure returns (string memory) {
bytes memory buffer = bytes(toHexString(addr));
// hash the hex part of buffer (skip length + 2 bytes, length 40)
uint256 hashValue;
assembly ("memory-safe") {
hashValue := shr(96, keccak256(add(buffer, 0x22), 40))
}
for (uint256 i = 41; i > 1; --i) {
// possible values for buffer[i] are 48 (0) to 57 (9) and 97 (a) to 102 (f)
if (hashValue & 0xf > 7 && uint8(buffer[i]) > 96) {
// case shift by xoring with 0x20
buffer[i] ^= 0x20;
}
hashValue >>= 4;
}
return string(buffer);
}
/**
* @dev Returns true if the two strings are equal.
*/
function equal(string memory a, string memory b) internal pure returns (bool) {
return bytes(a).length == bytes(b).length && keccak256(bytes(a)) == keccak256(bytes(b));
}
/**
* @dev Parse a decimal string and returns the value as a `uint256`.
*
* Requirements:
* - The string must be formatted as `[0-9]*`
* - The result must fit into an `uint256` type
*/
function parseUint(string memory input) internal pure returns (uint256) {
return parseUint(input, 0, bytes(input).length);
}
/**
* @dev Variant of {parseUint} that parses a substring of `input` located between position `begin` (included) and
* `end` (excluded).
*
* Requirements:
* - The substring must be formatted as `[0-9]*`
* - The result must fit into an `uint256` type
*/
function parseUint(string memory input, uint256 begin, uint256 end) internal pure returns (uint256) {
(bool success, uint256 value) = tryParseUint(input, begin, end);
if (!success) revert StringsInvalidChar();
return value;
}
/**
* @dev Variant of {parseUint-string} that returns false if the parsing fails because of an invalid character.
*
* NOTE: This function will revert if the result does not fit in a `uint256`.
*/
function tryParseUint(string memory input) internal pure returns (bool success, uint256 value) {
return _tryParseUintUncheckedBounds(input, 0, bytes(input).length);
}
/**
* @dev Variant of {parseUint-string-uint256-uint256} that returns false if the parsing fails because of an invalid
* character.
*
* NOTE: This function will revert if the result does not fit in a `uint256`.
*/
function tryParseUint(
string memory input,
uint256 begin,
uint256 end
) internal pure returns (bool success, uint256 value) {
if (end > bytes(input).length || begin > end) return (false, 0);
return _tryParseUintUncheckedBounds(input, begin, end);
}
/**
* @dev Implementation of {tryParseUint} that does not check bounds. Caller should make sure that
* `begin <= end <= input.length`. Other inputs would result in undefined behavior.
*/
function _tryParseUintUncheckedBounds(
string memory input,
uint256 begin,
uint256 end
) private pure returns (bool success, uint256 value) {
bytes memory buffer = bytes(input);
uint256 result = 0;
for (uint256 i = begin; i < end; ++i) {
uint8 chr = _tryParseChr(bytes1(_unsafeReadBytesOffset(buffer, i)));
if (chr > 9) return (false, 0);
result *= 10;
result += chr;
}
return (true, result);
}
/**
* @dev Parse a decimal string and returns the value as a `int256`.
*
* Requirements:
* - The string must be formatted as `[-+]?[0-9]*`
* - The result must fit in an `int256` type.
*/
function parseInt(string memory input) internal pure returns (int256) {
return parseInt(input, 0, bytes(input).length);
}
/**
* @dev Variant of {parseInt-string} that parses a substring of `input` located between position `begin` (included) and
* `end` (excluded).
*
* Requirements:
* - The substring must be formatted as `[-+]?[0-9]*`
* - The result must fit in an `int256` type.
*/
function parseInt(string memory input, uint256 begin, uint256 end) internal pure returns (int256) {
(bool success, int256 value) = tryParseInt(input, begin, end);
if (!success) revert StringsInvalidChar();
return value;
}
/**
* @dev Variant of {parseInt-string} that returns false if the parsing fails because of an invalid character or if
* the result does not fit in a `int256`.
*
* NOTE: This function will revert if the absolute value of the result does not fit in a `uint256`.
*/
function tryParseInt(string memory input) internal pure returns (bool success, int256 value) {
return _tryParseIntUncheckedBounds(input, 0, bytes(input).length);
}
uint256 private constant ABS_MIN_INT256 = 2 ** 255;
/**
* @dev Variant of {parseInt-string-uint256-uint256} that returns false if the parsing fails because of an invalid
* character or if the result does not fit in a `int256`.
*
* NOTE: This function will revert if the absolute value of the result does not fit in a `uint256`.
*/
function tryParseInt(
string memory input,
uint256 begin,
uint256 end
) internal pure returns (bool success, int256 value) {
if (end > bytes(input).length || begin > end) return (false, 0);
return _tryParseIntUncheckedBounds(input, begin, end);
}
/**
* @dev Implementation of {tryParseInt} that does not check bounds. Caller should make sure that
* `begin <= end <= input.length`. Other inputs would result in undefined behavior.
*/
function _tryParseIntUncheckedBounds(
string memory input,
uint256 begin,
uint256 end
) private pure returns (bool success, int256 value) {
bytes memory buffer = bytes(input);
// Check presence of a negative sign.
bytes1 sign = begin == end ? bytes1(0) : bytes1(_unsafeReadBytesOffset(buffer, begin)); // don't do out-of-bound (possibly unsafe) read if sub-string is empty
bool positiveSign = sign == bytes1("+");
bool negativeSign = sign == bytes1("-");
uint256 offset = (positiveSign || negativeSign).toUint();
(bool absSuccess, uint256 absValue) = tryParseUint(input, begin + offset, end);
if (absSuccess && absValue < ABS_MIN_INT256) {
return (true, negativeSign ? -int256(absValue) : int256(absValue));
} else if (absSuccess && negativeSign && absValue == ABS_MIN_INT256) {
return (true, type(int256).min);
} else return (false, 0);
}
/**
* @dev Parse a hexadecimal string (with or without "0x" prefix), and returns the value as a `uint256`.
*
* Requirements:
* - The string must be formatted as `(0x)?[0-9a-fA-F]*`
* - The result must fit in an `uint256` type.
*/
function parseHexUint(string memory input) internal pure returns (uint256) {
return parseHexUint(input, 0, bytes(input).length);
}
/**
* @dev Variant of {parseHexUint} that parses a substring of `input` located between position `begin` (included) and
* `end` (excluded).
*
* Requirements:
* - The substring must be formatted as `(0x)?[0-9a-fA-F]*`
* - The result must fit in an `uint256` type.
*/
function parseHexUint(string memory input, uint256 begin, uint256 end) internal pure returns (uint256) {
(bool success, uint256 value) = tryParseHexUint(input, begin, end);
if (!success) revert StringsInvalidChar();
return value;
}
/**
* @dev Variant of {parseHexUint-string} that returns false if the parsing fails because of an invalid character.
*
* NOTE: This function will revert if the result does not fit in a `uint256`.
*/
function tryParseHexUint(string memory input) internal pure returns (bool success, uint256 value) {
return _tryParseHexUintUncheckedBounds(input, 0, bytes(input).length);
}
/**
* @dev Variant of {parseHexUint-string-uint256-uint256} that returns false if the parsing fails because of an
* invalid character.
*
* NOTE: This function will revert if the result does not fit in a `uint256`.
*/
function tryParseHexUint(
string memory input,
uint256 begin,
uint256 end
) internal pure returns (bool success, uint256 value) {
if (end > bytes(input).length || begin > end) return (false, 0);
return _tryParseHexUintUncheckedBounds(input, begin, end);
}
/**
* @dev Implementation of {tryParseHexUint} that does not check bounds. Caller should make sure that
* `begin <= end <= input.length`. Other inputs would result in undefined behavior.
*/
function _tryParseHexUintUncheckedBounds(
string memory input,
uint256 begin,
uint256 end
) private pure returns (bool success, uint256 value) {
bytes memory buffer = bytes(input);
// skip 0x prefix if present
bool hasPrefix = (end > begin + 1) && bytes2(_unsafeReadBytesOffset(buffer, begin)) == bytes2("0x"); // don't do out-of-bound (possibly unsafe) read if sub-string is empty
uint256 offset = hasPrefix.toUint() * 2;
uint256 result = 0;
for (uint256 i = begin + offset; i < end; ++i) {
uint8 chr = _tryParseChr(bytes1(_unsafeReadBytesOffset(buffer, i)));
if (chr > 15) return (false, 0);
result *= 16;
unchecked {
// Multiplying by 16 is equivalent to a shift of 4 bits (with additional overflow check).
// This guaratees that adding a value < 16 will not cause an overflow, hence the unchecked.
result += chr;
}
}
return (true, result);
}
/**
* @dev Parse a hexadecimal string (with or without "0x" prefix), and returns the value as an `address`.
*
* Requirements:
* - The string must be formatted as `(0x)?[0-9a-fA-F]{40}`
*/
function parseAddress(string memory input) internal pure returns (address) {
return parseAddress(input, 0, bytes(input).length);
}
/**
* @dev Variant of {parseAddress} that parses a substring of `input` located between position `begin` (included) and
* `end` (excluded).
*
* Requirements:
* - The substring must be formatted as `(0x)?[0-9a-fA-F]{40}`
*/
function parseAddress(string memory input, uint256 begin, uint256 end) internal pure returns (address) {
(bool success, address value) = tryParseAddress(input, begin, end);
if (!success) revert StringsInvalidAddressFormat();
return value;
}
/**
* @dev Variant of {parseAddress-string} that returns false if the parsing fails because the input is not a properly
* formatted address. See {parseAddress} requirements.
*/
function tryParseAddress(string memory input) internal pure returns (bool success, address value) {
return tryParseAddress(input, 0, bytes(input).length);
}
/**
* @dev Variant of {parseAddress-string-uint256-uint256} that returns false if the parsing fails because input is not a properly
* formatted address. See {parseAddress} requirements.
*/
function tryParseAddress(
string memory input,
uint256 begin,
uint256 end
) internal pure returns (bool success, address value) {
if (end > bytes(input).length || begin > end) return (false, address(0));
bool hasPrefix = (end > begin + 1) && bytes2(_unsafeReadBytesOffset(bytes(input), begin)) == bytes2("0x"); // don't do out-of-bound (possibly unsafe) read if sub-string is empty
uint256 expectedLength = 40 + hasPrefix.toUint() * 2;
// check that input is the correct length
if (end - begin == expectedLength) {
// length guarantees that this does not overflow, and value is at most type(uint160).max
(bool s, uint256 v) = _tryParseHexUintUncheckedBounds(input, begin, end);
return (s, address(uint160(v)));
} else {
return (false, address(0));
}
}
function _tryParseChr(bytes1 chr) private pure returns (uint8) {
uint8 value = uint8(chr);
// Try to parse `chr`:
// - Case 1: [0-9]
// - Case 2: [a-f]
// - Case 3: [A-F]
// - otherwise not supported
unchecked {
if (value > 47 && value < 58) value -= 48;
else if (value > 96 && value < 103) value -= 87;
else if (value > 64 && value < 71) value -= 55;
else return type(uint8).max;
}
return value;
}
/**
* @dev Reads a bytes32 from a bytes array without bounds checking.
*
* NOTE: making this function internal would mean it could be used with memory unsafe offset, and marking the
* assembly block as such would prevent some optimizations.
*/
function _unsafeReadBytesOffset(bytes memory buffer, uint256 offset) private pure returns (bytes32 value) {
// This is not memory safe in the general case, but all calls to this private function are within bounds.
assembly ("memory-safe") {
value := mload(add(buffer, add(0x20, offset)))
}
}
}
// lib/openzeppelin-contracts/contracts/utils/cryptography/MessageHashUtils.sol
// OpenZeppelin Contracts (last updated v5.1.0) (utils/cryptography/MessageHashUtils.sol)
/**
* @dev Signature message hash utilities for producing digests to be consumed by {ECDSA} recovery or signing.
*
* The library provides methods for generating a hash of a message that conforms to the
* https://eips.ethereum.org/EIPS/eip-191[ERC-191] and https://eips.ethereum.org/EIPS/eip-712[EIP 712]
* specifications.
*/
library MessageHashUtils {
/**
* @dev Returns the keccak256 digest of an ERC-191 signed data with version
* `0x45` (`personal_sign` messages).
*
* The digest is calculated by prefixing a bytes32 `messageHash` with
* `"\x19Ethereum Signed Message:\n32"` and hashing the result. It corresponds with the
* hash signed when using the https://eth.wiki/json-rpc/API#eth_sign[`eth_sign`] JSON-RPC method.
*
* NOTE: The `messageHash` parameter is intended to be the result of hashing a raw message with
* keccak256, although any bytes32 value can be safely used because the final digest will
* be re-hashed.
*
* See {ECDSA-recover}.
*/
function toEthSignedMessageHash(bytes32 messageHash) internal pure returns (bytes32 digest) {
assembly ("memory-safe") {
mstore(0x00, "\x19Ethereum Signed Message:\n32") // 32 is the bytes-length of messageHash
mstore(0x1c, messageHash) // 0x1c (28) is the length of the prefix
digest := keccak256(0x00, 0x3c) // 0x3c is the length of the prefix (0x1c) + messageHash (0x20)
}
}
/**
* @dev Returns the keccak256 digest of an ERC-191 signed data with version
* `0x45` (`personal_sign` messages).
*
* The digest is calculated by prefixing an arbitrary `message` with
* `"\x19Ethereum Signed Message:\n" + len(message)` and hashing the result. It corresponds with the
* hash signed when using the https://eth.wiki/json-rpc/API#eth_sign[`eth_sign`] JSON-RPC method.
*
* See {ECDSA-recover}.
*/
function toEthSignedMessageHash(bytes memory message) internal pure returns (bytes32) {
return
keccak256(bytes.concat("\x19Ethereum Signed Message:\n", bytes(Strings.toString(message.length)), message));
}
/**
* @dev Returns the keccak256 digest of an ERC-191 signed data with version
* `0x00` (data with intended validator).
*
* The digest is calculated by prefixing an arbitrary `data` with `"\x19\x00"` and the intended
* `validator` address. Then hashing the result.
*
* See {ECDSA-recover}.
*/
function toDataWithIntendedValidatorHash(address validator, bytes memory data) internal pure returns (bytes32) {
return keccak256(abi.encodePacked(hex"19_00", validator, data));
}
/**
* @dev Returns the keccak256 digest of an EIP-712 typed data (ERC-191 version `0x01`).
*
* The digest is calculated from a `domainSeparator` and a `structHash`, by prefixing them with
* `\x19\x01` and hashing the result. It corresponds to the hash signed by the
* https://eips.ethereum.org/EIPS/eip-712[`eth_signTypedData`] JSON-RPC method as part of EIP-712.
*
* See {ECDSA-recover}.
*/
function toTypedDataHash(bytes32 domainSeparator, bytes32 structHash) internal pure returns (bytes32 digest) {
assembly ("memory-safe") {
let ptr := mload(0x40)
mstore(ptr, hex"19_01")
mstore(add(ptr, 0x02), domainSeparator)
mstore(add(ptr, 0x22), structHash)
digest := keccak256(ptr, 0x42)
}
}
}
// lib/openzeppelin-contracts/contracts/token/ERC20/utils/SafeERC20.sol
// OpenZeppelin Contracts (last updated v5.2.0) (token/ERC20/utils/SafeERC20.sol)
/**
* @title SafeERC20
* @dev Wrappers around ERC-20 operations that throw on failure (when the token
* contract returns false). Tokens that return no value (and instead revert or
* throw on failure) are also supported, non-reverting calls are assumed to be
* successful.
* To use this library you can add a `using SafeERC20 for IERC20;` statement to your contract,
* which allows you to call the safe operations as `token.safeTransfer(...)`, etc.
*/
library SafeERC20 {
/**
* @dev An operation with an ERC-20 token failed.
*/
error SafeERC20FailedOperation(address token);
/**
* @dev Indicates a failed `decreaseAllowance` request.
*/
error SafeERC20FailedDecreaseAllowance(address spender, uint256 currentAllowance, uint256 requestedDecrease);
/**
* @dev Transfer `value` amount of `token` from the calling contract to `to`. If `token` returns no value,
* non-reverting calls are assumed to be successful.
*/
function safeTransfer(IERC20 token, address to, uint256 value) internal {
_callOptionalReturn(token, abi.encodeCall(token.transfer, (to, value)));
}
/**
* @dev Transfer `value` amount of `token` from `from` to `to`, spending the approval given by `from` to the
* calling contract. If `token` returns no value, non-reverting calls are assumed to be successful.
*/
function safeTransferFrom(IERC20 token, address from, address to, uint256 value) internal {
_callOptionalReturn(token, abi.encodeCall(token.transferFrom, (from, to, value)));
}
/**
* @dev Increase the calling contract's allowance toward `spender` by `value`. If `token` returns no value,
* non-reverting calls are assumed to be successful.
*
* IMPORTANT: If the token implements ERC-7674 (ERC-20 with temporary allowance), and if the "client"
* smart contract uses ERC-7674 to set temporary allowances, then the "client" smart contract should avoid using
* this function. Performing a {safeIncreaseAllowance} or {safeDecreaseAllowance} operation on a token contract
* that has a non-zero temporary allowance (for that particular owner-spender) will result in unexpected behavior.
*/
function safeIncreaseAllowance(IERC20 token, address spender, uint256 value) internal {
uint256 oldAllowance = token.allowance(address(this), spender);
forceApprove(token, spender, oldAllowance + value);
}
/**
* @dev Decrease the calling contract's allowance toward `spender` by `requestedDecrease`. If `token` returns no
* value, non-reverting calls are assumed to be successful.
*
* IMPORTANT: If the token implements ERC-7674 (ERC-20 with temporary allowance), and if the "client"
* smart contract uses ERC-7674 to set temporary allowances, then the "client" smart contract should avoid using
* this function. Performing a {safeIncreaseAllowance} or {safeDecreaseAllowance} operation on a token contract
* that has a non-zero temporary allowance (for that particular owner-spender) will result in unexpected behavior.
*/
function safeDecreaseAllowance(IERC20 token, address spender, uint256 requestedDecrease) internal {
unchecked {
uint256 currentAllowance = token.allowance(address(this), spender);
if (currentAllowance < requestedDecrease) {
revert SafeERC20FailedDecreaseAllowance(spender, currentAllowance, requestedDecrease);
}
forceApprove(token, spender, currentAllowance - requestedDecrease);
}
}
/**
* @dev Set the calling contract's allowance toward `spender` to `value`. If `token` returns no value,
* non-reverting calls are assumed to be successful. Meant to be used with tokens that require the approval
* to be set to zero before setting it to a non-zero value, such as USDT.
*
* NOTE: If the token implements ERC-7674, this function will not modify any temporary allowance. This function
* only sets the "standard" allowance. Any temporary allowance will remain active, in addition to the value being
* set here.
*/
function forceApprove(IERC20 token, address spender, uint256 value) internal {
bytes memory approvalCall = abi.encodeCall(token.approve, (spender, value));
if (!_callOptionalReturnBool(token, approvalCall)) {
_callOptionalReturn(token, abi.encodeCall(token.approve, (spender, 0)));
_callOptionalReturn(token, approvalCall);
}
}
/**
* @dev Performs an {ERC1363} transferAndCall, with a fallback to the simple {ERC20} transfer if the target has no
* code. This can be used to implement an {ERC721}-like safe transfer that rely on {ERC1363} checks when
* targeting contracts.
*
* Reverts if the returned value is other than `true`.
*/
function transferAndCallRelaxed(IERC1363 token, address to, uint256 value, bytes memory data) internal {
if (to.code.length == 0) {
safeTransfer(token, to, value);
} else if (!token.transferAndCall(to, value, data)) {
revert SafeERC20FailedOperation(address(token));
}
}
/**
* @dev Performs an {ERC1363} transferFromAndCall, with a fallback to the simple {ERC20} transferFrom if the target
* has no code. This can be used to implement an {ERC721}-like safe transfer that rely on {ERC1363} checks when
* targeting contracts.
*
* Reverts if the returned value is other than `true`.
*/
function transferFromAndCallRelaxed(
IERC1363 token,
address from,
address to,
uint256 value,
bytes memory data
) internal {
if (to.code.length == 0) {
safeTransferFrom(token, from, to, value);
} else if (!token.transferFromAndCall(from, to, value, data)) {
revert SafeERC20FailedOperation(address(token));
}
}
/**
* @dev Performs an {ERC1363} approveAndCall, with a fallback to the simple {ERC20} approve if the target has no
* code. This can be used to implement an {ERC721}-like safe transfer that rely on {ERC1363} checks when
* targeting contracts.
*
* NOTE: When the recipient address (`to`) has no code (i.e. is an EOA), this function behaves as {forceApprove}.
* Opposedly, when the recipient address (`to`) has code, this function only attempts to call {ERC1363-approveAndCall}
* once without retrying, and relies on the returned value to be true.
*
* Reverts if the returned value is other than `true`.
*/
function approveAndCallRelaxed(IERC1363 token, address to, uint256 value, bytes memory data) internal {
if (to.code.length == 0) {
forceApprove(token, to, value);
} else if (!token.approveAndCall(to, value, data)) {
revert SafeERC20FailedOperation(address(token));
}
}
/**
* @dev Imitates a Solidity high-level call (i.e. a regular function call to a contract), relaxing the requirement
* on the return value: the return value is optional (but if data is returned, it must not be false).
* @param token The token targeted by the call.
* @param data The call data (encoded using abi.encode or one of its variants).
*
* This is a variant of {_callOptionalReturnBool} that reverts if call fails to meet the requirements.
*/
function _callOptionalReturn(IERC20 token, bytes memory data) private {
uint256 returnSize;
uint256 returnValue;
assembly ("memory-safe") {
let success := call(gas(), token, 0, add(data, 0x20), mload(data), 0, 0x20)
// bubble errors
if iszero(success) {
let ptr := mload(0x40)
returndatacopy(ptr, 0, returndatasize())
revert(ptr, returndatasize())
}
returnSize := returndatasize()
returnValue := mload(0)
}
if (returnSize == 0 ? address(token).code.length == 0 : returnValue != 1) {
revert SafeERC20FailedOperation(address(token));
}
}
/**
* @dev Imitates a Solidity high-level call (i.e. a regular function call to a contract), relaxing the requirement
* on the return value: the return value is optional (but if data is returned, it must not be false).
* @param token The token targeted by the call.
* @param data The call data (encoded using abi.encode or one of its variants).
*
* This is a variant of {_callOptionalReturn} that silently catches all reverts and returns a bool instead.
*/
function _callOptionalReturnBool(IERC20 token, bytes memory data) private returns (bool) {
bool success;
uint256 returnSize;
uint256 returnValue;
assembly ("memory-safe") {
success := call(gas(), token, 0, add(data, 0x20), mload(data), 0, 0x20)
returnSize := returndatasize()
returnValue := mload(0)
}
return success && (returnSize == 0 ? address(token).code.length > 0 : returnValue == 1);
}
}
// src/tokens/StakedSuccinct.sol
string constant NAME = "StakedSuccinct";
string constant SYMBOL = "stPROVE";
/// @title StakedSuccinct
/// @author Succinct Labs
/// @notice The terminal receipt token for staking in the Succinct Prover Network.
/// @dev This contract balance stays 1:1 with $PROVER-N vaults to give one unified
/// source of truth to track staked $PROVE. It is non-transferable outside of
/// staking operations.
abstract contract StakedSuccinct is ERC20 {
error NonTransferable();
/// @dev Only true if in the process of staking or unstaking.
bool internal transient isStakingOperation;
modifier stakingOperation() {
isStakingOperation = true;
_;
isStakingOperation = false;
}
constructor() ERC20(NAME, SYMBOL) {}
function name() public pure virtual override returns (string memory) {
return NAME;
}
function symbol() public pure virtual override returns (string memory) {
return SYMBOL;
}
/// @dev Only can update balances when staking operations are occuring. This is equivalent to
/// the only staking checks that we have on $iPROVE and $PROVER-N tokens.
function _update(address _from, address _to, uint256 _value) internal override(ERC20) {
if (!isStakingOperation) {
revert NonTransferable();
}
super._update(_from, _to, _value);
}
}
// lib/openzeppelin-contracts/contracts/utils/cryptography/EIP712.sol
// OpenZeppelin Contracts (last updated v5.1.0) (utils/cryptography/EIP712.sol)
/**
* @dev https://eips.ethereum.org/EIPS/eip-712[EIP-712] is a standard for hashing and signing of typed structured data.
*
* The encoding scheme specified in the EIP requires a domain separator and a hash of the typed structured data, whose
* encoding is very generic and therefore its implementation in Solidity is not feasible, thus this contract
* does not implement the encoding itself. Protocols need to implement the type-specific encoding they need in order to
* produce the hash of their typed data using a combination of `abi.encode` and `keccak256`.
*
* This contract implements the EIP-712 domain separator ({_domainSeparatorV4}) that is used as part of the encoding
* scheme, and the final step of the encoding to obtain the message digest that is then signed via ECDSA
* ({_hashTypedDataV4}).
*
* The implementation of the domain separator was designed to be as efficient as possible while still properly updating
* the chain id to protect against replay attacks on an eventual fork of the chain.
*
* NOTE: This contract implements the version of the encoding known as "v4", as implemented by the JSON RPC method
* https://docs.metamask.io/guide/signing-data.html[`eth_signTypedDataV4` in MetaMask].
*
* NOTE: In the upgradeable version of this contract, the cached values will correspond to the address, and the domain
* separator of the implementation contract. This will cause the {_domainSeparatorV4} function to always rebuild the
* separator from the immutable values, which is cheaper than accessing a cached version in cold storage.
*
* @custom:oz-upgrades-unsafe-allow state-variable-immutable
*/
abstract contract EIP712 is IERC5267 {
using ShortStrings for *;
bytes32 private constant TYPE_HASH =
keccak256("EIP712Domain(string name,string version,uint256 chainId,address verifyingContract)");
// Cache the domain separator as an immutable value, but also store the chain id that it corresponds to, in order to
// invalidate the cached domain separator if the chain id changes.
bytes32 private immutable _cachedDomainSeparator;
uint256 private immutable _cachedChainId;
address private immutable _cachedThis;
bytes32 private immutable _hashedName;
bytes32 private immutable _hashedVersion;
ShortString private immutable _name;
ShortString private immutable _version;
string private _nameFallback;
string private _versionFallback;
/**
* @dev Initializes the domain separator and parameter caches.
*
* The meaning of `name` and `version` is specified in
* https://eips.ethereum.org/EIPS/eip-712#definition-of-domainseparator[EIP-712]:
*
* - `name`: the user readable name of the signing domain, i.e. the name of the DApp or the protocol.
* - `version`: the current major version of the signing domain.
*
* NOTE: These parameters cannot be changed except through a xref:learn::upgrading-smart-contracts.adoc[smart
* contract upgrade].
*/
constructor(string memory name, string memory version) {
_name = name.toShortStringWithFallback(_nameFallback);
_version = version.toShortStringWithFallback(_versionFallback);
_hashedName = keccak256(bytes(name));
_hashedVersion = keccak256(bytes(version));
_cachedChainId = block.chainid;
_cachedDomainSeparator = _buildDomainSeparator();
_cachedThis = address(this);
}
/**
* @dev Returns the domain separator for the current chain.
*/
function _domainSeparatorV4() internal view returns (bytes32) {
if (address(this) == _cachedThis && block.chainid == _cachedChainId) {
return _cachedDomainSeparator;
} else {
return _buildDomainSeparator();
}
}
function _buildDomainSeparator() private view returns (bytes32) {
return keccak256(abi.encode(TYPE_HASH, _hashedName, _hashedVersion, block.chainid, address(this)));
}
/**
* @dev Given an already https://eips.ethereum.org/EIPS/eip-712#definition-of-hashstruct[hashed struct], this
* function returns the hash of the fully encoded EIP712 message for this domain.
*
* This hash can be used together with {ECDSA-recover} to obtain the signer of a message. For example:
*
* ```solidity
* bytes32 digest = _hashTypedDataV4(keccak256(abi.encode(
* keccak256("Mail(address to,string contents)"),
* mailTo,
* keccak256(bytes(mailContents))
* )));
* address signer = ECDSA.recover(digest, signature);
* ```
*/
function _hashTypedDataV4(bytes32 structHash) internal view virtual returns (bytes32) {
return MessageHashUtils.toTypedDataHash(_domainSeparatorV4(), structHash);
}
/**
* @dev See {IERC-5267}.
*/
function eip712Domain()
public
view
virtual
returns (
bytes1 fields,
string memory name,
string memory version,
uint256 chainId,
address verifyingContract,
bytes32 salt,
uint256[] memory extensions
)
{
return (
hex"0f", // 01111
_EIP712Name(),
_EIP712Version(),
block.chainid,
address(this),
bytes32(0),
new uint256[](0)
);
}
/**
* @dev The name parameter for the EIP712 domain.
*
* NOTE: By default this function reads _name which is an immutable value.
* It only reads from storage if necessary (in case the value is too large to fit in a ShortString).
*/
// solhint-disable-next-line func-name-mixedcase
function _EIP712Name() internal view returns (string memory) {
return _name.toStringWithFallback(_nameFallback);
}
/**
* @dev The version parameter for the EIP712 domain.
*
* NOTE: By default this function reads _version which is an immutable value.
* It only reads from storage if necessary (in case the value is too large to fit in a ShortString).
*/
// solhint-disable-next-line func-name-mixedcase
function _EIP712Version() internal view returns (string memory) {
return _version.toStringWithFallback(_versionFallback);
}
}
// lib/openzeppelin-contracts/contracts/token/ERC20/extensions/ERC4626.sol
// OpenZeppelin Contracts (last updated v5.1.0) (token/ERC20/extensions/ERC4626.sol)
/**
* @dev Implementation of the ERC-4626 "Tokenized Vault Standard" as defined in
* https://eips.ethereum.org/EIPS/eip-4626[ERC-4626].
*
* This extension allows the minting and burning of "shares" (represented using the ERC-20 inheritance) in exchange for
* underlying "assets" through standardized {deposit}, {mint}, {redeem} and {burn} workflows. This contract extends
* the ERC-20 standard. Any additional extensions included along it would affect the "shares" token represented by this
* contract and not the "assets" token which is an independent contract.
*
* [CAUTION]
* ====
* In empty (or nearly empty) ERC-4626 vaults, deposits are at high risk of being stolen through frontrunning
* with a "donation" to the vault that inflates the price of a share. This is variously known as a donation or inflation
* attack and is essentially a problem of slippage. Vault deployers can protect against this attack by making an initial
* deposit of a non-trivial amount of the asset, such that price manipulation becomes infeasible. Withdrawals may
* similarly be affected by slippage. Users can protect against this attack as well as unexpected slippage in general by
* verifying the amount received is as expected, using a wrapper that performs these checks such as
* https://github.com/fei-protocol/ERC4626#erc4626router-and-base[ERC4626Router].
*
* Since v4.9, this implementation introduces configurable virtual assets and shares to help developers mitigate that risk.
* The `_decimalsOffset()` corresponds to an offset in the decimal representation between the underlying asset's decimals
* and the vault decimals. This offset also determines the rate of virtual shares to virtual assets in the vault, which
* itself determines the initial exchange rate. While not fully preventing the attack, analysis shows that the default
* offset (0) makes it non-profitable even if an attacker is able to capture value from multiple user deposits, as a result
* of the value being captured by the virtual shares (out of the attacker's donation) matching the attacker's expected gains.
* With a larger offset, the attack becomes orders of magnitude more expensive than it is profitable. More details about the
* underlying math can be found xref:erc4626.adoc#inflation-attack[here].
*
* The drawback of this approach is that the virtual shares do capture (a very small) part of the value being accrued
* to the vault. Also, if the vault experiences losses, the users try to exit the vault, the virtual shares and assets
* will cause the first user to exit to experience reduced losses in detriment to the last users that will experience
* bigger losses. Developers willing to revert back to the pre-v4.9 behavior just need to override the
* `_convertToShares` and `_convertToAssets` functions.
*
* To learn more, check out our xref:ROOT:erc4626.adoc[ERC-4626 guide].
* ====
*/
abstract contract ERC4626 is ERC20, IERC4626 {
using Math for uint256;
IERC20 private immutable _asset;
uint8 private immutable _underlyingDecimals;
/**
* @dev Attempted to deposit more assets than the max amount for `receiver`.
*/
error ERC4626ExceededMaxDeposit(address receiver, uint256 assets, uint256 max);
/**
* @dev Attempted to mint more shares than the max amount for `receiver`.
*/
error ERC4626ExceededMaxMint(address receiver, uint256 shares, uint256 max);
/**
* @dev Attempted to withdraw more assets than the max amount for `receiver`.
*/
error ERC4626ExceededMaxWithdraw(address owner, uint256 assets, uint256 max);
/**
* @dev Attempted to redeem more shares than the max amount for `receiver`.
*/
error ERC4626ExceededMaxRedeem(address owner, uint256 shares, uint256 max);
/**
* @dev Set the underlying asset contract. This must be an ERC20-compatible contract (ERC-20 or ERC-777).
*/
constructor(IERC20 asset_) {
(bool success, uint8 assetDecimals) = _tryGetAssetDecimals(asset_);
_underlyingDecimals = success ? assetDecimals : 18;
_asset = asset_;
}
/**
* @dev Attempts to fetch the asset decimals. A return value of false indicates that the attempt failed in some way.
*/
function _tryGetAssetDecimals(IERC20 asset_) private view returns (bool ok, uint8 assetDecimals) {
(bool success, bytes memory encodedDecimals) = address(asset_).staticcall(
abi.encodeCall(IERC20Metadata.decimals, ())
);
if (success && encodedDecimals.length >= 32) {
uint256 returnedDecimals = abi.decode(encodedDecimals, (uint256));
if (returnedDecimals <= type(uint8).max) {
return (true, uint8(returnedDecimals));
}
}
return (false, 0);
}
/**
* @dev Decimals are computed by adding the decimal offset on top of the underlying asset's decimals. This
* "original" value is cached during construction of the vault contract. If this read operation fails (e.g., the
* asset has not been created yet), a default of 18 is used to represent the underlying asset's decimals.
*
* See {IERC20Metadata-decimals}.
*/
function decimals() public view virtual override(IERC20Metadata, ERC20) returns (uint8) {
return _underlyingDecimals + _decimalsOffset();
}
/** @dev See {IERC4626-asset}. */
function asset() public view virtual returns (address) {
return address(_asset);
}
/** @dev See {IERC4626-totalAssets}. */
function totalAssets() public view virtual returns (uint256) {
return _asset.balanceOf(address(this));
}
/** @dev See {IERC4626-convertToShares}. */
function convertToShares(uint256 assets) public view virtual returns (uint256) {
return _convertToShares(assets, Math.Rounding.Floor);
}
/** @dev See {IERC4626-convertToAssets}. */
function convertToAssets(uint256 shares) public view virtual returns (uint256) {
return _convertToAssets(shares, Math.Rounding.Floor);
}
/** @dev See {IERC4626-maxDeposit}. */
function maxDeposit(address) public view virtual returns (uint256) {
return type(uint256).max;
}
/** @dev See {IERC4626-maxMint}. */
function maxMint(address) public view virtual returns (uint256) {
return type(uint256).max;
}
/** @dev See {IERC4626-maxWithdraw}. */
function maxWithdraw(address owner) public view virtual returns (uint256) {
return _convertToAssets(balanceOf(owner), Math.Rounding.Floor);
}
/** @dev See {IERC4626-maxRedeem}. */
function maxRedeem(address owner) public view virtual returns (uint256) {
return balanceOf(owner);
}
/** @dev See {IERC4626-previewDeposit}. */
function previewDeposit(uint256 assets) public view virtual returns (uint256) {
return _convertToShares(assets, Math.Rounding.Floor);
}
/** @dev See {IERC4626-previewMint}. */
function previewMint(uint256 shares) public view virtual returns (uint256) {
return _convertToAssets(shares, Math.Rounding.Ceil);
}
/** @dev See {IERC4626-previewWithdraw}. */
function previewWithdraw(uint256 assets) public view virtual returns (uint256) {
return _convertToShares(assets, Math.Rounding.Ceil);
}
/** @dev See {IERC4626-previewRedeem}. */
function previewRedeem(uint256 shares) public view virtual returns (uint256) {
return _convertToAssets(shares, Math.Rounding.Floor);
}
/** @dev See {IERC4626-deposit}. */
function deposit(uint256 assets, address receiver) public virtual returns (uint256) {
uint256 maxAssets = maxDeposit(receiver);
if (assets > maxAssets) {
revert ERC4626ExceededMaxDeposit(receiver, assets, maxAssets);
}
uint256 shares = previewDeposit(assets);
_deposit(_msgSender(), receiver, assets, shares);
return shares;
}
/** @dev See {IERC4626-mint}. */
function mint(uint256 shares, address receiver) public virtual returns (uint256) {
uint256 maxShares = maxMint(receiver);
if (shares > maxShares) {
revert ERC4626ExceededMaxMint(receiver, shares, maxShares);
}
uint256 assets = previewMint(shares);
_deposit(_msgSender(), receiver, assets, shares);
return assets;
}
/** @dev See {IERC4626-withdraw}. */
function withdraw(uint256 assets, address receiver, address owner) public virtual returns (uint256) {
uint256 maxAssets = maxWithdraw(owner);
if (assets > maxAssets) {
revert ERC4626ExceededMaxWithdraw(owner, assets, maxAssets);
}
uint256 shares = previewWithdraw(assets);
_withdraw(_msgSender(), receiver, owner, assets, shares);
return shares;
}
/** @dev See {IERC4626-redeem}. */
function redeem(uint256 shares, address receiver, address owner) public virtual returns (uint256) {
uint256 maxShares = maxRedeem(owner);
if (shares > maxShares) {
revert ERC4626ExceededMaxRedeem(owner, shares, maxShares);
}
uint256 assets = previewRedeem(shares);
_withdraw(_msgSender(), receiver, owner, assets, shares);
return assets;
}
/**
* @dev Internal conversion function (from assets to shares) with support for rounding direction.
*/
function _convertToShares(uint256 assets, Math.Rounding rounding) internal view virtual returns (uint256) {
return assets.mulDiv(totalSupply() + 10 ** _decimalsOffset(), totalAssets() + 1, rounding);
}
/**
* @dev Internal conversion function (from shares to assets) with support for rounding direction.
*/
function _convertToAssets(uint256 shares, Math.Rounding rounding) internal view virtual returns (uint256) {
return shares.mulDiv(totalAssets() + 1, totalSupply() + 10 ** _decimalsOffset(), rounding);
}
/**
* @dev Deposit/mint common workflow.
*/
function _deposit(address caller, address receiver, uint256 assets, uint256 shares) internal virtual {
// If _asset is ERC-777, `transferFrom` can trigger a reentrancy BEFORE the transfer happens through the
// `tokensToSend` hook. On the other hand, the `tokenReceived` hook, that is triggered after the transfer,
// calls the vault, which is assumed not malicious.
//
// Conclusion: we need to do the transfer before we mint so that any reentrancy would happen before the
// assets are transferred and before the shares are minted, which is a valid state.
// slither-disable-next-line reentrancy-no-eth
SafeERC20.safeTransferFrom(_asset, caller, address(this), assets);
_mint(receiver, shares);
emit Deposit(caller, receiver, assets, shares);
}
/**
* @dev Withdraw/redeem common workflow.
*/
function _withdraw(
address caller,
address receiver,
address owner,
uint256 assets,
uint256 shares
) internal virtual {
if (caller != owner) {
_spendAllowance(owner, caller, shares);
}
// If _asset is ERC-777, `transfer` can trigger a reentrancy AFTER the transfer happens through the
// `tokensReceived` hook. On the other hand, the `tokensToSend` hook, that is triggered before the transfer,
// calls the vault, which is assumed not malicious.
//
// Conclusion: we need to do the transfer after the burn so that any reentrancy would happen after the
// shares are burned and after the assets are transferred, which is a valid state.
_burn(owner, shares);
SafeERC20.safeTransfer(_asset, receiver, assets);
emit Withdraw(caller, receiver, owner, assets, shares);
}
function _decimalsOffset() internal view virtual returns (uint8) {
return 0;
}
}
// lib/openzeppelin-contracts/contracts/governance/utils/Votes.sol
// OpenZeppelin Contracts (last updated v5.2.0) (governance/utils/Votes.sol)
/**
* @dev This is a base abstract contract that tracks voting units, which are a measure of voting power that can be
* transferred, and provides a system of vote delegation, where an account can delegate its voting units to a sort of
* "representative" that will pool delegated voting units from different accounts and can then use it to vote in
* decisions. In fact, voting units _must_ be delegated in order to count as actual votes, and an account has to
* delegate those votes to itself if it wishes to participate in decisions and does not have a trusted representative.
*
* This contract is often combined with a token contract such that voting units correspond to token units. For an
* example, see {ERC721Votes}.
*
* The full history of delegate votes is tracked on-chain so that governance protocols can consider votes as distributed
* at a particular block number to protect against flash loans and double voting. The opt-in delegate system makes the
* cost of this history tracking optional.
*
* When using this module the derived contract must implement {_getVotingUnits} (for example, make it return
* {ERC721-balanceOf}), and can use {_transferVotingUnits} to track a change in the distribution of those units (in the
* previous example, it would be included in {ERC721-_update}).
*/
abstract contract Votes is Context, EIP712, Nonces, IERC5805 {
using Checkpoints for Checkpoints.Trace208;
bytes32 private constant DELEGATION_TYPEHASH =
keccak256("Delegation(address delegatee,uint256 nonce,uint256 expiry)");
mapping(address account => address) private _delegatee;
mapping(address delegatee => Checkpoints.Trace208) private _delegateCheckpoints;
Checkpoints.Trace208 private _totalCheckpoints;
/**
* @dev The clock was incorrectly modified.
*/
error ERC6372InconsistentClock();
/**
* @dev Lookup to future votes is not available.
*/
error ERC5805FutureLookup(uint256 timepoint, uint48 clock);
/**
* @dev Clock used for flagging checkpoints. Can be overridden to implement timestamp based
* checkpoints (and voting), in which case {CLOCK_MODE} should be overridden as well to match.
*/
function clock() public view virtual returns (uint48) {
return Time.blockNumber();
}
/**
* @dev Machine-readable description of the clock as specified in ERC-6372.
*/
// solhint-disable-next-line func-name-mixedcase
function CLOCK_MODE() public view virtual returns (string memory) {
// Check that the clock was not modified
if (clock() != Time.blockNumber()) {
revert ERC6372InconsistentClock();
}
return "mode=blocknumber&from=default";
}
/**
* @dev Validate that a timepoint is in the past, and return it as a uint48.
*/
function _validateTimepoint(uint256 timepoint) internal view returns (uint48) {
uint48 currentTimepoint = clock();
if (timepoint >= currentTimepoint) revert ERC5805FutureLookup(timepoint, currentTimepoint);
return SafeCast.toUint48(timepoint);
}
/**
* @dev Returns the current amount of votes that `account` has.
*/
function getVotes(address account) public view virtual returns (uint256) {
return _delegateCheckpoints[account].latest();
}
/**
* @dev Returns the amount of votes that `account` had at a specific moment in the past. If the `clock()` is
* configured to use block numbers, this will return the value at the end of the corresponding block.
*
* Requirements:
*
* - `timepoint` must be in the past. If operating using block numbers, the block must be already mined.
*/
function getPastVotes(address account, uint256 timepoint) public view virtual returns (uint256) {
return _delegateCheckpoints[account].upperLookupRecent(_validateTimepoint(timepoint));
}
/**
* @dev Returns the total supply of votes available at a specific moment in the past. If the `clock()` is
* configured to use block numbers, this will return the value at the end of the corresponding block.
*
* NOTE: This value is the sum of all available votes, which is not necessarily the sum of all delegated votes.
* Votes that have not been delegated are still part of total supply, even though they would not participate in a
* vote.
*
* Requirements:
*
* - `timepoint` must be in the past. If operating using block numbers, the block must be already mined.
*/
function getPastTotalSupply(uint256 timepoint) public view virtual returns (uint256) {
return _totalCheckpoints.upperLookupRecent(_validateTimepoint(timepoint));
}
/**
* @dev Returns the current total supply of votes.
*/
function _getTotalSupply() internal view virtual returns (uint256) {
return _totalCheckpoints.latest();
}
/**
* @dev Returns the delegate that `account` has chosen.
*/
function delegates(address account) public view virtual returns (address) {
return _delegatee[account];
}
/**
* @dev Delegates votes from the sender to `delegatee`.
*/
function delegate(address delegatee) public virtual {
address account = _msgSender();
_delegate(account, delegatee);
}
/**
* @dev Delegates votes from signer to `delegatee`.
*/
function delegateBySig(
address delegatee,
uint256 nonce,
uint256 expiry,
uint8 v,
bytes32 r,
bytes32 s
) public virtual {
if (block.timestamp > expiry) {
revert VotesExpiredSignature(expiry);
}
address signer = ECDSA.recover(
_hashTypedDataV4(keccak256(abi.encode(DELEGATION_TYPEHASH, delegatee, nonce, expiry))),
v,
r,
s
);
_useCheckedNonce(signer, nonce);
_delegate(signer, delegatee);
}
/**
* @dev Delegate all of `account`'s voting units to `delegatee`.
*
* Emits events {IVotes-DelegateChanged} and {IVotes-DelegateVotesChanged}.
*/
function _delegate(address account, address delegatee) internal virtual {
address oldDelegate = delegates(account);
_delegatee[account] = delegatee;
emit DelegateChanged(account, oldDelegate, delegatee);
_moveDelegateVotes(oldDelegate, delegatee, _getVotingUnits(account));
}
/**
* @dev Transfers, mints, or burns voting units. To register a mint, `from` should be zero. To register a burn, `to`
* should be zero. Total supply of voting units will be adjusted with mints and burns.
*/
function _transferVotingUnits(address from, address to, uint256 amount) internal virtual {
if (from == address(0)) {
_push(_totalCheckpoints, _add, SafeCast.toUint208(amount));
}
if (to == address(0)) {
_push(_totalCheckpoints, _subtract, SafeCast.toUint208(amount));
}
_moveDelegateVotes(delegates(from), delegates(to), amount);
}
/**
* @dev Moves delegated votes from one delegate to another.
*/
function _moveDelegateVotes(address from, address to, uint256 amount) internal virtual {
if (from != to && amount > 0) {
if (from != address(0)) {
(uint256 oldValue, uint256 newValue) = _push(
_delegateCheckpoints[from],
_subtract,
SafeCast.toUint208(amount)
);
emit DelegateVotesChanged(from, oldValue, newValue);
}
if (to != address(0)) {
(uint256 oldValue, uint256 newValue) = _push(
_delegateCheckpoints[to],
_add,
SafeCast.toUint208(amount)
);
emit DelegateVotesChanged(to, oldValue, newValue);
}
}
}
/**
* @dev Get number of checkpoints for `account`.
*/
function _numCheckpoints(address account) internal view virtual returns (uint32) {
return SafeCast.toUint32(_delegateCheckpoints[account].length());
}
/**
* @dev Get the `pos`-th checkpoint for `account`.
*/
function _checkpoints(
address account,
uint32 pos
) internal view virtual returns (Checkpoints.Checkpoint208 memory) {
return _delegateCheckpoints[account].at(pos);
}
function _push(
Checkpoints.Trace208 storage store,
function(uint208, uint208) view returns (uint208) op,
uint208 delta
) private returns (uint208 oldValue, uint208 newValue) {
return store.push(clock(), op(store.latest(), delta));
}
function _add(uint208 a, uint208 b) private pure returns (uint208) {
return a + b;
}
function _subtract(uint208 a, uint208 b) private pure returns (uint208) {
return a - b;
}
/**
* @dev Must return the voting units held by an account.
*/
function _getVotingUnits(address) internal view virtual returns (uint256);
}
// lib/openzeppelin-contracts/contracts/token/ERC20/extensions/ERC20Votes.sol
// OpenZeppelin Contracts (last updated v5.1.0) (token/ERC20/extensions/ERC20Votes.sol)
/**
* @dev Extension of ERC-20 to support Compound-like voting and delegation. This version is more generic than Compound's,
* and supports token supply up to 2^208^ - 1, while COMP is limited to 2^96^ - 1.
*
* NOTE: This contract does not provide interface compatibility with Compound's COMP token.
*
* This extension keeps a history (checkpoints) of each account's vote power. Vote power can be delegated either
* by calling the {Votes-delegate} function directly, or by providing a signature to be used with {Votes-delegateBySig}. Voting
* power can be queried through the public accessors {Votes-getVotes} and {Votes-getPastVotes}.
*
* By default, token balance does not account for voting power. This makes transfers cheaper. The downside is that it
* requires users to delegate to themselves in order to activate checkpoints and have their voting power tracked.
*/
abstract contract ERC20Votes is ERC20, Votes {
/**
* @dev Total supply cap has been exceeded, introducing a risk of votes overflowing.
*/
error ERC20ExceededSafeSupply(uint256 increasedSupply, uint256 cap);
/**
* @dev Maximum token supply. Defaults to `type(uint208).max` (2^208^ - 1).
*
* This maximum is enforced in {_update}. It limits the total supply of the token, which is otherwise a uint256,
* so that checkpoints can be stored in the Trace208 structure used by {Votes}. Increasing this value will not
* remove the underlying limitation, and will cause {_update} to fail because of a math overflow in
* {Votes-_transferVotingUnits}. An override could be used to further restrict the total supply (to a lower value) if
* additional logic requires it. When resolving override conflicts on this function, the minimum should be
* returned.
*/
function _maxSupply() internal view virtual returns (uint256) {
return type(uint208).max;
}
/**
* @dev Move voting power when tokens are transferred.
*
* Emits a {IVotes-DelegateVotesChanged} event.
*/
function _update(address from, address to, uint256 value) internal virtual override {
super._update(from, to, value);
if (from == address(0)) {
uint256 supply = totalSupply();
uint256 cap = _maxSupply();
if (supply > cap) {
revert ERC20ExceededSafeSupply(supply, cap);
}
}
_transferVotingUnits(from, to, value);
}
/**
* @dev Returns the voting units of an `account`.
*
* WARNING: Overriding this function may compromise the internal vote accounting.
* `ERC20Votes` assumes tokens map to voting units 1:1 and this is not easy to change.
*/
function _getVotingUnits(address account) internal view virtual override returns (uint256) {
return balanceOf(account);
}
/**
* @dev Get number of checkpoints for `account`.
*/
function numCheckpoints(address account) public view virtual returns (uint32) {
return _numCheckpoints(account);
}
/**
* @dev Get the `pos`-th checkpoint for `account`.
*/
function checkpoints(address account, uint32 pos) public view virtual returns (Checkpoints.Checkpoint208 memory) {
return _checkpoints(account, pos);
}
}
// src/tokens/SuccinctProver.sol
string constant NAME_PREFIX = "SuccinctProver-";
string constant SYMBOL_PREFIX = "PROVER-";
/// @title SuccinctProver
/// @author Succinct Labs
/// @notice The per-prover receipt token for delegating stake to a prover.
/// @dev This contract accepts $iPROVE and mints $PROVER-N. It is non-transferable
/// outside of staking operations.
contract SuccinctProver is ERC4626, IProver {
using SafeERC20 for IERC20;
using Strings for uint256;
/// @inheritdoc IProver
address public immutable override staking;
/// @inheritdoc IProver
address public immutable override governor;
/// @inheritdoc IProver
address public immutable override prove;
/// @inheritdoc IProver
address public immutable override owner;
/// @inheritdoc IProver
uint256 public immutable override id;
/// @inheritdoc IProver
uint256 public immutable override stakerFeeBips;
/// @dev Modifier to ensure that the caller is the prover owner.
modifier onlyOwner() {
if (msg.sender != owner) revert NotProverOwner();
_;
}
/// @dev Initializes this vault with $iPROVE as the underlying, with additional parameters.
constructor(
address _governor,
address _prove,
address _iProve,
address _owner,
uint256 _id,
uint256 _stakerFeeBips
)
ERC20(string.concat(NAME_PREFIX, _id.toString()), string.concat(SYMBOL_PREFIX, _id.toString()))
ERC4626(IERC20(_iProve))
{
if (
_governor == address(0) || _prove == address(0) || _iProve == address(0)
|| _owner == address(0)
) {
revert ZeroAddress();
}
staking = msg.sender;
governor = _governor;
prove = _prove;
owner = _owner;
id = _id;
stakerFeeBips = _stakerFeeBips;
// Self-delegate so that this prover can participate in governance.
ERC20Votes(_iProve).delegate(address(this));
}
/// @inheritdoc IProver
function propose(
address[] memory _targets,
uint256[] memory _values,
bytes[] memory _calldatas,
string memory _description
) external override onlyOwner returns (uint256) {
return IGovernor(governor).propose(_targets, _values, _calldatas, _description);
}
/// @inheritdoc IProver
function cancel(
address[] memory _targets,
uint256[] memory _values,
bytes[] memory _calldatas,
bytes32 _descriptionHash
) external override onlyOwner returns (uint256) {
return IGovernor(governor).cancel(_targets, _values, _calldatas, _descriptionHash);
}
/// @inheritdoc IProver
function castVote(uint256 _proposalId, uint8 _support)
external
override
onlyOwner
returns (uint256)
{
return IGovernor(governor).castVote(_proposalId, _support);
}
/// @inheritdoc IProver
function transferProveToStaking(address _from, uint256 _amount) external override {
if (msg.sender != staking) {
revert NotStaking();
}
IERC20(prove).safeTransferFrom(_from, staking, _amount);
}
/// @dev Override to prevent transfers of $PROVER-N tokens except for stake/unstake.
function _update(address _from, address _to, uint256 _value) internal override(ERC20) {
if (msg.sender != staking) {
revert NonTransferable();
}
super._update(_from, _to, _value);
}
/// @dev Override to allow the staking contract to spend $PROVER-N.
function _spendAllowance(address _owner, address _spender, uint256 _amount) internal override {
if (_spender == staking) {
return;
}
super._spendAllowance(_owner, _spender, _amount);
}
}
// src/libraries/ProverRegistry.sol
/// @title ProverRegistry
/// @author Succinct Labs
/// @notice This contract is used to manage provers.
/// @dev Because provers are approved to spend $iPROVE, it is important that tracked
/// provers are only contracts with `type(SuccinctProver).creationCode`.
abstract contract ProverRegistry is IProverRegistry {
/// @inheritdoc IProverRegistry
address public override governor;
/// @inheritdoc IProverRegistry
address public override vapp;
/// @inheritdoc IProverRegistry
address public override prove;
/// @inheritdoc IProverRegistry
address public override iProve;
/// @inheritdoc IProverRegistry
uint256 public override proverCount;
/// @dev A mapping from prover owner to prover vault.
mapping(address => address) internal ownerToProver;
/// @dev A mapping from prover vault to whether it exists.
mapping(address => bool) internal provers;
/// @dev This call must be sent by the VApp contract. This also acts as a check to ensure that the contract
/// has been initialized.
modifier onlyVApp() {
if (msg.sender != vapp) {
revert NotAuthorized();
}
_;
}
/// @dev This call must target a prover that exists in the registry.
modifier onlyForProver(address _prover) {
if (!provers[_prover]) {
revert ProverNotFound();
}
_;
}
function __ProverRegistry_init(
address _governor,
address _vapp,
address _prove,
address _iProve
) internal {
governor = _governor;
vapp = _vapp;
prove = _prove;
iProve = _iProve;
}
/// @inheritdoc IProverRegistry
function ownerOf(address _prover) public view override returns (address) {
return IProver(_prover).owner();
}
/// @inheritdoc IProverRegistry
function isProver(address _prover) public view override returns (bool) {
return provers[_prover];
}
/// @inheritdoc IProverRegistry
function getProver(address _owner) public view override returns (address) {
return ownerToProver[_owner];
}
/// @inheritdoc IProverRegistry
function hasProver(address _owner) public view override returns (bool) {
return ownerToProver[_owner] != address(0);
}
/// @inheritdoc IProverRegistry
function createProver(uint256 _stakerFeeBips) external override returns (address) {
if (_stakerFeeBips > 10000) {
revert InvalidStakerFeeBips();
}
if (hasProver(msg.sender)) {
revert ProverAlreadyExists();
}
return _deployProver(msg.sender, _stakerFeeBips);
}
/// @dev Uses CREATE2 to deploy an instance of SuccinctProver and adds it to the mapping.
function _deployProver(address _owner, uint256 _stakerFeeBips)
internal
returns (address prover)
{
// Ensure that the contract is initialized.
if (iProve == address(0)) {
revert NotInitialized();
}
// Increment the number of provers.
unchecked {
++proverCount;
}
// Deploy the prover.
prover = Create2.deploy(
0,
bytes32(uint256(uint160(_owner))),
abi.encodePacked(
type(SuccinctProver).creationCode,
abi.encode(governor, prove, iProve, _owner, proverCount, _stakerFeeBips)
)
);
// Update the mappings.
ownerToProver[_owner] = prover;
provers[prover] = true;
// Register the prover with the VApp.
ISuccinctVApp(vapp).createProver(prover, _owner, _stakerFeeBips);
// Approve the prover as a spender of $iPROVE, so that $iPROVE can be transferred to the
// prover during stake().
IERC20(iProve).approve(prover, type(uint256).max);
emit ProverDeploy(prover, _owner, _stakerFeeBips);
}
}
// src/SuccinctStaking.sol
/// @title SuccinctStaking
/// @author Succinct Labs
/// @notice Manages staking, unstaking, dispensing, and slashing for the Succinct Prover Network.
contract SuccinctStaking is
Initializable,
Ownable,
ProverRegistry,
StakedSuccinct,
ISuccinctStaking
{
using SafeERC20 for IERC20;
/// @inheritdoc ISuccinctStaking
uint256 public override minStakeAmount;
/// @inheritdoc ISuccinctStaking
uint256 public override maxUnstakeRequests;
/// @inheritdoc ISuccinctStaking
uint256 public override unstakePeriod;
/// @inheritdoc ISuccinctStaking
uint256 public override slashPeriod;
/// @inheritdoc ISuccinctStaking
uint256 public override dispenseRate;
/// @inheritdoc ISuccinctStaking
uint256 public override lastDispenseTimestamp;
/// @dev A mapping from staker to the prover they are staked with.
mapping(address => address) internal stakerToProver;
/// @dev A mapping from staker to their unstake claims.
mapping(address => UnstakeClaim[]) internal unstakeClaims;
/// @dev A mapping from prover to their slash claims.
mapping(address => SlashClaim[]) internal slashClaims;
/*//////////////////////////////////////////////////////////////
INITIALIZER
//////////////////////////////////////////////////////////////*/
/// @dev Only the owner is set in the constructor. This is done because other contracts
/// (e.g. SuccinctVApp) need a reference to this contract, and this contract needs a
/// reference to it. So we deploy this first, then initialize it later.
constructor(address _owner) Ownable(_owner) {}
/// @dev We don't do this in the constructor because we must deploy this contract
/// first.
function initialize(
address _governor,
address _vApp,
address _prove,
address _intermediateProve,
uint256 _minStakeAmount,
uint256 _maxUnstakeRequests,
uint256 _unstakePeriod,
uint256 _slashPeriod,
uint256 _dispenseRate
) external onlyOwner initializer {
// Ensure that parameters critical for functionality are non-zero.
if (
_governor == address(0) || _vApp == address(0) || _prove == address(0)
|| _intermediateProve == address(0)
) {
revert ZeroAddress();
}
if (_maxUnstakeRequests == 0 || _unstakePeriod == 0 || _slashPeriod == 0) {
revert ZeroAmount();
}
// Setup the initial state.
__ProverRegistry_init(_governor, _vApp, _prove, _intermediateProve);
minStakeAmount = _minStakeAmount;
maxUnstakeRequests = _maxUnstakeRequests;
unstakePeriod = _unstakePeriod;
slashPeriod = _slashPeriod;
// Setup the dispense rate.
_updateDispenseRate(_dispenseRate);
lastDispenseTimestamp = block.timestamp;
// Approve the $iPROVE contract to transfer $PROVE from this contract during stake().
IERC20(prove).approve(iProve, type(uint256).max);
}
/*//////////////////////////////////////////////////////////////
VIEW
//////////////////////////////////////////////////////////////*/
/// @inheritdoc ISuccinctStaking
function stakedTo(address _staker) external view override returns (address) {
return stakerToProver[_staker];
}
/// @inheritdoc ISuccinctStaking
function staked(address _staker) external view override returns (uint256) {
// Get the prover that the staker is staked with.
address prover = stakerToProver[_staker];
if (prover == address(0)) return 0;
// Get the amount of $PROVE the staker would get if the staker's full $stPROVE balance was
// unstaked.
return previewUnstake(prover, balanceOf(_staker));
}
/// @inheritdoc ISuccinctStaking
function proverStaked(address _prover) public view override returns (uint256) {
// Get the amount of $iPROVE in the prover.
uint256 iPROVE = IERC4626(_prover).totalAssets();
// Get the amount of $PROVE that would be received if the $iPROVE was redeemed.
return IERC4626(iProve).previewRedeem(iPROVE);
}
/// @inheritdoc ISuccinctStaking
function unstakeRequests(address _staker)
external
view
override
returns (UnstakeClaim[] memory)
{
return unstakeClaims[_staker];
}
/// @inheritdoc ISuccinctStaking
function slashRequests(address _prover) external view override returns (SlashClaim[] memory) {
return slashClaims[_prover];
}
/// @inheritdoc ISuccinctStaking
function unstakePending(address _staker) external view override returns (uint256) {
// Get the prover that the staker is staked with.
address prover = stakerToProver[_staker];
if (prover == address(0)) return 0;
// Get the amount of $PROVE that would be received if the pending $stPROVE was redeemed.
return previewUnstake(prover, _getUnstakeClaimBalance(_staker));
}
/// @inheritdoc ISuccinctStaking
function previewUnstake(address _prover, uint256 _stPROVE)
public
view
override
returns (uint256)
{
// Get the amount of $iPROVE this staker has for this prover.
uint256 iPROVE = IERC4626(_prover).previewRedeem(_stPROVE);
// Get the amount of $PROVE that would be received if the $iPROVE was redeemed.
return IERC4626(iProve).previewRedeem(iPROVE);
}
/// @inheritdoc ISuccinctStaking
function maxDispense() public view override returns (uint256) {
uint256 elapsedTime = block.timestamp - lastDispenseTimestamp;
return elapsedTime * dispenseRate;
}
/*//////////////////////////////////////////////////////////////
CORE
//////////////////////////////////////////////////////////////*/
/// @inheritdoc ISuccinctStaking
function stake(address _prover, uint256 _PROVE)
external
override
onlyForProver(_prover)
returns (uint256)
{
// Transfer $PROVE from the staker to this contract.
IERC20(prove).safeTransferFrom(msg.sender, address(this), _PROVE);
return _stake(msg.sender, _prover, _PROVE);
}
/// @inheritdoc ISuccinctStaking
function permitAndStake(
address _prover,
address _from,
uint256 _PROVE,
uint256 _deadline,
uint8 _v,
bytes32 _r,
bytes32 _s
) external override onlyForProver(_prover) returns (uint256) {
// Approve the prover to spend the $PROVE from the staker.
IERC20Permit(prove).permit(_from, _prover, _PROVE, _deadline, _v, _r, _s);
// Transfer $PROVE from the staker to this contract, by utilizing the prover as the
// spender.
IProver(_prover).transferProveToStaking(_from, _PROVE);
return _stake(_from, _prover, _PROVE);
}
/// @inheritdoc ISuccinctStaking
function requestUnstake(uint256 _stPROVE) external override {
// Ensure unstaking a non-zero amount.
if (_stPROVE == 0) revert ZeroAmount();
// Get the prover that the staker is staked with.
address prover = stakerToProver[msg.sender];
if (prover == address(0)) revert NotStaked();
// Check that this staker has not already requested too many unstake requests.
if (unstakeClaims[msg.sender].length >= maxUnstakeRequests) revert TooManyUnstakeRequests();
// Check that this prover is not in the process of being slashed.
if (slashClaims[prover].length > 0) revert ProverHasSlashRequest();
// Get the amount of $stPROVE this staker currently has.
uint256 stPROVEBalance = balanceOf(msg.sender);
// Get the amount $stPROVE this staker has in pending unstake claims.
uint256 stPROVEClaim = _getUnstakeClaimBalance(msg.sender);
// Check that this staker has enough $stPROVE to unstake this amount.
if (stPROVEBalance < stPROVEClaim + _stPROVE) revert InsufficientStakeBalance();
// Get the amount of $iPROVE that would be received if the specified $stPROVE was redeemed.
uint256 iPROVESnapshot = IERC4626(prover).previewRedeem(_stPROVE);
// Create a claim to unstake $stPROVE from the prover for the specified amount.
unstakeClaims[msg.sender].push(
UnstakeClaim({
stPROVE: _stPROVE,
iPROVESnapshot: iPROVESnapshot,
timestamp: block.timestamp
})
);
emit UnstakeRequest(msg.sender, prover, _stPROVE, iPROVESnapshot);
}
/// @inheritdoc ISuccinctStaking
function finishUnstake(address _staker) external override returns (uint256 PROVE) {
// Get the prover that the staker is staked with.
address prover = stakerToProver[_staker];
if (prover == address(0)) revert NotStaked();
// Get the unstake claims for this staker.
UnstakeClaim[] storage claims = unstakeClaims[_staker];
if (claims.length == 0) revert NoUnstakeRequests();
// Check that this prover is not in the process of being slashed.
if (slashClaims[prover].length > 0) revert ProverHasSlashRequest();
// Process the available unstake claims.
PROVE += _finishUnstake(_staker, prover, claims);
// If the staker has no remaining balance with this prover, remove the staker's delegate.
// This allows them to choose a different prover if they stake again.
if (balanceOf(_staker) == 0) {
// Remove the staker's prover delegation.
stakerToProver[_staker] = address(0);
}
}
/*//////////////////////////////////////////////////////////////
VAPP
//////////////////////////////////////////////////////////////*/
/// @inheritdoc ISuccinctStaking
function requestSlash(address _prover, uint256 _iPROVE)
external
override
onlyVApp
onlyForProver(_prover)
returns (uint256 index)
{
// Ensure slashing a non-zero amount.
if (_iPROVE == 0) revert ZeroAmount();
// Create the slash claim.
index = slashClaims[_prover].length;
slashClaims[_prover].push(SlashClaim({iPROVE: _iPROVE, timestamp: block.timestamp}));
emit SlashRequest(_prover, _iPROVE, index);
}
/*//////////////////////////////////////////////////////////////
OWNER
//////////////////////////////////////////////////////////////*/
/// @inheritdoc ISuccinctStaking
function cancelSlash(address _prover, uint256 _index)
external
override
onlyOwner
onlyForProver(_prover)
{
// Get the amount of $iPROVE.
uint256 iPROVE = slashClaims[_prover][_index].iPROVE;
// Delete the claim.
if (_index != slashClaims[_prover].length - 1) {
slashClaims[_prover][_index] = slashClaims[_prover][slashClaims[_prover].length - 1];
}
slashClaims[_prover].pop();
emit SlashCancel(_prover, iPROVE, _index);
}
/// @inheritdoc ISuccinctStaking
function finishSlash(address _prover, uint256 _index)
external
override
onlyOwner
onlyForProver(_prover)
returns (uint256 iPROVE)
{
// Get the slash claim.
SlashClaim storage claim = slashClaims[_prover][_index];
// Ensure that the time has passed since the claim was created.
if (block.timestamp < claim.timestamp + slashPeriod) revert SlashNotReady();
// Determine how much can actually be slashed (cannot exceed the prover's current balance).
uint256 iPROVEBalance = IERC4626(_prover).totalAssets();
iPROVE = claim.iPROVE > iPROVEBalance ? iPROVEBalance : claim.iPROVE;
// Delete the claim.
if (_index != slashClaims[_prover].length - 1) {
slashClaims[_prover][_index] = slashClaims[_prover][slashClaims[_prover].length - 1];
}
slashClaims[_prover].pop();
// Burn the $iPROVE and underlying $PROVE. This reduces the stake of the prover and all
// of its stakers proportionally.
uint256 PROVE = 0;
if (iPROVE > 0) {
PROVE = IIntermediateSuccinct(iProve).burn(_prover, iPROVE);
}
emit Slash(_prover, PROVE, iPROVE, _index);
}
/// @inheritdoc ISuccinctStaking
function dispense(uint256 _PROVE) external override onlyOwner {
// Get the maximum amount of $PROVE that can be dispensed.
uint256 available = maxDispense();
// If caller passed in type(uint256).max, attempt to dispense the full available amount.
uint256 amount = _PROVE == type(uint256).max ? available : _PROVE;
// Ensure dispensing a non‐zero amount.
if (amount == 0) revert ZeroAmount();
// If caller passed a specific number, make sure it doesn't exceed available
if (amount > available) revert AmountExceedsAvailableDispense();
// Update the timestamp based on the (possibly‐adjusted) amount
uint256 timeConsumed = (amount + dispenseRate - 1) / dispenseRate;
lastDispenseTimestamp += timeConsumed;
// Transfer the amount to the iPROVE vault. This distributes the $PROVE to all stakers.
IERC20(prove).safeTransfer(iProve, amount);
emit Dispense(amount);
}
/// @inheritdoc ISuccinctStaking
function updateDispenseRate(uint256 _rate) external override onlyOwner {
_updateDispenseRate(_rate);
}
/*//////////////////////////////////////////////////////////////
INTERNAL
//////////////////////////////////////////////////////////////*/
/// @dev Deposit a staker's $PROVE to mint $iPROVE, then deposit $iPROVE to mint $PROVER-N, and
/// then directly mint $stPROVE to the staker, which acts as the receipt token for staking.
function _stake(address _staker, address _prover, uint256 _PROVE)
internal
stakingOperation
returns (uint256 stPROVE)
{
// Ensure staking a non-zero amount.
if (_PROVE == 0) revert ZeroAmount();
// Ensure the staking amount is greater than the minimum stake amount.
if (_PROVE < minStakeAmount) revert StakeBelowMinimum();
// Check that this prover is not in the process of being slashed.
if (slashClaims[_prover].length > 0) revert ProverHasSlashRequest();
// Ensure the staker is not already staked with a different prover.
address existingProver = stakerToProver[_staker];
if (existingProver != address(0) && existingProver != _prover) {
revert AlreadyStakedWithDifferentProver(existingProver);
}
// Set the prover as the staker's delegate.
if (existingProver == address(0)) {
stakerToProver[_staker] = _prover;
}
// Deposit $PROVE to mint $iPROVE, sending it to this contract.
uint256 iPROVE = IERC4626(iProve).deposit(_PROVE, address(this));
// Ensure this contract received non-zero $iPROVE.
if (iPROVE == 0) revert ZeroReceiptAmount();
// Deposit $iPROVE to mint $PROVER-N, sending it to this contract.
// Note: The $stPROVE variable is used because it is 1:1 with the received $PROVER-N.
stPROVE = IERC4626(_prover).deposit(iPROVE, address(this));
// Ensure this contract received non-zero $PROVER-N.
if (stPROVE == 0) revert ZeroReceiptAmount();
// Mint $stPROVE to the staker as a receipt token representing their ownership of $PROVER-N.
_mint(_staker, stPROVE);
emit Stake(_staker, _prover, _PROVE, iPROVE, stPROVE);
}
/// @dev Burn a staker's $stPROVE and withdraw $PROVER-N to receive $iPROVE, then withdraw
/// $iPROVE to receive $PROVE, which gets sent to the staker.
///
/// The actual $iPROVE withdrawn is adjusted to ensure that prover rewards earned during the
/// unstaking period do not go to the staker, while ensuring that slashing that occurs during
/// the unstaking period does. This is implemented as follows:
/// - If received $iPROVE > snapshot $iPROVE: Rewards were earned during unstaking, so the
/// staker redeems only the snapshot amount, and the excess is returned to the prover.
/// - If received $iPROVE < snapshot $iPROVE: Slashing occurred during unstaking, so the
/// staker redeems the lower amount (received $iPROVE), bearing the loss from slashing.
function _unstake(address _staker, address _prover, uint256 _stPROVE, uint256 _iPROVESnapshot)
internal
returns (uint256 PROVE)
{
// Ensure unstaking a non-zero amount.
if (_stPROVE == 0) revert ZeroAmount();
// Burn the $stPROVE from the staker
_burn(_staker, _stPROVE);
// Withdraw $PROVER-N from this contract to have this contract receive $iPROVE.
uint256 iPROVEReceived = IERC4626(_prover).redeem(_stPROVE, address(this), address(this));
// Determine how much $iPROVE to redeem for the staker based on rewards or slashing.
uint256 iPROVE;
if (iPROVEReceived > _iPROVESnapshot) {
// Rewards were earned during unstaking. Return the excess to the prover.
uint256 excess = iPROVEReceived - _iPROVESnapshot;
IERC20(iProve).safeTransfer(_prover, excess);
iPROVE = _iPROVESnapshot;
} else {
// Either no change or slashing occurred. Staker gets what's available.
iPROVE = iPROVEReceived;
}
// Withdraw $iPROVE from this contract to have the staker receive $PROVE.
PROVE = IERC4626(iProve).redeem(iPROVE, _staker, address(this));
emit Unstake(_staker, _prover, PROVE, iPROVE, _stPROVE);
}
/// @dev Iterate over the unstake claims, processing each one that has passed the unstake
/// period.
function _finishUnstake(address _staker, address _prover, UnstakeClaim[] storage _claims)
internal
stakingOperation
returns (uint256 PROVE)
{
uint256 i = 0;
uint256 stPROVE = 0;
uint256 iPROVESnapshot = 0;
// Identify ready claims and calculate totals.
while (i < _claims.length) {
if (block.timestamp >= _claims[i].timestamp + unstakePeriod) {
// Store claim before modifying the array.
UnstakeClaim memory claim = _claims[i];
// Swap with the last element and pop.
_claims[i] = _claims[_claims.length - 1];
_claims.pop();
// Add to the total amount to be unstaked.
stPROVE += claim.stPROVE;
iPROVESnapshot += claim.iPROVESnapshot;
} else {
i++;
}
}
// Ensure that at least one claim was found ready to be finished.
if (stPROVE == 0) {
revert NoReadyUnstakeRequests();
}
// Process the unstake.
PROVE = _unstake(_staker, _prover, stPROVE, iPROVESnapshot);
}
/// @dev Get the $stPROVE sum of all unstake claims for a staker.
function _getUnstakeClaimBalance(address _staker) internal view returns (uint256 stPROVE) {
for (uint256 i = 0; i < unstakeClaims[_staker].length; i++) {
stPROVE += unstakeClaims[_staker][i].stPROVE;
}
}
/// @dev Set the new dispense rate.
function _updateDispenseRate(uint256 _dispenseRate) internal {
emit DispenseRateUpdate(dispenseRate, _dispenseRate);
dispenseRate = _dispenseRate;
}
}Contract ABI
API[{"inputs":[{"internalType":"address","name":"_owner","type":"address"}],"stateMutability":"nonpayable","type":"constructor"},{"inputs":[{"internalType":"address","name":"existingProver","type":"address"}],"name":"AlreadyStakedWithDifferentProver","type":"error"},{"inputs":[],"name":"AmountExceedsAvailableDispense","type":"error"},{"inputs":[],"name":"Create2EmptyBytecode","type":"error"},{"inputs":[{"internalType":"address","name":"spender","type":"address"},{"internalType":"uint256","name":"allowance","type":"uint256"},{"internalType":"uint256","name":"needed","type":"uint256"}],"name":"ERC20InsufficientAllowance","type":"error"},{"inputs":[{"internalType":"address","name":"sender","type":"address"},{"internalType":"uint256","name":"balance","type":"uint256"},{"internalType":"uint256","name":"needed","type":"uint256"}],"name":"ERC20InsufficientBalance","type":"error"},{"inputs":[{"internalType":"address","name":"approver","type":"address"}],"name":"ERC20InvalidApprover","type":"error"},{"inputs":[{"internalType":"address","name":"receiver","type":"address"}],"name":"ERC20InvalidReceiver","type":"error"},{"inputs":[{"internalType":"address","name":"sender","type":"address"}],"name":"ERC20InvalidSender","type":"error"},{"inputs":[{"internalType":"address","name":"spender","type":"address"}],"name":"ERC20InvalidSpender","type":"error"},{"inputs":[],"name":"FailedDeployment","type":"error"},{"inputs":[{"internalType":"uint256","name":"balance","type":"uint256"},{"internalType":"uint256","name":"needed","type":"uint256"}],"name":"InsufficientBalance","type":"error"},{"inputs":[],"name":"InsufficientStakeBalance","type":"error"},{"inputs":[],"name":"InvalidInitialization","type":"error"},{"inputs":[],"name":"InvalidStakerFeeBips","type":"error"},{"inputs":[],"name":"NoReadyUnstakeRequests","type":"error"},{"inputs":[],"name":"NoUnstakeRequests","type":"error"},{"inputs":[],"name":"NonTransferable","type":"error"},{"inputs":[],"name":"NotAuthorized","type":"error"},{"inputs":[],"name":"NotInitialized","type":"error"},{"inputs":[],"name":"NotInitializing","type":"error"},{"inputs":[],"name":"NotStaked","type":"error"},{"inputs":[{"internalType":"address","name":"owner","type":"address"}],"name":"OwnableInvalidOwner","type":"error"},{"inputs":[{"internalType":"address","name":"account","type":"address"}],"name":"OwnableUnauthorizedAccount","type":"error"},{"inputs":[],"name":"ProverAlreadyExists","type":"error"},{"inputs":[],"name":"ProverHasSlashRequest","type":"error"},{"inputs":[],"name":"ProverNotFound","type":"error"},{"inputs":[{"internalType":"address","name":"token","type":"address"}],"name":"SafeERC20FailedOperation","type":"error"},{"inputs":[],"name":"SlashNotReady","type":"error"},{"inputs":[],"name":"StakeBelowMinimum","type":"error"},{"inputs":[],"name":"TooManyUnstakeRequests","type":"error"},{"inputs":[],"name":"ZeroAddress","type":"error"},{"inputs":[],"name":"ZeroAmount","type":"error"},{"inputs":[],"name":"ZeroReceiptAmount","type":"error"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"owner","type":"address"},{"indexed":true,"internalType":"address","name":"spender","type":"address"},{"indexed":false,"internalType":"uint256","name":"value","type":"uint256"}],"name":"Approval","type":"event"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"uint256","name":"PROVE","type":"uint256"}],"name":"Dispense","type":"event"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"uint256","name":"oldDispenseRate","type":"uint256"},{"indexed":false,"internalType":"uint256","name":"newDispenseRate","type":"uint256"}],"name":"DispenseRateUpdate","type":"event"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"uint64","name":"version","type":"uint64"}],"name":"Initialized","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":"prover","type":"address"},{"indexed":false,"internalType":"address","name":"owner","type":"address"},{"indexed":false,"internalType":"uint256","name":"stakerFeeBips","type":"uint256"}],"name":"ProverDeploy","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"prover","type":"address"},{"indexed":false,"internalType":"uint256","name":"PROVE","type":"uint256"}],"name":"Reward","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"prover","type":"address"},{"indexed":false,"internalType":"uint256","name":"PROVE","type":"uint256"},{"indexed":false,"internalType":"uint256","name":"iPROVE","type":"uint256"},{"indexed":false,"internalType":"uint256","name":"index","type":"uint256"}],"name":"Slash","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"prover","type":"address"},{"indexed":false,"internalType":"uint256","name":"iPROVE","type":"uint256"},{"indexed":false,"internalType":"uint256","name":"index","type":"uint256"}],"name":"SlashCancel","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"prover","type":"address"},{"indexed":false,"internalType":"uint256","name":"iPROVE","type":"uint256"},{"indexed":false,"internalType":"uint256","name":"index","type":"uint256"}],"name":"SlashRequest","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"staker","type":"address"},{"indexed":true,"internalType":"address","name":"prover","type":"address"},{"indexed":false,"internalType":"uint256","name":"PROVE","type":"uint256"},{"indexed":false,"internalType":"uint256","name":"iPROVE","type":"uint256"},{"indexed":false,"internalType":"uint256","name":"stPROVE","type":"uint256"}],"name":"Stake","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"from","type":"address"},{"indexed":true,"internalType":"address","name":"to","type":"address"},{"indexed":false,"internalType":"uint256","name":"value","type":"uint256"}],"name":"Transfer","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"staker","type":"address"},{"indexed":true,"internalType":"address","name":"prover","type":"address"},{"indexed":false,"internalType":"uint256","name":"PROVE","type":"uint256"},{"indexed":false,"internalType":"uint256","name":"iPROVE","type":"uint256"},{"indexed":false,"internalType":"uint256","name":"stPROVE","type":"uint256"}],"name":"Unstake","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"staker","type":"address"},{"indexed":true,"internalType":"address","name":"prover","type":"address"},{"indexed":false,"internalType":"uint256","name":"stPROVE","type":"uint256"},{"indexed":false,"internalType":"uint256","name":"iPROVESnapshot","type":"uint256"}],"name":"UnstakeRequest","type":"event"},{"inputs":[{"internalType":"address","name":"owner","type":"address"},{"internalType":"address","name":"spender","type":"address"}],"name":"allowance","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"spender","type":"address"},{"internalType":"uint256","name":"value","type":"uint256"}],"name":"approve","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"account","type":"address"}],"name":"balanceOf","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"_prover","type":"address"},{"internalType":"uint256","name":"_index","type":"uint256"}],"name":"cancelSlash","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"_stakerFeeBips","type":"uint256"}],"name":"createProver","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"decimals","outputs":[{"internalType":"uint8","name":"","type":"uint8"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"_PROVE","type":"uint256"}],"name":"dispense","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"dispenseRate","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"_prover","type":"address"},{"internalType":"uint256","name":"_index","type":"uint256"}],"name":"finishSlash","outputs":[{"internalType":"uint256","name":"iPROVE","type":"uint256"}],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"_staker","type":"address"}],"name":"finishUnstake","outputs":[{"internalType":"uint256","name":"PROVE","type":"uint256"}],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"_owner","type":"address"}],"name":"getProver","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"governor","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"_owner","type":"address"}],"name":"hasProver","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"iProve","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"_governor","type":"address"},{"internalType":"address","name":"_vApp","type":"address"},{"internalType":"address","name":"_prove","type":"address"},{"internalType":"address","name":"_intermediateProve","type":"address"},{"internalType":"uint256","name":"_minStakeAmount","type":"uint256"},{"internalType":"uint256","name":"_maxUnstakeRequests","type":"uint256"},{"internalType":"uint256","name":"_unstakePeriod","type":"uint256"},{"internalType":"uint256","name":"_slashPeriod","type":"uint256"},{"internalType":"uint256","name":"_dispenseRate","type":"uint256"}],"name":"initialize","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"_prover","type":"address"}],"name":"isProver","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"lastDispenseTimestamp","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"maxDispense","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"maxUnstakeRequests","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"minStakeAmount","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"name","outputs":[{"internalType":"string","name":"","type":"string"}],"stateMutability":"pure","type":"function"},{"inputs":[],"name":"owner","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"_prover","type":"address"}],"name":"ownerOf","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"_prover","type":"address"},{"internalType":"address","name":"_from","type":"address"},{"internalType":"uint256","name":"_PROVE","type":"uint256"},{"internalType":"uint256","name":"_deadline","type":"uint256"},{"internalType":"uint8","name":"_v","type":"uint8"},{"internalType":"bytes32","name":"_r","type":"bytes32"},{"internalType":"bytes32","name":"_s","type":"bytes32"}],"name":"permitAndStake","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"_prover","type":"address"},{"internalType":"uint256","name":"_stPROVE","type":"uint256"}],"name":"previewUnstake","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"prove","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"proverCount","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"_prover","type":"address"}],"name":"proverStaked","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"renounceOwnership","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"_prover","type":"address"},{"internalType":"uint256","name":"_iPROVE","type":"uint256"}],"name":"requestSlash","outputs":[{"internalType":"uint256","name":"index","type":"uint256"}],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"_stPROVE","type":"uint256"}],"name":"requestUnstake","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"slashPeriod","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"_prover","type":"address"}],"name":"slashRequests","outputs":[{"components":[{"internalType":"uint256","name":"iPROVE","type":"uint256"},{"internalType":"uint256","name":"timestamp","type":"uint256"}],"internalType":"struct ISuccinctStaking.SlashClaim[]","name":"","type":"tuple[]"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"_prover","type":"address"},{"internalType":"uint256","name":"_PROVE","type":"uint256"}],"name":"stake","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"_staker","type":"address"}],"name":"staked","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"_staker","type":"address"}],"name":"stakedTo","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"symbol","outputs":[{"internalType":"string","name":"","type":"string"}],"stateMutability":"pure","type":"function"},{"inputs":[],"name":"totalSupply","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"to","type":"address"},{"internalType":"uint256","name":"value","type":"uint256"}],"name":"transfer","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"from","type":"address"},{"internalType":"address","name":"to","type":"address"},{"internalType":"uint256","name":"value","type":"uint256"}],"name":"transferFrom","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"newOwner","type":"address"}],"name":"transferOwnership","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"_staker","type":"address"}],"name":"unstakePending","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"unstakePeriod","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"_staker","type":"address"}],"name":"unstakeRequests","outputs":[{"components":[{"internalType":"uint256","name":"stPROVE","type":"uint256"},{"internalType":"uint256","name":"iPROVESnapshot","type":"uint256"},{"internalType":"uint256","name":"timestamp","type":"uint256"}],"internalType":"struct ISuccinctStaking.UnstakeClaim[]","name":"","type":"tuple[]"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"_rate","type":"uint256"}],"name":"updateDispenseRate","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"vapp","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"}]Contract Creation Code
608060405234801561000f575f5ffd5b5060405161524038038061524083398101604081905261002e9161011b565b604080518082018252600e81526d14dd185ad95914dd58d8da5b98dd60921b60208083019190915282518084019093526007835266737450524f564560c81b9083015290826001600160a01b0381166100a057604051631e4fbdf760e01b81525f600482015260240160405180910390fd5b6100a9816100cc565b50600b6100b683826101e0565b50600c6100c382826101e0565b5050505061029a565b5f80546001600160a01b038381166001600160a01b0319831681178455604051919092169283917f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e09190a35050565b5f6020828403121561012b575f5ffd5b81516001600160a01b0381168114610141575f5ffd5b9392505050565b634e487b7160e01b5f52604160045260245ffd5b600181811c9082168061017057607f821691505b60208210810361018e57634e487b7160e01b5f52602260045260245ffd5b50919050565b601f8211156101db57805f5260205f20601f840160051c810160208510156101b95750805b601f840160051c820191505b818110156101d8575f81556001016101c5565b50505b505050565b81516001600160401b038111156101f9576101f9610148565b61020d81610207845461015c565b84610194565b6020601f82116001811461023f575f83156102285750848201515b5f19600385901b1c1916600184901b1784556101d8565b5f84815260208120601f198516915b8281101561026e578785015182556020948501946001909201910161024e565b508482101561028b57868401515f19600387901b60f8161c191681555b50505050600190811b01905550565b614f99806102a75f395ff3fe608060405234801561000f575f5ffd5b5060043610610281575f3560e01c80638946d5bb11610156578063ad81f8a5116100ca578063e0eb4d2e11610084578063e0eb4d2e14610625578063e4aa64ab14610645578063f18876841461064e578063f2fde38b14610657578063faab193c1461066a578063fbb637de14610695575f5ffd5b8063ad81f8a51461058b578063adc9772e14610594578063b86cca40146105a7578063beb3e382146105ba578063c0ba8a04146105cd578063dd62ed3e146105ed575f5ffd5b806398807d841161011b57806398807d841461052d57806399f7a93414610540578063a4897f1e14610553578063a7602c7e14610566578063a9059cbb1461056f578063abf93b3614610582575f5ffd5b80638946d5bb146104cb5780638c8c47a9146104de5780638da5cb5b146104f1578063936d53751461050157806395d89b411461050a575f5ffd5b806323b872dd116101f857806356d32824116101b257806356d328241461044f57806358ca6bae14610462578063638f261c146104755780636f843f591461048857806370a082311461049b578063715018a6146104c3575f5ffd5b806323b872dd146103d1578063313ce567146103e45780633d31c5b1146103f35780633e2588381461040657806345152ae3146104335780635023199014610446575f5ffd5b80630c340a24116102495780630c340a241461033a57806314afd79e14610365578063178391311461037857806318160ddd146103a35780631be4bf83146103ab57806323095721146103be575f5ffd5b8063011cf2511461028557806306fdde031461029a5780630725bc10146102d6578063095ea7b3146102ec5780630a2459241461030f575b5f5ffd5b610298610293366004612896565b6106a8565b005b60408051808201909152600e81526d14dd185ad95914dd58d8da5b98dd60921b60208201525b6040516102cd91906128c0565b60405180910390f35b6102de61087a565b6040519081526020016102cd565b6102ff6102fa366004612896565b6108a0565b60405190151581526020016102cd565b6102ff61031d3660046128f5565b6001600160a01b03165f9081526007602052604090205460ff1690565b60015461034d906001600160a01b031681565b6040516001600160a01b0390911681526020016102cd565b61034d6103733660046128f5565b6108b9565b61034d6103863660046128f5565b6001600160a01b039081165f908152601360205260409020541690565b600a546102de565b6102de6103b9366004612896565b61091a565b6102986103cc366004612910565b610c15565b6102ff6103df366004612927565b610e27565b604051601281526020016102cd565b6102de6104013660046128f5565b610e4c565b6102ff6104143660046128f5565b6001600160a01b039081165f9081526006602052604090205416151590565b60035461034d906001600160a01b031681565b6102de60105481565b6102de61045d3660046128f5565b610f21565b6102de6104703660046128f5565b611031565b60045461034d906001600160a01b031681565b6102de610496366004612896565b611067565b6102de6104a93660046128f5565b6001600160a01b03165f9081526008602052604090205490565b61029861114d565b6102986104d9366004612910565b611160565b60025461034d906001600160a01b031681565b5f546001600160a01b031661034d565b6102de60055481565b604080518082019091526007815266737450524f564560c81b60208201526102c0565b6102de61053b3660046128f5565b61125a565b6102de61054e366004612896565b6112a5565b6102de610561366004612965565b6113bd565b6102de600e5481565b6102ff61057d366004612896565b6114f3565b6102de60115481565b6102de60125481565b6102de6105a2366004612896565b611500565b6102986105b5366004612910565b61155d565b6102986105c83660046129d6565b611571565b6105e06105db3660046128f5565b61180a565b6040516102cd9190612a5a565b6102de6105fb366004612aa8565b6001600160a01b039182165f90815260096020908152604080832093909416825291909152205490565b6106386106333660046128f5565b61188f565b6040516102cd9190612adf565b6102de600f5481565b6102de600d5481565b6102986106653660046128f5565b611913565b61034d6106783660046128f5565b6001600160a01b039081165f908152600660205260409020541690565b61034d6106a3366004612910565b611952565b6106b06119b6565b6001600160a01b0382165f90815260076020526040902054829060ff166106ea5760405163070b036f60e11b815260040160405180910390fd5b6001600160a01b0383165f90815260156020526040812080548490811061071357610713612b32565b5f91825260208083206002909202909101546001600160a01b0387168352601590915260409091205490915061074b90600190612b5a565b83146107e4576001600160a01b0384165f908152601560205260409020805461077690600190612b5a565b8154811061078657610786612b32565b905f5260205f20906002020160155f866001600160a01b03166001600160a01b031681526020019081526020015f2084815481106107c6576107c6612b32565b5f918252602090912082546002909202019081556001918201549101555b6001600160a01b0384165f90815260156020526040902080548061080a5761080a612b6d565b5f8281526020812060025f19909301928302018181556001015590556040516001600160a01b038516907fd8fd49113c6dd4e2d5da3a0ba44bad273692645b715dcb3a6e20521949f9f7bd9061086c9084908790918252602082015260400190565b60405180910390a250505050565b5f5f6012544261088a9190612b5a565b90506011548161089a9190612b81565b91505090565b5f336108ad8185856119e2565b60019150505b92915050565b5f816001600160a01b0316638da5cb5b6040518163ffffffff1660e01b8152600401602060405180830381865afa1580156108f6573d5f5f3e3d5ffd5b505050506040513d601f19601f820116820180604052508101906108b39190612b98565b5f6109236119b6565b6001600160a01b0383165f90815260076020526040902054839060ff1661095d5760405163070b036f60e11b815260040160405180910390fd5b6001600160a01b0384165f90815260156020526040812080548590811061098657610986612b32565b905f5260205f209060020201905060105481600101546109a69190612bb3565b4210156109c657604051637200f0d160e11b815260040160405180910390fd5b5f856001600160a01b03166301e1d1146040518163ffffffff1660e01b8152600401602060405180830381865afa158015610a03573d5f5f3e3d5ffd5b505050506040513d601f19601f82011682018060405250810190610a279190612bc6565b905080825f015411610a3a578154610a3c565b805b6001600160a01b0387165f90815260156020526040902054909450610a6390600190612b5a565b8514610afc576001600160a01b0386165f9081526015602052604090208054610a8e90600190612b5a565b81548110610a9e57610a9e612b32565b905f5260205f20906002020160155f886001600160a01b03166001600160a01b031681526020019081526020015f208681548110610ade57610ade612b32565b5f918252602090912082546002909202019081556001918201549101555b6001600160a01b0386165f908152601560205260409020805480610b2257610b22612b6d565b5f8281526020812060025f199093019283020181815560010181905591558415610bbf5760048054604051632770a7eb60e21b81526001600160a01b038a81169382019390935260248101889052911690639dc29fac906044016020604051808303815f875af1158015610b98573d5f5f3e3d5ffd5b505050506040513d601f19601f82011682018060405250810190610bbc9190612bc6565b90505b60408051828152602081018790529081018790526001600160a01b038816907f570ef8d8ae509a4cb1fffadfc2ad7db3d60796e286d401b1909d2458cbd38bea9060600160405180910390a25050505092915050565b805f03610c3557604051631f2a200560e01b815260040160405180910390fd5b335f908152601360205260409020546001600160a01b031680610c6a576040516273e5c360e31b815260040160405180910390fd5b600e54335f9081526014602052604090205410610c9a57604051630d2dae8360e31b815260040160405180910390fd5b6001600160a01b0381165f9081526015602052604090205415610cd0576040516331a0131960e11b815260040160405180910390fd5b335f8181526008602052604081205491610ce9906119f4565b9050610cf58482612bb3565b821015610d155760405163263892ab60e01b815260040160405180910390fd5b60405163266d6a8360e11b8152600481018590525f906001600160a01b03851690634cdad50690602401602060405180830381865afa158015610d5a573d5f5f3e3d5ffd5b505050506040513d601f19601f82011682018060405250810190610d7e9190612bc6565b335f81815260146020908152604080832081516060810183528b815280840187815242828501908152835460018181018655948852959096209151600390950290910193845551908301559151600290910155519192506001600160a01b038616917fca2040cb9509984d9478924c31646bfe6793e8577610518ef8b6b7922df2957590610e189089908690918252602082015260400190565b60405180910390a35050505050565b5f33610e34858285611a69565b610e3f858585611ae5565b60019150505b9392505050565b5f5f826001600160a01b03166301e1d1146040518163ffffffff1660e01b8152600401602060405180830381865afa158015610e8a573d5f5f3e3d5ffd5b505050506040513d601f19601f82011682018060405250810190610eae9190612bc6565b6004805460405163266d6a8360e11b81529293506001600160a01b031691634cdad50691610ee29185910190815260200190565b602060405180830381865afa158015610efd573d5f5f3e3d5ffd5b505050506040513d601f19601f82011682018060405250810190610e459190612bc6565b6001600160a01b038082165f9081526013602052604081205490911680610f5a576040516273e5c360e31b815260040160405180910390fd5b6001600160a01b0383165f9081526014602052604081208054909103610f93576040516352ec7ab160e01b815260040160405180910390fd5b6001600160a01b0382165f9081526015602052604090205415610fc9576040516331a0131960e11b815260040160405180910390fd5b610fd4848383611b42565b610fde9084612bb3565b9250610ffe846001600160a01b03165f9081526008602052604090205490565b5f0361102a576001600160a01b0384165f90815260136020526040902080546001600160a01b03191690555b5050919050565b6001600160a01b038082165f908152601360205260408120549091168061105a57505f92915050565b610e4581610496856119f4565b60405163266d6a8360e11b8152600481018290525f9081906001600160a01b03851690634cdad50690602401602060405180830381865afa1580156110ae573d5f5f3e3d5ffd5b505050506040513d601f19601f820116820180604052508101906110d29190612bc6565b6004805460405163266d6a8360e11b81529293506001600160a01b031691634cdad506916111069185910190815260200190565b602060405180830381865afa158015611121573d5f5f3e3d5ffd5b505050506040513d601f19601f820116820180604052508101906111459190612bc6565b949350505050565b6111556119b6565b61115e5f611cf1565b565b6111686119b6565b5f61117161087a565b90505f5f1983146111825782611184565b815b9050805f036111a657604051631f2a200560e01b815260040160405180910390fd5b818111156111c757604051630b23ebbb60e01b815260040160405180910390fd5b6011545f9060016111d88285612bb3565b6111e29190612b5a565b6111ec9190612bdd565b90508060125f8282546111ff9190612bb3565b9091555050600454600354611221916001600160a01b03918216911684611d40565b6040518281527fb59bad24927dac29805ea39ded120e7c36f87259e62f991943a6578732aa9eec9060200160405180910390a150505050565b6001600160a01b038082165f908152601360205260408120549091168061128357505f92915050565b610e4581610496856001600160a01b03165f9081526008602052604090205490565b6002545f906001600160a01b031633146112d25760405163ea8e4eb560e01b815260040160405180910390fd5b6001600160a01b0383165f90815260076020526040902054839060ff1661130c5760405163070b036f60e11b815260040160405180910390fd5b825f0361132c57604051631f2a200560e01b815260040160405180910390fd5b6001600160a01b0384165f8181526015602090815260408083208054825180840184528981524281860190815260018084018555938752958590209051600283029091019081559451949091019390935580518781529182018390529194507f355bf731360b0ea9d2f13d7845614d6c07a1e9f9a995483c17a3e7ba21ae9124910160405180910390a25092915050565b6001600160a01b0387165f90815260076020526040812054889060ff166113f75760405163070b036f60e11b815260040160405180910390fd5b60035460405163d505accf60e01b81526001600160a01b038a811660048301528b81166024830152604482018a90526064820189905260ff8816608483015260a4820187905260c482018690529091169063d505accf9060e4015f604051808303815f87803b158015611468575f5ffd5b505af115801561147a573d5f5f3e3d5ffd5b50506040516307931c7d60e51b81526001600160a01b038b81166004830152602482018b90528c16925063f2638fa091506044015f604051808303815f87803b1580156114c5575f5ffd5b505af11580156114d7573d5f5f3e3d5ffd5b505050506114e6888a89611d9f565b9998505050505050505050565b5f336108ad818585611ae5565b6001600160a01b0382165f90815260076020526040812054839060ff1661153a5760405163070b036f60e11b815260040160405180910390fd5b600354611552906001600160a01b031633308661205b565b611145338585611d9f565b6115656119b6565b61156e81612094565b50565b6115796119b6565b7ff0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a008054600160401b810460ff16159067ffffffffffffffff165f811580156115be5750825b90505f8267ffffffffffffffff1660011480156115da5750303b155b9050811580156115e8575080155b156116065760405163f92ee8a960e01b815260040160405180910390fd5b845467ffffffffffffffff19166001178555831561163057845460ff60401b1916600160401b1785555b6001600160a01b038e16158061164d57506001600160a01b038d16155b8061165f57506001600160a01b038c16155b8061167157506001600160a01b038b16155b1561168f5760405163d92e233d60e01b815260040160405180910390fd5b88158061169a575087155b806116a3575086155b156116c157604051631f2a200560e01b815260040160405180910390fd5b6117188e8e8e8e600180546001600160a01b039586166001600160a01b0319918216179091556002805494861694821694909417909355600380549285169284169290921790915560048054919093169116179055565b600d8a9055600e899055600f889055601087905561173586612094565b426012556003546004805460405163095ea7b360e01b81526001600160a01b03918216928101929092525f1960248301529091169063095ea7b3906044016020604051808303815f875af115801561178f573d5f5f3e3d5ffd5b505050506040513d601f19601f820116820180604052508101906117b39190612bfc565b5083156117fa57845460ff60401b19168555604051600181527fc7f505b2f371ae2175ee4913f4499e1f2633a7b5936321eed1cdaeb6115181d29060200160405180910390a15b5050505050505050505050505050565b6001600160a01b0381165f908152601560209081526040808320805482518185028101850190935280835260609492939192909184015b82821015611884578382905f5260205f2090600202016040518060400160405290815f820154815260200160018201548152505081526020019060010190611841565b505050509050919050565b6001600160a01b0381165f908152601460209081526040808320805482518185028101850190935280835260609492939192909184015b82821015611884578382905f5260205f2090600302016040518060600160405290815f820154815260200160018201548152602001600282015481525050815260200190600101906118c6565b61191b6119b6565b6001600160a01b03811661194957604051631e4fbdf760e01b81525f60048201526024015b60405180910390fd5b61156e81611cf1565b5f6127108211156119765760405163382b206160e21b815260040160405180910390fd5b335f908152600660205260409020546001600160a01b0316156119ac576040516312db1b9960e01b815260040160405180910390fd5b6108b333836120d5565b5f546001600160a01b0316331461115e5760405163118cdaa760e01b8152336004820152602401611940565b6119ef8383836001612330565b505050565b5f805b6001600160a01b0383165f90815260146020526040902054811015611a63576001600160a01b0383165f908152601460205260409020805482908110611a3f57611a3f612b32565b905f5260205f2090600302015f015482611a599190612bb3565b91506001016119f7565b50919050565b6001600160a01b038381165f908152600960209081526040808320938616835292905220545f19811015611adf5781811015611ad157604051637dc7a0d960e11b81526001600160a01b03841660048201526024810182905260448101839052606401611940565b611adf84848484035f612330565b50505050565b6001600160a01b038316611b0e57604051634b637e8f60e11b81525f6004820152602401611940565b6001600160a01b038216611b375760405163ec442f0560e01b81525f6004820152602401611940565b6119ef838383612402565b5f600160ff19825c168117825d505f80805b8454831015611cae57600f54858481548110611b7257611b72612b32565b905f5260205f20906003020160020154611b8c9190612bb3565b4210611c9c575f858481548110611ba557611ba5612b32565b905f5260205f2090600302016040518060600160405290815f82015481526020016001820154815260200160028201548152505090508560018780549050611bed9190612b5a565b81548110611bfd57611bfd612b32565b905f5260205f209060030201868581548110611c1b57611c1b612b32565b5f91825260209091208254600390920201908155600180830154908201556002918201549101558554869080611c5357611c53612b6d565b5f8281526020812060035f1990930192830201818155600181018290556002015590558051611c829084612bb3565b9250806020015182611c949190612bb3565b915050611b54565b82611ca681612c1b565b935050611b54565b815f03611cce5760405163cdcc876d60e01b815260040160405180910390fd5b611cda8787848461242f565b93505f92505050805c60ff1916815d509392505050565b5f80546001600160a01b038381166001600160a01b0319831681178455604051919092169283917f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e09190a35050565b6040516001600160a01b038381166024830152604482018390526119ef91859182169063a9059cbb906064015b604051602081830303815290604052915060e01b6020820180516001600160e01b0383818316178352505050506125e3565b5f600160ff19825c168117825d50815f03611dcd57604051631f2a200560e01b815260040160405180910390fd5b600d54821015611df05760405163de588d7360e01b815260040160405180910390fd5b6001600160a01b0383165f9081526015602052604090205415611e26576040516331a0131960e11b815260040160405180910390fd5b6001600160a01b038085165f90815260136020526040902054168015801590611e615750836001600160a01b0316816001600160a01b031614155b15611e8a57604051635b9b5a7d60e11b81526001600160a01b0382166004820152602401611940565b6001600160a01b038116611ec6576001600160a01b038581165f90815260136020526040902080546001600160a01b0319169186169190911790555b60048054604051636e553f6560e01b81529182018590523060248301525f916001600160a01b0390911690636e553f65906044016020604051808303815f875af1158015611f16573d5f5f3e3d5ffd5b505050506040513d601f19601f82011682018060405250810190611f3a9190612bc6565b9050805f03611f5c576040516351bc3cd160e01b815260040160405180910390fd5b604051636e553f6560e01b8152600481018290523060248201526001600160a01b03861690636e553f65906044016020604051808303815f875af1158015611fa6573d5f5f3e3d5ffd5b505050506040513d601f19601f82011682018060405250810190611fca9190612bc6565b9250825f03611fec576040516351bc3cd160e01b815260040160405180910390fd5b611ff6868461264f565b60408051858152602081018390529081018490526001600160a01b0380871691908816907f4b22ccaaeb4846ec98072623a51a9070bf1f01c75ac1f8119035f373df852a0c9060600160405180910390a3505f905060ff19815c16815d509392505050565b6040516001600160a01b038481166024830152838116604483015260648201839052611adf9186918216906323b872dd90608401611d6d565b60115460408051918252602082018390527fe4d972eca672d23b64b5cc8096e8966b5da14afe132d6e6b952393ca30340c5c910160405180910390a1601155565b6004545f906001600160a01b0316612100576040516321c4e35760e21b815260040160405180910390fd5b6005805460010190556040516121b0905f906001600160a01b0386169061212960208201612875565b601f1982820381018352601f9091011660408181526001546003546004546005546001600160a01b0393841660208701529183168486015282166060850152908a16608084015260a083015260c08083018990528151808403909101815260e0830190915261219c929161010001612c4a565b604051602081830303815290604052612687565b6001600160a01b038481165f81815260066020908152604080832080546001600160a01b031916878716908117909155808452600790925291829020805460ff191660011790556002549151630a87ad3360e41b8152600481019190915260248101929092526044820186905292935091169063a87ad330906064016020604051808303815f875af1158015612248573d5f5f3e3d5ffd5b505050506040513d601f19601f8201168201806040525081019061226c9190612c5e565b506004805460405163095ea7b360e01b81526001600160a01b03848116938201939093525f19602482015291169063095ea7b3906044016020604051808303815f875af11580156122bf573d5f5f3e3d5ffd5b505050506040513d601f19601f820116820180604052508101906122e39190612bfc565b50604080516001600160a01b038581168252602082018590528316917f24fb87e4662b8a10e8c168a82984b78db07707f9a52fb81cd1a99f88994e6352910160405180910390a292915050565b6001600160a01b0384166123595760405163e602df0560e01b81525f6004820152602401611940565b6001600160a01b03831661238257604051634a1406b160e11b81525f6004820152602401611940565b6001600160a01b038085165f9081526009602090815260408083209387168352929052208290558015611adf57826001600160a01b0316846001600160a01b03167f8c5be1e5ebec7d5bd14f71427d1e84f3dd0314c0f7b2291e5b200ac8c7c3b925846040516123f491815260200190565b60405180910390a350505050565b60ff5f5c1661242457604051639cbe235760e01b815260040160405180910390fd5b6119ef83838361271b565b5f825f0361245057604051631f2a200560e01b815260040160405180910390fd5b61245a8584612841565b604051635d043b2960e11b815260048101849052306024820181905260448201525f906001600160a01b0386169063ba087652906064016020604051808303815f875af11580156124ad573d5f5f3e3d5ffd5b505050506040513d601f19601f820116820180604052508101906124d19190612bc6565b90505f8382111561250a575f6124e78584612b5a565b600454909150612501906001600160a01b03168883611d40565b8491505061250d565b50805b60048054604051635d043b2960e11b81529182018390526001600160a01b038981166024840152306044840152169063ba087652906064016020604051808303815f875af1158015612561573d5f5f3e3d5ffd5b505050506040513d601f19601f820116820180604052508101906125859190612bc6565b60408051828152602081018490529081018790529093506001600160a01b0380881691908916907ffe7007b2e89d80edda76299251df08366480cac22e5e260f5e662e850b1f7a329060600160405180910390a35050949350505050565b5f5f60205f8451602086015f885af180612602576040513d5f823e3d81fd5b50505f513d91508115612619578060011415612626565b6001600160a01b0384163b155b15611adf57604051635274afe760e01b81526001600160a01b0385166004820152602401611940565b6001600160a01b0382166126785760405163ec442f0560e01b81525f6004820152602401611940565b6126835f8383612402565b5050565b5f834710156126b25760405163cf47918160e01b815247600482015260248101859052604401611940565b81515f036126d357604051631328927760e21b815260040160405180910390fd5b8282516020840186f590503d1519811516156126f4576040513d5f823e3d81fd5b6001600160a01b038116610e455760405163b06ebf3d60e01b815260040160405180910390fd5b6001600160a01b0383166127455780600a5f82825461273a9190612bb3565b909155506127b59050565b6001600160a01b0383165f90815260086020526040902054818110156127975760405163391434e360e21b81526001600160a01b03851660048201526024810182905260448101839052606401611940565b6001600160a01b0384165f9081526008602052604090209082900390555b6001600160a01b0382166127d157600a805482900390556127ef565b6001600160a01b0382165f9081526008602052604090208054820190555b816001600160a01b0316836001600160a01b03167fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef8360405161283491815260200190565b60405180910390a3505050565b6001600160a01b03821661286a57604051634b637e8f60e11b81525f6004820152602401611940565b612683825f83612402565b6122de80612c8683390190565b6001600160a01b038116811461156e575f5ffd5b5f5f604083850312156128a7575f5ffd5b82356128b281612882565b946020939093013593505050565b602081525f82518060208401528060208501604085015e5f604082850101526040601f19601f83011684010191505092915050565b5f60208284031215612905575f5ffd5b8135610e4581612882565b5f60208284031215612920575f5ffd5b5035919050565b5f5f5f60608486031215612939575f5ffd5b833561294481612882565b9250602084013561295481612882565b929592945050506040919091013590565b5f5f5f5f5f5f5f60e0888a03121561297b575f5ffd5b873561298681612882565b9650602088013561299681612882565b95506040880135945060608801359350608088013560ff811681146129b9575f5ffd5b9699959850939692959460a0840135945060c09093013592915050565b5f5f5f5f5f5f5f5f5f6101208a8c0312156129ef575f5ffd5b89356129fa81612882565b985060208a0135612a0a81612882565b975060408a0135612a1a81612882565b965060608a0135612a2a81612882565b989b979a50959860808101359760a0820135975060c0820135965060e08201359550610100909101359350915050565b602080825282518282018190525f918401906040840190835b81811015612a9d578351805184526020908101518185015290930192604090920191600101612a73565b509095945050505050565b5f5f60408385031215612ab9575f5ffd5b8235612ac481612882565b91506020830135612ad481612882565b809150509250929050565b602080825282518282018190525f918401906040840190835b81811015612a9d57835180518452602081015160208501526040810151604085015250606083019250602084019350600181019050612af8565b634e487b7160e01b5f52603260045260245ffd5b634e487b7160e01b5f52601160045260245ffd5b818103818111156108b3576108b3612b46565b634e487b7160e01b5f52603160045260245ffd5b80820281158282048414176108b3576108b3612b46565b5f60208284031215612ba8575f5ffd5b8151610e4581612882565b808201808211156108b3576108b3612b46565b5f60208284031215612bd6575f5ffd5b5051919050565b5f82612bf757634e487b7160e01b5f52601260045260245ffd5b500490565b5f60208284031215612c0c575f5ffd5b81518015158114610e45575f5ffd5b5f60018201612c2c57612c2c612b46565b5060010190565b5f81518060208401855e5f93019283525090919050565b5f611145612c588386612c33565b84612c33565b5f60208284031215612c6e575f5ffd5b815167ffffffffffffffff81168114610e45575f5ffdfe610180604052348015610010575f5ffd5b506040516122de3803806122de83398101604081905261002f91610455565b60408051808201909152600f81526e53756363696e637450726f7665722d60881b60208201528490610060846101f3565b6040516020016100719291906104d0565b60408051601f19818403018152828201909152600782526650524f5645522d60c81b6020830152906100a2856101f3565b6040516020016100b39291906104d0565b60408051601f1981840301815291905260036100cf8382610584565b5060046100dc8282610584565b5050505f5f6100f08361028260201b60201c565b9150915081610100576012610102565b805b60ff1660a05250506001600160a01b039081166080528616158061012d57506001600160a01b038516155b8061013f57506001600160a01b038416155b8061015157506001600160a01b038316155b1561016f5760405163d92e233d60e01b815260040160405180910390fd5b3360c0526001600160a01b0386811660e05285811661010052838116610120526101408390526101608290526040516317066a5760e21b815230600482015290851690635c19a95c906024015f604051808303815f87803b1580156101d2575f5ffd5b505af11580156101e4573d5f5f3e3d5ffd5b50505050505050505050610667565b60605f6101ff83610358565b60010190505f816001600160401b0381111561021d5761021d6104ec565b6040519080825280601f01601f191660200182016040528015610247576020820181803683370190505b5090508181016020015b5f19016f181899199a1a9b1b9c1cb0b131b232b360811b600a86061a8153600a850494508461025157509392505050565b60408051600481526024810182526020810180516001600160e01b031663313ce56760e01b17905290515f918291829182916001600160a01b038716916102c89161063e565b5f60405180830381855afa9150503d805f8114610300576040519150601f19603f3d011682016040523d82523d5f602084013e610305565b606091505b509150915081801561031957506020815110155b1561034c575f818060200190518101906103339190610650565b905060ff811161034a576001969095509350505050565b505b505f9485945092505050565b5f807a184f03e93ff9f4daa797ed6e38ed64bf6a1f01000000000000000083106103a0577a184f03e93ff9f4daa797ed6e38ed64bf6a1f010000000000000000830492506040015b6d04ee2d6d415b85acef810000000083106103cc576d04ee2d6d415b85acef8100000000830492506020015b662386f26fc1000083106103ea57662386f26fc10000830492506010015b6305f5e1008310610402576305f5e100830492506008015b612710831061041657612710830492506004015b60648310610428576064830492506002015b600a8310610434576001015b92915050565b80516001600160a01b0381168114610450575f5ffd5b919050565b5f5f5f5f5f5f60c0878903121561046a575f5ffd5b6104738761043a565b95506104816020880161043a565b945061048f6040880161043a565b935061049d6060880161043a565b608088015160a090980151969995985093969395939492505050565b5f81518060208401855e5f93019283525090919050565b5f6104e46104de83866104b9565b846104b9565b949350505050565b634e487b7160e01b5f52604160045260245ffd5b600181811c9082168061051457607f821691505b60208210810361053257634e487b7160e01b5f52602260045260245ffd5b50919050565b601f82111561057f57805f5260205f20601f840160051c8101602085101561055d5750805b601f840160051c820191505b8181101561057c575f8155600101610569565b50505b505050565b81516001600160401b0381111561059d5761059d6104ec565b6105b1816105ab8454610500565b84610538565b6020601f8211600181146105e3575f83156105cc5750848201515b5f19600385901b1c1916600184901b17845561057c565b5f84815260208120601f198516915b8281101561061257878501518255602094850194600190920191016105f2565b508482101561062f57868401515f19600387901b60f8161c191681555b50505050600190811b01905550565b5f61064982846104b9565b9392505050565b5f60208284031215610660575f5ffd5b5051919050565b60805160a05160c05160e05161010051610120516101405161016051611bba6107245f395f6103ac01525f61047601525f818161042101528181610704015281816107e901526108f501525f81816103380152610b0201525f818161028a0152818161075901528181610846015261094a01525f818161037201528181610ab701528181610b2501528181610bc90152610fa001525f6106d401525f81816102fb0152818161056e01528181610c720152610d320152611bba5ff3fe608060405234801561000f575f5ffd5b5060043610610208575f3560e01c80636e553f651161011f578063b460af94116100a9578063ce96cb7711610079578063ce96cb77146104e4578063d905777e146104f7578063dd62ed3e1461050a578063ef8b30f7146104d1578063f2638fa014610542575f5ffd5b8063b460af94146104ab578063ba087652146104be578063c63d75b61461031f578063c6e6f592146104d1575f5ffd5b806394bf804d116100ef57806394bf804d1461044357806395d89b4114610456578063a9059cbb1461045e578063af640d0f14610471578063b3d7f6b914610498575f5ffd5b80636e553f65146103ce57806370a08231146103e15780637d5e81e2146104095780638da5cb5b1461041c575f5ffd5b8063313ce567116101a0578063452115d611610170578063452115d61461035a5780634cdad5061461023c5780634cf088d91461036d57806356781388146103945780636b4a5b8f146103a7575f5ffd5b8063313ce567146102df57806338d52e0f146102f9578063402d267d1461031f57806345152ae314610333575f5ffd5b80630a28a477116101db5780630a28a477146102725780630c340a241461028557806318160ddd146102c457806323b872dd146102cc575f5ffd5b806301e1d1141461020c57806306fdde031461022757806307a2d13a1461023c578063095ea7b31461024f575b5f5ffd5b610214610557565b6040519081526020015b60405180910390f35b61022f6105e4565b60405161021e9190611322565b61021461024a366004611334565b610674565b61026261025d366004611366565b610685565b604051901515815260200161021e565b610214610280366004611334565b61069c565b6102ac7f000000000000000000000000000000000000000000000000000000000000000081565b6040516001600160a01b03909116815260200161021e565b600254610214565b6102626102da36600461138e565b6106a8565b6102e76106cd565b60405160ff909116815260200161021e565b7f00000000000000000000000000000000000000000000000000000000000000006102ac565b61021461032d3660046113c8565b505f1990565b6102ac7f000000000000000000000000000000000000000000000000000000000000000081565b610214610368366004611600565b6106f8565b6102ac7f000000000000000000000000000000000000000000000000000000000000000081565b6102146103a2366004611696565b6107dd565b6102147f000000000000000000000000000000000000000000000000000000000000000081565b6102146103dc3660046116c9565b6108b8565b6102146103ef3660046113c8565b6001600160a01b03165f9081526020819052604090205490565b6102146104173660046116f3565b6108e9565b6102ac7f000000000000000000000000000000000000000000000000000000000000000081565b6102146104513660046116c9565b610985565b61022f6109a0565b61026261046c366004611366565b6109af565b6102147f000000000000000000000000000000000000000000000000000000000000000081565b6102146104a6366004611334565b6109bc565b6102146104b93660046117bf565b6109c8565b6102146104cc3660046117bf565b610a15565b6102146104df366004611334565b610a62565b6102146104f23660046113c8565b610a6d565b6102146105053660046113c8565b610a8f565b6102146105183660046117f8565b6001600160a01b039182165f90815260016020908152604080832093909416825291909152205490565b610555610550366004611366565b610aac565b005b6040516370a0823160e01b81523060048201525f907f00000000000000000000000000000000000000000000000000000000000000006001600160a01b0316906370a0823190602401602060405180830381865afa1580156105bb573d5f5f3e3d5ffd5b505050506040513d601f19601f820116820180604052508101906105df9190611820565b905090565b6060600380546105f390611837565b80601f016020809104026020016040519081016040528092919081815260200182805461061f90611837565b801561066a5780601f106106415761010080835404028352916020019161066a565b820191905f5260205f20905b81548152906001019060200180831161064d57829003601f168201915b5050505050905090565b5f61067f825f610b4e565b92915050565b5f33610692818585610b86565b5060019392505050565b5f61067f826001610b98565b5f336106b5858285610bc7565b6106c0858585610c10565b60019150505b9392505050565b5f6105df817f0000000000000000000000000000000000000000000000000000000000000000611883565b5f336001600160a01b037f0000000000000000000000000000000000000000000000000000000000000000161461074257604051636bae83cd60e01b815260040160405180910390fd5b6040516322908aeb60e11b81526001600160a01b037f0000000000000000000000000000000000000000000000000000000000000000169063452115d690610794908890889088908890600401611969565b6020604051808303815f875af11580156107b0573d5f5f3e3d5ffd5b505050506040513d601f19601f820116820180604052508101906107d49190611820565b95945050505050565b5f336001600160a01b037f0000000000000000000000000000000000000000000000000000000000000000161461082757604051636bae83cd60e01b815260040160405180910390fd5b604051630acf027160e31b81526004810184905260ff831660248201527f00000000000000000000000000000000000000000000000000000000000000006001600160a01b0316906356781388906044016020604051808303815f875af1158015610894573d5f5f3e3d5ffd5b505050506040513d601f19601f820116820180604052508101906106c69190611820565b5f5f196108c9565b60405180910390fd5b5f6108d385610a62565b90506108e133858784610c6d565b949350505050565b5f336001600160a01b037f0000000000000000000000000000000000000000000000000000000000000000161461093357604051636bae83cd60e01b815260040160405180910390fd5b604051633eaf40f160e11b81526001600160a01b037f00000000000000000000000000000000000000000000000000000000000000001690637d5e81e2906107949088908890889088906004016119d4565b5f5f195f610992856109bc565b90506108e133858388610c6d565b6060600480546105f390611837565b5f33610692818585610c10565b5f61067f826001610b4e565b5f5f6109d383610a6d565b9050808511156109fc57828582604051633fa733bb60e21b81526004016108c0939291906119b3565b5f610a068661069c565b90506107d43386868985610cff565b5f5f610a2083610a8f565b905080851115610a4957828582604051632e52afbb60e21b81526004016108c0939291906119b3565b5f610a5386610674565b90506107d4338686848a610cff565b5f61067f825f610b98565b6001600160a01b0381165f9081526020819052604081205461067f905f610b4e565b6001600160a01b0381165f9081526020819052604081205461067f565b336001600160a01b037f00000000000000000000000000000000000000000000000000000000000000001614610af557604051634487f62960e11b815260040160405180910390fd5b610b4a6001600160a01b037f000000000000000000000000000000000000000000000000000000000000000016837f000000000000000000000000000000000000000000000000000000000000000084610dbf565b5050565b5f6106c6610b5a610557565b610b65906001611a2b565b610b705f600a611b21565b600254610b7d9190611a2b565b85919085610e2c565b610b938383836001610e6e565b505050565b5f6106c6610ba782600a611b21565b600254610bb49190611a2b565b610bbc610557565b610b7d906001611a2b565b7f00000000000000000000000000000000000000000000000000000000000000006001600160a01b0316826001600160a01b031603610c0557505050565b610b93838383610f32565b6001600160a01b038316610c3957604051634b637e8f60e11b81525f60048201526024016108c0565b6001600160a01b038216610c625760405163ec442f0560e01b81525f60048201526024016108c0565b610b93838383610f95565b610c997f0000000000000000000000000000000000000000000000000000000000000000853085610dbf565b610ca38382610fe9565b826001600160a01b0316846001600160a01b03167fdcbc1c05240f31ff3ad067ef1ee35ce4997762752e3a095284754544f4c709d78484604051610cf1929190918252602082015260400190565b60405180910390a350505050565b826001600160a01b0316856001600160a01b031614610d2357610d23838683610bc7565b610d2d838261101d565b610d587f00000000000000000000000000000000000000000000000000000000000000008584611051565b826001600160a01b0316846001600160a01b0316866001600160a01b03167ffbde797d201c681b91056529119e0b02407c7bb96a4a2c75c01fc9667232c8db8585604051610db0929190918252602082015260400190565b60405180910390a45050505050565b6040516001600160a01b038481166024830152838116604483015260648201839052610e269186918216906323b872dd906084015b604051602081830303815290604052915060e01b6020820180516001600160e01b038381831617835250505050611082565b50505050565b5f610e59610e39836110ee565b8015610e5457505f8480610e4f57610e4f611b2f565b868809115b151590565b610e6486868661111a565b6107d49190611a2b565b6001600160a01b038416610e975760405163e602df0560e01b81525f60048201526024016108c0565b6001600160a01b038316610ec057604051634a1406b160e11b81525f60048201526024016108c0565b6001600160a01b038085165f9081526001602090815260408083209387168352929052208290558015610e2657826001600160a01b0316846001600160a01b03167f8c5be1e5ebec7d5bd14f71427d1e84f3dd0314c0f7b2291e5b200ac8c7c3b92584604051610cf191815260200190565b6001600160a01b038381165f908152600160209081526040808320938616835292905220545f19811015610e265781811015610f8757828183604051637dc7a0d960e11b81526004016108c0939291906119b3565b610e2684848484035f610e6e565b336001600160a01b037f00000000000000000000000000000000000000000000000000000000000000001614610fde57604051639cbe235760e01b815260040160405180910390fd5b610b938383836111d0565b6001600160a01b0382166110125760405163ec442f0560e01b81525f60048201526024016108c0565b610b4a5f8383610f95565b6001600160a01b03821661104657604051634b637e8f60e11b81525f60048201526024016108c0565b610b4a825f83610f95565b6040516001600160a01b03838116602483015260448201839052610b9391859182169063a9059cbb90606401610df4565b5f5f60205f8451602086015f885af1806110a1576040513d5f823e3d81fd5b50505f513d915081156110b85780600114156110c5565b6001600160a01b0384163b155b15610e2657604051635274afe760e01b81526001600160a01b03851660048201526024016108c0565b5f600282600381111561110357611103611b43565b61110d9190611b57565b60ff166001149050919050565b5f838302815f1985870982811083820303915050805f0361114e5783828161114457611144611b2f565b04925050506106c6565b8084116111655761116560038515026011186112e3565b5f848688095f868103871696879004966002600389028118808a02820302808a02820302808a02820302808a02820302808a02820302808a02909103029181900381900460010186841190950394909402919094039290920491909117919091029150509392505050565b6001600160a01b0383166111fa578060025f8282546111ef9190611a2b565b909155506112579050565b6001600160a01b0383165f90815260208190526040902054818110156112395783818360405163391434e360e21b81526004016108c0939291906119b3565b6001600160a01b0384165f9081526020819052604090209082900390555b6001600160a01b03821661127357600280548290039055611291565b6001600160a01b0382165f9081526020819052604090208054820190555b816001600160a01b0316836001600160a01b03167fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef836040516112d691815260200190565b60405180910390a3505050565b634e487b715f52806020526024601cfd5b5f81518084528060208401602086015e5f602082860101526020601f19601f83011685010191505092915050565b602081525f6106c660208301846112f4565b5f60208284031215611344575f5ffd5b5035919050565b80356001600160a01b0381168114611361575f5ffd5b919050565b5f5f60408385031215611377575f5ffd5b6113808361134b565b946020939093013593505050565b5f5f5f606084860312156113a0575f5ffd5b6113a98461134b565b92506113b76020850161134b565b929592945050506040919091013590565b5f602082840312156113d8575f5ffd5b6106c68261134b565b634e487b7160e01b5f52604160045260245ffd5b604051601f8201601f1916810167ffffffffffffffff8111828210171561141e5761141e6113e1565b604052919050565b5f67ffffffffffffffff82111561143f5761143f6113e1565b5060051b60200190565b5f82601f830112611458575f5ffd5b813561146b61146682611426565b6113f5565b8082825260208201915060208360051b86010192508583111561148c575f5ffd5b602085015b838110156114b0576114a28161134b565b835260209283019201611491565b5095945050505050565b5f82601f8301126114c9575f5ffd5b81356114d761146682611426565b8082825260208201915060208360051b8601019250858311156114f8575f5ffd5b602085015b838110156114b05780358352602092830192016114fd565b5f5f67ffffffffffffffff84111561152f5761152f6113e1565b50601f8301601f1916602001611544816113f5565b915050828152838383011115611558575f5ffd5b828260208301375f602084830101529392505050565b5f82601f83011261157d575f5ffd5b813561158b61146682611426565b8082825260208201915060208360051b8601019250858311156115ac575f5ffd5b602085015b838110156114b057803567ffffffffffffffff8111156115cf575f5ffd5b8601603f810188136115df575f5ffd5b6115f188602083013560408401611515565b845250602092830192016115b1565b5f5f5f5f60808587031215611613575f5ffd5b843567ffffffffffffffff811115611629575f5ffd5b61163587828801611449565b945050602085013567ffffffffffffffff811115611651575f5ffd5b61165d878288016114ba565b935050604085013567ffffffffffffffff811115611679575f5ffd5b6116858782880161156e565b949793965093946060013593505050565b5f5f604083850312156116a7575f5ffd5b82359150602083013560ff811681146116be575f5ffd5b809150509250929050565b5f5f604083850312156116da575f5ffd5b823591506116ea6020840161134b565b90509250929050565b5f5f5f5f60808587031215611706575f5ffd5b843567ffffffffffffffff81111561171c575f5ffd5b61172887828801611449565b945050602085013567ffffffffffffffff811115611744575f5ffd5b611750878288016114ba565b935050604085013567ffffffffffffffff81111561176c575f5ffd5b6117788782880161156e565b925050606085013567ffffffffffffffff811115611794575f5ffd5b8501601f810187136117a4575f5ffd5b6117b387823560208401611515565b91505092959194509250565b5f5f5f606084860312156117d1575f5ffd5b833592506117e16020850161134b565b91506117ef6040850161134b565b90509250925092565b5f5f60408385031215611809575f5ffd5b6118128361134b565b91506116ea6020840161134b565b5f60208284031215611830575f5ffd5b5051919050565b600181811c9082168061184b57607f821691505b60208210810361186957634e487b7160e01b5f52602260045260245ffd5b50919050565b634e487b7160e01b5f52601160045260245ffd5b60ff818116838216019081111561067f5761067f61186f565b5f8151808452602084019350602083015f5b828110156118d55781516001600160a01b03168652602095860195909101906001016118ae565b5093949350505050565b5f8151808452602084019350602083015f5b828110156118d55781518652602095860195909101906001016118f1565b5f82825180855260208501945060208160051b830101602085015f5b8381101561195d57601f198584030188526119478383516112f4565b602098890198909350919091019060010161192b565b50909695505050505050565b608081525f61197b608083018761189c565b828103602084015261198d81876118df565b905082810360408401526119a1818661190f565b91505082606083015295945050505050565b6001600160a01b039390931683526020830191909152604082015260600190565b608081525f6119e6608083018761189c565b82810360208401526119f881876118df565b90508281036040840152611a0c818661190f565b90508281036060840152611a2081856112f4565b979650505050505050565b8082018082111561067f5761067f61186f565b6001815b6001841115611a7957808504811115611a5d57611a5d61186f565b6001841615611a6b57908102905b60019390931c928002611a42565b935093915050565b5f82611a8f5750600161067f565b81611a9b57505f61067f565b8160018114611ab15760028114611abb57611ad7565b600191505061067f565b60ff841115611acc57611acc61186f565b50506001821b61067f565b5060208310610133831016604e8410600b8410161715611afa575081810a61067f565b611b065f198484611a3e565b805f1904821115611b1957611b1961186f565b029392505050565b5f6106c660ff841683611a81565b634e487b7160e01b5f52601260045260245ffd5b634e487b7160e01b5f52602160045260245ffd5b5f60ff831680611b7557634e487b7160e01b5f52601260045260245ffd5b8060ff8416069150509291505056fea264697066735822122087eed03baacd362201bcdf68b782da80cef17dd0cfa4de257dccbb5c022a806f64736f6c634300081c0033a264697066735822122052bd55a89c8f79ddd62cedc6b6b701938be3d2ad539cfa23b50a0cd3f69774be64736f6c634300081c0033000000000000000000000000cf6a4db5831f6b0ad6d4661c49b5da56b0d3bf8d
Deployed Bytecode
0x608060405234801561000f575f5ffd5b5060043610610281575f3560e01c80638946d5bb11610156578063ad81f8a5116100ca578063e0eb4d2e11610084578063e0eb4d2e14610625578063e4aa64ab14610645578063f18876841461064e578063f2fde38b14610657578063faab193c1461066a578063fbb637de14610695575f5ffd5b8063ad81f8a51461058b578063adc9772e14610594578063b86cca40146105a7578063beb3e382146105ba578063c0ba8a04146105cd578063dd62ed3e146105ed575f5ffd5b806398807d841161011b57806398807d841461052d57806399f7a93414610540578063a4897f1e14610553578063a7602c7e14610566578063a9059cbb1461056f578063abf93b3614610582575f5ffd5b80638946d5bb146104cb5780638c8c47a9146104de5780638da5cb5b146104f1578063936d53751461050157806395d89b411461050a575f5ffd5b806323b872dd116101f857806356d32824116101b257806356d328241461044f57806358ca6bae14610462578063638f261c146104755780636f843f591461048857806370a082311461049b578063715018a6146104c3575f5ffd5b806323b872dd146103d1578063313ce567146103e45780633d31c5b1146103f35780633e2588381461040657806345152ae3146104335780635023199014610446575f5ffd5b80630c340a24116102495780630c340a241461033a57806314afd79e14610365578063178391311461037857806318160ddd146103a35780631be4bf83146103ab57806323095721146103be575f5ffd5b8063011cf2511461028557806306fdde031461029a5780630725bc10146102d6578063095ea7b3146102ec5780630a2459241461030f575b5f5ffd5b610298610293366004612896565b6106a8565b005b60408051808201909152600e81526d14dd185ad95914dd58d8da5b98dd60921b60208201525b6040516102cd91906128c0565b60405180910390f35b6102de61087a565b6040519081526020016102cd565b6102ff6102fa366004612896565b6108a0565b60405190151581526020016102cd565b6102ff61031d3660046128f5565b6001600160a01b03165f9081526007602052604090205460ff1690565b60015461034d906001600160a01b031681565b6040516001600160a01b0390911681526020016102cd565b61034d6103733660046128f5565b6108b9565b61034d6103863660046128f5565b6001600160a01b039081165f908152601360205260409020541690565b600a546102de565b6102de6103b9366004612896565b61091a565b6102986103cc366004612910565b610c15565b6102ff6103df366004612927565b610e27565b604051601281526020016102cd565b6102de6104013660046128f5565b610e4c565b6102ff6104143660046128f5565b6001600160a01b039081165f9081526006602052604090205416151590565b60035461034d906001600160a01b031681565b6102de60105481565b6102de61045d3660046128f5565b610f21565b6102de6104703660046128f5565b611031565b60045461034d906001600160a01b031681565b6102de610496366004612896565b611067565b6102de6104a93660046128f5565b6001600160a01b03165f9081526008602052604090205490565b61029861114d565b6102986104d9366004612910565b611160565b60025461034d906001600160a01b031681565b5f546001600160a01b031661034d565b6102de60055481565b604080518082019091526007815266737450524f564560c81b60208201526102c0565b6102de61053b3660046128f5565b61125a565b6102de61054e366004612896565b6112a5565b6102de610561366004612965565b6113bd565b6102de600e5481565b6102ff61057d366004612896565b6114f3565b6102de60115481565b6102de60125481565b6102de6105a2366004612896565b611500565b6102986105b5366004612910565b61155d565b6102986105c83660046129d6565b611571565b6105e06105db3660046128f5565b61180a565b6040516102cd9190612a5a565b6102de6105fb366004612aa8565b6001600160a01b039182165f90815260096020908152604080832093909416825291909152205490565b6106386106333660046128f5565b61188f565b6040516102cd9190612adf565b6102de600f5481565b6102de600d5481565b6102986106653660046128f5565b611913565b61034d6106783660046128f5565b6001600160a01b039081165f908152600660205260409020541690565b61034d6106a3366004612910565b611952565b6106b06119b6565b6001600160a01b0382165f90815260076020526040902054829060ff166106ea5760405163070b036f60e11b815260040160405180910390fd5b6001600160a01b0383165f90815260156020526040812080548490811061071357610713612b32565b5f91825260208083206002909202909101546001600160a01b0387168352601590915260409091205490915061074b90600190612b5a565b83146107e4576001600160a01b0384165f908152601560205260409020805461077690600190612b5a565b8154811061078657610786612b32565b905f5260205f20906002020160155f866001600160a01b03166001600160a01b031681526020019081526020015f2084815481106107c6576107c6612b32565b5f918252602090912082546002909202019081556001918201549101555b6001600160a01b0384165f90815260156020526040902080548061080a5761080a612b6d565b5f8281526020812060025f19909301928302018181556001015590556040516001600160a01b038516907fd8fd49113c6dd4e2d5da3a0ba44bad273692645b715dcb3a6e20521949f9f7bd9061086c9084908790918252602082015260400190565b60405180910390a250505050565b5f5f6012544261088a9190612b5a565b90506011548161089a9190612b81565b91505090565b5f336108ad8185856119e2565b60019150505b92915050565b5f816001600160a01b0316638da5cb5b6040518163ffffffff1660e01b8152600401602060405180830381865afa1580156108f6573d5f5f3e3d5ffd5b505050506040513d601f19601f820116820180604052508101906108b39190612b98565b5f6109236119b6565b6001600160a01b0383165f90815260076020526040902054839060ff1661095d5760405163070b036f60e11b815260040160405180910390fd5b6001600160a01b0384165f90815260156020526040812080548590811061098657610986612b32565b905f5260205f209060020201905060105481600101546109a69190612bb3565b4210156109c657604051637200f0d160e11b815260040160405180910390fd5b5f856001600160a01b03166301e1d1146040518163ffffffff1660e01b8152600401602060405180830381865afa158015610a03573d5f5f3e3d5ffd5b505050506040513d601f19601f82011682018060405250810190610a279190612bc6565b905080825f015411610a3a578154610a3c565b805b6001600160a01b0387165f90815260156020526040902054909450610a6390600190612b5a565b8514610afc576001600160a01b0386165f9081526015602052604090208054610a8e90600190612b5a565b81548110610a9e57610a9e612b32565b905f5260205f20906002020160155f886001600160a01b03166001600160a01b031681526020019081526020015f208681548110610ade57610ade612b32565b5f918252602090912082546002909202019081556001918201549101555b6001600160a01b0386165f908152601560205260409020805480610b2257610b22612b6d565b5f8281526020812060025f199093019283020181815560010181905591558415610bbf5760048054604051632770a7eb60e21b81526001600160a01b038a81169382019390935260248101889052911690639dc29fac906044016020604051808303815f875af1158015610b98573d5f5f3e3d5ffd5b505050506040513d601f19601f82011682018060405250810190610bbc9190612bc6565b90505b60408051828152602081018790529081018790526001600160a01b038816907f570ef8d8ae509a4cb1fffadfc2ad7db3d60796e286d401b1909d2458cbd38bea9060600160405180910390a25050505092915050565b805f03610c3557604051631f2a200560e01b815260040160405180910390fd5b335f908152601360205260409020546001600160a01b031680610c6a576040516273e5c360e31b815260040160405180910390fd5b600e54335f9081526014602052604090205410610c9a57604051630d2dae8360e31b815260040160405180910390fd5b6001600160a01b0381165f9081526015602052604090205415610cd0576040516331a0131960e11b815260040160405180910390fd5b335f8181526008602052604081205491610ce9906119f4565b9050610cf58482612bb3565b821015610d155760405163263892ab60e01b815260040160405180910390fd5b60405163266d6a8360e11b8152600481018590525f906001600160a01b03851690634cdad50690602401602060405180830381865afa158015610d5a573d5f5f3e3d5ffd5b505050506040513d601f19601f82011682018060405250810190610d7e9190612bc6565b335f81815260146020908152604080832081516060810183528b815280840187815242828501908152835460018181018655948852959096209151600390950290910193845551908301559151600290910155519192506001600160a01b038616917fca2040cb9509984d9478924c31646bfe6793e8577610518ef8b6b7922df2957590610e189089908690918252602082015260400190565b60405180910390a35050505050565b5f33610e34858285611a69565b610e3f858585611ae5565b60019150505b9392505050565b5f5f826001600160a01b03166301e1d1146040518163ffffffff1660e01b8152600401602060405180830381865afa158015610e8a573d5f5f3e3d5ffd5b505050506040513d601f19601f82011682018060405250810190610eae9190612bc6565b6004805460405163266d6a8360e11b81529293506001600160a01b031691634cdad50691610ee29185910190815260200190565b602060405180830381865afa158015610efd573d5f5f3e3d5ffd5b505050506040513d601f19601f82011682018060405250810190610e459190612bc6565b6001600160a01b038082165f9081526013602052604081205490911680610f5a576040516273e5c360e31b815260040160405180910390fd5b6001600160a01b0383165f9081526014602052604081208054909103610f93576040516352ec7ab160e01b815260040160405180910390fd5b6001600160a01b0382165f9081526015602052604090205415610fc9576040516331a0131960e11b815260040160405180910390fd5b610fd4848383611b42565b610fde9084612bb3565b9250610ffe846001600160a01b03165f9081526008602052604090205490565b5f0361102a576001600160a01b0384165f90815260136020526040902080546001600160a01b03191690555b5050919050565b6001600160a01b038082165f908152601360205260408120549091168061105a57505f92915050565b610e4581610496856119f4565b60405163266d6a8360e11b8152600481018290525f9081906001600160a01b03851690634cdad50690602401602060405180830381865afa1580156110ae573d5f5f3e3d5ffd5b505050506040513d601f19601f820116820180604052508101906110d29190612bc6565b6004805460405163266d6a8360e11b81529293506001600160a01b031691634cdad506916111069185910190815260200190565b602060405180830381865afa158015611121573d5f5f3e3d5ffd5b505050506040513d601f19601f820116820180604052508101906111459190612bc6565b949350505050565b6111556119b6565b61115e5f611cf1565b565b6111686119b6565b5f61117161087a565b90505f5f1983146111825782611184565b815b9050805f036111a657604051631f2a200560e01b815260040160405180910390fd5b818111156111c757604051630b23ebbb60e01b815260040160405180910390fd5b6011545f9060016111d88285612bb3565b6111e29190612b5a565b6111ec9190612bdd565b90508060125f8282546111ff9190612bb3565b9091555050600454600354611221916001600160a01b03918216911684611d40565b6040518281527fb59bad24927dac29805ea39ded120e7c36f87259e62f991943a6578732aa9eec9060200160405180910390a150505050565b6001600160a01b038082165f908152601360205260408120549091168061128357505f92915050565b610e4581610496856001600160a01b03165f9081526008602052604090205490565b6002545f906001600160a01b031633146112d25760405163ea8e4eb560e01b815260040160405180910390fd5b6001600160a01b0383165f90815260076020526040902054839060ff1661130c5760405163070b036f60e11b815260040160405180910390fd5b825f0361132c57604051631f2a200560e01b815260040160405180910390fd5b6001600160a01b0384165f8181526015602090815260408083208054825180840184528981524281860190815260018084018555938752958590209051600283029091019081559451949091019390935580518781529182018390529194507f355bf731360b0ea9d2f13d7845614d6c07a1e9f9a995483c17a3e7ba21ae9124910160405180910390a25092915050565b6001600160a01b0387165f90815260076020526040812054889060ff166113f75760405163070b036f60e11b815260040160405180910390fd5b60035460405163d505accf60e01b81526001600160a01b038a811660048301528b81166024830152604482018a90526064820189905260ff8816608483015260a4820187905260c482018690529091169063d505accf9060e4015f604051808303815f87803b158015611468575f5ffd5b505af115801561147a573d5f5f3e3d5ffd5b50506040516307931c7d60e51b81526001600160a01b038b81166004830152602482018b90528c16925063f2638fa091506044015f604051808303815f87803b1580156114c5575f5ffd5b505af11580156114d7573d5f5f3e3d5ffd5b505050506114e6888a89611d9f565b9998505050505050505050565b5f336108ad818585611ae5565b6001600160a01b0382165f90815260076020526040812054839060ff1661153a5760405163070b036f60e11b815260040160405180910390fd5b600354611552906001600160a01b031633308661205b565b611145338585611d9f565b6115656119b6565b61156e81612094565b50565b6115796119b6565b7ff0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a008054600160401b810460ff16159067ffffffffffffffff165f811580156115be5750825b90505f8267ffffffffffffffff1660011480156115da5750303b155b9050811580156115e8575080155b156116065760405163f92ee8a960e01b815260040160405180910390fd5b845467ffffffffffffffff19166001178555831561163057845460ff60401b1916600160401b1785555b6001600160a01b038e16158061164d57506001600160a01b038d16155b8061165f57506001600160a01b038c16155b8061167157506001600160a01b038b16155b1561168f5760405163d92e233d60e01b815260040160405180910390fd5b88158061169a575087155b806116a3575086155b156116c157604051631f2a200560e01b815260040160405180910390fd5b6117188e8e8e8e600180546001600160a01b039586166001600160a01b0319918216179091556002805494861694821694909417909355600380549285169284169290921790915560048054919093169116179055565b600d8a9055600e899055600f889055601087905561173586612094565b426012556003546004805460405163095ea7b360e01b81526001600160a01b03918216928101929092525f1960248301529091169063095ea7b3906044016020604051808303815f875af115801561178f573d5f5f3e3d5ffd5b505050506040513d601f19601f820116820180604052508101906117b39190612bfc565b5083156117fa57845460ff60401b19168555604051600181527fc7f505b2f371ae2175ee4913f4499e1f2633a7b5936321eed1cdaeb6115181d29060200160405180910390a15b5050505050505050505050505050565b6001600160a01b0381165f908152601560209081526040808320805482518185028101850190935280835260609492939192909184015b82821015611884578382905f5260205f2090600202016040518060400160405290815f820154815260200160018201548152505081526020019060010190611841565b505050509050919050565b6001600160a01b0381165f908152601460209081526040808320805482518185028101850190935280835260609492939192909184015b82821015611884578382905f5260205f2090600302016040518060600160405290815f820154815260200160018201548152602001600282015481525050815260200190600101906118c6565b61191b6119b6565b6001600160a01b03811661194957604051631e4fbdf760e01b81525f60048201526024015b60405180910390fd5b61156e81611cf1565b5f6127108211156119765760405163382b206160e21b815260040160405180910390fd5b335f908152600660205260409020546001600160a01b0316156119ac576040516312db1b9960e01b815260040160405180910390fd5b6108b333836120d5565b5f546001600160a01b0316331461115e5760405163118cdaa760e01b8152336004820152602401611940565b6119ef8383836001612330565b505050565b5f805b6001600160a01b0383165f90815260146020526040902054811015611a63576001600160a01b0383165f908152601460205260409020805482908110611a3f57611a3f612b32565b905f5260205f2090600302015f015482611a599190612bb3565b91506001016119f7565b50919050565b6001600160a01b038381165f908152600960209081526040808320938616835292905220545f19811015611adf5781811015611ad157604051637dc7a0d960e11b81526001600160a01b03841660048201526024810182905260448101839052606401611940565b611adf84848484035f612330565b50505050565b6001600160a01b038316611b0e57604051634b637e8f60e11b81525f6004820152602401611940565b6001600160a01b038216611b375760405163ec442f0560e01b81525f6004820152602401611940565b6119ef838383612402565b5f600160ff19825c168117825d505f80805b8454831015611cae57600f54858481548110611b7257611b72612b32565b905f5260205f20906003020160020154611b8c9190612bb3565b4210611c9c575f858481548110611ba557611ba5612b32565b905f5260205f2090600302016040518060600160405290815f82015481526020016001820154815260200160028201548152505090508560018780549050611bed9190612b5a565b81548110611bfd57611bfd612b32565b905f5260205f209060030201868581548110611c1b57611c1b612b32565b5f91825260209091208254600390920201908155600180830154908201556002918201549101558554869080611c5357611c53612b6d565b5f8281526020812060035f1990930192830201818155600181018290556002015590558051611c829084612bb3565b9250806020015182611c949190612bb3565b915050611b54565b82611ca681612c1b565b935050611b54565b815f03611cce5760405163cdcc876d60e01b815260040160405180910390fd5b611cda8787848461242f565b93505f92505050805c60ff1916815d509392505050565b5f80546001600160a01b038381166001600160a01b0319831681178455604051919092169283917f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e09190a35050565b6040516001600160a01b038381166024830152604482018390526119ef91859182169063a9059cbb906064015b604051602081830303815290604052915060e01b6020820180516001600160e01b0383818316178352505050506125e3565b5f600160ff19825c168117825d50815f03611dcd57604051631f2a200560e01b815260040160405180910390fd5b600d54821015611df05760405163de588d7360e01b815260040160405180910390fd5b6001600160a01b0383165f9081526015602052604090205415611e26576040516331a0131960e11b815260040160405180910390fd5b6001600160a01b038085165f90815260136020526040902054168015801590611e615750836001600160a01b0316816001600160a01b031614155b15611e8a57604051635b9b5a7d60e11b81526001600160a01b0382166004820152602401611940565b6001600160a01b038116611ec6576001600160a01b038581165f90815260136020526040902080546001600160a01b0319169186169190911790555b60048054604051636e553f6560e01b81529182018590523060248301525f916001600160a01b0390911690636e553f65906044016020604051808303815f875af1158015611f16573d5f5f3e3d5ffd5b505050506040513d601f19601f82011682018060405250810190611f3a9190612bc6565b9050805f03611f5c576040516351bc3cd160e01b815260040160405180910390fd5b604051636e553f6560e01b8152600481018290523060248201526001600160a01b03861690636e553f65906044016020604051808303815f875af1158015611fa6573d5f5f3e3d5ffd5b505050506040513d601f19601f82011682018060405250810190611fca9190612bc6565b9250825f03611fec576040516351bc3cd160e01b815260040160405180910390fd5b611ff6868461264f565b60408051858152602081018390529081018490526001600160a01b0380871691908816907f4b22ccaaeb4846ec98072623a51a9070bf1f01c75ac1f8119035f373df852a0c9060600160405180910390a3505f905060ff19815c16815d509392505050565b6040516001600160a01b038481166024830152838116604483015260648201839052611adf9186918216906323b872dd90608401611d6d565b60115460408051918252602082018390527fe4d972eca672d23b64b5cc8096e8966b5da14afe132d6e6b952393ca30340c5c910160405180910390a1601155565b6004545f906001600160a01b0316612100576040516321c4e35760e21b815260040160405180910390fd5b6005805460010190556040516121b0905f906001600160a01b0386169061212960208201612875565b601f1982820381018352601f9091011660408181526001546003546004546005546001600160a01b0393841660208701529183168486015282166060850152908a16608084015260a083015260c08083018990528151808403909101815260e0830190915261219c929161010001612c4a565b604051602081830303815290604052612687565b6001600160a01b038481165f81815260066020908152604080832080546001600160a01b031916878716908117909155808452600790925291829020805460ff191660011790556002549151630a87ad3360e41b8152600481019190915260248101929092526044820186905292935091169063a87ad330906064016020604051808303815f875af1158015612248573d5f5f3e3d5ffd5b505050506040513d601f19601f8201168201806040525081019061226c9190612c5e565b506004805460405163095ea7b360e01b81526001600160a01b03848116938201939093525f19602482015291169063095ea7b3906044016020604051808303815f875af11580156122bf573d5f5f3e3d5ffd5b505050506040513d601f19601f820116820180604052508101906122e39190612bfc565b50604080516001600160a01b038581168252602082018590528316917f24fb87e4662b8a10e8c168a82984b78db07707f9a52fb81cd1a99f88994e6352910160405180910390a292915050565b6001600160a01b0384166123595760405163e602df0560e01b81525f6004820152602401611940565b6001600160a01b03831661238257604051634a1406b160e11b81525f6004820152602401611940565b6001600160a01b038085165f9081526009602090815260408083209387168352929052208290558015611adf57826001600160a01b0316846001600160a01b03167f8c5be1e5ebec7d5bd14f71427d1e84f3dd0314c0f7b2291e5b200ac8c7c3b925846040516123f491815260200190565b60405180910390a350505050565b60ff5f5c1661242457604051639cbe235760e01b815260040160405180910390fd5b6119ef83838361271b565b5f825f0361245057604051631f2a200560e01b815260040160405180910390fd5b61245a8584612841565b604051635d043b2960e11b815260048101849052306024820181905260448201525f906001600160a01b0386169063ba087652906064016020604051808303815f875af11580156124ad573d5f5f3e3d5ffd5b505050506040513d601f19601f820116820180604052508101906124d19190612bc6565b90505f8382111561250a575f6124e78584612b5a565b600454909150612501906001600160a01b03168883611d40565b8491505061250d565b50805b60048054604051635d043b2960e11b81529182018390526001600160a01b038981166024840152306044840152169063ba087652906064016020604051808303815f875af1158015612561573d5f5f3e3d5ffd5b505050506040513d601f19601f820116820180604052508101906125859190612bc6565b60408051828152602081018490529081018790529093506001600160a01b0380881691908916907ffe7007b2e89d80edda76299251df08366480cac22e5e260f5e662e850b1f7a329060600160405180910390a35050949350505050565b5f5f60205f8451602086015f885af180612602576040513d5f823e3d81fd5b50505f513d91508115612619578060011415612626565b6001600160a01b0384163b155b15611adf57604051635274afe760e01b81526001600160a01b0385166004820152602401611940565b6001600160a01b0382166126785760405163ec442f0560e01b81525f6004820152602401611940565b6126835f8383612402565b5050565b5f834710156126b25760405163cf47918160e01b815247600482015260248101859052604401611940565b81515f036126d357604051631328927760e21b815260040160405180910390fd5b8282516020840186f590503d1519811516156126f4576040513d5f823e3d81fd5b6001600160a01b038116610e455760405163b06ebf3d60e01b815260040160405180910390fd5b6001600160a01b0383166127455780600a5f82825461273a9190612bb3565b909155506127b59050565b6001600160a01b0383165f90815260086020526040902054818110156127975760405163391434e360e21b81526001600160a01b03851660048201526024810182905260448101839052606401611940565b6001600160a01b0384165f9081526008602052604090209082900390555b6001600160a01b0382166127d157600a805482900390556127ef565b6001600160a01b0382165f9081526008602052604090208054820190555b816001600160a01b0316836001600160a01b03167fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef8360405161283491815260200190565b60405180910390a3505050565b6001600160a01b03821661286a57604051634b637e8f60e11b81525f6004820152602401611940565b612683825f83612402565b6122de80612c8683390190565b6001600160a01b038116811461156e575f5ffd5b5f5f604083850312156128a7575f5ffd5b82356128b281612882565b946020939093013593505050565b602081525f82518060208401528060208501604085015e5f604082850101526040601f19601f83011684010191505092915050565b5f60208284031215612905575f5ffd5b8135610e4581612882565b5f60208284031215612920575f5ffd5b5035919050565b5f5f5f60608486031215612939575f5ffd5b833561294481612882565b9250602084013561295481612882565b929592945050506040919091013590565b5f5f5f5f5f5f5f60e0888a03121561297b575f5ffd5b873561298681612882565b9650602088013561299681612882565b95506040880135945060608801359350608088013560ff811681146129b9575f5ffd5b9699959850939692959460a0840135945060c09093013592915050565b5f5f5f5f5f5f5f5f5f6101208a8c0312156129ef575f5ffd5b89356129fa81612882565b985060208a0135612a0a81612882565b975060408a0135612a1a81612882565b965060608a0135612a2a81612882565b989b979a50959860808101359760a0820135975060c0820135965060e08201359550610100909101359350915050565b602080825282518282018190525f918401906040840190835b81811015612a9d578351805184526020908101518185015290930192604090920191600101612a73565b509095945050505050565b5f5f60408385031215612ab9575f5ffd5b8235612ac481612882565b91506020830135612ad481612882565b809150509250929050565b602080825282518282018190525f918401906040840190835b81811015612a9d57835180518452602081015160208501526040810151604085015250606083019250602084019350600181019050612af8565b634e487b7160e01b5f52603260045260245ffd5b634e487b7160e01b5f52601160045260245ffd5b818103818111156108b3576108b3612b46565b634e487b7160e01b5f52603160045260245ffd5b80820281158282048414176108b3576108b3612b46565b5f60208284031215612ba8575f5ffd5b8151610e4581612882565b808201808211156108b3576108b3612b46565b5f60208284031215612bd6575f5ffd5b5051919050565b5f82612bf757634e487b7160e01b5f52601260045260245ffd5b500490565b5f60208284031215612c0c575f5ffd5b81518015158114610e45575f5ffd5b5f60018201612c2c57612c2c612b46565b5060010190565b5f81518060208401855e5f93019283525090919050565b5f611145612c588386612c33565b84612c33565b5f60208284031215612c6e575f5ffd5b815167ffffffffffffffff81168114610e45575f5ffdfe610180604052348015610010575f5ffd5b506040516122de3803806122de83398101604081905261002f91610455565b60408051808201909152600f81526e53756363696e637450726f7665722d60881b60208201528490610060846101f3565b6040516020016100719291906104d0565b60408051601f19818403018152828201909152600782526650524f5645522d60c81b6020830152906100a2856101f3565b6040516020016100b39291906104d0565b60408051601f1981840301815291905260036100cf8382610584565b5060046100dc8282610584565b5050505f5f6100f08361028260201b60201c565b9150915081610100576012610102565b805b60ff1660a05250506001600160a01b039081166080528616158061012d57506001600160a01b038516155b8061013f57506001600160a01b038416155b8061015157506001600160a01b038316155b1561016f5760405163d92e233d60e01b815260040160405180910390fd5b3360c0526001600160a01b0386811660e05285811661010052838116610120526101408390526101608290526040516317066a5760e21b815230600482015290851690635c19a95c906024015f604051808303815f87803b1580156101d2575f5ffd5b505af11580156101e4573d5f5f3e3d5ffd5b50505050505050505050610667565b60605f6101ff83610358565b60010190505f816001600160401b0381111561021d5761021d6104ec565b6040519080825280601f01601f191660200182016040528015610247576020820181803683370190505b5090508181016020015b5f19016f181899199a1a9b1b9c1cb0b131b232b360811b600a86061a8153600a850494508461025157509392505050565b60408051600481526024810182526020810180516001600160e01b031663313ce56760e01b17905290515f918291829182916001600160a01b038716916102c89161063e565b5f60405180830381855afa9150503d805f8114610300576040519150601f19603f3d011682016040523d82523d5f602084013e610305565b606091505b509150915081801561031957506020815110155b1561034c575f818060200190518101906103339190610650565b905060ff811161034a576001969095509350505050565b505b505f9485945092505050565b5f807a184f03e93ff9f4daa797ed6e38ed64bf6a1f01000000000000000083106103a0577a184f03e93ff9f4daa797ed6e38ed64bf6a1f010000000000000000830492506040015b6d04ee2d6d415b85acef810000000083106103cc576d04ee2d6d415b85acef8100000000830492506020015b662386f26fc1000083106103ea57662386f26fc10000830492506010015b6305f5e1008310610402576305f5e100830492506008015b612710831061041657612710830492506004015b60648310610428576064830492506002015b600a8310610434576001015b92915050565b80516001600160a01b0381168114610450575f5ffd5b919050565b5f5f5f5f5f5f60c0878903121561046a575f5ffd5b6104738761043a565b95506104816020880161043a565b945061048f6040880161043a565b935061049d6060880161043a565b608088015160a090980151969995985093969395939492505050565b5f81518060208401855e5f93019283525090919050565b5f6104e46104de83866104b9565b846104b9565b949350505050565b634e487b7160e01b5f52604160045260245ffd5b600181811c9082168061051457607f821691505b60208210810361053257634e487b7160e01b5f52602260045260245ffd5b50919050565b601f82111561057f57805f5260205f20601f840160051c8101602085101561055d5750805b601f840160051c820191505b8181101561057c575f8155600101610569565b50505b505050565b81516001600160401b0381111561059d5761059d6104ec565b6105b1816105ab8454610500565b84610538565b6020601f8211600181146105e3575f83156105cc5750848201515b5f19600385901b1c1916600184901b17845561057c565b5f84815260208120601f198516915b8281101561061257878501518255602094850194600190920191016105f2565b508482101561062f57868401515f19600387901b60f8161c191681555b50505050600190811b01905550565b5f61064982846104b9565b9392505050565b5f60208284031215610660575f5ffd5b5051919050565b60805160a05160c05160e05161010051610120516101405161016051611bba6107245f395f6103ac01525f61047601525f818161042101528181610704015281816107e901526108f501525f81816103380152610b0201525f818161028a0152818161075901528181610846015261094a01525f818161037201528181610ab701528181610b2501528181610bc90152610fa001525f6106d401525f81816102fb0152818161056e01528181610c720152610d320152611bba5ff3fe608060405234801561000f575f5ffd5b5060043610610208575f3560e01c80636e553f651161011f578063b460af94116100a9578063ce96cb7711610079578063ce96cb77146104e4578063d905777e146104f7578063dd62ed3e1461050a578063ef8b30f7146104d1578063f2638fa014610542575f5ffd5b8063b460af94146104ab578063ba087652146104be578063c63d75b61461031f578063c6e6f592146104d1575f5ffd5b806394bf804d116100ef57806394bf804d1461044357806395d89b4114610456578063a9059cbb1461045e578063af640d0f14610471578063b3d7f6b914610498575f5ffd5b80636e553f65146103ce57806370a08231146103e15780637d5e81e2146104095780638da5cb5b1461041c575f5ffd5b8063313ce567116101a0578063452115d611610170578063452115d61461035a5780634cdad5061461023c5780634cf088d91461036d57806356781388146103945780636b4a5b8f146103a7575f5ffd5b8063313ce567146102df57806338d52e0f146102f9578063402d267d1461031f57806345152ae314610333575f5ffd5b80630a28a477116101db5780630a28a477146102725780630c340a241461028557806318160ddd146102c457806323b872dd146102cc575f5ffd5b806301e1d1141461020c57806306fdde031461022757806307a2d13a1461023c578063095ea7b31461024f575b5f5ffd5b610214610557565b6040519081526020015b60405180910390f35b61022f6105e4565b60405161021e9190611322565b61021461024a366004611334565b610674565b61026261025d366004611366565b610685565b604051901515815260200161021e565b610214610280366004611334565b61069c565b6102ac7f000000000000000000000000000000000000000000000000000000000000000081565b6040516001600160a01b03909116815260200161021e565b600254610214565b6102626102da36600461138e565b6106a8565b6102e76106cd565b60405160ff909116815260200161021e565b7f00000000000000000000000000000000000000000000000000000000000000006102ac565b61021461032d3660046113c8565b505f1990565b6102ac7f000000000000000000000000000000000000000000000000000000000000000081565b610214610368366004611600565b6106f8565b6102ac7f000000000000000000000000000000000000000000000000000000000000000081565b6102146103a2366004611696565b6107dd565b6102147f000000000000000000000000000000000000000000000000000000000000000081565b6102146103dc3660046116c9565b6108b8565b6102146103ef3660046113c8565b6001600160a01b03165f9081526020819052604090205490565b6102146104173660046116f3565b6108e9565b6102ac7f000000000000000000000000000000000000000000000000000000000000000081565b6102146104513660046116c9565b610985565b61022f6109a0565b61026261046c366004611366565b6109af565b6102147f000000000000000000000000000000000000000000000000000000000000000081565b6102146104a6366004611334565b6109bc565b6102146104b93660046117bf565b6109c8565b6102146104cc3660046117bf565b610a15565b6102146104df366004611334565b610a62565b6102146104f23660046113c8565b610a6d565b6102146105053660046113c8565b610a8f565b6102146105183660046117f8565b6001600160a01b039182165f90815260016020908152604080832093909416825291909152205490565b610555610550366004611366565b610aac565b005b6040516370a0823160e01b81523060048201525f907f00000000000000000000000000000000000000000000000000000000000000006001600160a01b0316906370a0823190602401602060405180830381865afa1580156105bb573d5f5f3e3d5ffd5b505050506040513d601f19601f820116820180604052508101906105df9190611820565b905090565b6060600380546105f390611837565b80601f016020809104026020016040519081016040528092919081815260200182805461061f90611837565b801561066a5780601f106106415761010080835404028352916020019161066a565b820191905f5260205f20905b81548152906001019060200180831161064d57829003601f168201915b5050505050905090565b5f61067f825f610b4e565b92915050565b5f33610692818585610b86565b5060019392505050565b5f61067f826001610b98565b5f336106b5858285610bc7565b6106c0858585610c10565b60019150505b9392505050565b5f6105df817f0000000000000000000000000000000000000000000000000000000000000000611883565b5f336001600160a01b037f0000000000000000000000000000000000000000000000000000000000000000161461074257604051636bae83cd60e01b815260040160405180910390fd5b6040516322908aeb60e11b81526001600160a01b037f0000000000000000000000000000000000000000000000000000000000000000169063452115d690610794908890889088908890600401611969565b6020604051808303815f875af11580156107b0573d5f5f3e3d5ffd5b505050506040513d601f19601f820116820180604052508101906107d49190611820565b95945050505050565b5f336001600160a01b037f0000000000000000000000000000000000000000000000000000000000000000161461082757604051636bae83cd60e01b815260040160405180910390fd5b604051630acf027160e31b81526004810184905260ff831660248201527f00000000000000000000000000000000000000000000000000000000000000006001600160a01b0316906356781388906044016020604051808303815f875af1158015610894573d5f5f3e3d5ffd5b505050506040513d601f19601f820116820180604052508101906106c69190611820565b5f5f196108c9565b60405180910390fd5b5f6108d385610a62565b90506108e133858784610c6d565b949350505050565b5f336001600160a01b037f0000000000000000000000000000000000000000000000000000000000000000161461093357604051636bae83cd60e01b815260040160405180910390fd5b604051633eaf40f160e11b81526001600160a01b037f00000000000000000000000000000000000000000000000000000000000000001690637d5e81e2906107949088908890889088906004016119d4565b5f5f195f610992856109bc565b90506108e133858388610c6d565b6060600480546105f390611837565b5f33610692818585610c10565b5f61067f826001610b4e565b5f5f6109d383610a6d565b9050808511156109fc57828582604051633fa733bb60e21b81526004016108c0939291906119b3565b5f610a068661069c565b90506107d43386868985610cff565b5f5f610a2083610a8f565b905080851115610a4957828582604051632e52afbb60e21b81526004016108c0939291906119b3565b5f610a5386610674565b90506107d4338686848a610cff565b5f61067f825f610b98565b6001600160a01b0381165f9081526020819052604081205461067f905f610b4e565b6001600160a01b0381165f9081526020819052604081205461067f565b336001600160a01b037f00000000000000000000000000000000000000000000000000000000000000001614610af557604051634487f62960e11b815260040160405180910390fd5b610b4a6001600160a01b037f000000000000000000000000000000000000000000000000000000000000000016837f000000000000000000000000000000000000000000000000000000000000000084610dbf565b5050565b5f6106c6610b5a610557565b610b65906001611a2b565b610b705f600a611b21565b600254610b7d9190611a2b565b85919085610e2c565b610b938383836001610e6e565b505050565b5f6106c6610ba782600a611b21565b600254610bb49190611a2b565b610bbc610557565b610b7d906001611a2b565b7f00000000000000000000000000000000000000000000000000000000000000006001600160a01b0316826001600160a01b031603610c0557505050565b610b93838383610f32565b6001600160a01b038316610c3957604051634b637e8f60e11b81525f60048201526024016108c0565b6001600160a01b038216610c625760405163ec442f0560e01b81525f60048201526024016108c0565b610b93838383610f95565b610c997f0000000000000000000000000000000000000000000000000000000000000000853085610dbf565b610ca38382610fe9565b826001600160a01b0316846001600160a01b03167fdcbc1c05240f31ff3ad067ef1ee35ce4997762752e3a095284754544f4c709d78484604051610cf1929190918252602082015260400190565b60405180910390a350505050565b826001600160a01b0316856001600160a01b031614610d2357610d23838683610bc7565b610d2d838261101d565b610d587f00000000000000000000000000000000000000000000000000000000000000008584611051565b826001600160a01b0316846001600160a01b0316866001600160a01b03167ffbde797d201c681b91056529119e0b02407c7bb96a4a2c75c01fc9667232c8db8585604051610db0929190918252602082015260400190565b60405180910390a45050505050565b6040516001600160a01b038481166024830152838116604483015260648201839052610e269186918216906323b872dd906084015b604051602081830303815290604052915060e01b6020820180516001600160e01b038381831617835250505050611082565b50505050565b5f610e59610e39836110ee565b8015610e5457505f8480610e4f57610e4f611b2f565b868809115b151590565b610e6486868661111a565b6107d49190611a2b565b6001600160a01b038416610e975760405163e602df0560e01b81525f60048201526024016108c0565b6001600160a01b038316610ec057604051634a1406b160e11b81525f60048201526024016108c0565b6001600160a01b038085165f9081526001602090815260408083209387168352929052208290558015610e2657826001600160a01b0316846001600160a01b03167f8c5be1e5ebec7d5bd14f71427d1e84f3dd0314c0f7b2291e5b200ac8c7c3b92584604051610cf191815260200190565b6001600160a01b038381165f908152600160209081526040808320938616835292905220545f19811015610e265781811015610f8757828183604051637dc7a0d960e11b81526004016108c0939291906119b3565b610e2684848484035f610e6e565b336001600160a01b037f00000000000000000000000000000000000000000000000000000000000000001614610fde57604051639cbe235760e01b815260040160405180910390fd5b610b938383836111d0565b6001600160a01b0382166110125760405163ec442f0560e01b81525f60048201526024016108c0565b610b4a5f8383610f95565b6001600160a01b03821661104657604051634b637e8f60e11b81525f60048201526024016108c0565b610b4a825f83610f95565b6040516001600160a01b03838116602483015260448201839052610b9391859182169063a9059cbb90606401610df4565b5f5f60205f8451602086015f885af1806110a1576040513d5f823e3d81fd5b50505f513d915081156110b85780600114156110c5565b6001600160a01b0384163b155b15610e2657604051635274afe760e01b81526001600160a01b03851660048201526024016108c0565b5f600282600381111561110357611103611b43565b61110d9190611b57565b60ff166001149050919050565b5f838302815f1985870982811083820303915050805f0361114e5783828161114457611144611b2f565b04925050506106c6565b8084116111655761116560038515026011186112e3565b5f848688095f868103871696879004966002600389028118808a02820302808a02820302808a02820302808a02820302808a02820302808a02909103029181900381900460010186841190950394909402919094039290920491909117919091029150509392505050565b6001600160a01b0383166111fa578060025f8282546111ef9190611a2b565b909155506112579050565b6001600160a01b0383165f90815260208190526040902054818110156112395783818360405163391434e360e21b81526004016108c0939291906119b3565b6001600160a01b0384165f9081526020819052604090209082900390555b6001600160a01b03821661127357600280548290039055611291565b6001600160a01b0382165f9081526020819052604090208054820190555b816001600160a01b0316836001600160a01b03167fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef836040516112d691815260200190565b60405180910390a3505050565b634e487b715f52806020526024601cfd5b5f81518084528060208401602086015e5f602082860101526020601f19601f83011685010191505092915050565b602081525f6106c660208301846112f4565b5f60208284031215611344575f5ffd5b5035919050565b80356001600160a01b0381168114611361575f5ffd5b919050565b5f5f60408385031215611377575f5ffd5b6113808361134b565b946020939093013593505050565b5f5f5f606084860312156113a0575f5ffd5b6113a98461134b565b92506113b76020850161134b565b929592945050506040919091013590565b5f602082840312156113d8575f5ffd5b6106c68261134b565b634e487b7160e01b5f52604160045260245ffd5b604051601f8201601f1916810167ffffffffffffffff8111828210171561141e5761141e6113e1565b604052919050565b5f67ffffffffffffffff82111561143f5761143f6113e1565b5060051b60200190565b5f82601f830112611458575f5ffd5b813561146b61146682611426565b6113f5565b8082825260208201915060208360051b86010192508583111561148c575f5ffd5b602085015b838110156114b0576114a28161134b565b835260209283019201611491565b5095945050505050565b5f82601f8301126114c9575f5ffd5b81356114d761146682611426565b8082825260208201915060208360051b8601019250858311156114f8575f5ffd5b602085015b838110156114b05780358352602092830192016114fd565b5f5f67ffffffffffffffff84111561152f5761152f6113e1565b50601f8301601f1916602001611544816113f5565b915050828152838383011115611558575f5ffd5b828260208301375f602084830101529392505050565b5f82601f83011261157d575f5ffd5b813561158b61146682611426565b8082825260208201915060208360051b8601019250858311156115ac575f5ffd5b602085015b838110156114b057803567ffffffffffffffff8111156115cf575f5ffd5b8601603f810188136115df575f5ffd5b6115f188602083013560408401611515565b845250602092830192016115b1565b5f5f5f5f60808587031215611613575f5ffd5b843567ffffffffffffffff811115611629575f5ffd5b61163587828801611449565b945050602085013567ffffffffffffffff811115611651575f5ffd5b61165d878288016114ba565b935050604085013567ffffffffffffffff811115611679575f5ffd5b6116858782880161156e565b949793965093946060013593505050565b5f5f604083850312156116a7575f5ffd5b82359150602083013560ff811681146116be575f5ffd5b809150509250929050565b5f5f604083850312156116da575f5ffd5b823591506116ea6020840161134b565b90509250929050565b5f5f5f5f60808587031215611706575f5ffd5b843567ffffffffffffffff81111561171c575f5ffd5b61172887828801611449565b945050602085013567ffffffffffffffff811115611744575f5ffd5b611750878288016114ba565b935050604085013567ffffffffffffffff81111561176c575f5ffd5b6117788782880161156e565b925050606085013567ffffffffffffffff811115611794575f5ffd5b8501601f810187136117a4575f5ffd5b6117b387823560208401611515565b91505092959194509250565b5f5f5f606084860312156117d1575f5ffd5b833592506117e16020850161134b565b91506117ef6040850161134b565b90509250925092565b5f5f60408385031215611809575f5ffd5b6118128361134b565b91506116ea6020840161134b565b5f60208284031215611830575f5ffd5b5051919050565b600181811c9082168061184b57607f821691505b60208210810361186957634e487b7160e01b5f52602260045260245ffd5b50919050565b634e487b7160e01b5f52601160045260245ffd5b60ff818116838216019081111561067f5761067f61186f565b5f8151808452602084019350602083015f5b828110156118d55781516001600160a01b03168652602095860195909101906001016118ae565b5093949350505050565b5f8151808452602084019350602083015f5b828110156118d55781518652602095860195909101906001016118f1565b5f82825180855260208501945060208160051b830101602085015f5b8381101561195d57601f198584030188526119478383516112f4565b602098890198909350919091019060010161192b565b50909695505050505050565b608081525f61197b608083018761189c565b828103602084015261198d81876118df565b905082810360408401526119a1818661190f565b91505082606083015295945050505050565b6001600160a01b039390931683526020830191909152604082015260600190565b608081525f6119e6608083018761189c565b82810360208401526119f881876118df565b90508281036040840152611a0c818661190f565b90508281036060840152611a2081856112f4565b979650505050505050565b8082018082111561067f5761067f61186f565b6001815b6001841115611a7957808504811115611a5d57611a5d61186f565b6001841615611a6b57908102905b60019390931c928002611a42565b935093915050565b5f82611a8f5750600161067f565b81611a9b57505f61067f565b8160018114611ab15760028114611abb57611ad7565b600191505061067f565b60ff841115611acc57611acc61186f565b50506001821b61067f565b5060208310610133831016604e8410600b8410161715611afa575081810a61067f565b611b065f198484611a3e565b805f1904821115611b1957611b1961186f565b029392505050565b5f6106c660ff841683611a81565b634e487b7160e01b5f52601260045260245ffd5b634e487b7160e01b5f52602160045260245ffd5b5f60ff831680611b7557634e487b7160e01b5f52601260045260245ffd5b8060ff8416069150509291505056fea264697066735822122087eed03baacd362201bcdf68b782da80cef17dd0cfa4de257dccbb5c022a806f64736f6c634300081c0033a264697066735822122052bd55a89c8f79ddd62cedc6b6b701938be3d2ad539cfa23b50a0cd3f69774be64736f6c634300081c0033
Constructor Arguments (ABI-Encoded and is the last bytes of the Contract Creation Code above)
000000000000000000000000cf6a4db5831f6b0ad6d4661c49b5da56b0d3bf8d
-----Decoded View---------------
Arg [0] : _owner (address): 0xcF6A4Db5831f6b0aD6d4661c49B5DA56b0d3BF8D
-----Encoded View---------------
1 Constructor Arguments found :
Arg [0] : 000000000000000000000000cf6a4db5831f6b0ad6d4661c49b5da56b0d3bf8d
Deployed Bytecode Sourcemap
301891:20277:0:-:0;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;312788:547;;;;;;:::i;:::-;;:::i;:::-;;260934:99;261021:4;;;;;;;;;;;;-1:-1:-1;;;261021:4:0;;;;260934:99;;;;;;;:::i;:::-;;;;;;;;307533:186;;;:::i;:::-;;;1091:25:1;;;1079:2;1064:18;307533:186:0;945:177:1;218142:190:0;;;;;;:::i;:::-;;:::i;:::-;;;1292:14:1;;1285:22;1267:41;;1255:2;1240:18;218142:190:0;1127:187:1;299562:113:0;;;;;;:::i;:::-;-1:-1:-1;;;;;299651:16:0;299627:4;299651:16;;;:7;:16;;;;;;;;;299562:113;298001:32;;;;;-1:-1:-1;;;;;298001:32:0;;;;;;-1:-1:-1;;;;;1735:32:1;;;1717:51;;1705:2;1690:18;298001:32:0;1571:203:1;299394:123:0;;;;;;:::i;:::-;;:::i;305142:125::-;;;;;;:::i;:::-;-1:-1:-1;;;;;305236:23:0;;;305209:7;305236:23;;;:14;:23;;;;;;;;305142:125;216951:99;217030:12;;216951:99;;313381:1270;;;;;;:::i;:::-;;:::i;309032:1701::-;;;;;;:::i;:::-;;:::i;218942:249::-;;;;;;:::i;:::-;;:::i;216802:84::-;;;216876:2;2665:36:1;;2653:2;2638:18;216802:84:0;2523:184:1;305780:345:0;;;;;;:::i;:::-;;:::i;299886:132::-;;;;;;:::i;:::-;-1:-1:-1;;;;;299975:21:0;;;299951:4;299975:21;;;:13;:21;;;;;;;:35;;;299886:132;298153:29;;;;;-1:-1:-1;;;;;298153:29:0;;;302356:35;;;;;;310779:1037;;;;;;:::i;:::-;;:::i;306588:419::-;;;;;;:::i;:::-;;:::i;298228:30::-;;;;;-1:-1:-1;;;;;298228:30:0;;;307053:434;;;;;;:::i;:::-;;:::i;217113:118::-;;;;;;:::i;:::-;-1:-1:-1;;;;;217205:18:0;217178:7;217205:18;;;:9;:18;;;;;;;217113:118;121425:103;;;:::i;314697:1007::-;;;;;;:::i;:::-;;:::i;298079:28::-;;;;;-1:-1:-1;;;;;298079:28:0;;;120750:87;120796:7;120823:6;-1:-1:-1;;;;;120823:6:0;120750:87;;298304:35;;;;;;261041:103;261130:6;;;;;;;;;;;;-1:-1:-1;;;261130:6:0;;;;261041:103;;305313:421;;;;;;:::i;:::-;;:::i;312043:517::-;;;;;;:::i;:::-;;:::i;308341:645::-;;;;;;:::i;:::-;;:::i;302183:42::-;;;;;;217436:182;;;;;;:::i;:::-;;:::i;302438:36::-;;;;;;302521:45;;;;;;307946:349;;;;;;:::i;:::-;;:::i;315750:116::-;;;;;;:::i;:::-;;:::i;303572:1343::-;;;;;;:::i;:::-;;:::i;306403:139::-;;;;;;:::i;:::-;;:::i;:::-;;;;;;;:::i;217681:142::-;;;;;;:::i;:::-;-1:-1:-1;;;;;217788:18:0;;;217761:7;217788:18;;;:11;:18;;;;;;;;:27;;;;;;;;;;;;;217681:142;306171:186;;;;;;:::i;:::-;;:::i;:::-;;;;;;;:::i;302272:37::-;;;;;;302098:38;;;;;;121683:220;;;;;;:::i;:::-;;:::i;299720:121::-;;;;;;:::i;:::-;-1:-1:-1;;;;;299812:21:0;;;299785:7;299812:21;;;:13;:21;;;;;;;;299720:121;300063:339;;;;;;:::i;:::-;;:::i;312788:547::-;120636:13;:11;:13::i;:::-;-1:-1:-1;;;;;298990:16:0;::::1;;::::0;;;:7:::1;:16;::::0;;;;;312920:7;;298990:16:::1;;298985:73;;299030:16;;-1:-1:-1::0;;;299030:16:0::1;;;;;;;;;;;298985:73;-1:-1:-1::0;;;;;313001:20:0;::::2;312984:14;313001:20:::0;;;:11:::2;:20;::::0;;;;:28;;313022:6;;313001:28;::::2;;;;;:::i;:::-;;::::0;;;::::2;::::0;;;::::2;::::0;;::::2;::::0;;::::2;:35:::0;-1:-1:-1;;;;;313093:20:0;::::2;::::0;;:11:::2;:20:::0;;;;;;;:27;313001:35;;-1:-1:-1;313093:31:0::2;::::0;313123:1:::2;::::0;313093:31:::2;:::i;:::-;313083:6;:41;313079:158;;-1:-1:-1::0;;;;;313172:20:0;::::2;;::::0;;;:11:::2;:20;::::0;;;;313193:27;;:31:::2;::::0;313223:1:::2;::::0;313193:31:::2;:::i;:::-;313172:53;;;;;;;;:::i;:::-;;;;;;;;;;;313141:11;:20;313153:7;-1:-1:-1::0;;;;;313141:20:0::2;-1:-1:-1::0;;;;;313141:20:0::2;;;;;;;;;;;;313162:6;313141:28;;;;;;;;:::i;:::-;;::::0;;;::::2;::::0;;;:84;;:28:::2;::::0;;::::2;;:84:::0;;;::::2;::::0;;::::2;::::0;;::::2;::::0;313079:158:::2;-1:-1:-1::0;;;;;313247:20:0;::::2;;::::0;;;:11:::2;:20;::::0;;;;:26;;;::::2;;;;:::i;:::-;;::::0;;;::::2;::::0;;::::2;-1:-1:-1::0;;313247:26:0;;;;;::::2;;::::0;;;::::2;;::::0;;;313291:36:::2;::::0;-1:-1:-1;;;;;313291:36:0;::::2;::::0;::::2;::::0;::::2;::::0;313312:6;;313320;;7704:25:1;;;7760:2;7745:18;;7738:34;7692:2;7677:18;;7530:248;313291:36:0::2;;;;;;;;312934:401;120660:1:::1;312788:547:::0;;:::o;307533:186::-;307586:7;307606:19;307646:21;;307628:15;:39;;;;:::i;:::-;307606:61;;307699:12;;307685:11;:26;;;;:::i;:::-;307678:33;;;307533:186;:::o;218142:190::-;218215:4;821:10;218271:31;821:10;218287:7;218296:5;218271:8;:31::i;:::-;218320:4;218313:11;;;218142:190;;;;;:::o;299394:123::-;299458:7;299493;-1:-1:-1;;;;;299485:22:0;;:24;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::i;313381:1270::-;313540:14;120636:13;:11;:13::i;:::-;-1:-1:-1;;;;;298990:16:0;::::1;;::::0;;;:7:::1;:16;::::0;;;;;313513:7;;298990:16:::1;;298985:73;;299030:16;;-1:-1:-1::0;;;299030:16:0::1;;;;;;;;;;;298985:73;-1:-1:-1::0;;;;;313632:20:0;::::2;313605:24;313632:20:::0;;;:11:::2;:20;::::0;;;;:28;;313653:6;;313632:28;::::2;;;;;:::i;:::-;;;;;;;;;;;313605:55;;313786:11;;313768:5;:15;;;:29;;;;:::i;:::-;313750:15;:47;313746:75;;;313806:15;;-1:-1:-1::0;;;313806:15:0::2;;;;;;;;;;;313746:75;313935:21;313968:7;-1:-1:-1::0;;;;;313959:29:0::2;;:31;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;313935:55;;314025:13;314010:5;:12;;;:28;:59;;314057:12:::0;;314010:59:::2;;;314041:13;314010:59;-1:-1:-1::0;;;;;314126:20:0;::::2;;::::0;;;:11:::2;:20;::::0;;;;:27;314001:68;;-1:-1:-1;314126:31:0::2;::::0;314156:1:::2;::::0;314126:31:::2;:::i;:::-;314116:6;:41;314112:158;;-1:-1:-1::0;;;;;314205:20:0;::::2;;::::0;;;:11:::2;:20;::::0;;;;314226:27;;:31:::2;::::0;314256:1:::2;::::0;314226:31:::2;:::i;:::-;314205:53;;;;;;;;:::i;:::-;;;;;;;;;;;314174:11;:20;314186:7;-1:-1:-1::0;;;;;314174:20:0::2;-1:-1:-1::0;;;;;314174:20:0::2;;;;;;;;;;;;314195:6;314174:28;;;;;;;;:::i;:::-;;::::0;;;::::2;::::0;;;:84;;:28:::2;::::0;;::::2;;:84:::0;;;::::2;::::0;;::::2;::::0;;::::2;::::0;314112:158:::2;-1:-1:-1::0;;;;;314280:20:0;::::2;;::::0;;;:11:::2;:20;::::0;;;;:26;;;::::2;;;;:::i;:::-;;::::0;;;::::2;::::0;;::::2;-1:-1:-1::0;;314280:26:0;;;;;::::2;;::::0;;;::::2;;::::0;;;;;314491:10;;314487:102:::2;;314548:6;::::0;;314526:51:::2;::::0;-1:-1:-1;;;314526:51:0;;-1:-1:-1;;;;;8723:32:1;;;314526:51:0;;::::2;8705::1::0;;;;8772:18;;;8765:34;;;314548:6:0;::::2;::::0;314526:34:::2;::::0;8678:18:1;;314526:51:0::2;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;314518:59;;314487:102;314606:37;::::0;;9012:25:1;;;9068:2;9053:18;;9046:34;;;9096:18;;;9089:34;;;-1:-1:-1;;;;;314606:37:0;::::2;::::0;::::2;::::0;9000:2:1;8985:18;314606:37:0::2;;;;;;;313561:1090;;;120660:1:::1;313381:1270:::0;;;;:::o;309032:1701::-;309155:8;309167:1;309155:13;309151:38;;309177:12;;-1:-1:-1;;;309177:12:0;;;;;;;;;;;309151:38;309293:10;309261:14;309278:26;;;:14;:26;;;;;;-1:-1:-1;;;;;309278:26:0;;309315:44;;309348:11;;-1:-1:-1;;;309348:11:0;;;;;;;;;;;309315:44;309500:18;;309478:10;309464:25;;;;:13;:25;;;;;:32;:54;309460:91;;309527:24;;-1:-1:-1;;;309527:24:0;;;;;;;;;;;309460:91;-1:-1:-1;;;;;309643:19:0;;309672:1;309643:19;;;:11;:19;;;;;:26;:30;309639:66;;309682:23;;-1:-1:-1;;;309682:23:0;;;;;;;;;;;309639:66;309819:10;309784:22;217205:18;;;:9;:18;;;;;;;309945:35;;:23;:35::i;:::-;309922:58;-1:-1:-1;310093:23:0;310108:8;309922:58;310093:23;:::i;:::-;310076:14;:40;310072:79;;;310125:26;;-1:-1:-1;;;310125:26:0;;;;;;;;;;;310072:79;310290:40;;-1:-1:-1;;;310290:40:0;;;;;1091:25:1;;;310265:22:0;;-1:-1:-1;;;;;310290:30:0;;;;;1064:18:1;;310290:40:0;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;310446:10;310432:25;;;;:13;:25;;;;;;;;310477:159;;;;;;;;;;;;;;;;310605:15;310477:159;;;;;;310432:215;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;310665:60;310265:65;;-1:-1:-1;;;;;;310665:60:0;;;;;;;310518:8;;310265:65;;7704:25:1;;;7760:2;7745:18;;7738:34;7692:2;7677:18;;7530:248;310665:60:0;;;;;;;;309092:1641;;;;309032:1701;:::o;218942:249::-;219029:4;821:10;219087:37;219103:4;821:10;219118:5;219087:15;:37::i;:::-;219135:26;219145:4;219151:2;219155:5;219135:9;:26::i;:::-;219179:4;219172:11;;;218942:249;;;;;;:::o;305780:345::-;305849:7;305922:14;305948:7;-1:-1:-1;;;;;305939:29:0;;:31;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;306088:6;;;306079:38;;-1:-1:-1;;;306079:38:0;;305922:48;;-1:-1:-1;;;;;;306088:6:0;;306079:30;;:38;;305922:48;;306079:38;1091:25:1;;;1079:2;1064:18;;945:177;306079:38:0;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::i;310779:1037::-;-1:-1:-1;;;;;310948:23:0;;;310846:13;310948:23;;;:14;:23;;;;;;310846:13;;310948:23;;310982:44;;311015:11;;-1:-1:-1;;;311015:11:0;;;;;;;;;;;310982:44;-1:-1:-1;;;;;311123:22:0;;311091:29;311123:22;;;:13;:22;;;;;311160:13;;311123:22;;311160:18;311156:50;;311187:19;;-1:-1:-1;;;311187:19:0;;;;;;;;;;;311156:50;-1:-1:-1;;;;;311298:19:0;;311327:1;311298:19;;;:11;:19;;;;;:26;:30;311294:66;;311337:23;;-1:-1:-1;;;311337:23:0;;;;;;;;;;;311294:66;311432:39;311447:7;311456:6;311464;311432:14;:39::i;:::-;311423:48;;;;:::i;:::-;;;311666:18;311676:7;-1:-1:-1;;;;;217205:18:0;217178:7;217205:18;;;:9;:18;;;;;;;217113:118;311666:18;311688:1;311666:23;311662:147;;-1:-1:-1;;;;;311761:23:0;;311795:1;311761:23;;;:14;:23;;;;;:36;;-1:-1:-1;;;;;;311761:36:0;;;311662:147;310861:955;;310779:1037;;;:::o;306588:419::-;-1:-1:-1;;;;;306757:23:0;;;306661:7;306757:23;;;:14;:23;;;;;;306661:7;;306757:23;;306791:34;;-1:-1:-1;306824:1:0;;306588:419;-1:-1:-1;;306588:419:0:o;306791:34::-;306943:56;306958:6;306966:32;306990:7;306966:23;:32::i;307053:434::-;307291:41;;-1:-1:-1;;;307291:41:0;;;;;1091:25:1;;;307178:7:0;;;;-1:-1:-1;;;;;307291:31:0;;;;;1064:18:1;;307291:41:0;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;307450:6;;;307441:38;;-1:-1:-1;;;307441:38:0;;307274:58;;-1:-1:-1;;;;;;307450:6:0;;307441:30;;:38;;307274:58;;307441:38;1091:25:1;;;1079:2;1064:18;;945:177;307441:38:0;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;307434:45;307053:434;-1:-1:-1;;;;307053:434:0:o;121425:103::-;120636:13;:11;:13::i;:::-;121490:30:::1;121517:1;121490:18;:30::i;:::-;121425:103::o:0;314697:1007::-;120636:13;:11;:13::i;:::-;314838:17:::1;314858:13;:11;:13::i;:::-;314838:33;;314982:14;-1:-1:-1::0;;314999:6:0::1;:27;:48;;315041:6;314999:48;;;315029:9;314999:48;314982:65;;315115:6;315125:1;315115:11:::0;315111:36:::1;;315135:12;;-1:-1:-1::0;;;315135:12:0::1;;;;;;;;;;;315111:36;315259:9;315250:6;:18;315246:63;;;315277:32;;-1:-1:-1::0;;;315277:32:0::1;;;;;;;;;;;315246:63;315450:12;::::0;315397:20:::1;::::0;315445:1:::1;315421:21;315450:12:::0;315421:6;:21:::1;:::i;:::-;:25;;;;:::i;:::-;315420:42;;;;:::i;:::-;315397:65;;315498:12;315473:21;;:37;;;;;;;:::i;:::-;::::0;;;-1:-1:-1;;315647:6:0::1;::::0;315627:5:::1;::::0;315620:42:::1;::::0;-1:-1:-1;;;;;315627:5:0;;::::1;::::0;315647:6:::1;315655::::0;315620:26:::1;:42::i;:::-;315680:16;::::0;1091:25:1;;;315680:16:0::1;::::0;1079:2:1;1064:18;315680:16:0::1;;;;;;;314759:945;;;314697:1007:::0;:::o;305313:421::-;-1:-1:-1;;;;;305474:23:0;;;305378:7;305474:23;;;:14;:23;;;;;;305378:7;;305474:23;;305508:34;;-1:-1:-1;305541:1:0;;305313:421;-1:-1:-1;;305313:421:0:o;305508:34::-;305684:42;305699:6;305707:18;305717:7;-1:-1:-1;;;;;217205:18:0;217178:7;217205:18;;;:9;:18;;;;;;;217113:118;312043:517;298778:4;;312203:13;;-1:-1:-1;;;;;298778:4:0;298764:10;:18;298760:73;;298806:15;;-1:-1:-1;;;298806:15:0;;;;;;;;;;;298760:73;-1:-1:-1;;;;;298990:16:0;::::1;;::::0;;;:7:::1;:16;::::0;;;;;312176:7;;298990:16:::1;;298985:73;;299030:16;;-1:-1:-1::0;;;299030:16:0::1;;;;;;;;;;;298985:73;312285:7:::2;312296:1;312285:12:::0;312281:37:::2;;312306:12;;-1:-1:-1::0;;;312306:12:0::2;;;;;;;;;;;312281:37;-1:-1:-1::0;;;;;312375:20:0;::::2;;::::0;;;:11:::2;:20;::::0;;;;;;;:27;;312439:57;;;;::::2;::::0;;;;;312479:15:::2;312439:57:::0;;::::2;::::0;;;312413:84:::2;::::0;;::::2;::::0;;;;;;;;;;;::::2;::::0;::::2;::::0;;::::2;::::0;;;;;;;;::::2;::::0;;;;312515:37;;7704:25:1;;;7745:18;;;7738:34;;;312375:27:0;;-1:-1:-1;312515:37:0::2;::::0;7677:18:1;312515:37:0::2;;;;;;;298843:1:::1;312043:517:::0;;;;:::o;308341:645::-;-1:-1:-1;;;;;298990:16:0;;308586:7;298990:16;;;:7;:16;;;;;;308568:7;;298990:16;;298985:73;;299030:16;;-1:-1:-1;;;299030:16:0;;;;;;;;;;;298985:73;308687:5:::1;::::0;308674:73:::1;::::0;-1:-1:-1;;;308674:73:0;;-1:-1:-1;;;;;9685:32:1;;;308674:73:0::1;::::0;::::1;9667:51:1::0;9754:32;;;9734:18;;;9727:60;9803:18;;;9796:34;;;9846:18;;;9839:34;;;9922:4;9910:17;;9889:19;;;9882:46;9944:19;;;9937:35;;;9988:19;;;9981:35;;;308687:5:0;;::::1;::::0;308674:26:::1;::::0;9639:19:1;;308674:73:0::1;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;-1:-1:-1::0;;308874:54:0::1;::::0;-1:-1:-1;;;308874:54:0;;-1:-1:-1;;;;;8723:32:1;;;308874:54:0::1;::::0;::::1;8705:51:1::0;8772:18;;;8765:34;;;308874:39:0;::::1;::::0;-1:-1:-1;308874:39:0::1;::::0;-1:-1:-1;8678:18:1;;308874:54:0::1;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;308948:30;308955:5;308962:7;308971:6;308948;:30::i;:::-;308941:37:::0;308341:645;-1:-1:-1;;;;;;;;;308341:645:0:o;217436:182::-;217505:4;821:10;217561:27;821:10;217578:2;217582:5;217561:9;:27::i;307946:349::-;-1:-1:-1;;;;;298990:16:0;;308080:7;298990:16;;;:7;:16;;;;;;308053:7;;298990:16;;298985:73;;299030:16;;-1:-1:-1;;;299030:16:0;;;;;;;;;;;298985:73;308174:5:::1;::::0;308167:65:::1;::::0;-1:-1:-1;;;;;308174:5:0::1;308198:10;308218:4;308225:6:::0;308167:30:::1;:65::i;:::-;308252:35;308259:10;308271:7;308280:6;308252;:35::i;315750:116::-:0;120636:13;:11;:13::i;:::-;315832:26:::1;315852:5;315832:19;:26::i;:::-;315750:116:::0;:::o;303572:1343::-;120636:13;:11;:13::i;:::-;38429:21;33745:15;;-1:-1:-1;;;33745:15:0;::::1;;;33744:16;::::0;33792:14:::1;;33598:30;34177:16:::0;;:34;::::1;;;;34197:14;34177:34;34157:54;;34222:17;34242:11;:16;;34257:1;34242:16;:50;;;;-1:-1:-1::0;34270:4:0::1;34262:25;:30:::0;34242:50:::1;34222:70;;34310:12;34309:13;:30;;;;;34327:12;34326:13;34309:30;34305:93;;;34363:23;;-1:-1:-1::0;;;34363:23:0::1;;;;;;;;;;;34305:93;34408:18:::0;;-1:-1:-1;;34408:18:0::1;34425:1;34408:18;::::0;;34437:69;::::1;;;34472:22:::0;;-1:-1:-1;;;;34472:22:0::1;-1:-1:-1::0;;;34472:22:0::1;::::0;;34437:69:::1;-1:-1:-1::0;;;;;304017:23:0;::::2;::::0;;:46:::2;;-1:-1:-1::0;;;;;;304044:19:0;::::2;::::0;304017:46:::2;:70;;;-1:-1:-1::0;;;;;;304067:20:0;::::2;::::0;304017:70:::2;:123;;;-1:-1:-1::0;;;;;;304108:32:0;::::2;::::0;304017:123:::2;303999:200;;;304174:13;;-1:-1:-1::0;;;304174:13:0::2;;;;;;;;;;;303999:200;304213:24:::0;;;:47:::2;;-1:-1:-1::0;304241:19:0;;304213:47:::2;:68;;;-1:-1:-1::0;304264:17:0;;304213:68:::2;304209:120;;;304305:12;;-1:-1:-1::0;;;304305:12:0::2;;;;;;;;;;;304209:120;304378:67;304400:9;304411:5;304418:6;304426:18;299246:8:::0;:20;;-1:-1:-1;;;;;299246:20:0;;;-1:-1:-1;;;;;;299246:20:0;;;;;;;299277:4;:12;;;;;;;;;;;;;;;299300:5;:14;;;;;;;;;;;;;;;299325:6;:16;;;;;;;;;;;299085:264;304378:67:::2;304456:14;:32:::0;;;304499:18:::2;:40:::0;;;304550:13:::2;:30:::0;;;304591:11:::2;:26:::0;;;304667:34:::2;304687:13:::0;304667:19:::2;:34::i;:::-;304736:15;304712:21;:39:::0;304866:5:::2;::::0;304881:6:::2;::::0;;304859:48:::2;::::0;-1:-1:-1;;;304859:48:0;;-1:-1:-1;;;;;304881:6:0;;::::2;304859:48:::0;;::::2;8705:51:1::0;;;;-1:-1:-1;;8772:18:1;;;8765:34;304866:5:0;;::::2;::::0;304859:21:::2;::::0;8678:18:1;;304859:48:0::2;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;;34532:14:::1;34528:104;;;34563:23:::0;;-1:-1:-1;;;;34563:23:0::1;::::0;;34606:14:::1;::::0;-1:-1:-1;10462:50:1;;34606:14:0::1;::::0;10450:2:1;10435:18;34606:14:0::1;;;;;;;34528:104;33530:1109;;;;;303572:1343:::0;;;;;;;;;:::o;306403:139::-;-1:-1:-1;;;;;306514:20:0;;;;;;:11;:20;;;;;;;;306507:27;;;;;;;;;;;;;;;;;306475:19;;306507:27;;306514:20;;306507:27;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;306403:139;;;:::o;306171:186::-;-1:-1:-1;;;;;306327:22:0;;;;;;:13;:22;;;;;;;;306320:29;;;;;;;;;;;;;;;;;306281:21;;306320:29;;306327:22;;306320:29;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;121683:220;120636:13;:11;:13::i;:::-;-1:-1:-1;;;;;121768:22:0;::::1;121764:93;;121814:31;::::0;-1:-1:-1;;;121814:31:0;;121842:1:::1;121814:31;::::0;::::1;1717:51:1::0;1690:18;;121814:31:0::1;;;;;;;;121764:93;121867:28;121886:8;121867:18;:28::i;300063:339::-:0;300136:7;300177:5;300160:14;:22;300156:84;;;300206:22;;-1:-1:-1;;;300206:22:0;;;;;;;;;;;300156:84;300266:10;299951:4;299975:21;;;:13;:21;;;;;;-1:-1:-1;;;;;299975:21:0;:35;300252:82;;300301:21;;-1:-1:-1;;;300301:21:0;;;;;;;;;;;300252:82;300353:41;300367:10;300379:14;300353:13;:41::i;120915:166::-;120796:7;120823:6;-1:-1:-1;;;;;120823:6:0;821:10;120975:23;120971:103;;121022:40;;-1:-1:-1;;;121022:40:0;;821:10;121022:40;;;1717:51:1;1690:18;;121022:40:0;1571:203:1;223001:130:0;223086:37;223095:5;223102:7;223111:5;223118:4;223086:8;:37::i;:::-;223001:130;;;:::o;321704:239::-;321777:15;;321805:131;-1:-1:-1;;;;;321829:22:0;;;;;;:13;:22;;;;;:29;321825:33;;321805:131;;;-1:-1:-1;;;;;321891:22:0;;;;;;:13;:22;;;;;:25;;321914:1;;321891:25;;;;;;:::i;:::-;;;;;;;;;;;:33;;;321880:44;;;;;:::i;:::-;;-1:-1:-1;321860:3:0;;321805:131;;;;321704:239;;;:::o;224733:486::-;-1:-1:-1;;;;;217788:18:0;;;224833:24;217788:18;;;:11;:18;;;;;;;;:27;;;;;;;;;;-1:-1:-1;;224900:36:0;;224896:316;;;224976:5;224957:16;:24;224953:132;;;225009:60;;-1:-1:-1;;;225009:60:0;;-1:-1:-1;;;;;10743:32:1;;225009:60:0;;;10725:51:1;10792:18;;;10785:34;;;10835:18;;;10828:34;;;10698:18;;225009:60:0;10523:345:1;224953:132:0;225128:57;225137:5;225144:7;225172:5;225153:16;:24;225179:5;225128:8;:57::i;:::-;224822:397;224733:486;;;:::o;219576:308::-;-1:-1:-1;;;;;219660:18:0;;219656:88;;219702:30;;-1:-1:-1;;;219702:30:0;;219729:1;219702:30;;;1717:51:1;1690:18;;219702:30:0;1571:203:1;219656:88:0;-1:-1:-1;;;;;219758:16:0;;219754:88;;219798:32;;-1:-1:-1;;;219798:32:0;;219827:1;219798:32;;;1717:51:1;1690:18;;219798:32:0;1571:203:1;219754:88:0;219852:24;219860:4;219866:2;219870:5;219852:7;:24::i;320416:1209::-;320568:13;260821:4;-1:-1:-1;;260800:25:0;;;;;320568:13;260800:25;-1:-1:-1;320599:9:0::1;::::0;;320748:602:::1;320759:14:::0;;320755:18;::::1;320748:602;;;320836:13;;320813:7;320821:1;320813:10;;;;;;;;:::i;:::-;;;;;;;;;;;:20;;;:36;;;;:::i;:::-;320794:15;:55;320790:549;;320930:25;320958:7;320966:1;320958:10;;;;;;;;:::i;:::-;;;;;;;;;;;320930:38;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;::::0;::::1;;;321058:7;321083:1;321066:7;:14;;;;:18;;;;:::i;:::-;321058:27;;;;;;;;:::i;:::-;;;;;;;;;;;321045:7;321053:1;321045:10;;;;;;;;:::i;:::-;;::::0;;;::::1;::::0;;;:40;;:10:::1;::::0;;::::1;;:40:::0;;;::::1;::::0;;::::1;::::0;;;::::1;::::0;::::1;::::0;;::::1;::::0;;::::1;::::0;321104:13;;:7;;:13;::::1;;;;:::i;:::-;;::::0;;;::::1;::::0;;::::1;-1:-1:-1::0;;321104:13:0;;;;;::::1;;::::0;;;::::1;::::0;::::1;::::0;;;::::1;;::::0;;;321209;;321198:24:::1;::::0;;::::1;:::i;:::-;;;321259:5;:20;;;321241:38;;;;;:::i;:::-;;;320851:444;320748:602;;320790:549;321320:3:::0;::::1;::::0;::::1;:::i;:::-;;;;320748:602;;;321441:7;321452:1;321441:12:::0;321437:76:::1;;321477:24;;-1:-1:-1::0;;;321477:24:0::1;;;;;;;;;;;321437:76;321566:51;321575:7;321584;321593;321602:14;321566:8;:51::i;:::-;321558:59:::0;-1:-1:-1;260869:5:0;;-1:-1:-1;;;260848:26:0;;-1:-1:-1;;260848:26:0;260869:5;260848:26;;320416:1209;;;;;:::o;122063:191::-;122137:16;122156:6;;-1:-1:-1;;;;;122173:17:0;;;-1:-1:-1;;;;;;122173:17:0;;;;;;122206:40;;122156:6;;;;;;;122206:40;;122137:16;122206:40;122126:128;122063:191;:::o;251769:162::-;251879:43;;-1:-1:-1;;;;;8723:32:1;;;251879:43:0;;;8705:51:1;8772:18;;;8765:34;;;251852:71:0;;251872:5;;251894:14;;;;;8678:18:1;;251879:43:0;;;;;;;;;;;;;;;;;;;;;;-1:-1:-1;;;;;251879:43:0;;;;;;;;;;;251852:19;:71::i;316262:1837::-;316390:15;260821:4;-1:-1:-1;;260800:25:0;;;;;316390:15;260800:25;;316473:6:::1;316483:1;316473:11:::0;316469:36:::1;;316493:12;;-1:-1:-1::0;;;316493:12:0::1;;;;;;;;;;;316469:36;316611:14;;316602:6;:23;316598:55;;;316634:19;;-1:-1:-1::0;;;316634:19:0::1;;;;;;;;;;;316598:55;-1:-1:-1::0;;;;;316745:20:0;::::1;316775:1;316745:20:::0;;;:11:::1;:20;::::0;;;;:27;:31;316741:67:::1;;316785:23;;-1:-1:-1::0;;;316785:23:0::1;;;;;;;;;;;316741:67;-1:-1:-1::0;;;;;316923:23:0;;::::1;316898:22;316923:23:::0;;;:14:::1;:23;::::0;;;;;::::1;316961:28:::0;;;::::1;::::0;:57:::1;;;317011:7;-1:-1:-1::0;;;;;316993:25:0::1;:14;-1:-1:-1::0;;;;;316993:25:0::1;;;316961:57;316957:145;;;317042:48;::::0;-1:-1:-1;;;317042:48:0;;-1:-1:-1;;;;;1735:32:1;;317042:48:0::1;::::0;::::1;1717:51:1::0;1690:18;;317042:48:0::1;1571:203:1::0;316957:145:0::1;-1:-1:-1::0;;;;;317171:28:0;::::1;317167:94;;-1:-1:-1::0;;;;;317216:23:0;;::::1;;::::0;;;:14:::1;:23;::::0;;;;:33;;-1:-1:-1;;;;;;317216:33:0::1;::::0;;::::1;::::0;;;::::1;::::0;;317167:94:::1;317372:6;::::0;;317363:47:::1;::::0;-1:-1:-1;;;317363:47:0;;;;::::1;11187:25:1::0;;;317404:4:0::1;11228:18:1::0;;;11221:60;317346:14:0::1;::::0;-1:-1:-1;;;;;317372:6:0;;::::1;::::0;317363:24:::1;::::0;11160:18:1;;317363:47:0::1;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;317346:64;;317487:6;317497:1;317487:11:::0;317483:43:::1;;317507:19;;-1:-1:-1::0;;;317507:19:0::1;;;;;;;;;;;317483:43;317720:48;::::0;-1:-1:-1;;;317720:48:0;;::::1;::::0;::::1;11187:25:1::0;;;317762:4:0::1;11228:18:1::0;;;11221:60;-1:-1:-1;;;;;317720:25:0;::::1;::::0;::::1;::::0;11160:18:1;;317720:48:0::1;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;317710:58;;317847:7;317858:1;317847:12:::0;317843:44:::1;;317868:19;;-1:-1:-1::0;;;317868:19:0::1;;;;;;;;;;;317843:44;318002:23;318008:7;318017;318002:5;:23::i;:::-;318043:48;::::0;;9012:25:1;;;9068:2;9053:18;;9046:34;;;9096:18;;;9089:34;;;-1:-1:-1;;;;;318043:48:0;;::::1;::::0;;;::::1;::::0;::::1;::::0;9000:2:1;8985:18;318043:48:0::1;;;;;;;-1:-1:-1::0;260869:5:0;;-1:-1:-1;;;260848:26:0;;;260869:5;260848:26;;316262:1837;;;;;:::o;252176:190::-;252304:53;;-1:-1:-1;;;;;11512:32:1;;;252304:53:0;;;11494:51:1;11581:32;;;11561:18;;;11554:60;11630:18;;;11623:34;;;252277:81:0;;252297:5;;252319:18;;;;;11467::1;;252304:53:0;11292:371:1;321992:173:0;322088:12;;322069:47;;;7704:25:1;;;7760:2;7745:18;;7738:34;;;322069:47:0;;7677:18:1;322069:47:0;;;;;;;322129:12;:28;321992:173::o;300505:1195::-;300693:6;;300604:14;;-1:-1:-1;;;;;300693:6:0;300689:76;;300737:16;;-1:-1:-1;;;300737:16:0;;;;;;;;;;;300689:76;300849:11;300847:13;;;;;;301052:33;;300924:278;;300849:11;;-1:-1:-1;;;;;300977:24:0;;;301052:33;;;;;:::i;:::-;-1:-1:-1;;301052:33:0;;;;;;;;;;;;;;;;301115:8;;301125:5;;301132:6;;301148:11;;-1:-1:-1;;;;;301115:8:0;;;301052:33;301104:72;;11955:51:1;301125:5:0;;;12022:18:1;;;12015:60;301132:6:0;;12091:18:1;;;12084:60;12180:32;;;12160:18;;;12153:60;12229:19;;;12222:35;12273:19;;;;12266:35;;;301104:72:0;;;;;;;;;;11927:19:1;;;301104:72:0;;;301017:174;;301052:33;301017:174;;;:::i;:::-;;;;;;;;;;;;;300924:14;:278::i;:::-;-1:-1:-1;;;;;301248:21:0;;;;;;;:13;:21;;;;;;;;:30;;-1:-1:-1;;;;;;301248:30:0;;;;;;;;;;301289:15;;;:7;:15;;;;;;;:22;;-1:-1:-1;;301289:22:0;-1:-1:-1;301289:22:0;;;301385:4;;301371:64;;-1:-1:-1;;;301371:64:0;;;;;11494:51:1;;;;11561:18;;;11554:60;;;;11630:18;;;11623:34;;;301248:30:0;;-1:-1:-1;301385:4:0;;;301371:32;;11467:18:1;;301371:64:0;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;-1:-1:-1;301588:6:0;;;301581:49;;-1:-1:-1;;;301581:49:0;;-1:-1:-1;;;;;8723:32:1;;;301581:49:0;;;8705:51:1;;;;-1:-1:-1;;8772:18:1;;;8765:34;301588:6:0;;;301581:22;;8678:18:1;;301581:49:0;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;-1:-1:-1;301648:44:0;;;-1:-1:-1;;;;;8723:32:1;;;8705:51;;8787:2;8772:18;;8765:34;;;301648:44:0;;;;;8678:18:1;301648:44:0;;;;;;;300505:1195;;;;:::o;223998:443::-;-1:-1:-1;;;;;224111:19:0;;224107:91;;224154:32;;-1:-1:-1;;;224154:32:0;;224183:1;224154:32;;;1717:51:1;1690:18;;224154:32:0;1571:203:1;224107:91:0;-1:-1:-1;;;;;224212:21:0;;224208:92;;224257:31;;-1:-1:-1;;;224257:31:0;;224285:1;224257:31;;;1717:51:1;1690:18;;224257:31:0;1571:203:1;224208:92:0;-1:-1:-1;;;;;224310:18:0;;;;;;;:11;:18;;;;;;;;:27;;;;;;;;;:35;;;224356:78;;;;224407:7;-1:-1:-1;;;;;224391:31:0;224400:5;-1:-1:-1;;;;;224391:31:0;;224416:5;224391:31;;;;1091:25:1;;1079:2;1064:18;;945:177;224391:31:0;;;;;;;;223998:443;;;;:::o;261330:226::-;261432:18;;;;261427:76;;261474:17;;-1:-1:-1;;;261474:17:0;;;;;;;;;;;261427:76;261515:33;261529:5;261536:3;261541:6;261515:13;:33::i;318963:1328::-;319094:13;319177:8;319189:1;319177:13;319173:38;;319199:12;;-1:-1:-1;;;319199:12:0;;;;;;;;;;;319173:38;319270:24;319276:7;319285:8;319270:5;:24::i;:::-;319421:64;;-1:-1:-1;;;319421:64:0;;;;;13289:25:1;;;319464:4:0;13330:18:1;;;13323:60;;;13399:18;;;13392:60;319396:22:0;;-1:-1:-1;;;;;319421:24:0;;;;;13262:18:1;;319421:64:0;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;319396:89;;319592:14;319638:15;319621:14;:32;319617:440;;;319757:14;319774:32;319791:15;319774:14;:32;:::i;:::-;319828:6;;319757:49;;-1:-1:-1;319821:44:0;;-1:-1:-1;;;;;319828:6:0;319849:7;319757:49;319821:27;:44::i;:::-;319889:15;319880:24;;319655:261;319617:440;;;-1:-1:-1;320031:14:0;319617:440;320169:6;;;320160:55;;-1:-1:-1;;;320160:55:0;;;;;13289:25:1;;;-1:-1:-1;;;;;13350:32:1;;;13330:18;;;13323:60;320209:4:0;13399:18:1;;;13392:60;320169:6:0;;320160:23;;13262:18:1;;320160:55:0;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;320233:50;;;9012:25:1;;;9068:2;9053:18;;9046:34;;;9096:18;;;9089:34;;;320152:63:0;;-1:-1:-1;;;;;;320233:50:0;;;;;;;;;;9000:2:1;8985:18;320233:50:0;;;;;;;319114:1177;;318963:1328;;;;;;:::o;258362:738::-;258443:18;258472:19;258612:4;258609:1;258602:4;258596:11;258589:4;258583;258579:15;258576:1;258569:5;258562;258557:60;258671:7;258661:180;;258716:4;258710:11;258762:16;258759:1;258754:3;258739:40;258809:16;258804:3;258797:29;258661:180;-1:-1:-1;;258920:1:0;258914:8;258869:16;;-1:-1:-1;258949:15:0;;:68;;259001:11;259016:1;259001:16;;258949:68;;;-1:-1:-1;;;;;258967:26:0;;;:31;258949:68;258945:148;;;259041:40;;-1:-1:-1;;;259041:40:0;;-1:-1:-1;;;;;1735:32:1;;259041:40:0;;;1717:51:1;1690:18;;259041:40:0;1571:203:1;221696:213:0;-1:-1:-1;;;;;221767:21:0;;221763:93;;221812:32;;-1:-1:-1;;;221812:32:0;;221841:1;221812:32;;;1717:51:1;1690:18;;221812:32:0;1571:203:1;221763:93:0;221866:35;221882:1;221886:7;221895:5;221866:7;:35::i;:::-;221696:213;;:::o;92284:866::-;92371:12;92424:6;92400:21;:30;92396:127;;;92454:57;;-1:-1:-1;;;92454:57:0;;92481:21;92454:57;;;7704:25:1;7745:18;;;7738:34;;;7677:18;;92454:57:0;7530:248:1;92396:127:0;92537:8;:15;92556:1;92537:20;92533:82;;92581:22;;-1:-1:-1;;;92581:22:0;;;;;;;;;;;92533:82;92727:4;92716:8;92710:15;92703:4;92693:8;92689:19;92681:6;92673:59;92665:67;;92864:16;92857:24;92853:29;92846:4;92839:12;92835:48;92832:207;;;92918:4;92912:11;92962:16;92959:1;92956;92941:38;93007:16;93004:1;92997:27;92832:207;-1:-1:-1;;;;;93064:18:0;;93060:83;;93106:25;;-1:-1:-1;;;93106:25:0;;;;;;;;;;;220208:1135;-1:-1:-1;;;;;220298:18:0;;220294:552;;220452:5;220436:12;;:21;;;;;;;:::i;:::-;;;;-1:-1:-1;220294:552:0;;-1:-1:-1;220294:552:0;;-1:-1:-1;;;;;220512:15:0;;220490:19;220512:15;;;:9;:15;;;;;;220546:19;;;220542:117;;;220593:50;;-1:-1:-1;;;220593:50:0;;-1:-1:-1;;;;;10743:32:1;;220593:50:0;;;10725:51:1;10792:18;;;10785:34;;;10835:18;;;10828:34;;;10698:18;;220593:50:0;10523:345:1;220542:117:0;-1:-1:-1;;;;;220782:15:0;;;;;;:9;:15;;;;;220800:19;;;;220782:37;;220294:552;-1:-1:-1;;;;;220862:16:0;;220858:435;;221028:12;:21;;;;;;;220858:435;;;-1:-1:-1;;;;;221244:13:0;;;;;;:9;:13;;;;;:22;;;;;;220858:435;221325:2;-1:-1:-1;;;;;221310:25:0;221319:4;-1:-1:-1;;;;;221310:25:0;;221329:5;221310:25;;;;1091::1;;1079:2;1064:18;;945:177;221310:25:0;;;;;;;;220208:1135;;;:::o;222237:211::-;-1:-1:-1;;;;;222308:21:0;;222304:91;;222353:30;;-1:-1:-1;;;222353:30:0;;222380:1;222353:30;;;1717:51:1;1690:18;;222353:30:0;1571:203:1;222304:91:0;222405:35;222413:7;222430:1;222434:5;222405:7;:35::i;-1:-1:-1:-;;;;;;;;:::o;14:131:1:-;-1:-1:-1;;;;;89:31:1;;79:42;;69:70;;135:1;132;125:12;150:367;218:6;226;279:2;267:9;258:7;254:23;250:32;247:52;;;295:1;292;285:12;247:52;334:9;321:23;353:31;378:5;353:31;:::i;:::-;403:5;481:2;466:18;;;;453:32;;-1:-1:-1;;;150:367:1:o;522:418::-;671:2;660:9;653:21;634:4;703:6;697:13;746:6;741:2;730:9;726:18;719:34;805:6;800:2;792:6;788:15;783:2;772:9;768:18;762:50;861:1;856:2;847:6;836:9;832:22;828:31;821:42;931:2;924;920:7;915:2;907:6;903:15;899:29;888:9;884:45;880:54;872:62;;;522:418;;;;:::o;1319:247::-;1378:6;1431:2;1419:9;1410:7;1406:23;1402:32;1399:52;;;1447:1;1444;1437:12;1399:52;1486:9;1473:23;1505:31;1530:5;1505:31;:::i;1779:226::-;1838:6;1891:2;1879:9;1870:7;1866:23;1862:32;1859:52;;;1907:1;1904;1897:12;1859:52;-1:-1:-1;1952:23:1;;1779:226;-1:-1:-1;1779:226:1:o;2010:508::-;2087:6;2095;2103;2156:2;2144:9;2135:7;2131:23;2127:32;2124:52;;;2172:1;2169;2162:12;2124:52;2211:9;2198:23;2230:31;2255:5;2230:31;:::i;:::-;2280:5;-1:-1:-1;2337:2:1;2322:18;;2309:32;2350:33;2309:32;2350:33;:::i;:::-;2010:508;;2402:7;;-1:-1:-1;;;2482:2:1;2467:18;;;;2454:32;;2010:508::o;2712:1037::-;2823:6;2831;2839;2847;2855;2863;2871;2924:3;2912:9;2903:7;2899:23;2895:33;2892:53;;;2941:1;2938;2931:12;2892:53;2980:9;2967:23;2999:31;3024:5;2999:31;:::i;:::-;3049:5;-1:-1:-1;3106:2:1;3091:18;;3078:32;3119:33;3078:32;3119:33;:::i;:::-;3171:7;-1:-1:-1;3251:2:1;3236:18;;3223:32;;-1:-1:-1;3354:2:1;3339:18;;3326:32;;-1:-1:-1;3436:3:1;3421:19;;3408:33;3485:4;3472:18;;3460:31;;3450:59;;3505:1;3502;3495:12;3450:59;2712:1037;;;;-1:-1:-1;2712:1037:1;;;;3528:7;3608:3;3593:19;;3580:33;;-1:-1:-1;3712:3:1;3697:19;;;3684:33;;2712:1037;-1:-1:-1;;2712:1037:1:o;3754:1276::-;3885:6;3893;3901;3909;3917;3925;3933;3941;3949;4002:3;3990:9;3981:7;3977:23;3973:33;3970:53;;;4019:1;4016;4009:12;3970:53;4058:9;4045:23;4077:31;4102:5;4077:31;:::i;:::-;4127:5;-1:-1:-1;4184:2:1;4169:18;;4156:32;4197:33;4156:32;4197:33;:::i;:::-;4249:7;-1:-1:-1;4308:2:1;4293:18;;4280:32;4321:33;4280:32;4321:33;:::i;:::-;4373:7;-1:-1:-1;4432:2:1;4417:18;;4404:32;4445:33;4404:32;4445:33;:::i;:::-;3754:1276;;;;-1:-1:-1;3754:1276:1;;4577:3;4562:19;;4549:33;;4681:3;4666:19;;4653:33;;-1:-1:-1;4785:3:1;4770:19;;4757:33;;-1:-1:-1;4889:3:1;4874:19;;4861:33;;-1:-1:-1;4993:3:1;4978:19;;;4965:33;;-1:-1:-1;3754:1276:1;-1:-1:-1;;3754:1276:1:o;5035:752::-;5281:2;5293:21;;;5363:13;;5266:18;;;5385:22;;;5233:4;;5464:15;;;5438:2;5423:18;;;5233:4;5507:254;5521:6;5518:1;5515:13;5507:254;;;5580:13;;5618:9;;5606:22;;5676:2;5668:11;;;5662:18;5648:12;;;5641:40;5736:15;;;;5710:2;5701:12;;;;5543:1;5536:9;5507:254;;;-1:-1:-1;5778:3:1;;5035:752;-1:-1:-1;;;;;5035:752:1:o;5792:388::-;5860:6;5868;5921:2;5909:9;5900:7;5896:23;5892:32;5889:52;;;5937:1;5934;5927:12;5889:52;5976:9;5963:23;5995:31;6020:5;5995:31;:::i;:::-;6045:5;-1:-1:-1;6102:2:1;6087:18;;6074:32;6115:33;6074:32;6115:33;:::i;:::-;6167:7;6157:17;;;5792:388;;;;;:::o;6185:811::-;6435:2;6447:21;;;6517:13;;6420:18;;;6539:22;;;6387:4;;6618:15;;;6592:2;6577:18;;;6387:4;6661:309;6675:6;6672:1;6669:13;6661:309;;;6740:6;6734:13;6778:2;6772:9;6767:3;6760:22;6830:2;6826;6822:11;6816:18;6811:2;6806:3;6802:12;6795:40;6883:2;6879;6875:11;6869:18;6864:2;6859:3;6855:12;6848:40;;6917:4;6912:3;6908:14;6901:21;;6957:2;6949:6;6945:15;6935:25;;6697:1;6694;6690:9;6685:14;;6661:309;;7001:127;7062:10;7057:3;7053:20;7050:1;7043:31;7093:4;7090:1;7083:15;7117:4;7114:1;7107:15;7133:127;7194:10;7189:3;7185:20;7182:1;7175:31;7225:4;7222:1;7215:15;7249:4;7246:1;7239:15;7265:128;7332:9;;;7353:11;;;7350:37;;;7367:18;;:::i;7398:127::-;7459:10;7454:3;7450:20;7447:1;7440:31;7490:4;7487:1;7480:15;7514:4;7511:1;7504:15;7783:168;7856:9;;;7887;;7904:15;;;7898:22;;7884:37;7874:71;;7925:18;;:::i;7956:251::-;8026:6;8079:2;8067:9;8058:7;8054:23;8050:32;8047:52;;;8095:1;8092;8085:12;8047:52;8127:9;8121:16;8146:31;8171:5;8146:31;:::i;8212:125::-;8277:9;;;8298:10;;;8295:36;;;8311:18;;:::i;8342:184::-;8412:6;8465:2;8453:9;8444:7;8440:23;8436:32;8433:52;;;8481:1;8478;8471:12;8433:52;-1:-1:-1;8504:16:1;;8342:184;-1:-1:-1;8342:184:1:o;9134:217::-;9174:1;9200;9190:132;;9244:10;9239:3;9235:20;9232:1;9225:31;9279:4;9276:1;9269:15;9307:4;9304:1;9297:15;9190:132;-1:-1:-1;9336:9:1;;9134:217::o;10027:277::-;10094:6;10147:2;10135:9;10126:7;10122:23;10118:32;10115:52;;;10163:1;10160;10153:12;10115:52;10195:9;10189:16;10248:5;10241:13;10234:21;10227:5;10224:32;10214:60;;10270:1;10267;10260:12;10873:135;10912:3;10933:17;;;10930:43;;10953:18;;:::i;:::-;-1:-1:-1;11000:1:1;10989:13;;10873:135::o;12312:211::-;12353:3;12391:5;12385:12;12435:6;12428:4;12421:5;12417:16;12412:3;12406:36;12497:1;12461:16;;12486:13;;;-1:-1:-1;12461:16:1;;12312:211;-1:-1:-1;12312:211:1:o;12528:261::-;12703:3;12728:55;12753:29;12778:3;12770:6;12753:29;:::i;:::-;12745:6;12728:55;:::i;12794:288::-;12863:6;12916:2;12904:9;12895:7;12891:23;12887:32;12884:52;;;12932:1;12929;12922:12;12884:52;12964:9;12958:16;13014:18;13007:5;13003:30;12996:5;12993:41;12983:69;;13048:1;13045;13038:12
Swarm Source
ipfs://52bd55a89c8f79ddd62cedc6b6b701938be3d2ad539cfa23b50a0cd3f69774be
[ Download: CSV Export ]
[ Download: CSV Export ]
A token is a representation of an on-chain or off-chain asset. The token page shows information such as price, total supply, holders, transfers and social links. Learn more about this page in our Knowledge Base.