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

import "@openzeppelin/contracts/access/AccessControl.sol";
import "@openzeppelin/contracts/utils/cryptography/MerkleProof.sol";
import "./interface/IBlueChipGenesis.sol";

error InvalidMerkleProof();
error NotEnoughFunds(uint256 balance);
error NoMintFromContract();
error ExceedsAllocation();
error WrongMintAmount();
error MaxSupplyOver();

contract BlueChipGenesisMinter is AccessControl {
    IBlueChipGenesis public blueChipGenesis;

    bytes32 internal constant ADMIN = keccak256("ADMIN");

    bytes32 public merkleRoot;

    uint256 public constant MAX_SUPPLY = 9000;
    uint256 public constant MINT_COST = 0.005 ether;

    // フルミント済フラグ用bit配列 256*6=1536 が取り扱えるALウォレットの数
    uint256 private constant MAX_INT = 0xffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff;
    uint256[6] arr = [MAX_INT, MAX_INT, MAX_INT, MAX_INT, MAX_INT, MAX_INT];

    // 部分ミント済み数マッピング
    mapping(address => uint256) public mintCount;

    address public withdrawAddress = 0x4f4823F3639DdCC2B14093a28802E214C7C28D03;

    constructor() {
        _grantRole(DEFAULT_ADMIN_ROLE, msg.sender);
        _grantRole(ADMIN, msg.sender);
        _grantRole(ADMIN, 0x407211BeF7cbca2C8897C580EC16c80F2ad5c966);
        _grantRole(ADMIN, 0x11F51b553ed8175Bf26faD5Eec20BEbAB31c0893);
    }

    /**
     * セール用ミント関数
     */
    /// @dev マークルツリーによるALミント関数（フルミント用）
    function allowListFullMint(uint256 _ticketNumber, uint256 _allocated, bytes32[] calldata _merkleProof)
        external
        payable
    {
        // コントラクトからのミントガード
        if (tx.origin != msg.sender) revert NoMintFromContract();

        //　部分ミント済みの場合はリバート
        if (mintCount[msg.sender] > 0) revert ExceedsAllocation();

        // merkleProofのチェック
        bytes32 leaf = keccak256(abi.encodePacked(_ticketNumber, "|", msg.sender, "|", _allocated));
        if (!MerkleProof.verifyCalldata(_merkleProof, merkleRoot, leaf)) revert InvalidMerkleProof();

        // ミント代金のチェック
        if (msg.value == 0 || msg.value < _allocated * MINT_COST) revert NotEnoughFunds(msg.value);

        // ミントによりMAX SUPPLYを超えないかチェック
        if (_allocated + totalSupply() > MAX_SUPPLY) revert MaxSupplyOver();

        // フルミント済みかどうかのチェックと登録
        claimTicketOrBlockTransaction(_ticketNumber);

        // ミント
        blueChipGenesis.mint(msg.sender, _allocated);
    }

    /// @dev マークルツリーによるALミント関数（部分ミント用）
    function allowListPartialMint(
        uint256 _ticketNumber,
        uint256 _allocated,
        bytes32[] calldata _merkleProof,
        uint256 _mintAmount
    ) external payable {
        // コントラクトからのミントガード
        if (tx.origin != msg.sender) revert NoMintFromContract();

        // フルミント済みの場合はリバート
        if (getStoredBit(_ticketNumber) != 1) revert ExceedsAllocation();

        // merkleProofのチェック
        bytes32 leaf = keccak256(abi.encodePacked(_ticketNumber, "|", msg.sender, "|", _allocated));
        if (!MerkleProof.verifyCalldata(_merkleProof, merkleRoot, leaf)) revert InvalidMerkleProof();

        // ミント代金のチェック
        if (msg.value == 0 || msg.value < _mintAmount * MINT_COST) revert NotEnoughFunds(msg.value);

        // ミントによりMAX SUPPLYを超えないかチェック
        if (_mintAmount + totalSupply() > MAX_SUPPLY) revert MaxSupplyOver();

        // ミント数の保有枠上限チェック
        if (mintCount[msg.sender] + _mintAmount > _allocated) revert ExceedsAllocation();

        // ミント数済み数加算
        unchecked {
            mintCount[msg.sender] += _mintAmount;
        }

        // ミント
        blueChipGenesis.mint(msg.sender, _mintAmount);
    }

    // ウォレット番号（ticket）ごとにミント済フラグを管理する関数
    function claimTicketOrBlockTransaction(uint256 ticketNumber) private {
        require(ticketNumber < arr.length * 256, "bad ticket");

        uint256 storageOffset;
        uint256 offsetWithin256;
        uint256 localGroup;
        uint256 storedBit;

        unchecked {
            storageOffset = ticketNumber / 256;
            offsetWithin256 = ticketNumber % 256;
        }
        localGroup = arr[storageOffset];
        storedBit = (localGroup >> offsetWithin256) & uint256(1);
        // ミント済みの場合はリバート
        if (storedBit != 1) revert ExceedsAllocation();
        // 未ミントの場合はフラグを立てる
        localGroup = localGroup & ~(uint256(1) << offsetWithin256);
        arr[storageOffset] = localGroup;
    }

    /// @dev ミント済フラグのgetter関数
    function getStoredBit(uint256 ticketNumber) public view returns (uint256) {
        require(ticketNumber < arr.length * 256, "bad ticket");

        uint256 storageOffset;
        uint256 offsetWithin256;
        uint256 localGroup;
        uint256 storedBit;

        unchecked {
            storageOffset = ticketNumber / 256;
            offsetWithin256 = ticketNumber % 256;
        }

        localGroup = arr[storageOffset];
        storedBit = (localGroup >> offsetWithin256) & uint256(1);

        return storedBit;
    }

    /**
     * withdraw関数
     */
    /// @dev 引出し先アドレスのsetter関数
    function setWithdrawAddress(address _withdrawAddress) external onlyRole(ADMIN) {
        withdrawAddress = _withdrawAddress;
    }

    /// @dev 引出し用関数
    function withdraw() external payable onlyRole(ADMIN) {
        require(withdrawAddress != address(0), "withdrawAddress can't be 0");
        (bool sent,) = payable(withdrawAddress).call{value: address(this).balance}("");
        require(sent, "failed to withdraw");
    }

    /**
     * ADMIN用 setter関数
     */
    /// @dev 親コントラクトのsetter関数
    function setBlueChipGenesis(address _contractAddress) external onlyRole(ADMIN) {
        blueChipGenesis = IBlueChipGenesis(_contractAddress);
    }

    /// @dev マークルルートのsetter関数
    function setMerkleRoot(bytes32 _merkleRoot) external onlyRole(ADMIN) {
        merkleRoot = _merkleRoot;
    }

    /**
     * その他の関数
     */
    function supportsInterface(bytes4 interfaceId) public view virtual override(AccessControl) returns (bool) {
        return (AccessControl.supportsInterface(interfaceId) || super.supportsInterface(interfaceId));
    }

    function totalSupply() public view returns (uint256) {
        return blueChipGenesis.totalSupply();
    }
}

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

pragma solidity ^0.8.0;

import "./IAccessControl.sol";
import "../utils/Context.sol";
import "../utils/Strings.sol";
import "../utils/introspection/ERC165.sol";

/**
 * @dev Contract module that allows children to implement role-based access
 * control mechanisms. This is a lightweight version that doesn't allow enumerating role
 * members except through off-chain means by accessing the contract event logs. Some
 * applications may benefit from on-chain enumerability, for those cases see
 * {AccessControlEnumerable}.
 *
 * Roles are referred to by their `bytes32` identifier. These should be exposed
 * in the external API and be unique. The best way to achieve this is by
 * using `public constant` hash digests:
 *
 * ```
 * bytes32 public constant MY_ROLE = keccak256("MY_ROLE");
 * ```
 *
 * Roles can be used to represent a set of permissions. To restrict access to a
 * function call, use {hasRole}:
 *
 * ```
 * function foo() public {
 *     require(hasRole(MY_ROLE, msg.sender));
 *     ...
 * }
 * ```
 *
 * Roles can be granted and revoked dynamically via the {grantRole} and
 * {revokeRole} functions. Each role has an associated admin role, and only
 * accounts that have a role's admin role can call {grantRole} and {revokeRole}.
 *
 * By default, the admin role for all roles is `DEFAULT_ADMIN_ROLE`, which means
 * that only accounts with this role will be able to grant or revoke other
 * roles. More complex role relationships can be created by using
 * {_setRoleAdmin}.
 *
 * WARNING: The `DEFAULT_ADMIN_ROLE` is also its own admin: it has permission to
 * grant and revoke this role. Extra precautions should be taken to secure
 * accounts that have been granted it.
 */
abstract contract AccessControl is Context, IAccessControl, ERC165 {
    struct RoleData {
        mapping(address => bool) members;
        bytes32 adminRole;
    }

    mapping(bytes32 => RoleData) private _roles;

    bytes32 public constant DEFAULT_ADMIN_ROLE = 0x00;

    /**
     * @dev Modifier that checks that an account has a specific role. Reverts
     * with a standardized message including the required role.
     *
     * The format of the revert reason is given by the following regular expression:
     *
     *  /^AccessControl: account (0x[0-9a-f]{40}) is missing role (0x[0-9a-f]{64})$/
     *
     * _Available since v4.1._
     */
    modifier onlyRole(bytes32 role) {
        _checkRole(role);
        _;
    }

    /**
     * @dev See {IERC165-supportsInterface}.
     */
    function supportsInterface(bytes4 interfaceId) public view virtual override returns (bool) {
        return interfaceId == type(IAccessControl).interfaceId || super.supportsInterface(interfaceId);
    }

    /**
     * @dev Returns `true` if `account` has been granted `role`.
     */
    function hasRole(bytes32 role, address account) public view virtual override returns (bool) {
        return _roles[role].members[account];
    }

    /**
     * @dev Revert with a standard message if `_msgSender()` is missing `role`.
     * Overriding this function changes the behavior of the {onlyRole} modifier.
     *
     * Format of the revert message is described in {_checkRole}.
     *
     * _Available since v4.6._
     */
    function _checkRole(bytes32 role) internal view virtual {
        _checkRole(role, _msgSender());
    }

    /**
     * @dev Revert with a standard message if `account` is missing `role`.
     *
     * The format of the revert reason is given by the following regular expression:
     *
     *  /^AccessControl: account (0x[0-9a-f]{40}) is missing role (0x[0-9a-f]{64})$/
     */
    function _checkRole(bytes32 role, address account) internal view virtual {
        if (!hasRole(role, account)) {
            revert(
                string(
                    abi.encodePacked(
                        "AccessControl: account ",
                        Strings.toHexString(account),
                        " is missing role ",
                        Strings.toHexString(uint256(role), 32)
                    )
                )
            );
        }
    }

    /**
     * @dev Returns the admin role that controls `role`. See {grantRole} and
     * {revokeRole}.
     *
     * To change a role's admin, use {_setRoleAdmin}.
     */
    function getRoleAdmin(bytes32 role) public view virtual override returns (bytes32) {
        return _roles[role].adminRole;
    }

    /**
     * @dev Grants `role` to `account`.
     *
     * If `account` had not been already granted `role`, emits a {RoleGranted}
     * event.
     *
     * Requirements:
     *
     * - the caller must have ``role``'s admin role.
     *
     * May emit a {RoleGranted} event.
     */
    function grantRole(bytes32 role, address account) public virtual override onlyRole(getRoleAdmin(role)) {
        _grantRole(role, account);
    }

    /**
     * @dev Revokes `role` from `account`.
     *
     * If `account` had been granted `role`, emits a {RoleRevoked} event.
     *
     * Requirements:
     *
     * - the caller must have ``role``'s admin role.
     *
     * May emit a {RoleRevoked} event.
     */
    function revokeRole(bytes32 role, address account) public virtual override onlyRole(getRoleAdmin(role)) {
        _revokeRole(role, account);
    }

    /**
     * @dev Revokes `role` from the calling account.
     *
     * Roles are often managed via {grantRole} and {revokeRole}: this function's
     * purpose is to provide a mechanism for accounts to lose their privileges
     * if they are compromised (such as when a trusted device is misplaced).
     *
     * If the calling account had been revoked `role`, emits a {RoleRevoked}
     * event.
     *
     * Requirements:
     *
     * - the caller must be `account`.
     *
     * May emit a {RoleRevoked} event.
     */
    function renounceRole(bytes32 role, address account) public virtual override {
        require(account == _msgSender(), "AccessControl: can only renounce roles for self");

        _revokeRole(role, account);
    }

    /**
     * @dev Grants `role` to `account`.
     *
     * If `account` had not been already granted `role`, emits a {RoleGranted}
     * event. Note that unlike {grantRole}, this function doesn't perform any
     * checks on the calling account.
     *
     * May emit a {RoleGranted} event.
     *
     * [WARNING]
     * ====
     * This function should only be called from the constructor when setting
     * up the initial roles for the system.
     *
     * Using this function in any other way is effectively circumventing the admin
     * system imposed by {AccessControl}.
     * ====
     *
     * NOTE: This function is deprecated in favor of {_grantRole}.
     */
    function _setupRole(bytes32 role, address account) internal virtual {
        _grantRole(role, account);
    }

    /**
     * @dev Sets `adminRole` as ``role``'s admin role.
     *
     * Emits a {RoleAdminChanged} event.
     */
    function _setRoleAdmin(bytes32 role, bytes32 adminRole) internal virtual {
        bytes32 previousAdminRole = getRoleAdmin(role);
        _roles[role].adminRole = adminRole;
        emit RoleAdminChanged(role, previousAdminRole, adminRole);
    }

    /**
     * @dev Grants `role` to `account`.
     *
     * Internal function without access restriction.
     *
     * May emit a {RoleGranted} event.
     */
    function _grantRole(bytes32 role, address account) internal virtual {
        if (!hasRole(role, account)) {
            _roles[role].members[account] = true;
            emit RoleGranted(role, account, _msgSender());
        }
    }

    /**
     * @dev Revokes `role` from `account`.
     *
     * Internal function without access restriction.
     *
     * May emit a {RoleRevoked} event.
     */
    function _revokeRole(bytes32 role, address account) internal virtual {
        if (hasRole(role, account)) {
            _roles[role].members[account] = false;
            emit RoleRevoked(role, account, _msgSender());
        }
    }
}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts v4.4.1 (access/IAccessControl.sol)

pragma solidity ^0.8.0;

/**
 * @dev External interface of AccessControl declared to support ERC165 detection.
 */
interface IAccessControl {
    /**
     * @dev Emitted when `newAdminRole` is set as ``role``'s admin role, replacing `previousAdminRole`
     *
     * `DEFAULT_ADMIN_ROLE` is the starting admin for all roles, despite
     * {RoleAdminChanged} not being emitted signaling this.
     *
     * _Available since v3.1._
     */
    event RoleAdminChanged(bytes32 indexed role, bytes32 indexed previousAdminRole, bytes32 indexed newAdminRole);

    /**
     * @dev Emitted when `account` is granted `role`.
     *
     * `sender` is the account that originated the contract call, an admin role
     * bearer except when using {AccessControl-_setupRole}.
     */
    event RoleGranted(bytes32 indexed role, address indexed account, address indexed sender);

    /**
     * @dev Emitted when `account` is revoked `role`.
     *
     * `sender` is the account that originated the contract call:
     *   - if using `revokeRole`, it is the admin role bearer
     *   - if using `renounceRole`, it is the role bearer (i.e. `account`)
     */
    event RoleRevoked(bytes32 indexed role, address indexed account, address indexed sender);

    /**
     * @dev Returns `true` if `account` has been granted `role`.
     */
    function hasRole(bytes32 role, address account) external view returns (bool);

    /**
     * @dev Returns the admin role that controls `role`. See {grantRole} and
     * {revokeRole}.
     *
     * To change a role's admin, use {AccessControl-_setRoleAdmin}.
     */
    function getRoleAdmin(bytes32 role) external view returns (bytes32);

    /**
     * @dev Grants `role` to `account`.
     *
     * If `account` had not been already granted `role`, emits a {RoleGranted}
     * event.
     *
     * Requirements:
     *
     * - the caller must have ``role``'s admin role.
     */
    function grantRole(bytes32 role, address account) external;

    /**
     * @dev Revokes `role` from `account`.
     *
     * If `account` had been granted `role`, emits a {RoleRevoked} event.
     *
     * Requirements:
     *
     * - the caller must have ``role``'s admin role.
     */
    function revokeRole(bytes32 role, address account) external;

    /**
     * @dev Revokes `role` from the calling account.
     *
     * Roles are often managed via {grantRole} and {revokeRole}: this function's
     * purpose is to provide a mechanism for accounts to lose their privileges
     * if they are compromised (such as when a trusted device is misplaced).
     *
     * If the calling account had been granted `role`, emits a {RoleRevoked}
     * event.
     *
     * Requirements:
     *
     * - the caller must be `account`.
     */
    function renounceRole(bytes32 role, address account) external;
}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts v4.4.1 (utils/Context.sol)

pragma solidity ^0.8.0;

/**
 * @dev Provides information about the current execution context, including the
 * sender of the transaction and its data. While these are generally available
 * via msg.sender and msg.data, they should not be accessed in such a direct
 * manner, since when dealing with meta-transactions the account sending and
 * paying for execution may not be the actual sender (as far as an application
 * is concerned).
 *
 * This contract is only required for intermediate, library-like contracts.
 */
abstract contract Context {
    function _msgSender() internal view virtual returns (address) {
        return msg.sender;
    }

    function _msgData() internal view virtual returns (bytes calldata) {
        return msg.data;
    }
}

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

pragma solidity ^0.8.0;

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts v4.4.1 (utils/introspection/ERC165.sol)

pragma solidity ^0.8.0;

import "./IERC165.sol";

/**
 * @dev Implementation of the {IERC165} interface.
 *
 * Contracts that want to implement ERC165 should inherit from this contract and override {supportsInterface} to check
 * for the additional interface id that will be supported. For example:
 *
 * ```solidity
 * function supportsInterface(bytes4 interfaceId) public view virtual override returns (bool) {
 *     return interfaceId == type(MyInterface).interfaceId || super.supportsInterface(interfaceId);
 * }
 * ```
 *
 * Alternatively, {ERC165Storage} provides an easier to use but more expensive implementation.
 */
abstract contract ERC165 is IERC165 {
    /**
     * @dev See {IERC165-supportsInterface}.
     */
    function supportsInterface(bytes4 interfaceId) public view virtual override returns (bool) {
        return interfaceId == type(IERC165).interfaceId;
    }
}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts v4.4.1 (utils/introspection/IERC165.sol)

pragma solidity ^0.8.0;

/**
 * @dev Interface of the ERC165 standard, as defined in the
 * https://eips.ethereum.org/EIPS/eip-165[EIP].
 *
 * Implementers can declare support of contract interfaces, which can then be
 * queried by others ({ERC165Checker}).
 *
 * For an implementation, see {ERC165}.
 */
interface IERC165 {
    /**
     * @dev Returns true if this contract implements the interface defined by
     * `interfaceId`. See the corresponding
     * https://eips.ethereum.org/EIPS/eip-165#how-interfaces-are-identified[EIP section]
     * to learn more about how these ids are created.
     *
     * This function call must use less than 30 000 gas.
     */
    function supportsInterface(bytes4 interfaceId) external view returns (bool);
}

// 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 (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
pragma solidity ^0.8.9;

interface IBlueChipGenesis {
    function mint(address _to, uint256 _amount) external;

    //ERC721Psi
    function totalSupply() external view returns (uint256);
}

{
  "optimizer": {
    "enabled": true,
    "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":[],"name":"ExceedsAllocation","type":"error"},{"inputs":[],"name":"InvalidMerkleProof","type":"error"},{"inputs":[],"name":"MaxSupplyOver","type":"error"},{"inputs":[],"name":"NoMintFromContract","type":"error"},{"inputs":[{"internalType":"uint256","name":"balance","type":"uint256"}],"name":"NotEnoughFunds","type":"error"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"bytes32","name":"role","type":"bytes32"},{"indexed":true,"internalType":"bytes32","name":"previousAdminRole","type":"bytes32"},{"indexed":true,"internalType":"bytes32","name":"newAdminRole","type":"bytes32"}],"name":"RoleAdminChanged","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"bytes32","name":"role","type":"bytes32"},{"indexed":true,"internalType":"address","name":"account","type":"address"},{"indexed":true,"internalType":"address","name":"sender","type":"address"}],"name":"RoleGranted","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"bytes32","name":"role","type":"bytes32"},{"indexed":true,"internalType":"address","name":"account","type":"address"},{"indexed":true,"internalType":"address","name":"sender","type":"address"}],"name":"RoleRevoked","type":"event"},{"inputs":[],"name":"DEFAULT_ADMIN_ROLE","outputs":[{"internalType":"bytes32","name":"","type":"bytes32"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"MAX_SUPPLY","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"MINT_COST","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"_ticketNumber","type":"uint256"},{"internalType":"uint256","name":"_allocated","type":"uint256"},{"internalType":"bytes32[]","name":"_merkleProof","type":"bytes32[]"}],"name":"allowListFullMint","outputs":[],"stateMutability":"payable","type":"function"},{"inputs":[{"internalType":"uint256","name":"_ticketNumber","type":"uint256"},{"internalType":"uint256","name":"_allocated","type":"uint256"},{"internalType":"bytes32[]","name":"_merkleProof","type":"bytes32[]"},{"internalType":"uint256","name":"_mintAmount","type":"uint256"}],"name":"allowListPartialMint","outputs":[],"stateMutability":"payable","type":"function"},{"inputs":[],"name":"blueChipGenesis","outputs":[{"internalType":"contract IBlueChipGenesis","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"bytes32","name":"role","type":"bytes32"}],"name":"getRoleAdmin","outputs":[{"internalType":"bytes32","name":"","type":"bytes32"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"ticketNumber","type":"uint256"}],"name":"getStoredBit","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"bytes32","name":"role","type":"bytes32"},{"internalType":"address","name":"account","type":"address"}],"name":"grantRole","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"bytes32","name":"role","type":"bytes32"},{"internalType":"address","name":"account","type":"address"}],"name":"hasRole","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"merkleRoot","outputs":[{"internalType":"bytes32","name":"","type":"bytes32"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"","type":"address"}],"name":"mintCount","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"bytes32","name":"role","type":"bytes32"},{"internalType":"address","name":"account","type":"address"}],"name":"renounceRole","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"bytes32","name":"role","type":"bytes32"},{"internalType":"address","name":"account","type":"address"}],"name":"revokeRole","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"_contractAddress","type":"address"}],"name":"setBlueChipGenesis","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"bytes32","name":"_merkleRoot","type":"bytes32"}],"name":"setMerkleRoot","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"_withdrawAddress","type":"address"}],"name":"setWithdrawAddress","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"bytes4","name":"interfaceId","type":"bytes4"}],"name":"supportsInterface","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"totalSupply","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"withdraw","outputs":[],"stateMutability":"payable","type":"function"},{"inputs":[],"name":"withdrawAddress","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"}]

610140604052600019608081815260a082905260c082905260e082905261010082905261012091909152620000399060039060066200019b565b50600a80546001600160a01b031916734f4823f3639ddcc2b14093a28802e214c7c28d031790553480156200006d57600080fd5b506200007b600033620000fa565b620000966000805160206200150983398151915233620000fa565b620000c56000805160206200150983398151915273407211bef7cbca2c8897c580ec16c80f2ad5c966620000fa565b620000f4600080516020620015098339815191527311f51b553ed8175bf26fad5eec20bebab31c0893620000fa565b620001f5565b6000828152602081815260408083206001600160a01b038516845290915290205460ff1662000197576000828152602081815260408083206001600160a01b03851684529091529020805460ff19166001179055620001563390565b6001600160a01b0316816001600160a01b0316837f2f8788117e7eff1d82e926ec794901d17c78024a50270940304540a733656f0d60405160405180910390a45b5050565b8260068101928215620001cc579160200282015b82811115620001cc578251825591602001919060010190620001af565b50620001da929150620001de565b5090565b5b80821115620001da5760008155600101620001df565b61130480620002056000396000f3fe60806040526004361061012a5760003560e01c80633ccfd60b116100ab578063a217fddf1161006f578063a217fddf1461030b578063ab3cb35c14610320578063be7b657314610340578063c662e48114610360578063d547741f1461037b578063ed9ec8881461039b57600080fd5b80633ccfd60b1461029d5780634388d048146102a55780637879d3e1146102b85780637cb64759146102cb57806391d14854146102eb57600080fd5b80632f2ff15d116100f25780632f2ff15d1461020557806332cb6b0c1461022757806334cba5281461023d57806336568abe1461025d5780633ab1a4941461027d57600080fd5b806301ffc9a71461012f5780631581b6001461016457806318160ddd1461019c578063248a9ca3146101bf5780632eb4a7ab146101ef575b600080fd5b34801561013b57600080fd5b5061014f61014a366004610f51565b6103c8565b60405190151581526020015b60405180910390f35b34801561017057600080fd5b50600a54610184906001600160a01b031681565b6040516001600160a01b03909116815260200161015b565b3480156101a857600080fd5b506101b16103e8565b60405190815260200161015b565b3480156101cb57600080fd5b506101b16101da366004610f7b565b60009081526020819052604090206001015490565b3480156101fb57600080fd5b506101b160025481565b34801561021157600080fd5b50610225610220366004610fb0565b61045b565b005b34801561023357600080fd5b506101b161232881565b34801561024957600080fd5b506101b1610258366004610f7b565b610485565b34801561026957600080fd5b50610225610278366004610fb0565b610504565b34801561028957600080fd5b50610225610298366004610fdc565b610582565b6102256105bd565b6102256102b3366004611043565b6106c5565b6102256102c6366004611096565b610851565b3480156102d757600080fd5b506102256102e6366004610f7b565b610a22565b3480156102f757600080fd5b5061014f610306366004610fb0565b610a40565b34801561031757600080fd5b506101b1600081565b34801561032c57600080fd5b5061022561033b366004610fdc565b610a69565b34801561034c57600080fd5b50600154610184906001600160a01b031681565b34801561036c57600080fd5b506101b16611c37937e0800081565b34801561038757600080fd5b50610225610396366004610fb0565b610aa4565b3480156103a757600080fd5b506101b16103b6366004610fdc565b60096020526000908152604090205481565b60006103d382610ac9565b806103e257506103e282610ac9565b92915050565b600154604080516318160ddd60e01b815290516000926001600160a01b0316916318160ddd9160048083019260209291908290030181865afa158015610432573d6000803e3d6000fd5b505050506040513d601f19601f8201168201806040525081019061045691906110f1565b905090565b60008281526020819052604090206001015461047681610afe565b6104808383610b0b565b505050565b60006104946006610100611120565b82106104d45760405162461bcd60e51b815260206004820152600a602482015269189859081d1a58dad95d60b21b60448201526064015b60405180910390fd5b610100820460ff8316600080600384600681106104f3576104f3611137565b015490921c60011695945050505050565b6001600160a01b03811633146105745760405162461bcd60e51b815260206004820152602f60248201527f416363657373436f6e74726f6c3a2063616e206f6e6c792072656e6f756e636560448201526e103937b632b9903337b91039b2b63360891b60648201526084016104cb565b61057e8282610b8f565b5050565b6000805160206112af83398151915261059a81610afe565b50600a80546001600160a01b0319166001600160a01b0392909216919091179055565b6000805160206112af8339815191526105d581610afe565b600a546001600160a01b031661062d5760405162461bcd60e51b815260206004820152601a60248201527f7769746864726177416464726573732063616e2774206265203000000000000060448201526064016104cb565b600a546040516000916001600160a01b03169047908381818185875af1925050503d806000811461067a576040519150601f19603f3d011682016040523d82523d6000602084013e61067f565b606091505b505090508061057e5760405162461bcd60e51b81526020600482015260126024820152716661696c656420746f20776974686472617760701b60448201526064016104cb565b3233146106e557604051635617179b60e11b815260040160405180910390fd5b336000908152600960205260409020541561071357604051632150464360e21b815260040160405180910390fd5b600084338560405160200161072a9392919061114d565b604051602081830303815290604052805190602001209050610750838360025484610bf4565b61076d5760405163582f497d60e11b815260040160405180910390fd5b34158061078957506107866611c37937e0800085611120565b34105b156107a957604051638228b9cb60e01b81523460048201526024016104cb565b6123286107b46103e8565b6107be9086611189565b11156107dd57604051638353b89160e01b815260040160405180910390fd5b6107e685610c0c565b6001546040516340c10f1960e01b8152336004820152602481018690526001600160a01b03909116906340c10f1990604401600060405180830381600087803b15801561083257600080fd5b505af1158015610846573d6000803e3d6000fd5b505050505050505050565b32331461087157604051635617179b60e11b815260040160405180910390fd5b61087a85610485565b60011461089a57604051632150464360e21b815260040160405180910390fd5b60008533866040516020016108b19392919061114d565b6040516020818303038152906040528051906020012090506108d7848460025484610bf4565b6108f45760405163582f497d60e11b815260040160405180910390fd5b341580610910575061090d6611c37937e0800083611120565b34105b1561093057604051638228b9cb60e01b81523460048201526024016104cb565b61232861093b6103e8565b6109459084611189565b111561096457604051638353b89160e01b815260040160405180910390fd5b336000908152600960205260409020548590610981908490611189565b11156109a057604051632150464360e21b815260040160405180910390fd5b336000818152600960205260409081902080548501905560015490516340c10f1960e01b81526004810192909252602482018490526001600160a01b0316906340c10f1990604401600060405180830381600087803b158015610a0257600080fd5b505af1158015610a16573d6000803e3d6000fd5b50505050505050505050565b6000805160206112af833981519152610a3a81610afe565b50600255565b6000918252602082815260408084206001600160a01b0393909316845291905290205460ff1690565b6000805160206112af833981519152610a8181610afe565b50600180546001600160a01b0319166001600160a01b0392909216919091179055565b600082815260208190526040902060010154610abf81610afe565b6104808383610b8f565b60006001600160e01b03198216637965db0b60e01b14806103e257506301ffc9a760e01b6001600160e01b03198316146103e2565b610b088133610cc8565b50565b610b158282610a40565b61057e576000828152602081815260408083206001600160a01b03851684529091529020805460ff19166001179055610b4b3390565b6001600160a01b0316816001600160a01b0316837f2f8788117e7eff1d82e926ec794901d17c78024a50270940304540a733656f0d60405160405180910390a45050565b610b998282610a40565b1561057e576000828152602081815260408083206001600160a01b0385168085529252808320805460ff1916905551339285917ff6391f5c32d9c69d2a47ea670b442974b53935d1edc7fd64eb21e047a839171b9190a45050565b600082610c02868685610d21565b1495945050505050565b610c196006610100611120565b8110610c545760405162461bcd60e51b815260206004820152600a602482015269189859081d1a58dad95d60b21b60448201526064016104cb565b610100810460ff821660008060038460068110610c7357610c73611137565b0154915060018383901c16905080600114610ca157604051632150464360e21b815260040160405180910390fd5b826001901b19821691508160038560068110610cbf57610cbf611137565b01555050505050565b610cd28282610a40565b61057e57610cdf81610d6d565b610cea836020610d7f565b604051602001610cfb9291906111c0565b60408051601f198184030181529082905262461bcd60e51b82526104cb91600401611235565b600081815b84811015610d6457610d5082878784818110610d4457610d44611137565b90506020020135610f22565b915080610d5c81611268565b915050610d26565b50949350505050565b60606103e26001600160a01b03831660145b60606000610d8e836002611120565b610d99906002611189565b67ffffffffffffffff811115610db157610db1611281565b6040519080825280601f01601f191660200182016040528015610ddb576020820181803683370190505b509050600360fc1b81600081518110610df657610df6611137565b60200101906001600160f81b031916908160001a905350600f60fb1b81600181518110610e2557610e25611137565b60200101906001600160f81b031916908160001a9053506000610e49846002611120565b610e54906001611189565b90505b6001811115610ecc576f181899199a1a9b1b9c1cb0b131b232b360811b85600f1660108110610e8857610e88611137565b1a60f81b828281518110610e9e57610e9e611137565b60200101906001600160f81b031916908160001a90535060049490941c93610ec581611297565b9050610e57565b508315610f1b5760405162461bcd60e51b815260206004820181905260248201527f537472696e67733a20686578206c656e67746820696e73756666696369656e7460448201526064016104cb565b9392505050565b6000818310610f3e576000828152602084905260409020610f1b565b6000838152602083905260409020610f1b565b600060208284031215610f6357600080fd5b81356001600160e01b031981168114610f1b57600080fd5b600060208284031215610f8d57600080fd5b5035919050565b80356001600160a01b0381168114610fab57600080fd5b919050565b60008060408385031215610fc357600080fd5b82359150610fd360208401610f94565b90509250929050565b600060208284031215610fee57600080fd5b610f1b82610f94565b60008083601f84011261100957600080fd5b50813567ffffffffffffffff81111561102157600080fd5b6020830191508360208260051b850101111561103c57600080fd5b9250929050565b6000806000806060858703121561105957600080fd5b8435935060208501359250604085013567ffffffffffffffff81111561107e57600080fd5b61108a87828801610ff7565b95989497509550505050565b6000806000806000608086880312156110ae57600080fd5b8535945060208601359350604086013567ffffffffffffffff8111156110d357600080fd5b6110df88828901610ff7565b96999598509660600135949350505050565b60006020828403121561110357600080fd5b5051919050565b634e487b7160e01b600052601160045260246000fd5b80820281158282048414176103e2576103e261110a565b634e487b7160e01b600052603260045260246000fd5b928352601f60fa1b6020840181905260609290921b6bffffffffffffffffffffffff191660218401526035830191909152603682015260560190565b808201808211156103e2576103e261110a565b60005b838110156111b757818101518382015260200161119f565b50506000910152565b7f416363657373436f6e74726f6c3a206163636f756e74200000000000000000008152600083516111f881601785016020880161119c565b7001034b99036b4b9b9b4b733903937b6329607d1b601791840191820152835161122981602884016020880161119c565b01602801949350505050565b602081526000825180602084015261125481604085016020870161119c565b601f01601f19169190910160400192915050565b60006001820161127a5761127a61110a565b5060010190565b634e487b7160e01b600052604160045260246000fd5b6000816112a6576112a661110a565b50600019019056fedf8b4c520ffe197c5343c6f5aec59570151ef9a492f2c624fd45ddde6135ec42a26469706673582212206628bd024cecd56728fd5b5b4070dd1fefb7e0ed166d705e2a2fbd91b950482a64736f6c63430008110033df8b4c520ffe197c5343c6f5aec59570151ef9a492f2c624fd45ddde6135ec42

0x60806040526004361061012a5760003560e01c80633ccfd60b116100ab578063a217fddf1161006f578063a217fddf1461030b578063ab3cb35c14610320578063be7b657314610340578063c662e48114610360578063d547741f1461037b578063ed9ec8881461039b57600080fd5b80633ccfd60b1461029d5780634388d048146102a55780637879d3e1146102b85780637cb64759146102cb57806391d14854146102eb57600080fd5b80632f2ff15d116100f25780632f2ff15d1461020557806332cb6b0c1461022757806334cba5281461023d57806336568abe1461025d5780633ab1a4941461027d57600080fd5b806301ffc9a71461012f5780631581b6001461016457806318160ddd1461019c578063248a9ca3146101bf5780632eb4a7ab146101ef575b600080fd5b34801561013b57600080fd5b5061014f61014a366004610f51565b6103c8565b60405190151581526020015b60405180910390f35b34801561017057600080fd5b50600a54610184906001600160a01b031681565b6040516001600160a01b03909116815260200161015b565b3480156101a857600080fd5b506101b16103e8565b60405190815260200161015b565b3480156101cb57600080fd5b506101b16101da366004610f7b565b60009081526020819052604090206001015490565b3480156101fb57600080fd5b506101b160025481565b34801561021157600080fd5b50610225610220366004610fb0565b61045b565b005b34801561023357600080fd5b506101b161232881565b34801561024957600080fd5b506101b1610258366004610f7b565b610485565b34801561026957600080fd5b50610225610278366004610fb0565b610504565b34801561028957600080fd5b50610225610298366004610fdc565b610582565b6102256105bd565b6102256102b3366004611043565b6106c5565b6102256102c6366004611096565b610851565b3480156102d757600080fd5b506102256102e6366004610f7b565b610a22565b3480156102f757600080fd5b5061014f610306366004610fb0565b610a40565b34801561031757600080fd5b506101b1600081565b34801561032c57600080fd5b5061022561033b366004610fdc565b610a69565b34801561034c57600080fd5b50600154610184906001600160a01b031681565b34801561036c57600080fd5b506101b16611c37937e0800081565b34801561038757600080fd5b50610225610396366004610fb0565b610aa4565b3480156103a757600080fd5b506101b16103b6366004610fdc565b60096020526000908152604090205481565b60006103d382610ac9565b806103e257506103e282610ac9565b92915050565b600154604080516318160ddd60e01b815290516000926001600160a01b0316916318160ddd9160048083019260209291908290030181865afa158015610432573d6000803e3d6000fd5b505050506040513d601f19601f8201168201806040525081019061045691906110f1565b905090565b60008281526020819052604090206001015461047681610afe565b6104808383610b0b565b505050565b60006104946006610100611120565b82106104d45760405162461bcd60e51b815260206004820152600a602482015269189859081d1a58dad95d60b21b60448201526064015b60405180910390fd5b610100820460ff8316600080600384600681106104f3576104f3611137565b015490921c60011695945050505050565b6001600160a01b03811633146105745760405162461bcd60e51b815260206004820152602f60248201527f416363657373436f6e74726f6c3a2063616e206f6e6c792072656e6f756e636560448201526e103937b632b9903337b91039b2b63360891b60648201526084016104cb565b61057e8282610b8f565b5050565b6000805160206112af83398151915261059a81610afe565b50600a80546001600160a01b0319166001600160a01b0392909216919091179055565b6000805160206112af8339815191526105d581610afe565b600a546001600160a01b031661062d5760405162461bcd60e51b815260206004820152601a60248201527f7769746864726177416464726573732063616e2774206265203000000000000060448201526064016104cb565b600a546040516000916001600160a01b03169047908381818185875af1925050503d806000811461067a576040519150601f19603f3d011682016040523d82523d6000602084013e61067f565b606091505b505090508061057e5760405162461bcd60e51b81526020600482015260126024820152716661696c656420746f20776974686472617760701b60448201526064016104cb565b3233146106e557604051635617179b60e11b815260040160405180910390fd5b336000908152600960205260409020541561071357604051632150464360e21b815260040160405180910390fd5b600084338560405160200161072a9392919061114d565b604051602081830303815290604052805190602001209050610750838360025484610bf4565b61076d5760405163582f497d60e11b815260040160405180910390fd5b34158061078957506107866611c37937e0800085611120565b34105b156107a957604051638228b9cb60e01b81523460048201526024016104cb565b6123286107b46103e8565b6107be9086611189565b11156107dd57604051638353b89160e01b815260040160405180910390fd5b6107e685610c0c565b6001546040516340c10f1960e01b8152336004820152602481018690526001600160a01b03909116906340c10f1990604401600060405180830381600087803b15801561083257600080fd5b505af1158015610846573d6000803e3d6000fd5b505050505050505050565b32331461087157604051635617179b60e11b815260040160405180910390fd5b61087a85610485565b60011461089a57604051632150464360e21b815260040160405180910390fd5b60008533866040516020016108b19392919061114d565b6040516020818303038152906040528051906020012090506108d7848460025484610bf4565b6108f45760405163582f497d60e11b815260040160405180910390fd5b341580610910575061090d6611c37937e0800083611120565b34105b1561093057604051638228b9cb60e01b81523460048201526024016104cb565b61232861093b6103e8565b6109459084611189565b111561096457604051638353b89160e01b815260040160405180910390fd5b336000908152600960205260409020548590610981908490611189565b11156109a057604051632150464360e21b815260040160405180910390fd5b336000818152600960205260409081902080548501905560015490516340c10f1960e01b81526004810192909252602482018490526001600160a01b0316906340c10f1990604401600060405180830381600087803b158015610a0257600080fd5b505af1158015610a16573d6000803e3d6000fd5b50505050505050505050565b6000805160206112af833981519152610a3a81610afe565b50600255565b6000918252602082815260408084206001600160a01b0393909316845291905290205460ff1690565b6000805160206112af833981519152610a8181610afe565b50600180546001600160a01b0319166001600160a01b0392909216919091179055565b600082815260208190526040902060010154610abf81610afe565b6104808383610b8f565b60006001600160e01b03198216637965db0b60e01b14806103e257506301ffc9a760e01b6001600160e01b03198316146103e2565b610b088133610cc8565b50565b610b158282610a40565b61057e576000828152602081815260408083206001600160a01b03851684529091529020805460ff19166001179055610b4b3390565b6001600160a01b0316816001600160a01b0316837f2f8788117e7eff1d82e926ec794901d17c78024a50270940304540a733656f0d60405160405180910390a45050565b610b998282610a40565b1561057e576000828152602081815260408083206001600160a01b0385168085529252808320805460ff1916905551339285917ff6391f5c32d9c69d2a47ea670b442974b53935d1edc7fd64eb21e047a839171b9190a45050565b600082610c02868685610d21565b1495945050505050565b610c196006610100611120565b8110610c545760405162461bcd60e51b815260206004820152600a602482015269189859081d1a58dad95d60b21b60448201526064016104cb565b610100810460ff821660008060038460068110610c7357610c73611137565b0154915060018383901c16905080600114610ca157604051632150464360e21b815260040160405180910390fd5b826001901b19821691508160038560068110610cbf57610cbf611137565b01555050505050565b610cd28282610a40565b61057e57610cdf81610d6d565b610cea836020610d7f565b604051602001610cfb9291906111c0565b60408051601f198184030181529082905262461bcd60e51b82526104cb91600401611235565b600081815b84811015610d6457610d5082878784818110610d4457610d44611137565b90506020020135610f22565b915080610d5c81611268565b915050610d26565b50949350505050565b60606103e26001600160a01b03831660145b60606000610d8e836002611120565b610d99906002611189565b67ffffffffffffffff811115610db157610db1611281565b6040519080825280601f01601f191660200182016040528015610ddb576020820181803683370190505b509050600360fc1b81600081518110610df657610df6611137565b60200101906001600160f81b031916908160001a905350600f60fb1b81600181518110610e2557610e25611137565b60200101906001600160f81b031916908160001a9053506000610e49846002611120565b610e54906001611189565b90505b6001811115610ecc576f181899199a1a9b1b9c1cb0b131b232b360811b85600f1660108110610e8857610e88611137565b1a60f81b828281518110610e9e57610e9e611137565b60200101906001600160f81b031916908160001a90535060049490941c93610ec581611297565b9050610e57565b508315610f1b5760405162461bcd60e51b815260206004820181905260248201527f537472696e67733a20686578206c656e67746820696e73756666696369656e7460448201526064016104cb565b9392505050565b6000818310610f3e576000828152602084905260409020610f1b565b6000838152602083905260409020610f1b565b600060208284031215610f6357600080fd5b81356001600160e01b031981168114610f1b57600080fd5b600060208284031215610f8d57600080fd5b5035919050565b80356001600160a01b0381168114610fab57600080fd5b919050565b60008060408385031215610fc357600080fd5b82359150610fd360208401610f94565b90509250929050565b600060208284031215610fee57600080fd5b610f1b82610f94565b60008083601f84011261100957600080fd5b50813567ffffffffffffffff81111561102157600080fd5b6020830191508360208260051b850101111561103c57600080fd5b9250929050565b6000806000806060858703121561105957600080fd5b8435935060208501359250604085013567ffffffffffffffff81111561107e57600080fd5b61108a87828801610ff7565b95989497509550505050565b6000806000806000608086880312156110ae57600080fd5b8535945060208601359350604086013567ffffffffffffffff8111156110d357600080fd5b6110df88828901610ff7565b96999598509660600135949350505050565b60006020828403121561110357600080fd5b5051919050565b634e487b7160e01b600052601160045260246000fd5b80820281158282048414176103e2576103e261110a565b634e487b7160e01b600052603260045260246000fd5b928352601f60fa1b6020840181905260609290921b6bffffffffffffffffffffffff191660218401526035830191909152603682015260560190565b808201808211156103e2576103e261110a565b60005b838110156111b757818101518382015260200161119f565b50506000910152565b7f416363657373436f6e74726f6c3a206163636f756e74200000000000000000008152600083516111f881601785016020880161119c565b7001034b99036b4b9b9b4b733903937b6329607d1b601791840191820152835161122981602884016020880161119c565b01602801949350505050565b602081526000825180602084015261125481604085016020870161119c565b601f01601f19169190910160400192915050565b60006001820161127a5761127a61110a565b5060010190565b634e487b7160e01b600052604160045260246000fd5b6000816112a6576112a661110a565b50600019019056fedf8b4c520ffe197c5343c6f5aec59570151ef9a492f2c624fd45ddde6135ec42a26469706673582212206628bd024cecd56728fd5b5b4070dd1fefb7e0ed166d705e2a2fbd91b950482a64736f6c63430008110033