Contract

Contract Source Code (Solidity Standard Json-Input format)

IDE

• Blockscan IDE
• 🤖 Code ReaderBeta
• Remix IDE

More Options

• Similar
• Sol2Uml
• Submit Audit
• Compare

// SPDX-License-Identifier: UNLICENSED
pragma solidity ^0.8.9;

import "@openzeppelin/contracts/access/Ownable.sol";
import "@openzeppelin/contracts/token/ERC20/IERC20.sol";
import "@openzeppelin/contracts/utils/cryptography/MerkleProof.sol";

contract DynamicVestingV1 {
    mapping(address => uint256) public startTimes;
    mapping(address => uint256[]) public releaseAmounts;
}

contract VestingBase is Ownable {
    address duelToken;

    constructor(address _duelToken) Ownable(msg.sender) {
        duelToken = _duelToken;
    }

    function setDuelToken(address newContract) external onlyOwner {
        duelToken = newContract;
    }

    function allocateDUEL(address, uint256) external virtual {}

    function allocateDUEL(address, uint256, uint256) external virtual {}

    function claimDUEL() external virtual {}
}

/// @title Core static vesting contract allowing for cliff and variable percentage releases
/// @author Haider
/// @notice Contract uses pre-approved DUEL amount to transferFrom() the owner()
/// @notice Deploy 3 versions: Private Sale, Team & Advisors, Operations & Marketing
contract StaticVesting is VestingBase {
    uint256[] public releaseTimestamps; // Release UNIX timestamps
    uint16[] public releasePercentages; // Release percentage [0,0,0,100,100,100,...]
    mapping(address => uint256) public vestedAllocations; // wallet => total allocated
    mapping(address => uint256) public vestedClaims; // wallet => total claimed

    constructor(
        address _duelToken,
        uint256[] memory _releaseTimestamps,
        uint16[] memory _releasePercentages
    ) VestingBase(_duelToken) {
        require(
            releaseTimestamps.length == releasePercentages.length,
            "PARAMETERS_MISMATCH"
        );
        releaseTimestamps = _releaseTimestamps;
        releasePercentages = _releasePercentages;
    }

    function updateReleaseParameters(
        uint256[] memory _releaseTimestamps,
        uint16[] memory _releasePercentages
    ) external onlyOwner {
        require(
            releaseTimestamps.length == releasePercentages.length,
            "PARAMETERS_MISMATCH"
        );
        releaseTimestamps = _releaseTimestamps;
        releasePercentages = _releasePercentages;
    }

    function batchAllocateDUEL(
        address[] memory wallets,
        uint256[] memory allocations
    ) external onlyOwner {
        for (uint16 i = 0; i < wallets.length; i++) {
            vestedAllocations[wallets[i]] = allocations[i];
        }
    }

    function batchUpdateAllocations(
        address[] memory wallets,
        uint256[] memory allocations,
        uint256[] memory claims
    ) external onlyOwner {
        for (uint16 i = 0; i < wallets.length; i++) {
            vestedAllocations[wallets[i]] = allocations[i];
            vestedClaims[wallets[i]] = claims[i];
        }
    }

    function allocateDUEL(
        address wallet,
        uint256 amount
    ) external override onlyOwner {
        require(vestedAllocations[wallet] == 0, "ALREADY_ALLOCATED");
        vestedAllocations[wallet] = amount;
    }

    function claimDUEL() external override {
        require(
            vestedAllocations[_msgSender()] > 0 &&
                vestedAllocations[_msgSender()] > vestedClaims[_msgSender()],
            "NO_CLAIMS"
        );

        uint16 cumulativePercentage = 0; // Cumulative percentage released so far
        for (uint8 i = 0; i < releaseTimestamps.length; i++) {
            if (releaseTimestamps[i] > block.timestamp) {
                break;
            }
            cumulativePercentage += releasePercentages[i];
        }

        uint256 availableClaim = (vestedAllocations[_msgSender()] *
            cumulativePercentage) / 10000;
        require(availableClaim > vestedClaims[_msgSender()], "ALREADY_CLAIMED");

        uint256 unclaimedTokens = availableClaim - vestedClaims[_msgSender()];
        vestedClaims[_msgSender()] += unclaimedTokens;
        IERC20(duelToken).transfer(_msgSender(), unclaimedTokens);
    }

    function withdrawDUEL(uint256 amount) external onlyOwner {
        if (amount == 0) {
            amount = IERC20(duelToken).balanceOf(address(this));
        }
        IERC20(duelToken).transfer(owner(), amount);
    }
}

/// @title Core dynamic vesting contract to be used upon RAINxDUEL conversion
/// @author Haider
/// @notice Contract uses pre-approved DUEL amount to transferFrom() the owner()
/// @dev Does not allow for two separate schedules for same wallet
contract DynamicVesting is VestingBase {
    DynamicVestingV1 public dynamicVestingV1;
    mapping(address => uint256) public startTimes; // wallet => claim start time
    mapping(address => uint256[]) public releaseAmounts; // wallet => [amount30d, amount90d]

    constructor(address _duelToken) VestingBase(_duelToken) {}

    function setDynamicVestingV1(
        DynamicVestingV1 newContract
    ) external onlyOwner {
        dynamicVestingV1 = newContract;
    }

    function batchV1Transition(address[] memory wallets) external onlyOwner {
        for (uint16 i = 0; i < wallets.length; i++) {
            if (dynamicVestingV1.startTimes(wallets[i]) > 0) {
                startTimes[wallets[i]] = dynamicVestingV1.startTimes(
                    wallets[i]
                );
                releaseAmounts[wallets[i]].push(
                    dynamicVestingV1.releaseAmounts(wallets[i], 0)
                );
                releaseAmounts[wallets[i]].push(
                    dynamicVestingV1.releaseAmounts(wallets[i], 1)
                );
            }
        }
    }

    function allocateDUEL(
        address wallet,
        uint256 amount30d,
        uint256 amount90d
    ) external override {
        require(
            _msgSender() == duelToken || _msgSender() == owner(),
            "Access forbidden"
        );
        require(startTimes[wallet] == 0, "Vesting already in progress");
        startTimes[wallet] = block.timestamp;
        releaseAmounts[wallet] = [amount30d, amount90d];
    }

    function claimDUEL() external override {
        require(startTimes[_msgSender()] >= 0, "Nothing vested");

        uint256 availableAmount = 0;
        if (
            block.timestamp >= startTimes[_msgSender()] + 30 days &&
            releaseAmounts[_msgSender()][0] > 0
        ) {
            availableAmount += releaseAmounts[_msgSender()][0];
            releaseAmounts[_msgSender()][0] = 0;
        }
        if (
            block.timestamp >= startTimes[_msgSender()] + 90 days &&
            releaseAmounts[_msgSender()][1] > 0
        ) {
            availableAmount += releaseAmounts[_msgSender()][1];
            releaseAmounts[_msgSender()][1] = 0;
        }

        require(availableAmount > 0, "Nothing to claim");
        IERC20(duelToken).transferFrom(owner(), _msgSender(), availableAmount);
    }
}

interface IWinbackStaking {
    function stakeWinback(uint256 amount, uint32 periodDays) external;
}

contract DynamicVestingMin is Ownable {
    address duelToken;
    address vestingV1;
    address winbackStaking;
    bytes32 public merkleRoot;
    mapping(address => bool[]) public claimed;

    event Claimed(address indexed wallet, uint256 amount, bool was30d);

    constructor(address _duelToken, address _vestingV1) Ownable(msg.sender) {
        duelToken = _duelToken;
        vestingV1 = _vestingV1;
    }

    function setDuelToken(address _newToken) external onlyOwner {
        duelToken = _newToken;
    }

    function setVestingV1(address _newV1) external onlyOwner {
        vestingV1 = _newV1;
    }

    function setWinbackStaking(address _winbackStaking) external onlyOwner {
        winbackStaking = _winbackStaking;
    }

    function setMerkleRoot(bytes32 _newRoot) external onlyOwner {
        merkleRoot = _newRoot;
    }

    function _getClaimable(
        uint8 chainId,
        uint256 unlock30d,
        uint256 unlock90d,
        bytes32[] calldata merkleProof
    ) internal returns (uint256 claimable) {
        bytes32 leaf = keccak256(
            abi.encodePacked(_msgSender(), chainId, unlock30d, unlock90d)
        );
        require(
            MerkleProof.verify(merkleProof, merkleRoot, leaf),
            "INCORRECT_PROOF"
        );
        require(chainId == block.chainid, "INCORRECT_CHAIN");

        uint256 startTime = DynamicVestingV1(vestingV1).startTimes(
            _msgSender()
        );

        if (
            block.timestamp > startTime + 30 days &&
            claimed[_msgSender()].length == 0
        ) {
            claimable += unlock30d;
            claimed[_msgSender()].push(true);
            emit Claimed(_msgSender(), unlock30d, true);
        }

        if (
            block.timestamp > startTime + 90 days &&
            claimed[_msgSender()].length <= 1
        ) {
            claimable += unlock90d;
            claimed[_msgSender()].push(true);
            emit Claimed(_msgSender(), unlock90d, false);
        }
        require(claimable > 0, "NOTHING_CLAIMABLE");
    }

    function claimDUEL(
        uint8 chainId,
        uint256 unlock30d,
        uint256 unlock90d,
        bytes32[] calldata merkleProof
    ) external {
        uint256 claimable = _getClaimable(
            chainId,
            unlock30d,
            unlock90d,
            merkleProof
        );
        IERC20(duelToken).transfer(_msgSender(), claimable);
    }

    function winbackStake(
        uint8 chainId,
        uint256 unlock30d,
        uint256 unlock90d,
        bytes32[] calldata merkleProof,
        uint32 stakeDuration
    ) external {
        uint256 claimable = _getClaimable(
            chainId,
            unlock30d,
            unlock90d,
            merkleProof
        );
        IERC20(duelToken).transfer(winbackStaking, claimable);
        IWinbackStaking(winbackStaking).stakeWinback(claimable, stakeDuration);
    }

    function withdrawDUEL(uint256 amount) external onlyOwner {
        uint256 balance = IERC20(duelToken).balanceOf(address(this));
        IERC20(duelToken).transfer(owner(), amount == 0 ? balance : amount);
    }
}

contract SingleBeneficiaryLockup is VestingBase {
    string public LOCKUP_TYPE;
    address public BENEFICIARY;

    uint256[] releaseTimestamps;
    uint16[] releasePercentages;
    uint256 vestedAllocation;
    uint256 vestedClaim;

    constructor(
        address _duelToken,
        string memory name
    ) VestingBase(_duelToken) {
        LOCKUP_TYPE = name;
    }

    function updateReleaseParameters(
        uint256[] memory _releaseTimestamps,
        uint16[] memory _releasePercentages
    ) external onlyOwner {
        require(
            releaseTimestamps.length == releasePercentages.length,
            "Parameters length mismatch"
        );
        releaseTimestamps = _releaseTimestamps;
        releasePercentages = _releasePercentages;
    }

    function allocateDUEL(
        address beneficiary,
        uint256 amount
    ) external override onlyOwner {
        IERC20(duelToken).transferFrom(owner(), address(this), amount);
        BENEFICIARY = beneficiary;
        vestedAllocation = amount;
        vestedClaim = 0;
    }

    function reallocateDUEL(
        address newBeneficiary,
        uint256 amountOut,
        uint256 amountIn
    ) external onlyOwner {
        IERC20(duelToken).transfer(owner(), amountOut);
        IERC20(duelToken).transferFrom(owner(), address(this), amountIn);
        BENEFICIARY = newBeneficiary;
    }

    function claimDUEL() external override {
        require(_msgSender() == BENEFICIARY, "ACCESS_FORBIDDEN");
        require(
            vestedAllocation > 0 && vestedAllocation > vestedClaim,
            "Nothing to claim"
        );

        uint16 cumulativePercentage = 0;
        for (uint8 i = 0; i < releaseTimestamps.length; i++) {
            if (releaseTimestamps[i] > block.timestamp) {
                break;
            }
            cumulativePercentage += releasePercentages[i];
        }

        uint256 availableClaim = (vestedAllocation * cumulativePercentage) /
            100000;
        require(availableClaim > vestedClaim, "Period already claimed");

        uint256 unclaimedTokens = availableClaim - vestedClaim;
        vestedClaim += unclaimedTokens;

        IERC20(duelToken).transfer(_msgSender(), unclaimedTokens);
    }
}

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

pragma solidity ^0.8.20;

import {Context} from "../utils/Context.sol";

/**
 * @dev Contract module which provides a basic access control mechanism, where
 * there is an account (an owner) that can be granted exclusive access to
 * specific functions.
 *
 * The initial owner is set to the address provided by the deployer. This can
 * later be changed with {transferOwnership}.
 *
 * This module is used through inheritance. It will make available the modifier
 * `onlyOwner`, which can be applied to your functions to restrict their use to
 * the owner.
 */
abstract contract Ownable is Context {
    address private _owner;

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

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

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

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

    /**
     * @dev Throws if called by any account other than the owner.
     */
    modifier onlyOwner() {
        _checkOwner();
        _;
    }

    /**
     * @dev Returns the address of the current owner.
     */
    function owner() public view virtual returns (address) {
        return _owner;
    }

    /**
     * @dev Throws if the sender is not the owner.
     */
    function _checkOwner() internal view virtual {
        if (owner() != _msgSender()) {
            revert OwnableUnauthorizedAccount(_msgSender());
        }
    }

    /**
     * @dev Leaves the contract without owner. It will not be possible to call
     * `onlyOwner` functions. Can only be called by the current owner.
     *
     * NOTE: Renouncing ownership will leave the contract without an owner,
     * thereby disabling any functionality that is only available to the owner.
     */
    function renounceOwnership() public virtual onlyOwner {
        _transferOwnership(address(0));
    }

    /**
     * @dev Transfers ownership of the contract to a new account (`newOwner`).
     * Can only be called by the current owner.
     */
    function transferOwnership(address newOwner) public virtual onlyOwner {
        if (newOwner == address(0)) {
            revert OwnableInvalidOwner(address(0));
        }
        _transferOwnership(newOwner);
    }

    /**
     * @dev Transfers ownership of the contract to a new account (`newOwner`).
     * Internal function without access restriction.
     */
    function _transferOwnership(address newOwner) internal virtual {
        address oldOwner = _owner;
        _owner = newOwner;
        emit OwnershipTransferred(oldOwner, newOwner);
    }
}

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

pragma solidity ^0.8.20;

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

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

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

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

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

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

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

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

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

pragma solidity ^0.8.20;

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

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

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

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

pragma solidity ^0.8.20;

/**
 * @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 The multiproof provided is not valid.
     */
    error MerkleProofInvalidMultiproof();

    /**
     * @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}
     */
    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.
     */
    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}
     */
    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.
     */
    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.
     */
    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).
     */
    function processMultiProof(
        bytes32[] memory proof,
        bool[] memory proofFlags,
        bytes32[] memory leaves
    ) internal pure returns (bytes32 merkleRoot) {
        // This function rebuilds 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 proofLen = proof.length;
        uint256 totalHashes = proofFlags.length;

        // Check proof validity.
        if (leavesLen + proofLen != totalHashes + 1) {
            revert MerkleProofInvalidMultiproof();
        }

        // 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 from 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) {
            if (proofPos != proofLen) {
                revert MerkleProofInvalidMultiproof();
            }
            unchecked {
                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.
     */
    function processMultiProofCalldata(
        bytes32[] calldata proof,
        bool[] calldata proofFlags,
        bytes32[] memory leaves
    ) internal pure returns (bytes32 merkleRoot) {
        // This function rebuilds 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 proofLen = proof.length;
        uint256 totalHashes = proofFlags.length;

        // Check proof validity.
        if (leavesLen + proofLen != totalHashes + 1) {
            revert MerkleProofInvalidMultiproof();
        }

        // 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 from 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) {
            if (proofPos != proofLen) {
                revert MerkleProofInvalidMultiproof();
            }
            unchecked {
                return hashes[totalHashes - 1];
            }
        } else if (leavesLen > 0) {
            return leaves[0];
        } else {
            return proof[0];
        }
    }

    /**
     * @dev Sorts the pair (a, b) and hashes the result.
     */
    function _hashPair(bytes32 a, bytes32 b) private pure returns (bytes32) {
        return a < b ? _efficientHash(a, b) : _efficientHash(b, a);
    }

    /**
     * @dev Implementation of keccak256(abi.encode(a, b)) that doesn't allocate or expand memory.
     */
    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": 200,
    "details": {
      "yul": false
    }
  },
  "evmVersion": "paris",
  "outputSelection": {
    "*": {
      "*": [
        "evm.bytecode",
        "evm.deployedBytecode",
        "devdoc",
        "userdoc",
        "metadata",
        "abi"
      ]
    }
  },
  "libraries": {}
}

• No Contract Security Audit Submitted- Submit Audit Here

[{"inputs":[{"internalType":"address","name":"_duelToken","type":"address"},{"internalType":"uint256[]","name":"_releaseTimestamps","type":"uint256[]"},{"internalType":"uint16[]","name":"_releasePercentages","type":"uint16[]"}],"stateMutability":"nonpayable","type":"constructor"},{"inputs":[{"internalType":"address","name":"owner","type":"address"}],"name":"OwnableInvalidOwner","type":"error"},{"inputs":[{"internalType":"address","name":"account","type":"address"}],"name":"OwnableUnauthorizedAccount","type":"error"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"previousOwner","type":"address"},{"indexed":true,"internalType":"address","name":"newOwner","type":"address"}],"name":"OwnershipTransferred","type":"event"},{"inputs":[{"internalType":"address","name":"wallet","type":"address"},{"internalType":"uint256","name":"amount","type":"uint256"}],"name":"allocateDUEL","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"","type":"address"},{"internalType":"uint256","name":"","type":"uint256"},{"internalType":"uint256","name":"","type":"uint256"}],"name":"allocateDUEL","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address[]","name":"wallets","type":"address[]"},{"internalType":"uint256[]","name":"allocations","type":"uint256[]"}],"name":"batchAllocateDUEL","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address[]","name":"wallets","type":"address[]"},{"internalType":"uint256[]","name":"allocations","type":"uint256[]"},{"internalType":"uint256[]","name":"claims","type":"uint256[]"}],"name":"batchUpdateAllocations","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"claimDUEL","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"owner","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"","type":"uint256"}],"name":"releasePercentages","outputs":[{"internalType":"uint16","name":"","type":"uint16"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"","type":"uint256"}],"name":"releaseTimestamps","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"renounceOwnership","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"newContract","type":"address"}],"name":"setDuelToken","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"newOwner","type":"address"}],"name":"transferOwnership","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256[]","name":"_releaseTimestamps","type":"uint256[]"},{"internalType":"uint16[]","name":"_releasePercentages","type":"uint16[]"}],"name":"updateReleaseParameters","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"","type":"address"}],"name":"vestedAllocations","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"","type":"address"}],"name":"vestedClaims","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"amount","type":"uint256"}],"name":"withdrawDUEL","outputs":[],"stateMutability":"nonpayable","type":"function"}]

0x608060405234801561001057600080fd5b50600436106100f55760003560e01c80637b649c4811610097578063dc1d980611610066578063dc1d9806146101ed578063e063f80a14610200578063f2fde38b14610213578063f83887d31461022657600080fd5b80637b649c481461018e5780637e68fe4e146101ae5780638da5cb5b146101c1578063c2aa7af2146101da57600080fd5b80632a880514116100d35780632a88051414610135578063715018a61461014857806371c6c8811461015057806378fa9c771461018657600080fd5b806301a8d687146100fa5780630491559f1461010f5780630b24f19f14610122575b600080fd5b61010d610108366004610ba1565b610246565b005b61010d61011d366004610c41565b61033f565b61010d610130366004610cb3565b6103ce565b61010d610143366004610d70565b610431565b61010d610483565b61017061015e366004610dd8565b60046020526000908152604090205481565b60405161017d9190610e01565b60405180910390f35b61010d610497565b61017061019c366004610dd8565b60056020526000908152604090205481565b61010d6101bc366004610e0f565b610690565b6000546001600160a01b031660405161017d9190610e39565b6101706101e8366004610e0f565b61079c565b61010d6101fb366004610e47565b505050565b61010d61020e366004610dd8565b6107bd565b61010d610221366004610dd8565b6107e7565b610239610234366004610e0f565b610825565b60405161017d9190610e97565b61024e61085d565b60005b83518161ffff16101561033957828161ffff168151811061027457610274610ea5565b602002602001015160046000868461ffff168151811061029657610296610ea5565b60200260200101516001600160a01b03166001600160a01b0316815260200190815260200160002081905550818161ffff16815181106102d8576102d8610ea5565b602002602001015160056000868461ffff16815181106102fa576102fa610ea5565b60200260200101516001600160a01b03166001600160a01b0316815260200190815260200160002081905550808061033190610ed1565b915050610251565b50505050565b61034761085d565b60005b82518161ffff1610156101fb57818161ffff168151811061036d5761036d610ea5565b602002602001015160046000858461ffff168151811061038f5761038f610ea5565b60200260200101516001600160a01b03166001600160a01b031681526020019081526020016000208190555080806103c690610ed1565b91505061034a565b6103d661085d565b6001600160a01b038216600090815260046020526040902054156104155760405162461bcd60e51b815260040161040c90610f1b565b60405180910390fd5b6001600160a01b03909116600090815260046020526040902055565b61043961085d565b6003546002541461045c5760405162461bcd60e51b815260040161040c90610f55565b815161046f9060029060208501906108da565b5080516101fb906003906020840190610925565b61048b61085d565b610495600061088a565b565b33600090815260046020526040902054158015906104ce575033600090815260056020908152604080832054600490925290912054115b6104ea5760405162461bcd60e51b815260040161040c90610f85565b6000805b60025460ff8216101561057b574260028260ff168154811061051257610512610ea5565b90600052602060002001541161057b5760038160ff168154811061053857610538610ea5565b90600052602060002090601091828204019190066002029054906101000a900461ffff16826105679190610f95565b91508061057381610fb3565b9150506104ee565b50336000908152600460205260408120546127109061059f9061ffff851690610fc9565b6105a99190610ffe565b3360009081526005602052604090205490915081116105da5760405162461bcd60e51b815260040161040c90611038565b336000908152600560205260408120546105f49083611048565b3360009081526005602052604081208054929350839290919061061890849061105b565b90915550506001546001600160a01b031663a9059cbb33836040518363ffffffff1660e01b815260040161064d92919061106e565b6020604051808303816000875af115801561066c573d6000803e3d6000fd5b505050506040513d601f19601f8201168201806040525081019061033991906110a3565b61069861085d565b80600003610714576001546040516370a0823160e01b81526001600160a01b03909116906370a08231906106d0903090600401610e39565b602060405180830381865afa1580156106ed573d6000803e3d6000fd5b505050506040513d601f19601f8201168201806040525081019061071191906110cf565b90505b6001546001600160a01b031663a9059cbb6107376000546001600160a01b031690565b836040518363ffffffff1660e01b815260040161075592919061106e565b6020604051808303816000875af1158015610774573d6000803e3d6000fd5b505050506040513d601f19601f8201168201806040525081019061079891906110a3565b5050565b600281815481106107ac57600080fd5b600091825260209091200154905081565b6107c561085d565b600180546001600160a01b0319166001600160a01b0392909216919091179055565b6107ef61085d565b6001600160a01b038116610819576000604051631e4fbdf760e01b815260040161040c9190610e39565b6108228161088a565b50565b6003818154811061083557600080fd5b9060005260206000209060109182820401919006600202915054906101000a900461ffff1681565b6000546001600160a01b03163314610495573360405163118cdaa760e01b815260040161040c9190610e39565b600080546001600160a01b038381166001600160a01b0319831681178455604051919092169283917f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e09190a35050565b828054828255906000526020600020908101928215610915579160200282015b828111156109155782518255916020019190600101906108fa565b506109219291506109c5565b5090565b82805482825590600052602060002090600f016010900481019282156109155791602002820160005b8382111561098e57835183826101000a81548161ffff021916908361ffff160217905550926020019260020160208160010104928301926001030261094e565b80156109bc5782816101000a81549061ffff021916905560020160208160010104928301926001030261098e565b50506109219291505b5b8082111561092157600081556001016109c6565b634e487b7160e01b600052604160045260246000fd5b601f19601f830116810181811067ffffffffffffffff82111715610a1657610a166109da565b6040525050565b6000610a2860405190565b9050610a3482826109f0565b919050565b600067ffffffffffffffff821115610a5357610a536109da565b5060209081020190565b60006001600160a01b0382165b92915050565b610a7981610a5d565b811461082257600080fd5b8035610a6a81610a70565b6000610aa2610a9d84610a39565b610a1d565b83815290506020808201908402830185811115610ac157610ac1600080fd5b835b81811015610ae55780610ad68882610a84565b84525060209283019201610ac3565b5050509392505050565b600082601f830112610b0357610b03600080fd5b8135610b13848260208601610a8f565b949350505050565b80610a79565b8035610a6a81610b1b565b6000610b3a610a9d84610a39565b83815290506020808201908402830185811115610b5957610b59600080fd5b835b81811015610ae55780610b6e8882610b21565b84525060209283019201610b5b565b600082601f830112610b9157610b91600080fd5b8135610b13848260208601610b2c565b600080600060608486031215610bb957610bb9600080fd5b833567ffffffffffffffff811115610bd357610bd3600080fd5b610bdf86828701610aef565b935050602084013567ffffffffffffffff811115610bff57610bff600080fd5b610c0b86828701610b7d565b925050604084013567ffffffffffffffff811115610c2b57610c2b600080fd5b610c3786828701610b7d565b9150509250925092565b60008060408385031215610c5757610c57600080fd5b823567ffffffffffffffff811115610c7157610c71600080fd5b610c7d85828601610aef565b925050602083013567ffffffffffffffff811115610c9d57610c9d600080fd5b610ca985828601610b7d565b9150509250929050565b60008060408385031215610cc957610cc9600080fd5b6000610cd58585610a84565b9250506020610ca985828601610b21565b61ffff8116610a79565b8035610a6a81610ce6565b6000610d09610a9d84610a39565b83815290506020808201908402830185811115610d2857610d28600080fd5b835b81811015610ae55780610d3d8882610cf0565b84525060209283019201610d2a565b600082601f830112610d6057610d60600080fd5b8135610b13848260208601610cfb565b60008060408385031215610d8657610d86600080fd5b823567ffffffffffffffff811115610da057610da0600080fd5b610dac85828601610b7d565b925050602083013567ffffffffffffffff811115610dcc57610dcc600080fd5b610ca985828601610d4c565b600060208284031215610ded57610ded600080fd5b6000610b138484610a84565b805b82525050565b60208101610a6a8284610df9565b600060208284031215610e2457610e24600080fd5b6000610b138484610b21565b610dfb81610a5d565b60208101610a6a8284610e30565b600080600060608486031215610e5f57610e5f600080fd5b6000610e6b8686610a84565b9350506020610e7c86828701610b21565b9250506040610c3786828701610b21565b61ffff8116610dfb565b60208101610a6a8284610e8d565b634e487b7160e01b600052603260045260246000fd5b634e487b7160e01b600052601160045260246000fd5b61ffff16600061fffe198201610ee957610ee9610ebb565b5060010190565b60118152600060208201701053149150511657d0531313d0d0551151607a1b815291505b5060200190565b60208082528101610a6a81610ef0565b60138152600060208201720a082a4829a8aa88aa4a6be9a92a69a82a8869606b1b81529150610f14565b60208082528101610a6a81610f2b565b60098152600060208201684e4f5f434c41494d5360b81b81529150610f14565b60208082528101610a6a81610f65565b61ffff918216919081169082820190811115610a6a57610a6a610ebb565b60ff16600060fe198201610ee957610ee9610ebb565b818102808215838204851417610fe157610fe1610ebb565b5092915050565b634e487b7160e01b600052601260045260246000fd5b60008261100d5761100d610fe8565b500490565b600f81526000602082016e1053149150511657d0d31052535151608a1b81529150610f14565b60208082528101610a6a81611012565b81810381811115610a6a57610a6a610ebb565b80820180821115610a6a57610a6a610ebb565b6040810161107c8285610e30565b6110896020830184610df9565b9392505050565b801515610a79565b8051610a6a81611090565b6000602082840312156110b8576110b8600080fd5b6000610b138484611098565b8051610a6a81610b1b565b6000602082840312156110e4576110e4600080fd5b6000610b1384846110c456fea2646970667358221220b0bfcff3088b5a04211b85de41f0e82d018e81697d3517a5609af080da367a5d64736f6c63430008140033