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

import "./HACHI.sol";
import "@openzeppelin/contracts/access/Ownable.sol";
import "./signature/SignatureVerify.sol";

    error ClaimingIsFinished();
    error ClaimingPhaseNotStarted();
    error ClaimingPhaseForSystemNotStarted();

contract Vesting is Ownable, SignatureVerify {
    uint8 private constant MAX_LOCK_PERIODS_BY_SYSTEM = 6;
    uint32 private constant LOCK_PERIOD = 30 days;
    uint32 private constant PERCENTAGE_SHARE = 33_00000;
    uint32 private constant MAX_PERCENTAGE_SHARE = 100_00000;

    uint32 public immutable claimStartDate;

    uint256 public vestingTotalSupply;
    bool public isFinishedClaiming;

    HACHI public hachiToken;

    mapping(address => uint8) public numberOfTimesClaimedByAddress;

    modifier onlyIfClaimingIsNotFinished() {
        if (isFinishedClaiming) {
            revert ClaimingIsFinished();
        }
        _;
    }

    constructor(uint256 initialSupply, address signer,uint32 startDate) SignatureVerify(signer) {
        vestingTotalSupply = initialSupply;
        claimStartDate = startDate;
    }

    /**
     * @notice initVestingAddress a function for init vesting contract.
     */
    function initVestingAddress(address _hachiAddress) public onlyOwner {
        hachiToken = HACHI(_hachiAddress);
    }

    /**
     * @notice claimByUser function for users.
     * @dev Function for sending erc20 tokens
     * @param amount the sum of all tokens that can be claimed by the user
     * @param signature signature of system
     */
    function claimByUser(uint256 amount, bytes calldata signature)
    public
    onlyIfClaimingIsNotFinished
    {
        checkClaimRequest(_msgSender(), address(this), amount, signature);

        uint256 availableTokensForClaim = getAvailableTokenForClaim(amount);

        if (availableTokensForClaim <= 0) {
            revert ClaimingPhaseNotStarted();
        }
        numberOfTimesClaimedByAddress[_msgSender()] = getCurrenClaimPhase();

        hachiToken.transfer(_msgSender(), availableTokensForClaim);
    }

    /**
     * @notice claimBySystem a function that allows all tokens to be claimed after 6 months by the system.
     */
    function claimBySystem() public onlyOwner onlyIfClaimingIsNotFinished {
        isFinishedClaiming = true;

        uint256 allowedTime = claimStartDate +
        (LOCK_PERIOD * MAX_LOCK_PERIODS_BY_SYSTEM);

        if (allowedTime > block.timestamp) {
            revert ClaimingPhaseForSystemNotStarted();
        }

        uint256 balanceOfTokens = hachiToken.balanceOf(address(this));
        hachiToken.transfer(_msgSender(), balanceOfTokens);
    }

    /**
     * @notice getCurrenClaimPhase returns the current month for the users claim.
     * @return returns the current month for the users claim.
     */
    function getCurrenClaimPhase() public view returns (uint8) {
        if (block.timestamp > claimStartDate + LOCK_PERIOD * 3) {
            return 3;
        } else if (block.timestamp > claimStartDate + LOCK_PERIOD * 2) {
            return 2;
        } else if (block.timestamp > claimStartDate + LOCK_PERIOD) {
            return 1;
        } else return 0;
    }

    /**
     * @notice getAvailableTokenForClaim returns the possible number of tokens for claim.
     * @param amount total number for claim of user
     * @return returns the possible number of tokens for claim
     */
    function getAvailableTokenForClaim(uint256 amount)
    public
    view
    returns (uint256)
    {
        uint8 allowedPhasesQuantity = getCurrenClaimPhase() -
        numberOfTimesClaimedByAddress[_msgSender()];
        if (allowedPhasesQuantity <= 0) {
            return 0;
        }
        return getPercentageShare(amount, allowedPhasesQuantity);
    }

    /**
     * @notice getAlreadyClaimedTokens returns the number of tokens that the user has already branded.
     * @param amount total number for claim of user
     * @return the number of tokens that the user has already branded
     */
    function getAlreadyClaimedTokens(uint256 amount)
    public
    view
    returns (uint256)
    {
        uint8 alreadyClaimed = numberOfTimesClaimedByAddress[_msgSender()];
        if (alreadyClaimed == 0) {
            return 0;
        } else if (alreadyClaimed == 3) {
            return amount;
        } else {
            return getPercentByMonth(amount, alreadyClaimed);
        }
    }

    /**
     * @notice getLockedTokens returns the number of tokens that are currently blocked.
     * @param amount total number for claim of user
     * @return the number of tokens that are currently blocked
     */
    function getLockedTokens(uint256 amount) public view returns (uint256) {
        uint256 lockedTokens = amount -
        getAvailableTokenForClaim(amount) -
        getAlreadyClaimedTokens(amount);
        return lockedTokens;
    }

    /**
     * @notice getPercentageShare returns the percentage of a number.
     * @param totalCount total number for claim of user
     * @param allowedPhasesQuantity number of available phases
     * @return returns the percentage of a number
     */
    function getPercentageShare(uint256 totalCount, uint8 allowedPhasesQuantity)
    internal
    view
    returns (uint256)
    {
        if (getCurrenClaimPhase() == 3 && allowedPhasesQuantity == 3) {
            return totalCount;
        } else if (getCurrenClaimPhase() == 3 && allowedPhasesQuantity == 2) {
            return totalCount - getPercentByMonth(totalCount, 1);
        } else if (getCurrenClaimPhase() == 3 && allowedPhasesQuantity == 1) {
            return totalCount - getPercentByMonth(totalCount, 2);
        }
        return getPercentByMonth(totalCount, allowedPhasesQuantity);
    }

    /**
     * @notice getPercentByMonth return percent share by month.
     * @param totalCount total number for claim of user
     * @param monthNumber month number for claim
     * @return percent share by month
     */
    function getPercentByMonth(uint256 totalCount, uint8 monthNumber)
    private
    pure
    returns (uint256)
    {
        return
        (totalCount * PERCENTAGE_SHARE * monthNumber) /
        MAX_PERCENTAGE_SHARE;
    }
}

// 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) (token/ERC20/ERC20.sol)

pragma solidity ^0.8.0;

import "./IERC20.sol";
import "./extensions/IERC20Metadata.sol";
import "../../utils/Context.sol";

/**
 * @dev Implementation of the {IERC20} interface.
 *
 * This implementation is agnostic to the way tokens are created. This means
 * that a supply mechanism has to be added in a derived contract using {_mint}.
 * For a generic mechanism see {ERC20PresetMinterPauser}.
 *
 * TIP: For a detailed writeup see our guide
 * https://forum.openzeppelin.com/t/how-to-implement-erc20-supply-mechanisms/226[How
 * to implement supply mechanisms].
 *
 * We have followed general OpenZeppelin Contracts guidelines: functions revert
 * instead returning `false` on failure. This behavior is nonetheless
 * conventional and does not conflict with the expectations of ERC20
 * applications.
 *
 * Additionally, an {Approval} event is emitted on calls to {transferFrom}.
 * This allows applications to reconstruct the allowance for all accounts just
 * by listening to said events. Other implementations of the EIP may not emit
 * these events, as it isn't required by the specification.
 *
 * Finally, the non-standard {decreaseAllowance} and {increaseAllowance}
 * functions have been added to mitigate the well-known issues around setting
 * allowances. See {IERC20-approve}.
 */
contract ERC20 is Context, IERC20, IERC20Metadata {
    mapping(address => uint256) private _balances;

    mapping(address => mapping(address => uint256)) private _allowances;

    uint256 private _totalSupply;

    string private _name;
    string private _symbol;

    /**
     * @dev Sets the values for {name} and {symbol}.
     *
     * The default value of {decimals} is 18. To select a different value for
     * {decimals} you should overload it.
     *
     * All two of these values are immutable: they can only be set once during
     * construction.
     */
    constructor(string memory name_, string memory symbol_) {
        _name = name_;
        _symbol = symbol_;
    }

    /**
     * @dev Returns the name of the token.
     */
    function name() public view virtual override returns (string memory) {
        return _name;
    }

    /**
     * @dev Returns the symbol of the token, usually a shorter version of the
     * name.
     */
    function symbol() public view virtual override returns (string memory) {
        return _symbol;
    }

    /**
     * @dev Returns the number of decimals used to get its user representation.
     * For example, if `decimals` equals `2`, a balance of `505` tokens should
     * be displayed to a user as `5.05` (`505 / 10 ** 2`).
     *
     * Tokens usually opt for a value of 18, imitating the relationship between
     * Ether and Wei. This is the value {ERC20} uses, unless this function is
     * overridden;
     *
     * NOTE: This information is only used for _display_ purposes: it in
     * no way affects any of the arithmetic of the contract, including
     * {IERC20-balanceOf} and {IERC20-transfer}.
     */
    function decimals() public view virtual override returns (uint8) {
        return 18;
    }

    /**
     * @dev See {IERC20-totalSupply}.
     */
    function totalSupply() public view virtual override returns (uint256) {
        return _totalSupply;
    }

    /**
     * @dev See {IERC20-balanceOf}.
     */
    function balanceOf(address account) public view virtual override returns (uint256) {
        return _balances[account];
    }

    /**
     * @dev See {IERC20-transfer}.
     *
     * Requirements:
     *
     * - `to` cannot be the zero address.
     * - the caller must have a balance of at least `amount`.
     */
    function transfer(address to, uint256 amount) public virtual override returns (bool) {
        address owner = _msgSender();
        _transfer(owner, to, amount);
        return true;
    }

    /**
     * @dev See {IERC20-allowance}.
     */
    function allowance(address owner, address spender) public view virtual override returns (uint256) {
        return _allowances[owner][spender];
    }

    /**
     * @dev See {IERC20-approve}.
     *
     * NOTE: If `amount` is the maximum `uint256`, the allowance is not updated on
     * `transferFrom`. This is semantically equivalent to an infinite approval.
     *
     * Requirements:
     *
     * - `spender` cannot be the zero address.
     */
    function approve(address spender, uint256 amount) public virtual override returns (bool) {
        address owner = _msgSender();
        _approve(owner, spender, amount);
        return true;
    }

    /**
     * @dev See {IERC20-transferFrom}.
     *
     * Emits an {Approval} event indicating the updated allowance. This is not
     * required by the EIP. See the note at the beginning of {ERC20}.
     *
     * NOTE: Does not update the allowance if the current allowance
     * is the maximum `uint256`.
     *
     * Requirements:
     *
     * - `from` and `to` cannot be the zero address.
     * - `from` must have a balance of at least `amount`.
     * - the caller must have allowance for ``from``'s tokens of at least
     * `amount`.
     */
    function transferFrom(
        address from,
        address to,
        uint256 amount
    ) public virtual override returns (bool) {
        address spender = _msgSender();
        _spendAllowance(from, spender, amount);
        _transfer(from, to, amount);
        return true;
    }

    /**
     * @dev Atomically increases the allowance granted to `spender` by the caller.
     *
     * This is an alternative to {approve} that can be used as a mitigation for
     * problems described in {IERC20-approve}.
     *
     * Emits an {Approval} event indicating the updated allowance.
     *
     * Requirements:
     *
     * - `spender` cannot be the zero address.
     */
    function increaseAllowance(address spender, uint256 addedValue) public virtual returns (bool) {
        address owner = _msgSender();
        _approve(owner, spender, allowance(owner, spender) + addedValue);
        return true;
    }

    /**
     * @dev Atomically decreases the allowance granted to `spender` by the caller.
     *
     * This is an alternative to {approve} that can be used as a mitigation for
     * problems described in {IERC20-approve}.
     *
     * Emits an {Approval} event indicating the updated allowance.
     *
     * Requirements:
     *
     * - `spender` cannot be the zero address.
     * - `spender` must have allowance for the caller of at least
     * `subtractedValue`.
     */
    function decreaseAllowance(address spender, uint256 subtractedValue) public virtual returns (bool) {
        address owner = _msgSender();
        uint256 currentAllowance = allowance(owner, spender);
        require(currentAllowance >= subtractedValue, "ERC20: decreased allowance below zero");
        unchecked {
            _approve(owner, spender, currentAllowance - subtractedValue);
        }

        return true;
    }

    /**
     * @dev Moves `amount` of tokens from `from` to `to`.
     *
     * This internal function is equivalent to {transfer}, and can be used to
     * e.g. implement automatic token fees, slashing mechanisms, etc.
     *
     * Emits a {Transfer} event.
     *
     * Requirements:
     *
     * - `from` cannot be the zero address.
     * - `to` cannot be the zero address.
     * - `from` must have a balance of at least `amount`.
     */
    function _transfer(
        address from,
        address to,
        uint256 amount
    ) internal virtual {
        require(from != address(0), "ERC20: transfer from the zero address");
        require(to != address(0), "ERC20: transfer to the zero address");

        _beforeTokenTransfer(from, to, amount);

        uint256 fromBalance = _balances[from];
        require(fromBalance >= amount, "ERC20: transfer amount exceeds balance");
        unchecked {
            _balances[from] = fromBalance - amount;
            // Overflow not possible: the sum of all balances is capped by totalSupply, and the sum is preserved by
            // decrementing then incrementing.
            _balances[to] += amount;
        }

        emit Transfer(from, to, amount);

        _afterTokenTransfer(from, to, amount);
    }

    /** @dev Creates `amount` tokens and assigns them to `account`, increasing
     * the total supply.
     *
     * Emits a {Transfer} event with `from` set to the zero address.
     *
     * Requirements:
     *
     * - `account` cannot be the zero address.
     */
    function _mint(address account, uint256 amount) internal virtual {
        require(account != address(0), "ERC20: mint to the zero address");

        _beforeTokenTransfer(address(0), account, amount);

        _totalSupply += amount;
        unchecked {
            // Overflow not possible: balance + amount is at most totalSupply + amount, which is checked above.
            _balances[account] += amount;
        }
        emit Transfer(address(0), account, amount);

        _afterTokenTransfer(address(0), account, amount);
    }

    /**
     * @dev Destroys `amount` tokens from `account`, reducing the
     * total supply.
     *
     * Emits a {Transfer} event with `to` set to the zero address.
     *
     * Requirements:
     *
     * - `account` cannot be the zero address.
     * - `account` must have at least `amount` tokens.
     */
    function _burn(address account, uint256 amount) internal virtual {
        require(account != address(0), "ERC20: burn from the zero address");

        _beforeTokenTransfer(account, address(0), amount);

        uint256 accountBalance = _balances[account];
        require(accountBalance >= amount, "ERC20: burn amount exceeds balance");
        unchecked {
            _balances[account] = accountBalance - amount;
            // Overflow not possible: amount <= accountBalance <= totalSupply.
            _totalSupply -= amount;
        }

        emit Transfer(account, address(0), amount);

        _afterTokenTransfer(account, address(0), amount);
    }

    /**
     * @dev Sets `amount` as the allowance of `spender` over the `owner` s tokens.
     *
     * This internal function is equivalent to `approve`, and can be used to
     * e.g. set automatic allowances for certain subsystems, etc.
     *
     * Emits an {Approval} event.
     *
     * Requirements:
     *
     * - `owner` cannot be the zero address.
     * - `spender` cannot be the zero address.
     */
    function _approve(
        address owner,
        address spender,
        uint256 amount
    ) internal virtual {
        require(owner != address(0), "ERC20: approve from the zero address");
        require(spender != address(0), "ERC20: approve to the zero address");

        _allowances[owner][spender] = amount;
        emit Approval(owner, spender, amount);
    }

    /**
     * @dev Updates `owner` s allowance for `spender` based on spent `amount`.
     *
     * Does not update the allowance amount in case of infinite allowance.
     * Revert if not enough allowance is available.
     *
     * Might emit an {Approval} event.
     */
    function _spendAllowance(
        address owner,
        address spender,
        uint256 amount
    ) internal virtual {
        uint256 currentAllowance = allowance(owner, spender);
        if (currentAllowance != type(uint256).max) {
            require(currentAllowance >= amount, "ERC20: insufficient allowance");
            unchecked {
                _approve(owner, spender, currentAllowance - amount);
            }
        }
    }

    /**
     * @dev Hook that is called before any transfer of tokens. This includes
     * minting and burning.
     *
     * Calling conditions:
     *
     * - when `from` and `to` are both non-zero, `amount` of ``from``'s tokens
     * will be transferred to `to`.
     * - when `from` is zero, `amount` tokens will be minted for `to`.
     * - when `to` is zero, `amount` of ``from``'s tokens will be burned.
     * - `from` and `to` are never both zero.
     *
     * To learn more about hooks, head to xref:ROOT:extending-contracts.adoc#using-hooks[Using Hooks].
     */
    function _beforeTokenTransfer(
        address from,
        address to,
        uint256 amount
    ) internal virtual {}

    /**
     * @dev Hook that is called after any transfer of tokens. This includes
     * minting and burning.
     *
     * Calling conditions:
     *
     * - when `from` and `to` are both non-zero, `amount` of ``from``'s tokens
     * has been transferred to `to`.
     * - when `from` is zero, `amount` tokens have been minted for `to`.
     * - when `to` is zero, `amount` of ``from``'s tokens have been burned.
     * - `from` and `to` are never both zero.
     *
     * To learn more about hooks, head to xref:ROOT:extending-contracts.adoc#using-hooks[Using Hooks].
     */
    function _afterTokenTransfer(
        address from,
        address to,
        uint256 amount
    ) internal virtual {}
}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts v4.4.1 (token/ERC20/extensions/IERC20Metadata.sol)

pragma solidity ^0.8.0;

import "../IERC20.sol";

/**
 * @dev Interface for the optional metadata functions from the ERC20 standard.
 *
 * _Available since v4.1._
 */
interface IERC20Metadata is IERC20 {
    /**
     * @dev Returns the name of the token.
     */
    function name() external view returns (string memory);

    /**
     * @dev Returns the symbol of the token.
     */
    function symbol() external view returns (string memory);

    /**
     * @dev Returns the decimals places of the token.
     */
    function decimals() external view returns (uint8);
}

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

pragma solidity ^0.8.0;

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

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

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

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

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

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

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

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

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

pragma solidity ^0.8.0;

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

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

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

pragma solidity ^0.8.0;

import "../Strings.sol";

/**
 * @dev Elliptic Curve Digital Signature Algorithm (ECDSA) operations.
 *
 * These functions can be used to verify that a message was signed by the holder
 * of the private keys of a given address.
 */
library ECDSA {
    enum RecoverError {
        NoError,
        InvalidSignature,
        InvalidSignatureLength,
        InvalidSignatureS,
        InvalidSignatureV // Deprecated in v4.8
    }

    function _throwError(RecoverError error) private pure {
        if (error == RecoverError.NoError) {
            return; // no error: do nothing
        } else if (error == RecoverError.InvalidSignature) {
            revert("ECDSA: invalid signature");
        } else if (error == RecoverError.InvalidSignatureLength) {
            revert("ECDSA: invalid signature length");
        } else if (error == RecoverError.InvalidSignatureS) {
            revert("ECDSA: invalid signature 's' value");
        }
    }

    /**
     * @dev Returns the address that signed a hashed message (`hash`) with
     * `signature` or error string. This address can then be used for verification purposes.
     *
     * The `ecrecover` EVM opcode allows for malleable (non-unique) signatures:
     * this function rejects them by requiring the `s` value to be in the lower
     * half order, and the `v` value to be either 27 or 28.
     *
     * IMPORTANT: `hash` _must_ be the result of a hash operation for the
     * verification to be secure: it is possible to craft signatures that
     * recover to arbitrary addresses for non-hashed data. A safe way to ensure
     * this is by receiving a hash of the original message (which may otherwise
     * be too long), and then calling {toEthSignedMessageHash} on it.
     *
     * Documentation for signature generation:
     * - with https://web3js.readthedocs.io/en/v1.3.4/web3-eth-accounts.html#sign[Web3.js]
     * - with https://docs.ethers.io/v5/api/signer/#Signer-signMessage[ethers]
     *
     * _Available since v4.3._
     */
    function tryRecover(bytes32 hash, bytes memory signature) internal pure returns (address, RecoverError) {
        if (signature.length == 65) {
            bytes32 r;
            bytes32 s;
            uint8 v;
            // ecrecover takes the signature parameters, and the only way to get them
            // currently is to use assembly.
            /// @solidity memory-safe-assembly
            assembly {
                r := mload(add(signature, 0x20))
                s := mload(add(signature, 0x40))
                v := byte(0, mload(add(signature, 0x60)))
            }
            return tryRecover(hash, v, r, s);
        } else {
            return (address(0), RecoverError.InvalidSignatureLength);
        }
    }

    /**
     * @dev Returns the address that signed a hashed message (`hash`) with
     * `signature`. This address can then be used for verification purposes.
     *
     * The `ecrecover` EVM opcode allows for malleable (non-unique) signatures:
     * this function rejects them by requiring the `s` value to be in the lower
     * half order, and the `v` value to be either 27 or 28.
     *
     * IMPORTANT: `hash` _must_ be the result of a hash operation for the
     * verification to be secure: it is possible to craft signatures that
     * recover to arbitrary addresses for non-hashed data. A safe way to ensure
     * this is by receiving a hash of the original message (which may otherwise
     * be too long), and then calling {toEthSignedMessageHash} on it.
     */
    function recover(bytes32 hash, bytes memory signature) internal pure returns (address) {
        (address recovered, RecoverError error) = tryRecover(hash, signature);
        _throwError(error);
        return recovered;
    }

    /**
     * @dev Overload of {ECDSA-tryRecover} that receives the `r` and `vs` short-signature fields separately.
     *
     * See https://eips.ethereum.org/EIPS/eip-2098[EIP-2098 short signatures]
     *
     * _Available since v4.3._
     */
    function tryRecover(
        bytes32 hash,
        bytes32 r,
        bytes32 vs
    ) internal pure returns (address, RecoverError) {
        bytes32 s = vs & bytes32(0x7fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff);
        uint8 v = uint8((uint256(vs) >> 255) + 27);
        return tryRecover(hash, v, r, s);
    }

    /**
     * @dev Overload of {ECDSA-recover} that receives the `r and `vs` short-signature fields separately.
     *
     * _Available since v4.2._
     */
    function recover(
        bytes32 hash,
        bytes32 r,
        bytes32 vs
    ) internal pure returns (address) {
        (address recovered, RecoverError error) = tryRecover(hash, r, vs);
        _throwError(error);
        return recovered;
    }

    /**
     * @dev Overload of {ECDSA-tryRecover} that receives the `v`,
     * `r` and `s` signature fields separately.
     *
     * _Available since v4.3._
     */
    function tryRecover(
        bytes32 hash,
        uint8 v,
        bytes32 r,
        bytes32 s
    ) internal pure returns (address, RecoverError) {
        // EIP-2 still allows signature malleability for ecrecover(). Remove this possibility and make the signature
        // unique. Appendix F in the Ethereum Yellow paper (https://ethereum.github.io/yellowpaper/paper.pdf), defines
        // the valid range for s in (301): 0 < s < secp256k1n ÷ 2 + 1, and for v in (302): v ∈ {27, 28}. Most
        // signatures from current libraries generate a unique signature with an s-value in the lower half order.
        //
        // If your library generates malleable signatures, such as s-values in the upper range, calculate a new s-value
        // with 0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEBAAEDCE6AF48A03BBFD25E8CD0364141 - s1 and flip v from 27 to 28 or
        // vice versa. If your library also generates signatures with 0/1 for v instead 27/28, add 27 to v to accept
        // these malleable signatures as well.
        if (uint256(s) > 0x7FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF5D576E7357A4501DDFE92F46681B20A0) {
            return (address(0), RecoverError.InvalidSignatureS);
        }

        // If the signature is valid (and not malleable), return the signer address
        address signer = ecrecover(hash, v, r, s);
        if (signer == address(0)) {
            return (address(0), RecoverError.InvalidSignature);
        }

        return (signer, RecoverError.NoError);
    }

    /**
     * @dev Overload of {ECDSA-recover} that receives the `v`,
     * `r` and `s` signature fields separately.
     */
    function recover(
        bytes32 hash,
        uint8 v,
        bytes32 r,
        bytes32 s
    ) internal pure returns (address) {
        (address recovered, RecoverError error) = tryRecover(hash, v, r, s);
        _throwError(error);
        return recovered;
    }

    /**
     * @dev Returns an Ethereum Signed Message, created from a `hash`. This
     * produces hash corresponding to the one signed with the
     * https://eth.wiki/json-rpc/API#eth_sign[`eth_sign`]
     * JSON-RPC method as part of EIP-191.
     *
     * See {recover}.
     */
    function toEthSignedMessageHash(bytes32 hash) internal pure returns (bytes32) {
        // 32 is the length in bytes of hash,
        // enforced by the type signature above
        return keccak256(abi.encodePacked("\x19Ethereum Signed Message:\n32", hash));
    }

    /**
     * @dev Returns an Ethereum Signed Message, created from `s`. This
     * produces hash corresponding to the one signed with the
     * https://eth.wiki/json-rpc/API#eth_sign[`eth_sign`]
     * JSON-RPC method as part of EIP-191.
     *
     * See {recover}.
     */
    function toEthSignedMessageHash(bytes memory s) internal pure returns (bytes32) {
        return keccak256(abi.encodePacked("\x19Ethereum Signed Message:\n", Strings.toString(s.length), s));
    }

    /**
     * @dev Returns an Ethereum Signed Typed Data, created from a
     * `domainSeparator` and a `structHash`. This produces hash corresponding
     * to the one signed with the
     * https://eips.ethereum.org/EIPS/eip-712[`eth_signTypedData`]
     * JSON-RPC method as part of EIP-712.
     *
     * See {recover}.
     */
    function toTypedDataHash(bytes32 domainSeparator, bytes32 structHash) internal pure returns (bytes32) {
        return keccak256(abi.encodePacked("\x19\x01", domainSeparator, structHash));
    }
}

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

import "@openzeppelin/contracts/token/ERC20/ERC20.sol";

contract HACHI is ERC20 {
    constructor(
        string memory name,
        string memory symbol,
        uint256 initialSupply,
        address vestingAddress
    ) ERC20(name, symbol) {
        uint256 amountForOwner = (initialSupply / 100) * 90;
        _mint(msg.sender, amountForOwner);
        _mint(vestingAddress, initialSupply - amountForOwner);
    }
}

// SPDX-License-Identifier: MIT
pragma solidity 0.8.17;

import "@openzeppelin/contracts/utils/cryptography/ECDSA.sol";

contract SignatureVerify {
    address private _systemAddress;

    constructor(address systemAddress_) {
        _systemAddress = systemAddress_;
    }

    function checkClaimRequest(
        address senderAddress,
        address contractAddress,
        uint256 amount,
        bytes calldata signature
    ) internal {
        if (
            !_verify(
                _systemAddress,
                _hash(senderAddress, contractAddress, amount),
                signature
            )
        ) {
            revert("Not auth request");
        }
    }

    function _verify(
        address singerAddress,
        bytes32 hash,
        bytes calldata signature
    ) private pure returns (bool) {
        return singerAddress == ECDSA.recover(hash, signature);
    }

    function _hash(
        address senderAddress,
        address contractAddress,
        uint256 amount
    ) private pure returns (bytes32) {
        return
            ECDSA.toEthSignedMessageHash(
                keccak256(
                    abi.encodePacked(senderAddress, contractAddress, amount)
                )
            );
    }
}

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

• No Contract Security Audit Submitted- Submit Audit Here

[{"inputs":[{"internalType":"uint256","name":"initialSupply","type":"uint256"},{"internalType":"address","name":"signer","type":"address"},{"internalType":"uint32","name":"startDate","type":"uint32"}],"stateMutability":"nonpayable","type":"constructor"},{"inputs":[],"name":"ClaimingIsFinished","type":"error"},{"inputs":[],"name":"ClaimingPhaseForSystemNotStarted","type":"error"},{"inputs":[],"name":"ClaimingPhaseNotStarted","type":"error"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"previousOwner","type":"address"},{"indexed":true,"internalType":"address","name":"newOwner","type":"address"}],"name":"OwnershipTransferred","type":"event"},{"inputs":[],"name":"claimBySystem","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"amount","type":"uint256"},{"internalType":"bytes","name":"signature","type":"bytes"}],"name":"claimByUser","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"claimStartDate","outputs":[{"internalType":"uint32","name":"","type":"uint32"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"amount","type":"uint256"}],"name":"getAlreadyClaimedTokens","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"amount","type":"uint256"}],"name":"getAvailableTokenForClaim","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"getCurrenClaimPhase","outputs":[{"internalType":"uint8","name":"","type":"uint8"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"amount","type":"uint256"}],"name":"getLockedTokens","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"hachiToken","outputs":[{"internalType":"contract HACHI","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"_hachiAddress","type":"address"}],"name":"initVestingAddress","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"isFinishedClaiming","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"","type":"address"}],"name":"numberOfTimesClaimedByAddress","outputs":[{"internalType":"uint8","name":"","type":"uint8"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"owner","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"renounceOwnership","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"newOwner","type":"address"}],"name":"transferOwnership","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"vestingTotalSupply","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"}]

60a060405234801561001057600080fd5b5060405161103a38038061103a83398101604081905261002f916100be565b816100393361006e565b600180546001600160a01b0319166001600160a01b03929092169190911790556002929092555063ffffffff16608052610117565b600080546001600160a01b038381166001600160a01b0319831681178455604051919092169283917f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e09190a35050565b6000806000606084860312156100d357600080fd5b835160208501519093506001600160a01b03811681146100f257600080fd5b604085015190925063ffffffff8116811461010c57600080fd5b809150509250925092565b608051610eec61014e600039600081816101250152818161043f015281816105e30152818161062e015261066e0152610eec6000f3fe608060405234801561001057600080fd5b50600436106100f55760003560e01c8063a069136e11610097578063e3e3fa5111610066578063e3e3fa511461022b578063edabe55a14610234578063f2fde38b14610247578063ff458c251461025a57600080fd5b8063a069136e146101c3578063a6044221146101d6578063beb517bd146101f0578063d68555921461021357600080fd5b80637e678e4d116100d35780637e678e4d1461016657806386ffa12e146101795780638da5cb5b146101815780639217f77a146101a657600080fd5b8063287e754d146100fa5780635f03b6b214610120578063715018a61461015c575b600080fd5b61010d610108366004610ce0565b61026d565b6040519081526020015b60405180910390f35b6101477f000000000000000000000000000000000000000000000000000000000000000081565b60405163ffffffff9091168152602001610117565b6101646102bb565b005b610164610174366004610cf9565b6102cf565b6101646103f0565b6000546001600160a01b03165b6040516001600160a01b039091168152602001610117565b6003546101b39060ff1681565b6040519015158152602001610117565b61010d6101d1366004610ce0565b61058e565b6101de6105cd565b60405160ff9091168152602001610117565b6101de6101fe366004610d75565b60046020526000908152604090205460ff1681565b60035461018e9061010090046001600160a01b031681565b61010d60025481565b610164610242366004610d75565b6106ab565b610164610255366004610d75565b6106db565b61010d610268366004610ce0565b610759565b33600090815260046020526040812054819060ff1661028a6105cd565b6102949190610db4565b905060008160ff16116102aa5750600092915050565b6102b48382610782565b9392505050565b6102c361082b565b6102cd6000610885565b565b60035460ff16156102f35760405163221cc44960e21b815260040160405180910390fd5b61030033308585856108d5565b600061030b8461026d565b90506000811161032e57604051635966404360e01b815260040160405180910390fd5b6103366105cd565b60046000336001600160a01b0390811682526020820192909252604001600020805460ff191660ff939093169290921790915560035461010090041663a9059cbb336040516001600160e01b031960e084901b1681526001600160a01b039091166004820152602481018490526044016020604051808303816000875af11580156103c5573d6000803e3d6000fd5b505050506040513d601f19601f820116820180604052508101906103e99190610dcd565b5050505050565b6103f861082b565b60035460ff161561041c5760405163221cc44960e21b815260040160405180910390fd5b6003805460ff191660011790556000610439600662278d00610def565b610463907f0000000000000000000000000000000000000000000000000000000000000000610e17565b63ffffffff1690504281111561048c57604051630a103e9560e21b815260040160405180910390fd5b6003546040516370a0823160e01b815230600482015260009161010090046001600160a01b0316906370a0823190602401602060405180830381865afa1580156104da573d6000803e3d6000fd5b505050506040513d601f19601f820116820180604052508101906104fe9190610e3b565b60035490915061010090046001600160a01b031663a9059cbb336040516001600160e01b031960e084901b1681526001600160a01b039091166004820152602481018490526044016020604051808303816000875af1158015610565573d6000803e3d6000fd5b505050506040513d601f19601f820116820180604052508101906105899190610dcd565b505050565b3360009081526004602052604081205460ff168082036105b15750600092915050565b8060ff166003036105c3575090919050565b6102b48382610936565b60006105dd62278d006003610def565b610607907f0000000000000000000000000000000000000000000000000000000000000000610e17565b63ffffffff1642111561061a5750600390565b61062862278d006002610def565b610652907f0000000000000000000000000000000000000000000000000000000000000000610e17565b63ffffffff164211156106655750600290565b61069262278d007f0000000000000000000000000000000000000000000000000000000000000000610e17565b63ffffffff164211156106a55750600190565b50600090565b6106b361082b565b600380546001600160a01b0390921661010002610100600160a81b0319909216919091179055565b6106e361082b565b6001600160a01b03811661074d5760405162461bcd60e51b815260206004820152602660248201527f4f776e61626c653a206e6577206f776e657220697320746865207a65726f206160448201526564647265737360d01b60648201526084015b60405180910390fd5b61075681610885565b50565b6000806107658361058e565b61076e8461026d565b6107789085610e54565b6102b49190610e54565b600061078c6105cd565b60ff1660031480156107a157508160ff166003145b156107ad575081610825565b6107b56105cd565b60ff1660031480156107ca57508160ff166002145b156107eb576107da836001610936565b6107e49084610e54565b9050610825565b6107f36105cd565b60ff16600314801561080857508160ff166001145b15610818576107da836002610936565b6108228383610936565b90505b92915050565b6000546001600160a01b031633146102cd5760405162461bcd60e51b815260206004820181905260248201527f4f776e61626c653a2063616c6c6572206973206e6f7420746865206f776e65726044820152606401610744565b600080546001600160a01b038381166001600160a01b0319831681178455604051919092169283917f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e09190a35050565b6001546108f7906001600160a01b03166108f0878787610961565b8484610a09565b6103e95760405162461bcd60e51b815260206004820152601060248201526f139bdd08185d5d1a081c995c5d595cdd60821b6044820152606401610744565b60006298968060ff831661094d62325aa086610e67565b6109579190610e67565b6108229190610e7e565b6040516bffffffffffffffffffffffff19606085811b8216602084015284901b16603482015260488101829052600090610a0190606801604051602081830303815290604052805190602001206040517f19457468657265756d205369676e6564204d6573736167653a0a3332000000006020820152603c8101829052600090605c01604051602081830303815290604052805190602001209050919050565b949350505050565b6000610a4b8484848080601f016020809104026020016040519081016040528093929190818152602001838380828437600092019190915250610a6992505050565b6001600160a01b0316856001600160a01b0316149050949350505050565b6000806000610a788585610a8d565b91509150610a8581610ad2565b509392505050565b6000808251604103610ac35760208301516040840151606085015160001a610ab787828585610c1c565b94509450505050610acb565b506000905060025b9250929050565b6000816004811115610ae657610ae6610ea0565b03610aee5750565b6001816004811115610b0257610b02610ea0565b03610b4f5760405162461bcd60e51b815260206004820152601860248201527f45434453413a20696e76616c6964207369676e617475726500000000000000006044820152606401610744565b6002816004811115610b6357610b63610ea0565b03610bb05760405162461bcd60e51b815260206004820152601f60248201527f45434453413a20696e76616c6964207369676e6174757265206c656e677468006044820152606401610744565b6003816004811115610bc457610bc4610ea0565b036107565760405162461bcd60e51b815260206004820152602260248201527f45434453413a20696e76616c6964207369676e6174757265202773272076616c604482015261756560f01b6064820152608401610744565b6000807f7fffffffffffffffffffffffffffffff5d576e7357a4501ddfe92f46681b20a0831115610c535750600090506003610cd7565b6040805160008082526020820180845289905260ff881692820192909252606081018690526080810185905260019060a0016020604051602081039080840390855afa158015610ca7573d6000803e3d6000fd5b5050604051601f1901519150506001600160a01b038116610cd057600060019250925050610cd7565b9150600090505b94509492505050565b600060208284031215610cf257600080fd5b5035919050565b600080600060408486031215610d0e57600080fd5b83359250602084013567ffffffffffffffff80821115610d2d57600080fd5b818601915086601f830112610d4157600080fd5b813581811115610d5057600080fd5b876020828501011115610d6257600080fd5b6020830194508093505050509250925092565b600060208284031215610d8757600080fd5b81356001600160a01b03811681146102b457600080fd5b634e487b7160e01b600052601160045260246000fd5b60ff828116828216039081111561082557610825610d9e565b600060208284031215610ddf57600080fd5b815180151581146102b457600080fd5b63ffffffff818116838216028082169190828114610e0f57610e0f610d9e565b505092915050565b63ffffffff818116838216019080821115610e3457610e34610d9e565b5092915050565b600060208284031215610e4d57600080fd5b5051919050565b8181038181111561082557610825610d9e565b808202811582820484141761082557610825610d9e565b600082610e9b57634e487b7160e01b600052601260045260246000fd5b500490565b634e487b7160e01b600052602160045260246000fdfea2646970667358221220e9152bc95309e67a938e7fc943d71f1d5d535552a27d2800480a2138a8c803d364736f6c6343000811003300000000000000000000000000000000000000000052b7d2dcc80cd2e40000000000000000000000000000000c93bc0bc6f2d8ebf35525a65579f891f2fa8f6400000000000000000000000000000000000000000000000000000000639a4760

0x608060405234801561001057600080fd5b50600436106100f55760003560e01c8063a069136e11610097578063e3e3fa5111610066578063e3e3fa511461022b578063edabe55a14610234578063f2fde38b14610247578063ff458c251461025a57600080fd5b8063a069136e146101c3578063a6044221146101d6578063beb517bd146101f0578063d68555921461021357600080fd5b80637e678e4d116100d35780637e678e4d1461016657806386ffa12e146101795780638da5cb5b146101815780639217f77a146101a657600080fd5b8063287e754d146100fa5780635f03b6b214610120578063715018a61461015c575b600080fd5b61010d610108366004610ce0565b61026d565b6040519081526020015b60405180910390f35b6101477f00000000000000000000000000000000000000000000000000000000639a476081565b60405163ffffffff9091168152602001610117565b6101646102bb565b005b610164610174366004610cf9565b6102cf565b6101646103f0565b6000546001600160a01b03165b6040516001600160a01b039091168152602001610117565b6003546101b39060ff1681565b6040519015158152602001610117565b61010d6101d1366004610ce0565b61058e565b6101de6105cd565b60405160ff9091168152602001610117565b6101de6101fe366004610d75565b60046020526000908152604090205460ff1681565b60035461018e9061010090046001600160a01b031681565b61010d60025481565b610164610242366004610d75565b6106ab565b610164610255366004610d75565b6106db565b61010d610268366004610ce0565b610759565b33600090815260046020526040812054819060ff1661028a6105cd565b6102949190610db4565b905060008160ff16116102aa5750600092915050565b6102b48382610782565b9392505050565b6102c361082b565b6102cd6000610885565b565b60035460ff16156102f35760405163221cc44960e21b815260040160405180910390fd5b61030033308585856108d5565b600061030b8461026d565b90506000811161032e57604051635966404360e01b815260040160405180910390fd5b6103366105cd565b60046000336001600160a01b0390811682526020820192909252604001600020805460ff191660ff939093169290921790915560035461010090041663a9059cbb336040516001600160e01b031960e084901b1681526001600160a01b039091166004820152602481018490526044016020604051808303816000875af11580156103c5573d6000803e3d6000fd5b505050506040513d601f19601f820116820180604052508101906103e99190610dcd565b5050505050565b6103f861082b565b60035460ff161561041c5760405163221cc44960e21b815260040160405180910390fd5b6003805460ff191660011790556000610439600662278d00610def565b610463907f00000000000000000000000000000000000000000000000000000000639a4760610e17565b63ffffffff1690504281111561048c57604051630a103e9560e21b815260040160405180910390fd5b6003546040516370a0823160e01b815230600482015260009161010090046001600160a01b0316906370a0823190602401602060405180830381865afa1580156104da573d6000803e3d6000fd5b505050506040513d601f19601f820116820180604052508101906104fe9190610e3b565b60035490915061010090046001600160a01b031663a9059cbb336040516001600160e01b031960e084901b1681526001600160a01b039091166004820152602481018490526044016020604051808303816000875af1158015610565573d6000803e3d6000fd5b505050506040513d601f19601f820116820180604052508101906105899190610dcd565b505050565b3360009081526004602052604081205460ff168082036105b15750600092915050565b8060ff166003036105c3575090919050565b6102b48382610936565b60006105dd62278d006003610def565b610607907f00000000000000000000000000000000000000000000000000000000639a4760610e17565b63ffffffff1642111561061a5750600390565b61062862278d006002610def565b610652907f00000000000000000000000000000000000000000000000000000000639a4760610e17565b63ffffffff164211156106655750600290565b61069262278d007f00000000000000000000000000000000000000000000000000000000639a4760610e17565b63ffffffff164211156106a55750600190565b50600090565b6106b361082b565b600380546001600160a01b0390921661010002610100600160a81b0319909216919091179055565b6106e361082b565b6001600160a01b03811661074d5760405162461bcd60e51b815260206004820152602660248201527f4f776e61626c653a206e6577206f776e657220697320746865207a65726f206160448201526564647265737360d01b60648201526084015b60405180910390fd5b61075681610885565b50565b6000806107658361058e565b61076e8461026d565b6107789085610e54565b6102b49190610e54565b600061078c6105cd565b60ff1660031480156107a157508160ff166003145b156107ad575081610825565b6107b56105cd565b60ff1660031480156107ca57508160ff166002145b156107eb576107da836001610936565b6107e49084610e54565b9050610825565b6107f36105cd565b60ff16600314801561080857508160ff166001145b15610818576107da836002610936565b6108228383610936565b90505b92915050565b6000546001600160a01b031633146102cd5760405162461bcd60e51b815260206004820181905260248201527f4f776e61626c653a2063616c6c6572206973206e6f7420746865206f776e65726044820152606401610744565b600080546001600160a01b038381166001600160a01b0319831681178455604051919092169283917f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e09190a35050565b6001546108f7906001600160a01b03166108f0878787610961565b8484610a09565b6103e95760405162461bcd60e51b815260206004820152601060248201526f139bdd08185d5d1a081c995c5d595cdd60821b6044820152606401610744565b60006298968060ff831661094d62325aa086610e67565b6109579190610e67565b6108229190610e7e565b6040516bffffffffffffffffffffffff19606085811b8216602084015284901b16603482015260488101829052600090610a0190606801604051602081830303815290604052805190602001206040517f19457468657265756d205369676e6564204d6573736167653a0a3332000000006020820152603c8101829052600090605c01604051602081830303815290604052805190602001209050919050565b949350505050565b6000610a4b8484848080601f016020809104026020016040519081016040528093929190818152602001838380828437600092019190915250610a6992505050565b6001600160a01b0316856001600160a01b0316149050949350505050565b6000806000610a788585610a8d565b91509150610a8581610ad2565b509392505050565b6000808251604103610ac35760208301516040840151606085015160001a610ab787828585610c1c565b94509450505050610acb565b506000905060025b9250929050565b6000816004811115610ae657610ae6610ea0565b03610aee5750565b6001816004811115610b0257610b02610ea0565b03610b4f5760405162461bcd60e51b815260206004820152601860248201527f45434453413a20696e76616c6964207369676e617475726500000000000000006044820152606401610744565b6002816004811115610b6357610b63610ea0565b03610bb05760405162461bcd60e51b815260206004820152601f60248201527f45434453413a20696e76616c6964207369676e6174757265206c656e677468006044820152606401610744565b6003816004811115610bc457610bc4610ea0565b036107565760405162461bcd60e51b815260206004820152602260248201527f45434453413a20696e76616c6964207369676e6174757265202773272076616c604482015261756560f01b6064820152608401610744565b6000807f7fffffffffffffffffffffffffffffff5d576e7357a4501ddfe92f46681b20a0831115610c535750600090506003610cd7565b6040805160008082526020820180845289905260ff881692820192909252606081018690526080810185905260019060a0016020604051602081039080840390855afa158015610ca7573d6000803e3d6000fd5b5050604051601f1901519150506001600160a01b038116610cd057600060019250925050610cd7565b9150600090505b94509492505050565b600060208284031215610cf257600080fd5b5035919050565b600080600060408486031215610d0e57600080fd5b83359250602084013567ffffffffffffffff80821115610d2d57600080fd5b818601915086601f830112610d4157600080fd5b813581811115610d5057600080fd5b876020828501011115610d6257600080fd5b6020830194508093505050509250925092565b600060208284031215610d8757600080fd5b81356001600160a01b03811681146102b457600080fd5b634e487b7160e01b600052601160045260246000fd5b60ff828116828216039081111561082557610825610d9e565b600060208284031215610ddf57600080fd5b815180151581146102b457600080fd5b63ffffffff818116838216028082169190828114610e0f57610e0f610d9e565b505092915050565b63ffffffff818116838216019080821115610e3457610e34610d9e565b5092915050565b600060208284031215610e4d57600080fd5b5051919050565b8181038181111561082557610825610d9e565b808202811582820484141761082557610825610d9e565b600082610e9b57634e487b7160e01b600052601260045260246000fd5b500490565b634e487b7160e01b600052602160045260246000fdfea2646970667358221220e9152bc95309e67a938e7fc943d71f1d5d535552a27d2800480a2138a8c803d364736f6c63430008110033

00000000000000000000000000000000000000000052b7d2dcc80cd2e40000000000000000000000000000000c93bc0bc6f2d8ebf35525a65579f891f2fa8f6400000000000000000000000000000000000000000000000000000000639a4760

-----Decoded View---------------
Arg [0] : initialSupply (uint256): 100000000000000000000000000
Arg [1] : signer (address): 0x0c93Bc0Bc6f2D8eBF35525A65579F891f2fa8F64
Arg [2] : startDate (uint32): 1671055200

-----Encoded View---------------
3 Constructor Arguments found :
Arg [0] : 00000000000000000000000000000000000000000052b7d2dcc80cd2e4000000
Arg [1] : 0000000000000000000000000c93bc0bc6f2d8ebf35525a65579f891f2fa8f64
Arg [2] : 00000000000000000000000000000000000000000000000000000000639a4760