Sepolia Testnet

Contract

0xF38A9a34515D3603a9180599e959f184095e8F24
Transaction Hash
Method
Block
From
To
Egress63404852024-07-19 18:37:3682 days ago1721414256IN
0xF38A9a34...4095e8F24
0.00024025 ETH0.000876072.30477131
Egress63336932024-07-18 14:23:0083 days ago1721312580IN
0xF38A9a34...4095e8F24
0.00483963 ETH0.002173355.80117392
Egress63336912024-07-18 14:22:2483 days ago1721312544IN
0xF38A9a34...4095e8F24
0.00251215 ETH0.001137425.71436019
Egress63296762024-07-17 21:48:2484 days ago1721252904IN
0xF38A9a34...4095e8F24
0.00078827 ETH0.000587951.50086719
Egress63228572024-07-16 19:00:4885 days ago1721156448IN
0xF38A9a34...4095e8F24
0.00057331 ETH0.000704231.85268518
Egress63228512024-07-16 18:59:3685 days ago1721156376IN
0xF38A9a34...4095e8F24
0.00057309 ETH0.000719311.81397404
Egress63226482024-07-16 18:12:2485 days ago1721153544IN
0xF38A9a34...4095e8F24
0.00057443 ETH0.000694211.77212245
Egress62856042024-07-10 21:32:1291 days ago1720647132IN
0xF38A9a34...4095e8F24
0.00029723 ETH0.003041438.40457819
Egress61847622024-06-25 16:41:24106 days ago1719333684IN
0xF38A9a34...4095e8F24
0.00070678 ETH0.0068824818.10693279
Egress61364402024-06-18 22:17:36113 days ago1718749056IN
0xF38A9a34...4095e8F24
0.00123281 ETH0.000551291.50020932
Egress61363682024-06-18 22:02:36113 days ago1718748156IN
0xF38A9a34...4095e8F24
0.00045392 ETH0.000505881.50074659
Egress61363502024-06-18 21:58:24113 days ago1718747904IN
0xF38A9a34...4095e8F24
0.00125093 ETH0.000543091.50077892
Egress61362332024-06-18 21:34:12113 days ago1718746452IN
0xF38A9a34...4095e8F24
0.00046094 ETH0.000505781.50045671
Egress61307652024-06-18 2:32:12113 days ago1718677932IN
0xF38A9a34...4095e8F24
0.00049446 ETH0.000503141.51784707
Egress61305722024-06-18 1:50:12113 days ago1718675412IN
0xF38A9a34...4095e8F24
0.0007211 ETH0.000575941.50782331
Egress61303172024-06-18 0:56:36114 days ago1718672196IN
0xF38A9a34...4095e8F24
0.00142007 ETH0.000543221.50113316
Egress61301602024-06-18 0:22:36114 days ago1718670156IN
0xF38A9a34...4095e8F24
0.00125729 ETH0.000551251.50011532
Egress61300562024-06-18 0:00:48114 days ago1718668848IN
0xF38A9a34...4095e8F24
0.00049446 ETH0.000535781.5000231
Egress61299122024-06-17 23:30:48114 days ago1718667048IN
0xF38A9a34...4095e8F24
0.00050237 ETH0.000527371.50000562
Egress61067562024-06-14 14:37:48117 days ago1718375868IN
0xF38A9a34...4095e8F24
0.00159673 ETH0.001192163.14270277
Egress61067392024-06-14 14:34:12117 days ago1718375652IN
0xF38A9a34...4095e8F24
0.00126764 ETH0.00112273.10244997
Egress57063252024-04-15 21:58:48177 days ago1713218328IN
0xF38A9a34...4095e8F24
0.00099667 ETH0.000541651.50053115
Egress56298732024-04-04 21:00:36188 days ago1712264436IN
0xF38A9a34...4095e8F24
0.00099667 ETH0.000550561.50000001
Egress56298642024-04-04 20:58:36188 days ago1712264316IN
0xF38A9a34...4095e8F24
0.00028726 ETH0.000550561.50000001
Egress56298552024-04-04 20:56:48188 days ago1712264208IN
0xF38A9a34...4095e8F24
0.00187533 ETH0.000576211.50000001
View all transactions

Latest 25 internal transactions (View All)

Advanced mode:
Parent Transaction Hash Block From To
63404852024-07-19 18:37:3682 days ago1721414256
0xF38A9a34...4095e8F24
0.00024025 ETH
63336932024-07-18 14:23:0083 days ago1721312580
0xF38A9a34...4095e8F24
0.00483963 ETH
63296762024-07-17 21:48:2484 days ago1721252904
0xF38A9a34...4095e8F24
0.00078827 ETH
63228572024-07-16 19:00:4885 days ago1721156448
0xF38A9a34...4095e8F24
0.00057331 ETH
63228512024-07-16 18:59:3685 days ago1721156376
0xF38A9a34...4095e8F24
0.00057309 ETH
63226482024-07-16 18:12:2485 days ago1721153544
0xF38A9a34...4095e8F24
0.00057443 ETH
62856042024-07-10 21:32:1291 days ago1720647132
0xF38A9a34...4095e8F24
0.00029723 ETH
61847622024-06-25 16:41:24106 days ago1719333684
0xF38A9a34...4095e8F24
0.00070678 ETH
61364402024-06-18 22:17:36113 days ago1718749056
0xF38A9a34...4095e8F24
0.00123281 ETH
61363682024-06-18 22:02:36113 days ago1718748156
0xF38A9a34...4095e8F24
0.00045392 ETH
61363502024-06-18 21:58:24113 days ago1718747904
0xF38A9a34...4095e8F24
0.00125093 ETH
61363172024-06-18 21:51:36113 days ago1718747496
0xF38A9a34...4095e8F24
 Contract Creation0 ETH
61362332024-06-18 21:34:12113 days ago1718746452
0xF38A9a34...4095e8F24
0.00046094 ETH
61345292024-06-18 15:35:36113 days ago1718724936
0xF38A9a34...4095e8F24
 Contract Creation0 ETH
61310842024-06-18 3:40:36113 days ago1718682036
0xF38A9a34...4095e8F24
 Contract Creation0 ETH
61310062024-06-18 3:24:12113 days ago1718681052
0xF38A9a34...4095e8F24
 Contract Creation0 ETH
61307652024-06-18 2:32:12113 days ago1718677932
0xF38A9a34...4095e8F24
0.00049446 ETH
61305722024-06-18 1:50:12113 days ago1718675412
0xF38A9a34...4095e8F24
0.0007211 ETH
61303172024-06-18 0:56:36114 days ago1718672196
0xF38A9a34...4095e8F24
0.00142007 ETH
61301602024-06-18 0:22:36114 days ago1718670156
0xF38A9a34...4095e8F24
0.00125729 ETH
61300562024-06-18 0:00:48114 days ago1718668848
0xF38A9a34...4095e8F24
0.00049446 ETH
61299122024-06-17 23:30:48114 days ago1718667048
0xF38A9a34...4095e8F24
0.00050237 ETH
61067562024-06-14 14:37:48117 days ago1718375868
0xF38A9a34...4095e8F24
0.00159673 ETH
61067392024-06-14 14:34:12117 days ago1718375652
0xF38A9a34...4095e8F24
0.00126764 ETH
57063252024-04-15 21:58:48177 days ago1713218328
0xF38A9a34...4095e8F24
0.00099667 ETH
View All Internal Transactions
Loading...
Loading

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

Contract Name:
Diamond

Compiler Version
v0.8.9+commit.e5eed63a

Optimization Enabled:
Yes with 200 runs

Other Settings:
default evmVersion
File 1 of 4 : Diamond.sol
// SPDX-License-Identifier: MIT
pragma solidity ^0.8.9;

/******************************************************************************\
* Author: Nick Mudge <[email protected]> (https://twitter.com/mudgen)
* EIP-2535 Diamonds: https://eips.ethereum.org/EIPS/eip-2535
*
* Implementation of a diamond.
/******************************************************************************/

import "./libraries/LibDiamond.sol";
import "./interfaces/IDiamondCut.sol";
import "./interfaces/IDiamondLoupe.sol";

contract Diamond {

    constructor(IDiamondCut.FacetCut[] memory _diamondCut, address _init, bytes memory _calldata) payable {
        LibDiamond.diamondCut(_diamondCut, _init, _calldata);
    }

    // Find facet for function that is called and execute the
    // function if a facet is found and return any value.
    fallback() external payable {
        LibDiamond.DiamondStorage storage ds;
        bytes32 position = LibDiamond.DIAMOND_STORAGE_POSITION;
        // get diamond storage
        assembly {
            ds.slot := position
        }
        // get facet from function selector
        address facet = address(bytes20(ds.facets[msg.sig]));
        require(facet != address(0), "Diamond: Function does not exist");
        // Execute external function from facet using delegatecall and return any value.
        assembly {
            // copy function selector and any arguments
            calldatacopy(0, 0, calldatasize())
            // execute function call using the facet
            let result := delegatecall(gas(), facet, 0, calldatasize(), 0, 0)
            // get any return value
            returndatacopy(0, 0, returndatasize())
            // return any return value or error back to the caller
            switch result
                case 0 {
                    revert(0, returndatasize())
                }
                default {
                    return(0, returndatasize())
                }
        }
    }

    receive() external payable {}
}

File 2 of 4 : IDiamondCut.sol
// SPDX-License-Identifier: MIT
pragma solidity ^0.8.9;

/******************************************************************************\
* Author: Nick Mudge <[email protected]> (https://twitter.com/mudgen)
* EIP-2535 Diamonds: https://eips.ethereum.org/EIPS/eip-2535
/******************************************************************************/

interface IDiamondCut {
    enum FacetCutAction {Add, Replace, Remove}
    // Add=0, Replace=1, Remove=2

    struct FacetCut {
        address facetAddress;
        FacetCutAction action;
        bytes4[] functionSelectors;
    }

    event DiamondCut(FacetCut[] _diamondCut, address _init, bytes _calldata);
}

File 3 of 4 : IDiamondLoupe.sol
// SPDX-License-Identifier: MIT
pragma solidity ^0.8.9;

/******************************************************************************\
* Author: Nick Mudge <[email protected]> (https://twitter.com/mudgen)
* EIP-2535 Diamonds: https://eips.ethereum.org/EIPS/eip-2535
/******************************************************************************/

// A loupe is a small magnifying glass used to look at diamonds.
// These functions look at diamonds
interface IDiamondLoupe {
    /// These functions are expected to be called frequently
    /// by tools.

    struct Facet {
        address facetAddress;
        bytes4[] functionSelectors;
    }

    /// @notice Gets all facet addresses and their four byte function selectors.
    /// @return facets_ Facet
    function facets() external view returns (Facet[] memory facets_);

    /// @notice Gets all the function selectors supported by a specific facet.
    /// @param _facet The facet address.
    /// @return facetFunctionSelectors_
    function facetFunctionSelectors(address _facet) external view returns (bytes4[] memory facetFunctionSelectors_);

    /// @notice Get all the facet addresses used by a diamond.
    /// @return facetAddresses_
    function facetAddresses() external view returns (address[] memory facetAddresses_);

    /// @notice Gets the facet that supports the given selector.
    /// @dev If facet is not found return address(0).
    /// @param _functionSelector The function selector.
    /// @return facetAddress_ The facet address.
    function facetAddress(bytes4 _functionSelector) external view returns (address facetAddress_);
}

File 4 of 4 : LibDiamond.sol
// SPDX-License-Identifier: MIT
pragma solidity ^0.8.9;

/******************************************************************************\
* Author: Nick Mudge <[email protected]> (https://twitter.com/mudgen)
* EIP-2535 Diamonds: https://eips.ethereum.org/EIPS/eip-2535
/******************************************************************************/
import { IDiamondCut } from "../interfaces/IDiamondCut.sol";

library LibDiamond {
    bytes32 constant DIAMOND_STORAGE_POSITION = keccak256("diamond.standard.diamond.storage");

    struct DiamondStorage {
        // maps function selectors to the facets that execute the functions.
        // and maps the selectors to their position in the selectorSlots array.
        // func selector => address facet, selector position
        mapping(bytes4 => bytes32) facets;
        // array of slots of function selectors.
        // each slot holds 8 function selectors.
        mapping(uint256 => bytes32) selectorSlots;
        // The number of function selectors in selectorSlots
        uint16 selectorCount;
    }

    function diamondStorage() internal pure returns (DiamondStorage storage ds) {
        bytes32 position = DIAMOND_STORAGE_POSITION;
        assembly {
            ds.slot := position
        }
    }

    event DiamondCut(IDiamondCut.FacetCut[] _diamondCut, address _init, bytes _calldata);

    bytes32 constant CLEAR_ADDRESS_MASK = bytes32(uint256(0xffffffffffffffffffffffff));
    bytes32 constant CLEAR_SELECTOR_MASK = bytes32(uint256(0xffffffff << 224));

    // Internal function version of diamondCut
    // This code is almost the same as the external diamondCut,
    // except it is using 'Facet[] memory _diamondCut' instead of
    // 'Facet[] calldata _diamondCut'.
    // The code is duplicated to prevent copying calldata to memory which
    // causes an error for a two dimensional array.
    function diamondCut(
        IDiamondCut.FacetCut[] memory _diamondCut,
        address _init,
        bytes memory _calldata
    ) internal {
        DiamondStorage storage ds = diamondStorage();
        uint256 originalSelectorCount = ds.selectorCount;
        uint256 selectorCount = originalSelectorCount;
        bytes32 selectorSlot;
        // Check if last selector slot is not full
        // "selectorCount & 7" is a gas efficient modulo by eight "selectorCount % 8"
        if (selectorCount & 7 > 0) {
            // get last selectorSlot
            // "selectorSlot >> 3" is a gas efficient division by 8 "selectorSlot / 8"
            selectorSlot = ds.selectorSlots[selectorCount >> 3];
        }
        // loop through diamond cut
        for (uint256 facetIndex; facetIndex < _diamondCut.length; facetIndex++) {
            (selectorCount, selectorSlot) = addReplaceRemoveFacetSelectors(
                selectorCount,
                selectorSlot,
                _diamondCut[facetIndex].facetAddress,
                _diamondCut[facetIndex].action,
                _diamondCut[facetIndex].functionSelectors
            );
        }
        if (selectorCount != originalSelectorCount) {
            ds.selectorCount = uint16(selectorCount);
        }
        // If last selector slot is not full
        // "selectorCount & 7" is a gas efficient modulo by eight "selectorCount % 8"
        if (selectorCount & 7 > 0) {
            // "selectorSlot >> 3" is a gas efficient division by 8 "selectorSlot / 8"
            ds.selectorSlots[selectorCount >> 3] = selectorSlot;
        }
        emit DiamondCut(_diamondCut, _init, _calldata);
        initializeDiamondCut(_init, _calldata);
    }

    function addReplaceRemoveFacetSelectors(
        uint256 _selectorCount,
        bytes32 _selectorSlot,
        address _newFacetAddress,
        IDiamondCut.FacetCutAction _action,
        bytes4[] memory _selectors
    ) internal returns (uint256, bytes32) {
        DiamondStorage storage ds = diamondStorage();
        require(_selectors.length > 0, "LibDiamondCut: No selectors in facet to cut");
        if (_action == IDiamondCut.FacetCutAction.Add) {
            enforceHasContractCode(_newFacetAddress, "LibDiamondCut: Add facet has no code");
            for (uint256 selectorIndex; selectorIndex < _selectors.length; selectorIndex++) {
                bytes4 selector = _selectors[selectorIndex];
                bytes32 oldFacet = ds.facets[selector];
                require(address(bytes20(oldFacet)) == address(0), "LibDiamondCut: Can't add function that already exists");
                // add facet for selector
                ds.facets[selector] = bytes20(_newFacetAddress) | bytes32(_selectorCount);
                // "_selectorCount & 7" is a gas efficient modulo by eight "_selectorCount % 8"
                uint256 selectorInSlotPosition = (_selectorCount & 7) << 5;
                // clear selector position in slot and add selector
                _selectorSlot = (_selectorSlot & ~(CLEAR_SELECTOR_MASK >> selectorInSlotPosition)) | (bytes32(selector) >> selectorInSlotPosition);
                // if slot is full then write it to storage
                if (selectorInSlotPosition == 224) {
                    // "_selectorSlot >> 3" is a gas efficient division by 8 "_selectorSlot / 8"
                    ds.selectorSlots[_selectorCount >> 3] = _selectorSlot;
                    _selectorSlot = 0;
                }
                _selectorCount++;
            }
        } else if (_action == IDiamondCut.FacetCutAction.Replace) {
            enforceHasContractCode(_newFacetAddress, "LibDiamondCut: Replace facet has no code");
            for (uint256 selectorIndex; selectorIndex < _selectors.length; selectorIndex++) {
                bytes4 selector = _selectors[selectorIndex];
                bytes32 oldFacet = ds.facets[selector];
                address oldFacetAddress = address(bytes20(oldFacet));
                // only useful if immutable functions exist
                require(oldFacetAddress != address(this), "LibDiamondCut: Can't replace immutable function");
                require(oldFacetAddress != _newFacetAddress, "LibDiamondCut: Can't replace function with same function");
                require(oldFacetAddress != address(0), "LibDiamondCut: Can't replace function that doesn't exist");
                // replace old facet address
                ds.facets[selector] = (oldFacet & CLEAR_ADDRESS_MASK) | bytes20(_newFacetAddress);
            }
        } else if (_action == IDiamondCut.FacetCutAction.Remove) {
            require(_newFacetAddress == address(0), "LibDiamondCut: Remove facet address must be address(0)");
            // "_selectorCount >> 3" is a gas efficient division by 8 "_selectorCount / 8"
            uint256 selectorSlotCount = _selectorCount >> 3;
            // "_selectorCount & 7" is a gas efficient modulo by eight "_selectorCount % 8"
            uint256 selectorInSlotIndex = _selectorCount & 7;
            for (uint256 selectorIndex; selectorIndex < _selectors.length; selectorIndex++) {
                if (_selectorSlot == 0) {
                    // get last selectorSlot
                    selectorSlotCount--;
                    _selectorSlot = ds.selectorSlots[selectorSlotCount];
                    selectorInSlotIndex = 7;
                } else {
                    selectorInSlotIndex--;
                }
                bytes4 lastSelector;
                uint256 oldSelectorsSlotCount;
                uint256 oldSelectorInSlotPosition;
                // adding a block here prevents stack too deep error
                {
                    bytes4 selector = _selectors[selectorIndex];
                    bytes32 oldFacet = ds.facets[selector];
                    require(address(bytes20(oldFacet)) != address(0), "LibDiamondCut: Can't remove function that doesn't exist");
                    // only useful if immutable functions exist
                    require(address(bytes20(oldFacet)) != address(this), "LibDiamondCut: Can't remove immutable function");
                    // replace selector with last selector in ds.facets
                    // gets the last selector
                    lastSelector = bytes4(_selectorSlot << (selectorInSlotIndex << 5));
                    if (lastSelector != selector) {
                        // update last selector slot position info
                        ds.facets[lastSelector] = (oldFacet & CLEAR_ADDRESS_MASK) | bytes20(ds.facets[lastSelector]);
                    }
                    delete ds.facets[selector];
                    uint256 oldSelectorCount = uint16(uint256(oldFacet));
                    // "oldSelectorCount >> 3" is a gas efficient division by 8 "oldSelectorCount / 8"
                    oldSelectorsSlotCount = oldSelectorCount >> 3;
                    // "oldSelectorCount & 7" is a gas efficient modulo by eight "oldSelectorCount % 8"
                    oldSelectorInSlotPosition = (oldSelectorCount & 7) << 5;
                }
                if (oldSelectorsSlotCount != selectorSlotCount) {
                    bytes32 oldSelectorSlot = ds.selectorSlots[oldSelectorsSlotCount];
                    // clears the selector we are deleting and puts the last selector in its place.
                    oldSelectorSlot =
                        (oldSelectorSlot & ~(CLEAR_SELECTOR_MASK >> oldSelectorInSlotPosition)) |
                        (bytes32(lastSelector) >> oldSelectorInSlotPosition);
                    // update storage with the modified slot
                    ds.selectorSlots[oldSelectorsSlotCount] = oldSelectorSlot;
                } else {
                    // clears the selector we are deleting and puts the last selector in its place.
                    _selectorSlot =
                        (_selectorSlot & ~(CLEAR_SELECTOR_MASK >> oldSelectorInSlotPosition)) |
                        (bytes32(lastSelector) >> oldSelectorInSlotPosition);
                }
                if (selectorInSlotIndex == 0) {
                    delete ds.selectorSlots[selectorSlotCount];
                    _selectorSlot = 0;
                }
            }
            _selectorCount = selectorSlotCount * 8 + selectorInSlotIndex;
        } else {
            revert("LibDiamondCut: Incorrect FacetCutAction");
        }
        return (_selectorCount, _selectorSlot);
    }

    function initializeDiamondCut(address _init, bytes memory _calldata) internal {
        if (_init == address(0)) {
            require(_calldata.length == 0, "LibDiamondCut: _init is address(0) but_calldata is not empty");
        } else {
            require(_calldata.length > 0, "LibDiamondCut: _calldata is empty but _init is not address(0)");
            if (_init != address(this)) {
                enforceHasContractCode(_init, "LibDiamondCut: _init address has no code");
            }
            (bool success, bytes memory error) = _init.delegatecall(_calldata);
            if (!success) {
                if (error.length > 0) {
                    // bubble up the error
                    revert(string(error));
                } else {
                    revert("LibDiamondCut: _init function reverted");
                }
            }
        }
    }

    function enforceHasContractCode(address _contract, string memory _errorMessage) internal view {
        uint256 contractSize;
        assembly {
            contractSize := extcodesize(_contract)
        }
        require(contractSize > 0, _errorMessage);
    }
}

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

Contract ABI

[{"inputs":[{"components":[{"internalType":"address","name":"facetAddress","type":"address"},{"internalType":"enum IDiamondCut.FacetCutAction","name":"action","type":"uint8"},{"internalType":"bytes4[]","name":"functionSelectors","type":"bytes4[]"}],"internalType":"struct IDiamondCut.FacetCut[]","name":"_diamondCut","type":"tuple[]"},{"internalType":"address","name":"_init","type":"address"},{"internalType":"bytes","name":"_calldata","type":"bytes"}],"stateMutability":"payable","type":"constructor"},{"stateMutability":"payable","type":"fallback"},{"stateMutability":"payable","type":"receive"}]

Deployed Bytecode

0x60806040523661000b57005b600080356001600160e01b03191681527fc8fcad8db84d3cc18b4c41d551ea0ee66dd599cde068d998e57d5e09332c131c6020819052604090912054819060601c8061009e5760405162461bcd60e51b815260206004820181905260248201527f4469616d6f6e643a2046756e6374696f6e20646f6573206e6f7420657869737460448201526064015b60405180910390fd5b3660008037600080366000845af43d6000803e8080156100bd573d6000f35b3d6000fd5b7fc8fcad8db84d3cc18b4c41d551ea0ee66dd599cde068d998e57d5e09332c131e547fc8fcad8db84d3cc18b4c41d551ea0ee66dd599cde068d998e57d5e09332c131c9061ffff8116908190600090600716156101315750600381901c60009081526001840160205260409020545b60005b87518110156101b8576101a183838a848151811061015457610154610c65565b6020026020010151600001518b858151811061017257610172610c65565b6020026020010151602001518c868151811061019057610190610c65565b602002602001015160400151610244565b9093509150806101b081610c91565b915050610134565b508282146101d45760028401805461ffff191661ffff84161790555b60078216156101f657600382901c600090815260018501602052604090208190555b7f8faa70878671ccd212d20771b795c50af8fd3ff6cf27f4bde57e5d4de0aeb67387878760405161022993929190610d1a565b60405180910390a161023b8686610a31565b50505050505050565b600080807fc8fcad8db84d3cc18b4c41d551ea0ee66dd599cde068d998e57d5e09332c131c905060008451116102d05760405162461bcd60e51b815260206004820152602b60248201527f4c69624469616d6f6e644375743a204e6f2073656c6563746f727320696e206660448201526a1858d95d081d1bc818dd5d60aa1b6064820152608401610095565b60008560028111156102e4576102e4610cac565b14156104525761030c86604051806060016040528060248152602001610e9f60249139610c44565b60005b845181101561044c57600085828151811061032c5761032c610c65565b6020908102919091018101516001600160e01b03198116600090815291859052604090912054909150606081901c156103c55760405162461bcd60e51b815260206004820152603560248201527f4c69624469616d6f6e644375743a2043616e2774206164642066756e6374696f6044820152746e207468617420616c72656164792065786973747360581b6064820152608401610095565b6001600160e01b031980831660008181526020879052604090206001600160601b031960608d901b168e17905560e060058e901b811692831c199c909c1690821c179a8114156104295760038c901c600090815260018601602052604081209b909b555b8b61043381610c91565b9c5050505050808061044490610c91565b91505061030f565b50610a25565b600185600281111561046657610466610cac565b14156106985761048e86604051806060016040528060288152602001610eeb60289139610c44565b60005b845181101561044c5760008582815181106104ae576104ae610c65565b6020908102919091018101516001600160e01b03198116600090815291859052604090912054909150606081901c308114156105445760405162461bcd60e51b815260206004820152602f60248201527f4c69624469616d6f6e644375743a2043616e2774207265706c61636520696d6d60448201526e3aba30b1363290333ab731ba34b7b760891b6064820152608401610095565b896001600160a01b0316816001600160a01b031614156105cc5760405162461bcd60e51b815260206004820152603860248201527f4c69624469616d6f6e644375743a2043616e2774207265706c6163652066756e60448201527f6374696f6e20776974682073616d652066756e6374696f6e00000000000000006064820152608401610095565b6001600160a01b0381166106485760405162461bcd60e51b815260206004820152603860248201527f4c69624469616d6f6e644375743a2043616e2774207265706c6163652066756e60448201527f6374696f6e207468617420646f65736e277420657869737400000000000000006064820152608401610095565b506001600160e01b031990911660009081526020849052604090206bffffffffffffffffffffffff919091166001600160601b031960608a901b161790558061069081610c91565b915050610491565b60028560028111156106ac576106ac610cac565b14156109cd576001600160a01b038616156107285760405162461bcd60e51b815260206004820152603660248201527f4c69624469616d6f6e644375743a2052656d6f76652066616365742061646472604482015275657373206d757374206265206164647265737328302960501b6064820152608401610095565b600388901c6007891660005b86518110156109ad578961076c578261074c81610e1a565b60008181526001870160205260409020549b5093506007925061077a9050565b8161077681610e1a565b9250505b6000806000808a858151811061079257610792610c65565b6020908102919091018101516001600160e01b031981166000908152918a9052604090912054909150606081901c6108325760405162461bcd60e51b815260206004820152603760248201527f4c69624469616d6f6e644375743a2043616e27742072656d6f76652066756e6360448201527f74696f6e207468617420646f65736e27742065786973740000000000000000006064820152608401610095565b606081901c30141561089d5760405162461bcd60e51b815260206004820152602e60248201527f4c69624469616d6f6e644375743a2043616e27742072656d6f766520696d6d7560448201526d3a30b1363290333ab731ba34b7b760911b6064820152608401610095565b600587901b8f901b94506001600160e01b0319808616908316146108f3576001600160e01b03198516600090815260208a90526040902080546001600160601b0319166bffffffffffffffffffffffff83161790555b6001600160e01b031991909116600090815260208990526040812055600381901c611fff16925060051b60e0169050858214610958576000828152600188016020526040902080546001600160e01b031980841c19909116908516831c17905561097c565b80836001600160e01b031916901c816001600160e01b031960001b901c198e16179c505b8461099757600086815260018801602052604081208190559c505b50505080806109a590610c91565b915050610734565b50806109ba836008610e31565b6109c49190610e50565b99505050610a25565b60405162461bcd60e51b815260206004820152602760248201527f4c69624469616d6f6e644375743a20496e636f727265637420466163657443756044820152663a20b1ba34b7b760c91b6064820152608401610095565b50959694955050505050565b6001600160a01b038216610ab857805115610ab45760405162461bcd60e51b815260206004820152603c60248201527f4c69624469616d6f6e644375743a205f696e697420697320616464726573732860448201527f3029206275745f63616c6c64617461206973206e6f7420656d707479000000006064820152608401610095565b5050565b6000815111610b2f5760405162461bcd60e51b815260206004820152603d60248201527f4c69624469616d6f6e644375743a205f63616c6c6461746120697320656d707460448201527f7920627574205f696e6974206973206e6f7420616464726573732830290000006064820152608401610095565b6001600160a01b0382163014610b6157610b6182604051806060016040528060288152602001610ec360289139610c44565b600080836001600160a01b031683604051610b7c9190610e68565b600060405180830381855af49150503d8060008114610bb7576040519150601f19603f3d011682016040523d82523d6000602084013e610bbc565b606091505b509150915081610c3e57805115610be7578060405162461bcd60e51b81526004016100959190610e84565b60405162461bcd60e51b815260206004820152602660248201527f4c69624469616d6f6e644375743a205f696e69742066756e6374696f6e2072656044820152651d995c9d195960d21b6064820152608401610095565b50505050565b813b8181610c3e5760405162461bcd60e51b81526004016100959190610e84565b634e487b7160e01b600052603260045260246000fd5b634e487b7160e01b600052601160045260246000fd5b6000600019821415610ca557610ca5610c7b565b5060010190565b634e487b7160e01b600052602160045260246000fd5b60005b83811015610cdd578181015183820152602001610cc5565b83811115610c3e5750506000910152565b60008151808452610d06816020860160208601610cc2565b601f01601f19169290920160200192915050565b60006060808301818452808751808352608092508286019150828160051b8701016020808b0160005b84811015610dea57898403607f19018652815180516001600160a01b03168552838101518986019060038110610d8957634e487b7160e01b600052602160045260246000fd5b868601526040918201519186018a905281519081905290840190600090898701905b80831015610dd55783516001600160e01b0319168252928601926001929092019190860190610dab565b50978501979550505090820190600101610d43565b50506001600160a01b038a16908801528681036040880152610e0c8189610cee565b9a9950505050505050505050565b600081610e2957610e29610c7b565b506000190190565b6000816000190483118215151615610e4b57610e4b610c7b565b500290565b60008219821115610e6357610e63610c7b565b500190565b60008251610e7a818460208701610cc2565b9190910192915050565b602081526000610e976020830184610cee565b939250505056fe4c69624469616d6f6e644375743a2041646420666163657420686173206e6f20636f64654c69624469616d6f6e644375743a205f696e6974206164647265737320686173206e6f20636f64654c69624469616d6f6e644375743a205265706c61636520666163657420686173206e6f20636f6465a26469706673582212207438d8b1de8ac21fae435b99377128b321fadd9e52b71360305a9922d8b7327c64736f6c63430008090033

Block Transaction Difficulty Gas Used Reward
View All Blocks Produced

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

Validator Index Block Amount
View All Withdrawals

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

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