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/token/ERC20/IERC20.sol";
import "@openzeppelin/contracts/utils/Strings.sol";
import "@openzeppelin/contracts/access/Ownable.sol";

contract Airdrop is Ownable {
    constructor() Ownable(msg.sender) {}

    function withdraw(address _token) public onlyOwner {
        require(
            IERC20(_token).transfer(
                msg.sender,
                IERC20(_token).balanceOf(address(this))
            ),
            "Transfer failed"
        );
    }

    function airdrop(
        address _token,
        address[] calldata _addresses,
        uint256[] calldata _amounts
    ) public onlyOwner {
        require(
            _addresses.length == _amounts.length,
            "Invalid number of addresses or amounts"
        );
        for (uint256 i = 0; i < _addresses.length; i++) {
            require(
                IERC20(_token).transfer(_addresses[i], _amounts[i]),
                string(
                    abi.encodePacked(
                        "Transfer failed for record ",
                        Strings.toString(i)
                    )
                )
            );
        }
    }
}

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

pragma solidity ^0.8.20;

import {Context} from "../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.
 *
 * The initial owner is set to the address provided by the deployer. 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;

    /**
     * @dev The caller account is not authorized to perform an operation.
     */
    error OwnableUnauthorizedAccount(address account);

    /**
     * @dev The owner is not a valid owner account. (eg. `address(0)`)
     */
    error OwnableInvalidOwner(address owner);

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

    /**
     * @dev Initializes the contract setting the address provided by the deployer as the initial owner.
     */
    constructor(address initialOwner) {
        if (initialOwner == address(0)) {
            revert OwnableInvalidOwner(address(0));
        }
        _transferOwnership(initialOwner);
    }

    /**
     * @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 {
        if (owner() != _msgSender()) {
            revert OwnableUnauthorizedAccount(_msgSender());
        }
    }

    /**
     * @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 {
        if (newOwner == address(0)) {
            revert OwnableInvalidOwner(address(0));
        }
        _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 v5.0.0) (token/ERC20/IERC20.sol)

pragma solidity ^0.8.20;

/**
 * @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 value of tokens in existence.
     */
    function totalSupply() external view returns (uint256);

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

    /**
     * @dev Moves a `value` amount of 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 value) 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 a `value` amount of tokens 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 value) external returns (bool);

    /**
     * @dev Moves a `value` amount of tokens from `from` to `to` using the
     * allowance mechanism. `value` 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 value) external returns (bool);
}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.0.1) (utils/Context.sol)

pragma solidity ^0.8.20;

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

    function _contextSuffixLength() internal view virtual returns (uint256) {
        return 0;
    }
}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.0.0) (utils/math/Math.sol)

pragma solidity ^0.8.20;

/**
 * @dev Standard math utilities missing in the Solidity language.
 */
library Math {
    /**
     * @dev Muldiv operation overflow.
     */
    error MathOverflowedMulDiv();

    enum Rounding {
        Floor, // Toward negative infinity
        Ceil, // Toward positive infinity
        Trunc, // Toward zero
        Expand // Away from zero
    }

    /**
     * @dev Returns the addition of two unsigned integers, with an overflow flag.
     */
    function tryAdd(uint256 a, uint256 b) internal pure returns (bool, uint256) {
        unchecked {
            uint256 c = a + b;
            if (c < a) return (false, 0);
            return (true, c);
        }
    }

    /**
     * @dev Returns the subtraction of two unsigned integers, with an overflow flag.
     */
    function trySub(uint256 a, uint256 b) internal pure returns (bool, uint256) {
        unchecked {
            if (b > a) return (false, 0);
            return (true, a - b);
        }
    }

    /**
     * @dev Returns the multiplication of two unsigned integers, with an overflow flag.
     */
    function tryMul(uint256 a, uint256 b) internal pure returns (bool, uint256) {
        unchecked {
            // Gas optimization: this is cheaper than requiring 'a' not being zero, but the
            // benefit is lost if 'b' is also tested.
            // See: https://github.com/OpenZeppelin/openzeppelin-contracts/pull/522
            if (a == 0) return (true, 0);
            uint256 c = a * b;
            if (c / a != b) return (false, 0);
            return (true, c);
        }
    }

    /**
     * @dev Returns the division of two unsigned integers, with a division by zero flag.
     */
    function tryDiv(uint256 a, uint256 b) internal pure returns (bool, uint256) {
        unchecked {
            if (b == 0) return (false, 0);
            return (true, a / b);
        }
    }

    /**
     * @dev Returns the remainder of dividing two unsigned integers, with a division by zero flag.
     */
    function tryMod(uint256 a, uint256 b) internal pure returns (bool, uint256) {
        unchecked {
            if (b == 0) return (false, 0);
            return (true, a % b);
        }
    }

    /**
     * @dev Returns the largest of two numbers.
     */
    function max(uint256 a, uint256 b) internal pure returns (uint256) {
        return a > b ? a : b;
    }

    /**
     * @dev Returns the smallest of two numbers.
     */
    function min(uint256 a, uint256 b) internal pure returns (uint256) {
        return a < b ? a : b;
    }

    /**
     * @dev Returns the average of two numbers. The result is rounded towards
     * zero.
     */
    function average(uint256 a, uint256 b) internal pure returns (uint256) {
        // (a + b) / 2 can overflow.
        return (a & b) + (a ^ b) / 2;
    }

    /**
     * @dev Returns the ceiling of the division of two numbers.
     *
     * This differs from standard division with `/` in that it rounds towards infinity instead
     * of rounding towards zero.
     */
    function ceilDiv(uint256 a, uint256 b) internal pure returns (uint256) {
        if (b == 0) {
            // Guarantee the same behavior as in a regular Solidity division.
            return a / b;
        }

        // (a + b - 1) / b can overflow on addition, so we distribute.
        return a == 0 ? 0 : (a - 1) / b + 1;
    }

    /**
     * @notice Calculates floor(x * y / denominator) with full precision. Throws if result overflows a uint256 or
     * denominator == 0.
     * @dev Original credit to Remco Bloemen under MIT license (https://xn--2-umb.com/21/muldiv) with further edits by
     * Uniswap Labs also under MIT license.
     */
    function mulDiv(uint256 x, uint256 y, uint256 denominator) internal pure returns (uint256 result) {
        unchecked {
            // 512-bit multiply [prod1 prod0] = x * y. Compute the product mod 2^256 and mod 2^256 - 1, then use
            // use the Chinese Remainder Theorem to reconstruct the 512 bit result. The result is stored in two 256
            // variables such that product = prod1 * 2^256 + prod0.
            uint256 prod0 = x * y; // Least significant 256 bits of the product
            uint256 prod1; // Most significant 256 bits of the product
            assembly {
                let mm := mulmod(x, y, not(0))
                prod1 := sub(sub(mm, prod0), lt(mm, prod0))
            }

            // Handle non-overflow cases, 256 by 256 division.
            if (prod1 == 0) {
                // Solidity will revert if denominator == 0, unlike the div opcode on its own.
                // The surrounding unchecked block does not change this fact.
                // See https://docs.soliditylang.org/en/latest/control-structures.html#checked-or-unchecked-arithmetic.
                return prod0 / denominator;
            }

            // Make sure the result is less than 2^256. Also prevents denominator == 0.
            if (denominator <= prod1) {
                revert MathOverflowedMulDiv();
            }

            ///////////////////////////////////////////////
            // 512 by 256 division.
            ///////////////////////////////////////////////

            // Make division exact by subtracting the remainder from [prod1 prod0].
            uint256 remainder;
            assembly {
                // Compute remainder using mulmod.
                remainder := mulmod(x, y, denominator)

                // Subtract 256 bit number from 512 bit number.
                prod1 := sub(prod1, gt(remainder, prod0))
                prod0 := sub(prod0, remainder)
            }

            // Factor powers of two out of denominator and compute largest power of two divisor of denominator.
            // Always >= 1. See https://cs.stackexchange.com/q/138556/92363.

            uint256 twos = denominator & (0 - denominator);
            assembly {
                // Divide denominator by twos.
                denominator := div(denominator, twos)

                // Divide [prod1 prod0] by twos.
                prod0 := div(prod0, twos)

                // Flip twos such that it is 2^256 / twos. If twos is zero, then it becomes one.
                twos := add(div(sub(0, twos), twos), 1)
            }

            // Shift in bits from prod1 into prod0.
            prod0 |= prod1 * twos;

            // Invert denominator mod 2^256. Now that denominator is an odd number, it has an inverse modulo 2^256 such
            // that denominator * inv = 1 mod 2^256. Compute the inverse by starting with a seed that is correct for
            // four bits. That is, denominator * inv = 1 mod 2^4.
            uint256 inverse = (3 * denominator) ^ 2;

            // Use the Newton-Raphson iteration to improve the precision. Thanks to Hensel's lifting lemma, this also
            // works in modular arithmetic, doubling the correct bits in each step.
            inverse *= 2 - denominator * inverse; // inverse mod 2^8
            inverse *= 2 - denominator * inverse; // inverse mod 2^16
            inverse *= 2 - denominator * inverse; // inverse mod 2^32
            inverse *= 2 - denominator * inverse; // inverse mod 2^64
            inverse *= 2 - denominator * inverse; // inverse mod 2^128
            inverse *= 2 - denominator * inverse; // inverse mod 2^256

            // Because the division is now exact we can divide by multiplying with the modular inverse of denominator.
            // This will give us the correct result modulo 2^256. Since the preconditions guarantee that the outcome is
            // less than 2^256, this is the final result. We don't need to compute the high bits of the result and prod1
            // is no longer required.
            result = prod0 * inverse;
            return result;
        }
    }

    /**
     * @notice Calculates x * y / denominator with full precision, following the selected rounding direction.
     */
    function mulDiv(uint256 x, uint256 y, uint256 denominator, Rounding rounding) internal pure returns (uint256) {
        uint256 result = mulDiv(x, y, denominator);
        if (unsignedRoundsUp(rounding) && mulmod(x, y, denominator) > 0) {
            result += 1;
        }
        return result;
    }

    /**
     * @dev Returns the square root of a number. If the number is not a perfect square, the value is rounded
     * towards zero.
     *
     * Inspired by Henry S. Warren, Jr.'s "Hacker's Delight" (Chapter 11).
     */
    function sqrt(uint256 a) internal pure returns (uint256) {
        if (a == 0) {
            return 0;
        }

        // For our first guess, we get the biggest power of 2 which is smaller than the square root of the target.
        //
        // We know that the "msb" (most significant bit) of our target number `a` is a power of 2 such that we have
        // `msb(a) <= a < 2*msb(a)`. This value can be written `msb(a)=2**k` with `k=log2(a)`.
        //
        // This can be rewritten `2**log2(a) <= a < 2**(log2(a) + 1)`
        // → `sqrt(2**k) <= sqrt(a) < sqrt(2**(k+1))`
        // → `2**(k/2) <= sqrt(a) < 2**((k+1)/2) <= 2**(k/2 + 1)`
        //
        // Consequently, `2**(log2(a) / 2)` is a good first approximation of `sqrt(a)` with at least 1 correct bit.
        uint256 result = 1 << (log2(a) >> 1);

        // At this point `result` is an estimation with one bit of precision. We know the true value is a uint128,
        // since it is the square root of a uint256. Newton's method converges quadratically (precision doubles at
        // every iteration). We thus need at most 7 iteration to turn our partial result with one bit of precision
        // into the expected uint128 result.
        unchecked {
            result = (result + a / result) >> 1;
            result = (result + a / result) >> 1;
            result = (result + a / result) >> 1;
            result = (result + a / result) >> 1;
            result = (result + a / result) >> 1;
            result = (result + a / result) >> 1;
            result = (result + a / result) >> 1;
            return min(result, a / result);
        }
    }

    /**
     * @notice Calculates sqrt(a), following the selected rounding direction.
     */
    function sqrt(uint256 a, Rounding rounding) internal pure returns (uint256) {
        unchecked {
            uint256 result = sqrt(a);
            return result + (unsignedRoundsUp(rounding) && result * result < a ? 1 : 0);
        }
    }

    /**
     * @dev Return the log in base 2 of a positive value rounded towards zero.
     * Returns 0 if given 0.
     */
    function log2(uint256 value) internal pure returns (uint256) {
        uint256 result = 0;
        unchecked {
            if (value >> 128 > 0) {
                value >>= 128;
                result += 128;
            }
            if (value >> 64 > 0) {
                value >>= 64;
                result += 64;
            }
            if (value >> 32 > 0) {
                value >>= 32;
                result += 32;
            }
            if (value >> 16 > 0) {
                value >>= 16;
                result += 16;
            }
            if (value >> 8 > 0) {
                value >>= 8;
                result += 8;
            }
            if (value >> 4 > 0) {
                value >>= 4;
                result += 4;
            }
            if (value >> 2 > 0) {
                value >>= 2;
                result += 2;
            }
            if (value >> 1 > 0) {
                result += 1;
            }
        }
        return result;
    }

    /**
     * @dev Return the log in base 2, following the selected rounding direction, of a positive value.
     * Returns 0 if given 0.
     */
    function log2(uint256 value, Rounding rounding) internal pure returns (uint256) {
        unchecked {
            uint256 result = log2(value);
            return result + (unsignedRoundsUp(rounding) && 1 << result < value ? 1 : 0);
        }
    }

    /**
     * @dev Return the log in base 10 of a positive value rounded towards zero.
     * Returns 0 if given 0.
     */
    function log10(uint256 value) internal pure returns (uint256) {
        uint256 result = 0;
        unchecked {
            if (value >= 10 ** 64) {
                value /= 10 ** 64;
                result += 64;
            }
            if (value >= 10 ** 32) {
                value /= 10 ** 32;
                result += 32;
            }
            if (value >= 10 ** 16) {
                value /= 10 ** 16;
                result += 16;
            }
            if (value >= 10 ** 8) {
                value /= 10 ** 8;
                result += 8;
            }
            if (value >= 10 ** 4) {
                value /= 10 ** 4;
                result += 4;
            }
            if (value >= 10 ** 2) {
                value /= 10 ** 2;
                result += 2;
            }
            if (value >= 10 ** 1) {
                result += 1;
            }
        }
        return result;
    }

    /**
     * @dev Return the log in base 10, following the selected rounding direction, of a positive value.
     * Returns 0 if given 0.
     */
    function log10(uint256 value, Rounding rounding) internal pure returns (uint256) {
        unchecked {
            uint256 result = log10(value);
            return result + (unsignedRoundsUp(rounding) && 10 ** result < value ? 1 : 0);
        }
    }

    /**
     * @dev Return the log in base 256 of a positive value rounded towards zero.
     * Returns 0 if given 0.
     *
     * Adding one to the result gives the number of pairs of hex symbols needed to represent `value` as a hex string.
     */
    function log256(uint256 value) internal pure returns (uint256) {
        uint256 result = 0;
        unchecked {
            if (value >> 128 > 0) {
                value >>= 128;
                result += 16;
            }
            if (value >> 64 > 0) {
                value >>= 64;
                result += 8;
            }
            if (value >> 32 > 0) {
                value >>= 32;
                result += 4;
            }
            if (value >> 16 > 0) {
                value >>= 16;
                result += 2;
            }
            if (value >> 8 > 0) {
                result += 1;
            }
        }
        return result;
    }

    /**
     * @dev Return the log in base 256, following the selected rounding direction, of a positive value.
     * Returns 0 if given 0.
     */
    function log256(uint256 value, Rounding rounding) internal pure returns (uint256) {
        unchecked {
            uint256 result = log256(value);
            return result + (unsignedRoundsUp(rounding) && 1 << (result << 3) < value ? 1 : 0);
        }
    }

    /**
     * @dev Returns whether a provided rounding mode is considered rounding up for unsigned integers.
     */
    function unsignedRoundsUp(Rounding rounding) internal pure returns (bool) {
        return uint8(rounding) % 2 == 1;
    }
}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.0.0) (utils/math/SignedMath.sol)

pragma solidity ^0.8.20;

/**
 * @dev Standard signed math utilities missing in the Solidity language.
 */
library SignedMath {
    /**
     * @dev Returns the largest of two signed numbers.
     */
    function max(int256 a, int256 b) internal pure returns (int256) {
        return a > b ? a : b;
    }

    /**
     * @dev Returns the smallest of two signed numbers.
     */
    function min(int256 a, int256 b) internal pure returns (int256) {
        return a < b ? a : b;
    }

    /**
     * @dev Returns the average of two signed numbers without overflow.
     * The result is rounded towards zero.
     */
    function average(int256 a, int256 b) internal pure returns (int256) {
        // Formula from the book "Hacker's Delight"
        int256 x = (a & b) + ((a ^ b) >> 1);
        return x + (int256(uint256(x) >> 255) & (a ^ b));
    }

    /**
     * @dev Returns the absolute unsigned value of a signed value.
     */
    function abs(int256 n) internal pure returns (uint256) {
        unchecked {
            // must be unchecked in order to support `n = type(int256).min`
            return uint256(n >= 0 ? n : -n);
        }
    }
}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.0.0) (utils/Strings.sol)

pragma solidity ^0.8.20;

import {Math} from "./math/Math.sol";
import {SignedMath} from "./math/SignedMath.sol";

/**
 * @dev String operations.
 */
library Strings {
    bytes16 private constant HEX_DIGITS = "0123456789abcdef";
    uint8 private constant ADDRESS_LENGTH = 20;

    /**
     * @dev The `value` string doesn't fit in the specified `length`.
     */
    error StringsInsufficientHexLength(uint256 value, uint256 length);

    /**
     * @dev Converts a `uint256` to its ASCII `string` decimal representation.
     */
    function toString(uint256 value) internal pure returns (string memory) {
        unchecked {
            uint256 length = Math.log10(value) + 1;
            string memory buffer = new string(length);
            uint256 ptr;
            /// @solidity memory-safe-assembly
            assembly {
                ptr := add(buffer, add(32, length))
            }
            while (true) {
                ptr--;
                /// @solidity memory-safe-assembly
                assembly {
                    mstore8(ptr, byte(mod(value, 10), HEX_DIGITS))
                }
                value /= 10;
                if (value == 0) break;
            }
            return buffer;
        }
    }

    /**
     * @dev Converts a `int256` to its ASCII `string` decimal representation.
     */
    function toStringSigned(int256 value) internal pure returns (string memory) {
        return string.concat(value < 0 ? "-" : "", toString(SignedMath.abs(value)));
    }

    /**
     * @dev Converts a `uint256` to its ASCII `string` hexadecimal representation.
     */
    function toHexString(uint256 value) internal pure returns (string memory) {
        unchecked {
            return toHexString(value, Math.log256(value) + 1);
        }
    }

    /**
     * @dev Converts a `uint256` to its ASCII `string` hexadecimal representation with fixed length.
     */
    function toHexString(uint256 value, uint256 length) internal pure returns (string memory) {
        uint256 localValue = value;
        bytes memory buffer = new bytes(2 * length + 2);
        buffer[0] = "0";
        buffer[1] = "x";
        for (uint256 i = 2 * length + 1; i > 1; --i) {
            buffer[i] = HEX_DIGITS[localValue & 0xf];
            localValue >>= 4;
        }
        if (localValue != 0) {
            revert StringsInsufficientHexLength(value, length);
        }
        return string(buffer);
    }

    /**
     * @dev Converts an `address` with fixed length of 20 bytes to its not checksummed ASCII `string` hexadecimal
     * representation.
     */
    function toHexString(address addr) internal pure returns (string memory) {
        return toHexString(uint256(uint160(addr)), ADDRESS_LENGTH);
    }

    /**
     * @dev Returns true if the two strings are equal.
     */
    function equal(string memory a, string memory b) internal pure returns (bool) {
        return bytes(a).length == bytes(b).length && keccak256(bytes(a)) == keccak256(bytes(b));
    }
}

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

• No Contract Security Audit Submitted- Submit Audit Here

[{"inputs":[],"stateMutability":"nonpayable","type":"constructor"},{"inputs":[{"internalType":"address","name":"owner","type":"address"}],"name":"OwnableInvalidOwner","type":"error"},{"inputs":[{"internalType":"address","name":"account","type":"address"}],"name":"OwnableUnauthorizedAccount","type":"error"},{"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":"address","name":"_token","type":"address"},{"internalType":"address[]","name":"_addresses","type":"address[]"},{"internalType":"uint256[]","name":"_amounts","type":"uint256[]"}],"name":"airdrop","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":"address","name":"newOwner","type":"address"}],"name":"transferOwnership","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"_token","type":"address"}],"name":"withdraw","outputs":[],"stateMutability":"nonpayable","type":"function"}]

608060405234801561001057600080fd5b5033600073ffffffffffffffffffffffffffffffffffffffff168173ffffffffffffffffffffffffffffffffffffffff16036100845760006040517f1e4fbdf700000000000000000000000000000000000000000000000000000000815260040161007b919061019e565b60405180910390fd5b6100938161009960201b60201c565b506101b9565b60008060009054906101000a900473ffffffffffffffffffffffffffffffffffffffff169050816000806101000a81548173ffffffffffffffffffffffffffffffffffffffff021916908373ffffffffffffffffffffffffffffffffffffffff1602179055508173ffffffffffffffffffffffffffffffffffffffff168173ffffffffffffffffffffffffffffffffffffffff167f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e060405160405180910390a35050565b600073ffffffffffffffffffffffffffffffffffffffff82169050919050565b60006101888261015d565b9050919050565b6101988161017d565b82525050565b60006020820190506101b3600083018461018f565b92915050565b610e17806101c86000396000f3fe608060405234801561001057600080fd5b50600436106100575760003560e01c8063025ff12f1461005c57806351cff8d914610078578063715018a6146100945780638da5cb5b1461009e578063f2fde38b146100bc575b600080fd5b6100766004803603810190610071919061090e565b6100d8565b005b610092600480360381019061008d91906109a3565b610273565b005b61009c6103b4565b005b6100a66103c8565b6040516100b391906109df565b60405180910390f35b6100d660048036038101906100d191906109a3565b6103f1565b005b6100e0610477565b818190508484905014610128576040517f08c379a000000000000000000000000000000000000000000000000000000000815260040161011f90610a7d565b60405180910390fd5b60005b8484905081101561026b578573ffffffffffffffffffffffffffffffffffffffff1663a9059cbb86868481811061016557610164610a9d565b5b905060200201602081019061017a91906109a3565b85858581811061018d5761018c610a9d565b5b905060200201356040518363ffffffff1660e01b81526004016101b1929190610ae5565b6020604051808303816000875af11580156101d0573d6000803e3d6000fd5b505050506040513d601f19601f820116820180604052508101906101f49190610b46565b6101fd826104fe565b60405160200161020d9190610c30565b6040516020818303038152906040529061025d576040517f08c379a00000000000000000000000000000000000000000000000000000000081526004016102549190610c9c565b60405180910390fd5b50808060010191505061012b565b505050505050565b61027b610477565b8073ffffffffffffffffffffffffffffffffffffffff1663a9059cbb338373ffffffffffffffffffffffffffffffffffffffff166370a08231306040518263ffffffff1660e01b81526004016102d191906109df565b602060405180830381865afa1580156102ee573d6000803e3d6000fd5b505050506040513d601f19601f820116820180604052508101906103129190610cea565b6040518363ffffffff1660e01b815260040161032f929190610ae5565b6020604051808303816000875af115801561034e573d6000803e3d6000fd5b505050506040513d601f19601f820116820180604052508101906103729190610b46565b6103b1576040517f08c379a00000000000000000000000000000000000000000000000000000000081526004016103a890610d63565b60405180910390fd5b50565b6103bc610477565b6103c660006105cc565b565b60008060009054906101000a900473ffffffffffffffffffffffffffffffffffffffff16905090565b6103f9610477565b600073ffffffffffffffffffffffffffffffffffffffff168173ffffffffffffffffffffffffffffffffffffffff160361046b5760006040517f1e4fbdf700000000000000000000000000000000000000000000000000000000815260040161046291906109df565b60405180910390fd5b610474816105cc565b50565b61047f610690565b73ffffffffffffffffffffffffffffffffffffffff1661049d6103c8565b73ffffffffffffffffffffffffffffffffffffffff16146104fc576104c0610690565b6040517f118cdaa70000000000000000000000000000000000000000000000000000000081526004016104f391906109df565b60405180910390fd5b565b60606000600161050d84610698565b01905060008167ffffffffffffffff81111561052c5761052b610d83565b5b6040519080825280601f01601f19166020018201604052801561055e5781602001600182028036833780820191505090505b509050600082602001820190505b6001156105c1578080600190039150507f3031323334353637383961626364656600000000000000000000000000000000600a86061a8153600a85816105b5576105b4610db2565b5b0494506000850361056c575b819350505050919050565b60008060009054906101000a900473ffffffffffffffffffffffffffffffffffffffff169050816000806101000a81548173ffffffffffffffffffffffffffffffffffffffff021916908373ffffffffffffffffffffffffffffffffffffffff1602179055508173ffffffffffffffffffffffffffffffffffffffff168173ffffffffffffffffffffffffffffffffffffffff167f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e060405160405180910390a35050565b600033905090565b600080600090507a184f03e93ff9f4daa797ed6e38ed64bf6a1f01000000000000000083106106f6577a184f03e93ff9f4daa797ed6e38ed64bf6a1f01000000000000000083816106ec576106eb610db2565b5b0492506040810190505b6d04ee2d6d415b85acef81000000008310610733576d04ee2d6d415b85acef8100000000838161072957610728610db2565b5b0492506020810190505b662386f26fc10000831061076257662386f26fc10000838161075857610757610db2565b5b0492506010810190505b6305f5e100831061078b576305f5e100838161078157610780610db2565b5b0492506008810190505b61271083106107b05761271083816107a6576107a5610db2565b5b0492506004810190505b606483106107d357606483816107c9576107c8610db2565b5b0492506002810190505b600a83106107e2576001810190505b80915050919050565b600080fd5b600080fd5b600073ffffffffffffffffffffffffffffffffffffffff82169050919050565b6000610820826107f5565b9050919050565b61083081610815565b811461083b57600080fd5b50565b60008135905061084d81610827565b92915050565b600080fd5b600080fd5b600080fd5b60008083601f84011261087857610877610853565b5b8235905067ffffffffffffffff81111561089557610894610858565b5b6020830191508360208202830111156108b1576108b061085d565b5b9250929050565b60008083601f8401126108ce576108cd610853565b5b8235905067ffffffffffffffff8111156108eb576108ea610858565b5b6020830191508360208202830111156109075761090661085d565b5b9250929050565b60008060008060006060868803121561092a576109296107eb565b5b60006109388882890161083e565b955050602086013567ffffffffffffffff811115610959576109586107f0565b5b61096588828901610862565b9450945050604086013567ffffffffffffffff811115610988576109876107f0565b5b610994888289016108b8565b92509250509295509295909350565b6000602082840312156109b9576109b86107eb565b5b60006109c78482850161083e565b91505092915050565b6109d981610815565b82525050565b60006020820190506109f460008301846109d0565b92915050565b600082825260208201905092915050565b7f496e76616c6964206e756d626572206f6620616464726573736573206f72206160008201527f6d6f756e74730000000000000000000000000000000000000000000000000000602082015250565b6000610a676026836109fa565b9150610a7282610a0b565b604082019050919050565b60006020820190508181036000830152610a9681610a5a565b9050919050565b7f4e487b7100000000000000000000000000000000000000000000000000000000600052603260045260246000fd5b6000819050919050565b610adf81610acc565b82525050565b6000604082019050610afa60008301856109d0565b610b076020830184610ad6565b9392505050565b60008115159050919050565b610b2381610b0e565b8114610b2e57600080fd5b50565b600081519050610b4081610b1a565b92915050565b600060208284031215610b5c57610b5b6107eb565b5b6000610b6a84828501610b31565b91505092915050565b600081905092915050565b7f5472616e73666572206661696c656420666f72207265636f7264200000000000600082015250565b6000610bb4601b83610b73565b9150610bbf82610b7e565b601b82019050919050565b600081519050919050565b60005b83811015610bf3578082015181840152602081019050610bd8565b60008484015250505050565b6000610c0a82610bca565b610c148185610b73565b9350610c24818560208601610bd5565b80840191505092915050565b6000610c3b82610ba7565b9150610c478284610bff565b915081905092915050565b6000601f19601f8301169050919050565b6000610c6e82610bca565b610c7881856109fa565b9350610c88818560208601610bd5565b610c9181610c52565b840191505092915050565b60006020820190508181036000830152610cb68184610c63565b905092915050565b610cc781610acc565b8114610cd257600080fd5b50565b600081519050610ce481610cbe565b92915050565b600060208284031215610d0057610cff6107eb565b5b6000610d0e84828501610cd5565b91505092915050565b7f5472616e73666572206661696c65640000000000000000000000000000000000600082015250565b6000610d4d600f836109fa565b9150610d5882610d17565b602082019050919050565b60006020820190508181036000830152610d7c81610d40565b9050919050565b7f4e487b7100000000000000000000000000000000000000000000000000000000600052604160045260246000fd5b7f4e487b7100000000000000000000000000000000000000000000000000000000600052601260045260246000fdfea26469706673582212201393569125c259704fcc0c66d20099a07ff33d82d8c9ace03fa427e758e217bd64736f6c63430008180033

0x608060405234801561001057600080fd5b50600436106100575760003560e01c8063025ff12f1461005c57806351cff8d914610078578063715018a6146100945780638da5cb5b1461009e578063f2fde38b146100bc575b600080fd5b6100766004803603810190610071919061090e565b6100d8565b005b610092600480360381019061008d91906109a3565b610273565b005b61009c6103b4565b005b6100a66103c8565b6040516100b391906109df565b60405180910390f35b6100d660048036038101906100d191906109a3565b6103f1565b005b6100e0610477565b818190508484905014610128576040517f08c379a000000000000000000000000000000000000000000000000000000000815260040161011f90610a7d565b60405180910390fd5b60005b8484905081101561026b578573ffffffffffffffffffffffffffffffffffffffff1663a9059cbb86868481811061016557610164610a9d565b5b905060200201602081019061017a91906109a3565b85858581811061018d5761018c610a9d565b5b905060200201356040518363ffffffff1660e01b81526004016101b1929190610ae5565b6020604051808303816000875af11580156101d0573d6000803e3d6000fd5b505050506040513d601f19601f820116820180604052508101906101f49190610b46565b6101fd826104fe565b60405160200161020d9190610c30565b6040516020818303038152906040529061025d576040517f08c379a00000000000000000000000000000000000000000000000000000000081526004016102549190610c9c565b60405180910390fd5b50808060010191505061012b565b505050505050565b61027b610477565b8073ffffffffffffffffffffffffffffffffffffffff1663a9059cbb338373ffffffffffffffffffffffffffffffffffffffff166370a08231306040518263ffffffff1660e01b81526004016102d191906109df565b602060405180830381865afa1580156102ee573d6000803e3d6000fd5b505050506040513d601f19601f820116820180604052508101906103129190610cea565b6040518363ffffffff1660e01b815260040161032f929190610ae5565b6020604051808303816000875af115801561034e573d6000803e3d6000fd5b505050506040513d601f19601f820116820180604052508101906103729190610b46565b6103b1576040517f08c379a00000000000000000000000000000000000000000000000000000000081526004016103a890610d63565b60405180910390fd5b50565b6103bc610477565b6103c660006105cc565b565b60008060009054906101000a900473ffffffffffffffffffffffffffffffffffffffff16905090565b6103f9610477565b600073ffffffffffffffffffffffffffffffffffffffff168173ffffffffffffffffffffffffffffffffffffffff160361046b5760006040517f1e4fbdf700000000000000000000000000000000000000000000000000000000815260040161046291906109df565b60405180910390fd5b610474816105cc565b50565b61047f610690565b73ffffffffffffffffffffffffffffffffffffffff1661049d6103c8565b73ffffffffffffffffffffffffffffffffffffffff16146104fc576104c0610690565b6040517f118cdaa70000000000000000000000000000000000000000000000000000000081526004016104f391906109df565b60405180910390fd5b565b60606000600161050d84610698565b01905060008167ffffffffffffffff81111561052c5761052b610d83565b5b6040519080825280601f01601f19166020018201604052801561055e5781602001600182028036833780820191505090505b509050600082602001820190505b6001156105c1578080600190039150507f3031323334353637383961626364656600000000000000000000000000000000600a86061a8153600a85816105b5576105b4610db2565b5b0494506000850361056c575b819350505050919050565b60008060009054906101000a900473ffffffffffffffffffffffffffffffffffffffff169050816000806101000a81548173ffffffffffffffffffffffffffffffffffffffff021916908373ffffffffffffffffffffffffffffffffffffffff1602179055508173ffffffffffffffffffffffffffffffffffffffff168173ffffffffffffffffffffffffffffffffffffffff167f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e060405160405180910390a35050565b600033905090565b600080600090507a184f03e93ff9f4daa797ed6e38ed64bf6a1f01000000000000000083106106f6577a184f03e93ff9f4daa797ed6e38ed64bf6a1f01000000000000000083816106ec576106eb610db2565b5b0492506040810190505b6d04ee2d6d415b85acef81000000008310610733576d04ee2d6d415b85acef8100000000838161072957610728610db2565b5b0492506020810190505b662386f26fc10000831061076257662386f26fc10000838161075857610757610db2565b5b0492506010810190505b6305f5e100831061078b576305f5e100838161078157610780610db2565b5b0492506008810190505b61271083106107b05761271083816107a6576107a5610db2565b5b0492506004810190505b606483106107d357606483816107c9576107c8610db2565b5b0492506002810190505b600a83106107e2576001810190505b80915050919050565b600080fd5b600080fd5b600073ffffffffffffffffffffffffffffffffffffffff82169050919050565b6000610820826107f5565b9050919050565b61083081610815565b811461083b57600080fd5b50565b60008135905061084d81610827565b92915050565b600080fd5b600080fd5b600080fd5b60008083601f84011261087857610877610853565b5b8235905067ffffffffffffffff81111561089557610894610858565b5b6020830191508360208202830111156108b1576108b061085d565b5b9250929050565b60008083601f8401126108ce576108cd610853565b5b8235905067ffffffffffffffff8111156108eb576108ea610858565b5b6020830191508360208202830111156109075761090661085d565b5b9250929050565b60008060008060006060868803121561092a576109296107eb565b5b60006109388882890161083e565b955050602086013567ffffffffffffffff811115610959576109586107f0565b5b61096588828901610862565b9450945050604086013567ffffffffffffffff811115610988576109876107f0565b5b610994888289016108b8565b92509250509295509295909350565b6000602082840312156109b9576109b86107eb565b5b60006109c78482850161083e565b91505092915050565b6109d981610815565b82525050565b60006020820190506109f460008301846109d0565b92915050565b600082825260208201905092915050565b7f496e76616c6964206e756d626572206f6620616464726573736573206f72206160008201527f6d6f756e74730000000000000000000000000000000000000000000000000000602082015250565b6000610a676026836109fa565b9150610a7282610a0b565b604082019050919050565b60006020820190508181036000830152610a9681610a5a565b9050919050565b7f4e487b7100000000000000000000000000000000000000000000000000000000600052603260045260246000fd5b6000819050919050565b610adf81610acc565b82525050565b6000604082019050610afa60008301856109d0565b610b076020830184610ad6565b9392505050565b60008115159050919050565b610b2381610b0e565b8114610b2e57600080fd5b50565b600081519050610b4081610b1a565b92915050565b600060208284031215610b5c57610b5b6107eb565b5b6000610b6a84828501610b31565b91505092915050565b600081905092915050565b7f5472616e73666572206661696c656420666f72207265636f7264200000000000600082015250565b6000610bb4601b83610b73565b9150610bbf82610b7e565b601b82019050919050565b600081519050919050565b60005b83811015610bf3578082015181840152602081019050610bd8565b60008484015250505050565b6000610c0a82610bca565b610c148185610b73565b9350610c24818560208601610bd5565b80840191505092915050565b6000610c3b82610ba7565b9150610c478284610bff565b915081905092915050565b6000601f19601f8301169050919050565b6000610c6e82610bca565b610c7881856109fa565b9350610c88818560208601610bd5565b610c9181610c52565b840191505092915050565b60006020820190508181036000830152610cb68184610c63565b905092915050565b610cc781610acc565b8114610cd257600080fd5b50565b600081519050610ce481610cbe565b92915050565b600060208284031215610d0057610cff6107eb565b5b6000610d0e84828501610cd5565b91505092915050565b7f5472616e73666572206661696c65640000000000000000000000000000000000600082015250565b6000610d4d600f836109fa565b9150610d5882610d17565b602082019050919050565b60006020820190508181036000830152610d7c81610d40565b9050919050565b7f4e487b7100000000000000000000000000000000000000000000000000000000600052604160045260246000fd5b7f4e487b7100000000000000000000000000000000000000000000000000000000600052601260045260246000fdfea26469706673582212201393569125c259704fcc0c66d20099a07ff33d82d8c9ace03fa427e758e217bd64736f6c63430008180033