Contract

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/security/ReentrancyGuard.sol";
import "./libs/MerkleProof.sol";

// @author: miinded.com

interface IMekaVerseAirdrop {
    function balanceCollection(uint256 _collectionId, address _to) external returns(uint256);
    function claimExternal(address _to, uint256 _collectionId, uint256 _count) external;
}

contract MekaVerseAirdropWL is MerkleProofVerify, ReentrancyGuard {

    IMekaVerseAirdrop public mekaVerseAirdrop;

    constructor(address _mekaVerseAirdrop){
        setMekaVerseAirdrop(_mekaVerseAirdrop);
    }

    function Claim(bytes32[] memory _proof, uint256 _collectionId, uint256 _count, uint256 _max)
    public merkleVerify(_proof, keccak256(abi.encodePacked(_msgSender(), _collectionId, _max))) nonReentrant
    {
        mekaVerseAirdrop.claimExternal(_msgSender(), _collectionId, _count);
        require(mekaVerseAirdrop.balanceCollection(_collectionId, _msgSender()) <= _max, "MekaDrop: Max minted");
    }

    function setMekaVerseAirdrop(address _mekaVerseAirdrop) public onlyOwnerOrAdmins{
        mekaVerseAirdrop = IMekaVerseAirdrop(_mekaVerseAirdrop);
    }

}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v4.8.0) (security/ReentrancyGuard.sol)

pragma solidity ^0.8.0;

/**
 * @dev Contract module that helps prevent reentrant calls to a function.
 *
 * Inheriting from `ReentrancyGuard` will make the {nonReentrant} modifier
 * available, which can be applied to functions to make sure there are no nested
 * (reentrant) calls to them.
 *
 * Note that because there is a single `nonReentrant` guard, functions marked as
 * `nonReentrant` may not call one another. This can be worked around by making
 * those functions `private`, and then adding `external` `nonReentrant` entry
 * points to them.
 *
 * TIP: If you would like to learn more about reentrancy and alternative ways
 * to protect against it, check out our blog post
 * https://blog.openzeppelin.com/reentrancy-after-istanbul/[Reentrancy After Istanbul].
 */
abstract contract ReentrancyGuard {
    // Booleans are more expensive than uint256 or any type that takes up a full
    // word because each write operation emits an extra SLOAD to first read the
    // slot's contents, replace the bits taken up by the boolean, and then write
    // back. This is the compiler's defense against contract upgrades and
    // pointer aliasing, and it cannot be disabled.

    // The values being non-zero value makes deployment a bit more expensive,
    // but in exchange the refund on every call to nonReentrant will be lower in
    // amount. Since refunds are capped to a percentage of the total
    // transaction's gas, it is best to keep them low in cases like this one, to
    // increase the likelihood of the full refund coming into effect.
    uint256 private constant _NOT_ENTERED = 1;
    uint256 private constant _ENTERED = 2;

    uint256 private _status;

    constructor() {
        _status = _NOT_ENTERED;
    }

    /**
     * @dev Prevents a contract from calling itself, directly or indirectly.
     * Calling a `nonReentrant` function from another `nonReentrant`
     * function is not supported. It is possible to prevent this from happening
     * by making the `nonReentrant` function external, and making it call a
     * `private` function that does the actual work.
     */
    modifier nonReentrant() {
        _nonReentrantBefore();
        _;
        _nonReentrantAfter();
    }

    function _nonReentrantBefore() private {
        // On the first call to nonReentrant, _status will be _NOT_ENTERED
        require(_status != _ENTERED, "ReentrancyGuard: reentrant call");

        // Any calls to nonReentrant after this point will fail
        _status = _ENTERED;
    }

    function _nonReentrantAfter() private {
        // By storing the original value once again, a refund is triggered (see
        // https://eips.ethereum.org/EIPS/eip-2200)
        _status = _NOT_ENTERED;
    }
}

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

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

// @author: miinded.com

abstract contract MerkleProofVerify is Admins {
    using MerkleProof for bytes32[];

    /**
    @dev hash of the root of the merkle
    */
    bytes32 public merkleRoot;

    /**
    @dev Used for verify the _proof and the _leaf
        The _leaf need to be calculated by the contract itself
        The _proof is calculated by the server, not by the contract
     */
    modifier merkleVerify(bytes32[] memory _proof, bytes32 _leaf){
        merkleCheck(_proof, _leaf);
        _;
    }

    /**
    @notice Verify the proof of the leaf.
    @dev (see @dev merkleVerify)
    */
    function merkleCheck(bytes32[] memory _proof, bytes32 _leaf) public view {
        require(_proof.verify(merkleRoot, _leaf), "MerkleProofVerify: Proof not valid");
    }

    /**
    @dev onlyOwner can change the root of the merkle.this
        Change root need to be done only if there is no pending tx during the mint.
    */
    function setMerkleRoot(bytes32 _merkleRoot) public onlyOwnerOrAdmins {
        merkleRoot = _merkleRoot;
    }
}

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

pragma solidity ^0.8.0;

import "@openzeppelin/contracts/access/Ownable.sol";

// @author: miinded.com

abstract contract Admins is Ownable{

    mapping(address => bool) private admins;

    /**
    @dev check if the address is admin or not
    **/
    function isAdmin(address _admin) public view returns(bool) {
        return admins[_admin];
    }

    /**
    @dev Set the wallet address who can pass the onlyAdmin modifier
    **/
    function setAdminAddress(address _admin, bool _active) public virtual onlyOwner {
        admins[_admin] = _active;
    }

    /**
    @notice Check if the sender is owner() or admin
    **/
    modifier onlyOwnerOrAdmins() {
        require(admins[_msgSender()] == true || owner() == _msgSender(), "Ownable: caller is not the owner");
        _;
    }

}

// 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 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": 2000
  },
  "outputSelection": {
    "*": {
      "*": [
        "evm.bytecode",
        "evm.deployedBytecode",
        "devdoc",
        "userdoc",
        "metadata",
        "abi"
      ]
    }
  },
  "libraries": {}
}

• No Contract Security Audit Submitted- Submit Audit Here

[{"inputs":[{"internalType":"address","name":"_mekaVerseAirdrop","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":"bytes32[]","name":"_proof","type":"bytes32[]"},{"internalType":"uint256","name":"_collectionId","type":"uint256"},{"internalType":"uint256","name":"_count","type":"uint256"},{"internalType":"uint256","name":"_max","type":"uint256"}],"name":"Claim","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"_admin","type":"address"}],"name":"isAdmin","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"mekaVerseAirdrop","outputs":[{"internalType":"contract IMekaVerseAirdrop","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"bytes32[]","name":"_proof","type":"bytes32[]"},{"internalType":"bytes32","name":"_leaf","type":"bytes32"}],"name":"merkleCheck","outputs":[],"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":"address","name":"_admin","type":"address"},{"internalType":"bool","name":"_active","type":"bool"}],"name":"setAdminAddress","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"_mekaVerseAirdrop","type":"address"}],"name":"setMekaVerseAirdrop","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"bytes32","name":"_merkleRoot","type":"bytes32"}],"name":"setMerkleRoot","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"newOwner","type":"address"}],"name":"transferOwnership","outputs":[],"stateMutability":"nonpayable","type":"function"}]

608060405234801561001057600080fd5b50604051610c54380380610c5483398101604081905261002f9161013c565b6100383361004c565b60016003556100468161009c565b5061016c565b600080546001600160a01b038381166001600160a01b0319831681178455604051919092169283917f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e09190a35050565b3360009081526001602081905260409091205460ff16151514806100ca57506000546001600160a01b031633145b61011a5760405162461bcd60e51b815260206004820181905260248201527f4f776e61626c653a2063616c6c6572206973206e6f7420746865206f776e6572604482015260640160405180910390fd5b600480546001600160a01b0319166001600160a01b0392909216919091179055565b60006020828403121561014e57600080fd5b81516001600160a01b038116811461016557600080fd5b9392505050565b610ad98061017b6000396000f3fe608060405234801561001057600080fd5b50600436106100c95760003560e01c8063715018a61161008157806383c360a81161005b57806383c360a8146101a75780638da5cb5b146101ba578063f2fde38b146101cb57600080fd5b8063715018a6146101795780637cb647591461018157806382e80c8f1461019457600080fd5b80632f3f8dae116100b25780632f3f8dae1461012657806340d2123c146101515780635bc638201461016657600080fd5b806324d7806c146100ce5780632eb4a7ab1461010f575b600080fd5b6100fa6100dc366004610856565b6001600160a01b031660009081526001602052604090205460ff1690565b60405190151581526020015b60405180910390f35b61011860025481565b604051908152602001610106565b600454610139906001600160a01b031681565b6040516001600160a01b039091168152602001610106565b61016461015f366004610940565b6101de565b005b610164610174366004610985565b610268565b6101646102b9565b61016461018f3660046109c1565b6102cd565b6101646101a2366004610856565b61034c565b6101646101b53660046109da565b610400565b6000546001600160a01b0316610139565b6101646101d9366004610856565b6105fa565b6002546101ed9083908361068a565b6102645760405162461bcd60e51b815260206004820152602260248201527f4d65726b6c6550726f6f665665726966793a2050726f6f66206e6f742076616c60448201527f696400000000000000000000000000000000000000000000000000000000000060648201526084015b60405180910390fd5b5050565b6102706106a0565b6001600160a01b0391909116600090815260016020526040902080547fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff0016911515919091179055565b6102c16106a0565b6102cb60006106fa565b565b3360009081526001602081905260409091205460ff16151514806102fb57506000546001600160a01b031633145b6103475760405162461bcd60e51b815260206004820181905260248201527f4f776e61626c653a2063616c6c6572206973206e6f7420746865206f776e6572604482015260640161025b565b600255565b3360009081526001602081905260409091205460ff161515148061037a57506000546001600160a01b031633145b6103c65760405162461bcd60e51b815260206004820181905260248201527f4f776e61626c653a2063616c6c6572206973206e6f7420746865206f776e6572604482015260640161025b565b600480547fffffffffffffffffffffffff0000000000000000000000000000000000000000166001600160a01b0392909216919091179055565b833360405160609190911b7fffffffffffffffffffffffffffffffffffffffff00000000000000000000000016602082015260348101859052605481018390526074016040516020818303038152906040528051906020012061046382826101de565b61046b610762565b6004546001600160a01b031663bab5f281336040517fffffffff0000000000000000000000000000000000000000000000000000000060e084901b1681526001600160a01b0390911660048201526024810188905260448101879052606401600060405180830381600087803b1580156104e457600080fd5b505af11580156104f8573d6000803e3d6000fd5b50506004548592506001600160a01b03169050632d716e4387336040517fffffffff0000000000000000000000000000000000000000000000000000000060e085901b16815260048101929092526001600160a01b031660248201526044016020604051808303816000875af1158015610576573d6000803e3d6000fd5b505050506040513d601f19601f8201168201806040525081019061059a9190610a2e565b11156105e85760405162461bcd60e51b815260206004820152601460248201527f4d656b6144726f703a204d6178206d696e746564000000000000000000000000604482015260640161025b565b6105f26001600355565b505050505050565b6106026106a0565b6001600160a01b03811661067e5760405162461bcd60e51b815260206004820152602660248201527f4f776e61626c653a206e6577206f776e657220697320746865207a65726f206160448201527f6464726573730000000000000000000000000000000000000000000000000000606482015260840161025b565b610687816106fa565b50565b60008261069785846107bb565b14949350505050565b6000546001600160a01b031633146102cb5760405162461bcd60e51b815260206004820181905260248201527f4f776e61626c653a2063616c6c6572206973206e6f7420746865206f776e6572604482015260640161025b565b600080546001600160a01b038381167fffffffffffffffffffffffff0000000000000000000000000000000000000000831681178455604051919092169283917f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e09190a35050565b6002600354036107b45760405162461bcd60e51b815260206004820152601f60248201527f5265656e7472616e637947756172643a207265656e7472616e742063616c6c00604482015260640161025b565b6002600355565b600081815b8451811015610800576107ec828683815181106107df576107df610a47565b6020026020010151610808565b9150806107f881610a5d565b9150506107c0565b509392505050565b6000818310610824576000828152602084905260409020610833565b60008381526020839052604090205b9392505050565b80356001600160a01b038116811461085157600080fd5b919050565b60006020828403121561086857600080fd5b6108338261083a565b634e487b7160e01b600052604160045260246000fd5b600082601f83011261089857600080fd5b8135602067ffffffffffffffff808311156108b5576108b5610871565b8260051b6040517fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffe0603f830116810181811084821117156108f8576108f8610871565b60405293845285810183019383810192508785111561091657600080fd5b83870191505b848210156109355781358352918301919083019061091c565b979650505050505050565b6000806040838503121561095357600080fd5b823567ffffffffffffffff81111561096a57600080fd5b61097685828601610887565b95602094909401359450505050565b6000806040838503121561099857600080fd5b6109a18361083a565b9150602083013580151581146109b657600080fd5b809150509250929050565b6000602082840312156109d357600080fd5b5035919050565b600080600080608085870312156109f057600080fd5b843567ffffffffffffffff811115610a0757600080fd5b610a1387828801610887565b97602087013597506040870135966060013595509350505050565b600060208284031215610a4057600080fd5b5051919050565b634e487b7160e01b600052603260045260246000fd5b60007fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff8203610a9c57634e487b7160e01b600052601160045260246000fd5b506001019056fea2646970667358221220dba3a667e4c999b354010cf9994bac90d66ae00e9e17c31e3ba6f1e323d8ccb864736f6c634300081100330000000000000000000000008240534f3fbf684c0e29635ab5c8f8efb6f66d42

0x608060405234801561001057600080fd5b50600436106100c95760003560e01c8063715018a61161008157806383c360a81161005b57806383c360a8146101a75780638da5cb5b146101ba578063f2fde38b146101cb57600080fd5b8063715018a6146101795780637cb647591461018157806382e80c8f1461019457600080fd5b80632f3f8dae116100b25780632f3f8dae1461012657806340d2123c146101515780635bc638201461016657600080fd5b806324d7806c146100ce5780632eb4a7ab1461010f575b600080fd5b6100fa6100dc366004610856565b6001600160a01b031660009081526001602052604090205460ff1690565b60405190151581526020015b60405180910390f35b61011860025481565b604051908152602001610106565b600454610139906001600160a01b031681565b6040516001600160a01b039091168152602001610106565b61016461015f366004610940565b6101de565b005b610164610174366004610985565b610268565b6101646102b9565b61016461018f3660046109c1565b6102cd565b6101646101a2366004610856565b61034c565b6101646101b53660046109da565b610400565b6000546001600160a01b0316610139565b6101646101d9366004610856565b6105fa565b6002546101ed9083908361068a565b6102645760405162461bcd60e51b815260206004820152602260248201527f4d65726b6c6550726f6f665665726966793a2050726f6f66206e6f742076616c60448201527f696400000000000000000000000000000000000000000000000000000000000060648201526084015b60405180910390fd5b5050565b6102706106a0565b6001600160a01b0391909116600090815260016020526040902080547fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff0016911515919091179055565b6102c16106a0565b6102cb60006106fa565b565b3360009081526001602081905260409091205460ff16151514806102fb57506000546001600160a01b031633145b6103475760405162461bcd60e51b815260206004820181905260248201527f4f776e61626c653a2063616c6c6572206973206e6f7420746865206f776e6572604482015260640161025b565b600255565b3360009081526001602081905260409091205460ff161515148061037a57506000546001600160a01b031633145b6103c65760405162461bcd60e51b815260206004820181905260248201527f4f776e61626c653a2063616c6c6572206973206e6f7420746865206f776e6572604482015260640161025b565b600480547fffffffffffffffffffffffff0000000000000000000000000000000000000000166001600160a01b0392909216919091179055565b833360405160609190911b7fffffffffffffffffffffffffffffffffffffffff00000000000000000000000016602082015260348101859052605481018390526074016040516020818303038152906040528051906020012061046382826101de565b61046b610762565b6004546001600160a01b031663bab5f281336040517fffffffff0000000000000000000000000000000000000000000000000000000060e084901b1681526001600160a01b0390911660048201526024810188905260448101879052606401600060405180830381600087803b1580156104e457600080fd5b505af11580156104f8573d6000803e3d6000fd5b50506004548592506001600160a01b03169050632d716e4387336040517fffffffff0000000000000000000000000000000000000000000000000000000060e085901b16815260048101929092526001600160a01b031660248201526044016020604051808303816000875af1158015610576573d6000803e3d6000fd5b505050506040513d601f19601f8201168201806040525081019061059a9190610a2e565b11156105e85760405162461bcd60e51b815260206004820152601460248201527f4d656b6144726f703a204d6178206d696e746564000000000000000000000000604482015260640161025b565b6105f26001600355565b505050505050565b6106026106a0565b6001600160a01b03811661067e5760405162461bcd60e51b815260206004820152602660248201527f4f776e61626c653a206e6577206f776e657220697320746865207a65726f206160448201527f6464726573730000000000000000000000000000000000000000000000000000606482015260840161025b565b610687816106fa565b50565b60008261069785846107bb565b14949350505050565b6000546001600160a01b031633146102cb5760405162461bcd60e51b815260206004820181905260248201527f4f776e61626c653a2063616c6c6572206973206e6f7420746865206f776e6572604482015260640161025b565b600080546001600160a01b038381167fffffffffffffffffffffffff0000000000000000000000000000000000000000831681178455604051919092169283917f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e09190a35050565b6002600354036107b45760405162461bcd60e51b815260206004820152601f60248201527f5265656e7472616e637947756172643a207265656e7472616e742063616c6c00604482015260640161025b565b6002600355565b600081815b8451811015610800576107ec828683815181106107df576107df610a47565b6020026020010151610808565b9150806107f881610a5d565b9150506107c0565b509392505050565b6000818310610824576000828152602084905260409020610833565b60008381526020839052604090205b9392505050565b80356001600160a01b038116811461085157600080fd5b919050565b60006020828403121561086857600080fd5b6108338261083a565b634e487b7160e01b600052604160045260246000fd5b600082601f83011261089857600080fd5b8135602067ffffffffffffffff808311156108b5576108b5610871565b8260051b6040517fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffe0603f830116810181811084821117156108f8576108f8610871565b60405293845285810183019383810192508785111561091657600080fd5b83870191505b848210156109355781358352918301919083019061091c565b979650505050505050565b6000806040838503121561095357600080fd5b823567ffffffffffffffff81111561096a57600080fd5b61097685828601610887565b95602094909401359450505050565b6000806040838503121561099857600080fd5b6109a18361083a565b9150602083013580151581146109b657600080fd5b809150509250929050565b6000602082840312156109d357600080fd5b5035919050565b600080600080608085870312156109f057600080fd5b843567ffffffffffffffff811115610a0757600080fd5b610a1387828801610887565b97602087013597506040870135966060013595509350505050565b600060208284031215610a4057600080fd5b5051919050565b634e487b7160e01b600052603260045260246000fd5b60007fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff8203610a9c57634e487b7160e01b600052601160045260246000fd5b506001019056fea2646970667358221220dba3a667e4c999b354010cf9994bac90d66ae00e9e17c31e3ba6f1e323d8ccb864736f6c63430008110033

0000000000000000000000008240534f3fbf684c0e29635ab5c8f8efb6f66d42

-----Decoded View---------------
Arg [0] : _mekaVerseAirdrop (address): 0x8240534F3fbf684C0e29635aB5c8f8EFb6f66d42

-----Encoded View---------------
1 Constructor Arguments found :
Arg [0] : 0000000000000000000000008240534f3fbf684c0e29635ab5c8f8efb6f66d42