Contract

Contract Source Code (Solidity Standard Json-Input format)

IDE

• Blockscan IDE
• 🤖 Code ReaderBeta
• Remix IDE

More Options

• Similar
• Sol2Uml
• Submit Audit
• Compare

// SPDX-License-Identifier: MIT

pragma solidity 0.8.25;

import { EnumerableSet } from "@openzeppelin/contracts/utils/structs/EnumerableSet.sol";
import { IERC20 } from "@openzeppelin/contracts/token/ERC20/IERC20.sol";
import { ReentrancyGuard } from "@openzeppelin/contracts/utils/ReentrancyGuard.sol";
import { SafeERC20 } from "@openzeppelin/contracts/token/ERC20/utils/SafeERC20.sol";

import { ClaimingErrors } from "./interfaces/Errors.sol";
import { IClaiming } from "./interfaces/IClaiming.sol";
import { IStaking } from "./interfaces/IStaking.sol";

/**
 * @title DOP unstake Claiming contract.
 * @author Gems team.
 * @notice Allows DOP tokens to be claimed after an unstake request has been
 * requested.
 */
contract Claiming is ReentrancyGuard, ClaimingErrors, IClaiming {
    using EnumerableSet for EnumerableSet.Bytes32Set;
    using SafeERC20 for IERC20;

    /* ========== STATE VARIABLES ========== */

    /// @dev Seven days time in seconds.
    uint256 private constant _SEVEN_DAYS_TIME = 7 days;
    /// @notice Address of the DOP token contract.
    IERC20 public immutable DOP_TOKEN;
    /// @notice Address of the Staking contract.
    IStaking public immutable STAKING;

    /// @notice Number of request keys currently assigned.
    uint256 public totalRequests;

    /// @notice Unique key with respect to a unique request index.
    EnumerableSet.Bytes32Set private _requestKeys;
    /// @dev Claimer's claim request with respect to a unique key.
    mapping(bytes32 key => Request request) public requests;

    /* ========== STRUCTS ========== */

    struct Request {
        uint256 amount;
        /// @dev Time after which the claim request will be complete.
        uint256 claimRequestTime;
    }

    /* ========== EVENTS ========== */

    /// @dev Emitted when a claim request has been set.
    event RequestSet(
        address indexed claimer,
        uint256 index,
        uint256 amount,
        uint256 claimRequestTime
    );
    /// @dev Emitted when a claim request has been claimed.
    event RequestClaimed(address indexed claimer, uint256 index);
    /// @dev Emitted when multiple claim requests have been claimed.
    event MultipleRequestsClaimed(address indexed claimer, uint256[] indexes);

    /* ========== CONSTRUCTOR ========== */

    /**
     * @dev Constructor.
     * @param initDOPToken Address of the DOP token contract.
     * @param initStaking Address of the Staking contract.
     */
    constructor(IERC20 initDOPToken, IStaking initStaking) {
        if (
            address(initDOPToken) == address(0) ||
            address(initStaking) == address(0)
        ) {
            revert InvalidAddress();
        }

        DOP_TOKEN = initDOPToken;
        STAKING = initStaking;
    }

    /* ========== FUNCTIONS ========== */

    /**
     * @inheritdoc IClaiming
     */
    function setRequest(address claimer, uint256 amount) external nonReentrant {
        if (msg.sender != address(STAKING)) {
            revert ClaimingUnauthorizedAccount(msg.sender);
        }

        if (claimer == address(0)) {
            revert InvalidAddress();
        }

        if (amount == 0) {
            revert InvalidAmount();
        }

        uint256 index = totalRequests++;
        bytes32 key = _generateKey(claimer, index);
        _requestKeys.add(key);
        uint256 claimRequestTime = block.timestamp + _SEVEN_DAYS_TIME;
        requests[key] = Request({
            amount: amount,
            claimRequestTime: claimRequestTime
        });
        DOP_TOKEN.safeTransferFrom(address(STAKING), address(this), amount);

        emit RequestSet({
            claimer: claimer,
            index: index,
            amount: amount,
            claimRequestTime: claimRequestTime
        });
    }

    /**
     * @inheritdoc IClaiming
     */
    function claimRequest(uint256 index) external nonReentrant {
        DOP_TOKEN.safeTransfer(msg.sender, _claimRequest(index));

        emit RequestClaimed({ claimer: msg.sender, index: index });
    }

    /**
     * @inheritdoc IClaiming
     */
    function claimMultipleRequests(
        uint256[] calldata indexes
    ) external nonReentrant {
        uint256 indexesLength = indexes.length;

        if (indexesLength == 0) {
            revert ZeroLengthArray();
        }

        uint256 totalRequestAmount;

        for (uint256 i; i < indexesLength; ++i) {
            totalRequestAmount += _claimRequest(indexes[i]);
        }

        DOP_TOKEN.safeTransfer(msg.sender, totalRequestAmount);

        emit MultipleRequestsClaimed({ claimer: msg.sender, indexes: indexes });
    }

    /**
     * @inheritdoc IClaiming
     */
    function getRequest(
        uint256 index
    ) external view returns (uint256, uint256) {
        Request memory request = requests[_requestKeys.at(index)];
        return (request.amount, request.claimRequestTime);
    }

    /**
     * @inheritdoc IClaiming
     */
    function getRequestKey(uint256 index) external view returns (bytes32) {
        return _requestKeys.at(index);
    }

    /**
     * @dev Implements logic for a completed claim request. DOES NOT transfer
     * claimable DOP tokens.
     * @return requestAmount Amount of DOP tokens in the claim request that
     * need to be processed.
     */
    function _claimRequest(uint256 index) private returns (uint256) {
        bytes32 key = _generateKey(msg.sender, index);
        Request memory request = requests[key];

        if (request.amount == 0) {
            revert InvalidClaimRequest();
        }

        if (block.timestamp < request.claimRequestTime) {
            revert ClaimRequestTimeNotReached();
        }

        _requestKeys.remove(key);
        delete requests[key];

        return request.amount;
    }

    /**
     * @notice Creates a unique key pertaining to the caller and the given
     * unique request index.
     * @param claimer Claimer who's tokens are being held.
     * @param index Request index to get the key for.
     * @return key Key that is present for the given request index.
     */
    function _generateKey(
        address claimer,
        uint256 index
    ) private pure returns (bytes32) {
        return keccak256(abi.encodePacked(claimer, index));
    }
}

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

pragma solidity ^0.8.20;

/**
 * @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.
 *
 * ==== Security Considerations
 *
 * There are two important considerations concerning the use of `permit`. The first is that a valid permit signature
 * expresses an allowance, and it should not be assumed to convey additional meaning. In particular, it should not be
 * considered as an intention to spend the allowance in any specific way. The second is that because permits have
 * built-in replay protection and can be submitted by anyone, they can be frontrun. A protocol that uses permits should
 * take this into consideration and allow a `permit` call to fail. Combining these two aspects, a pattern that may be
 * generally recommended is:
 *
 * ```solidity
 * function doThingWithPermit(..., uint256 value, uint256 deadline, uint8 v, bytes32 r, bytes32 s) public {
 *     try token.permit(msg.sender, address(this), value, deadline, v, r, s) {} catch {}
 *     doThing(..., value);
 * }
 *
 * function doThing(..., uint256 value) public {
 *     token.safeTransferFrom(msg.sender, address(this), value);
 *     ...
 * }
 * ```
 *
 * Observe that: 1) `msg.sender` is used as the owner, leaving no ambiguity as to the signer intent, and 2) the use of
 * `try/catch` allows the permit to fail and makes the code tolerant to frontrunning. (See also
 * {SafeERC20-safeTransferFrom}).
 *
 * Additionally, note that smart contract wallets (such as Argent or Safe) are not able to produce permit signatures, so
 * contracts should have entry points that don't rely on permit.
 */
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].
     *
     * CAUTION: See Security Considerations above.
     */
    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 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.0) (token/ERC20/utils/SafeERC20.sol)

pragma solidity ^0.8.20;

import {IERC20} from "../IERC20.sol";
import {IERC20Permit} from "../extensions/IERC20Permit.sol";
import {Address} from "../../../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;

    /**
     * @dev An operation with an ERC20 token failed.
     */
    error SafeERC20FailedOperation(address token);

    /**
     * @dev Indicates a failed `decreaseAllowance` request.
     */
    error SafeERC20FailedDecreaseAllowance(address spender, uint256 currentAllowance, uint256 requestedDecrease);

    /**
     * @dev Transfer `value` amount of `token` from the calling contract to `to`. If `token` returns no value,
     * non-reverting calls are assumed to be successful.
     */
    function safeTransfer(IERC20 token, address to, uint256 value) internal {
        _callOptionalReturn(token, abi.encodeCall(token.transfer, (to, value)));
    }

    /**
     * @dev Transfer `value` amount of `token` from `from` to `to`, spending the approval given by `from` to the
     * calling contract. If `token` returns no value, non-reverting calls are assumed to be successful.
     */
    function safeTransferFrom(IERC20 token, address from, address to, uint256 value) internal {
        _callOptionalReturn(token, abi.encodeCall(token.transferFrom, (from, to, value)));
    }

    /**
     * @dev Increase the calling contract's allowance toward `spender` by `value`. If `token` returns no value,
     * non-reverting calls are assumed to be successful.
     */
    function safeIncreaseAllowance(IERC20 token, address spender, uint256 value) internal {
        uint256 oldAllowance = token.allowance(address(this), spender);
        forceApprove(token, spender, oldAllowance + value);
    }

    /**
     * @dev Decrease the calling contract's allowance toward `spender` by `requestedDecrease`. If `token` returns no
     * value, non-reverting calls are assumed to be successful.
     */
    function safeDecreaseAllowance(IERC20 token, address spender, uint256 requestedDecrease) internal {
        unchecked {
            uint256 currentAllowance = token.allowance(address(this), spender);
            if (currentAllowance < requestedDecrease) {
                revert SafeERC20FailedDecreaseAllowance(spender, currentAllowance, requestedDecrease);
            }
            forceApprove(token, spender, currentAllowance - requestedDecrease);
        }
    }

    /**
     * @dev Set the calling contract's allowance toward `spender` to `value`. If `token` returns no value,
     * non-reverting calls are assumed to be successful. Meant to be used with tokens that require the approval
     * to be set to zero before setting it to a non-zero value, such as USDT.
     */
    function forceApprove(IERC20 token, address spender, uint256 value) internal {
        bytes memory approvalCall = abi.encodeCall(token.approve, (spender, value));

        if (!_callOptionalReturnBool(token, approvalCall)) {
            _callOptionalReturn(token, abi.encodeCall(token.approve, (spender, 0)));
            _callOptionalReturn(token, approvalCall);
        }
    }

    /**
     * @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);
        if (returndata.length != 0 && !abi.decode(returndata, (bool))) {
            revert SafeERC20FailedOperation(address(token));
        }
    }

    /**
     * @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).
     *
     * This is a variant of {_callOptionalReturn} that silents catches all reverts and returns a bool instead.
     */
    function _callOptionalReturnBool(IERC20 token, bytes memory data) private returns (bool) {
        // 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 cannot use {Address-functionCall} here since this should return false
        // and not revert is the subcall reverts.

        (bool success, bytes memory returndata) = address(token).call(data);
        return success && (returndata.length == 0 || abi.decode(returndata, (bool))) && address(token).code.length > 0;
    }
}

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

pragma solidity ^0.8.20;

/**
 * @dev Collection of functions related to the address type
 */
library Address {
    /**
     * @dev The ETH balance of the account is not enough to perform the operation.
     */
    error AddressInsufficientBalance(address account);

    /**
     * @dev There's no code at `target` (it is not a contract).
     */
    error AddressEmptyCode(address target);

    /**
     * @dev A call to an address target failed. The target may have reverted.
     */
    error FailedInnerCall();

    /**
     * @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://consensys.net/diligence/blog/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.8.20/security-considerations.html#use-the-checks-effects-interactions-pattern[checks-effects-interactions pattern].
     */
    function sendValue(address payable recipient, uint256 amount) internal {
        if (address(this).balance < amount) {
            revert AddressInsufficientBalance(address(this));
        }

        (bool success, ) = recipient.call{value: amount}("");
        if (!success) {
            revert FailedInnerCall();
        }
    }

    /**
     * @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 or custom error, it is bubbled
     * up by this function (like regular Solidity function calls). However, if
     * the call reverted with no returned reason, this function reverts with a
     * {FailedInnerCall} error.
     *
     * 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.
     */
    function functionCall(address target, bytes memory data) internal returns (bytes memory) {
        return functionCallWithValue(target, data, 0);
    }

    /**
     * @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`.
     */
    function functionCallWithValue(address target, bytes memory data, uint256 value) internal returns (bytes memory) {
        if (address(this).balance < value) {
            revert AddressInsufficientBalance(address(this));
        }
        (bool success, bytes memory returndata) = target.call{value: value}(data);
        return verifyCallResultFromTarget(target, success, returndata);
    }

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

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

    /**
     * @dev Tool to verify that a low level call to smart-contract was successful, and reverts if the target
     * was not a contract or bubbling up the revert reason (falling back to {FailedInnerCall}) in case of an
     * unsuccessful call.
     */
    function verifyCallResultFromTarget(
        address target,
        bool success,
        bytes memory returndata
    ) internal view returns (bytes memory) {
        if (!success) {
            _revert(returndata);
        } else {
            // only check if target is a contract if the call was successful and the return data is empty
            // otherwise we already know that it was a contract
            if (returndata.length == 0 && target.code.length == 0) {
                revert AddressEmptyCode(target);
            }
            return returndata;
        }
    }

    /**
     * @dev Tool to verify that a low level call was successful, and reverts if it wasn't, either by bubbling the
     * revert reason or with a default {FailedInnerCall} error.
     */
    function verifyCallResult(bool success, bytes memory returndata) internal pure returns (bytes memory) {
        if (!success) {
            _revert(returndata);
        } else {
            return returndata;
        }
    }

    /**
     * @dev Reverts with returndata if present. Otherwise reverts with {FailedInnerCall}.
     */
    function _revert(bytes memory returndata) 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 FailedInnerCall();
        }
    }
}

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

pragma solidity ^0.8.20;

/**
 * @dev Contract module that helps prevent reentrant calls to a function.
 *
 * Inheriting from `ReentrancyGuard` will make the {nonReentrant} modifier
 * available, which can be applied to functions to make sure there are no nested
 * (reentrant) calls to them.
 *
 * Note that because there is a single `nonReentrant` guard, functions marked as
 * `nonReentrant` may not call one another. This can be worked around by making
 * those functions `private`, and then adding `external` `nonReentrant` entry
 * points to them.
 *
 * TIP: If you would like to learn more about reentrancy and alternative ways
 * to protect against it, check out our blog post
 * https://blog.openzeppelin.com/reentrancy-after-istanbul/[Reentrancy After Istanbul].
 */
abstract contract ReentrancyGuard {
    // Booleans are more expensive than uint256 or any type that takes up a full
    // word because each write operation emits an extra SLOAD to first read the
    // slot's contents, replace the bits taken up by the boolean, and then write
    // back. This is the compiler's defense against contract upgrades and
    // pointer aliasing, and it cannot be disabled.

    // The values being non-zero value makes deployment a bit more expensive,
    // but in exchange the refund on every call to nonReentrant will be lower in
    // amount. Since refunds are capped to a percentage of the total
    // transaction's gas, it is best to keep them low in cases like this one, to
    // increase the likelihood of the full refund coming into effect.
    uint256 private constant NOT_ENTERED = 1;
    uint256 private constant ENTERED = 2;

    uint256 private _status;

    /**
     * @dev Unauthorized reentrant call.
     */
    error ReentrancyGuardReentrantCall();

    constructor() {
        _status = NOT_ENTERED;
    }

    /**
     * @dev Prevents a contract from calling itself, directly or indirectly.
     * Calling a `nonReentrant` function from another `nonReentrant`
     * function is not supported. It is possible to prevent this from happening
     * by making the `nonReentrant` function external, and making it call a
     * `private` function that does the actual work.
     */
    modifier nonReentrant() {
        _nonReentrantBefore();
        _;
        _nonReentrantAfter();
    }

    function _nonReentrantBefore() private {
        // On the first call to nonReentrant, _status will be NOT_ENTERED
        if (_status == ENTERED) {
            revert ReentrancyGuardReentrantCall();
        }

        // Any calls to nonReentrant after this point will fail
        _status = ENTERED;
    }

    function _nonReentrantAfter() private {
        // By storing the original value once again, a refund is triggered (see
        // https://eips.ethereum.org/EIPS/eip-2200)
        _status = NOT_ENTERED;
    }

    /**
     * @dev Returns true if the reentrancy guard is currently set to "entered", which indicates there is a
     * `nonReentrant` function in the call stack.
     */
    function _reentrancyGuardEntered() internal view returns (bool) {
        return _status == ENTERED;
    }
}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.0.0) (utils/structs/EnumerableSet.sol)
// This file was procedurally generated from scripts/generate/templates/EnumerableSet.js.

pragma solidity ^0.8.20;

/**
 * @dev Library for managing
 * https://en.wikipedia.org/wiki/Set_(abstract_data_type)[sets] of primitive
 * types.
 *
 * Sets have the following properties:
 *
 * - Elements are added, removed, and checked for existence in constant time
 * (O(1)).
 * - Elements are enumerated in O(n). No guarantees are made on the ordering.
 *
 * ```solidity
 * contract Example {
 *     // Add the library methods
 *     using EnumerableSet for EnumerableSet.AddressSet;
 *
 *     // Declare a set state variable
 *     EnumerableSet.AddressSet private mySet;
 * }
 * ```
 *
 * As of v3.3.0, sets of type `bytes32` (`Bytes32Set`), `address` (`AddressSet`)
 * and `uint256` (`UintSet`) are supported.
 *
 * [WARNING]
 * ====
 * Trying to delete such a structure from storage will likely result in data corruption, rendering the structure
 * unusable.
 * See https://github.com/ethereum/solidity/pull/11843[ethereum/solidity#11843] for more info.
 *
 * In order to clean an EnumerableSet, you can either remove all elements one by one or create a fresh instance using an
 * array of EnumerableSet.
 * ====
 */
library EnumerableSet {
    // To implement this library for multiple types with as little code
    // repetition as possible, we write it in terms of a generic Set type with
    // bytes32 values.
    // The Set implementation uses private functions, and user-facing
    // implementations (such as AddressSet) are just wrappers around the
    // underlying Set.
    // This means that we can only create new EnumerableSets for types that fit
    // in bytes32.

    struct Set {
        // Storage of set values
        bytes32[] _values;
        // Position is the index of the value in the `values` array plus 1.
        // Position 0 is used to mean a value is not in the set.
        mapping(bytes32 value => uint256) _positions;
    }

    /**
     * @dev Add a value to a set. O(1).
     *
     * Returns true if the value was added to the set, that is if it was not
     * already present.
     */
    function _add(Set storage set, bytes32 value) private returns (bool) {
        if (!_contains(set, value)) {
            set._values.push(value);
            // The value is stored at length-1, but we add 1 to all indexes
            // and use 0 as a sentinel value
            set._positions[value] = set._values.length;
            return true;
        } else {
            return false;
        }
    }

    /**
     * @dev Removes a value from a set. O(1).
     *
     * Returns true if the value was removed from the set, that is if it was
     * present.
     */
    function _remove(Set storage set, bytes32 value) private returns (bool) {
        // We cache the value's position to prevent multiple reads from the same storage slot
        uint256 position = set._positions[value];

        if (position != 0) {
            // Equivalent to contains(set, value)
            // To delete an element from the _values array in O(1), we swap the element to delete with the last one in
            // the array, and then remove the last element (sometimes called as 'swap and pop').
            // This modifies the order of the array, as noted in {at}.

            uint256 valueIndex = position - 1;
            uint256 lastIndex = set._values.length - 1;

            if (valueIndex != lastIndex) {
                bytes32 lastValue = set._values[lastIndex];

                // Move the lastValue to the index where the value to delete is
                set._values[valueIndex] = lastValue;
                // Update the tracked position of the lastValue (that was just moved)
                set._positions[lastValue] = position;
            }

            // Delete the slot where the moved value was stored
            set._values.pop();

            // Delete the tracked position for the deleted slot
            delete set._positions[value];

            return true;
        } else {
            return false;
        }
    }

    /**
     * @dev Returns true if the value is in the set. O(1).
     */
    function _contains(Set storage set, bytes32 value) private view returns (bool) {
        return set._positions[value] != 0;
    }

    /**
     * @dev Returns the number of values on the set. O(1).
     */
    function _length(Set storage set) private view returns (uint256) {
        return set._values.length;
    }

    /**
     * @dev Returns the value stored at position `index` in the set. O(1).
     *
     * Note that there are no guarantees on the ordering of values inside the
     * array, and it may change when more values are added or removed.
     *
     * Requirements:
     *
     * - `index` must be strictly less than {length}.
     */
    function _at(Set storage set, uint256 index) private view returns (bytes32) {
        return set._values[index];
    }

    /**
     * @dev Return the entire set in an array
     *
     * WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed
     * to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that
     * this function has an unbounded cost, and using it as part of a state-changing function may render the function
     * uncallable if the set grows to a point where copying to memory consumes too much gas to fit in a block.
     */
    function _values(Set storage set) private view returns (bytes32[] memory) {
        return set._values;
    }

    // Bytes32Set

    struct Bytes32Set {
        Set _inner;
    }

    /**
     * @dev Add a value to a set. O(1).
     *
     * Returns true if the value was added to the set, that is if it was not
     * already present.
     */
    function add(Bytes32Set storage set, bytes32 value) internal returns (bool) {
        return _add(set._inner, value);
    }

    /**
     * @dev Removes a value from a set. O(1).
     *
     * Returns true if the value was removed from the set, that is if it was
     * present.
     */
    function remove(Bytes32Set storage set, bytes32 value) internal returns (bool) {
        return _remove(set._inner, value);
    }

    /**
     * @dev Returns true if the value is in the set. O(1).
     */
    function contains(Bytes32Set storage set, bytes32 value) internal view returns (bool) {
        return _contains(set._inner, value);
    }

    /**
     * @dev Returns the number of values in the set. O(1).
     */
    function length(Bytes32Set storage set) internal view returns (uint256) {
        return _length(set._inner);
    }

    /**
     * @dev Returns the value stored at position `index` in the set. O(1).
     *
     * Note that there are no guarantees on the ordering of values inside the
     * array, and it may change when more values are added or removed.
     *
     * Requirements:
     *
     * - `index` must be strictly less than {length}.
     */
    function at(Bytes32Set storage set, uint256 index) internal view returns (bytes32) {
        return _at(set._inner, index);
    }

    /**
     * @dev Return the entire set in an array
     *
     * WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed
     * to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that
     * this function has an unbounded cost, and using it as part of a state-changing function may render the function
     * uncallable if the set grows to a point where copying to memory consumes too much gas to fit in a block.
     */
    function values(Bytes32Set storage set) internal view returns (bytes32[] memory) {
        bytes32[] memory store = _values(set._inner);
        bytes32[] memory result;

        /// @solidity memory-safe-assembly
        assembly {
            result := store
        }

        return result;
    }

    // AddressSet

    struct AddressSet {
        Set _inner;
    }

    /**
     * @dev Add a value to a set. O(1).
     *
     * Returns true if the value was added to the set, that is if it was not
     * already present.
     */
    function add(AddressSet storage set, address value) internal returns (bool) {
        return _add(set._inner, bytes32(uint256(uint160(value))));
    }

    /**
     * @dev Removes a value from a set. O(1).
     *
     * Returns true if the value was removed from the set, that is if it was
     * present.
     */
    function remove(AddressSet storage set, address value) internal returns (bool) {
        return _remove(set._inner, bytes32(uint256(uint160(value))));
    }

    /**
     * @dev Returns true if the value is in the set. O(1).
     */
    function contains(AddressSet storage set, address value) internal view returns (bool) {
        return _contains(set._inner, bytes32(uint256(uint160(value))));
    }

    /**
     * @dev Returns the number of values in the set. O(1).
     */
    function length(AddressSet storage set) internal view returns (uint256) {
        return _length(set._inner);
    }

    /**
     * @dev Returns the value stored at position `index` in the set. O(1).
     *
     * Note that there are no guarantees on the ordering of values inside the
     * array, and it may change when more values are added or removed.
     *
     * Requirements:
     *
     * - `index` must be strictly less than {length}.
     */
    function at(AddressSet storage set, uint256 index) internal view returns (address) {
        return address(uint160(uint256(_at(set._inner, index))));
    }

    /**
     * @dev Return the entire set in an array
     *
     * WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed
     * to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that
     * this function has an unbounded cost, and using it as part of a state-changing function may render the function
     * uncallable if the set grows to a point where copying to memory consumes too much gas to fit in a block.
     */
    function values(AddressSet storage set) internal view returns (address[] memory) {
        bytes32[] memory store = _values(set._inner);
        address[] memory result;

        /// @solidity memory-safe-assembly
        assembly {
            result := store
        }

        return result;
    }

    // UintSet

    struct UintSet {
        Set _inner;
    }

    /**
     * @dev Add a value to a set. O(1).
     *
     * Returns true if the value was added to the set, that is if it was not
     * already present.
     */
    function add(UintSet storage set, uint256 value) internal returns (bool) {
        return _add(set._inner, bytes32(value));
    }

    /**
     * @dev Removes a value from a set. O(1).
     *
     * Returns true if the value was removed from the set, that is if it was
     * present.
     */
    function remove(UintSet storage set, uint256 value) internal returns (bool) {
        return _remove(set._inner, bytes32(value));
    }

    /**
     * @dev Returns true if the value is in the set. O(1).
     */
    function contains(UintSet storage set, uint256 value) internal view returns (bool) {
        return _contains(set._inner, bytes32(value));
    }

    /**
     * @dev Returns the number of values in the set. O(1).
     */
    function length(UintSet storage set) internal view returns (uint256) {
        return _length(set._inner);
    }

    /**
     * @dev Returns the value stored at position `index` in the set. O(1).
     *
     * Note that there are no guarantees on the ordering of values inside the
     * array, and it may change when more values are added or removed.
     *
     * Requirements:
     *
     * - `index` must be strictly less than {length}.
     */
    function at(UintSet storage set, uint256 index) internal view returns (uint256) {
        return uint256(_at(set._inner, index));
    }

    /**
     * @dev Return the entire set in an array
     *
     * WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed
     * to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that
     * this function has an unbounded cost, and using it as part of a state-changing function may render the function
     * uncallable if the set grows to a point where copying to memory consumes too much gas to fit in a block.
     */
    function values(UintSet storage set) internal view returns (uint256[] memory) {
        bytes32[] memory store = _values(set._inner);
        uint256[] memory result;

        /// @solidity memory-safe-assembly
        assembly {
            result := store
        }

        return result;
    }
}

// SPDX-License-Identifier: MIT

pragma solidity 0.8.25;

/**
 * @title Generic errors.
 * @author Gems team.
 * @notice Errors being used in more than one contract.
 */
interface Errors {
    /**
     * @dev Indicates a failure with the given address, for example,
     * `address(0)`.
     */
    error InvalidAddress();
    /**
     * @dev Indicates an error related to the given amount, for example, `0`.
     */
    error InvalidAmount();
    /**
     * @dev Indicates an error if the variable being assigned is identical to
     * the old variable.
     */
    error IdenticalVariableAssignment();
}

/**
 * @title Staking errors.
 * @author Gems team.
 * @notice Errors being used only in the Staking contract.
 */
interface StakingErrors is Errors {
    /**
     * @dev Indicates an error when a stake is performed after the stake time
     * limit has been reached.
     */
    error StakeTimeLimitReached();
    /**
     * @dev Indicates an error when a stake is performed after the stake amount
     * limit has been reached.
     */
    error StakeAmountLimitReached();
    /**
     * @dev Indicates an error related to ``staker``'s unstake request when the
     * amount of tokens staked is less than the `amount` requested to unstake.
     */
    error InvalidRequestUnstake(address staker, uint256 amount);
    /**
     * @dev Indicates an error related to staker's claim when the claim time
     * has not yet passed.
     */
    error ClaimTimeNotReached();
    /**
     * @dev Indicates an error related to staker's claim when there is no
     * amount of DOP token rewards to claim.
     */
    error NoRewardToClaim();
}

/**
 * @title Claiming errors.
 * @author Gems team.
 * @notice Errors being used only in the Claiming contract.
 */
interface ClaimingErrors is Errors {
    /**
     * @dev Indicates an error when the caller, `account`, is not authorized.
     */
    error ClaimingUnauthorizedAccount(address account);
    /**
     * @dev Indicates an error related to claimer's claim request when the
     * claim request time has not yet passed.
     */
    error ClaimRequestTimeNotReached();
    /**
     * @dev Indicates an error related to claimer's claim request when the
     * amount of tokens in the request is `0`.
     */
    error InvalidClaimRequest();
    /**
     * @dev Indicates a failure with the given array's length, i.e. array's
     * length is `0`.
     */
    error ZeroLengthArray();
}

// SPDX-License-Identifier: MIT

pragma solidity 0.8.25;

/**
 * @title Claiming contract interface.
 * @author Gems team.
 * @notice Interface for the Claiming contract.
 */
interface IClaiming {
    /* ========== FUNCTIONS ========== */

    /**
     * @notice Set a request to claim DOP tokens being unstaked from the Staking
     * contract. Only `staking` can call this function.
     * @param claimer Claimer who's DOP tokens are being held.
     * @param amount Amount of DOP tokens being unstaked.
     */
    function setRequest(address claimer, uint256 amount) external;

    /**
     * @notice Claim DOP tokens following the completion of a claim request.
     * @param index Claimer's index to claim request against.
     */
    function claimRequest(uint256 index) external;

    /**
     * @notice Claim DOP tokens following the completion of multiple claim
     * requests.
     * @param indexes List of claimer's indexes to claim requests against.
     */
    function claimMultipleRequests(uint256[] calldata indexes) external;

    /**
     * @notice Gives the request pertaining to the given unique request index.
     * @param index Request index to get the key for.
     * @return amount Amount of DOP tokens requested.
     * @return claimRequestTime Time after which requested DOP tokens will be
     * claimable.
     */
    function getRequest(uint256 index) external view returns (uint256, uint256);

    /**
     * @notice Gives a unique key pertaining to the given unique request index.
     * @param index Request index to get the key for.
     * @return key Key that is present for the given request index.
     */
    function getRequestKey(uint256 index) external view returns (bytes32);
}

// SPDX-License-Identifier: MIT

pragma solidity 0.8.25;

import { IClaiming } from "./IClaiming.sol";

/**
 * @title Staking contract interface.
 * @author Gems team.
 * @notice Interface for the Staking contract.
 */
interface IStaking {
    /* ========== FUNCTIONS ========== */

    /**
     * @notice Stake DOP tokens to earn rewards. Resets reward claim time.
     * CANNOT be called when paused.
     * @param amount Amount of DOP tokens to stake.
     */
    function stake(uint256 amount) external;

    /**
     * @notice Submit a request to unstake your DOP tokens.
     * @dev Performs necessary checks on staker's stake and transfers unstaked
     * tokens to the Claim contract for further processing.
     */
    function requestUnstake(uint256 amount) external;

    /**
     * @notice Claim DOP token rewards. CANNOT be called when claim time is not
     * reached.
     */
    function claim() external;

    /**
     * @notice Claim and restake DOP token rewards. CAN be called when claim
     * time is not reached. Resets reward claim time. CANNOT be called when
     * paused.
     */
    function claimAndRestake() external;

    /**
     * @notice Updates the DOP token rewards wallet. Only `owner` can call this
     * function.
     * @param newRewardWallet Address of the new DOP token rewards wallet.
     */
    function updateRewardWallet(address newRewardWallet) external;

    /**
     * @notice Updates the Claiming contract. Only `owner` can call this
     * function.
     * @param newClaiming Address of the mew Claiming contract.
     */
    function updateClaiming(IClaiming newClaiming) external;

    /**
     * @notice Change the state of the contract from unpaused to paused. Only
     * `owner` can call this function.
     */
    function pause() external;

    /**
     * @notice Change the state of the contract from paused to unpaused. Only
     * `owner` can call this function.
     */
    function unpause() external;

    /**
     * @notice Gives the last reward time where reward is calculable.
     * @return lastTimeReward Time until DOP token rewards should be
     * calculated.
     */
    function lastTimeRewardApplicable() external view returns (uint256);

    /**
     * @notice Gives the accumulated reward per DOP token staked.
     * @return rewardPerTokenStored Accumulated DOP token rewards per
     * individual DOP token staked.
     */
    function rewardPerToken() external view returns (uint256);

    /**
     * @notice Gives the DOP token reward for a given staker.
     * @param staker Staker to get reward for.
     * @return rewards Rewards calculated for the given staker.
     */
    function getReward(address staker) external view returns (uint256);
}

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

• No Contract Security Audit Submitted- Submit Audit Here

[{"inputs":[{"internalType":"contract IERC20","name":"initDOPToken","type":"address"},{"internalType":"contract IStaking","name":"initStaking","type":"address"}],"stateMutability":"nonpayable","type":"constructor"},{"inputs":[{"internalType":"address","name":"target","type":"address"}],"name":"AddressEmptyCode","type":"error"},{"inputs":[{"internalType":"address","name":"account","type":"address"}],"name":"AddressInsufficientBalance","type":"error"},{"inputs":[],"name":"ClaimRequestTimeNotReached","type":"error"},{"inputs":[{"internalType":"address","name":"account","type":"address"}],"name":"ClaimingUnauthorizedAccount","type":"error"},{"inputs":[],"name":"FailedInnerCall","type":"error"},{"inputs":[],"name":"IdenticalVariableAssignment","type":"error"},{"inputs":[],"name":"InvalidAddress","type":"error"},{"inputs":[],"name":"InvalidAmount","type":"error"},{"inputs":[],"name":"InvalidClaimRequest","type":"error"},{"inputs":[],"name":"ReentrancyGuardReentrantCall","type":"error"},{"inputs":[{"internalType":"address","name":"token","type":"address"}],"name":"SafeERC20FailedOperation","type":"error"},{"inputs":[],"name":"ZeroLengthArray","type":"error"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"claimer","type":"address"},{"indexed":false,"internalType":"uint256[]","name":"indexes","type":"uint256[]"}],"name":"MultipleRequestsClaimed","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"claimer","type":"address"},{"indexed":false,"internalType":"uint256","name":"index","type":"uint256"}],"name":"RequestClaimed","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"claimer","type":"address"},{"indexed":false,"internalType":"uint256","name":"index","type":"uint256"},{"indexed":false,"internalType":"uint256","name":"amount","type":"uint256"},{"indexed":false,"internalType":"uint256","name":"claimRequestTime","type":"uint256"}],"name":"RequestSet","type":"event"},{"inputs":[],"name":"DOP_TOKEN","outputs":[{"internalType":"contract IERC20","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"STAKING","outputs":[{"internalType":"contract IStaking","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256[]","name":"indexes","type":"uint256[]"}],"name":"claimMultipleRequests","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"index","type":"uint256"}],"name":"claimRequest","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"index","type":"uint256"}],"name":"getRequest","outputs":[{"internalType":"uint256","name":"","type":"uint256"},{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"index","type":"uint256"}],"name":"getRequestKey","outputs":[{"internalType":"bytes32","name":"","type":"bytes32"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"bytes32","name":"key","type":"bytes32"}],"name":"requests","outputs":[{"internalType":"uint256","name":"amount","type":"uint256"},{"internalType":"uint256","name":"claimRequestTime","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"claimer","type":"address"},{"internalType":"uint256","name":"amount","type":"uint256"}],"name":"setRequest","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"totalRequests","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"}]

0x608060405234801561001057600080fd5b50600436106100a35760003560e01c806397610f3011610076578063a3d6299d1161005b578063a3d6299d14610187578063c58343ef1461019a578063fd934e7d146101ad57600080fd5b806397610f30146100ff5780639d8669851461014b57600080fd5b80630571c46c146100a85780636e0a3949146100bd5780638aea61dc146100e35780638c8d28f0146100ec575b600080fd5b6100bb6100b6366004610c82565b6101d4565b005b6100d06100cb366004610cc7565b610469565b6040519081526020015b60405180910390f35b6100d060015481565b6100bb6100fa366004610ce0565b61047c565b6101267f000000000000000000000000f5c9f83c14db63ab8260a8d19d0b3ec8b1903e9281565b60405173ffffffffffffffffffffffffffffffffffffffff90911681526020016100da565b610172610159366004610cc7565b6004602052600090815260409020805460019091015482565b604080519283526020830191909152016100da565b6100bb610195366004610cc7565b61059f565b6101726101a8366004610cc7565b610634565b6101267f00000000000000000000000097a9a15168c22b3c137e6381037e1499c8ad097881565b6101dc61067e565b3373ffffffffffffffffffffffffffffffffffffffff7f000000000000000000000000f5c9f83c14db63ab8260a8d19d0b3ec8b1903e921614610252576040517f83f193320000000000000000000000000000000000000000000000000000000081523360048201526024015b60405180910390fd5b73ffffffffffffffffffffffffffffffffffffffff821661029f576040517fe6c4247b00000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b806000036102d9576040517f2c5211c600000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b60018054600091826102ea83610d84565b919050559050600061035184836040517fffffffffffffffffffffffffffffffffffffffff000000000000000000000000606084901b1660208201526034810182905260009060540160405160208183030381529060405280519060200120905092915050565b905061035e6002826106c1565b50600061036e62093a8042610dbc565b60408051808201825286815260208082018481526000878152600490925292902090518155905160019091015590506103ff73ffffffffffffffffffffffffffffffffffffffff7f00000000000000000000000097a9a15168c22b3c137e6381037e1499c8ad0978167f000000000000000000000000f5c9f83c14db63ab8260a8d19d0b3ec8b1903e9230876106d4565b604080518481526020810186905290810182905273ffffffffffffffffffffffffffffffffffffffff8616907fc0c27916f915dea6c1f6845aa4d007cc78da936bf2ad39960c29f969b66251d29060600160405180910390a25050506104656001600055565b5050565b6000610476600283610763565b92915050565b61048461067e565b8060008190036104c0576040517f0f59b9ff00000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b6000805b82811015610501576104ed8585838181106104e1576104e1610dcf565b9050602002013561076f565b6104f79083610dbc565b91506001016104c4565b5061054373ffffffffffffffffffffffffffffffffffffffff7f00000000000000000000000097a9a15168c22b3c137e6381037e1499c8ad097816338361088f565b3373ffffffffffffffffffffffffffffffffffffffff167fde92d80397dd41088e9e7c344af2e887462897d81fba1431c718ea8e99008ac8858560405161058b929190610dfe565b60405180910390a250506104656001600055565b6105a761067e565b6105f2336105b48361076f565b73ffffffffffffffffffffffffffffffffffffffff7f00000000000000000000000097a9a15168c22b3c137e6381037e1499c8ad097816919061088f565b60405181815233907fd38ba066489be3e0e63b07b5f77335d86ff35f7f8ab3301556fff258a008b85c9060200160405180910390a26106316001600055565b50565b60008080600481610646600287610763565b815260208082019290925260409081016000208151808301909252805480835260019091015491909201819052909590945092505050565b6002600054036106ba576040517f3ee5aeb500000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b6002600055565b60006106cd83836108d2565b9392505050565b60405173ffffffffffffffffffffffffffffffffffffffff848116602483015283811660448301526064820183905261075d9186918216906323b872dd906084015b604051602081830303815290604052915060e01b6020820180517bffffffffffffffffffffffffffffffffffffffffffffffffffffffff8381831617835250505050610921565b50505050565b60006106cd83836109b7565b604080517fffffffffffffffffffffffffffffffffffffffff0000000000000000000000003360601b16602080830191909152603480830185905283518084039091018152605483018085528151918301919091206000818152600490935284832060948501909552845480835260019095015460749094019390935290928303610826576040517fa218949b00000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b8060200151421015610864576040517f5b299b5900000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b61086f6002836109e1565b506000918252600460205260408220828155600101919091555192915050565b60405173ffffffffffffffffffffffffffffffffffffffff8381166024830152604482018390526108cd91859182169063a9059cbb90606401610716565b505050565b600081815260018301602052604081205461091957508154600181810184556000848152602080822090930184905584548482528286019093526040902091909155610476565b506000610476565b600061094373ffffffffffffffffffffffffffffffffffffffff8416836109ed565b905080516000141580156109685750808060200190518101906109669190610e50565b155b156108cd576040517f5274afe700000000000000000000000000000000000000000000000000000000815273ffffffffffffffffffffffffffffffffffffffff84166004820152602401610249565b60008260000182815481106109ce576109ce610dcf565b9060005260206000200154905092915050565b60006106cd83836109fb565b60606106cd83836000610aee565b60008181526001830160205260408120548015610ae4576000610a1f600183610e72565b8554909150600090610a3390600190610e72565b9050808214610a98576000866000018281548110610a5357610a53610dcf565b9060005260206000200154905080876000018481548110610a7657610a76610dcf565b6000918252602080832090910192909255918252600188019052604090208390555b8554869080610aa957610aa9610e85565b600190038181906000526020600020016000905590558560010160008681526020019081526020016000206000905560019350505050610476565b6000915050610476565b606081471015610b2c576040517fcd786059000000000000000000000000000000000000000000000000000000008152306004820152602401610249565b6000808573ffffffffffffffffffffffffffffffffffffffff168486604051610b559190610eb4565b60006040518083038185875af1925050503d8060008114610b92576040519150601f19603f3d011682016040523d82523d6000602084013e610b97565b606091505b5091509150610ba7868383610bb1565b9695505050505050565b606082610bc657610bc182610c40565b6106cd565b8151158015610bea575073ffffffffffffffffffffffffffffffffffffffff84163b155b15610c39576040517f9996b31500000000000000000000000000000000000000000000000000000000815273ffffffffffffffffffffffffffffffffffffffff85166004820152602401610249565b50806106cd565b805115610c505780518082602001fd5b6040517f1425ea4200000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b60008060408385031215610c9557600080fd5b823573ffffffffffffffffffffffffffffffffffffffff81168114610cb957600080fd5b946020939093013593505050565b600060208284031215610cd957600080fd5b5035919050565b60008060208385031215610cf357600080fd5b823567ffffffffffffffff80821115610d0b57600080fd5b818501915085601f830112610d1f57600080fd5b813581811115610d2e57600080fd5b8660208260051b8501011115610d4357600080fd5b60209290920196919550909350505050565b7f4e487b7100000000000000000000000000000000000000000000000000000000600052601160045260246000fd5b60007fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff8203610db557610db5610d55565b5060010190565b8082018082111561047657610476610d55565b7f4e487b7100000000000000000000000000000000000000000000000000000000600052603260045260246000fd5b6020815281602082015260007f07ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff831115610e3757600080fd5b8260051b80856040850137919091016040019392505050565b600060208284031215610e6257600080fd5b815180151581146106cd57600080fd5b8181038181111561047657610476610d55565b7f4e487b7100000000000000000000000000000000000000000000000000000000600052603160045260246000fd5b6000825160005b81811015610ed55760208186018101518583015201610ebb565b50600092019182525091905056fea2646970667358221220a66ccb39f1e813fdc80ec24a793fea076b492147fe03407907be067f99b5311764736f6c63430008190033