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.0;

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

contract FoxeAirdrop is Ownable {
    IERC20 public token;
    uint256 private constant MAX_CLAIMABLE = 1777819;
    uint256 private claimedCount;
    mapping(address => bool) public hasClaimed;
    bytes32 public merkleRoot;
    bool public isAirdropEnabled;

    event Claimed(address indexed claimer, uint256 amount);

    constructor(IERC20 _token, bytes32 _merkleRoot) {
        token = _token;
        merkleRoot = _merkleRoot;
        isAirdropEnabled = true;
    }

    function setMerkleRoot(bytes32 _merkleRoot) external onlyOwner {
        merkleRoot = _merkleRoot;
    }

    function toggleAirdrop(bool _isAirdropEnabled) external onlyOwner {
        isAirdropEnabled = _isAirdropEnabled;
    }

    function claim(bytes32[] calldata merkleProof) external {
        require(isAirdropEnabled, "Airdrop: The airdrop is currently disabled");
        require(claimedCount < MAX_CLAIMABLE, "Airdrop: All tokens have been claimed");
        require(!hasClaimed[msg.sender], "Airdrop: You have already claimed your tokens");

        bytes32 node = keccak256(abi.encodePacked(msg.sender));
        require(MerkleProof.verify(merkleProof, merkleRoot, node), "Airdrop: Invalid merkle proof");

        uint256 amount;
        if (claimedCount < 50) {
            amount = 1777819000000 * 10 ** 18;
        } else if (claimedCount >= 50 && claimedCount < 500) {
            amount = 47408506667 * 10 ** 18;
        } else if (claimedCount >= 500 && claimedCount < 2500) {
            amount = 10666914000 * 10 ** 18;
        } else if (claimedCount >= 2500 && claimedCount < 10000) {
            amount = 2844510400 * 10 ** 18;
        } else if (claimedCount >= 10000 && claimedCount < 50000) {
            amount = 533345700 * 10 ** 18;
        } else {
            amount = 12347258.6 * 10 ** 18;
        }

        hasClaimed[msg.sender] = true;
        claimedCount++;

        require(token.transfer(msg.sender, amount), "Airdrop: Token transfer failed");
        emit Claimed(msg.sender, amount);
    }

    function emergencyWithdraw(uint256 _amount) external onlyOwner {
        require(token.transfer(owner(), _amount), "Airdrop: Emergency withdrawal failed");
    }
}

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

pragma solidity ^0.8.0;

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

pragma solidity ^0.8.0;

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

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

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

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

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

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

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

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

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

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

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

pragma solidity ^0.8.0;

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

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

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

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

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

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

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

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

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

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

• No Contract Security Audit Submitted- Submit Audit Here

[{"inputs":[{"internalType":"contract IERC20","name":"_token","type":"address"},{"internalType":"bytes32","name":"_merkleRoot","type":"bytes32"}],"stateMutability":"nonpayable","type":"constructor"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"claimer","type":"address"},{"indexed":false,"internalType":"uint256","name":"amount","type":"uint256"}],"name":"Claimed","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"previousOwner","type":"address"},{"indexed":true,"internalType":"address","name":"newOwner","type":"address"}],"name":"OwnershipTransferred","type":"event"},{"inputs":[{"internalType":"bytes32[]","name":"merkleProof","type":"bytes32[]"}],"name":"claim","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"_amount","type":"uint256"}],"name":"emergencyWithdraw","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"","type":"address"}],"name":"hasClaimed","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"isAirdropEnabled","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"merkleRoot","outputs":[{"internalType":"bytes32","name":"","type":"bytes32"}],"stateMutability":"view","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":"bytes32","name":"_merkleRoot","type":"bytes32"}],"name":"setMerkleRoot","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"bool","name":"_isAirdropEnabled","type":"bool"}],"name":"toggleAirdrop","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"token","outputs":[{"internalType":"contract IERC20","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"newOwner","type":"address"}],"name":"transferOwnership","outputs":[],"stateMutability":"nonpayable","type":"function"}]

608060405234801561001057600080fd5b50604051610b26380380610b2683398101604081905261002f916100bd565b6100383361006d565b600180546001600160a01b0319166001600160a01b03939093169290921782556004556005805460ff191690911790556100f7565b600080546001600160a01b038381166001600160a01b0319831681178455604051919092169283917f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e09190a35050565b600080604083850312156100d057600080fd5b82516001600160a01b03811681146100e757600080fd5b6020939093015192949293505050565b610a20806101066000396000f3fe608060405234801561001057600080fd5b50600436106100a95760003560e01c806382e5270a1161007157806382e5270a1461012d5780638d0b3e7a146101405780638da5cb5b1461014d578063b391c50814610172578063f2fde38b14610185578063fc0c546a1461019857600080fd5b80632eb4a7ab146100ae5780635312ea8e146100ca578063715018a6146100df57806373b2e80e146100e75780637cb647591461011a575b600080fd5b6100b760045481565b6040519081526020015b60405180910390f35b6100dd6100d83660046108ae565b6101ab565b005b6100dd6102a7565b61010a6100f53660046108c7565b60036020526000908152604090205460ff1681565b60405190151581526020016100c1565b6100dd6101283660046108ae565b6102bb565b6100dd61013b3660046108fe565b6102c8565b60055461010a9060ff1681565b6000546001600160a01b03165b6040516001600160a01b0390911681526020016100c1565b6100dd61018036600461091b565b6102e3565b6100dd6101933660046108c7565b6106f9565b60015461015a906001600160a01b031681565b6101b361076f565b6001546001600160a01b031663a9059cbb6101d66000546001600160a01b031690565b6040516001600160e01b031960e084901b1681526001600160a01b039091166004820152602481018490526044016020604051808303816000875af1158015610223573d6000803e3d6000fd5b505050506040513d601f19601f820116820180604052508101906102479190610990565b6102a45760405162461bcd60e51b8152602060048201526024808201527f41697264726f703a20456d657267656e6379207769746864726177616c2066616044820152631a5b195960e21b60648201526084015b60405180910390fd5b50565b6102af61076f565b6102b960006107c9565b565b6102c361076f565b600455565b6102d061076f565b6005805460ff1916911515919091179055565b60055460ff166103485760405162461bcd60e51b815260206004820152602a60248201527f41697264726f703a205468652061697264726f702069732063757272656e746c6044820152691e48191a5cd8589b195960b21b606482015260840161029b565b621b209b600254106103aa5760405162461bcd60e51b815260206004820152602560248201527f41697264726f703a20416c6c20746f6b656e732068617665206265656e20636c604482015264185a5b595960da1b606482015260840161029b565b3360009081526003602052604090205460ff16156104205760405162461bcd60e51b815260206004820152602d60248201527f41697264726f703a20596f75206861766520616c726561647920636c61696d6560448201526c6420796f757220746f6b656e7360981b606482015260840161029b565b6040516bffffffffffffffffffffffff193360601b16602082015260009060340160405160208183030381529060405280519060200120905061049a838380806020026020016040519081016040528093929190818152602001838360200280828437600092019190915250506004549150849050610819565b6104e65760405162461bcd60e51b815260206004820152601d60248201527f41697264726f703a20496e76616c6964206d65726b6c652070726f6f66000000604482015260640161029b565b60006032600254101561050757506c16707168d04ce3c3007b0000006105d0565b60326002541015801561051d57506101f4600254105b1561053557506b992f65c821fba51659cc00006105d0565b6101f46002541015801561054c57506109c4600254105b1561056457506b227776e6a034910ac14000006105d0565b6109c46002541015801561057b5750612710600254105b1561059357506b0930ec81c45248cfab0000006105d0565b612710600254101580156105aa575061c350600254105b156105c257506b01b92c5854cf6da6f01000006105d0565b506a0a36a23adbe83932e400005b336000908152600360205260408120805460ff1916600117905560028054916105f8836109ad565b909155505060015460405163a9059cbb60e01b8152336004820152602481018390526001600160a01b039091169063a9059cbb906044016020604051808303816000875af115801561064e573d6000803e3d6000fd5b505050506040513d601f19601f820116820180604052508101906106729190610990565b6106be5760405162461bcd60e51b815260206004820152601e60248201527f41697264726f703a20546f6b656e207472616e73666572206661696c65640000604482015260640161029b565b60405181815233907fd8138f8a3f377c5259ca548e70e4c2de94f129f5a11036a15b69513cba2b426a9060200160405180910390a250505050565b61070161076f565b6001600160a01b0381166107665760405162461bcd60e51b815260206004820152602660248201527f4f776e61626c653a206e6577206f776e657220697320746865207a65726f206160448201526564647265737360d01b606482015260840161029b565b6102a4816107c9565b6000546001600160a01b031633146102b95760405162461bcd60e51b815260206004820181905260248201527f4f776e61626c653a2063616c6c6572206973206e6f7420746865206f776e6572604482015260640161029b565b600080546001600160a01b038381166001600160a01b0319831681178455604051919092169283917f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e09190a35050565b600082610826858461082f565b14949350505050565b600081815b84518110156108745761086082868381518110610853576108536109d4565b602002602001015161087c565b91508061086c816109ad565b915050610834565b509392505050565b60008183106108985760008281526020849052604090206108a7565b60008381526020839052604090205b9392505050565b6000602082840312156108c057600080fd5b5035919050565b6000602082840312156108d957600080fd5b81356001600160a01b03811681146108a757600080fd5b80151581146102a457600080fd5b60006020828403121561091057600080fd5b81356108a7816108f0565b6000806020838503121561092e57600080fd5b823567ffffffffffffffff8082111561094657600080fd5b818501915085601f83011261095a57600080fd5b81358181111561096957600080fd5b8660208260051b850101111561097e57600080fd5b60209290920196919550909350505050565b6000602082840312156109a257600080fd5b81516108a7816108f0565b6000600182016109cd57634e487b7160e01b600052601160045260246000fd5b5060010190565b634e487b7160e01b600052603260045260246000fdfea2646970667358221220422b257aca849454a25105605f3e678431146dc231262f307c09fb0fcbc7e27664736f6c63430008120033000000000000000000000000378e1be15be6d6d1f23cfe7090b6a77660dbf14d6c9f4ec5eee9597f240e9a97f877a78ced19d6ec351fa6b3ea39f7e7afc4bdfd

0x608060405234801561001057600080fd5b50600436106100a95760003560e01c806382e5270a1161007157806382e5270a1461012d5780638d0b3e7a146101405780638da5cb5b1461014d578063b391c50814610172578063f2fde38b14610185578063fc0c546a1461019857600080fd5b80632eb4a7ab146100ae5780635312ea8e146100ca578063715018a6146100df57806373b2e80e146100e75780637cb647591461011a575b600080fd5b6100b760045481565b6040519081526020015b60405180910390f35b6100dd6100d83660046108ae565b6101ab565b005b6100dd6102a7565b61010a6100f53660046108c7565b60036020526000908152604090205460ff1681565b60405190151581526020016100c1565b6100dd6101283660046108ae565b6102bb565b6100dd61013b3660046108fe565b6102c8565b60055461010a9060ff1681565b6000546001600160a01b03165b6040516001600160a01b0390911681526020016100c1565b6100dd61018036600461091b565b6102e3565b6100dd6101933660046108c7565b6106f9565b60015461015a906001600160a01b031681565b6101b361076f565b6001546001600160a01b031663a9059cbb6101d66000546001600160a01b031690565b6040516001600160e01b031960e084901b1681526001600160a01b039091166004820152602481018490526044016020604051808303816000875af1158015610223573d6000803e3d6000fd5b505050506040513d601f19601f820116820180604052508101906102479190610990565b6102a45760405162461bcd60e51b8152602060048201526024808201527f41697264726f703a20456d657267656e6379207769746864726177616c2066616044820152631a5b195960e21b60648201526084015b60405180910390fd5b50565b6102af61076f565b6102b960006107c9565b565b6102c361076f565b600455565b6102d061076f565b6005805460ff1916911515919091179055565b60055460ff166103485760405162461bcd60e51b815260206004820152602a60248201527f41697264726f703a205468652061697264726f702069732063757272656e746c6044820152691e48191a5cd8589b195960b21b606482015260840161029b565b621b209b600254106103aa5760405162461bcd60e51b815260206004820152602560248201527f41697264726f703a20416c6c20746f6b656e732068617665206265656e20636c604482015264185a5b595960da1b606482015260840161029b565b3360009081526003602052604090205460ff16156104205760405162461bcd60e51b815260206004820152602d60248201527f41697264726f703a20596f75206861766520616c726561647920636c61696d6560448201526c6420796f757220746f6b656e7360981b606482015260840161029b565b6040516bffffffffffffffffffffffff193360601b16602082015260009060340160405160208183030381529060405280519060200120905061049a838380806020026020016040519081016040528093929190818152602001838360200280828437600092019190915250506004549150849050610819565b6104e65760405162461bcd60e51b815260206004820152601d60248201527f41697264726f703a20496e76616c6964206d65726b6c652070726f6f66000000604482015260640161029b565b60006032600254101561050757506c16707168d04ce3c3007b0000006105d0565b60326002541015801561051d57506101f4600254105b1561053557506b992f65c821fba51659cc00006105d0565b6101f46002541015801561054c57506109c4600254105b1561056457506b227776e6a034910ac14000006105d0565b6109c46002541015801561057b5750612710600254105b1561059357506b0930ec81c45248cfab0000006105d0565b612710600254101580156105aa575061c350600254105b156105c257506b01b92c5854cf6da6f01000006105d0565b506a0a36a23adbe83932e400005b336000908152600360205260408120805460ff1916600117905560028054916105f8836109ad565b909155505060015460405163a9059cbb60e01b8152336004820152602481018390526001600160a01b039091169063a9059cbb906044016020604051808303816000875af115801561064e573d6000803e3d6000fd5b505050506040513d601f19601f820116820180604052508101906106729190610990565b6106be5760405162461bcd60e51b815260206004820152601e60248201527f41697264726f703a20546f6b656e207472616e73666572206661696c65640000604482015260640161029b565b60405181815233907fd8138f8a3f377c5259ca548e70e4c2de94f129f5a11036a15b69513cba2b426a9060200160405180910390a250505050565b61070161076f565b6001600160a01b0381166107665760405162461bcd60e51b815260206004820152602660248201527f4f776e61626c653a206e6577206f776e657220697320746865207a65726f206160448201526564647265737360d01b606482015260840161029b565b6102a4816107c9565b6000546001600160a01b031633146102b95760405162461bcd60e51b815260206004820181905260248201527f4f776e61626c653a2063616c6c6572206973206e6f7420746865206f776e6572604482015260640161029b565b600080546001600160a01b038381166001600160a01b0319831681178455604051919092169283917f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e09190a35050565b600082610826858461082f565b14949350505050565b600081815b84518110156108745761086082868381518110610853576108536109d4565b602002602001015161087c565b91508061086c816109ad565b915050610834565b509392505050565b60008183106108985760008281526020849052604090206108a7565b60008381526020839052604090205b9392505050565b6000602082840312156108c057600080fd5b5035919050565b6000602082840312156108d957600080fd5b81356001600160a01b03811681146108a757600080fd5b80151581146102a457600080fd5b60006020828403121561091057600080fd5b81356108a7816108f0565b6000806020838503121561092e57600080fd5b823567ffffffffffffffff8082111561094657600080fd5b818501915085601f83011261095a57600080fd5b81358181111561096957600080fd5b8660208260051b850101111561097e57600080fd5b60209290920196919550909350505050565b6000602082840312156109a257600080fd5b81516108a7816108f0565b6000600182016109cd57634e487b7160e01b600052601160045260246000fd5b5060010190565b634e487b7160e01b600052603260045260246000fdfea2646970667358221220422b257aca849454a25105605f3e678431146dc231262f307c09fb0fcbc7e27664736f6c63430008120033

000000000000000000000000378e1be15be6d6d1f23cfe7090b6a77660dbf14d6c9f4ec5eee9597f240e9a97f877a78ced19d6ec351fa6b3ea39f7e7afc4bdfd

-----Decoded View---------------
Arg [0] : _token (address): 0x378E1BE15BE6d6D1f23Cfe7090b6a77660dBF14d
Arg [1] : _merkleRoot (bytes32): 0x6c9f4ec5eee9597f240e9a97f877a78ced19d6ec351fa6b3ea39f7e7afc4bdfd

-----Encoded View---------------
2 Constructor Arguments found :
Arg [0] : 000000000000000000000000378e1be15be6d6d1f23cfe7090b6a77660dbf14d
Arg [1] : 6c9f4ec5eee9597f240e9a97f877a78ced19d6ec351fa6b3ea39f7e7afc4bdfd