ETH Price: $2,387.25 (-1.12%)

Contract

0x4FEB71333c2A9fE81625a5727ab0Ed33dC77B841
 
Transaction Hash
Method
Block
From
To
Update Merkle Ro...187090022023-12-03 23:02:23277 days ago1701644543IN
0x4FEB7133...3dC77B841
0 ETH0.0011748640.53359905
Contribute187089492023-12-03 22:51:23277 days ago1701643883IN
0x4FEB7133...3dC77B841
0 ETH0.0036475533.44230723
Update Merkle Ro...187089192023-12-03 22:45:23277 days ago1701643523IN
0x4FEB7133...3dC77B841
0 ETH0.0010814837.31182355
Contribute187088672023-12-03 22:34:59277 days ago1701642899IN
0x4FEB7133...3dC77B841
0 ETH0.0044257938.03113679
Contribute187088662023-12-03 22:34:47277 days ago1701642887IN
0x4FEB7133...3dC77B841
0 ETH0.0038249238.51774523
Contribute187088152023-12-03 22:24:35277 days ago1701642275IN
0x4FEB7133...3dC77B841
0 ETH0.0045762838.83371078
Update Merkle Ro...187087892023-12-03 22:19:23277 days ago1701641963IN
0x4FEB7133...3dC77B841
0 ETH0.0009918834.22059731
Contribute187087282023-12-03 22:07:11277 days ago1701641231IN
0x4FEB7133...3dC77B841
0 ETH0.0044765939.02633488
Update Merkle Ro...187086772023-12-03 21:56:59277 days ago1701640619IN
0x4FEB7133...3dC77B841
0 ETH0.0010943437.75560755
Contribute187085292023-12-03 21:26:59277 days ago1701638819IN
0x4FEB7133...3dC77B841
0 ETH0.0042495237.05449321
Contribute187085102023-12-03 21:23:11277 days ago1701638591IN
0x4FEB7133...3dC77B841
0 ETH0.0050690443.57581185
Contribute187084952023-12-03 21:20:11277 days ago1701638411IN
0x4FEB7133...3dC77B841
0 ETH0.004493640.28075481
Contribute187084362023-12-03 21:08:11277 days ago1701637691IN
0x4FEB7133...3dC77B841
0 ETH0.0032292733.88818198
Contribute187084252023-12-03 21:05:59277 days ago1701637559IN
0x4FEB7133...3dC77B841
0 ETH0.0037675334.27993345
Contribute187084232023-12-03 21:05:35277 days ago1701637535IN
0x4FEB7133...3dC77B841
0 ETH0.0030309332.09205881
Contribute187084192023-12-03 21:04:47277 days ago1701637487IN
0x4FEB7133...3dC77B841
0 ETH0.0035910632.18980522
Contribute187084152023-12-03 21:03:59277 days ago1701637439IN
0x4FEB7133...3dC77B841
0 ETH0.0036588333.54639049
Contribute187084112023-12-03 21:03:11277 days ago1701637391IN
0x4FEB7133...3dC77B841
0 ETH0.0038810235.30935447
Contribute187084012023-12-03 21:01:11277 days ago1701637271IN
0x4FEB7133...3dC77B841
0 ETH0.0029116830.55094047
Update Merkle Ro...187083992023-12-03 21:00:47277 days ago1701637247IN
0x4FEB7133...3dC77B841
0 ETH0.0008996731.03934631
Contribute187083432023-12-03 20:49:35277 days ago1701636575IN
0x4FEB7133...3dC77B841
0 ETH0.0043460439.85072409
Contribute187083352023-12-03 20:47:59277 days ago1701636479IN
0x4FEB7133...3dC77B841
0 ETH0.0048431143.4045199
Contribute187083332023-12-03 20:47:35277 days ago1701636455IN
0x4FEB7133...3dC77B841
0 ETH0.0043354837.2634214
Contribute187083262023-12-03 20:45:59277 days ago1701636359IN
0x4FEB7133...3dC77B841
0 ETH0.004740840.74220484
Contribute187083222023-12-03 20:44:59277 days ago1701636299IN
0x4FEB7133...3dC77B841
0 ETH0.0041790737.46131749
View all transactions

View more zero value Internal Transactions in Advanced View mode

Advanced mode:
Loading...
Loading

Contract Source Code Verified (Exact Match)

Contract Name:
SAFT

Compiler Version
v0.8.16+commit.07a7930e

Optimization Enabled:
Yes with 200 runs

Other Settings:
default evmVersion
File 1 of 3 : SAFT.sol
// SPDX-License-Identifier: MIT
pragma solidity ^0.8.6;

import "@openzeppelin/contracts/token/ERC20/IERC20.sol";
import "@openzeppelin/contracts/utils/cryptography/MerkleProof.sol";

contract SAFT {
    address public owner;
    address public multisig;
    bytes32 public merkleRoot;
    address public usdc;
    mapping(address => uint) public contributed;
    address[] public contributors;

    event Contribution(address user, uint amount);
    
    constructor() {
        owner = msg.sender;
        multisig = 0x7ae230223c4803961A9F41B960cA6e31095706Ed;
        merkleRoot = 0x6b6e7beafa3fd8c7e295477c835467eb65f1d416dd26d2d6be5999d038fc356b;
        usdc = 0xA0b86991c6218b36c1d19D4a2e9Eb0cE3606eB48;
    }

    function checkProof(address _user, bytes32[] calldata _merkleProof) public view returns(bool) {
        bytes32 leaf = keccak256(abi.encodePacked(_user));
        bool result = MerkleProof.verify(_merkleProof, merkleRoot, leaf);
        return result;
    }

    function contribute(uint _amountUSDC, bytes32[] calldata _merkleProof) external {
        require (_amountUSDC >= 500e6, "Contribution Too Low");
        require (_amountUSDC + contributed[msg.sender] <= 25000e6, "Contribution Too High");
        require(checkProof(msg.sender, _merkleProof) == true, "Merkle proof does not validate");
        IERC20(usdc).transferFrom(msg.sender, address(this), _amountUSDC);
        contributed[msg.sender] += _amountUSDC;
        contributors.push(msg.sender); // may be duplicate addresses
        emit Contribution(msg.sender, _amountUSDC);
    }

    // owner functions
    function updateMerkleRoot(bytes32 _whitelistRoot) external {
        require(msg.sender == owner, "only owner has access");
        merkleRoot = _whitelistRoot;
    }

    function updateToken(address _usdc) external {
        require(msg.sender == owner, "only owner has access");
        usdc = _usdc;
    }

    // multisig functions
    function updateMultisig(address _multisig) external {
        require(msg.sender == multisig, "only multisig has access");
        multisig = _multisig;
    }

    function claimToken(IERC20 _token) external {
        require(msg.sender == multisig || msg.sender == owner, "only multisig and owner has access");
        uint balance = _token.balanceOf(address(this));
        _token.transfer(multisig, balance);
    }

    function claimETH() external {
        require(msg.sender == multisig || msg.sender == owner, "only multisig and owner has access");
        payable(multisig).transfer(address(this).balance);
    }

}

File 2 of 3 : IERC20.sol
// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v4.6.0) (token/ERC20/IERC20.sol)

pragma solidity ^0.8.0;

/**
 * @dev Interface of the ERC20 standard as defined in the EIP.
 */
interface IERC20 {
    /**
     * @dev Emitted when `value` tokens are moved from one account (`from`) to
     * another (`to`).
     *
     * Note that `value` may be zero.
     */
    event Transfer(address indexed from, address indexed to, uint256 value);

    /**
     * @dev Emitted when the allowance of a `spender` for an `owner` is set by
     * a call to {approve}. `value` is the new allowance.
     */
    event Approval(address indexed owner, address indexed spender, uint256 value);

    /**
     * @dev Returns the amount of tokens in existence.
     */
    function totalSupply() external view returns (uint256);

    /**
     * @dev Returns the amount of tokens owned by `account`.
     */
    function balanceOf(address account) external view returns (uint256);

    /**
     * @dev Moves `amount` tokens from the caller's account to `to`.
     *
     * Returns a boolean value indicating whether the operation succeeded.
     *
     * Emits a {Transfer} event.
     */
    function transfer(address to, uint256 amount) external returns (bool);

    /**
     * @dev Returns the remaining number of tokens that `spender` will be
     * allowed to spend on behalf of `owner` through {transferFrom}. This is
     * zero by default.
     *
     * This value changes when {approve} or {transferFrom} are called.
     */
    function allowance(address owner, address spender) external view returns (uint256);

    /**
     * @dev Sets `amount` as the allowance of `spender` over the caller's tokens.
     *
     * Returns a boolean value indicating whether the operation succeeded.
     *
     * IMPORTANT: Beware that changing an allowance with this method brings the risk
     * that someone may use both the old and the new allowance by unfortunate
     * transaction ordering. One possible solution to mitigate this race
     * condition is to first reduce the spender's allowance to 0 and set the
     * desired value afterwards:
     * https://github.com/ethereum/EIPs/issues/20#issuecomment-263524729
     *
     * Emits an {Approval} event.
     */
    function approve(address spender, uint256 amount) external returns (bool);

    /**
     * @dev Moves `amount` tokens from `from` to `to` using the
     * allowance mechanism. `amount` is then deducted from the caller's
     * allowance.
     *
     * Returns a boolean value indicating whether the operation succeeded.
     *
     * Emits a {Transfer} event.
     */
    function transferFrom(
        address from,
        address to,
        uint256 amount
    ) external returns (bool);
}

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

pragma solidity ^0.8.0;

/**
 * @dev These functions deal with verification of Merkle Tree proofs.
 *
 * The proofs can be generated using the JavaScript library
 * https://github.com/miguelmota/merkletreejs[merkletreejs].
 * Note: the hashing algorithm should be keccak256 and pair sorting should be enabled.
 *
 * See `test/utils/cryptography/MerkleProof.test.js` for some examples.
 *
 * 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.
 */
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 proved to be a part of a Merkle tree defined by
     * `root`, according to `proof` and `proofFlags` as described in {processMultiProof}.
     *
     * _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}
     *
     * _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 the sibling nodes in `proof`,
     * consuming from one or the other at each step according to the instructions given by
     * `proofFlags`.
     *
     * _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}
     *
     * _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": 200
  },
  "outputSelection": {
    "*": {
      "*": [
        "evm.bytecode",
        "evm.deployedBytecode",
        "devdoc",
        "userdoc",
        "metadata",
        "abi"
      ]
    }
  },
  "libraries": {}
}

Contract Security Audit

Contract ABI

[{"inputs":[],"stateMutability":"nonpayable","type":"constructor"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"address","name":"user","type":"address"},{"indexed":false,"internalType":"uint256","name":"amount","type":"uint256"}],"name":"Contribution","type":"event"},{"inputs":[{"internalType":"address","name":"_user","type":"address"},{"internalType":"bytes32[]","name":"_merkleProof","type":"bytes32[]"}],"name":"checkProof","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"claimETH","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"contract IERC20","name":"_token","type":"address"}],"name":"claimToken","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"_amountUSDC","type":"uint256"},{"internalType":"bytes32[]","name":"_merkleProof","type":"bytes32[]"}],"name":"contribute","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"","type":"address"}],"name":"contributed","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"","type":"uint256"}],"name":"contributors","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"merkleRoot","outputs":[{"internalType":"bytes32","name":"","type":"bytes32"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"multisig","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"owner","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"bytes32","name":"_whitelistRoot","type":"bytes32"}],"name":"updateMerkleRoot","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"_multisig","type":"address"}],"name":"updateMultisig","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"_usdc","type":"address"}],"name":"updateToken","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"usdc","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"}]

608060405234801561001057600080fd5b50600080546001600160a01b03199081163317909155600180548216737ae230223c4803961a9f41b960ca6e31095706ed1790557f6b6e7beafa3fd8c7e295477c835467eb65f1d416dd26d2d6be5999d038fc356b6002556003805490911673a0b86991c6218b36c1d19d4a2e9eb0ce3606eb48179055610a94806100966000396000f3fe608060405234801561001057600080fd5b50600436106100cf5760003560e01c80634783c35b1161008c578063672729991161006657806367272999146101b25780637ad3def2146101ba5780638da5cb5b146101cd578063995c5e9d146101e057600080fd5b80634783c35b146101795780634783f0ef1461018c5780635b71d67b1461019f57600080fd5b80632929c25c146100d45780632eb4a7ab146100e957806332f289cf146101055780633cb5d100146101185780633e413bee1461014357806340f805bf14610156575b600080fd5b6100e76100e236600461087f565b610200565b005b6100f260025481565b6040519081526020015b60405180910390f35b6100e761011336600461087f565b610281565b61012b61012636600461089c565b6103a9565b6040516001600160a01b0390911681526020016100fc565b60035461012b906001600160a01b031681565b610169610164366004610901565b6103d3565b60405190151581526020016100fc565b60015461012b906001600160a01b031681565b6100e761019a36600461089c565b61045c565b6100e76101ad366004610956565b6104b3565b6100e76106e4565b6100e76101c836600461087f565b61075f565b60005461012b906001600160a01b031681565b6100f26101ee36600461087f565b60046020526000908152604090205481565b6001546001600160a01b0316331461025f5760405162461bcd60e51b815260206004820152601860248201527f6f6e6c79206d756c74697369672068617320616363657373000000000000000060448201526064015b60405180910390fd5b600180546001600160a01b0319166001600160a01b0392909216919091179055565b6001546001600160a01b03163314806102a457506000546001600160a01b031633145b6102c05760405162461bcd60e51b815260040161025690610989565b6040516370a0823160e01b81523060048201526000906001600160a01b038316906370a0823190602401602060405180830381865afa158015610307573d6000803e3d6000fd5b505050506040513d601f19601f8201168201806040525081019061032b91906109cb565b60015460405163a9059cbb60e01b81526001600160a01b0391821660048201526024810183905291925083169063a9059cbb906044016020604051808303816000875af1158015610380573d6000803e3d6000fd5b505050506040513d601f19601f820116820180604052508101906103a491906109e4565b505050565b600581815481106103b957600080fd5b6000918252602090912001546001600160a01b0316905081565b6040516bffffffffffffffffffffffff19606085901b166020820152600090819060340160405160208183030381529060405280519060200120905060006104528585808060200260200160405190810160405280939291908181526020018383602002808284376000920191909152505060025491508590506107d3565b9695505050505050565b6000546001600160a01b031633146104ae5760405162461bcd60e51b81526020600482015260156024820152746f6e6c79206f776e6572206861732061636365737360581b6044820152606401610256565b600255565b631dcd65008310156104fe5760405162461bcd60e51b8152602060048201526014602482015273436f6e747269627574696f6e20546f6f204c6f7760601b6044820152606401610256565b336000908152600460205260409020546405d21dba009061051f9085610a1c565b11156105655760405162461bcd60e51b8152602060048201526015602482015274086dedce8e4d2c4eae8d2dedc40a8dede4090d2ced605b1b6044820152606401610256565b6105703383836103d3565b15156001146105c15760405162461bcd60e51b815260206004820152601e60248201527f4d65726b6c652070726f6f6620646f6573206e6f742076616c696461746500006044820152606401610256565b6003546040516323b872dd60e01b8152336004820152306024820152604481018590526001600160a01b03909116906323b872dd906064016020604051808303816000875af1158015610618573d6000803e3d6000fd5b505050506040513d601f19601f8201168201806040525081019061063c91906109e4565b50336000908152600460205260408120805485929061065c908490610a1c565b9091555050600580546001810182556000919091527f036b6384b5eca791c62761152d0c79bb0604c104a5fb6f4eb0703f3154bb3db00180546001600160a01b0319163390811790915560408051918252602082018590527f4d154d4aae216bed6d0926db77c00df2b57c6b5ba4eee05775de20facede3a7b910160405180910390a1505050565b6001546001600160a01b031633148061070757506000546001600160a01b031633145b6107235760405162461bcd60e51b815260040161025690610989565b6001546040516001600160a01b03909116904780156108fc02916000818181858888f1935050505015801561075c573d6000803e3d6000fd5b50565b6000546001600160a01b031633146107b15760405162461bcd60e51b81526020600482015260156024820152746f6e6c79206f776e6572206861732061636365737360581b6044820152606401610256565b600380546001600160a01b0319166001600160a01b0392909216919091179055565b6000826107e085846107e9565b14949350505050565b600081815b845181101561082e5761081a8286838151811061080d5761080d610a2f565b6020026020010151610838565b91508061082681610a45565b9150506107ee565b5090505b92915050565b6000818310610854576000828152602084905260409020610863565b60008381526020839052604090205b9392505050565b6001600160a01b038116811461075c57600080fd5b60006020828403121561089157600080fd5b81356108638161086a565b6000602082840312156108ae57600080fd5b5035919050565b60008083601f8401126108c757600080fd5b50813567ffffffffffffffff8111156108df57600080fd5b6020830191508360208260051b85010111156108fa57600080fd5b9250929050565b60008060006040848603121561091657600080fd5b83356109218161086a565b9250602084013567ffffffffffffffff81111561093d57600080fd5b610949868287016108b5565b9497909650939450505050565b60008060006040848603121561096b57600080fd5b83359250602084013567ffffffffffffffff81111561093d57600080fd5b60208082526022908201527f6f6e6c79206d756c746973696720616e64206f776e6572206861732061636365604082015261737360f01b606082015260800190565b6000602082840312156109dd57600080fd5b5051919050565b6000602082840312156109f657600080fd5b8151801515811461086357600080fd5b634e487b7160e01b600052601160045260246000fd5b8082018082111561083257610832610a06565b634e487b7160e01b600052603260045260246000fd5b600060018201610a5757610a57610a06565b506001019056fea2646970667358221220188102c168bb3c022598dad278a59a7d7829bdbfa9bb3a00211343cd6d4079a064736f6c63430008100033

Deployed Bytecode

0x608060405234801561001057600080fd5b50600436106100cf5760003560e01c80634783c35b1161008c578063672729991161006657806367272999146101b25780637ad3def2146101ba5780638da5cb5b146101cd578063995c5e9d146101e057600080fd5b80634783c35b146101795780634783f0ef1461018c5780635b71d67b1461019f57600080fd5b80632929c25c146100d45780632eb4a7ab146100e957806332f289cf146101055780633cb5d100146101185780633e413bee1461014357806340f805bf14610156575b600080fd5b6100e76100e236600461087f565b610200565b005b6100f260025481565b6040519081526020015b60405180910390f35b6100e761011336600461087f565b610281565b61012b61012636600461089c565b6103a9565b6040516001600160a01b0390911681526020016100fc565b60035461012b906001600160a01b031681565b610169610164366004610901565b6103d3565b60405190151581526020016100fc565b60015461012b906001600160a01b031681565b6100e761019a36600461089c565b61045c565b6100e76101ad366004610956565b6104b3565b6100e76106e4565b6100e76101c836600461087f565b61075f565b60005461012b906001600160a01b031681565b6100f26101ee36600461087f565b60046020526000908152604090205481565b6001546001600160a01b0316331461025f5760405162461bcd60e51b815260206004820152601860248201527f6f6e6c79206d756c74697369672068617320616363657373000000000000000060448201526064015b60405180910390fd5b600180546001600160a01b0319166001600160a01b0392909216919091179055565b6001546001600160a01b03163314806102a457506000546001600160a01b031633145b6102c05760405162461bcd60e51b815260040161025690610989565b6040516370a0823160e01b81523060048201526000906001600160a01b038316906370a0823190602401602060405180830381865afa158015610307573d6000803e3d6000fd5b505050506040513d601f19601f8201168201806040525081019061032b91906109cb565b60015460405163a9059cbb60e01b81526001600160a01b0391821660048201526024810183905291925083169063a9059cbb906044016020604051808303816000875af1158015610380573d6000803e3d6000fd5b505050506040513d601f19601f820116820180604052508101906103a491906109e4565b505050565b600581815481106103b957600080fd5b6000918252602090912001546001600160a01b0316905081565b6040516bffffffffffffffffffffffff19606085901b166020820152600090819060340160405160208183030381529060405280519060200120905060006104528585808060200260200160405190810160405280939291908181526020018383602002808284376000920191909152505060025491508590506107d3565b9695505050505050565b6000546001600160a01b031633146104ae5760405162461bcd60e51b81526020600482015260156024820152746f6e6c79206f776e6572206861732061636365737360581b6044820152606401610256565b600255565b631dcd65008310156104fe5760405162461bcd60e51b8152602060048201526014602482015273436f6e747269627574696f6e20546f6f204c6f7760601b6044820152606401610256565b336000908152600460205260409020546405d21dba009061051f9085610a1c565b11156105655760405162461bcd60e51b8152602060048201526015602482015274086dedce8e4d2c4eae8d2dedc40a8dede4090d2ced605b1b6044820152606401610256565b6105703383836103d3565b15156001146105c15760405162461bcd60e51b815260206004820152601e60248201527f4d65726b6c652070726f6f6620646f6573206e6f742076616c696461746500006044820152606401610256565b6003546040516323b872dd60e01b8152336004820152306024820152604481018590526001600160a01b03909116906323b872dd906064016020604051808303816000875af1158015610618573d6000803e3d6000fd5b505050506040513d601f19601f8201168201806040525081019061063c91906109e4565b50336000908152600460205260408120805485929061065c908490610a1c565b9091555050600580546001810182556000919091527f036b6384b5eca791c62761152d0c79bb0604c104a5fb6f4eb0703f3154bb3db00180546001600160a01b0319163390811790915560408051918252602082018590527f4d154d4aae216bed6d0926db77c00df2b57c6b5ba4eee05775de20facede3a7b910160405180910390a1505050565b6001546001600160a01b031633148061070757506000546001600160a01b031633145b6107235760405162461bcd60e51b815260040161025690610989565b6001546040516001600160a01b03909116904780156108fc02916000818181858888f1935050505015801561075c573d6000803e3d6000fd5b50565b6000546001600160a01b031633146107b15760405162461bcd60e51b81526020600482015260156024820152746f6e6c79206f776e6572206861732061636365737360581b6044820152606401610256565b600380546001600160a01b0319166001600160a01b0392909216919091179055565b6000826107e085846107e9565b14949350505050565b600081815b845181101561082e5761081a8286838151811061080d5761080d610a2f565b6020026020010151610838565b91508061082681610a45565b9150506107ee565b5090505b92915050565b6000818310610854576000828152602084905260409020610863565b60008381526020839052604090205b9392505050565b6001600160a01b038116811461075c57600080fd5b60006020828403121561089157600080fd5b81356108638161086a565b6000602082840312156108ae57600080fd5b5035919050565b60008083601f8401126108c757600080fd5b50813567ffffffffffffffff8111156108df57600080fd5b6020830191508360208260051b85010111156108fa57600080fd5b9250929050565b60008060006040848603121561091657600080fd5b83356109218161086a565b9250602084013567ffffffffffffffff81111561093d57600080fd5b610949868287016108b5565b9497909650939450505050565b60008060006040848603121561096b57600080fd5b83359250602084013567ffffffffffffffff81111561093d57600080fd5b60208082526022908201527f6f6e6c79206d756c746973696720616e64206f776e6572206861732061636365604082015261737360f01b606082015260800190565b6000602082840312156109dd57600080fd5b5051919050565b6000602082840312156109f657600080fd5b8151801515811461086357600080fd5b634e487b7160e01b600052601160045260246000fd5b8082018082111561083257610832610a06565b634e487b7160e01b600052603260045260246000fd5b600060018201610a5757610a57610a06565b506001019056fea2646970667358221220188102c168bb3c022598dad278a59a7d7829bdbfa9bb3a00211343cd6d4079a064736f6c63430008100033

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.