Contract

0x51297Aa8B02398aaDB47F5239E0B7D44d26a3C49

Overview

S Balance

Sonic LogoSonic LogoSonic Logo0 S

S Value

-

Multichain Info

No addresses found
Transaction Hash
Method
Block
From
To

There are no matching entries

Please try again later

Parent Transaction Hash Block From To
View All Internal Transactions
Loading...
Loading

Contract Source Code Verified (Exact Match)

Contract Name:
ShadowSonicLocker

Compiler Version
v0.8.20+commit.a1b79de6

Optimization Enabled:
Yes with 200 runs

Other Settings:
paris EvmVersion
File 1 of 4 : ShadowSonicLocker.sol
// SPDX-License-Identifier: UNLICENSED
pragma solidity ^0.8.0;

import "@openzeppelin/contracts/token/ERC20/IERC20.sol";
import "@openzeppelin/contracts/utils/structs/EnumerableSet.sol";
import "@openzeppelin/contracts/utils/Counters.sol";

contract ShadowSonicLocker {
    using EnumerableSet for EnumerableSet.UintSet;
    using Counters for Counters.Counter;

    struct LockInfo {
        address locker;
        address token;
        uint amount;
        uint unlockTime;
        bool isUnlock;
    }

    mapping(uint => LockInfo) public lockInfos;
    mapping(address => EnumerableSet.UintSet) private userLockIds;
    Counters.Counter private _lockIdTracker;

    constructor() public {
        _lockIdTracker.increment();
    }

    function lockToken(address _token, uint _amount, uint _unlockTime) external returns (uint lockId){
        require(_unlockTime >= block.timestamp, "_unlockTime must greater than now");
        require(_amount > 0, "_amount must greater than zero");
        LockInfo storage lockInfo = lockInfos[_lockIdTracker.current()];
        IERC20(_token).transferFrom(msg.sender, address(this),_amount);
        lockInfo.locker = msg.sender;
        lockInfo.token = _token;
        lockInfo.amount = _amount;
        lockInfo.unlockTime = _unlockTime;
        lockInfo.isUnlock = false;
        userLockIds[msg.sender].add(_lockIdTracker.current());
        _lockIdTracker.increment();
        return _lockIdTracker.current() -1 ;
    }

    function extendLockTime(uint _lockId, uint _unlockTime) external {
        LockInfo storage lockInfo = lockInfos[_lockId];
        require(msg.sender == lockInfo.locker, "caller must be locker.");
        require(lockInfo.locker != address(0), "pool lock not exist.");
        require(_unlockTime > lockInfo.unlockTime, "_unlockTime must greater than older.");
        require(!lockInfo.isUnlock, "not unlock.");
        lockInfo.unlockTime = _unlockTime;

    }

    function unlockToken(uint _lockId) external {
        LockInfo storage lockInfo = lockInfos[_lockId];
        require(msg.sender == lockInfo.locker, "caller must be locker.");
        require(block.timestamp >= lockInfo.unlockTime, "timestamp invalid.");
        require(!lockInfo.isUnlock, "token unlocked.");
        uint amount = lockInfo.amount;
        lockInfo.isUnlock = true;
        IERC20(lockInfo.token).transfer(msg.sender, amount);
    }

    function getUserLockLength(address _user) public view returns (uint256) {
        return userLockIds[_user].length();
    }

    function getLockId(address _user, uint256 index) public view returns (uint) {
        require(index <= userLockIds[_user].length() - 1, "index out of bounds");
        return userLockIds[_user].at(index);
    }

    function getCurrentLockId() public view returns(uint) {
        return _lockIdTracker.current();
    }

}

File 2 of 4 : IERC20.sol
// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v4.9.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 4 : Counters.sol
// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts v4.4.1 (utils/Counters.sol)

pragma solidity ^0.8.0;

/**
 * @title Counters
 * @author Matt Condon (@shrugs)
 * @dev Provides counters that can only be incremented, decremented or reset. This can be used e.g. to track the number
 * of elements in a mapping, issuing ERC721 ids, or counting request ids.
 *
 * Include with `using Counters for Counters.Counter;`
 */
library Counters {
    struct Counter {
        // This variable should never be directly accessed by users of the library: interactions must be restricted to
        // the library's function. As of Solidity v0.5.2, this cannot be enforced, though there is a proposal to add
        // this feature: see https://github.com/ethereum/solidity/issues/4637
        uint256 _value; // default: 0
    }

    function current(Counter storage counter) internal view returns (uint256) {
        return counter._value;
    }

    function increment(Counter storage counter) internal {
        unchecked {
            counter._value += 1;
        }
    }

    function decrement(Counter storage counter) internal {
        uint256 value = counter._value;
        require(value > 0, "Counter: decrement overflow");
        unchecked {
            counter._value = value - 1;
        }
    }

    function reset(Counter storage counter) internal {
        counter._value = 0;
    }
}

File 4 of 4 : EnumerableSet.sol
// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v4.9.0) (utils/structs/EnumerableSet.sol)
// This file was procedurally generated from scripts/generate/templates/EnumerableSet.js.

pragma solidity ^0.8.0;

/**
 * @dev Library for managing
 * https://en.wikipedia.org/wiki/Set_(abstract_data_type)[sets] of primitive
 * types.
 *
 * Sets have the following properties:
 *
 * - Elements are added, removed, and checked for existence in constant time
 * (O(1)).
 * - Elements are enumerated in O(n). No guarantees are made on the ordering.
 *
 * ```solidity
 * contract Example {
 *     // Add the library methods
 *     using EnumerableSet for EnumerableSet.AddressSet;
 *
 *     // Declare a set state variable
 *     EnumerableSet.AddressSet private mySet;
 * }
 * ```
 *
 * As of v3.3.0, sets of type `bytes32` (`Bytes32Set`), `address` (`AddressSet`)
 * and `uint256` (`UintSet`) are supported.
 *
 * [WARNING]
 * ====
 * Trying to delete such a structure from storage will likely result in data corruption, rendering the structure
 * unusable.
 * See https://github.com/ethereum/solidity/pull/11843[ethereum/solidity#11843] for more info.
 *
 * In order to clean an EnumerableSet, you can either remove all elements one by one or create a fresh instance using an
 * array of EnumerableSet.
 * ====
 */
library EnumerableSet {
    // To implement this library for multiple types with as little code
    // repetition as possible, we write it in terms of a generic Set type with
    // bytes32 values.
    // The Set implementation uses private functions, and user-facing
    // implementations (such as AddressSet) are just wrappers around the
    // underlying Set.
    // This means that we can only create new EnumerableSets for types that fit
    // in bytes32.

    struct Set {
        // Storage of set values
        bytes32[] _values;
        // Position of the value in the `values` array, plus 1 because index 0
        // means a value is not in the set.
        mapping(bytes32 => uint256) _indexes;
    }

    /**
     * @dev Add a value to a set. O(1).
     *
     * Returns true if the value was added to the set, that is if it was not
     * already present.
     */
    function _add(Set storage set, bytes32 value) private returns (bool) {
        if (!_contains(set, value)) {
            set._values.push(value);
            // The value is stored at length-1, but we add 1 to all indexes
            // and use 0 as a sentinel value
            set._indexes[value] = set._values.length;
            return true;
        } else {
            return false;
        }
    }

    /**
     * @dev Removes a value from a set. O(1).
     *
     * Returns true if the value was removed from the set, that is if it was
     * present.
     */
    function _remove(Set storage set, bytes32 value) private returns (bool) {
        // We read and store the value's index to prevent multiple reads from the same storage slot
        uint256 valueIndex = set._indexes[value];

        if (valueIndex != 0) {
            // Equivalent to contains(set, value)
            // To delete an element from the _values array in O(1), we swap the element to delete with the last one in
            // the array, and then remove the last element (sometimes called as 'swap and pop').
            // This modifies the order of the array, as noted in {at}.

            uint256 toDeleteIndex = valueIndex - 1;
            uint256 lastIndex = set._values.length - 1;

            if (lastIndex != toDeleteIndex) {
                bytes32 lastValue = set._values[lastIndex];

                // Move the last value to the index where the value to delete is
                set._values[toDeleteIndex] = lastValue;
                // Update the index for the moved value
                set._indexes[lastValue] = valueIndex; // Replace lastValue's index to valueIndex
            }

            // Delete the slot where the moved value was stored
            set._values.pop();

            // Delete the index for the deleted slot
            delete set._indexes[value];

            return true;
        } else {
            return false;
        }
    }

    /**
     * @dev Returns true if the value is in the set. O(1).
     */
    function _contains(Set storage set, bytes32 value) private view returns (bool) {
        return set._indexes[value] != 0;
    }

    /**
     * @dev Returns the number of values on the set. O(1).
     */
    function _length(Set storage set) private view returns (uint256) {
        return set._values.length;
    }

    /**
     * @dev Returns the value stored at position `index` in the set. O(1).
     *
     * Note that there are no guarantees on the ordering of values inside the
     * array, and it may change when more values are added or removed.
     *
     * Requirements:
     *
     * - `index` must be strictly less than {length}.
     */
    function _at(Set storage set, uint256 index) private view returns (bytes32) {
        return set._values[index];
    }

    /**
     * @dev Return the entire set in an array
     *
     * WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed
     * to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that
     * this function has an unbounded cost, and using it as part of a state-changing function may render the function
     * uncallable if the set grows to a point where copying to memory consumes too much gas to fit in a block.
     */
    function _values(Set storage set) private view returns (bytes32[] memory) {
        return set._values;
    }

    // Bytes32Set

    struct Bytes32Set {
        Set _inner;
    }

    /**
     * @dev Add a value to a set. O(1).
     *
     * Returns true if the value was added to the set, that is if it was not
     * already present.
     */
    function add(Bytes32Set storage set, bytes32 value) internal returns (bool) {
        return _add(set._inner, value);
    }

    /**
     * @dev Removes a value from a set. O(1).
     *
     * Returns true if the value was removed from the set, that is if it was
     * present.
     */
    function remove(Bytes32Set storage set, bytes32 value) internal returns (bool) {
        return _remove(set._inner, value);
    }

    /**
     * @dev Returns true if the value is in the set. O(1).
     */
    function contains(Bytes32Set storage set, bytes32 value) internal view returns (bool) {
        return _contains(set._inner, value);
    }

    /**
     * @dev Returns the number of values in the set. O(1).
     */
    function length(Bytes32Set storage set) internal view returns (uint256) {
        return _length(set._inner);
    }

    /**
     * @dev Returns the value stored at position `index` in the set. O(1).
     *
     * Note that there are no guarantees on the ordering of values inside the
     * array, and it may change when more values are added or removed.
     *
     * Requirements:
     *
     * - `index` must be strictly less than {length}.
     */
    function at(Bytes32Set storage set, uint256 index) internal view returns (bytes32) {
        return _at(set._inner, index);
    }

    /**
     * @dev Return the entire set in an array
     *
     * WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed
     * to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that
     * this function has an unbounded cost, and using it as part of a state-changing function may render the function
     * uncallable if the set grows to a point where copying to memory consumes too much gas to fit in a block.
     */
    function values(Bytes32Set storage set) internal view returns (bytes32[] memory) {
        bytes32[] memory store = _values(set._inner);
        bytes32[] memory result;

        /// @solidity memory-safe-assembly
        assembly {
            result := store
        }

        return result;
    }

    // AddressSet

    struct AddressSet {
        Set _inner;
    }

    /**
     * @dev Add a value to a set. O(1).
     *
     * Returns true if the value was added to the set, that is if it was not
     * already present.
     */
    function add(AddressSet storage set, address value) internal returns (bool) {
        return _add(set._inner, bytes32(uint256(uint160(value))));
    }

    /**
     * @dev Removes a value from a set. O(1).
     *
     * Returns true if the value was removed from the set, that is if it was
     * present.
     */
    function remove(AddressSet storage set, address value) internal returns (bool) {
        return _remove(set._inner, bytes32(uint256(uint160(value))));
    }

    /**
     * @dev Returns true if the value is in the set. O(1).
     */
    function contains(AddressSet storage set, address value) internal view returns (bool) {
        return _contains(set._inner, bytes32(uint256(uint160(value))));
    }

    /**
     * @dev Returns the number of values in the set. O(1).
     */
    function length(AddressSet storage set) internal view returns (uint256) {
        return _length(set._inner);
    }

    /**
     * @dev Returns the value stored at position `index` in the set. O(1).
     *
     * Note that there are no guarantees on the ordering of values inside the
     * array, and it may change when more values are added or removed.
     *
     * Requirements:
     *
     * - `index` must be strictly less than {length}.
     */
    function at(AddressSet storage set, uint256 index) internal view returns (address) {
        return address(uint160(uint256(_at(set._inner, index))));
    }

    /**
     * @dev Return the entire set in an array
     *
     * WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed
     * to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that
     * this function has an unbounded cost, and using it as part of a state-changing function may render the function
     * uncallable if the set grows to a point where copying to memory consumes too much gas to fit in a block.
     */
    function values(AddressSet storage set) internal view returns (address[] memory) {
        bytes32[] memory store = _values(set._inner);
        address[] memory result;

        /// @solidity memory-safe-assembly
        assembly {
            result := store
        }

        return result;
    }

    // UintSet

    struct UintSet {
        Set _inner;
    }

    /**
     * @dev Add a value to a set. O(1).
     *
     * Returns true if the value was added to the set, that is if it was not
     * already present.
     */
    function add(UintSet storage set, uint256 value) internal returns (bool) {
        return _add(set._inner, bytes32(value));
    }

    /**
     * @dev Removes a value from a set. O(1).
     *
     * Returns true if the value was removed from the set, that is if it was
     * present.
     */
    function remove(UintSet storage set, uint256 value) internal returns (bool) {
        return _remove(set._inner, bytes32(value));
    }

    /**
     * @dev Returns true if the value is in the set. O(1).
     */
    function contains(UintSet storage set, uint256 value) internal view returns (bool) {
        return _contains(set._inner, bytes32(value));
    }

    /**
     * @dev Returns the number of values in the set. O(1).
     */
    function length(UintSet storage set) internal view returns (uint256) {
        return _length(set._inner);
    }

    /**
     * @dev Returns the value stored at position `index` in the set. O(1).
     *
     * Note that there are no guarantees on the ordering of values inside the
     * array, and it may change when more values are added or removed.
     *
     * Requirements:
     *
     * - `index` must be strictly less than {length}.
     */
    function at(UintSet storage set, uint256 index) internal view returns (uint256) {
        return uint256(_at(set._inner, index));
    }

    /**
     * @dev Return the entire set in an array
     *
     * WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed
     * to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that
     * this function has an unbounded cost, and using it as part of a state-changing function may render the function
     * uncallable if the set grows to a point where copying to memory consumes too much gas to fit in a block.
     */
    function values(UintSet storage set) internal view returns (uint256[] memory) {
        bytes32[] memory store = _values(set._inner);
        uint256[] memory result;

        /// @solidity memory-safe-assembly
        assembly {
            result := store
        }

        return result;
    }
}

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

Contract Security Audit

Contract ABI

[{"inputs":[],"stateMutability":"nonpayable","type":"constructor"},{"inputs":[{"internalType":"uint256","name":"_lockId","type":"uint256"},{"internalType":"uint256","name":"_unlockTime","type":"uint256"}],"name":"extendLockTime","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"getCurrentLockId","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"_user","type":"address"},{"internalType":"uint256","name":"index","type":"uint256"}],"name":"getLockId","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"_user","type":"address"}],"name":"getUserLockLength","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"","type":"uint256"}],"name":"lockInfos","outputs":[{"internalType":"address","name":"locker","type":"address"},{"internalType":"address","name":"token","type":"address"},{"internalType":"uint256","name":"amount","type":"uint256"},{"internalType":"uint256","name":"unlockTime","type":"uint256"},{"internalType":"bool","name":"isUnlock","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"_token","type":"address"},{"internalType":"uint256","name":"_amount","type":"uint256"},{"internalType":"uint256","name":"_unlockTime","type":"uint256"}],"name":"lockToken","outputs":[{"internalType":"uint256","name":"lockId","type":"uint256"}],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"_lockId","type":"uint256"}],"name":"unlockToken","outputs":[],"stateMutability":"nonpayable","type":"function"}]

608060405234801561001057600080fd5b5061001f600280546001019055565b6108f98061002e6000396000f3fe608060405234801561001057600080fd5b506004361061007d5760003560e01c806351e519ac1161005b57806351e519ac14610131578063839972f914610144578063b6fffbf014610157578063dd2e0ac01461016c57600080fd5b806303885e6a14610082578063256e97f01461009d5780632d049032146100b0575b600080fd5b61008a61017f565b6040519081526020015b60405180910390f35b61008a6100ab3660046107b7565b61018f565b6100fc6100be3660046107d2565b600060208190529081526040902080546001820154600283015460038401546004909401546001600160a01b03938416949390921692909160ff1685565b604080516001600160a01b0396871681529590941660208601529284019190915260608301521515608082015260a001610094565b61008a61013f3660046107eb565b6101b6565b61008a610152366004610815565b610256565b61016a610165366004610848565b610426565b005b61016a61017a3660046107d2565b61057d565b600061018a60025490565b905090565b6001600160a01b03811660009081526001602052604081206101b090610700565b92915050565b6001600160a01b038216600090815260016020819052604082206101d990610700565b6101e3919061086a565b82111561022d5760405162461bcd60e51b8152602060048201526013602482015272696e646578206f7574206f6620626f756e647360681b60448201526064015b60405180910390fd5b6001600160a01b038316600090815260016020526040902061024f908361070a565b9392505050565b6000428210156102b25760405162461bcd60e51b815260206004820152602160248201527f5f756e6c6f636b54696d65206d7573742067726561746572207468616e206e6f6044820152607760f81b6064820152608401610224565b600083116103025760405162461bcd60e51b815260206004820152601e60248201527f5f616d6f756e74206d7573742067726561746572207468616e207a65726f00006044820152606401610224565b600080600061031060025490565b81526020810191909152604090810160002090516323b872dd60e01b8152336004820152306024820152604481018690529091506001600160a01b038616906323b872dd906064016020604051808303816000875af1158015610377573d6000803e3d6000fd5b505050506040513d601f19601f8201168201806040525081019061039b919061088b565b508054336001600160a01b03199182161782556001820180549091166001600160a01b03871617905560028082018590556003820184905560048201805460ff19169055546103f99033600090815260016020526040902090610716565b50610408600280546001019055565b600161041360025490565b61041d919061086a565b95945050505050565b600082815260208190526040902080546001600160a01b031633146104865760405162461bcd60e51b815260206004820152601660248201527531b0b63632b91036bab9ba103132903637b1b5b2b91760511b6044820152606401610224565b80546001600160a01b03166104d45760405162461bcd60e51b81526020600482015260146024820152733837b7b6103637b1b5903737ba1032bc34b9ba1760611b6044820152606401610224565b806003015482116105335760405162461bcd60e51b8152602060048201526024808201527f5f756e6c6f636b54696d65206d7573742067726561746572207468616e206f6c6044820152633232b91760e11b6064820152608401610224565b600481015460ff16156105765760405162461bcd60e51b815260206004820152600b60248201526a3737ba103ab73637b1b59760a91b6044820152606401610224565b6003015550565b600081815260208190526040902080546001600160a01b031633146105dd5760405162461bcd60e51b815260206004820152601660248201527531b0b63632b91036bab9ba103132903637b1b5b2b91760511b6044820152606401610224565b80600301544210156106265760405162461bcd60e51b81526020600482015260126024820152713a34b6b2b9ba30b6b81034b73b30b634b21760711b6044820152606401610224565b600481015460ff161561066d5760405162461bcd60e51b815260206004820152600f60248201526e3a37b5b2b7103ab73637b1b5b2b21760891b6044820152606401610224565b60028101546004808301805460ff1916600190811790915583015460405163a9059cbb60e01b81523392810192909252602482018390526001600160a01b03169063a9059cbb906044016020604051808303816000875af11580156106d6573d6000803e3d6000fd5b505050506040513d601f19601f820116820180604052508101906106fa919061088b565b50505050565b60006101b0825490565b600061024f8383610722565b600061024f838361074c565b6000826000018281548110610739576107396108ad565b9060005260206000200154905092915050565b6000818152600183016020526040812054610793575081546001818101845560008481526020808220909301849055845484825282860190935260409020919091556101b0565b5060006101b0565b80356001600160a01b03811681146107b257600080fd5b919050565b6000602082840312156107c957600080fd5b61024f8261079b565b6000602082840312156107e457600080fd5b5035919050565b600080604083850312156107fe57600080fd5b6108078361079b565b946020939093013593505050565b60008060006060848603121561082a57600080fd5b6108338461079b565b95602085013595506040909401359392505050565b6000806040838503121561085b57600080fd5b50508035926020909101359150565b818103818111156101b057634e487b7160e01b600052601160045260246000fd5b60006020828403121561089d57600080fd5b8151801515811461024f57600080fd5b634e487b7160e01b600052603260045260246000fdfea264697066735822122019dbdf82e0d75bc42d2b204b1963a6ec1dfa2aeac709039e7380231497b7e1a064736f6c63430008140033

Deployed Bytecode

0x608060405234801561001057600080fd5b506004361061007d5760003560e01c806351e519ac1161005b57806351e519ac14610131578063839972f914610144578063b6fffbf014610157578063dd2e0ac01461016c57600080fd5b806303885e6a14610082578063256e97f01461009d5780632d049032146100b0575b600080fd5b61008a61017f565b6040519081526020015b60405180910390f35b61008a6100ab3660046107b7565b61018f565b6100fc6100be3660046107d2565b600060208190529081526040902080546001820154600283015460038401546004909401546001600160a01b03938416949390921692909160ff1685565b604080516001600160a01b0396871681529590941660208601529284019190915260608301521515608082015260a001610094565b61008a61013f3660046107eb565b6101b6565b61008a610152366004610815565b610256565b61016a610165366004610848565b610426565b005b61016a61017a3660046107d2565b61057d565b600061018a60025490565b905090565b6001600160a01b03811660009081526001602052604081206101b090610700565b92915050565b6001600160a01b038216600090815260016020819052604082206101d990610700565b6101e3919061086a565b82111561022d5760405162461bcd60e51b8152602060048201526013602482015272696e646578206f7574206f6620626f756e647360681b60448201526064015b60405180910390fd5b6001600160a01b038316600090815260016020526040902061024f908361070a565b9392505050565b6000428210156102b25760405162461bcd60e51b815260206004820152602160248201527f5f756e6c6f636b54696d65206d7573742067726561746572207468616e206e6f6044820152607760f81b6064820152608401610224565b600083116103025760405162461bcd60e51b815260206004820152601e60248201527f5f616d6f756e74206d7573742067726561746572207468616e207a65726f00006044820152606401610224565b600080600061031060025490565b81526020810191909152604090810160002090516323b872dd60e01b8152336004820152306024820152604481018690529091506001600160a01b038616906323b872dd906064016020604051808303816000875af1158015610377573d6000803e3d6000fd5b505050506040513d601f19601f8201168201806040525081019061039b919061088b565b508054336001600160a01b03199182161782556001820180549091166001600160a01b03871617905560028082018590556003820184905560048201805460ff19169055546103f99033600090815260016020526040902090610716565b50610408600280546001019055565b600161041360025490565b61041d919061086a565b95945050505050565b600082815260208190526040902080546001600160a01b031633146104865760405162461bcd60e51b815260206004820152601660248201527531b0b63632b91036bab9ba103132903637b1b5b2b91760511b6044820152606401610224565b80546001600160a01b03166104d45760405162461bcd60e51b81526020600482015260146024820152733837b7b6103637b1b5903737ba1032bc34b9ba1760611b6044820152606401610224565b806003015482116105335760405162461bcd60e51b8152602060048201526024808201527f5f756e6c6f636b54696d65206d7573742067726561746572207468616e206f6c6044820152633232b91760e11b6064820152608401610224565b600481015460ff16156105765760405162461bcd60e51b815260206004820152600b60248201526a3737ba103ab73637b1b59760a91b6044820152606401610224565b6003015550565b600081815260208190526040902080546001600160a01b031633146105dd5760405162461bcd60e51b815260206004820152601660248201527531b0b63632b91036bab9ba103132903637b1b5b2b91760511b6044820152606401610224565b80600301544210156106265760405162461bcd60e51b81526020600482015260126024820152713a34b6b2b9ba30b6b81034b73b30b634b21760711b6044820152606401610224565b600481015460ff161561066d5760405162461bcd60e51b815260206004820152600f60248201526e3a37b5b2b7103ab73637b1b5b2b21760891b6044820152606401610224565b60028101546004808301805460ff1916600190811790915583015460405163a9059cbb60e01b81523392810192909252602482018390526001600160a01b03169063a9059cbb906044016020604051808303816000875af11580156106d6573d6000803e3d6000fd5b505050506040513d601f19601f820116820180604052508101906106fa919061088b565b50505050565b60006101b0825490565b600061024f8383610722565b600061024f838361074c565b6000826000018281548110610739576107396108ad565b9060005260206000200154905092915050565b6000818152600183016020526040812054610793575081546001818101845560008481526020808220909301849055845484825282860190935260409020919091556101b0565b5060006101b0565b80356001600160a01b03811681146107b257600080fd5b919050565b6000602082840312156107c957600080fd5b61024f8261079b565b6000602082840312156107e457600080fd5b5035919050565b600080604083850312156107fe57600080fd5b6108078361079b565b946020939093013593505050565b60008060006060848603121561082a57600080fd5b6108338461079b565b95602085013595506040909401359392505050565b6000806040838503121561085b57600080fd5b50508035926020909101359150565b818103818111156101b057634e487b7160e01b600052601160045260246000fd5b60006020828403121561089d57600080fd5b8151801515811461024f57600080fd5b634e487b7160e01b600052603260045260246000fdfea264697066735822122019dbdf82e0d75bc42d2b204b1963a6ec1dfa2aeac709039e7380231497b7e1a064736f6c63430008140033

Block Transaction 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

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.