Contract Source Code (Solidity Standard Json-Input format)

IDE

• Blockscan IDE
• 🤖 Code ReaderBeta
• Remix IDE

More Options

• Similar
• Sol2Uml
• Submit Audit
• Compare

// SPDX-License-Identifier: MIT
// Author: A.P
// Organization: Xypher Council
// Development: RareTech | Kibernacia | OCD
// Product: XYPHER
// Version: 1.0.0
// Link: https://linktr.ee/xyphercouncil
pragma solidity >=0.8.23 <0.9.0;

// OpenZeppelin
import {Math} from "@openzeppelin/contracts/utils/math/Math.sol";
import {Ownable} from "@openzeppelin/contracts/access/Ownable.sol";
import {ERC20} from "@openzeppelin/contracts/token/ERC20/ERC20.sol";
import {EIP712} from "@openzeppelin/contracts/utils/cryptography/EIP712.sol";
import {EnumerableSet} from "@openzeppelin/contracts/utils/structs/EnumerableSet.sol";
import {ERC20Votes} from "@openzeppelin/contracts/token/ERC20/extensions/ERC20Votes.sol";

// Uniswap V2
import {IUniswapV2Factory} from "@uniswap/v2-core/contracts/interfaces/IUniswapV2Factory.sol";
import {IUniswapV2Router02} from "@uniswap/v2-periphery/contracts/interfaces/IUniswapV2Router02.sol";

// Xypher Council
import {XypherCouncilPool} from "./XypherCouncilPool.sol";
import {IXypherCouncilGift} from "./IXypherCouncilGift.sol";

/**
 * @title XypherCouncil
 * @dev This contract defines the core ERC20 functionality of the XYPHER token,
 * with additional custom logic for trading protections, taxes, and integrations
 * with Uniswap for decentralized exchange functionality.
 * Inherits functionality from ERC20, EIP712, ERC20Votes, Ownable, and XypherCouncilPool.
 */
contract XypherCouncil is
    ERC20,
    EIP712,
    ERC20Votes,
    Ownable,
    XypherCouncilPool
{
    // Libraries
    using Math for uint256;
    using EnumerableSet for EnumerableSet.AddressSet;

    /// @notice The token name.
    /// @dev Stored as a constant string.
    string private constant _NAME = "Xypher Council";

    /// @notice The token symbol.
    /// @dev Stored as a constant string.
    string private constant _SYMBOL = "XYPHER";

    /// @notice The token version.
    /// @dev Stored as a constant string.
    string private constant _VERSION = "XC";

    /// @notice Defines the maximum wallet holding factor.
    /// @dev This factor limits the maximum token balance per wallet.
    uint32 private _maxWalletFactor = 100;

    /// @notice Defines the maximum transaction size factor.
    /// @dev This factor limits the size of individual transactions.
    uint32 private _maxTransactionFactor = 100;

    /// @notice Fixed tax percentage for transactions.
    /// @dev Used as a base value to calculate taxes on transfers.
    uint32 private constant _taxFactor = 100;

    /// @notice Buy tax percentage.
    /// @dev Tax applied on token purchases, set to 5%.
    uint32 public constant buyTax = 5; // 5% default tax

    /// @notice Sell tax percentage.
    /// @dev Tax applied on token sales, set to 5%.
    uint32 public constant sellTax = 5; // 5% default tax

    /// @notice DAO fee percentage deducted from the total tax.
    /// @dev 60% of tax is allocated to the DAO.
    uint32 public constant daoFee = 60; // 60% default dao fee

    /// @notice Addresses excluded from transaction fees.
    /// @dev Mapping of address to exclusion status.
    mapping(address => bool) public isExcluded;

    /// @notice Addresses excluded from reflection rewards.
    /// @dev Mapping of address to exclusion status for reflection rewards.
    mapping(address => bool) public isExcludedFromReflection;

    /// @notice Addresses excluded from reflection rewards.
    /// @dev Set of addresses excluded from reflection reward.
    EnumerableSet.AddressSet private _excludedFromReflection;

    /// @notice The interface for the Xypher Council gift receiver.
    /// @dev This is used to transfer a portion of tax to the gift receiver.
    IXypherCouncilGift public gift;

    /**
     * @notice Initializes the XYPHER token, sets up liquidity pools, and configures tax-exempt addresses.
     * @param initialSupply The initial total token supply.
     * @param initialInterface Address of the gift contract that will receive a portion of taxed tokens.
     */
    constructor(
        uint256 initialSupply,
        address initialInterface
    ) ERC20(_NAME, _SYMBOL) EIP712(_SYMBOL, _VERSION) Ownable(_msgSender()) {
        // Create token supply
        _mint(_msgSender(), initialSupply);

        // Setup uniswap v2 router
        uniswapV2Router = IUniswapV2Router02(
            0x7a250d5630B4cF539739dF2C5dAcb4c659F2488D
        );

        // Set uniswap v2 factory
        IUniswapV2Factory uniswapV2Factory = IUniswapV2Factory(
            uniswapV2Router.factory()
        );

        // Create uniswap v2 pair
        uniswapV2Pair = uniswapV2Factory.createPair(
            address(this),
            uniswapV2Router.WETH()
        );

        // Setup xypher council gift interface
        gift = IXypherCouncilGift(initialInterface);

        // Exclude from fees by default
        isExcluded[_msgSender()] = true;
        isExcluded[address(this)] = true;
        isExcluded[address(uniswapV2Router)] = true;

        // Exclude from reflections by default
        isExcludedFromReflection[_msgSender()] = true;
        isExcludedFromReflection[address(this)] = true;
        isExcludedFromReflection[address(uniswapV2Router)] = true;
        isExcludedFromReflection[uniswapV2Pair] = true;

        _excludedFromReflection.add(_msgSender());
        _excludedFromReflection.add(address(this));
        _excludedFromReflection.add(address(uniswapV2Router));
        _excludedFromReflection.add(uniswapV2Pair);
    }

    // Modifiers
    /**
     * @dev Validates the transfer conditions including wallet and transaction size limits.
     * @param from Sender address.
     * @param to Recipient address.
     * @param value The amount of tokens being transferred.
     */
    modifier validateTransfer(
        address from,
        address to,
        uint256 value
    ) {
        // Validation
        if (from == address(0)) {
            revert TransferFromZeroAddress();
        }

        if (to == address(0)) {
            revert TransferToZeroAddress();
        }

        if (!isExcluded[from] && !isExcluded[to]) {
            if (_isUniswapPair(from) || _isUniswapPair(to)) {
                // Max transaction size validation
                if (value > maxTransactionSize()) {
                    revert MaxTransactionSizeExceeded();
                }
            }
        }

        if (!isExcluded[to] && !_isUniswapPair(to)) {
            // Max wallet size validation
            if ((super.balanceOf(to) + value) > maxWalletSize()) {
                revert MaxWalletSizeExceeded();
            }
        }

        _;
    }

    /**
     * @notice Retrieves the balance of an account, applying the reflection rate if applicable.
     * @param account Address whose balance is queried.
     * @return uint256 Balance after applying reflection (if applicable).
     */
    function balanceOf(address account) public view override returns (uint256) {
        if (isExcludedFromReflection[account]) {
            return super.balanceOf(account);
        } else {
            return applyRate(super.balanceOf(account));
        }
    }

    /**
     * @notice Retrieves the total balance of token holders who are not excluded from reflection.
     * @return uint256 Total balance of non-excluded token holders from reflection.
     */
    function balanceOfHolders() public view returns (uint256) {
        // Parameters
        uint256 excludedBalance = 0;
        uint256 length = _excludedFromReflection.length();

        for (uint256 i = 0; i < length; i++) {
            address account = _excludedFromReflection.at(i);
            excludedBalance += super.balanceOf(account);
        }

        return totalSupply() - excludedBalance;
    }

    /**
     * @dev Overrides the ERC20 transfer function to apply trading protections and taxes.
     * @param to The address to which tokens are transferred.
     * @param value The amount of tokens to be transferred.
     * @return bool Indicates whether the operation succeeded.
     */
    function transfer(
        address to,
        uint256 value
    ) public override validateTransfer(_msgSender(), to, value) returns (bool) {
        // Parameters
        bool deductTax = false;
        uint256 prevBalance = balanceOf(_msgSender());
        uint256 newValue = _adjustBalance(_msgSender(), to, value);

        if (_isUniswapPair(_msgSender())) {
            if (!isExcluded[_msgSender()] && !isExcluded[to]) {
                deductTax = true;
            }
        }

        if (deductTax) {
            uint256 amountAfterTax = _applyTax(
                _msgSender(),
                newValue,
                prevBalance
            );

            return super.transfer(to, amountAfterTax);
        }

        return super.transfer(to, newValue);
    }

    /**
     * @dev Overrides the ERC20 transferFrom function to apply trading protections and taxes.
     * @param from The address from which tokens are transferred.
     * @param to The address to which tokens are transferred.
     * @param value The amount of tokens to be transferred.
     * @return bool Indicates whether the operation succeeded.
     */
    function transferFrom(
        address from,
        address to,
        uint256 value
    ) public override validateTransfer(from, to, value) returns (bool) {
        // Parameters
        bool deductTax = false;
        uint256 prevBalance = balanceOf(from);
        uint256 newValue = _adjustBalance(from, to, value);

        if (_isUniswapPair(from) || _isUniswapPair(to)) {
            if (!isExcluded[from] && !isExcluded[to]) {
                deductTax = true;
            }
        }

        if (deductTax) {
            uint256 amountAfterTax = _applyTax(from, newValue, prevBalance);

            return super.transferFrom(from, to, amountAfterTax);
        }

        return super.transferFrom(from, to, newValue);
    }

    /**
     * @dev Overrides the `_update` function, using the ERC20Votes implementation.
     * @param from Address sending the tokens.
     * @param to Address receiving the tokens.
     * @param value Amount of tokens transferred.
     */
    function _update(
        address from,
        address to,
        uint256 value
    ) internal override(ERC20, ERC20Votes) {
        ERC20Votes._update(from, to, value);
    }

    /**
     * @dev Adjusts the balance of tokens by applying the reflection rate if the sender is not excluded from reflections.
     * @param from The address from which tokens are transferred.
     * @param to The address to which tokens are transferred.
     * @param value The amount of tokens to be transferred.
     * @return uint256 The adjusted token amount after applying the reflection rate if applicable.
     */
    function _adjustBalance(
        address from,
        address to,
        uint256 value
    ) private returns (uint256) {
        if (isExcludedFromReflection[from]) {
            return value;
        }

        // Parameters
        (uint256 amountBalance, uint256 amountReflection) = applyReverseRate(
            value
        );

        if (super.balanceOf(from) < amountBalance) {
            return value;
        }

        if (_isUniswapPair(to)) {
            // Update
            _update(owner(), from, amountReflection);

            return value;
        }

        return amountBalance;
    }

    /**
     * @notice Applies tax to the transfer amount and returns the remaining balance after tax deduction.
     * @param from The address from which tokens are transferred.
     * @param value The amount of tokens to be transferred.
     * @param prevBalance The balance of address from before adjustment.
     * @return uint256 The amount remaining after tax deduction.
     */
    function _applyTax(
        address from,
        uint256 value,
        uint256 prevBalance
    ) private returns (uint256) {
        // Parameters
        uint32 tax = 0;
        bool isSell = false;

        if (_isUniswapPair(from)) {
            tax = buyTax;
        } else {
            tax = sellTax;
            isSell = true;
        }

        // Taxation
        (uint256 amountAfterTax, uint256 taxedAmount) = calculateTax(
            value,
            tax
        );

        // Collect tax
        if (taxedAmount > 0) {
            // Parameters
            uint256 balance = super.balanceOf(from);

            // Distribution
            (uint256 amountReflection, uint256 amountGift) = calculateTax(
                taxedAmount,
                daoFee
            );

            // Update
            _update(from, address(this), amountGift);
            _update(from, owner(), amountReflection);

            if (isSell) {
                // Validation
                if (prevBalance > value && balance > value) {
                    // Apply Pool Rebalancing
                    uint256 deduction = calculateBalanceDeduction(
                        prevBalance - value,
                        balance - value,
                        value
                    );

                    if (deduction > 0 && (balance - value) > deduction) {
                        // Update with Pool Rebalancing
                        _update(from, owner(), deduction);
                    }
                }

                // Swap
                _swapTokensForEth(balanceOf(address(this)));

                // Distribute
                _transferTax();
            } else {
                // Apply Pool Rebalancing
                (, uint256 reserveR) = applyReverseRate(amountAfterTax);

                // Update with Pool Rebalancing
                amountAfterTax = amountAfterTax - reserveR;
                _update(from, owner(), reserveR);
            }

            // Emit Taxed event
            emit Taxed(from, taxedAmount);
        }

        return amountAfterTax;
    }

    /**
     * @dev Checks if the given address is either the Uniswap V2 Router or the Uniswap V2 Pair.
     * @param sender The address to be checked.
     * @return bool Whether the address is associated with Uniswap.
     */
    function _isUniswap(address sender) private view returns (bool) {
        return sender == address(uniswapV2Router) || sender == uniswapV2Pair;
    }

    /**
     * @dev Checks if the given address is Uniswap V2 Pair.
     * @param sender The address to be checked.
     * @return bool Whether the address is associated with Uniswap.
     */
    function _isUniswapPair(address sender) private view returns (bool) {
        return sender == uniswapV2Pair;
    }

    /**
     * @notice Returns the max wallet size per address.
     * @dev Returns a number calculated based on supply divided by the factor.
     * @return uint256 The maximum amount of tokens a wallet can hold.
     */
    function maxWalletSize() public view returns (uint256) {
        return totalSupply() / _maxWalletFactor;
    }

    /**
     * @notice Returns the max transaction size per transfer.
     * @dev Returns a number calculated based on supply divided by the factor.
     * @return uint256 The maximum amount of tokens allowed per transaction.
     */
    function maxTransactionSize() public view returns (uint256) {
        return totalSupply() / _maxTransactionFactor;
    }

    /**
     * @notice Returns the total reflection supply.
     * @dev Returns a number.
     * @return uint256 The reflection supply.
     */
    function totalReflectionSupply() public view returns (uint256) {
        return balanceOf(owner());
    }

    /**
     * @notice Applies the reflection rate to the given amount.
     * @dev Adjusts the amount based on the relationship between distributed and reflection supply.
     * @param amount The amount to adjust.
     * @return uint256 The adjusted amount after applying the reflection rate.
     */
    function applyRate(uint256 amount) public view returns (uint256) {
        // Parameters
        uint256 reflectionsSupply = totalReflectionSupply();
        uint256 holdersSupply = balanceOfHolders();

        if (holdersSupply == 0) {
            return 0;
        }

        if (reflectionsSupply == 0) {
            return amount;
        }

        uint256 result = amount.mulDiv(reflectionsSupply, holdersSupply);

        return amount + result;
    }

    /**
     * @notice Splits the given amount into actual balance and reflection components.
     * @dev Reverses the reflection effect, calculating the balance without reflections.
     * @param amount The total amount including balance and reflections.
     * @return amountBalance The amount excluding reflections.
     * @return amountReflection The reflection portion of the amount.
     */
    function applyReverseRate(
        uint256 amount
    ) public view returns (uint256 amountBalance, uint256 amountReflection) {
        // Validation Zero
        if (amount == 0) return (0, 0);

        // Parameters
        uint256 reflectionsSupply = totalReflectionSupply();
        uint256 holdersSupply = balanceOfHolders();

        if (holdersSupply == 0 || reflectionsSupply == 0) {
            return (amount, 0);
        }

        uint256 divisor = holdersSupply + reflectionsSupply;

        amountBalance = amount.mulDiv(holdersSupply, divisor);
        amountReflection = amount - amountBalance;

        return (amountBalance, amountReflection);
    }

    /**
     * @dev Calculates the amount after applying the given tax rate.
     * @param amount The original amount to apply the tax on.
     * @param tax The tax rate as a percentage (e.g., 5 for 5%).
     * @return amountAfterTax The amount remaining after the tax is applied.
     * @return taxedAmount The amount of tax deducted.
     *
     * @notice If the tax is 0 or the amount is less than 2, the original amount is returned with no tax.
     */
    function calculateTax(
        uint256 amount,
        uint32 tax
    ) public pure returns (uint256 amountAfterTax, uint256 taxedAmount) {
        // Validation Zero Tax
        if (tax == 0) return (amount, 0);

        // Validation Small Amount
        if ((amount * tax) < _taxFactor) {
            if (amount < 2) {
                return (amount, 0);
            } else {
                taxedAmount = amount / 2;
                amountAfterTax = amount - taxedAmount;

                return (amountAfterTax, taxedAmount);
            }
        }

        taxedAmount = (amount * tax) / _taxFactor;
        amountAfterTax = amount - taxedAmount;

        return (amountAfterTax, taxedAmount);
    }

    /**
     * @notice Calculate the balance deduction based on previous and current balance.
     * @param prevBalance The previous balance before adjustment.
     * @param balance The current balance after adjustment and transaction cost.
     * @param value The amount of tokens to be transferred.
     * @return The deduction applied to the balance (P), or 0 if no valid solution exists.
     */
    function calculateBalanceDeduction(
        uint256 prevBalance,
        uint256 balance,
        uint256 value
    ) public view returns (uint256) {
        // Parameters
        uint256 reflectionsSupply = totalReflectionSupply();
        uint256 holdersSupply = balanceOfHolders();

        // Validation
        if (holdersSupply > value) {
            holdersSupply = holdersSupply - value;
        } else {
            return 0;
        }

        // Calculation
        uint256 a = prevBalance * holdersSupply;
        uint256 b = balance * (holdersSupply + reflectionsSupply);
        uint256 c = 0;

        // Validation
        if (a > b) {
            c = a - b;
        } else {
            c = b - a;
        }

        // Calculation
        uint256 divisor = prevBalance + holdersSupply + reflectionsSupply;

        // Validation
        if (c > 0) {
            (, uint256 result) = Math.tryDiv(c, divisor);

            return result;
        } else {
            return 0;
        }
    }

    /**
     * @notice Excludes an address from paying transaction fees.
     * @dev Only the owner can set the exclusion status.
     * @param account The address to exclude or include.
     * @param exclude A boolean flag indicating exclusion (true) or inclusion (false).
     */
    function setExclude(address account, bool exclude) external onlyOwner {
        // Set
        isExcluded[account] = exclude;

        // Event
        emit Excluded(account, exclude);
    }

    /**
     * @notice Excludes an address from reflection.
     * @dev Only the owner can set the exclusion status.
     * @param account The address to exclude or include.
     * @param exclude A boolean flag indicating exclusion (true) or inclusion (false).
     */
    function setExcludeFromReflection(
        address account,
        bool exclude
    ) external onlyOwner {
        // Set
        isExcludedFromReflection[account] = exclude;

        // Add / Remove from Address Set
        if (exclude) {
            _excludedFromReflection.add(account);
        } else {
            _excludedFromReflection.remove(account);
        }

        // Event
        emit ExcludedFromReflection(account, exclude);
    }

    /**
     * @notice Sets the maximum wallet factor for the contract.
     * @dev The factor defines the limit on the maximum tokens an address can hold.
     * @param newFactor The new wallet factor to be set.
     */
    function setMaxWalletFactor(uint32 newFactor) external onlyOwner {
        // Validation
        if (newFactor > totalSupply()) {
            revert InvalidInput(
                "Max wallet factor",
                "Max wallet factor cannot exceed total supply"
            );
        }

        // Set
        uint32 oldFactor = _maxWalletFactor;
        _maxWalletFactor = newFactor;

        // Event
        emit FactorModified("Max Wallet Factor", oldFactor, newFactor);
    }

    /**
     * @notice Sets the maximum transaction factor for the contract.
     * @dev The factor defines the limit on the size of individual transfers.
     * @param newFactor The new transaction factor to be set.
     */
    function setMaxTransactionFactor(uint32 newFactor) external onlyOwner {
        // Validation
        if (newFactor > totalSupply()) {
            revert InvalidInput(
                "Max transaction factor",
                "Max transaction factor cannot exceed total supply"
            );
        }

        // Set
        uint32 oldFactor = _maxTransactionFactor;
        _maxTransactionFactor = newFactor;

        // Event
        emit FactorModified("Max Transaction Factor", oldFactor, newFactor);
    }

    /**
     * @notice Swaps tokens for ETH and distributes the collected ETH to the DAO.
     * @dev Only the contract owner can execute this function.
     */
    function swap() external onlyOwner {
        // Swap
        _swapTokensForEth(balanceOf(address(this)));

        // Distribute
        _transferTax();

        // Event
        emit Swap();
    }

    /**
     * @dev Internal function to swap tokens for ETH using Uniswap V2 Router.
     * @param amount The amount of tokens to swap.
     */
    function _swapTokensForEth(uint256 amount) private {
        // Verification
        if (address(uniswapV2Router) == address(0)) {
            revert UniswapV2InvalidRouter(address(0));
        }

        // Approve the Uniswap V2 router to spend the token amount
        _approve(address(this), address(uniswapV2Router), amount);

        // Parameters
        address[] memory path = new address[](2);

        // Configuration
        path[0] = address(this);
        path[1] = uniswapV2Router.WETH();

        // Swap tokens for ETH
        uniswapV2Router.swapExactTokensForETHSupportingFeeOnTransferTokens(
            amount,
            0,
            path,
            address(this),
            block.timestamp + 600
        );
    }

    /**
     * @dev Internal function to transfer collected tax in ETH to the Xypher Council Gift receiver.
     */
    function _transferTax() private {
        // Parameter
        uint256 tax = address(this).balance;

        if (tax > 0) {
            address payable taxCollector = payable(gift.receiver());
            taxCollector.transfer(tax);
        }
    }

    /**
     * @dev Fallback function to receive ETH.
     */
    receive() external payable {}

    /**
     * @dev Fallback function to receive ETH.
     */
    fallback() external payable {}
}

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

pragma solidity ^0.8.20;

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

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

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

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

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

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

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

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

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

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

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

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

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.0.0) (governance/utils/IVotes.sol)
pragma solidity ^0.8.20;

/**
 * @dev Common interface for {ERC20Votes}, {ERC721Votes}, and other {Votes}-enabled contracts.
 */
interface IVotes {
    /**
     * @dev The signature used has expired.
     */
    error VotesExpiredSignature(uint256 expiry);

    /**
     * @dev Emitted when an account changes their delegate.
     */
    event DelegateChanged(address indexed delegator, address indexed fromDelegate, address indexed toDelegate);

    /**
     * @dev Emitted when a token transfer or delegate change results in changes to a delegate's number of voting units.
     */
    event DelegateVotesChanged(address indexed delegate, uint256 previousVotes, uint256 newVotes);

    /**
     * @dev Returns the current amount of votes that `account` has.
     */
    function getVotes(address account) external view returns (uint256);

    /**
     * @dev Returns the amount of votes that `account` had at a specific moment in the past. If the `clock()` is
     * configured to use block numbers, this will return the value at the end of the corresponding block.
     */
    function getPastVotes(address account, uint256 timepoint) external view returns (uint256);

    /**
     * @dev Returns the total supply of votes available at a specific moment in the past. If the `clock()` is
     * configured to use block numbers, this will return the value at the end of the corresponding block.
     *
     * NOTE: This value is the sum of all available votes, which is not necessarily the sum of all delegated votes.
     * Votes that have not been delegated are still part of total supply, even though they would not participate in a
     * vote.
     */
    function getPastTotalSupply(uint256 timepoint) external view returns (uint256);

    /**
     * @dev Returns the delegate that `account` has chosen.
     */
    function delegates(address account) external view returns (address);

    /**
     * @dev Delegates votes from the sender to `delegatee`.
     */
    function delegate(address delegatee) external;

    /**
     * @dev Delegates votes from signer to `delegatee`.
     */
    function delegateBySig(address delegatee, uint256 nonce, uint256 expiry, uint8 v, bytes32 r, bytes32 s) external;
}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.0.0) (governance/utils/Votes.sol)
pragma solidity ^0.8.20;

import {IERC5805} from "../../interfaces/IERC5805.sol";
import {Context} from "../../utils/Context.sol";
import {Nonces} from "../../utils/Nonces.sol";
import {EIP712} from "../../utils/cryptography/EIP712.sol";
import {Checkpoints} from "../../utils/structs/Checkpoints.sol";
import {SafeCast} from "../../utils/math/SafeCast.sol";
import {ECDSA} from "../../utils/cryptography/ECDSA.sol";
import {Time} from "../../utils/types/Time.sol";

/**
 * @dev This is a base abstract contract that tracks voting units, which are a measure of voting power that can be
 * transferred, and provides a system of vote delegation, where an account can delegate its voting units to a sort of
 * "representative" that will pool delegated voting units from different accounts and can then use it to vote in
 * decisions. In fact, voting units _must_ be delegated in order to count as actual votes, and an account has to
 * delegate those votes to itself if it wishes to participate in decisions and does not have a trusted representative.
 *
 * This contract is often combined with a token contract such that voting units correspond to token units. For an
 * example, see {ERC721Votes}.
 *
 * The full history of delegate votes is tracked on-chain so that governance protocols can consider votes as distributed
 * at a particular block number to protect against flash loans and double voting. The opt-in delegate system makes the
 * cost of this history tracking optional.
 *
 * When using this module the derived contract must implement {_getVotingUnits} (for example, make it return
 * {ERC721-balanceOf}), and can use {_transferVotingUnits} to track a change in the distribution of those units (in the
 * previous example, it would be included in {ERC721-_update}).
 */
abstract contract Votes is Context, EIP712, Nonces, IERC5805 {
    using Checkpoints for Checkpoints.Trace208;

    bytes32 private constant DELEGATION_TYPEHASH =
        keccak256("Delegation(address delegatee,uint256 nonce,uint256 expiry)");

    mapping(address account => address) private _delegatee;

    mapping(address delegatee => Checkpoints.Trace208) private _delegateCheckpoints;

    Checkpoints.Trace208 private _totalCheckpoints;

    /**
     * @dev The clock was incorrectly modified.
     */
    error ERC6372InconsistentClock();

    /**
     * @dev Lookup to future votes is not available.
     */
    error ERC5805FutureLookup(uint256 timepoint, uint48 clock);

    /**
     * @dev Clock used for flagging checkpoints. Can be overridden to implement timestamp based
     * checkpoints (and voting), in which case {CLOCK_MODE} should be overridden as well to match.
     */
    function clock() public view virtual returns (uint48) {
        return Time.blockNumber();
    }

    /**
     * @dev Machine-readable description of the clock as specified in EIP-6372.
     */
    // solhint-disable-next-line func-name-mixedcase
    function CLOCK_MODE() public view virtual returns (string memory) {
        // Check that the clock was not modified
        if (clock() != Time.blockNumber()) {
            revert ERC6372InconsistentClock();
        }
        return "mode=blocknumber&from=default";
    }

    /**
     * @dev Returns the current amount of votes that `account` has.
     */
    function getVotes(address account) public view virtual returns (uint256) {
        return _delegateCheckpoints[account].latest();
    }

    /**
     * @dev Returns the amount of votes that `account` had at a specific moment in the past. If the `clock()` is
     * configured to use block numbers, this will return the value at the end of the corresponding block.
     *
     * Requirements:
     *
     * - `timepoint` must be in the past. If operating using block numbers, the block must be already mined.
     */
    function getPastVotes(address account, uint256 timepoint) public view virtual returns (uint256) {
        uint48 currentTimepoint = clock();
        if (timepoint >= currentTimepoint) {
            revert ERC5805FutureLookup(timepoint, currentTimepoint);
        }
        return _delegateCheckpoints[account].upperLookupRecent(SafeCast.toUint48(timepoint));
    }

    /**
     * @dev Returns the total supply of votes available at a specific moment in the past. If the `clock()` is
     * configured to use block numbers, this will return the value at the end of the corresponding block.
     *
     * NOTE: This value is the sum of all available votes, which is not necessarily the sum of all delegated votes.
     * Votes that have not been delegated are still part of total supply, even though they would not participate in a
     * vote.
     *
     * Requirements:
     *
     * - `timepoint` must be in the past. If operating using block numbers, the block must be already mined.
     */
    function getPastTotalSupply(uint256 timepoint) public view virtual returns (uint256) {
        uint48 currentTimepoint = clock();
        if (timepoint >= currentTimepoint) {
            revert ERC5805FutureLookup(timepoint, currentTimepoint);
        }
        return _totalCheckpoints.upperLookupRecent(SafeCast.toUint48(timepoint));
    }

    /**
     * @dev Returns the current total supply of votes.
     */
    function _getTotalSupply() internal view virtual returns (uint256) {
        return _totalCheckpoints.latest();
    }

    /**
     * @dev Returns the delegate that `account` has chosen.
     */
    function delegates(address account) public view virtual returns (address) {
        return _delegatee[account];
    }

    /**
     * @dev Delegates votes from the sender to `delegatee`.
     */
    function delegate(address delegatee) public virtual {
        address account = _msgSender();
        _delegate(account, delegatee);
    }

    /**
     * @dev Delegates votes from signer to `delegatee`.
     */
    function delegateBySig(
        address delegatee,
        uint256 nonce,
        uint256 expiry,
        uint8 v,
        bytes32 r,
        bytes32 s
    ) public virtual {
        if (block.timestamp > expiry) {
            revert VotesExpiredSignature(expiry);
        }
        address signer = ECDSA.recover(
            _hashTypedDataV4(keccak256(abi.encode(DELEGATION_TYPEHASH, delegatee, nonce, expiry))),
            v,
            r,
            s
        );
        _useCheckedNonce(signer, nonce);
        _delegate(signer, delegatee);
    }

    /**
     * @dev Delegate all of `account`'s voting units to `delegatee`.
     *
     * Emits events {IVotes-DelegateChanged} and {IVotes-DelegateVotesChanged}.
     */
    function _delegate(address account, address delegatee) internal virtual {
        address oldDelegate = delegates(account);
        _delegatee[account] = delegatee;

        emit DelegateChanged(account, oldDelegate, delegatee);
        _moveDelegateVotes(oldDelegate, delegatee, _getVotingUnits(account));
    }

    /**
     * @dev Transfers, mints, or burns voting units. To register a mint, `from` should be zero. To register a burn, `to`
     * should be zero. Total supply of voting units will be adjusted with mints and burns.
     */
    function _transferVotingUnits(address from, address to, uint256 amount) internal virtual {
        if (from == address(0)) {
            _push(_totalCheckpoints, _add, SafeCast.toUint208(amount));
        }
        if (to == address(0)) {
            _push(_totalCheckpoints, _subtract, SafeCast.toUint208(amount));
        }
        _moveDelegateVotes(delegates(from), delegates(to), amount);
    }

    /**
     * @dev Moves delegated votes from one delegate to another.
     */
    function _moveDelegateVotes(address from, address to, uint256 amount) private {
        if (from != to && amount > 0) {
            if (from != address(0)) {
                (uint256 oldValue, uint256 newValue) = _push(
                    _delegateCheckpoints[from],
                    _subtract,
                    SafeCast.toUint208(amount)
                );
                emit DelegateVotesChanged(from, oldValue, newValue);
            }
            if (to != address(0)) {
                (uint256 oldValue, uint256 newValue) = _push(
                    _delegateCheckpoints[to],
                    _add,
                    SafeCast.toUint208(amount)
                );
                emit DelegateVotesChanged(to, oldValue, newValue);
            }
        }
    }

    /**
     * @dev Get number of checkpoints for `account`.
     */
    function _numCheckpoints(address account) internal view virtual returns (uint32) {
        return SafeCast.toUint32(_delegateCheckpoints[account].length());
    }

    /**
     * @dev Get the `pos`-th checkpoint for `account`.
     */
    function _checkpoints(
        address account,
        uint32 pos
    ) internal view virtual returns (Checkpoints.Checkpoint208 memory) {
        return _delegateCheckpoints[account].at(pos);
    }

    function _push(
        Checkpoints.Trace208 storage store,
        function(uint208, uint208) view returns (uint208) op,
        uint208 delta
    ) private returns (uint208, uint208) {
        return store.push(clock(), op(store.latest(), delta));
    }

    function _add(uint208 a, uint208 b) private pure returns (uint208) {
        return a + b;
    }

    function _subtract(uint208 a, uint208 b) private pure returns (uint208) {
        return a - b;
    }

    /**
     * @dev Must return the voting units held by an account.
     */
    function _getVotingUnits(address) internal view virtual returns (uint256);
}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.0.0) (interfaces/draft-IERC6093.sol)
pragma solidity ^0.8.20;

/**
 * @dev Standard ERC20 Errors
 * Interface of the https://eips.ethereum.org/EIPS/eip-6093[ERC-6093] custom errors for ERC20 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);
}

/**
 * @dev Standard ERC721 Errors
 * Interface of the https://eips.ethereum.org/EIPS/eip-6093[ERC-6093] custom errors for ERC721 tokens.
 */
interface IERC721Errors {
    /**
     * @dev Indicates that an address can't be an owner. For example, `address(0)` is a forbidden owner in EIP-20.
     * Used in balance queries.
     * @param owner Address of the current owner of a token.
     */
    error ERC721InvalidOwner(address owner);

    /**
     * @dev Indicates a `tokenId` whose `owner` is the zero address.
     * @param tokenId Identifier number of a token.
     */
    error ERC721NonexistentToken(uint256 tokenId);

    /**
     * @dev Indicates an error related to the ownership over a particular token. Used in transfers.
     * @param sender Address whose tokens are being transferred.
     * @param tokenId Identifier number of a token.
     * @param owner Address of the current owner of a token.
     */
    error ERC721IncorrectOwner(address sender, uint256 tokenId, address owner);

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

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

    /**
     * @dev Indicates a failure with the `operator`’s approval. Used in transfers.
     * @param operator Address that may be allowed to operate on tokens without being their owner.
     * @param tokenId Identifier number of a token.
     */
    error ERC721InsufficientApproval(address operator, uint256 tokenId);

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

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

/**
 * @dev Standard ERC1155 Errors
 * Interface of the https://eips.ethereum.org/EIPS/eip-6093[ERC-6093] custom errors for ERC1155 tokens.
 */
interface IERC1155Errors {
    /**
     * @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.
     * @param tokenId Identifier number of a token.
     */
    error ERC1155InsufficientBalance(address sender, uint256 balance, uint256 needed, uint256 tokenId);

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

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

    /**
     * @dev Indicates a failure with the `operator`’s approval. Used in transfers.
     * @param operator Address that may be allowed to operate on tokens without being their owner.
     * @param owner Address of the current owner of a token.
     */
    error ERC1155MissingApprovalForAll(address operator, address owner);

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

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

    /**
     * @dev Indicates an array length mismatch between ids and values in a safeBatchTransferFrom operation.
     * Used in batch transfers.
     * @param idsLength Length of the array of token identifiers
     * @param valuesLength Length of the array of token amounts
     */
    error ERC1155InvalidArrayLength(uint256 idsLength, uint256 valuesLength);
}

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

pragma solidity ^0.8.20;

interface IERC5267 {
    /**
     * @dev MAY be emitted to signal that the domain could have changed.
     */
    event EIP712DomainChanged();

    /**
     * @dev returns the fields and values that describe the domain separator used by this contract for EIP-712
     * signature.
     */
    function eip712Domain()
        external
        view
        returns (
            bytes1 fields,
            string memory name,
            string memory version,
            uint256 chainId,
            address verifyingContract,
            bytes32 salt,
            uint256[] memory extensions
        );
}

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

pragma solidity ^0.8.20;

import {IVotes} from "../governance/utils/IVotes.sol";
import {IERC6372} from "./IERC6372.sol";

interface IERC5805 is IERC6372, IVotes {}

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

pragma solidity ^0.8.20;

interface IERC6372 {
    /**
     * @dev Clock used for flagging checkpoints. Can be overridden to implement timestamp based checkpoints (and voting).
     */
    function clock() external view returns (uint48);

    /**
     * @dev Description of the clock
     */
    // solhint-disable-next-line func-name-mixedcase
    function CLOCK_MODE() external view returns (string memory);
}

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

pragma solidity ^0.8.20;

import {IERC20} from "./IERC20.sol";
import {IERC20Metadata} from "./extensions/IERC20Metadata.sol";
import {Context} from "../../utils/Context.sol";
import {IERC20Errors} from "../../interfaces/draft-IERC6093.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 ERC20
 * applications.
 *
 * Additionally, an {Approval} event is emitted on calls to {transferFrom}.
 * This allows applications to reconstruct the allowance for all accounts just
 * by listening to said events. Other implementations of the EIP may not emit
 * these events, as it isn't required by the specification.
 */
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 private _name;
    string private _symbol;

    /**
     * @dev Sets the values for {name} and {symbol}.
     *
     * All two of these 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}.
     *
     * Emits an {Approval} event indicating the updated allowance. This is not
     * required by the EIP. See the note at the beginning of {ERC20}.
     *
     * 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:
     * ```
     * 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.0.0) (token/ERC20/extensions/ERC20Votes.sol)

pragma solidity ^0.8.20;

import {ERC20} from "../ERC20.sol";
import {Votes} from "../../../governance/utils/Votes.sol";
import {Checkpoints} from "../../../utils/structs/Checkpoints.sol";

/**
 * @dev Extension of ERC20 to support Compound-like voting and delegation. This version is more generic than Compound's,
 * and supports token supply up to 2^208^ - 1, while COMP is limited to 2^96^ - 1.
 *
 * NOTE: This contract does not provide interface compatibility with Compound's COMP token.
 *
 * This extension keeps a history (checkpoints) of each account's vote power. Vote power can be delegated either
 * by calling the {delegate} function directly, or by providing a signature to be used with {delegateBySig}. Voting
 * power can be queried through the public accessors {getVotes} and {getPastVotes}.
 *
 * By default, token balance does not account for voting power. This makes transfers cheaper. The downside is that it
 * requires users to delegate to themselves in order to activate checkpoints and have their voting power tracked.
 */
abstract contract ERC20Votes is ERC20, Votes {
    /**
     * @dev Total supply cap has been exceeded, introducing a risk of votes overflowing.
     */
    error ERC20ExceededSafeSupply(uint256 increasedSupply, uint256 cap);

    /**
     * @dev Maximum token supply. Defaults to `type(uint208).max` (2^208^ - 1).
     *
     * This maximum is enforced in {_update}. It limits the total supply of the token, which is otherwise a uint256,
     * so that checkpoints can be stored in the Trace208 structure used by {{Votes}}. Increasing this value will not
     * remove the underlying limitation, and will cause {_update} to fail because of a math overflow in
     * {_transferVotingUnits}. An override could be used to further restrict the total supply (to a lower value) if
     * additional logic requires it. When resolving override conflicts on this function, the minimum should be
     * returned.
     */
    function _maxSupply() internal view virtual returns (uint256) {
        return type(uint208).max;
    }

    /**
     * @dev Move voting power when tokens are transferred.
     *
     * Emits a {IVotes-DelegateVotesChanged} event.
     */
    function _update(address from, address to, uint256 value) internal virtual override {
        super._update(from, to, value);
        if (from == address(0)) {
            uint256 supply = totalSupply();
            uint256 cap = _maxSupply();
            if (supply > cap) {
                revert ERC20ExceededSafeSupply(supply, cap);
            }
        }
        _transferVotingUnits(from, to, value);
    }

    /**
     * @dev Returns the voting units of an `account`.
     *
     * WARNING: Overriding this function may compromise the internal vote accounting.
     * `ERC20Votes` assumes tokens map to voting units 1:1 and this is not easy to change.
     */
    function _getVotingUnits(address account) internal view virtual override returns (uint256) {
        return balanceOf(account);
    }

    /**
     * @dev Get number of checkpoints for `account`.
     */
    function numCheckpoints(address account) public view virtual returns (uint32) {
        return _numCheckpoints(account);
    }

    /**
     * @dev Get the `pos`-th checkpoint for `account`.
     */
    function checkpoints(address account, uint32 pos) public view virtual returns (Checkpoints.Checkpoint208 memory) {
        return _checkpoints(account, pos);
    }
}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.0.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 ERC20 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.0) (token/ERC20/IERC20.sol)

pragma solidity ^0.8.20;

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

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

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

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

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

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

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

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

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

pragma solidity ^0.8.20;

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

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

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

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

pragma solidity ^0.8.20;

/**
 * @dev Elliptic Curve Digital Signature Algorithm (ECDSA) operations.
 *
 * These functions can be used to verify that a message was signed by the holder
 * of the private keys of a given address.
 */
library ECDSA {
    enum RecoverError {
        NoError,
        InvalidSignature,
        InvalidSignatureLength,
        InvalidSignatureS
    }

    /**
     * @dev The signature derives the `address(0)`.
     */
    error ECDSAInvalidSignature();

    /**
     * @dev The signature has an invalid length.
     */
    error ECDSAInvalidSignatureLength(uint256 length);

    /**
     * @dev The signature has an S value that is in the upper half order.
     */
    error ECDSAInvalidSignatureS(bytes32 s);

    /**
     * @dev Returns the address that signed a hashed message (`hash`) with `signature` or an error. This will not
     * return address(0) without also returning an error description. Errors are documented using an enum (error type)
     * and a bytes32 providing additional information about the error.
     *
     * If no error is returned, then the address can be used for verification purposes.
     *
     * The `ecrecover` EVM precompile allows for malleable (non-unique) signatures:
     * this function rejects them by requiring the `s` value to be in the lower
     * half order, and the `v` value to be either 27 or 28.
     *
     * IMPORTANT: `hash` _must_ be the result of a hash operation for the
     * verification to be secure: it is possible to craft signatures that
     * recover to arbitrary addresses for non-hashed data. A safe way to ensure
     * this is by receiving a hash of the original message (which may otherwise
     * be too long), and then calling {MessageHashUtils-toEthSignedMessageHash} on it.
     *
     * Documentation for signature generation:
     * - with https://web3js.readthedocs.io/en/v1.3.4/web3-eth-accounts.html#sign[Web3.js]
     * - with https://docs.ethers.io/v5/api/signer/#Signer-signMessage[ethers]
     */
    function tryRecover(bytes32 hash, bytes memory signature) internal pure returns (address, RecoverError, bytes32) {
        if (signature.length == 65) {
            bytes32 r;
            bytes32 s;
            uint8 v;
            // ecrecover takes the signature parameters, and the only way to get them
            // currently is to use assembly.
            /// @solidity memory-safe-assembly
            assembly {
                r := mload(add(signature, 0x20))
                s := mload(add(signature, 0x40))
                v := byte(0, mload(add(signature, 0x60)))
            }
            return tryRecover(hash, v, r, s);
        } else {
            return (address(0), RecoverError.InvalidSignatureLength, bytes32(signature.length));
        }
    }

    /**
     * @dev Returns the address that signed a hashed message (`hash`) with
     * `signature`. This address can then be used for verification purposes.
     *
     * The `ecrecover` EVM precompile allows for malleable (non-unique) signatures:
     * this function rejects them by requiring the `s` value to be in the lower
     * half order, and the `v` value to be either 27 or 28.
     *
     * IMPORTANT: `hash` _must_ be the result of a hash operation for the
     * verification to be secure: it is possible to craft signatures that
     * recover to arbitrary addresses for non-hashed data. A safe way to ensure
     * this is by receiving a hash of the original message (which may otherwise
     * be too long), and then calling {MessageHashUtils-toEthSignedMessageHash} on it.
     */
    function recover(bytes32 hash, bytes memory signature) internal pure returns (address) {
        (address recovered, RecoverError error, bytes32 errorArg) = tryRecover(hash, signature);
        _throwError(error, errorArg);
        return recovered;
    }

    /**
     * @dev Overload of {ECDSA-tryRecover} that receives the `r` and `vs` short-signature fields separately.
     *
     * See https://eips.ethereum.org/EIPS/eip-2098[EIP-2098 short signatures]
     */
    function tryRecover(bytes32 hash, bytes32 r, bytes32 vs) internal pure returns (address, RecoverError, bytes32) {
        unchecked {
            bytes32 s = vs & bytes32(0x7fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff);
            // We do not check for an overflow here since the shift operation results in 0 or 1.
            uint8 v = uint8((uint256(vs) >> 255) + 27);
            return tryRecover(hash, v, r, s);
        }
    }

    /**
     * @dev Overload of {ECDSA-recover} that receives the `r and `vs` short-signature fields separately.
     */
    function recover(bytes32 hash, bytes32 r, bytes32 vs) internal pure returns (address) {
        (address recovered, RecoverError error, bytes32 errorArg) = tryRecover(hash, r, vs);
        _throwError(error, errorArg);
        return recovered;
    }

    /**
     * @dev Overload of {ECDSA-tryRecover} that receives the `v`,
     * `r` and `s` signature fields separately.
     */
    function tryRecover(
        bytes32 hash,
        uint8 v,
        bytes32 r,
        bytes32 s
    ) internal pure returns (address, RecoverError, bytes32) {
        // EIP-2 still allows signature malleability for ecrecover(). Remove this possibility and make the signature
        // unique. Appendix F in the Ethereum Yellow paper (https://ethereum.github.io/yellowpaper/paper.pdf), defines
        // the valid range for s in (301): 0 < s < secp256k1n ÷ 2 + 1, and for v in (302): v ∈ {27, 28}. Most
        // signatures from current libraries generate a unique signature with an s-value in the lower half order.
        //
        // If your library generates malleable signatures, such as s-values in the upper range, calculate a new s-value
        // with 0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEBAAEDCE6AF48A03BBFD25E8CD0364141 - s1 and flip v from 27 to 28 or
        // vice versa. If your library also generates signatures with 0/1 for v instead 27/28, add 27 to v to accept
        // these malleable signatures as well.
        if (uint256(s) > 0x7FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF5D576E7357A4501DDFE92F46681B20A0) {
            return (address(0), RecoverError.InvalidSignatureS, s);
        }

        // If the signature is valid (and not malleable), return the signer address
        address signer = ecrecover(hash, v, r, s);
        if (signer == address(0)) {
            return (address(0), RecoverError.InvalidSignature, bytes32(0));
        }

        return (signer, RecoverError.NoError, bytes32(0));
    }

    /**
     * @dev Overload of {ECDSA-recover} that receives the `v`,
     * `r` and `s` signature fields separately.
     */
    function recover(bytes32 hash, uint8 v, bytes32 r, bytes32 s) internal pure returns (address) {
        (address recovered, RecoverError error, bytes32 errorArg) = tryRecover(hash, v, r, s);
        _throwError(error, errorArg);
        return recovered;
    }

    /**
     * @dev Optionally reverts with the corresponding custom error according to the `error` argument provided.
     */
    function _throwError(RecoverError error, bytes32 errorArg) private pure {
        if (error == RecoverError.NoError) {
            return; // no error: do nothing
        } else if (error == RecoverError.InvalidSignature) {
            revert ECDSAInvalidSignature();
        } else if (error == RecoverError.InvalidSignatureLength) {
            revert ECDSAInvalidSignatureLength(uint256(errorArg));
        } else if (error == RecoverError.InvalidSignatureS) {
            revert ECDSAInvalidSignatureS(errorArg);
        }
    }
}

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

pragma solidity ^0.8.20;

import {MessageHashUtils} from "./MessageHashUtils.sol";
import {ShortStrings, ShortString} from "../ShortStrings.sol";
import {IERC5267} from "../../interfaces/IERC5267.sol";

/**
 * @dev https://eips.ethereum.org/EIPS/eip-712[EIP 712] is a standard for hashing and signing of typed structured data.
 *
 * The encoding scheme specified in the EIP requires a domain separator and a hash of the typed structured data, whose
 * encoding is very generic and therefore its implementation in Solidity is not feasible, thus this contract
 * does not implement the encoding itself. Protocols need to implement the type-specific encoding they need in order to
 * produce the hash of their typed data using a combination of `abi.encode` and `keccak256`.
 *
 * This contract implements the EIP 712 domain separator ({_domainSeparatorV4}) that is used as part of the encoding
 * scheme, and the final step of the encoding to obtain the message digest that is then signed via ECDSA
 * ({_hashTypedDataV4}).
 *
 * The implementation of the domain separator was designed to be as efficient as possible while still properly updating
 * the chain id to protect against replay attacks on an eventual fork of the chain.
 *
 * NOTE: This contract implements the version of the encoding known as "v4", as implemented by the JSON RPC method
 * https://docs.metamask.io/guide/signing-data.html[`eth_signTypedDataV4` in MetaMask].
 *
 * NOTE: In the upgradeable version of this contract, the cached values will correspond to the address, and the domain
 * separator of the implementation contract. This will cause the {_domainSeparatorV4} function to always rebuild the
 * separator from the immutable values, which is cheaper than accessing a cached version in cold storage.
 *
 * @custom:oz-upgrades-unsafe-allow state-variable-immutable
 */
abstract contract EIP712 is IERC5267 {
    using ShortStrings for *;

    bytes32 private constant TYPE_HASH =
        keccak256("EIP712Domain(string name,string version,uint256 chainId,address verifyingContract)");

    // Cache the domain separator as an immutable value, but also store the chain id that it corresponds to, in order to
    // invalidate the cached domain separator if the chain id changes.
    bytes32 private immutable _cachedDomainSeparator;
    uint256 private immutable _cachedChainId;
    address private immutable _cachedThis;

    bytes32 private immutable _hashedName;
    bytes32 private immutable _hashedVersion;

    ShortString private immutable _name;
    ShortString private immutable _version;
    string private _nameFallback;
    string private _versionFallback;

    /**
     * @dev Initializes the domain separator and parameter caches.
     *
     * The meaning of `name` and `version` is specified in
     * https://eips.ethereum.org/EIPS/eip-712#definition-of-domainseparator[EIP 712]:
     *
     * - `name`: the user readable name of the signing domain, i.e. the name of the DApp or the protocol.
     * - `version`: the current major version of the signing domain.
     *
     * NOTE: These parameters cannot be changed except through a xref:learn::upgrading-smart-contracts.adoc[smart
     * contract upgrade].
     */
    constructor(string memory name, string memory version) {
        _name = name.toShortStringWithFallback(_nameFallback);
        _version = version.toShortStringWithFallback(_versionFallback);
        _hashedName = keccak256(bytes(name));
        _hashedVersion = keccak256(bytes(version));

        _cachedChainId = block.chainid;
        _cachedDomainSeparator = _buildDomainSeparator();
        _cachedThis = address(this);
    }

    /**
     * @dev Returns the domain separator for the current chain.
     */
    function _domainSeparatorV4() internal view returns (bytes32) {
        if (address(this) == _cachedThis && block.chainid == _cachedChainId) {
            return _cachedDomainSeparator;
        } else {
            return _buildDomainSeparator();
        }
    }

    function _buildDomainSeparator() private view returns (bytes32) {
        return keccak256(abi.encode(TYPE_HASH, _hashedName, _hashedVersion, block.chainid, address(this)));
    }

    /**
     * @dev Given an already https://eips.ethereum.org/EIPS/eip-712#definition-of-hashstruct[hashed struct], this
     * function returns the hash of the fully encoded EIP712 message for this domain.
     *
     * This hash can be used together with {ECDSA-recover} to obtain the signer of a message. For example:
     *
     * ```solidity
     * bytes32 digest = _hashTypedDataV4(keccak256(abi.encode(
     *     keccak256("Mail(address to,string contents)"),
     *     mailTo,
     *     keccak256(bytes(mailContents))
     * )));
     * address signer = ECDSA.recover(digest, signature);
     * ```
     */
    function _hashTypedDataV4(bytes32 structHash) internal view virtual returns (bytes32) {
        return MessageHashUtils.toTypedDataHash(_domainSeparatorV4(), structHash);
    }

    /**
     * @dev See {IERC-5267}.
     */
    function eip712Domain()
        public
        view
        virtual
        returns (
            bytes1 fields,
            string memory name,
            string memory version,
            uint256 chainId,
            address verifyingContract,
            bytes32 salt,
            uint256[] memory extensions
        )
    {
        return (
            hex"0f", // 01111
            _EIP712Name(),
            _EIP712Version(),
            block.chainid,
            address(this),
            bytes32(0),
            new uint256[](0)
        );
    }

    /**
     * @dev The name parameter for the EIP712 domain.
     *
     * NOTE: By default this function reads _name which is an immutable value.
     * It only reads from storage if necessary (in case the value is too large to fit in a ShortString).
     */
    // solhint-disable-next-line func-name-mixedcase
    function _EIP712Name() internal view returns (string memory) {
        return _name.toStringWithFallback(_nameFallback);
    }

    /**
     * @dev The version parameter for the EIP712 domain.
     *
     * NOTE: By default this function reads _version which is an immutable value.
     * It only reads from storage if necessary (in case the value is too large to fit in a ShortString).
     */
    // solhint-disable-next-line func-name-mixedcase
    function _EIP712Version() internal view returns (string memory) {
        return _version.toStringWithFallback(_versionFallback);
    }
}

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

pragma solidity ^0.8.20;

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

/**
 * @dev Signature message hash utilities for producing digests to be consumed by {ECDSA} recovery or signing.
 *
 * The library provides methods for generating a hash of a message that conforms to the
 * https://eips.ethereum.org/EIPS/eip-191[EIP 191] and https://eips.ethereum.org/EIPS/eip-712[EIP 712]
 * specifications.
 */
library MessageHashUtils {
    /**
     * @dev Returns the keccak256 digest of an EIP-191 signed data with version
     * `0x45` (`personal_sign` messages).
     *
     * The digest is calculated by prefixing a bytes32 `messageHash` with
     * `"\x19Ethereum Signed Message:\n32"` and hashing the result. It corresponds with the
     * hash signed when using the https://eth.wiki/json-rpc/API#eth_sign[`eth_sign`] JSON-RPC method.
     *
     * NOTE: The `messageHash` parameter is intended to be the result of hashing a raw message with
     * keccak256, although any bytes32 value can be safely used because the final digest will
     * be re-hashed.
     *
     * See {ECDSA-recover}.
     */
    function toEthSignedMessageHash(bytes32 messageHash) internal pure returns (bytes32 digest) {
        /// @solidity memory-safe-assembly
        assembly {
            mstore(0x00, "\x19Ethereum Signed Message:\n32") // 32 is the bytes-length of messageHash
            mstore(0x1c, messageHash) // 0x1c (28) is the length of the prefix
            digest := keccak256(0x00, 0x3c) // 0x3c is the length of the prefix (0x1c) + messageHash (0x20)
        }
    }

    /**
     * @dev Returns the keccak256 digest of an EIP-191 signed data with version
     * `0x45` (`personal_sign` messages).
     *
     * The digest is calculated by prefixing an arbitrary `message` with
     * `"\x19Ethereum Signed Message:\n" + len(message)` and hashing the result. It corresponds with the
     * hash signed when using the https://eth.wiki/json-rpc/API#eth_sign[`eth_sign`] JSON-RPC method.
     *
     * See {ECDSA-recover}.
     */
    function toEthSignedMessageHash(bytes memory message) internal pure returns (bytes32) {
        return
            keccak256(bytes.concat("\x19Ethereum Signed Message:\n", bytes(Strings.toString(message.length)), message));
    }

    /**
     * @dev Returns the keccak256 digest of an EIP-191 signed data with version
     * `0x00` (data with intended validator).
     *
     * The digest is calculated by prefixing an arbitrary `data` with `"\x19\x00"` and the intended
     * `validator` address. Then hashing the result.
     *
     * See {ECDSA-recover}.
     */
    function toDataWithIntendedValidatorHash(address validator, bytes memory data) internal pure returns (bytes32) {
        return keccak256(abi.encodePacked(hex"19_00", validator, data));
    }

    /**
     * @dev Returns the keccak256 digest of an EIP-712 typed data (EIP-191 version `0x01`).
     *
     * The digest is calculated from a `domainSeparator` and a `structHash`, by prefixing them with
     * `\x19\x01` and hashing the result. It corresponds to the hash signed by the
     * https://eips.ethereum.org/EIPS/eip-712[`eth_signTypedData`] JSON-RPC method as part of EIP-712.
     *
     * See {ECDSA-recover}.
     */
    function toTypedDataHash(bytes32 domainSeparator, bytes32 structHash) internal pure returns (bytes32 digest) {
        /// @solidity memory-safe-assembly
        assembly {
            let ptr := mload(0x40)
            mstore(ptr, hex"19_01")
            mstore(add(ptr, 0x02), domainSeparator)
            mstore(add(ptr, 0x22), structHash)
            digest := keccak256(ptr, 0x42)
        }
    }
}

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

pragma solidity ^0.8.20;

/**
 * @dev Standard math utilities missing in the Solidity language.
 */
library Math {
    /**
     * @dev Muldiv operation overflow.
     */
    error MathOverflowedMulDiv();

    enum Rounding {
        Floor, // Toward negative infinity
        Ceil, // Toward positive infinity
        Trunc, // Toward zero
        Expand // Away from zero
    }

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

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

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

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

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

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

    /**
     * @dev Returns the smallest of two numbers.
     */
    function min(uint256 a, uint256 b) internal pure returns (uint256) {
        return 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.
            return a / b;
        }

        // (a + b - 1) / b can overflow on addition, so we distribute.
        return a == 0 ? 0 : (a - 1) / b + 1;
    }

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

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

            // Make sure the result is less than 2^256. Also prevents denominator == 0.
            if (denominator <= prod1) {
                revert MathOverflowedMulDiv();
            }

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

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

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

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

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

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

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

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

            // Invert denominator mod 2^256. Now that denominator is an odd number, it has an inverse modulo 2^256 such
            // that denominator * inv = 1 mod 2^256. Compute the inverse by starting with a seed that is correct for
            // four bits. That is, denominator * inv = 1 mod 2^4.
            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^8
            inverse *= 2 - denominator * inverse; // inverse mod 2^16
            inverse *= 2 - denominator * inverse; // inverse mod 2^32
            inverse *= 2 - denominator * inverse; // inverse mod 2^64
            inverse *= 2 - denominator * inverse; // inverse mod 2^128
            inverse *= 2 - denominator * inverse; // inverse mod 2^256

            // 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^256. Since the preconditions guarantee that the outcome is
            // less than 2^256, this is the final result. We don't need to compute the high bits of the result and prod1
            // is no longer required.
            result = prod0 * inverse;
            return result;
        }
    }

    /**
     * @notice 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) {
        uint256 result = mulDiv(x, y, denominator);
        if (unsignedRoundsUp(rounding) && mulmod(x, y, denominator) > 0) {
            result += 1;
        }
        return result;
    }

    /**
     * @dev Returns the square root of a number. If the number is not a perfect square, the value is rounded
     * towards zero.
     *
     * Inspired by Henry S. Warren, Jr.'s "Hacker's Delight" (Chapter 11).
     */
    function sqrt(uint256 a) internal pure returns (uint256) {
        if (a == 0) {
            return 0;
        }

        // For our first guess, we get the biggest power of 2 which is smaller than the square root of the target.
        //
        // We know that the "msb" (most significant bit) of our target number `a` is a power of 2 such that we have
        // `msb(a) <= a < 2*msb(a)`. This value can be written `msb(a)=2**k` with `k=log2(a)`.
        //
        // This can be rewritten `2**log2(a) <= a < 2**(log2(a) + 1)`
        // → `sqrt(2**k) <= sqrt(a) < sqrt(2**(k+1))`
        // → `2**(k/2) <= sqrt(a) < 2**((k+1)/2) <= 2**(k/2 + 1)`
        //
        // Consequently, `2**(log2(a) / 2)` is a good first approximation of `sqrt(a)` with at least 1 correct bit.
        uint256 result = 1 << (log2(a) >> 1);

        // At this point `result` is an estimation with one bit of precision. We know the true value is a uint128,
        // since it is the square root of a uint256. Newton's method converges quadratically (precision doubles at
        // every iteration). We thus need at most 7 iteration to turn our partial result with one bit of precision
        // into the expected uint128 result.
        unchecked {
            result = (result + a / result) >> 1;
            result = (result + a / result) >> 1;
            result = (result + a / result) >> 1;
            result = (result + a / result) >> 1;
            result = (result + a / result) >> 1;
            result = (result + a / result) >> 1;
            result = (result + a / result) >> 1;
            return min(result, a / result);
        }
    }

    /**
     * @notice 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 + (unsignedRoundsUp(rounding) && result * result < a ? 1 : 0);
        }
    }

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

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

    /**
     * @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 + (unsignedRoundsUp(rounding) && 10 ** result < value ? 1 : 0);
        }
    }

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

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

    /**
     * @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.0.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 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);
    }
}

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

pragma solidity ^0.8.20;

/**
 * @dev Standard signed math utilities missing in the Solidity language.
 */
library SignedMath {
    /**
     * @dev Returns the largest of two signed numbers.
     */
    function max(int256 a, int256 b) internal pure returns (int256) {
        return a > b ? a : b;
    }

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

    /**
     * @dev Returns the average of two signed numbers without overflow.
     * The result is rounded towards zero.
     */
    function average(int256 a, int256 b) internal pure returns (int256) {
        // Formula from the book "Hacker's Delight"
        int256 x = (a & b) + ((a ^ b) >> 1);
        return x + (int256(uint256(x) >> 255) & (a ^ b));
    }

    /**
     * @dev Returns the absolute unsigned value of a signed value.
     */
    function abs(int256 n) internal pure returns (uint256) {
        unchecked {
            // must be unchecked in order to support `n = type(int256).min`
            return uint256(n >= 0 ? n : -n);
        }
    }
}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.0.0) (utils/Nonces.sol)
pragma solidity ^0.8.20;

/**
 * @dev Provides tracking nonces for addresses. Nonces will only increment.
 */
abstract contract Nonces {
    /**
     * @dev The nonce used for an `account` is not the expected current nonce.
     */
    error InvalidAccountNonce(address account, uint256 currentNonce);

    mapping(address account => uint256) private _nonces;

    /**
     * @dev Returns the next unused nonce for an address.
     */
    function nonces(address owner) public view virtual returns (uint256) {
        return _nonces[owner];
    }

    /**
     * @dev Consumes a nonce.
     *
     * Returns the current value and increments nonce.
     */
    function _useNonce(address owner) internal virtual returns (uint256) {
        // For each account, the nonce has an initial value of 0, can only be incremented by one, and cannot be
        // decremented or reset. This guarantees that the nonce never overflows.
        unchecked {
            // It is important to do x++ and not ++x here.
            return _nonces[owner]++;
        }
    }

    /**
     * @dev Same as {_useNonce} but checking that `nonce` is the next valid for `owner`.
     */
    function _useCheckedNonce(address owner, uint256 nonce) internal virtual {
        uint256 current = _useNonce(owner);
        if (nonce != current) {
            revert InvalidAccountNonce(owner, current);
        }
    }
}

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

pragma solidity ^0.8.20;

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

// | string  | 0xAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA   |
// | length  | 0x                                                              BB |
type ShortString is bytes32;

/**
 * @dev This library provides functions to convert short memory strings
 * into a `ShortString` type that can be used as an immutable variable.
 *
 * Strings of arbitrary length can be optimized using this library if
 * they are short enough (up to 31 bytes) by packing them with their
 * length (1 byte) in a single EVM word (32 bytes). Additionally, a
 * fallback mechanism can be used for every other case.
 *
 * Usage example:
 *
 * ```solidity
 * contract Named {
 *     using ShortStrings for *;
 *
 *     ShortString private immutable _name;
 *     string private _nameFallback;
 *
 *     constructor(string memory contractName) {
 *         _name = contractName.toShortStringWithFallback(_nameFallback);
 *     }
 *
 *     function name() external view returns (string memory) {
 *         return _name.toStringWithFallback(_nameFallback);
 *     }
 * }
 * ```
 */
library ShortStrings {
    // Used as an identifier for strings longer than 31 bytes.
    bytes32 private constant FALLBACK_SENTINEL = 0x00000000000000000000000000000000000000000000000000000000000000FF;

    error StringTooLong(string str);
    error InvalidShortString();

    /**
     * @dev Encode a string of at most 31 chars into a `ShortString`.
     *
     * This will trigger a `StringTooLong` error is the input string is too long.
     */
    function toShortString(string memory str) internal pure returns (ShortString) {
        bytes memory bstr = bytes(str);
        if (bstr.length > 31) {
            revert StringTooLong(str);
        }
        return ShortString.wrap(bytes32(uint256(bytes32(bstr)) | bstr.length));
    }

    /**
     * @dev Decode a `ShortString` back to a "normal" string.
     */
    function toString(ShortString sstr) internal pure returns (string memory) {
        uint256 len = byteLength(sstr);
        // using `new string(len)` would work locally but is not memory safe.
        string memory str = new string(32);
        /// @solidity memory-safe-assembly
        assembly {
            mstore(str, len)
            mstore(add(str, 0x20), sstr)
        }
        return str;
    }

    /**
     * @dev Return the length of a `ShortString`.
     */
    function byteLength(ShortString sstr) internal pure returns (uint256) {
        uint256 result = uint256(ShortString.unwrap(sstr)) & 0xFF;
        if (result > 31) {
            revert InvalidShortString();
        }
        return result;
    }

    /**
     * @dev Encode a string into a `ShortString`, or write it to storage if it is too long.
     */
    function toShortStringWithFallback(string memory value, string storage store) internal returns (ShortString) {
        if (bytes(value).length < 32) {
            return toShortString(value);
        } else {
            StorageSlot.getStringSlot(store).value = value;
            return ShortString.wrap(FALLBACK_SENTINEL);
        }
    }

    /**
     * @dev Decode a string that was encoded to `ShortString` or written to storage using {setWithFallback}.
     */
    function toStringWithFallback(ShortString value, string storage store) internal pure returns (string memory) {
        if (ShortString.unwrap(value) != FALLBACK_SENTINEL) {
            return toString(value);
        } else {
            return store;
        }
    }

    /**
     * @dev Return the length of a string that was encoded to `ShortString` or written to storage using
     * {setWithFallback}.
     *
     * WARNING: This will return the "byte length" of the string. This may not reflect the actual length in terms of
     * actual characters as the UTF-8 encoding of a single character can span over multiple bytes.
     */
    function byteLengthWithFallback(ShortString value, string storage store) internal view returns (uint256) {
        if (ShortString.unwrap(value) != FALLBACK_SENTINEL) {
            return byteLength(value);
        } else {
            return bytes(store).length;
        }
    }
}

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

pragma solidity ^0.8.20;

/**
 * @dev Library for reading and writing primitive types to specific storage slots.
 *
 * Storage slots are often used to avoid storage conflict when dealing with upgradeable contracts.
 * This library helps with reading and writing to such slots without the need for inline assembly.
 *
 * The functions in this library return Slot structs that contain a `value` member that can be used to read or write.
 *
 * Example usage to set ERC1967 implementation slot:
 * ```solidity
 * contract ERC1967 {
 *     bytes32 internal constant _IMPLEMENTATION_SLOT = 0x360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc;
 *
 *     function _getImplementation() internal view returns (address) {
 *         return StorageSlot.getAddressSlot(_IMPLEMENTATION_SLOT).value;
 *     }
 *
 *     function _setImplementation(address newImplementation) internal {
 *         require(newImplementation.code.length > 0);
 *         StorageSlot.getAddressSlot(_IMPLEMENTATION_SLOT).value = newImplementation;
 *     }
 * }
 * ```
 */
library StorageSlot {
    struct AddressSlot {
        address value;
    }

    struct BooleanSlot {
        bool value;
    }

    struct Bytes32Slot {
        bytes32 value;
    }

    struct Uint256Slot {
        uint256 value;
    }

    struct StringSlot {
        string value;
    }

    struct BytesSlot {
        bytes value;
    }

    /**
     * @dev Returns an `AddressSlot` with member `value` located at `slot`.
     */
    function getAddressSlot(bytes32 slot) internal pure returns (AddressSlot storage r) {
        /// @solidity memory-safe-assembly
        assembly {
            r.slot := slot
        }
    }

    /**
     * @dev Returns an `BooleanSlot` with member `value` located at `slot`.
     */
    function getBooleanSlot(bytes32 slot) internal pure returns (BooleanSlot storage r) {
        /// @solidity memory-safe-assembly
        assembly {
            r.slot := slot
        }
    }

    /**
     * @dev Returns an `Bytes32Slot` with member `value` located at `slot`.
     */
    function getBytes32Slot(bytes32 slot) internal pure returns (Bytes32Slot storage r) {
        /// @solidity memory-safe-assembly
        assembly {
            r.slot := slot
        }
    }

    /**
     * @dev Returns an `Uint256Slot` with member `value` located at `slot`.
     */
    function getUint256Slot(bytes32 slot) internal pure returns (Uint256Slot storage r) {
        /// @solidity memory-safe-assembly
        assembly {
            r.slot := slot
        }
    }

    /**
     * @dev Returns an `StringSlot` with member `value` located at `slot`.
     */
    function getStringSlot(bytes32 slot) internal pure returns (StringSlot storage r) {
        /// @solidity memory-safe-assembly
        assembly {
            r.slot := slot
        }
    }

    /**
     * @dev Returns an `StringSlot` representation of the string storage pointer `store`.
     */
    function getStringSlot(string storage store) internal pure returns (StringSlot storage r) {
        /// @solidity memory-safe-assembly
        assembly {
            r.slot := store.slot
        }
    }

    /**
     * @dev Returns an `BytesSlot` with member `value` located at `slot`.
     */
    function getBytesSlot(bytes32 slot) internal pure returns (BytesSlot storage r) {
        /// @solidity memory-safe-assembly
        assembly {
            r.slot := slot
        }
    }

    /**
     * @dev Returns an `BytesSlot` representation of the bytes storage pointer `store`.
     */
    function getBytesSlot(bytes storage store) internal pure returns (BytesSlot storage r) {
        /// @solidity memory-safe-assembly
        assembly {
            r.slot := store.slot
        }
    }
}

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

pragma solidity ^0.8.20;

import {Math} from "./math/Math.sol";
import {SignedMath} from "./math/SignedMath.sol";

/**
 * @dev String operations.
 */
library Strings {
    bytes16 private constant HEX_DIGITS = "0123456789abcdef";
    uint8 private constant ADDRESS_LENGTH = 20;

    /**
     * @dev The `value` string doesn't fit in the specified `length`.
     */
    error StringsInsufficientHexLength(uint256 value, uint256 length);

    /**
     * @dev Converts a `uint256` to its ASCII `string` decimal representation.
     */
    function toString(uint256 value) internal pure returns (string memory) {
        unchecked {
            uint256 length = Math.log10(value) + 1;
            string memory buffer = new string(length);
            uint256 ptr;
            /// @solidity memory-safe-assembly
            assembly {
                ptr := add(buffer, add(32, length))
            }
            while (true) {
                ptr--;
                /// @solidity memory-safe-assembly
                assembly {
                    mstore8(ptr, byte(mod(value, 10), HEX_DIGITS))
                }
                value /= 10;
                if (value == 0) break;
            }
            return buffer;
        }
    }

    /**
     * @dev Converts a `int256` to its ASCII `string` decimal representation.
     */
    function toStringSigned(int256 value) internal pure returns (string memory) {
        return string.concat(value < 0 ? "-" : "", toString(SignedMath.abs(value)));
    }

    /**
     * @dev Converts a `uint256` to its ASCII `string` hexadecimal representation.
     */
    function toHexString(uint256 value) internal pure returns (string memory) {
        unchecked {
            return toHexString(value, Math.log256(value) + 1);
        }
    }

    /**
     * @dev Converts a `uint256` to its ASCII `string` hexadecimal representation with fixed length.
     */
    function toHexString(uint256 value, uint256 length) internal pure returns (string memory) {
        uint256 localValue = value;
        bytes memory buffer = new bytes(2 * length + 2);
        buffer[0] = "0";
        buffer[1] = "x";
        for (uint256 i = 2 * length + 1; i > 1; --i) {
            buffer[i] = HEX_DIGITS[localValue & 0xf];
            localValue >>= 4;
        }
        if (localValue != 0) {
            revert StringsInsufficientHexLength(value, length);
        }
        return string(buffer);
    }

    /**
     * @dev Converts an `address` with fixed length of 20 bytes to its not checksummed ASCII `string` hexadecimal
     * representation.
     */
    function toHexString(address addr) internal pure returns (string memory) {
        return toHexString(uint256(uint160(addr)), ADDRESS_LENGTH);
    }

    /**
     * @dev Returns true if the two strings are equal.
     */
    function equal(string memory a, string memory b) internal pure returns (bool) {
        return bytes(a).length == bytes(b).length && keccak256(bytes(a)) == keccak256(bytes(b));
    }
}

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

pragma solidity ^0.8.20;

import {Math} from "../math/Math.sol";

/**
 * @dev This library defines the `Trace*` struct, for checkpointing values as they change at different points in
 * time, and later looking up past values by block number. See {Votes} as an example.
 *
 * To create a history of checkpoints define a variable type `Checkpoints.Trace*` in your contract, and store a new
 * checkpoint for the current transaction block using the {push} function.
 */
library Checkpoints {
    /**
     * @dev A value was attempted to be inserted on a past checkpoint.
     */
    error CheckpointUnorderedInsertion();

    struct Trace224 {
        Checkpoint224[] _checkpoints;
    }

    struct Checkpoint224 {
        uint32 _key;
        uint224 _value;
    }

    /**
     * @dev Pushes a (`key`, `value`) pair into a Trace224 so that it is stored as the checkpoint.
     *
     * Returns previous value and new value.
     *
     * IMPORTANT: Never accept `key` as a user input, since an arbitrary `type(uint32).max` key set will disable the
     * library.
     */
    function push(Trace224 storage self, uint32 key, uint224 value) internal returns (uint224, uint224) {
        return _insert(self._checkpoints, key, value);
    }

    /**
     * @dev Returns the value in the first (oldest) checkpoint with key greater or equal than the search key, or zero if
     * there is none.
     */
    function lowerLookup(Trace224 storage self, uint32 key) internal view returns (uint224) {
        uint256 len = self._checkpoints.length;
        uint256 pos = _lowerBinaryLookup(self._checkpoints, key, 0, len);
        return pos == len ? 0 : _unsafeAccess(self._checkpoints, pos)._value;
    }

    /**
     * @dev Returns the value in the last (most recent) checkpoint with key lower or equal than the search key, or zero
     * if there is none.
     */
    function upperLookup(Trace224 storage self, uint32 key) internal view returns (uint224) {
        uint256 len = self._checkpoints.length;
        uint256 pos = _upperBinaryLookup(self._checkpoints, key, 0, len);
        return pos == 0 ? 0 : _unsafeAccess(self._checkpoints, pos - 1)._value;
    }

    /**
     * @dev Returns the value in the last (most recent) checkpoint with key lower or equal than the search key, or zero
     * if there is none.
     *
     * NOTE: This is a variant of {upperLookup} that is optimised to find "recent" checkpoint (checkpoints with high
     * keys).
     */
    function upperLookupRecent(Trace224 storage self, uint32 key) internal view returns (uint224) {
        uint256 len = self._checkpoints.length;

        uint256 low = 0;
        uint256 high = len;

        if (len > 5) {
            uint256 mid = len - Math.sqrt(len);
            if (key < _unsafeAccess(self._checkpoints, mid)._key) {
                high = mid;
            } else {
                low = mid + 1;
            }
        }

        uint256 pos = _upperBinaryLookup(self._checkpoints, key, low, high);

        return pos == 0 ? 0 : _unsafeAccess(self._checkpoints, pos - 1)._value;
    }

    /**
     * @dev Returns the value in the most recent checkpoint, or zero if there are no checkpoints.
     */
    function latest(Trace224 storage self) internal view returns (uint224) {
        uint256 pos = self._checkpoints.length;
        return pos == 0 ? 0 : _unsafeAccess(self._checkpoints, pos - 1)._value;
    }

    /**
     * @dev Returns whether there is a checkpoint in the structure (i.e. it is not empty), and if so the key and value
     * in the most recent checkpoint.
     */
    function latestCheckpoint(Trace224 storage self) internal view returns (bool exists, uint32 _key, uint224 _value) {
        uint256 pos = self._checkpoints.length;
        if (pos == 0) {
            return (false, 0, 0);
        } else {
            Checkpoint224 memory ckpt = _unsafeAccess(self._checkpoints, pos - 1);
            return (true, ckpt._key, ckpt._value);
        }
    }

    /**
     * @dev Returns the number of checkpoint.
     */
    function length(Trace224 storage self) internal view returns (uint256) {
        return self._checkpoints.length;
    }

    /**
     * @dev Returns checkpoint at given position.
     */
    function at(Trace224 storage self, uint32 pos) internal view returns (Checkpoint224 memory) {
        return self._checkpoints[pos];
    }

    /**
     * @dev Pushes a (`key`, `value`) pair into an ordered list of checkpoints, either by inserting a new checkpoint,
     * or by updating the last one.
     */
    function _insert(Checkpoint224[] storage self, uint32 key, uint224 value) private returns (uint224, uint224) {
        uint256 pos = self.length;

        if (pos > 0) {
            // Copying to memory is important here.
            Checkpoint224 memory last = _unsafeAccess(self, pos - 1);

            // Checkpoint keys must be non-decreasing.
            if (last._key > key) {
                revert CheckpointUnorderedInsertion();
            }

            // Update or push new checkpoint
            if (last._key == key) {
                _unsafeAccess(self, pos - 1)._value = value;
            } else {
                self.push(Checkpoint224({_key: key, _value: value}));
            }
            return (last._value, value);
        } else {
            self.push(Checkpoint224({_key: key, _value: value}));
            return (0, value);
        }
    }

    /**
     * @dev Return the index of the last (most recent) checkpoint with key lower or equal than the search key, or `high`
     * if there is none. `low` and `high` define a section where to do the search, with inclusive `low` and exclusive
     * `high`.
     *
     * WARNING: `high` should not be greater than the array's length.
     */
    function _upperBinaryLookup(
        Checkpoint224[] storage self,
        uint32 key,
        uint256 low,
        uint256 high
    ) private view returns (uint256) {
        while (low < high) {
            uint256 mid = Math.average(low, high);
            if (_unsafeAccess(self, mid)._key > key) {
                high = mid;
            } else {
                low = mid + 1;
            }
        }
        return high;
    }

    /**
     * @dev Return the index of the first (oldest) checkpoint with key is greater or equal than the search key, or
     * `high` if there is none. `low` and `high` define a section where to do the search, with inclusive `low` and
     * exclusive `high`.
     *
     * WARNING: `high` should not be greater than the array's length.
     */
    function _lowerBinaryLookup(
        Checkpoint224[] storage self,
        uint32 key,
        uint256 low,
        uint256 high
    ) private view returns (uint256) {
        while (low < high) {
            uint256 mid = Math.average(low, high);
            if (_unsafeAccess(self, mid)._key < key) {
                low = mid + 1;
            } else {
                high = mid;
            }
        }
        return high;
    }

    /**
     * @dev Access an element of the array without performing bounds check. The position is assumed to be within bounds.
     */
    function _unsafeAccess(
        Checkpoint224[] storage self,
        uint256 pos
    ) private pure returns (Checkpoint224 storage result) {
        assembly {
            mstore(0, self.slot)
            result.slot := add(keccak256(0, 0x20), pos)
        }
    }

    struct Trace208 {
        Checkpoint208[] _checkpoints;
    }

    struct Checkpoint208 {
        uint48 _key;
        uint208 _value;
    }

    /**
     * @dev Pushes a (`key`, `value`) pair into a Trace208 so that it is stored as the checkpoint.
     *
     * Returns previous value and new value.
     *
     * IMPORTANT: Never accept `key` as a user input, since an arbitrary `type(uint48).max` key set will disable the
     * library.
     */
    function push(Trace208 storage self, uint48 key, uint208 value) internal returns (uint208, uint208) {
        return _insert(self._checkpoints, key, value);
    }

    /**
     * @dev Returns the value in the first (oldest) checkpoint with key greater or equal than the search key, or zero if
     * there is none.
     */
    function lowerLookup(Trace208 storage self, uint48 key) internal view returns (uint208) {
        uint256 len = self._checkpoints.length;
        uint256 pos = _lowerBinaryLookup(self._checkpoints, key, 0, len);
        return pos == len ? 0 : _unsafeAccess(self._checkpoints, pos)._value;
    }

    /**
     * @dev Returns the value in the last (most recent) checkpoint with key lower or equal than the search key, or zero
     * if there is none.
     */
    function upperLookup(Trace208 storage self, uint48 key) internal view returns (uint208) {
        uint256 len = self._checkpoints.length;
        uint256 pos = _upperBinaryLookup(self._checkpoints, key, 0, len);
        return pos == 0 ? 0 : _unsafeAccess(self._checkpoints, pos - 1)._value;
    }

    /**
     * @dev Returns the value in the last (most recent) checkpoint with key lower or equal than the search key, or zero
     * if there is none.
     *
     * NOTE: This is a variant of {upperLookup} that is optimised to find "recent" checkpoint (checkpoints with high
     * keys).
     */
    function upperLookupRecent(Trace208 storage self, uint48 key) internal view returns (uint208) {
        uint256 len = self._checkpoints.length;

        uint256 low = 0;
        uint256 high = len;

        if (len > 5) {
            uint256 mid = len - Math.sqrt(len);
            if (key < _unsafeAccess(self._checkpoints, mid)._key) {
                high = mid;
            } else {
                low = mid + 1;
            }
        }

        uint256 pos = _upperBinaryLookup(self._checkpoints, key, low, high);

        return pos == 0 ? 0 : _unsafeAccess(self._checkpoints, pos - 1)._value;
    }

    /**
     * @dev Returns the value in the most recent checkpoint, or zero if there are no checkpoints.
     */
    function latest(Trace208 storage self) internal view returns (uint208) {
        uint256 pos = self._checkpoints.length;
        return pos == 0 ? 0 : _unsafeAccess(self._checkpoints, pos - 1)._value;
    }

    /**
     * @dev Returns whether there is a checkpoint in the structure (i.e. it is not empty), and if so the key and value
     * in the most recent checkpoint.
     */
    function latestCheckpoint(Trace208 storage self) internal view returns (bool exists, uint48 _key, uint208 _value) {
        uint256 pos = self._checkpoints.length;
        if (pos == 0) {
            return (false, 0, 0);
        } else {
            Checkpoint208 memory ckpt = _unsafeAccess(self._checkpoints, pos - 1);
            return (true, ckpt._key, ckpt._value);
        }
    }

    /**
     * @dev Returns the number of checkpoint.
     */
    function length(Trace208 storage self) internal view returns (uint256) {
        return self._checkpoints.length;
    }

    /**
     * @dev Returns checkpoint at given position.
     */
    function at(Trace208 storage self, uint32 pos) internal view returns (Checkpoint208 memory) {
        return self._checkpoints[pos];
    }

    /**
     * @dev Pushes a (`key`, `value`) pair into an ordered list of checkpoints, either by inserting a new checkpoint,
     * or by updating the last one.
     */
    function _insert(Checkpoint208[] storage self, uint48 key, uint208 value) private returns (uint208, uint208) {
        uint256 pos = self.length;

        if (pos > 0) {
            // Copying to memory is important here.
            Checkpoint208 memory last = _unsafeAccess(self, pos - 1);

            // Checkpoint keys must be non-decreasing.
            if (last._key > key) {
                revert CheckpointUnorderedInsertion();
            }

            // Update or push new checkpoint
            if (last._key == key) {
                _unsafeAccess(self, pos - 1)._value = value;
            } else {
                self.push(Checkpoint208({_key: key, _value: value}));
            }
            return (last._value, value);
        } else {
            self.push(Checkpoint208({_key: key, _value: value}));
            return (0, value);
        }
    }

    /**
     * @dev Return the index of the last (most recent) checkpoint with key lower or equal than the search key, or `high`
     * if there is none. `low` and `high` define a section where to do the search, with inclusive `low` and exclusive
     * `high`.
     *
     * WARNING: `high` should not be greater than the array's length.
     */
    function _upperBinaryLookup(
        Checkpoint208[] storage self,
        uint48 key,
        uint256 low,
        uint256 high
    ) private view returns (uint256) {
        while (low < high) {
            uint256 mid = Math.average(low, high);
            if (_unsafeAccess(self, mid)._key > key) {
                high = mid;
            } else {
                low = mid + 1;
            }
        }
        return high;
    }

    /**
     * @dev Return the index of the first (oldest) checkpoint with key is greater or equal than the search key, or
     * `high` if there is none. `low` and `high` define a section where to do the search, with inclusive `low` and
     * exclusive `high`.
     *
     * WARNING: `high` should not be greater than the array's length.
     */
    function _lowerBinaryLookup(
        Checkpoint208[] storage self,
        uint48 key,
        uint256 low,
        uint256 high
    ) private view returns (uint256) {
        while (low < high) {
            uint256 mid = Math.average(low, high);
            if (_unsafeAccess(self, mid)._key < key) {
                low = mid + 1;
            } else {
                high = mid;
            }
        }
        return high;
    }

    /**
     * @dev Access an element of the array without performing bounds check. The position is assumed to be within bounds.
     */
    function _unsafeAccess(
        Checkpoint208[] storage self,
        uint256 pos
    ) private pure returns (Checkpoint208 storage result) {
        assembly {
            mstore(0, self.slot)
            result.slot := add(keccak256(0, 0x20), pos)
        }
    }

    struct Trace160 {
        Checkpoint160[] _checkpoints;
    }

    struct Checkpoint160 {
        uint96 _key;
        uint160 _value;
    }

    /**
     * @dev Pushes a (`key`, `value`) pair into a Trace160 so that it is stored as the checkpoint.
     *
     * Returns previous value and new value.
     *
     * IMPORTANT: Never accept `key` as a user input, since an arbitrary `type(uint96).max` key set will disable the
     * library.
     */
    function push(Trace160 storage self, uint96 key, uint160 value) internal returns (uint160, uint160) {
        return _insert(self._checkpoints, key, value);
    }

    /**
     * @dev Returns the value in the first (oldest) checkpoint with key greater or equal than the search key, or zero if
     * there is none.
     */
    function lowerLookup(Trace160 storage self, uint96 key) internal view returns (uint160) {
        uint256 len = self._checkpoints.length;
        uint256 pos = _lowerBinaryLookup(self._checkpoints, key, 0, len);
        return pos == len ? 0 : _unsafeAccess(self._checkpoints, pos)._value;
    }

    /**
     * @dev Returns the value in the last (most recent) checkpoint with key lower or equal than the search key, or zero
     * if there is none.
     */
    function upperLookup(Trace160 storage self, uint96 key) internal view returns (uint160) {
        uint256 len = self._checkpoints.length;
        uint256 pos = _upperBinaryLookup(self._checkpoints, key, 0, len);
        return pos == 0 ? 0 : _unsafeAccess(self._checkpoints, pos - 1)._value;
    }

    /**
     * @dev Returns the value in the last (most recent) checkpoint with key lower or equal than the search key, or zero
     * if there is none.
     *
     * NOTE: This is a variant of {upperLookup} that is optimised to find "recent" checkpoint (checkpoints with high
     * keys).
     */
    function upperLookupRecent(Trace160 storage self, uint96 key) internal view returns (uint160) {
        uint256 len = self._checkpoints.length;

        uint256 low = 0;
        uint256 high = len;

        if (len > 5) {
            uint256 mid = len - Math.sqrt(len);
            if (key < _unsafeAccess(self._checkpoints, mid)._key) {
                high = mid;
            } else {
                low = mid + 1;
            }
        }

        uint256 pos = _upperBinaryLookup(self._checkpoints, key, low, high);

        return pos == 0 ? 0 : _unsafeAccess(self._checkpoints, pos - 1)._value;
    }

    /**
     * @dev Returns the value in the most recent checkpoint, or zero if there are no checkpoints.
     */
    function latest(Trace160 storage self) internal view returns (uint160) {
        uint256 pos = self._checkpoints.length;
        return pos == 0 ? 0 : _unsafeAccess(self._checkpoints, pos - 1)._value;
    }

    /**
     * @dev Returns whether there is a checkpoint in the structure (i.e. it is not empty), and if so the key and value
     * in the most recent checkpoint.
     */
    function latestCheckpoint(Trace160 storage self) internal view returns (bool exists, uint96 _key, uint160 _value) {
        uint256 pos = self._checkpoints.length;
        if (pos == 0) {
            return (false, 0, 0);
        } else {
            Checkpoint160 memory ckpt = _unsafeAccess(self._checkpoints, pos - 1);
            return (true, ckpt._key, ckpt._value);
        }
    }

    /**
     * @dev Returns the number of checkpoint.
     */
    function length(Trace160 storage self) internal view returns (uint256) {
        return self._checkpoints.length;
    }

    /**
     * @dev Returns checkpoint at given position.
     */
    function at(Trace160 storage self, uint32 pos) internal view returns (Checkpoint160 memory) {
        return self._checkpoints[pos];
    }

    /**
     * @dev Pushes a (`key`, `value`) pair into an ordered list of checkpoints, either by inserting a new checkpoint,
     * or by updating the last one.
     */
    function _insert(Checkpoint160[] storage self, uint96 key, uint160 value) private returns (uint160, uint160) {
        uint256 pos = self.length;

        if (pos > 0) {
            // Copying to memory is important here.
            Checkpoint160 memory last = _unsafeAccess(self, pos - 1);

            // Checkpoint keys must be non-decreasing.
            if (last._key > key) {
                revert CheckpointUnorderedInsertion();
            }

            // Update or push new checkpoint
            if (last._key == key) {
                _unsafeAccess(self, pos - 1)._value = value;
            } else {
                self.push(Checkpoint160({_key: key, _value: value}));
            }
            return (last._value, value);
        } else {
            self.push(Checkpoint160({_key: key, _value: value}));
            return (0, value);
        }
    }

    /**
     * @dev Return the index of the last (most recent) checkpoint with key lower or equal than the search key, or `high`
     * if there is none. `low` and `high` define a section where to do the search, with inclusive `low` and exclusive
     * `high`.
     *
     * WARNING: `high` should not be greater than the array's length.
     */
    function _upperBinaryLookup(
        Checkpoint160[] storage self,
        uint96 key,
        uint256 low,
        uint256 high
    ) private view returns (uint256) {
        while (low < high) {
            uint256 mid = Math.average(low, high);
            if (_unsafeAccess(self, mid)._key > key) {
                high = mid;
            } else {
                low = mid + 1;
            }
        }
        return high;
    }

    /**
     * @dev Return the index of the first (oldest) checkpoint with key is greater or equal than the search key, or
     * `high` if there is none. `low` and `high` define a section where to do the search, with inclusive `low` and
     * exclusive `high`.
     *
     * WARNING: `high` should not be greater than the array's length.
     */
    function _lowerBinaryLookup(
        Checkpoint160[] storage self,
        uint96 key,
        uint256 low,
        uint256 high
    ) private view returns (uint256) {
        while (low < high) {
            uint256 mid = Math.average(low, high);
            if (_unsafeAccess(self, mid)._key < key) {
                low = mid + 1;
            } else {
                high = mid;
            }
        }
        return high;
    }

    /**
     * @dev Access an element of the array without performing bounds check. The position is assumed to be within bounds.
     */
    function _unsafeAccess(
        Checkpoint160[] storage self,
        uint256 pos
    ) private pure returns (Checkpoint160 storage result) {
        assembly {
            mstore(0, self.slot)
            result.slot := add(keccak256(0, 0x20), pos)
        }
    }
}

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

pragma solidity ^0.8.20;

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

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

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

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

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

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

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

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

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

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

            return true;
        } else {
            return false;
        }
    }

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

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

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

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

    // Bytes32Set

    struct Bytes32Set {
        Set _inner;
    }

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

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

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

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

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

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

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

        return result;
    }

    // AddressSet

    struct AddressSet {
        Set _inner;
    }

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

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

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

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

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

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

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

        return result;
    }

    // UintSet

    struct UintSet {
        Set _inner;
    }

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

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

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

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

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

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

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

        return result;
    }
}

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

pragma solidity ^0.8.20;

import {Math} from "../math/Math.sol";
import {SafeCast} from "../math/SafeCast.sol";

/**
 * @dev This library provides helpers for manipulating time-related objects.
 *
 * It uses the following types:
 * - `uint48` for timepoints
 * - `uint32` for durations
 *
 * While the library doesn't provide specific types for timepoints and duration, it does provide:
 * - a `Delay` type to represent duration that can be programmed to change value automatically at a given point
 * - additional helper functions
 */
library Time {
    using Time for *;

    /**
     * @dev Get the block timestamp as a Timepoint.
     */
    function timestamp() internal view returns (uint48) {
        return SafeCast.toUint48(block.timestamp);
    }

    /**
     * @dev Get the block number as a Timepoint.
     */
    function blockNumber() internal view returns (uint48) {
        return SafeCast.toUint48(block.number);
    }

    // ==================================================== Delay =====================================================
    /**
     * @dev A `Delay` is a uint32 duration that can be programmed to change value automatically at a given point in the
     * future. The "effect" timepoint describes when the transitions happens from the "old" value to the "new" value.
     * This allows updating the delay applied to some operation while keeping some guarantees.
     *
     * In particular, the {update} function guarantees that if the delay is reduced, the old delay still applies for
     * some time. For example if the delay is currently 7 days to do an upgrade, the admin should not be able to set
     * the delay to 0 and upgrade immediately. If the admin wants to reduce the delay, the old delay (7 days) should
     * still apply for some time.
     *
     *
     * The `Delay` type is 112 bits long, and packs the following:
     *
     * ```
     *   | [uint48]: effect date (timepoint)
     *   |           | [uint32]: value before (duration)
     *   ↓           ↓       ↓ [uint32]: value after (duration)
     * 0xAAAAAAAAAAAABBBBBBBBCCCCCCCC
     * ```
     *
     * NOTE: The {get} and {withUpdate} functions operate using timestamps. Block number based delays are not currently
     * supported.
     */
    type Delay is uint112;

    /**
     * @dev Wrap a duration into a Delay to add the one-step "update in the future" feature
     */
    function toDelay(uint32 duration) internal pure returns (Delay) {
        return Delay.wrap(duration);
    }

    /**
     * @dev Get the value at a given timepoint plus the pending value and effect timepoint if there is a scheduled
     * change after this timepoint. If the effect timepoint is 0, then the pending value should not be considered.
     */
    function _getFullAt(Delay self, uint48 timepoint) private pure returns (uint32, uint32, uint48) {
        (uint32 valueBefore, uint32 valueAfter, uint48 effect) = self.unpack();
        return effect <= timepoint ? (valueAfter, 0, 0) : (valueBefore, valueAfter, effect);
    }

    /**
     * @dev Get the current value plus the pending value and effect timepoint if there is a scheduled change. If the
     * effect timepoint is 0, then the pending value should not be considered.
     */
    function getFull(Delay self) internal view returns (uint32, uint32, uint48) {
        return _getFullAt(self, timestamp());
    }

    /**
     * @dev Get the current value.
     */
    function get(Delay self) internal view returns (uint32) {
        (uint32 delay, , ) = self.getFull();
        return delay;
    }

    /**
     * @dev Update a Delay object so that it takes a new duration after a timepoint that is automatically computed to
     * enforce the old delay at the moment of the update. Returns the updated Delay object and the timestamp when the
     * new delay becomes effective.
     */
    function withUpdate(
        Delay self,
        uint32 newValue,
        uint32 minSetback
    ) internal view returns (Delay updatedDelay, uint48 effect) {
        uint32 value = self.get();
        uint32 setback = uint32(Math.max(minSetback, value > newValue ? value - newValue : 0));
        effect = timestamp() + setback;
        return (pack(value, newValue, effect), effect);
    }

    /**
     * @dev Split a delay into its components: valueBefore, valueAfter and effect (transition timepoint).
     */
    function unpack(Delay self) internal pure returns (uint32 valueBefore, uint32 valueAfter, uint48 effect) {
        uint112 raw = Delay.unwrap(self);

        valueAfter = uint32(raw);
        valueBefore = uint32(raw >> 32);
        effect = uint48(raw >> 64);

        return (valueBefore, valueAfter, effect);
    }

    /**
     * @dev pack the components into a Delay object.
     */
    function pack(uint32 valueBefore, uint32 valueAfter, uint48 effect) internal pure returns (Delay) {
        return Delay.wrap((uint112(effect) << 64) | (uint112(valueBefore) << 32) | uint112(valueAfter));
    }
}

pragma solidity >=0.5.0;

interface IUniswapV2Factory {
    event PairCreated(address indexed token0, address indexed token1, address pair, uint);

    function feeTo() external view returns (address);
    function feeToSetter() external view returns (address);

    function getPair(address tokenA, address tokenB) external view returns (address pair);
    function allPairs(uint) external view returns (address pair);
    function allPairsLength() external view returns (uint);

    function createPair(address tokenA, address tokenB) external returns (address pair);

    function setFeeTo(address) external;
    function setFeeToSetter(address) external;
}

pragma solidity >=0.5.0;

interface IUniswapV2Pair {
    event Approval(address indexed owner, address indexed spender, uint value);
    event Transfer(address indexed from, address indexed to, uint value);

    function name() external pure returns (string memory);
    function symbol() external pure returns (string memory);
    function decimals() external pure returns (uint8);
    function totalSupply() external view returns (uint);
    function balanceOf(address owner) external view returns (uint);
    function allowance(address owner, address spender) external view returns (uint);

    function approve(address spender, uint value) external returns (bool);
    function transfer(address to, uint value) external returns (bool);
    function transferFrom(address from, address to, uint value) external returns (bool);

    function DOMAIN_SEPARATOR() external view returns (bytes32);
    function PERMIT_TYPEHASH() external pure returns (bytes32);
    function nonces(address owner) external view returns (uint);

    function permit(address owner, address spender, uint value, uint deadline, uint8 v, bytes32 r, bytes32 s) external;

    event Mint(address indexed sender, uint amount0, uint amount1);
    event Burn(address indexed sender, uint amount0, uint amount1, address indexed to);
    event Swap(
        address indexed sender,
        uint amount0In,
        uint amount1In,
        uint amount0Out,
        uint amount1Out,
        address indexed to
    );
    event Sync(uint112 reserve0, uint112 reserve1);

    function MINIMUM_LIQUIDITY() external pure returns (uint);
    function factory() external view returns (address);
    function token0() external view returns (address);
    function token1() external view returns (address);
    function getReserves() external view returns (uint112 reserve0, uint112 reserve1, uint32 blockTimestampLast);
    function price0CumulativeLast() external view returns (uint);
    function price1CumulativeLast() external view returns (uint);
    function kLast() external view returns (uint);

    function mint(address to) external returns (uint liquidity);
    function burn(address to) external returns (uint amount0, uint amount1);
    function swap(uint amount0Out, uint amount1Out, address to, bytes calldata data) external;
    function skim(address to) external;
    function sync() external;

    function initialize(address, address) external;
}

pragma solidity >=0.6.2;

interface IUniswapV2Router01 {
    function factory() external pure returns (address);
    function WETH() external pure returns (address);

    function addLiquidity(
        address tokenA,
        address tokenB,
        uint amountADesired,
        uint amountBDesired,
        uint amountAMin,
        uint amountBMin,
        address to,
        uint deadline
    ) external returns (uint amountA, uint amountB, uint liquidity);
    function addLiquidityETH(
        address token,
        uint amountTokenDesired,
        uint amountTokenMin,
        uint amountETHMin,
        address to,
        uint deadline
    ) external payable returns (uint amountToken, uint amountETH, uint liquidity);
    function removeLiquidity(
        address tokenA,
        address tokenB,
        uint liquidity,
        uint amountAMin,
        uint amountBMin,
        address to,
        uint deadline
    ) external returns (uint amountA, uint amountB);
    function removeLiquidityETH(
        address token,
        uint liquidity,
        uint amountTokenMin,
        uint amountETHMin,
        address to,
        uint deadline
    ) external returns (uint amountToken, uint amountETH);
    function removeLiquidityWithPermit(
        address tokenA,
        address tokenB,
        uint liquidity,
        uint amountAMin,
        uint amountBMin,
        address to,
        uint deadline,
        bool approveMax, uint8 v, bytes32 r, bytes32 s
    ) external returns (uint amountA, uint amountB);
    function removeLiquidityETHWithPermit(
        address token,
        uint liquidity,
        uint amountTokenMin,
        uint amountETHMin,
        address to,
        uint deadline,
        bool approveMax, uint8 v, bytes32 r, bytes32 s
    ) external returns (uint amountToken, uint amountETH);
    function swapExactTokensForTokens(
        uint amountIn,
        uint amountOutMin,
        address[] calldata path,
        address to,
        uint deadline
    ) external returns (uint[] memory amounts);
    function swapTokensForExactTokens(
        uint amountOut,
        uint amountInMax,
        address[] calldata path,
        address to,
        uint deadline
    ) external returns (uint[] memory amounts);
    function swapExactETHForTokens(uint amountOutMin, address[] calldata path, address to, uint deadline)
        external
        payable
        returns (uint[] memory amounts);
    function swapTokensForExactETH(uint amountOut, uint amountInMax, address[] calldata path, address to, uint deadline)
        external
        returns (uint[] memory amounts);
    function swapExactTokensForETH(uint amountIn, uint amountOutMin, address[] calldata path, address to, uint deadline)
        external
        returns (uint[] memory amounts);
    function swapETHForExactTokens(uint amountOut, address[] calldata path, address to, uint deadline)
        external
        payable
        returns (uint[] memory amounts);

    function quote(uint amountA, uint reserveA, uint reserveB) external pure returns (uint amountB);
    function getAmountOut(uint amountIn, uint reserveIn, uint reserveOut) external pure returns (uint amountOut);
    function getAmountIn(uint amountOut, uint reserveIn, uint reserveOut) external pure returns (uint amountIn);
    function getAmountsOut(uint amountIn, address[] calldata path) external view returns (uint[] memory amounts);
    function getAmountsIn(uint amountOut, address[] calldata path) external view returns (uint[] memory amounts);
}

pragma solidity >=0.6.2;

import './IUniswapV2Router01.sol';

interface IUniswapV2Router02 is IUniswapV2Router01 {
    function removeLiquidityETHSupportingFeeOnTransferTokens(
        address token,
        uint liquidity,
        uint amountTokenMin,
        uint amountETHMin,
        address to,
        uint deadline
    ) external returns (uint amountETH);
    function removeLiquidityETHWithPermitSupportingFeeOnTransferTokens(
        address token,
        uint liquidity,
        uint amountTokenMin,
        uint amountETHMin,
        address to,
        uint deadline,
        bool approveMax, uint8 v, bytes32 r, bytes32 s
    ) external returns (uint amountETH);

    function swapExactTokensForTokensSupportingFeeOnTransferTokens(
        uint amountIn,
        uint amountOutMin,
        address[] calldata path,
        address to,
        uint deadline
    ) external;
    function swapExactETHForTokensSupportingFeeOnTransferTokens(
        uint amountOutMin,
        address[] calldata path,
        address to,
        uint deadline
    ) external payable;
    function swapExactTokensForETHSupportingFeeOnTransferTokens(
        uint amountIn,
        uint amountOutMin,
        address[] calldata path,
        address to,
        uint deadline
    ) external;
}

// SPDX-License-Identifier: MIT
// Author: A.P
// Organization: Xypher Council
// Development: RareTech | Kibernacia | OCD
// Product: XYPHER
// Version: 1.0.0
// Link: https://linktr.ee/xyphercouncil
pragma solidity >=0.8.23 <0.9.0;

/**
 * @dev Xypher Council Gift Interface
 */
interface IXypherCouncilGift {
    /**
     * @dev Returns the address of the receiver.
     * @return address The address of the receiver.
     */
    function receiver() external view returns (address);
}

// SPDX-License-Identifier: MIT
// Author: A.P
// Organization: Xypher Council
// Development: RareTech | Kibernacia | OCD
// Product: XYPHER
// Version: 1.0.0
// Link: https://linktr.ee/xyphercouncil
pragma solidity >=0.8.23 <0.9.0;

/**
 * @dev Xypher Council Errors
 */
interface XypherCouncilErrors {
    /**
     * @dev Error indicating that the provided UniswapV2Router address is invalid.
     * @param newUniswapV2Router The address of the invalid UniswapV2Router.
     */
    error UniswapV2InvalidRouter(address newUniswapV2Router);

    /**
     * @dev Error indicating that the provided UniswapV2Pair address is invalid.
     * @param newUniswapV2Pair The address of the invalid UniswapV2Pair.
     */
    error UniswapV2InvalidPool(address newUniswapV2Pair);

    /**
     * @dev Error indicating that an operation failed because the provided amount is insufficient.
     */
    error UniswapV2InsufficientAmount();

    /**
     * @dev Error indicating that an operation failed due to insufficient liquidity in the Uniswap V2 pool.
     */
    error UniswapV2InsufficientLiquidity();

    /**
     * @dev Error indicating that a transfer from the zero address is not allowed.
     */
    error TransferFromZeroAddress();

    /**
     * @dev Error indicating that a transfer to the zero address is not allowed.
     */
    error TransferToZeroAddress();

    /**
     * @dev Error indicating that the maximum wallet size has been exceeded.
     */
    error MaxWalletSizeExceeded();

    /**
     * @dev Error indicating that the maximum transaction size has been exceeded.
     */
    error MaxTransactionSizeExceeded();

    /**
     * @dev Error indicating that a withdrawal operation is invalid.
     */
    error WidthdrawInvalid();

    /**
     * @dev Error indicating that an input parameter is invalid.
     * @param index The index or identifier of the invalid input.
     * @param message A message describing the reason for the invalid input.
     */
    error InvalidInput(string index, string message);
}

// SPDX-License-Identifier: MIT
// Author: A.P
// Organization: Xypher Council
// Development: RareTech | Kibernacia | OCD
// Product: XYPHER
// Version: 1.0.0
// Link: https://linktr.ee/xyphercouncil
pragma solidity >=0.8.23 <0.9.0;

/**
 * @dev Xypher Council Events
 */
interface XypherCouncilEvents {
    /**
     * @dev Emitted when an account is excluded or included from tax calculations.
     * @param account The address of the account being excluded or included.
     * @param exclude A boolean flag indicating whether the account is excluded (true) or included (false).
     */
    event Excluded(address indexed account, bool exclude);

    /**
     * @dev Emitted when an account is excluded or included from reflection calculations.
     * @param account The address of the account being excluded or included.
     * @param exclude A boolean flag indicating whether the account is excluded (true) or included (false).
     */
    event ExcludedFromReflection(address indexed account, bool exclude);

    /**
     * @dev Emitted when a factor (e.g., tax factor, max transaction factor, max wallet factor) is modified.
     * @param factor The type of factor being modified.
     * @param oldFactor The old value of the factor before modification.
     * @param newFactor The new value of the factor after modification.
     */
    event FactorModified(
        string indexed factor,
        uint32 oldFactor,
        uint32 newFactor
    );

    /**
     * @dev Emitted when a swap operation occurs (e.g., in the Uniswap decentralized exchange).
     */
    event Swap();

    /**
     * @dev Emitted when a recipient address is taxed.
     * @param receiver The address of the recipient being taxed.
     * @param amount The amount of the tax applied.
     */
    event Taxed(address indexed receiver, uint256 amount);

    /**
     * @dev Emitted when the UniswapV2Router address is modified.
     * @param oldUniswapV2Router The old UniswapV2Router address before modification.
     * @param newUniswapV2Router The new UniswapV2Router address after modification.
     */
    event UniswapV2RouterModified(
        address indexed oldUniswapV2Router,
        address indexed newUniswapV2Router
    );

    /**
     * @dev Emitted when the UniswapV2Pair address is modified.
     * @param oldUniswapV2Pair The old UniswapV2Pair address before modification.
     * @param newUniswapV2Pair The new UniswapV2Pair address after modification.
     */
    event UniswapV2PairModified(
        address indexed oldUniswapV2Pair,
        address indexed newUniswapV2Pair
    );
}

// SPDX-License-Identifier: MIT
// Author: A.P
// Organization: Xypher Council
// Development: RareTech | Kibernacia | OCD
// Product: XYPHER
// Version: 1.0.0
// Link: https://linktr.ee/xyphercouncil
pragma solidity >=0.8.23 <0.9.0;

// OpenZeppelin
import {Context} from "@openzeppelin/contracts/utils/Context.sol";
import {Ownable} from "@openzeppelin/contracts/access/Ownable.sol";

// Uniswap V2
import {IUniswapV2Pair} from "@uniswap/v2-core/contracts/interfaces/IUniswapV2Pair.sol";
import {IUniswapV2Router02} from "@uniswap/v2-periphery/contracts/interfaces/IUniswapV2Router02.sol";

// Xypher Council
import {XypherCouncilEvents} from "./XypherCouncilEvents.sol";
import {XypherCouncilErrors} from "./XypherCouncilErrors.sol";

/**
 * @dev Xypher Council Pool
 */
abstract contract XypherCouncilPool is
    Context,
    Ownable,
    XypherCouncilEvents,
    XypherCouncilErrors
{
    /// @notice Stores Uniswap V2 router interface.
    /// @dev Stores IUniswapV2Router02 interface.
    IUniswapV2Router02 public uniswapV2Router;

    /// @notice Stores Uniswap V2 pair address.
    /// @dev Stores address.
    address public uniswapV2Pair;

    /**
     * @dev Sets the Uniswap V2 router.
     * @param newUniswapV2Router Address of the new Uniswap V2 router.
     * @notice Can only be called by the owner. Reverts if the address is invalid.
     */
    function setUniswapV2Router(address newUniswapV2Router) external onlyOwner {
        // Verification
        if (newUniswapV2Router == address(0)) {
            revert UniswapV2InvalidRouter(address(0));
        }

        // Parameter
        address oldUniswapV2Router = address(uniswapV2Router);

        // Configuration
        uniswapV2Router = IUniswapV2Router02(newUniswapV2Router);

        // Event
        emit UniswapV2RouterModified(oldUniswapV2Router, newUniswapV2Router);
    }

    /**
     * @dev Sets the Uniswap V2 pair.
     * @param newUniswapV2Pair Address of the new Uniswap V2 pair.
     * @notice Can only be called by the owner. Reverts if the address is invalid.
     */
    function setUniswapV2Pair(address newUniswapV2Pair) external onlyOwner {
        // Verification
        if (newUniswapV2Pair == address(0)) {
            revert UniswapV2InvalidPool(address(0));
        }

        // Parameter
        address oldUniswapV2Pair = uniswapV2Pair;

        // Configuration
        uniswapV2Pair = newUniswapV2Pair;

        // Event
        emit UniswapV2PairModified(oldUniswapV2Pair, uniswapV2Pair);
    }

    /**
     * @dev Retrieves reserves from the Uniswap V2 pair.
     * @return _reserve0 Reserve of the first token.
     * @return _reserve1 Reserve of the second token.
     * @return _blockTimestampLast Last update timestamp.
     */
    function getReserves()
        public
        view
        returns (uint _reserve0, uint _reserve1, uint32 _blockTimestampLast)
    {
        // Parameter
        IUniswapV2Pair iPair = IUniswapV2Pair(uniswapV2Pair);

        return iPair.getReserves();
    }

    /**
     * @dev Calculates the equivalent ETH for a given token amount.
     * @param amountToken Token amount.
     * @return amountETH Equivalent ETH amount.
     */
    function quote(uint amountToken) internal view returns (uint amountETH) {
        // Get the reserves from the liquidity pool
        (uint reserveA, uint reserveB, ) = getReserves();

        if (amountToken <= 0) revert UniswapV2InsufficientAmount();
        if (reserveA <= 0 || reserveB <= 0) {
            revert UniswapV2InsufficientLiquidity();
        }

        // Parameter
        IUniswapV2Pair iPair = IUniswapV2Pair(uniswapV2Pair);

        if (address(this) == iPair.token0()) {
            // Calculate the equivalent amount of ETH based on the reserves and the amount of tokens
            amountETH = (amountToken * reserveB) / reserveA;
        } else {
            // Calculate the equivalent amount of ETH based on the reserves and the amount of tokens
            amountETH = (amountToken * reserveA) / reserveB;
        }
    }

    /**
     * @dev Allows the owner to withdraw the contract's balance.
     * @notice Transfers the full balance to the owner. Reverts if the transfer fails.
     */
    function withdraw() external onlyOwner {
        // Withdraw
        (bool success, ) = msg.sender.call{value: address(this).balance}("");

        // Verification
        if (!success) {
            revert WidthdrawInvalid();
        }
    }
}

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

• No Contract Security Audit Submitted- Submit Audit Here

[{"inputs":[{"internalType":"uint256","name":"initialSupply","type":"uint256"},{"internalType":"address","name":"initialInterface","type":"address"}],"stateMutability":"nonpayable","type":"constructor"},{"inputs":[],"name":"CheckpointUnorderedInsertion","type":"error"},{"inputs":[],"name":"ECDSAInvalidSignature","type":"error"},{"inputs":[{"internalType":"uint256","name":"length","type":"uint256"}],"name":"ECDSAInvalidSignatureLength","type":"error"},{"inputs":[{"internalType":"bytes32","name":"s","type":"bytes32"}],"name":"ECDSAInvalidSignatureS","type":"error"},{"inputs":[{"internalType":"uint256","name":"increasedSupply","type":"uint256"},{"internalType":"uint256","name":"cap","type":"uint256"}],"name":"ERC20ExceededSafeSupply","type":"error"},{"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":[{"internalType":"uint256","name":"timepoint","type":"uint256"},{"internalType":"uint48","name":"clock","type":"uint48"}],"name":"ERC5805FutureLookup","type":"error"},{"inputs":[],"name":"ERC6372InconsistentClock","type":"error"},{"inputs":[{"internalType":"address","name":"account","type":"address"},{"internalType":"uint256","name":"currentNonce","type":"uint256"}],"name":"InvalidAccountNonce","type":"error"},{"inputs":[{"internalType":"string","name":"index","type":"string"},{"internalType":"string","name":"message","type":"string"}],"name":"InvalidInput","type":"error"},{"inputs":[],"name":"InvalidShortString","type":"error"},{"inputs":[],"name":"MathOverflowedMulDiv","type":"error"},{"inputs":[],"name":"MaxTransactionSizeExceeded","type":"error"},{"inputs":[],"name":"MaxWalletSizeExceeded","type":"error"},{"inputs":[{"internalType":"address","name":"owner","type":"address"}],"name":"OwnableInvalidOwner","type":"error"},{"inputs":[{"internalType":"address","name":"account","type":"address"}],"name":"OwnableUnauthorizedAccount","type":"error"},{"inputs":[{"internalType":"uint8","name":"bits","type":"uint8"},{"internalType":"uint256","name":"value","type":"uint256"}],"name":"SafeCastOverflowedUintDowncast","type":"error"},{"inputs":[{"internalType":"string","name":"str","type":"string"}],"name":"StringTooLong","type":"error"},{"inputs":[],"name":"TransferFromZeroAddress","type":"error"},{"inputs":[],"name":"TransferToZeroAddress","type":"error"},{"inputs":[],"name":"UniswapV2InsufficientAmount","type":"error"},{"inputs":[],"name":"UniswapV2InsufficientLiquidity","type":"error"},{"inputs":[{"internalType":"address","name":"newUniswapV2Pair","type":"address"}],"name":"UniswapV2InvalidPool","type":"error"},{"inputs":[{"internalType":"address","name":"newUniswapV2Router","type":"address"}],"name":"UniswapV2InvalidRouter","type":"error"},{"inputs":[{"internalType":"uint256","name":"expiry","type":"uint256"}],"name":"VotesExpiredSignature","type":"error"},{"inputs":[],"name":"WidthdrawInvalid","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":"address","name":"delegator","type":"address"},{"indexed":true,"internalType":"address","name":"fromDelegate","type":"address"},{"indexed":true,"internalType":"address","name":"toDelegate","type":"address"}],"name":"DelegateChanged","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"delegate","type":"address"},{"indexed":false,"internalType":"uint256","name":"previousVotes","type":"uint256"},{"indexed":false,"internalType":"uint256","name":"newVotes","type":"uint256"}],"name":"DelegateVotesChanged","type":"event"},{"anonymous":false,"inputs":[],"name":"EIP712DomainChanged","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"account","type":"address"},{"indexed":false,"internalType":"bool","name":"exclude","type":"bool"}],"name":"Excluded","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"account","type":"address"},{"indexed":false,"internalType":"bool","name":"exclude","type":"bool"}],"name":"ExcludedFromReflection","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"string","name":"factor","type":"string"},{"indexed":false,"internalType":"uint32","name":"oldFactor","type":"uint32"},{"indexed":false,"internalType":"uint32","name":"newFactor","type":"uint32"}],"name":"FactorModified","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"previousOwner","type":"address"},{"indexed":true,"internalType":"address","name":"newOwner","type":"address"}],"name":"OwnershipTransferred","type":"event"},{"anonymous":false,"inputs":[],"name":"Swap","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"receiver","type":"address"},{"indexed":false,"internalType":"uint256","name":"amount","type":"uint256"}],"name":"Taxed","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"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"oldUniswapV2Pair","type":"address"},{"indexed":true,"internalType":"address","name":"newUniswapV2Pair","type":"address"}],"name":"UniswapV2PairModified","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"oldUniswapV2Router","type":"address"},{"indexed":true,"internalType":"address","name":"newUniswapV2Router","type":"address"}],"name":"UniswapV2RouterModified","type":"event"},{"stateMutability":"payable","type":"fallback"},{"inputs":[],"name":"CLOCK_MODE","outputs":[{"internalType":"string","name":"","type":"string"}],"stateMutability":"view","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":"uint256","name":"amount","type":"uint256"}],"name":"applyRate","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"amount","type":"uint256"}],"name":"applyReverseRate","outputs":[{"internalType":"uint256","name":"amountBalance","type":"uint256"},{"internalType":"uint256","name":"amountReflection","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":[],"name":"balanceOfHolders","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"buyTax","outputs":[{"internalType":"uint32","name":"","type":"uint32"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"prevBalance","type":"uint256"},{"internalType":"uint256","name":"balance","type":"uint256"},{"internalType":"uint256","name":"value","type":"uint256"}],"name":"calculateBalanceDeduction","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"amount","type":"uint256"},{"internalType":"uint32","name":"tax","type":"uint32"}],"name":"calculateTax","outputs":[{"internalType":"uint256","name":"amountAfterTax","type":"uint256"},{"internalType":"uint256","name":"taxedAmount","type":"uint256"}],"stateMutability":"pure","type":"function"},{"inputs":[{"internalType":"address","name":"account","type":"address"},{"internalType":"uint32","name":"pos","type":"uint32"}],"name":"checkpoints","outputs":[{"components":[{"internalType":"uint48","name":"_key","type":"uint48"},{"internalType":"uint208","name":"_value","type":"uint208"}],"internalType":"struct Checkpoints.Checkpoint208","name":"","type":"tuple"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"clock","outputs":[{"internalType":"uint48","name":"","type":"uint48"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"daoFee","outputs":[{"internalType":"uint32","name":"","type":"uint32"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"decimals","outputs":[{"internalType":"uint8","name":"","type":"uint8"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"delegatee","type":"address"}],"name":"delegate","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"delegatee","type":"address"},{"internalType":"uint256","name":"nonce","type":"uint256"},{"internalType":"uint256","name":"expiry","type":"uint256"},{"internalType":"uint8","name":"v","type":"uint8"},{"internalType":"bytes32","name":"r","type":"bytes32"},{"internalType":"bytes32","name":"s","type":"bytes32"}],"name":"delegateBySig","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"account","type":"address"}],"name":"delegates","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"eip712Domain","outputs":[{"internalType":"bytes1","name":"fields","type":"bytes1"},{"internalType":"string","name":"name","type":"string"},{"internalType":"string","name":"version","type":"string"},{"internalType":"uint256","name":"chainId","type":"uint256"},{"internalType":"address","name":"verifyingContract","type":"address"},{"internalType":"bytes32","name":"salt","type":"bytes32"},{"internalType":"uint256[]","name":"extensions","type":"uint256[]"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"timepoint","type":"uint256"}],"name":"getPastTotalSupply","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"account","type":"address"},{"internalType":"uint256","name":"timepoint","type":"uint256"}],"name":"getPastVotes","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"getReserves","outputs":[{"internalType":"uint256","name":"_reserve0","type":"uint256"},{"internalType":"uint256","name":"_reserve1","type":"uint256"},{"internalType":"uint32","name":"_blockTimestampLast","type":"uint32"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"account","type":"address"}],"name":"getVotes","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"gift","outputs":[{"internalType":"contract IXypherCouncilGift","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"","type":"address"}],"name":"isExcluded","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"","type":"address"}],"name":"isExcludedFromReflection","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"maxTransactionSize","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"maxWalletSize","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"name","outputs":[{"internalType":"string","name":"","type":"string"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"owner","type":"address"}],"name":"nonces","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"account","type":"address"}],"name":"numCheckpoints","outputs":[{"internalType":"uint32","name":"","type":"uint32"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"owner","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"renounceOwnership","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"sellTax","outputs":[{"internalType":"uint32","name":"","type":"uint32"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"account","type":"address"},{"internalType":"bool","name":"exclude","type":"bool"}],"name":"setExclude","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"account","type":"address"},{"internalType":"bool","name":"exclude","type":"bool"}],"name":"setExcludeFromReflection","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint32","name":"newFactor","type":"uint32"}],"name":"setMaxTransactionFactor","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint32","name":"newFactor","type":"uint32"}],"name":"setMaxWalletFactor","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"newUniswapV2Pair","type":"address"}],"name":"setUniswapV2Pair","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"newUniswapV2Router","type":"address"}],"name":"setUniswapV2Router","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"swap","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"symbol","outputs":[{"internalType":"string","name":"","type":"string"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"totalReflectionSupply","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"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":"newOwner","type":"address"}],"name":"transferOwnership","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"uniswapV2Pair","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"uniswapV2Router","outputs":[{"internalType":"contract IUniswapV2Router02","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"withdraw","outputs":[],"stateMutability":"nonpayable","type":"function"},{"stateMutability":"payable","type":"receive"}]

610160806040523462000093576040620052a580380380916200002282620000ae565b84391262000093576200004190516200003a6200012b565b90620001e0565b604051613ce2908162001583823960805181613466015260a05181613521015260c05181613437015260e051816134b5015261010051816134db015261012051816110600152610140518161108a0152f35b600080fd5b634e487b7160e01b600052604160045260246000fd5b601f01601f1916610160908101906001600160401b03821190821017620000d457604052565b62000098565b604081019081106001600160401b03821117620000d457604052565b601f909101601f19168101906001600160401b03821190821017620000d457604052565b604051906200012982620000da565b565b61018051906001600160a01b03821682036200009357565b604051906200015282620000da565b60068252652c2ca82422a960d11b6020830152565b604051906200017682620000da565b6002825261584360f01b6020830152565b604051906200019682620000da565b600e82526d161e5c1a195c8810dbdd5b98da5b60921b6020830152565b908160209103126200009357516001600160a01b0381168103620000935790565b6040513d6000823e3d90fd5b6200024f906200021a620001f362000143565b620001fd62000167565b6200020762000187565b906200021262000143565b92336200056a565b600d8054600160a01b600160e01b0319167864000000640000000000000000000000000000000000000000179055336200098c565b600c80546001600160a01b031916737a250d5630b4cf539739df2c5dacb4c659f2488d179055600c5462000293906001600160a01b03165b6001600160a01b031690565b60405163c45a015560e01b8152909160208083600481875afa9283156200051e5760009362000546575b506040516315ab88c960e31b81526001600160a01b03948290829060049082905afa9081156200051e57859483926200032e9260009162000524575b506040516364e329cb60e11b81523060048201526001600160a01b039091166024820152968792839160009183906044820190565b0393165af180156200051e5762000393946200037192600092620004ea575b5050600d80546001600160a01b0319166001600160a01b0392909216919091179055565b60128054919092166001600160a01b03166001600160a01b0319909116179055565b336000908152600e60205260409020620003b5905b805460ff19166001179055565b306000908152600e60205260409020620003cf90620003a8565b600c546200040a90620003a890620003f0906001600160a01b031662000287565b6001600160a01b03166000908152600e6020526040902090565b336000908152600f602052604090206200042490620003a8565b306000908152600f602052604090206200043e90620003a8565b600c546200047990620003a8906200045f906001600160a01b031662000287565b6001600160a01b03166000908152600f6020526040902090565b600d546200049590620003a8906001600160a01b03166200045f565b620004a03362000d42565b50620004ac3062000d42565b50600c54620004cf90620004c9906001600160a01b031662000287565b62000a5c565b50600d54620004e7906001600160a01b031662000a5c565b50565b6200050e9250803d1062000516575b620005058183620000f6565b810190620001b3565b38806200034d565b503d620004f9565b620001d4565b6200053f9150843d86116200051657620005058183620000f6565b38620002f9565b81620005629294503d85116200051657620005058183620000f6565b9138620002bd565b8351909492939192916001600160401b038211620000d4576200059a8262000594600354620006f5565b62000732565b602090601f831160011462000665579180620005d492620005dd959460009262000659575b50508160011b916000199060031b1c19161790565b6003556200089e565b620005e88162000abc565b61012052620005f78262000bc9565b610140526020815191012060e05260208151910120610100524660a0526200061e62000cd6565b6080523060c0526001600160a01b038116156200064057620001299062000a73565b604051631e4fbdf760e01b815260006004820152602490fd5b015190503880620005bf565b6003600052601f19831691907fc2575a0e9e593c00f959f8c92f12db2869c3395a3b0502d05e2516446f71f85b9260005b818110620006dc5750916001939185620005dd97969410620006c2575b505050811b016003556200089e565b015160001960f88460031b161c19169055388080620006b3565b9293602060018192878601518155019501930162000696565b90600182811c9216801562000727575b60208310146200071157565b634e487b7160e01b600052602260045260246000fd5b91607f169162000705565b601f81116200073f575050565b60009060036000526020600020906020601f850160051c8301941062000782575b601f0160051c01915b8281106200077657505050565b81815560010162000769565b909250829062000760565b601f81116200079a575050565b60009060046000526020600020906020601f850160051c83019410620007dd575b601f0160051c01915b828110620007d157505050565b818155600101620007c4565b9092508290620007bb565b601f8111620007f5575050565b60009060056000526020600020906020601f850160051c8301941062000838575b601f0160051c01915b8281106200082c57505050565b8181556001016200081f565b909250829062000816565b601f811162000850575050565b60009060066000526020600020906020601f850160051c8301941062000893575b601f0160051c01915b8281106200088757505050565b8181556001016200087a565b909250829062000871565b80519091906001600160401b038111620000d457620008ca81620008c4600454620006f5565b6200078d565b602080601f83116001146200090457508190620008ff9394600092620006595750508160011b916000199060031b1c19161790565b600455565b6004600052601f198316949091907f8a35acfbc15ff81a39ae7d344fd709f28e8600b4aa8c65c6b64bfe7fe36bd19b926000905b8782106200097357505083600195961062000959575b505050811b01600455565b015160001960f88460031b161c191690553880806200094e565b8060018596829496860151815501950193019062000938565b91906001600160a01b038316801562000a435760025482810180911162000a3d576002556001600160a01b038416600090815260208181526040808320805486019055518481527fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef9190a3600254926001600160d01b03841162000a17576200012992935062000e85565b604051630e58ae9360e11b8152600481018590526001600160d01b036024820152604490fd5b62000e6f565b60405163ec442f0560e01b815260006004820152602490fd5b62000a70906001600160a01b031662000d42565b90565b600b80546001600160a01b039283166001600160a01b0319821681179092559091167f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e0600080a3565b908151602080821060001462000ada5750509062000a709062000df2565b6001600160401b038211620000d45762000b018262000afb600554620006f5565b620007e8565b602090601f831160011462000b3e5750819062000b369394600092620006595750508160011b916000199060031b1c19161790565b60055560ff90565b6005600052601f198316949091907f036b6384b5eca791c62761152d0c79bb0604c104a5fb6f4eb0703f3154bb3db0926000905b87821062000bb057505083600195961062000b96575b505050811b0160055560ff90565b015160001960f88460031b161c1916905538808062000b88565b8060018596829496860151815501950193019062000b72565b908151602080821060001462000be75750509062000a709062000df2565b6001600160401b038211620000d45762000c0e8262000c08600654620006f5565b62000843565b602090601f831160011462000c4b5750819062000c439394600092620006595750508160011b916000199060031b1c19161790565b60065560ff90565b6006600052601f198316949091907ff652222313e28459528d920b65115c16c04f3efc82aaedc97be59f3f377c0d3f926000905b87821062000cbd57505083600195961062000ca3575b505050811b0160065560ff90565b015160001960f88460031b161c1916905538808062000c95565b8060018596829496860151815501950193019062000c7f565b60e051610100516040519060208201927f8b73c3c69bb8fe3d512ecc4cf759cc79239f7b179b0ffacaa9a75d522b39400f8452604083015260608201524660808201523060a082015260a0815260c0810181811060018060401b03821117620000d45760405251902090565b60008181526011602052604081205462000dc95760105468010000000000000000811015620000d457600181018060105581101562000db5577f1b6847dc741a1b0cd08d278845f9d819d87b734759afb55fe2de5cb82a9ae6720182905560105491815260116020526040902055600190565b634e487b7160e01b82526032600452602482fd5b905090565b60208151910151906020811062000de3575090565b6000199060200360031b1b1690565b601f81511162000e0d5762000e078162000dce565b90511790565b6040519063305a27a960e01b82528160208060048301528251908160248401526000935b82851062000e55575050604492506000838284010152601f80199101168101030190fd5b848101820151868601604401529381019385935062000e31565b634e487b7160e01b600052601160045260246000fd5b9062000e918162000f8c565b9165ffffffffffff80431162000f6d57600a548062000f39575062000eca9062000ec1620001299560006200154e565b90431662001310565b50506001600160a01b0390811690811562000f1c575b60086020527f5eff886ea0ce6ca488a3d6e336d6c0f75f46d19b42c06ce5ee98e42c96d256c75460009283526040909220548116911662001089565b62000f3162000f2b8462000f8c565b62000fc0565b505062000ee0565b9060001991808381011162000a3d57620001299562000eca9362000ec192600a600052602060002001015460301c6200154e565b6040516306dfcc6560e41b815260306004820152436024820152604490fd5b6001600160d01b039081811162000fa1571690565b604490604051906306dfcc6560e41b825260d060048301526024820152fd5b65ffffffffffff80431162000f6d57600a548062000fee575062000ec162000fea92600062001568565b9091565b60001992818481011162000a3d57600a600052920160008051602062005265833981519152015462000fea9262000ec19160301c62001568565b65ffffffffffff9081431162000f6d578054806200105c57506200105262000fea9360006200154e565b9143169062001453565b60001993818581011162000a3d5762000fea94620010529284600052602060002001015460301c6200154e565b6001600160a01b03808316939291908116908185141580620011f1575b620010b3575b5050505050565b816200112f575b505082620010cb575b8080620010ac565b6001600160a01b0316600090815260096020526040902060008051602062005285833981519152916200110b9162001104909162000f8c565b9062001028565b604080516001600160d01b039384168152919092166020820152a2388080620010c3565b6001600160a01b03166000908152600960205260409020620011518462000f8c565b9065ffffffffffff9081431162000f6d57805480620011b15750906200118e91620010526000805160206200528583398151915294600062001568565b604080516001600160d01b039384168152919092166020820152a23880620010ba565b919060001992808481011162000a3d5760008051602062005285833981519152946200118e94620010529284600052602060002001015460301c62001568565b50831515620010a6565b60001981019190821162000a3d57565b600a549068010000000000000000821015620000d4576001820180600a558210156200126d57600a60005280516020919091015160301b65ffffffffffff191665ffffffffffff91909116176000805160206200526583398151915290910155565b634e487b7160e01b600052603260045260246000fd5b90815468010000000000000000811015620000d457600181018084558110156200126d5760009283526020928390208251929093015160301b65ffffffffffff191665ffffffffffff9290921691909117910155565b604080519192919081016001600160401b03811182821017620000d457604052915465ffffffffffff8116835260301c6020830152565b600a549192919081156200142457620013506200134a6200133184620011fb565b600a600052600080516020620052658339815191520190565b620012d9565b805165ffffffffffff8381169491168410620014125785602093620013d0956200138f62001384865165ffffffffffff1690565b65ffffffffffff1690565b03620013d45750620013a962001331620013c293620011fb565b9065ffffffffffff82549181199060301b169116179055565b01516001600160d01b031690565b9190565b90506200140c9150620013f8620013ea6200011a565b65ffffffffffff9092168252565b6001600160d01b038716818501526200120b565b620013c2565b604051632520601d60e01b8152600490fd5b6200144d915062001438620013ea6200011a565b6001600160d01b03841660208201526200120b565b60009190565b8054929392919082156200152557620014816200134a6200147485620011fb565b8360005260206000200190565b9062001493825165ffffffffffff1690565b65ffffffffffff848116911681106200141257620013d0946020948892620014c562001384875165ffffffffffff1690565b03620014ed5750620013c292620014e0620013a992620011fb565b9060005260206000200190565b9150506200140c9162001511620015036200011a565b65ffffffffffff9093168352565b6001600160d01b0388168286015262001283565b6200144d925062001539620015036200011a565b6001600160d01b038516602083015262001283565b6001600160d01b039182169082160190811162000a3d5790565b6001600160d01b039182169082160390811162000a3d579056fe60806040526004361015610018575b361561001657005b005b60003560e01c806306fdde03146103235780630902f1ac1461031e578063095ea7b3146103195780631419841d146103145780631694505e1461030f57806318160ddd1461030a57806323b872dd1461030557806324b049051461030057806328b13b61146102fb5780632957b839146102f657806330014a58146102f1578063313ce567146102ec57806335a2f3cb146102e75780633a46b1a8146102e25780633ccfd60b146102dd578063498cf1b5146102d857806349bd5a5e146102d35780634bf5d7e9146102ce5780634f7041a514610256578063587cde1e146102c95780635c19a95c146102c4578063679e24b2146102bf5780636b34f554146102ba5780636fcfff45146102b557806370a08231146102b0578063715018a6146102ab5780637d459db3146102a65780637ecebe00146102a15780638119c0651461029c57806384b0196e146102975780638da5cb5b146102925780638e539e8c1461028d5780638f3fa8601461028857806391ddadf41461028357806395d89b411461027e578063961d3cd3146102795780639ab24eb014610274578063a29a60891461026f578063a9059cbb1461026a578063bdc7576214610265578063c3cda52014610260578063cba0e9961461025b578063cc1776d314610256578063d4f4671614610251578063d98507421461024c578063dd62ed3e14610247578063e629e43c14610242578063f1127ed81461023d5763f2fde38b0361000e57611ac4565b611a34565b611a19565b6119b4565b611990565b6117f4565b610b75565b6117b1565b6116b2565b61168a565b6114e5565b611442565b6113f4565b61138d565b6112e5565b6112b9565b61129e565b611183565b61115c565b611045565b610feb565b610fad565b610f6a565b610f0e565b610ee7565b610e7b565b610cbf565b610c1f565b610bd1565b610b91565b610acb565b610aa4565b610a7d565b6109e7565b610928565b61090a565b6108ee565b6108c0565b6108a4565b610881565b61085a565b610682565b610664565b61063d565b6105b3565b61057e565b610475565b61038c565b600091031261033357565b600080fd5b919082519283825260005b848110610364575050826000602080949584010152601f8019910116010190565b602081830181015184830182015201610343565b906020610389928181520190610338565b90565b3461033357600080600319360112610472576040519080600354906103b082611b7d565b8085529160209160019182811690811561044557506001146103ed575b6103e9866103dd81880382611c35565b60405191829182610378565b0390f35b9350600384527fc2575a0e9e593c00f959f8c92f12db2869c3395a3b0502d05e2516446f71f85b5b838510610432575050505081016020016103dd826103e9386103cd565b8054868601840152938201938101610415565b90508695506103e9969350602092506103dd94915060ff191682840152151560051b8201019293386103cd565b80fd5b34610333576000806003193601126104725760049060606001600160a01b03600d5416604051938480927f0902f1ac0000000000000000000000000000000000000000000000000000000082525afa8015610568578192828092610509575b5050604080516dffffffffffffffffffffffffffff948516815292909316602083015263ffffffff1691810191909152606090f35b92509250506060823d606011610560575b8161052760609383611c35565b81010312610472575061053981611c57565b6103e9604061054a60208501611c57565b9301519161055783610cb1565b929190386104d4565b3d915061051a565b611c72565b6001600160a01b0381160361033357565b34610333576040366003190112610333576105a860043561059e8161056d565b6024359033612bbd565b602060405160018152f35b34610333576020366003190112610333576004356105d08161056d565b6105d8612152565b6001600160a01b0380911690811561062557600c54826001600160a01b0319821617600c55167ffa4937d0799f87945796348ce98077a83f6a274d6a88335536792683985cd325600080a3005b6024604051637eff088160e01b815260006004820152fd5b346103335760003660031901126103335760206001600160a01b03600c5416604051908152f35b34610333576000366003190112610333576020600254604051908152f35b346103335760603660031901126103335760043561069f8161056d565b602435906106ac8261056d565b604435906001600160a01b03808216801561084957818516908115610838576106f96106f56106ee866001600160a01b0316600052600e602052604060002090565b5460ff1690565b1590565b8061080f575b6107ba575b506107286106f56106ee876001600160a01b0316600052600e602052604060002090565b91826107a2575b5050610756575b906103e99261074492611ca8565b60405190151581529081906020820190565b9061077e81610778856001600160a01b03166000526000602052604060002090565b54611c9b565b610786611eca565b106107915790610736565b600460405163d873da4960e01b8152fd5b600d54166001600160a01b031614159050388061072f565b6107ce83600d54166001600160a01b031690565b809114908115610805575b506107e5575b38610704565b6107ed611d8f565b8411156107df576004604051633f59fe5760e11b8152fd5b90508114386107d9565b506108336106f56106ee886001600160a01b0316600052600e602052604060002090565b6106ff565b6004604051633a954ecd60e21b8152fd5b6004604051630b07e54560e11b8152fd5b346103335760003660031901126103335760206001600160a01b0360125416604051908152f35b3461033357600036600319011261033357602061089c611d8f565b604051908152f35b34610333576000366003190112610333576020604051603c8152f35b34610333576020366003190112610333576108dc600435611dc3565b60408051928352602083019190915290f35b3461033357600036600319011261033357602060405160128152f35b3461033357602036600319011261033357602061089c600435611e2c565b34610333576040366003190112610333576004356109458161056d565b602435610951436125fb565b65ffffffffffff81168210156109a7576103e96001600160d01b03610996846001600160a01b03871660005260096020526109906040600020916125fb565b9061262d565b604051911681529081906020820190565b6040517fecd3f81e000000000000000000000000000000000000000000000000000000008152600481019290925265ffffffffffff166024820152604490fd5b346103335760008060031936011261047257610a01612152565b8080808047335af13d15610a78573d67ffffffffffffffff8111610a735760405190610a37601f8201601f191660200183611c35565b81528260203d92013e5b15610a495780f35b60046040517fbaa89171000000000000000000000000000000000000000000000000000000008152fd5b611bb7565b610a41565b3461033357600036600319011261033357602061089c6001600160a01b03600b5416611e86565b346103335760003660031901126103335760206001600160a01b03600d5416604051908152f35b3461033357600036600319011261033357610ae5436125fb565b65ffffffffffff80610af6436125fb565b16911603610b4b576103e9604051610b0d81611bcd565b601d81527f6d6f64653d626c6f636b6e756d6265722666726f6d3d64656661756c740000006020820152604051918291602083526020830190610338565b60046040517f6ff07140000000000000000000000000000000000000000000000000000000008152fd5b3461033357600036600319011261033357602060405160058152f35b34610333576020366003190112610333576020600435610bb08161056d565b6001600160a01b038091166000526008825260406000205416604051908152f35b3461033357602036600319011261033357610016600435610bf18161056d565b3361270c565b604090600319011261033357600435610c0f8161056d565b9060243580151581036103335790565b34610333576001600160a01b037ff7a1dd9a5b563d36be3ee3e8945a2312ede7793907c0a20c3b3ef393dd4652876020610c5836610bf7565b9390610c62612152565b169283600052600f8252610c868160406000209060ff801983541691151516179055565b8015610ca257610c95846131de565b505b6040519015158152a2005b610cab84613133565b50610c97565b63ffffffff81160361033357565b3461033357602036600319011261033357600435610cdc81610cb1565b610ce4612152565b60025463ffffffff821611610ddc57600d547f97d4140ef4441bb58ac55974ae7dbbd537f34a138c046ce2c064f37c02d916279060c01c63ffffffff1691610d74817fffffffff00000000ffffffffffffffffffffffffffffffffffffffffffffffff7bffffffff000000000000000000000000000000000000000000000000600d549260c01b16911617600d55565b610dc07f4d6178205472616e73616374696f6e20466163746f7200000000000000000000604051527f770b4fa5f5e16b8257498bdfed61327d77bfb5919c4bfa5b177e247d44c1002c90565b6040805163ffffffff95861681529290941660208301529290a2005b60e460405163674604c960e11b815260406004820152601660448201527f4d6178207472616e73616374696f6e20666163746f7200000000000000000000606482015260806024820152603160848201527f4d6178207472616e73616374696f6e20666163746f722063616e6e6f7420657860a48201527f6365656420746f74616c20737570706c7900000000000000000000000000000060c4820152fd5b34610333576020366003190112610333576001600160a01b03600435610ea08161056d565b16600052600960205260406000205463ffffffff90818111610ec85760209160405191168152f35b604490604051906306dfcc6560e41b8252602060048301526024820152fd5b3461033357602036600319011261033357602061089c600435610f098161056d565b611e86565b346103335760008060031936011261047257610f28612152565b806001600160a01b03600b546001600160a01b03198116600b55167f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e08280a380f35b34610333576020366003190112610333576001600160a01b03600435610f8f8161056d565b16600052600f602052602060ff604060002054166040519015158152f35b34610333576020366003190112610333576001600160a01b03600435610fd28161056d565b1660005260076020526020604060002054604051908152f35b346103335760008060031936011261047257611005612152565b61101661101130611e86565b612862565b61101e6129d1565b7f3ebfdaaf4031bec9a2b7b0a1c594d2d03f3d0b8d68531c9164c2829bac00fefa8180a180f35b3461033357600080600319360112610472576110ff906110847f0000000000000000000000000000000000000000000000000000000000000000613254565b906110ae7f000000000000000000000000000000000000000000000000000000000000000061336d565b90604051916110bc83611bfd565b81835261110d6020916040519687967f0f00000000000000000000000000000000000000000000000000000000000000885260e0602089015260e0880190610338565b908682036040880152610338565b904660608601523060808601528260a086015284820360c0860152602080855193848152019401925b82811061114557505050500390f35b835185528695509381019392810192600101611136565b346103335760003660031901126103335760206001600160a01b03600b5416604051908152f35b34610333576020366003190112610333576004356111a0436125fb565b9065ffffffffffff918281168210156109a757506111bd906125fb565b600a54906000908260058111611230575b506111d99350612eb1565b806111f55750602060005b6001600160d01b0360405191168152f35b611200602091611da7565b600a6000527fc65a7bb8d6351c1cf70c95a316cc6a92839c986682d98bc35f958f4883f9d2a8015460301c6111e4565b909261123b82612d77565b8203918211611299576111d994600a60005280837fc65a7bb8d6351c1cf70c95a316cc6a92839c986682d98bc35f958f4883f9d2a8015416908516106000146112875750915b386111ce565b92915061129390611c7e565b90611281565b611b67565b3461033357600036600319011261033357602061089c611eca565b346103335760003660031901126103335760206112d5436125fb565b65ffffffffffff60405191168152f35b34610333576000806003193601126104725760405190806004549061130982611b7d565b808552916020916001918281169081156104455750600114611335576103e9866103dd81880382611c35565b9350600484527f8a35acfbc15ff81a39ae7d344fd709f28e8600b4aa8c65c6b64bfe7fe36bd19b5b83851061137a575050505081016020016103dd826103e9386103cd565b805486860184015293820193810161135d565b34610333576001600160a01b037ff3a7c8242f0708821ed31a47f066fc7fa42f2ae65ed3e4d1d7cb5b3765d2939c60206113c636610bf7565b93906113d0612152565b169283600052600e8252610c978160406000209060ff801983541691151516179055565b34610333576020366003190112610333576001600160a01b036004356114198161056d565b16600052600960205260206001600160d01b036114396040600020612ab6565b16604051908152f35b346103335760203660031901126103335760043561145f8161056d565b611467612152565b6001600160a01b038091169081156114b457600d54826001600160a01b0319821617600d55167f32e65821e4609464dd250a7fcb47fd6fdbfed51fc2b69d819832d61453cde55c600080a3005b60246040517fc1dd8fa000000000000000000000000000000000000000000000000000000000815260006004820152fd5b346103335760408060031936011261033357600435906115048261056d565b60243591331561167a576001600160a01b03808216801561166a576115426106f56106ee336001600160a01b0316600052600e602052604060002090565b80611641575b6115f3575b6115706106f56106ee856001600160a01b0316600052600e602052604060002090565b91826115db575b505061159c575b6103e99261158b91611ee2565b905190151581529081906020820190565b6115bd83610778836001600160a01b03166000526000602052604060002090565b6115c5611eca565b101561157e576004825163d873da4960e01b8152fd5b600d54166001600160a01b0316141590503880611577565b61160782600d54166001600160a01b031690565b803314908115611637575b501561154d57611620611d8f565b85111561154d5760048451633f59fe5760e11b8152fd5b9050811438611612565b506116656106f56106ee856001600160a01b0316600052600e602052604060002090565b611548565b60048451633a954ecd60e21b8152fd5b60048251630b07e54560e11b8152fd5b34610333576040366003190112610333576108dc6024356116aa81610cb1565b600435611feb565b346103335760c0366003190112610333576004356116cf8161056d565b6044359060243560643560ff811681036103335783421161177f576117736100169461177a926040519061175b8261174d6020820195898b886060919493926001600160a01b0360808301967fe48329057bfd03d55e49b547132e39cffd9c1820ad7b9d4c5307691425d15adf845216602083015260408201520152565b03601f198101845283611c35565b61176e60a4359360843593519020612ae2565b612b23565b9182612b3b565b61270c565b6040517f4683af0e00000000000000000000000000000000000000000000000000000000815260048101859052602490fd5b34610333576020366003190112610333576001600160a01b036004356117d68161056d565b16600052600e602052602060ff604060002054166040519015158152f35b346103335760203660031901126103335760043561181181610cb1565b611819612152565b60025463ffffffff8216116118f157600d547f97d4140ef4441bb58ac55974ae7dbbd537f34a138c046ce2c064f37c02d916279060a01c63ffffffff16916118a5817fffffffffffffffff00000000ffffffffffffffffffffffffffffffffffffffff77ffffffff0000000000000000000000000000000000000000600d549260a01b16911617600d55565b610dc07f4d61782057616c6c657420466163746f72000000000000000000000000000000604051527f7a87c450164f3e4adbcbcd47a104ded23ee565f45f5a2e4b750c4875fbeb047890565b60e460405163674604c960e11b815260406004820152601160448201527f4d61782077616c6c657420666163746f72000000000000000000000000000000606482015260806024820152602c60848201527f4d61782077616c6c657420666163746f722063616e6e6f74206578636565642060a48201527f746f74616c20737570706c79000000000000000000000000000000000000000060c4820152fd5b3461033357606036600319011261033357602061089c60443560243560043561202c565b34610333576040366003190112610333576020611a106004356119d68161056d565b6001600160a01b03602435916119eb8361056d565b16600052600183526040600020906001600160a01b0316600052602052604060002090565b54604051908152f35b3461033357600036600319011261033357602061089c6120c7565b34610333576040366003190112610333576040611aa1611a9b600435611a598161056d565b6001600160a01b0360243591611a6e83610cb1565b611a76612139565b50611a7f612139565b5016600052600960205283600020611a95612139565b506130bf565b506136c2565b6001600160d01b03602083519265ffffffffffff81511684520151166020820152f35b3461033357602036600319011261033357600435611ae18161056d565b611ae9612152565b6001600160a01b03809116908115611b3657600b54826001600160a01b0319821617600b55167f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e0600080a3005b60246040517f1e4fbdf700000000000000000000000000000000000000000000000000000000815260006004820152fd5b634e487b7160e01b600052601160045260246000fd5b90600182811c92168015611bad575b6020831014611b9757565b634e487b7160e01b600052602260045260246000fd5b91607f1691611b8c565b634e487b7160e01b600052604160045260246000fd5b6040810190811067ffffffffffffffff821117610a7357604052565b67ffffffffffffffff8111610a7357604052565b6020810190811067ffffffffffffffff821117610a7357604052565b60c0810190811067ffffffffffffffff821117610a7357604052565b90601f8019910116810190811067ffffffffffffffff821117610a7357604052565b51906dffffffffffffffffffffffffffff8216820361033357565b6040513d6000823e3d90fd5b906001820180921161129957565b90610258820180921161129957565b9190820180921161129957565b9190600091611cc1611cb985611e86565b918386612196565b926001600160a01b0380600d54168082881614918215611d63575b5050611d06575b611cf1575061038992612408565b611d009084936103899561220f565b91612408565b60ff611d25866001600160a01b0316600052600e602052604060002090565b54161580611d3b575b15611ce357506001611ce3565b5060ff611d5b846001600160a01b0316600052600e602052604060002090565b541615611d2e565b85161490503880611cdc565b8115611d79570490565b634e487b7160e01b600052601260045260246000fd5b61038960025463ffffffff600d5460c01c1690611d6f565b60001981019190821161129957565b9190820391821161129957565b908115611e2457611dde6001600160a01b03600b5416611e86565b611de66120c7565b9081158015611e1c575b611e1557810180821161129957611e07918461254e565b808303928311611299579190565b5050600090565b508015611df0565b600091508190565b611e406001600160a01b03600b5416611e86565b611e486120c7565b8015611e6f578115611e6a57611e5e918361254e565b81018091116112995790565b505090565b505050600090565b60405190611e8482611bcd565b565b6001600160a01b0316600090808252600f60205260ff604083205416600014611eb85790604091815280602052205490565b50604081610389926020522054611e2c565b61038960025463ffffffff600d5460a01c1690611d6f565b600091611ef9611ef133611e86565b918333612196565b926001600160a01b03600d54163314611f37575b611f22575090611f1d9133612c29565b600190565b611f3090611f1d933361220f565b9033612c29565b33600052600e60205260ff604060002054161580611f5d575b15611f0d57506001611f0d565b5060ff611f7d846001600160a01b0316600052600e602052604060002090565b541615611f50565b8181029291811591840414171561129957565b90603c8202828104603c14831517156112995760648110611fc6576064900491828103908111611299579190565b50906002811015611fd75790600090565b908160011c91828103908111611299579190565b919063ffffffff1680156120265760646120058285611f85565b10611fc65761201660649184611f85565b0491828103908111611299579190565b50600090565b916120416001600160a01b03600b5416611e86565b9061204a6120c7565b90808211156120bd578103908111611299576120668185611f85565b90828101918282116112995761208261209b936120a096611f85565b90818111156120b4579061209591611db6565b94611c9b565b611c9b565b8115611e15576120af91612b9e565b905090565b61209591611db6565b5050505050600090565b60006010546000905b8082106120e95750506002549081039081116112995790565b90916001600160a01b03837f1b6847dc741a1b0cd08d278845f9d819d87b734759afb55fe2de5cb82a9ae672015416600052600060205260406000205481018091116112995791600101906120d0565b6040519061214682611bcd565b60006020838281520152565b6001600160a01b03600b5416330361216657565b60246040517f118cdaa7000000000000000000000000000000000000000000000000000000008152336004820152fd5b91906001600160a01b03928381169384600052600f60205260ff60406000205416612207576121c484611dc3565b939095600052600060205285604060002054106121fe578180600d54169116146121ef575050505090565b610389939450600b54166136e6565b50505050905090565b505050905090565b600090612233612227600d546001600160a01b031690565b6001600160a01b031690565b6001600160a01b038216939084036123fa5761225160055b82611feb565b9390958685612265575b5050505050505090565b612282856001600160a01b03166000526000602052604060002090565b54926122af61229d61229389611f98565b919091308a6136e6565b600b546001600160a01b0316886136e6565b1561239c575091612314939183827f9174fcf222375951e43519967bd54a1083271e61dab0b523b644cdf98c975f3497951180612393575b612323575b505050506122fc61101130611e86565b6123046129d1565b6040519081529081906020820190565b0390a23880808080808061225b565b826123318161234193611db6565b61233b8285611db6565b9061202c565b8092811515928361237f575b50505061235c575b80806122ec565b61237891612372600b546001600160a01b031690565b906136e6565b3880612355565b61238a929350611db6565b1181388061234d565b508282116122e7565b90506123149396507f9174fcf222375951e43519967bd54a1083271e61dab0b523b644cdf98c975f349492506123f591506123e26123d982611dc3565b92839150611db6565b96612372600b546001600160a01b031690565b612304565b60019250612251600561224b565b91906001600160a01b0383169283600052600160205261243f336040600020906001600160a01b0316600052602052604060002090565b549360018501612455575b50611f1d9350612c29565b83851061250f57156124de5733156124ad5782611f1d94036124a63361248e846001600160a01b03166000526001602052604060002090565b906001600160a01b0316600052602052604060002090565b553861244a565b60246040517f94280d6200000000000000000000000000000000000000000000000000000000815260006004820152fd5b60246040517fe602df0500000000000000000000000000000000000000000000000000000000815260006004820152fd5b6040517ffb8f41b20000000000000000000000000000000000000000000000000000000081523360048201526024810186905260448101859052606490fd5b909182820291600019848209938380861095039480860395146125ee57848311156125c45782910981600003821680920460028082600302188083028203028083028203028083028203028083028203028083028203028092029003029360018380600003040190848311900302920304170290565b60046040517f227bc153000000000000000000000000000000000000000000000000000000008152fd5b5050906103899250611d6f565b65ffffffffffff9081811161260e571690565b604490604051906306dfcc6560e41b8252603060048301526024820152fd5b9081549060009180600581116126c0575b50915b82811061267057505080612656575050600090565b61265f90611da7565b906000526020600020015460301c90565b90918082169080831860011c8201809211611299578460005265ffffffffffff80836020600020015416908516106000146126ae5750915b90612641565b9291506126ba90611c7e565b906126a8565b906126ca82612d77565b8203918211611299578460005265ffffffffffff80836020600020015416908416106000146126fb57505b3861263e565b925061270690611c7e565b916126f5565b611e84916127746001600160a01b03926001600160a01b0319848216948560005260086020526040600020958654968288169788938816948591161790557f3134e8a2e6d97e929a7e54011ea5485d7d196dd5f0ba4d4ef95803e8e3fc257f600080a4611e86565b91612f2c565b604051906060820182811067ffffffffffffffff821117610a735760405260028252604082602036910137565b634e487b7160e01b600052603260045260246000fd5b8051156127ca5760200190565b6127a7565b8051600110156127ca5760400190565b9081602091031261033357516103898161056d565b91909493929460a083019083526020906000602085015260a060408501528251809152602060c0850193019160005b8281106128455750505050906001600160a01b03608092951660608201520152565b83516001600160a01b031685529381019392810192600101612823565b612877612227600c546001600160a01b031690565b6001600160a01b038116156129b857816128919130612bbd565b61289961277a565b6128b4306128a6836127bd565b906001600160a01b03169052565b6128c9612227600c546001600160a01b031690565b6040517fad5c4648000000000000000000000000000000000000000000000000000000008152602081600481855afa80156105685761291491600091612989575b506128a6846127cf565b61291d42611c8c565b90803b15610333576129659360008094604051968795869485937f791ac9470000000000000000000000000000000000000000000000000000000085523091600486016127f4565b03925af18015610568576129765750565b80612983611e8492611be9565b80610328565b6129ab915060203d6020116129b1575b6129a38183611c35565b8101906127df565b3861290a565b503d612999565b604051637eff088160e01b815260006004820152602490fd5b4780159081156129df575050565b6001600160a01b0390600460208360125416604051928380927ff7260d3e0000000000000000000000000000000000000000000000000000000082525afa918215610568576000948594859485948591612a50575b508492612a46575b1690f11561056857565b6108fc9250612a3c565b612a69915060203d6020116129b1576129a38183611c35565b38612a34565b600a5480612a7d5750600090565b8060001981011161129957600a6000527fc65a7bb8d6351c1cf70c95a316cc6a92839c986682d98bc35f958f4883f9d2a7015460301c90565b805480612ac4575050600090565b60001991818381011161129957600052602060002001015460301c90565b604290612aed61342d565b90604051917f19010000000000000000000000000000000000000000000000000000000000008352600283015260228201522090565b916103899391612b3293613547565b909291926135eb565b6001600160a01b0316908160005260076020526040600020805491829160018301905503612b67575050565b60449250604051917f752d88c000000000000000000000000000000000000000000000000000000000835260048301526024820152fd5b908015612bb357612bae91611d6f565b600191565b5050600090600090565b906001600160a01b03918281169283156124de5782169384156124ad5780612c1f7f8c5be1e5ebec7d5bd14f71427d1e84f3dd0314c0f7b2291e5b200ac8c7c3b9259461248e6020956001600160a01b03166000526001602052604060002090565b55604051908152a3565b9291906001600160a01b0393848116948515612d465782168015612d1557612c64826001600160a01b03166000526000602052604060002090565b5495848710612ce65784611e84969703612c91846001600160a01b03166000526000602052604060002090565b55612caf846001600160a01b03166000526000602052604060002090565b8054860190556040518581527fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef90602090a36138d2565b60405163391434e360e21b81526001600160a01b03841660048201526024810188905260448101869052606490fd5b60246040517fec442f0500000000000000000000000000000000000000000000000000000000815260006004820152fd5b60246040517f96c6fd1e00000000000000000000000000000000000000000000000000000000815260006004820152fd5b80156120265780612e4a612e43612e39612e2f612e25612e1b612e11612e0760016103899a6000908b60801c80612ea5575b508060401c80612e98575b508060201c80612e8b575b508060101c80612e7e575b508060081c80612e71575b508060041c80612e64575b508060021c80612e57575b50821c612e50575b811c1b612e00818b611d6f565b0160011c90565b612e00818a611d6f565b612e008189611d6f565b612e008188611d6f565b612e008187611d6f565b612e008186611d6f565b612e008185611d6f565b8092611d6f565b9061385c565b8101612df3565b6002915091019038612deb565b6004915091019038612de0565b6008915091019038612dd5565b6010915091019038612dca565b6020915091019038612dbf565b6040915091019038612db4565b91505060809038612da9565b905b828110612ebf57505090565b90918082169080831860011c820180921161129957600a60005265ffffffffffff80837fc65a7bb8d6351c1cf70c95a316cc6a92839c986682d98bc35f958f4883f9d2a801541690851610600014612f1a5750915b90612eb3565b929150612f2690611c7e565b90612f14565b91906001600160a01b039283821693811690848214158061307f575b612f54575b5050505050565b81612fdd575b505082612f69575b8080612f4d565b7fdec2bacdd2f05b59de34da9b523dff8be42e5e38e818c82fdb0bae774387a72491612fb4612fae612fba936001600160a01b03166000526009602052604060002090565b91613869565b9061389c565b604080516001600160d01b039384168152919092166020820152a2388080612f62565b612ffa906001600160a01b03166000526009602052604060002090565b61300384613869565b61300c436125fb565b6001600160d01b0391828061302086612ab6565b169116900392828411611299577fdec2bacdd2f05b59de34da9b523dff8be42e5e38e818c82fdb0bae774387a724936130759261305c92613bca565b6040805192851683529316602082015291829190820190565b0390a23880612f5a565b50831515612f48565b6010548110156127ca5760106000527f1b6847dc741a1b0cd08d278845f9d819d87b734759afb55fe2de5cb82a9ae6720190600090565b80548210156127ca5760005260206000200190600090565b601054801561311d57600019810190808210156127ca577f1b6847dc741a1b0cd08d278845f9d819d87b734759afb55fe2de5cb82a9ae671600091601083520155601055565b634e487b7160e01b600052603160045260246000fd5b6000818152601160205260409020548015611e155760001991818301918083116112995760105493840193841161129957838360009561318e9503613194575b50505061317e6130d7565b6000526011602052604060002090565b55600190565b61317e6131bc916131b46131aa6131d595613088565b90549060031b1c90565b928391613088565b90919082549060031b91821b91600019901b1916179055565b55388080613173565b806000526011602052604060002054156000146120265760105468010000000000000000811015610a735760018101806010558110156127ca5781907f1b6847dc741a1b0cd08d278845f9d819d87b734759afb55fe2de5cb82a9ae6720155601054906000526011602052604060002055600190565b60ff81146132aa5760ff811690601f8211613280576040519161327683611bcd565b8252602082015290565b60046040517fb3512b0c000000000000000000000000000000000000000000000000000000008152fd5b506040516005548160006132bd83611b7d565b8083529260209060019081811690811561334957506001146132e8575b505061038992500382611c35565b91509260056000527f036b6384b5eca791c62761152d0c79bb0604c104a5fb6f4eb0703f3154bb3db0936000925b828410613331575061038994505050810160200138806132da565b85548785018301529485019486945092810192613316565b9150506020925061038994915060ff191682840152151560051b82010138806132da565b60ff811461338f5760ff811690601f8211613280576040519161327683611bcd565b506040516006548160006133a283611b7d565b8083529260209060019081811690811561334957506001146133cc57505061038992500382611c35565b91509260066000527ff652222313e28459528d920b65115c16c04f3efc82aaedc97be59f3f377c0d3f936000925b828410613415575061038994505050810160200138806132da565b855487850183015294850194869450928101926133fa565b6001600160a01b037f00000000000000000000000000000000000000000000000000000000000000001630148061351e575b15613488577f000000000000000000000000000000000000000000000000000000000000000090565b60405160208101907f8b73c3c69bb8fe3d512ecc4cf759cc79239f7b179b0ffacaa9a75d522b39400f82527f000000000000000000000000000000000000000000000000000000000000000060408201527f000000000000000000000000000000000000000000000000000000000000000060608201524660808201523060a082015260a0815261351881611c19565b51902090565b507f0000000000000000000000000000000000000000000000000000000000000000461461345f565b91907f7fffffffffffffffffffffffffffffff5d576e7357a4501ddfe92f46681b20a084116135bf57926020929160ff608095604051948552168484015260408301526060820152600092839182805260015afa156105685780516001600160a01b038116156135b657918190565b50809160019190565b50505060009160039190565b600411156135d557565b634e487b7160e01b600052602160045260246000fd5b6135f4816135cb565b806135fd575050565b613606816135cb565b600181036136385760046040517ff645eedf000000000000000000000000000000000000000000000000000000008152fd5b613641816135cb565b6002810361367b576040517ffce698f700000000000000000000000000000000000000000000000000000000815260048101839052602490fd5b806136876003926135cb565b1461368f5750565b6040517fd78bce0c0000000000000000000000000000000000000000000000000000000081526004810191909152602490fd5b906040516136cf81611bcd565b915465ffffffffffff8116835260301c6020830152565b9291906001600160a01b0380851680159182156137e15761371161370c86600254611c9b565b600255565b831690816137b9576137268560025403600255565b6040518581527fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef90602090a3613761575b611e8492936138d2565b600254936001600160d01b03851161377a579350613757565b6040517f1cb15d26000000000000000000000000000000000000000000000000000000008152600481018690526001600160d01b036024820152604490fd5b6137d6846001600160a01b03166000526000602052604060002090565b858154019055613726565b6137fe876001600160a01b03166000526000602052604060002090565b5485811061382c57859003613826886001600160a01b03166000526000602052604060002090565b55613711565b60405163391434e360e21b81526001600160a01b0389166004820152602481019190915260448101869052606490fd5b90808210156120af575090565b6001600160d01b039081811161387d571690565b604490604051906306dfcc6560e41b825260d060048301526024820152fd5b906138a6436125fb565b6001600160d01b039182806138ba86612ab6565b16911601918211611299576138ce92613bca565b9091565b6001600160a01b0390811692918190841561395e575b16908115613916575b611e849360005260086020528060406000205416916000526040600020541690612f2c565b61391f83613869565b93613929436125fb565b6001600160d01b0395868061393c612a6f565b169116900395861161129957611e849561395591613a78565b505093506138f1565b905061396983613869565b90613973436125fb565b6001600160d01b03928380613986612a6f565b1691160192831161129957839261399c91613a78565b50506138e8565b600a549068010000000000000000821015610a73576001820180600a558210156127ca57600a60005280516020919091015160301b65ffffffffffff191665ffffffffffff91909116177fc65a7bb8d6351c1cf70c95a316cc6a92839c986682d98bc35f958f4883f9d2a890910155565b805468010000000000000000811015610a7357613a36916001820181556130bf565b613a625781516020929092015160301b65ffffffffffff191665ffffffffffff92909216919091179055565b634e487b7160e01b600052600060045260246000fd5b600a54919291908115613ba057613ac3613abe613a9484611da7565b600a6000527fc65a7bb8d6351c1cf70c95a316cc6a92839c986682d98bc35f958f4883f9d2a80190565b6136c2565b805165ffffffffffff8381169491168410613b765785602093613b3a95613afe613af3865165ffffffffffff1690565b65ffffffffffff1690565b03613b3e5750613b13613a94613b2c93611da7565b9065ffffffffffff82549181199060301b169116179055565b01516001600160d01b031690565b9190565b9050613b719150613b5e613b50611e77565b65ffffffffffff9092168252565b6001600160d01b038716818501526139a3565b613b2c565b60046040517f2520601d000000000000000000000000000000000000000000000000000000008152fd5b613bc49150613bb0613b50611e77565b6001600160d01b03841660208201526139a3565b60009190565b805492939291908215613c8857613bf3613abe613be685611da7565b8360005260206000200190565b90613c04825165ffffffffffff1690565b65ffffffffffff84811691168110613b7657613b3a946020948892613c32613af3875165ffffffffffff1690565b03613c555750613b2c92613c48613b1392611da7565b9060005260206000200190565b915050613b7191613c75613c67611e77565b65ffffffffffff9093168352565b6001600160d01b03881682860152613a14565b613bc49250613c98613c67611e77565b6001600160d01b0385166020830152613a1456fea26469706673582212204cebd50656486e4de9b3557ce1fe25e610be769d18e1daac2127493091eaea9d64736f6c63430008180033c65a7bb8d6351c1cf70c95a316cc6a92839c986682d98bc35f958f4883f9d2a8dec2bacdd2f05b59de34da9b523dff8be42e5e38e818c82fdb0bae774387a72400000000000000000000000000000000000000000052b7d2dcc80cd2e4000000000000000000000000000000545d4fccbabe6e5d3e0f7f2d3dc511d436369472

0x60806040526004361015610018575b361561001657005b005b60003560e01c806306fdde03146103235780630902f1ac1461031e578063095ea7b3146103195780631419841d146103145780631694505e1461030f57806318160ddd1461030a57806323b872dd1461030557806324b049051461030057806328b13b61146102fb5780632957b839146102f657806330014a58146102f1578063313ce567146102ec57806335a2f3cb146102e75780633a46b1a8146102e25780633ccfd60b146102dd578063498cf1b5146102d857806349bd5a5e146102d35780634bf5d7e9146102ce5780634f7041a514610256578063587cde1e146102c95780635c19a95c146102c4578063679e24b2146102bf5780636b34f554146102ba5780636fcfff45146102b557806370a08231146102b0578063715018a6146102ab5780637d459db3146102a65780637ecebe00146102a15780638119c0651461029c57806384b0196e146102975780638da5cb5b146102925780638e539e8c1461028d5780638f3fa8601461028857806391ddadf41461028357806395d89b411461027e578063961d3cd3146102795780639ab24eb014610274578063a29a60891461026f578063a9059cbb1461026a578063bdc7576214610265578063c3cda52014610260578063cba0e9961461025b578063cc1776d314610256578063d4f4671614610251578063d98507421461024c578063dd62ed3e14610247578063e629e43c14610242578063f1127ed81461023d5763f2fde38b0361000e57611ac4565b611a34565b611a19565b6119b4565b611990565b6117f4565b610b75565b6117b1565b6116b2565b61168a565b6114e5565b611442565b6113f4565b61138d565b6112e5565b6112b9565b61129e565b611183565b61115c565b611045565b610feb565b610fad565b610f6a565b610f0e565b610ee7565b610e7b565b610cbf565b610c1f565b610bd1565b610b91565b610acb565b610aa4565b610a7d565b6109e7565b610928565b61090a565b6108ee565b6108c0565b6108a4565b610881565b61085a565b610682565b610664565b61063d565b6105b3565b61057e565b610475565b61038c565b600091031261033357565b600080fd5b919082519283825260005b848110610364575050826000602080949584010152601f8019910116010190565b602081830181015184830182015201610343565b906020610389928181520190610338565b90565b3461033357600080600319360112610472576040519080600354906103b082611b7d565b8085529160209160019182811690811561044557506001146103ed575b6103e9866103dd81880382611c35565b60405191829182610378565b0390f35b9350600384527fc2575a0e9e593c00f959f8c92f12db2869c3395a3b0502d05e2516446f71f85b5b838510610432575050505081016020016103dd826103e9386103cd565b8054868601840152938201938101610415565b90508695506103e9969350602092506103dd94915060ff191682840152151560051b8201019293386103cd565b80fd5b34610333576000806003193601126104725760049060606001600160a01b03600d5416604051938480927f0902f1ac0000000000000000000000000000000000000000000000000000000082525afa8015610568578192828092610509575b5050604080516dffffffffffffffffffffffffffff948516815292909316602083015263ffffffff1691810191909152606090f35b92509250506060823d606011610560575b8161052760609383611c35565b81010312610472575061053981611c57565b6103e9604061054a60208501611c57565b9301519161055783610cb1565b929190386104d4565b3d915061051a565b611c72565b6001600160a01b0381160361033357565b34610333576040366003190112610333576105a860043561059e8161056d565b6024359033612bbd565b602060405160018152f35b34610333576020366003190112610333576004356105d08161056d565b6105d8612152565b6001600160a01b0380911690811561062557600c54826001600160a01b0319821617600c55167ffa4937d0799f87945796348ce98077a83f6a274d6a88335536792683985cd325600080a3005b6024604051637eff088160e01b815260006004820152fd5b346103335760003660031901126103335760206001600160a01b03600c5416604051908152f35b34610333576000366003190112610333576020600254604051908152f35b346103335760603660031901126103335760043561069f8161056d565b602435906106ac8261056d565b604435906001600160a01b03808216801561084957818516908115610838576106f96106f56106ee866001600160a01b0316600052600e602052604060002090565b5460ff1690565b1590565b8061080f575b6107ba575b506107286106f56106ee876001600160a01b0316600052600e602052604060002090565b91826107a2575b5050610756575b906103e99261074492611ca8565b60405190151581529081906020820190565b9061077e81610778856001600160a01b03166000526000602052604060002090565b54611c9b565b610786611eca565b106107915790610736565b600460405163d873da4960e01b8152fd5b600d54166001600160a01b031614159050388061072f565b6107ce83600d54166001600160a01b031690565b809114908115610805575b506107e5575b38610704565b6107ed611d8f565b8411156107df576004604051633f59fe5760e11b8152fd5b90508114386107d9565b506108336106f56106ee886001600160a01b0316600052600e602052604060002090565b6106ff565b6004604051633a954ecd60e21b8152fd5b6004604051630b07e54560e11b8152fd5b346103335760003660031901126103335760206001600160a01b0360125416604051908152f35b3461033357600036600319011261033357602061089c611d8f565b604051908152f35b34610333576000366003190112610333576020604051603c8152f35b34610333576020366003190112610333576108dc600435611dc3565b60408051928352602083019190915290f35b3461033357600036600319011261033357602060405160128152f35b3461033357602036600319011261033357602061089c600435611e2c565b34610333576040366003190112610333576004356109458161056d565b602435610951436125fb565b65ffffffffffff81168210156109a7576103e96001600160d01b03610996846001600160a01b03871660005260096020526109906040600020916125fb565b9061262d565b604051911681529081906020820190565b6040517fecd3f81e000000000000000000000000000000000000000000000000000000008152600481019290925265ffffffffffff166024820152604490fd5b346103335760008060031936011261047257610a01612152565b8080808047335af13d15610a78573d67ffffffffffffffff8111610a735760405190610a37601f8201601f191660200183611c35565b81528260203d92013e5b15610a495780f35b60046040517fbaa89171000000000000000000000000000000000000000000000000000000008152fd5b611bb7565b610a41565b3461033357600036600319011261033357602061089c6001600160a01b03600b5416611e86565b346103335760003660031901126103335760206001600160a01b03600d5416604051908152f35b3461033357600036600319011261033357610ae5436125fb565b65ffffffffffff80610af6436125fb565b16911603610b4b576103e9604051610b0d81611bcd565b601d81527f6d6f64653d626c6f636b6e756d6265722666726f6d3d64656661756c740000006020820152604051918291602083526020830190610338565b60046040517f6ff07140000000000000000000000000000000000000000000000000000000008152fd5b3461033357600036600319011261033357602060405160058152f35b34610333576020366003190112610333576020600435610bb08161056d565b6001600160a01b038091166000526008825260406000205416604051908152f35b3461033357602036600319011261033357610016600435610bf18161056d565b3361270c565b604090600319011261033357600435610c0f8161056d565b9060243580151581036103335790565b34610333576001600160a01b037ff7a1dd9a5b563d36be3ee3e8945a2312ede7793907c0a20c3b3ef393dd4652876020610c5836610bf7565b9390610c62612152565b169283600052600f8252610c868160406000209060ff801983541691151516179055565b8015610ca257610c95846131de565b505b6040519015158152a2005b610cab84613133565b50610c97565b63ffffffff81160361033357565b3461033357602036600319011261033357600435610cdc81610cb1565b610ce4612152565b60025463ffffffff821611610ddc57600d547f97d4140ef4441bb58ac55974ae7dbbd537f34a138c046ce2c064f37c02d916279060c01c63ffffffff1691610d74817fffffffff00000000ffffffffffffffffffffffffffffffffffffffffffffffff7bffffffff000000000000000000000000000000000000000000000000600d549260c01b16911617600d55565b610dc07f4d6178205472616e73616374696f6e20466163746f7200000000000000000000604051527f770b4fa5f5e16b8257498bdfed61327d77bfb5919c4bfa5b177e247d44c1002c90565b6040805163ffffffff95861681529290941660208301529290a2005b60e460405163674604c960e11b815260406004820152601660448201527f4d6178207472616e73616374696f6e20666163746f7200000000000000000000606482015260806024820152603160848201527f4d6178207472616e73616374696f6e20666163746f722063616e6e6f7420657860a48201527f6365656420746f74616c20737570706c7900000000000000000000000000000060c4820152fd5b34610333576020366003190112610333576001600160a01b03600435610ea08161056d565b16600052600960205260406000205463ffffffff90818111610ec85760209160405191168152f35b604490604051906306dfcc6560e41b8252602060048301526024820152fd5b3461033357602036600319011261033357602061089c600435610f098161056d565b611e86565b346103335760008060031936011261047257610f28612152565b806001600160a01b03600b546001600160a01b03198116600b55167f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e08280a380f35b34610333576020366003190112610333576001600160a01b03600435610f8f8161056d565b16600052600f602052602060ff604060002054166040519015158152f35b34610333576020366003190112610333576001600160a01b03600435610fd28161056d565b1660005260076020526020604060002054604051908152f35b346103335760008060031936011261047257611005612152565b61101661101130611e86565b612862565b61101e6129d1565b7f3ebfdaaf4031bec9a2b7b0a1c594d2d03f3d0b8d68531c9164c2829bac00fefa8180a180f35b3461033357600080600319360112610472576110ff906110847f5859504845520000000000000000000000000000000000000000000000000006613254565b906110ae7f584300000000000000000000000000000000000000000000000000000000000261336d565b90604051916110bc83611bfd565b81835261110d6020916040519687967f0f00000000000000000000000000000000000000000000000000000000000000885260e0602089015260e0880190610338565b908682036040880152610338565b904660608601523060808601528260a086015284820360c0860152602080855193848152019401925b82811061114557505050500390f35b835185528695509381019392810192600101611136565b346103335760003660031901126103335760206001600160a01b03600b5416604051908152f35b34610333576020366003190112610333576004356111a0436125fb565b9065ffffffffffff918281168210156109a757506111bd906125fb565b600a54906000908260058111611230575b506111d99350612eb1565b806111f55750602060005b6001600160d01b0360405191168152f35b611200602091611da7565b600a6000527fc65a7bb8d6351c1cf70c95a316cc6a92839c986682d98bc35f958f4883f9d2a8015460301c6111e4565b909261123b82612d77565b8203918211611299576111d994600a60005280837fc65a7bb8d6351c1cf70c95a316cc6a92839c986682d98bc35f958f4883f9d2a8015416908516106000146112875750915b386111ce565b92915061129390611c7e565b90611281565b611b67565b3461033357600036600319011261033357602061089c611eca565b346103335760003660031901126103335760206112d5436125fb565b65ffffffffffff60405191168152f35b34610333576000806003193601126104725760405190806004549061130982611b7d565b808552916020916001918281169081156104455750600114611335576103e9866103dd81880382611c35565b9350600484527f8a35acfbc15ff81a39ae7d344fd709f28e8600b4aa8c65c6b64bfe7fe36bd19b5b83851061137a575050505081016020016103dd826103e9386103cd565b805486860184015293820193810161135d565b34610333576001600160a01b037ff3a7c8242f0708821ed31a47f066fc7fa42f2ae65ed3e4d1d7cb5b3765d2939c60206113c636610bf7565b93906113d0612152565b169283600052600e8252610c978160406000209060ff801983541691151516179055565b34610333576020366003190112610333576001600160a01b036004356114198161056d565b16600052600960205260206001600160d01b036114396040600020612ab6565b16604051908152f35b346103335760203660031901126103335760043561145f8161056d565b611467612152565b6001600160a01b038091169081156114b457600d54826001600160a01b0319821617600d55167f32e65821e4609464dd250a7fcb47fd6fdbfed51fc2b69d819832d61453cde55c600080a3005b60246040517fc1dd8fa000000000000000000000000000000000000000000000000000000000815260006004820152fd5b346103335760408060031936011261033357600435906115048261056d565b60243591331561167a576001600160a01b03808216801561166a576115426106f56106ee336001600160a01b0316600052600e602052604060002090565b80611641575b6115f3575b6115706106f56106ee856001600160a01b0316600052600e602052604060002090565b91826115db575b505061159c575b6103e99261158b91611ee2565b905190151581529081906020820190565b6115bd83610778836001600160a01b03166000526000602052604060002090565b6115c5611eca565b101561157e576004825163d873da4960e01b8152fd5b600d54166001600160a01b0316141590503880611577565b61160782600d54166001600160a01b031690565b803314908115611637575b501561154d57611620611d8f565b85111561154d5760048451633f59fe5760e11b8152fd5b9050811438611612565b506116656106f56106ee856001600160a01b0316600052600e602052604060002090565b611548565b60048451633a954ecd60e21b8152fd5b60048251630b07e54560e11b8152fd5b34610333576040366003190112610333576108dc6024356116aa81610cb1565b600435611feb565b346103335760c0366003190112610333576004356116cf8161056d565b6044359060243560643560ff811681036103335783421161177f576117736100169461177a926040519061175b8261174d6020820195898b886060919493926001600160a01b0360808301967fe48329057bfd03d55e49b547132e39cffd9c1820ad7b9d4c5307691425d15adf845216602083015260408201520152565b03601f198101845283611c35565b61176e60a4359360843593519020612ae2565b612b23565b9182612b3b565b61270c565b6040517f4683af0e00000000000000000000000000000000000000000000000000000000815260048101859052602490fd5b34610333576020366003190112610333576001600160a01b036004356117d68161056d565b16600052600e602052602060ff604060002054166040519015158152f35b346103335760203660031901126103335760043561181181610cb1565b611819612152565b60025463ffffffff8216116118f157600d547f97d4140ef4441bb58ac55974ae7dbbd537f34a138c046ce2c064f37c02d916279060a01c63ffffffff16916118a5817fffffffffffffffff00000000ffffffffffffffffffffffffffffffffffffffff77ffffffff0000000000000000000000000000000000000000600d549260a01b16911617600d55565b610dc07f4d61782057616c6c657420466163746f72000000000000000000000000000000604051527f7a87c450164f3e4adbcbcd47a104ded23ee565f45f5a2e4b750c4875fbeb047890565b60e460405163674604c960e11b815260406004820152601160448201527f4d61782077616c6c657420666163746f72000000000000000000000000000000606482015260806024820152602c60848201527f4d61782077616c6c657420666163746f722063616e6e6f74206578636565642060a48201527f746f74616c20737570706c79000000000000000000000000000000000000000060c4820152fd5b3461033357606036600319011261033357602061089c60443560243560043561202c565b34610333576040366003190112610333576020611a106004356119d68161056d565b6001600160a01b03602435916119eb8361056d565b16600052600183526040600020906001600160a01b0316600052602052604060002090565b54604051908152f35b3461033357600036600319011261033357602061089c6120c7565b34610333576040366003190112610333576040611aa1611a9b600435611a598161056d565b6001600160a01b0360243591611a6e83610cb1565b611a76612139565b50611a7f612139565b5016600052600960205283600020611a95612139565b506130bf565b506136c2565b6001600160d01b03602083519265ffffffffffff81511684520151166020820152f35b3461033357602036600319011261033357600435611ae18161056d565b611ae9612152565b6001600160a01b03809116908115611b3657600b54826001600160a01b0319821617600b55167f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e0600080a3005b60246040517f1e4fbdf700000000000000000000000000000000000000000000000000000000815260006004820152fd5b634e487b7160e01b600052601160045260246000fd5b90600182811c92168015611bad575b6020831014611b9757565b634e487b7160e01b600052602260045260246000fd5b91607f1691611b8c565b634e487b7160e01b600052604160045260246000fd5b6040810190811067ffffffffffffffff821117610a7357604052565b67ffffffffffffffff8111610a7357604052565b6020810190811067ffffffffffffffff821117610a7357604052565b60c0810190811067ffffffffffffffff821117610a7357604052565b90601f8019910116810190811067ffffffffffffffff821117610a7357604052565b51906dffffffffffffffffffffffffffff8216820361033357565b6040513d6000823e3d90fd5b906001820180921161129957565b90610258820180921161129957565b9190820180921161129957565b9190600091611cc1611cb985611e86565b918386612196565b926001600160a01b0380600d54168082881614918215611d63575b5050611d06575b611cf1575061038992612408565b611d009084936103899561220f565b91612408565b60ff611d25866001600160a01b0316600052600e602052604060002090565b54161580611d3b575b15611ce357506001611ce3565b5060ff611d5b846001600160a01b0316600052600e602052604060002090565b541615611d2e565b85161490503880611cdc565b8115611d79570490565b634e487b7160e01b600052601260045260246000fd5b61038960025463ffffffff600d5460c01c1690611d6f565b60001981019190821161129957565b9190820391821161129957565b908115611e2457611dde6001600160a01b03600b5416611e86565b611de66120c7565b9081158015611e1c575b611e1557810180821161129957611e07918461254e565b808303928311611299579190565b5050600090565b508015611df0565b600091508190565b611e406001600160a01b03600b5416611e86565b611e486120c7565b8015611e6f578115611e6a57611e5e918361254e565b81018091116112995790565b505090565b505050600090565b60405190611e8482611bcd565b565b6001600160a01b0316600090808252600f60205260ff604083205416600014611eb85790604091815280602052205490565b50604081610389926020522054611e2c565b61038960025463ffffffff600d5460a01c1690611d6f565b600091611ef9611ef133611e86565b918333612196565b926001600160a01b03600d54163314611f37575b611f22575090611f1d9133612c29565b600190565b611f3090611f1d933361220f565b9033612c29565b33600052600e60205260ff604060002054161580611f5d575b15611f0d57506001611f0d565b5060ff611f7d846001600160a01b0316600052600e602052604060002090565b541615611f50565b8181029291811591840414171561129957565b90603c8202828104603c14831517156112995760648110611fc6576064900491828103908111611299579190565b50906002811015611fd75790600090565b908160011c91828103908111611299579190565b919063ffffffff1680156120265760646120058285611f85565b10611fc65761201660649184611f85565b0491828103908111611299579190565b50600090565b916120416001600160a01b03600b5416611e86565b9061204a6120c7565b90808211156120bd578103908111611299576120668185611f85565b90828101918282116112995761208261209b936120a096611f85565b90818111156120b4579061209591611db6565b94611c9b565b611c9b565b8115611e15576120af91612b9e565b905090565b61209591611db6565b5050505050600090565b60006010546000905b8082106120e95750506002549081039081116112995790565b90916001600160a01b03837f1b6847dc741a1b0cd08d278845f9d819d87b734759afb55fe2de5cb82a9ae672015416600052600060205260406000205481018091116112995791600101906120d0565b6040519061214682611bcd565b60006020838281520152565b6001600160a01b03600b5416330361216657565b60246040517f118cdaa7000000000000000000000000000000000000000000000000000000008152336004820152fd5b91906001600160a01b03928381169384600052600f60205260ff60406000205416612207576121c484611dc3565b939095600052600060205285604060002054106121fe578180600d54169116146121ef575050505090565b610389939450600b54166136e6565b50505050905090565b505050905090565b600090612233612227600d546001600160a01b031690565b6001600160a01b031690565b6001600160a01b038216939084036123fa5761225160055b82611feb565b9390958685612265575b5050505050505090565b612282856001600160a01b03166000526000602052604060002090565b54926122af61229d61229389611f98565b919091308a6136e6565b600b546001600160a01b0316886136e6565b1561239c575091612314939183827f9174fcf222375951e43519967bd54a1083271e61dab0b523b644cdf98c975f3497951180612393575b612323575b505050506122fc61101130611e86565b6123046129d1565b6040519081529081906020820190565b0390a23880808080808061225b565b826123318161234193611db6565b61233b8285611db6565b9061202c565b8092811515928361237f575b50505061235c575b80806122ec565b61237891612372600b546001600160a01b031690565b906136e6565b3880612355565b61238a929350611db6565b1181388061234d565b508282116122e7565b90506123149396507f9174fcf222375951e43519967bd54a1083271e61dab0b523b644cdf98c975f349492506123f591506123e26123d982611dc3565b92839150611db6565b96612372600b546001600160a01b031690565b612304565b60019250612251600561224b565b91906001600160a01b0383169283600052600160205261243f336040600020906001600160a01b0316600052602052604060002090565b549360018501612455575b50611f1d9350612c29565b83851061250f57156124de5733156124ad5782611f1d94036124a63361248e846001600160a01b03166000526001602052604060002090565b906001600160a01b0316600052602052604060002090565b553861244a565b60246040517f94280d6200000000000000000000000000000000000000000000000000000000815260006004820152fd5b60246040517fe602df0500000000000000000000000000000000000000000000000000000000815260006004820152fd5b6040517ffb8f41b20000000000000000000000000000000000000000000000000000000081523360048201526024810186905260448101859052606490fd5b909182820291600019848209938380861095039480860395146125ee57848311156125c45782910981600003821680920460028082600302188083028203028083028203028083028203028083028203028083028203028092029003029360018380600003040190848311900302920304170290565b60046040517f227bc153000000000000000000000000000000000000000000000000000000008152fd5b5050906103899250611d6f565b65ffffffffffff9081811161260e571690565b604490604051906306dfcc6560e41b8252603060048301526024820152fd5b9081549060009180600581116126c0575b50915b82811061267057505080612656575050600090565b61265f90611da7565b906000526020600020015460301c90565b90918082169080831860011c8201809211611299578460005265ffffffffffff80836020600020015416908516106000146126ae5750915b90612641565b9291506126ba90611c7e565b906126a8565b906126ca82612d77565b8203918211611299578460005265ffffffffffff80836020600020015416908416106000146126fb57505b3861263e565b925061270690611c7e565b916126f5565b611e84916127746001600160a01b03926001600160a01b0319848216948560005260086020526040600020958654968288169788938816948591161790557f3134e8a2e6d97e929a7e54011ea5485d7d196dd5f0ba4d4ef95803e8e3fc257f600080a4611e86565b91612f2c565b604051906060820182811067ffffffffffffffff821117610a735760405260028252604082602036910137565b634e487b7160e01b600052603260045260246000fd5b8051156127ca5760200190565b6127a7565b8051600110156127ca5760400190565b9081602091031261033357516103898161056d565b91909493929460a083019083526020906000602085015260a060408501528251809152602060c0850193019160005b8281106128455750505050906001600160a01b03608092951660608201520152565b83516001600160a01b031685529381019392810192600101612823565b612877612227600c546001600160a01b031690565b6001600160a01b038116156129b857816128919130612bbd565b61289961277a565b6128b4306128a6836127bd565b906001600160a01b03169052565b6128c9612227600c546001600160a01b031690565b6040517fad5c4648000000000000000000000000000000000000000000000000000000008152602081600481855afa80156105685761291491600091612989575b506128a6846127cf565b61291d42611c8c565b90803b15610333576129659360008094604051968795869485937f791ac9470000000000000000000000000000000000000000000000000000000085523091600486016127f4565b03925af18015610568576129765750565b80612983611e8492611be9565b80610328565b6129ab915060203d6020116129b1575b6129a38183611c35565b8101906127df565b3861290a565b503d612999565b604051637eff088160e01b815260006004820152602490fd5b4780159081156129df575050565b6001600160a01b0390600460208360125416604051928380927ff7260d3e0000000000000000000000000000000000000000000000000000000082525afa918215610568576000948594859485948591612a50575b508492612a46575b1690f11561056857565b6108fc9250612a3c565b612a69915060203d6020116129b1576129a38183611c35565b38612a34565b600a5480612a7d5750600090565b8060001981011161129957600a6000527fc65a7bb8d6351c1cf70c95a316cc6a92839c986682d98bc35f958f4883f9d2a7015460301c90565b805480612ac4575050600090565b60001991818381011161129957600052602060002001015460301c90565b604290612aed61342d565b90604051917f19010000000000000000000000000000000000000000000000000000000000008352600283015260228201522090565b916103899391612b3293613547565b909291926135eb565b6001600160a01b0316908160005260076020526040600020805491829160018301905503612b67575050565b60449250604051917f752d88c000000000000000000000000000000000000000000000000000000000835260048301526024820152fd5b908015612bb357612bae91611d6f565b600191565b5050600090600090565b906001600160a01b03918281169283156124de5782169384156124ad5780612c1f7f8c5be1e5ebec7d5bd14f71427d1e84f3dd0314c0f7b2291e5b200ac8c7c3b9259461248e6020956001600160a01b03166000526001602052604060002090565b55604051908152a3565b9291906001600160a01b0393848116948515612d465782168015612d1557612c64826001600160a01b03166000526000602052604060002090565b5495848710612ce65784611e84969703612c91846001600160a01b03166000526000602052604060002090565b55612caf846001600160a01b03166000526000602052604060002090565b8054860190556040518581527fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef90602090a36138d2565b60405163391434e360e21b81526001600160a01b03841660048201526024810188905260448101869052606490fd5b60246040517fec442f0500000000000000000000000000000000000000000000000000000000815260006004820152fd5b60246040517f96c6fd1e00000000000000000000000000000000000000000000000000000000815260006004820152fd5b80156120265780612e4a612e43612e39612e2f612e25612e1b612e11612e0760016103899a6000908b60801c80612ea5575b508060401c80612e98575b508060201c80612e8b575b508060101c80612e7e575b508060081c80612e71575b508060041c80612e64575b508060021c80612e57575b50821c612e50575b811c1b612e00818b611d6f565b0160011c90565b612e00818a611d6f565b612e008189611d6f565b612e008188611d6f565b612e008187611d6f565b612e008186611d6f565b612e008185611d6f565b8092611d6f565b9061385c565b8101612df3565b6002915091019038612deb565b6004915091019038612de0565b6008915091019038612dd5565b6010915091019038612dca565b6020915091019038612dbf565b6040915091019038612db4565b91505060809038612da9565b905b828110612ebf57505090565b90918082169080831860011c820180921161129957600a60005265ffffffffffff80837fc65a7bb8d6351c1cf70c95a316cc6a92839c986682d98bc35f958f4883f9d2a801541690851610600014612f1a5750915b90612eb3565b929150612f2690611c7e565b90612f14565b91906001600160a01b039283821693811690848214158061307f575b612f54575b5050505050565b81612fdd575b505082612f69575b8080612f4d565b7fdec2bacdd2f05b59de34da9b523dff8be42e5e38e818c82fdb0bae774387a72491612fb4612fae612fba936001600160a01b03166000526009602052604060002090565b91613869565b9061389c565b604080516001600160d01b039384168152919092166020820152a2388080612f62565b612ffa906001600160a01b03166000526009602052604060002090565b61300384613869565b61300c436125fb565b6001600160d01b0391828061302086612ab6565b169116900392828411611299577fdec2bacdd2f05b59de34da9b523dff8be42e5e38e818c82fdb0bae774387a724936130759261305c92613bca565b6040805192851683529316602082015291829190820190565b0390a23880612f5a565b50831515612f48565b6010548110156127ca5760106000527f1b6847dc741a1b0cd08d278845f9d819d87b734759afb55fe2de5cb82a9ae6720190600090565b80548210156127ca5760005260206000200190600090565b601054801561311d57600019810190808210156127ca577f1b6847dc741a1b0cd08d278845f9d819d87b734759afb55fe2de5cb82a9ae671600091601083520155601055565b634e487b7160e01b600052603160045260246000fd5b6000818152601160205260409020548015611e155760001991818301918083116112995760105493840193841161129957838360009561318e9503613194575b50505061317e6130d7565b6000526011602052604060002090565b55600190565b61317e6131bc916131b46131aa6131d595613088565b90549060031b1c90565b928391613088565b90919082549060031b91821b91600019901b1916179055565b55388080613173565b806000526011602052604060002054156000146120265760105468010000000000000000811015610a735760018101806010558110156127ca5781907f1b6847dc741a1b0cd08d278845f9d819d87b734759afb55fe2de5cb82a9ae6720155601054906000526011602052604060002055600190565b60ff81146132aa5760ff811690601f8211613280576040519161327683611bcd565b8252602082015290565b60046040517fb3512b0c000000000000000000000000000000000000000000000000000000008152fd5b506040516005548160006132bd83611b7d565b8083529260209060019081811690811561334957506001146132e8575b505061038992500382611c35565b91509260056000527f036b6384b5eca791c62761152d0c79bb0604c104a5fb6f4eb0703f3154bb3db0936000925b828410613331575061038994505050810160200138806132da565b85548785018301529485019486945092810192613316565b9150506020925061038994915060ff191682840152151560051b82010138806132da565b60ff811461338f5760ff811690601f8211613280576040519161327683611bcd565b506040516006548160006133a283611b7d565b8083529260209060019081811690811561334957506001146133cc57505061038992500382611c35565b91509260066000527ff652222313e28459528d920b65115c16c04f3efc82aaedc97be59f3f377c0d3f936000925b828410613415575061038994505050810160200138806132da565b855487850183015294850194869450928101926133fa565b6001600160a01b037f0000000000000000000000007bece364e0fb8dfdc9b97b9016d20d2bfa24195e1630148061351e575b15613488577f93bf46cb03c09a4b063d3de2c94ef959a8690828c490dc49b1f44403274f0d4990565b60405160208101907f8b73c3c69bb8fe3d512ecc4cf759cc79239f7b179b0ffacaa9a75d522b39400f82527f0e3f2f9834e48806a2148937538612e2b2fae26cb76628c72544be0a137218d360408201527fc3555988766b1b6bb3aab6566fdb20affbdb650245be21249ed142e541b4a71360608201524660808201523060a082015260a0815261351881611c19565b51902090565b507f0000000000000000000000000000000000000000000000000000000000000001461461345f565b91907f7fffffffffffffffffffffffffffffff5d576e7357a4501ddfe92f46681b20a084116135bf57926020929160ff608095604051948552168484015260408301526060820152600092839182805260015afa156105685780516001600160a01b038116156135b657918190565b50809160019190565b50505060009160039190565b600411156135d557565b634e487b7160e01b600052602160045260246000fd5b6135f4816135cb565b806135fd575050565b613606816135cb565b600181036136385760046040517ff645eedf000000000000000000000000000000000000000000000000000000008152fd5b613641816135cb565b6002810361367b576040517ffce698f700000000000000000000000000000000000000000000000000000000815260048101839052602490fd5b806136876003926135cb565b1461368f5750565b6040517fd78bce0c0000000000000000000000000000000000000000000000000000000081526004810191909152602490fd5b906040516136cf81611bcd565b915465ffffffffffff8116835260301c6020830152565b9291906001600160a01b0380851680159182156137e15761371161370c86600254611c9b565b600255565b831690816137b9576137268560025403600255565b6040518581527fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef90602090a3613761575b611e8492936138d2565b600254936001600160d01b03851161377a579350613757565b6040517f1cb15d26000000000000000000000000000000000000000000000000000000008152600481018690526001600160d01b036024820152604490fd5b6137d6846001600160a01b03166000526000602052604060002090565b858154019055613726565b6137fe876001600160a01b03166000526000602052604060002090565b5485811061382c57859003613826886001600160a01b03166000526000602052604060002090565b55613711565b60405163391434e360e21b81526001600160a01b0389166004820152602481019190915260448101869052606490fd5b90808210156120af575090565b6001600160d01b039081811161387d571690565b604490604051906306dfcc6560e41b825260d060048301526024820152fd5b906138a6436125fb565b6001600160d01b039182806138ba86612ab6565b16911601918211611299576138ce92613bca565b9091565b6001600160a01b0390811692918190841561395e575b16908115613916575b611e849360005260086020528060406000205416916000526040600020541690612f2c565b61391f83613869565b93613929436125fb565b6001600160d01b0395868061393c612a6f565b169116900395861161129957611e849561395591613a78565b505093506138f1565b905061396983613869565b90613973436125fb565b6001600160d01b03928380613986612a6f565b1691160192831161129957839261399c91613a78565b50506138e8565b600a549068010000000000000000821015610a73576001820180600a558210156127ca57600a60005280516020919091015160301b65ffffffffffff191665ffffffffffff91909116177fc65a7bb8d6351c1cf70c95a316cc6a92839c986682d98bc35f958f4883f9d2a890910155565b805468010000000000000000811015610a7357613a36916001820181556130bf565b613a625781516020929092015160301b65ffffffffffff191665ffffffffffff92909216919091179055565b634e487b7160e01b600052600060045260246000fd5b600a54919291908115613ba057613ac3613abe613a9484611da7565b600a6000527fc65a7bb8d6351c1cf70c95a316cc6a92839c986682d98bc35f958f4883f9d2a80190565b6136c2565b805165ffffffffffff8381169491168410613b765785602093613b3a95613afe613af3865165ffffffffffff1690565b65ffffffffffff1690565b03613b3e5750613b13613a94613b2c93611da7565b9065ffffffffffff82549181199060301b169116179055565b01516001600160d01b031690565b9190565b9050613b719150613b5e613b50611e77565b65ffffffffffff9092168252565b6001600160d01b038716818501526139a3565b613b2c565b60046040517f2520601d000000000000000000000000000000000000000000000000000000008152fd5b613bc49150613bb0613b50611e77565b6001600160d01b03841660208201526139a3565b60009190565b805492939291908215613c8857613bf3613abe613be685611da7565b8360005260206000200190565b90613c04825165ffffffffffff1690565b65ffffffffffff84811691168110613b7657613b3a946020948892613c32613af3875165ffffffffffff1690565b03613c555750613b2c92613c48613b1392611da7565b9060005260206000200190565b915050613b7191613c75613c67611e77565b65ffffffffffff9093168352565b6001600160d01b03881682860152613a14565b613bc49250613c98613c67611e77565b6001600160d01b0385166020830152613a1456fea26469706673582212204cebd50656486e4de9b3557ce1fe25e610be769d18e1daac2127493091eaea9d64736f6c63430008180033

00000000000000000000000000000000000000000052b7d2dcc80cd2e4000000000000000000000000000000545d4fccbabe6e5d3e0f7f2d3dc511d436369472

-----Decoded View---------------
Arg [0] : initialSupply (uint256): 100000000000000000000000000
Arg [1] : initialInterface (address): 0x545D4FCCbaBE6e5d3e0F7F2D3dC511d436369472

-----Encoded View---------------
2 Constructor Arguments found :
Arg [0] : 00000000000000000000000000000000000000000052b7d2dcc80cd2e4000000
Arg [1] : 000000000000000000000000545d4fccbabe6e5d3e0f7f2d3dc511d436369472