Overview
ETH Balance
0 ETH
Eth Value
$0.00More Info
Private Name Tags
ContractCreator
Latest 25 from a total of 104 transactions
Transaction Hash |
Method
|
Block
|
From
|
To
|
|||||
---|---|---|---|---|---|---|---|---|---|
Empty Honey Pot | 20175406 | 57 days ago | IN | 0 ETH | 0.00011779 | ||||
Create Honey Pot | 20175383 | 57 days ago | IN | 0.005 ETH | 0.0003606 | ||||
Reset Pot | 20175351 | 57 days ago | IN | 0 ETH | 0.00009218 | ||||
Create Honey Pot | 20175308 | 57 days ago | IN | 0.005 ETH | 0.00031987 | ||||
Empty Honey Pot | 20175256 | 57 days ago | IN | 0 ETH | 0.00015135 | ||||
Create Honey Pot | 20175204 | 57 days ago | IN | 0.01 ETH | 0.00035785 | ||||
Empty Honey Pot | 20174891 | 57 days ago | IN | 0 ETH | 0.0001645 | ||||
Create Honey Pot | 20174888 | 57 days ago | IN | 0.01 ETH | 0.00039247 | ||||
Empty Honey Pot | 20174874 | 57 days ago | IN | 0 ETH | 0.00020925 | ||||
Create Honey Pot | 20174816 | 57 days ago | IN | 0.01 ETH | 0.00045791 | ||||
Reset Pot | 20174760 | 57 days ago | IN | 0 ETH | 0.00011532 | ||||
Create Honey Pot | 20174719 | 57 days ago | IN | 0.01 ETH | 0.00032635 | ||||
Empty Honey Pot | 20174674 | 57 days ago | IN | 0 ETH | 0.00016094 | ||||
Create Honey Pot | 20174568 | 57 days ago | IN | 0.01 ETH | 0.00019911 | ||||
Reset Pot | 20174515 | 57 days ago | IN | 0 ETH | 0.0000611 | ||||
Create Honey Pot | 20174466 | 57 days ago | IN | 0.01 ETH | 0.00020077 | ||||
Empty Honey Pot | 20169418 | 57 days ago | IN | 0 ETH | 0.00088755 | ||||
Create Honey Pot | 20169364 | 57 days ago | IN | 0.01 ETH | 0.00110516 | ||||
Reset Pot | 20168694 | 57 days ago | IN | 0 ETH | 0.00019623 | ||||
Create Honey Pot | 20168669 | 57 days ago | IN | 0.01 ETH | 0.00049614 | ||||
Empty Honey Pot | 20168645 | 57 days ago | IN | 0 ETH | 0.00024041 | ||||
Create Honey Pot | 20168640 | 57 days ago | IN | 0.01 ETH | 0.00051819 | ||||
Empty Honey Pot | 20168628 | 57 days ago | IN | 0 ETH | 0.00025303 | ||||
Create Honey Pot | 20168609 | 57 days ago | IN | 0.01 ETH | 0.00053589 | ||||
Empty Honey Pot | 20168553 | 57 days ago | IN | 0 ETH | 0.00017833 |
Latest 25 internal transactions (View All)
Advanced mode:
Parent Transaction Hash | Block | From | To | |||
---|---|---|---|---|---|---|
20175406 | 57 days ago | 0.005 ETH | ||||
20175351 | 57 days ago | 0.005 ETH | ||||
20175256 | 57 days ago | 0.01 ETH | ||||
20174891 | 57 days ago | 0.01 ETH | ||||
20174874 | 57 days ago | 0.01 ETH | ||||
20174760 | 57 days ago | 0.01 ETH | ||||
20174674 | 57 days ago | 0.01 ETH | ||||
20174515 | 57 days ago | 0.01 ETH | ||||
20169418 | 57 days ago | 0.01 ETH | ||||
20168694 | 57 days ago | 0.01 ETH | ||||
20168645 | 57 days ago | 0.01 ETH | ||||
20168628 | 57 days ago | 0.01 ETH | ||||
20168553 | 57 days ago | 0.01 ETH | ||||
20168512 | 57 days ago | 0.005 ETH | ||||
20168373 | 57 days ago | 0.005 ETH | ||||
20168234 | 58 days ago | 0.005 ETH | ||||
20168198 | 58 days ago | 0.01 ETH | ||||
20167927 | 58 days ago | 0.005 ETH | ||||
19385218 | 167 days ago | 1 ETH | ||||
19378227 | 168 days ago | 1 ETH | ||||
19370596 | 169 days ago | 1 ETH | ||||
19369601 | 169 days ago | 0.035 ETH | ||||
19369403 | 169 days ago | 0.135 ETH | ||||
19342255 | 173 days ago | 0.5 ETH | ||||
19334985 | 174 days ago | 0.25 ETH |
Loading...
Loading
Contract Name:
HoneyPot
Compiler Version
v0.8.17+commit.8df45f5f
Optimization Enabled:
Yes with 200 runs
Other Settings:
london EvmVersion
Contract Source Code (Solidity Standard Json-Input format)
// SPDX-License-Identifier: AGPL-3.0-only pragma solidity 0.8.17; import {Ownable} from "@openzeppelin/contracts/access/Ownable.sol"; import {Address} from "@openzeppelin/contracts/utils/Address.sol"; import {IAggregatorV3Source} from "oval-quickstart/ChainlinkOvalImmutable.sol"; contract HoneyPot is Ownable { struct HoneyPotDetails { int256 liquidationPrice; uint256 balance; } mapping(address => HoneyPotDetails) public honeyPots; IAggregatorV3Source public oracle; // Oval serving as a Chainlink oracle event OracleUpdated(address indexed newOracle); event HoneyPotCreated(address indexed owner, int256 initialPrice, uint256 amount); event HoneyPotEmptied(address indexed owner, address indexed liquidator, uint256 amount); event HoneyPotReset(address indexed owner, uint256 amount); constructor(IAggregatorV3Source _oracle) { oracle = _oracle; } function setOracle(IAggregatorV3Source _oracle) external onlyOwner { oracle = _oracle; emit OracleUpdated(address(_oracle)); } function createHoneyPot() external payable { require(honeyPots[msg.sender].liquidationPrice == 0, "Liquidation price already set for this user"); require(msg.value > 0, "No value sent"); (, int256 currentPrice,,,) = oracle.latestRoundData(); honeyPots[msg.sender].liquidationPrice = currentPrice; honeyPots[msg.sender].balance = msg.value; emit HoneyPotCreated(msg.sender, currentPrice, msg.value); } function _emptyPotForUser(address owner, address recipient) internal returns (uint256 amount) { HoneyPotDetails storage userPot = honeyPots[owner]; amount = userPot.balance; userPot.balance = 0; // reset the balance userPot.liquidationPrice = 0; // reset the liquidation price Address.sendValue(payable(recipient), amount); } function emptyHoneyPot(address owner) external { (, int256 currentPrice,,,) = oracle.latestRoundData(); require(currentPrice >= 0, "Invalid price from oracle"); HoneyPotDetails storage userPot = honeyPots[owner]; require(currentPrice != userPot.liquidationPrice, "Liquidation price reached for this user"); require(userPot.balance > 0, "No balance to withdraw"); uint256 withdrawnAmount = _emptyPotForUser(owner, msg.sender); emit HoneyPotEmptied(owner, msg.sender, withdrawnAmount); } function resetPot() external { uint256 withdrawnAmount = _emptyPotForUser(msg.sender, msg.sender); emit HoneyPotReset(msg.sender, withdrawnAmount); } }
// SPDX-License-Identifier: MIT // OpenZeppelin Contracts (last updated v4.9.0) (access/Ownable.sol) pragma solidity ^0.8.0; import "../utils/Context.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. * * By default, the owner account will be the one that deploys the contract. 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; event OwnershipTransferred(address indexed previousOwner, address indexed newOwner); /** * @dev Initializes the contract setting the deployer as the initial owner. */ constructor() { _transferOwnership(_msgSender()); } /** * @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 { require(owner() == _msgSender(), "Ownable: caller is not the owner"); } /** * @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 { require(newOwner != address(0), "Ownable: new owner is the zero address"); _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); } }
// SPDX-License-Identifier: MIT // OpenZeppelin Contracts (last updated v4.9.0) (utils/Address.sol) pragma solidity ^0.8.1; /** * @dev Collection of functions related to the address type */ library Address { /** * @dev Returns true if `account` is a contract. * * [IMPORTANT] * ==== * It is unsafe to assume that an address for which this function returns * false is an externally-owned account (EOA) and not a contract. * * Among others, `isContract` will return false for the following * types of addresses: * * - an externally-owned account * - a contract in construction * - an address where a contract will be created * - an address where a contract lived, but was destroyed * * Furthermore, `isContract` will also return true if the target contract within * the same transaction is already scheduled for destruction by `SELFDESTRUCT`, * which only has an effect at the end of a transaction. * ==== * * [IMPORTANT] * ==== * You shouldn't rely on `isContract` to protect against flash loan attacks! * * Preventing calls from contracts is highly discouraged. It breaks composability, breaks support for smart wallets * like Gnosis Safe, and does not provide security since it can be circumvented by calling from a contract * constructor. * ==== */ function isContract(address account) internal view returns (bool) { // This method relies on extcodesize/address.code.length, which returns 0 // for contracts in construction, since the code is only stored at the end // of the constructor execution. return account.code.length > 0; } /** * @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.0/security-considerations.html#use-the-checks-effects-interactions-pattern[checks-effects-interactions pattern]. */ function sendValue(address payable recipient, uint256 amount) internal { require(address(this).balance >= amount, "Address: insufficient balance"); (bool success, ) = recipient.call{value: amount}(""); require(success, "Address: unable to send value, recipient may have reverted"); } /** * @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, it is bubbled up by this * function (like regular Solidity function calls). * * 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. * * _Available since v3.1._ */ function functionCall(address target, bytes memory data) internal returns (bytes memory) { return functionCallWithValue(target, data, 0, "Address: low-level call failed"); } /** * @dev Same as {xref-Address-functionCall-address-bytes-}[`functionCall`], but with * `errorMessage` as a fallback revert reason when `target` reverts. * * _Available since v3.1._ */ function functionCall( address target, bytes memory data, string memory errorMessage ) internal returns (bytes memory) { return functionCallWithValue(target, data, 0, errorMessage); } /** * @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`. * * _Available since v3.1._ */ function functionCallWithValue(address target, bytes memory data, uint256 value) internal returns (bytes memory) { return functionCallWithValue(target, data, value, "Address: low-level call with value failed"); } /** * @dev Same as {xref-Address-functionCallWithValue-address-bytes-uint256-}[`functionCallWithValue`], but * with `errorMessage` as a fallback revert reason when `target` reverts. * * _Available since v3.1._ */ function functionCallWithValue( address target, bytes memory data, uint256 value, string memory errorMessage ) internal returns (bytes memory) { require(address(this).balance >= value, "Address: insufficient balance for call"); (bool success, bytes memory returndata) = target.call{value: value}(data); return verifyCallResultFromTarget(target, success, returndata, errorMessage); } /** * @dev Same as {xref-Address-functionCall-address-bytes-}[`functionCall`], * but performing a static call. * * _Available since v3.3._ */ function functionStaticCall(address target, bytes memory data) internal view returns (bytes memory) { return functionStaticCall(target, data, "Address: low-level static call failed"); } /** * @dev Same as {xref-Address-functionCall-address-bytes-string-}[`functionCall`], * but performing a static call. * * _Available since v3.3._ */ function functionStaticCall( address target, bytes memory data, string memory errorMessage ) internal view returns (bytes memory) { (bool success, bytes memory returndata) = target.staticcall(data); return verifyCallResultFromTarget(target, success, returndata, errorMessage); } /** * @dev Same as {xref-Address-functionCall-address-bytes-}[`functionCall`], * but performing a delegate call. * * _Available since v3.4._ */ function functionDelegateCall(address target, bytes memory data) internal returns (bytes memory) { return functionDelegateCall(target, data, "Address: low-level delegate call failed"); } /** * @dev Same as {xref-Address-functionCall-address-bytes-string-}[`functionCall`], * but performing a delegate call. * * _Available since v3.4._ */ function functionDelegateCall( address target, bytes memory data, string memory errorMessage ) internal returns (bytes memory) { (bool success, bytes memory returndata) = target.delegatecall(data); return verifyCallResultFromTarget(target, success, returndata, errorMessage); } /** * @dev Tool to verify that a low level call to smart-contract was successful, and revert (either by bubbling * the revert reason or using the provided one) in case of unsuccessful call or if target was not a contract. * * _Available since v4.8._ */ function verifyCallResultFromTarget( address target, bool success, bytes memory returndata, string memory errorMessage ) internal view returns (bytes memory) { if (success) { if (returndata.length == 0) { // only check isContract if the call was successful and the return data is empty // otherwise we already know that it was a contract require(isContract(target), "Address: call to non-contract"); } return returndata; } else { _revert(returndata, errorMessage); } } /** * @dev Tool to verify that a low level call was successful, and revert if it wasn't, either by bubbling the * revert reason or using the provided one. * * _Available since v4.3._ */ function verifyCallResult( bool success, bytes memory returndata, string memory errorMessage ) internal pure returns (bytes memory) { if (success) { return returndata; } else { _revert(returndata, errorMessage); } } function _revert(bytes memory returndata, string memory errorMessage) 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(errorMessage); } } }
// SPDX-License-Identifier: MIT pragma solidity 0.8.17; import {ImmutableController} from "oval/src/controllers/ImmutableController.sol"; import {ChainlinkSourceAdapter} from "oval/src/adapters/source-adapters/ChainlinkSourceAdapter.sol"; import {ChainlinkDestinationAdapter} from "oval/src/adapters/destination-adapters/ChainlinkDestinationAdapter.sol"; import {IAggregatorV3Source} from "oval/src/interfaces/chainlink/IAggregatorV3Source.sol"; /** * @title OvalOracle instance that has input and output adapters of Chainlink and ImmutableController. */ contract ChainlinkOvalImmutable is ImmutableController, ChainlinkSourceAdapter, ChainlinkDestinationAdapter { constructor( IAggregatorV3Source source, // The input chainlink source uint8 decimals, // The number of decimals the input should provide. uint256 lockWindow, // How long the permissioned actor has after each update to run an OEV auction. uint256 maxTraversal, // The maximum lookback traversal limit when looking for historic data. address[] memory unlockers // A set of unlockers who can initiate OEV auctions. ) ChainlinkSourceAdapter(source) ImmutableController(lockWindow, maxTraversal, unlockers) ChainlinkDestinationAdapter(decimals) {} }
// SPDX-License-Identifier: MIT // OpenZeppelin Contracts v4.4.1 (utils/Context.sol) pragma solidity ^0.8.0; /** * @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; } }
// SPDX-License-Identifier: AGPL-3.0-only pragma solidity 0.8.17; import {OVAL} from "../Oval.sol"; /** * @title ImmutableController providing an immutable controller. * @dev The benefit of this controller is two-fold: * 1. Permissioning and parameters _cannot_ be updated after deployment. Ownership doesn't exist. * 2. Because LOCK_WINDOW and MAX_TRAVERSAL are immutable, the read costs are much lower in the "hot" path (end * oracle users). */ abstract contract ImmutableController is OVAL { uint256 private immutable LOCK_WINDOW; // The lockWindow in seconds. uint256 private immutable MAX_TRAVERSAL; // The maximum number of rounds to traverse when looking for historical data. mapping(address => bool) public unlockers; constructor(uint256 _lockWindow, uint256 _maxTraversal, address[] memory _unlockers) { LOCK_WINDOW = _lockWindow; MAX_TRAVERSAL = _maxTraversal; for (uint256 i = 0; i < _unlockers.length; i++) { unlockers[_unlockers[i]] = true; emit UnlockerSet(_unlockers[i], true); } emit LockWindowSet(_lockWindow); emit MaxTraversalSet(_maxTraversal); } /** * @notice Returns true if the caller is allowed to unlock the OVAL. * @dev This implementation simply checks if the caller is in the unlockers mapping. Custom Controllers can override * this function to provide more granular control over who can unlock the OVAL. * @param caller The address to check. * @param _lastUnlockTime The timestamp of the latest unlock to the OVAL. Might be useful in verification. */ function canUnlock(address caller, uint256 _lastUnlockTime) public view override returns (bool) { return unlockers[caller]; } /** * @notice Time window that bounds how long the permissioned actor has to call the unlockLatestValue function after * a new source update is posted. If the permissioned actor does not call unlockLatestValue within this window of a * new source price, the latest value will be made available to everyone without going through an MEV-Share auction. * @return lockWindow time in seconds. */ function lockWindow() public view override returns (uint256) { return LOCK_WINDOW; } /** * @notice Max number of historical source updates to traverse when looking for a historic value in the past. * @return maxTraversal max number of historical source updates to traverse. */ function maxTraversal() public view override returns (uint256) { return MAX_TRAVERSAL; } }
// SPDX-License-Identifier: AGPL-3.0-only pragma solidity 0.8.17; import {DecimalLib} from "../lib/DecimalLib.sol"; import {IAggregatorV3Source} from "../../interfaces/chainlink/IAggregatorV3Source.sol"; import {DiamondRootOVAL} from "../../DiamondRootOval.sol"; /** * @title ChainlinkSourceAdapter contract to read data from Chainlink aggregator and standardize it for OVAL. * @dev Can fetch information from Chainlink source at a desired timestamp for historic lookups. */ abstract contract ChainlinkSourceAdapter is DiamondRootOVAL { IAggregatorV3Source public immutable CHAINLINK_SOURCE; uint8 private immutable SOURCE_DECIMALS; // As per Chainlink documentation https://docs.chain.link/data-feeds/historical-data#roundid-in-proxy // roundId on the aggregator proxy is comprised of phaseId (higher 16 bits) and roundId from phase aggregator // (lower 64 bits). PHASE_MASK is used to calculate first roundId of current phase aggregator. uint80 private constant PHASE_MASK = uint80(0xFFFF) << 64; event SourceSet(address indexed sourceOracle, uint8 indexed sourceDecimals); constructor(IAggregatorV3Source source) { CHAINLINK_SOURCE = source; SOURCE_DECIMALS = source.decimals(); emit SourceSet(address(source), SOURCE_DECIMALS); } /** * @notice Tries getting latest data as of requested timestamp. If this is not possible, returns the earliest data * available past the requested timestamp within provided traversal limitations. * @param timestamp The timestamp to try getting latest data at. * @param maxTraversal The maximum number of rounds to traverse when looking for historical data. * @return answer The answer as of requested timestamp, or earliest available data if not available, in 18 decimals. * @return updatedAt The timestamp of the answer. */ function tryLatestDataAt(uint256 timestamp, uint256 maxTraversal) public view virtual override returns (int256, uint256) { (int256 answer, uint256 updatedAt) = _tryLatestRoundDataAt(timestamp, maxTraversal); return (DecimalLib.convertDecimals(answer, SOURCE_DECIMALS, 18), updatedAt); } /** * @notice Initiate a snapshot of the source data. This is a no-op for Chainlink. */ function snapshotData() public virtual override {} /** * @notice Returns the latest data from the source. * @return answer The latest answer in 18 decimals. * @return updatedAt The timestamp of the answer. */ function getLatestSourceData() public view virtual override returns (int256, uint256) { (, int256 sourceAnswer,, uint256 updatedAt,) = CHAINLINK_SOURCE.latestRoundData(); return (DecimalLib.convertDecimals(sourceAnswer, SOURCE_DECIMALS, 18), updatedAt); } // Tries getting latest data as of requested timestamp. If this is not possible, returns the earliest data available // past the requested timestamp considering the maxTraversal limitations. function _tryLatestRoundDataAt(uint256 timestamp, uint256 maxTraversal) internal view returns (int256, uint256) { (uint80 roundId, int256 answer,, uint256 updatedAt,) = CHAINLINK_SOURCE.latestRoundData(); // In the happy path there have been no source updates since requested time, so we can return the latest data. // We can use updatedAt property as it matches the block timestamp of the latest source transmission. if (updatedAt <= timestamp) return (answer, updatedAt); // Attempt traversing historical round data backwards from roundId. This might still be newer or uninitialized. (int256 historicalAnswer, uint256 historicalUpdatedAt) = _searchRoundDataAt(timestamp, roundId, maxTraversal); // Validate returned data. If it is uninitialized we fallback to returning the current latest round data. if (historicalUpdatedAt > 0) return (historicalAnswer, historicalUpdatedAt); return (answer, updatedAt); } // Tries finding latest historical data (ignoring current roundId) not newer than requested timestamp. Might return // newer data than requested if exceeds traversal or hold uninitialized data that should be handled by the caller. function _searchRoundDataAt(uint256 timestamp, uint80 targetRoundId, uint256 maxTraversal) internal view returns (int256, uint256) { uint80 roundId; int256 answer; uint256 updatedAt; uint80 traversedRounds = 0; uint80 startRoundId = (targetRoundId & PHASE_MASK) + 1; // Phase aggregators are starting at round 1. while (traversedRounds < uint80(maxTraversal) && targetRoundId > startRoundId) { targetRoundId--; // We started from latest roundId that should be ignored. // The aggregator proxy does not keep track when its phase aggregators got switched. This means that we can // only traverse rounds of the current phase aggregator. When phase aggregators are switched there is // normally an overlap period when both new and old phase aggregators receive updates. Without knowing exact // time when the aggregator proxy switched them we might end up returning historical data from the new phase // aggregator that was not yet available on the aggregator proxy at the requested timestamp. (roundId, answer,, updatedAt,) = CHAINLINK_SOURCE.getRoundData(targetRoundId); if (!(roundId == targetRoundId && updatedAt > 0)) return (0, 0); if (updatedAt <= timestamp) return (answer, updatedAt); traversedRounds++; } return (answer, updatedAt); // Did not find requested round. Return earliest round or uninitialized data. } }
// SPDX-License-Identifier: AGPL-3.0-only pragma solidity 0.8.17; import {DecimalLib} from "../lib/DecimalLib.sol"; import {IAggregatorV3} from "../../interfaces/chainlink/IAggregatorV3.sol"; import {DiamondRootOVAL} from "../../DiamondRootOval.sol"; /** * @title ChainlinkDestinationAdapter contract to expose OVAL data via the standard Chainlink Aggregator interface. */ abstract contract ChainlinkDestinationAdapter is DiamondRootOVAL, IAggregatorV3 { uint8 public immutable override decimals; event DecimalsSet(uint8 indexed decimals); constructor(uint8 _decimals) { decimals = _decimals; emit DecimalsSet(_decimals); } /** * @notice Returns the latest data from the source. * @return answer The latest answer in the configured number of decimals. */ function latestAnswer() public view override returns (int256) { (int256 answer,) = internalLatestData(); return DecimalLib.convertDecimals(answer, 18, decimals); } /** * @notice Returns when the latest answer was updated. * @return timestamp The timestamp of the latest answer. */ function latestTimestamp() public view override returns (uint256) { (, uint256 timestamp) = internalLatestData(); return timestamp; } /** * @notice Returns an approximate form of the latest Round data. This does not implement the notion of "roundId" that * the normal chainlink aggregator does and returns hardcoded values for those fields. * @return roundId The roundId of the latest answer, hardcoded to 1. * @return answer The latest answer in the configured number of decimals. * @return startedAt The timestamp when the value was updated. * @return updatedAt The timestamp when the value was updated. * @return answeredInRound The roundId of the round in which the answer was computed, hardcoded to 1. */ function latestRoundData() external view returns (uint80, int256, uint256, uint256, uint80) { (int256 answer, uint256 updatedAt) = internalLatestData(); return (1, DecimalLib.convertDecimals(answer, 18, decimals), updatedAt, updatedAt, 1); } }
// SPDX-License-Identifier: AGPL-3.0-only pragma solidity 0.8.17; interface IAggregatorV3Source { function decimals() external view returns (uint8); function latestRoundData() external view returns (uint80 roundId, int256 answer, uint256 startedAt, uint256 updatedAt, uint80 answeredInRound); function getRoundData(uint80 _roundId) external view returns (uint80 roundId, int256 answer, uint256 startedAt, uint256 updatedAt, uint80 answeredInRound); }
// SPDX-License-Identifier: AGPL-3.0-only pragma solidity 0.8.17; import {Math} from "openzeppelin-contracts/contracts/utils/math/Math.sol"; import {DiamondRootOVAL} from "./DiamondRootOval.sol"; /** * @title OVAL contract to provide permissioned updating at the execution of an MEV-share auction. * @dev This contract works by conditionally returning a stale value oracle price from the source adapter until a * permissioned actor calls the unlockLatestValue function. The call to unlockLatestValue is submitted via an MEV-share * auction and will be backrun by the winner of the auction. The backrunner has access to the most recent newly unlocked * source price. If someone tries to front-run the call to unlockLatestValue, the caller will receive a stale value. If * the permissioned actor does not call unlockLatestValue within the lockWindow, the latest value that is at least * lockWindow seconds old will be returned. This contract is intended to be used in conjunction with a Controller * contract that governs who can call unlockLatestValue. * @custom:security-contact [email protected] */ abstract contract OVAL is DiamondRootOVAL { uint256 public lastUnlockTime; // Timestamp of the latest unlock to the OVAL. /** * @notice Function called by permissioned actor to unlock the latest value as part of the MEV-share auction flow. * @dev The call to this function is expected to be sent to flashbots via eth_sendPrivateTransaction. This is the * transaction that is backrun by the winner of the auction. The backrunner has access to the most recent newly * unlocked source price as a result and therefore can extract the MEV associated with the unlock. */ function unlockLatestValue() public { require(canUnlock(msg.sender, lastUnlockTime), "Controller blocked: canUnlock"); snapshotData(); // If the source connected to this OVAL needs to snapshot data, do it here. Else, no op. lastUnlockTime = block.timestamp; emit LatestValueUnlocked(block.timestamp); } /** * @notice Returns latest data from source, governed by lockWindow controlling if returned data is stale. * @return answer The latest answer in 18 decimals. * @return timestamp The timestamp of the answer. */ function internalLatestData() public view override returns (int256, uint256) { // Case work: //-> If unlockLatestValue has been called within lockWindow, then return most recent price as of unlockLatestValue call. //-> If unlockLatestValue has not been called in lockWindow, then return most recent value that is at least lockWindow old. return tryLatestDataAt(Math.max(lastUnlockTime, block.timestamp - lockWindow()), maxTraversal()); } }
// SPDX-License-Identifier: AGPL-3.0-only pragma solidity 0.8.17; import {Math} from "openzeppelin-contracts/contracts/utils/math/Math.sol"; /** * @title DecimalLib library to perform decimal math operations. */ library DecimalLib { /** * Converts int256 answer scaled at iDecimals to scale at oDecimals. * Source oracle adapters should pass 18 for oDecimals, while destination adapters should pass 18 for iDecimals. * Warning: When downscaling (i.e., when iDecimals > oDecimals), the conversion can lead to a loss of precision. * In the worst case, if the answer is small enough, the conversion can return zero. * Warning: When upscaling (i.e., when iDecimals < oDecimals), if answer * 10^(oDecimals - iDecimals) exceeds * the maximum int256 value, this function will revert. Ensure the provided values will not cause an overflow. */ function convertDecimals(int256 answer, uint8 iDecimals, uint8 oDecimals) internal pure returns (int256) { if (iDecimals == oDecimals) return answer; if (iDecimals < oDecimals) return answer * int256(10 ** (oDecimals - iDecimals)); return answer / int256(10 ** (iDecimals - oDecimals)); } /** * Converts uint256 answer scaled at iDecimals to scale at oDecimals. * Source oracle adapters should pass 18 for oDecimals, while destination adapters should pass 18 for iDecimals. * Warning: When downscaling (i.e., when iDecimals > oDecimals), the conversion can lead to a loss of precision. * In the worst case, if the answer is small enough, the conversion can return zero. * Warning: When upscaling (i.e., when iDecimals < oDecimals), if answer * 10^(oDecimals - iDecimals) exceeds * the maximum uint256 value, this function will revert. Ensure the provided values will not cause an overflow. */ function convertDecimals(uint256 answer, uint8 iDecimals, uint8 oDecimals) internal pure returns (uint256) { if (iDecimals == oDecimals) return answer; if (iDecimals < oDecimals) return answer * 10 ** (oDecimals - iDecimals); return answer / 10 ** (iDecimals - oDecimals); } // Derives token decimals from its scaling factor. function deriveDecimals(uint256 scalingFactor) internal pure returns (uint8) { uint256 decimals = Math.log10(scalingFactor); // Verify that the inverse operation yields the expected result. require(10 ** decimals == scalingFactor, "Invalid scalingFactor"); // Note: decimals must fit within uint8 because: // 2^8 = 256, which is uint8 max. // This would imply an input scaling factor of 1e256. The max value of uint256 is \(2^{256} - 1\), which is approximately // 1.2e77, but not equal to 1e256. Therefore, decimals will always fit within uint8 or the check above will fail. return uint8(decimals); } }
// SPDX-License-Identifier: AGPL-3.0-only pragma solidity 0.8.17; import {IBaseOracleAdapter} from "./interfaces/IBaseOracleAdapter.sol"; import {IBaseController} from "./interfaces/IBaseController.sol"; import {IOVAL} from "./interfaces/IOval.sol"; /** * @title DiamondRootOVAL contract to provide base functions that the three components of the OVAL contract system * need. They are exposed here to simplify the inheritance structure of the OVAL contract system and to enable easier * composability and extensibility at the integration layer, enabling arbitrary combinations of sources and destinations. */ abstract contract DiamondRootOVAL is IBaseController, IOVAL, IBaseOracleAdapter { /** * @notice Returns the latest data from the source. * @return answer The latest answer in 18 decimals. * @return updatedAt The timestamp of the answer. */ function getLatestSourceData() public view virtual returns (int256, uint256); /** * @notice Tries getting latest data as of requested timestamp. If this is not possible, returns the earliest data * available past the requested timestamp within provided traversal limitations. * @param timestamp The timestamp to try getting latest data at. * @param maxTraversal The maximum number of rounds to traverse when looking for historical data. * @return answer The answer as of requested timestamp, or earliest available data if not available, in 18 decimals. * @return updatedAt The timestamp of the answer. */ function tryLatestDataAt(uint256 timestamp, uint256 maxTraversal) public view virtual returns (int256, uint256); /** * @notice Returns the latest data from the source. Depending on when the OVAL was last unlocked this might * return an slightly stale value to protect the OEV from being stolen by a front runner. * @return answer The latest answer in 18 decimals. * @return updatedAt The timestamp of the answer. */ function internalLatestData() public view virtual returns (int256, uint256); /** * @notice Snapshot the current source data. Is a no-op if the source does not require snapshotting. */ function snapshotData() public virtual; /** * @notice Permissioning function to control who can unlock the OVAL. */ function canUnlock(address caller, uint256 cachedLatestTimestamp) public view virtual returns (bool); /** * @notice Time window that bounds how long the permissioned actor has to call the unlockLatestValue function after * a new source update is posted. If the permissioned actor does not call unlockLatestValue within this window of a * new source price, the latest value will be made available to everyone without going through an MEV-Share auction. * @return lockWindow time in seconds. */ function lockWindow() public view virtual returns (uint256); /** * @notice Max number of historical source updates to traverse when looking for a historic value in the past. * @return maxTraversal max number of historical source updates to traverse. */ function maxTraversal() public view virtual returns (uint256); }
// SPDX-License-Identifier: AGPL-3.0-only pragma solidity 0.8.17; interface IAggregatorV3 { function latestAnswer() external view returns (int256); function latestTimestamp() external view returns (uint256); function decimals() external view returns (uint8); function latestRoundData() external view returns (uint80 roundId, int256 answer, uint256 startedAt, uint256 updatedAt, uint80 answeredInRound); // Other Chainlink functions we don't need. // function latestRound() external view returns (uint256); // function getAnswer(uint256 roundId) external view returns (int256); // function getTimestamp(uint256 roundId) external view returns (uint256); // function description() external view returns (string memory); // function version() external view returns (uint256); // function getRoundData(uint80 _roundId) // external // view // returns (uint80 roundId, int256 answer, uint256 startedAt, uint256 updatedAt, uint80 answeredInRound); // event AnswerUpdated(int256 indexed current, uint256 indexed roundId, uint256 updatedAt); // event NewRound(uint256 indexed roundId, address indexed startedBy, uint256 startedAt); }
// SPDX-License-Identifier: MIT // OpenZeppelin Contracts (last updated v4.9.0) (utils/math/Math.sol) pragma solidity ^0.8.0; /** * @dev Standard math utilities missing in the Solidity language. */ library Math { enum Rounding { Down, // Toward negative infinity Up, // Toward infinity Zero // Toward zero } /** * @dev Returns the largest of two numbers. */ function max(uint256 a, uint256 b) internal pure returns (uint256) { return a > b ? a : b; } /** * @dev Returns the smallest of two numbers. */ function min(uint256 a, uint256 b) internal pure returns (uint256) { return a < b ? a : b; } /** * @dev Returns the average of two numbers. The result is rounded towards * zero. */ function average(uint256 a, uint256 b) internal pure returns (uint256) { // (a + b) / 2 can overflow. return (a & b) + (a ^ b) / 2; } /** * @dev Returns the ceiling of the division of two numbers. * * This differs from standard division with `/` in that it rounds up instead * of rounding down. */ function ceilDiv(uint256 a, uint256 b) internal pure returns (uint256) { // (a + b - 1) / b can overflow on addition, so we distribute. return a == 0 ? 0 : (a - 1) / b + 1; } /** * @notice Calculates floor(x * y / denominator) with full precision. Throws if result overflows a uint256 or denominator == 0 * @dev Original credit to Remco Bloemen under MIT license (https://xn--2-umb.com/21/muldiv) * with further edits by Uniswap Labs also under MIT license. */ function mulDiv(uint256 x, uint256 y, uint256 denominator) internal pure returns (uint256 result) { unchecked { // 512-bit multiply [prod1 prod0] = x * y. Compute the product mod 2^256 and mod 2^256 - 1, then use // use the Chinese Remainder Theorem to reconstruct the 512 bit result. The result is stored in two 256 // variables such that product = prod1 * 2^256 + prod0. uint256 prod0; // Least significant 256 bits of the product uint256 prod1; // Most significant 256 bits of the product assembly { let mm := mulmod(x, y, not(0)) prod0 := mul(x, y) prod1 := sub(sub(mm, prod0), lt(mm, prod0)) } // Handle non-overflow cases, 256 by 256 division. if (prod1 == 0) { // Solidity will revert if denominator == 0, unlike the div opcode on its own. // The surrounding unchecked block does not change this fact. // See https://docs.soliditylang.org/en/latest/control-structures.html#checked-or-unchecked-arithmetic. return prod0 / denominator; } // Make sure the result is less than 2^256. Also prevents denominator == 0. require(denominator > prod1, "Math: mulDiv 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. // Does not overflow because the denominator cannot be zero at this stage in the function. uint256 twos = denominator & (~denominator + 1); assembly { // Divide denominator by twos. denominator := div(denominator, twos) // Divide [prod1 prod0] by twos. prod0 := div(prod0, twos) // Flip twos such that it is 2^256 / twos. If twos is zero, then it becomes one. twos := add(div(sub(0, twos), twos), 1) } // Shift in bits from prod1 into prod0. prod0 |= prod1 * twos; // Invert denominator mod 2^256. Now that denominator is an odd number, it has an inverse modulo 2^256 such // that denominator * inv = 1 mod 2^256. Compute the inverse by starting with a seed that is correct for // four bits. That is, denominator * inv = 1 mod 2^4. uint256 inverse = (3 * denominator) ^ 2; // Use the Newton-Raphson iteration to improve the precision. Thanks to Hensel's lifting lemma, this also works // in modular arithmetic, doubling the correct bits in each step. inverse *= 2 - denominator * inverse; // inverse mod 2^8 inverse *= 2 - denominator * inverse; // inverse mod 2^16 inverse *= 2 - denominator * inverse; // inverse mod 2^32 inverse *= 2 - denominator * inverse; // inverse mod 2^64 inverse *= 2 - denominator * inverse; // inverse mod 2^128 inverse *= 2 - denominator * inverse; // inverse mod 2^256 // Because the division is now exact we can divide by multiplying with the modular inverse of denominator. // This will give us the correct result modulo 2^256. Since the preconditions guarantee that the outcome is // less than 2^256, this is the final result. We don't need to compute the high bits of the result and prod1 // is no longer required. result = prod0 * inverse; return result; } } /** * @notice Calculates x * y / denominator with full precision, following the selected rounding direction. */ function mulDiv(uint256 x, uint256 y, uint256 denominator, Rounding rounding) internal pure returns (uint256) { uint256 result = mulDiv(x, y, denominator); if (rounding == Rounding.Up && mulmod(x, y, denominator) > 0) { result += 1; } return result; } /** * @dev Returns the square root of a number. If the number is not a perfect square, the value is rounded down. * * Inspired by Henry S. Warren, Jr.'s "Hacker's Delight" (Chapter 11). */ function sqrt(uint256 a) internal pure returns (uint256) { if (a == 0) { return 0; } // For our first guess, we get the biggest power of 2 which is smaller than the square root of the target. // // We know that the "msb" (most significant bit) of our target number `a` is a power of 2 such that we have // `msb(a) <= a < 2*msb(a)`. This value can be written `msb(a)=2**k` with `k=log2(a)`. // // This can be rewritten `2**log2(a) <= a < 2**(log2(a) + 1)` // → `sqrt(2**k) <= sqrt(a) < sqrt(2**(k+1))` // → `2**(k/2) <= sqrt(a) < 2**((k+1)/2) <= 2**(k/2 + 1)` // // Consequently, `2**(log2(a) / 2)` is a good first approximation of `sqrt(a)` with at least 1 correct bit. uint256 result = 1 << (log2(a) >> 1); // At this point `result` is an estimation with one bit of precision. We know the true value is a uint128, // since it is the square root of a uint256. Newton's method converges quadratically (precision doubles at // every iteration). We thus need at most 7 iteration to turn our partial result with one bit of precision // into the expected uint128 result. unchecked { result = (result + a / result) >> 1; result = (result + a / result) >> 1; result = (result + a / result) >> 1; result = (result + a / result) >> 1; result = (result + a / result) >> 1; result = (result + a / result) >> 1; result = (result + a / result) >> 1; return min(result, a / result); } } /** * @notice Calculates sqrt(a), following the selected rounding direction. */ function sqrt(uint256 a, Rounding rounding) internal pure returns (uint256) { unchecked { uint256 result = sqrt(a); return result + (rounding == Rounding.Up && result * result < a ? 1 : 0); } } /** * @dev Return the log in base 2, rounded down, of a positive value. * Returns 0 if given 0. */ function log2(uint256 value) internal pure returns (uint256) { uint256 result = 0; unchecked { if (value >> 128 > 0) { value >>= 128; result += 128; } if (value >> 64 > 0) { value >>= 64; result += 64; } if (value >> 32 > 0) { value >>= 32; result += 32; } if (value >> 16 > 0) { value >>= 16; result += 16; } if (value >> 8 > 0) { value >>= 8; result += 8; } if (value >> 4 > 0) { value >>= 4; result += 4; } if (value >> 2 > 0) { value >>= 2; result += 2; } if (value >> 1 > 0) { result += 1; } } return result; } /** * @dev Return the log in base 2, following the selected rounding direction, of a positive value. * Returns 0 if given 0. */ function log2(uint256 value, Rounding rounding) internal pure returns (uint256) { unchecked { uint256 result = log2(value); return result + (rounding == Rounding.Up && 1 << result < value ? 1 : 0); } } /** * @dev Return the log in base 10, rounded down, of a positive value. * 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 + (rounding == Rounding.Up && 10 ** result < value ? 1 : 0); } } /** * @dev Return the log in base 256, rounded down, of a positive value. * Returns 0 if given 0. * * Adding one to the result gives the number of pairs of hex symbols needed to represent `value` as a hex string. */ function log256(uint256 value) internal pure returns (uint256) { uint256 result = 0; unchecked { if (value >> 128 > 0) { value >>= 128; result += 16; } if (value >> 64 > 0) { value >>= 64; result += 8; } if (value >> 32 > 0) { value >>= 32; result += 4; } if (value >> 16 > 0) { value >>= 16; result += 2; } if (value >> 8 > 0) { result += 1; } } return result; } /** * @dev Return the log in base 256, following the selected rounding direction, of a positive value. * Returns 0 if given 0. */ function log256(uint256 value, Rounding rounding) internal pure returns (uint256) { unchecked { uint256 result = log256(value); return result + (rounding == Rounding.Up && 1 << (result << 3) < value ? 1 : 0); } } }
// SPDX-License-Identifier: AGPL-3.0-only pragma solidity 0.8.17; interface IBaseOracleAdapter { function tryLatestDataAt(uint256 _timestamp, uint256 _maxTraversal) external view returns (int256 answer, uint256 timestamp); function getLatestSourceData() external view returns (int256 answer, uint256 timestamp); }
// SPDX-License-Identifier: AGPL-3.0-only pragma solidity 0.8.17; interface IBaseController { event LockWindowSet(uint256 indexed lockWindow); event MaxTraversalSet(uint256 indexed maxTraversal); event UnlockerSet(address indexed unlocker, bool indexed allowed); function canUnlock(address caller, uint256 cachedLatestTimestamp) external view returns (bool); }
// SPDX-License-Identifier: AGPL-3.0-only pragma solidity 0.8.17; interface IOVAL { event LatestValueUnlocked(uint256 indexed timestamp); function internalLatestData() external view returns (int256 answer, uint256 timestamp); }
{ "remappings": [ "ds-test/=lib/forge-std/lib/ds-test/src/", "forge-std/=lib/forge-std/src/", "oval-quickstart/=lib/oval-quickstart/src/", "oval-contracts/=lib/oval-contracts/src/", "@openzeppelin/contracts/=lib/openzeppelin-contracts/contracts/", "erc4626-tests/=lib/openzeppelin-contracts/lib/erc4626-tests/", "openzeppelin-contracts/=lib/openzeppelin-contracts/", "openzeppelin/=lib/openzeppelin-contracts/contracts/", "oval/=lib/oval-quickstart/lib/oval-contracts/" ], "optimizer": { "enabled": true, "runs": 200 }, "metadata": { "useLiteralContent": false, "bytecodeHash": "ipfs" }, "outputSelection": { "*": { "*": [ "evm.bytecode", "evm.deployedBytecode", "devdoc", "userdoc", "metadata", "abi" ] } }, "evmVersion": "london", "libraries": {} }
Contract Security Audit
- No Contract Security Audit Submitted- Submit Audit Here
[{"inputs":[{"internalType":"contract IAggregatorV3Source","name":"_oracle","type":"address"}],"stateMutability":"nonpayable","type":"constructor"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"owner","type":"address"},{"indexed":false,"internalType":"int256","name":"initialPrice","type":"int256"},{"indexed":false,"internalType":"uint256","name":"amount","type":"uint256"}],"name":"HoneyPotCreated","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"owner","type":"address"},{"indexed":true,"internalType":"address","name":"liquidator","type":"address"},{"indexed":false,"internalType":"uint256","name":"amount","type":"uint256"}],"name":"HoneyPotEmptied","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"owner","type":"address"},{"indexed":false,"internalType":"uint256","name":"amount","type":"uint256"}],"name":"HoneyPotReset","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"newOracle","type":"address"}],"name":"OracleUpdated","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"},{"inputs":[],"name":"createHoneyPot","outputs":[],"stateMutability":"payable","type":"function"},{"inputs":[{"internalType":"address","name":"owner","type":"address"}],"name":"emptyHoneyPot","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"","type":"address"}],"name":"honeyPots","outputs":[{"internalType":"int256","name":"liquidationPrice","type":"int256"},{"internalType":"uint256","name":"balance","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"oracle","outputs":[{"internalType":"contract IAggregatorV3Source","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"owner","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"renounceOwnership","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"resetPot","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"contract IAggregatorV3Source","name":"_oracle","type":"address"}],"name":"setOracle","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"newOwner","type":"address"}],"name":"transferOwnership","outputs":[],"stateMutability":"nonpayable","type":"function"}]
Contract Creation Code
608060405234801561001057600080fd5b50604051610a1c380380610a1c83398101604081905261002f916100ad565b6100383361005d565b600280546001600160a01b0319166001600160a01b03929092169190911790556100dd565b600080546001600160a01b038381166001600160a01b0319831681178455604051919092169283917f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e09190a35050565b6000602082840312156100bf57600080fd5b81516001600160a01b03811681146100d657600080fd5b9392505050565b610930806100ec6000396000f3fe6080604052600436106100865760003560e01c80637adbf973116100595780637adbf973146101185780637dc0d1d0146101385780637f81e370146101705780638da5cb5b14610185578063f2fde38b146101a357600080fd5b80633cc57abe1461008b5780634d54a8ca146100ad57806353441c33146100b5578063715018a614610103575b600080fd5b34801561009757600080fd5b506100ab6100a6366004610867565b6101c3565b005b6100ab6103b3565b3480156100c157600080fd5b506100e96100d0366004610867565b6001602081905260009182526040909120805491015482565b604080519283526020830191909152015b60405180910390f35b34801561010f57600080fd5b506100ab610533565b34801561012457600080fd5b506100ab610133366004610867565b610547565b34801561014457600080fd5b50600254610158906001600160a01b031681565b6040516001600160a01b0390911681526020016100fa565b34801561017c57600080fd5b506100ab610599565b34801561019157600080fd5b506000546001600160a01b0316610158565b3480156101af57600080fd5b506100ab6101be366004610867565b6105da565b60025460408051633fabe5a360e21b815290516000926001600160a01b03169163feaf968c9160048083019260a09291908290030181865afa15801561020d573d6000803e3d6000fd5b505050506040513d601f19601f8201168201806040525081019061023191906108aa565b505050915050600081121561028d5760405162461bcd60e51b815260206004820152601960248201527f496e76616c69642070726963652066726f6d206f7261636c650000000000000060448201526064015b60405180910390fd5b6001600160a01b0382166000908152600160205260409020805482036103055760405162461bcd60e51b815260206004820152602760248201527f4c69717569646174696f6e207072696365207265616368656420666f7220746860448201526634b9903ab9b2b960c91b6064820152608401610284565b60008160010154116103525760405162461bcd60e51b81526020600482015260166024820152754e6f2062616c616e636520746f20776974686472617760501b6044820152606401610284565b600061035e8433610653565b9050336001600160a01b0316846001600160a01b03167fbbe4d27a5a8e64b566b801ba7486fd62107d0ccb0414b8caa9856d955b49e950836040516103a591815260200190565b60405180910390a350505050565b33600090815260016020526040902054156104245760405162461bcd60e51b815260206004820152602b60248201527f4c69717569646174696f6e20707269636520616c72656164792073657420666f60448201526a39103a3434b9903ab9b2b960a91b6064820152608401610284565b600034116104645760405162461bcd60e51b815260206004820152600d60248201526c139bc81d985b1d59481cd95b9d609a1b6044820152606401610284565b60025460408051633fabe5a360e21b815290516000926001600160a01b03169163feaf968c9160048083019260a09291908290030181865afa1580156104ae573d6000803e3d6000fd5b505050506040513d601f19601f820116820180604052508101906104d291906108aa565b5050336000818152600160208181526040928390208681553492018290558251868152908101919091529395509093507fc6ac3b2804efa3c84673d172e45ecf25a7eae9166fe20880ed755220e60a3b08920190505b60405180910390a250565b61053b61068a565b61054560006106e4565b565b61054f61068a565b600280546001600160a01b0319166001600160a01b0383169081179091556040517f3df77beb5db05fcdd70a30fc8adf3f83f9501b68579455adbd100b818094039490600090a250565b60006105a53333610653565b60405181815290915033907f9e032fa45cce2f05146d3bccb8ab7a58c431387fafa29d5e75640e23fd56b89490602001610528565b6105e261068a565b6001600160a01b0381166106475760405162461bcd60e51b815260206004820152602660248201527f4f776e61626c653a206e6577206f776e657220697320746865207a65726f206160448201526564647265737360d01b6064820152608401610284565b610650816106e4565b50565b6001600160a01b038216600090815260016020819052604082209081018054908390559181556106838383610734565b5092915050565b6000546001600160a01b031633146105455760405162461bcd60e51b815260206004820181905260248201527f4f776e61626c653a2063616c6c6572206973206e6f7420746865206f776e65726044820152606401610284565b600080546001600160a01b038381166001600160a01b0319831681178455604051919092169283917f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e09190a35050565b804710156107845760405162461bcd60e51b815260206004820152601d60248201527f416464726573733a20696e73756666696369656e742062616c616e63650000006044820152606401610284565b6000826001600160a01b03168260405160006040518083038185875af1925050503d80600081146107d1576040519150601f19603f3d011682016040523d82523d6000602084013e6107d6565b606091505b505090508061084d5760405162461bcd60e51b815260206004820152603a60248201527f416464726573733a20756e61626c6520746f2073656e642076616c75652c207260448201527f6563697069656e74206d617920686176652072657665727465640000000000006064820152608401610284565b505050565b6001600160a01b038116811461065057600080fd5b60006020828403121561087957600080fd5b813561088481610852565b9392505050565b805169ffffffffffffffffffff811681146108a557600080fd5b919050565b600080600080600060a086880312156108c257600080fd5b6108cb8661088b565b94506020860151935060408601519250606086015191506108ee6080870161088b565b9050929550929590935056fea2646970667358221220653887e29e4735b3819f30bbd5b463891001e02a77fe63c7e9396c2e09ee408f64736f6c634300081100330000000000000000000000004e79e78fb7041b7a2f554539ceb6008dc13e1978
Deployed Bytecode
0x6080604052600436106100865760003560e01c80637adbf973116100595780637adbf973146101185780637dc0d1d0146101385780637f81e370146101705780638da5cb5b14610185578063f2fde38b146101a357600080fd5b80633cc57abe1461008b5780634d54a8ca146100ad57806353441c33146100b5578063715018a614610103575b600080fd5b34801561009757600080fd5b506100ab6100a6366004610867565b6101c3565b005b6100ab6103b3565b3480156100c157600080fd5b506100e96100d0366004610867565b6001602081905260009182526040909120805491015482565b604080519283526020830191909152015b60405180910390f35b34801561010f57600080fd5b506100ab610533565b34801561012457600080fd5b506100ab610133366004610867565b610547565b34801561014457600080fd5b50600254610158906001600160a01b031681565b6040516001600160a01b0390911681526020016100fa565b34801561017c57600080fd5b506100ab610599565b34801561019157600080fd5b506000546001600160a01b0316610158565b3480156101af57600080fd5b506100ab6101be366004610867565b6105da565b60025460408051633fabe5a360e21b815290516000926001600160a01b03169163feaf968c9160048083019260a09291908290030181865afa15801561020d573d6000803e3d6000fd5b505050506040513d601f19601f8201168201806040525081019061023191906108aa565b505050915050600081121561028d5760405162461bcd60e51b815260206004820152601960248201527f496e76616c69642070726963652066726f6d206f7261636c650000000000000060448201526064015b60405180910390fd5b6001600160a01b0382166000908152600160205260409020805482036103055760405162461bcd60e51b815260206004820152602760248201527f4c69717569646174696f6e207072696365207265616368656420666f7220746860448201526634b9903ab9b2b960c91b6064820152608401610284565b60008160010154116103525760405162461bcd60e51b81526020600482015260166024820152754e6f2062616c616e636520746f20776974686472617760501b6044820152606401610284565b600061035e8433610653565b9050336001600160a01b0316846001600160a01b03167fbbe4d27a5a8e64b566b801ba7486fd62107d0ccb0414b8caa9856d955b49e950836040516103a591815260200190565b60405180910390a350505050565b33600090815260016020526040902054156104245760405162461bcd60e51b815260206004820152602b60248201527f4c69717569646174696f6e20707269636520616c72656164792073657420666f60448201526a39103a3434b9903ab9b2b960a91b6064820152608401610284565b600034116104645760405162461bcd60e51b815260206004820152600d60248201526c139bc81d985b1d59481cd95b9d609a1b6044820152606401610284565b60025460408051633fabe5a360e21b815290516000926001600160a01b03169163feaf968c9160048083019260a09291908290030181865afa1580156104ae573d6000803e3d6000fd5b505050506040513d601f19601f820116820180604052508101906104d291906108aa565b5050336000818152600160208181526040928390208681553492018290558251868152908101919091529395509093507fc6ac3b2804efa3c84673d172e45ecf25a7eae9166fe20880ed755220e60a3b08920190505b60405180910390a250565b61053b61068a565b61054560006106e4565b565b61054f61068a565b600280546001600160a01b0319166001600160a01b0383169081179091556040517f3df77beb5db05fcdd70a30fc8adf3f83f9501b68579455adbd100b818094039490600090a250565b60006105a53333610653565b60405181815290915033907f9e032fa45cce2f05146d3bccb8ab7a58c431387fafa29d5e75640e23fd56b89490602001610528565b6105e261068a565b6001600160a01b0381166106475760405162461bcd60e51b815260206004820152602660248201527f4f776e61626c653a206e6577206f776e657220697320746865207a65726f206160448201526564647265737360d01b6064820152608401610284565b610650816106e4565b50565b6001600160a01b038216600090815260016020819052604082209081018054908390559181556106838383610734565b5092915050565b6000546001600160a01b031633146105455760405162461bcd60e51b815260206004820181905260248201527f4f776e61626c653a2063616c6c6572206973206e6f7420746865206f776e65726044820152606401610284565b600080546001600160a01b038381166001600160a01b0319831681178455604051919092169283917f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e09190a35050565b804710156107845760405162461bcd60e51b815260206004820152601d60248201527f416464726573733a20696e73756666696369656e742062616c616e63650000006044820152606401610284565b6000826001600160a01b03168260405160006040518083038185875af1925050503d80600081146107d1576040519150601f19603f3d011682016040523d82523d6000602084013e6107d6565b606091505b505090508061084d5760405162461bcd60e51b815260206004820152603a60248201527f416464726573733a20756e61626c6520746f2073656e642076616c75652c207260448201527f6563697069656e74206d617920686176652072657665727465640000000000006064820152608401610284565b505050565b6001600160a01b038116811461065057600080fd5b60006020828403121561087957600080fd5b813561088481610852565b9392505050565b805169ffffffffffffffffffff811681146108a557600080fd5b919050565b600080600080600060a086880312156108c257600080fd5b6108cb8661088b565b94506020860151935060408601519250606086015191506108ee6080870161088b565b9050929550929590935056fea2646970667358221220653887e29e4735b3819f30bbd5b463891001e02a77fe63c7e9396c2e09ee408f64736f6c63430008110033
Constructor Arguments (ABI-Encoded and is the last bytes of the Contract Creation Code above)
0000000000000000000000004e79e78fb7041b7a2f554539ceb6008dc13e1978
-----Decoded View---------------
Arg [0] : _oracle (address): 0x4E79e78fB7041b7a2f554539cEB6008dC13e1978
-----Encoded View---------------
1 Constructor Arguments found :
Arg [0] : 0000000000000000000000004e79e78fb7041b7a2f554539ceb6008dc13e1978
Loading...
Loading
Loading...
Loading
Multichain Portfolio | 26 Chains
Chain | Token | Portfolio % | Price | Amount | Value |
---|
Loading...
Loading
[ Download: CSV Export ]
[ Download: CSV Export ]
A contract address hosts a smart contract, which is a set of code stored on the blockchain that runs when predetermined conditions are met. Learn more about addresses in our Knowledge Base.