Contract Source Code (Solidity Standard Json-Input format)

IDE

• Blockscan IDE
• 🤖 Code ReaderBeta
• Remix IDE

More Options

• Is this a proxy?
• Similar
• Sol2Uml
• Submit Audit
• Compare

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

import {ILiquid} from "iliquid/ILiquid.sol";
import {ERC20, IERC20Metadata} from "erc20/ERC20.sol";
import {SafeERC20} from "erc20/SafeERC20.sol";
import {Clones} from "clones/Clones.sol";
import {Math} from "math/Math.sol";
import {ReentrancyGuardTransient} from "reentrancy/ReentrancyGuardTransient.sol";

contract Liquid is ILiquid, ERC20, ReentrancyGuardTransient {
    using SafeERC20 for IERC20Metadata;

    Liquid public immutable HUB = this;

    IERC20Metadata public solid;

    constructor(IERC20Metadata hub) ERC20("", "") {
        solid = hub;
    }

    function name() public view virtual override(ERC20, IERC20Metadata) returns (string memory) {
        return solid.name();
    }

    function symbol() public view virtual override(ERC20, IERC20Metadata) returns (string memory) {
        return solid.symbol();
    }

    function decimals() public view virtual override(ERC20, IERC20Metadata) returns (uint8) {
        return solid.decimals();
    }

    function pool() public view returns (uint256 P, uint256 E) {
        P = balanceOf(address(this));
        E = HUB.balanceOf(address(this));
    }

    function mass() public view returns (uint256) {
        return solid.balanceOf(address(this));
    }

    function heats(uint256 m) public view returns (uint256 u, uint256 p) {
        if (this == HUB) {
            u = m;
        } else {
            uint256 T = totalSupply();
            uint256 P = balanceOf(address(this));
            p = (2 * m * P) / T;
            u = 2 * m - p;
        }
    }

    function heat(uint256 m) external nonReentrant returns (uint256 u, uint256 p) {
        if (this == HUB) {
            u = m;
            emit Heat(this, m, 0, u);
            _mint(msg.sender, u);
        } else {
            (u, p) = heats(m);
            emit Heat(this, m, p, u);
            solid.safeTransferFrom(msg.sender, address(this), m);
            _mint(msg.sender, u);
            _mint(address(this), p);
        }
    }

    // @param u is the amount of unpooled Spoke returned to the user
    function heats(uint256 m, uint256 e) public view notHub returns (uint256 u, uint256 p) {
        (uint256 P, uint256 E) = pool();
        m = m + (e * (P + m)) / (E + e);
        uint256 T = totalSupply();
        if (T == 0) {
            p = m;
        } else {
            p = (2 * m * P) / T;
        }
        u = 2 * m - p;
        p = u;
    }

    function heat(uint256 m, uint256 e) public nonReentrant returns (uint256 u, uint256 p) {
        (u, p) = heats(m, e);
        emit Heat(this, m, e, u);
        if (m > 0) solid.safeTransferFrom(msg.sender, address(this), m);
        if (e > 0) HUB.update(msg.sender, address(this), e);
        _mint(msg.sender, u);
        _mint(address(this), p);
    }

    function cools(uint256 u) public view returns (uint256 m, uint256 p) {
        if (this == HUB) {
            m = u;
        } else {
            uint256 T = totalSupply();
            uint256 P = balanceOf(address(this));
            uint256 U = T - P;
            m = (u * T) / U / 2;
            p = 2 * m - u;
        }
    }

    function cool(uint256 u) external nonReentrant returns (uint256 m, uint256 p) {
        if (this == HUB) {
            m = u;
            emit Cool(this, m, 0, u);
            _burn(msg.sender, u);
            solid.safeTransfer(msg.sender, m);
        } else {
            (m, p) = cools(u);
            emit Cool(this, u, 0, m);
            solid.safeTransfer(msg.sender, m);
            _burn(msg.sender, u);
            _burn(address(this), p);
        }
    }

    function cools(uint256 u, uint256 e) public view notHub returns (uint256 m, uint256 p) {
        (uint256 P, uint256 E) = pool();
        uint256 T = totalSupply();
        uint256 U = T - P;

        // Base solid from liquid (same as cools(u))
        m = (u * T) / U / 2;
        p = 2 * m - u;

        // Add hub contribution: hub converts to solid at mass()/E rate
        if (e > 0 && E > 0) {
            m = m + (e * mass()) / E;
        }
    }

    function cool(uint256 u, uint256 e) external nonReentrant returns (uint256 m, uint256 p) {
        (m, p) = cools(u, e);
        emit Cool(this, u, e, m);
        if (e > 0) HUB.update(address(this), msg.sender, e);
        solid.safeTransfer(msg.sender, m);
        _burn(msg.sender, u);
        _burn(address(this), p);
    }

    function sells(uint256 s) public view returns (uint256 e) {
        (uint256 S, uint256 E) = pool();
        e = E - (E * S + E - 1) / (S + s);
    }

    function sell(uint256 s) external nonReentrant returns (uint256 e) {
        e = sells(s);
        _sell(s, e);
    }

    function sellsFor(ILiquid that, uint256 s) public view returns (uint256 e, uint256 thats) {
        e = sells(s);
        thats = that.buys(e);
    }

    function sellFor(ILiquid that, uint256 s) external nonReentrant returns (uint256 e, uint256 thats) {
        (e, thats) = sellsFor(that, s);
        // Transfer spokes from user to this pool
        emit Sell(this, s, e);
        _update(msg.sender, address(this), s);
        // Route hubs from this pool to target pool, spokes from target pool to user
        HUB.update(address(this), address(that), e);
        emit Buy(that, thats, e);
        Liquid(address(that)).update(address(that), msg.sender, thats);
    }

    function buys(uint256 e) public view returns (uint256 s) {
        (uint256 S, uint256 E) = pool();
        s = S - (S * E) / (E + e);
    }

    function buy(uint256 e) external nonReentrant returns (uint256 s) {
        s = buys(e);
        _buy(s, e);
    }

    function __buy(uint256 s, uint256 e) external onlyLiquid {
        _buy(s, e);
    }

    function _buy(uint256 s, uint256 e) private {
        HUB.update(msg.sender, address(this), e);
        emit Buy(this, s, e);
        _update(address(this), msg.sender, s);
    }

    function _sell(uint256 s, uint256 e) private {
        HUB.update(address(this), msg.sender, e);
        emit Sell(this, s, e);
        _update(msg.sender, address(this), s);
    }

    function update(address from, address to, uint256 amount) external onlyLiquid {
        _update(from, to, amount);
    }

    function made(IERC20Metadata backing) public view returns (bool cloned, address home, bytes32 salt) {
        if (address(backing) == address(0)) {
            revert Nothing();
        }
        salt = bytes32(uint256(uint160(address(backing))));
        home = Clones.predictDeterministicAddress(address(HUB), salt, address(HUB));
        cloned = home.code.length != 0;
    }

    function make(IERC20Metadata backing) public returns (ILiquid liquid) {
        if (this != HUB) {
            liquid = HUB.make(backing);
        } else {
            (bool cloned, address home, bytes32 salt) = made(backing);
            liquid = Liquid(home);
            if (!cloned) {
                emit Make(liquid, backing);
                home = Clones.cloneDeterministic(address(HUB), salt, 0);
                Liquid(home).zzz_(backing);
            }
        }
    }

    function zzz_(IERC20Metadata backing) external {
        if (address(solid) != address(0)) {
            revert Unauthorized();
        }
        solid = backing;
    }

    modifier notHub() {
        _notHub();
        _;
    }

    function _notHub() private view {
        if (address(this) == address(HUB)) {
            revert HubNotPool();
        }
    }

    modifier onlyLiquid() {
        _onlyLiquid();
        _;
    }

    function _onlyLiquid() private view {
        (, address home,) = HUB.made(Liquid(msg.sender).solid());
        if (msg.sender != address(HUB) && msg.sender != home) {
            revert Unauthorized();
        }
    }
}

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

import {IERC20Metadata} from "ierc20/IERC20Metadata.sol";

/// @title ILiquid — Hub-and-spoke AMM liquidity wrapper
/// @notice Wraps ERC-20 tokens with built-in constant-product AMM liquidity.
/// A single Hub instance wraps a backing token 1:1. Spoke instances created
/// via `make` each wrap a different ERC-20 and maintain a two-sided pool
/// (spoke tokens × hub tokens) for trading against the Hub.
interface ILiquid is IERC20Metadata {
    /// @notice The backing ERC-20 token this Liquid instance wraps.
    function solid() external view returns (IERC20Metadata);

    /// @notice Current pool reserves.
    /// @return S Spoke tokens held by the pool (this contract's own balance).
    /// @return E Hub tokens held by the pool (the "lake").
    function pool() external view returns (uint256 S, uint256 E);

    /// @notice Backing token balance held by this contract, redeemable via `cool`.
    function mass() external view returns (uint256);

    /// @notice Quote a heat: how many tokens the caller and pool would receive.
    /// @param m Amount of backing (solid) tokens to deposit (mass).
    /// @return u Liquid tokens the caller would receive.
    /// @return p Liquid tokens the pool would receive.
    function heats(uint256 m) external view returns (uint256 u, uint256 p);

    /// @notice Deposit backing tokens, mint liquid tokens. The 2× mint splits
    /// newly minted tokens between the caller and the pool, seeding AMM liquidity.
    /// @param m Amount of backing (solid) tokens to deposit (mass).
    /// @return u Liquid tokens minted to the caller.
    /// @return p Liquid tokens minted to the pool.
    function heat(uint256 m) external returns (uint256 u, uint256 p);

    /// @notice Quote a heat with an explicit hub-token deposit.
    /// @param m Amount of backing (solid) tokens to deposit (mass).
    /// @param e Amount of hub tokens to deposit into the pool's lake.
    /// @return u Liquid tokens the caller would receive.
    /// @return p Liquid tokens the pool would receive.
    function heats(uint256 m, uint256 e) external view returns (uint256 u, uint256 p);

    /// @notice Deposit backing tokens and hub tokens, mint liquid tokens.
    /// @param m Amount of backing (solid) tokens to deposit (mass).
    /// @param e Amount of hub tokens to deposit into the pool's lake.
    /// @return u Liquid tokens minted to the caller.
    /// @return p Liquid tokens minted to the pool.
    function heat(uint256 m, uint256 e) external returns (uint256 u, uint256 p);

    /// @notice Quote a cool: how many backing tokens and pool burns result.
    /// @param u Amount of liquid tokens to burn.
    /// @return m Backing (solid) tokens the caller would receive (mass).
    /// @return p Liquid tokens that would be burned from the pool.
    function cools(uint256 u) external view returns (uint256 m, uint256 p);

    /// @notice Burn liquid tokens and redeem proportional backing tokens.
    /// @param u Amount of liquid tokens to burn from the caller.
    /// @return m Backing (solid) tokens returned to the caller (mass).
    /// @return p Liquid tokens burned from the pool.
    function cool(uint256 u) external returns (uint256 m, uint256 p);

    /// @notice Quote a cool with an explicit hub-token withdrawal.
    /// @param u Amount of liquid tokens to burn.
    /// @param e Amount of hub tokens to withdraw from the pool's lake.
    /// @return m Backing (solid) tokens the caller would receive (mass).
    /// @return p Liquid tokens that would be burned from the pool.
    function cools(uint256 u, uint256 e) external view returns (uint256 m, uint256 p);

    /// @notice Burn liquid tokens and redeem backing tokens plus hub tokens.
    /// @param u Amount of liquid tokens to burn from the caller.
    /// @param e Amount of hub tokens to withdraw from the pool's lake.
    /// @return m Backing (solid) tokens returned to the caller (mass).
    /// @return p Liquid tokens burned from the pool.
    function cool(uint256 u, uint256 e) external returns (uint256 m, uint256 p);

    /// @notice Quote a sell: how many hub tokens would be received.
    /// @param s Amount of spoke tokens to sell into the pool.
    /// @return e Hub tokens that would be received.
    function sells(uint256 s) external view returns (uint256 e);

    /// @notice Sell spoke tokens for hub tokens via the constant-product AMM.
    /// @param s Amount of spoke tokens to sell.
    /// @return e Hub tokens received.
    function sell(uint256 s) external returns (uint256 e);

    /// @notice Quote a cross-spoke swap: sell this spoke's tokens for another's.
    /// @param that The target spoke to buy into.
    /// @param s Amount of this spoke's tokens to sell.
    /// @return e Hub tokens used as intermediary.
    /// @return thats Target spoke tokens that would be received.
    function sellsFor(ILiquid that, uint256 s) external view returns (uint256 e, uint256 thats);

    /// @notice Atomic cross-spoke swap: sell this spoke's tokens, buy another's,
    /// routing through the hub in a single transaction.
    /// @param that The target spoke to buy into.
    /// @param s Amount of this spoke's tokens to sell.
    /// @return e Hub tokens used as intermediary.
    /// @return thats Target spoke tokens received.
    function sellFor(ILiquid that, uint256 s) external returns (uint256 e, uint256 thats);

    /// @notice Quote a buy: how many spoke tokens would be received.
    /// @param e Amount of hub tokens to spend.
    /// @return s Spoke tokens that would be received.
    function buys(uint256 e) external view returns (uint256 s);

    /// @notice Buy spoke tokens with hub tokens via the constant-product AMM.
    /// @param e Amount of hub tokens to spend.
    /// @return s Spoke tokens received.
    function buy(uint256 e) external returns (uint256 s);

    /// @notice Check whether a spoke for the given backing token exists.
    /// @param backing The ERC-20 token to query.
    /// @return cloned True if the spoke has already been deployed.
    /// @return home The deterministic CREATE2 address (valid even before deployment).
    /// @return salt The CREATE2 salt derived from the backing token address.
    function made(IERC20Metadata backing) external view returns (bool cloned, address home, bytes32 salt);

    /// @notice Deploy a new spoke for the given backing token via deterministic CREATE2.
    /// @param backing The ERC-20 token the new spoke will wrap.
    /// @return liquid The newly created spoke instance.
    function make(IERC20Metadata backing) external returns (ILiquid liquid);

    /// @notice Emitted on `heat` — backing tokens deposited, liquid minted.
    event Heat(ILiquid indexed liquid, uint256 solids, uint256 pools, uint256 senders);
    /// @notice Emitted on `cool` — liquid burned, backing tokens redeemed.
    event Cool(ILiquid indexed liquid, uint256 liquids, uint256 hubs, uint256 solids);
    /// @notice Emitted on `buy` — hub tokens spent for spoke tokens.
    event Buy(ILiquid indexed liquid, uint256 liquids, uint256 hubs);
    /// @notice Emitted on `sell` — spoke tokens sold for hub tokens.
    event Sell(ILiquid indexed liquid, uint256 liquids, uint256 hubs);
    /// @notice Emitted on `make` — new spoke deployed.
    event Make(ILiquid indexed liquid, IERC20Metadata indexed solid);

    /// @notice The hub has no AMM pool; sell/buy operations are not available.
    error HubNotPool();
    /// @notice The operation resulted in zero output.
    error Nothing();
    /// @notice Caller is not authorized for this operation.
    error Unauthorized();
}

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

pragma solidity ^0.8.30;

import {Context} from "./Context.sol";
import {IERC20Metadata, IERC20} from "ierc20/IERC20Metadata.sol";
import {IERC20Errors} from "ierc20/IERC20Errors.sol";

/**
 * @dev Implementation of the {IERC20} interface.
 *
 * This implementation is agnostic to the way tokens are created. This means
 * that a supply mechanism has to be added in a derived contract using {_mint}.
 *
 * TIP: For a detailed writeup see our guide
 * https://forum.openzeppelin.com/t/how-to-implement-erc20-supply-mechanisms/226[How
 * to implement supply mechanisms].
 *
 * The default value of {decimals} is 18. To change this, you should override
 * this function so it returns a different value.
 *
 * We have followed general OpenZeppelin Contracts guidelines: functions revert
 * instead returning `false` on failure. This behavior is nonetheless
 * conventional and does not conflict with the expectations of ERC-20
 * applications.
 */
abstract contract ERC20 is Context, IERC20, IERC20Metadata, IERC20Errors {
    mapping(address account => uint256) private _balances;

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

    uint256 private _totalSupply;

    string internal _name;
    string internal _symbol;

    /**
     * @dev Sets the values for {name} and {symbol}.
     *
     * Both values are immutable: they can only be set once during construction.
     */
    constructor(string memory name_, string memory symbol_) {
        _name = name_;
        _symbol = symbol_;
    }

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

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

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

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

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

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

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

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

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

    /**
     * @dev Moves a `value` amount of tokens from `from` to `to`.
     *
     * This internal function is equivalent to {transfer}, and can be used to
     * e.g. implement automatic token fees, slashing mechanisms, etc.
     *
     * Emits a {Transfer} event.
     *
     * NOTE: This function is not virtual, {_update} should be overridden instead.
     */
    function _transfer(address from, address to, uint256 value) internal {
        if (from == address(0)) {
            revert ERC20InvalidSender(address(0));
        }
        if (to == address(0)) {
            revert ERC20InvalidReceiver(address(0));
        }
        _update(from, to, value);
    }

    /**
     * @dev Transfers a `value` amount of tokens from `from` to `to`, or alternatively mints (or burns) if `from`
     * (or `to`) is the zero address. All customizations to transfers, mints, and burns should be done by overriding
     * this function.
     *
     * Emits a {Transfer} event.
     */
    function _update(address from, address to, uint256 value) internal virtual {
        if (from == address(0)) {
            // Overflow check required: The rest of the code assumes that totalSupply never overflows
            _totalSupply += value;
        } else {
            uint256 fromBalance = _balances[from];
            if (fromBalance < value) {
                revert ERC20InsufficientBalance(from, fromBalance, value);
            }
            unchecked {
                // Overflow not possible: value <= fromBalance <= totalSupply.
                _balances[from] = fromBalance - value;
            }
        }

        if (to == address(0)) {
            unchecked {
                // Overflow not possible: value <= totalSupply or value <= fromBalance <= totalSupply.
                _totalSupply -= value;
            }
        } else {
            unchecked {
                // Overflow not possible: balance + value is at most totalSupply, which we know fits into a uint256.
                _balances[to] += value;
            }
        }

        emit Transfer(from, to, value);
    }

    /**
     * @dev Creates a `value` amount of tokens and assigns them to `account`, by transferring it from address(0).
     * Relies on the `_update` mechanism
     *
     * Emits a {Transfer} event with `from` set to the zero address.
     *
     * NOTE: This function is not virtual, {_update} should be overridden instead.
     */
    function _mint(address account, uint256 value) internal {
        if (account == address(0)) {
            revert ERC20InvalidReceiver(address(0));
        }
        _update(address(0), account, value);
    }

    /**
     * @dev Destroys a `value` amount of tokens from `account`, lowering the total supply.
     * Relies on the `_update` mechanism.
     *
     * Emits a {Transfer} event with `to` set to the zero address.
     *
     * NOTE: This function is not virtual, {_update} should be overridden instead
     */
    function _burn(address account, uint256 value) internal {
        if (account == address(0)) {
            revert ERC20InvalidSender(address(0));
        }
        _update(account, address(0), value);
    }

    /**
     * @dev Sets `value` as the allowance of `spender` over the `owner`'s tokens.
     *
     * This internal function is equivalent to `approve`, and can be used to
     * e.g. set automatic allowances for certain subsystems, etc.
     *
     * Emits an {Approval} event.
     *
     * Requirements:
     *
     * - `owner` cannot be the zero address.
     * - `spender` cannot be the zero address.
     *
     * Overrides to this logic should be done to the variant with an additional `bool emitEvent` argument.
     */
    function _approve(address owner, address spender, uint256 value) internal {
        _approve(owner, spender, value, true);
    }

    /**
     * @dev Variant of {_approve} with an optional flag to enable or disable the {Approval} event.
     *
     * By default (when calling {_approve}) the flag is set to true. On the other hand, approval changes made by
     * `_spendAllowance` during the `transferFrom` operation set the flag to false. This saves gas by not emitting any
     * `Approval` event during `transferFrom` operations.
     *
     * Anyone who wishes to continue emitting `Approval` events on the`transferFrom` operation can force the flag to
     * true using the following override:
     *
     * ```solidity
     * function _approve(address owner, address spender, uint256 value, bool) internal virtual override {
     *     super._approve(owner, spender, value, true);
     * }
     * ```
     *
     * Requirements are the same as {_approve}.
     */
    function _approve(address owner, address spender, uint256 value, bool emitEvent) internal virtual {
        if (owner == address(0)) {
            revert ERC20InvalidApprover(address(0));
        }
        if (spender == address(0)) {
            revert ERC20InvalidSpender(address(0));
        }
        _allowances[owner][spender] = value;
        if (emitEvent) {
            emit Approval(owner, spender, value);
        }
    }

    /**
     * @dev Updates `owner`'s allowance for `spender` based on spent `value`.
     *
     * Does not update the allowance value in case of infinite allowance.
     * Revert if not enough allowance is available.
     *
     * Does not emit an {Approval} event.
     */
    function _spendAllowance(address owner, address spender, uint256 value) internal virtual {
        uint256 currentAllowance = allowance(owner, spender);
        if (currentAllowance < type(uint256).max) {
            if (currentAllowance < value) {
                revert ERC20InsufficientAllowance(spender, currentAllowance, value);
            }
            unchecked {
                _approve(owner, spender, currentAllowance - value, false);
            }
        }
    }
}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.3.0) (token/ERC20/utils/SafeERC20.sol)

pragma solidity ^0.8.20;

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

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

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

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

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

    /**
     * @dev Variant of {safeTransfer} that returns a bool instead of reverting if the operation is not successful.
     */
    function trySafeTransfer(IERC20 token, address to, uint256 value) internal returns (bool) {
        return _callOptionalReturnBool(token, abi.encodeCall(token.transfer, (to, value)));
    }

    /**
     * @dev Variant of {safeTransferFrom} that returns a bool instead of reverting if the operation is not successful.
     */
    function trySafeTransferFrom(IERC20 token, address from, address to, uint256 value) internal returns (bool) {
        return _callOptionalReturnBool(token, abi.encodeCall(token.transferFrom, (from, to, value)));
    }

    /**
     * @dev Increase the calling contract's allowance toward `spender` by `value`. If `token` returns no value,
     * non-reverting calls are assumed to be successful.
     *
     * IMPORTANT: If the token implements ERC-7674 (ERC-20 with temporary allowance), and if the "client"
     * smart contract uses ERC-7674 to set temporary allowances, then the "client" smart contract should avoid using
     * this function. Performing a {safeIncreaseAllowance} or {safeDecreaseAllowance} operation on a token contract
     * that has a non-zero temporary allowance (for that particular owner-spender) will result in unexpected behavior.
     */
    function safeIncreaseAllowance(IERC20 token, address spender, uint256 value) internal {
        uint256 oldAllowance = token.allowance(address(this), spender);
        forceApprove(token, spender, oldAllowance + value);
    }

    /**
     * @dev Decrease the calling contract's allowance toward `spender` by `requestedDecrease`. If `token` returns no
     * value, non-reverting calls are assumed to be successful.
     *
     * IMPORTANT: If the token implements ERC-7674 (ERC-20 with temporary allowance), and if the "client"
     * smart contract uses ERC-7674 to set temporary allowances, then the "client" smart contract should avoid using
     * this function. Performing a {safeIncreaseAllowance} or {safeDecreaseAllowance} operation on a token contract
     * that has a non-zero temporary allowance (for that particular owner-spender) will result in unexpected behavior.
     */
    function safeDecreaseAllowance(IERC20 token, address spender, uint256 requestedDecrease) internal {
        unchecked {
            uint256 currentAllowance = token.allowance(address(this), spender);
            if (currentAllowance < requestedDecrease) {
                revert SafeERC20FailedDecreaseAllowance(spender, currentAllowance, requestedDecrease);
            }
            forceApprove(token, spender, currentAllowance - requestedDecrease);
        }
    }

    /**
     * @dev Set the calling contract's allowance toward `spender` to `value`. If `token` returns no value,
     * non-reverting calls are assumed to be successful. Meant to be used with tokens that require the approval
     * to be set to zero before setting it to a non-zero value, such as USDT.
     *
     * NOTE: If the token implements ERC-7674, this function will not modify any temporary allowance. This function
     * only sets the "standard" allowance. Any temporary allowance will remain active, in addition to the value being
     * set here.
     */
    function forceApprove(IERC20 token, address spender, uint256 value) internal {
        bytes memory approvalCall = abi.encodeCall(token.approve, (spender, value));

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

    /**
     * @dev Imitates a Solidity high-level call (i.e. a regular function call to a contract), relaxing the requirement
     * on the return value: the return value is optional (but if data is returned, it must not be false).
     * @param token The token targeted by the call.
     * @param data The call data (encoded using abi.encode or one of its variants).
     *
     * This is a variant of {_callOptionalReturnBool} that reverts if call fails to meet the requirements.
     */
    function _callOptionalReturn(IERC20 token, bytes memory data) private {
        uint256 returnSize;
        uint256 returnValue;
        assembly ("memory-safe") {
            let success := call(gas(), token, 0, add(data, 0x20), mload(data), 0, 0x20)
            // bubble errors
            if iszero(success) {
                let ptr := mload(0x40)
                returndatacopy(ptr, 0, returndatasize())
                revert(ptr, returndatasize())
            }
            returnSize := returndatasize()
            returnValue := mload(0)
        }

        if (returnSize == 0 ? address(token).code.length == 0 : returnValue != 1) {
            revert SafeERC20FailedOperation(address(token));
        }
    }

    /**
     * @dev Imitates a Solidity high-level call (i.e. a regular function call to a contract), relaxing the requirement
     * on the return value: the return value is optional (but if data is returned, it must not be false).
     * @param token The token targeted by the call.
     * @param data The call data (encoded using abi.encode or one of its variants).
     *
     * This is a variant of {_callOptionalReturn} that silently catches all reverts and returns a bool instead.
     */
    function _callOptionalReturnBool(IERC20 token, bytes memory data) private returns (bool) {
        bool success;
        uint256 returnSize;
        uint256 returnValue;
        assembly ("memory-safe") {
            success := call(gas(), token, 0, add(data, 0x20), mload(data), 0, 0x20)
            returnSize := returndatasize()
            returnValue := mload(0)
        }
        return success && (returnSize == 0 ? address(token).code.length > 0 : returnValue == 1);
    }
}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.3.0) (proxy/Clones.sol)

pragma solidity ^0.8.30;

/**
 * @dev https://eips.ethereum.org/EIPS/eip-1167[ERC-1167] is a standard for
 * deploying minimal proxy contracts, also known as "clones".
 *
 * > To simply and cheaply clone contract functionality in an immutable way, this standard specifies
 * > a minimal bytecode implementation that delegates all calls to a known, fixed address.
 *
 * This is a stripped-down version of OpenZeppelin's Clones library (v5.3.0), containing only
 * deterministic CREATE2 deployment functions with explicit value parameter support.
 * The following functions have been removed: clone(), and the overloads of cloneDeterministic()
 * and predictDeterministicAddress() that omit the value or deployer parameters.
 *
 * Original source: https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v5.3.0/contracts/proxy/Clones.sol
 */
library Clones {
    /**
     * @dev Deploys and returns the address of a clone that mimics the behavior of `implementation`.
     *
     * This function uses the create2 opcode and a `salt` to deterministically deploy
     * the clone. Using the same `implementation` and `salt` multiple times will revert, since
     * the clones cannot be deployed twice at the same address.
     *
     * NOTE: Using a non-zero value at creation will require the contract using this function (e.g. a factory)
     * to always have enough balance for new deployments. Consider exposing this function under a payable method.
     */
    function cloneDeterministic(
        address implementation,
        bytes32 salt,
        uint256 value
    ) internal returns (address instance) {
        assembly ("memory-safe") {
            // Cleans the upper 96 bits of the `implementation` word, then packs the first 3 bytes
            // of the `implementation` address with the bytecode before the address.
            mstore(
                0x00,
                or(
                    shr(0xe8, shl(0x60, implementation)),
                    0x3d602d80600a3d3981f3363d3d373d3d3d363d73000000
                )
            )
            // Packs the remaining 17 bytes of `implementation` with the bytecode after the address.
            mstore(
                0x20,
                or(shl(0x78, implementation), 0x5af43d82803e903d91602b57fd5bf3)
            )
            instance := create2(value, 0x09, 0x37, salt)
        }
    }

    /**
     * @dev Computes the address of a clone deployed using {Clones-cloneDeterministic}.
     */
    function predictDeterministicAddress(
        address implementation,
        bytes32 salt,
        address deployer
    ) internal pure returns (address predicted) {
        assembly ("memory-safe") {
            let ptr := mload(0x40)
            mstore(add(ptr, 0x38), deployer)
            mstore(add(ptr, 0x24), 0x5af43d82803e903d91602b57fd5bf3ff)
            mstore(add(ptr, 0x14), implementation)
            mstore(ptr, 0x3d602d80600a3d3981f3363d3d373d3d3d363d73)
            mstore(add(ptr, 0x58), salt)
            mstore(add(ptr, 0x78), keccak256(add(ptr, 0x0c), 0x37))
            predicted := and(
                keccak256(add(ptr, 0x43), 0x55),
                0xffffffffffffffffffffffffffffffffffffffff
            )
        }
    }
}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.3.0) (utils/math/Math.sol)

pragma solidity ^0.8.20;

import {Panic} from "panic/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 Return the 512-bit addition of two uint256.
     *
     * The result is stored in two 256 variables such that sum = high * 2²⁵⁶ + low.
     */
    function add512(uint256 a, uint256 b) internal pure returns (uint256 high, uint256 low) {
        assembly ("memory-safe") {
            low := add(a, b)
            high := lt(low, a)
        }
    }

    /**
     * @dev Return the 512-bit multiplication of two uint256.
     *
     * The result is stored in two 256 variables such that product = high * 2²⁵⁶ + low.
     */
    function mul512(uint256 a, uint256 b) internal pure returns (uint256 high, uint256 low) {
        // 512-bit multiply [high low] = 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 = high * 2²⁵⁶ + low.
        assembly ("memory-safe") {
            let mm := mulmod(a, b, not(0))
            low := mul(a, b)
            high := sub(sub(mm, low), lt(mm, low))
        }
    }

    /**
     * @dev Returns the addition of two unsigned integers, with a success flag (no overflow).
     */
    function tryAdd(uint256 a, uint256 b) internal pure returns (bool success, uint256 result) {
        unchecked {
            uint256 c = a + b;
            success = c >= a;
            result = c * SafeCast.toUint(success);
        }
    }

    /**
     * @dev Returns the subtraction of two unsigned integers, with a success flag (no overflow).
     */
    function trySub(uint256 a, uint256 b) internal pure returns (bool success, uint256 result) {
        unchecked {
            uint256 c = a - b;
            success = c <= a;
            result = c * SafeCast.toUint(success);
        }
    }

    /**
     * @dev Returns the multiplication of two unsigned integers, with a success flag (no overflow).
     */
    function tryMul(uint256 a, uint256 b) internal pure returns (bool success, uint256 result) {
        unchecked {
            uint256 c = a * b;
            assembly ("memory-safe") {
                // Only true when the multiplication doesn't overflow
                // (c / a == b) || (a == 0)
                success := or(eq(div(c, a), b), iszero(a))
            }
            // equivalent to: success ? c : 0
            result = c * SafeCast.toUint(success);
        }
    }

    /**
     * @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 {
            success = b > 0;
            assembly ("memory-safe") {
                // The `DIV` opcode returns zero when the denominator is 0.
                result := div(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 {
            success = b > 0;
            assembly ("memory-safe") {
                // The `MOD` opcode returns zero when the denominator is 0.
                result := mod(a, b)
            }
        }
    }

    /**
     * @dev Unsigned saturating addition, bounds to `2²⁵⁶ - 1` instead of overflowing.
     */
    function saturatingAdd(uint256 a, uint256 b) internal pure returns (uint256) {
        (bool success, uint256 result) = tryAdd(a, b);
        return ternary(success, result, type(uint256).max);
    }

    /**
     * @dev Unsigned saturating subtraction, bounds to zero instead of overflowing.
     */
    function saturatingSub(uint256 a, uint256 b) internal pure returns (uint256) {
        (, uint256 result) = trySub(a, b);
        return result;
    }

    /**
     * @dev Unsigned saturating multiplication, bounds to `2²⁵⁶ - 1` instead of overflowing.
     */
    function saturatingMul(uint256 a, uint256 b) internal pure returns (uint256) {
        (bool success, uint256 result) = tryMul(a, b);
        return ternary(success, result, type(uint256).max);
    }

    /**
     * @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 {
            (uint256 high, uint256 low) = mul512(x, y);

            // Handle non-overflow cases, 256 by 256 division.
            if (high == 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 low / denominator;
            }

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

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

            // Make division exact by subtracting the remainder from [high low].
            uint256 remainder;
            assembly ("memory-safe") {
                // Compute remainder using mulmod.
                remainder := mulmod(x, y, denominator)

                // Subtract 256 bit number from 512 bit number.
                high := sub(high, gt(remainder, low))
                low := sub(low, 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 ("memory-safe") {
                // Divide denominator by twos.
                denominator := div(denominator, twos)

                // Divide [high low] by twos.
                low := div(low, 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 high into low.
            low |= high * 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 high
            // is no longer required.
            result = low * 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 Calculates floor(x * y >> n) with full precision. Throws if result overflows a uint256.
     */
    function mulShr(uint256 x, uint256 y, uint8 n) internal pure returns (uint256 result) {
        unchecked {
            (uint256 high, uint256 low) = mul512(x, y);
            if (high >= 1 << n) {
                Panic.panic(Panic.UNDER_OVERFLOW);
            }
            return (high << (256 - n)) | (low >> n);
        }
    }

    /**
     * @dev Calculates x * y >> n with full precision, following the selected rounding direction.
     */
    function mulShr(uint256 x, uint256 y, uint8 n, Rounding rounding) internal pure returns (uint256) {
        return mulShr(x, y, n) + SafeCast.toUint(unsignedRoundsUp(rounding) && mulmod(x, y, 1 << n) > 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 x) internal pure returns (uint256 r) {
        // If value has upper 128 bits set, log2 result is at least 128
        r = SafeCast.toUint(x > 0xffffffffffffffffffffffffffffffff) << 7;
        // If upper 64 bits of 128-bit half set, add 64 to result
        r |= SafeCast.toUint((x >> r) > 0xffffffffffffffff) << 6;
        // If upper 32 bits of 64-bit half set, add 32 to result
        r |= SafeCast.toUint((x >> r) > 0xffffffff) << 5;
        // If upper 16 bits of 32-bit half set, add 16 to result
        r |= SafeCast.toUint((x >> r) > 0xffff) << 4;
        // If upper 8 bits of 16-bit half set, add 8 to result
        r |= SafeCast.toUint((x >> r) > 0xff) << 3;
        // If upper 4 bits of 8-bit half set, add 4 to result
        r |= SafeCast.toUint((x >> r) > 0xf) << 2;

        // Shifts value right by the current result and use it as an index into this lookup table:
        //
        // | x (4 bits) |  index  | table[index] = MSB position |
        // |------------|---------|-----------------------------|
        // |    0000    |    0    |        table[0] = 0         |
        // |    0001    |    1    |        table[1] = 0         |
        // |    0010    |    2    |        table[2] = 1         |
        // |    0011    |    3    |        table[3] = 1         |
        // |    0100    |    4    |        table[4] = 2         |
        // |    0101    |    5    |        table[5] = 2         |
        // |    0110    |    6    |        table[6] = 2         |
        // |    0111    |    7    |        table[7] = 2         |
        // |    1000    |    8    |        table[8] = 3         |
        // |    1001    |    9    |        table[9] = 3         |
        // |    1010    |   10    |        table[10] = 3        |
        // |    1011    |   11    |        table[11] = 3        |
        // |    1100    |   12    |        table[12] = 3        |
        // |    1101    |   13    |        table[13] = 3        |
        // |    1110    |   14    |        table[14] = 3        |
        // |    1111    |   15    |        table[15] = 3        |
        //
        // The lookup table is represented as a 32-byte value with the MSB positions for 0-15 in the last 16 bytes.
        assembly ("memory-safe") {
            r := or(r, byte(shr(r, x), 0x0000010102020202030303030303030300000000000000000000000000000000))
        }
    }

    /**
     * @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 x) internal pure returns (uint256 r) {
        // If value has upper 128 bits set, log2 result is at least 128
        r = SafeCast.toUint(x > 0xffffffffffffffffffffffffffffffff) << 7;
        // If upper 64 bits of 128-bit half set, add 64 to result
        r |= SafeCast.toUint((x >> r) > 0xffffffffffffffff) << 6;
        // If upper 32 bits of 64-bit half set, add 32 to result
        r |= SafeCast.toUint((x >> r) > 0xffffffff) << 5;
        // If upper 16 bits of 32-bit half set, add 16 to result
        r |= SafeCast.toUint((x >> r) > 0xffff) << 4;
        // Add 1 if upper 8 bits of 16-bit half set, and divide accumulated result by 8
        return (r >> 3) | SafeCast.toUint((x >> r) > 0xff);
    }

    /**
     * @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.3.0) (utils/ReentrancyGuardTransient.sol)

pragma solidity ^0.8.30;

/**
 * @dev Variant of {ReentrancyGuard} that uses transient storage.
 *
 * NOTE: This variant only works on networks where EIP-1153 is available.
 *
 * _Available since v5.1._
 */
abstract contract ReentrancyGuardTransient {
    // keccak256(abi.encode(uint256(keccak256("openzeppelin.storage.ReentrancyGuard")) - 1)) & ~bytes32(uint256(0xff))
    bytes32 private constant REENTRANCY_GUARD_STORAGE =
        0x9b779b17422d0df92223018b32b4d1fa46e071723d6817e2486d003becc55f00;

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

    /**
     * @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, REENTRANCY_GUARD_STORAGE.asBoolean().tload() will be false
        if (_reentrancyGuardEntered()) {
            revert ReentrancyGuardReentrantCall();
        }

        // Any calls to nonReentrant after this point will fail
        tstore(true);
    }

    function _nonReentrantAfter() private {
        tstore(false);
    }

    /**
     * @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 value) {
        assembly ("memory-safe") {
            value := tload(REENTRANCY_GUARD_STORAGE)
        }
    }

    /**
     * @dev Store `value` at location `slot` in transient storage.
     */
    function tstore(bool value) internal {
        assembly ("memory-safe") {
            tstore(REENTRANCY_GUARD_STORAGE, value)
        }
    }

    /**
     * @dev Load the value held at location `slot` in transient storage.
     */
    function tload() internal view returns (bool value) {
        assembly ("memory-safe") {
            value := tload(REENTRANCY_GUARD_STORAGE)
        }
    }
}

// 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.0.1) (utils/Context.sol)

pragma solidity ^0.8.30;

/**
 * @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) (interfaces/draft-IERC6093.sol)
pragma solidity ^0.8.30;

/**
 * @dev Standard ERC-20 Errors
 * Interface of the https://eips.ethereum.org/EIPS/eip-6093[ERC-6093] custom errors for ERC-20 tokens.
 */
interface IERC20Errors {
    /**
     * @dev Indicates an error related to the current `balance` of a `sender`. Used in transfers.
     * @param sender Address whose tokens are being transferred.
     * @param balance Current balance for the interacting account.
     * @param needed Minimum amount required to perform a transfer.
     */
    error ERC20InsufficientBalance(address sender, uint256 balance, uint256 needed);

    /**
     * @dev Indicates a failure with the token `sender`. Used in transfers.
     * @param sender Address whose tokens are being transferred.
     */
    error ERC20InvalidSender(address sender);

    /**
     * @dev Indicates a failure with the token `receiver`. Used in transfers.
     * @param receiver Address to which tokens are being transferred.
     */
    error ERC20InvalidReceiver(address receiver);

    /**
     * @dev Indicates a failure with the `spender`’s `allowance`. Used in transfers.
     * @param spender Address that may be allowed to operate on tokens without being their owner.
     * @param allowance Amount of tokens a `spender` is allowed to operate with.
     * @param needed Minimum amount required to perform a transfer.
     */
    error ERC20InsufficientAllowance(address spender, uint256 allowance, uint256 needed);

    /**
     * @dev Indicates a failure with the `approver` of a token to be approved. Used in approvals.
     * @param approver Address initiating an approval operation.
     */
    error ERC20InvalidApprover(address approver);

    /**
     * @dev Indicates a failure with the `spender` to be approved. Used in approvals.
     * @param spender Address that may be allowed to operate on tokens without being their owner.
     */
    error ERC20InvalidSpender(address spender);
}

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

{
  "remappings": [
    "forge-std/=lib/forge-std/src/",
    "clones/=lib/clones/",
    "ierc20/=lib/ierc20/",
    "erc20/=lib/erc20/",
    "math/=lib/math/",
    "strings/=lib/strings/",
    "panic/=lib/panic/",
    "iliquid/=lib/iliquid/",
    "reentrancy/=lib/reentrancy/"
  ],
  "optimizer": {
    "enabled": true,
    "runs": 200
  },
  "metadata": {
    "useLiteralContent": false,
    "bytecodeHash": "none",
    "appendCBOR": false
  },
  "outputSelection": {
    "*": {
      "*": [
        "evm.bytecode",
        "evm.deployedBytecode",
        "devdoc",
        "userdoc",
        "metadata",
        "abi"
      ]
    }
  },
  "evmVersion": "cancun",
  "viaIR": true,
  "debug": {
    "revertStrings": "default"
  }
}

• No Contract Security Audit Submitted- Submit Audit Here

[{"inputs":[{"internalType":"contract IERC20Metadata","name":"hub","type":"address"}],"stateMutability":"nonpayable","type":"constructor"},{"inputs":[{"internalType":"address","name":"spender","type":"address"},{"internalType":"uint256","name":"allowance","type":"uint256"},{"internalType":"uint256","name":"needed","type":"uint256"}],"name":"ERC20InsufficientAllowance","type":"error"},{"inputs":[{"internalType":"address","name":"sender","type":"address"},{"internalType":"uint256","name":"balance","type":"uint256"},{"internalType":"uint256","name":"needed","type":"uint256"}],"name":"ERC20InsufficientBalance","type":"error"},{"inputs":[{"internalType":"address","name":"approver","type":"address"}],"name":"ERC20InvalidApprover","type":"error"},{"inputs":[{"internalType":"address","name":"receiver","type":"address"}],"name":"ERC20InvalidReceiver","type":"error"},{"inputs":[{"internalType":"address","name":"sender","type":"address"}],"name":"ERC20InvalidSender","type":"error"},{"inputs":[{"internalType":"address","name":"spender","type":"address"}],"name":"ERC20InvalidSpender","type":"error"},{"inputs":[],"name":"HubNotPool","type":"error"},{"inputs":[],"name":"Nothing","type":"error"},{"inputs":[],"name":"ReentrancyGuardReentrantCall","type":"error"},{"inputs":[{"internalType":"address","name":"token","type":"address"}],"name":"SafeERC20FailedOperation","type":"error"},{"inputs":[],"name":"Unauthorized","type":"error"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"owner","type":"address"},{"indexed":true,"internalType":"address","name":"spender","type":"address"},{"indexed":false,"internalType":"uint256","name":"value","type":"uint256"}],"name":"Approval","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"contract ILiquid","name":"liquid","type":"address"},{"indexed":false,"internalType":"uint256","name":"liquids","type":"uint256"},{"indexed":false,"internalType":"uint256","name":"hubs","type":"uint256"}],"name":"Buy","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"contract ILiquid","name":"liquid","type":"address"},{"indexed":false,"internalType":"uint256","name":"liquids","type":"uint256"},{"indexed":false,"internalType":"uint256","name":"hubs","type":"uint256"},{"indexed":false,"internalType":"uint256","name":"solids","type":"uint256"}],"name":"Cool","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"contract ILiquid","name":"liquid","type":"address"},{"indexed":false,"internalType":"uint256","name":"solids","type":"uint256"},{"indexed":false,"internalType":"uint256","name":"pools","type":"uint256"},{"indexed":false,"internalType":"uint256","name":"senders","type":"uint256"}],"name":"Heat","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"contract ILiquid","name":"liquid","type":"address"},{"indexed":true,"internalType":"contract IERC20Metadata","name":"solid","type":"address"}],"name":"Make","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"contract ILiquid","name":"liquid","type":"address"},{"indexed":false,"internalType":"uint256","name":"liquids","type":"uint256"},{"indexed":false,"internalType":"uint256","name":"hubs","type":"uint256"}],"name":"Sell","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"from","type":"address"},{"indexed":true,"internalType":"address","name":"to","type":"address"},{"indexed":false,"internalType":"uint256","name":"value","type":"uint256"}],"name":"Transfer","type":"event"},{"inputs":[],"name":"HUB","outputs":[{"internalType":"contract Liquid","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"s","type":"uint256"},{"internalType":"uint256","name":"e","type":"uint256"}],"name":"__buy","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"owner","type":"address"},{"internalType":"address","name":"spender","type":"address"}],"name":"allowance","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"spender","type":"address"},{"internalType":"uint256","name":"value","type":"uint256"}],"name":"approve","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"account","type":"address"}],"name":"balanceOf","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"e","type":"uint256"}],"name":"buy","outputs":[{"internalType":"uint256","name":"s","type":"uint256"}],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"e","type":"uint256"}],"name":"buys","outputs":[{"internalType":"uint256","name":"s","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"u","type":"uint256"}],"name":"cool","outputs":[{"internalType":"uint256","name":"m","type":"uint256"},{"internalType":"uint256","name":"p","type":"uint256"}],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"u","type":"uint256"},{"internalType":"uint256","name":"e","type":"uint256"}],"name":"cool","outputs":[{"internalType":"uint256","name":"m","type":"uint256"},{"internalType":"uint256","name":"p","type":"uint256"}],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"u","type":"uint256"},{"internalType":"uint256","name":"e","type":"uint256"}],"name":"cools","outputs":[{"internalType":"uint256","name":"m","type":"uint256"},{"internalType":"uint256","name":"p","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"u","type":"uint256"}],"name":"cools","outputs":[{"internalType":"uint256","name":"m","type":"uint256"},{"internalType":"uint256","name":"p","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"decimals","outputs":[{"internalType":"uint8","name":"","type":"uint8"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"m","type":"uint256"}],"name":"heat","outputs":[{"internalType":"uint256","name":"u","type":"uint256"},{"internalType":"uint256","name":"p","type":"uint256"}],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"m","type":"uint256"},{"internalType":"uint256","name":"e","type":"uint256"}],"name":"heat","outputs":[{"internalType":"uint256","name":"u","type":"uint256"},{"internalType":"uint256","name":"p","type":"uint256"}],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"m","type":"uint256"},{"internalType":"uint256","name":"e","type":"uint256"}],"name":"heats","outputs":[{"internalType":"uint256","name":"u","type":"uint256"},{"internalType":"uint256","name":"p","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"m","type":"uint256"}],"name":"heats","outputs":[{"internalType":"uint256","name":"u","type":"uint256"},{"internalType":"uint256","name":"p","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"contract IERC20Metadata","name":"backing","type":"address"}],"name":"made","outputs":[{"internalType":"bool","name":"cloned","type":"bool"},{"internalType":"address","name":"home","type":"address"},{"internalType":"bytes32","name":"salt","type":"bytes32"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"contract IERC20Metadata","name":"backing","type":"address"}],"name":"make","outputs":[{"internalType":"contract ILiquid","name":"liquid","type":"address"}],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"mass","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"name","outputs":[{"internalType":"string","name":"","type":"string"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"pool","outputs":[{"internalType":"uint256","name":"P","type":"uint256"},{"internalType":"uint256","name":"E","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"s","type":"uint256"}],"name":"sell","outputs":[{"internalType":"uint256","name":"e","type":"uint256"}],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"contract ILiquid","name":"that","type":"address"},{"internalType":"uint256","name":"s","type":"uint256"}],"name":"sellFor","outputs":[{"internalType":"uint256","name":"e","type":"uint256"},{"internalType":"uint256","name":"thats","type":"uint256"}],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"s","type":"uint256"}],"name":"sells","outputs":[{"internalType":"uint256","name":"e","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"contract ILiquid","name":"that","type":"address"},{"internalType":"uint256","name":"s","type":"uint256"}],"name":"sellsFor","outputs":[{"internalType":"uint256","name":"e","type":"uint256"},{"internalType":"uint256","name":"thats","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"solid","outputs":[{"internalType":"contract IERC20Metadata","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"symbol","outputs":[{"internalType":"string","name":"","type":"string"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"totalSupply","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"to","type":"address"},{"internalType":"uint256","name":"value","type":"uint256"}],"name":"transfer","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"from","type":"address"},{"internalType":"address","name":"to","type":"address"},{"internalType":"uint256","name":"value","type":"uint256"}],"name":"transferFrom","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"from","type":"address"},{"internalType":"address","name":"to","type":"address"},{"internalType":"uint256","name":"amount","type":"uint256"}],"name":"update","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"contract IERC20Metadata","name":"backing","type":"address"}],"name":"zzz_","outputs":[],"stateMutability":"nonpayable","type":"function"}]

60a06040523461038b576121766020813803918261001c8161038f565b93849283398101031261038b57516001600160a01b0381169081900361038b57610046602061038f565b905f8252610054602061038f565b5f815282519091906001600160401b03811161029c57600354600181811c91168015610381575b602082101461027e57601f811161031e575b506020601f82116001146102bb57819293945f926102b0575b50508160011b915f199060031b1c1916176003555b81516001600160401b03811161029c57600454600181811c91168015610292575b602082101461027e57601f811161021b575b50602092601f82116001146101ba57928192935f926101af575b50508160011b915f199060031b1c1916176004555b30608052600580546001600160a01b031916919091179055604051611dc190816103b582396080518181816101ef015281816103de015281816106c3015281816108040152818161090001528181610a1801528181610b770152818161100f015281816115b401528181611662015281816116ed015281816117840152818161188b01528181611b470152611c780152f35b015190505f80610108565b601f1982169360045f52805f20915f5b86811061020357508360019596106101eb575b505050811b0160045561011d565b01515f1960f88460031b161c191690555f80806101dd565b919260206001819286850151815501940192016101ca565b60045f527f8a35acfbc15ff81a39ae7d344fd709f28e8600b4aa8c65c6b64bfe7fe36bd19b601f830160051c81019160208410610274575b601f0160051c01905b81811061026957506100ee565b5f815560010161025c565b9091508190610253565b634e487b7160e01b5f52602260045260245ffd5b90607f16906100dc565b634e487b7160e01b5f52604160045260245ffd5b015190505f806100a6565b601f1982169060035f52805f20915f5b818110610306575095836001959697106102ee575b505050811b016003556100bb565b01515f1960f88460031b161c191690555f80806102e0565b9192602060018192868b0151815501940192016102cb565b60035f527fc2575a0e9e593c00f959f8c92f12db2869c3395a3b0502d05e2516446f71f85b601f830160051c81019160208410610377575b601f0160051c01905b81811061036c575061008d565b5f815560010161035f565b9091508190610356565b90607f169061007b565b5f80fd5b6040519190601f01601f191682016001600160401b0381118382101761029c5760405256fe6080806040526004361015610012575f80fd5b5f905f3560e01c90816306fdde031461137257508063095ea7b3146112ca57806309e957da146112755780630c50bdc0146111c65780631060930d14610fe757806316f0115b14610fcc57806318160ddd14610fae57806323b872dd14610ee0578063313ce56714610e4d57806343d75d1c14610e335780634feeb47a14610d7d57806353a3f61614610d54578063561ae00014610d355780636490962314610ce557806370a0823114610cad578063746c1e1b14610c825780637f2438cb14610b05578063879e1ea2146109f357806389458266146108db5780638ce516da146108bb57806395d89b4114610833578063a4c52b86146107ee578063a9059cbb146107bc578063bb2d713e1461079d578063c33bb7c2146105c3578063d6106b3e14610588578063d96a094a14610539578063dd62ed3e146104d9578063e299b596146102ce578063e4849b32146101c6578063e4968e09146101a35763f9ad90d41461017e575f80fd5b346101a05761019d61018f3661141b565b90610198611b38565b611c76565b80f35b80fd5b50346101a057806003193601126101a05760206101be61184b565b604051908152f35b50346101a05760203660031901126101a0576004356101e361191a565b6101ec81611813565b907f00000000000000000000000000000000000000000000000000000000000000006001600160a01b0316803b156102ca578360405180926346728b6d60e11b8252818381610240893330600485016117f1565b03925af180156102bf576102a6575b509161028f60209360405181815284868201527fed7a144fad14804d5c249145e3e0e2b63a9eb455b76aee5bc92d711e9bba3e4a60403092a2303361194f565b5f516020611da15f395f51905f525d604051908152f35b6102b1848092611491565b6102bb575f61024f565b8280fd5b6040513d86823e3d90fd5b8380fd5b50346101a0576102dd3661141b565b6102e561191a565b6102ed611888565b6103206103266102fb611585565b61031a8561031461030e8986989661153a565b82611547565b9261153a565b9061155a565b8461153a565b600254909181610499575050805b6001600160ff1b038116810361048557906103519160011b611578565b916040517fc68a1b6c4ebee0e7e970302f669069fb4172fc8c92a7d3f8b75c50e12ae6615b309180610396878787846040919493926060820195825260208201520152565b0390a280610465575b50806103da575b506040916103b48233611a42565b6103be8230611a42565b5f516020611da15f395f51905f525d8151908082526020820152f35b82907f00000000000000000000000000000000000000000000000000000000000000006001600160a01b031690813b156102bb578291610432916040519485809481936346728b6d60e11b83523033600485016117f1565b03925af1801561045a57156103a65761044c838092611491565b610456575f6103a6565b5080fd5b6040513d85823e3d90fd5b60055461047f9190309033906001600160a01b0316611a07565b5f61039f565b634e487b7160e01b85526011600452602485fd5b6001600160ff1b03831683036104c557906104ba6104bf928460011b611547565b61155a565b90610334565b634e487b7160e01b86526011600452602486fd5b50346101a05760403660031901126101a0576104f3611405565b60243591906001600160a01b0383168303610456579060409160018060a01b031681526001602052209060018060a01b03165f52602052602060405f2054604051908152f35b50346101a05760203660031901126101a0576020906004359061055a61191a565b61028f61058161057b61056b611585565b61031a8761031483859695611547565b90611578565b9283611c76565b50346101a05760203660031901126101a05760206101be61057b6105aa611585565b61031a6105b982849594611547565b916004359061153a565b50346101a0578061060a6105d63661141b565b6105e194919461191a565b6105e9611888565b6105f1611585565b93906104ba6106036002549283611578565b9188611547565b8060011c9461078957856106219160011916611578565b92811515908180610780575b610759575b50604080518781526020810184905290810186905230907fdda51914352cac74e4a856e50cc686c0cf071a497df6303b165b052b938685ed90606090a26106c0575b5060055460409461069b9161069590869033906001600160a01b0316611a8c565b33611ac7565b6106a58230611ac7565b5f516020611da15f395f51905f525d82519182526020820152f35b937f00000000000000000000000000000000000000000000000000000000000000006001600160a01b0316803b15610755576040516346728b6d60e11b8152955f918791829084908290610719903330600485016117f1565b03925af194851561074a57604095610733575b5093610674565b6107409192505f90611491565b5f9061069b61072c565b6040513d5f823e3d90fd5b5f80fd5b9461077361077992966104ba61076d61184b565b86611547565b9061153a565b935f610632565b5080151561062d565b634e487b7160e01b83526011600452602483fd5b50346101a05760203660031901126101a05760206101be600435611813565b50346101a05760403660031901126101a0576107e36107d9611405565b60243590336118c9565b602060405160018152f35b50346101a057806003193601126101a0576040517f00000000000000000000000000000000000000000000000000000000000000006001600160a01b03168152602090f35b50346101a057806003193601126101a0576005546040516395d89b4160e01b8152908290829060049082906001600160a01b03165afa9081156108b05782610889939261088d575b5050604051918291826113db565b0390f35b6108a992503d8091833e6108a18183611491565b8101906114c7565b5f8061087b565b6040513d84823e3d90fd5b50346101a05761019d6108cd36611431565b916108d6611b38565b61194f565b50346101a05760203660031901126101a057604090600435906108fc61191a565b80307f00000000000000000000000000000000000000000000000000000000000000006001600160a01b031603610984576106a583855181815283602082015281878201527fdda51914352cac74e4a856e50cc686c0cf071a497df6303b165b052b938685ed60603092a26109718133611ac7565b60055433906001600160a01b0316611a8c565b8291506109936109ee9361177f565b6109e88195929594610695878951838152876020820152818b8201527fdda51914352cac74e4a856e50cc686c0cf071a497df6303b165b052b938685ed60603092a260055433906001600160a01b0316611a8c565b30611ac7565b6106a5565b50346101a05760203660031901126101a05760409060043590610a1461191a565b80307f00000000000000000000000000000000000000000000000000000000000000006001600160a01b031603610a85576106a583855181815283602082015281878201527fc68a1b6c4ebee0e7e970302f669069fb4172fc8c92a7d3f8b75c50e12ae6615b60603092a233611a42565b6109ee9150610a938361165d565b610aff819492610af9819789517fc68a1b6c4ebee0e7e970302f669069fb4172fc8c92a7d3f8b75c50e12ae6615b309180610ae1878a87846040919493926060820195825260208201520152565b0390a2600554309033906001600160a01b0316611a07565b33611a42565b30611a42565b50346101a057610b67610b173661146b565b9190610b2161191a565b610b2b8382611616565b9290936040518181528560208201527fed7a144fad14804d5c249145e3e0e2b63a9eb455b76aee5bc92d711e9bba3e4a60403092a2303361194f565b6001600160a01b039081169084907f000000000000000000000000000000000000000000000000000000000000000016803b15610456578160405180926346728b6d60e11b8252818381610bc08b8a30600485016117f1565b03925af180156108b057610c6d575b5050807f1cbc5ab135991bd2b6a4b034a04aa2aa086dac1371cb9b16b8b5e2ed6b036bed60408051858152866020820152a2803b156102ca578360405180926346728b6d60e11b8252818381610c2a883386600485016117f1565b03925af180156102bf57610c58575b506040925f516020611da15f395f51905f525d82519182526020820152f35b610c63848092611491565b6102bb575f610c39565b81610c7791611491565b6102ca57835f610bcf565b50346101a05760203660031901126101a0576040610ca160043561177f565b82519182526020820152f35b50346101a05760203660031901126101a0576020906040906001600160a01b03610cd5611405565b1681528083522054604051908152f35b50346101a05760203660031901126101a057600435906001600160a01b03821682036101a0576060610d16836116d1565b6040805193151584526001600160a01b03909216602084015290820152f35b50346101a05760203660031901126101a0576040610ca160043561165d565b50346101a057806003193601126101a0576005546040516001600160a01b039091168152602090f35b50346101a057610d8c3661141b565b610d97929192611888565b610dbb610da2611585565b91906104ba610db46002549283611578565b9187611547565b838160011c94610e1f5750604094610dd69160011916611578565b9180151580610e16575b610df3575b505082519182526020820152f35b610e0e9293916104ba61077392610e0861184b565b90611547565b905f80610de5565b50811515610de0565b634e487b7160e01b81526011600452602490fd5b50346101a0576040610ca1610e473661146b565b90611616565b50346101a057806003193601126101a05760055460405163313ce56760e01b815290602090829060049082906001600160a01b03165afa9081156108b0578291610ea0575b60208260ff60405191168152f35b90506020813d602011610ed8575b81610ebb60209383611491565b81010312610456575160ff8116810361045657602091505f610e92565b3d9150610eae565b50346101a057610eef36611431565b6001600160a01b038316808552600160209081526040808720335f9081529252902054919391905f198210610f2b575b50506107e393506118c9565b848210610f93578015610f7f573315610f6b57856040916107e3975260016020522060018060a01b0333165f526020528360405f20910390555f80610f1f565b634a1406b160e11b86526004869052602486fd5b63e602df0560e01b86526004869052602486fd5b6064868684637dc7a0d960e11b835233600452602452604452fd5b50346101a057806003193601126101a0576020600254604051908152f35b50346101a057806003193601126101a0576040610ca1611585565b5034610755576020366003190112610755576004356001600160a01b038116808203610755577f00000000000000000000000000000000000000000000000000000000000000006001600160a01b038116923084146110ce575050829160246020926040519485938492631060930d60e01b845260048401525af19081156108b0578291611088575b50602091505b6040516001600160a01b039091168152f35b90506020813d6020116110c6575b816110a360209383611491565b8101031261045657516001600160a01b038116810361045657602091505f611070565b3d9150611096565b9093506110dc9192506116d1565b6001600160a01b039091169291156110fa575b505060209150611076565b6e5af43d82803e903d91602b57fd5bf36040519483857fe4235073a03e412295f3711f92ad392ec325431faaf7f24811c15fe0a9a08c305f80a3763d602d80600a3d3981f3363d3d373d3d3d363d7300000062ffffff8260881c16175f526effffffffffffffffffffffffffffff199060781b161760205260018060a01b0390603760095ff516803b15610755576024845f819381956304f4abed60e11b845260048401525af191821561074a576020926111b6575b806110ef565b5f6111c091611491565b5f6111b0565b34610755576111ff6111d73661141b565b91906111e1611888565b61077361031a6111ef611585565b91909561031461030e868961153a565b9060025480155f1461124f575050805b6001600160ff1b038116810361123b5760409161122e9160011b611578565b8151908082526020820152f35b634e487b7160e01b5f52601160045260245ffd5b6001600160ff1b038316830361123b576104ba61126f928460011b611547565b9061120f565b34610755576020366003190112610755576004356001600160a01b03811690819003610755576005546001600160a01b0381166112bc576001600160a01b03191617600555005b6282b42960e81b5f5260045ffd5b34610755576040366003190112610755576112e3611405565b60243590331561135f576001600160a01b031690811561134c57335f52600160205260405f20825f526020528060405f20556040519081527f8c5be1e5ebec7d5bd14f71427d1e84f3dd0314c0f7b2291e5b200ac8c7c3b92560203392a3602060405160018152f35b634a1406b160e11b5f525f60045260245ffd5b63e602df0560e01b5f525f60045260245ffd5b34610755575f366003190112610755576005546306fdde0360e01b82525f90829060049082906001600160a01b03165afa801561074a57610889915f916113c1575b50604051918291826113db565b6113d591503d805f833e6108a18183611491565b826113b4565b602060409281835280519182918282860152018484015e5f828201840152601f01601f1916010190565b600435906001600160a01b038216820361075557565b6040906003190112610755576004359060243590565b6060906003190112610755576004356001600160a01b038116810361075557906024356001600160a01b0381168103610755579060443590565b6040906003190112610755576004356001600160a01b0381168103610755579060243590565b90601f8019910116810190811067ffffffffffffffff8211176114b357604052565b634e487b7160e01b5f52604160045260245ffd5b6020818303126107555780519067ffffffffffffffff8211610755570181601f820112156107555780519067ffffffffffffffff82116114b35760405192611519601f8401601f191660200185611491565b8284526020838301011161075557815f9260208093018386015e8301015290565b9190820180921161123b57565b8181029291811591840414171561123b57565b8115611564570490565b634e487b7160e01b5f52601260045260245ffd5b9190820391821161123b57565b305f525f60205260405f2054906040516370a0823160e01b815230600482015260208160248160018060a01b037f0000000000000000000000000000000000000000000000000000000000000000165afa90811561074a575f916115e7575090565b90506020813d60201161160e575b8161160260209383611491565b81010312610755575190565b3d91506115f5565b91906020611625602492611813565b604051636b08359f60e11b81526004810182905290949092839182906001600160a01b03165afa90811561074a575f916115e7575090565b5f90307f00000000000000000000000000000000000000000000000000000000000000006001600160a01b0316036116925791565b9050600254305f525f60205260405f20548260011b9260018060ff1b0381160361123b576116ce916104ba6116c79285611547565b8092611578565b91565b6001600160a01b03168015611770576040516001600160a01b037f00000000000000000000000000000000000000000000000000000000000000008116603883018190526f5af43d82803e903d91602b57fd5bf3ff60248401526014830152733d602d80600a3d3981f3363d3d373d3d3d363d738252605882018390526037600c8301206078830152605560439092019190912016803b151592909190565b63f9820cc160e01b5f5260045ffd5b5f90307f00000000000000000000000000000000000000000000000000000000000000006001600160a01b0316036117b45791565b9190506117ee6117df600254305f525f6020526104ba6117d860405f205483611578565b9186611547565b928360011c9360011916611578565b90565b6001600160a01b03918216815291166020820152604081019190915260600190565b61181b611585565b90916118308261182b8582611547565b61153a565b5f19810190811161123b5761031a61057b926117ee9561153a565b6005546040516370a0823160e01b815230600482015290602090829060249082906001600160a01b03165afa90811561074a575f916115e7575090565b307f00000000000000000000000000000000000000000000000000000000000000006001600160a01b0316146118ba57565b63f1089e8560e01b5f5260045ffd5b91906001600160a01b03831615611907576001600160a01b038116156118f4576118f29261194f565b565b63ec442f0560e01b5f525f60045260245ffd5b634b637e8f60e11b5f525f60045260245ffd5b5f516020611da15f395f51905f525c6119405760015f516020611da15f395f51905f525d565b633ee5aeb560e01b5f5260045ffd5b6001600160a01b031690816119b55760205f516020611d815f395f51905f529161197b8560025461153a565b6002555b6001600160a01b031693846119a05780600254036002555b604051908152a3565b845f525f825260405f20818154019055611997565b815f525f60205260405f20548381106119ec575f516020611d815f395f51905f529184602092855f525f84520360405f205561197f565b91905063391434e360e21b5f5260045260245260445260645ffd5b90611a3d90611a2f6118f2956040519586936323b872dd60e01b6020860152602485016117f1565b03601f198101845283611491565b611d28565b6001600160a01b03169081156118f4575f516020611d815f395f51905f52602082611a705f9460025461153a565b60025584845283825260408420818154019055604051908152a3565b60405163a9059cbb60e01b60208201526001600160a01b0390921660248301526044808301939093529181526118f291611a3d606483611491565b9091906001600160a01b0316801561190757805f525f60205260405f2054838110611b1e576020845f94955f516020611d815f395f51905f52938587528684520360408620558060025403600255604051908152a3565b915063391434e360e21b5f5260045260245260445260645ffd5b6040516329d1fb0b60e11b81527f00000000000000000000000000000000000000000000000000000000000000006001600160a01b0316602082600481335afa91821561074a575f92611c32575b50604051636490962360e01b81526001600160a01b039092166004830152606082602481845afa91821561074a575f92611be1575b503314159081611bcd575b506112bc57565b6001600160a01b031633141590505f611bc6565b9091506060813d606011611c2a575b81611bfd60609383611491565b810103126107555780518015150361075557602001516001600160a01b038116810361075557905f611bbb565b3d9150611bf0565b9091506020813d602011611c6e575b81611c4e60209383611491565b8101031261075557516001600160a01b038116810361075557905f611b86565b3d9150611c41565b7f00000000000000000000000000000000000000000000000000000000000000006001600160a01b031691823b15610755575f60405180946346728b6d60e11b8252818381611cca873033600485016117f1565b03925af192831561074a576118f293611d18575b506040519082825260208201527f1cbc5ab135991bd2b6a4b034a04aa2aa086dac1371cb9b16b8b5e2ed6b036bed60403092a2333061194f565b5f611d2291611491565b5f611cde565b905f602091828151910182855af11561074a575f513d611d7757506001600160a01b0381163b155b611d575750565b635274afe760e01b5f9081526001600160a01b0391909116600452602490fd5b60011415611d5056feddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef9b779b17422d0df92223018b32b4d1fa46e071723d6817e2486d003becc55f000000000000000000000000007d5b1349157335aeeb929080a51003b529758830

0x6080806040526004361015610012575f80fd5b5f905f3560e01c90816306fdde031461137257508063095ea7b3146112ca57806309e957da146112755780630c50bdc0146111c65780631060930d14610fe757806316f0115b14610fcc57806318160ddd14610fae57806323b872dd14610ee0578063313ce56714610e4d57806343d75d1c14610e335780634feeb47a14610d7d57806353a3f61614610d54578063561ae00014610d355780636490962314610ce557806370a0823114610cad578063746c1e1b14610c825780637f2438cb14610b05578063879e1ea2146109f357806389458266146108db5780638ce516da146108bb57806395d89b4114610833578063a4c52b86146107ee578063a9059cbb146107bc578063bb2d713e1461079d578063c33bb7c2146105c3578063d6106b3e14610588578063d96a094a14610539578063dd62ed3e146104d9578063e299b596146102ce578063e4849b32146101c6578063e4968e09146101a35763f9ad90d41461017e575f80fd5b346101a05761019d61018f3661141b565b90610198611b38565b611c76565b80f35b80fd5b50346101a057806003193601126101a05760206101be61184b565b604051908152f35b50346101a05760203660031901126101a0576004356101e361191a565b6101ec81611813565b907f000000000000000000000000429a58602817fa79bbdcf56d8986fa66cfc44f8a6001600160a01b0316803b156102ca578360405180926346728b6d60e11b8252818381610240893330600485016117f1565b03925af180156102bf576102a6575b509161028f60209360405181815284868201527fed7a144fad14804d5c249145e3e0e2b63a9eb455b76aee5bc92d711e9bba3e4a60403092a2303361194f565b5f516020611da15f395f51905f525d604051908152f35b6102b1848092611491565b6102bb575f61024f565b8280fd5b6040513d86823e3d90fd5b8380fd5b50346101a0576102dd3661141b565b6102e561191a565b6102ed611888565b6103206103266102fb611585565b61031a8561031461030e8986989661153a565b82611547565b9261153a565b9061155a565b8461153a565b600254909181610499575050805b6001600160ff1b038116810361048557906103519160011b611578565b916040517fc68a1b6c4ebee0e7e970302f669069fb4172fc8c92a7d3f8b75c50e12ae6615b309180610396878787846040919493926060820195825260208201520152565b0390a280610465575b50806103da575b506040916103b48233611a42565b6103be8230611a42565b5f516020611da15f395f51905f525d8151908082526020820152f35b82907f000000000000000000000000429a58602817fa79bbdcf56d8986fa66cfc44f8a6001600160a01b031690813b156102bb578291610432916040519485809481936346728b6d60e11b83523033600485016117f1565b03925af1801561045a57156103a65761044c838092611491565b610456575f6103a6565b5080fd5b6040513d85823e3d90fd5b60055461047f9190309033906001600160a01b0316611a07565b5f61039f565b634e487b7160e01b85526011600452602485fd5b6001600160ff1b03831683036104c557906104ba6104bf928460011b611547565b61155a565b90610334565b634e487b7160e01b86526011600452602486fd5b50346101a05760403660031901126101a0576104f3611405565b60243591906001600160a01b0383168303610456579060409160018060a01b031681526001602052209060018060a01b03165f52602052602060405f2054604051908152f35b50346101a05760203660031901126101a0576020906004359061055a61191a565b61028f61058161057b61056b611585565b61031a8761031483859695611547565b90611578565b9283611c76565b50346101a05760203660031901126101a05760206101be61057b6105aa611585565b61031a6105b982849594611547565b916004359061153a565b50346101a0578061060a6105d63661141b565b6105e194919461191a565b6105e9611888565b6105f1611585565b93906104ba6106036002549283611578565b9188611547565b8060011c9461078957856106219160011916611578565b92811515908180610780575b610759575b50604080518781526020810184905290810186905230907fdda51914352cac74e4a856e50cc686c0cf071a497df6303b165b052b938685ed90606090a26106c0575b5060055460409461069b9161069590869033906001600160a01b0316611a8c565b33611ac7565b6106a58230611ac7565b5f516020611da15f395f51905f525d82519182526020820152f35b937f000000000000000000000000429a58602817fa79bbdcf56d8986fa66cfc44f8a6001600160a01b0316803b15610755576040516346728b6d60e11b8152955f918791829084908290610719903330600485016117f1565b03925af194851561074a57604095610733575b5093610674565b6107409192505f90611491565b5f9061069b61072c565b6040513d5f823e3d90fd5b5f80fd5b9461077361077992966104ba61076d61184b565b86611547565b9061153a565b935f610632565b5080151561062d565b634e487b7160e01b83526011600452602483fd5b50346101a05760203660031901126101a05760206101be600435611813565b50346101a05760403660031901126101a0576107e36107d9611405565b60243590336118c9565b602060405160018152f35b50346101a057806003193601126101a0576040517f000000000000000000000000429a58602817fa79bbdcf56d8986fa66cfc44f8a6001600160a01b03168152602090f35b50346101a057806003193601126101a0576005546040516395d89b4160e01b8152908290829060049082906001600160a01b03165afa9081156108b05782610889939261088d575b5050604051918291826113db565b0390f35b6108a992503d8091833e6108a18183611491565b8101906114c7565b5f8061087b565b6040513d84823e3d90fd5b50346101a05761019d6108cd36611431565b916108d6611b38565b61194f565b50346101a05760203660031901126101a057604090600435906108fc61191a565b80307f000000000000000000000000429a58602817fa79bbdcf56d8986fa66cfc44f8a6001600160a01b031603610984576106a583855181815283602082015281878201527fdda51914352cac74e4a856e50cc686c0cf071a497df6303b165b052b938685ed60603092a26109718133611ac7565b60055433906001600160a01b0316611a8c565b8291506109936109ee9361177f565b6109e88195929594610695878951838152876020820152818b8201527fdda51914352cac74e4a856e50cc686c0cf071a497df6303b165b052b938685ed60603092a260055433906001600160a01b0316611a8c565b30611ac7565b6106a5565b50346101a05760203660031901126101a05760409060043590610a1461191a565b80307f000000000000000000000000429a58602817fa79bbdcf56d8986fa66cfc44f8a6001600160a01b031603610a85576106a583855181815283602082015281878201527fc68a1b6c4ebee0e7e970302f669069fb4172fc8c92a7d3f8b75c50e12ae6615b60603092a233611a42565b6109ee9150610a938361165d565b610aff819492610af9819789517fc68a1b6c4ebee0e7e970302f669069fb4172fc8c92a7d3f8b75c50e12ae6615b309180610ae1878a87846040919493926060820195825260208201520152565b0390a2600554309033906001600160a01b0316611a07565b33611a42565b30611a42565b50346101a057610b67610b173661146b565b9190610b2161191a565b610b2b8382611616565b9290936040518181528560208201527fed7a144fad14804d5c249145e3e0e2b63a9eb455b76aee5bc92d711e9bba3e4a60403092a2303361194f565b6001600160a01b039081169084907f000000000000000000000000429a58602817fa79bbdcf56d8986fa66cfc44f8a16803b15610456578160405180926346728b6d60e11b8252818381610bc08b8a30600485016117f1565b03925af180156108b057610c6d575b5050807f1cbc5ab135991bd2b6a4b034a04aa2aa086dac1371cb9b16b8b5e2ed6b036bed60408051858152866020820152a2803b156102ca578360405180926346728b6d60e11b8252818381610c2a883386600485016117f1565b03925af180156102bf57610c58575b506040925f516020611da15f395f51905f525d82519182526020820152f35b610c63848092611491565b6102bb575f610c39565b81610c7791611491565b6102ca57835f610bcf565b50346101a05760203660031901126101a0576040610ca160043561177f565b82519182526020820152f35b50346101a05760203660031901126101a0576020906040906001600160a01b03610cd5611405565b1681528083522054604051908152f35b50346101a05760203660031901126101a057600435906001600160a01b03821682036101a0576060610d16836116d1565b6040805193151584526001600160a01b03909216602084015290820152f35b50346101a05760203660031901126101a0576040610ca160043561165d565b50346101a057806003193601126101a0576005546040516001600160a01b039091168152602090f35b50346101a057610d8c3661141b565b610d97929192611888565b610dbb610da2611585565b91906104ba610db46002549283611578565b9187611547565b838160011c94610e1f5750604094610dd69160011916611578565b9180151580610e16575b610df3575b505082519182526020820152f35b610e0e9293916104ba61077392610e0861184b565b90611547565b905f80610de5565b50811515610de0565b634e487b7160e01b81526011600452602490fd5b50346101a0576040610ca1610e473661146b565b90611616565b50346101a057806003193601126101a05760055460405163313ce56760e01b815290602090829060049082906001600160a01b03165afa9081156108b0578291610ea0575b60208260ff60405191168152f35b90506020813d602011610ed8575b81610ebb60209383611491565b81010312610456575160ff8116810361045657602091505f610e92565b3d9150610eae565b50346101a057610eef36611431565b6001600160a01b038316808552600160209081526040808720335f9081529252902054919391905f198210610f2b575b50506107e393506118c9565b848210610f93578015610f7f573315610f6b57856040916107e3975260016020522060018060a01b0333165f526020528360405f20910390555f80610f1f565b634a1406b160e11b86526004869052602486fd5b63e602df0560e01b86526004869052602486fd5b6064868684637dc7a0d960e11b835233600452602452604452fd5b50346101a057806003193601126101a0576020600254604051908152f35b50346101a057806003193601126101a0576040610ca1611585565b5034610755576020366003190112610755576004356001600160a01b038116808203610755577f000000000000000000000000429a58602817fa79bbdcf56d8986fa66cfc44f8a6001600160a01b038116923084146110ce575050829160246020926040519485938492631060930d60e01b845260048401525af19081156108b0578291611088575b50602091505b6040516001600160a01b039091168152f35b90506020813d6020116110c6575b816110a360209383611491565b8101031261045657516001600160a01b038116810361045657602091505f611070565b3d9150611096565b9093506110dc9192506116d1565b6001600160a01b039091169291156110fa575b505060209150611076565b6e5af43d82803e903d91602b57fd5bf36040519483857fe4235073a03e412295f3711f92ad392ec325431faaf7f24811c15fe0a9a08c305f80a3763d602d80600a3d3981f3363d3d373d3d3d363d7300000062ffffff8260881c16175f526effffffffffffffffffffffffffffff199060781b161760205260018060a01b0390603760095ff516803b15610755576024845f819381956304f4abed60e11b845260048401525af191821561074a576020926111b6575b806110ef565b5f6111c091611491565b5f6111b0565b34610755576111ff6111d73661141b565b91906111e1611888565b61077361031a6111ef611585565b91909561031461030e868961153a565b9060025480155f1461124f575050805b6001600160ff1b038116810361123b5760409161122e9160011b611578565b8151908082526020820152f35b634e487b7160e01b5f52601160045260245ffd5b6001600160ff1b038316830361123b576104ba61126f928460011b611547565b9061120f565b34610755576020366003190112610755576004356001600160a01b03811690819003610755576005546001600160a01b0381166112bc576001600160a01b03191617600555005b6282b42960e81b5f5260045ffd5b34610755576040366003190112610755576112e3611405565b60243590331561135f576001600160a01b031690811561134c57335f52600160205260405f20825f526020528060405f20556040519081527f8c5be1e5ebec7d5bd14f71427d1e84f3dd0314c0f7b2291e5b200ac8c7c3b92560203392a3602060405160018152f35b634a1406b160e11b5f525f60045260245ffd5b63e602df0560e01b5f525f60045260245ffd5b34610755575f366003190112610755576005546306fdde0360e01b82525f90829060049082906001600160a01b03165afa801561074a57610889915f916113c1575b50604051918291826113db565b6113d591503d805f833e6108a18183611491565b826113b4565b602060409281835280519182918282860152018484015e5f828201840152601f01601f1916010190565b600435906001600160a01b038216820361075557565b6040906003190112610755576004359060243590565b6060906003190112610755576004356001600160a01b038116810361075557906024356001600160a01b0381168103610755579060443590565b6040906003190112610755576004356001600160a01b0381168103610755579060243590565b90601f8019910116810190811067ffffffffffffffff8211176114b357604052565b634e487b7160e01b5f52604160045260245ffd5b6020818303126107555780519067ffffffffffffffff8211610755570181601f820112156107555780519067ffffffffffffffff82116114b35760405192611519601f8401601f191660200185611491565b8284526020838301011161075557815f9260208093018386015e8301015290565b9190820180921161123b57565b8181029291811591840414171561123b57565b8115611564570490565b634e487b7160e01b5f52601260045260245ffd5b9190820391821161123b57565b305f525f60205260405f2054906040516370a0823160e01b815230600482015260208160248160018060a01b037f000000000000000000000000429a58602817fa79bbdcf56d8986fa66cfc44f8a165afa90811561074a575f916115e7575090565b90506020813d60201161160e575b8161160260209383611491565b81010312610755575190565b3d91506115f5565b91906020611625602492611813565b604051636b08359f60e11b81526004810182905290949092839182906001600160a01b03165afa90811561074a575f916115e7575090565b5f90307f000000000000000000000000429a58602817fa79bbdcf56d8986fa66cfc44f8a6001600160a01b0316036116925791565b9050600254305f525f60205260405f20548260011b9260018060ff1b0381160361123b576116ce916104ba6116c79285611547565b8092611578565b91565b6001600160a01b03168015611770576040516001600160a01b037f000000000000000000000000429a58602817fa79bbdcf56d8986fa66cfc44f8a8116603883018190526f5af43d82803e903d91602b57fd5bf3ff60248401526014830152733d602d80600a3d3981f3363d3d373d3d3d363d738252605882018390526037600c8301206078830152605560439092019190912016803b151592909190565b63f9820cc160e01b5f5260045ffd5b5f90307f000000000000000000000000429a58602817fa79bbdcf56d8986fa66cfc44f8a6001600160a01b0316036117b45791565b9190506117ee6117df600254305f525f6020526104ba6117d860405f205483611578565b9186611547565b928360011c9360011916611578565b90565b6001600160a01b03918216815291166020820152604081019190915260600190565b61181b611585565b90916118308261182b8582611547565b61153a565b5f19810190811161123b5761031a61057b926117ee9561153a565b6005546040516370a0823160e01b815230600482015290602090829060249082906001600160a01b03165afa90811561074a575f916115e7575090565b307f000000000000000000000000429a58602817fa79bbdcf56d8986fa66cfc44f8a6001600160a01b0316146118ba57565b63f1089e8560e01b5f5260045ffd5b91906001600160a01b03831615611907576001600160a01b038116156118f4576118f29261194f565b565b63ec442f0560e01b5f525f60045260245ffd5b634b637e8f60e11b5f525f60045260245ffd5b5f516020611da15f395f51905f525c6119405760015f516020611da15f395f51905f525d565b633ee5aeb560e01b5f5260045ffd5b6001600160a01b031690816119b55760205f516020611d815f395f51905f529161197b8560025461153a565b6002555b6001600160a01b031693846119a05780600254036002555b604051908152a3565b845f525f825260405f20818154019055611997565b815f525f60205260405f20548381106119ec575f516020611d815f395f51905f529184602092855f525f84520360405f205561197f565b91905063391434e360e21b5f5260045260245260445260645ffd5b90611a3d90611a2f6118f2956040519586936323b872dd60e01b6020860152602485016117f1565b03601f198101845283611491565b611d28565b6001600160a01b03169081156118f4575f516020611d815f395f51905f52602082611a705f9460025461153a565b60025584845283825260408420818154019055604051908152a3565b60405163a9059cbb60e01b60208201526001600160a01b0390921660248301526044808301939093529181526118f291611a3d606483611491565b9091906001600160a01b0316801561190757805f525f60205260405f2054838110611b1e576020845f94955f516020611d815f395f51905f52938587528684520360408620558060025403600255604051908152a3565b915063391434e360e21b5f5260045260245260445260645ffd5b6040516329d1fb0b60e11b81527f000000000000000000000000429a58602817fa79bbdcf56d8986fa66cfc44f8a6001600160a01b0316602082600481335afa91821561074a575f92611c32575b50604051636490962360e01b81526001600160a01b039092166004830152606082602481845afa91821561074a575f92611be1575b503314159081611bcd575b506112bc57565b6001600160a01b031633141590505f611bc6565b9091506060813d606011611c2a575b81611bfd60609383611491565b810103126107555780518015150361075557602001516001600160a01b038116810361075557905f611bbb565b3d9150611bf0565b9091506020813d602011611c6e575b81611c4e60209383611491565b8101031261075557516001600160a01b038116810361075557905f611b86565b3d9150611c41565b7f000000000000000000000000429a58602817fa79bbdcf56d8986fa66cfc44f8a6001600160a01b031691823b15610755575f60405180946346728b6d60e11b8252818381611cca873033600485016117f1565b03925af192831561074a576118f293611d18575b506040519082825260208201527f1cbc5ab135991bd2b6a4b034a04aa2aa086dac1371cb9b16b8b5e2ed6b036bed60403092a2333061194f565b5f611d2291611491565b5f611cde565b905f602091828151910182855af11561074a575f513d611d7757506001600160a01b0381163b155b611d575750565b635274afe760e01b5f9081526001600160a01b0391909116600452602490fd5b60011415611d5056feddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef9b779b17422d0df92223018b32b4d1fa46e071723d6817e2486d003becc55f00

0000000000000000000000007d5b1349157335aeeb929080a51003b529758830

-----Decoded View---------------
Arg [0] : hub (address): 0x7D5B1349157335aEEB929080a51003B529758830

-----Encoded View---------------
1 Constructor Arguments found :
Arg [0] : 0000000000000000000000007d5b1349157335aeeb929080a51003b529758830