Contract Source Code (Solidity Standard Json-Input format)

IDE

• Blockscan IDE

More Options

• Similar
• Sol2Uml
• Submit Audit
• Compare

// SPDX-License-Identifier: MIT
pragma solidity ^0.8.0;

import {Ownable} from "@openzeppelin/contracts/access/Ownable.sol";
import {ReentrancyGuard} from "@openzeppelin/contracts/utils/ReentrancyGuard.sol";
import {Math} from "@openzeppelin/contracts/utils/math/Math.sol";
import {IERC20Metadata} from "@openzeppelin/contracts/token/ERC20/extensions/IERC20Metadata.sol";
import {IERC20} from "@openzeppelin/contracts/token/ERC20/IERC20.sol";
import {IOfferFactory} from "./interface/IOfferFactory.sol";

/**
 * @title PrivateMarket
 * @dev The PrivateMarket contract allows users to create private token orders, approve them, or cancel.
 * It handles transactions between buyers and sellers with commission fees.
 */
contract PrivateMarket is Ownable, ReentrancyGuard {
    using Math for uint256;

    /*------------------------------------------------ Events -------------------------------------------------------------*/

    /**
     * @dev Emitted when a new private order is created.
     * @param tokenAddress The address of the ERC20 token being traded.
     * @param tokenAmount The amount of tokens to be traded.
     * @param priceValue The price (in wei) for the trade.
     * @param buyerAddress The address of the buyer.
     * @param sellerAddress The address of the seller.
     * @param orderId The unique ID of the created order.
     */
    event CreatePrivateOrderEvent(
        address tokenAddress,
        uint256 tokenAmount,
        uint256 priceValue,
        address buyerAddress,
        address sellerAddress,
        uint256 orderId,
        uint256 influencerProfit,
        string tokenSymbol,
        string tokenName,
        uint8 tokenDecimals
    );
    /**
     * @dev Emitted when a private order is canceled.
     * @param orderId The ID of the canceled order.
     */
    event CancelPrivateOrderEvent(uint256 orderId);

    /**
     * @dev Emitted when a private order is approved (bought by the buyer).
     * @param orderId The ID of the approved order.
     */
    event ApprovePrivateOrderEvent(uint256 orderId, uint256 influencerProfit);

    /*------------------------------------------------ State variables -------------------------------------------------------------*/

    /** @dev Divider constant for commission calculations (1000 = 100%). */
    uint16 constant DIVIDER = 1000;

    /// @notice Amount representing percent amount
    uint16 constant PERCENT_DIVIDER = 100;

    /** @dev Order ID counter. */
    uint256 private orderId = 1;

    /** @dev Current commission percentage (in basis points). */
    uint16 public commissionPercent;

    /// @notice Address for commission transfer
    address public immutable factorySC;

    /** @dev Mapping to store private orders by their IDs. */
    mapping(uint256 => PrivateOrder) public privateOrders;

    /*------------------------------------------------ Enums -------------------------------------------------------------*/

    /**
     * @dev Enum representing the status of a private order.
     */
    enum OrderStatus {
        Created,
        Sold,
        Canceled
    }

    /*------------------------------------------------ Structs -------------------------------------------------------------*/

    /**
     * @dev Struct representing a private order.
     */
    struct PrivateOrder {
        address tokenAddress;
        uint256 tokenAmount;
        uint256 priceValue;
        address buyerAddress;
        address sellerAddress;
        OrderStatus status;
    }

    /*------------------------------------------------ Errors -------------------------------------------------------------*/

    /** @dev Reverts when the sent commission is incorrect. */
    error IncorrectCommission(
        uint256 providedValue,
        uint256 price,
        uint256 discount
    );

    /** @dev Reverts when the sent value is incorrect. */
    error IncorrectValue(
        uint256 providedValue,
        uint256 price,
        uint256 commission,
        uint256 discount
    );

    /** @dev Reverts if the order is not available or has invalid status. */
    error OrderNotAvailable(uint256 orderId, OrderStatus status);

    /** @dev Reverts if the caller is not the authorized buyer. */
    error UnauthorizedBuyer(address caller, address buyerAddress);

    /** @dev Reverts if the token transfer fails. */
    error TransferFailed();

    /** @dev Reverts if the caller is not the seller. */
    error UnauthorizedUser(address caller, address sellerAddress);

    /** @dev Reverts when the order cannot be canceled. */
    error OrderCannotBeCanceled(uint256 orderId, OrderStatus status);

    /** @dev Reverts when attempting to withdraw without available commission. */
    error NoCommissionToWithdraw();

    /** @dev Reverts when the provided token address is incorrect. */
    error IncorrectTokenAddress();

    /** @dev Reverts when a zero address is provided. */
    error InvalidAddress();

    /** @dev Reverts when a zero price value is provided. */
    error IncorrectPriceValue();

    /** @dev Reverts when a zero token amount is provided. */
    error IncorrectTokenAmount();

    /** @dev Reverts if the commission percentage exceeds the maximum limit. */
    error InvalidCommission();

    /*------------------------------------------------ Constructor -------------------------------------------------------------*/

    /**
     * @dev Initializes the contract with the owner and commission percentage.
     * @param _commissionPercent The commission percentage.
     * @param _factorySC The address of the withdrawal smart contract.
     */
    constructor(
        address initialOwner,
        uint16 _commissionPercent,
        address _factorySC
    ) Ownable(initialOwner) {
        commissionPercent = _commissionPercent;
        factorySC = _factorySC;
    }

    /*------------------------------------------------ Functions -------------------------------------------------------------*/

    /**
     * @notice Creates a private order for token trading.
     * @param _tokenAddress The address of the token.
     * @param _tokenAmount The amount of tokens.
     * @param _priceValue The price in wei.
     * @param _buyerAddress The buyer's address.
     * @dev Emits [CreatePrivateOrderEvent](#createprivateorderevent).
     */
    function createPrivateOrder(
        address _tokenAddress,
        uint256 _tokenAmount,
        uint256 _priceValue,
        address _buyerAddress
    ) external payable {
        if (_priceValue == 0) revert IncorrectPriceValue();

        if (_tokenAmount == 0) revert IncorrectTokenAmount();

        if (_buyerAddress == address(0)) revert InvalidAddress();

        if (_tokenAddress == address(0)) revert InvalidAddress();

        uint256 _orderId = orderId;

        IERC20Metadata erc20Metadata = IERC20Metadata(_tokenAddress);

        uint8 tokenDecimals = erc20Metadata.decimals();

        if (tokenDecimals == 0) revert IncorrectTokenAddress();

        (uint256 commissionValue, uint256 discount) = getCommissionValue(
            _priceValue
        );

        uint256 totalCommissionValue = commissionValue - discount;

        if (msg.value != totalCommissionValue)
            revert IncorrectCommission(msg.value, commissionValue, discount);

        (
            uint256 influencerProfit,
            uint16 influencerProfitPercent,
            address influencer
        ) = getRefferalsInfo(totalCommissionValue);

        if (influencerProfitPercent > 0 && influencerProfit > 0) {
            (bool ok, ) = payable(influencer).call{value: influencerProfit}("");
            if (!ok) revert TransferFailed();
        }

        privateOrders[_orderId] = PrivateOrder({
            tokenAddress: _tokenAddress,
            tokenAmount: _tokenAmount,
            priceValue: _priceValue,
            buyerAddress: _buyerAddress,
            sellerAddress: msg.sender,
            status: OrderStatus.Created
        });

        emit CreatePrivateOrderEvent(
            _tokenAddress,
            _tokenAmount,
            _priceValue,
            _buyerAddress,
            msg.sender,
            _orderId,
            influencerProfit,
            erc20Metadata.symbol(),
            erc20Metadata.name(),
            tokenDecimals
        );

        orderId++;
    }

    /**
     * @notice Allows the buyer to approve and buy the private order.
     * @param _orderId The ID of the private order.
     * @dev Emits [ApprovePrivateOrderEvent](#approveprivateorderevent).
     */
    function buyPrivateOrder(uint256 _orderId) external payable nonReentrant {
        PrivateOrder memory order = privateOrders[_orderId];

        if (order.status != OrderStatus.Created)
            revert OrderNotAvailable(_orderId, order.status);

        (uint256 commissionValue, uint256 discount) = getCommissionValue(
            order.priceValue
        );

        if (msg.value != order.priceValue + (commissionValue - discount))
            revert IncorrectValue(
                msg.value,
                order.priceValue,
                commissionValue,
                discount
            );

        if (order.buyerAddress != msg.sender)
            revert UnauthorizedBuyer(msg.sender, order.buyerAddress);

        privateOrders[_orderId].status = OrderStatus.Sold;

        bool tokenTransferSuccess = IERC20(order.tokenAddress).transferFrom(
            order.sellerAddress,
            order.buyerAddress,
            order.tokenAmount *
                (10 ** IERC20Metadata(order.tokenAddress).decimals())
        );

        if (!tokenTransferSuccess) revert TransferFailed();

        (
            uint256 influencerProfit,
            uint16 influencerProfitPercent,
            address influencer
        ) = getRefferalsInfo(commissionValue);

        if (influencerProfitPercent > 0 && influencerProfit > 0) {
            (bool ok, ) = payable(influencer).call{value: influencerProfit}("");
            if (!ok) revert TransferFailed();
        }

        (bool ethTransferSuccess, ) = order.sellerAddress.call{
            value: order.priceValue
        }("");
        if (!ethTransferSuccess) revert TransferFailed();

        emit ApprovePrivateOrderEvent(_orderId, influencerProfit);
    }

    /**
     * @notice Allows the seller to cancel a created private order.
     * @param _orderId The ID of the private order.
     * @dev Emits [CancelPrivateOrderEvent](#cancelprivateorderevent).
     */
    function cancelPrivateOrder(uint256 _orderId) external nonReentrant {
        PrivateOrder memory order = privateOrders[_orderId];
        if (order.sellerAddress != msg.sender)
            revert UnauthorizedUser(msg.sender, order.sellerAddress);

        if (order.status != OrderStatus.Created)
            revert OrderCannotBeCanceled(_orderId, order.status);

        privateOrders[_orderId].status = OrderStatus.Canceled;

        emit CancelPrivateOrderEvent(_orderId);
    }

    /**
     * @notice Allows the owner to set a new commission percentage.
     * @param _commissionPercent The new commission percentage.
     */
    function setCommission(uint16 _commissionPercent) external onlyOwner {
        if (_commissionPercent >= DIVIDER) {
            revert InvalidCommission();
        }

        commissionPercent = _commissionPercent;
    }

    /**
     * @notice Withdraws the accumulated commission to a specified address.
     * @param _to The address to withdraw funds to.
     */
    function withdrawCommission(address _to) external onlyOwner nonReentrant {
        (bool success, ) = _to.call{value: address(this).balance}("");
        if (!success) revert TransferFailed();
    }

    /**
     * @notice Calculates the commission value for a given amount.
     * @param value The base value to calculate the commission from.
     * @return commissionValue The calculated commission amount.
     * @dev This function uses `Math.mulDiv` for precise division.
     */
    function getCommissionValue(
        uint256 value
    ) internal view returns (uint256, uint256) {
        uint256 commissionValue = value.mulDiv(commissionPercent, DIVIDER);

        uint256 discountValueFromFactory = IOfferFactory(factorySC)
            .discountPercent();

        address influencer = IOfferFactory(factorySC).refferalToInfluencer(
            msg.sender
        );

        uint256 discount = influencer != address(0)
            ? commissionValue.mulDiv(discountValueFromFactory, PERCENT_DIVIDER)
            : 0;
        return (commissionValue, discount);
    }

    /**
     * @notice Returns the total commission balance available in the contract.
     * @return The current Ether balance of the contract.
     */
    function getCommissionBalance() external view returns (uint256) {
        return address(this).balance;
    }

    /**
     * @notice Function for calculating profit from refferal and getting influencer
     * @param commission Value of commission
     */
    function getRefferalsInfo(
        uint256 commission
    ) internal view returns (uint256, uint16, address) {
        IOfferFactory factory = IOfferFactory(factorySC);

        address influencer = factory.refferalToInfluencer(msg.sender);
        uint16 influencerProfitPercent = factory.influencerProfitPercents(
            influencer
        );

        uint256 influencerProfit = commission.mulDiv(
            influencerProfitPercent,
            DIVIDER
        );

        return (influencerProfit, influencerProfitPercent, influencer);
    }
}

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

pragma solidity ^0.8.20;

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

/**
 * @dev Interface for the optional metadata functions from the ERC-20 standard.
 */
interface IERC20Metadata is IERC20 {
    /**
     * @dev Returns the name of the token.
     */
    function name() external view returns (string memory);

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

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

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

pragma solidity ^0.8.20;

/**
 * @dev Interface of the ERC-20 standard as defined in the ERC.
 */
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.1.0) (utils/math/Math.sol)

pragma solidity ^0.8.20;

import {Panic} from "../Panic.sol";
import {SafeCast} from "./SafeCast.sol";

/**
 * @dev Standard math utilities missing in the Solidity language.
 */
library Math {
    enum Rounding {
        Floor, // Toward negative infinity
        Ceil, // Toward positive infinity
        Trunc, // Toward zero
        Expand // Away from zero
    }

    /**
     * @dev Returns the addition of two unsigned integers, with an success flag (no overflow).
     */
    function tryAdd(uint256 a, uint256 b) internal pure returns (bool success, uint256 result) {
        unchecked {
            uint256 c = a + b;
            if (c < a) return (false, 0);
            return (true, c);
        }
    }

    /**
     * @dev Returns the subtraction of two unsigned integers, with an success flag (no overflow).
     */
    function trySub(uint256 a, uint256 b) internal pure returns (bool success, uint256 result) {
        unchecked {
            if (b > a) return (false, 0);
            return (true, a - b);
        }
    }

    /**
     * @dev Returns the multiplication of two unsigned integers, with an success flag (no overflow).
     */
    function tryMul(uint256 a, uint256 b) internal pure returns (bool success, uint256 result) {
        unchecked {
            // Gas optimization: this is cheaper than requiring 'a' not being zero, but the
            // benefit is lost if 'b' is also tested.
            // See: https://github.com/OpenZeppelin/openzeppelin-contracts/pull/522
            if (a == 0) return (true, 0);
            uint256 c = a * b;
            if (c / a != b) return (false, 0);
            return (true, c);
        }
    }

    /**
     * @dev Returns the division of two unsigned integers, with a success flag (no division by zero).
     */
    function tryDiv(uint256 a, uint256 b) internal pure returns (bool success, uint256 result) {
        unchecked {
            if (b == 0) return (false, 0);
            return (true, a / b);
        }
    }

    /**
     * @dev Returns the remainder of dividing two unsigned integers, with a success flag (no division by zero).
     */
    function tryMod(uint256 a, uint256 b) internal pure returns (bool success, uint256 result) {
        unchecked {
            if (b == 0) return (false, 0);
            return (true, a % b);
        }
    }

    /**
     * @dev Branchless ternary evaluation for `a ? b : c`. Gas costs are constant.
     *
     * IMPORTANT: This function may reduce bytecode size and consume less gas when used standalone.
     * However, the compiler may optimize Solidity ternary operations (i.e. `a ? b : c`) to only compute
     * one branch when needed, making this function more expensive.
     */
    function ternary(bool condition, uint256 a, uint256 b) internal pure returns (uint256) {
        unchecked {
            // branchless ternary works because:
            // b ^ (a ^ b) == a
            // b ^ 0 == b
            return b ^ ((a ^ b) * SafeCast.toUint(condition));
        }
    }

    /**
     * @dev Returns the largest of two numbers.
     */
    function max(uint256 a, uint256 b) internal pure returns (uint256) {
        return ternary(a > b, a, b);
    }

    /**
     * @dev Returns the smallest of two numbers.
     */
    function min(uint256 a, uint256 b) internal pure returns (uint256) {
        return ternary(a < b, a, b);
    }

    /**
     * @dev Returns the average of two numbers. The result is rounded towards
     * zero.
     */
    function average(uint256 a, uint256 b) internal pure returns (uint256) {
        // (a + b) / 2 can overflow.
        return (a & b) + (a ^ b) / 2;
    }

    /**
     * @dev Returns the ceiling of the division of two numbers.
     *
     * This differs from standard division with `/` in that it rounds towards infinity instead
     * of rounding towards zero.
     */
    function ceilDiv(uint256 a, uint256 b) internal pure returns (uint256) {
        if (b == 0) {
            // Guarantee the same behavior as in a regular Solidity division.
            Panic.panic(Panic.DIVISION_BY_ZERO);
        }

        // The following calculation ensures accurate ceiling division without overflow.
        // Since a is non-zero, (a - 1) / b will not overflow.
        // The largest possible result occurs when (a - 1) / b is type(uint256).max,
        // but the largest value we can obtain is type(uint256).max - 1, which happens
        // when a = type(uint256).max and b = 1.
        unchecked {
            return SafeCast.toUint(a > 0) * ((a - 1) / b + 1);
        }
    }

    /**
     * @dev Calculates floor(x * y / denominator) with full precision. Throws if result overflows a uint256 or
     * denominator == 0.
     *
     * Original credit to Remco Bloemen under MIT license (https://xn--2-umb.com/21/muldiv) with further edits by
     * Uniswap Labs also under MIT license.
     */
    function mulDiv(uint256 x, uint256 y, uint256 denominator) internal pure returns (uint256 result) {
        unchecked {
            // 512-bit multiply [prod1 prod0] = x * y. Compute the product mod 2²⁵⁶ and mod 2²⁵⁶ - 1, then use
            // the Chinese Remainder Theorem to reconstruct the 512 bit result. The result is stored in two 256
            // variables such that product = prod1 * 2²⁵⁶ + prod0.
            uint256 prod0 = x * y; // Least significant 256 bits of the product
            uint256 prod1; // Most significant 256 bits of the product
            assembly {
                let mm := mulmod(x, y, not(0))
                prod1 := sub(sub(mm, prod0), lt(mm, prod0))
            }

            // Handle non-overflow cases, 256 by 256 division.
            if (prod1 == 0) {
                // Solidity will revert if denominator == 0, unlike the div opcode on its own.
                // The surrounding unchecked block does not change this fact.
                // See https://docs.soliditylang.org/en/latest/control-structures.html#checked-or-unchecked-arithmetic.
                return prod0 / denominator;
            }

            // Make sure the result is less than 2²⁵⁶. Also prevents denominator == 0.
            if (denominator <= prod1) {
                Panic.panic(ternary(denominator == 0, Panic.DIVISION_BY_ZERO, Panic.UNDER_OVERFLOW));
            }

            ///////////////////////////////////////////////
            // 512 by 256 division.
            ///////////////////////////////////////////////

            // Make division exact by subtracting the remainder from [prod1 prod0].
            uint256 remainder;
            assembly {
                // Compute remainder using mulmod.
                remainder := mulmod(x, y, denominator)

                // Subtract 256 bit number from 512 bit number.
                prod1 := sub(prod1, gt(remainder, prod0))
                prod0 := sub(prod0, remainder)
            }

            // Factor powers of two out of denominator and compute largest power of two divisor of denominator.
            // Always >= 1. See https://cs.stackexchange.com/q/138556/92363.

            uint256 twos = denominator & (0 - denominator);
            assembly {
                // Divide denominator by twos.
                denominator := div(denominator, twos)

                // Divide [prod1 prod0] by twos.
                prod0 := div(prod0, twos)

                // Flip twos such that it is 2²⁵⁶ / twos. If twos is zero, then it becomes one.
                twos := add(div(sub(0, twos), twos), 1)
            }

            // Shift in bits from prod1 into prod0.
            prod0 |= prod1 * twos;

            // Invert denominator mod 2²⁵⁶. Now that denominator is an odd number, it has an inverse modulo 2²⁵⁶ such
            // that denominator * inv ≡ 1 mod 2²⁵⁶. Compute the inverse by starting with a seed that is correct for
            // four bits. That is, denominator * inv ≡ 1 mod 2⁴.
            uint256 inverse = (3 * denominator) ^ 2;

            // Use the Newton-Raphson iteration to improve the precision. Thanks to Hensel's lifting lemma, this also
            // works in modular arithmetic, doubling the correct bits in each step.
            inverse *= 2 - denominator * inverse; // inverse mod 2⁸
            inverse *= 2 - denominator * inverse; // inverse mod 2¹⁶
            inverse *= 2 - denominator * inverse; // inverse mod 2³²
            inverse *= 2 - denominator * inverse; // inverse mod 2⁶⁴
            inverse *= 2 - denominator * inverse; // inverse mod 2¹²⁸
            inverse *= 2 - denominator * inverse; // inverse mod 2²⁵⁶

            // Because the division is now exact we can divide by multiplying with the modular inverse of denominator.
            // This will give us the correct result modulo 2²⁵⁶. Since the preconditions guarantee that the outcome is
            // less than 2²⁵⁶, this is the final result. We don't need to compute the high bits of the result and prod1
            // is no longer required.
            result = prod0 * inverse;
            return result;
        }
    }

    /**
     * @dev Calculates x * y / denominator with full precision, following the selected rounding direction.
     */
    function mulDiv(uint256 x, uint256 y, uint256 denominator, Rounding rounding) internal pure returns (uint256) {
        return mulDiv(x, y, denominator) + SafeCast.toUint(unsignedRoundsUp(rounding) && mulmod(x, y, denominator) > 0);
    }

    /**
     * @dev Calculate the modular multiplicative inverse of a number in Z/nZ.
     *
     * If n is a prime, then Z/nZ is a field. In that case all elements are inversible, except 0.
     * If n is not a prime, then Z/nZ is not a field, and some elements might not be inversible.
     *
     * If the input value is not inversible, 0 is returned.
     *
     * NOTE: If you know for sure that n is (big) a prime, it may be cheaper to use Fermat's little theorem and get the
     * inverse using `Math.modExp(a, n - 2, n)`. See {invModPrime}.
     */
    function invMod(uint256 a, uint256 n) internal pure returns (uint256) {
        unchecked {
            if (n == 0) return 0;

            // The inverse modulo is calculated using the Extended Euclidean Algorithm (iterative version)
            // Used to compute integers x and y such that: ax + ny = gcd(a, n).
            // When the gcd is 1, then the inverse of a modulo n exists and it's x.
            // ax + ny = 1
            // ax = 1 + (-y)n
            // ax ≡ 1 (mod n) # x is the inverse of a modulo n

            // If the remainder is 0 the gcd is n right away.
            uint256 remainder = a % n;
            uint256 gcd = n;

            // Therefore the initial coefficients are:
            // ax + ny = gcd(a, n) = n
            // 0a + 1n = n
            int256 x = 0;
            int256 y = 1;

            while (remainder != 0) {
                uint256 quotient = gcd / remainder;

                (gcd, remainder) = (
                    // The old remainder is the next gcd to try.
                    remainder,
                    // Compute the next remainder.
                    // Can't overflow given that (a % gcd) * (gcd // (a % gcd)) <= gcd
                    // where gcd is at most n (capped to type(uint256).max)
                    gcd - remainder * quotient
                );

                (x, y) = (
                    // Increment the coefficient of a.
                    y,
                    // Decrement the coefficient of n.
                    // Can overflow, but the result is casted to uint256 so that the
                    // next value of y is "wrapped around" to a value between 0 and n - 1.
                    x - y * int256(quotient)
                );
            }

            if (gcd != 1) return 0; // No inverse exists.
            return ternary(x < 0, n - uint256(-x), uint256(x)); // Wrap the result if it's negative.
        }
    }

    /**
     * @dev Variant of {invMod}. More efficient, but only works if `p` is known to be a prime greater than `2`.
     *
     * From https://en.wikipedia.org/wiki/Fermat%27s_little_theorem[Fermat's little theorem], we know that if p is
     * prime, then `a**(p-1) ≡ 1 mod p`. As a consequence, we have `a * a**(p-2) ≡ 1 mod p`, which means that
     * `a**(p-2)` is the modular multiplicative inverse of a in Fp.
     *
     * NOTE: this function does NOT check that `p` is a prime greater than `2`.
     */
    function invModPrime(uint256 a, uint256 p) internal view returns (uint256) {
        unchecked {
            return Math.modExp(a, p - 2, p);
        }
    }

    /**
     * @dev Returns the modular exponentiation of the specified base, exponent and modulus (b ** e % m)
     *
     * Requirements:
     * - modulus can't be zero
     * - underlying staticcall to precompile must succeed
     *
     * IMPORTANT: The result is only valid if the underlying call succeeds. When using this function, make
     * sure the chain you're using it on supports the precompiled contract for modular exponentiation
     * at address 0x05 as specified in https://eips.ethereum.org/EIPS/eip-198[EIP-198]. Otherwise,
     * the underlying function will succeed given the lack of a revert, but the result may be incorrectly
     * interpreted as 0.
     */
    function modExp(uint256 b, uint256 e, uint256 m) internal view returns (uint256) {
        (bool success, uint256 result) = tryModExp(b, e, m);
        if (!success) {
            Panic.panic(Panic.DIVISION_BY_ZERO);
        }
        return result;
    }

    /**
     * @dev Returns the modular exponentiation of the specified base, exponent and modulus (b ** e % m).
     * It includes a success flag indicating if the operation succeeded. Operation will be marked as failed if trying
     * to operate modulo 0 or if the underlying precompile reverted.
     *
     * IMPORTANT: The result is only valid if the success flag is true. When using this function, make sure the chain
     * you're using it on supports the precompiled contract for modular exponentiation at address 0x05 as specified in
     * https://eips.ethereum.org/EIPS/eip-198[EIP-198]. Otherwise, the underlying function will succeed given the lack
     * of a revert, but the result may be incorrectly interpreted as 0.
     */
    function tryModExp(uint256 b, uint256 e, uint256 m) internal view returns (bool success, uint256 result) {
        if (m == 0) return (false, 0);
        assembly ("memory-safe") {
            let ptr := mload(0x40)
            // | Offset    | Content    | Content (Hex)                                                      |
            // |-----------|------------|--------------------------------------------------------------------|
            // | 0x00:0x1f | size of b  | 0x0000000000000000000000000000000000000000000000000000000000000020 |
            // | 0x20:0x3f | size of e  | 0x0000000000000000000000000000000000000000000000000000000000000020 |
            // | 0x40:0x5f | size of m  | 0x0000000000000000000000000000000000000000000000000000000000000020 |
            // | 0x60:0x7f | value of b | 0x<.............................................................b> |
            // | 0x80:0x9f | value of e | 0x<.............................................................e> |
            // | 0xa0:0xbf | value of m | 0x<.............................................................m> |
            mstore(ptr, 0x20)
            mstore(add(ptr, 0x20), 0x20)
            mstore(add(ptr, 0x40), 0x20)
            mstore(add(ptr, 0x60), b)
            mstore(add(ptr, 0x80), e)
            mstore(add(ptr, 0xa0), m)

            // Given the result < m, it's guaranteed to fit in 32 bytes,
            // so we can use the memory scratch space located at offset 0.
            success := staticcall(gas(), 0x05, ptr, 0xc0, 0x00, 0x20)
            result := mload(0x00)
        }
    }

    /**
     * @dev Variant of {modExp} that supports inputs of arbitrary length.
     */
    function modExp(bytes memory b, bytes memory e, bytes memory m) internal view returns (bytes memory) {
        (bool success, bytes memory result) = tryModExp(b, e, m);
        if (!success) {
            Panic.panic(Panic.DIVISION_BY_ZERO);
        }
        return result;
    }

    /**
     * @dev Variant of {tryModExp} that supports inputs of arbitrary length.
     */
    function tryModExp(
        bytes memory b,
        bytes memory e,
        bytes memory m
    ) internal view returns (bool success, bytes memory result) {
        if (_zeroBytes(m)) return (false, new bytes(0));

        uint256 mLen = m.length;

        // Encode call args in result and move the free memory pointer
        result = abi.encodePacked(b.length, e.length, mLen, b, e, m);

        assembly ("memory-safe") {
            let dataPtr := add(result, 0x20)
            // Write result on top of args to avoid allocating extra memory.
            success := staticcall(gas(), 0x05, dataPtr, mload(result), dataPtr, mLen)
            // Overwrite the length.
            // result.length > returndatasize() is guaranteed because returndatasize() == m.length
            mstore(result, mLen)
            // Set the memory pointer after the returned data.
            mstore(0x40, add(dataPtr, mLen))
        }
    }

    /**
     * @dev Returns whether the provided byte array is zero.
     */
    function _zeroBytes(bytes memory byteArray) private pure returns (bool) {
        for (uint256 i = 0; i < byteArray.length; ++i) {
            if (byteArray[i] != 0) {
                return false;
            }
        }
        return true;
    }

    /**
     * @dev Returns the square root of a number. If the number is not a perfect square, the value is rounded
     * towards zero.
     *
     * This method is based on Newton's method for computing square roots; the algorithm is restricted to only
     * using integer operations.
     */
    function sqrt(uint256 a) internal pure returns (uint256) {
        unchecked {
            // Take care of easy edge cases when a == 0 or a == 1
            if (a <= 1) {
                return a;
            }

            // In this function, we use Newton's method to get a root of `f(x) := x² - a`. It involves building a
            // sequence x_n that converges toward sqrt(a). For each iteration x_n, we also define the error between
            // the current value as `ε_n = | x_n - sqrt(a) |`.
            //
            // For our first estimation, we consider `e` the smallest power of 2 which is bigger than the square root
            // of the target. (i.e. `2**(e-1) ≤ sqrt(a) < 2**e`). We know that `e ≤ 128` because `(2¹²⁸)² = 2²⁵⁶` is
            // bigger than any uint256.
            //
            // By noticing that
            // `2**(e-1) ≤ sqrt(a) < 2**e → (2**(e-1))² ≤ a < (2**e)² → 2**(2*e-2) ≤ a < 2**(2*e)`
            // we can deduce that `e - 1` is `log2(a) / 2`. We can thus compute `x_n = 2**(e-1)` using a method similar
            // to the msb function.
            uint256 aa = a;
            uint256 xn = 1;

            if (aa >= (1 << 128)) {
                aa >>= 128;
                xn <<= 64;
            }
            if (aa >= (1 << 64)) {
                aa >>= 64;
                xn <<= 32;
            }
            if (aa >= (1 << 32)) {
                aa >>= 32;
                xn <<= 16;
            }
            if (aa >= (1 << 16)) {
                aa >>= 16;
                xn <<= 8;
            }
            if (aa >= (1 << 8)) {
                aa >>= 8;
                xn <<= 4;
            }
            if (aa >= (1 << 4)) {
                aa >>= 4;
                xn <<= 2;
            }
            if (aa >= (1 << 2)) {
                xn <<= 1;
            }

            // We now have x_n such that `x_n = 2**(e-1) ≤ sqrt(a) < 2**e = 2 * x_n`. This implies ε_n ≤ 2**(e-1).
            //
            // We can refine our estimation by noticing that the middle of that interval minimizes the error.
            // If we move x_n to equal 2**(e-1) + 2**(e-2), then we reduce the error to ε_n ≤ 2**(e-2).
            // This is going to be our x_0 (and ε_0)
            xn = (3 * xn) >> 1; // ε_0 := | x_0 - sqrt(a) | ≤ 2**(e-2)

            // From here, Newton's method give us:
            // x_{n+1} = (x_n + a / x_n) / 2
            //
            // One should note that:
            // x_{n+1}² - a = ((x_n + a / x_n) / 2)² - a
            //              = ((x_n² + a) / (2 * x_n))² - a
            //              = (x_n⁴ + 2 * a * x_n² + a²) / (4 * x_n²) - a
            //              = (x_n⁴ + 2 * a * x_n² + a² - 4 * a * x_n²) / (4 * x_n²)
            //              = (x_n⁴ - 2 * a * x_n² + a²) / (4 * x_n²)
            //              = (x_n² - a)² / (2 * x_n)²
            //              = ((x_n² - a) / (2 * x_n))²
            //              ≥ 0
            // Which proves that for all n ≥ 1, sqrt(a) ≤ x_n
            //
            // This gives us the proof of quadratic convergence of the sequence:
            // ε_{n+1} = | x_{n+1} - sqrt(a) |
            //         = | (x_n + a / x_n) / 2 - sqrt(a) |
            //         = | (x_n² + a - 2*x_n*sqrt(a)) / (2 * x_n) |
            //         = | (x_n - sqrt(a))² / (2 * x_n) |
            //         = | ε_n² / (2 * x_n) |
            //         = ε_n² / | (2 * x_n) |
            //
            // For the first iteration, we have a special case where x_0 is known:
            // ε_1 = ε_0² / | (2 * x_0) |
            //     ≤ (2**(e-2))² / (2 * (2**(e-1) + 2**(e-2)))
            //     ≤ 2**(2*e-4) / (3 * 2**(e-1))
            //     ≤ 2**(e-3) / 3
            //     ≤ 2**(e-3-log2(3))
            //     ≤ 2**(e-4.5)
            //
            // For the following iterations, we use the fact that, 2**(e-1) ≤ sqrt(a) ≤ x_n:
            // ε_{n+1} = ε_n² / | (2 * x_n) |
            //         ≤ (2**(e-k))² / (2 * 2**(e-1))
            //         ≤ 2**(2*e-2*k) / 2**e
            //         ≤ 2**(e-2*k)
            xn = (xn + a / xn) >> 1; // ε_1 := | x_1 - sqrt(a) | ≤ 2**(e-4.5)  -- special case, see above
            xn = (xn + a / xn) >> 1; // ε_2 := | x_2 - sqrt(a) | ≤ 2**(e-9)    -- general case with k = 4.5
            xn = (xn + a / xn) >> 1; // ε_3 := | x_3 - sqrt(a) | ≤ 2**(e-18)   -- general case with k = 9
            xn = (xn + a / xn) >> 1; // ε_4 := | x_4 - sqrt(a) | ≤ 2**(e-36)   -- general case with k = 18
            xn = (xn + a / xn) >> 1; // ε_5 := | x_5 - sqrt(a) | ≤ 2**(e-72)   -- general case with k = 36
            xn = (xn + a / xn) >> 1; // ε_6 := | x_6 - sqrt(a) | ≤ 2**(e-144)  -- general case with k = 72

            // Because e ≤ 128 (as discussed during the first estimation phase), we know have reached a precision
            // ε_6 ≤ 2**(e-144) < 1. Given we're operating on integers, then we can ensure that xn is now either
            // sqrt(a) or sqrt(a) + 1.
            return xn - SafeCast.toUint(xn > a / xn);
        }
    }

    /**
     * @dev Calculates sqrt(a), following the selected rounding direction.
     */
    function sqrt(uint256 a, Rounding rounding) internal pure returns (uint256) {
        unchecked {
            uint256 result = sqrt(a);
            return result + SafeCast.toUint(unsignedRoundsUp(rounding) && result * result < a);
        }
    }

    /**
     * @dev Return the log in base 2 of a positive value rounded towards zero.
     * Returns 0 if given 0.
     */
    function log2(uint256 value) internal pure returns (uint256) {
        uint256 result = 0;
        uint256 exp;
        unchecked {
            exp = 128 * SafeCast.toUint(value > (1 << 128) - 1);
            value >>= exp;
            result += exp;

            exp = 64 * SafeCast.toUint(value > (1 << 64) - 1);
            value >>= exp;
            result += exp;

            exp = 32 * SafeCast.toUint(value > (1 << 32) - 1);
            value >>= exp;
            result += exp;

            exp = 16 * SafeCast.toUint(value > (1 << 16) - 1);
            value >>= exp;
            result += exp;

            exp = 8 * SafeCast.toUint(value > (1 << 8) - 1);
            value >>= exp;
            result += exp;

            exp = 4 * SafeCast.toUint(value > (1 << 4) - 1);
            value >>= exp;
            result += exp;

            exp = 2 * SafeCast.toUint(value > (1 << 2) - 1);
            value >>= exp;
            result += exp;

            result += SafeCast.toUint(value > 1);
        }
        return result;
    }

    /**
     * @dev Return the log in base 2, following the selected rounding direction, of a positive value.
     * Returns 0 if given 0.
     */
    function log2(uint256 value, Rounding rounding) internal pure returns (uint256) {
        unchecked {
            uint256 result = log2(value);
            return result + SafeCast.toUint(unsignedRoundsUp(rounding) && 1 << result < value);
        }
    }

    /**
     * @dev Return the log in base 10 of a positive value rounded towards zero.
     * Returns 0 if given 0.
     */
    function log10(uint256 value) internal pure returns (uint256) {
        uint256 result = 0;
        unchecked {
            if (value >= 10 ** 64) {
                value /= 10 ** 64;
                result += 64;
            }
            if (value >= 10 ** 32) {
                value /= 10 ** 32;
                result += 32;
            }
            if (value >= 10 ** 16) {
                value /= 10 ** 16;
                result += 16;
            }
            if (value >= 10 ** 8) {
                value /= 10 ** 8;
                result += 8;
            }
            if (value >= 10 ** 4) {
                value /= 10 ** 4;
                result += 4;
            }
            if (value >= 10 ** 2) {
                value /= 10 ** 2;
                result += 2;
            }
            if (value >= 10 ** 1) {
                result += 1;
            }
        }
        return result;
    }

    /**
     * @dev Return the log in base 10, following the selected rounding direction, of a positive value.
     * Returns 0 if given 0.
     */
    function log10(uint256 value, Rounding rounding) internal pure returns (uint256) {
        unchecked {
            uint256 result = log10(value);
            return result + SafeCast.toUint(unsignedRoundsUp(rounding) && 10 ** result < value);
        }
    }

    /**
     * @dev Return the log in base 256 of a positive value rounded towards zero.
     * Returns 0 if given 0.
     *
     * Adding one to the result gives the number of pairs of hex symbols needed to represent `value` as a hex string.
     */
    function log256(uint256 value) internal pure returns (uint256) {
        uint256 result = 0;
        uint256 isGt;
        unchecked {
            isGt = SafeCast.toUint(value > (1 << 128) - 1);
            value >>= isGt * 128;
            result += isGt * 16;

            isGt = SafeCast.toUint(value > (1 << 64) - 1);
            value >>= isGt * 64;
            result += isGt * 8;

            isGt = SafeCast.toUint(value > (1 << 32) - 1);
            value >>= isGt * 32;
            result += isGt * 4;

            isGt = SafeCast.toUint(value > (1 << 16) - 1);
            value >>= isGt * 16;
            result += isGt * 2;

            result += SafeCast.toUint(value > (1 << 8) - 1);
        }
        return result;
    }

    /**
     * @dev Return the log in base 256, following the selected rounding direction, of a positive value.
     * Returns 0 if given 0.
     */
    function log256(uint256 value, Rounding rounding) internal pure returns (uint256) {
        unchecked {
            uint256 result = log256(value);
            return result + SafeCast.toUint(unsignedRoundsUp(rounding) && 1 << (result << 3) < value);
        }
    }

    /**
     * @dev Returns whether a provided rounding mode is considered rounding up for unsigned integers.
     */
    function unsignedRoundsUp(Rounding rounding) internal pure returns (bool) {
        return uint8(rounding) % 2 == 1;
    }
}

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

pragma solidity ^0.8.20;

/**
 * @dev Wrappers over Solidity's uintXX/intXX/bool casting operators with added overflow
 * checks.
 *
 * Downcasting from uint256/int256 in Solidity does not revert on overflow. This can
 * easily result in undesired exploitation or bugs, since developers usually
 * assume that overflows raise errors. `SafeCast` restores this intuition by
 * reverting the transaction when such an operation overflows.
 *
 * Using this library instead of the unchecked operations eliminates an entire
 * class of bugs, so it's recommended to use it always.
 */
library SafeCast {
    /**
     * @dev Value doesn't fit in an uint of `bits` size.
     */
    error SafeCastOverflowedUintDowncast(uint8 bits, uint256 value);

    /**
     * @dev An int value doesn't fit in an uint of `bits` size.
     */
    error SafeCastOverflowedIntToUint(int256 value);

    /**
     * @dev Value doesn't fit in an int of `bits` size.
     */
    error SafeCastOverflowedIntDowncast(uint8 bits, int256 value);

    /**
     * @dev An uint value doesn't fit in an int of `bits` size.
     */
    error SafeCastOverflowedUintToInt(uint256 value);

    /**
     * @dev Returns the downcasted uint248 from uint256, reverting on
     * overflow (when the input is greater than largest uint248).
     *
     * Counterpart to Solidity's `uint248` operator.
     *
     * Requirements:
     *
     * - input must fit into 248 bits
     */
    function toUint248(uint256 value) internal pure returns (uint248) {
        if (value > type(uint248).max) {
            revert SafeCastOverflowedUintDowncast(248, value);
        }
        return uint248(value);
    }

    /**
     * @dev Returns the downcasted uint240 from uint256, reverting on
     * overflow (when the input is greater than largest uint240).
     *
     * Counterpart to Solidity's `uint240` operator.
     *
     * Requirements:
     *
     * - input must fit into 240 bits
     */
    function toUint240(uint256 value) internal pure returns (uint240) {
        if (value > type(uint240).max) {
            revert SafeCastOverflowedUintDowncast(240, value);
        }
        return uint240(value);
    }

    /**
     * @dev Returns the downcasted uint232 from uint256, reverting on
     * overflow (when the input is greater than largest uint232).
     *
     * Counterpart to Solidity's `uint232` operator.
     *
     * Requirements:
     *
     * - input must fit into 232 bits
     */
    function toUint232(uint256 value) internal pure returns (uint232) {
        if (value > type(uint232).max) {
            revert SafeCastOverflowedUintDowncast(232, value);
        }
        return uint232(value);
    }

    /**
     * @dev Returns the downcasted uint224 from uint256, reverting on
     * overflow (when the input is greater than largest uint224).
     *
     * Counterpart to Solidity's `uint224` operator.
     *
     * Requirements:
     *
     * - input must fit into 224 bits
     */
    function toUint224(uint256 value) internal pure returns (uint224) {
        if (value > type(uint224).max) {
            revert SafeCastOverflowedUintDowncast(224, value);
        }
        return uint224(value);
    }

    /**
     * @dev Returns the downcasted uint216 from uint256, reverting on
     * overflow (when the input is greater than largest uint216).
     *
     * Counterpart to Solidity's `uint216` operator.
     *
     * Requirements:
     *
     * - input must fit into 216 bits
     */
    function toUint216(uint256 value) internal pure returns (uint216) {
        if (value > type(uint216).max) {
            revert SafeCastOverflowedUintDowncast(216, value);
        }
        return uint216(value);
    }

    /**
     * @dev Returns the downcasted uint208 from uint256, reverting on
     * overflow (when the input is greater than largest uint208).
     *
     * Counterpart to Solidity's `uint208` operator.
     *
     * Requirements:
     *
     * - input must fit into 208 bits
     */
    function toUint208(uint256 value) internal pure returns (uint208) {
        if (value > type(uint208).max) {
            revert SafeCastOverflowedUintDowncast(208, value);
        }
        return uint208(value);
    }

    /**
     * @dev Returns the downcasted uint200 from uint256, reverting on
     * overflow (when the input is greater than largest uint200).
     *
     * Counterpart to Solidity's `uint200` operator.
     *
     * Requirements:
     *
     * - input must fit into 200 bits
     */
    function toUint200(uint256 value) internal pure returns (uint200) {
        if (value > type(uint200).max) {
            revert SafeCastOverflowedUintDowncast(200, value);
        }
        return uint200(value);
    }

    /**
     * @dev Returns the downcasted uint192 from uint256, reverting on
     * overflow (when the input is greater than largest uint192).
     *
     * Counterpart to Solidity's `uint192` operator.
     *
     * Requirements:
     *
     * - input must fit into 192 bits
     */
    function toUint192(uint256 value) internal pure returns (uint192) {
        if (value > type(uint192).max) {
            revert SafeCastOverflowedUintDowncast(192, value);
        }
        return uint192(value);
    }

    /**
     * @dev Returns the downcasted uint184 from uint256, reverting on
     * overflow (when the input is greater than largest uint184).
     *
     * Counterpart to Solidity's `uint184` operator.
     *
     * Requirements:
     *
     * - input must fit into 184 bits
     */
    function toUint184(uint256 value) internal pure returns (uint184) {
        if (value > type(uint184).max) {
            revert SafeCastOverflowedUintDowncast(184, value);
        }
        return uint184(value);
    }

    /**
     * @dev Returns the downcasted uint176 from uint256, reverting on
     * overflow (when the input is greater than largest uint176).
     *
     * Counterpart to Solidity's `uint176` operator.
     *
     * Requirements:
     *
     * - input must fit into 176 bits
     */
    function toUint176(uint256 value) internal pure returns (uint176) {
        if (value > type(uint176).max) {
            revert SafeCastOverflowedUintDowncast(176, value);
        }
        return uint176(value);
    }

    /**
     * @dev Returns the downcasted uint168 from uint256, reverting on
     * overflow (when the input is greater than largest uint168).
     *
     * Counterpart to Solidity's `uint168` operator.
     *
     * Requirements:
     *
     * - input must fit into 168 bits
     */
    function toUint168(uint256 value) internal pure returns (uint168) {
        if (value > type(uint168).max) {
            revert SafeCastOverflowedUintDowncast(168, value);
        }
        return uint168(value);
    }

    /**
     * @dev Returns the downcasted uint160 from uint256, reverting on
     * overflow (when the input is greater than largest uint160).
     *
     * Counterpart to Solidity's `uint160` operator.
     *
     * Requirements:
     *
     * - input must fit into 160 bits
     */
    function toUint160(uint256 value) internal pure returns (uint160) {
        if (value > type(uint160).max) {
            revert SafeCastOverflowedUintDowncast(160, value);
        }
        return uint160(value);
    }

    /**
     * @dev Returns the downcasted uint152 from uint256, reverting on
     * overflow (when the input is greater than largest uint152).
     *
     * Counterpart to Solidity's `uint152` operator.
     *
     * Requirements:
     *
     * - input must fit into 152 bits
     */
    function toUint152(uint256 value) internal pure returns (uint152) {
        if (value > type(uint152).max) {
            revert SafeCastOverflowedUintDowncast(152, value);
        }
        return uint152(value);
    }

    /**
     * @dev Returns the downcasted uint144 from uint256, reverting on
     * overflow (when the input is greater than largest uint144).
     *
     * Counterpart to Solidity's `uint144` operator.
     *
     * Requirements:
     *
     * - input must fit into 144 bits
     */
    function toUint144(uint256 value) internal pure returns (uint144) {
        if (value > type(uint144).max) {
            revert SafeCastOverflowedUintDowncast(144, value);
        }
        return uint144(value);
    }

    /**
     * @dev Returns the downcasted uint136 from uint256, reverting on
     * overflow (when the input is greater than largest uint136).
     *
     * Counterpart to Solidity's `uint136` operator.
     *
     * Requirements:
     *
     * - input must fit into 136 bits
     */
    function toUint136(uint256 value) internal pure returns (uint136) {
        if (value > type(uint136).max) {
            revert SafeCastOverflowedUintDowncast(136, value);
        }
        return uint136(value);
    }

    /**
     * @dev Returns the downcasted uint128 from uint256, reverting on
     * overflow (when the input is greater than largest uint128).
     *
     * Counterpart to Solidity's `uint128` operator.
     *
     * Requirements:
     *
     * - input must fit into 128 bits
     */
    function toUint128(uint256 value) internal pure returns (uint128) {
        if (value > type(uint128).max) {
            revert SafeCastOverflowedUintDowncast(128, value);
        }
        return uint128(value);
    }

    /**
     * @dev Returns the downcasted uint120 from uint256, reverting on
     * overflow (when the input is greater than largest uint120).
     *
     * Counterpart to Solidity's `uint120` operator.
     *
     * Requirements:
     *
     * - input must fit into 120 bits
     */
    function toUint120(uint256 value) internal pure returns (uint120) {
        if (value > type(uint120).max) {
            revert SafeCastOverflowedUintDowncast(120, value);
        }
        return uint120(value);
    }

    /**
     * @dev Returns the downcasted uint112 from uint256, reverting on
     * overflow (when the input is greater than largest uint112).
     *
     * Counterpart to Solidity's `uint112` operator.
     *
     * Requirements:
     *
     * - input must fit into 112 bits
     */
    function toUint112(uint256 value) internal pure returns (uint112) {
        if (value > type(uint112).max) {
            revert SafeCastOverflowedUintDowncast(112, value);
        }
        return uint112(value);
    }

    /**
     * @dev Returns the downcasted uint104 from uint256, reverting on
     * overflow (when the input is greater than largest uint104).
     *
     * Counterpart to Solidity's `uint104` operator.
     *
     * Requirements:
     *
     * - input must fit into 104 bits
     */
    function toUint104(uint256 value) internal pure returns (uint104) {
        if (value > type(uint104).max) {
            revert SafeCastOverflowedUintDowncast(104, value);
        }
        return uint104(value);
    }

    /**
     * @dev Returns the downcasted uint96 from uint256, reverting on
     * overflow (when the input is greater than largest uint96).
     *
     * Counterpart to Solidity's `uint96` operator.
     *
     * Requirements:
     *
     * - input must fit into 96 bits
     */
    function toUint96(uint256 value) internal pure returns (uint96) {
        if (value > type(uint96).max) {
            revert SafeCastOverflowedUintDowncast(96, value);
        }
        return uint96(value);
    }

    /**
     * @dev Returns the downcasted uint88 from uint256, reverting on
     * overflow (when the input is greater than largest uint88).
     *
     * Counterpart to Solidity's `uint88` operator.
     *
     * Requirements:
     *
     * - input must fit into 88 bits
     */
    function toUint88(uint256 value) internal pure returns (uint88) {
        if (value > type(uint88).max) {
            revert SafeCastOverflowedUintDowncast(88, value);
        }
        return uint88(value);
    }

    /**
     * @dev Returns the downcasted uint80 from uint256, reverting on
     * overflow (when the input is greater than largest uint80).
     *
     * Counterpart to Solidity's `uint80` operator.
     *
     * Requirements:
     *
     * - input must fit into 80 bits
     */
    function toUint80(uint256 value) internal pure returns (uint80) {
        if (value > type(uint80).max) {
            revert SafeCastOverflowedUintDowncast(80, value);
        }
        return uint80(value);
    }

    /**
     * @dev Returns the downcasted uint72 from uint256, reverting on
     * overflow (when the input is greater than largest uint72).
     *
     * Counterpart to Solidity's `uint72` operator.
     *
     * Requirements:
     *
     * - input must fit into 72 bits
     */
    function toUint72(uint256 value) internal pure returns (uint72) {
        if (value > type(uint72).max) {
            revert SafeCastOverflowedUintDowncast(72, value);
        }
        return uint72(value);
    }

    /**
     * @dev Returns the downcasted uint64 from uint256, reverting on
     * overflow (when the input is greater than largest uint64).
     *
     * Counterpart to Solidity's `uint64` operator.
     *
     * Requirements:
     *
     * - input must fit into 64 bits
     */
    function toUint64(uint256 value) internal pure returns (uint64) {
        if (value > type(uint64).max) {
            revert SafeCastOverflowedUintDowncast(64, value);
        }
        return uint64(value);
    }

    /**
     * @dev Returns the downcasted uint56 from uint256, reverting on
     * overflow (when the input is greater than largest uint56).
     *
     * Counterpart to Solidity's `uint56` operator.
     *
     * Requirements:
     *
     * - input must fit into 56 bits
     */
    function toUint56(uint256 value) internal pure returns (uint56) {
        if (value > type(uint56).max) {
            revert SafeCastOverflowedUintDowncast(56, value);
        }
        return uint56(value);
    }

    /**
     * @dev Returns the downcasted uint48 from uint256, reverting on
     * overflow (when the input is greater than largest uint48).
     *
     * Counterpart to Solidity's `uint48` operator.
     *
     * Requirements:
     *
     * - input must fit into 48 bits
     */
    function toUint48(uint256 value) internal pure returns (uint48) {
        if (value > type(uint48).max) {
            revert SafeCastOverflowedUintDowncast(48, value);
        }
        return uint48(value);
    }

    /**
     * @dev Returns the downcasted uint40 from uint256, reverting on
     * overflow (when the input is greater than largest uint40).
     *
     * Counterpart to Solidity's `uint40` operator.
     *
     * Requirements:
     *
     * - input must fit into 40 bits
     */
    function toUint40(uint256 value) internal pure returns (uint40) {
        if (value > type(uint40).max) {
            revert SafeCastOverflowedUintDowncast(40, value);
        }
        return uint40(value);
    }

    /**
     * @dev Returns the downcasted uint32 from uint256, reverting on
     * overflow (when the input is greater than largest uint32).
     *
     * Counterpart to Solidity's `uint32` operator.
     *
     * Requirements:
     *
     * - input must fit into 32 bits
     */
    function toUint32(uint256 value) internal pure returns (uint32) {
        if (value > type(uint32).max) {
            revert SafeCastOverflowedUintDowncast(32, value);
        }
        return uint32(value);
    }

    /**
     * @dev Returns the downcasted uint24 from uint256, reverting on
     * overflow (when the input is greater than largest uint24).
     *
     * Counterpart to Solidity's `uint24` operator.
     *
     * Requirements:
     *
     * - input must fit into 24 bits
     */
    function toUint24(uint256 value) internal pure returns (uint24) {
        if (value > type(uint24).max) {
            revert SafeCastOverflowedUintDowncast(24, value);
        }
        return uint24(value);
    }

    /**
     * @dev Returns the downcasted uint16 from uint256, reverting on
     * overflow (when the input is greater than largest uint16).
     *
     * Counterpart to Solidity's `uint16` operator.
     *
     * Requirements:
     *
     * - input must fit into 16 bits
     */
    function toUint16(uint256 value) internal pure returns (uint16) {
        if (value > type(uint16).max) {
            revert SafeCastOverflowedUintDowncast(16, value);
        }
        return uint16(value);
    }

    /**
     * @dev Returns the downcasted uint8 from uint256, reverting on
     * overflow (when the input is greater than largest uint8).
     *
     * Counterpart to Solidity's `uint8` operator.
     *
     * Requirements:
     *
     * - input must fit into 8 bits
     */
    function toUint8(uint256 value) internal pure returns (uint8) {
        if (value > type(uint8).max) {
            revert SafeCastOverflowedUintDowncast(8, value);
        }
        return uint8(value);
    }

    /**
     * @dev Converts a signed int256 into an unsigned uint256.
     *
     * Requirements:
     *
     * - input must be greater than or equal to 0.
     */
    function toUint256(int256 value) internal pure returns (uint256) {
        if (value < 0) {
            revert SafeCastOverflowedIntToUint(value);
        }
        return uint256(value);
    }

    /**
     * @dev Returns the downcasted int248 from int256, reverting on
     * overflow (when the input is less than smallest int248 or
     * greater than largest int248).
     *
     * Counterpart to Solidity's `int248` operator.
     *
     * Requirements:
     *
     * - input must fit into 248 bits
     */
    function toInt248(int256 value) internal pure returns (int248 downcasted) {
        downcasted = int248(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(248, value);
        }
    }

    /**
     * @dev Returns the downcasted int240 from int256, reverting on
     * overflow (when the input is less than smallest int240 or
     * greater than largest int240).
     *
     * Counterpart to Solidity's `int240` operator.
     *
     * Requirements:
     *
     * - input must fit into 240 bits
     */
    function toInt240(int256 value) internal pure returns (int240 downcasted) {
        downcasted = int240(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(240, value);
        }
    }

    /**
     * @dev Returns the downcasted int232 from int256, reverting on
     * overflow (when the input is less than smallest int232 or
     * greater than largest int232).
     *
     * Counterpart to Solidity's `int232` operator.
     *
     * Requirements:
     *
     * - input must fit into 232 bits
     */
    function toInt232(int256 value) internal pure returns (int232 downcasted) {
        downcasted = int232(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(232, value);
        }
    }

    /**
     * @dev Returns the downcasted int224 from int256, reverting on
     * overflow (when the input is less than smallest int224 or
     * greater than largest int224).
     *
     * Counterpart to Solidity's `int224` operator.
     *
     * Requirements:
     *
     * - input must fit into 224 bits
     */
    function toInt224(int256 value) internal pure returns (int224 downcasted) {
        downcasted = int224(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(224, value);
        }
    }

    /**
     * @dev Returns the downcasted int216 from int256, reverting on
     * overflow (when the input is less than smallest int216 or
     * greater than largest int216).
     *
     * Counterpart to Solidity's `int216` operator.
     *
     * Requirements:
     *
     * - input must fit into 216 bits
     */
    function toInt216(int256 value) internal pure returns (int216 downcasted) {
        downcasted = int216(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(216, value);
        }
    }

    /**
     * @dev Returns the downcasted int208 from int256, reverting on
     * overflow (when the input is less than smallest int208 or
     * greater than largest int208).
     *
     * Counterpart to Solidity's `int208` operator.
     *
     * Requirements:
     *
     * - input must fit into 208 bits
     */
    function toInt208(int256 value) internal pure returns (int208 downcasted) {
        downcasted = int208(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(208, value);
        }
    }

    /**
     * @dev Returns the downcasted int200 from int256, reverting on
     * overflow (when the input is less than smallest int200 or
     * greater than largest int200).
     *
     * Counterpart to Solidity's `int200` operator.
     *
     * Requirements:
     *
     * - input must fit into 200 bits
     */
    function toInt200(int256 value) internal pure returns (int200 downcasted) {
        downcasted = int200(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(200, value);
        }
    }

    /**
     * @dev Returns the downcasted int192 from int256, reverting on
     * overflow (when the input is less than smallest int192 or
     * greater than largest int192).
     *
     * Counterpart to Solidity's `int192` operator.
     *
     * Requirements:
     *
     * - input must fit into 192 bits
     */
    function toInt192(int256 value) internal pure returns (int192 downcasted) {
        downcasted = int192(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(192, value);
        }
    }

    /**
     * @dev Returns the downcasted int184 from int256, reverting on
     * overflow (when the input is less than smallest int184 or
     * greater than largest int184).
     *
     * Counterpart to Solidity's `int184` operator.
     *
     * Requirements:
     *
     * - input must fit into 184 bits
     */
    function toInt184(int256 value) internal pure returns (int184 downcasted) {
        downcasted = int184(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(184, value);
        }
    }

    /**
     * @dev Returns the downcasted int176 from int256, reverting on
     * overflow (when the input is less than smallest int176 or
     * greater than largest int176).
     *
     * Counterpart to Solidity's `int176` operator.
     *
     * Requirements:
     *
     * - input must fit into 176 bits
     */
    function toInt176(int256 value) internal pure returns (int176 downcasted) {
        downcasted = int176(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(176, value);
        }
    }

    /**
     * @dev Returns the downcasted int168 from int256, reverting on
     * overflow (when the input is less than smallest int168 or
     * greater than largest int168).
     *
     * Counterpart to Solidity's `int168` operator.
     *
     * Requirements:
     *
     * - input must fit into 168 bits
     */
    function toInt168(int256 value) internal pure returns (int168 downcasted) {
        downcasted = int168(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(168, value);
        }
    }

    /**
     * @dev Returns the downcasted int160 from int256, reverting on
     * overflow (when the input is less than smallest int160 or
     * greater than largest int160).
     *
     * Counterpart to Solidity's `int160` operator.
     *
     * Requirements:
     *
     * - input must fit into 160 bits
     */
    function toInt160(int256 value) internal pure returns (int160 downcasted) {
        downcasted = int160(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(160, value);
        }
    }

    /**
     * @dev Returns the downcasted int152 from int256, reverting on
     * overflow (when the input is less than smallest int152 or
     * greater than largest int152).
     *
     * Counterpart to Solidity's `int152` operator.
     *
     * Requirements:
     *
     * - input must fit into 152 bits
     */
    function toInt152(int256 value) internal pure returns (int152 downcasted) {
        downcasted = int152(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(152, value);
        }
    }

    /**
     * @dev Returns the downcasted int144 from int256, reverting on
     * overflow (when the input is less than smallest int144 or
     * greater than largest int144).
     *
     * Counterpart to Solidity's `int144` operator.
     *
     * Requirements:
     *
     * - input must fit into 144 bits
     */
    function toInt144(int256 value) internal pure returns (int144 downcasted) {
        downcasted = int144(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(144, value);
        }
    }

    /**
     * @dev Returns the downcasted int136 from int256, reverting on
     * overflow (when the input is less than smallest int136 or
     * greater than largest int136).
     *
     * Counterpart to Solidity's `int136` operator.
     *
     * Requirements:
     *
     * - input must fit into 136 bits
     */
    function toInt136(int256 value) internal pure returns (int136 downcasted) {
        downcasted = int136(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(136, value);
        }
    }

    /**
     * @dev Returns the downcasted int128 from int256, reverting on
     * overflow (when the input is less than smallest int128 or
     * greater than largest int128).
     *
     * Counterpart to Solidity's `int128` operator.
     *
     * Requirements:
     *
     * - input must fit into 128 bits
     */
    function toInt128(int256 value) internal pure returns (int128 downcasted) {
        downcasted = int128(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(128, value);
        }
    }

    /**
     * @dev Returns the downcasted int120 from int256, reverting on
     * overflow (when the input is less than smallest int120 or
     * greater than largest int120).
     *
     * Counterpart to Solidity's `int120` operator.
     *
     * Requirements:
     *
     * - input must fit into 120 bits
     */
    function toInt120(int256 value) internal pure returns (int120 downcasted) {
        downcasted = int120(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(120, value);
        }
    }

    /**
     * @dev Returns the downcasted int112 from int256, reverting on
     * overflow (when the input is less than smallest int112 or
     * greater than largest int112).
     *
     * Counterpart to Solidity's `int112` operator.
     *
     * Requirements:
     *
     * - input must fit into 112 bits
     */
    function toInt112(int256 value) internal pure returns (int112 downcasted) {
        downcasted = int112(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(112, value);
        }
    }

    /**
     * @dev Returns the downcasted int104 from int256, reverting on
     * overflow (when the input is less than smallest int104 or
     * greater than largest int104).
     *
     * Counterpart to Solidity's `int104` operator.
     *
     * Requirements:
     *
     * - input must fit into 104 bits
     */
    function toInt104(int256 value) internal pure returns (int104 downcasted) {
        downcasted = int104(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(104, value);
        }
    }

    /**
     * @dev Returns the downcasted int96 from int256, reverting on
     * overflow (when the input is less than smallest int96 or
     * greater than largest int96).
     *
     * Counterpart to Solidity's `int96` operator.
     *
     * Requirements:
     *
     * - input must fit into 96 bits
     */
    function toInt96(int256 value) internal pure returns (int96 downcasted) {
        downcasted = int96(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(96, value);
        }
    }

    /**
     * @dev Returns the downcasted int88 from int256, reverting on
     * overflow (when the input is less than smallest int88 or
     * greater than largest int88).
     *
     * Counterpart to Solidity's `int88` operator.
     *
     * Requirements:
     *
     * - input must fit into 88 bits
     */
    function toInt88(int256 value) internal pure returns (int88 downcasted) {
        downcasted = int88(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(88, value);
        }
    }

    /**
     * @dev Returns the downcasted int80 from int256, reverting on
     * overflow (when the input is less than smallest int80 or
     * greater than largest int80).
     *
     * Counterpart to Solidity's `int80` operator.
     *
     * Requirements:
     *
     * - input must fit into 80 bits
     */
    function toInt80(int256 value) internal pure returns (int80 downcasted) {
        downcasted = int80(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(80, value);
        }
    }

    /**
     * @dev Returns the downcasted int72 from int256, reverting on
     * overflow (when the input is less than smallest int72 or
     * greater than largest int72).
     *
     * Counterpart to Solidity's `int72` operator.
     *
     * Requirements:
     *
     * - input must fit into 72 bits
     */
    function toInt72(int256 value) internal pure returns (int72 downcasted) {
        downcasted = int72(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(72, value);
        }
    }

    /**
     * @dev Returns the downcasted int64 from int256, reverting on
     * overflow (when the input is less than smallest int64 or
     * greater than largest int64).
     *
     * Counterpart to Solidity's `int64` operator.
     *
     * Requirements:
     *
     * - input must fit into 64 bits
     */
    function toInt64(int256 value) internal pure returns (int64 downcasted) {
        downcasted = int64(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(64, value);
        }
    }

    /**
     * @dev Returns the downcasted int56 from int256, reverting on
     * overflow (when the input is less than smallest int56 or
     * greater than largest int56).
     *
     * Counterpart to Solidity's `int56` operator.
     *
     * Requirements:
     *
     * - input must fit into 56 bits
     */
    function toInt56(int256 value) internal pure returns (int56 downcasted) {
        downcasted = int56(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(56, value);
        }
    }

    /**
     * @dev Returns the downcasted int48 from int256, reverting on
     * overflow (when the input is less than smallest int48 or
     * greater than largest int48).
     *
     * Counterpart to Solidity's `int48` operator.
     *
     * Requirements:
     *
     * - input must fit into 48 bits
     */
    function toInt48(int256 value) internal pure returns (int48 downcasted) {
        downcasted = int48(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(48, value);
        }
    }

    /**
     * @dev Returns the downcasted int40 from int256, reverting on
     * overflow (when the input is less than smallest int40 or
     * greater than largest int40).
     *
     * Counterpart to Solidity's `int40` operator.
     *
     * Requirements:
     *
     * - input must fit into 40 bits
     */
    function toInt40(int256 value) internal pure returns (int40 downcasted) {
        downcasted = int40(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(40, value);
        }
    }

    /**
     * @dev Returns the downcasted int32 from int256, reverting on
     * overflow (when the input is less than smallest int32 or
     * greater than largest int32).
     *
     * Counterpart to Solidity's `int32` operator.
     *
     * Requirements:
     *
     * - input must fit into 32 bits
     */
    function toInt32(int256 value) internal pure returns (int32 downcasted) {
        downcasted = int32(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(32, value);
        }
    }

    /**
     * @dev Returns the downcasted int24 from int256, reverting on
     * overflow (when the input is less than smallest int24 or
     * greater than largest int24).
     *
     * Counterpart to Solidity's `int24` operator.
     *
     * Requirements:
     *
     * - input must fit into 24 bits
     */
    function toInt24(int256 value) internal pure returns (int24 downcasted) {
        downcasted = int24(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(24, value);
        }
    }

    /**
     * @dev Returns the downcasted int16 from int256, reverting on
     * overflow (when the input is less than smallest int16 or
     * greater than largest int16).
     *
     * Counterpart to Solidity's `int16` operator.
     *
     * Requirements:
     *
     * - input must fit into 16 bits
     */
    function toInt16(int256 value) internal pure returns (int16 downcasted) {
        downcasted = int16(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(16, value);
        }
    }

    /**
     * @dev Returns the downcasted int8 from int256, reverting on
     * overflow (when the input is less than smallest int8 or
     * greater than largest int8).
     *
     * Counterpart to Solidity's `int8` operator.
     *
     * Requirements:
     *
     * - input must fit into 8 bits
     */
    function toInt8(int256 value) internal pure returns (int8 downcasted) {
        downcasted = int8(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(8, value);
        }
    }

    /**
     * @dev Converts an unsigned uint256 into a signed int256.
     *
     * Requirements:
     *
     * - input must be less than or equal to maxInt256.
     */
    function toInt256(uint256 value) internal pure returns (int256) {
        // Note: Unsafe cast below is okay because `type(int256).max` is guaranteed to be positive
        if (value > uint256(type(int256).max)) {
            revert SafeCastOverflowedUintToInt(value);
        }
        return int256(value);
    }

    /**
     * @dev Cast a boolean (false or true) to a uint256 (0 or 1) with no jump.
     */
    function toUint(bool b) internal pure returns (uint256 u) {
        assembly ("memory-safe") {
            u := iszero(iszero(b))
        }
    }
}

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

pragma solidity ^0.8.20;

/**
 * @dev Helper library for emitting standardized panic codes.
 *
 * ```solidity
 * contract Example {
 *      using Panic for uint256;
 *
 *      // Use any of the declared internal constants
 *      function foo() { Panic.GENERIC.panic(); }
 *
 *      // Alternatively
 *      function foo() { Panic.panic(Panic.GENERIC); }
 * }
 * ```
 *
 * Follows the list from https://github.com/ethereum/solidity/blob/v0.8.24/libsolutil/ErrorCodes.h[libsolutil].
 *
 * _Available since v5.1._
 */
// slither-disable-next-line unused-state
library Panic {
    /// @dev generic / unspecified error
    uint256 internal constant GENERIC = 0x00;
    /// @dev used by the assert() builtin
    uint256 internal constant ASSERT = 0x01;
    /// @dev arithmetic underflow or overflow
    uint256 internal constant UNDER_OVERFLOW = 0x11;
    /// @dev division or modulo by zero
    uint256 internal constant DIVISION_BY_ZERO = 0x12;
    /// @dev enum conversion error
    uint256 internal constant ENUM_CONVERSION_ERROR = 0x21;
    /// @dev invalid encoding in storage
    uint256 internal constant STORAGE_ENCODING_ERROR = 0x22;
    /// @dev empty array pop
    uint256 internal constant EMPTY_ARRAY_POP = 0x31;
    /// @dev array out of bounds access
    uint256 internal constant ARRAY_OUT_OF_BOUNDS = 0x32;
    /// @dev resource error (too large allocation or too large array)
    uint256 internal constant RESOURCE_ERROR = 0x41;
    /// @dev calling invalid internal function
    uint256 internal constant INVALID_INTERNAL_FUNCTION = 0x51;

    /// @dev Reverts with a panic code. Recommended to use with
    /// the internal constants with predefined codes.
    function panic(uint256 code) internal pure {
        assembly ("memory-safe") {
            mstore(0x00, 0x4e487b71)
            mstore(0x20, code)
            revert(0x1c, 0x24)
        }
    }
}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.1.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 EIP-1153 (transient storage) is available on the chain you're deploying at,
 * consider using {ReentrancyGuardTransient} instead.
 *
 * 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: UNLICENSED
pragma solidity ^0.8.26;

interface IOfferFactory {
    function refferalToInfluencer(address _refferal) external view returns (address);
    function influencerProfitPercents(address _influencer) external view returns (uint16);
    function discountPercent() external view returns (uint16);
    function becomeRefferal(address influencer) external;
}

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

[{"inputs":[{"internalType":"address","name":"initialOwner","type":"address"},{"internalType":"uint16","name":"_commissionPercent","type":"uint16"},{"internalType":"address","name":"_factorySC","type":"address"}],"stateMutability":"nonpayable","type":"constructor"},{"inputs":[{"internalType":"uint256","name":"providedValue","type":"uint256"},{"internalType":"uint256","name":"price","type":"uint256"},{"internalType":"uint256","name":"discount","type":"uint256"}],"name":"IncorrectCommission","type":"error"},{"inputs":[],"name":"IncorrectPriceValue","type":"error"},{"inputs":[],"name":"IncorrectTokenAddress","type":"error"},{"inputs":[],"name":"IncorrectTokenAmount","type":"error"},{"inputs":[{"internalType":"uint256","name":"providedValue","type":"uint256"},{"internalType":"uint256","name":"price","type":"uint256"},{"internalType":"uint256","name":"commission","type":"uint256"},{"internalType":"uint256","name":"discount","type":"uint256"}],"name":"IncorrectValue","type":"error"},{"inputs":[],"name":"InvalidAddress","type":"error"},{"inputs":[],"name":"InvalidCommission","type":"error"},{"inputs":[],"name":"NoCommissionToWithdraw","type":"error"},{"inputs":[{"internalType":"uint256","name":"orderId","type":"uint256"},{"internalType":"enum PrivateMarket.OrderStatus","name":"status","type":"uint8"}],"name":"OrderCannotBeCanceled","type":"error"},{"inputs":[{"internalType":"uint256","name":"orderId","type":"uint256"},{"internalType":"enum PrivateMarket.OrderStatus","name":"status","type":"uint8"}],"name":"OrderNotAvailable","type":"error"},{"inputs":[{"internalType":"address","name":"owner","type":"address"}],"name":"OwnableInvalidOwner","type":"error"},{"inputs":[{"internalType":"address","name":"account","type":"address"}],"name":"OwnableUnauthorizedAccount","type":"error"},{"inputs":[],"name":"ReentrancyGuardReentrantCall","type":"error"},{"inputs":[],"name":"TransferFailed","type":"error"},{"inputs":[{"internalType":"address","name":"caller","type":"address"},{"internalType":"address","name":"buyerAddress","type":"address"}],"name":"UnauthorizedBuyer","type":"error"},{"inputs":[{"internalType":"address","name":"caller","type":"address"},{"internalType":"address","name":"sellerAddress","type":"address"}],"name":"UnauthorizedUser","type":"error"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"uint256","name":"orderId","type":"uint256"},{"indexed":false,"internalType":"uint256","name":"influencerProfit","type":"uint256"}],"name":"ApprovePrivateOrderEvent","type":"event"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"uint256","name":"orderId","type":"uint256"}],"name":"CancelPrivateOrderEvent","type":"event"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"address","name":"tokenAddress","type":"address"},{"indexed":false,"internalType":"uint256","name":"tokenAmount","type":"uint256"},{"indexed":false,"internalType":"uint256","name":"priceValue","type":"uint256"},{"indexed":false,"internalType":"address","name":"buyerAddress","type":"address"},{"indexed":false,"internalType":"address","name":"sellerAddress","type":"address"},{"indexed":false,"internalType":"uint256","name":"orderId","type":"uint256"},{"indexed":false,"internalType":"uint256","name":"influencerProfit","type":"uint256"},{"indexed":false,"internalType":"string","name":"tokenSymbol","type":"string"},{"indexed":false,"internalType":"string","name":"tokenName","type":"string"},{"indexed":false,"internalType":"uint8","name":"tokenDecimals","type":"uint8"}],"name":"CreatePrivateOrderEvent","type":"event"},{"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":"uint256","name":"_orderId","type":"uint256"}],"name":"buyPrivateOrder","outputs":[],"stateMutability":"payable","type":"function"},{"inputs":[{"internalType":"uint256","name":"_orderId","type":"uint256"}],"name":"cancelPrivateOrder","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"commissionPercent","outputs":[{"internalType":"uint16","name":"","type":"uint16"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"_tokenAddress","type":"address"},{"internalType":"uint256","name":"_tokenAmount","type":"uint256"},{"internalType":"uint256","name":"_priceValue","type":"uint256"},{"internalType":"address","name":"_buyerAddress","type":"address"}],"name":"createPrivateOrder","outputs":[],"stateMutability":"payable","type":"function"},{"inputs":[],"name":"factorySC","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"getCommissionBalance","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"owner","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"","type":"uint256"}],"name":"privateOrders","outputs":[{"internalType":"address","name":"tokenAddress","type":"address"},{"internalType":"uint256","name":"tokenAmount","type":"uint256"},{"internalType":"uint256","name":"priceValue","type":"uint256"},{"internalType":"address","name":"buyerAddress","type":"address"},{"internalType":"address","name":"sellerAddress","type":"address"},{"internalType":"enum PrivateMarket.OrderStatus","name":"status","type":"uint8"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"renounceOwnership","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint16","name":"_commissionPercent","type":"uint16"}],"name":"setCommission","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"newOwner","type":"address"}],"name":"transferOwnership","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"_to","type":"address"}],"name":"withdrawCommission","outputs":[],"stateMutability":"nonpayable","type":"function"}]

60a03461011057601f611a3638819003918201601f19168301916001600160401b0383118484101761011557808492606094604052833981010312610110576100478161012b565b60208201519161ffff8316809303610110576040610065910161012b565b6001600160a01b039091169182156100fa57600080546001600160a01b031981168517825560405194916001600160a01b03909116907f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e09080a360018055600160025561ffff1960035416176003556080526118f6908161014082396080518181816109810152818161151e01526116870152f35b631e4fbdf760e01b600052600060045260246000fd5b600080fd5b634e487b7160e01b600052604160045260246000fd5b51906001600160a01b03821682036101105756fe6080604052600436101561001257600080fd5b60003560e01c806316c58d0414611171578063290484cc146110b6578063319abed514610bb5578063715018a614610b1957806377d3550b14610ad95780638da5cb5b14610a87578063c023343214610a4d578063c594cc65146109a5578063c9b9bfa914610936578063ce6f0f071461074c578063f2fde38b1461065a5763fabd6147146100a057600080fd5b60807ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffc360112610655576100d26111d5565b60243590604435916064359173ffffffffffffffffffffffffffffffffffffffff831680930361065557831561062b5781156106015782156105d75773ffffffffffffffffffffffffffffffffffffffff1680156105d757600254936040517f313ce567000000000000000000000000000000000000000000000000000000008152602081600481865afa80156105cb5760ff9160009161059c575b501690811561057257610180816114f5565b61018a8183611308565b9182340361053e575050906101a161ffff92611658565b9093829416151580610535575b6104d7575b5050604051966101c288611206565b8488526020880186815273ffffffffffffffffffffffffffffffffffffffff80600460408c019b868d5282606082018d8152608083019e8f33905260a084019760008952896000528560205283806040600020965116167fffffffffffffffffffffffff00000000000000000000000000000000000000008654161785555160018501555160028401555116836003830191167fffffffffffffffffffffffff0000000000000000000000000000000000000000825416179055019a5116167fffffffffffffffffffffffff00000000000000000000000000000000000000008a5416178955519760038910156104a8576000987fffffffffffffffffffffff00ffffffffffffffffffffffffffffffffffffffff74ff000000000000000000000000000000000000000083549260a01b1691161790556040517f95d89b410000000000000000000000000000000000000000000000000000000081528881600481895afa90811561049d578991610483575b50604051937f06fdde0300000000000000000000000000000000000000000000000000000000855289856004818a5afa928315610478577f39863b7f78d657d8579ef09167674156799c91d1db8c1a62d614b0fbe88f7774996103e8968c95610452575b506103d994956040519a8b9a8b5260208b015260408a0152606089015233608089015260a088015260c087015261014060e08701526101408601906113e2565b908482036101008601526113e2565b906101208301520390a16002547fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff81146104255760010160025580f35b6024827f4e487b710000000000000000000000000000000000000000000000000000000081526011600452fd5b6103d99550610472903d808f833e61046a8183611251565b810190611380565b94610399565b6040513d8c823e3d90fd5b61049791503d808b833e61046a8183611251565b38610335565b6040513d8b823e3d90fd5b7f4e487b7100000000000000000000000000000000000000000000000000000000600052602160045260246000fd5b600080809373ffffffffffffffffffffffffffffffffffffffff8294165af16104fe6112cc565b501561050b5781386101b3565b7f90b8ec180000000000000000000000000000000000000000000000000000000060005260046000fd5b508115156101ae565b7fdeb6045d000000000000000000000000000000000000000000000000000000006000523460045260245260445260646000fd5b7f0f37776d0000000000000000000000000000000000000000000000000000000060005260046000fd5b6105be915060203d6020116105c4575b6105b68183611251565b810190611344565b3861016e565b503d6105ac565b6040513d6000823e3d90fd5b7fe6c4247b0000000000000000000000000000000000000000000000000000000060005260046000fd5b7f7a20cef30000000000000000000000000000000000000000000000000000000060005260046000fd5b7fc130c71e0000000000000000000000000000000000000000000000000000000060005260046000fd5b600080fd5b346106555760207ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffc3601126106555773ffffffffffffffffffffffffffffffffffffffff6106a66111d5565b6106ae611425565b16801561071d5773ffffffffffffffffffffffffffffffffffffffff600054827fffffffffffffffffffffffff0000000000000000000000000000000000000000821617600055167f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e0600080a3005b7f1e4fbdf700000000000000000000000000000000000000000000000000000000600052600060045260246000fd5b346106555760207ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffc36011261065557600435610786611474565b806000526004602052604060002073ffffffffffffffffffffffffffffffffffffffff6004604051926107b884611206565b82815416845260018101546020850152600281015460408501528260038201541660608501520154916107fe60ff60a060808401938587168552019460a01c16846112fc565b5116338103610905575080519060038210156104a85760009161089957507fadfd69359c7be0e72d0ef0d0fe5a59681110c3979b56b3427ce62a6c306e23b06020838084526004825260046040852001740200000000000000000000000000000000000000007fffffffffffffffffffffff00ffffffffffffffffffffffffffffffffffffffff825416179055604051908152a16001805580f35b519160038310156108d8576044926108d6917f03021ddc0000000000000000000000000000000000000000000000000000000084526004526111f8565bfd5b6024827f4e487b710000000000000000000000000000000000000000000000000000000081526021600452fd5b7fe1dfbdce000000000000000000000000000000000000000000000000000000006000523360045260245260446000fd5b346106555760007ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffc36011261065557602060405173ffffffffffffffffffffffffffffffffffffffff7f0000000000000000000000000000000000000000000000000000000000000000168152f35b346106555760207ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffc3601126106555760043561ffff8116809103610655576109eb611425565b6103e8811015610a23577fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff00006003541617600355600080f35b7fdc81db850000000000000000000000000000000000000000000000000000000060005260046000fd5b346106555760007ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffc36011261065557602047604051908152f35b346106555760007ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffc36011261065557602073ffffffffffffffffffffffffffffffffffffffff60005416604051908152f35b346106555760007ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffc36011261065557602061ffff60035416604051908152f35b346106555760007ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffc36011261065557610b50611425565b600073ffffffffffffffffffffffffffffffffffffffff81547fffffffffffffffffffffffff000000000000000000000000000000000000000081168355167f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e08280a3005b60207ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffc36011261065557600435610bea611474565b806000526004602052604060002090604051610c0581611206565b73ffffffffffffffffffffffffffffffffffffffff835416815260018301546020820190815260028401549160408101928352600473ffffffffffffffffffffffffffffffffffffffff6003870154169560608301968752015494608082019273ffffffffffffffffffffffffffffffffffffffff87168452610c9260ff60a085019860a01c16886112fc565b86519660038810156104a8576000976110785750610cb085516114f5565b8694919451610cbf8287611308565b8101809111610fb8573403611033575073ffffffffffffffffffffffffffffffffffffffff835116338103611004575073ffffffffffffffffffffffffffffffffffffffff908789526004602052600460408a2001740100000000000000000000000000000000000000007fffffffffffffffffffffff00ffffffffffffffffffffffffffffffffffffffff82541617905551169173ffffffffffffffffffffffffffffffffffffffff808651169151169151926040517f313ce567000000000000000000000000000000000000000000000000000000008152602081600481855afa80156104785760ff918b91610fe5575b5016604d8111610fb857600a0a93848102948186041490151715610f8b57602092918960649260405196879586947f23b872dd0000000000000000000000000000000000000000000000000000000086526004860152602485015260448401525af1908115610f80578691610f41575b5015610f105761ffff9291610e378692611658565b9095829616151580610f38575b610ed9575b505081809373ffffffffffffffffffffffffffffffffffffffff829351169051905af1610e746112cc565b5015610eb1577faa6e9d77a705979bfc5cc2c4b186fe4b779f21084f9736c2eb695bbd4732b8549160409182519182526020820152a16001805580f35b6004837f90b8ec18000000000000000000000000000000000000000000000000000000008152fd5b92808093949273ffffffffffffffffffffffffffffffffffffffff8294165af1610f016112cc565b5015610f105784908387610e49565b6004857f90b8ec18000000000000000000000000000000000000000000000000000000008152fd5b50811515610e44565b90506020813d602011610f78575b81610f5c60209383611251565b81010312610f7457518015158103610f745786610e22565b8580fd5b3d9150610f4f565b6040513d88823e3d90fd5b6024897f4e487b710000000000000000000000000000000000000000000000000000000081526011600452fd5b60248a7f4e487b710000000000000000000000000000000000000000000000000000000081526011600452fd5b610ffe915060203d6020116105c4576105b68183611251565b8b610db2565b7f0545542500000000000000000000000000000000000000000000000000000000895233600452602452604488fd5b84608491885191604051927fdc0aaf80000000000000000000000000000000000000000000000000000000008452346004850152602484015260448301526064820152fd5b51878760038310156108d8576044926108d6917fd6598c9b0000000000000000000000000000000000000000000000000000000084526004526111f8565b346106555760207ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffc360112610655576004356000526004602052604060002073ffffffffffffffffffffffffffffffffffffffff81541673ffffffffffffffffffffffffffffffffffffffff6001830154926002810154906004836003830154169101549160ff8360a01c169560405195865260208601526040850152606084015216608082015260038210156104a85760c09160a0820152f35b346106555760207ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffc3601126106555760008080806111ad6111d5565b6111b5611425565b6111bd611474565b47905af16111c96112cc565b501561050b5760018055005b6004359073ffffffffffffffffffffffffffffffffffffffff8216820361065557565b60038110156104a857602452565b60c0810190811067ffffffffffffffff82111761122257604052565b7f4e487b7100000000000000000000000000000000000000000000000000000000600052604160045260246000fd5b90601f7fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffe0910116810190811067ffffffffffffffff82111761122257604052565b67ffffffffffffffff811161122257601f017fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffe01660200190565b3d156112f7573d906112dd82611292565b916112eb6040519384611251565b82523d6000602084013e565b606090565b60038210156104a85752565b9190820391821161131557565b7f4e487b7100000000000000000000000000000000000000000000000000000000600052601160045260246000fd5b90816020910312610655575160ff811681036106555790565b60005b8381106113705750506000910152565b8181015183820152602001611360565b6020818303126106555780519067ffffffffffffffff8211610655570181601f820112156106555780516113b381611292565b926113c16040519485611251565b81845260208284010111610655576113df916020808501910161135d565b90565b907fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffe0601f60209361141e8151809281875287808801910161135d565b0116010190565b73ffffffffffffffffffffffffffffffffffffffff60005416330361144657565b7f118cdaa7000000000000000000000000000000000000000000000000000000006000523360045260246000fd5b600260015414611485576002600155565b7f3ee5aeb50000000000000000000000000000000000000000000000000000000060005260046000fd5b90816020910312610655575161ffff811681036106555790565b90816020910312610655575173ffffffffffffffffffffffffffffffffffffffff811681036106555790565b6115069061ffff600354169061178f565b9073ffffffffffffffffffffffffffffffffffffffff7f000000000000000000000000000000000000000000000000000000000000000016604051907f29ef1919000000000000000000000000000000000000000000000000000000008252602082600481845afa9182156105cb57600092611623575b506020602491604051928380927f23f6f9680000000000000000000000000000000000000000000000000000000082523360048301525afa80156105cb5773ffffffffffffffffffffffffffffffffffffffff916000916115f4575b5016156115ee5761ffff6113df911683611832565b50600090565b611616915060203d60201161161c575b61160e8183611251565b8101906114c9565b386115d9565b503d611604565b6024919250611649602091823d8411611651575b6116418183611251565b8101906114af565b92915061157d565b503d611637565b6040517f23f6f968000000000000000000000000000000000000000000000000000000008152336004820152917f000000000000000000000000000000000000000000000000000000000000000073ffffffffffffffffffffffffffffffffffffffff1691602084602481865afa9283156105cb5760249460009461176d575b50602090604051958680927f5d8162b000000000000000000000000000000000000000000000000000000000825273ffffffffffffffffffffffffffffffffffffffff881660048301525afa9384156105cb57600094611748575b506117439061ffff85169061178f565b929190565b6117439194506117669060203d602011611651576116418183611251565b9390611733565b602091945061178890823d841161161c5761160e8183611251565b93906116d8565b9190916000838202917fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff8582099183808410930392808403931461182557826103e8111561181357507fac083126e978d4fdf3b645a1cac083126e978d4fdf3b645a1cac083126e978d593946103e8910990828211900360fd1b910360031c170290565b634e487b71905260116020526024601cfd5b5050506103e89192500490565b9190916000838202917fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff858209918380841093039280840393146118b457826064111561181357507f5c28f5c28f5c28f5c28f5c28f5c28f5c28f5c28f5c28f5c28f5c28f5c28f5c2993946064910990828211900360fe1b910360021c170290565b5050506064919250049056fea2646970667358221220c2ce867349592e21fdb104297cf71af52074d2d75b830a0732645761ae5f7f8364736f6c634300081b00330000000000000000000000001b8529889149f882f00a65597467026669f5b29c0000000000000000000000000000000000000000000000000000000000000064000000000000000000000000aedfd5689fc5aa4500f78c81e29aad2de6c4146c

0x6080604052600436101561001257600080fd5b60003560e01c806316c58d0414611171578063290484cc146110b6578063319abed514610bb5578063715018a614610b1957806377d3550b14610ad95780638da5cb5b14610a87578063c023343214610a4d578063c594cc65146109a5578063c9b9bfa914610936578063ce6f0f071461074c578063f2fde38b1461065a5763fabd6147146100a057600080fd5b60807ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffc360112610655576100d26111d5565b60243590604435916064359173ffffffffffffffffffffffffffffffffffffffff831680930361065557831561062b5781156106015782156105d75773ffffffffffffffffffffffffffffffffffffffff1680156105d757600254936040517f313ce567000000000000000000000000000000000000000000000000000000008152602081600481865afa80156105cb5760ff9160009161059c575b501690811561057257610180816114f5565b61018a8183611308565b9182340361053e575050906101a161ffff92611658565b9093829416151580610535575b6104d7575b5050604051966101c288611206565b8488526020880186815273ffffffffffffffffffffffffffffffffffffffff80600460408c019b868d5282606082018d8152608083019e8f33905260a084019760008952896000528560205283806040600020965116167fffffffffffffffffffffffff00000000000000000000000000000000000000008654161785555160018501555160028401555116836003830191167fffffffffffffffffffffffff0000000000000000000000000000000000000000825416179055019a5116167fffffffffffffffffffffffff00000000000000000000000000000000000000008a5416178955519760038910156104a8576000987fffffffffffffffffffffff00ffffffffffffffffffffffffffffffffffffffff74ff000000000000000000000000000000000000000083549260a01b1691161790556040517f95d89b410000000000000000000000000000000000000000000000000000000081528881600481895afa90811561049d578991610483575b50604051937f06fdde0300000000000000000000000000000000000000000000000000000000855289856004818a5afa928315610478577f39863b7f78d657d8579ef09167674156799c91d1db8c1a62d614b0fbe88f7774996103e8968c95610452575b506103d994956040519a8b9a8b5260208b015260408a0152606089015233608089015260a088015260c087015261014060e08701526101408601906113e2565b908482036101008601526113e2565b906101208301520390a16002547fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff81146104255760010160025580f35b6024827f4e487b710000000000000000000000000000000000000000000000000000000081526011600452fd5b6103d99550610472903d808f833e61046a8183611251565b810190611380565b94610399565b6040513d8c823e3d90fd5b61049791503d808b833e61046a8183611251565b38610335565b6040513d8b823e3d90fd5b7f4e487b7100000000000000000000000000000000000000000000000000000000600052602160045260246000fd5b600080809373ffffffffffffffffffffffffffffffffffffffff8294165af16104fe6112cc565b501561050b5781386101b3565b7f90b8ec180000000000000000000000000000000000000000000000000000000060005260046000fd5b508115156101ae565b7fdeb6045d000000000000000000000000000000000000000000000000000000006000523460045260245260445260646000fd5b7f0f37776d0000000000000000000000000000000000000000000000000000000060005260046000fd5b6105be915060203d6020116105c4575b6105b68183611251565b810190611344565b3861016e565b503d6105ac565b6040513d6000823e3d90fd5b7fe6c4247b0000000000000000000000000000000000000000000000000000000060005260046000fd5b7f7a20cef30000000000000000000000000000000000000000000000000000000060005260046000fd5b7fc130c71e0000000000000000000000000000000000000000000000000000000060005260046000fd5b600080fd5b346106555760207ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffc3601126106555773ffffffffffffffffffffffffffffffffffffffff6106a66111d5565b6106ae611425565b16801561071d5773ffffffffffffffffffffffffffffffffffffffff600054827fffffffffffffffffffffffff0000000000000000000000000000000000000000821617600055167f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e0600080a3005b7f1e4fbdf700000000000000000000000000000000000000000000000000000000600052600060045260246000fd5b346106555760207ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffc36011261065557600435610786611474565b806000526004602052604060002073ffffffffffffffffffffffffffffffffffffffff6004604051926107b884611206565b82815416845260018101546020850152600281015460408501528260038201541660608501520154916107fe60ff60a060808401938587168552019460a01c16846112fc565b5116338103610905575080519060038210156104a85760009161089957507fadfd69359c7be0e72d0ef0d0fe5a59681110c3979b56b3427ce62a6c306e23b06020838084526004825260046040852001740200000000000000000000000000000000000000007fffffffffffffffffffffff00ffffffffffffffffffffffffffffffffffffffff825416179055604051908152a16001805580f35b519160038310156108d8576044926108d6917f03021ddc0000000000000000000000000000000000000000000000000000000084526004526111f8565bfd5b6024827f4e487b710000000000000000000000000000000000000000000000000000000081526021600452fd5b7fe1dfbdce000000000000000000000000000000000000000000000000000000006000523360045260245260446000fd5b346106555760007ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffc36011261065557602060405173ffffffffffffffffffffffffffffffffffffffff7f000000000000000000000000aedfd5689fc5aa4500f78c81e29aad2de6c4146c168152f35b346106555760207ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffc3601126106555760043561ffff8116809103610655576109eb611425565b6103e8811015610a23577fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff00006003541617600355600080f35b7fdc81db850000000000000000000000000000000000000000000000000000000060005260046000fd5b346106555760007ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffc36011261065557602047604051908152f35b346106555760007ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffc36011261065557602073ffffffffffffffffffffffffffffffffffffffff60005416604051908152f35b346106555760007ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffc36011261065557602061ffff60035416604051908152f35b346106555760007ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffc36011261065557610b50611425565b600073ffffffffffffffffffffffffffffffffffffffff81547fffffffffffffffffffffffff000000000000000000000000000000000000000081168355167f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e08280a3005b60207ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffc36011261065557600435610bea611474565b806000526004602052604060002090604051610c0581611206565b73ffffffffffffffffffffffffffffffffffffffff835416815260018301546020820190815260028401549160408101928352600473ffffffffffffffffffffffffffffffffffffffff6003870154169560608301968752015494608082019273ffffffffffffffffffffffffffffffffffffffff87168452610c9260ff60a085019860a01c16886112fc565b86519660038810156104a8576000976110785750610cb085516114f5565b8694919451610cbf8287611308565b8101809111610fb8573403611033575073ffffffffffffffffffffffffffffffffffffffff835116338103611004575073ffffffffffffffffffffffffffffffffffffffff908789526004602052600460408a2001740100000000000000000000000000000000000000007fffffffffffffffffffffff00ffffffffffffffffffffffffffffffffffffffff82541617905551169173ffffffffffffffffffffffffffffffffffffffff808651169151169151926040517f313ce567000000000000000000000000000000000000000000000000000000008152602081600481855afa80156104785760ff918b91610fe5575b5016604d8111610fb857600a0a93848102948186041490151715610f8b57602092918960649260405196879586947f23b872dd0000000000000000000000000000000000000000000000000000000086526004860152602485015260448401525af1908115610f80578691610f41575b5015610f105761ffff9291610e378692611658565b9095829616151580610f38575b610ed9575b505081809373ffffffffffffffffffffffffffffffffffffffff829351169051905af1610e746112cc565b5015610eb1577faa6e9d77a705979bfc5cc2c4b186fe4b779f21084f9736c2eb695bbd4732b8549160409182519182526020820152a16001805580f35b6004837f90b8ec18000000000000000000000000000000000000000000000000000000008152fd5b92808093949273ffffffffffffffffffffffffffffffffffffffff8294165af1610f016112cc565b5015610f105784908387610e49565b6004857f90b8ec18000000000000000000000000000000000000000000000000000000008152fd5b50811515610e44565b90506020813d602011610f78575b81610f5c60209383611251565b81010312610f7457518015158103610f745786610e22565b8580fd5b3d9150610f4f565b6040513d88823e3d90fd5b6024897f4e487b710000000000000000000000000000000000000000000000000000000081526011600452fd5b60248a7f4e487b710000000000000000000000000000000000000000000000000000000081526011600452fd5b610ffe915060203d6020116105c4576105b68183611251565b8b610db2565b7f0545542500000000000000000000000000000000000000000000000000000000895233600452602452604488fd5b84608491885191604051927fdc0aaf80000000000000000000000000000000000000000000000000000000008452346004850152602484015260448301526064820152fd5b51878760038310156108d8576044926108d6917fd6598c9b0000000000000000000000000000000000000000000000000000000084526004526111f8565b346106555760207ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffc360112610655576004356000526004602052604060002073ffffffffffffffffffffffffffffffffffffffff81541673ffffffffffffffffffffffffffffffffffffffff6001830154926002810154906004836003830154169101549160ff8360a01c169560405195865260208601526040850152606084015216608082015260038210156104a85760c09160a0820152f35b346106555760207ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffc3601126106555760008080806111ad6111d5565b6111b5611425565b6111bd611474565b47905af16111c96112cc565b501561050b5760018055005b6004359073ffffffffffffffffffffffffffffffffffffffff8216820361065557565b60038110156104a857602452565b60c0810190811067ffffffffffffffff82111761122257604052565b7f4e487b7100000000000000000000000000000000000000000000000000000000600052604160045260246000fd5b90601f7fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffe0910116810190811067ffffffffffffffff82111761122257604052565b67ffffffffffffffff811161122257601f017fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffe01660200190565b3d156112f7573d906112dd82611292565b916112eb6040519384611251565b82523d6000602084013e565b606090565b60038210156104a85752565b9190820391821161131557565b7f4e487b7100000000000000000000000000000000000000000000000000000000600052601160045260246000fd5b90816020910312610655575160ff811681036106555790565b60005b8381106113705750506000910152565b8181015183820152602001611360565b6020818303126106555780519067ffffffffffffffff8211610655570181601f820112156106555780516113b381611292565b926113c16040519485611251565b81845260208284010111610655576113df916020808501910161135d565b90565b907fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffe0601f60209361141e8151809281875287808801910161135d565b0116010190565b73ffffffffffffffffffffffffffffffffffffffff60005416330361144657565b7f118cdaa7000000000000000000000000000000000000000000000000000000006000523360045260246000fd5b600260015414611485576002600155565b7f3ee5aeb50000000000000000000000000000000000000000000000000000000060005260046000fd5b90816020910312610655575161ffff811681036106555790565b90816020910312610655575173ffffffffffffffffffffffffffffffffffffffff811681036106555790565b6115069061ffff600354169061178f565b9073ffffffffffffffffffffffffffffffffffffffff7f000000000000000000000000aedfd5689fc5aa4500f78c81e29aad2de6c4146c16604051907f29ef1919000000000000000000000000000000000000000000000000000000008252602082600481845afa9182156105cb57600092611623575b506020602491604051928380927f23f6f9680000000000000000000000000000000000000000000000000000000082523360048301525afa80156105cb5773ffffffffffffffffffffffffffffffffffffffff916000916115f4575b5016156115ee5761ffff6113df911683611832565b50600090565b611616915060203d60201161161c575b61160e8183611251565b8101906114c9565b386115d9565b503d611604565b6024919250611649602091823d8411611651575b6116418183611251565b8101906114af565b92915061157d565b503d611637565b6040517f23f6f968000000000000000000000000000000000000000000000000000000008152336004820152917f000000000000000000000000aedfd5689fc5aa4500f78c81e29aad2de6c4146c73ffffffffffffffffffffffffffffffffffffffff1691602084602481865afa9283156105cb5760249460009461176d575b50602090604051958680927f5d8162b000000000000000000000000000000000000000000000000000000000825273ffffffffffffffffffffffffffffffffffffffff881660048301525afa9384156105cb57600094611748575b506117439061ffff85169061178f565b929190565b6117439194506117669060203d602011611651576116418183611251565b9390611733565b602091945061178890823d841161161c5761160e8183611251565b93906116d8565b9190916000838202917fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff8582099183808410930392808403931461182557826103e8111561181357507fac083126e978d4fdf3b645a1cac083126e978d4fdf3b645a1cac083126e978d593946103e8910990828211900360fd1b910360031c170290565b634e487b71905260116020526024601cfd5b5050506103e89192500490565b9190916000838202917fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff858209918380841093039280840393146118b457826064111561181357507f5c28f5c28f5c28f5c28f5c28f5c28f5c28f5c28f5c28f5c28f5c28f5c28f5c2993946064910990828211900360fe1b910360021c170290565b5050506064919250049056fea2646970667358221220c2ce867349592e21fdb104297cf71af52074d2d75b830a0732645761ae5f7f8364736f6c634300081b0033

0000000000000000000000001b8529889149f882f00a65597467026669f5b29c0000000000000000000000000000000000000000000000000000000000000064000000000000000000000000aedfd5689fc5aa4500f78c81e29aad2de6c4146c

-----Decoded View---------------
Arg [0] : initialOwner (address): 0x1b8529889149F882f00a65597467026669f5b29C
Arg [1] : _commissionPercent (uint16): 100
Arg [2] : _factorySC (address): 0xaEdfD5689fc5aA4500F78C81E29AaD2DE6c4146C

-----Encoded View---------------
3 Constructor Arguments found :
Arg [0] : 0000000000000000000000001b8529889149f882f00a65597467026669f5b29c
Arg [1] : 0000000000000000000000000000000000000000000000000000000000000064
Arg [2] : 000000000000000000000000aedfd5689fc5aa4500f78c81e29aad2de6c4146c