Sepolia Testnet

Contract

0x4ed9c70E9A5C6a116365EB8A9e2cf442dECA71C7
Transaction Hash
Method
Block
From
To
Value
Collect57553382024-04-22 20:16:362 hrs ago1713816996IN
0x4ed9c70E...2dECA71C7
0 ETH0.000112711.50000001
Collect57545032024-04-22 17:27:485 hrs ago1713806868IN
0x4ed9c70E...2dECA71C7
0 ETH0.000090121.22416207
Collect57533682024-04-22 13:38:129 hrs ago1713793092IN
0x4ed9c70E...2dECA71C7
0 ETH0.000111461.50055969
Collect57520862024-04-22 9:21:1213 hrs ago1713777672IN
0x4ed9c70E...2dECA71C7
0 ETH0.000110461.50056367
Collect57416792024-04-20 22:10:002 days ago1713651000IN
0x4ed9c70E...2dECA71C7
0 ETH0.000110531.50054251
Collect57399972024-04-20 16:32:362 days ago1713630756IN
0x4ed9c70E...2dECA71C7
0 ETH0.000110521.50060078
Collect57399762024-04-20 16:28:242 days ago1713630504IN
0x4ed9c70E...2dECA71C7
0 ETH0.000110561.50053022
Collect57399572024-04-20 16:24:362 days ago1713630276IN
0x4ed9c70E...2dECA71C7
0 ETH0.000110511.50047424
Collect57399522024-04-20 16:23:362 days ago1713630216IN
0x4ed9c70E...2dECA71C7
0 ETH0.00011051.5005698
Collect57399372024-04-20 16:20:362 days ago1713630036IN
0x4ed9c70E...2dECA71C7
0 ETH0.00011061.50055189
Collect57399292024-04-20 16:19:002 days ago1713629940IN
0x4ed9c70E...2dECA71C7
0 ETH0.000110541.5004793
Collect57399212024-04-20 16:17:242 days ago1713629844IN
0x4ed9c70E...2dECA71C7
0 ETH0.000110481.50050054
Collect57399062024-04-20 16:14:242 days ago1713629664IN
0x4ed9c70E...2dECA71C7
0 ETH0.000110461.50051239
Collect57398962024-04-20 16:12:242 days ago1713629544IN
0x4ed9c70E...2dECA71C7
0 ETH0.000110551.50052606
Collect57398932024-04-20 16:11:482 days ago1713629508IN
0x4ed9c70E...2dECA71C7
0 ETH0.00011051.50049339
Collect57398782024-04-20 16:08:482 days ago1713629328IN
0x4ed9c70E...2dECA71C7
0 ETH0.000110581.50052385
Collect57398552024-04-20 16:04:122 days ago1713629052IN
0x4ed9c70E...2dECA71C7
0 ETH0.000110551.50058529
Collect57398352024-04-20 16:00:122 days ago1713628812IN
0x4ed9c70E...2dECA71C7
0 ETH0.000110651.50055911
Collect57330052024-04-19 17:05:483 days ago1713546348IN
0x4ed9c70E...2dECA71C7
0 ETH0.000110871.50428793
Collect57329082024-04-19 16:46:003 days ago1713545160IN
0x4ed9c70E...2dECA71C7
0 ETH0.000111361.51251765
Collect57327952024-04-19 16:22:483 days ago1713543768IN
0x4ed9c70E...2dECA71C7
0 ETH0.000113231.53714002
Collect57321362024-04-19 14:07:363 days ago1713535656IN
0x4ed9c70E...2dECA71C7
0 ETH0.000151432.05629242
Collect57321252024-04-19 14:05:243 days ago1713535524IN
0x4ed9c70E...2dECA71C7
0 ETH0.000150552.04221543
Collect57321042024-04-19 14:01:123 days ago1713535272IN
0x4ed9c70E...2dECA71C7
0 ETH0.000184122.49840954
Collect57320922024-04-19 13:58:483 days ago1713535128IN
0x4ed9c70E...2dECA71C7
0 ETH0.000185422.51636955
View all transactions

Latest 25 internal transactions (View All)

Advanced mode:
Parent Transaction Hash Block From To Value
57553382024-04-22 20:16:362 hrs ago1713816996
0x4ed9c70E...2dECA71C7
10 ETH
57545032024-04-22 17:27:485 hrs ago1713806868
0x4ed9c70E...2dECA71C7
10 ETH
57533682024-04-22 13:38:129 hrs ago1713793092
0x4ed9c70E...2dECA71C7
10 ETH
57520862024-04-22 9:21:1213 hrs ago1713777672
0x4ed9c70E...2dECA71C7
10 ETH
57416792024-04-20 22:10:002 days ago1713651000
0x4ed9c70E...2dECA71C7
10 ETH
57399972024-04-20 16:32:362 days ago1713630756
0x4ed9c70E...2dECA71C7
10 ETH
57399762024-04-20 16:28:242 days ago1713630504
0x4ed9c70E...2dECA71C7
10 ETH
57399572024-04-20 16:24:362 days ago1713630276
0x4ed9c70E...2dECA71C7
10 ETH
57399522024-04-20 16:23:362 days ago1713630216
0x4ed9c70E...2dECA71C7
10 ETH
57399372024-04-20 16:20:362 days ago1713630036
0x4ed9c70E...2dECA71C7
10 ETH
57399292024-04-20 16:19:002 days ago1713629940
0x4ed9c70E...2dECA71C7
10 ETH
57399212024-04-20 16:17:242 days ago1713629844
0x4ed9c70E...2dECA71C7
10 ETH
57399062024-04-20 16:14:242 days ago1713629664
0x4ed9c70E...2dECA71C7
10 ETH
57398962024-04-20 16:12:242 days ago1713629544
0x4ed9c70E...2dECA71C7
10 ETH
57398932024-04-20 16:11:482 days ago1713629508
0x4ed9c70E...2dECA71C7
10 ETH
57398782024-04-20 16:08:482 days ago1713629328
0x4ed9c70E...2dECA71C7
10 ETH
57398552024-04-20 16:04:122 days ago1713629052
0x4ed9c70E...2dECA71C7
10 ETH
57398352024-04-20 16:00:122 days ago1713628812
0x4ed9c70E...2dECA71C7
10 ETH
57330052024-04-19 17:05:483 days ago1713546348
0x4ed9c70E...2dECA71C7
10 ETH
57329082024-04-19 16:46:003 days ago1713545160
0x4ed9c70E...2dECA71C7
10 ETH
57327952024-04-19 16:22:483 days ago1713543768
0x4ed9c70E...2dECA71C7
10 ETH
57321362024-04-19 14:07:363 days ago1713535656
0x4ed9c70E...2dECA71C7
10 ETH
57321252024-04-19 14:05:243 days ago1713535524
0x4ed9c70E...2dECA71C7
10 ETH
57321042024-04-19 14:01:123 days ago1713535272
0x4ed9c70E...2dECA71C7
10 ETH
57320922024-04-19 13:58:483 days ago1713535128
0x4ed9c70E...2dECA71C7
10 ETH
View All Internal Transactions
Loading...
Loading

Contract Source Code Verified (Exact Match)

Contract Name:
Collector

Compiler Version
v0.8.16+commit.07a7930e

Optimization Enabled:
Yes with 10000 runs

Other Settings:
default evmVersion

Contract Source Code (Solidity Standard Json-Input format)

File 1 of 4 : Collector.sol
// SPDX-License-Identifier: GPL-3.0
pragma solidity 0.8.16;

import "@openzeppelin/contracts/utils/cryptography/MerkleProof.sol";
import "@openzeppelin/contracts/access/Ownable.sol";

contract Collector is Ownable {

    event Claim(address sender, string graffiti);

    uint immutable weiPerClaim;
    bytes32 public root;
    mapping(address => bool) public claimed;

    constructor(bytes32 _root, uint _weiPerClaim) {
        root = _root;
        weiPerClaim = _weiPerClaim;
    }

    function collect(
        bytes32[] memory proof,
        string memory graffiti,
        address recipient
    ) public returns (bool) { 
        require(claimed[msg.sender] == false, "Already claimed");

        bytes32 leaf = keccak256(abi.encodePacked(msg.sender));
        require(MerkleProof.verify(proof, root, leaf), "Failed merkle proof");

        require(address(this).balance >= weiPerClaim, "Insufficient funds");

        claimed[msg.sender] = true;

        payable(address(recipient)).transfer(weiPerClaim);
        emit Claim(msg.sender, graffiti);

        return true;
    }

    function adminUpdateRoot(bytes32 _root) public onlyOwner {
        root = _root;
    }

    function adminWithdraw(uint amount) public onlyOwner {
        payable(address(msg.sender)).transfer(amount);
    }

    receive() external payable {}
}

File 2 of 4 : Ownable.sol
// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v4.7.0) (access/Ownable.sol)

pragma solidity ^0.8.0;

import "../utils/Context.sol";

/**
 * @dev Contract module which provides a basic access control mechanism, where
 * there is an account (an owner) that can be granted exclusive access to
 * specific functions.
 *
 * By default, the owner account will be the one that deploys the contract. This
 * can later be changed with {transferOwnership}.
 *
 * This module is used through inheritance. It will make available the modifier
 * `onlyOwner`, which can be applied to your functions to restrict their use to
 * the owner.
 */
abstract contract Ownable is Context {
    address private _owner;

    event OwnershipTransferred(address indexed previousOwner, address indexed newOwner);

    /**
     * @dev Initializes the contract setting the deployer as the initial owner.
     */
    constructor() {
        _transferOwnership(_msgSender());
    }

    /**
     * @dev Throws if called by any account other than the owner.
     */
    modifier onlyOwner() {
        _checkOwner();
        _;
    }

    /**
     * @dev Returns the address of the current owner.
     */
    function owner() public view virtual returns (address) {
        return _owner;
    }

    /**
     * @dev Throws if the sender is not the owner.
     */
    function _checkOwner() internal view virtual {
        require(owner() == _msgSender(), "Ownable: caller is not the owner");
    }

    /**
     * @dev Leaves the contract without owner. It will not be possible to call
     * `onlyOwner` functions anymore. Can only be called by the current owner.
     *
     * NOTE: Renouncing ownership will leave the contract without an owner,
     * thereby removing any functionality that is only available to the owner.
     */
    function renounceOwnership() public virtual onlyOwner {
        _transferOwnership(address(0));
    }

    /**
     * @dev Transfers ownership of the contract to a new account (`newOwner`).
     * Can only be called by the current owner.
     */
    function transferOwnership(address newOwner) public virtual onlyOwner {
        require(newOwner != address(0), "Ownable: new owner is the zero address");
        _transferOwnership(newOwner);
    }

    /**
     * @dev Transfers ownership of the contract to a new account (`newOwner`).
     * Internal function without access restriction.
     */
    function _transferOwnership(address newOwner) internal virtual {
        address oldOwner = _owner;
        _owner = newOwner;
        emit OwnershipTransferred(oldOwner, newOwner);
    }
}

File 3 of 4 : Context.sol
// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts v4.4.1 (utils/Context.sol)

pragma solidity ^0.8.0;

/**
 * @dev Provides information about the current execution context, including the
 * sender of the transaction and its data. While these are generally available
 * via msg.sender and msg.data, they should not be accessed in such a direct
 * manner, since when dealing with meta-transactions the account sending and
 * paying for execution may not be the actual sender (as far as an application
 * is concerned).
 *
 * This contract is only required for intermediate, library-like contracts.
 */
abstract contract Context {
    function _msgSender() internal view virtual returns (address) {
        return msg.sender;
    }

    function _msgData() internal view virtual returns (bytes calldata) {
        return msg.data;
    }
}

File 4 of 4 : MerkleProof.sol
// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v4.8.0) (utils/cryptography/MerkleProof.sol)

pragma solidity ^0.8.0;

/**
 * @dev These functions deal with verification of Merkle Tree proofs.
 *
 * The tree and the proofs can be generated using our
 * https://github.com/OpenZeppelin/merkle-tree[JavaScript library].
 * You will find a quickstart guide in the readme.
 *
 * WARNING: You should avoid using leaf values that are 64 bytes long prior to
 * hashing, or use a hash function other than keccak256 for hashing leaves.
 * This is because the concatenation of a sorted pair of internal nodes in
 * the merkle tree could be reinterpreted as a leaf value.
 * OpenZeppelin's JavaScript library generates merkle trees that are safe
 * against this attack out of the box.
 */
library MerkleProof {
    /**
     * @dev Returns true if a `leaf` can be proved to be a part of a Merkle tree
     * defined by `root`. For this, a `proof` must be provided, containing
     * sibling hashes on the branch from the leaf to the root of the tree. Each
     * pair of leaves and each pair of pre-images are assumed to be sorted.
     */
    function verify(
        bytes32[] memory proof,
        bytes32 root,
        bytes32 leaf
    ) internal pure returns (bool) {
        return processProof(proof, leaf) == root;
    }

    /**
     * @dev Calldata version of {verify}
     *
     * _Available since v4.7._
     */
    function verifyCalldata(
        bytes32[] calldata proof,
        bytes32 root,
        bytes32 leaf
    ) internal pure returns (bool) {
        return processProofCalldata(proof, leaf) == root;
    }

    /**
     * @dev Returns the rebuilt hash obtained by traversing a Merkle tree up
     * from `leaf` using `proof`. A `proof` is valid if and only if the rebuilt
     * hash matches the root of the tree. When processing the proof, the pairs
     * of leafs & pre-images are assumed to be sorted.
     *
     * _Available since v4.4._
     */
    function processProof(bytes32[] memory proof, bytes32 leaf) internal pure returns (bytes32) {
        bytes32 computedHash = leaf;
        for (uint256 i = 0; i < proof.length; i++) {
            computedHash = _hashPair(computedHash, proof[i]);
        }
        return computedHash;
    }

    /**
     * @dev Calldata version of {processProof}
     *
     * _Available since v4.7._
     */
    function processProofCalldata(bytes32[] calldata proof, bytes32 leaf) internal pure returns (bytes32) {
        bytes32 computedHash = leaf;
        for (uint256 i = 0; i < proof.length; i++) {
            computedHash = _hashPair(computedHash, proof[i]);
        }
        return computedHash;
    }

    /**
     * @dev Returns true if the `leaves` can be simultaneously proven to be a part of a merkle tree defined by
     * `root`, according to `proof` and `proofFlags` as described in {processMultiProof}.
     *
     * CAUTION: Not all merkle trees admit multiproofs. See {processMultiProof} for details.
     *
     * _Available since v4.7._
     */
    function multiProofVerify(
        bytes32[] memory proof,
        bool[] memory proofFlags,
        bytes32 root,
        bytes32[] memory leaves
    ) internal pure returns (bool) {
        return processMultiProof(proof, proofFlags, leaves) == root;
    }

    /**
     * @dev Calldata version of {multiProofVerify}
     *
     * CAUTION: Not all merkle trees admit multiproofs. See {processMultiProof} for details.
     *
     * _Available since v4.7._
     */
    function multiProofVerifyCalldata(
        bytes32[] calldata proof,
        bool[] calldata proofFlags,
        bytes32 root,
        bytes32[] memory leaves
    ) internal pure returns (bool) {
        return processMultiProofCalldata(proof, proofFlags, leaves) == root;
    }

    /**
     * @dev Returns the root of a tree reconstructed from `leaves` and sibling nodes in `proof`. The reconstruction
     * proceeds by incrementally reconstructing all inner nodes by combining a leaf/inner node with either another
     * leaf/inner node or a proof sibling node, depending on whether each `proofFlags` item is true or false
     * respectively.
     *
     * CAUTION: Not all merkle trees admit multiproofs. To use multiproofs, it is sufficient to ensure that: 1) the tree
     * is complete (but not necessarily perfect), 2) the leaves to be proven are in the opposite order they are in the
     * tree (i.e., as seen from right to left starting at the deepest layer and continuing at the next layer).
     *
     * _Available since v4.7._
     */
    function processMultiProof(
        bytes32[] memory proof,
        bool[] memory proofFlags,
        bytes32[] memory leaves
    ) internal pure returns (bytes32 merkleRoot) {
        // This function rebuild the root hash by traversing the tree up from the leaves. The root is rebuilt by
        // consuming and producing values on a queue. The queue starts with the `leaves` array, then goes onto the
        // `hashes` array. At the end of the process, the last hash in the `hashes` array should contain the root of
        // the merkle tree.
        uint256 leavesLen = leaves.length;
        uint256 totalHashes = proofFlags.length;

        // Check proof validity.
        require(leavesLen + proof.length - 1 == totalHashes, "MerkleProof: invalid multiproof");

        // The xxxPos values are "pointers" to the next value to consume in each array. All accesses are done using
        // `xxx[xxxPos++]`, which return the current value and increment the pointer, thus mimicking a queue's "pop".
        bytes32[] memory hashes = new bytes32[](totalHashes);
        uint256 leafPos = 0;
        uint256 hashPos = 0;
        uint256 proofPos = 0;
        // At each step, we compute the next hash using two values:
        // - a value from the "main queue". If not all leaves have been consumed, we get the next leaf, otherwise we
        //   get the next hash.
        // - depending on the flag, either another value for the "main queue" (merging branches) or an element from the
        //   `proof` array.
        for (uint256 i = 0; i < totalHashes; i++) {
            bytes32 a = leafPos < leavesLen ? leaves[leafPos++] : hashes[hashPos++];
            bytes32 b = proofFlags[i] ? leafPos < leavesLen ? leaves[leafPos++] : hashes[hashPos++] : proof[proofPos++];
            hashes[i] = _hashPair(a, b);
        }

        if (totalHashes > 0) {
            return hashes[totalHashes - 1];
        } else if (leavesLen > 0) {
            return leaves[0];
        } else {
            return proof[0];
        }
    }

    /**
     * @dev Calldata version of {processMultiProof}.
     *
     * CAUTION: Not all merkle trees admit multiproofs. See {processMultiProof} for details.
     *
     * _Available since v4.7._
     */
    function processMultiProofCalldata(
        bytes32[] calldata proof,
        bool[] calldata proofFlags,
        bytes32[] memory leaves
    ) internal pure returns (bytes32 merkleRoot) {
        // This function rebuild the root hash by traversing the tree up from the leaves. The root is rebuilt by
        // consuming and producing values on a queue. The queue starts with the `leaves` array, then goes onto the
        // `hashes` array. At the end of the process, the last hash in the `hashes` array should contain the root of
        // the merkle tree.
        uint256 leavesLen = leaves.length;
        uint256 totalHashes = proofFlags.length;

        // Check proof validity.
        require(leavesLen + proof.length - 1 == totalHashes, "MerkleProof: invalid multiproof");

        // The xxxPos values are "pointers" to the next value to consume in each array. All accesses are done using
        // `xxx[xxxPos++]`, which return the current value and increment the pointer, thus mimicking a queue's "pop".
        bytes32[] memory hashes = new bytes32[](totalHashes);
        uint256 leafPos = 0;
        uint256 hashPos = 0;
        uint256 proofPos = 0;
        // At each step, we compute the next hash using two values:
        // - a value from the "main queue". If not all leaves have been consumed, we get the next leaf, otherwise we
        //   get the next hash.
        // - depending on the flag, either another value for the "main queue" (merging branches) or an element from the
        //   `proof` array.
        for (uint256 i = 0; i < totalHashes; i++) {
            bytes32 a = leafPos < leavesLen ? leaves[leafPos++] : hashes[hashPos++];
            bytes32 b = proofFlags[i] ? leafPos < leavesLen ? leaves[leafPos++] : hashes[hashPos++] : proof[proofPos++];
            hashes[i] = _hashPair(a, b);
        }

        if (totalHashes > 0) {
            return hashes[totalHashes - 1];
        } else if (leavesLen > 0) {
            return leaves[0];
        } else {
            return proof[0];
        }
    }

    function _hashPair(bytes32 a, bytes32 b) private pure returns (bytes32) {
        return a < b ? _efficientHash(a, b) : _efficientHash(b, a);
    }

    function _efficientHash(bytes32 a, bytes32 b) private pure returns (bytes32 value) {
        /// @solidity memory-safe-assembly
        assembly {
            mstore(0x00, a)
            mstore(0x20, b)
            value := keccak256(0x00, 0x40)
        }
    }
}

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

Contract ABI

[{"inputs":[{"internalType":"bytes32","name":"_root","type":"bytes32"},{"internalType":"uint256","name":"_weiPerClaim","type":"uint256"}],"stateMutability":"nonpayable","type":"constructor"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"address","name":"sender","type":"address"},{"indexed":false,"internalType":"string","name":"graffiti","type":"string"}],"name":"Claim","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"previousOwner","type":"address"},{"indexed":true,"internalType":"address","name":"newOwner","type":"address"}],"name":"OwnershipTransferred","type":"event"},{"inputs":[{"internalType":"bytes32","name":"_root","type":"bytes32"}],"name":"adminUpdateRoot","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"amount","type":"uint256"}],"name":"adminWithdraw","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"","type":"address"}],"name":"claimed","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"bytes32[]","name":"proof","type":"bytes32[]"},{"internalType":"string","name":"graffiti","type":"string"},{"internalType":"address","name":"recipient","type":"address"}],"name":"collect","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"owner","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"renounceOwnership","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"root","outputs":[{"internalType":"bytes32","name":"","type":"bytes32"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"newOwner","type":"address"}],"name":"transferOwnership","outputs":[],"stateMutability":"nonpayable","type":"function"},{"stateMutability":"payable","type":"receive"}]

60a060405234801561001057600080fd5b50604051610b6d380380610b6d83398101604081905261002f91610096565b61003833610046565b6001919091556080526100ba565b600080546001600160a01b038381166001600160a01b0319831681178455604051919092169283917f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e09190a35050565b600080604083850312156100a957600080fd5b505080516020909101519092909150565b608051610a916100dc6000396000818161030001526103dc0152610a916000f3fe60806040526004361061007f5760003560e01c8063c884ef831161004e578063c884ef831461012c578063ebf0c7171461015c578063f2fde38b14610180578063f9edeaa2146101a057600080fd5b8063500386c61461008b578063715018a6146100c05780637c5b4a37146100d75780638da5cb5b146100f757600080fd5b3661008657005b600080fd5b34801561009757600080fd5b506100ab6100a6366004610837565b6101c0565b60405190151581526020015b60405180910390f35b3480156100cc57600080fd5b506100d5610466565b005b3480156100e357600080fd5b506100d56100f236600461090f565b61047a565b34801561010357600080fd5b5060005460405173ffffffffffffffffffffffffffffffffffffffff90911681526020016100b7565b34801561013857600080fd5b506100ab610147366004610928565b60026020526000908152604090205460ff1681565b34801561016857600080fd5b5061017260015481565b6040519081526020016100b7565b34801561018c57600080fd5b506100d561019b366004610928565b6104b3565b3480156101ac57600080fd5b506100d56101bb36600461090f565b61056a565b3360009081526002602052604081205460ff161561023f576040517f08c379a000000000000000000000000000000000000000000000000000000000815260206004820152600f60248201527f416c726561647920636c61696d6564000000000000000000000000000000000060448201526064015b60405180910390fd5b6040517fffffffffffffffffffffffffffffffffffffffff0000000000000000000000003360601b1660208201526000906034016040516020818303038152906040528051906020012090506102988560015483610577565b6102fe576040517f08c379a000000000000000000000000000000000000000000000000000000000815260206004820152601360248201527f4661696c6564206d65726b6c652070726f6f66000000000000000000000000006044820152606401610236565b7f0000000000000000000000000000000000000000000000000000000000000000471015610388576040517f08c379a000000000000000000000000000000000000000000000000000000000815260206004820152601260248201527f496e73756666696369656e742066756e647300000000000000000000000000006044820152606401610236565b3360009081526002602052604080822080547fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff001660011790555173ffffffffffffffffffffffffffffffffffffffff8516917f000000000000000000000000000000000000000000000000000000000000000080156108fc02929091818181858888f19350505050158015610421573d6000803e3d6000fd5b507fc8fdf13a4b928b8811a082d6f49538b13d9279cc130d1312406e8fa8742997353385604051610453929190610943565b60405180910390a1506001949350505050565b61046e61058d565b610478600061060e565b565b61048261058d565b604051339082156108fc029083906000818181858888f193505050501580156104af573d6000803e3d6000fd5b5050565b6104bb61058d565b73ffffffffffffffffffffffffffffffffffffffff811661055e576040517f08c379a000000000000000000000000000000000000000000000000000000000815260206004820152602660248201527f4f776e61626c653a206e6577206f776e657220697320746865207a65726f206160448201527f64647265737300000000000000000000000000000000000000000000000000006064820152608401610236565b6105678161060e565b50565b61057261058d565b600155565b6000826105848584610683565b14949350505050565b60005473ffffffffffffffffffffffffffffffffffffffff163314610478576040517f08c379a000000000000000000000000000000000000000000000000000000000815260206004820181905260248201527f4f776e61626c653a2063616c6c6572206973206e6f7420746865206f776e65726044820152606401610236565b6000805473ffffffffffffffffffffffffffffffffffffffff8381167fffffffffffffffffffffffff0000000000000000000000000000000000000000831681178455604051919092169283917f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e09190a35050565b600081815b84518110156106c8576106b4828683815181106106a7576106a76109cd565b60200260200101516106d0565b9150806106c0816109fc565b915050610688565b509392505050565b60008183106106ec5760008281526020849052604090206106fb565b60008381526020839052604090205b9392505050565b7f4e487b7100000000000000000000000000000000000000000000000000000000600052604160045260246000fd5b604051601f82017fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffe016810167ffffffffffffffff8111828210171561077857610778610702565b604052919050565b600082601f83011261079157600080fd5b813567ffffffffffffffff8111156107ab576107ab610702565b6107dc60207fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffe0601f84011601610731565b8181528460208386010111156107f157600080fd5b816020850160208301376000918101602001919091529392505050565b803573ffffffffffffffffffffffffffffffffffffffff8116811461083257600080fd5b919050565b60008060006060848603121561084c57600080fd5b833567ffffffffffffffff8082111561086457600080fd5b818601915086601f83011261087857600080fd5b813560208282111561088c5761088c610702565b8160051b61089b828201610731565b928352848101820192828101908b8511156108b557600080fd5b958301955b848710156108d3578635825295830195908301906108ba565b98505050870135925050808211156108ea57600080fd5b506108f786828701610780565b9250506109066040850161080e565b90509250925092565b60006020828403121561092157600080fd5b5035919050565b60006020828403121561093a57600080fd5b6106fb8261080e565b73ffffffffffffffffffffffffffffffffffffffff8316815260006020604081840152835180604085015260005b8181101561098d57858101830151858201606001528201610971565b5060006060828601015260607fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffe0601f830116850101925050509392505050565b7f4e487b7100000000000000000000000000000000000000000000000000000000600052603260045260246000fd5b60007fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff8203610a54577f4e487b7100000000000000000000000000000000000000000000000000000000600052601160045260246000fd5b506001019056fea2646970667358221220813941a700512d87265c41e09494c5296d3688f1b91a4785880c687e80e9dfe764736f6c63430008100033eb0adcb9507280f54f421bba0931bfcf67dc1bf351b7892ab24d783e7d60bd6a0000000000000000000000000000000000000000000000008ac7230489e80000

Deployed Bytecode

0x60806040526004361061007f5760003560e01c8063c884ef831161004e578063c884ef831461012c578063ebf0c7171461015c578063f2fde38b14610180578063f9edeaa2146101a057600080fd5b8063500386c61461008b578063715018a6146100c05780637c5b4a37146100d75780638da5cb5b146100f757600080fd5b3661008657005b600080fd5b34801561009757600080fd5b506100ab6100a6366004610837565b6101c0565b60405190151581526020015b60405180910390f35b3480156100cc57600080fd5b506100d5610466565b005b3480156100e357600080fd5b506100d56100f236600461090f565b61047a565b34801561010357600080fd5b5060005460405173ffffffffffffffffffffffffffffffffffffffff90911681526020016100b7565b34801561013857600080fd5b506100ab610147366004610928565b60026020526000908152604090205460ff1681565b34801561016857600080fd5b5061017260015481565b6040519081526020016100b7565b34801561018c57600080fd5b506100d561019b366004610928565b6104b3565b3480156101ac57600080fd5b506100d56101bb36600461090f565b61056a565b3360009081526002602052604081205460ff161561023f576040517f08c379a000000000000000000000000000000000000000000000000000000000815260206004820152600f60248201527f416c726561647920636c61696d6564000000000000000000000000000000000060448201526064015b60405180910390fd5b6040517fffffffffffffffffffffffffffffffffffffffff0000000000000000000000003360601b1660208201526000906034016040516020818303038152906040528051906020012090506102988560015483610577565b6102fe576040517f08c379a000000000000000000000000000000000000000000000000000000000815260206004820152601360248201527f4661696c6564206d65726b6c652070726f6f66000000000000000000000000006044820152606401610236565b7f0000000000000000000000000000000000000000000000008ac7230489e80000471015610388576040517f08c379a000000000000000000000000000000000000000000000000000000000815260206004820152601260248201527f496e73756666696369656e742066756e647300000000000000000000000000006044820152606401610236565b3360009081526002602052604080822080547fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff001660011790555173ffffffffffffffffffffffffffffffffffffffff8516917f0000000000000000000000000000000000000000000000008ac7230489e8000080156108fc02929091818181858888f19350505050158015610421573d6000803e3d6000fd5b507fc8fdf13a4b928b8811a082d6f49538b13d9279cc130d1312406e8fa8742997353385604051610453929190610943565b60405180910390a1506001949350505050565b61046e61058d565b610478600061060e565b565b61048261058d565b604051339082156108fc029083906000818181858888f193505050501580156104af573d6000803e3d6000fd5b5050565b6104bb61058d565b73ffffffffffffffffffffffffffffffffffffffff811661055e576040517f08c379a000000000000000000000000000000000000000000000000000000000815260206004820152602660248201527f4f776e61626c653a206e6577206f776e657220697320746865207a65726f206160448201527f64647265737300000000000000000000000000000000000000000000000000006064820152608401610236565b6105678161060e565b50565b61057261058d565b600155565b6000826105848584610683565b14949350505050565b60005473ffffffffffffffffffffffffffffffffffffffff163314610478576040517f08c379a000000000000000000000000000000000000000000000000000000000815260206004820181905260248201527f4f776e61626c653a2063616c6c6572206973206e6f7420746865206f776e65726044820152606401610236565b6000805473ffffffffffffffffffffffffffffffffffffffff8381167fffffffffffffffffffffffff0000000000000000000000000000000000000000831681178455604051919092169283917f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e09190a35050565b600081815b84518110156106c8576106b4828683815181106106a7576106a76109cd565b60200260200101516106d0565b9150806106c0816109fc565b915050610688565b509392505050565b60008183106106ec5760008281526020849052604090206106fb565b60008381526020839052604090205b9392505050565b7f4e487b7100000000000000000000000000000000000000000000000000000000600052604160045260246000fd5b604051601f82017fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffe016810167ffffffffffffffff8111828210171561077857610778610702565b604052919050565b600082601f83011261079157600080fd5b813567ffffffffffffffff8111156107ab576107ab610702565b6107dc60207fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffe0601f84011601610731565b8181528460208386010111156107f157600080fd5b816020850160208301376000918101602001919091529392505050565b803573ffffffffffffffffffffffffffffffffffffffff8116811461083257600080fd5b919050565b60008060006060848603121561084c57600080fd5b833567ffffffffffffffff8082111561086457600080fd5b818601915086601f83011261087857600080fd5b813560208282111561088c5761088c610702565b8160051b61089b828201610731565b928352848101820192828101908b8511156108b557600080fd5b958301955b848710156108d3578635825295830195908301906108ba565b98505050870135925050808211156108ea57600080fd5b506108f786828701610780565b9250506109066040850161080e565b90509250925092565b60006020828403121561092157600080fd5b5035919050565b60006020828403121561093a57600080fd5b6106fb8261080e565b73ffffffffffffffffffffffffffffffffffffffff8316815260006020604081840152835180604085015260005b8181101561098d57858101830151858201606001528201610971565b5060006060828601015260607fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffe0601f830116850101925050509392505050565b7f4e487b7100000000000000000000000000000000000000000000000000000000600052603260045260246000fd5b60007fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff8203610a54577f4e487b7100000000000000000000000000000000000000000000000000000000600052601160045260246000fd5b506001019056fea2646970667358221220813941a700512d87265c41e09494c5296d3688f1b91a4785880c687e80e9dfe764736f6c63430008100033

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

eb0adcb9507280f54f421bba0931bfcf67dc1bf351b7892ab24d783e7d60bd6a0000000000000000000000000000000000000000000000008ac7230489e80000

-----Decoded View---------------
Arg [0] : _root (bytes32): 0xeb0adcb9507280f54f421bba0931bfcf67dc1bf351b7892ab24d783e7d60bd6a
Arg [1] : _weiPerClaim (uint256): 10000000000000000000

-----Encoded View---------------
2 Constructor Arguments found :
Arg [0] : eb0adcb9507280f54f421bba0931bfcf67dc1bf351b7892ab24d783e7d60bd6a
Arg [1] : 0000000000000000000000000000000000000000000000008ac7230489e80000


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.