Contract 0x36766780336e393e10bb4fd6b5ed36ef29a4f867 1

Txn Hash Method
Block
From
To
Value [Txn Fee]
0xf44e6847ebdf41d07211bf5605364201355c5fb7704e9c99a2b907571813e4aaAdd Strategy38799402022-07-27 8:24:19124 days 27 mins ago0xa16226396d79dc7b3bc70de0daca4eef11742a9e IN  0x36766780336e393e10bb4fd6b5ed36ef29a4f8670 CRO0.4655011821530
0xf3fb6e5fe4354a5260f733d4fb2e096e2581fdcca236d5e233b7505a79037e980x6080604038798812022-07-27 8:18:44124 days 33 mins ago0xa16226396d79dc7b3bc70de0daca4eef11742a9e IN  Create: ExecutionManager0 CRO2.7555761390450
[ Download CSV Export 
Parent Txn Hash Block From To Value
Loading

Contract Source Code Verified (Exact Match)

Contract Name:
ExecutionManager

Compiler Version
v0.8.4+commit.c7e474f2

Optimization Enabled:
Yes with 200 runs

Other Settings:
default evmVersion

Contract Source Code (Solidity Standard Json-Input format)

File 1 of 5 : ExecutionManager.sol
/**
                                                                                                                                             
                                                                                                                                                      
                                                             :YJJJ7                          ^YJJJ!                                     ?JJJJ.        
                                                             [email protected]@@@&                          [email protected]@@@#                                    [email protected]@@@@^        
                                                             [email protected]&&@B                          [email protected]@@@B                                     @@@@@^        
                                                                                             [email protected]@@@B                                    [email protected]@@@@^        
     .&&&&#  :&&&&B  ^&&&&B     5&&&&&&&&&&&&&&&&&&&&&&&&&G  !&##&P  !&&&&&&&&&&&&&&&~  G&&&&@@@@@@&&&&#  :&&&&&&&&&&&&&&&Y  Y&&&&&&&&&&@@@@@^        
     :@@@@@. [email protected]@@@@  [email protected]@@@@     [email protected]@@@@@@@@@@@@@@@@@@@@@@@@&  [email protected]@@@&  [email protected]@@@@@@@@@@@@@@?  @@@@@@@@@@@@@@@@. ^@@@@@@@@@@@@@@@G  [email protected]@@@@@@@@@@@@@@^        
     :@@@@@. [email protected]@@@@  [email protected]@@@@     [email protected]@@@&[email protected]@@@@B5555#@@@@&  [email protected]@@@#  [email protected]@@@@[email protected]@@@@7  JP555&@@@@&555P5  ^@@@@@P555Y&@@@@G  [email protected]@@@&[email protected]@@@@^        
     .&&&&#  :&&&&B  [email protected]@@@@     [email protected]@@@5     @@@@@:    [email protected]@@@&  [email protected]@@@#  [email protected]@@@#     &@@@@7       [email protected]@@@B       ^@@@@@:[email protected]@@@G  [email protected]@@@P     @@@@@^        
                     [email protected]@@@@     [email protected]@@@5    [email protected]@@@@:    [email protected]@@@&  [email protected]@@@#  [email protected]@@@#     &@@@@7       [email protected]@@@B       ^@@@@@@@@@@@@@@@G  [email protected]@@@G    [email protected]@@@@^        
                     [email protected]@@@@     [email protected]@@@5    [email protected]@@@@:    [email protected]@@@&  [email protected]@@@#  [email protected]@@@#     &@@@@7       [email protected]@@@B       ^@@@@@@@@@@@@@@@G  [email protected]@@@G    [email protected]@@@@^        
                     [email protected]@@@@     [email protected]@@@5    [email protected]@@@@:    [email protected]@@@&  [email protected]@@@#  [email protected]@@@#     &@@@@7       [email protected]@@@B       ^@@@@@^:::::::::.  [email protected]@@@P     @@@@@^        
     [email protected]@@@@     [email protected]@@@5    [email protected]@@@@:    [email protected]@@@&  [email protected]@@@#  [email protected]@@@#     &@@@@7       [email protected]@@@B       ^@@@@@Y????????J~  [email protected]@@@&[email protected]@@@@^        
     ^@@@@@@@@@@@@@@@@@@@@@     [email protected]@@@P    [email protected]@@@@:    [email protected]@@@&  [email protected]@@@&  [email protected]@@@&     &@@@@7       [email protected]@@@B       ^@@@@@@@@@@@@@@@B  [email protected]@@@@@@@@@@@@@@^        
     :&&&&&&&&&&&&&&&&&&&&#     [email protected]&&@J    .&&&&&:    [email protected]&&@B  [email protected]&&@B  [email protected]&&@B     [email protected]&&@!       [email protected]&&@P       ^@&&&&&&&&&&&&&@5  [email protected]&&&&&&&&&&&&&&:        
                                                                                                                                                      
                                                                                                                                                      
                                                                                                                                                      
                                                                                                          
 */
// SPDX-License-Identifier: MIT
pragma solidity ^0.8.0;

import {Ownable} from "@openzeppelin/contracts/access/Ownable.sol";
import {EnumerableSet} from "@openzeppelin/contracts/utils/structs/EnumerableSet.sol";

import {IExecutionManager} from "./interfaces/IExecutionManager.sol";

/**
 * @title ExecutionManager
 * @notice It allows adding/removing execution strategies for trading on the Minted exchange.
 */
contract ExecutionManager is IExecutionManager, Ownable {
    using EnumerableSet for EnumerableSet.AddressSet;

    EnumerableSet.AddressSet private _whitelistedStrategies;

    event StrategyRemoved(address indexed strategy);
    event StrategyWhitelisted(address indexed strategy);

    /**
     * @notice Add an execution strategy in the system
     * @param strategy address of the strategy to add
     */
    function addStrategy(address strategy) external override onlyOwner {
        require(!_whitelistedStrategies.contains(strategy), "Strategy: Already whitelisted");
        _whitelistedStrategies.add(strategy);

        emit StrategyWhitelisted(strategy);
    }

    /**
     * @notice Remove an execution strategy from the system
     * @param strategy address of the strategy to remove
     */
    function removeStrategy(address strategy) external override onlyOwner {
        require(_whitelistedStrategies.contains(strategy), "Strategy: Not whitelisted");
        _whitelistedStrategies.remove(strategy);

        emit StrategyRemoved(strategy);
    }

    /**
     * @notice Returns if an execution strategy is in the system
     * @param strategy address of the strategy
     */
    function isStrategyWhitelisted(address strategy) external view override returns (bool) {
        return _whitelistedStrategies.contains(strategy);
    }

    /**
     * @notice View number of whitelisted strategies
     */
    function viewCountWhitelistedStrategies() external view override returns (uint256) {
        return _whitelistedStrategies.length();
    }

    /**
     * @notice See whitelisted strategies in the system
     * @param cursor cursor (should start at 0 for first request)
     * @param size size of the response (e.g., 50)
     */
    function viewWhitelistedStrategies(uint256 cursor, uint256 size)
        external
        view
        override
        returns (address[] memory, uint256)
    {
        uint256 length = size;

        if (length > _whitelistedStrategies.length() - cursor) {
            length = _whitelistedStrategies.length() - cursor;
        }

        address[] memory whitelistedStrategies = new address[](length);

        for (uint256 i = 0; i < length; i++) {
            whitelistedStrategies[i] = _whitelistedStrategies.at(cursor + i);
        }

        return (whitelistedStrategies, cursor + length);
    }
}

File 2 of 5 : Ownable.sol
// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts v4.4.1 (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 Returns the address of the current owner.
     */
    function owner() public view virtual returns (address) {
        return _owner;
    }

    /**
     * @dev Throws if called by any account other than the owner.
     */
    modifier onlyOwner() {
        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 5 : EnumerableSet.sol
// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts v4.4.1 (utils/structs/EnumerableSet.sol)

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.
 *
 * ```
 * 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.
 */
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) {
        return _values(set._inner);
    }

    // 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;

        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 on 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;

        assembly {
            result := store
        }

        return result;
    }
}

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

interface IExecutionManager {
    function addStrategy(address strategy) external;

    function removeStrategy(address strategy) external;

    function isStrategyWhitelisted(address strategy) external view returns (bool);

    function viewWhitelistedStrategies(uint256 cursor, uint256 size)
        external
        view
        returns (address[] memory, uint256);

    function viewCountWhitelistedStrategies() external view returns (uint256);
}

File 5 of 5 : 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;
    }
}

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

Contract ABI

[{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"previousOwner","type":"address"},{"indexed":true,"internalType":"address","name":"newOwner","type":"address"}],"name":"OwnershipTransferred","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"strategy","type":"address"}],"name":"StrategyRemoved","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"strategy","type":"address"}],"name":"StrategyWhitelisted","type":"event"},{"inputs":[{"internalType":"address","name":"strategy","type":"address"}],"name":"addStrategy","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"strategy","type":"address"}],"name":"isStrategyWhitelisted","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"owner","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"strategy","type":"address"}],"name":"removeStrategy","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"renounceOwnership","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"newOwner","type":"address"}],"name":"transferOwnership","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"viewCountWhitelistedStrategies","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"cursor","type":"uint256"},{"internalType":"uint256","name":"size","type":"uint256"}],"name":"viewWhitelistedStrategies","outputs":[{"internalType":"address[]","name":"","type":"address[]"},{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"}]

608060405234801561001057600080fd5b5061001a3361001f565b61006f565b600080546001600160a01b038381166001600160a01b0319831681178455604051919092169283917f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e09190a35050565b6108a38061007e6000396000f3fe608060405234801561001057600080fd5b50600436106100885760003560e01c80638da5cb5b1161005b5780638da5cb5b146100e7578063985e3a2f14610102578063999ba27c14610118578063f2fde38b1461013b57600080fd5b8063175188e81461008d578063223e5479146100a257806331fb5b1f146100b5578063715018a6146100df575b600080fd5b6100a061009b36600461073f565b61014e565b005b6100a06100b036600461073f565b61021b565b6100c86100c3366004610766565b6102e0565b6040516100d6929190610787565b60405180910390f35b6100a06103f1565b6000546040516001600160a01b0390911681526020016100d6565b61010a610427565b6040519081526020016100d6565b61012b61012636600461073f565b610438565b60405190151581526020016100d6565b6100a061014936600461073f565b61044b565b6000546001600160a01b031633146101815760405162461bcd60e51b8152600401610178906107d8565b60405180910390fd5b61018c6001826104e6565b6101d85760405162461bcd60e51b815260206004820152601960248201527f53747261746567793a204e6f742077686974656c6973746564000000000000006044820152606401610178565b6101e360018261050b565b506040516001600160a01b038216907f09a1db4b80c32706328728508c941a6b954f31eb5affd32f236c1fd405f8fea490600090a250565b6000546001600160a01b031633146102455760405162461bcd60e51b8152600401610178906107d8565b6102506001826104e6565b1561029d5760405162461bcd60e51b815260206004820152601d60248201527f53747261746567793a20416c72656164792077686974656c69737465640000006044820152606401610178565b6102a8600182610520565b506040516001600160a01b038216907f6b583e2e3ad2e182671d77905fee57b1ffd8ce2aa5c0b652ca029317919751a490600090a250565b6060600082846102f06001610535565b6102fa9190610825565b811115610319578461030c6001610535565b6103169190610825565b90505b60008167ffffffffffffffff81111561034257634e487b7160e01b600052604160045260246000fd5b60405190808252806020026020018201604052801561036b578160200160208202803683370190505b50905060005b828110156103d85761038e610386828961080d565b60019061053f565b8282815181106103ae57634e487b7160e01b600052603260045260246000fd5b6001600160a01b0390921660209283029190910190910152806103d08161083c565b915050610371565b50806103e4838861080d565b9350935050509250929050565b6000546001600160a01b0316331461041b5760405162461bcd60e51b8152600401610178906107d8565b610425600061054b565b565b60006104336001610535565b905090565b60006104456001836104e6565b92915050565b6000546001600160a01b031633146104755760405162461bcd60e51b8152600401610178906107d8565b6001600160a01b0381166104da5760405162461bcd60e51b815260206004820152602660248201527f4f776e61626c653a206e6577206f776e657220697320746865207a65726f206160448201526564647265737360d01b6064820152608401610178565b6104e38161054b565b50565b6001600160a01b038116600090815260018301602052604081205415155b9392505050565b6000610504836001600160a01b03841661059b565b6000610504836001600160a01b0384166106b8565b6000610445825490565b60006105048383610707565b600080546001600160a01b038381166001600160a01b0319831681178455604051919092169283917f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e09190a35050565b600081815260018301602052604081205480156106ae5760006105bf600183610825565b85549091506000906105d390600190610825565b905081811461065457600086600001828154811061060157634e487b7160e01b600052603260045260246000fd5b906000526020600020015490508087600001848154811061063257634e487b7160e01b600052603260045260246000fd5b6000918252602080832090910192909255918252600188019052604090208390555b855486908061067357634e487b7160e01b600052603160045260246000fd5b600190038181906000526020600020016000905590558560010160008681526020019081526020016000206000905560019350505050610445565b6000915050610445565b60008181526001830160205260408120546106ff57508154600181810184556000848152602080822090930184905584548482528286019093526040902091909155610445565b506000610445565b600082600001828154811061072c57634e487b7160e01b600052603260045260246000fd5b9060005260206000200154905092915050565b600060208284031215610750578081fd5b81356001600160a01b0381168114610504578182fd5b60008060408385031215610778578081fd5b50508035926020909101359150565b604080825283519082018190526000906020906060840190828701845b828110156107c95781516001600160a01b0316845292840192908401906001016107a4565b50505092019290925292915050565b6020808252818101527f4f776e61626c653a2063616c6c6572206973206e6f7420746865206f776e6572604082015260600190565b6000821982111561082057610820610857565b500190565b60008282101561083757610837610857565b500390565b600060001982141561085057610850610857565b5060010190565b634e487b7160e01b600052601160045260246000fdfea2646970667358221220a40e6e6c6587325ade1baf60e5764e14fcb32703f81d490480e75f511a73343764736f6c63430008040033

Block Transaction Gas Used Reward
Age Block Fee Address BC Fee Address Voting Power Jailed Incoming
Block Uncle Number Difficulty Gas Used Reward
Loading
Make sure to use the "Vote Down" button for any spammy posts, and the "Vote Up" for interesting conversations.