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

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

interface ITheGardens {
    function hiveMint(address _to, uint256 _amount) external;
    function totalSupply() external view returns (uint256);
}

contract HiveMinter is Ownable {
    ITheGardens public theGardens;
    address public beekeeper;
    uint256 public price = 0.065 ether;
    uint256 public discount = 0.025 ether;
    uint16 public immutable maxSupply = 10000;
    uint8 public maxMintAmount = 20;

    event Minted(address indexed _to, uint8 _amount);

    error AccessError();
    error Disabled();
    error NotEnoughEther();
    error MaxSupply();
    error WithdrawFailed();
    error MinterIsContract();
    error MaxMintAmount();

    constructor(address _mintBees, address _beekeeper) {
        theGardens = ITheGardens(_mintBees);
        beekeeper = _beekeeper;
    }

    modifier onlyBeekeeper() {
        if (
            msg.sender != beekeeper &&
            msg.sender != owner()
        ) {
            revert AccessError();
        }
        _;
    }

    modifier maxMint(uint256 _amount) {
        if (_amount + theGardens.totalSupply() > maxSupply) {
            revert MaxSupply();
        }
        _;
    }

    modifier mintLimiter(uint256 _amount) {
        if (_amount > maxMintAmount) {
            revert MaxMintAmount();
        }
        _;
    }

    /**
     * @dev Modifier to ensure that the caller is not a contract. This is useful for
     *      preventing potential exploits or automated actions from contracts.
     *      Reverts the transaction with a `MinterNotContract` error if the caller is a contract.
     */
    modifier beeCallerOnly() {
        // Revert the transaction if the caller is a contract
        if (msg.sender != tx.origin) {
            revert MinterIsContract();
        }

        _;
    }

    function setBeekeeper(address _beekeeper) public onlyOwner {
        beekeeper = _beekeeper;
    }

    function setLimit(uint8 _limit) public onlyBeekeeper {
        maxMintAmount = _limit;
    }

    function setDiscount(uint256 _discount) public onlyBeekeeper {
        discount = _discount;
    }

    function setPrice(uint256 _price) public onlyBeekeeper {
        price = _price;
    }

    function withdraw() public onlyBeekeeper {
        (bool success, ) = payable(msg.sender).call{
            value: address(this).balance
        }("");
        if (!success) {
            revert WithdrawFailed();
        }
    }

    function grabPrice(
        uint256 _amount
    ) public view returns (uint256) {
        unchecked {
            uint256 finalPrice = price * _amount;

            if (_amount > 4) {
                uint256 numIncrements = _amount / 5;
                uint256 discountPrice = discount * numIncrements;
                finalPrice = finalPrice - discountPrice;
            }

            return finalPrice;
        }
    }

    function mint(
        uint8 _amount
    ) public payable maxMint(_amount) mintLimiter(_amount) beeCallerOnly {
        uint256 _price = grabPrice(_amount);

        if (msg.value < _price) revert NotEnoughEther();
        emit Minted(msg.sender, _amount);
        theGardens.hiveMint(msg.sender, _amount);
        
    }
}

// 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.8.0) (utils/Strings.sol)

pragma solidity ^0.8.0;

import "./math/Math.sol";

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

    /**
     * @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), _SYMBOLS))
                }
                value /= 10;
                if (value == 0) break;
            }
            return buffer;
        }
    }

    /**
     * @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) {
        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] = _SYMBOLS[value & 0xf];
            value >>= 4;
        }
        require(value == 0, "Strings: hex length insufficient");
        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);
    }
}

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

pragma solidity ^0.8.0;

/**
 * @dev Standard math utilities missing in the Solidity language.
 */
library Math {
    enum Rounding {
        Down, // Toward negative infinity
        Up, // Toward infinity
        Zero // Toward zero
    }

    /**
     * @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 up instead
     * of rounding down.
     */
    function ceilDiv(uint256 a, uint256 b) internal pure returns (uint256) {
        // (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; // Least significant 256 bits of the product
            uint256 prod1; // Most significant 256 bits of the product
            assembly {
                let mm := mulmod(x, y, not(0))
                prod0 := mul(x, y)
                prod1 := sub(sub(mm, prod0), lt(mm, prod0))
            }

            // Handle non-overflow cases, 256 by 256 division.
            if (prod1 == 0) {
                return prod0 / denominator;
            }

            // Make sure the result is less than 2^256. Also prevents denominator == 0.
            require(denominator > prod1);

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

            // Does not overflow because the denominator cannot be zero at this stage in the function.
            uint256 twos = denominator & (~denominator + 1);
            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 (rounding == Rounding.Up && 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 down.
     *
     * 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 + (rounding == Rounding.Up && result * result < a ? 1 : 0);
        }
    }

    /**
     * @dev Return the log in base 2, rounded down, of a positive value.
     * 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 + (rounding == Rounding.Up && 1 << result < value ? 1 : 0);
        }
    }

    /**
     * @dev Return the log in base 10, rounded down, of a positive value.
     * 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 + (rounding == Rounding.Up && 10**result < value ? 1 : 0);
        }
    }

    /**
     * @dev Return the log in base 256, rounded down, of a positive value.
     * 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 10, 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 + (rounding == Rounding.Up && 1 << (result * 8) < value ? 1 : 0);
        }
    }
}

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

• No Contract Security Audit Submitted- Submit Audit Here

[{"inputs":[{"internalType":"address","name":"_mintBees","type":"address"},{"internalType":"address","name":"_beekeeper","type":"address"}],"stateMutability":"nonpayable","type":"constructor"},{"inputs":[],"name":"AccessError","type":"error"},{"inputs":[],"name":"Disabled","type":"error"},{"inputs":[],"name":"MaxMintAmount","type":"error"},{"inputs":[],"name":"MaxSupply","type":"error"},{"inputs":[],"name":"MinterIsContract","type":"error"},{"inputs":[],"name":"NotEnoughEther","type":"error"},{"inputs":[],"name":"WithdrawFailed","type":"error"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"_to","type":"address"},{"indexed":false,"internalType":"uint8","name":"_amount","type":"uint8"}],"name":"Minted","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":[],"name":"beekeeper","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"discount","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"_amount","type":"uint256"}],"name":"grabPrice","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"maxMintAmount","outputs":[{"internalType":"uint8","name":"","type":"uint8"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"maxSupply","outputs":[{"internalType":"uint16","name":"","type":"uint16"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint8","name":"_amount","type":"uint8"}],"name":"mint","outputs":[],"stateMutability":"payable","type":"function"},{"inputs":[],"name":"owner","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"price","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"renounceOwnership","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"_beekeeper","type":"address"}],"name":"setBeekeeper","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"_discount","type":"uint256"}],"name":"setDiscount","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint8","name":"_limit","type":"uint8"}],"name":"setLimit","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"_price","type":"uint256"}],"name":"setPrice","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"theGardens","outputs":[{"internalType":"contract ITheGardens","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"newOwner","type":"address"}],"name":"transferOwnership","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"withdraw","outputs":[],"stateMutability":"nonpayable","type":"function"}]

60a060405266e6ed27d66680006003556658d15e176280006004556127106080526005805460ff1916601417905534801561003957600080fd5b50604051610d07380380610d07833981016040819052610058916100fe565b61006133610092565b600180546001600160a01b039384166001600160a01b03199182161790915560028054929093169116179055610131565b600080546001600160a01b038381166001600160a01b0319831681178455604051919092169283917f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e09190a35050565b80516001600160a01b03811681146100f957600080fd5b919050565b6000806040838503121561011157600080fd5b61011a836100e2565b9150610128602084016100e2565b90509250929050565b608051610bb4610153600039600081816102be01526104c60152610bb46000f3fe6080604052600436106100f35760003560e01c80638da5cb5b1161008a578063d5abeb0111610059578063d5abeb01146102ac578063dabd2719146102f3578063f2fde38b14610313578063ff3f19b51461033357600080fd5b80638da5cb5b1461021e57806391b7f5ed14610249578063a035b1fe14610269578063c5bb4c901461027f57600080fd5b80636692a67a116100c65780636692a67a146101b25780636b6f4a9d146101e05780636ecd2306146101f6578063715018a61461020957600080fd5b8063239c70ae146100f85780633ccfd60b1461012957806340ee15111461014057806341e21a1d14610192575b600080fd5b34801561010457600080fd5b506005546101129060ff1681565b60405160ff90911681526020015b60405180910390f35b34801561013557600080fd5b5061013e610353565b005b34801561014c57600080fd5b5060015461016d9073ffffffffffffffffffffffffffffffffffffffff1681565b60405173ffffffffffffffffffffffffffffffffffffffff9091168152602001610120565b34801561019e57600080fd5b5061013e6101ad366004610ab2565b61044f565b3480156101be57600080fd5b506101d26101cd366004610aef565b61049e565b604051908152602001610120565b3480156101ec57600080fd5b506101d260045481565b61013e610204366004610b08565b6104c0565b34801561021557600080fd5b5061013e61074c565b34801561022a57600080fd5b5060005473ffffffffffffffffffffffffffffffffffffffff1661016d565b34801561025557600080fd5b5061013e610264366004610aef565b610760565b34801561027557600080fd5b506101d260035481565b34801561028b57600080fd5b5060025461016d9073ffffffffffffffffffffffffffffffffffffffff1681565b3480156102b857600080fd5b506102e07f000000000000000000000000000000000000000000000000000000000000000081565b60405161ffff9091168152602001610120565b3480156102ff57600080fd5b5061013e61030e366004610aef565b6107dc565b34801561031f57600080fd5b5061013e61032e366004610ab2565b610858565b34801561033f57600080fd5b5061013e61034e366004610b08565b610911565b60025473ffffffffffffffffffffffffffffffffffffffff163314801590610393575060005473ffffffffffffffffffffffffffffffffffffffff163314155b156103ca576040517f4433c0ad00000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b604051600090339047908381818185875af1925050503d806000811461040c576040519150601f19603f3d011682016040523d82523d6000602084013e610411565b606091505b505090508061044c576040517f750b219c00000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b50565b6104576109bc565b600280547fffffffffffffffffffffffff00000000000000000000000000000000000000001673ffffffffffffffffffffffffffffffffffffffff92909216919091179055565b600354600090820260048311156104ba57600454600584040290035b92915050565b8060ff167f000000000000000000000000000000000000000000000000000000000000000061ffff16600160009054906101000a900473ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff166318160ddd6040518163ffffffff1660e01b8152600401602060405180830381865afa158015610556573d6000803e3d6000fd5b505050506040513d601f19601f8201168201806040525081019061057a9190610b2b565b6105849083610b44565b11156105bc576040517fb36c128400000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b60055460ff80841691168111156105ff576040517fcaeeffdb00000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b333214610638576040517fa691e3fe00000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b60006106468460ff1661049e565b905080341015610682576040517f8a0d377900000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b60405160ff8516815233907f94e3d3b755fb8272fed036a2000052ce127005b67c47d63b3cb642cb0e7464129060200160405180910390a26001546040517fdfc3145a00000000000000000000000000000000000000000000000000000000815233600482015260ff8616602482015273ffffffffffffffffffffffffffffffffffffffff9091169063dfc3145a90604401600060405180830381600087803b15801561072e57600080fd5b505af1158015610742573d6000803e3d6000fd5b5050505050505050565b6107546109bc565b61075e6000610a3d565b565b60025473ffffffffffffffffffffffffffffffffffffffff1633148015906107a0575060005473ffffffffffffffffffffffffffffffffffffffff163314155b156107d7576040517f4433c0ad00000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b600355565b60025473ffffffffffffffffffffffffffffffffffffffff16331480159061081c575060005473ffffffffffffffffffffffffffffffffffffffff163314155b15610853576040517f4433c0ad00000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b600455565b6108606109bc565b73ffffffffffffffffffffffffffffffffffffffff8116610908576040517f08c379a000000000000000000000000000000000000000000000000000000000815260206004820152602660248201527f4f776e61626c653a206e6577206f776e657220697320746865207a65726f206160448201527f646472657373000000000000000000000000000000000000000000000000000060648201526084015b60405180910390fd5b61044c81610a3d565b60025473ffffffffffffffffffffffffffffffffffffffff163314801590610951575060005473ffffffffffffffffffffffffffffffffffffffff163314155b15610988576040517f4433c0ad00000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b600580547fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff001660ff92909216919091179055565b60005473ffffffffffffffffffffffffffffffffffffffff16331461075e576040517f08c379a000000000000000000000000000000000000000000000000000000000815260206004820181905260248201527f4f776e61626c653a2063616c6c6572206973206e6f7420746865206f776e657260448201526064016108ff565b6000805473ffffffffffffffffffffffffffffffffffffffff8381167fffffffffffffffffffffffff0000000000000000000000000000000000000000831681178455604051919092169283917f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e09190a35050565b600060208284031215610ac457600080fd5b813573ffffffffffffffffffffffffffffffffffffffff81168114610ae857600080fd5b9392505050565b600060208284031215610b0157600080fd5b5035919050565b600060208284031215610b1a57600080fd5b813560ff81168114610ae857600080fd5b600060208284031215610b3d57600080fd5b5051919050565b808201808211156104ba577f4e487b7100000000000000000000000000000000000000000000000000000000600052601160045260246000fdfea2646970667358221220ffc5e8f0f69539436e4874f8662001cf7966439ebfa2fdc4d5b0807461a74e0f64736f6c634300081200330000000000000000000000001dd870fa916d2f187863f3e97da6efd3c29c417300000000000000000000000030e64b8e4bacc2baef74ac59d33ab230a2889d50

0x6080604052600436106100f35760003560e01c80638da5cb5b1161008a578063d5abeb0111610059578063d5abeb01146102ac578063dabd2719146102f3578063f2fde38b14610313578063ff3f19b51461033357600080fd5b80638da5cb5b1461021e57806391b7f5ed14610249578063a035b1fe14610269578063c5bb4c901461027f57600080fd5b80636692a67a116100c65780636692a67a146101b25780636b6f4a9d146101e05780636ecd2306146101f6578063715018a61461020957600080fd5b8063239c70ae146100f85780633ccfd60b1461012957806340ee15111461014057806341e21a1d14610192575b600080fd5b34801561010457600080fd5b506005546101129060ff1681565b60405160ff90911681526020015b60405180910390f35b34801561013557600080fd5b5061013e610353565b005b34801561014c57600080fd5b5060015461016d9073ffffffffffffffffffffffffffffffffffffffff1681565b60405173ffffffffffffffffffffffffffffffffffffffff9091168152602001610120565b34801561019e57600080fd5b5061013e6101ad366004610ab2565b61044f565b3480156101be57600080fd5b506101d26101cd366004610aef565b61049e565b604051908152602001610120565b3480156101ec57600080fd5b506101d260045481565b61013e610204366004610b08565b6104c0565b34801561021557600080fd5b5061013e61074c565b34801561022a57600080fd5b5060005473ffffffffffffffffffffffffffffffffffffffff1661016d565b34801561025557600080fd5b5061013e610264366004610aef565b610760565b34801561027557600080fd5b506101d260035481565b34801561028b57600080fd5b5060025461016d9073ffffffffffffffffffffffffffffffffffffffff1681565b3480156102b857600080fd5b506102e07f000000000000000000000000000000000000000000000000000000000000271081565b60405161ffff9091168152602001610120565b3480156102ff57600080fd5b5061013e61030e366004610aef565b6107dc565b34801561031f57600080fd5b5061013e61032e366004610ab2565b610858565b34801561033f57600080fd5b5061013e61034e366004610b08565b610911565b60025473ffffffffffffffffffffffffffffffffffffffff163314801590610393575060005473ffffffffffffffffffffffffffffffffffffffff163314155b156103ca576040517f4433c0ad00000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b604051600090339047908381818185875af1925050503d806000811461040c576040519150601f19603f3d011682016040523d82523d6000602084013e610411565b606091505b505090508061044c576040517f750b219c00000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b50565b6104576109bc565b600280547fffffffffffffffffffffffff00000000000000000000000000000000000000001673ffffffffffffffffffffffffffffffffffffffff92909216919091179055565b600354600090820260048311156104ba57600454600584040290035b92915050565b8060ff167f000000000000000000000000000000000000000000000000000000000000271061ffff16600160009054906101000a900473ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff166318160ddd6040518163ffffffff1660e01b8152600401602060405180830381865afa158015610556573d6000803e3d6000fd5b505050506040513d601f19601f8201168201806040525081019061057a9190610b2b565b6105849083610b44565b11156105bc576040517fb36c128400000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b60055460ff80841691168111156105ff576040517fcaeeffdb00000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b333214610638576040517fa691e3fe00000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b60006106468460ff1661049e565b905080341015610682576040517f8a0d377900000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b60405160ff8516815233907f94e3d3b755fb8272fed036a2000052ce127005b67c47d63b3cb642cb0e7464129060200160405180910390a26001546040517fdfc3145a00000000000000000000000000000000000000000000000000000000815233600482015260ff8616602482015273ffffffffffffffffffffffffffffffffffffffff9091169063dfc3145a90604401600060405180830381600087803b15801561072e57600080fd5b505af1158015610742573d6000803e3d6000fd5b5050505050505050565b6107546109bc565b61075e6000610a3d565b565b60025473ffffffffffffffffffffffffffffffffffffffff1633148015906107a0575060005473ffffffffffffffffffffffffffffffffffffffff163314155b156107d7576040517f4433c0ad00000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b600355565b60025473ffffffffffffffffffffffffffffffffffffffff16331480159061081c575060005473ffffffffffffffffffffffffffffffffffffffff163314155b15610853576040517f4433c0ad00000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b600455565b6108606109bc565b73ffffffffffffffffffffffffffffffffffffffff8116610908576040517f08c379a000000000000000000000000000000000000000000000000000000000815260206004820152602660248201527f4f776e61626c653a206e6577206f776e657220697320746865207a65726f206160448201527f646472657373000000000000000000000000000000000000000000000000000060648201526084015b60405180910390fd5b61044c81610a3d565b60025473ffffffffffffffffffffffffffffffffffffffff163314801590610951575060005473ffffffffffffffffffffffffffffffffffffffff163314155b15610988576040517f4433c0ad00000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b600580547fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff001660ff92909216919091179055565b60005473ffffffffffffffffffffffffffffffffffffffff16331461075e576040517f08c379a000000000000000000000000000000000000000000000000000000000815260206004820181905260248201527f4f776e61626c653a2063616c6c6572206973206e6f7420746865206f776e657260448201526064016108ff565b6000805473ffffffffffffffffffffffffffffffffffffffff8381167fffffffffffffffffffffffff0000000000000000000000000000000000000000831681178455604051919092169283917f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e09190a35050565b600060208284031215610ac457600080fd5b813573ffffffffffffffffffffffffffffffffffffffff81168114610ae857600080fd5b9392505050565b600060208284031215610b0157600080fd5b5035919050565b600060208284031215610b1a57600080fd5b813560ff81168114610ae857600080fd5b600060208284031215610b3d57600080fd5b5051919050565b808201808211156104ba577f4e487b7100000000000000000000000000000000000000000000000000000000600052601160045260246000fdfea2646970667358221220ffc5e8f0f69539436e4874f8662001cf7966439ebfa2fdc4d5b0807461a74e0f64736f6c63430008120033

0000000000000000000000001dd870fa916d2f187863f3e97da6efd3c29c417300000000000000000000000030e64b8e4bacc2baef74ac59d33ab230a2889d50

-----Decoded View---------------
Arg [0] : _mintBees (address): 0x1Dd870fA916d2F187863F3E97DA6eFD3c29C4173
Arg [1] : _beekeeper (address): 0x30e64B8E4bacc2BAEf74AC59D33aB230A2889d50

-----Encoded View---------------
2 Constructor Arguments found :
Arg [0] : 0000000000000000000000001dd870fa916d2f187863f3e97da6efd3c29c4173
Arg [1] : 00000000000000000000000030e64b8e4bacc2baef74ac59d33ab230a2889d50