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: GPL-3.0-or-later
pragma solidity ^0.8.9;

import {IERC20, SafeERC20} from "@openzeppelin/contracts/token/ERC20/utils/SafeERC20.sol";
import {MerkleProof} from "@openzeppelin/contracts/utils/cryptography/MerkleProof.sol";

error AlreadyClaimed();
error InvalidProof();

contract MerkleDistributor {
    using SafeERC20 for IERC20;

    address public token;
    bytes32 public merkleRootVeRetro;
    bytes32 public merkleRootEco;
    address public owner;

    event Claimed(address who, uint256 amount);

    // This is a packed array of booleans.
    mapping(address => bool) private claimed;
    mapping(address => bool) private claimedEco;

    constructor(address token_, bytes32 merkleRootVeRetro_, bytes32 merkleRootEco_) {
        token = token_;
        merkleRootVeRetro = merkleRootVeRetro_;
        merkleRootEco = merkleRootEco_;
        owner = msg.sender;
    }

    modifier onlyOwner(){
        require(msg.sender == owner, "Must be owner");
        _;
    }

    function changeOwner(address _newOwner) public onlyOwner { 
        owner = _newOwner;
    }

    function changeMerkleRoot(bytes32 merkleRootVeRetro_, bytes32 merkleRootEco_) public onlyOwner {
        merkleRootVeRetro = merkleRootVeRetro_;
        merkleRootEco = merkleRootEco_;
    }

    function recoverERC20(address _token, uint256 amount) public onlyOwner {
        IERC20(_token).safeTransfer(owner, amount);
    }

    function isClaimed(bool veretro, address what) public view returns (bool) {
        if(veretro){
            return claimed[what];
        }else{
            return claimedEco[what];
        }
    }

    function _setClaimed(bool veretro, address what) private {
        if(veretro){
            claimed[what] = true;
        }else{
            claimedEco[what] = true;
        }
    }

    function claimVeRetroAirdrop(address receiver, uint256 amount, bytes32[] calldata merkleProof)
        public
    {
        if (isClaimed(true, receiver)) revert AlreadyClaimed();

        // Verify the merkle proof.
        bytes32 leaf = keccak256(bytes.concat(keccak256(abi.encode(receiver, amount))));
        if (!MerkleProof.verify(merkleProof, merkleRootVeRetro, leaf)) revert InvalidProof();

        // Mark it claimed and send the token.
        _setClaimed(true, receiver);
        IERC20(token).safeTransfer(receiver, amount);

        emit Claimed(receiver, amount);
    }

    function claimEcoAirdrop(address receiver, uint256 amount, bytes32[] calldata merkleProof)
        public
    {
        if (isClaimed(false, receiver)) revert AlreadyClaimed();

        // Verify the merkle proof.
        bytes32 leaf = keccak256(bytes.concat(keccak256(abi.encode(receiver, amount))));
        if (!MerkleProof.verify(merkleProof, merkleRootEco, leaf)) revert InvalidProof();

        // Mark it claimed and send the token.
        _setClaimed(false, receiver);
        IERC20(token).safeTransfer(receiver, amount);

        emit Claimed(receiver, amount);
    }
}

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

pragma solidity ^0.8.0;

/**
 * @dev Interface of the ERC20 Permit extension allowing approvals to be made via signatures, as defined in
 * https://eips.ethereum.org/EIPS/eip-2612[EIP-2612].
 *
 * Adds the {permit} method, which can be used to change an account's ERC20 allowance (see {IERC20-allowance}) by
 * presenting a message signed by the account. By not relying on {IERC20-approve}, the token holder account doesn't
 * need to send a transaction, and thus is not required to hold Ether at all.
 */
interface IERC20Permit {
    /**
     * @dev Sets `value` as the allowance of `spender` over ``owner``'s tokens,
     * given ``owner``'s signed approval.
     *
     * IMPORTANT: The same issues {IERC20-approve} has related to transaction
     * ordering also apply here.
     *
     * Emits an {Approval} event.
     *
     * Requirements:
     *
     * - `spender` cannot be the zero address.
     * - `deadline` must be a timestamp in the future.
     * - `v`, `r` and `s` must be a valid `secp256k1` signature from `owner`
     * over the EIP712-formatted function arguments.
     * - the signature must use ``owner``'s current nonce (see {nonces}).
     *
     * For more information on the signature format, see the
     * https://eips.ethereum.org/EIPS/eip-2612#specification[relevant EIP
     * section].
     */
    function permit(
        address owner,
        address spender,
        uint256 value,
        uint256 deadline,
        uint8 v,
        bytes32 r,
        bytes32 s
    ) external;

    /**
     * @dev Returns the current nonce for `owner`. This value must be
     * included whenever a signature is generated for {permit}.
     *
     * Every successful call to {permit} increases ``owner``'s nonce by one. This
     * prevents a signature from being used multiple times.
     */
    function nonces(address owner) external view returns (uint256);

    /**
     * @dev Returns the domain separator used in the encoding of the signature for {permit}, as defined by {EIP712}.
     */
    // solhint-disable-next-line func-name-mixedcase
    function DOMAIN_SEPARATOR() external view returns (bytes32);
}

// 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 (last updated v4.8.0) (token/ERC20/utils/SafeERC20.sol)

pragma solidity ^0.8.0;

import "../IERC20.sol";
import "../extensions/draft-IERC20Permit.sol";
import "../../../utils/Address.sol";

/**
 * @title SafeERC20
 * @dev Wrappers around ERC20 operations that throw on failure (when the token
 * contract returns false). Tokens that return no value (and instead revert or
 * throw on failure) are also supported, non-reverting calls are assumed to be
 * successful.
 * To use this library you can add a `using SafeERC20 for IERC20;` statement to your contract,
 * which allows you to call the safe operations as `token.safeTransfer(...)`, etc.
 */
library SafeERC20 {
    using Address for address;

    function safeTransfer(
        IERC20 token,
        address to,
        uint256 value
    ) internal {
        _callOptionalReturn(token, abi.encodeWithSelector(token.transfer.selector, to, value));
    }

    function safeTransferFrom(
        IERC20 token,
        address from,
        address to,
        uint256 value
    ) internal {
        _callOptionalReturn(token, abi.encodeWithSelector(token.transferFrom.selector, from, to, value));
    }

    /**
     * @dev Deprecated. This function has issues similar to the ones found in
     * {IERC20-approve}, and its usage is discouraged.
     *
     * Whenever possible, use {safeIncreaseAllowance} and
     * {safeDecreaseAllowance} instead.
     */
    function safeApprove(
        IERC20 token,
        address spender,
        uint256 value
    ) internal {
        // safeApprove should only be called when setting an initial allowance,
        // or when resetting it to zero. To increase and decrease it, use
        // 'safeIncreaseAllowance' and 'safeDecreaseAllowance'
        require(
            (value == 0) || (token.allowance(address(this), spender) == 0),
            "SafeERC20: approve from non-zero to non-zero allowance"
        );
        _callOptionalReturn(token, abi.encodeWithSelector(token.approve.selector, spender, value));
    }

    function safeIncreaseAllowance(
        IERC20 token,
        address spender,
        uint256 value
    ) internal {
        uint256 newAllowance = token.allowance(address(this), spender) + value;
        _callOptionalReturn(token, abi.encodeWithSelector(token.approve.selector, spender, newAllowance));
    }

    function safeDecreaseAllowance(
        IERC20 token,
        address spender,
        uint256 value
    ) internal {
        unchecked {
            uint256 oldAllowance = token.allowance(address(this), spender);
            require(oldAllowance >= value, "SafeERC20: decreased allowance below zero");
            uint256 newAllowance = oldAllowance - value;
            _callOptionalReturn(token, abi.encodeWithSelector(token.approve.selector, spender, newAllowance));
        }
    }

    function safePermit(
        IERC20Permit token,
        address owner,
        address spender,
        uint256 value,
        uint256 deadline,
        uint8 v,
        bytes32 r,
        bytes32 s
    ) internal {
        uint256 nonceBefore = token.nonces(owner);
        token.permit(owner, spender, value, deadline, v, r, s);
        uint256 nonceAfter = token.nonces(owner);
        require(nonceAfter == nonceBefore + 1, "SafeERC20: permit did not succeed");
    }

    /**
     * @dev Imitates a Solidity high-level call (i.e. a regular function call to a contract), relaxing the requirement
     * on the return value: the return value is optional (but if data is returned, it must not be false).
     * @param token The token targeted by the call.
     * @param data The call data (encoded using abi.encode or one of its variants).
     */
    function _callOptionalReturn(IERC20 token, bytes memory data) private {
        // We need to perform a low level call here, to bypass Solidity's return data size checking mechanism, since
        // we're implementing it ourselves. We use {Address-functionCall} to perform this call, which verifies that
        // the target address contains contract code and also asserts for success in the low-level call.

        bytes memory returndata = address(token).functionCall(data, "SafeERC20: low-level call failed");
        if (returndata.length > 0) {
            // Return data is optional
            require(abi.decode(returndata, (bool)), "SafeERC20: ERC20 operation did not succeed");
        }
    }
}

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

pragma solidity ^0.8.1;

/**
 * @dev Collection of functions related to the address type
 */
library Address {
    /**
     * @dev Returns true if `account` is a contract.
     *
     * [IMPORTANT]
     * ====
     * It is unsafe to assume that an address for which this function returns
     * false is an externally-owned account (EOA) and not a contract.
     *
     * Among others, `isContract` will return false for the following
     * types of addresses:
     *
     *  - an externally-owned account
     *  - a contract in construction
     *  - an address where a contract will be created
     *  - an address where a contract lived, but was destroyed
     * ====
     *
     * [IMPORTANT]
     * ====
     * You shouldn't rely on `isContract` to protect against flash loan attacks!
     *
     * Preventing calls from contracts is highly discouraged. It breaks composability, breaks support for smart wallets
     * like Gnosis Safe, and does not provide security since it can be circumvented by calling from a contract
     * constructor.
     * ====
     */
    function isContract(address account) internal view returns (bool) {
        // This method relies on extcodesize/address.code.length, which returns 0
        // for contracts in construction, since the code is only stored at the end
        // of the constructor execution.

        return account.code.length > 0;
    }

    /**
     * @dev Replacement for Solidity's `transfer`: sends `amount` wei to
     * `recipient`, forwarding all available gas and reverting on errors.
     *
     * https://eips.ethereum.org/EIPS/eip-1884[EIP1884] increases the gas cost
     * of certain opcodes, possibly making contracts go over the 2300 gas limit
     * imposed by `transfer`, making them unable to receive funds via
     * `transfer`. {sendValue} removes this limitation.
     *
     * https://diligence.consensys.net/posts/2019/09/stop-using-soliditys-transfer-now/[Learn more].
     *
     * IMPORTANT: because control is transferred to `recipient`, care must be
     * taken to not create reentrancy vulnerabilities. Consider using
     * {ReentrancyGuard} or the
     * https://solidity.readthedocs.io/en/v0.5.11/security-considerations.html#use-the-checks-effects-interactions-pattern[checks-effects-interactions pattern].
     */
    function sendValue(address payable recipient, uint256 amount) internal {
        require(address(this).balance >= amount, "Address: insufficient balance");

        (bool success, ) = recipient.call{value: amount}("");
        require(success, "Address: unable to send value, recipient may have reverted");
    }

    /**
     * @dev Performs a Solidity function call using a low level `call`. A
     * plain `call` is an unsafe replacement for a function call: use this
     * function instead.
     *
     * If `target` reverts with a revert reason, it is bubbled up by this
     * function (like regular Solidity function calls).
     *
     * Returns the raw returned data. To convert to the expected return value,
     * use https://solidity.readthedocs.io/en/latest/units-and-global-variables.html?highlight=abi.decode#abi-encoding-and-decoding-functions[`abi.decode`].
     *
     * Requirements:
     *
     * - `target` must be a contract.
     * - calling `target` with `data` must not revert.
     *
     * _Available since v3.1._
     */
    function functionCall(address target, bytes memory data) internal returns (bytes memory) {
        return functionCallWithValue(target, data, 0, "Address: low-level call failed");
    }

    /**
     * @dev Same as {xref-Address-functionCall-address-bytes-}[`functionCall`], but with
     * `errorMessage` as a fallback revert reason when `target` reverts.
     *
     * _Available since v3.1._
     */
    function functionCall(
        address target,
        bytes memory data,
        string memory errorMessage
    ) internal returns (bytes memory) {
        return functionCallWithValue(target, data, 0, errorMessage);
    }

    /**
     * @dev Same as {xref-Address-functionCall-address-bytes-}[`functionCall`],
     * but also transferring `value` wei to `target`.
     *
     * Requirements:
     *
     * - the calling contract must have an ETH balance of at least `value`.
     * - the called Solidity function must be `payable`.
     *
     * _Available since v3.1._
     */
    function functionCallWithValue(
        address target,
        bytes memory data,
        uint256 value
    ) internal returns (bytes memory) {
        return functionCallWithValue(target, data, value, "Address: low-level call with value failed");
    }

    /**
     * @dev Same as {xref-Address-functionCallWithValue-address-bytes-uint256-}[`functionCallWithValue`], but
     * with `errorMessage` as a fallback revert reason when `target` reverts.
     *
     * _Available since v3.1._
     */
    function functionCallWithValue(
        address target,
        bytes memory data,
        uint256 value,
        string memory errorMessage
    ) internal returns (bytes memory) {
        require(address(this).balance >= value, "Address: insufficient balance for call");
        (bool success, bytes memory returndata) = target.call{value: value}(data);
        return verifyCallResultFromTarget(target, success, returndata, errorMessage);
    }

    /**
     * @dev Same as {xref-Address-functionCall-address-bytes-}[`functionCall`],
     * but performing a static call.
     *
     * _Available since v3.3._
     */
    function functionStaticCall(address target, bytes memory data) internal view returns (bytes memory) {
        return functionStaticCall(target, data, "Address: low-level static call failed");
    }

    /**
     * @dev Same as {xref-Address-functionCall-address-bytes-string-}[`functionCall`],
     * but performing a static call.
     *
     * _Available since v3.3._
     */
    function functionStaticCall(
        address target,
        bytes memory data,
        string memory errorMessage
    ) internal view returns (bytes memory) {
        (bool success, bytes memory returndata) = target.staticcall(data);
        return verifyCallResultFromTarget(target, success, returndata, errorMessage);
    }

    /**
     * @dev Same as {xref-Address-functionCall-address-bytes-}[`functionCall`],
     * but performing a delegate call.
     *
     * _Available since v3.4._
     */
    function functionDelegateCall(address target, bytes memory data) internal returns (bytes memory) {
        return functionDelegateCall(target, data, "Address: low-level delegate call failed");
    }

    /**
     * @dev Same as {xref-Address-functionCall-address-bytes-string-}[`functionCall`],
     * but performing a delegate call.
     *
     * _Available since v3.4._
     */
    function functionDelegateCall(
        address target,
        bytes memory data,
        string memory errorMessage
    ) internal returns (bytes memory) {
        (bool success, bytes memory returndata) = target.delegatecall(data);
        return verifyCallResultFromTarget(target, success, returndata, errorMessage);
    }

    /**
     * @dev Tool to verify that a low level call to smart-contract was successful, and revert (either by bubbling
     * the revert reason or using the provided one) in case of unsuccessful call or if target was not a contract.
     *
     * _Available since v4.8._
     */
    function verifyCallResultFromTarget(
        address target,
        bool success,
        bytes memory returndata,
        string memory errorMessage
    ) internal view returns (bytes memory) {
        if (success) {
            if (returndata.length == 0) {
                // only check isContract if the call was successful and the return data is empty
                // otherwise we already know that it was a contract
                require(isContract(target), "Address: call to non-contract");
            }
            return returndata;
        } else {
            _revert(returndata, errorMessage);
        }
    }

    /**
     * @dev Tool to verify that a low level call was successful, and revert if it wasn't, either by bubbling the
     * revert reason or using the provided one.
     *
     * _Available since v4.3._
     */
    function verifyCallResult(
        bool success,
        bytes memory returndata,
        string memory errorMessage
    ) internal pure returns (bytes memory) {
        if (success) {
            return returndata;
        } else {
            _revert(returndata, errorMessage);
        }
    }

    function _revert(bytes memory returndata, string memory errorMessage) private pure {
        // Look for revert reason and bubble it up if present
        if (returndata.length > 0) {
            // The easiest way to bubble the revert reason is using memory via assembly
            /// @solidity memory-safe-assembly
            assembly {
                let returndata_size := mload(returndata)
                revert(add(32, returndata), returndata_size)
            }
        } else {
            revert(errorMessage);
        }
    }
}

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

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

• No Contract Security Audit Submitted- Submit Audit Here

[{"inputs":[{"internalType":"address","name":"token_","type":"address"},{"internalType":"bytes32","name":"merkleRootVeRetro_","type":"bytes32"},{"internalType":"bytes32","name":"merkleRootEco_","type":"bytes32"}],"stateMutability":"nonpayable","type":"constructor"},{"inputs":[],"name":"AlreadyClaimed","type":"error"},{"inputs":[],"name":"InvalidProof","type":"error"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"address","name":"who","type":"address"},{"indexed":false,"internalType":"uint256","name":"amount","type":"uint256"}],"name":"Claimed","type":"event"},{"inputs":[{"internalType":"bytes32","name":"merkleRootVeRetro_","type":"bytes32"},{"internalType":"bytes32","name":"merkleRootEco_","type":"bytes32"}],"name":"changeMerkleRoot","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"_newOwner","type":"address"}],"name":"changeOwner","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"receiver","type":"address"},{"internalType":"uint256","name":"amount","type":"uint256"},{"internalType":"bytes32[]","name":"merkleProof","type":"bytes32[]"}],"name":"claimEcoAirdrop","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"receiver","type":"address"},{"internalType":"uint256","name":"amount","type":"uint256"},{"internalType":"bytes32[]","name":"merkleProof","type":"bytes32[]"}],"name":"claimVeRetroAirdrop","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"bool","name":"veretro","type":"bool"},{"internalType":"address","name":"what","type":"address"}],"name":"isClaimed","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"merkleRootEco","outputs":[{"internalType":"bytes32","name":"","type":"bytes32"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"merkleRootVeRetro","outputs":[{"internalType":"bytes32","name":"","type":"bytes32"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"owner","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"_token","type":"address"},{"internalType":"uint256","name":"amount","type":"uint256"}],"name":"recoverERC20","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"token","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"}]

608060405234801561001057600080fd5b50604051610bb9380380610bb983398101604081905261002f91610066565b600080546001600160a01b039094166001600160a01b031994851617905560019190915560025560038054909116331790556100a9565b60008060006060848603121561007b57600080fd5b83516001600160a01b038116811461009257600080fd5b602085015160409095015190969495509392505050565b610b01806100b86000396000f3fe608060405234801561001057600080fd5b506004361061009e5760003560e01c80638da5cb5b116100665780638da5cb5b1461011d578063956bb61e14610148578063a6f9dae11461015b578063f02e3f7a1461016e578063fc0c546a1461017757600080fd5b80633edc72b0146100a3578063441bd6ea146100bf5780636bffef7d146100e257806382afe379146100f75780638980f11f1461010a575b600080fd5b6100ac60015481565b6040519081526020015b60405180910390f35b6100d26100cd36600461088c565b61018a565b60405190151581526020016100b6565b6100f56100f03660046108c1565b6101d8565b005b6100f56101053660046108e3565b610216565b6100f561011836600461096d565b610349565b600354610130906001600160a01b031681565b6040516001600160a01b0390911681526020016100b6565b6100f56101563660046108e3565b610391565b6100f5610169366004610997565b61046d565b6100ac60025481565b600054610130906001600160a01b031681565b600082156101b457506001600160a01b03811660009081526004602052604090205460ff166101d2565b506001600160a01b03811660009081526005602052604090205460ff165b92915050565b6003546001600160a01b0316331461020b5760405162461bcd60e51b8152600401610202906109b2565b60405180910390fd5b600191909155600255565b61022160018561018a565b1561023f57604051630c8d9eab60e31b815260040160405180910390fd5b600084846040516020016102549291906109d9565b60408051601f19818403018152828252805160209182012090830152016040516020818303038152906040528051906020012090506102ca8383808060200260200160405190810160405280939291908181526020018383602002808284376000920191909152505060015491508490506104b9565b6102e7576040516309bde33960e01b815260040160405180910390fd5b6102f26001866104cf565b600054610309906001600160a01b03168686610523565b7fd8138f8a3f377c5259ca548e70e4c2de94f129f5a11036a15b69513cba2b426a858560405161033a9291906109d9565b60405180910390a15050505050565b6003546001600160a01b031633146103735760405162461bcd60e51b8152600401610202906109b2565b60035461038d906001600160a01b03848116911683610523565b5050565b61039c60008561018a565b156103ba57604051630c8d9eab60e31b815260040160405180910390fd5b600084846040516020016103cf9291906109d9565b60408051601f19818403018152828252805160209182012090830152016040516020818303038152906040528051906020012090506104458383808060200260200160405190810160405280939291908181526020018383602002808284376000920191909152505060025491508490506104b9565b610462576040516309bde33960e01b815260040160405180910390fd5b6102f26000866104cf565b6003546001600160a01b031633146104975760405162461bcd60e51b8152600401610202906109b2565b600380546001600160a01b0319166001600160a01b0392909216919091179055565b6000826104c6858461057e565b14949350505050565b81156104fc576001600160a01b0381166000908152600460205260409020805460ff191660011790555050565b6001600160a01b0381166000908152600560205260409020805460ff191660011790555050565b6105798363a9059cbb60e01b84846040516024016105429291906109d9565b60408051601f198184030181529190526020810180516001600160e01b03166001600160e01b0319909316929092179091526105cb565b505050565b600081815b84518110156105c3576105af828683815181106105a2576105a26109f2565b602002602001015161069d565b9150806105bb81610a08565b915050610583565b509392505050565b6000610620826040518060400160405280602081526020017f5361666545524332303a206c6f772d6c6576656c2063616c6c206661696c6564815250856001600160a01b03166106cf9092919063ffffffff16565b805190915015610579578080602001905181019061063e9190610a2f565b6105795760405162461bcd60e51b815260206004820152602a60248201527f5361666545524332303a204552433230206f7065726174696f6e20646964206e6044820152691bdd081cdd58d8d9595960b21b6064820152608401610202565b60008183106106b95760008281526020849052604090206106c8565b60008381526020839052604090205b9392505050565b60606106de84846000856106e6565b949350505050565b6060824710156107475760405162461bcd60e51b815260206004820152602660248201527f416464726573733a20696e73756666696369656e742062616c616e636520666f6044820152651c8818d85b1b60d21b6064820152608401610202565b600080866001600160a01b031685876040516107639190610a7c565b60006040518083038185875af1925050503d80600081146107a0576040519150601f19603f3d011682016040523d82523d6000602084013e6107a5565b606091505b50915091506107b6878383876107c1565b979650505050505050565b60608315610830578251600003610829576001600160a01b0385163b6108295760405162461bcd60e51b815260206004820152601d60248201527f416464726573733a2063616c6c20746f206e6f6e2d636f6e74726163740000006044820152606401610202565b50816106de565b6106de83838151156108455781518083602001fd5b8060405162461bcd60e51b81526004016102029190610a98565b801515811461086d57600080fd5b50565b80356001600160a01b038116811461088757600080fd5b919050565b6000806040838503121561089f57600080fd5b82356108aa8161085f565b91506108b860208401610870565b90509250929050565b600080604083850312156108d457600080fd5b50508035926020909101359150565b600080600080606085870312156108f957600080fd5b61090285610870565b935060208501359250604085013567ffffffffffffffff8082111561092657600080fd5b818701915087601f83011261093a57600080fd5b81358181111561094957600080fd5b8860208260051b850101111561095e57600080fd5b95989497505060200194505050565b6000806040838503121561098057600080fd5b61098983610870565b946020939093013593505050565b6000602082840312156109a957600080fd5b6106c882610870565b6020808252600d908201526c26bab9ba1031329037bbb732b960991b604082015260600190565b6001600160a01b03929092168252602082015260400190565b634e487b7160e01b600052603260045260246000fd5b600060018201610a2857634e487b7160e01b600052601160045260246000fd5b5060010190565b600060208284031215610a4157600080fd5b81516106c88161085f565b60005b83811015610a67578181015183820152602001610a4f565b83811115610a76576000848401525b50505050565b60008251610a8e818460208701610a4c565b9190910192915050565b6020815260008251806020840152610ab7816040850160208701610a4c565b601f01601f1916919091016040019291505056fea26469706673582212209527a0ee492388d7952eef25e03986a7cf3a3053403aa44e37f563a4c7edc4ba64736f6c634300080d00330000000000000000000000004c05c9cebbb7673d0ede6556f26d8205c80422850c412b48f50b70b39c27c52de888fb95ff17a8dcdbf3b837cd01425e326021d5a35325556af98cba88564bc8710763ef050496441c96c0bc79b02812bdd2103c

0x608060405234801561001057600080fd5b506004361061009e5760003560e01c80638da5cb5b116100665780638da5cb5b1461011d578063956bb61e14610148578063a6f9dae11461015b578063f02e3f7a1461016e578063fc0c546a1461017757600080fd5b80633edc72b0146100a3578063441bd6ea146100bf5780636bffef7d146100e257806382afe379146100f75780638980f11f1461010a575b600080fd5b6100ac60015481565b6040519081526020015b60405180910390f35b6100d26100cd36600461088c565b61018a565b60405190151581526020016100b6565b6100f56100f03660046108c1565b6101d8565b005b6100f56101053660046108e3565b610216565b6100f561011836600461096d565b610349565b600354610130906001600160a01b031681565b6040516001600160a01b0390911681526020016100b6565b6100f56101563660046108e3565b610391565b6100f5610169366004610997565b61046d565b6100ac60025481565b600054610130906001600160a01b031681565b600082156101b457506001600160a01b03811660009081526004602052604090205460ff166101d2565b506001600160a01b03811660009081526005602052604090205460ff165b92915050565b6003546001600160a01b0316331461020b5760405162461bcd60e51b8152600401610202906109b2565b60405180910390fd5b600191909155600255565b61022160018561018a565b1561023f57604051630c8d9eab60e31b815260040160405180910390fd5b600084846040516020016102549291906109d9565b60408051601f19818403018152828252805160209182012090830152016040516020818303038152906040528051906020012090506102ca8383808060200260200160405190810160405280939291908181526020018383602002808284376000920191909152505060015491508490506104b9565b6102e7576040516309bde33960e01b815260040160405180910390fd5b6102f26001866104cf565b600054610309906001600160a01b03168686610523565b7fd8138f8a3f377c5259ca548e70e4c2de94f129f5a11036a15b69513cba2b426a858560405161033a9291906109d9565b60405180910390a15050505050565b6003546001600160a01b031633146103735760405162461bcd60e51b8152600401610202906109b2565b60035461038d906001600160a01b03848116911683610523565b5050565b61039c60008561018a565b156103ba57604051630c8d9eab60e31b815260040160405180910390fd5b600084846040516020016103cf9291906109d9565b60408051601f19818403018152828252805160209182012090830152016040516020818303038152906040528051906020012090506104458383808060200260200160405190810160405280939291908181526020018383602002808284376000920191909152505060025491508490506104b9565b610462576040516309bde33960e01b815260040160405180910390fd5b6102f26000866104cf565b6003546001600160a01b031633146104975760405162461bcd60e51b8152600401610202906109b2565b600380546001600160a01b0319166001600160a01b0392909216919091179055565b6000826104c6858461057e565b14949350505050565b81156104fc576001600160a01b0381166000908152600460205260409020805460ff191660011790555050565b6001600160a01b0381166000908152600560205260409020805460ff191660011790555050565b6105798363a9059cbb60e01b84846040516024016105429291906109d9565b60408051601f198184030181529190526020810180516001600160e01b03166001600160e01b0319909316929092179091526105cb565b505050565b600081815b84518110156105c3576105af828683815181106105a2576105a26109f2565b602002602001015161069d565b9150806105bb81610a08565b915050610583565b509392505050565b6000610620826040518060400160405280602081526020017f5361666545524332303a206c6f772d6c6576656c2063616c6c206661696c6564815250856001600160a01b03166106cf9092919063ffffffff16565b805190915015610579578080602001905181019061063e9190610a2f565b6105795760405162461bcd60e51b815260206004820152602a60248201527f5361666545524332303a204552433230206f7065726174696f6e20646964206e6044820152691bdd081cdd58d8d9595960b21b6064820152608401610202565b60008183106106b95760008281526020849052604090206106c8565b60008381526020839052604090205b9392505050565b60606106de84846000856106e6565b949350505050565b6060824710156107475760405162461bcd60e51b815260206004820152602660248201527f416464726573733a20696e73756666696369656e742062616c616e636520666f6044820152651c8818d85b1b60d21b6064820152608401610202565b600080866001600160a01b031685876040516107639190610a7c565b60006040518083038185875af1925050503d80600081146107a0576040519150601f19603f3d011682016040523d82523d6000602084013e6107a5565b606091505b50915091506107b6878383876107c1565b979650505050505050565b60608315610830578251600003610829576001600160a01b0385163b6108295760405162461bcd60e51b815260206004820152601d60248201527f416464726573733a2063616c6c20746f206e6f6e2d636f6e74726163740000006044820152606401610202565b50816106de565b6106de83838151156108455781518083602001fd5b8060405162461bcd60e51b81526004016102029190610a98565b801515811461086d57600080fd5b50565b80356001600160a01b038116811461088757600080fd5b919050565b6000806040838503121561089f57600080fd5b82356108aa8161085f565b91506108b860208401610870565b90509250929050565b600080604083850312156108d457600080fd5b50508035926020909101359150565b600080600080606085870312156108f957600080fd5b61090285610870565b935060208501359250604085013567ffffffffffffffff8082111561092657600080fd5b818701915087601f83011261093a57600080fd5b81358181111561094957600080fd5b8860208260051b850101111561095e57600080fd5b95989497505060200194505050565b6000806040838503121561098057600080fd5b61098983610870565b946020939093013593505050565b6000602082840312156109a957600080fd5b6106c882610870565b6020808252600d908201526c26bab9ba1031329037bbb732b960991b604082015260600190565b6001600160a01b03929092168252602082015260400190565b634e487b7160e01b600052603260045260246000fd5b600060018201610a2857634e487b7160e01b600052601160045260246000fd5b5060010190565b600060208284031215610a4157600080fd5b81516106c88161085f565b60005b83811015610a67578181015183820152602001610a4f565b83811115610a76576000848401525b50505050565b60008251610a8e818460208701610a4c565b9190910192915050565b6020815260008251806020840152610ab7816040850160208701610a4c565b601f01601f1916919091016040019291505056fea26469706673582212209527a0ee492388d7952eef25e03986a7cf3a3053403aa44e37f563a4c7edc4ba64736f6c634300080d0033

0000000000000000000000004c05c9cebbb7673d0ede6556f26d8205c80422850c412b48f50b70b39c27c52de888fb95ff17a8dcdbf3b837cd01425e326021d5a35325556af98cba88564bc8710763ef050496441c96c0bc79b02812bdd2103c

-----Decoded View---------------
Arg [0] : token_ (address): 0x4C05C9Cebbb7673D0edE6556f26D8205c8042285
Arg [1] : merkleRootVeRetro_ (bytes32): 0x0c412b48f50b70b39c27c52de888fb95ff17a8dcdbf3b837cd01425e326021d5
Arg [2] : merkleRootEco_ (bytes32): 0xa35325556af98cba88564bc8710763ef050496441c96c0bc79b02812bdd2103c

-----Encoded View---------------
3 Constructor Arguments found :
Arg [0] : 0000000000000000000000004c05c9cebbb7673d0ede6556f26d8205c8042285
Arg [1] : 0c412b48f50b70b39c27c52de888fb95ff17a8dcdbf3b837cd01425e326021d5
Arg [2] : a35325556af98cba88564bc8710763ef050496441c96c0bc79b02812bdd2103c