Contract Source Code (Solidity Standard Json-Input format)

IDE

• Blockscan IDE
• 🤖 Code ReaderBeta

More Options

• Similar
• Submit Audit
• Compare

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

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

// ====================================================================
import { ERC165Storage } from "@openzeppelin/contracts/utils/introspection/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";
import { FixedPointMathLib } from "@solmate/utils/FixedPointMathLib.sol";

/// @title MerkleProofPriceSource
/// @author Jon Walch (Frax Finance) https://github.com/jonwalch
/// @notice Proves price round data from an L1 Frax Oracle and pushes the price data to an L2 Frax Oracle
contract MerkleProofPriceSourceSfrxEth is ERC165Storage, Timelock2Step {
    /// @notice The address of the StateRootOracle on Layer 2
    IStateRootOracle public immutable STATE_ROOT_ORACLE;

    using FixedPointMathLib for uint256;

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

    /// @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] != address(0)) {
                revert OraclePairAlreadySet({
                    fraxOracleLayer1: oracleLookup[_oraclePair.layer2FraxOracle],
                    fraxOracleLayer2: _oraclePair.layer2FraxOracle
                });
            }
            oracleLookup[_oraclePair.layer2FraxOracle] = _oraclePair.layer1FraxOracle;
            emit OraclePairAdded({
                fraxOracleLayer1: _oraclePair.layer1FraxOracle,
                fraxOracleLayer2: _oraclePair.layer2FraxOracle
            });
        }
    }

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

    function _fetchAndProofSfrxEth(
        address _sfrxEthAddress,
        uint256 _blockNumber,
        bytes[] memory _accountProofSfrxEth,
        bytes[] memory _storageProofTotalSupply,
        bytes[] memory _storageProofTotalAssets,
        bytes[] memory _storageProofRewards
    )
        internal
        view
        returns (uint256 totalSupply, uint256 totalAssets, uint192 lastRewards, uint32 rewardsCycleEnd, uint32 lastSync)
    {
        IStateRootOracle.BlockInfo memory _blockInfo = STATE_ROOT_ORACLE.getBlockInfo(_blockNumber);
        Verifier.Account memory _accountProofSfrxEth = MerkleTreeProver.proveStorageRoot({
            stateRootHash: _blockInfo.stateRootHash,
            proofAddress: _sfrxEthAddress,
            accountProof: _accountProofSfrxEth
        });
        totalSupply = uint256(
            MerkleTreeProver
                .proveStorageSlotValue({
                    storageRootHash: _accountProofSfrxEth.storageRoot,
                    slot: bytes32(uint256(2)),
                    storageProof: _storageProofTotalSupply
                })
                .value
        );

        totalAssets = uint256(
            MerkleTreeProver
                .proveStorageSlotValue({
                    storageRootHash: _accountProofSfrxEth.storageRoot,
                    slot: bytes32(uint256(7)),
                    storageProof: _storageProofTotalAssets
                })
                .value
        );
        uint256 rewardsPacked = uint256(
            MerkleTreeProver
                .proveStorageSlotValue({
                    storageRootHash: _accountProofSfrxEth.storageRoot,
                    slot: bytes32(uint256(6)),
                    storageProof: _storageProofRewards
                })
                .value
        );

        // Get the first 24 bytes on the slot
        lastRewards = uint192(bytes24(bytes32(rewardsPacked)));
        // get the last 8 bytes on the slot only take first 4
        rewardsCycleEnd = uint32(bytes4(bytes32(rewardsPacked) << 192));
        // get the last 4 bytes on the slot
        lastSync = uint32(bytes4(bytes32(rewardsPacked) << 224));
    }

    function addRoundDataSfrxEth(
        IERC4626Receiver _sfrxEthAddress,
        uint256 _blockNumber,
        bytes[] memory _accountProofSfrxEth,
        bytes[] memory _storageProofTotalSupply,
        bytes[] memory _storageProofTotalAssets,
        bytes[] memory _storageProofRewards
    ) external {
        uint256 lastBlockProofed = oracleToLastBlockProofed[address(_sfrxEthAddress)];
        if (lastBlockProofed != 0) {
            if (_blockNumber < lastBlockProofed) revert StalePush();
        }
        // Address of the L1 oracle
        address _proofAddress = oracleLookup[address(_sfrxEthAddress)];
        if (_proofAddress == address(0)) revert WrongOracleAddress();
        (
            uint256 totalSupply,
            uint256 totalStoredAssets,
            uint192 lastRewards,
            uint32 rewardsCycleEnd,
            uint32 lastSync
        ) = _fetchAndProofSfrxEth(
                _proofAddress,
                _blockNumber,
                _accountProofSfrxEth,
                _storageProofTotalSupply,
                _storageProofTotalAssets,
                _storageProofRewards
            );
        _sfrxEthAddress.updateErc4262VaultData(totalSupply, totalStoredAssets, lastRewards, rewardsCycleEnd, lastSync);
        oracleToLastBlockProofed[address(_sfrxEthAddress)] = _blockNumber;
    }

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

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

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts v4.4.1 (utils/introspection/ERC165Storage.sol)

pragma solidity ^0.8.0;

import "./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.19;

// ====================================================================
// |     ______                   _______                             |
// |    / _____________ __  __   / ____(_____  ____ _____  ________   |
// |   / /_  / ___/ __ `| |/_/  / /_  / / __ \/ __ `/ __ \/ ___/ _ \  |
// |  / __/ / /  / /_/ _>  <   / __/ / / / / / /_/ / / / / /__/  __/  |
// | /_/   /_/   \__,_/_/|_|  /_/   /_/_/ /_/\__,_/_/ /_/\___/\___/   |
// |                                                                  |
// ====================================================================
// ========================= 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.19;

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(
        uint256 _totalSupply,
        uint256 _totalAssets,
        uint192 _lastRewardsAmount,
        uint32 _lastSync,
        uint32 _rewardsCycleEnd
    ) external;
}

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

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

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

// SPDX-License-Identifier: AGPL-3.0-only
pragma solidity >=0.8.0;

/// @notice Arithmetic library with operations for fixed-point numbers.
/// @author Solmate (https://github.com/Rari-Capital/solmate/blob/main/src/utils/FixedPointMathLib.sol)
/// @author Inspired by USM (https://github.com/usmfum/USM/blob/master/contracts/WadMath.sol)
library FixedPointMathLib {
    /*//////////////////////////////////////////////////////////////
                    SIMPLIFIED FIXED POINT OPERATIONS
    //////////////////////////////////////////////////////////////*/

    uint256 internal constant WAD = 1e18; // The scalar of ETH and most ERC20s.

    function mulWadDown(uint256 x, uint256 y) internal pure returns (uint256) {
        return mulDivDown(x, y, WAD); // Equivalent to (x * y) / WAD rounded down.
    }

    function mulWadUp(uint256 x, uint256 y) internal pure returns (uint256) {
        return mulDivUp(x, y, WAD); // Equivalent to (x * y) / WAD rounded up.
    }

    function divWadDown(uint256 x, uint256 y) internal pure returns (uint256) {
        return mulDivDown(x, WAD, y); // Equivalent to (x * WAD) / y rounded down.
    }

    function divWadUp(uint256 x, uint256 y) internal pure returns (uint256) {
        return mulDivUp(x, WAD, y); // Equivalent to (x * WAD) / y rounded up.
    }

    /*//////////////////////////////////////////////////////////////
                    LOW LEVEL FIXED POINT OPERATIONS
    //////////////////////////////////////////////////////////////*/

    function mulDivDown(
        uint256 x,
        uint256 y,
        uint256 denominator
    ) internal pure returns (uint256 z) {
        assembly {
            // Store x * y in z for now.
            z := mul(x, y)

            // Equivalent to require(denominator != 0 && (x == 0 || (x * y) / x == y))
            if iszero(and(iszero(iszero(denominator)), or(iszero(x), eq(div(z, x), y)))) {
                revert(0, 0)
            }

            // Divide z by the denominator.
            z := div(z, denominator)
        }
    }

    function mulDivUp(
        uint256 x,
        uint256 y,
        uint256 denominator
    ) internal pure returns (uint256 z) {
        assembly {
            // Store x * y in z for now.
            z := mul(x, y)

            // Equivalent to require(denominator != 0 && (x == 0 || (x * y) / x == y))
            if iszero(and(iszero(iszero(denominator)), or(iszero(x), eq(div(z, x), y)))) {
                revert(0, 0)
            }

            // First, divide z - 1 by the denominator and add 1.
            // We allow z - 1 to underflow if z is 0, because we multiply the
            // end result by 0 if z is zero, ensuring we return 0 if z is zero.
            z := mul(iszero(iszero(z)), add(div(sub(z, 1), denominator), 1))
        }
    }

    function rpow(
        uint256 x,
        uint256 n,
        uint256 scalar
    ) internal pure returns (uint256 z) {
        assembly {
            switch x
            case 0 {
                switch n
                case 0 {
                    // 0 ** 0 = 1
                    z := scalar
                }
                default {
                    // 0 ** n = 0
                    z := 0
                }
            }
            default {
                switch mod(n, 2)
                case 0 {
                    // If n is even, store scalar in z for now.
                    z := scalar
                }
                default {
                    // If n is odd, store x in z for now.
                    z := x
                }

                // Shifting right by 1 is like dividing by 2.
                let half := shr(1, scalar)

                for {
                    // Shift n right by 1 before looping to halve it.
                    n := shr(1, n)
                } n {
                    // Shift n right by 1 each iteration to halve it.
                    n := shr(1, n)
                } {
                    // Revert immediately if x ** 2 would overflow.
                    // Equivalent to iszero(eq(div(xx, x), x)) here.
                    if shr(128, x) {
                        revert(0, 0)
                    }

                    // Store x squared.
                    let xx := mul(x, x)

                    // Round to the nearest number.
                    let xxRound := add(xx, half)

                    // Revert if xx + half overflowed.
                    if lt(xxRound, xx) {
                        revert(0, 0)
                    }

                    // Set x to scaled xxRound.
                    x := div(xxRound, scalar)

                    // If n is even:
                    if mod(n, 2) {
                        // Compute z * x.
                        let zx := mul(z, x)

                        // If z * x overflowed:
                        if iszero(eq(div(zx, x), z)) {
                            // Revert if x is non-zero.
                            if iszero(iszero(x)) {
                                revert(0, 0)
                            }
                        }

                        // Round to the nearest number.
                        let zxRound := add(zx, half)

                        // Revert if zx + half overflowed.
                        if lt(zxRound, zx) {
                            revert(0, 0)
                        }

                        // Return properly scaled zxRound.
                        z := div(zxRound, scalar)
                    }
                }
            }
        }
    }

    /*//////////////////////////////////////////////////////////////
                        GENERAL NUMBER UTILITIES
    //////////////////////////////////////////////////////////////*/

    function sqrt(uint256 x) internal pure returns (uint256 z) {
        assembly {
            // Start off with z at 1.
            z := 1

            // Used below to help find a nearby power of 2.
            let y := x

            // Find the lowest power of 2 that is at least sqrt(x).
            if iszero(lt(y, 0x100000000000000000000000000000000)) {
                y := shr(128, y) // Like dividing by 2 ** 128.
                z := shl(64, z) // Like multiplying by 2 ** 64.
            }
            if iszero(lt(y, 0x10000000000000000)) {
                y := shr(64, y) // Like dividing by 2 ** 64.
                z := shl(32, z) // Like multiplying by 2 ** 32.
            }
            if iszero(lt(y, 0x100000000)) {
                y := shr(32, y) // Like dividing by 2 ** 32.
                z := shl(16, z) // Like multiplying by 2 ** 16.
            }
            if iszero(lt(y, 0x10000)) {
                y := shr(16, y) // Like dividing by 2 ** 16.
                z := shl(8, z) // Like multiplying by 2 ** 8.
            }
            if iszero(lt(y, 0x100)) {
                y := shr(8, y) // Like dividing by 2 ** 8.
                z := shl(4, z) // Like multiplying by 2 ** 4.
            }
            if iszero(lt(y, 0x10)) {
                y := shr(4, y) // Like dividing by 2 ** 4.
                z := shl(2, z) // Like multiplying by 2 ** 2.
            }
            if iszero(lt(y, 0x8)) {
                // Equivalent to 2 ** z.
                z := shl(1, z)
            }

            // Shifting right by 1 is like dividing by 2.
            z := shr(1, add(z, div(x, z)))
            z := shr(1, add(z, div(x, z)))
            z := shr(1, add(z, div(x, z)))
            z := shr(1, add(z, div(x, z)))
            z := shr(1, add(z, div(x, z)))
            z := shr(1, add(z, div(x, z)))
            z := shr(1, add(z, div(x, z)))

            // Compute a rounded down version of z.
            let zRoundDown := div(x, z)

            // If zRoundDown is smaller, use it.
            if lt(zRoundDown, z) {
                z := zRoundDown
            }
        }
    }
}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts v4.4.1 (utils/introspection/ERC165.sol)

pragma solidity ^0.8.0;

import "./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);
 * }
 * ```
 *
 * Alternatively, {ERC165Storage} provides an easier to use but more expensive implementation.
 */
abstract contract ERC165 is IERC165 {
    /**
     * @dev See {IERC165-supportsInterface}.
     */
    function supportsInterface(bytes4 interfaceId) public view virtual override 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.19;

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 v4.4.1 (utils/introspection/IERC165.sol)

pragma solidity ^0.8.0;

/**
 * @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);
}

{
  "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/",
    "@eth-optimism/=node_modules/@eth-optimism/",
    "@mean-finance/=node_modules/@mean-finance/",
    "@offchainlabs/=node_modules/@offchainlabs/",
    "@openzeppelin/=node_modules/@openzeppelin/",
    "@rari-capital/=node_modules/@rari-capital/",
    "@uniswap/=node_modules/@uniswap/",
    "base64-sol/=node_modules/base64-sol/",
    "frax-standard-solidity/=node_modules/frax-standard-solidity/",
    "hardhat/=node_modules/hardhat/",
    "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": "paris",
  "viaIR": false,
  "libraries": {}
}

• No Contract Security Audit Submitted- Submit Audit Here

[{"inputs":[{"internalType":"address","name":"_stateRootOracle","type":"address"},{"internalType":"address","name":"_timelockAddress","type":"address"}],"stateMutability":"nonpayable","type":"constructor"},{"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":"acceptTransferTimelock","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"components":[{"internalType":"address","name":"layer1FraxOracle","type":"address"},{"internalType":"address","name":"layer2FraxOracle","type":"address"}],"internalType":"struct MerkleProofPriceSourceSfrxEth.OraclePair[]","name":"_oraclePairs","type":"tuple[]"}],"name":"addOraclePairs","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"contract IERC4626Receiver","name":"_sfrxEthAddress","type":"address"},{"internalType":"uint256","name":"_blockNumber","type":"uint256"},{"internalType":"bytes[]","name":"_accountProofSfrxEth","type":"bytes[]"},{"internalType":"bytes[]","name":"_storageProofTotalSupply","type":"bytes[]"},{"internalType":"bytes[]","name":"_storageProofTotalAssets","type":"bytes[]"},{"internalType":"bytes[]","name":"_storageProofRewards","type":"bytes[]"}],"name":"addRoundDataSfrxEth","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"layer2FraxOracle","type":"address"}],"name":"oracleLookup","outputs":[{"internalType":"address","name":"layer1FraxOracle","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"layer2FraxOracle","type":"address"}],"name":"oracleToLastBlockProofed","outputs":[{"internalType":"uint256","name":"lastBlockProofed","type":"uint256"}],"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"}]

60a06040523480156200001157600080fd5b50604051620022db380380620022db833981016040819052620000349162000173565b600280546001600160a01b03191633179055620000518162000076565b62000063632fa3fc3160e21b620000d2565b506001600160a01b0316608052620001ab565b6002546040516001600160a01b038084169216907f31b6c5a04b069b6ec1b3cef44c4e7c1eadd721349cda9823d0b1877b3551cdc690600090a3600280546001600160a01b0319166001600160a01b0392909216919091179055565b6001600160e01b03198082169003620001315760405162461bcd60e51b815260206004820152601c60248201527f4552433136353a20696e76616c696420696e7465726661636520696400000000604482015260640160405180910390fd5b6001600160e01b0319166000908152602081905260409020805460ff19166001179055565b80516001600160a01b03811681146200016e57600080fd5b919050565b600080604083850312156200018757600080fd5b620001928362000156565b9150620001a26020840162000156565b90509250929050565b60805161210d620001ce600039600081816101aa0152610819015261210d6000f3fe608060405234801561001057600080fd5b50600436106100c85760003560e01c80634f8b4ae711610081578063e8c033ad1161005b578063e8c033ad146101df578063edb219c0146101f2578063f6ccaad41461022857600080fd5b80634f8b4ae71461019d5780639378ca56146101a5578063a6d7fdf2146101cc57600080fd5b8063090f3f50116100b2578063090f3f501461012357806345014095146101685780634bc66f321461017d57600080fd5b8062e6a7bf146100cd57806301ffc9a714610100575b600080fd5b6100ed6100db366004611a8c565b60046020526000908152604090205481565b6040519081526020015b60405180910390f35b61011361010e366004611aa9565b610230565b60405190151581526020016100f7565b6001546101439073ffffffffffffffffffffffffffffffffffffffff1681565b60405173ffffffffffffffffffffffffffffffffffffffff90911681526020016100f7565b61017b610176366004611a8c565b6102b9565b005b6002546101439073ffffffffffffffffffffffffffffffffffffffff1681565b61017b6102cd565b6101437f000000000000000000000000000000000000000000000000000000000000000081565b61017b6101da366004611aeb565b6102f3565b61017b6101ed366004611d25565b61047d565b610143610200366004611a8c565b60036020526000908152604090205473ffffffffffffffffffffffffffffffffffffffff1681565b61017b610657565b60007f01ffc9a7000000000000000000000000000000000000000000000000000000007fffffffff00000000000000000000000000000000000000000000000000000000831614806102b357507fffffffff00000000000000000000000000000000000000000000000000000000821660009081526020819052604090205460ff165b92915050565b6102c1610667565b6102ca816106b8565b50565b6102d5610667565b6102dd61072f565b6102e760006106b8565b6102f16000610780565b565b6102fb610667565b60005b8181101561047857600083838381811061031a5761031a611deb565b9050604002018036038101906103309190611e1a565b60208082015173ffffffffffffffffffffffffffffffffffffffff9081166000908152600390925260409091205491925016156103d8576020818101805173ffffffffffffffffffffffffffffffffffffffff9081166000908152600390935260409283902054915183517f729d6d9c000000000000000000000000000000000000000000000000000000008152928216600484015216602482015290519081900360440190fd5b80516020808301805173ffffffffffffffffffffffffffffffffffffffff90811660009081526003909352604080842080547fffffffffffffffffffffffff0000000000000000000000000000000000000000169583169590951790945590518451935190821693909116917fc662d74d8469d456352095edb1ed6a69f64c66ace9fa3598de77edfccfad12a291a35061047181611e8a565b90506102fe565b505050565b73ffffffffffffffffffffffffffffffffffffffff861660009081526004602052604090205480156104e357808610156104e3576040517f011d308100000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b73ffffffffffffffffffffffffffffffffffffffff8088166000908152600360205260409020541680610542576040517f17e740e800000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b6000806000806000610558868d8d8d8d8d61080e565b6040517f6a5f11e5000000000000000000000000000000000000000000000000000000008152600481018690526024810185905277ffffffffffffffffffffffffffffffffffffffffffffffff8416604482015263ffffffff8084166064830152821660848201529499509297509095509350915073ffffffffffffffffffffffffffffffffffffffff8e1690636a5f11e59060a401600060405180830381600087803b15801561060857600080fd5b505af115801561061c573d6000803e3d6000fd5b50505073ffffffffffffffffffffffffffffffffffffffff909d1660009081526004602052604090209b909b55505050505050505050505050565b61065f61072f565b6102f161093e565b60025473ffffffffffffffffffffffffffffffffffffffff1633146102f1576040517f1c0be90a00000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b600180547fffffffffffffffffffffffff00000000000000000000000000000000000000001673ffffffffffffffffffffffffffffffffffffffff838116918217909255600254604051919216907f162998b90abc2507f3953aa797827b03a14c42dbd9a35f09feaf02e0d592773a90600090a350565b60015473ffffffffffffffffffffffffffffffffffffffff1633146102f1576040517ff5c49e6400000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b60025460405173ffffffffffffffffffffffffffffffffffffffff8084169216907f31b6c5a04b069b6ec1b3cef44c4e7c1eadd721349cda9823d0b1877b3551cdc690600090a3600280547fffffffffffffffffffffffff00000000000000000000000000000000000000001673ffffffffffffffffffffffffffffffffffffffff92909216919091179055565b6000806000806000807f000000000000000000000000000000000000000000000000000000000000000073ffffffffffffffffffffffffffffffffffffffff1663bb141cf48c6040518263ffffffff1660e01b815260040161087291815260200190565b6040805180830381865afa15801561088e573d6000803e3d6000fd5b505050506040513d601f19601f820116820180604052508101906108b29190611ec2565b905060006108c582600001518e8d61096f565b90506108da8160600151600260001b8c610adf565b6020015196506108f38160600151600760001b8b610adf565b602001519550600061090e8260600151600660001b8b610adf565b602090810151989f979e50604089901c9d5063ffffffff9089901c81169c50909716995094975050505050505050565b600180547fffffffffffffffffffffffff00000000000000000000000000000000000000001690556102f133610780565b6040805160a0810182526000808252602082018190529181018290526060810182905260808101919091526000825167ffffffffffffffff8111156109b6576109b6611b6b565b6040519080825280602002602001820160405280156109fb57816020015b60408051808201909152600080825260208201528152602001906001900390816109d45790505b50905060005b8351811015610a8257610a54848281518110610a1f57610a1f611deb565b602002602001015160408051808201825260008082526020918201528151808301909252825182529182019181019190915290565b828281518110610a6657610a66611deb565b602002602001018190525080610a7b90611e8a565b9050610a01565b506040517fffffffffffffffffffffffffffffffffffffffff000000000000000000000000606086901b166020820152610ad690603401604051602081830303815290604052805190602001208683610bda565b95945050505050565b60408051808201909152600080825260208201526000825167ffffffffffffffff811115610b0f57610b0f611b6b565b604051908082528060200260200182016040528015610b5457816020015b6040805180820190915260008082526020820152815260200190600190039081610b2d5790505b50905060005b8351811015610ba657610b78848281518110610a1f57610a1f611deb565b828281518110610b8a57610b8a611deb565b602002602001018190525080610b9f90611e8a565b9050610b5a565b50610ad684604051602001610bbd91815260200190565b604051602081830303815290604052805190602001208683610d51565b6040805160a0810182526000808252602082018190529181018290526060810182905260808101919091526000610c338486604051602001610c1e91815260200190565b60405160208183030381529060405285610dde565b6040805160a0810182526000808252602082018190529181018290526060810182905260808101919091529091508151600003610c73579150610d4a9050565b6000610cae610ca98460408051808201825260008082526020918201528151808301909252825182529182019181019190915290565b61121a565b90508051600414610cbe57600080fd5b600182528051610ce6908290600090610cd957610cd9611deb565b6020026020010151611330565b60208301528051610d049082906001908110610cd957610cd9611deb565b60408301528051610d229082906002908110610cd957610cd9611deb565b60608301528051610d409082906003908110610cd957610cd9611deb565b6080830152509150505b9392505050565b60408051808201909152600080825260208201526000610d7e8486604051602001610c1e91815260200190565b6040805180820190915260008082526020820152909150815115610ad65760018152604080518082018252600080825260209182015281518083019092528351825280840190820152610dd090611330565b602082015295945050505050565b60606000610ded84600061137e565b90506000806060610e11604051806040016040528060008152602001600081525090565b8651600003610e62577f56e81f171bcc55a6ff8345e692c0f86e5b48e01b996cadc001622fb5e363b4218914610e4657600080fd5b50506040805160008152602081019091529350610d4a92505050565b60005b875181101561120d5780158015610ea45750610ea0888281518110610e8c57610e8c611deb565b602002602001015160208101519051902090565b8a14155b15610eae57600080fd5b8015801590610ede5750610eda888281518110610ecd57610ecd611deb565b6020026020010151611554565b8414155b15610ee857600080fd5b610f0a888281518110610efd57610efd611deb565b602002602001015161121a565b925082516002036110b65760006060610f44610f3f86600081518110610f3257610f32611deb565b60200260200101516115ae565b61162c565b90925090506000610f56888a846116c7565b9050610f628189611ef8565b97508151811015610fc55760018b51610f7b9190611f0b565b841015610f8757600080fd5b60005b6040519080825280601f01601f191660200182016040528015610fb4576020820181803683370190505b509950505050505050505050610d4a565b821561102b5760018b51610fd99190611f0b565b841015610fe557600080fd5b8851881015610ff5576000610f8a565b8560018151811061100857611008611deb565b6020026020010151945061101b856115ae565b9950505050505050505050610d4a565b60018b516110399190611f0b565b840361104457600080fd5b6110678660018151811061105a5761105a611deb565b6020026020010151611782565b6110955761108e8660018151811061108157611081611deb565b60200260200101516117bd565b96506110ae565b6110ab86600181518110610e8c57610e8c611deb565b96505b5050506111fb565b82516011036111fb57855185146111bf5760008686815181106110db576110db611deb565b016020015160f81c90506110f0600187611ef8565b955060108160ff161061110257600080fd5b611127848260ff168151811061111a5761111a611deb565b60200260200101516117d5565b15611163576001895161113a9190611f0b565b821461114557600080fd5b50506040805160008152602081019091529550610d4a945050505050565b61117b848260ff168151811061105a5761105a611deb565b61119e57611197848260ff168151811061108157611081611deb565b94506111b9565b6111b6848260ff1681518110610e8c57610e8c611deb565b94505b506111fb565b600188516111cd9190611f0b565b81146111d857600080fd5b6111ee83601081518110610f3257610f32611deb565b9650505050505050610d4a565b8061120581611e8a565b915050610e65565b5050505050509392505050565b606061122582611782565b61122e57600080fd5b6000611239836117f8565b905060008167ffffffffffffffff81111561125657611256611b6b565b60405190808252806020026020018201604052801561129b57816020015b60408051808201909152600080825260208201528152602001906001900390816112745790505b50905060006112ad856020015161187d565b85602001516112bc9190611ef8565b90506000805b84811015611325576112d3836118f8565b91506040518060400160405280838152602001848152508482815181106112fc576112fc611deb565b60209081029190910101526113118284611ef8565b92508061131d81611e8a565b9150506112c2565b509195945050505050565b80516000901580159061134557508151602110155b61134e57600080fd5b60008061135a846119a1565b8151919350915060208210156113765760208290036101000a90045b949350505050565b6060600083511161138e57600080fd5b60008351600261139e9190611f1e565b9050808311156113ad57600080fd5b6113b78382611f0b565b90508067ffffffffffffffff8111156113d2576113d2611b6b565b6040519080825280601f01601f1916602001820160405280156113fc576020820181803683370190505b5091506000835b61140d8386611ef8565b81101561153b5761141f600282611f64565b6000036114a357600486611434600284611f78565b8151811061144457611444611deb565b602001015160f81c60f81b60f81c60ff16901c600f1660f81b84838151811061146f5761146f611deb565b60200101907effffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff1916908160001a90535061151c565b6000866114b1600284611f78565b815181106114c1576114c1611deb565b602001015160f81c60f81b60f81c60ff16901c600f1660f81b8483815181106114ec576114ec611deb565b60200101907effffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff1916908160001a9053505b611527600183611ef8565b9150611534600182611ef8565b9050611403565b508251811461154c5761154c611f8c565b505092915050565b6000602082600001511015611571576020820151825190206102b3565b60208201518251902060405160200161158c91815260200190565b604051602081830303815290604052805190602001209050919050565b919050565b80516060906115bc57600080fd5b6000806115c8846119a1565b9150915060008167ffffffffffffffff8111156115e7576115e7611b6b565b6040519080825280601f01601f191660200182016040528015611611576020820181803683370190505b509050602081016116238482856119e8565b50949350505050565b60006060600083511161163e57600080fd5b600060048460008151811061165557611655611deb565b60209101015160f81c901c600f169050600081810361167a57506000925060026116b1565b8160010361168e57506000925060016116b1565b816002036116a257506001925060026116b1565b816003036100c8575060019250825b836116bc868361137e565b935093505050915091565b6000805b83516116d78683611ef8565b1080156116e45750825181105b15611376578281815181106116fb576116fb611deb565b01602001517fff00000000000000000000000000000000000000000000000000000000000000168461172d8784611ef8565b8151811061173d5761173d611deb565b01602001517fff000000000000000000000000000000000000000000000000000000000000001614611770579050610d4a565b8061177a81611e8a565b9150506116cb565b8051600090810361179557506000919050565b6020820151805160001a9060c08210156117b3575060009392505050565b5060019392505050565b60008060006117cb846119a1565b9020949350505050565b80516000906001146117e957506000919050565b50602001515160001a60801490565b8051600090810361180b57506000919050565b60008061181b846020015161187d565b846020015161182a9190611ef8565b90506000846000015185602001516118429190611ef8565b90505b8082101561187457611856826118f8565b6118609083611ef8565b91508261186c81611e8a565b935050611845565b50909392505050565b8051600090811a60808110156118965750600092915050565b60b88110806118b1575060c081108015906118b1575060f881105b156118bf5750600192915050565b60c08110156118ec576118d4600160b8611fbb565b6118e19060ff1682611f0b565b610d4a906001611ef8565b6118d4600160f8611fbb565b80516000908190811a6080811015611913576001915061199a565b60b881101561193957611927608082611f0b565b611932906001611ef8565b915061199a565b60c08110156119665760b78103600185019450806020036101000a8551046001820181019350505061199a565b60f881101561197a5761192760c082611f0b565b60f78103600185019450806020036101000a855104600182018101935050505b5092915050565b60008060006119b3846020015161187d565b905060008185602001516119c79190611ef8565b905060008286600001516119db9190611f0b565b9196919550909350505050565b806000036119f557505050565b60208110611a2d5782518252611a0c602084611ef8565b9250611a19602083611ef8565b9150611a26602082611f0b565b90506119f5565b80156104785760006001611a42836020611f0b565b611a4e906101006120f4565b611a589190611f0b565b84518451821691191617835250505050565b73ffffffffffffffffffffffffffffffffffffffff811681146102ca57600080fd5b600060208284031215611a9e57600080fd5b8135610d4a81611a6a565b600060208284031215611abb57600080fd5b81357fffffffff0000000000000000000000000000000000000000000000000000000081168114610d4a57600080fd5b60008060208385031215611afe57600080fd5b823567ffffffffffffffff80821115611b1657600080fd5b818501915085601f830112611b2a57600080fd5b813581811115611b3957600080fd5b8660208260061b8501011115611b4e57600080fd5b60209290920196919550909350505050565b80356115a981611a6a565b7f4e487b7100000000000000000000000000000000000000000000000000000000600052604160045260246000fd5b6040805190810167ffffffffffffffff81118282101715611bbd57611bbd611b6b565b60405290565b604051601f82017fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffe016810167ffffffffffffffff81118282101715611c0a57611c0a611b6b565b604052919050565b6000601f8381840112611c2457600080fd5b8235602067ffffffffffffffff80831115611c4157611c41611b6b565b8260051b611c50838201611bc3565b9384528681018301938381019089861115611c6a57600080fd5b84890192505b85831015611d1857823584811115611c885760008081fd5b8901603f81018b13611c9a5760008081fd5b85810135604086821115611cb057611cb0611b6b565b611cdf887fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffe08c85011601611bc3565b8281528d82848601011115611cf45760008081fd5b828285018a8301376000928101890192909252508352509184019190840190611c70565b9998505050505050505050565b60008060008060008060c08789031215611d3e57600080fd5b611d4787611b60565b955060208701359450604087013567ffffffffffffffff80821115611d6b57600080fd5b611d778a838b01611c12565b95506060890135915080821115611d8d57600080fd5b611d998a838b01611c12565b94506080890135915080821115611daf57600080fd5b611dbb8a838b01611c12565b935060a0890135915080821115611dd157600080fd5b50611dde89828a01611c12565b9150509295509295509295565b7f4e487b7100000000000000000000000000000000000000000000000000000000600052603260045260246000fd5b600060408284031215611e2c57600080fd5b611e34611b9a565b8235611e3f81611a6a565b81526020830135611e4f81611a6a565b60208201529392505050565b7f4e487b7100000000000000000000000000000000000000000000000000000000600052601160045260246000fd5b60007fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff8203611ebb57611ebb611e5b565b5060010190565b600060408284031215611ed457600080fd5b611edc611b9a565b82518152602083015164ffffffffff81168114611e4f57600080fd5b808201808211156102b3576102b3611e5b565b818103818111156102b3576102b3611e5b565b80820281158282048414176102b3576102b3611e5b565b7f4e487b7100000000000000000000000000000000000000000000000000000000600052601260045260246000fd5b600082611f7357611f73611f35565b500690565b600082611f8757611f87611f35565b500490565b7f4e487b7100000000000000000000000000000000000000000000000000000000600052600160045260246000fd5b60ff82811682821603908111156102b3576102b3611e5b565b600181815b8085111561202d57817fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff0482111561201357612013611e5b565b8085161561202057918102915b93841c9390800290611fd9565b509250929050565b600082612044575060016102b3565b81612051575060006102b3565b816001811461206757600281146120715761208d565b60019150506102b3565b60ff84111561208257612082611e5b565b50506001821b6102b3565b5060208310610133831016604e8410600b84101617156120b0575081810a6102b3565b6120ba8383611fd4565b807fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff048211156120ec576120ec611e5b565b029392505050565b6000610d4a838361203556fea164736f6c6343000813000a000000000000000000000000ed403d48e2bc946438b5686aa1ad65056ccf951200000000000000000000000031562ae726afebe25417df01bedc72ef489f45b3

0x608060405234801561001057600080fd5b50600436106100c85760003560e01c80634f8b4ae711610081578063e8c033ad1161005b578063e8c033ad146101df578063edb219c0146101f2578063f6ccaad41461022857600080fd5b80634f8b4ae71461019d5780639378ca56146101a5578063a6d7fdf2146101cc57600080fd5b8063090f3f50116100b2578063090f3f501461012357806345014095146101685780634bc66f321461017d57600080fd5b8062e6a7bf146100cd57806301ffc9a714610100575b600080fd5b6100ed6100db366004611a8c565b60046020526000908152604090205481565b6040519081526020015b60405180910390f35b61011361010e366004611aa9565b610230565b60405190151581526020016100f7565b6001546101439073ffffffffffffffffffffffffffffffffffffffff1681565b60405173ffffffffffffffffffffffffffffffffffffffff90911681526020016100f7565b61017b610176366004611a8c565b6102b9565b005b6002546101439073ffffffffffffffffffffffffffffffffffffffff1681565b61017b6102cd565b6101437f000000000000000000000000ed403d48e2bc946438b5686aa1ad65056ccf951281565b61017b6101da366004611aeb565b6102f3565b61017b6101ed366004611d25565b61047d565b610143610200366004611a8c565b60036020526000908152604090205473ffffffffffffffffffffffffffffffffffffffff1681565b61017b610657565b60007f01ffc9a7000000000000000000000000000000000000000000000000000000007fffffffff00000000000000000000000000000000000000000000000000000000831614806102b357507fffffffff00000000000000000000000000000000000000000000000000000000821660009081526020819052604090205460ff165b92915050565b6102c1610667565b6102ca816106b8565b50565b6102d5610667565b6102dd61072f565b6102e760006106b8565b6102f16000610780565b565b6102fb610667565b60005b8181101561047857600083838381811061031a5761031a611deb565b9050604002018036038101906103309190611e1a565b60208082015173ffffffffffffffffffffffffffffffffffffffff9081166000908152600390925260409091205491925016156103d8576020818101805173ffffffffffffffffffffffffffffffffffffffff9081166000908152600390935260409283902054915183517f729d6d9c000000000000000000000000000000000000000000000000000000008152928216600484015216602482015290519081900360440190fd5b80516020808301805173ffffffffffffffffffffffffffffffffffffffff90811660009081526003909352604080842080547fffffffffffffffffffffffff0000000000000000000000000000000000000000169583169590951790945590518451935190821693909116917fc662d74d8469d456352095edb1ed6a69f64c66ace9fa3598de77edfccfad12a291a35061047181611e8a565b90506102fe565b505050565b73ffffffffffffffffffffffffffffffffffffffff861660009081526004602052604090205480156104e357808610156104e3576040517f011d308100000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b73ffffffffffffffffffffffffffffffffffffffff8088166000908152600360205260409020541680610542576040517f17e740e800000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b6000806000806000610558868d8d8d8d8d61080e565b6040517f6a5f11e5000000000000000000000000000000000000000000000000000000008152600481018690526024810185905277ffffffffffffffffffffffffffffffffffffffffffffffff8416604482015263ffffffff8084166064830152821660848201529499509297509095509350915073ffffffffffffffffffffffffffffffffffffffff8e1690636a5f11e59060a401600060405180830381600087803b15801561060857600080fd5b505af115801561061c573d6000803e3d6000fd5b50505073ffffffffffffffffffffffffffffffffffffffff909d1660009081526004602052604090209b909b55505050505050505050505050565b61065f61072f565b6102f161093e565b60025473ffffffffffffffffffffffffffffffffffffffff1633146102f1576040517f1c0be90a00000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b600180547fffffffffffffffffffffffff00000000000000000000000000000000000000001673ffffffffffffffffffffffffffffffffffffffff838116918217909255600254604051919216907f162998b90abc2507f3953aa797827b03a14c42dbd9a35f09feaf02e0d592773a90600090a350565b60015473ffffffffffffffffffffffffffffffffffffffff1633146102f1576040517ff5c49e6400000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b60025460405173ffffffffffffffffffffffffffffffffffffffff8084169216907f31b6c5a04b069b6ec1b3cef44c4e7c1eadd721349cda9823d0b1877b3551cdc690600090a3600280547fffffffffffffffffffffffff00000000000000000000000000000000000000001673ffffffffffffffffffffffffffffffffffffffff92909216919091179055565b6000806000806000807f000000000000000000000000ed403d48e2bc946438b5686aa1ad65056ccf951273ffffffffffffffffffffffffffffffffffffffff1663bb141cf48c6040518263ffffffff1660e01b815260040161087291815260200190565b6040805180830381865afa15801561088e573d6000803e3d6000fd5b505050506040513d601f19601f820116820180604052508101906108b29190611ec2565b905060006108c582600001518e8d61096f565b90506108da8160600151600260001b8c610adf565b6020015196506108f38160600151600760001b8b610adf565b602001519550600061090e8260600151600660001b8b610adf565b602090810151989f979e50604089901c9d5063ffffffff9089901c81169c50909716995094975050505050505050565b600180547fffffffffffffffffffffffff00000000000000000000000000000000000000001690556102f133610780565b6040805160a0810182526000808252602082018190529181018290526060810182905260808101919091526000825167ffffffffffffffff8111156109b6576109b6611b6b565b6040519080825280602002602001820160405280156109fb57816020015b60408051808201909152600080825260208201528152602001906001900390816109d45790505b50905060005b8351811015610a8257610a54848281518110610a1f57610a1f611deb565b602002602001015160408051808201825260008082526020918201528151808301909252825182529182019181019190915290565b828281518110610a6657610a66611deb565b602002602001018190525080610a7b90611e8a565b9050610a01565b506040517fffffffffffffffffffffffffffffffffffffffff000000000000000000000000606086901b166020820152610ad690603401604051602081830303815290604052805190602001208683610bda565b95945050505050565b60408051808201909152600080825260208201526000825167ffffffffffffffff811115610b0f57610b0f611b6b565b604051908082528060200260200182016040528015610b5457816020015b6040805180820190915260008082526020820152815260200190600190039081610b2d5790505b50905060005b8351811015610ba657610b78848281518110610a1f57610a1f611deb565b828281518110610b8a57610b8a611deb565b602002602001018190525080610b9f90611e8a565b9050610b5a565b50610ad684604051602001610bbd91815260200190565b604051602081830303815290604052805190602001208683610d51565b6040805160a0810182526000808252602082018190529181018290526060810182905260808101919091526000610c338486604051602001610c1e91815260200190565b60405160208183030381529060405285610dde565b6040805160a0810182526000808252602082018190529181018290526060810182905260808101919091529091508151600003610c73579150610d4a9050565b6000610cae610ca98460408051808201825260008082526020918201528151808301909252825182529182019181019190915290565b61121a565b90508051600414610cbe57600080fd5b600182528051610ce6908290600090610cd957610cd9611deb565b6020026020010151611330565b60208301528051610d049082906001908110610cd957610cd9611deb565b60408301528051610d229082906002908110610cd957610cd9611deb565b60608301528051610d409082906003908110610cd957610cd9611deb565b6080830152509150505b9392505050565b60408051808201909152600080825260208201526000610d7e8486604051602001610c1e91815260200190565b6040805180820190915260008082526020820152909150815115610ad65760018152604080518082018252600080825260209182015281518083019092528351825280840190820152610dd090611330565b602082015295945050505050565b60606000610ded84600061137e565b90506000806060610e11604051806040016040528060008152602001600081525090565b8651600003610e62577f56e81f171bcc55a6ff8345e692c0f86e5b48e01b996cadc001622fb5e363b4218914610e4657600080fd5b50506040805160008152602081019091529350610d4a92505050565b60005b875181101561120d5780158015610ea45750610ea0888281518110610e8c57610e8c611deb565b602002602001015160208101519051902090565b8a14155b15610eae57600080fd5b8015801590610ede5750610eda888281518110610ecd57610ecd611deb565b6020026020010151611554565b8414155b15610ee857600080fd5b610f0a888281518110610efd57610efd611deb565b602002602001015161121a565b925082516002036110b65760006060610f44610f3f86600081518110610f3257610f32611deb565b60200260200101516115ae565b61162c565b90925090506000610f56888a846116c7565b9050610f628189611ef8565b97508151811015610fc55760018b51610f7b9190611f0b565b841015610f8757600080fd5b60005b6040519080825280601f01601f191660200182016040528015610fb4576020820181803683370190505b509950505050505050505050610d4a565b821561102b5760018b51610fd99190611f0b565b841015610fe557600080fd5b8851881015610ff5576000610f8a565b8560018151811061100857611008611deb565b6020026020010151945061101b856115ae565b9950505050505050505050610d4a565b60018b516110399190611f0b565b840361104457600080fd5b6110678660018151811061105a5761105a611deb565b6020026020010151611782565b6110955761108e8660018151811061108157611081611deb565b60200260200101516117bd565b96506110ae565b6110ab86600181518110610e8c57610e8c611deb565b96505b5050506111fb565b82516011036111fb57855185146111bf5760008686815181106110db576110db611deb565b016020015160f81c90506110f0600187611ef8565b955060108160ff161061110257600080fd5b611127848260ff168151811061111a5761111a611deb565b60200260200101516117d5565b15611163576001895161113a9190611f0b565b821461114557600080fd5b50506040805160008152602081019091529550610d4a945050505050565b61117b848260ff168151811061105a5761105a611deb565b61119e57611197848260ff168151811061108157611081611deb565b94506111b9565b6111b6848260ff1681518110610e8c57610e8c611deb565b94505b506111fb565b600188516111cd9190611f0b565b81146111d857600080fd5b6111ee83601081518110610f3257610f32611deb565b9650505050505050610d4a565b8061120581611e8a565b915050610e65565b5050505050509392505050565b606061122582611782565b61122e57600080fd5b6000611239836117f8565b905060008167ffffffffffffffff81111561125657611256611b6b565b60405190808252806020026020018201604052801561129b57816020015b60408051808201909152600080825260208201528152602001906001900390816112745790505b50905060006112ad856020015161187d565b85602001516112bc9190611ef8565b90506000805b84811015611325576112d3836118f8565b91506040518060400160405280838152602001848152508482815181106112fc576112fc611deb565b60209081029190910101526113118284611ef8565b92508061131d81611e8a565b9150506112c2565b509195945050505050565b80516000901580159061134557508151602110155b61134e57600080fd5b60008061135a846119a1565b8151919350915060208210156113765760208290036101000a90045b949350505050565b6060600083511161138e57600080fd5b60008351600261139e9190611f1e565b9050808311156113ad57600080fd5b6113b78382611f0b565b90508067ffffffffffffffff8111156113d2576113d2611b6b565b6040519080825280601f01601f1916602001820160405280156113fc576020820181803683370190505b5091506000835b61140d8386611ef8565b81101561153b5761141f600282611f64565b6000036114a357600486611434600284611f78565b8151811061144457611444611deb565b602001015160f81c60f81b60f81c60ff16901c600f1660f81b84838151811061146f5761146f611deb565b60200101907effffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff1916908160001a90535061151c565b6000866114b1600284611f78565b815181106114c1576114c1611deb565b602001015160f81c60f81b60f81c60ff16901c600f1660f81b8483815181106114ec576114ec611deb565b60200101907effffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff1916908160001a9053505b611527600183611ef8565b9150611534600182611ef8565b9050611403565b508251811461154c5761154c611f8c565b505092915050565b6000602082600001511015611571576020820151825190206102b3565b60208201518251902060405160200161158c91815260200190565b604051602081830303815290604052805190602001209050919050565b919050565b80516060906115bc57600080fd5b6000806115c8846119a1565b9150915060008167ffffffffffffffff8111156115e7576115e7611b6b565b6040519080825280601f01601f191660200182016040528015611611576020820181803683370190505b509050602081016116238482856119e8565b50949350505050565b60006060600083511161163e57600080fd5b600060048460008151811061165557611655611deb565b60209101015160f81c901c600f169050600081810361167a57506000925060026116b1565b8160010361168e57506000925060016116b1565b816002036116a257506001925060026116b1565b816003036100c8575060019250825b836116bc868361137e565b935093505050915091565b6000805b83516116d78683611ef8565b1080156116e45750825181105b15611376578281815181106116fb576116fb611deb565b01602001517fff00000000000000000000000000000000000000000000000000000000000000168461172d8784611ef8565b8151811061173d5761173d611deb565b01602001517fff000000000000000000000000000000000000000000000000000000000000001614611770579050610d4a565b8061177a81611e8a565b9150506116cb565b8051600090810361179557506000919050565b6020820151805160001a9060c08210156117b3575060009392505050565b5060019392505050565b60008060006117cb846119a1565b9020949350505050565b80516000906001146117e957506000919050565b50602001515160001a60801490565b8051600090810361180b57506000919050565b60008061181b846020015161187d565b846020015161182a9190611ef8565b90506000846000015185602001516118429190611ef8565b90505b8082101561187457611856826118f8565b6118609083611ef8565b91508261186c81611e8a565b935050611845565b50909392505050565b8051600090811a60808110156118965750600092915050565b60b88110806118b1575060c081108015906118b1575060f881105b156118bf5750600192915050565b60c08110156118ec576118d4600160b8611fbb565b6118e19060ff1682611f0b565b610d4a906001611ef8565b6118d4600160f8611fbb565b80516000908190811a6080811015611913576001915061199a565b60b881101561193957611927608082611f0b565b611932906001611ef8565b915061199a565b60c08110156119665760b78103600185019450806020036101000a8551046001820181019350505061199a565b60f881101561197a5761192760c082611f0b565b60f78103600185019450806020036101000a855104600182018101935050505b5092915050565b60008060006119b3846020015161187d565b905060008185602001516119c79190611ef8565b905060008286600001516119db9190611f0b565b9196919550909350505050565b806000036119f557505050565b60208110611a2d5782518252611a0c602084611ef8565b9250611a19602083611ef8565b9150611a26602082611f0b565b90506119f5565b80156104785760006001611a42836020611f0b565b611a4e906101006120f4565b611a589190611f0b565b84518451821691191617835250505050565b73ffffffffffffffffffffffffffffffffffffffff811681146102ca57600080fd5b600060208284031215611a9e57600080fd5b8135610d4a81611a6a565b600060208284031215611abb57600080fd5b81357fffffffff0000000000000000000000000000000000000000000000000000000081168114610d4a57600080fd5b60008060208385031215611afe57600080fd5b823567ffffffffffffffff80821115611b1657600080fd5b818501915085601f830112611b2a57600080fd5b813581811115611b3957600080fd5b8660208260061b8501011115611b4e57600080fd5b60209290920196919550909350505050565b80356115a981611a6a565b7f4e487b7100000000000000000000000000000000000000000000000000000000600052604160045260246000fd5b6040805190810167ffffffffffffffff81118282101715611bbd57611bbd611b6b565b60405290565b604051601f82017fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffe016810167ffffffffffffffff81118282101715611c0a57611c0a611b6b565b604052919050565b6000601f8381840112611c2457600080fd5b8235602067ffffffffffffffff80831115611c4157611c41611b6b565b8260051b611c50838201611bc3565b9384528681018301938381019089861115611c6a57600080fd5b84890192505b85831015611d1857823584811115611c885760008081fd5b8901603f81018b13611c9a5760008081fd5b85810135604086821115611cb057611cb0611b6b565b611cdf887fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffe08c85011601611bc3565b8281528d82848601011115611cf45760008081fd5b828285018a8301376000928101890192909252508352509184019190840190611c70565b9998505050505050505050565b60008060008060008060c08789031215611d3e57600080fd5b611d4787611b60565b955060208701359450604087013567ffffffffffffffff80821115611d6b57600080fd5b611d778a838b01611c12565b95506060890135915080821115611d8d57600080fd5b611d998a838b01611c12565b94506080890135915080821115611daf57600080fd5b611dbb8a838b01611c12565b935060a0890135915080821115611dd157600080fd5b50611dde89828a01611c12565b9150509295509295509295565b7f4e487b7100000000000000000000000000000000000000000000000000000000600052603260045260246000fd5b600060408284031215611e2c57600080fd5b611e34611b9a565b8235611e3f81611a6a565b81526020830135611e4f81611a6a565b60208201529392505050565b7f4e487b7100000000000000000000000000000000000000000000000000000000600052601160045260246000fd5b60007fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff8203611ebb57611ebb611e5b565b5060010190565b600060408284031215611ed457600080fd5b611edc611b9a565b82518152602083015164ffffffffff81168114611e4f57600080fd5b808201808211156102b3576102b3611e5b565b818103818111156102b3576102b3611e5b565b80820281158282048414176102b3576102b3611e5b565b7f4e487b7100000000000000000000000000000000000000000000000000000000600052601260045260246000fd5b600082611f7357611f73611f35565b500690565b600082611f8757611f87611f35565b500490565b7f4e487b7100000000000000000000000000000000000000000000000000000000600052600160045260246000fd5b60ff82811682821603908111156102b3576102b3611e5b565b600181815b8085111561202d57817fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff0482111561201357612013611e5b565b8085161561202057918102915b93841c9390800290611fd9565b509250929050565b600082612044575060016102b3565b81612051575060006102b3565b816001811461206757600281146120715761208d565b60019150506102b3565b60ff84111561208257612082611e5b565b50506001821b6102b3565b5060208310610133831016604e8410600b84101617156120b0575081810a6102b3565b6120ba8383611fd4565b807fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff048211156120ec576120ec611e5b565b029392505050565b6000610d4a838361203556fea164736f6c6343000813000a

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