FRAX Price: $0.83 (-18.49%)

Contract

0xef583ccB0BeD4C9473178ebB228689A63BDce8A2

Overview

FRAX Balance | FXTL Balance

0 FRAX | 143,154 FXTL

FRAX Value

$0.00

Token Holdings

More Info

Private Name Tags

Multichain Info

No addresses found
Transaction Hash
Block
From
To
Add Round Data E...180934492025-03-26 14:00:09305 days ago1742997609IN
0xef583ccB...63BDce8A2
0 FRAX0.000008720.00099999
Add Round Data E...180482992025-03-25 12:55:09306 days ago1742907309IN
0xef583ccB...63BDce8A2
0 FRAX0.000002070.00099999
Add Round Data E...180130492025-03-24 17:20:09307 days ago1742836809IN
0xef583ccB...63BDce8A2
0 FRAX0.00000290.00099999
Add Round Data E...179657992025-03-23 15:05:09308 days ago1742742309IN
0xef583ccB...63BDce8A2
0 FRAX0.00000190.00099999
Add Round Data E...179200492025-03-22 13:40:09309 days ago1742650809IN
0xef583ccB...63BDce8A2
0 FRAX0.000001960.00099999
Add Round Data E...178816492025-03-21 16:20:09310 days ago1742574009IN
0xef583ccB...63BDce8A2
0 FRAX0.000002450.00099999
Add Round Data E...178815012025-03-21 16:15:13310 days ago1742573713IN
0xef583ccB...63BDce8A2
0 FRAX0.000002440.00099999
Add Round Data E...178333612025-03-20 13:30:33311 days ago1742477433IN
0xef583ccB...63BDce8A2
0 FRAX0.000002430.00099999
Add Round Data E...177916512025-03-19 14:20:13312 days ago1742394013IN
0xef583ccB...63BDce8A2
0 FRAX0.000006170.00099999
Add Round Data E...177463542025-03-18 13:10:19313 days ago1742303419IN
0xef583ccB...63BDce8A2
0 FRAX0.000002370.00099999
Add Round Data E...177123022025-03-17 18:15:15314 days ago1742235315IN
0xef583ccB...63BDce8A2
0 FRAX0.000002310.00099999
Add Round Data E...177121562025-03-17 18:10:23314 days ago1742235023IN
0xef583ccB...63BDce8A2
0 FRAX0.000002180.00099999
Add Round Data E...176587482025-03-16 12:30:07315 days ago1742128207IN
0xef583ccB...63BDce8A2
0 FRAX0.000002660.00099999
Add Round Data E...176206492025-03-15 15:20:09316 days ago1742052009IN
0xef583ccB...63BDce8A2
0 FRAX0.000002160.00099999
Add Round Data E...175753492025-03-14 14:10:09317 days ago1741961409IN
0xef583ccB...63BDce8A2
0 FRAX0.000003020.00099999
Add Round Data E...175310982025-03-13 13:35:07318 days ago1741872907IN
0xef583ccB...63BDce8A2
0 FRAX0.000002750.00099999
Add Round Data E...174897012025-03-12 14:35:13319 days ago1741790113IN
0xef583ccB...63BDce8A2
0 FRAX0.000007170.00099999
Add Round Data E...174454552025-03-11 14:00:21320 days ago1741701621IN
0xef583ccB...63BDce8A2
0 FRAX0.000006650.00099999
Add Round Data E...174453032025-03-11 13:55:17320 days ago1741701317IN
0xef583ccB...63BDce8A2
0 FRAX0.000007510.00099999
Add Round Data E...174052542025-03-10 15:40:19321 days ago1741621219IN
0xef583ccB...63BDce8A2
0 FRAX0.000012910.00099999
Add Round Data E...173590532025-03-09 14:00:17322 days ago1741528817IN
0xef583ccB...63BDce8A2
0 FRAX0.000003260.00099999
Add Round Data E...173198982025-03-08 16:15:07323 days ago1741450507IN
0xef583ccB...63BDce8A2
0 FRAX0.000002470.00099999
Add Round Data E...172711492025-03-07 13:10:09324 days ago1741353009IN
0xef583ccB...63BDce8A2
0 FRAX0.000003160.00099999
Add Round Data E...172709992025-03-07 13:05:09324 days ago1741352709IN
0xef583ccB...63BDce8A2
0 FRAX0.000002620.00099999
Add Round Data E...172294492025-03-06 14:00:09325 days ago1741269609IN
0xef583ccB...63BDce8A2
0 FRAX0.000003430.00099999
View all transactions

View more zero value Internal Transactions in Advanced View mode

Advanced mode:

Cross-Chain Transactions
Loading...
Loading

Contract Source Code Verified (Exact Match)

Contract Name:
MerkleProofPriceSourceWstEth

Compiler Version
v0.8.20+commit.a1b79de6

Optimization Enabled:
Yes with 1000000 runs

Other Settings:
shanghai EvmVersion
// SPDX-License-Identifier: ISC
pragma solidity ^0.8.19;

// ====================================================================
// |     ______                   _______                             |
// |    / _____________ __  __   / ____(_____  ____ _____  ________   |
// |   / /_  / ___/ __ `| |/_/  / /_  / / __ \/ __ `/ __ \/ ___/ _ \  |
// |  / __/ / /  / /_/ _>  <   / __/ / / / / / /_/ / / / / /__/  __/  |
// | /_/   /_/   \__,_/_/|_|  /_/   /_/_/ /_/\__,_/_/ /_/\___/\___/   |
// |                                                                  |
// ====================================================================
// ========================= MerkleProofWstEth ==========================
// ====================================================================
// Frax Finance: https://github.com/FraxFinance

// ====================================================================
import { ERC165Storage } from "src/contracts/utils/ERC165Storage.sol";
import { Timelock2Step } from "frax-std/access-control/v1/Timelock2Step.sol";
import { ITimelock2Step } from "frax-std/access-control/v1/interfaces/ITimelock2Step.sol";
import { MerkleTreeProver } from "./lib/MerkleTreeProver.sol";
import { StateProofVerifier as Verifier } from "./lib/StateProofVerifier.sol";
import { IERC4626Receiver } from "src/contracts/interfaces/IERC4626Receiver.sol";
import { IStateRootOracle } from "./interfaces/IStateRootOracle.sol";

/// @title MerkleProofPriceSource
/// @notice Proves price round data from an L1 Frax Oracle and pushes the price data to an L2 Frax Oracle
contract MerkleProofPriceSourceWstEth is ERC165Storage, Timelock2Step {
    /// @notice The address of the StateRootOracle on Layer 2
    IStateRootOracle public immutable STATE_ROOT_ORACLE;

    /// @notice The storage slot on the L1 Contract containing the token rate
    bytes32 public constant TOKEN_RATE_CACHE_SLOT = 0xbbc70db1b6c7afd11e79c0fb0051300458f1a3acb8ee9789d9b6b26c61ad9bc7;

    struct OracleConfig {
        address layer1Oracle;
        uint96 lastBlockProofed;
    }

    /// @notice Configuration linking Frax Oracles for the same asset on L1 / L2
    mapping(address layer2FraxOracle => OracleConfig layer1Config) public oracleLookup;

    /// @notice The ```constructor``` function
    /// @param _stateRootOracle Address of the L2 StateRootOracle
    /// @param _timelockAddress Address of Timelock contract on L2
    constructor(address _stateRootOracle, address _timelockAddress) Timelock2Step() {
        _setTimelock({ _newTimelock: _timelockAddress });
        _registerInterface({ interfaceId: type(ITimelock2Step).interfaceId });

        STATE_ROOT_ORACLE = IStateRootOracle(_stateRootOracle);
    }

    // ====================================================================
    // Events
    // ====================================================================

    /// @notice The ```OraclePairAdded``` event is emitted when a new Frax Oracle pair is added
    /// @param fraxOracleLayer1 The address of the layer 1 Frax Oracle
    /// @param fraxOracleLayer2 The address of the layer 2 Frax Oracle
    event OraclePairAdded(address indexed fraxOracleLayer1, address indexed fraxOracleLayer2);

    // ====================================================================
    // Configuration Setters
    // ====================================================================

    /// @dev A pair of addresses that are the Frax Oracles for the same asset on layer 1 and layer 2
    struct OraclePair {
        address layer1FraxOracle;
        address layer2FraxOracle;
    }

    /// @notice The ```addOraclePairs``` function sets an L1/L2 pair if they haven't been set already
    /// @param _oraclePairs List of OraclePairs representing the same oracle on L1 and L2
    function addOraclePairs(OraclePair[] calldata _oraclePairs) external {
        _requireTimelock();

        for (uint256 i = 0; i < _oraclePairs.length; ++i) {
            OraclePair memory _oraclePair = _oraclePairs[i];
            if (oracleLookup[_oraclePair.layer2FraxOracle].layer1Oracle != address(0)) {
                revert OraclePairAlreadySet({
                    fraxOracleLayer1: oracleLookup[_oraclePair.layer2FraxOracle].layer1Oracle,
                    fraxOracleLayer2: _oraclePair.layer2FraxOracle
                });
            }
            oracleLookup[_oraclePair.layer2FraxOracle].layer1Oracle = _oraclePair.layer1FraxOracle;
            emit OraclePairAdded({
                fraxOracleLayer1: _oraclePair.layer1FraxOracle,
                fraxOracleLayer2: _oraclePair.layer2FraxOracle
            });
        }
    }

    // ====================================================================
    // Proof / Add Price Function
    // ====================================================================

    function _fetchAndProofWstEthRate(
        address _balancerPoolAddress,
        uint96 _blockNumber,
        bytes[] memory _accountProofPool,
        bytes[] memory _storageProofRateCache
    ) internal view returns (uint256 rate) {
        IStateRootOracle.BlockInfo memory _blockInfo = STATE_ROOT_ORACLE.getBlockInfo(_blockNumber);
        Verifier.Account memory _accountProofPool = MerkleTreeProver.proveStorageRoot({
            stateRootHash: _blockInfo.stateRootHash,
            proofAddress: _balancerPoolAddress,
            accountProof: _accountProofPool
        });
        rate = uint256(
            MerkleTreeProver
                .proveStorageSlotValue({
                    storageRootHash: _accountProofPool.storageRoot,
                    slot: TOKEN_RATE_CACHE_SLOT,
                    storageProof: _storageProofRateCache
                })
                .value
        );

        // Current rate is stored in cache w/ 0 offset and 96 bit length
        rate = uint96(rate);
        if (rate == 0) revert MustBeGtZero();
    }

    function addRoundDataEzEth(
        IERC4626Receiver _wstEthRateOracleAddress,
        uint96 _blockNumber,
        bytes[] memory _accountProofPool,
        bytes[] memory _storageProofPool
    ) external {
        uint96 lastBlockProofed = oracleLookup[address(_wstEthRateOracleAddress)].lastBlockProofed;
        if (lastBlockProofed != 0) {
            if (_blockNumber < lastBlockProofed) revert StalePush();
        }
        // Address of the L1 oracle
        address _proofAddress = oracleLookup[address(_wstEthRateOracleAddress)].layer1Oracle;
        if (_proofAddress == address(0)) revert WrongOracleAddress();
        uint256 wstEthRate = _fetchAndProofWstEthRate(
            _proofAddress,
            _blockNumber,
            _accountProofPool,
            _storageProofPool
        );
        uint256 l1Timestamp = STATE_ROOT_ORACLE.getBlockInfo(_blockNumber).timestamp;
        _wstEthRateOracleAddress.updateWstEthRateData(_blockNumber, l1Timestamp, wstEthRate);
        oracleLookup[address(_wstEthRateOracleAddress)].lastBlockProofed = _blockNumber;
    }

    // ====================================================================
    // Errors
    // ====================================================================

    error OraclePairAlreadySet(address fraxOracleLayer1, address fraxOracleLayer2);
    error WrongOracleAddress();
    error StalePush();
    error MustBeGtZero();
}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts v4.4.1 (utils/introspection/ERC165Storage.sol)
pragma solidity ^0.8.0;

import { ERC165 } from "@openzeppelin/contracts/utils/introspection/ERC165.sol";

/**
 * @dev Storage based implementation of the {IERC165} interface.
 *
 * Contracts may inherit from this and call {_registerInterface} to declare
 * their support of an interface.
 */
abstract contract ERC165Storage is ERC165 {
    /**
     * @dev Mapping of interface ids to whether or not it's supported.
     */
    mapping(bytes4 => bool) private _supportedInterfaces;

    /**
     * @dev See {IERC165-supportsInterface}.
     */
    function supportsInterface(bytes4 interfaceId) public view virtual override returns (bool) {
        return super.supportsInterface(interfaceId) || _supportedInterfaces[interfaceId];
    }

    /**
     * @dev Registers the contract as an implementer of the interface defined by
     * `interfaceId`. Support of the actual ERC165 interface is automatic and
     * registering its interface id is not required.
     *
     * See {IERC165-supportsInterface}.
     *
     * Requirements:
     *
     * - `interfaceId` cannot be the ERC165 invalid interface (`0xffffffff`).
     */
    function _registerInterface(bytes4 interfaceId) internal virtual {
        require(interfaceId != 0xffffffff, "ERC165: invalid interface id");
        _supportedInterfaces[interfaceId] = true;
    }
}

// SPDX-License-Identifier: ISC
pragma solidity >=0.8.0;

// ====================================================================
// |     ______                   _______                             |
// |    / _____________ __  __   / ____(_____  ____ _____  ________   |
// |   / /_  / ___/ __ `| |/_/  / /_  / / __ \/ __ `/ __ \/ ___/ _ \  |
// |  / __/ / /  / /_/ _>  <   / __/ / / / / / /_/ / / / / /__/  __/  |
// | /_/   /_/   \__,_/_/|_|  /_/   /_/_/ /_/\__,_/_/ /_/\___/\___/   |
// |                                                                  |
// ====================================================================
// ========================== Timelock2Step ===========================
// ====================================================================
// Frax Finance: https://github.com/FraxFinance

// Primary Author
// Drake Evans: https://github.com/DrakeEvans

// Reviewers
// Dennis: https://github.com/denett

// ====================================================================

/// @title Timelock2Step
/// @author Drake Evans (Frax Finance) https://github.com/drakeevans
/// @dev Inspired by the OpenZeppelin's Ownable2Step contract
/// @notice  An abstract contract which contains 2-step transfer and renounce logic for a timelock address
abstract contract Timelock2Step {
    /// @notice The pending timelock address
    address public pendingTimelockAddress;

    /// @notice The current timelock address
    address public timelockAddress;

    constructor() {
        timelockAddress = msg.sender;
    }

    /// @notice Emitted when timelock is transferred
    error OnlyTimelock();

    /// @notice Emitted when pending timelock is transferred
    error OnlyPendingTimelock();

    /// @notice The ```TimelockTransferStarted``` event is emitted when the timelock transfer is initiated
    /// @param previousTimelock The address of the previous timelock
    /// @param newTimelock The address of the new timelock
    event TimelockTransferStarted(address indexed previousTimelock, address indexed newTimelock);

    /// @notice The ```TimelockTransferred``` event is emitted when the timelock transfer is completed
    /// @param previousTimelock The address of the previous timelock
    /// @param newTimelock The address of the new timelock
    event TimelockTransferred(address indexed previousTimelock, address indexed newTimelock);

    /// @notice The ```_isSenderTimelock``` function checks if msg.sender is current timelock address
    /// @return Whether or not msg.sender is current timelock address
    function _isSenderTimelock() internal view returns (bool) {
        return msg.sender == timelockAddress;
    }

    /// @notice The ```_requireTimelock``` function reverts if msg.sender is not current timelock address
    function _requireTimelock() internal view {
        if (msg.sender != timelockAddress) revert OnlyTimelock();
    }

    /// @notice The ```_isSenderPendingTimelock``` function checks if msg.sender is pending timelock address
    /// @return Whether or not msg.sender is pending timelock address
    function _isSenderPendingTimelock() internal view returns (bool) {
        return msg.sender == pendingTimelockAddress;
    }

    /// @notice The ```_requirePendingTimelock``` function reverts if msg.sender is not pending timelock address
    function _requirePendingTimelock() internal view {
        if (msg.sender != pendingTimelockAddress) revert OnlyPendingTimelock();
    }

    /// @notice The ```_transferTimelock``` function initiates the timelock transfer
    /// @dev This function is to be implemented by a public function
    /// @param _newTimelock The address of the nominated (pending) timelock
    function _transferTimelock(address _newTimelock) internal {
        pendingTimelockAddress = _newTimelock;
        emit TimelockTransferStarted(timelockAddress, _newTimelock);
    }

    /// @notice The ```_acceptTransferTimelock``` function completes the timelock transfer
    /// @dev This function is to be implemented by a public function
    function _acceptTransferTimelock() internal {
        pendingTimelockAddress = address(0);
        _setTimelock(msg.sender);
    }

    /// @notice The ```_setTimelock``` function sets the timelock address
    /// @dev This function is to be implemented by a public function
    /// @param _newTimelock The address of the new timelock
    function _setTimelock(address _newTimelock) internal {
        emit TimelockTransferred(timelockAddress, _newTimelock);
        timelockAddress = _newTimelock;
    }

    /// @notice The ```transferTimelock``` function initiates the timelock transfer
    /// @dev Must be called by the current timelock
    /// @param _newTimelock The address of the nominated (pending) timelock
    function transferTimelock(address _newTimelock) external virtual {
        _requireTimelock();
        _transferTimelock(_newTimelock);
    }

    /// @notice The ```acceptTransferTimelock``` function completes the timelock transfer
    /// @dev Must be called by the pending timelock
    function acceptTransferTimelock() external virtual {
        _requirePendingTimelock();
        _acceptTransferTimelock();
    }

    /// @notice The ```renounceTimelock``` function renounces the timelock after setting pending timelock to current timelock
    /// @dev Pending timelock must be set to current timelock before renouncing, creating a 2-step renounce process
    function renounceTimelock() external virtual {
        _requireTimelock();
        _requirePendingTimelock();
        _transferTimelock(address(0));
        _setTimelock(address(0));
    }
}

// SPDX-License-Identifier: UNLICENSED
pragma solidity >=0.8.0;

interface ITimelock2Step {
    event TimelockTransferStarted(address indexed previousTimelock, address indexed newTimelock);
    event TimelockTransferred(address indexed previousTimelock, address indexed newTimelock);

    function acceptTransferTimelock() external;

    function pendingTimelockAddress() external view returns (address);

    function renounceTimelock() external;

    function timelockAddress() external view returns (address);

    function transferTimelock(address _newTimelock) external;
}

//SPDX-License-Identifier: ISC
pragma solidity ^0.8.20;

// ====================================================================
// |     ______                   _______                             |
// |    / _____________ __  __   / ____(_____  ____ _____  ________   |
// |   / /_  / ___/ __ `| |/_/  / /_  / / __ \/ __ `/ __ \/ ___/ _ \  |
// |  / __/ / /  / /_/ _>  <   / __/ / / / / / /_/ / / / / /__/  __/  |
// | /_/   /_/   \__,_/_/|_|  /_/   /_/_/ /_/\__,_/_/ /_/\___/\___/   |
// |                                                                  |
// ====================================================================
// ========================= MerkleTreeProver =========================
// ====================================================================
// Frax Finance: https://github.com/FraxFinance

// Authors
// Jon Walch: https://github.com/jonwalch
// Dennis: https://github.com/denett

// Reviewers
// Drake Evans: https://github.com/DrakeEvans

// ====================================================================
import { RLPReader } from "rlp/RLPReader.sol";
import { StateProofVerifier as Verifier } from "./StateProofVerifier.sol";

/// @title MerkleTreeProver
/// @author Jon Walch (Frax Finance) https://github.com/jonwalch
/// @notice Helper function library for interacting with StateProofVerifier and RLPReader
library MerkleTreeProver {
    using RLPReader for bytes;
    using RLPReader for RLPReader.RLPItem;

    /// @notice The ```proveStorageRoot``` function is a helper function for StateProofVerifier.extractAccountFromProof()
    /// @param stateRootHash The hash of the state root
    /// @param proofAddress The address of the contract we're proving
    /// @param accountProof The accountProof retrieved from eth_getProof
    function proveStorageRoot(
        bytes32 stateRootHash,
        address proofAddress,
        bytes[] memory accountProof
    ) internal view returns (Verifier.Account memory accountPool) {
        RLPReader.RLPItem[] memory accountProofRlp = new RLPReader.RLPItem[](accountProof.length);
        for (uint256 i = 0; i < accountProof.length; ++i) {
            accountProofRlp[i] = accountProof[i].toRlpItem();
        }
        accountPool = Verifier.extractAccountFromProof({
            _addressHash: keccak256(abi.encodePacked(proofAddress)),
            _stateRootHash: stateRootHash,
            _proof: accountProofRlp
        });
    }

    /// @notice The ```proveStorageSlotValue``` function is a helper function for StateProofVerifier.extractSlotValueFromProof()
    /// @param storageRootHash The hash of the storage root
    /// @param slot The slot we want to prove for the contract
    /// @param storageProof The storageProof.proof retrieved from eth_getProof
    function proveStorageSlotValue(
        bytes32 storageRootHash,
        bytes32 slot,
        bytes[] memory storageProof
    ) internal view returns (Verifier.SlotValue memory slotValue) {
        RLPReader.RLPItem[] memory storageProofRlp = new RLPReader.RLPItem[](storageProof.length);
        for (uint256 i = 0; i < storageProof.length; ++i) {
            storageProofRlp[i] = storageProof[i].toRlpItem();
        }
        slotValue = Verifier.extractSlotValueFromProof({
            _slotHash: keccak256(abi.encodePacked(slot)),
            _storageRootHash: storageRootHash,
            _proof: storageProofRlp
        });
    }
}

// SPDX-License-Identifier: MIT
// Copied from https://github.com/lidofinance/curve-merkle-oracle/blob/1033b3e84142317ffd8f366b52e489d5eb49c73f/contracts/StateProofVerifier.sol
pragma solidity ^0.8.20;

import { RLPReader } from "rlp/RLPReader.sol";
import { MerklePatriciaProofVerifier } from "./MerklePatriciaProofVerifier.sol";

/**
 * @title A helper library for verification of Merkle Patricia account and state proofs.
 */
library StateProofVerifier {
    using RLPReader for RLPReader.RLPItem;
    using RLPReader for bytes;

    uint256 constant HEADER_STATE_ROOT_INDEX = 3;
    uint256 constant HEADER_NUMBER_INDEX = 8;
    uint256 constant HEADER_TIMESTAMP_INDEX = 11;

    struct BlockHeader {
        bytes32 hash;
        bytes32 stateRootHash;
        uint256 number;
        uint256 timestamp;
    }

    struct Account {
        bool exists;
        uint256 nonce;
        uint256 balance;
        bytes32 storageRoot;
        bytes32 codeHash;
    }

    struct SlotValue {
        bool exists;
        uint256 value;
    }

    /**
     * @notice Parses block header and verifies its presence onchain within the latest 256 blocks.
     * @param _headerRlpBytes RLP-encoded block header.
     */
    function verifyBlockHeader(bytes memory _headerRlpBytes) internal view returns (BlockHeader memory) {
        BlockHeader memory header = parseBlockHeader(_headerRlpBytes);
        // ensure that the block is actually in the blockchain
        require(header.hash == blockhash(header.number), "blockhash mismatch");
        return header;
    }

    /**
     * @notice Parses RLP-encoded block header.
     * @param _headerRlpBytes RLP-encoded block header.
     */
    function parseBlockHeader(bytes memory _headerRlpBytes) internal pure returns (BlockHeader memory) {
        BlockHeader memory result;
        RLPReader.RLPItem[] memory headerFields = _headerRlpBytes.toRlpItem().toList();

        require(headerFields.length > HEADER_TIMESTAMP_INDEX);

        result.stateRootHash = bytes32(headerFields[HEADER_STATE_ROOT_INDEX].toUint());
        result.number = headerFields[HEADER_NUMBER_INDEX].toUint();
        result.timestamp = headerFields[HEADER_TIMESTAMP_INDEX].toUint();
        result.hash = keccak256(_headerRlpBytes);

        return result;
    }

    /**
     * @notice Verifies Merkle Patricia proof of an account and extracts the account fields.
     *
     * @param _addressHash Keccak256 hash of the address corresponding to the account.
     * @param _stateRootHash MPT root hash of the Ethereum state trie.
     */
    function extractAccountFromProof(
        bytes32 _addressHash, // keccak256(abi.encodePacked(address))
        bytes32 _stateRootHash,
        RLPReader.RLPItem[] memory _proof
    ) internal pure returns (Account memory) {
        bytes memory acctRlpBytes = MerklePatriciaProofVerifier.extractProofValue(
            _stateRootHash,
            abi.encodePacked(_addressHash),
            _proof
        );

        Account memory account;

        if (acctRlpBytes.length == 0) {
            return account;
        }

        RLPReader.RLPItem[] memory acctFields = acctRlpBytes.toRlpItem().toList();
        require(acctFields.length == 4);

        account.exists = true;
        account.nonce = acctFields[0].toUint();
        account.balance = acctFields[1].toUint();
        account.storageRoot = bytes32(acctFields[2].toUint());
        account.codeHash = bytes32(acctFields[3].toUint());

        return account;
    }

    /**
     * @notice Verifies Merkle Patricia proof of a slot and extracts the slot's value.
     *
     * @param _slotHash Keccak256 hash of the slot position.
     * @param _storageRootHash MPT root hash of the account's storage trie.
     */
    function extractSlotValueFromProof(
        bytes32 _slotHash,
        bytes32 _storageRootHash,
        RLPReader.RLPItem[] memory _proof
    ) internal pure returns (SlotValue memory) {
        bytes memory valueRlpBytes = MerklePatriciaProofVerifier.extractProofValue(
            _storageRootHash,
            abi.encodePacked(_slotHash),
            _proof
        );

        SlotValue memory value;

        if (valueRlpBytes.length != 0) {
            value.exists = true;
            value.value = valueRlpBytes.toRlpItem().toUint();
        }

        return value;
    }
}

// SPDX-License-Identifier: ISC
pragma solidity ^0.8.19;

interface IERC4626Receiver {
    function updateErc4262VaultData(
        uint96 _l1BlockNumber,
        uint256 _totalSupply,
        uint256 _totalAssets,
        uint192 _lastRewardsAmount,
        uint32 _lastSync,
        uint32 _rewardsCycleEnd
    ) external;

    /// @notice Information about the current rewards cycle
    struct RewardsCycleData {
        uint40 cycleEnd; // Timestamp of the end of the current rewards cycle
        uint40 lastSync; // Timestamp of the last time the rewards cycle was synced
        uint216 rewardCycleAmount; // Amount of rewards to be distributed in the current cycle
    }

    function updatesFRAXData(
        uint96 _l1BlockNumber,
        uint256 _totalSupply,
        uint256 _totalAssets,
        uint256 _lastDistributionAmount,
        RewardsCycleData memory data
    ) external;

    function updateMaxDistributionPerSecond(uint96 _l1BlockNumber, uint256 maxPerSecond) external;
    function updateDaiVaultData(uint96 _l1BlockNumber, uint256 _dsr, uint256 _rho, uint256 _chi) external;

    function getPrices() external view returns (bool, uint256, uint256);

    function dsr() external view returns (uint256);
    function chi() external view returns (uint256);
    function rho() external view returns (uint256);

    function updateSUSDeVaultData(
        uint96 _l1BlockNumber,
        uint256 _totalSupply,
        uint256 _totalAssets,
        uint256 _vestingAmount,
        uint256 _lastDistributionTimestamp
    ) external;

    function updateEzEthRateData(uint96 _l1BlockNumber, uint256 _l1Timestamp, uint256 _ezEthRate) external;

    function updateFpiOracleData(
        uint96 _l1BlockNumber,
        uint256 _rampPeriod,
        uint256 _lastUpdateTime,
        uint256 _pegPriceTarget,
        uint256 _pegpriceLast
    ) external;

    function updateRsEthOracle(uint96 _l1blockNumber, uint256 _l1Timestamp, uint256 _rsEthPrice) external;

    function pricePerShare() external view returns (uint256);

    function updateWstEthRateData(uint96 _l1BlockNumber, uint256 _l1Timestamp, uint256 _wstEthRate) external;
}

// SPDX-License-Identifier: ISC
pragma solidity ^0.8.20;

interface IStateRootOracle {
    struct BlockInfo {
        bytes32 stateRootHash;
        uint40 timestamp;
    }

    function getBlockInfo(uint256 blockNumber) external view returns (BlockInfo memory _blockInfo);
}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.0.0) (utils/introspection/ERC165.sol)

pragma solidity ^0.8.20;

import {IERC165} from "./IERC165.sol";

/**
 * @dev Implementation of the {IERC165} interface.
 *
 * Contracts that want to implement ERC165 should inherit from this contract and override {supportsInterface} to check
 * for the additional interface id that will be supported. For example:
 *
 * ```solidity
 * function supportsInterface(bytes4 interfaceId) public view virtual override returns (bool) {
 *     return interfaceId == type(MyInterface).interfaceId || super.supportsInterface(interfaceId);
 * }
 * ```
 */
abstract contract ERC165 is IERC165 {
    /**
     * @dev See {IERC165-supportsInterface}.
     */
    function supportsInterface(bytes4 interfaceId) public view virtual returns (bool) {
        return interfaceId == type(IERC165).interfaceId;
    }
}

// SPDX-License-Identifier: Apache-2.0

/*
 * @author Hamdi Allam [email protected]
 * Please reach out with any questions or concerns
 */
pragma solidity >=0.5.10 <0.9.0;

library RLPReader {
    uint8 constant STRING_SHORT_START = 0x80;
    uint8 constant STRING_LONG_START = 0xb8;
    uint8 constant LIST_SHORT_START = 0xc0;
    uint8 constant LIST_LONG_START = 0xf8;
    uint8 constant WORD_SIZE = 32;

    struct RLPItem {
        uint256 len;
        uint256 memPtr;
    }

    struct Iterator {
        RLPItem item; // Item that's being iterated over.
        uint256 nextPtr; // Position of the next item in the list.
    }

    /*
     * @dev Returns the next element in the iteration. Reverts if it has not next element.
     * @param self The iterator.
     * @return The next element in the iteration.
     */
    function next(Iterator memory self) internal pure returns (RLPItem memory) {
        require(hasNext(self));

        uint256 ptr = self.nextPtr;
        uint256 itemLength = _itemLength(ptr);
        self.nextPtr = ptr + itemLength;

        return RLPItem(itemLength, ptr);
    }

    /*
     * @dev Returns true if the iteration has more elements.
     * @param self The iterator.
     * @return true if the iteration has more elements.
     */
    function hasNext(Iterator memory self) internal pure returns (bool) {
        RLPItem memory item = self.item;
        return self.nextPtr < item.memPtr + item.len;
    }

    /*
     * @param item RLP encoded bytes
     */
    function toRlpItem(bytes memory item) internal pure returns (RLPItem memory) {
        uint256 memPtr;
        assembly {
            memPtr := add(item, 0x20)
        }

        return RLPItem(item.length, memPtr);
    }

    /*
     * @dev Create an iterator. Reverts if item is not a list.
     * @param self The RLP item.
     * @return An 'Iterator' over the item.
     */
    function iterator(RLPItem memory self) internal pure returns (Iterator memory) {
        require(isList(self));

        uint256 ptr = self.memPtr + _payloadOffset(self.memPtr);
        return Iterator(self, ptr);
    }

    /*
     * @param the RLP item.
     */
    function rlpLen(RLPItem memory item) internal pure returns (uint256) {
        return item.len;
    }

    /*
     * @param the RLP item.
     * @return (memPtr, len) pair: location of the item's payload in memory.
     */
    function payloadLocation(RLPItem memory item) internal pure returns (uint256, uint256) {
        uint256 offset = _payloadOffset(item.memPtr);
        uint256 memPtr = item.memPtr + offset;
        uint256 len = item.len - offset; // data length
        return (memPtr, len);
    }

    /*
     * @param the RLP item.
     */
    function payloadLen(RLPItem memory item) internal pure returns (uint256) {
        (, uint256 len) = payloadLocation(item);
        return len;
    }

    /*
     * @param the RLP item containing the encoded list.
     */
    function toList(RLPItem memory item) internal pure returns (RLPItem[] memory) {
        require(isList(item));

        uint256 items = numItems(item);
        RLPItem[] memory result = new RLPItem[](items);

        uint256 memPtr = item.memPtr + _payloadOffset(item.memPtr);
        uint256 dataLen;
        for (uint256 i = 0; i < items; i++) {
            dataLen = _itemLength(memPtr);
            result[i] = RLPItem(dataLen, memPtr);
            memPtr = memPtr + dataLen;
        }

        return result;
    }

    // @return indicator whether encoded payload is a list. negate this function call for isData.
    function isList(RLPItem memory item) internal pure returns (bool) {
        if (item.len == 0) return false;

        uint8 byte0;
        uint256 memPtr = item.memPtr;
        assembly {
            byte0 := byte(0, mload(memPtr))
        }

        if (byte0 < LIST_SHORT_START) return false;
        return true;
    }

    /*
     * @dev A cheaper version of keccak256(toRlpBytes(item)) that avoids copying memory.
     * @return keccak256 hash of RLP encoded bytes.
     */
    function rlpBytesKeccak256(RLPItem memory item) internal pure returns (bytes32) {
        uint256 ptr = item.memPtr;
        uint256 len = item.len;
        bytes32 result;
        assembly {
            result := keccak256(ptr, len)
        }
        return result;
    }

    /*
     * @dev A cheaper version of keccak256(toBytes(item)) that avoids copying memory.
     * @return keccak256 hash of the item payload.
     */
    function payloadKeccak256(RLPItem memory item) internal pure returns (bytes32) {
        (uint256 memPtr, uint256 len) = payloadLocation(item);
        bytes32 result;
        assembly {
            result := keccak256(memPtr, len)
        }
        return result;
    }

    /** RLPItem conversions into data types **/

    // @returns raw rlp encoding in bytes
    function toRlpBytes(RLPItem memory item) internal pure returns (bytes memory) {
        bytes memory result = new bytes(item.len);
        if (result.length == 0) return result;

        uint256 ptr;
        assembly {
            ptr := add(0x20, result)
        }

        copy(item.memPtr, ptr, item.len);
        return result;
    }

    // any non-zero byte except "0x80" is considered true
    function toBoolean(RLPItem memory item) internal pure returns (bool) {
        require(item.len == 1);
        uint256 result;
        uint256 memPtr = item.memPtr;
        assembly {
            result := byte(0, mload(memPtr))
        }

        // SEE Github Issue #5.
        // Summary: Most commonly used RLP libraries (i.e Geth) will encode
        // "0" as "0x80" instead of as "0". We handle this edge case explicitly
        // here.
        if (result == 0 || result == STRING_SHORT_START) {
            return false;
        } else {
            return true;
        }
    }

    function toAddress(RLPItem memory item) internal pure returns (address) {
        // 1 byte for the length prefix
        require(item.len == 21);

        return address(uint160(toUint(item)));
    }

    function toUint(RLPItem memory item) internal pure returns (uint256) {
        require(item.len > 0 && item.len <= 33);

        (uint256 memPtr, uint256 len) = payloadLocation(item);

        uint256 result;
        assembly {
            result := mload(memPtr)

            // shift to the correct location if neccesary
            if lt(len, 32) {
                result := div(result, exp(256, sub(32, len)))
            }
        }

        return result;
    }

    // enforces 32 byte length
    function toUintStrict(RLPItem memory item) internal pure returns (uint256) {
        // one byte prefix
        require(item.len == 33);

        uint256 result;
        uint256 memPtr = item.memPtr + 1;
        assembly {
            result := mload(memPtr)
        }

        return result;
    }

    function toBytes(RLPItem memory item) internal pure returns (bytes memory) {
        require(item.len > 0);

        (uint256 memPtr, uint256 len) = payloadLocation(item);
        bytes memory result = new bytes(len);

        uint256 destPtr;
        assembly {
            destPtr := add(0x20, result)
        }

        copy(memPtr, destPtr, len);
        return result;
    }

    /*
     * Private Helpers
     */

    // @return number of payload items inside an encoded list.
    function numItems(RLPItem memory item) private pure returns (uint256) {
        if (item.len == 0) return 0;

        uint256 count = 0;
        uint256 currPtr = item.memPtr + _payloadOffset(item.memPtr);
        uint256 endPtr = item.memPtr + item.len;
        while (currPtr < endPtr) {
            currPtr = currPtr + _itemLength(currPtr); // skip over an item
            count++;
        }

        return count;
    }

    // @return entire rlp item byte length
    function _itemLength(uint256 memPtr) private pure returns (uint256) {
        uint256 itemLen;
        uint256 byte0;
        assembly {
            byte0 := byte(0, mload(memPtr))
        }

        if (byte0 < STRING_SHORT_START) {
            itemLen = 1;
        } else if (byte0 < STRING_LONG_START) {
            itemLen = byte0 - STRING_SHORT_START + 1;
        } else if (byte0 < LIST_SHORT_START) {
            assembly {
                let byteLen := sub(byte0, 0xb7) // # of bytes the actual length is
                memPtr := add(memPtr, 1) // skip over the first byte

                /* 32 byte word size */
                let dataLen := div(mload(memPtr), exp(256, sub(32, byteLen))) // right shifting to get the len
                itemLen := add(dataLen, add(byteLen, 1))
            }
        } else if (byte0 < LIST_LONG_START) {
            itemLen = byte0 - LIST_SHORT_START + 1;
        } else {
            assembly {
                let byteLen := sub(byte0, 0xf7)
                memPtr := add(memPtr, 1)

                let dataLen := div(mload(memPtr), exp(256, sub(32, byteLen))) // right shifting to the correct length
                itemLen := add(dataLen, add(byteLen, 1))
            }
        }

        return itemLen;
    }

    // @return number of bytes until the data
    function _payloadOffset(uint256 memPtr) private pure returns (uint256) {
        uint256 byte0;
        assembly {
            byte0 := byte(0, mload(memPtr))
        }

        if (byte0 < STRING_SHORT_START) {
            return 0;
        } else if (byte0 < STRING_LONG_START || (byte0 >= LIST_SHORT_START && byte0 < LIST_LONG_START)) {
            return 1;
        } else if (byte0 < LIST_SHORT_START) {
            // being explicit
            return byte0 - (STRING_LONG_START - 1) + 1;
        } else {
            return byte0 - (LIST_LONG_START - 1) + 1;
        }
    }

    /*
     * @param src Pointer to source
     * @param dest Pointer to destination
     * @param len Amount of memory to copy from the source
     */
    function copy(uint256 src, uint256 dest, uint256 len) private pure {
        if (len == 0) return;

        // copy as many word sizes as possible
        for (; len >= WORD_SIZE; len -= WORD_SIZE) {
            assembly {
                mstore(dest, mload(src))
            }

            src += WORD_SIZE;
            dest += WORD_SIZE;
        }

        if (len > 0) {
            // left over bytes. Mask is used to remove unwanted bytes from the word
            uint256 mask = 256**(WORD_SIZE - len) - 1;
            assembly {
                let srcpart := and(mload(src), not(mask)) // zero out src
                let destpart := and(mload(dest), mask) // retrieve the bytes
                mstore(dest, or(destpart, srcpart))
            }
        }
    }
}

// SPDX-License-Identifier: MIT
// Copied from https://github.com/lidofinance/curve-merkle-oracle/blob/1033b3e84142317ffd8f366b52e489d5eb49c73f/contracts/MerklePatriciaProofVerifier.sol
/**
 * Copied from https://github.com/lorenzb/proveth/blob/c74b20e/onchain/ProvethVerifier.sol
 * with minor performance and code style-related modifications.
 */
pragma solidity ^0.8.20;

import { RLPReader } from "rlp/RLPReader.sol";

library MerklePatriciaProofVerifier {
    using RLPReader for RLPReader.RLPItem;
    using RLPReader for bytes;

    /// @dev Validates a Merkle-Patricia-Trie proof.
    ///      If the proof proves the inclusion of some key-value pair in the
    ///      trie, the value is returned. Otherwise, i.e. if the proof proves
    ///      the exclusion of a key from the trie, an empty byte array is
    ///      returned.
    /// @param rootHash is the Keccak-256 hash of the root node of the MPT.
    /// @param path is the key of the node whose inclusion/exclusion we are
    ///        proving.
    /// @param stack is the stack of MPT nodes (starting with the root) that
    ///        need to be traversed during verification.
    /// @return value whose inclusion is proved or an empty byte array for
    ///         a proof of exclusion
    function extractProofValue(
        bytes32 rootHash,
        bytes memory path,
        RLPReader.RLPItem[] memory stack
    ) internal pure returns (bytes memory value) {
        bytes memory mptKey = _decodeNibbles(path, 0);
        uint256 mptKeyOffset = 0;

        bytes32 nodeHashHash;
        RLPReader.RLPItem[] memory node;

        RLPReader.RLPItem memory rlpValue;

        if (stack.length == 0) {
            // Root hash of empty Merkle-Patricia-Trie
            require(rootHash == 0x56e81f171bcc55a6ff8345e692c0f86e5b48e01b996cadc001622fb5e363b421);
            return new bytes(0);
        }

        // Traverse stack of nodes starting at root.
        for (uint256 i = 0; i < stack.length; i++) {
            // We use the fact that an rlp encoded list consists of some
            // encoding of its length plus the concatenation of its
            // *rlp-encoded* items.

            // The root node is hashed with Keccak-256 ...
            if (i == 0 && rootHash != stack[i].rlpBytesKeccak256()) {
                revert();
            }
            // ... whereas all other nodes are hashed with the MPT
            // hash function.
            if (i != 0 && nodeHashHash != _mptHashHash(stack[i])) {
                revert();
            }
            // We verified that stack[i] has the correct hash, so we
            // may safely decode it.
            node = stack[i].toList();

            if (node.length == 2) {
                // Extension or Leaf node

                bool isLeaf;
                bytes memory nodeKey;
                (isLeaf, nodeKey) = _merklePatriciaCompactDecode(node[0].toBytes());

                uint256 prefixLength = _sharedPrefixLength(mptKeyOffset, mptKey, nodeKey);
                mptKeyOffset += prefixLength;

                if (prefixLength < nodeKey.length) {
                    // Proof claims divergent extension or leaf. (Only
                    // relevant for proofs of exclusion.)
                    // An Extension/Leaf node is divergent iff it "skips" over
                    // the point at which a Branch node should have been had the
                    // excluded key been included in the trie.
                    // Example: Imagine a proof of exclusion for path [1, 4],
                    // where the current node is a Leaf node with
                    // path [1, 3, 3, 7]. For [1, 4] to be included, there
                    // should have been a Branch node at [1] with a child
                    // at 3 and a child at 4.

                    // Sanity check
                    if (i < stack.length - 1) {
                        // divergent node must come last in proof
                        revert();
                    }

                    return new bytes(0);
                }

                if (isLeaf) {
                    // Sanity check
                    if (i < stack.length - 1) {
                        // leaf node must come last in proof
                        revert();
                    }

                    if (mptKeyOffset < mptKey.length) {
                        return new bytes(0);
                    }

                    rlpValue = node[1];
                    return rlpValue.toBytes();
                } else {
                    // extension
                    // Sanity check
                    if (i == stack.length - 1) {
                        // shouldn't be at last level
                        revert();
                    }

                    if (!node[1].isList()) {
                        // rlp(child) was at least 32 bytes. node[1] contains
                        // Keccak256(rlp(child)).
                        nodeHashHash = node[1].payloadKeccak256();
                    } else {
                        // rlp(child) was less than 32 bytes. node[1] contains
                        // rlp(child).
                        nodeHashHash = node[1].rlpBytesKeccak256();
                    }
                }
            } else if (node.length == 17) {
                // Branch node

                if (mptKeyOffset != mptKey.length) {
                    // we haven't consumed the entire path, so we need to look at a child
                    uint8 nibble = uint8(mptKey[mptKeyOffset]);
                    mptKeyOffset += 1;
                    if (nibble >= 16) {
                        // each element of the path has to be a nibble
                        revert();
                    }

                    if (_isEmptyBytesequence(node[nibble])) {
                        // Sanity
                        if (i != stack.length - 1) {
                            // leaf node should be at last level
                            revert();
                        }

                        return new bytes(0);
                    } else if (!node[nibble].isList()) {
                        nodeHashHash = node[nibble].payloadKeccak256();
                    } else {
                        nodeHashHash = node[nibble].rlpBytesKeccak256();
                    }
                } else {
                    // we have consumed the entire mptKey, so we need to look at what's contained in this node.

                    // Sanity
                    if (i != stack.length - 1) {
                        // should be at last level
                        revert();
                    }

                    return node[16].toBytes();
                }
            }
        }
    }

    /// @dev Computes the hash of the Merkle-Patricia-Trie hash of the RLP item.
    ///      Merkle-Patricia-Tries use a weird "hash function" that outputs
    ///      *variable-length* hashes: If the item is shorter than 32 bytes,
    ///      the MPT hash is the item. Otherwise, the MPT hash is the
    ///      Keccak-256 hash of the item.
    ///      The easiest way to compare variable-length byte sequences is
    ///      to compare their Keccak-256 hashes.
    /// @param item The RLP item to be hashed.
    /// @return Keccak-256(MPT-hash(item))
    function _mptHashHash(RLPReader.RLPItem memory item) private pure returns (bytes32) {
        if (item.len < 32) {
            return item.rlpBytesKeccak256();
        } else {
            return keccak256(abi.encodePacked(item.rlpBytesKeccak256()));
        }
    }

    function _isEmptyBytesequence(RLPReader.RLPItem memory item) private pure returns (bool) {
        if (item.len != 1) {
            return false;
        }
        uint8 b;
        uint256 memPtr = item.memPtr;
        assembly {
            b := byte(0, mload(memPtr))
        }
        return b == 0x80; /* empty byte string */
    }

    function _merklePatriciaCompactDecode(
        bytes memory compact
    ) private pure returns (bool isLeaf, bytes memory nibbles) {
        require(compact.length > 0);
        uint256 first_nibble = (uint8(compact[0]) >> 4) & 0xF;
        uint256 skipNibbles;
        if (first_nibble == 0) {
            skipNibbles = 2;
            isLeaf = false;
        } else if (first_nibble == 1) {
            skipNibbles = 1;
            isLeaf = false;
        } else if (first_nibble == 2) {
            skipNibbles = 2;
            isLeaf = true;
        } else if (first_nibble == 3) {
            skipNibbles = 1;
            isLeaf = true;
        } else {
            // Not supposed to happen!
            revert();
        }
        return (isLeaf, _decodeNibbles(compact, skipNibbles));
    }

    function _decodeNibbles(bytes memory compact, uint256 skipNibbles) private pure returns (bytes memory nibbles) {
        require(compact.length > 0);

        uint256 length = compact.length * 2;
        require(skipNibbles <= length);
        length -= skipNibbles;

        nibbles = new bytes(length);
        uint256 nibblesLength = 0;

        for (uint256 i = skipNibbles; i < skipNibbles + length; i += 1) {
            if (i % 2 == 0) {
                nibbles[nibblesLength] = bytes1((uint8(compact[i / 2]) >> 4) & 0xF);
            } else {
                nibbles[nibblesLength] = bytes1((uint8(compact[i / 2]) >> 0) & 0xF);
            }
            nibblesLength += 1;
        }

        assert(nibblesLength == nibbles.length);
    }

    function _sharedPrefixLength(uint256 xsOffset, bytes memory xs, bytes memory ys) private pure returns (uint256) {
        uint256 i;
        for (i = 0; i + xsOffset < xs.length && i < ys.length; i++) {
            if (xs[i + xsOffset] != ys[i]) {
                return i;
            }
        }
        return i;
    }
}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.0.0) (utils/introspection/IERC165.sol)

pragma solidity ^0.8.20;

/**
 * @dev Interface of the ERC165 standard, as defined in the
 * https://eips.ethereum.org/EIPS/eip-165[EIP].
 *
 * Implementers can declare support of contract interfaces, which can then be
 * queried by others ({ERC165Checker}).
 *
 * For an implementation, see {ERC165}.
 */
interface IERC165 {
    /**
     * @dev Returns true if this contract implements the interface defined by
     * `interfaceId`. See the corresponding
     * https://eips.ethereum.org/EIPS/eip-165#how-interfaces-are-identified[EIP section]
     * to learn more about how these ids are created.
     *
     * This function call must use less than 30 000 gas.
     */
    function supportsInterface(bytes4 interfaceId) external view returns (bool);
}

Settings
{
  "remappings": [
    "ds-test/=node_modules/ds-test/src/",
    "forge-std/=node_modules/forge-std/src/",
    "frax-std/=node_modules/frax-standard-solidity/src/",
    "script/=src/script/",
    "src/=src/",
    "test/=src/test/",
    "interfaces/=src/contracts/interfaces/",
    "arbitrum/=node_modules/@arbitrum/",
    "rlp/=node_modules/solidity-rlp/contracts/",
    "@solmate/=node_modules/@rari-capital/solmate/src/",
    "@arbitrum/=node_modules/@arbitrum/",
    "@chainlink/=node_modules/@chainlink/",
    "@mean-finance/=node_modules/@mean-finance/",
    "@openzeppelin/=node_modules/@openzeppelin/",
    "@rari-capital/=node_modules/@rari-capital/",
    "@uniswap/=node_modules/@uniswap/",
    "dev-fraxswap/=node_modules/dev-fraxswap/",
    "frax-standard-solidity/=node_modules/frax-standard-solidity/",
    "prb-math/=node_modules/prb-math/",
    "solidity-bytes-utils/=node_modules/solidity-bytes-utils/",
    "solidity-rlp/=node_modules/solidity-rlp/"
  ],
  "optimizer": {
    "enabled": true,
    "runs": 1000000
  },
  "metadata": {
    "useLiteralContent": false,
    "bytecodeHash": "none",
    "appendCBOR": true
  },
  "outputSelection": {
    "*": {
      "*": [
        "evm.bytecode",
        "evm.deployedBytecode",
        "devdoc",
        "userdoc",
        "metadata",
        "abi"
      ]
    }
  },
  "evmVersion": "shanghai",
  "viaIR": false,
  "libraries": {}
}

Contract Security Audit

Contract ABI

API
[{"inputs":[{"internalType":"address","name":"_stateRootOracle","type":"address"},{"internalType":"address","name":"_timelockAddress","type":"address"}],"stateMutability":"nonpayable","type":"constructor"},{"inputs":[],"name":"MustBeGtZero","type":"error"},{"inputs":[],"name":"OnlyPendingTimelock","type":"error"},{"inputs":[],"name":"OnlyTimelock","type":"error"},{"inputs":[{"internalType":"address","name":"fraxOracleLayer1","type":"address"},{"internalType":"address","name":"fraxOracleLayer2","type":"address"}],"name":"OraclePairAlreadySet","type":"error"},{"inputs":[],"name":"StalePush","type":"error"},{"inputs":[],"name":"WrongOracleAddress","type":"error"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"fraxOracleLayer1","type":"address"},{"indexed":true,"internalType":"address","name":"fraxOracleLayer2","type":"address"}],"name":"OraclePairAdded","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"previousTimelock","type":"address"},{"indexed":true,"internalType":"address","name":"newTimelock","type":"address"}],"name":"TimelockTransferStarted","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"previousTimelock","type":"address"},{"indexed":true,"internalType":"address","name":"newTimelock","type":"address"}],"name":"TimelockTransferred","type":"event"},{"inputs":[],"name":"STATE_ROOT_ORACLE","outputs":[{"internalType":"contract IStateRootOracle","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"TOKEN_RATE_CACHE_SLOT","outputs":[{"internalType":"bytes32","name":"","type":"bytes32"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"acceptTransferTimelock","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"components":[{"internalType":"address","name":"layer1FraxOracle","type":"address"},{"internalType":"address","name":"layer2FraxOracle","type":"address"}],"internalType":"struct MerkleProofPriceSourceWstEth.OraclePair[]","name":"_oraclePairs","type":"tuple[]"}],"name":"addOraclePairs","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"contract IERC4626Receiver","name":"_wstEthRateOracleAddress","type":"address"},{"internalType":"uint96","name":"_blockNumber","type":"uint96"},{"internalType":"bytes[]","name":"_accountProofPool","type":"bytes[]"},{"internalType":"bytes[]","name":"_storageProofPool","type":"bytes[]"}],"name":"addRoundDataEzEth","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"layer2FraxOracle","type":"address"}],"name":"oracleLookup","outputs":[{"internalType":"address","name":"layer1Oracle","type":"address"},{"internalType":"uint96","name":"lastBlockProofed","type":"uint96"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"pendingTimelockAddress","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"renounceTimelock","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"bytes4","name":"interfaceId","type":"bytes4"}],"name":"supportsInterface","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"timelockAddress","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"_newTimelock","type":"address"}],"name":"transferTimelock","outputs":[],"stateMutability":"nonpayable","type":"function"}]

60a060405234801562000010575f80fd5b50604051620023863803806200238683398101604081905262000033916200016f565b600280546001600160a01b03191633179055620000508162000075565b62000062632fa3fc3160e21b620000d0565b506001600160a01b0316608052620001a5565b6002546040516001600160a01b038084169216907f31b6c5a04b069b6ec1b3cef44c4e7c1eadd721349cda9823d0b1877b3551cdc6905f90a3600280546001600160a01b0319166001600160a01b0392909216919091179055565b6001600160e01b031980821690036200012f5760405162461bcd60e51b815260206004820152601c60248201527f4552433136353a20696e76616c696420696e7465726661636520696400000000604482015260640160405180910390fd5b6001600160e01b0319165f908152602081905260409020805460ff19166001179055565b80516001600160a01b03811681146200016a575f80fd5b919050565b5f806040838503121562000181575f80fd5b6200018c8362000153565b91506200019c6020840162000153565b90509250929050565b6080516121ba620001cc5f395f81816101bf015281816104b901526109b601526121ba5ff3fe608060405234801561000f575f80fd5b50600436106100c4575f3560e01c8063728b379d1161007d578063a6d7fdf211610058578063a6d7fdf2146101e1578063edb219c0146101f4578063f6ccaad41461028a575f80fd5b8063728b379d146101725780638cc7c9b8146101855780639378ca56146101ba575f80fd5b806345014095116100ad57806345014095146101355780634bc66f321461014a5780634f8b4ae71461016a575f80fd5b806301ffc9a7146100c8578063090f3f50146100f0575b5f80fd5b6100db6100d6366004611b7c565b610292565b60405190151581526020015b60405180910390f35b6001546101109073ffffffffffffffffffffffffffffffffffffffff1681565b60405173ffffffffffffffffffffffffffffffffffffffff90911681526020016100e7565b610148610143366004611bdc565b610319565b005b6002546101109073ffffffffffffffffffffffffffffffffffffffff1681565b61014861032d565b610148610180366004611da8565b610351565b6101ac7fbbc70db1b6c7afd11e79c0fb0051300458f1a3acb8ee9789d9b6b26c61ad9bc781565b6040519081526020016100e7565b6101107f000000000000000000000000000000000000000000000000000000000000000081565b6101486101ef366004611e3c565b610627565b610251610202366004611bdc565b60036020525f908152604090205473ffffffffffffffffffffffffffffffffffffffff8116907401000000000000000000000000000000000000000090046bffffffffffffffffffffffff1682565b6040805173ffffffffffffffffffffffffffffffffffffffff90931683526bffffffffffffffffffffffff9091166020830152016100e7565b6101486107ac565b5f7f01ffc9a7000000000000000000000000000000000000000000000000000000007fffffffff000000000000000000000000000000000000000000000000000000008316148061031357507fffffffff0000000000000000000000000000000000000000000000000000000082165f9081526020819052604090205460ff165b92915050565b6103216107bc565b61032a8161080d565b50565b6103356107bc565b61033d610883565b6103465f61080d565b61034f5f6108d4565b565b73ffffffffffffffffffffffffffffffffffffffff84165f908152600360205260409020547401000000000000000000000000000000000000000090046bffffffffffffffffffffffff1680156103f857806bffffffffffffffffffffffff16846bffffffffffffffffffffffff1610156103f8576040517f011d308100000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b73ffffffffffffffffffffffffffffffffffffffff8086165f908152600360205260409020541680610456576040517f17e740e800000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b5f61046382878787610961565b6040517fbb141cf40000000000000000000000000000000000000000000000000000000081526bffffffffffffffffffffffff881660048201529091505f9073ffffffffffffffffffffffffffffffffffffffff7f0000000000000000000000000000000000000000000000000000000000000000169063bb141cf4906024016040805180830381865afa1580156104fd573d5f803e3d5ffd5b505050506040513d601f19601f820116820180604052508101906105219190611eab565b602001516040517fd1024fee0000000000000000000000000000000000000000000000000000000081526bffffffffffffffffffffffff8916600482015264ffffffffff9091166024820181905260448201849052915073ffffffffffffffffffffffffffffffffffffffff89169063d1024fee906064015f604051808303815f87803b1580156105b0575f80fd5b505af11580156105c2573d5f803e3d5ffd5b50505073ffffffffffffffffffffffffffffffffffffffff9889165f90815260036020526040902080546bffffffffffffffffffffffff9099167401000000000000000000000000000000000000000002989099169790971790975550505050505050565b61062f6107bc565b5f5b818110156107a7575f83838381811061064c5761064c611eea565b9050604002018036038101906106629190611f17565b60208082015173ffffffffffffffffffffffffffffffffffffffff9081165f90815260039092526040909120549192501615610708576020818101805173ffffffffffffffffffffffffffffffffffffffff9081165f908152600390935260409283902054915183517f729d6d9c000000000000000000000000000000000000000000000000000000008152928216600484015216602482015290519081900360440190fd5b80516020808301805173ffffffffffffffffffffffffffffffffffffffff9081165f9081526003909352604080842080547fffffffffffffffffffffffff0000000000000000000000000000000000000000169583169590951790945590518451935190821693909116917fc662d74d8469d456352095edb1ed6a69f64c66ace9fa3598de77edfccfad12a291a3506107a081611f77565b9050610631565b505050565b6107b4610883565b61034f610aba565b60025473ffffffffffffffffffffffffffffffffffffffff16331461034f576040517f1c0be90a00000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b600180547fffffffffffffffffffffffff00000000000000000000000000000000000000001673ffffffffffffffffffffffffffffffffffffffff838116918217909255600254604051919216907f162998b90abc2507f3953aa797827b03a14c42dbd9a35f09feaf02e0d592773a905f90a350565b60015473ffffffffffffffffffffffffffffffffffffffff16331461034f576040517ff5c49e6400000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b60025460405173ffffffffffffffffffffffffffffffffffffffff8084169216907f31b6c5a04b069b6ec1b3cef44c4e7c1eadd721349cda9823d0b1877b3551cdc6905f90a3600280547fffffffffffffffffffffffff00000000000000000000000000000000000000001673ffffffffffffffffffffffffffffffffffffffff92909216919091179055565b6040517fbb141cf40000000000000000000000000000000000000000000000000000000081526bffffffffffffffffffffffff841660048201525f90819073ffffffffffffffffffffffffffffffffffffffff7f0000000000000000000000000000000000000000000000000000000000000000169063bb141cf4906024016040805180830381865afa1580156109fa573d5f803e3d5ffd5b505050506040513d601f19601f82011682018060405250810190610a1e9190611eab565b90505f610a2f825f01518887610aeb565b9050610a6281606001517fbbc70db1b6c7afd11e79c0fb0051300458f1a3acb8ee9789d9b6b26c61ad9bc75f1b86610c56565b602001516bffffffffffffffffffffffff1692505f839003610ab0576040517fac34915700000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b5050949350505050565b600180547fffffffffffffffffffffffff000000000000000000000000000000000000000016905561034f336108d4565b6040805160a0810182525f808252602082018190529181018290526060810182905260808101919091525f825167ffffffffffffffff811115610b3057610b30611bf7565b604051908082528060200260200182016040528015610b7457816020015b604080518082019091525f8082526020820152815260200190600190039081610b4e5790505b5090505f5b8351811015610bf957610bcb848281518110610b9757610b97611eea565b60200260200101516040805180820182525f8082526020918201528151808301909252825182529182019181019190915290565b828281518110610bdd57610bdd611eea565b602002602001018190525080610bf290611f77565b9050610b79565b506040517fffffffffffffffffffffffffffffffffffffffff000000000000000000000000606086901b166020820152610c4d90603401604051602081830303815290604052805190602001208683610d4d565b95945050505050565b604080518082019091525f80825260208201525f825167ffffffffffffffff811115610c8457610c84611bf7565b604051908082528060200260200182016040528015610cc857816020015b604080518082019091525f8082526020820152815260200190600190039081610ca25790505b5090505f5b8351811015610d1957610ceb848281518110610b9757610b97611eea565b828281518110610cfd57610cfd611eea565b602002602001018190525080610d1290611f77565b9050610ccd565b50610c4d84604051602001610d3091815260200190565b604051602081830303815290604052805190602001208683610ebc565b6040805160a0810182525f808252602082018190529181018290526060810182905260808101919091525f610da48486604051602001610d8f91815260200190565b60405160208183030381529060405285610f45565b6040805160a0810182525f8082526020820181905291810182905260608101829052608081019190915290915081515f03610de2579150610eb59050565b5f610e1b610e16846040805180820182525f8082526020918201528151808301909252825182529182019181019190915290565b611369565b90508051600414610e2a575f80fd5b600182528051610e519082905f90610e4457610e44611eea565b6020026020010151611479565b60208301528051610e6f9082906001908110610e4457610e44611eea565b60408301528051610e8d9082906002908110610e4457610e44611eea565b60608301528051610eab9082906003908110610e4457610e44611eea565b6080830152509150505b9392505050565b604080518082019091525f80825260208201525f610ee78486604051602001610d8f91815260200190565b604080518082019091525f8082526020820152909150815115610c4d57600181526040805180820182525f80825260209182015281518083019092528351825280840190820152610f3790611479565b602082015295945050505050565b60605f610f52845f6114c4565b90505f806060610f7360405180604001604052805f81526020015f81525090565b86515f03610fc1577f56e81f171bcc55a6ff8345e692c0f86e5b48e01b996cadc001622fb5e363b4218914610fa6575f80fd5b5050604080515f8152602081019091529350610eb592505050565b5f5b875181101561135c57801580156110025750610ffe888281518110610fea57610fea611eea565b602002602001015160208101519051902090565b8a14155b1561100b575f80fd5b801580159061103b575061103788828151811061102a5761102a611eea565b6020026020010151611691565b8414155b15611044575f80fd5b61106688828151811061105957611059611eea565b6020026020010151611369565b9250825160020361120a575f606061109e611099865f8151811061108c5761108c611eea565b60200260200101516116e4565b61175f565b90925090505f6110af888a846117f2565b90506110bb8189611fae565b9750815181101561111c5760018b516110d49190611fc1565b8410156110df575f80fd5b5f5b6040519080825280601f01601f19166020018201604052801561110b576020820181803683370190505b509950505050505050505050610eb5565b82156111805760018b516111309190611fc1565b84101561113b575f80fd5b885188101561114a575f6110e1565b8560018151811061115d5761115d611eea565b60200260200101519450611170856116e4565b9950505050505050505050610eb5565b60018b5161118e9190611fc1565b8403611198575f80fd5b6111bb866001815181106111ae576111ae611eea565b60200260200101516118ac565b6111e9576111e2866001815181106111d5576111d5611eea565b60200260200101516118e3565b9650611202565b6111ff86600181518110610fea57610fea611eea565b96505b50505061134a565b825160110361134a578551851461130f575f86868151811061122e5761122e611eea565b016020015160f81c9050611243600187611fae565b955060108160ff1610611254575f80fd5b611279848260ff168151811061126c5761126c611eea565b60200260200101516118f9565b156112b3576001895161128c9190611fc1565b8214611296575f80fd5b5050604080515f8152602081019091529550610eb5945050505050565b6112cb848260ff16815181106111ae576111ae611eea565b6112ee576112e7848260ff16815181106111d5576111d5611eea565b9450611309565b611306848260ff1681518110610fea57610fea611eea565b94505b5061134a565b6001885161131d9190611fc1565b8114611327575f80fd5b61133d8360108151811061108c5761108c611eea565b9650505050505050610eb5565b8061135481611f77565b915050610fc3565b5050505050509392505050565b6060611374826118ac565b61137c575f80fd5b5f61138683611919565b90505f8167ffffffffffffffff8111156113a2576113a2611bf7565b6040519080825280602002602001820160405280156113e657816020015b604080518082019091525f80825260208201528152602001906001900390816113c05790505b5090505f6113f78560200151611999565b85602001516114069190611fae565b90505f805b8481101561146e5761141c83611a12565b915060405180604001604052808381526020018481525084828151811061144557611445611eea565b602090810291909101015261145a8284611fae565b92508061146681611f77565b91505061140b565b509195945050505050565b80515f901580159061148d57508151602110155b611495575f80fd5b5f806114a084611aba565b8151919350915060208210156114bc5760208290036101000a90045b949350505050565b60605f8351116114d2575f80fd5b5f835160026114e19190611fd4565b9050808311156114ef575f80fd5b6114f98382611fc1565b90508067ffffffffffffffff81111561151457611514611bf7565b6040519080825280601f01601f19166020018201604052801561153e576020820181803683370190505b5091505f835b61154e8386611fae565b81101561167857611560600282612018565b5f036115e25760048661157460028461202b565b8151811061158457611584611eea565b602001015160f81c60f81b60f81c60ff16901c600f1660f81b8483815181106115af576115af611eea565b60200101907effffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff191690815f1a905350611659565b5f866115ef60028461202b565b815181106115ff576115ff611eea565b602001015160f81c60f81b60f81c60ff16901c600f1660f81b84838151811061162a5761162a611eea565b60200101907effffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff191690815f1a9053505b611664600183611fae565b9150611671600182611fae565b9050611544565b50825181146116895761168961203e565b505092915050565b5f6020825f015110156116ac57602082015182519020610313565b6020820151825190206040516020016116c791815260200190565b604051602081830303815290604052805190602001209050919050565b80516060906116f1575f80fd5b5f806116fc84611aba565b915091505f8167ffffffffffffffff81111561171a5761171a611bf7565b6040519080825280601f01601f191660200182016040528015611744576020820181803683370190505b50905060208101611756848285611afc565b50949350505050565b5f60605f83511161176e575f80fd5b5f6004845f8151811061178357611783611eea565b60209101015160f81c901c600f1690505f8181036117a657505f925060026117dc565b816001036117b957505f925060016117dc565b816002036117cd57506001925060026117dc565b816003036100c4575060019250825b836117e786836114c4565b935093505050915091565b5f805b83516118018683611fae565b10801561180e5750825181105b156114bc5782818151811061182557611825611eea565b01602001517fff0000000000000000000000000000000000000000000000000000000000000016846118578784611fae565b8151811061186757611867611eea565b01602001517fff00000000000000000000000000000000000000000000000000000000000000161461189a579050610eb5565b806118a481611f77565b9150506117f5565b80515f9081036118bd57505f919050565b602082015180515f1a9060c08210156118d957505f9392505050565b5060019392505050565b5f805f6118ef84611aba565b9020949350505050565b80515f9060011461190b57505f919050565b5060200151515f1a60801490565b80515f90810361192a57505f919050565b5f806119398460200151611999565b84602001516119489190611fae565b90505f845f0151856020015161195e9190611fae565b90505b808210156119905761197282611a12565b61197c9083611fae565b91508261198881611f77565b935050611961565b50909392505050565b80515f90811a60808110156119b057505f92915050565b60b88110806119cb575060c081108015906119cb575060f881105b156119d95750600192915050565b60c0811015611a06576119ee600160b861206b565b6119fb9060ff1682611fc1565b610eb5906001611fae565b6119ee600160f861206b565b80515f908190811a6080811015611a2c5760019150611ab3565b60b8811015611a5257611a40608082611fc1565b611a4b906001611fae565b9150611ab3565b60c0811015611a7f5760b78103600185019450806020036101000a85510460018201810193505050611ab3565b60f8811015611a9357611a4060c082611fc1565b60f78103600185019450806020036101000a855104600182018101935050505b5092915050565b5f805f611aca8460200151611999565b90505f818560200151611add9190611fae565b90505f82865f0151611aef9190611fc1565b9196919550909350505050565b805f03611b0857505050565b60208110611b405782518252611b1f602084611fae565b9250611b2c602083611fae565b9150611b39602082611fc1565b9050611b08565b80156107a7575f6001611b54836020611fc1565b611b60906101006121a2565b611b6a9190611fc1565b84518451821691191617835250505050565b5f60208284031215611b8c575f80fd5b81357fffffffff0000000000000000000000000000000000000000000000000000000081168114610eb5575f80fd5b73ffffffffffffffffffffffffffffffffffffffff8116811461032a575f80fd5b5f60208284031215611bec575f80fd5b8135610eb581611bbb565b7f4e487b71000000000000000000000000000000000000000000000000000000005f52604160045260245ffd5b6040805190810167ffffffffffffffff81118282101715611c4757611c47611bf7565b60405290565b604051601f82017fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffe016810167ffffffffffffffff81118282101715611c9457611c94611bf7565b604052919050565b5f601f8381840112611cac575f80fd5b8235602067ffffffffffffffff80831115611cc957611cc9611bf7565b8260051b611cd8838201611c4d565b9384528681018301938381019089861115611cf1575f80fd5b84890192505b85831015611d9b57823584811115611d0e575f8081fd5b8901603f81018b13611d1f575f8081fd5b85810135604086821115611d3557611d35611bf7565b611d64887fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffe08c85011601611c4d565b8281528d82848601011115611d78575f8081fd5b828285018a8301375f928101890192909252508352509184019190840190611cf7565b9998505050505050505050565b5f805f8060808587031215611dbb575f80fd5b8435611dc681611bbb565b935060208501356bffffffffffffffffffffffff81168114611de6575f80fd5b9250604085013567ffffffffffffffff80821115611e02575f80fd5b611e0e88838901611c9c565b93506060870135915080821115611e23575f80fd5b50611e3087828801611c9c565b91505092959194509250565b5f8060208385031215611e4d575f80fd5b823567ffffffffffffffff80821115611e64575f80fd5b818501915085601f830112611e77575f80fd5b813581811115611e85575f80fd5b8660208260061b8501011115611e99575f80fd5b60209290920196919550909350505050565b5f60408284031215611ebb575f80fd5b611ec3611c24565b82518152602083015164ffffffffff81168114611ede575f80fd5b60208201529392505050565b7f4e487b71000000000000000000000000000000000000000000000000000000005f52603260045260245ffd5b5f60408284031215611f27575f80fd5b611f2f611c24565b8235611f3a81611bbb565b81526020830135611ede81611bbb565b7f4e487b71000000000000000000000000000000000000000000000000000000005f52601160045260245ffd5b5f7fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff8203611fa757611fa7611f4a565b5060010190565b8082018082111561031357610313611f4a565b8181038181111561031357610313611f4a565b808202811582820484141761031357610313611f4a565b7f4e487b71000000000000000000000000000000000000000000000000000000005f52601260045260245ffd5b5f8261202657612026611feb565b500690565b5f8261203957612039611feb565b500490565b7f4e487b71000000000000000000000000000000000000000000000000000000005f52600160045260245ffd5b60ff828116828216039081111561031357610313611f4a565b600181815b808511156120dd57817fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff048211156120c3576120c3611f4a565b808516156120d057918102915b93841c9390800290612089565b509250929050565b5f826120f357506001610313565b816120ff57505f610313565b8160018114612115576002811461211f5761213b565b6001915050610313565b60ff84111561213057612130611f4a565b50506001821b610313565b5060208310610133831016604e8410600b841016171561215e575081810a610313565b6121688383612084565b807fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff0482111561219a5761219a611f4a565b029392505050565b5f610eb583836120e556fea164736f6c6343000814000a000000000000000000000000ed403d48e2bc946438b5686aa1ad65056ccf951200000000000000000000000031562ae726afebe25417df01bedc72ef489f45b3

Deployed Bytecode

0x608060405234801561000f575f80fd5b50600436106100c4575f3560e01c8063728b379d1161007d578063a6d7fdf211610058578063a6d7fdf2146101e1578063edb219c0146101f4578063f6ccaad41461028a575f80fd5b8063728b379d146101725780638cc7c9b8146101855780639378ca56146101ba575f80fd5b806345014095116100ad57806345014095146101355780634bc66f321461014a5780634f8b4ae71461016a575f80fd5b806301ffc9a7146100c8578063090f3f50146100f0575b5f80fd5b6100db6100d6366004611b7c565b610292565b60405190151581526020015b60405180910390f35b6001546101109073ffffffffffffffffffffffffffffffffffffffff1681565b60405173ffffffffffffffffffffffffffffffffffffffff90911681526020016100e7565b610148610143366004611bdc565b610319565b005b6002546101109073ffffffffffffffffffffffffffffffffffffffff1681565b61014861032d565b610148610180366004611da8565b610351565b6101ac7fbbc70db1b6c7afd11e79c0fb0051300458f1a3acb8ee9789d9b6b26c61ad9bc781565b6040519081526020016100e7565b6101107f000000000000000000000000ed403d48e2bc946438b5686aa1ad65056ccf951281565b6101486101ef366004611e3c565b610627565b610251610202366004611bdc565b60036020525f908152604090205473ffffffffffffffffffffffffffffffffffffffff8116907401000000000000000000000000000000000000000090046bffffffffffffffffffffffff1682565b6040805173ffffffffffffffffffffffffffffffffffffffff90931683526bffffffffffffffffffffffff9091166020830152016100e7565b6101486107ac565b5f7f01ffc9a7000000000000000000000000000000000000000000000000000000007fffffffff000000000000000000000000000000000000000000000000000000008316148061031357507fffffffff0000000000000000000000000000000000000000000000000000000082165f9081526020819052604090205460ff165b92915050565b6103216107bc565b61032a8161080d565b50565b6103356107bc565b61033d610883565b6103465f61080d565b61034f5f6108d4565b565b73ffffffffffffffffffffffffffffffffffffffff84165f908152600360205260409020547401000000000000000000000000000000000000000090046bffffffffffffffffffffffff1680156103f857806bffffffffffffffffffffffff16846bffffffffffffffffffffffff1610156103f8576040517f011d308100000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b73ffffffffffffffffffffffffffffffffffffffff8086165f908152600360205260409020541680610456576040517f17e740e800000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b5f61046382878787610961565b6040517fbb141cf40000000000000000000000000000000000000000000000000000000081526bffffffffffffffffffffffff881660048201529091505f9073ffffffffffffffffffffffffffffffffffffffff7f000000000000000000000000ed403d48e2bc946438b5686aa1ad65056ccf9512169063bb141cf4906024016040805180830381865afa1580156104fd573d5f803e3d5ffd5b505050506040513d601f19601f820116820180604052508101906105219190611eab565b602001516040517fd1024fee0000000000000000000000000000000000000000000000000000000081526bffffffffffffffffffffffff8916600482015264ffffffffff9091166024820181905260448201849052915073ffffffffffffffffffffffffffffffffffffffff89169063d1024fee906064015f604051808303815f87803b1580156105b0575f80fd5b505af11580156105c2573d5f803e3d5ffd5b50505073ffffffffffffffffffffffffffffffffffffffff9889165f90815260036020526040902080546bffffffffffffffffffffffff9099167401000000000000000000000000000000000000000002989099169790971790975550505050505050565b61062f6107bc565b5f5b818110156107a7575f83838381811061064c5761064c611eea565b9050604002018036038101906106629190611f17565b60208082015173ffffffffffffffffffffffffffffffffffffffff9081165f90815260039092526040909120549192501615610708576020818101805173ffffffffffffffffffffffffffffffffffffffff9081165f908152600390935260409283902054915183517f729d6d9c000000000000000000000000000000000000000000000000000000008152928216600484015216602482015290519081900360440190fd5b80516020808301805173ffffffffffffffffffffffffffffffffffffffff9081165f9081526003909352604080842080547fffffffffffffffffffffffff0000000000000000000000000000000000000000169583169590951790945590518451935190821693909116917fc662d74d8469d456352095edb1ed6a69f64c66ace9fa3598de77edfccfad12a291a3506107a081611f77565b9050610631565b505050565b6107b4610883565b61034f610aba565b60025473ffffffffffffffffffffffffffffffffffffffff16331461034f576040517f1c0be90a00000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b600180547fffffffffffffffffffffffff00000000000000000000000000000000000000001673ffffffffffffffffffffffffffffffffffffffff838116918217909255600254604051919216907f162998b90abc2507f3953aa797827b03a14c42dbd9a35f09feaf02e0d592773a905f90a350565b60015473ffffffffffffffffffffffffffffffffffffffff16331461034f576040517ff5c49e6400000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b60025460405173ffffffffffffffffffffffffffffffffffffffff8084169216907f31b6c5a04b069b6ec1b3cef44c4e7c1eadd721349cda9823d0b1877b3551cdc6905f90a3600280547fffffffffffffffffffffffff00000000000000000000000000000000000000001673ffffffffffffffffffffffffffffffffffffffff92909216919091179055565b6040517fbb141cf40000000000000000000000000000000000000000000000000000000081526bffffffffffffffffffffffff841660048201525f90819073ffffffffffffffffffffffffffffffffffffffff7f000000000000000000000000ed403d48e2bc946438b5686aa1ad65056ccf9512169063bb141cf4906024016040805180830381865afa1580156109fa573d5f803e3d5ffd5b505050506040513d601f19601f82011682018060405250810190610a1e9190611eab565b90505f610a2f825f01518887610aeb565b9050610a6281606001517fbbc70db1b6c7afd11e79c0fb0051300458f1a3acb8ee9789d9b6b26c61ad9bc75f1b86610c56565b602001516bffffffffffffffffffffffff1692505f839003610ab0576040517fac34915700000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b5050949350505050565b600180547fffffffffffffffffffffffff000000000000000000000000000000000000000016905561034f336108d4565b6040805160a0810182525f808252602082018190529181018290526060810182905260808101919091525f825167ffffffffffffffff811115610b3057610b30611bf7565b604051908082528060200260200182016040528015610b7457816020015b604080518082019091525f8082526020820152815260200190600190039081610b4e5790505b5090505f5b8351811015610bf957610bcb848281518110610b9757610b97611eea565b60200260200101516040805180820182525f8082526020918201528151808301909252825182529182019181019190915290565b828281518110610bdd57610bdd611eea565b602002602001018190525080610bf290611f77565b9050610b79565b506040517fffffffffffffffffffffffffffffffffffffffff000000000000000000000000606086901b166020820152610c4d90603401604051602081830303815290604052805190602001208683610d4d565b95945050505050565b604080518082019091525f80825260208201525f825167ffffffffffffffff811115610c8457610c84611bf7565b604051908082528060200260200182016040528015610cc857816020015b604080518082019091525f8082526020820152815260200190600190039081610ca25790505b5090505f5b8351811015610d1957610ceb848281518110610b9757610b97611eea565b828281518110610cfd57610cfd611eea565b602002602001018190525080610d1290611f77565b9050610ccd565b50610c4d84604051602001610d3091815260200190565b604051602081830303815290604052805190602001208683610ebc565b6040805160a0810182525f808252602082018190529181018290526060810182905260808101919091525f610da48486604051602001610d8f91815260200190565b60405160208183030381529060405285610f45565b6040805160a0810182525f8082526020820181905291810182905260608101829052608081019190915290915081515f03610de2579150610eb59050565b5f610e1b610e16846040805180820182525f8082526020918201528151808301909252825182529182019181019190915290565b611369565b90508051600414610e2a575f80fd5b600182528051610e519082905f90610e4457610e44611eea565b6020026020010151611479565b60208301528051610e6f9082906001908110610e4457610e44611eea565b60408301528051610e8d9082906002908110610e4457610e44611eea565b60608301528051610eab9082906003908110610e4457610e44611eea565b6080830152509150505b9392505050565b604080518082019091525f80825260208201525f610ee78486604051602001610d8f91815260200190565b604080518082019091525f8082526020820152909150815115610c4d57600181526040805180820182525f80825260209182015281518083019092528351825280840190820152610f3790611479565b602082015295945050505050565b60605f610f52845f6114c4565b90505f806060610f7360405180604001604052805f81526020015f81525090565b86515f03610fc1577f56e81f171bcc55a6ff8345e692c0f86e5b48e01b996cadc001622fb5e363b4218914610fa6575f80fd5b5050604080515f8152602081019091529350610eb592505050565b5f5b875181101561135c57801580156110025750610ffe888281518110610fea57610fea611eea565b602002602001015160208101519051902090565b8a14155b1561100b575f80fd5b801580159061103b575061103788828151811061102a5761102a611eea565b6020026020010151611691565b8414155b15611044575f80fd5b61106688828151811061105957611059611eea565b6020026020010151611369565b9250825160020361120a575f606061109e611099865f8151811061108c5761108c611eea565b60200260200101516116e4565b61175f565b90925090505f6110af888a846117f2565b90506110bb8189611fae565b9750815181101561111c5760018b516110d49190611fc1565b8410156110df575f80fd5b5f5b6040519080825280601f01601f19166020018201604052801561110b576020820181803683370190505b509950505050505050505050610eb5565b82156111805760018b516111309190611fc1565b84101561113b575f80fd5b885188101561114a575f6110e1565b8560018151811061115d5761115d611eea565b60200260200101519450611170856116e4565b9950505050505050505050610eb5565b60018b5161118e9190611fc1565b8403611198575f80fd5b6111bb866001815181106111ae576111ae611eea565b60200260200101516118ac565b6111e9576111e2866001815181106111d5576111d5611eea565b60200260200101516118e3565b9650611202565b6111ff86600181518110610fea57610fea611eea565b96505b50505061134a565b825160110361134a578551851461130f575f86868151811061122e5761122e611eea565b016020015160f81c9050611243600187611fae565b955060108160ff1610611254575f80fd5b611279848260ff168151811061126c5761126c611eea565b60200260200101516118f9565b156112b3576001895161128c9190611fc1565b8214611296575f80fd5b5050604080515f8152602081019091529550610eb5945050505050565b6112cb848260ff16815181106111ae576111ae611eea565b6112ee576112e7848260ff16815181106111d5576111d5611eea565b9450611309565b611306848260ff1681518110610fea57610fea611eea565b94505b5061134a565b6001885161131d9190611fc1565b8114611327575f80fd5b61133d8360108151811061108c5761108c611eea565b9650505050505050610eb5565b8061135481611f77565b915050610fc3565b5050505050509392505050565b6060611374826118ac565b61137c575f80fd5b5f61138683611919565b90505f8167ffffffffffffffff8111156113a2576113a2611bf7565b6040519080825280602002602001820160405280156113e657816020015b604080518082019091525f80825260208201528152602001906001900390816113c05790505b5090505f6113f78560200151611999565b85602001516114069190611fae565b90505f805b8481101561146e5761141c83611a12565b915060405180604001604052808381526020018481525084828151811061144557611445611eea565b602090810291909101015261145a8284611fae565b92508061146681611f77565b91505061140b565b509195945050505050565b80515f901580159061148d57508151602110155b611495575f80fd5b5f806114a084611aba565b8151919350915060208210156114bc5760208290036101000a90045b949350505050565b60605f8351116114d2575f80fd5b5f835160026114e19190611fd4565b9050808311156114ef575f80fd5b6114f98382611fc1565b90508067ffffffffffffffff81111561151457611514611bf7565b6040519080825280601f01601f19166020018201604052801561153e576020820181803683370190505b5091505f835b61154e8386611fae565b81101561167857611560600282612018565b5f036115e25760048661157460028461202b565b8151811061158457611584611eea565b602001015160f81c60f81b60f81c60ff16901c600f1660f81b8483815181106115af576115af611eea565b60200101907effffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff191690815f1a905350611659565b5f866115ef60028461202b565b815181106115ff576115ff611eea565b602001015160f81c60f81b60f81c60ff16901c600f1660f81b84838151811061162a5761162a611eea565b60200101907effffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff191690815f1a9053505b611664600183611fae565b9150611671600182611fae565b9050611544565b50825181146116895761168961203e565b505092915050565b5f6020825f015110156116ac57602082015182519020610313565b6020820151825190206040516020016116c791815260200190565b604051602081830303815290604052805190602001209050919050565b80516060906116f1575f80fd5b5f806116fc84611aba565b915091505f8167ffffffffffffffff81111561171a5761171a611bf7565b6040519080825280601f01601f191660200182016040528015611744576020820181803683370190505b50905060208101611756848285611afc565b50949350505050565b5f60605f83511161176e575f80fd5b5f6004845f8151811061178357611783611eea565b60209101015160f81c901c600f1690505f8181036117a657505f925060026117dc565b816001036117b957505f925060016117dc565b816002036117cd57506001925060026117dc565b816003036100c4575060019250825b836117e786836114c4565b935093505050915091565b5f805b83516118018683611fae565b10801561180e5750825181105b156114bc5782818151811061182557611825611eea565b01602001517fff0000000000000000000000000000000000000000000000000000000000000016846118578784611fae565b8151811061186757611867611eea565b01602001517fff00000000000000000000000000000000000000000000000000000000000000161461189a579050610eb5565b806118a481611f77565b9150506117f5565b80515f9081036118bd57505f919050565b602082015180515f1a9060c08210156118d957505f9392505050565b5060019392505050565b5f805f6118ef84611aba565b9020949350505050565b80515f9060011461190b57505f919050565b5060200151515f1a60801490565b80515f90810361192a57505f919050565b5f806119398460200151611999565b84602001516119489190611fae565b90505f845f0151856020015161195e9190611fae565b90505b808210156119905761197282611a12565b61197c9083611fae565b91508261198881611f77565b935050611961565b50909392505050565b80515f90811a60808110156119b057505f92915050565b60b88110806119cb575060c081108015906119cb575060f881105b156119d95750600192915050565b60c0811015611a06576119ee600160b861206b565b6119fb9060ff1682611fc1565b610eb5906001611fae565b6119ee600160f861206b565b80515f908190811a6080811015611a2c5760019150611ab3565b60b8811015611a5257611a40608082611fc1565b611a4b906001611fae565b9150611ab3565b60c0811015611a7f5760b78103600185019450806020036101000a85510460018201810193505050611ab3565b60f8811015611a9357611a4060c082611fc1565b60f78103600185019450806020036101000a855104600182018101935050505b5092915050565b5f805f611aca8460200151611999565b90505f818560200151611add9190611fae565b90505f82865f0151611aef9190611fc1565b9196919550909350505050565b805f03611b0857505050565b60208110611b405782518252611b1f602084611fae565b9250611b2c602083611fae565b9150611b39602082611fc1565b9050611b08565b80156107a7575f6001611b54836020611fc1565b611b60906101006121a2565b611b6a9190611fc1565b84518451821691191617835250505050565b5f60208284031215611b8c575f80fd5b81357fffffffff0000000000000000000000000000000000000000000000000000000081168114610eb5575f80fd5b73ffffffffffffffffffffffffffffffffffffffff8116811461032a575f80fd5b5f60208284031215611bec575f80fd5b8135610eb581611bbb565b7f4e487b71000000000000000000000000000000000000000000000000000000005f52604160045260245ffd5b6040805190810167ffffffffffffffff81118282101715611c4757611c47611bf7565b60405290565b604051601f82017fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffe016810167ffffffffffffffff81118282101715611c9457611c94611bf7565b604052919050565b5f601f8381840112611cac575f80fd5b8235602067ffffffffffffffff80831115611cc957611cc9611bf7565b8260051b611cd8838201611c4d565b9384528681018301938381019089861115611cf1575f80fd5b84890192505b85831015611d9b57823584811115611d0e575f8081fd5b8901603f81018b13611d1f575f8081fd5b85810135604086821115611d3557611d35611bf7565b611d64887fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffe08c85011601611c4d565b8281528d82848601011115611d78575f8081fd5b828285018a8301375f928101890192909252508352509184019190840190611cf7565b9998505050505050505050565b5f805f8060808587031215611dbb575f80fd5b8435611dc681611bbb565b935060208501356bffffffffffffffffffffffff81168114611de6575f80fd5b9250604085013567ffffffffffffffff80821115611e02575f80fd5b611e0e88838901611c9c565b93506060870135915080821115611e23575f80fd5b50611e3087828801611c9c565b91505092959194509250565b5f8060208385031215611e4d575f80fd5b823567ffffffffffffffff80821115611e64575f80fd5b818501915085601f830112611e77575f80fd5b813581811115611e85575f80fd5b8660208260061b8501011115611e99575f80fd5b60209290920196919550909350505050565b5f60408284031215611ebb575f80fd5b611ec3611c24565b82518152602083015164ffffffffff81168114611ede575f80fd5b60208201529392505050565b7f4e487b71000000000000000000000000000000000000000000000000000000005f52603260045260245ffd5b5f60408284031215611f27575f80fd5b611f2f611c24565b8235611f3a81611bbb565b81526020830135611ede81611bbb565b7f4e487b71000000000000000000000000000000000000000000000000000000005f52601160045260245ffd5b5f7fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff8203611fa757611fa7611f4a565b5060010190565b8082018082111561031357610313611f4a565b8181038181111561031357610313611f4a565b808202811582820484141761031357610313611f4a565b7f4e487b71000000000000000000000000000000000000000000000000000000005f52601260045260245ffd5b5f8261202657612026611feb565b500690565b5f8261203957612039611feb565b500490565b7f4e487b71000000000000000000000000000000000000000000000000000000005f52600160045260245ffd5b60ff828116828216039081111561031357610313611f4a565b600181815b808511156120dd57817fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff048211156120c3576120c3611f4a565b808516156120d057918102915b93841c9390800290612089565b509250929050565b5f826120f357506001610313565b816120ff57505f610313565b8160018114612115576002811461211f5761213b565b6001915050610313565b60ff84111561213057612130611f4a565b50506001821b610313565b5060208310610133831016604e8410600b841016171561215e575081810a610313565b6121688383612084565b807fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff0482111561219a5761219a611f4a565b029392505050565b5f610eb583836120e556fea164736f6c6343000814000a

Constructor Arguments (ABI-Encoded and is the last bytes of the Contract Creation Code above)

000000000000000000000000ed403d48e2bc946438b5686aa1ad65056ccf951200000000000000000000000031562ae726afebe25417df01bedc72ef489f45b3

-----Decoded View---------------
Arg [0] : _stateRootOracle (address): 0xeD403d48e2bC946438B5686AA1AD65056Ccf9512
Arg [1] : _timelockAddress (address): 0x31562ae726AFEBe25417df01bEdC72EF489F45b3

-----Encoded View---------------
2 Constructor Arguments found :
Arg [0] : 000000000000000000000000ed403d48e2bc946438b5686aa1ad65056ccf9512
Arg [1] : 00000000000000000000000031562ae726afebe25417df01bedc72ef489f45b3


Block Transaction Difficulty Gas Used Reward
View All Blocks Produced

Block Uncle Number Difficulty Gas Used Reward
View All Uncles
Loading...
Loading
Loading...
Loading
Loading...
Loading

Validator Index Block Amount
View All Withdrawals

Transaction Hash Block Value Eth2 PubKey Valid
View All Deposits
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.