More Info
Private Name Tags
ContractCreator
Latest 25 from a total of 9,911 transactions
Transaction Hash |
Method
|
Block
|
From
|
To
|
|||||
---|---|---|---|---|---|---|---|---|---|
Withdraw | 20662888 | 18 hrs ago | IN | 0 ETH | 0.00014964 | ||||
Withdraw | 20658190 | 33 hrs ago | IN | 0 ETH | 0.00007154 | ||||
Withdraw | 20657666 | 35 hrs ago | IN | 0 ETH | 0.00006882 | ||||
Withdraw | 20657557 | 36 hrs ago | IN | 0 ETH | 0.00008166 | ||||
Withdraw | 20655793 | 41 hrs ago | IN | 0 ETH | 0.00006278 | ||||
Withdraw | 20654389 | 46 hrs ago | IN | 0 ETH | 0.00006476 | ||||
Withdraw | 20653721 | 2 days ago | IN | 0 ETH | 0.00006321 | ||||
Withdraw | 20651193 | 2 days ago | IN | 0 ETH | 0.00005735 | ||||
Withdraw | 20650313 | 2 days ago | IN | 0 ETH | 0.00007657 | ||||
Withdraw | 20647397 | 2 days ago | IN | 0 ETH | 0.00005735 | ||||
Withdraw | 20647131 | 2 days ago | IN | 0 ETH | 0.00006725 | ||||
Withdraw | 20647089 | 2 days ago | IN | 0 ETH | 0.00006743 | ||||
Withdraw | 20647072 | 2 days ago | IN | 0 ETH | 0.00006606 | ||||
Withdraw | 20647051 | 2 days ago | IN | 0 ETH | 0.00006536 | ||||
Withdraw | 20643709 | 3 days ago | IN | 0 ETH | 0.00008392 | ||||
Withdraw | 20643706 | 3 days ago | IN | 0 ETH | 0.00005438 | ||||
Withdraw | 20640241 | 3 days ago | IN | 0 ETH | 0.00005735 | ||||
Withdraw | 20639991 | 3 days ago | IN | 0 ETH | 0.00006864 | ||||
Withdraw | 20637940 | 4 days ago | IN | 0 ETH | 0.0000491 | ||||
Withdraw | 20636124 | 4 days ago | IN | 0 ETH | 0.00019295 | ||||
Withdraw | 20635778 | 4 days ago | IN | 0 ETH | 0.00009917 | ||||
Withdraw | 20633638 | 4 days ago | IN | 0 ETH | 0.00009176 | ||||
Withdraw | 20633596 | 4 days ago | IN | 0 ETH | 0.00005847 | ||||
Withdraw | 20632097 | 5 days ago | IN | 0 ETH | 0.00004985 | ||||
Withdraw | 20631143 | 5 days ago | IN | 0 ETH | 0.00004411 |
Advanced mode: Intended for advanced users or developers and will display all Internal Transactions including zero value transfers. Name tag integration is not available in advanced view.
Latest 25 internal transactions (View All)
Advanced mode:
Parent Transaction Hash | Block | From | To | ||||
---|---|---|---|---|---|---|---|
20662888 | 18 hrs ago | 0 ETH | |||||
20658190 | 33 hrs ago | 0 ETH | |||||
20657666 | 35 hrs ago | 0 ETH | |||||
20657557 | 36 hrs ago | 0 ETH | |||||
20655793 | 41 hrs ago | 0 ETH | |||||
20654389 | 46 hrs ago | 0 ETH | |||||
20653721 | 2 days ago | 0 ETH | |||||
20651193 | 2 days ago | 0 ETH | |||||
20650313 | 2 days ago | 0 ETH | |||||
20647397 | 2 days ago | 0 ETH | |||||
20647131 | 2 days ago | 0 ETH | |||||
20647089 | 2 days ago | 0 ETH | |||||
20647072 | 2 days ago | 0 ETH | |||||
20647051 | 2 days ago | 0 ETH | |||||
20643709 | 3 days ago | 0 ETH | |||||
20643706 | 3 days ago | 0 ETH | |||||
20640241 | 3 days ago | 0 ETH | |||||
20639991 | 3 days ago | 0 ETH | |||||
20637940 | 4 days ago | 0 ETH | |||||
20636124 | 4 days ago | 0 ETH | |||||
20635778 | 4 days ago | 0 ETH | |||||
20633638 | 4 days ago | 0 ETH | |||||
20633596 | 4 days ago | 0 ETH | |||||
20632097 | 5 days ago | 0 ETH | |||||
20631143 | 5 days ago | 0 ETH |
Loading...
Loading
Contract Name:
VotingEscrowZK
Compiler Version
v0.8.22+commit.4fc1097e
Optimization Enabled:
Yes with 200 runs
Other Settings:
paris EvmVersion
Contract Source Code (Solidity Standard Json-Input format)
// SPDX-License-Identifier: GPL-3.0-or-later pragma solidity ^0.8.20; import "@openzeppelin/contracts/token/ERC20/utils/SafeERC20.sol"; import "@openzeppelin/contracts/utils/structs/EnumerableMap.sol"; import "./interfaces/IVotingEscrow.sol"; import "./libraries/VeHistoryLib.sol"; import "./libraries/MiniHelpers.sol"; import "./libraries/Errors.sol"; import "./VotingEscrowTokenBase.sol"; contract VotingEscrowZK is VotingEscrowTokenBase, IVotingEscrow { using SafeERC20 for IERC20; using VeBalanceLib for VeBalance; using VeBalanceLib for LockedPosition; using Checkpoints for Checkpoints.History; using EnumerableMap for EnumerableMap.UintToAddressMap; IERC20 public immutable zk; uint128 public lastSlopeChangeAppliedAt; // [wTime] => slopeChanges mapping(uint128 => uint128) public slopeChanges; // Saving totalSupply checkpoint for each week, later can be used for reward accounting // [wTime] => totalSupply mapping(uint128 => uint128) public totalSupplyAt; // Saving VeBalance checkpoint for users of each week, can later use binary search // to ask for their veZK balance at any wTime mapping(address => Checkpoints.History) internal userHistory; constructor(IERC20 _zk) { zk = _zk; lastSlopeChangeAppliedAt = WeekMath.getCurrentWeekStart(); } /** * @notice increases the lock position of a user (amount and/or expiry). Applicable even when * user has no position or the current position has expired. * @param additionalAmountToLock ZK amount to be pulled in from user to lock. * @param newExpiry new lock expiry. Must be a valid week beginning, and resulting lock * duration (since `block.timestamp`) must be within the allowed range. * @dev Will revert if resulting position has zero lock amount. * @dev See `_increasePosition()` for details on inner workings. */ function increaseLockPosition( uint128 additionalAmountToLock, uint128 newExpiry ) public returns (uint128 newVeBalance) { address user = msg.sender; if (!WeekMath.isValidWTime(newExpiry)) revert Errors.InvalidWTime(newExpiry); if (MiniHelpers.isTimeInThePast(newExpiry)) revert Errors.ExpiryInThePast(newExpiry); if (newExpiry < positionData[user].expiry) revert Errors.VENotAllowedReduceExpiry(); if (newExpiry > block.timestamp + MAX_LOCK_TIME) revert Errors.VEExceededMaxLockTime(); if (newExpiry < block.timestamp + MIN_LOCK_TIME) revert Errors.VEInsufficientLockTime(); uint128 newTotalAmountLocked = additionalAmountToLock + positionData[user].amount; if (newTotalAmountLocked == 0) revert Errors.VEZeroAmountLocked(); uint128 additionalDurationToLock = newExpiry - positionData[user].expiry; if (additionalAmountToLock > 0) { zk.safeTransferFrom(user, address(this), additionalAmountToLock); } newVeBalance = _increasePosition(user, additionalAmountToLock, additionalDurationToLock); emit NewLockPosition(user, newTotalAmountLocked, newExpiry); } /** * @notice Withdraws an expired lock position, returns locked ZK back to user * @dev reverts if position is not expired, or if no locked ZK to withdraw */ function withdraw() external returns (uint128 amount) { address user = msg.sender; if (!_isPositionExpired(user)) revert Errors.VEPositionNotExpired(); amount = positionData[user].amount; if (amount == 0) revert Errors.VEZeroPosition(); delete positionData[user]; zk.safeTransfer(user, amount); emit Withdraw(user, amount); } /** * @notice update & return the current totalSupply */ function totalSupplyCurrent() public virtual override(IVeToken, VotingEscrowTokenBase) returns (uint128) { (VeBalance memory supply, ) = _applySlopeChange(); return supply.getCurrentValue(); } function getUserHistoryLength(address user) external view returns (uint256) { return userHistory[user].length(); } function getUserHistoryAt(address user, uint256 index) external view returns (Checkpoint memory) { return userHistory[user].get(index); } /** * @notice increase the locking position of the user * @dev works by simply removing the old position from all relevant data (as if the user has * never locked) and then add in the new position */ function _increasePosition( address user, uint128 amountToIncrease, uint128 durationToIncrease ) internal returns (uint128) { LockedPosition memory oldPosition = positionData[user]; (VeBalance memory newSupply, ) = _applySlopeChange(); if (!MiniHelpers.isCurrentlyExpired(oldPosition.expiry)) { // remove old position not yet expired VeBalance memory oldBalance = oldPosition.convertToVeBalance(); newSupply = newSupply.sub(oldBalance); slopeChanges[oldPosition.expiry] -= oldBalance.slope; } LockedPosition memory newPosition = LockedPosition( oldPosition.amount + amountToIncrease, oldPosition.expiry + durationToIncrease ); VeBalance memory newBalance = newPosition.convertToVeBalance(); // add new position newSupply = newSupply.add(newBalance); slopeChanges[newPosition.expiry] += newBalance.slope; _totalSupply = newSupply; positionData[user] = newPosition; userHistory[user].push(newBalance); return newBalance.getCurrentValue(); } /** * @notice updates the totalSupply, processing all slope changes of past weeks. At the same time, * set the finalized totalSupplyAt */ function _applySlopeChange() internal returns (VeBalance memory, uint128) { VeBalance memory supply = _totalSupply; uint128 wTime = lastSlopeChangeAppliedAt; uint128 currentWeekStart = WeekMath.getCurrentWeekStart(); if (wTime >= currentWeekStart) { return (supply, wTime); } while (wTime < currentWeekStart) { wTime += WEEK; supply = supply.sub(slopeChanges[wTime], wTime); totalSupplyAt[wTime] = supply.getValueAt(wTime); } _totalSupply = supply; lastSlopeChangeAppliedAt = wTime; return (supply, wTime); } }
// SPDX-License-Identifier: MIT // OpenZeppelin Contracts (last updated v5.0.0) (token/ERC20/extensions/IERC20Permit.sol) pragma solidity ^0.8.20; /** * @dev Interface of the ERC20 Permit extension allowing approvals to be made via signatures, as defined in * https://eips.ethereum.org/EIPS/eip-2612[EIP-2612]. * * Adds the {permit} method, which can be used to change an account's ERC20 allowance (see {IERC20-allowance}) by * presenting a message signed by the account. By not relying on {IERC20-approve}, the token holder account doesn't * need to send a transaction, and thus is not required to hold Ether at all. * * ==== Security Considerations * * There are two important considerations concerning the use of `permit`. The first is that a valid permit signature * expresses an allowance, and it should not be assumed to convey additional meaning. In particular, it should not be * considered as an intention to spend the allowance in any specific way. The second is that because permits have * built-in replay protection and can be submitted by anyone, they can be frontrun. A protocol that uses permits should * take this into consideration and allow a `permit` call to fail. Combining these two aspects, a pattern that may be * generally recommended is: * * ```solidity * function doThingWithPermit(..., uint256 value, uint256 deadline, uint8 v, bytes32 r, bytes32 s) public { * try token.permit(msg.sender, address(this), value, deadline, v, r, s) {} catch {} * doThing(..., value); * } * * function doThing(..., uint256 value) public { * token.safeTransferFrom(msg.sender, address(this), value); * ... * } * ``` * * Observe that: 1) `msg.sender` is used as the owner, leaving no ambiguity as to the signer intent, and 2) the use of * `try/catch` allows the permit to fail and makes the code tolerant to frontrunning. (See also * {SafeERC20-safeTransferFrom}). * * Additionally, note that smart contract wallets (such as Argent or Safe) are not able to produce permit signatures, so * contracts should have entry points that don't rely on permit. */ interface IERC20Permit { /** * @dev Sets `value` as the allowance of `spender` over ``owner``'s tokens, * given ``owner``'s signed approval. * * IMPORTANT: The same issues {IERC20-approve} has related to transaction * ordering also apply here. * * Emits an {Approval} event. * * Requirements: * * - `spender` cannot be the zero address. * - `deadline` must be a timestamp in the future. * - `v`, `r` and `s` must be a valid `secp256k1` signature from `owner` * over the EIP712-formatted function arguments. * - the signature must use ``owner``'s current nonce (see {nonces}). * * For more information on the signature format, see the * https://eips.ethereum.org/EIPS/eip-2612#specification[relevant EIP * section]. * * CAUTION: See Security Considerations above. */ function permit( address owner, address spender, uint256 value, uint256 deadline, uint8 v, bytes32 r, bytes32 s ) external; /** * @dev Returns the current nonce for `owner`. This value must be * included whenever a signature is generated for {permit}. * * Every successful call to {permit} increases ``owner``'s nonce by one. This * prevents a signature from being used multiple times. */ function nonces(address owner) external view returns (uint256); /** * @dev Returns the domain separator used in the encoding of the signature for {permit}, as defined by {EIP712}. */ // solhint-disable-next-line func-name-mixedcase function DOMAIN_SEPARATOR() external view returns (bytes32); }
// SPDX-License-Identifier: MIT // OpenZeppelin Contracts (last updated v5.0.0) (token/ERC20/IERC20.sol) pragma solidity ^0.8.20; /** * @dev Interface of the ERC20 standard as defined in the EIP. */ interface IERC20 { /** * @dev Emitted when `value` tokens are moved from one account (`from`) to * another (`to`). * * Note that `value` may be zero. */ event Transfer(address indexed from, address indexed to, uint256 value); /** * @dev Emitted when the allowance of a `spender` for an `owner` is set by * a call to {approve}. `value` is the new allowance. */ event Approval(address indexed owner, address indexed spender, uint256 value); /** * @dev Returns the value of tokens in existence. */ function totalSupply() external view returns (uint256); /** * @dev Returns the value of tokens owned by `account`. */ function balanceOf(address account) external view returns (uint256); /** * @dev Moves a `value` amount of tokens from the caller's account to `to`. * * Returns a boolean value indicating whether the operation succeeded. * * Emits a {Transfer} event. */ function transfer(address to, uint256 value) external returns (bool); /** * @dev Returns the remaining number of tokens that `spender` will be * allowed to spend on behalf of `owner` through {transferFrom}. This is * zero by default. * * This value changes when {approve} or {transferFrom} are called. */ function allowance(address owner, address spender) external view returns (uint256); /** * @dev Sets a `value` amount of tokens as the allowance of `spender` over the * caller's tokens. * * Returns a boolean value indicating whether the operation succeeded. * * IMPORTANT: Beware that changing an allowance with this method brings the risk * that someone may use both the old and the new allowance by unfortunate * transaction ordering. One possible solution to mitigate this race * condition is to first reduce the spender's allowance to 0 and set the * desired value afterwards: * https://github.com/ethereum/EIPs/issues/20#issuecomment-263524729 * * Emits an {Approval} event. */ function approve(address spender, uint256 value) external returns (bool); /** * @dev Moves a `value` amount of tokens from `from` to `to` using the * allowance mechanism. `value` is then deducted from the caller's * allowance. * * Returns a boolean value indicating whether the operation succeeded. * * Emits a {Transfer} event. */ function transferFrom(address from, address to, uint256 value) external returns (bool); }
// SPDX-License-Identifier: MIT // OpenZeppelin Contracts (last updated v5.0.0) (token/ERC20/utils/SafeERC20.sol) pragma solidity ^0.8.20; import {IERC20} from "../IERC20.sol"; import {IERC20Permit} from "../extensions/IERC20Permit.sol"; import {Address} from "../../../utils/Address.sol"; /** * @title SafeERC20 * @dev Wrappers around ERC20 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 { using Address for address; /** * @dev An operation with an ERC20 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. */ 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. */ 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. */ 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 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). */ function _callOptionalReturn(IERC20 token, bytes memory data) private { // We need to perform a low level call here, to bypass Solidity's return data size checking mechanism, since // we're implementing it ourselves. We use {Address-functionCall} to perform this call, which verifies that // the target address contains contract code and also asserts for success in the low-level call. bytes memory returndata = address(token).functionCall(data); if (returndata.length != 0 && !abi.decode(returndata, (bool))) { 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 silents catches all reverts and returns a bool instead. */ function _callOptionalReturnBool(IERC20 token, bytes memory data) private returns (bool) { // We need to perform a low level call here, to bypass Solidity's return data size checking mechanism, since // we're implementing it ourselves. We cannot use {Address-functionCall} here since this should return false // and not revert is the subcall reverts. (bool success, bytes memory returndata) = address(token).call(data); return success && (returndata.length == 0 || abi.decode(returndata, (bool))) && address(token).code.length > 0; } }
// SPDX-License-Identifier: MIT // OpenZeppelin Contracts (last updated v5.0.0) (utils/Address.sol) pragma solidity ^0.8.20; /** * @dev Collection of functions related to the address type */ library Address { /** * @dev The ETH balance of the account is not enough to perform the operation. */ error AddressInsufficientBalance(address account); /** * @dev There's no code at `target` (it is not a contract). */ error AddressEmptyCode(address target); /** * @dev A call to an address target failed. The target may have reverted. */ error FailedInnerCall(); /** * @dev Replacement for Solidity's `transfer`: sends `amount` wei to * `recipient`, forwarding all available gas and reverting on errors. * * https://eips.ethereum.org/EIPS/eip-1884[EIP1884] increases the gas cost * of certain opcodes, possibly making contracts go over the 2300 gas limit * imposed by `transfer`, making them unable to receive funds via * `transfer`. {sendValue} removes this limitation. * * https://consensys.net/diligence/blog/2019/09/stop-using-soliditys-transfer-now/[Learn more]. * * IMPORTANT: because control is transferred to `recipient`, care must be * taken to not create reentrancy vulnerabilities. Consider using * {ReentrancyGuard} or the * https://solidity.readthedocs.io/en/v0.8.20/security-considerations.html#use-the-checks-effects-interactions-pattern[checks-effects-interactions pattern]. */ function sendValue(address payable recipient, uint256 amount) internal { if (address(this).balance < amount) { revert AddressInsufficientBalance(address(this)); } (bool success, ) = recipient.call{value: amount}(""); if (!success) { revert FailedInnerCall(); } } /** * @dev Performs a Solidity function call using a low level `call`. A * plain `call` is an unsafe replacement for a function call: use this * function instead. * * If `target` reverts with a revert reason or custom error, it is bubbled * up by this function (like regular Solidity function calls). However, if * the call reverted with no returned reason, this function reverts with a * {FailedInnerCall} error. * * Returns the raw returned data. To convert to the expected return value, * use https://solidity.readthedocs.io/en/latest/units-and-global-variables.html?highlight=abi.decode#abi-encoding-and-decoding-functions[`abi.decode`]. * * Requirements: * * - `target` must be a contract. * - calling `target` with `data` must not revert. */ function functionCall(address target, bytes memory data) internal returns (bytes memory) { return functionCallWithValue(target, data, 0); } /** * @dev Same as {xref-Address-functionCall-address-bytes-}[`functionCall`], * but also transferring `value` wei to `target`. * * Requirements: * * - the calling contract must have an ETH balance of at least `value`. * - the called Solidity function must be `payable`. */ function functionCallWithValue(address target, bytes memory data, uint256 value) internal returns (bytes memory) { if (address(this).balance < value) { revert AddressInsufficientBalance(address(this)); } (bool success, bytes memory returndata) = target.call{value: value}(data); return verifyCallResultFromTarget(target, success, returndata); } /** * @dev Same as {xref-Address-functionCall-address-bytes-}[`functionCall`], * but performing a static call. */ function functionStaticCall(address target, bytes memory data) internal view returns (bytes memory) { (bool success, bytes memory returndata) = target.staticcall(data); return verifyCallResultFromTarget(target, success, returndata); } /** * @dev Same as {xref-Address-functionCall-address-bytes-}[`functionCall`], * but performing a delegate call. */ function functionDelegateCall(address target, bytes memory data) internal returns (bytes memory) { (bool success, bytes memory returndata) = target.delegatecall(data); return verifyCallResultFromTarget(target, success, returndata); } /** * @dev Tool to verify that a low level call to smart-contract was successful, and reverts if the target * was not a contract or bubbling up the revert reason (falling back to {FailedInnerCall}) in case of an * unsuccessful call. */ function verifyCallResultFromTarget( address target, bool success, bytes memory returndata ) internal view returns (bytes memory) { if (!success) { _revert(returndata); } else { // only check if target is a contract if the call was successful and the return data is empty // otherwise we already know that it was a contract if (returndata.length == 0 && target.code.length == 0) { revert AddressEmptyCode(target); } return returndata; } } /** * @dev Tool to verify that a low level call was successful, and reverts if it wasn't, either by bubbling the * revert reason or with a default {FailedInnerCall} error. */ function verifyCallResult(bool success, bytes memory returndata) internal pure returns (bytes memory) { if (!success) { _revert(returndata); } else { return returndata; } } /** * @dev Reverts with returndata if present. Otherwise reverts with {FailedInnerCall}. */ function _revert(bytes memory returndata) private pure { // Look for revert reason and bubble it up if present if (returndata.length > 0) { // The easiest way to bubble the revert reason is using memory via assembly /// @solidity memory-safe-assembly assembly { let returndata_size := mload(returndata) revert(add(32, returndata), returndata_size) } } else { revert FailedInnerCall(); } } }
// SPDX-License-Identifier: MIT // OpenZeppelin Contracts (last updated v5.0.0) (utils/structs/EnumerableMap.sol) // This file was procedurally generated from scripts/generate/templates/EnumerableMap.js. pragma solidity ^0.8.20; import {EnumerableSet} from "./EnumerableSet.sol"; /** * @dev Library for managing an enumerable variant of Solidity's * https://solidity.readthedocs.io/en/latest/types.html#mapping-types[`mapping`] * type. * * Maps have the following properties: * * - Entries are added, removed, and checked for existence in constant time * (O(1)). * - Entries are enumerated in O(n). No guarantees are made on the ordering. * * ```solidity * contract Example { * // Add the library methods * using EnumerableMap for EnumerableMap.UintToAddressMap; * * // Declare a set state variable * EnumerableMap.UintToAddressMap private myMap; * } * ``` * * The following map types are supported: * * - `uint256 -> address` (`UintToAddressMap`) since v3.0.0 * - `address -> uint256` (`AddressToUintMap`) since v4.6.0 * - `bytes32 -> bytes32` (`Bytes32ToBytes32Map`) since v4.6.0 * - `uint256 -> uint256` (`UintToUintMap`) since v4.7.0 * - `bytes32 -> uint256` (`Bytes32ToUintMap`) since v4.7.0 * * [WARNING] * ==== * Trying to delete such a structure from storage will likely result in data corruption, rendering the structure * unusable. * See https://github.com/ethereum/solidity/pull/11843[ethereum/solidity#11843] for more info. * * In order to clean an EnumerableMap, you can either remove all elements one by one or create a fresh instance using an * array of EnumerableMap. * ==== */ library EnumerableMap { using EnumerableSet for EnumerableSet.Bytes32Set; // To implement this library for multiple types with as little code repetition as possible, we write it in // terms of a generic Map type with bytes32 keys and values. The Map implementation uses private functions, // and user-facing implementations such as `UintToAddressMap` are just wrappers around the underlying Map. // This means that we can only create new EnumerableMaps for types that fit in bytes32. /** * @dev Query for a nonexistent map key. */ error EnumerableMapNonexistentKey(bytes32 key); struct Bytes32ToBytes32Map { // Storage of keys EnumerableSet.Bytes32Set _keys; mapping(bytes32 key => bytes32) _values; } /** * @dev Adds a key-value pair to a map, or updates the value for an existing * key. O(1). * * Returns true if the key was added to the map, that is if it was not * already present. */ function set(Bytes32ToBytes32Map storage map, bytes32 key, bytes32 value) internal returns (bool) { map._values[key] = value; return map._keys.add(key); } /** * @dev Removes a key-value pair from a map. O(1). * * Returns true if the key was removed from the map, that is if it was present. */ function remove(Bytes32ToBytes32Map storage map, bytes32 key) internal returns (bool) { delete map._values[key]; return map._keys.remove(key); } /** * @dev Returns true if the key is in the map. O(1). */ function contains(Bytes32ToBytes32Map storage map, bytes32 key) internal view returns (bool) { return map._keys.contains(key); } /** * @dev Returns the number of key-value pairs in the map. O(1). */ function length(Bytes32ToBytes32Map storage map) internal view returns (uint256) { return map._keys.length(); } /** * @dev Returns the key-value pair stored at position `index` in the map. O(1). * * Note that there are no guarantees on the ordering of entries inside the * array, and it may change when more entries are added or removed. * * Requirements: * * - `index` must be strictly less than {length}. */ function at(Bytes32ToBytes32Map storage map, uint256 index) internal view returns (bytes32, bytes32) { bytes32 key = map._keys.at(index); return (key, map._values[key]); } /** * @dev Tries to returns the value associated with `key`. O(1). * Does not revert if `key` is not in the map. */ function tryGet(Bytes32ToBytes32Map storage map, bytes32 key) internal view returns (bool, bytes32) { bytes32 value = map._values[key]; if (value == bytes32(0)) { return (contains(map, key), bytes32(0)); } else { return (true, value); } } /** * @dev Returns the value associated with `key`. O(1). * * Requirements: * * - `key` must be in the map. */ function get(Bytes32ToBytes32Map storage map, bytes32 key) internal view returns (bytes32) { bytes32 value = map._values[key]; if (value == 0 && !contains(map, key)) { revert EnumerableMapNonexistentKey(key); } return value; } /** * @dev Return the an array containing all the keys * * WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed * to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that * this function has an unbounded cost, and using it as part of a state-changing function may render the function * uncallable if the map grows to a point where copying to memory consumes too much gas to fit in a block. */ function keys(Bytes32ToBytes32Map storage map) internal view returns (bytes32[] memory) { return map._keys.values(); } // UintToUintMap struct UintToUintMap { Bytes32ToBytes32Map _inner; } /** * @dev Adds a key-value pair to a map, or updates the value for an existing * key. O(1). * * Returns true if the key was added to the map, that is if it was not * already present. */ function set(UintToUintMap storage map, uint256 key, uint256 value) internal returns (bool) { return set(map._inner, bytes32(key), bytes32(value)); } /** * @dev Removes a value from a map. O(1). * * Returns true if the key was removed from the map, that is if it was present. */ function remove(UintToUintMap storage map, uint256 key) internal returns (bool) { return remove(map._inner, bytes32(key)); } /** * @dev Returns true if the key is in the map. O(1). */ function contains(UintToUintMap storage map, uint256 key) internal view returns (bool) { return contains(map._inner, bytes32(key)); } /** * @dev Returns the number of elements in the map. O(1). */ function length(UintToUintMap storage map) internal view returns (uint256) { return length(map._inner); } /** * @dev Returns the element stored at position `index` in the map. O(1). * Note that there are no guarantees on the ordering of values inside the * array, and it may change when more values are added or removed. * * Requirements: * * - `index` must be strictly less than {length}. */ function at(UintToUintMap storage map, uint256 index) internal view returns (uint256, uint256) { (bytes32 key, bytes32 value) = at(map._inner, index); return (uint256(key), uint256(value)); } /** * @dev Tries to returns the value associated with `key`. O(1). * Does not revert if `key` is not in the map. */ function tryGet(UintToUintMap storage map, uint256 key) internal view returns (bool, uint256) { (bool success, bytes32 value) = tryGet(map._inner, bytes32(key)); return (success, uint256(value)); } /** * @dev Returns the value associated with `key`. O(1). * * Requirements: * * - `key` must be in the map. */ function get(UintToUintMap storage map, uint256 key) internal view returns (uint256) { return uint256(get(map._inner, bytes32(key))); } /** * @dev Return the an array containing all the keys * * WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed * to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that * this function has an unbounded cost, and using it as part of a state-changing function may render the function * uncallable if the map grows to a point where copying to memory consumes too much gas to fit in a block. */ function keys(UintToUintMap storage map) internal view returns (uint256[] memory) { bytes32[] memory store = keys(map._inner); uint256[] memory result; /// @solidity memory-safe-assembly assembly { result := store } return result; } // UintToAddressMap struct UintToAddressMap { Bytes32ToBytes32Map _inner; } /** * @dev Adds a key-value pair to a map, or updates the value for an existing * key. O(1). * * Returns true if the key was added to the map, that is if it was not * already present. */ function set(UintToAddressMap storage map, uint256 key, address value) internal returns (bool) { return set(map._inner, bytes32(key), bytes32(uint256(uint160(value)))); } /** * @dev Removes a value from a map. O(1). * * Returns true if the key was removed from the map, that is if it was present. */ function remove(UintToAddressMap storage map, uint256 key) internal returns (bool) { return remove(map._inner, bytes32(key)); } /** * @dev Returns true if the key is in the map. O(1). */ function contains(UintToAddressMap storage map, uint256 key) internal view returns (bool) { return contains(map._inner, bytes32(key)); } /** * @dev Returns the number of elements in the map. O(1). */ function length(UintToAddressMap storage map) internal view returns (uint256) { return length(map._inner); } /** * @dev Returns the element stored at position `index` in the map. O(1). * Note that there are no guarantees on the ordering of values inside the * array, and it may change when more values are added or removed. * * Requirements: * * - `index` must be strictly less than {length}. */ function at(UintToAddressMap storage map, uint256 index) internal view returns (uint256, address) { (bytes32 key, bytes32 value) = at(map._inner, index); return (uint256(key), address(uint160(uint256(value)))); } /** * @dev Tries to returns the value associated with `key`. O(1). * Does not revert if `key` is not in the map. */ function tryGet(UintToAddressMap storage map, uint256 key) internal view returns (bool, address) { (bool success, bytes32 value) = tryGet(map._inner, bytes32(key)); return (success, address(uint160(uint256(value)))); } /** * @dev Returns the value associated with `key`. O(1). * * Requirements: * * - `key` must be in the map. */ function get(UintToAddressMap storage map, uint256 key) internal view returns (address) { return address(uint160(uint256(get(map._inner, bytes32(key))))); } /** * @dev Return the an array containing all the keys * * WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed * to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that * this function has an unbounded cost, and using it as part of a state-changing function may render the function * uncallable if the map grows to a point where copying to memory consumes too much gas to fit in a block. */ function keys(UintToAddressMap storage map) internal view returns (uint256[] memory) { bytes32[] memory store = keys(map._inner); uint256[] memory result; /// @solidity memory-safe-assembly assembly { result := store } return result; } // AddressToUintMap struct AddressToUintMap { Bytes32ToBytes32Map _inner; } /** * @dev Adds a key-value pair to a map, or updates the value for an existing * key. O(1). * * Returns true if the key was added to the map, that is if it was not * already present. */ function set(AddressToUintMap storage map, address key, uint256 value) internal returns (bool) { return set(map._inner, bytes32(uint256(uint160(key))), bytes32(value)); } /** * @dev Removes a value from a map. O(1). * * Returns true if the key was removed from the map, that is if it was present. */ function remove(AddressToUintMap storage map, address key) internal returns (bool) { return remove(map._inner, bytes32(uint256(uint160(key)))); } /** * @dev Returns true if the key is in the map. O(1). */ function contains(AddressToUintMap storage map, address key) internal view returns (bool) { return contains(map._inner, bytes32(uint256(uint160(key)))); } /** * @dev Returns the number of elements in the map. O(1). */ function length(AddressToUintMap storage map) internal view returns (uint256) { return length(map._inner); } /** * @dev Returns the element stored at position `index` in the map. O(1). * Note that there are no guarantees on the ordering of values inside the * array, and it may change when more values are added or removed. * * Requirements: * * - `index` must be strictly less than {length}. */ function at(AddressToUintMap storage map, uint256 index) internal view returns (address, uint256) { (bytes32 key, bytes32 value) = at(map._inner, index); return (address(uint160(uint256(key))), uint256(value)); } /** * @dev Tries to returns the value associated with `key`. O(1). * Does not revert if `key` is not in the map. */ function tryGet(AddressToUintMap storage map, address key) internal view returns (bool, uint256) { (bool success, bytes32 value) = tryGet(map._inner, bytes32(uint256(uint160(key)))); return (success, uint256(value)); } /** * @dev Returns the value associated with `key`. O(1). * * Requirements: * * - `key` must be in the map. */ function get(AddressToUintMap storage map, address key) internal view returns (uint256) { return uint256(get(map._inner, bytes32(uint256(uint160(key))))); } /** * @dev Return the an array containing all the keys * * WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed * to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that * this function has an unbounded cost, and using it as part of a state-changing function may render the function * uncallable if the map grows to a point where copying to memory consumes too much gas to fit in a block. */ function keys(AddressToUintMap storage map) internal view returns (address[] memory) { bytes32[] memory store = keys(map._inner); address[] memory result; /// @solidity memory-safe-assembly assembly { result := store } return result; } // Bytes32ToUintMap struct Bytes32ToUintMap { Bytes32ToBytes32Map _inner; } /** * @dev Adds a key-value pair to a map, or updates the value for an existing * key. O(1). * * Returns true if the key was added to the map, that is if it was not * already present. */ function set(Bytes32ToUintMap storage map, bytes32 key, uint256 value) internal returns (bool) { return set(map._inner, key, bytes32(value)); } /** * @dev Removes a value from a map. O(1). * * Returns true if the key was removed from the map, that is if it was present. */ function remove(Bytes32ToUintMap storage map, bytes32 key) internal returns (bool) { return remove(map._inner, key); } /** * @dev Returns true if the key is in the map. O(1). */ function contains(Bytes32ToUintMap storage map, bytes32 key) internal view returns (bool) { return contains(map._inner, key); } /** * @dev Returns the number of elements in the map. O(1). */ function length(Bytes32ToUintMap storage map) internal view returns (uint256) { return length(map._inner); } /** * @dev Returns the element stored at position `index` in the map. O(1). * Note that there are no guarantees on the ordering of values inside the * array, and it may change when more values are added or removed. * * Requirements: * * - `index` must be strictly less than {length}. */ function at(Bytes32ToUintMap storage map, uint256 index) internal view returns (bytes32, uint256) { (bytes32 key, bytes32 value) = at(map._inner, index); return (key, uint256(value)); } /** * @dev Tries to returns the value associated with `key`. O(1). * Does not revert if `key` is not in the map. */ function tryGet(Bytes32ToUintMap storage map, bytes32 key) internal view returns (bool, uint256) { (bool success, bytes32 value) = tryGet(map._inner, key); return (success, uint256(value)); } /** * @dev Returns the value associated with `key`. O(1). * * Requirements: * * - `key` must be in the map. */ function get(Bytes32ToUintMap storage map, bytes32 key) internal view returns (uint256) { return uint256(get(map._inner, key)); } /** * @dev Return the an array containing all the keys * * WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed * to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that * this function has an unbounded cost, and using it as part of a state-changing function may render the function * uncallable if the map grows to a point where copying to memory consumes too much gas to fit in a block. */ function keys(Bytes32ToUintMap storage map) internal view returns (bytes32[] memory) { bytes32[] memory store = keys(map._inner); bytes32[] memory result; /// @solidity memory-safe-assembly assembly { result := store } return result; } }
// SPDX-License-Identifier: MIT // OpenZeppelin Contracts (last updated v5.0.0) (utils/structs/EnumerableSet.sol) // This file was procedurally generated from scripts/generate/templates/EnumerableSet.js. pragma solidity ^0.8.20; /** * @dev Library for managing * https://en.wikipedia.org/wiki/Set_(abstract_data_type)[sets] of primitive * types. * * Sets have the following properties: * * - Elements are added, removed, and checked for existence in constant time * (O(1)). * - Elements are enumerated in O(n). No guarantees are made on the ordering. * * ```solidity * contract Example { * // Add the library methods * using EnumerableSet for EnumerableSet.AddressSet; * * // Declare a set state variable * EnumerableSet.AddressSet private mySet; * } * ``` * * As of v3.3.0, sets of type `bytes32` (`Bytes32Set`), `address` (`AddressSet`) * and `uint256` (`UintSet`) are supported. * * [WARNING] * ==== * Trying to delete such a structure from storage will likely result in data corruption, rendering the structure * unusable. * See https://github.com/ethereum/solidity/pull/11843[ethereum/solidity#11843] for more info. * * In order to clean an EnumerableSet, you can either remove all elements one by one or create a fresh instance using an * array of EnumerableSet. * ==== */ library EnumerableSet { // To implement this library for multiple types with as little code // repetition as possible, we write it in terms of a generic Set type with // bytes32 values. // The Set implementation uses private functions, and user-facing // implementations (such as AddressSet) are just wrappers around the // underlying Set. // This means that we can only create new EnumerableSets for types that fit // in bytes32. struct Set { // Storage of set values bytes32[] _values; // Position is the index of the value in the `values` array plus 1. // Position 0 is used to mean a value is not in the set. mapping(bytes32 value => uint256) _positions; } /** * @dev Add a value to a set. O(1). * * Returns true if the value was added to the set, that is if it was not * already present. */ function _add(Set storage set, bytes32 value) private returns (bool) { if (!_contains(set, value)) { set._values.push(value); // The value is stored at length-1, but we add 1 to all indexes // and use 0 as a sentinel value set._positions[value] = set._values.length; return true; } else { return false; } } /** * @dev Removes a value from a set. O(1). * * Returns true if the value was removed from the set, that is if it was * present. */ function _remove(Set storage set, bytes32 value) private returns (bool) { // We cache the value's position to prevent multiple reads from the same storage slot uint256 position = set._positions[value]; if (position != 0) { // Equivalent to contains(set, value) // To delete an element from the _values array in O(1), we swap the element to delete with the last one in // the array, and then remove the last element (sometimes called as 'swap and pop'). // This modifies the order of the array, as noted in {at}. uint256 valueIndex = position - 1; uint256 lastIndex = set._values.length - 1; if (valueIndex != lastIndex) { bytes32 lastValue = set._values[lastIndex]; // Move the lastValue to the index where the value to delete is set._values[valueIndex] = lastValue; // Update the tracked position of the lastValue (that was just moved) set._positions[lastValue] = position; } // Delete the slot where the moved value was stored set._values.pop(); // Delete the tracked position for the deleted slot delete set._positions[value]; return true; } else { return false; } } /** * @dev Returns true if the value is in the set. O(1). */ function _contains(Set storage set, bytes32 value) private view returns (bool) { return set._positions[value] != 0; } /** * @dev Returns the number of values on the set. O(1). */ function _length(Set storage set) private view returns (uint256) { return set._values.length; } /** * @dev Returns the value stored at position `index` in the set. O(1). * * Note that there are no guarantees on the ordering of values inside the * array, and it may change when more values are added or removed. * * Requirements: * * - `index` must be strictly less than {length}. */ function _at(Set storage set, uint256 index) private view returns (bytes32) { return set._values[index]; } /** * @dev Return the entire set in an array * * WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed * to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that * this function has an unbounded cost, and using it as part of a state-changing function may render the function * uncallable if the set grows to a point where copying to memory consumes too much gas to fit in a block. */ function _values(Set storage set) private view returns (bytes32[] memory) { return set._values; } // Bytes32Set struct Bytes32Set { Set _inner; } /** * @dev Add a value to a set. O(1). * * Returns true if the value was added to the set, that is if it was not * already present. */ function add(Bytes32Set storage set, bytes32 value) internal returns (bool) { return _add(set._inner, value); } /** * @dev Removes a value from a set. O(1). * * Returns true if the value was removed from the set, that is if it was * present. */ function remove(Bytes32Set storage set, bytes32 value) internal returns (bool) { return _remove(set._inner, value); } /** * @dev Returns true if the value is in the set. O(1). */ function contains(Bytes32Set storage set, bytes32 value) internal view returns (bool) { return _contains(set._inner, value); } /** * @dev Returns the number of values in the set. O(1). */ function length(Bytes32Set storage set) internal view returns (uint256) { return _length(set._inner); } /** * @dev Returns the value stored at position `index` in the set. O(1). * * Note that there are no guarantees on the ordering of values inside the * array, and it may change when more values are added or removed. * * Requirements: * * - `index` must be strictly less than {length}. */ function at(Bytes32Set storage set, uint256 index) internal view returns (bytes32) { return _at(set._inner, index); } /** * @dev Return the entire set in an array * * WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed * to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that * this function has an unbounded cost, and using it as part of a state-changing function may render the function * uncallable if the set grows to a point where copying to memory consumes too much gas to fit in a block. */ function values(Bytes32Set storage set) internal view returns (bytes32[] memory) { bytes32[] memory store = _values(set._inner); bytes32[] memory result; /// @solidity memory-safe-assembly assembly { result := store } return result; } // AddressSet struct AddressSet { Set _inner; } /** * @dev Add a value to a set. O(1). * * Returns true if the value was added to the set, that is if it was not * already present. */ function add(AddressSet storage set, address value) internal returns (bool) { return _add(set._inner, bytes32(uint256(uint160(value)))); } /** * @dev Removes a value from a set. O(1). * * Returns true if the value was removed from the set, that is if it was * present. */ function remove(AddressSet storage set, address value) internal returns (bool) { return _remove(set._inner, bytes32(uint256(uint160(value)))); } /** * @dev Returns true if the value is in the set. O(1). */ function contains(AddressSet storage set, address value) internal view returns (bool) { return _contains(set._inner, bytes32(uint256(uint160(value)))); } /** * @dev Returns the number of values in the set. O(1). */ function length(AddressSet storage set) internal view returns (uint256) { return _length(set._inner); } /** * @dev Returns the value stored at position `index` in the set. O(1). * * Note that there are no guarantees on the ordering of values inside the * array, and it may change when more values are added or removed. * * Requirements: * * - `index` must be strictly less than {length}. */ function at(AddressSet storage set, uint256 index) internal view returns (address) { return address(uint160(uint256(_at(set._inner, index)))); } /** * @dev Return the entire set in an array * * WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed * to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that * this function has an unbounded cost, and using it as part of a state-changing function may render the function * uncallable if the set grows to a point where copying to memory consumes too much gas to fit in a block. */ function values(AddressSet storage set) internal view returns (address[] memory) { bytes32[] memory store = _values(set._inner); address[] memory result; /// @solidity memory-safe-assembly assembly { result := store } return result; } // UintSet struct UintSet { Set _inner; } /** * @dev Add a value to a set. O(1). * * Returns true if the value was added to the set, that is if it was not * already present. */ function add(UintSet storage set, uint256 value) internal returns (bool) { return _add(set._inner, bytes32(value)); } /** * @dev Removes a value from a set. O(1). * * Returns true if the value was removed from the set, that is if it was * present. */ function remove(UintSet storage set, uint256 value) internal returns (bool) { return _remove(set._inner, bytes32(value)); } /** * @dev Returns true if the value is in the set. O(1). */ function contains(UintSet storage set, uint256 value) internal view returns (bool) { return _contains(set._inner, bytes32(value)); } /** * @dev Returns the number of values in the set. O(1). */ function length(UintSet storage set) internal view returns (uint256) { return _length(set._inner); } /** * @dev Returns the value stored at position `index` in the set. O(1). * * Note that there are no guarantees on the ordering of values inside the * array, and it may change when more values are added or removed. * * Requirements: * * - `index` must be strictly less than {length}. */ function at(UintSet storage set, uint256 index) internal view returns (uint256) { return uint256(_at(set._inner, index)); } /** * @dev Return the entire set in an array * * WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed * to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that * this function has an unbounded cost, and using it as part of a state-changing function may render the function * uncallable if the set grows to a point where copying to memory consumes too much gas to fit in a block. */ function values(UintSet storage set) internal view returns (uint256[] memory) { bytes32[] memory store = _values(set._inner); uint256[] memory result; /// @solidity memory-safe-assembly assembly { result := store } return result; } }
// SPDX-License-Identifier: GPL-3.0-or-later pragma solidity ^0.8.0; interface IVeToken { // ============= USER INFO ============= function balanceOf(address user) external view returns (uint128); // ============= META DATA ============= function totalSupplyStored() external view returns (uint128); function totalSupplyCurrent() external returns (uint128); function totalSupplyAndBalanceCurrent(address user) external returns (uint128, uint128); }
// SPDX-License-Identifier: GPL-3.0-or-later pragma solidity ^0.8.0; import "./IVeToken.sol"; import "../libraries/VeBalanceLib.sol"; import "../libraries/VeHistoryLib.sol"; interface IVotingEscrow is IVeToken { event NewLockPosition(address indexed user, uint128 amount, uint128 expiry); event Withdraw(address indexed user, uint128 amount); // ============= ACTIONS ============= function increaseLockPosition(uint128 additionalAmountToLock, uint128 expiry) external returns (uint128); function withdraw() external returns (uint128); function totalSupplyAt(uint128 timestamp) external view returns (uint128); function getUserHistoryLength(address user) external view returns (uint256); function getUserHistoryAt(address user, uint256 index) external view returns (Checkpoint memory); }
// SPDX-License-Identifier: GPL-3.0-or-later pragma solidity ^0.8.0; library Errors { error VEExceededMaxLockTime(); error VEInsufficientLockTime(); error VENotAllowedReduceExpiry(); error VEZeroAmountLocked(); error VEPositionNotExpired(); error VEZeroPosition(); error VEZeroSlope(uint128 bias, uint128 slope); error InvalidWTime(uint256 wTime); error ExpiryInThePast(uint256 expiry); error ArrayLengthMismatch(); error InvalidMerkleProof(); }
// SPDX-License-Identifier: GPL-3.0-or-later pragma solidity ^0.8.0; library MiniHelpers { function isCurrentlyExpired(uint256 expiry) internal view returns (bool) { return (expiry <= block.timestamp); } function isExpired(uint256 expiry, uint256 blockTime) internal pure returns (bool) { return (expiry <= blockTime); } function isTimeInThePast(uint256 timestamp) internal view returns (bool) { return (timestamp <= block.timestamp); // same definition as isCurrentlyExpired } }
// SPDX-License-Identifier: GPL-3.0-or-later pragma solidity ^0.8.0; import "./Errors.sol"; struct VeBalance { uint128 bias; uint128 slope; } struct LockedPosition { uint128 amount; uint128 expiry; } library VeBalanceLib { uint128 internal constant MAX_LOCK_TIME = 5 weeks; uint256 internal constant USER_VOTE_MAX_WEIGHT = 10 ** 18; function add(VeBalance memory a, VeBalance memory b) internal pure returns (VeBalance memory res) { res.bias = a.bias + b.bias; res.slope = a.slope + b.slope; } function sub(VeBalance memory a, VeBalance memory b) internal pure returns (VeBalance memory res) { res.bias = a.bias - b.bias; res.slope = a.slope - b.slope; } function sub(VeBalance memory a, uint128 slope, uint128 expiry) internal pure returns (VeBalance memory res) { res.slope = a.slope - slope; res.bias = a.bias - slope * expiry; } function isExpired(VeBalance memory a) internal view returns (bool) { return a.slope * uint128(block.timestamp) >= a.bias; } function getCurrentValue(VeBalance memory a) internal view returns (uint128) { if (isExpired(a)) return 0; return getValueAt(a, uint128(block.timestamp)); } function getValueAt(VeBalance memory a, uint128 t) internal pure returns (uint128) { if (a.slope * t > a.bias) { return 0; } return a.bias - a.slope * t; } function getExpiry(VeBalance memory a) internal pure returns (uint128) { if (a.slope == 0) revert Errors.VEZeroSlope(a.bias, a.slope); return a.bias / a.slope; } function convertToVeBalance(LockedPosition memory position) internal pure returns (VeBalance memory res) { res.slope = position.amount / MAX_LOCK_TIME; res.bias = res.slope * position.expiry; } function convertToVeBalance(LockedPosition memory position, uint256 weight) internal pure returns (VeBalance memory res) { res.slope = uint128((position.amount * weight) / MAX_LOCK_TIME / USER_VOTE_MAX_WEIGHT); res.bias = res.slope * position.expiry; } function convertToVeBalance(uint128 amount, uint128 expiry) internal pure returns (uint128, uint128) { VeBalance memory balance = convertToVeBalance(LockedPosition(amount, expiry)); return (balance.bias, balance.slope); } }
// SPDX-License-Identifier: GPL-3.0-or-later // Forked from OpenZeppelin (v4.5.0) (utils/Checkpoints.sol) pragma solidity ^0.8.0; import "./VeBalanceLib.sol"; import "./WeekMath.sol"; struct Checkpoint { uint128 timestamp; VeBalance value; } library CheckpointHelper { function assignWith(Checkpoint memory a, Checkpoint memory b) internal pure { a.timestamp = b.timestamp; a.value = b.value; } } library Checkpoints { struct History { Checkpoint[] _checkpoints; } function length(History storage self) internal view returns (uint256) { return self._checkpoints.length; } function get(History storage self, uint256 index) internal view returns (Checkpoint memory) { return self._checkpoints[index]; } function push(History storage self, VeBalance memory value) internal { uint256 pos = self._checkpoints.length; if (pos > 0 && self._checkpoints[pos - 1].timestamp == WeekMath.getCurrentWeekStart()) { self._checkpoints[pos - 1].value = value; } else { self._checkpoints.push(Checkpoint({ timestamp: WeekMath.getCurrentWeekStart(), value: value })); } } }
// SPDX-License-Identifier: GPL-3.0-or-later pragma solidity ^0.8.0; library WeekMath { uint128 internal constant WEEK = 7 days; function getWeekStartTimestamp(uint128 timestamp) internal pure returns (uint128) { return (timestamp / WEEK) * WEEK; } function getCurrentWeekStart() internal view returns (uint128) { return getWeekStartTimestamp(uint128(block.timestamp)); } function isValidWTime(uint256 time) internal pure returns (bool) { return time % WEEK == 0; } }
// SPDX-License-Identifier: GPL-3.0-or-later pragma solidity ^0.8.20; import "./interfaces/IVeToken.sol"; import "./libraries/MiniHelpers.sol"; import "./libraries/VeBalanceLib.sol"; abstract contract VotingEscrowTokenBase is IVeToken { using VeBalanceLib for VeBalance; using VeBalanceLib for LockedPosition; uint128 public constant WEEK = 1 weeks; uint128 public constant MAX_LOCK_TIME = 5 weeks; uint128 public constant MIN_LOCK_TIME = 1 weeks; VeBalance internal _totalSupply; mapping(address => LockedPosition) public positionData; constructor() {} function balanceOf(address user) public view virtual returns (uint128) { return positionData[user].convertToVeBalance().getCurrentValue(); } function totalSupplyStored() public view virtual returns (uint128) { return _totalSupply.getCurrentValue(); } function totalSupplyCurrent() public virtual returns (uint128); function _isPositionExpired(address user) internal view returns (bool) { return MiniHelpers.isCurrentlyExpired(positionData[user].expiry); } function totalSupplyAndBalanceCurrent(address user) external returns (uint128, uint128) { return (totalSupplyCurrent(), balanceOf(user)); } }
{ "optimizer": { "enabled": true, "runs": 200 }, "evmVersion": "paris", "outputSelection": { "*": { "*": [ "evm.bytecode", "evm.deployedBytecode", "devdoc", "userdoc", "metadata", "abi" ] } }, "libraries": {} }
Contract Security Audit
- No Contract Security Audit Submitted- Submit Audit Here
[{"inputs":[{"internalType":"contract IERC20","name":"_zk","type":"address"}],"stateMutability":"nonpayable","type":"constructor"},{"inputs":[{"internalType":"address","name":"target","type":"address"}],"name":"AddressEmptyCode","type":"error"},{"inputs":[{"internalType":"address","name":"account","type":"address"}],"name":"AddressInsufficientBalance","type":"error"},{"inputs":[{"internalType":"uint256","name":"expiry","type":"uint256"}],"name":"ExpiryInThePast","type":"error"},{"inputs":[],"name":"FailedInnerCall","type":"error"},{"inputs":[{"internalType":"uint256","name":"wTime","type":"uint256"}],"name":"InvalidWTime","type":"error"},{"inputs":[{"internalType":"address","name":"token","type":"address"}],"name":"SafeERC20FailedOperation","type":"error"},{"inputs":[],"name":"VEExceededMaxLockTime","type":"error"},{"inputs":[],"name":"VEInsufficientLockTime","type":"error"},{"inputs":[],"name":"VENotAllowedReduceExpiry","type":"error"},{"inputs":[],"name":"VEPositionNotExpired","type":"error"},{"inputs":[],"name":"VEZeroAmountLocked","type":"error"},{"inputs":[],"name":"VEZeroPosition","type":"error"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"user","type":"address"},{"indexed":false,"internalType":"uint128","name":"amount","type":"uint128"},{"indexed":false,"internalType":"uint128","name":"expiry","type":"uint128"}],"name":"NewLockPosition","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"user","type":"address"},{"indexed":false,"internalType":"uint128","name":"amount","type":"uint128"}],"name":"Withdraw","type":"event"},{"inputs":[],"name":"MAX_LOCK_TIME","outputs":[{"internalType":"uint128","name":"","type":"uint128"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"MIN_LOCK_TIME","outputs":[{"internalType":"uint128","name":"","type":"uint128"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"WEEK","outputs":[{"internalType":"uint128","name":"","type":"uint128"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"user","type":"address"}],"name":"balanceOf","outputs":[{"internalType":"uint128","name":"","type":"uint128"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"user","type":"address"},{"internalType":"uint256","name":"index","type":"uint256"}],"name":"getUserHistoryAt","outputs":[{"components":[{"internalType":"uint128","name":"timestamp","type":"uint128"},{"components":[{"internalType":"uint128","name":"bias","type":"uint128"},{"internalType":"uint128","name":"slope","type":"uint128"}],"internalType":"struct VeBalance","name":"value","type":"tuple"}],"internalType":"struct Checkpoint","name":"","type":"tuple"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"user","type":"address"}],"name":"getUserHistoryLength","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint128","name":"additionalAmountToLock","type":"uint128"},{"internalType":"uint128","name":"newExpiry","type":"uint128"}],"name":"increaseLockPosition","outputs":[{"internalType":"uint128","name":"newVeBalance","type":"uint128"}],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"lastSlopeChangeAppliedAt","outputs":[{"internalType":"uint128","name":"","type":"uint128"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"","type":"address"}],"name":"positionData","outputs":[{"internalType":"uint128","name":"amount","type":"uint128"},{"internalType":"uint128","name":"expiry","type":"uint128"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint128","name":"","type":"uint128"}],"name":"slopeChanges","outputs":[{"internalType":"uint128","name":"","type":"uint128"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"user","type":"address"}],"name":"totalSupplyAndBalanceCurrent","outputs":[{"internalType":"uint128","name":"","type":"uint128"},{"internalType":"uint128","name":"","type":"uint128"}],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint128","name":"","type":"uint128"}],"name":"totalSupplyAt","outputs":[{"internalType":"uint128","name":"","type":"uint128"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"totalSupplyCurrent","outputs":[{"internalType":"uint128","name":"","type":"uint128"}],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"totalSupplyStored","outputs":[{"internalType":"uint128","name":"","type":"uint128"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"withdraw","outputs":[{"internalType":"uint128","name":"amount","type":"uint128"}],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"zk","outputs":[{"internalType":"contract IERC20","name":"","type":"address"}],"stateMutability":"view","type":"function"}]
Contract Creation Code
60a06040523480156200001157600080fd5b50604051620014cf380380620014cf8339810160408190526200003491620000a8565b6001600160a01b0381166080526200004b62000072565b600280546001600160801b0319166001600160801b03929092169190911790555062000149565b60006200007f4262000084565b905090565b600062093a80620000968184620000da565b620000a291906200010f565b92915050565b600060208284031215620000bb57600080fd5b81516001600160a01b0381168114620000d357600080fd5b9392505050565b60006001600160801b03838116806200010357634e487b7160e01b600052601260045260246000fd5b92169190910492915050565b6001600160801b038181168382160280821691908281146200014157634e487b7160e01b600052601160045260246000fd5b505092915050565b60805161135c62000173600039600081816101ea01528181610391015261066e015261135c6000f3fe608060405234801561001057600080fd5b50600436106101005760003560e01c8063c91c1f5711610097578063ef1c243a11610066578063ef1c243a146102b4578063f4359ce514610132578063fa78668f146102bc578063fc367c61146102c657600080fd5b8063c91c1f57146101e5578063cb6b4f3c14610224578063d88e92a914610278578063e268b3a4146102a157600080fd5b80637c386c71116100d35780637c386c711461014f578063814b2cac14610196578063947975d9146101a9578063c8121ec2146101d257600080fd5b806330d981af146101055780633ccfd60b1461012a5780633ff032071461013257806370a082311461013c575b600080fd5b61010d6102e7565b6040516001600160801b0390911681526020015b60405180910390f35b61010d610304565b61010d62093a8081565b61010d61014a366004611117565b61040c565b61016261015d366004611132565b610465565b6040805182516001600160801b03908116825260209384015180518216858401529093015190921690820152606001610121565b60025461010d906001600160801b031681565b61010d6101b7366004611173565b6004602052600090815260409020546001600160801b031681565b61010d6101e036600461118e565b610496565b61020c7f000000000000000000000000000000000000000000000000000000000000000081565b6040516001600160a01b039091168152602001610121565b610258610232366004611117565b6001602052600090815260409020546001600160801b0380821691600160801b90041682565b604080516001600160801b03938416815292909116602083015201610121565b61010d610286366004611173565b6003602052600090815260409020546001600160801b031681565b6102586102af366004611117565b610704565b61010d610721565b61010d622e248081565b6102d96102d4366004611117565b610759565b604051908152602001610121565b6000806102f2610777565b5090506102fe816108be565b91505090565b600033610310816108e0565b61032d576040516339ba104360e01b815260040160405180910390fd5b6001600160a01b0381166000908152600160205260408120546001600160801b0316925082900361037157604051631e95654360e11b815260040160405180910390fd5b6001600160a01b038082166000908152600160205260408120556103c1907f000000000000000000000000000000000000000000000000000000000000000016826001600160801b038516610911565b6040516001600160801b03831681526001600160a01b038216907f0e1bb0545c1ebb9fb680bde73514e572831de93b479c087ec1ef6c35c3a19fd69060200160405180910390a25090565b6001600160a01b03811660009081526001602090815260408083208151808301909252546001600160801b038082168352600160801b909104169181019190915261045f9061045a90610975565b6108be565b92915050565b61046d6110c1565b6001600160a01b038316600090815260056020526040902061048f90836109c6565b9392505050565b6000336104ab6001600160801b038416610a3c565b6104d857604051637bf16ce960e11b81526001600160801b03841660048201526024015b60405180910390fd5b6001600160801b038316421061050c5760405163d928003560e01b81526001600160801b03841660048201526024016104cf565b6001600160a01b0381166000908152600160205260409020546001600160801b03600160801b9091048116908416101561055957604051631f8b0c5960e21b815260040160405180910390fd5b610566622e2480426111d7565b836001600160801b0316111561058f57604051632739a01960e11b815260040160405180910390fd5b61059c62093a80426111d7565b836001600160801b031610156105c557604051630def6af560e21b815260040160405180910390fd5b6001600160a01b0381166000908152600160205260408120546105f1906001600160801b0316866111ea565b9050806001600160801b031660000361061d576040516323fbc14f60e11b815260040160405180910390fd5b6001600160a01b03821660009081526001602052604081205461065090600160801b90046001600160801b031686611211565b90506001600160801b0386161561069f5761069f6001600160a01b037f00000000000000000000000000000000000000000000000000000000000000001684306001600160801b038a16610a52565b6106aa838783610a91565b604080516001600160801b038086168252881660208201529195506001600160a01b038516917fb1a3371956c54dc1d83695b4a006b051c8313ee986e533b6b964e77c9066fc2c910160405180910390a250505092915050565b60008061070f6102e7565b6107188461040c565b91509150915091565b60408051808201909152600080546001600160801b038082168452600160801b90910416602083015290610754906108be565b905090565b6001600160a01b03811660009081526005602052604081205461045f565b604080518082019091526000808252602082015260408051808201909152600080546001600160801b038082168452600160801b9091048116602084015260025491929116826107c5610c91565b9050806001600160801b0316826001600160801b0316106107ea575090939092509050565b806001600160801b0316826001600160801b0316101561087b5761081162093a80836111ea565b6001600160801b0380821660009081526003602052604090205491935061083b9185911684610c9c565b92506108478383610cf6565b6001600160801b03838116600090815260046020526040902080546001600160801b031916929091169190911790556107ea565b50815160208301516001600160801b03918216600160801b9183169190910217600055600280546001600160801b03191691831691909117905590939092509050565b60006108c982610d49565b156108d657506000919050565b61045f8242610cf6565b6001600160a01b038116600090815260016020526040812054600160801b90046001600160801b031642101561045f565b6040516001600160a01b0383811660248301526044820183905261097091859182169063a9059cbb906064015b604051602081830303815290604052915060e01b6020820180516001600160e01b038381831617835250505050610d7a565b505050565b6040805180820190915260008082526020820152815161099990622e248090611247565b6001600160801b031660208083018290528301516109b69161126d565b6001600160801b03168152919050565b6109ce6110c1565b8260000182815481106109e3576109e3611298565b6000918252602091829020604080518082018252600290930290910180546001600160801b03908116845282518084019093526001909101548082168352600160801b9004168184015291810191909152905092915050565b6000610a4b62093a80836112ae565b1592915050565b6040516001600160a01b038481166024830152838116604483015260648201839052610a8b9186918216906323b872dd9060840161093e565b50505050565b6001600160a01b03831660009081526001602090815260408083208151808301909252546001600160801b038082168352600160801b909104169181019190915281610adb610777565b509050610af582602001516001600160801b031642101590565b610b6f576000610b0483610975565b9050610b108282610ddd565b602080830151858201516001600160801b03908116600090815260039093526040832080549496509193919291610b4991859116611211565b92506101000a8154816001600160801b0302191690836001600160801b03160217905550505b60006040518060400160405280878560000151610b8c91906111ea565b6001600160801b03168152602001868560200151610baa91906111ea565b6001600160801b0316905290506000610bc282610975565b9050610bce8382610e32565b602080830151848201516001600160801b03908116600090815260039093526040832080549497509193919291610c07918591166111ea565b82546101009290920a6001600160801b038181021990931691831602179091558451602080870151918316600160801b92841683021760009081556001600160a01b038d1681526001825260408082208851898501519087169616909402949094179092556005905220610c7c915082610e73565b610c85816108be565b98975050505050505050565b600061075442610fa0565b6040805180820190915260008082526020820152828460200151610cc09190611211565b6001600160801b03166020820152610cd8828461126d565b8451610ce49190611211565b6001600160801b031681529392505050565b600082600001516001600160801b0316828460200151610d16919061126d565b6001600160801b03161115610d2d5750600061045f565b818360200151610d3d919061126d565b835161048f9190611211565b600081600001516001600160801b0316428360200151610d69919061126d565b6001600160801b0316101592915050565b6000610d8f6001600160a01b03841683610fba565b90508051600014158015610db4575080806020019051810190610db291906112c2565b155b1561097057604051635274afe760e01b81526001600160a01b03841660048201526024016104cf565b604080518082019091526000808252602082015281518351610dff9190611211565b6001600160801b0316815260208083015190840151610e1e9190611211565b6001600160801b0316602082015292915050565b604080518082019091526000808252602082015281518351610e5491906111ea565b6001600160801b0316815260208083015190840151610e1e91906111ea565b81548015801590610ec85750610e87610c91565b6001600160801b031683610e9c6001846112e4565b81548110610eac57610eac611298565b60009182526020909120600290910201546001600160801b0316145b15610f27578183610eda6001846112e4565b81548110610eea57610eea611298565b6000918252602091829020835193909201516001600160801b03908116600160801b02931692909217600160029093029091019190910155505050565b826000016040518060400160405280610f3e610c91565b6001600160801b0390811682526020918201869052835460018181018655600095865294839020845160029092020180549183166001600160801b03199092169190911781559282015180519201518116600160801b02911617910155505050565b600062093a80610fb08184611247565b61045f919061126d565b606061048f8383600084600080856001600160a01b03168486604051610fe091906112f7565b60006040518083038185875af1925050503d806000811461101d576040519150601f19603f3d011682016040523d82523d6000602084013e611022565b606091505b509150915061103286838361103c565b9695505050505050565b6060826110515761104c82611098565b61048f565b815115801561106857506001600160a01b0384163b155b1561109157604051639996b31560e01b81526001600160a01b03851660048201526024016104cf565b508061048f565b8051156110a85780518082602001fd5b604051630a12f52160e11b815260040160405180910390fd5b604051806040016040528060006001600160801b031681526020016110f6604080518082019091526000808252602082015290565b905290565b80356001600160a01b038116811461111257600080fd5b919050565b60006020828403121561112957600080fd5b61048f826110fb565b6000806040838503121561114557600080fd5b61114e836110fb565b946020939093013593505050565b80356001600160801b038116811461111257600080fd5b60006020828403121561118557600080fd5b61048f8261115c565b600080604083850312156111a157600080fd5b6111aa8361115c565b91506111b86020840161115c565b90509250929050565b634e487b7160e01b600052601160045260246000fd5b8082018082111561045f5761045f6111c1565b6001600160801b0381811683821601908082111561120a5761120a6111c1565b5092915050565b6001600160801b0382811682821603908082111561120a5761120a6111c1565b634e487b7160e01b600052601260045260246000fd5b60006001600160801b038084168061126157611261611231565b92169190910492915050565b6001600160801b03818116838216028082169190828114611290576112906111c1565b505092915050565b634e487b7160e01b600052603260045260246000fd5b6000826112bd576112bd611231565b500690565b6000602082840312156112d457600080fd5b8151801515811461048f57600080fd5b8181038181111561045f5761045f6111c1565b6000825160005b8181101561131857602081860181015185830152016112fe565b50600092019182525091905056fea264697066735822122017a41be454b6c9d0fcb6e23db7163163667bb990ddfcd5d253c6f2ec6e9570db64736f6c63430008160033000000000000000000000000c71b5f631354be6853efe9c3ab6b9590f8302e81
Deployed Bytecode
0x608060405234801561001057600080fd5b50600436106101005760003560e01c8063c91c1f5711610097578063ef1c243a11610066578063ef1c243a146102b4578063f4359ce514610132578063fa78668f146102bc578063fc367c61146102c657600080fd5b8063c91c1f57146101e5578063cb6b4f3c14610224578063d88e92a914610278578063e268b3a4146102a157600080fd5b80637c386c71116100d35780637c386c711461014f578063814b2cac14610196578063947975d9146101a9578063c8121ec2146101d257600080fd5b806330d981af146101055780633ccfd60b1461012a5780633ff032071461013257806370a082311461013c575b600080fd5b61010d6102e7565b6040516001600160801b0390911681526020015b60405180910390f35b61010d610304565b61010d62093a8081565b61010d61014a366004611117565b61040c565b61016261015d366004611132565b610465565b6040805182516001600160801b03908116825260209384015180518216858401529093015190921690820152606001610121565b60025461010d906001600160801b031681565b61010d6101b7366004611173565b6004602052600090815260409020546001600160801b031681565b61010d6101e036600461118e565b610496565b61020c7f000000000000000000000000c71b5f631354be6853efe9c3ab6b9590f8302e8181565b6040516001600160a01b039091168152602001610121565b610258610232366004611117565b6001602052600090815260409020546001600160801b0380821691600160801b90041682565b604080516001600160801b03938416815292909116602083015201610121565b61010d610286366004611173565b6003602052600090815260409020546001600160801b031681565b6102586102af366004611117565b610704565b61010d610721565b61010d622e248081565b6102d96102d4366004611117565b610759565b604051908152602001610121565b6000806102f2610777565b5090506102fe816108be565b91505090565b600033610310816108e0565b61032d576040516339ba104360e01b815260040160405180910390fd5b6001600160a01b0381166000908152600160205260408120546001600160801b0316925082900361037157604051631e95654360e11b815260040160405180910390fd5b6001600160a01b038082166000908152600160205260408120556103c1907f000000000000000000000000c71b5f631354be6853efe9c3ab6b9590f8302e8116826001600160801b038516610911565b6040516001600160801b03831681526001600160a01b038216907f0e1bb0545c1ebb9fb680bde73514e572831de93b479c087ec1ef6c35c3a19fd69060200160405180910390a25090565b6001600160a01b03811660009081526001602090815260408083208151808301909252546001600160801b038082168352600160801b909104169181019190915261045f9061045a90610975565b6108be565b92915050565b61046d6110c1565b6001600160a01b038316600090815260056020526040902061048f90836109c6565b9392505050565b6000336104ab6001600160801b038416610a3c565b6104d857604051637bf16ce960e11b81526001600160801b03841660048201526024015b60405180910390fd5b6001600160801b038316421061050c5760405163d928003560e01b81526001600160801b03841660048201526024016104cf565b6001600160a01b0381166000908152600160205260409020546001600160801b03600160801b9091048116908416101561055957604051631f8b0c5960e21b815260040160405180910390fd5b610566622e2480426111d7565b836001600160801b0316111561058f57604051632739a01960e11b815260040160405180910390fd5b61059c62093a80426111d7565b836001600160801b031610156105c557604051630def6af560e21b815260040160405180910390fd5b6001600160a01b0381166000908152600160205260408120546105f1906001600160801b0316866111ea565b9050806001600160801b031660000361061d576040516323fbc14f60e11b815260040160405180910390fd5b6001600160a01b03821660009081526001602052604081205461065090600160801b90046001600160801b031686611211565b90506001600160801b0386161561069f5761069f6001600160a01b037f000000000000000000000000c71b5f631354be6853efe9c3ab6b9590f8302e811684306001600160801b038a16610a52565b6106aa838783610a91565b604080516001600160801b038086168252881660208201529195506001600160a01b038516917fb1a3371956c54dc1d83695b4a006b051c8313ee986e533b6b964e77c9066fc2c910160405180910390a250505092915050565b60008061070f6102e7565b6107188461040c565b91509150915091565b60408051808201909152600080546001600160801b038082168452600160801b90910416602083015290610754906108be565b905090565b6001600160a01b03811660009081526005602052604081205461045f565b604080518082019091526000808252602082015260408051808201909152600080546001600160801b038082168452600160801b9091048116602084015260025491929116826107c5610c91565b9050806001600160801b0316826001600160801b0316106107ea575090939092509050565b806001600160801b0316826001600160801b0316101561087b5761081162093a80836111ea565b6001600160801b0380821660009081526003602052604090205491935061083b9185911684610c9c565b92506108478383610cf6565b6001600160801b03838116600090815260046020526040902080546001600160801b031916929091169190911790556107ea565b50815160208301516001600160801b03918216600160801b9183169190910217600055600280546001600160801b03191691831691909117905590939092509050565b60006108c982610d49565b156108d657506000919050565b61045f8242610cf6565b6001600160a01b038116600090815260016020526040812054600160801b90046001600160801b031642101561045f565b6040516001600160a01b0383811660248301526044820183905261097091859182169063a9059cbb906064015b604051602081830303815290604052915060e01b6020820180516001600160e01b038381831617835250505050610d7a565b505050565b6040805180820190915260008082526020820152815161099990622e248090611247565b6001600160801b031660208083018290528301516109b69161126d565b6001600160801b03168152919050565b6109ce6110c1565b8260000182815481106109e3576109e3611298565b6000918252602091829020604080518082018252600290930290910180546001600160801b03908116845282518084019093526001909101548082168352600160801b9004168184015291810191909152905092915050565b6000610a4b62093a80836112ae565b1592915050565b6040516001600160a01b038481166024830152838116604483015260648201839052610a8b9186918216906323b872dd9060840161093e565b50505050565b6001600160a01b03831660009081526001602090815260408083208151808301909252546001600160801b038082168352600160801b909104169181019190915281610adb610777565b509050610af582602001516001600160801b031642101590565b610b6f576000610b0483610975565b9050610b108282610ddd565b602080830151858201516001600160801b03908116600090815260039093526040832080549496509193919291610b4991859116611211565b92506101000a8154816001600160801b0302191690836001600160801b03160217905550505b60006040518060400160405280878560000151610b8c91906111ea565b6001600160801b03168152602001868560200151610baa91906111ea565b6001600160801b0316905290506000610bc282610975565b9050610bce8382610e32565b602080830151848201516001600160801b03908116600090815260039093526040832080549497509193919291610c07918591166111ea565b82546101009290920a6001600160801b038181021990931691831602179091558451602080870151918316600160801b92841683021760009081556001600160a01b038d1681526001825260408082208851898501519087169616909402949094179092556005905220610c7c915082610e73565b610c85816108be565b98975050505050505050565b600061075442610fa0565b6040805180820190915260008082526020820152828460200151610cc09190611211565b6001600160801b03166020820152610cd8828461126d565b8451610ce49190611211565b6001600160801b031681529392505050565b600082600001516001600160801b0316828460200151610d16919061126d565b6001600160801b03161115610d2d5750600061045f565b818360200151610d3d919061126d565b835161048f9190611211565b600081600001516001600160801b0316428360200151610d69919061126d565b6001600160801b0316101592915050565b6000610d8f6001600160a01b03841683610fba565b90508051600014158015610db4575080806020019051810190610db291906112c2565b155b1561097057604051635274afe760e01b81526001600160a01b03841660048201526024016104cf565b604080518082019091526000808252602082015281518351610dff9190611211565b6001600160801b0316815260208083015190840151610e1e9190611211565b6001600160801b0316602082015292915050565b604080518082019091526000808252602082015281518351610e5491906111ea565b6001600160801b0316815260208083015190840151610e1e91906111ea565b81548015801590610ec85750610e87610c91565b6001600160801b031683610e9c6001846112e4565b81548110610eac57610eac611298565b60009182526020909120600290910201546001600160801b0316145b15610f27578183610eda6001846112e4565b81548110610eea57610eea611298565b6000918252602091829020835193909201516001600160801b03908116600160801b02931692909217600160029093029091019190910155505050565b826000016040518060400160405280610f3e610c91565b6001600160801b0390811682526020918201869052835460018181018655600095865294839020845160029092020180549183166001600160801b03199092169190911781559282015180519201518116600160801b02911617910155505050565b600062093a80610fb08184611247565b61045f919061126d565b606061048f8383600084600080856001600160a01b03168486604051610fe091906112f7565b60006040518083038185875af1925050503d806000811461101d576040519150601f19603f3d011682016040523d82523d6000602084013e611022565b606091505b509150915061103286838361103c565b9695505050505050565b6060826110515761104c82611098565b61048f565b815115801561106857506001600160a01b0384163b155b1561109157604051639996b31560e01b81526001600160a01b03851660048201526024016104cf565b508061048f565b8051156110a85780518082602001fd5b604051630a12f52160e11b815260040160405180910390fd5b604051806040016040528060006001600160801b031681526020016110f6604080518082019091526000808252602082015290565b905290565b80356001600160a01b038116811461111257600080fd5b919050565b60006020828403121561112957600080fd5b61048f826110fb565b6000806040838503121561114557600080fd5b61114e836110fb565b946020939093013593505050565b80356001600160801b038116811461111257600080fd5b60006020828403121561118557600080fd5b61048f8261115c565b600080604083850312156111a157600080fd5b6111aa8361115c565b91506111b86020840161115c565b90509250929050565b634e487b7160e01b600052601160045260246000fd5b8082018082111561045f5761045f6111c1565b6001600160801b0381811683821601908082111561120a5761120a6111c1565b5092915050565b6001600160801b0382811682821603908082111561120a5761120a6111c1565b634e487b7160e01b600052601260045260246000fd5b60006001600160801b038084168061126157611261611231565b92169190910492915050565b6001600160801b03818116838216028082169190828114611290576112906111c1565b505092915050565b634e487b7160e01b600052603260045260246000fd5b6000826112bd576112bd611231565b500690565b6000602082840312156112d457600080fd5b8151801515811461048f57600080fd5b8181038181111561045f5761045f6111c1565b6000825160005b8181101561131857602081860181015185830152016112fe565b50600092019182525091905056fea264697066735822122017a41be454b6c9d0fcb6e23db7163163667bb990ddfcd5d253c6f2ec6e9570db64736f6c63430008160033
Constructor Arguments (ABI-Encoded and is the last bytes of the Contract Creation Code above)
000000000000000000000000c71b5f631354be6853efe9c3ab6b9590f8302e81
-----Decoded View---------------
Arg [0] : _zk (address): 0xC71B5F631354BE6853eFe9C3Ab6b9590F8302e81
-----Encoded View---------------
1 Constructor Arguments found :
Arg [0] : 000000000000000000000000c71b5f631354be6853efe9c3ab6b9590f8302e81
Loading...
Loading
Loading...
Loading
Multichain Portfolio | 26 Chains
Chain | Token | Portfolio % | Price | Amount | Value |
---|---|---|---|---|---|
ETH | 100.00% | $1.17 | 454,477.8232 | $531,739.05 |
Loading...
Loading
[ Download: CSV Export ]
A contract address hosts a smart contract, which is a set of code stored on the blockchain that runs when predetermined conditions are met. Learn more about addresses in our Knowledge Base.