Contract Source Code (Solidity Standard Json-Input format)

IDE

• Blockscan IDE
• 🤖 Code ReaderBeta
• Remix IDE

More Options

• Similar
• Sol2Uml
• Submit Audit
• Compare

// SPDX-License-Identifier: MIT
pragma solidity ^0.8.6;

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

interface IERC20 {
    function totalSupply() external view returns (uint);

    function balanceOf(address account) external view returns (uint);

    function transfer(address recipient, uint amount) external returns (bool);

    function allowance(address owner, address spender) external view returns (uint);

    function approve(address spender, uint amount) external returns (bool);

    function transferFrom(
        address sender,
        address recipient,
        uint amount
    ) external returns (bool);
}

contract TipClaims is Ownable {
    IERC20 private token;

    struct EpochClaim {
        uint claimStart;
        uint claimEnd;
        bytes32 merkleRoot;
        uint claimableTokens;
        mapping(address => bool) userClaimed;
    }

    mapping(uint => EpochClaim) public EpochClaims;

    constructor(address tokenAddress) {
        token = IERC20(tokenAddress);
    }

    function hasUserClaimed(uint _claimIndex, address _user) public view returns (bool) {
        return EpochClaims[_claimIndex].userClaimed[_user];
    }

    function getEpochClaim(uint _claimIndex)
        public
        view
        returns (
            uint claimStart,
            uint claimEnd,
            bytes32 merkleRoot,
            uint claimableTokens
        )
    {
        EpochClaim storage claim = EpochClaims[_claimIndex];
        return (claim.claimStart, claim.claimEnd, claim.merkleRoot, claim.claimableTokens);
    }

    function checkProof(
        bytes32[] memory _proof,
        uint _tokens,
        bytes32 root
    ) internal view returns (bool) {
        bytes32 leaf = keccak256(abi.encodePacked(msg.sender, _tokens));
        return MerkleProof.verify(_proof, root, leaf);
    }

    function setEpochClaim(
        uint _epochIndex,
        uint _claimStart,
        uint _claimEnd,
        bytes32 _merkleRoot,
        uint _claimableTokens
    ) external onlyOwner {
        EpochClaim storage newEpochClaim = EpochClaims[_epochIndex];

        newEpochClaim.claimStart = _claimStart;
        newEpochClaim.claimEnd = _claimEnd;
        newEpochClaim.merkleRoot = _merkleRoot;
        newEpochClaim.claimableTokens = _claimableTokens;
    }

    function claimTokens(
        uint _epochIndex,
        uint _tokens,
        bytes32[] memory _proof
    ) external {
        require(token.balanceOf(address(this)) >= _tokens, "Contract tokens depleted");
        require(EpochClaims[_epochIndex].claimStart < block.timestamp, "Claim has not started");
        require(EpochClaims[_epochIndex].claimEnd > block.timestamp, "Claim has ended");
        require(!EpochClaims[_epochIndex].userClaimed[msg.sender], "User has already claimed");
        require(checkProof(_proof, _tokens, EpochClaims[_epochIndex].merkleRoot), "Invalid proof");
        EpochClaims[_epochIndex].userClaimed[msg.sender] = true;
        EpochClaims[_epochIndex].claimableTokens -= _tokens;
        token.transfer(msg.sender, _tokens);
    }

    function manualRemove () external onlyOwner {
        token.transfer(msg.sender, token.balanceOf(address(this)));
    }
}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v4.9.0) (access/Ownable.sol)

pragma solidity ^0.8.0;

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

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

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

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

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

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

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

    /**
     * @dev Leaves the contract without owner. It will not be possible to call
     * `onlyOwner` functions. Can only be called by the current owner.
     *
     * NOTE: Renouncing ownership will leave the contract without an owner,
     * thereby disabling 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);
    }
}

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

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v4.9.2) (utils/cryptography/MerkleProof.sol)

pragma solidity ^0.8.0;

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

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

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

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

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

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

    /**
     * @dev Returns the root of a tree reconstructed from `leaves` and sibling nodes in `proof`. The reconstruction
     * proceeds by incrementally reconstructing all inner nodes by combining a leaf/inner node with either another
     * leaf/inner node or a proof sibling node, depending on whether each `proofFlags` item is true or false
     * respectively.
     *
     * CAUTION: Not all merkle trees admit multiproofs. To use multiproofs, it is sufficient to ensure that: 1) the tree
     * is complete (but not necessarily perfect), 2) the leaves to be proven are in the opposite order they are in the
     * tree (i.e., as seen from right to left starting at the deepest layer and continuing at the next layer).
     *
     * _Available since v4.7._
     */
    function processMultiProof(
        bytes32[] memory proof,
        bool[] memory proofFlags,
        bytes32[] memory leaves
    ) internal pure returns (bytes32 merkleRoot) {
        // This function rebuilds 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 proofLen = proof.length;
        uint256 totalHashes = proofFlags.length;

        // Check proof validity.
        require(leavesLen + proofLen - 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 from 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) {
            require(proofPos == proofLen, "MerkleProof: invalid multiproof");
            unchecked {
                return hashes[totalHashes - 1];
            }
        } else if (leavesLen > 0) {
            return leaves[0];
        } else {
            return proof[0];
        }
    }

    /**
     * @dev Calldata version of {processMultiProof}.
     *
     * CAUTION: Not all merkle trees admit multiproofs. See {processMultiProof} for details.
     *
     * _Available since v4.7._
     */
    function processMultiProofCalldata(
        bytes32[] calldata proof,
        bool[] calldata proofFlags,
        bytes32[] memory leaves
    ) internal pure returns (bytes32 merkleRoot) {
        // This function rebuilds 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 proofLen = proof.length;
        uint256 totalHashes = proofFlags.length;

        // Check proof validity.
        require(leavesLen + proofLen - 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 from 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) {
            require(proofPos == proofLen, "MerkleProof: invalid multiproof");
            unchecked {
                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)
        }
    }
}

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

• No Contract Security Audit Submitted- Submit Audit Here

[{"inputs":[{"internalType":"address","name":"tokenAddress","type":"address"}],"stateMutability":"nonpayable","type":"constructor"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"previousOwner","type":"address"},{"indexed":true,"internalType":"address","name":"newOwner","type":"address"}],"name":"OwnershipTransferred","type":"event"},{"inputs":[{"internalType":"uint256","name":"","type":"uint256"}],"name":"EpochClaims","outputs":[{"internalType":"uint256","name":"claimStart","type":"uint256"},{"internalType":"uint256","name":"claimEnd","type":"uint256"},{"internalType":"bytes32","name":"merkleRoot","type":"bytes32"},{"internalType":"uint256","name":"claimableTokens","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"_epochIndex","type":"uint256"},{"internalType":"uint256","name":"_tokens","type":"uint256"},{"internalType":"bytes32[]","name":"_proof","type":"bytes32[]"}],"name":"claimTokens","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"_claimIndex","type":"uint256"}],"name":"getEpochClaim","outputs":[{"internalType":"uint256","name":"claimStart","type":"uint256"},{"internalType":"uint256","name":"claimEnd","type":"uint256"},{"internalType":"bytes32","name":"merkleRoot","type":"bytes32"},{"internalType":"uint256","name":"claimableTokens","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"_claimIndex","type":"uint256"},{"internalType":"address","name":"_user","type":"address"}],"name":"hasUserClaimed","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"manualRemove","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"owner","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"renounceOwnership","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"_epochIndex","type":"uint256"},{"internalType":"uint256","name":"_claimStart","type":"uint256"},{"internalType":"uint256","name":"_claimEnd","type":"uint256"},{"internalType":"bytes32","name":"_merkleRoot","type":"bytes32"},{"internalType":"uint256","name":"_claimableTokens","type":"uint256"}],"name":"setEpochClaim","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"newOwner","type":"address"}],"name":"transferOwnership","outputs":[],"stateMutability":"nonpayable","type":"function"}]

608060405234801561001057600080fd5b50604051610c40380380610c4083398101604081905261002f916100ad565b6100383361005d565b600180546001600160a01b0319166001600160a01b03929092169190911790556100dd565b600080546001600160a01b038381166001600160a01b0319831681178455604051919092169283917f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e09190a35050565b6000602082840312156100bf57600080fd5b81516001600160a01b03811681146100d657600080fd5b9392505050565b610b54806100ec6000396000f3fe608060405234801561001057600080fd5b50600436106100a35760003560e01c80638bdcb66011610076578063a697e3911161005b578063a697e391146101b2578063b69d1a08146101c5578063f2fde38b146101d857600080fd5b80638bdcb660146101635780638da5cb5b1461019757600080fd5b806307c7a72d146100a85780632fbf6ad6146100fa578063394a300414610151578063715018a61461015b575b600080fd5b6100e56100b6366004610969565b60008281526002602090815260408083206001600160a01b038516845260040190915290205460ff1692915050565b60405190151581526020015b60405180910390f35b610131610108366004610937565b600260208190526000918252604090912080546001820154928201546003909201549092919084565b6040805194855260208501939093529183015260608201526080016100f1565b6101596101eb565b005b610159610311565b610131610171366004610937565b600090815260026020819052604090912080546001820154928201546003909201549093565b6000546040516001600160a01b0390911681526020016100f1565b6101596101c0366004610a6f565b610325565b6101596101d3366004610995565b610356565b6101596101e63660046108fa565b6106a4565b6101f3610731565b6001546040516370a0823160e01b81523060048201526001600160a01b039091169063a9059cbb90339083906370a082319060240160206040518083038186803b15801561024057600080fd5b505afa158015610254573d6000803e3d6000fd5b505050506040513d601f19601f820116820180604052508101906102789190610950565b6040517fffffffff0000000000000000000000000000000000000000000000000000000060e085901b1681526001600160a01b0390921660048301526024820152604401602060405180830381600087803b1580156102d657600080fd5b505af11580156102ea573d6000803e3d6000fd5b505050506040513d601f19601f8201168201806040525081019061030e9190610915565b50565b610319610731565b610323600061078b565b565b61032d610731565b600094855260026020819052604090952093845560018401929092559282019290925560030155565b6001546040516370a0823160e01b815230600482015283916001600160a01b0316906370a082319060240160206040518083038186803b15801561039957600080fd5b505afa1580156103ad573d6000803e3d6000fd5b505050506040513d601f19601f820116820180604052508101906103d19190610950565b10156104245760405162461bcd60e51b815260206004820152601860248201527f436f6e747261637420746f6b656e73206465706c65746564000000000000000060448201526064015b60405180910390fd5b60008381526002602052604090205442116104815760405162461bcd60e51b815260206004820152601560248201527f436c61696d20686173206e6f7420737461727465640000000000000000000000604482015260640161041b565b60008381526002602052604090206001015442106104e15760405162461bcd60e51b815260206004820152600f60248201527f436c61696d2068617320656e6465640000000000000000000000000000000000604482015260640161041b565b600083815260026020908152604080832033845260040190915290205460ff161561054e5760405162461bcd60e51b815260206004820152601860248201527f557365722068617320616c726561647920636c61696d65640000000000000000604482015260640161041b565b61056f818360026000878152602001908152602001600020600201546107f3565b6105bb5760405162461bcd60e51b815260206004820152600d60248201527f496e76616c69642070726f6f6600000000000000000000000000000000000000604482015260640161041b565b6000838152600260208181526040808420338552600481018352908420805460ff1916600117905586845291905260030180548492906105fc908490610aaa565b90915550506001546040517fa9059cbb000000000000000000000000000000000000000000000000000000008152336004820152602481018490526001600160a01b039091169063a9059cbb90604401602060405180830381600087803b15801561066657600080fd5b505af115801561067a573d6000803e3d6000fd5b505050506040513d601f19601f8201168201806040525081019061069e9190610915565b50505050565b6106ac610731565b6001600160a01b0381166107285760405162461bcd60e51b815260206004820152602660248201527f4f776e61626c653a206e6577206f776e657220697320746865207a65726f206160448201527f6464726573730000000000000000000000000000000000000000000000000000606482015260840161041b565b61030e8161078b565b6000546001600160a01b031633146103235760405162461bcd60e51b815260206004820181905260248201527f4f776e61626c653a2063616c6c6572206973206e6f7420746865206f776e6572604482015260640161041b565b600080546001600160a01b038381167fffffffffffffffffffffffff0000000000000000000000000000000000000000831681178455604051919092169283917f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e09190a35050565b6040516bffffffffffffffffffffffff193360601b166020820152603481018390526000908190605401604051602081830303815290604052805190602001209050610840858483610849565b95945050505050565b600082610856858461085f565b14949350505050565b600081815b84518110156108a4576108908286838151811061088357610883610af2565b60200260200101516108ac565b91508061089c81610ac1565b915050610864565b509392505050565b60008183106108c85760008281526020849052604090206108d7565b60008381526020839052604090205b9392505050565b80356001600160a01b03811681146108f557600080fd5b919050565b60006020828403121561090c57600080fd5b6108d7826108de565b60006020828403121561092757600080fd5b815180151581146108d757600080fd5b60006020828403121561094957600080fd5b5035919050565b60006020828403121561096257600080fd5b5051919050565b6000806040838503121561097c57600080fd5b8235915061098c602084016108de565b90509250929050565b6000806000606084860312156109aa57600080fd5b833592506020808501359250604085013567ffffffffffffffff808211156109d157600080fd5b818701915087601f8301126109e557600080fd5b8135818111156109f7576109f7610b08565b8060051b604051601f19603f83011681018181108582111715610a1c57610a1c610b08565b604052828152858101935084860182860187018c1015610a3b57600080fd5b600095505b83861015610a5e578035855260019590950194938601938601610a40565b508096505050505050509250925092565b600080600080600060a08688031215610a8757600080fd5b505083359560208501359550604085013594606081013594506080013592509050565b600082821015610abc57610abc610adc565b500390565b6000600019821415610ad557610ad5610adc565b5060010190565b634e487b7160e01b600052601160045260246000fd5b634e487b7160e01b600052603260045260246000fd5b634e487b7160e01b600052604160045260246000fdfea2646970667358221220d32db9cc780ac3860c136246111a1ce6790c8045e9e370820bc81e1ea9525efe64736f6c634300080600330000000000000000000000000176b898e92e814c06cc379e508ceb571f70bd40

0x608060405234801561001057600080fd5b50600436106100a35760003560e01c80638bdcb66011610076578063a697e3911161005b578063a697e391146101b2578063b69d1a08146101c5578063f2fde38b146101d857600080fd5b80638bdcb660146101635780638da5cb5b1461019757600080fd5b806307c7a72d146100a85780632fbf6ad6146100fa578063394a300414610151578063715018a61461015b575b600080fd5b6100e56100b6366004610969565b60008281526002602090815260408083206001600160a01b038516845260040190915290205460ff1692915050565b60405190151581526020015b60405180910390f35b610131610108366004610937565b600260208190526000918252604090912080546001820154928201546003909201549092919084565b6040805194855260208501939093529183015260608201526080016100f1565b6101596101eb565b005b610159610311565b610131610171366004610937565b600090815260026020819052604090912080546001820154928201546003909201549093565b6000546040516001600160a01b0390911681526020016100f1565b6101596101c0366004610a6f565b610325565b6101596101d3366004610995565b610356565b6101596101e63660046108fa565b6106a4565b6101f3610731565b6001546040516370a0823160e01b81523060048201526001600160a01b039091169063a9059cbb90339083906370a082319060240160206040518083038186803b15801561024057600080fd5b505afa158015610254573d6000803e3d6000fd5b505050506040513d601f19601f820116820180604052508101906102789190610950565b6040517fffffffff0000000000000000000000000000000000000000000000000000000060e085901b1681526001600160a01b0390921660048301526024820152604401602060405180830381600087803b1580156102d657600080fd5b505af11580156102ea573d6000803e3d6000fd5b505050506040513d601f19601f8201168201806040525081019061030e9190610915565b50565b610319610731565b610323600061078b565b565b61032d610731565b600094855260026020819052604090952093845560018401929092559282019290925560030155565b6001546040516370a0823160e01b815230600482015283916001600160a01b0316906370a082319060240160206040518083038186803b15801561039957600080fd5b505afa1580156103ad573d6000803e3d6000fd5b505050506040513d601f19601f820116820180604052508101906103d19190610950565b10156104245760405162461bcd60e51b815260206004820152601860248201527f436f6e747261637420746f6b656e73206465706c65746564000000000000000060448201526064015b60405180910390fd5b60008381526002602052604090205442116104815760405162461bcd60e51b815260206004820152601560248201527f436c61696d20686173206e6f7420737461727465640000000000000000000000604482015260640161041b565b60008381526002602052604090206001015442106104e15760405162461bcd60e51b815260206004820152600f60248201527f436c61696d2068617320656e6465640000000000000000000000000000000000604482015260640161041b565b600083815260026020908152604080832033845260040190915290205460ff161561054e5760405162461bcd60e51b815260206004820152601860248201527f557365722068617320616c726561647920636c61696d65640000000000000000604482015260640161041b565b61056f818360026000878152602001908152602001600020600201546107f3565b6105bb5760405162461bcd60e51b815260206004820152600d60248201527f496e76616c69642070726f6f6600000000000000000000000000000000000000604482015260640161041b565b6000838152600260208181526040808420338552600481018352908420805460ff1916600117905586845291905260030180548492906105fc908490610aaa565b90915550506001546040517fa9059cbb000000000000000000000000000000000000000000000000000000008152336004820152602481018490526001600160a01b039091169063a9059cbb90604401602060405180830381600087803b15801561066657600080fd5b505af115801561067a573d6000803e3d6000fd5b505050506040513d601f19601f8201168201806040525081019061069e9190610915565b50505050565b6106ac610731565b6001600160a01b0381166107285760405162461bcd60e51b815260206004820152602660248201527f4f776e61626c653a206e6577206f776e657220697320746865207a65726f206160448201527f6464726573730000000000000000000000000000000000000000000000000000606482015260840161041b565b61030e8161078b565b6000546001600160a01b031633146103235760405162461bcd60e51b815260206004820181905260248201527f4f776e61626c653a2063616c6c6572206973206e6f7420746865206f776e6572604482015260640161041b565b600080546001600160a01b038381167fffffffffffffffffffffffff0000000000000000000000000000000000000000831681178455604051919092169283917f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e09190a35050565b6040516bffffffffffffffffffffffff193360601b166020820152603481018390526000908190605401604051602081830303815290604052805190602001209050610840858483610849565b95945050505050565b600082610856858461085f565b14949350505050565b600081815b84518110156108a4576108908286838151811061088357610883610af2565b60200260200101516108ac565b91508061089c81610ac1565b915050610864565b509392505050565b60008183106108c85760008281526020849052604090206108d7565b60008381526020839052604090205b9392505050565b80356001600160a01b03811681146108f557600080fd5b919050565b60006020828403121561090c57600080fd5b6108d7826108de565b60006020828403121561092757600080fd5b815180151581146108d757600080fd5b60006020828403121561094957600080fd5b5035919050565b60006020828403121561096257600080fd5b5051919050565b6000806040838503121561097c57600080fd5b8235915061098c602084016108de565b90509250929050565b6000806000606084860312156109aa57600080fd5b833592506020808501359250604085013567ffffffffffffffff808211156109d157600080fd5b818701915087601f8301126109e557600080fd5b8135818111156109f7576109f7610b08565b8060051b604051601f19603f83011681018181108582111715610a1c57610a1c610b08565b604052828152858101935084860182860187018c1015610a3b57600080fd5b600095505b83861015610a5e578035855260019590950194938601938601610a40565b508096505050505050509250925092565b600080600080600060a08688031215610a8757600080fd5b505083359560208501359550604085013594606081013594506080013592509050565b600082821015610abc57610abc610adc565b500390565b6000600019821415610ad557610ad5610adc565b5060010190565b634e487b7160e01b600052601160045260246000fd5b634e487b7160e01b600052603260045260246000fd5b634e487b7160e01b600052604160045260246000fdfea2646970667358221220d32db9cc780ac3860c136246111a1ce6790c8045e9e370820bc81e1ea9525efe64736f6c63430008060033

0000000000000000000000000176b898e92e814c06cc379e508ceb571f70bd40

-----Decoded View---------------
Arg [0] : tokenAddress (address): 0x0176b898E92e814c06Cc379E508CEB571F70bD40

-----Encoded View---------------
1 Constructor Arguments found :
Arg [0] : 0000000000000000000000000176b898e92e814c06cc379e508ceb571f70bd40