ETH Price: $2,642.10 (-0.33%)

Contract

0xe6bfe2ac487EA9A6c58108FBcb6d2DB96b667cc0
 

Overview

ETH Balance

0 ETH

Eth Value

$0.00

Multichain Info

No addresses found
Transaction Hash
Method
Block
From
To
Receive Message167230232023-02-28 0:12:23580 days ago1677543143IN
Hop Protocol: MATIC Wrapper
0 ETH0.0092286724.62923498
Receive Message166678032023-02-20 5:52:23588 days ago1676872343IN
Hop Protocol: MATIC Wrapper
0 ETH0.0079998321.58309674
Receive Message165724032023-02-06 21:22:11601 days ago1675718531IN
Hop Protocol: MATIC Wrapper
0 ETH0.0153648541.62745015
Receive Message165150302023-01-29 21:01:59609 days ago1675026119IN
Hop Protocol: MATIC Wrapper
0 ETH0.0079283421.22818853
Receive Message163617482023-01-08 11:23:47630 days ago1673177027IN
Hop Protocol: MATIC Wrapper
0 ETH0.0052423113.9937329
Receive Message162505892022-12-23 23:03:23646 days ago1671836603IN
Hop Protocol: MATIC Wrapper
0 ETH0.0047546812.84270106
Receive Message162151322022-12-19 0:23:11651 days ago1671409391IN
Hop Protocol: MATIC Wrapper
0 ETH0.0040501110.89601873
Receive Message160983892022-12-02 16:42:47667 days ago1669999367IN
Hop Protocol: MATIC Wrapper
0 ETH0.0058544515.66515099
Receive Message160799432022-11-30 2:52:59670 days ago1669776779IN
Hop Protocol: MATIC Wrapper
0 ETH0.0041155211.07330485
Receive Message160470842022-11-25 12:44:59674 days ago1669380299IN
Hop Protocol: MATIC Wrapper
0 ETH0.0039025110.44901367
Receive Message160057072022-11-19 17:59:23680 days ago1668880763IN
Hop Protocol: MATIC Wrapper
0 ETH0.0049071113.24700356
Receive Message159924092022-11-17 21:25:23682 days ago1668720323IN
Hop Protocol: MATIC Wrapper
0 ETH0.0058381615.76000792
Receive Message159637122022-11-13 21:11:47686 days ago1668373907IN
Hop Protocol: MATIC Wrapper
0 ETH0.0077968221.11192408
Receive Message159505692022-11-12 1:11:35688 days ago1668215495IN
Hop Protocol: MATIC Wrapper
0 ETH0.0073034719.71386636
Receive Message159288602022-11-09 0:21:23691 days ago1667953283IN
Hop Protocol: MATIC Wrapper
0 ETH0.0105357128.19908976
Receive Message158904432022-11-03 15:39:47696 days ago1667489987IN
Hop Protocol: MATIC Wrapper
0 ETH0.0120725229.1874107
Receive Message158901862022-11-03 14:48:23696 days ago1667486903IN
Hop Protocol: MATIC Wrapper
0 ETH0.0086606723.86354286
Receive Message158234752022-10-25 7:02:35705 days ago1666681355IN
Hop Protocol: MATIC Wrapper
0 ETH0.0052100813.93785625
Receive Message157318722022-10-12 11:56:11718 days ago1665575771IN
Hop Protocol: MATIC Wrapper
0 ETH0.0082290922.07711629
Receive Message157290322022-10-12 2:25:35719 days ago1665541535IN
Hop Protocol: MATIC Wrapper
0 ETH0.0083132822.18579394
Receive Message155996982022-09-24 0:41:35737 days ago1663980095IN
Hop Protocol: MATIC Wrapper
0 ETH0.002997719.19608038
Receive Message155466442022-09-16 14:03:11744 days ago1663336991IN
Hop Protocol: MATIC Wrapper
0 ETH0.0106544228.67005687
Receive Message153859222022-08-21 19:51:47770 days ago1661111507IN
Hop Protocol: MATIC Wrapper
0 ETH0.002781497.53332294
Receive Message152980572022-08-07 23:08:37784 days ago1659913717IN
Hop Protocol: MATIC Wrapper
0 ETH0.0065127717.42934726
Receive Message151597892022-07-17 11:03:57805 days ago1658055837IN
Hop Protocol: MATIC Wrapper
0 ETH0.0061451116.63589215
View all transactions

Latest 25 internal transactions (View All)

Advanced mode:
Parent Transaction Hash Block From To
168438422023-03-17 0:02:35563 days ago1679011355
0xe6bfe2ac...96b667cc0
0 ETH
168438422023-03-17 0:02:35563 days ago1679011355
0xe6bfe2ac...96b667cc0
0 ETH
168438252023-03-16 23:59:11563 days ago1679011151
0xe6bfe2ac...96b667cc0
0 ETH
168438252023-03-16 23:59:11563 days ago1679011151
0xe6bfe2ac...96b667cc0
0 ETH
168437712023-03-16 23:48:23563 days ago1679010503
0xe6bfe2ac...96b667cc0
0 ETH
168437712023-03-16 23:48:23563 days ago1679010503
0xe6bfe2ac...96b667cc0
0 ETH
168436172023-03-16 23:17:35563 days ago1679008655
0xe6bfe2ac...96b667cc0
0 ETH
168436172023-03-16 23:17:35563 days ago1679008655
0xe6bfe2ac...96b667cc0
0 ETH
168433512023-03-16 22:24:11563 days ago1679005451
0xe6bfe2ac...96b667cc0
0 ETH
168433512023-03-16 22:24:11563 days ago1679005451
0xe6bfe2ac...96b667cc0
0 ETH
168431842023-03-16 21:50:47563 days ago1679003447
0xe6bfe2ac...96b667cc0
0 ETH
168431842023-03-16 21:50:47563 days ago1679003447
0xe6bfe2ac...96b667cc0
0 ETH
168430822023-03-16 21:30:11563 days ago1679002211
0xe6bfe2ac...96b667cc0
0 ETH
168430822023-03-16 21:30:11563 days ago1679002211
0xe6bfe2ac...96b667cc0
0 ETH
168430102023-03-16 21:15:35563 days ago1679001335
0xe6bfe2ac...96b667cc0
0 ETH
168430102023-03-16 21:15:35563 days ago1679001335
0xe6bfe2ac...96b667cc0
0 ETH
168429342023-03-16 21:00:11563 days ago1679000411
0xe6bfe2ac...96b667cc0
0 ETH
168429342023-03-16 21:00:11563 days ago1679000411
0xe6bfe2ac...96b667cc0
0 ETH
168429022023-03-16 20:53:35563 days ago1679000015
0xe6bfe2ac...96b667cc0
0 ETH
168429022023-03-16 20:53:35563 days ago1679000015
0xe6bfe2ac...96b667cc0
0 ETH
168428612023-03-16 20:45:23563 days ago1678999523
0xe6bfe2ac...96b667cc0
0 ETH
168428612023-03-16 20:45:23563 days ago1678999523
0xe6bfe2ac...96b667cc0
0 ETH
168427392023-03-16 20:20:35563 days ago1678998035
0xe6bfe2ac...96b667cc0
0 ETH
168427392023-03-16 20:20:35563 days ago1678998035
0xe6bfe2ac...96b667cc0
0 ETH
168426462023-03-16 20:01:47563 days ago1678996907
0xe6bfe2ac...96b667cc0
0 ETH
View All Internal Transactions
Loading...
Loading

Similar Match Source Code
This contract matches the deployed Bytecode of the Source Code for Contract 0xAd33Daa2...2DF657657
The constructor portion of the code might be different and could alter the actual behaviour of the contract

Contract Name:
PolygonMessengerWrapper

Compiler Version
v0.8.9+commit.e5eed63a

Optimization Enabled:
Yes with 50000 runs

Other Settings:
default evmVersion
File 1 of 8 : PolygonMessengerWrapper.sol
// SPDX-License-Identifier: MIT
// @unsupported: ovm

pragma solidity 0.8.9;
pragma experimental ABIEncoderV2;

import "../polygon/tunnel/FxBaseRootTunnel.sol";
import "./MessengerWrapper.sol";

/**
 * @dev A MessengerWrapper for Polygon - https://docs.matic.network/docs
 * @notice Deployed on layer-1
 */

contract PolygonMessengerWrapper is FxBaseRootTunnel, MessengerWrapper {

    constructor(
        address _l1BridgeAddress,
        address _checkpointManager,
        address _fxRoot,
        address _fxChildTunnel
    )
        public
        MessengerWrapper(_l1BridgeAddress)
        FxBaseRootTunnel(_checkpointManager, _fxRoot)
    {
        setFxChildTunnel(_fxChildTunnel);
    }

    /** 
     * @dev Sends a message to the l2MessengerProxy from layer-1
     * @param _calldata The data that l2MessengerProxy will be called with
     * @notice The msg.sender is sent to the L2_PolygonMessengerProxy and checked there.
     */
    function sendCrossDomainMessage(bytes memory _calldata) public override {
        _sendMessageToChild(
            abi.encode(msg.sender, _calldata)
        );
    }

    function verifySender(address l1BridgeCaller, bytes memory /*_data*/) public view override {
        require(l1BridgeCaller == address(this), "L1_PLGN_WPR: Caller must be this contract");
    }

    function _processMessageFromChild(bytes memory message) internal override {
        (bool success,) = l1BridgeAddress.call(message);
        require(success, "L1_PLGN_WPR: Call to L1 Bridge failed");
    }
}

File 2 of 8 : FxBaseRootTunnel.sol
// SPDX-License-Identifier: MIT
pragma solidity ^0.8.0;

import {RLPReader} from "../lib/RLPReader.sol";
import {MerklePatriciaProof} from "../lib/MerklePatriciaProof.sol";
import {Merkle} from "../lib/Merkle.sol";
import "../lib/ExitPayloadReader.sol";

interface IFxStateSender {
    function sendMessageToChild(address _receiver, bytes calldata _data) external;
}

contract ICheckpointManager {
    struct HeaderBlock {
        bytes32 root;
        uint256 start;
        uint256 end;
        uint256 createdAt;
        address proposer;
    }

    /**
     * @notice mapping of checkpoint header numbers to block details
     * @dev These checkpoints are submited by plasma contracts
     */
    mapping(uint256 => HeaderBlock) public headerBlocks;
}

abstract contract FxBaseRootTunnel {
    using RLPReader for RLPReader.RLPItem;
    using Merkle for bytes32;
    using ExitPayloadReader for bytes;
    using ExitPayloadReader for ExitPayloadReader.ExitPayload;
    using ExitPayloadReader for ExitPayloadReader.Log;
    using ExitPayloadReader for ExitPayloadReader.LogTopics;
    using ExitPayloadReader for ExitPayloadReader.Receipt;

    // keccak256(MessageSent(bytes))
    bytes32 public constant SEND_MESSAGE_EVENT_SIG = 0x8c5261668696ce22758910d05bab8f186d6eb247ceac2af2e82c7dc17669b036;

    // state sender contract
    IFxStateSender public fxRoot;
    // root chain manager
    ICheckpointManager public checkpointManager;
    // child tunnel contract which receives and sends messages
    address public fxChildTunnel;

    // storage to avoid duplicate exits
    mapping(bytes32 => bool) public processedExits;

    constructor(address _checkpointManager, address _fxRoot) {
        checkpointManager = ICheckpointManager(_checkpointManager);
        fxRoot = IFxStateSender(_fxRoot);
    }

    // set fxChildTunnel if not set already
    function setFxChildTunnel(address _fxChildTunnel) public {
        require(fxChildTunnel == address(0x0), "FxBaseRootTunnel: CHILD_TUNNEL_ALREADY_SET");
        fxChildTunnel = _fxChildTunnel;
    }

    /**
     * @notice Send bytes message to Child Tunnel
     * @param message bytes message that will be sent to Child Tunnel
     * some message examples -
     *   abi.encode(tokenId);
     *   abi.encode(tokenId, tokenMetadata);
     *   abi.encode(messageType, messageData);
     */
    function _sendMessageToChild(bytes memory message) internal {
        fxRoot.sendMessageToChild(fxChildTunnel, message);
    }

    function _validateAndExtractMessage(bytes memory inputData) internal returns (bytes memory) {
        ExitPayloadReader.ExitPayload memory payload = inputData.toExitPayload();

        bytes memory branchMaskBytes = payload.getBranchMaskAsBytes();
        uint256 blockNumber = payload.getBlockNumber();
        // checking if exit has already been processed
        // unique exit is identified using hash of (blockNumber, branchMask, receiptLogIndex)
        bytes32 exitHash = keccak256(
            abi.encodePacked(
                blockNumber,
                // first 2 nibbles are dropped while generating nibble array
                // this allows branch masks that are valid but bypass exitHash check (changing first 2 nibbles only)
                // so converting to nibble array and then hashing it
                MerklePatriciaProof._getNibbleArray(branchMaskBytes),
                payload.getReceiptLogIndex()
            )
        );
        require(processedExits[exitHash] == false, "FxRootTunnel: EXIT_ALREADY_PROCESSED");
        processedExits[exitHash] = true;

        ExitPayloadReader.Receipt memory receipt = payload.getReceipt();
        ExitPayloadReader.Log memory log = receipt.getLog();

        // check child tunnel
        require(fxChildTunnel == log.getEmitter(), "FxRootTunnel: INVALID_FX_CHILD_TUNNEL");

        bytes32 receiptRoot = payload.getReceiptRoot();
        // verify receipt inclusion
        require(
            MerklePatriciaProof.verify(receipt.toBytes(), branchMaskBytes, payload.getReceiptProof(), receiptRoot),
            "FxRootTunnel: INVALID_RECEIPT_PROOF"
        );

        // verify checkpoint inclusion
        _checkBlockMembershipInCheckpoint(
            blockNumber,
            payload.getBlockTime(),
            payload.getTxRoot(),
            receiptRoot,
            payload.getHeaderNumber(),
            payload.getBlockProof()
        );

        ExitPayloadReader.LogTopics memory topics = log.getTopics();

        require(
            bytes32(topics.getField(0).toUint()) == SEND_MESSAGE_EVENT_SIG, // topic0 is event sig
            "FxRootTunnel: INVALID_SIGNATURE"
        );

        // received message data
        bytes memory message = abi.decode(log.getData(), (bytes)); // event decodes params again, so decoding bytes to get message
        return message;
    }

    function _checkBlockMembershipInCheckpoint(
        uint256 blockNumber,
        uint256 blockTime,
        bytes32 txRoot,
        bytes32 receiptRoot,
        uint256 headerNumber,
        bytes memory blockProof
    ) private view returns (uint256) {
        (bytes32 headerRoot, uint256 startBlock, , uint256 createdAt, ) = checkpointManager.headerBlocks(headerNumber);

        require(
            keccak256(abi.encodePacked(blockNumber, blockTime, txRoot, receiptRoot)).checkMembership(
                blockNumber - startBlock,
                headerRoot,
                blockProof
            ),
            "FxRootTunnel: INVALID_HEADER"
        );
        return createdAt;
    }

    /**
     * @notice receive message from  L2 to L1, validated by proof
     * @dev This function verifies if the transaction actually happened on child chain
     *
     * @param inputData RLP encoded data of the reference tx containing following list of fields
     *  0 - headerNumber - Checkpoint header block number containing the reference tx
     *  1 - blockProof - Proof that the block header (in the child chain) is a leaf in the submitted merkle root
     *  2 - blockNumber - Block number containing the reference tx on child chain
     *  3 - blockTime - Reference tx block time
     *  4 - txRoot - Transactions root of block
     *  5 - receiptRoot - Receipts root of block
     *  6 - receipt - Receipt of the reference transaction
     *  7 - receiptProof - Merkle proof of the reference receipt
     *  8 - branchMask - 32 bits denoting the path of receipt in merkle tree
     *  9 - receiptLogIndex - Log Index to read from the receipt
     */
    function receiveMessage(bytes memory inputData) public virtual {
        bytes memory message = _validateAndExtractMessage(inputData);
        _processMessageFromChild(message);
    }

    /**
     * @notice Process message received from Child Tunnel
     * @dev function needs to be implemented to handle message as per requirement
     * This is called by onStateReceive function.
     * Since it is called via a system call, any event will not be emitted during its execution.
     * @param message bytes message that was sent from Child Tunnel
     */
    function _processMessageFromChild(bytes memory message) internal virtual;
}

File 3 of 8 : MessengerWrapper.sol
// SPDX-License-Identifier: MIT

pragma solidity >=0.6.12 <=0.8.9;
pragma experimental ABIEncoderV2;

import "../interfaces/IMessengerWrapper.sol";

abstract contract MessengerWrapper is IMessengerWrapper {
    address public immutable l1BridgeAddress;

    constructor(address _l1BridgeAddress) internal {
        l1BridgeAddress = _l1BridgeAddress;
    }

    modifier onlyL1Bridge {
        require(msg.sender == l1BridgeAddress, "MW: Sender must be the L1 Bridge");
        _;
    }
}

File 4 of 8 : RLPReader.sol
/*
 * @author Hamdi Allam [email protected]
 * Please reach out with any questions or concerns
 */
pragma solidity ^0.8.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 item RLP encoded bytes
     */
    function rlpLen(RLPItem memory item) internal pure returns (uint256) {
        return item.len;
    }

    /*
     * @param item RLP encoded bytes
     */
    function payloadLen(RLPItem memory item) internal pure returns (uint256) {
        return item.len - _payloadOffset(item.memPtr);
    }

    /*
     * @param item RLP encoded list in bytes
     */
    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;
    }

    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);
    }

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

        return result == 0 ? false : 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 offset = _payloadOffset(item.memPtr);
        uint256 len = item.len - offset;

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

            // shfit 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 offset = _payloadOffset(item.memPtr);
        uint256 len = item.len - offset; // data length
        bytes memory result = new bytes(len);

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

        copy(item.memPtr + offset, 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) return;

        // 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))
        }
    }
}

File 5 of 8 : MerklePatriciaProof.sol
// SPDX-License-Identifier: MIT
pragma solidity ^0.8.0;

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

library MerklePatriciaProof {
    /*
     * @dev Verifies a merkle patricia proof.
     * @param value The terminating value in the trie.
     * @param encodedPath The path in the trie leading to value.
     * @param rlpParentNodes The rlp encoded stack of nodes.
     * @param root The root hash of the trie.
     * @return The boolean validity of the proof.
     */
    function verify(
        bytes memory value,
        bytes memory encodedPath,
        bytes memory rlpParentNodes,
        bytes32 root
    ) internal pure returns (bool) {
        RLPReader.RLPItem memory item = RLPReader.toRlpItem(rlpParentNodes);
        RLPReader.RLPItem[] memory parentNodes = RLPReader.toList(item);

        bytes memory currentNode;
        RLPReader.RLPItem[] memory currentNodeList;

        bytes32 nodeKey = root;
        uint256 pathPtr = 0;

        bytes memory path = _getNibbleArray(encodedPath);
        if (path.length == 0) {
            return false;
        }

        for (uint256 i = 0; i < parentNodes.length; i++) {
            if (pathPtr > path.length) {
                return false;
            }

            currentNode = RLPReader.toRlpBytes(parentNodes[i]);
            if (nodeKey != keccak256(currentNode)) {
                return false;
            }
            currentNodeList = RLPReader.toList(parentNodes[i]);

            if (currentNodeList.length == 17) {
                if (pathPtr == path.length) {
                    if (keccak256(RLPReader.toBytes(currentNodeList[16])) == keccak256(value)) {
                        return true;
                    } else {
                        return false;
                    }
                }

                uint8 nextPathNibble = uint8(path[pathPtr]);
                if (nextPathNibble > 16) {
                    return false;
                }
                nodeKey = bytes32(RLPReader.toUintStrict(currentNodeList[nextPathNibble]));
                pathPtr += 1;
            } else if (currentNodeList.length == 2) {
                uint256 traversed = _nibblesToTraverse(RLPReader.toBytes(currentNodeList[0]), path, pathPtr);
                if (pathPtr + traversed == path.length) {
                    //leaf node
                    if (keccak256(RLPReader.toBytes(currentNodeList[1])) == keccak256(value)) {
                        return true;
                    } else {
                        return false;
                    }
                }

                //extension node
                if (traversed == 0) {
                    return false;
                }

                pathPtr += traversed;
                nodeKey = bytes32(RLPReader.toUintStrict(currentNodeList[1]));
            } else {
                return false;
            }
        }
    }

    function _nibblesToTraverse(
        bytes memory encodedPartialPath,
        bytes memory path,
        uint256 pathPtr
    ) private pure returns (uint256) {
        uint256 len = 0;
        // encodedPartialPath has elements that are each two hex characters (1 byte), but partialPath
        // and slicedPath have elements that are each one hex character (1 nibble)
        bytes memory partialPath = _getNibbleArray(encodedPartialPath);
        bytes memory slicedPath = new bytes(partialPath.length);

        // pathPtr counts nibbles in path
        // partialPath.length is a number of nibbles
        for (uint256 i = pathPtr; i < pathPtr + partialPath.length; i++) {
            bytes1 pathNibble = path[i];
            slicedPath[i - pathPtr] = pathNibble;
        }

        if (keccak256(partialPath) == keccak256(slicedPath)) {
            len = partialPath.length;
        } else {
            len = 0;
        }
        return len;
    }

    // bytes b must be hp encoded
    function _getNibbleArray(bytes memory b) internal pure returns (bytes memory) {
        bytes memory nibbles = "";
        if (b.length > 0) {
            uint8 offset;
            uint8 hpNibble = uint8(_getNthNibbleOfBytes(0, b));
            if (hpNibble == 1 || hpNibble == 3) {
                nibbles = new bytes(b.length * 2 - 1);
                bytes1 oddNibble = _getNthNibbleOfBytes(1, b);
                nibbles[0] = oddNibble;
                offset = 1;
            } else {
                nibbles = new bytes(b.length * 2 - 2);
                offset = 0;
            }

            for (uint256 i = offset; i < nibbles.length; i++) {
                nibbles[i] = _getNthNibbleOfBytes(i - offset + 2, b);
            }
        }
        return nibbles;
    }

    function _getNthNibbleOfBytes(uint256 n, bytes memory str) private pure returns (bytes1) {
        return bytes1(n % 2 == 0 ? uint8(str[n / 2]) / 0x10 : uint8(str[n / 2]) % 0x10);
    }
}

File 6 of 8 : Merkle.sol
// SPDX-License-Identifier: MIT
pragma solidity ^0.8.0;

library Merkle {
    function checkMembership(
        bytes32 leaf,
        uint256 index,
        bytes32 rootHash,
        bytes memory proof
    ) internal pure returns (bool) {
        require(proof.length % 32 == 0, "Invalid proof length");
        uint256 proofHeight = proof.length / 32;
        // Proof of size n means, height of the tree is n+1.
        // In a tree of height n+1, max #leafs possible is 2 ^ n
        require(index < 2**proofHeight, "Leaf index is too big");

        bytes32 proofElement;
        bytes32 computedHash = leaf;
        for (uint256 i = 32; i <= proof.length; i += 32) {
            assembly {
                proofElement := mload(add(proof, i))
            }

            if (index % 2 == 0) {
                computedHash = keccak256(abi.encodePacked(computedHash, proofElement));
            } else {
                computedHash = keccak256(abi.encodePacked(proofElement, computedHash));
            }

            index = index / 2;
        }
        return computedHash == rootHash;
    }
}

File 7 of 8 : ExitPayloadReader.sol
pragma solidity ^0.8.0;

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

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

    uint8 constant WORD_SIZE = 32;

    struct ExitPayload {
        RLPReader.RLPItem[] data;
    }

    struct Receipt {
        RLPReader.RLPItem[] data;
        bytes raw;
        uint256 logIndex;
    }

    struct Log {
        RLPReader.RLPItem data;
        RLPReader.RLPItem[] list;
    }

    struct LogTopics {
        RLPReader.RLPItem[] data;
    }

    // copy paste of private copy() from RLPReader to avoid changing of existing contracts
    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;
        }

        // 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))
        }
    }

    function toExitPayload(bytes memory data) internal pure returns (ExitPayload memory) {
        RLPReader.RLPItem[] memory payloadData = data.toRlpItem().toList();

        return ExitPayload(payloadData);
    }

    function getHeaderNumber(ExitPayload memory payload) internal pure returns (uint256) {
        return payload.data[0].toUint();
    }

    function getBlockProof(ExitPayload memory payload) internal pure returns (bytes memory) {
        return payload.data[1].toBytes();
    }

    function getBlockNumber(ExitPayload memory payload) internal pure returns (uint256) {
        return payload.data[2].toUint();
    }

    function getBlockTime(ExitPayload memory payload) internal pure returns (uint256) {
        return payload.data[3].toUint();
    }

    function getTxRoot(ExitPayload memory payload) internal pure returns (bytes32) {
        return bytes32(payload.data[4].toUint());
    }

    function getReceiptRoot(ExitPayload memory payload) internal pure returns (bytes32) {
        return bytes32(payload.data[5].toUint());
    }

    function getReceipt(ExitPayload memory payload) internal pure returns (Receipt memory receipt) {
        receipt.raw = payload.data[6].toBytes();
        RLPReader.RLPItem memory receiptItem = receipt.raw.toRlpItem();

        if (receiptItem.isList()) {
            // legacy tx
            receipt.data = receiptItem.toList();
        } else {
            // pop first byte before parsting receipt
            bytes memory typedBytes = receipt.raw;
            bytes memory result = new bytes(typedBytes.length - 1);
            uint256 srcPtr;
            uint256 destPtr;
            assembly {
                srcPtr := add(33, typedBytes)
                destPtr := add(0x20, result)
            }

            copy(srcPtr, destPtr, result.length);
            receipt.data = result.toRlpItem().toList();
        }

        receipt.logIndex = getReceiptLogIndex(payload);
        return receipt;
    }

    function getReceiptProof(ExitPayload memory payload) internal pure returns (bytes memory) {
        return payload.data[7].toBytes();
    }

    function getBranchMaskAsBytes(ExitPayload memory payload) internal pure returns (bytes memory) {
        return payload.data[8].toBytes();
    }

    function getBranchMaskAsUint(ExitPayload memory payload) internal pure returns (uint256) {
        return payload.data[8].toUint();
    }

    function getReceiptLogIndex(ExitPayload memory payload) internal pure returns (uint256) {
        return payload.data[9].toUint();
    }

    // Receipt methods
    function toBytes(Receipt memory receipt) internal pure returns (bytes memory) {
        return receipt.raw;
    }

    function getLog(Receipt memory receipt) internal pure returns (Log memory) {
        RLPReader.RLPItem memory logData = receipt.data[3].toList()[receipt.logIndex];
        return Log(logData, logData.toList());
    }

    // Log methods
    function getEmitter(Log memory log) internal pure returns (address) {
        return RLPReader.toAddress(log.list[0]);
    }

    function getTopics(Log memory log) internal pure returns (LogTopics memory) {
        return LogTopics(log.list[1].toList());
    }

    function getData(Log memory log) internal pure returns (bytes memory) {
        return log.list[2].toBytes();
    }

    function toRlpBytes(Log memory log) internal pure returns (bytes memory) {
        return log.data.toRlpBytes();
    }

    // LogTopics methods
    function getField(LogTopics memory topics, uint256 index) internal pure returns (RLPReader.RLPItem memory) {
        return topics.data[index];
    }
}

File 8 of 8 : IMessengerWrapper.sol
// SPDX-License-Identifier: MIT

pragma solidity >=0.6.12 <=0.8.9;
pragma experimental ABIEncoderV2;

interface IMessengerWrapper {
    function sendCrossDomainMessage(bytes memory _calldata) external;
    function verifySender(address l1BridgeCaller, bytes memory _data) external;
}

Settings
{
  "optimizer": {
    "enabled": true,
    "runs": 50000
  },
  "outputSelection": {
    "*": {
      "*": [
        "evm.bytecode",
        "evm.deployedBytecode",
        "devdoc",
        "userdoc",
        "metadata",
        "abi"
      ]
    }
  },
  "libraries": {}
}

Contract Security Audit

Contract ABI

[{"inputs":[{"internalType":"address","name":"_l1BridgeAddress","type":"address"},{"internalType":"address","name":"_checkpointManager","type":"address"},{"internalType":"address","name":"_fxRoot","type":"address"},{"internalType":"address","name":"_fxChildTunnel","type":"address"}],"stateMutability":"nonpayable","type":"constructor"},{"inputs":[],"name":"SEND_MESSAGE_EVENT_SIG","outputs":[{"internalType":"bytes32","name":"","type":"bytes32"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"checkpointManager","outputs":[{"internalType":"contract ICheckpointManager","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"fxChildTunnel","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"fxRoot","outputs":[{"internalType":"contract IFxStateSender","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"l1BridgeAddress","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"bytes32","name":"","type":"bytes32"}],"name":"processedExits","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"bytes","name":"inputData","type":"bytes"}],"name":"receiveMessage","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"bytes","name":"_calldata","type":"bytes"}],"name":"sendCrossDomainMessage","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"_fxChildTunnel","type":"address"}],"name":"setFxChildTunnel","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"l1BridgeCaller","type":"address"},{"internalType":"bytes","name":"","type":"bytes"}],"name":"verifySender","outputs":[],"stateMutability":"view","type":"function"}]

Deployed Bytecode

0x608060405234801561001057600080fd5b50600436106100be5760003560e01c806399178dd811610076578063c0857ba01161005b578063c0857ba0146101d7578063de9b771f146101f7578063f953cec71461021757600080fd5b806399178dd8146101b1578063aea4e49e146101c457600080fd5b80635ab2a558116100a75780635ab2a55814610112578063607f2d421461015e578063972c49281461019157600080fd5b80630e387de6146100c3578063419cb550146100fd575b600080fd5b6100ea7f8c5261668696ce22758910d05bab8f186d6eb247ceac2af2e82c7dc17669b03681565b6040519081526020015b60405180910390f35b61011061010b366004611df8565b61022a565b005b6101397f00000000000000000000000022b1cbb8d98a01a3b71d034bb899775a76eb1cc281565b60405173ffffffffffffffffffffffffffffffffffffffff90911681526020016100f4565b61018161016c366004611e2d565b60036020526000908152604090205460ff1681565b60405190151581526020016100f4565b6002546101399073ffffffffffffffffffffffffffffffffffffffff1681565b6101106101bf366004611e68565b610257565b6101106101d2366004611eb8565b610305565b6001546101399073ffffffffffffffffffffffffffffffffffffffff1681565b6000546101399073ffffffffffffffffffffffffffffffffffffffff1681565b610110610225366004611df8565b6103f2565b6102543382604051602001610240929190611f05565b604051602081830303815290604052610408565b50565b73ffffffffffffffffffffffffffffffffffffffff82163014610301576040517f08c379a000000000000000000000000000000000000000000000000000000000815260206004820152602960248201527f4c315f504c474e5f5750523a2043616c6c6572206d757374206265207468697360448201527f20636f6e7472616374000000000000000000000000000000000000000000000060648201526084015b60405180910390fd5b5050565b60025473ffffffffffffffffffffffffffffffffffffffff16156103ab576040517f08c379a000000000000000000000000000000000000000000000000000000000815260206004820152602a60248201527f467842617365526f6f7454756e6e656c3a204348494c445f54554e4e454c5f4160448201527f4c52454144595f5345540000000000000000000000000000000000000000000060648201526084016102f8565b600280547fffffffffffffffffffffffff00000000000000000000000000000000000000001673ffffffffffffffffffffffffffffffffffffffff92909216919091179055565b60006103fd82610499565b90506103018161087b565b6000546002546040517fb472047700000000000000000000000000000000000000000000000000000000815273ffffffffffffffffffffffffffffffffffffffff9283169263b472047792610464929116908590600401611f05565b600060405180830381600087803b15801561047e57600080fd5b505af1158015610492573d6000803e3d6000fd5b5050505050565b606060006104a683610995565b905060006104b3826109f4565b905060006104c083610a23565b90506000816104ce84610a4c565b6104d786610c3a565b6040516020016104e993929190611f73565b604080517fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffe081840301815291815281516020928301206000818152600390935291205490915060ff16156105be576040517f08c379a0000000000000000000000000000000000000000000000000000000008152602060048201526024808201527f4678526f6f7454756e6e656c3a20455849545f414c52454144595f50524f434560448201527f535345440000000000000000000000000000000000000000000000000000000060648201526084016102f8565b600081815260036020526040812080547fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff001660011790556105fe85610c56565b9050600061060b82610da0565b905061061681610e30565b60025473ffffffffffffffffffffffffffffffffffffffff9081169116146106c0576040517f08c379a000000000000000000000000000000000000000000000000000000000815260206004820152602560248201527f4678526f6f7454756e6e656c3a20494e56414c49445f46585f4348494c445f5460448201527f554e4e454c00000000000000000000000000000000000000000000000000000060648201526084016102f8565b60006106cb87610e59565b90506106eb6106db846020015190565b876106e58a610e75565b84610e91565b610777576040517f08c379a000000000000000000000000000000000000000000000000000000000815260206004820152602360248201527f4678526f6f7454756e6e656c3a20494e56414c49445f524543454950545f505260448201527f4f4f46000000000000000000000000000000000000000000000000000000000060648201526084016102f8565b6107a58561078489611148565b61078d8a611164565b846107978c611180565b6107a08d61119c565b6111b8565b5060006107b18361132d565b90507f8c5261668696ce22758910d05bab8f186d6eb247ceac2af2e82c7dc17669b0366107e76107e2836000611369565b6113a1565b1461084e576040517f08c379a000000000000000000000000000000000000000000000000000000000815260206004820152601f60248201527f4678526f6f7454756e6e656c3a20494e56414c49445f5349474e41545552450060448201526064016102f8565b60006108598461141c565b80602001905181019061086c9190611fa0565b9b9a5050505050505050505050565b60007f00000000000000000000000022b1cbb8d98a01a3b71d034bb899775a76eb1cc273ffffffffffffffffffffffffffffffffffffffff16826040516108c29190612017565b6000604051808303816000865af19150503d80600081146108ff576040519150601f19603f3d011682016040523d82523d6000602084013e610904565b606091505b5050905080610301576040517f08c379a000000000000000000000000000000000000000000000000000000000815260206004820152602560248201527f4c315f504c474e5f5750523a2043616c6c20746f204c3120427269646765206660448201527f61696c656400000000000000000000000000000000000000000000000000000060648201526084016102f8565b60408051602081019091526060815260006109df6109da8460408051808201825260008082526020918201528151808301909252825182529182019181019190915290565b611438565b60408051602081019091529081529392505050565b6060610a1d8260000151600881518110610a1057610a10612033565b602002602001015161154e565b92915050565b6000610a1d8260000151600281518110610a3f57610a3f612033565b60200260200101516113a1565b60408051602081019091526000815281516060919015610a1d57600080610a746000866115eb565b60f81c90506001811480610a8b57508060ff166003145b15610b4b57600185516002610aa09190612091565b610aaa91906120ce565b67ffffffffffffffff811115610ac257610ac2611cde565b6040519080825280601f01601f191660200182016040528015610aec576020820181803683370190505b5092506000610afc6001876115eb565b90508084600081518110610b1257610b12612033565b60200101907effffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff1916908160001a9053506001925050610baf565b600285516002610b5b9190612091565b610b6591906120ce565b67ffffffffffffffff811115610b7d57610b7d611cde565b6040519080825280601f01601f191660200182016040528015610ba7576020820181803683370190505b509250600091505b60ff82165b8351811015610c3157610bde610bcd60ff8516836120ce565b610bd89060026120e5565b876115eb565b848281518110610bf057610bf0612033565b60200101907effffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff1916908160001a90535080610c29816120fd565b915050610bb4565b50505092915050565b6000610a1d8260000151600981518110610a3f57610a3f612033565b610c7a60405180606001604052806060815260200160608152602001600081525090565b610c948260000151600681518110610a1057610a10612033565b602082810182905260408051808201825260008082529083015280518082019091528251815291810190820152610cca8161166c565b15610cdf57610cd881611438565b8252610d8c565b60208201518051600090610cf5906001906120ce565b67ffffffffffffffff811115610d0d57610d0d611cde565b6040519080825280601f01601f191660200182016040528015610d37576020820181803683370190505b509050600080836021019150826020019050610d55828285516116a5565b604080518082018252600080825260209182015281518083019092528451825280850190820152610d8590611438565b8652505050505b610d9583610c3a565b604083015250919050565b604080516080810182526000918101828152606080830193909352815260208101919091526000610dee8360000151600381518110610de157610de1612033565b6020026020010151611438565b836040015181518110610e0357610e03612033565b602002602001015190506040518060400160405280828152602001610e2783611438565b90529392505050565b6000610a1d8260200151600081518110610e4c57610e4c612033565b6020026020010151611720565b6000610a1d8260000151600581518110610a3f57610a3f612033565b6060610a1d8260000151600781518110610a1057610a10612033565b600080610ec58460408051808201825260008082526020918201528151808301909252825182529182019181019190915290565b90506000610ed282611438565b905060608085600080610ee48b610a4c565b9050805160001415610f00576000975050505050505050611140565b60005b8651811015611137578151831115610f2657600098505050505050505050611140565b610f48878281518110610f3b57610f3b612033565b602002602001015161173a565b955085805190602001208414610f6957600098505050505050505050611140565b610f7e878281518110610de157610de1612033565b9450845160111415611053578151831415610fe0578c80519060200120610fb186601081518110610a1057610a10612033565b805190602001201415610fcf57600198505050505050505050611140565b600098505050505050505050611140565b6000828481518110610ff457610ff4612033565b016020015160f81c905060108111156110195760009950505050505050505050611140565b61103e868260ff168151811061103157611031612033565b60200260200101516117ba565b945061104b6001856120e5565b935050611125565b845160021415610fcf57600061107f61107887600081518110610a1057610a10612033565b84866117e8565b835190915061108e82866120e5565b14156110e3578d805190602001206110b287600181518110610a1057610a10612033565b8051906020012014156110d15760019950505050505050505050611140565b60009950505050505050505050611140565b806110fa5760009950505050505050505050611140565b61110481856120e5565b935061111c8660018151811061103157611031612033565b94506111259050565b8061112f816120fd565b915050610f03565b50505050505050505b949350505050565b6000610a1d8260000151600381518110610a3f57610a3f612033565b6000610a1d8260000151600481518110610a3f57610a3f612033565b6000610a1d8260000151600081518110610a3f57610a3f612033565b6060610a1d8260000151600181518110610a1057610a10612033565b6001546040517f41539d4a0000000000000000000000000000000000000000000000000000000081526004810184905260009182918291829173ffffffffffffffffffffffffffffffffffffffff909116906341539d4a9060240160a06040518083038186803b15801561122b57600080fd5b505afa15801561123f573d6000803e3d6000fd5b505050506040513d601f19601f820116820180604052508101906112639190612136565b50935050925092506112ba828b61127a91906120ce565b6040805160208082018f90528183018e9052606082018d905260808083018d90528351808403909101815260a09092019092528051910120908588611921565b611320576040517f08c379a000000000000000000000000000000000000000000000000000000000815260206004820152601c60248201527f4678526f6f7454756e6e656c3a20494e56414c49445f4845414445520000000060448201526064016102f8565b9998505050505050505050565b60408051602081019091526060815260405180602001604052806113618460200151600181518110610de157610de1612033565b905292915050565b6040805180820190915260008082526020820152825180518390811061139157611391612033565b6020026020010151905092915050565b8051600090158015906113b657508151602110155b6113bf57600080fd5b60006113ce8360200151611acb565b905060008184600001516113e291906120ce565b90506000808386602001516113f791906120e5565b905080519150602083101561141357826020036101000a820491505b50949350505050565b6060610a1d8260200151600281518110610a1057610a10612033565b60606114438261166c565b61144c57600080fd5b600061145783611b4d565b905060008167ffffffffffffffff81111561147457611474611cde565b6040519080825280602002602001820160405280156114b957816020015b60408051808201909152600080825260208201528152602001906001900390816114925790505b50905060006114cb8560200151611acb565b85602001516114da91906120e5565b90506000805b84811015611543576114f183611bd0565b915060405180604001604052808381526020018481525084828151811061151a5761151a612033565b602090810291909101015261152f82846120e5565b92508061153b816120fd565b9150506114e0565b509195945050505050565b805160609061155c57600080fd5b600061156b8360200151611acb565b9050600081846000015161157f91906120ce565b905060008167ffffffffffffffff81111561159c5761159c611cde565b6040519080825280601f01601f1916602001820160405280156115c6576020820181803683370190505b50905060008160200190506114138487602001516115e491906120e5565b8285611c92565b60006115f86002846121b2565b156116325760108261160b6002866121c6565b8151811061161b5761161b612033565b016020015161162d919060f81c6121da565b611662565b6010826116406002866121c6565b8151811061165057611650612033565b0160200151611662919060f81c6121fc565b60f81b9392505050565b805160009061167d57506000919050565b6020820151805160001a9060c082101561169b575060009392505050565b5060019392505050565b806116af57505050565b602081106116e757825182526116c66020846120e5565b92506116d36020836120e5565b91506116e06020826120ce565b90506116af565b600060016116f68360206120ce565b6117029061010061233e565b61170c91906120ce565b935183518516941916939093179091525050565b805160009060151461173157600080fd5b610a1d826113a1565b60606000826000015167ffffffffffffffff81111561175b5761175b611cde565b6040519080825280601f01601f191660200182016040528015611785576020820181803683370190505b5090508051600014156117985792915050565b60008160200190506117b38460200151828660000151611c92565b5092915050565b80516000906021146117cb57600080fd5b600080836020015160016117df91906120e5565b51949350505050565b600080806117f586610a4c565b90506000815167ffffffffffffffff81111561181357611813611cde565b6040519080825280601f01601f19166020018201604052801561183d576020820181803683370190505b509050845b825161184e90876120e5565b8110156118f157600087828151811061186957611869612033565b01602001517fff00000000000000000000000000000000000000000000000000000000000000169050808361189e89856120ce565b815181106118ae576118ae612033565b60200101907effffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff1916908160001a9053505080806118e9906120fd565b915050611842565b508080519060200120828051906020012014156119115781519250611916565b600092505b509095945050505050565b60006020825161193191906121b2565b15611998576040517f08c379a000000000000000000000000000000000000000000000000000000000815260206004820152601460248201527f496e76616c69642070726f6f66206c656e67746800000000000000000000000060448201526064016102f8565b6000602083516119a891906121c6565b90506119b581600261233e565b8510611a1d576040517f08c379a000000000000000000000000000000000000000000000000000000000815260206004820152601560248201527f4c65616620696e64657820697320746f6f20626967000000000000000000000060448201526064016102f8565b60008660205b85518111611abd57858101519250611a3c6002896121b2565b611a71576040805160208101849052908101849052606001604051602081830303815290604052805190602001209150611a9e565b60408051602081018590529081018390526060016040516020818303038152906040528051906020012091505b611aa96002896121c6565b9750611ab66020826120e5565b9050611a23565b509094149695505050505050565b8051600090811a6080811015611ae45750600092915050565b60b8811080611aff575060c08110801590611aff575060f881105b15611b0d5750600192915050565b60c0811015611b4157611b22600160b861234a565b611b2f9060ff16826120ce565b611b3a9060016120e5565b9392505050565b611b22600160f861234a565b8051600090611b5e57506000919050565b600080611b6e8460200151611acb565b8460200151611b7d91906120e5565b9050600084600001518560200151611b9591906120e5565b90505b80821015611bc757611ba982611bd0565b611bb390836120e5565b915082611bbf816120fd565b935050611b98565b50909392505050565b80516000908190811a6080811015611beb57600191506117b3565b60b8811015611c1157611bff6080826120ce565b611c0a9060016120e5565b91506117b3565b60c0811015611c3e5760b78103600185019450806020036101000a855104600182018101935050506117b3565b60f8811015611c5257611bff60c0826120ce565b60019390930151602084900360f7016101000a90049092017fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff0a0192915050565b80611c9c57505050565b60208110611cd45782518252611cb36020846120e5565b9250611cc06020836120e5565b9150611ccd6020826120ce565b9050611c9c565b806116e757505050565b7f4e487b7100000000000000000000000000000000000000000000000000000000600052604160045260246000fd5b604051601f82017fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffe016810167ffffffffffffffff81118282101715611d5457611d54611cde565b604052919050565b600067ffffffffffffffff821115611d7657611d76611cde565b50601f017fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffe01660200190565b600082601f830112611db357600080fd5b8135611dc6611dc182611d5c565b611d0d565b818152846020838601011115611ddb57600080fd5b816020850160208301376000918101602001919091529392505050565b600060208284031215611e0a57600080fd5b813567ffffffffffffffff811115611e2157600080fd5b61114084828501611da2565b600060208284031215611e3f57600080fd5b5035919050565b73ffffffffffffffffffffffffffffffffffffffff8116811461025457600080fd5b60008060408385031215611e7b57600080fd5b8235611e8681611e46565b9150602083013567ffffffffffffffff811115611ea257600080fd5b611eae85828601611da2565b9150509250929050565b600060208284031215611eca57600080fd5b8135611b3a81611e46565b60005b83811015611ef0578181015183820152602001611ed8565b83811115611eff576000848401525b50505050565b73ffffffffffffffffffffffffffffffffffffffff831681526040602082015260008251806040840152611f40816060850160208701611ed5565b601f017fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffe016919091016060019392505050565b83815260008351611f8b816020850160208801611ed5565b60209201918201929092526040019392505050565b600060208284031215611fb257600080fd5b815167ffffffffffffffff811115611fc957600080fd5b8201601f81018413611fda57600080fd5b8051611fe8611dc182611d5c565b818152856020838501011115611ffd57600080fd5b61200e826020830160208601611ed5565b95945050505050565b60008251612029818460208701611ed5565b9190910192915050565b7f4e487b7100000000000000000000000000000000000000000000000000000000600052603260045260246000fd5b7f4e487b7100000000000000000000000000000000000000000000000000000000600052601160045260246000fd5b6000817fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff04831182151516156120c9576120c9612062565b500290565b6000828210156120e0576120e0612062565b500390565b600082198211156120f8576120f8612062565b500190565b60007fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff82141561212f5761212f612062565b5060010190565b600080600080600060a0868803121561214e57600080fd5b85519450602086015193506040860151925060608601519150608086015161217581611e46565b809150509295509295909350565b7f4e487b7100000000000000000000000000000000000000000000000000000000600052601260045260246000fd5b6000826121c1576121c1612183565b500690565b6000826121d5576121d5612183565b500490565b600060ff8316806121ed576121ed612183565b8060ff84160691505092915050565b600060ff83168061220f5761220f612183565b8060ff84160491505092915050565b600181815b8085111561227757817fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff0482111561225d5761225d612062565b8085161561226a57918102915b93841c9390800290612223565b509250929050565b60008261228e57506001610a1d565b8161229b57506000610a1d565b81600181146122b157600281146122bb576122d7565b6001915050610a1d565b60ff8411156122cc576122cc612062565b50506001821b610a1d565b5060208310610133831016604e8410600b84101617156122fa575081810a610a1d565b612304838361221e565b807fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff0482111561233657612336612062565b029392505050565b6000611b3a838361227f565b600060ff821660ff84168082101561236457612364612062565b9003939250505056fea264697066735822122081110cdfc9b5386506a3c94a7a0be3f4a809575d4c22c05008a53857a46605fc64736f6c63430008090033

Block Transaction Difficulty Gas Used Reward
View All Blocks Produced

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

Validator Index Block Amount
View All Withdrawals

Transaction Hash Block Value Eth2 PubKey Valid
View All Deposits
Loading...
Loading
[ Download: CSV Export  ]

A contract address hosts a smart contract, which is a set of code stored on the blockchain that runs when predetermined conditions are met. Learn more about addresses in our Knowledge Base.