Contract Source Code (Solidity Standard Json-Input format)

IDE

• Blockscan IDE
• 🤖 Code ReaderBeta
• Remix IDE

More Options

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

// SPDX-License-Identifier: BUSL-1.1
// Copyright (c) 2024 EscapeHub. All rights reserved.
// Licensed under the Business Source License 1.1 (BUSL-1.1)
// See LICENSE file for details: https://github.com/OmniJunk/escapehub-token-creator/blob/main/LICENSE
// Change Date: 2028-12-01
// Change License: MIT
//
// Commercial use of this software requires a license from EscapeHub.
// Contact: admin@escapehub.ai
pragma solidity ^0.8.24;

import {LaunchERC20} from "./LaunchERC20.sol";
import {Clones} from "@openzeppelin/contracts/proxy/Clones.sol";

/// @notice Minimal Chainlink Aggregator interface
interface AggregatorV3Interface {
    function latestRoundData() external view returns (
        uint80 roundId,
        int256 answer,
        uint256 startedAt,
        uint256 updatedAt,
        uint80 answeredInRound
    );
    function decimals() external view returns (uint8);
}

contract LaunchERC20Factory {
    error ZeroOwner();
    error ZeroSupply();
    error ArrayMismatch();
    error ZeroImplementation();
    error InsufficientFee();
    error FeeTransferFailed();
    error NotOwner();

    event TokenCreated(address indexed token, address indexed owner, bytes32 salt);
    event InitialDistribution(address indexed token, address[] recipients, uint256[] amounts, string[] labels);
    event FeeCollected(address indexed creator, uint256 amount);
    event FallbackFeeUpdated(uint256 newFee);
    event OwnershipTransferred(address indexed previousOwner, address indexed newOwner);

    // ============ Protocol Fee Configuration ============
    /// @notice EscapeHub fee recipient - hardcoded, cannot be changed
    address public constant FEE_RECIPIENT = 0xD54F2B75f0aFcadE42e292f655f6777fd12b3Dd5;

    /// @notice Target fee in USD (18 decimals) - $1
    uint256 public constant TARGET_FEE_USD = 1e18;

    /// @notice The implementation contract used for clones
    address public immutable implementation;

    /// @notice Chainlink price feed for native/USD (address(0) if not available)
    AggregatorV3Interface public immutable priceFeed;

    /// @notice Factory owner (can set fallback fee)
    address public owner;

    /// @notice Fallback fee in native tokens (used when Chainlink unavailable)
    uint256 public fallbackFee;

    /// @notice When fallbackFee was last updated
    uint256 public fallbackFeeUpdatedAt;

    /// @notice Maximum staleness for Chainlink data (1 hour)
    uint256 public constant MAX_STALENESS = 3600;

    /// @notice Maximum staleness for fallback fee (3 days)
    uint256 public constant MAX_FALLBACK_STALENESS = 3 days;

    struct CreateParams {
        // Basic token info
        string name;
        string symbol;
        uint8 decimals;
        uint256 initialSupply;
        address finalOwner;

        // Core features
        bool mintingEnabled;
        uint256 hardCap;
        bool pausable;
        bool rescueEnabled;
        bool burnEnabled;
        bool metadataMutable;
        bool socialsMutable;

        // Module enables
        bool feesModuleEnabled;
        bool limitsModuleEnabled;
        bool cooldownModuleEnabled;
        bool blacklistModuleEnabled;

        // Socials
        string website;
        string telegram;
        string xHandle;
        string discord;

        // Fee config
        bool feesEnabled;
        uint16 maxBuyFeeBps;
        uint16 maxSellFeeBps;
        uint16 maxTransferFeeBps;
        uint16 buyFeeBps;
        uint16 sellFeeBps;
        uint16 transferFeeBps;
        uint16 feeBurnShareBps;
        address feeRecipient;

        // Limits config
        uint256 maxWalletAmount;
        uint256 maxTxAmount;
        uint64 limitsEndTime;
        bool exemptRecipientsFromLimits;    // Exempt initial distribution recipients from limits
        address[] additionalLimitExempt;    // Additional addresses to exempt from limits

        // Cooldown config
        uint32 maxCooldownSeconds;
        uint32 cooldownSeconds;

        // Initial distribution
        address[] initialRecipients;
        uint256[] initialAmounts;
        string[] initialLabels;

        // Trading config
        uint64 tradingSchedule;
        bool enableTradingImmediately;
        address router;
        bool routerProtectionEnabled;

        // Blacklist config
        address[] initialBlacklist;
        bool freezeBlacklistAfterDeploy;

        // Ownership
        bool renounceOwnership;

        // Deployment
        bool useSalt;
        bytes32 salt;

        // ============ NEW: Deadblock config ============
        bool deadblocksEnabled;
        uint8 deadBlocks;
        uint8 deadblockMode; // 0=buys, 1=sells, 2=both
        bool deadblockExemptLimitExempt;

        // ============ NEW: Whitelist config ============
        bool whitelistModuleEnabled;
        uint8 whitelistMode; // 0=disabled, 1=pre-trading, 2=always
        bool whitelistAutoDisable;
        bool whitelistBypassesRouter;
        bool whitelistMutable;
        address[] initialWhitelist;
        bool freezeWhitelistAfterDeploy;

        // ============ NEW: Anti-dump config ============
        bool antiDumpModuleEnabled;
        uint8 antiDumpType; // 0=absolute, 1=percentage
        uint256 maxAntiDumpLimit;
        uint64 maxAntiDumpPeriod;
        uint256 antiDumpLimit;
        uint64 antiDumpPeriod;
        uint64 antiDumpEndTime;

        // ============ NEW: Batch transfer config ============
        uint8 batchTransferAccess; // 0=anyone, 1=owner
        uint8 batchTransferFees; // 0=normal, 1=none, 2=owner-none
        uint16 maxBatchSize;

        // ============ NEW: Permit config ============
        bool permitEnabled;

        // ============ NEW: Freeze after deploy config ============
        bool freezeFeesAfterDeploy;
        bool freezeLimitsAfterDeploy;
        bool freezeCooldownAfterDeploy;
        bool freezeAntiDumpAfterDeploy;

        // ============ NEW: Ownership transfer blocking ============
        bool blockOwnershipTransferAfterDeploy;
    }

    modifier onlyOwner() {
        if (msg.sender != owner) revert NotOwner();
        _;
    }

    /// @notice Creates factory with implementation address and optional price feed
    /// @param implementation_ The LaunchERC20 implementation contract
    /// @param priceFeed_ Chainlink native/USD price feed (address(0) if not available on this chain)
    /// @param fallbackFee_ Initial fallback fee in native tokens (for chains without Chainlink)
    constructor(address implementation_, address priceFeed_, uint256 fallbackFee_) {
        if (implementation_ == address(0)) revert ZeroImplementation();
        implementation = implementation_;
        priceFeed = AggregatorV3Interface(priceFeed_);
        fallbackFee = fallbackFee_;
        if (fallbackFee_ > 0) {
            fallbackFeeUpdatedAt = block.timestamp;
        }
        owner = msg.sender;
    }

    // ============ Fee Calculation ============

    /// @notice Get the creation fee in native tokens
    /// @dev Tries Chainlink first, falls back to fallbackFee, returns 0 if both unavailable
    /// @return fee The fee amount in native tokens (wei)
    function getCreationFee() public view returns (uint256 fee) {
        // 1. Try Chainlink price feed
        if (address(priceFeed) != address(0)) {
            try priceFeed.latestRoundData() returns (
                uint80,
                int256 price,
                uint256,
                uint256 updatedAt,
                uint80
            ) {
                // Check price is positive and not stale
                if (price > 0 && block.timestamp - updatedAt <= MAX_STALENESS) {
                    uint8 decimals = priceFeed.decimals();
                    // Calculate: $1 worth of native token
                    // price is native/USD with `decimals` precision
                    // We want: 1 USD / price = native tokens needed
                    // Result in wei (18 decimals)
                    fee = (TARGET_FEE_USD * (10 ** decimals)) / uint256(price);
                    return fee;
                }
            } catch {
                // Chainlink call failed, continue to fallback
            }
        }

        // 2. Use fallback fee (if not stale)
        if (fallbackFee > 0 && block.timestamp - fallbackFeeUpdatedAt <= MAX_FALLBACK_STALENESS) {
            return fallbackFee;
        }

        // 3. Both unavailable or stale - free creation
        return 0;
    }

    // ============ Owner Functions ============

    /// @notice Set the fallback fee (for chains without Chainlink or as override)
    /// @param newFee New fallback fee in native tokens (wei)
    function setFallbackFee(uint256 newFee) external onlyOwner {
        fallbackFee = newFee;
        fallbackFeeUpdatedAt = block.timestamp;
        emit FallbackFeeUpdated(newFee);
    }

    /// @notice Transfer factory ownership
    /// @param newOwner New owner address
    function transferOwnership(address newOwner) external onlyOwner {
        address oldOwner = owner;
        owner = newOwner;
        emit OwnershipTransferred(oldOwner, newOwner);
    }

    function createToken(CreateParams calldata p) external payable returns (address) {
        // Collect protocol fee
        uint256 requiredFee = getCreationFee();
        if (msg.value < requiredFee) revert InsufficientFee();

        // Send fee to EscapeHub (if any)
        if (msg.value > 0 && FEE_RECIPIENT != address(0)) {
            (bool ok,) = FEE_RECIPIENT.call{value: msg.value}("");
            if (!ok) revert FeeTransferFailed();
            emit FeeCollected(msg.sender, msg.value);
        }

        if (p.finalOwner == address(0)) revert ZeroOwner();
        if (p.initialSupply == 0) revert ZeroSupply();
        uint256 len = p.initialRecipients.length;
        if (len != p.initialAmounts.length || len != p.initialLabels.length) revert ArrayMismatch();

        // Build InitConfig
        LaunchERC20.InitConfig memory cfg = LaunchERC20.InitConfig({
            // Basic
            name: p.name,
            symbol: p.symbol,
            decimals: p.decimals,
            initialSupply: p.initialSupply,
            owner: address(this), // Factory is temporary owner

            // Core features
            mintingEnabled: p.mintingEnabled,
            hardCap: p.hardCap,
            pausable: p.pausable,
            rescueEnabled: p.rescueEnabled,
            burnEnabled: p.burnEnabled,
            metadataMutable: p.metadataMutable,
            socialsMutable: p.socialsMutable,

            // Modules
            feesModuleEnabled: p.feesModuleEnabled,
            limitsModuleEnabled: p.limitsModuleEnabled,
            cooldownModuleEnabled: p.cooldownModuleEnabled,
            blacklistModuleEnabled: p.blacklistModuleEnabled,

            // Fee caps
            maxBuyFeeBps: p.maxBuyFeeBps,
            maxSellFeeBps: p.maxSellFeeBps,
            maxTransferFeeBps: p.maxTransferFeeBps,
            maxCooldownSeconds: p.maxCooldownSeconds,

            // Socials
            website: p.website,
            telegram: p.telegram,
            xHandle: p.xHandle,
            discord: p.discord,

            // Deadblock
            deadblocksEnabled: p.deadblocksEnabled,
            deadBlocks: p.deadBlocks,
            deadblockMode: p.deadblockMode,
            deadblockExemptLimitExempt: p.deadblockExemptLimitExempt,

            // Whitelist
            whitelistModuleEnabled: p.whitelistModuleEnabled,
            whitelistMode: p.whitelistMode,
            whitelistAutoDisable: p.whitelistAutoDisable,
            whitelistBypassesRouter: p.whitelistBypassesRouter,
            whitelistMutable: p.whitelistMutable,

            // Anti-dump
            antiDumpModuleEnabled: p.antiDumpModuleEnabled,
            antiDumpType: p.antiDumpType,
            maxAntiDumpLimit: p.maxAntiDumpLimit,
            maxAntiDumpPeriod: p.maxAntiDumpPeriod,

            // Batch transfer
            batchTransferAccess: p.batchTransferAccess,
            batchTransferFees: p.batchTransferFees,
            maxBatchSize: p.maxBatchSize,

            // Permit
            permitEnabled: p.permitEnabled
        });

        // Deploy clone with or without salt
        address tokenAddr = p.useSalt
            ? Clones.cloneDeterministic(implementation, p.salt)
            : Clones.clone(implementation);

        LaunchERC20 token = LaunchERC20(payable(tokenAddr));
        token.initialize(cfg);

        _configure(token, p, len);

        emit TokenCreated(address(token), p.finalOwner, p.useSalt ? p.salt : bytes32(0));
        return address(token);
    }

    function _configure(LaunchERC20 token, CreateParams calldata p, uint256 len) private {
        // ============ Fees ============
        if (p.feesModuleEnabled && p.feesEnabled) {
            token.setFees(
                p.buyFeeBps,
                p.sellFeeBps,
                p.transferFeeBps,
                p.feeBurnShareBps,
                p.feeRecipient != address(0) ? p.feeRecipient : p.finalOwner,
                true
            );
        }

        // ============ Limits ============
        if (p.limitsModuleEnabled && (p.maxWalletAmount | p.maxTxAmount) > 0) {
            token.setLimits(p.maxWalletAmount, p.maxTxAmount, p.limitsEndTime);

            // Optionally exempt initial distribution recipients from limits
            if (p.exemptRecipientsFromLimits) {
                for (uint256 i; i < len;) {
                    token.setLimitExempt(p.initialRecipients[i], true);
                    unchecked { ++i; }
                }
            }

            // Exempt any additional addresses specified by user
            uint256 additionalLen = p.additionalLimitExempt.length;
            for (uint256 i; i < additionalLen;) {
                token.setLimitExempt(p.additionalLimitExempt[i], true);
                unchecked { ++i; }
            }

            // Always exempt final owner (deployer needs to manage tokens freely)
            token.setLimitExempt(p.finalOwner, true);
        }

        // ============ Cooldown ============
        if (p.cooldownModuleEnabled && p.cooldownSeconds > 0) {
            token.setCooldown(p.cooldownSeconds);
        }

        // ============ Router protection ============
        if (p.router != address(0) || p.routerProtectionEnabled) {
            token.setRouter(p.router, p.routerProtectionEnabled);
        }

        // NOTE: Blacklist setup moved to AFTER distribution (see below)
        // This allows blacklisted addresses to receive initial distribution,
        // then be blocked from further transfers.

        // ============ Initial whitelist ============
        if (p.whitelistModuleEnabled && p.initialWhitelist.length > 0) {
            token.setWhitelistedBatch(p.initialWhitelist, true);
        }

        // Freeze whitelist after setting initial addresses
        if (p.whitelistModuleEnabled && p.freezeWhitelistAfterDeploy) {
            token.freezeWhitelist();
        }

        // ============ NEW: Anti-dump initial config ============
        if (p.antiDumpModuleEnabled && p.antiDumpLimit > 0) {
            token.setAntiDump(p.antiDumpLimit, p.antiDumpPeriod, p.antiDumpEndTime);
        }

        // ============ NEW: Freeze modules after configuration ============
        if (p.feesModuleEnabled && p.freezeFeesAfterDeploy) {
            token.freezeFees();
        }
        if (p.limitsModuleEnabled && p.freezeLimitsAfterDeploy) {
            token.freezeLimits();
        }
        if (p.cooldownModuleEnabled && p.freezeCooldownAfterDeploy) {
            token.freezeCooldown();
        }
        if (p.antiDumpModuleEnabled && p.freezeAntiDumpAfterDeploy) {
            token.freezeAntiDump();
        }

        // ============ Trading: schedule OR enable immediately ============
        if (p.tradingSchedule > 0) {
            token.setTradingSchedule(p.tradingSchedule);
        } else if (p.enableTradingImmediately) {
            token.enableTrading();
        }

        // ============ Initial distribution ============
        for (uint256 i; i < len;) {
            token.transfer(p.initialRecipients[i], p.initialAmounts[i]);
            unchecked { ++i; }
        }

        // Emit distribution event for on-chain record
        if (len > 0) {
            emit InitialDistribution(address(token), p.initialRecipients, p.initialAmounts, p.initialLabels);
        }

        // Remaining tokens to final owner
        uint256 rem = token.balanceOf(address(this));
        if (rem > 0) token.transfer(p.finalOwner, rem);

        // ============ Initial blacklist (AFTER distribution) ============
        // Set blacklist after distribution so blacklisted addresses can receive
        // their initial tokens, but are then blocked from further transfers.
        if (p.blacklistModuleEnabled && p.initialBlacklist.length > 0) {
            for (uint256 i; i < p.initialBlacklist.length;) {
                token.setBlacklist(p.initialBlacklist[i], true);
                unchecked { ++i; }
            }
        }

        // Freeze blacklist after setting initial addresses
        if (p.blacklistModuleEnabled && p.freezeBlacklistAfterDeploy) {
            token.freezeBlacklist();
        }

        // ============ Ownership: transfer or renounce ============
        if (p.renounceOwnership) {
            token.renounceOwnership();
        } else {
            token.transferOwnership(p.finalOwner);
        }
        // Note: blockOwnershipTransferAfterDeploy is a frontend hint only.
        // The new owner must call token.blockOwnershipTransfer() themselves
        // after deployment if they want to prevent future ownership transfers.
    }

    /// @notice Predicts the address of a deterministic clone
    /// @param salt The salt to use for the clone
    /// @return The predicted address
    function predictAddress(bytes32 salt) external view returns (address) {
        return Clones.predictDeterministicAddress(implementation, salt);
    }
}

// SPDX-License-Identifier: BUSL-1.1
// Copyright (c) 2024 EscapeHub. All rights reserved.
// Licensed under the Business Source License 1.1 (BUSL-1.1)
// See LICENSE file for details: https://github.com/OmniJunk/escapehub-token-creator/blob/main/LICENSE
// Change Date: 2028-12-01
// Change License: MIT
//
// Commercial use of this software requires a license from EscapeHub.
// Contact: admin@escapehub.ai
pragma solidity ^0.8.24;

import {ERC20Upgradeable} from "@openzeppelin/contracts-upgradeable/token/ERC20/ERC20Upgradeable.sol";
import {ERC20PermitUpgradeable} from "@openzeppelin/contracts-upgradeable/token/ERC20/extensions/ERC20PermitUpgradeable.sol";
import {OwnableUpgradeable} from "@openzeppelin/contracts-upgradeable/access/OwnableUpgradeable.sol";
import {Initializable} from "@openzeppelin/contracts-upgradeable/proxy/utils/Initializable.sol";
import {ReentrancyGuard} from "@openzeppelin/contracts/utils/ReentrancyGuard.sol";
import {IERC20} from "@openzeppelin/contracts/token/ERC20/IERC20.sol";
import {SafeERC20} from "@openzeppelin/contracts/token/ERC20/utils/SafeERC20.sol";

contract LaunchERC20 is Initializable, ERC20Upgradeable, ERC20PermitUpgradeable, OwnableUpgradeable, ReentrancyGuard {
    using SafeERC20 for IERC20;
    // ============ Custom Errors ============
    error ZeroOwner();
    error MintingDisabled();
    error CapExceeded();
    error TransfersPaused();
    error Blacklisted();
    error TradingNotEnabled();
    error RouterBlocked();
    error MaxTxExceeded();
    error MaxWalletExceeded();
    error CooldownActive();
    error FeesModuleDisabled();
    error LimitsModuleDisabled();
    error CooldownModuleDisabled();
    error BlacklistModuleDisabled();
    error PauseDisabled();
    error RescueDisabled();
    error BurnDisabled();
    error TradingAlreadyEnabled();
    error ScheduleInPast();
    error NoSchedule();
    error FeeAboveMax();
    error BurnShareTooHigh();
    error RecipientZero();
    error CooldownAboveMax();
    error CooldownCannotIncrease();
    error BlacklistFrozen();
    error MetadataLocked();
    error SocialsLocked();
    error TransferFailed();
    error DeadblockActive();
    error WhitelistModuleDisabled();
    error NotWhitelisted();
    error WhitelistNotMutable();
    error WhitelistAlreadyDisabled();
    error AntiDumpModuleDisabled();
    error AntiDumpLimitExceeded();
    error AntiDumpAboveMax();
    error AntiDumpPeriodAboveMax();
    error BatchTooLarge();
    error BatchAccessDenied();
    error BatchArrayMismatch();
    error CannotRescueSelf();
    error FeesFrozen();
    error LimitsFrozen();
    error CooldownFrozen();
    error AntiDumpFrozen();
    error OwnershipTransferBlocked();
    error PermitDisabled();

    // ============ Token Metadata ============
    uint8 private _customDecimals;
    string private _customName;
    string private _customSymbol;
    bool public metadataMutable;
    bool public socialsMutable;
    string public website;
    string public telegram;
    string public xHandle;
    string public discord;

    // ============ Core Feature Flags ============
    bool public mintingEnabled;
    bool public pausable;
    bool public rescueEnabled;
    bool public burnEnabled;
    bool public feesModuleEnabled;
    bool public limitsModuleEnabled;
    bool public cooldownModuleEnabled;
    bool public blacklistModuleEnabled;
    uint256 public hardCap;
    uint16 public maxBuyFeeBps;
    uint16 public maxSellFeeBps;
    uint16 public maxTransferFeeBps;
    uint32 public maxCooldownSeconds;

    // ============ Deadblock Module ============
    bool public deadblocksEnabled;
    uint8 public deadBlocks;
    uint8 public deadblockMode;
    bool public deadblockExemptLimitExempt;

    // ============ Whitelist Module ============
    bool public whitelistModuleEnabled;
    uint8 public whitelistMode;
    bool public whitelistAutoDisable;
    bool public whitelistBypassesRouter;
    bool public whitelistMutable;
    bool public whitelistActive;
    mapping(address => bool) public isWhitelisted;

    // ============ Anti-Dump Module ============
    bool public antiDumpModuleEnabled;
    uint8 public antiDumpType;
    uint256 public maxAntiDumpLimit;
    uint64 public maxAntiDumpPeriod;
    uint256 public antiDumpLimit;
    uint64 public antiDumpPeriod;
    uint64 public antiDumpEndTime;
    mapping(address => bool) public isAntiDumpExempt;
    mapping(address => uint256) public soldInPeriod;
    mapping(address => uint64) public periodStartTime;
    mapping(address => uint256) public balanceAtPeriodStart;

    // ============ Freeze State ============
    bool public feesFrozen;
    bool public limitsFrozen;
    bool public cooldownFrozen;
    bool public antiDumpFrozen;

    // ============ Ownership & Permit Control ============
    bool public ownershipTransferBlocked;
    bool public permitEnabled;

    // ============ Batch Transfer Config ============
    uint8 public batchTransferAccess;
    uint8 public batchTransferFees;
    uint16 public maxBatchSize;

    // ============ Pause State ============
    bool private _paused;

    // ============ Fees State ============
    uint16 public feeBurnShareBps;
    bool public feesEnabled;
    uint16 public buyFeeBps;
    uint16 public sellFeeBps;
    uint16 public transferFeeBps;
    address public feeRecipient;
    mapping(address => bool) public isFeeExempt;

    // ============ Trading State ============
    bool public tradingEnabled;
    uint64 public tradingEnabledAt;
    uint256 public tradingEnabledBlock;
    address public router;
    bool public routerProtectionEnabled;
    mapping(address => bool) public automatedMarketMakerPairs;

    // ============ Limits State ============
    uint256 public maxWalletAmount;
    uint256 public maxTxAmount;
    uint64 public limitsEndTime;
    mapping(address => bool) public isLimitExempt;

    // ============ Cooldown State ============
    uint32 public cooldownSeconds;
    mapping(address => uint64) public lastTradeTime;
    mapping(address => bool) public isCooldownExempt;

    // ============ Blacklist State ============
    mapping(address => bool) public isBlacklisted;
    bool public blacklistFrozen;

    // ============ Trading Schedule ============
    uint64 public tradingSchedule;

    // ============ Events ============
    event TradingEnabled(uint64 at, uint256 blockNumber);
    event RouterUpdated(address router, bool protectionEnabled);
    event FeesUpdated(uint16 buy, uint16 sell, uint16 transfer_, uint16 burn, address recipient, bool enabled);
    event LimitsUpdated(uint256 maxWallet, uint256 maxTx, uint64 endTime);
    event CooldownUpdated(uint32 seconds_);
    event AutomatedMarketMakerPairSet(address pair, bool value);
    event BlacklistUpdated(address account, bool value);
    event MetadataUpdated(string name, string symbol);
    event MetadataFrozen();
    event SocialsUpdated(string website, string telegram, string xHandle, string discord);
    event SocialsFrozen();
    event BlacklistFrozenEvt();
    event Paused();
    event Unpaused();
    event TradingScheduled(uint64 timestamp);
    event TradingScheduleCleared();
    event WhitelistUpdated(address indexed account, bool status);
    event WhitelistBatchUpdated(uint256 count, bool status);
    event WhitelistDisabled();
    event WhitelistFrozen();
    event AntiDumpUpdated(uint256 limit, uint64 period, uint64 endTime);
    event AntiDumpExemptUpdated(address indexed account, bool exempt);
    event BatchTransfer(address indexed from, uint256 recipientCount, uint256 totalAmount);
    event FeesFrozenEvt();
    event LimitsFrozenEvt();
    event CooldownFrozenEvt();
    event AntiDumpFrozenEvt();
    event OwnershipBlocked();

    // ============ InitConfig Struct ============
    struct InitConfig {
        string name;
        string symbol;
        uint8 decimals;
        uint256 initialSupply;
        address owner;
        bool mintingEnabled;
        uint256 hardCap;
        bool pausable;
        bool rescueEnabled;
        bool burnEnabled;
        bool metadataMutable;
        bool socialsMutable;
        bool feesModuleEnabled;
        bool limitsModuleEnabled;
        bool cooldownModuleEnabled;
        bool blacklistModuleEnabled;
        uint16 maxBuyFeeBps;
        uint16 maxSellFeeBps;
        uint16 maxTransferFeeBps;
        uint32 maxCooldownSeconds;
        string website;
        string telegram;
        string xHandle;
        string discord;
        bool deadblocksEnabled;
        uint8 deadBlocks;
        uint8 deadblockMode;
        bool deadblockExemptLimitExempt;
        bool whitelistModuleEnabled;
        uint8 whitelistMode;
        bool whitelistAutoDisable;
        bool whitelistBypassesRouter;
        bool whitelistMutable;
        bool antiDumpModuleEnabled;
        uint8 antiDumpType;
        uint256 maxAntiDumpLimit;
        uint64 maxAntiDumpPeriod;
        uint8 batchTransferAccess;
        uint8 batchTransferFees;
        uint16 maxBatchSize;
        bool permitEnabled;
    }

    /// @custom:oz-upgrades-unsafe-allow constructor
    /// @notice Disables initializers on the implementation contract for security
    constructor() {
        _disableInitializers();
    }

    // ============ Initializer ============
    function initialize(InitConfig calldata cfg) external initializer {
        if (cfg.owner == address(0)) revert ZeroOwner();

        __ERC20_init(cfg.name, cfg.symbol);
        __ERC20Permit_init(cfg.name);
        __Ownable_init(cfg.owner);

        _customDecimals = cfg.decimals;
        _customName = cfg.name;
        _customSymbol = cfg.symbol;
        metadataMutable = cfg.metadataMutable;
        socialsMutable = cfg.socialsMutable;
        website = cfg.website;
        telegram = cfg.telegram;
        xHandle = cfg.xHandle;
        discord = cfg.discord;

        mintingEnabled = cfg.mintingEnabled;
        hardCap = cfg.hardCap;
        pausable = cfg.pausable;
        rescueEnabled = cfg.rescueEnabled;
        burnEnabled = cfg.burnEnabled;

        feesModuleEnabled = cfg.feesModuleEnabled;
        limitsModuleEnabled = cfg.limitsModuleEnabled;
        cooldownModuleEnabled = cfg.cooldownModuleEnabled;
        blacklistModuleEnabled = cfg.blacklistModuleEnabled;

        if (cfg.maxBuyFeeBps > 2000 || cfg.maxSellFeeBps > 2000 || cfg.maxTransferFeeBps > 2000) revert FeeAboveMax();
        if (cfg.maxCooldownSeconds > 3600) revert CooldownAboveMax();

        maxBuyFeeBps = cfg.maxBuyFeeBps;
        maxSellFeeBps = cfg.maxSellFeeBps;
        maxTransferFeeBps = cfg.maxTransferFeeBps;
        maxCooldownSeconds = cfg.maxCooldownSeconds;

        deadblocksEnabled = cfg.deadblocksEnabled;
        deadBlocks = cfg.deadBlocks;
        deadblockMode = cfg.deadblockMode;
        deadblockExemptLimitExempt = cfg.deadblockExemptLimitExempt;

        whitelistModuleEnabled = cfg.whitelistModuleEnabled;
        whitelistMode = cfg.whitelistMode;
        whitelistAutoDisable = cfg.whitelistAutoDisable;
        whitelistBypassesRouter = cfg.whitelistBypassesRouter;
        whitelistMutable = cfg.whitelistMutable;
        whitelistActive = cfg.whitelistModuleEnabled && cfg.whitelistMode != 0;

        antiDumpModuleEnabled = cfg.antiDumpModuleEnabled;
        antiDumpType = cfg.antiDumpType;
        maxAntiDumpLimit = cfg.maxAntiDumpLimit;
        maxAntiDumpPeriod = cfg.maxAntiDumpPeriod;

        batchTransferAccess = cfg.batchTransferAccess;
        batchTransferFees = cfg.batchTransferFees;
        maxBatchSize = cfg.maxBatchSize > 0 ? cfg.maxBatchSize : 200;

        permitEnabled = cfg.permitEnabled;

        if (cfg.mintingEnabled && cfg.hardCap != 0 && cfg.initialSupply > cfg.hardCap) revert CapExceeded();

        _mint(cfg.owner, cfg.initialSupply);

        isFeeExempt[cfg.owner] = true;
        isLimitExempt[cfg.owner] = true;
        isCooldownExempt[cfg.owner] = true;
        isAntiDumpExempt[cfg.owner] = true;
        isLimitExempt[address(this)] = true;
        isCooldownExempt[address(this)] = true;
        isAntiDumpExempt[address(this)] = true;

        if (whitelistActive) {
            isWhitelisted[cfg.owner] = true;
            isWhitelisted[address(this)] = true;
        }
    }

    // ============ Modifiers ============
    modifier whenNotPaused() {
        if (pausable && _paused) revert TransfersPaused();
        _;
    }

    // ============ ERC20 Overrides ============
    function decimals() public view override returns (uint8) { return _customDecimals; }
    function name() public view override(ERC20Upgradeable) returns (string memory) { return _customName; }
    function symbol() public view override(ERC20Upgradeable) returns (string memory) { return _customSymbol; }

    // ============ Transfer Logic ============
    function _update(address from, address to, uint256 amount) internal override whenNotPaused {
        if (from == address(0) || to == address(0)) {
            super._update(from, to, amount);
            return;
        }

        uint256 feeAmount;
        uint256 sendAmount = amount;

        if (feesModuleEnabled && feesEnabled && !isFeeExempt[from] && !isFeeExempt[to] && (buyFeeBps | sellFeeBps | transferFeeBps) > 0) {
            uint16 feeBps = automatedMarketMakerPairs[from] ? buyFeeBps : (automatedMarketMakerPairs[to] ? sellFeeBps : transferFeeBps);
            if (feeBps > 0) {
                feeAmount = (amount * feeBps) / 10000;
                sendAmount = amount - feeAmount;
            }
        }

        _preTransferChecks(from, to, amount, sendAmount);

        if (feeAmount > 0) {
            uint256 burnAmount;
            uint256 walletAmount = feeAmount;

            if (burnEnabled && feeBurnShareBps > 0) {
                burnAmount = (feeAmount * feeBurnShareBps) / 10000;
                walletAmount = feeAmount - burnAmount;
            }

            if (burnAmount > 0) super._update(from, address(0), burnAmount);
            if (walletAmount > 0 && feeRecipient != address(0)) super._update(from, feeRecipient, walletAmount);
        }

        super._update(from, to, sendAmount);
    }

    // ============ Burn Function ============
    function burn(uint256 amount) external {
        if (!burnEnabled) revert BurnDisabled();
        _burn(msg.sender, amount);
    }

    // ============ Mint Function ============
    function mint(address to, uint256 amount) external onlyOwner {
        if (!mintingEnabled) revert MintingDisabled();
        if (blacklistModuleEnabled && isBlacklisted[to]) revert Blacklisted();
        if (hardCap != 0 && totalSupply() + amount > hardCap) revert CapExceeded();
        _mint(to, amount);
    }

    // ============ Pause Functions ============
    function pause() external onlyOwner {
        if (!pausable) revert PauseDisabled();
        _paused = true;
        emit Paused();
    }

    function unpause() external onlyOwner {
        if (!pausable) revert PauseDisabled();
        _paused = false;
        emit Unpaused();
    }

    function paused() external view returns (bool) { return _paused; }

    // ============ Trading Functions ============
    function setTradingSchedule(uint64 timestamp) external onlyOwner {
        if (tradingEnabled) revert TradingAlreadyEnabled();
        if (timestamp <= block.timestamp) revert ScheduleInPast();
        tradingSchedule = timestamp;
        emit TradingScheduled(timestamp);
    }

    function clearTradingSchedule() external onlyOwner {
        if (tradingEnabled) revert TradingAlreadyEnabled();
        if (tradingSchedule == 0) revert NoSchedule();
        tradingSchedule = 0;
        emit TradingScheduleCleared();
    }

    function enableTrading() external onlyOwner {
        if (tradingEnabled) revert TradingAlreadyEnabled();
        if (tradingSchedule != 0) {
            tradingSchedule = 0;
            emit TradingScheduleCleared();
        }
        _enableTrading();
    }

    function _enableTrading() internal {
        tradingEnabled = true;
        tradingEnabledAt = uint64(block.timestamp);
        tradingEnabledBlock = block.number;
        emit TradingEnabled(tradingEnabledAt, tradingEnabledBlock);

        if (whitelistModuleEnabled && whitelistAutoDisable && whitelistActive) {
            whitelistActive = false;
            emit WhitelistDisabled();
        }
    }

    function setRouter(address router_, bool protectionEnabled_) external onlyOwner {
        router = router_;
        routerProtectionEnabled = protectionEnabled_;
        emit RouterUpdated(router_, protectionEnabled_);
    }

    function setAutomatedMarketMakerPair(address pair, bool value) external onlyOwner {
        automatedMarketMakerPairs[pair] = value;
        isLimitExempt[pair] = true;
        isCooldownExempt[pair] = true;
        isFeeExempt[pair] = true;
        isAntiDumpExempt[pair] = true;
        if (whitelistActive) {
            isWhitelisted[pair] = true;
        }
        emit AutomatedMarketMakerPairSet(pair, value);
    }

    function isTradingOpen() external view returns (bool) {
        return tradingEnabled || (tradingSchedule != 0 && block.timestamp >= tradingSchedule);
    }

    // ============ Fee Functions ============
    function setFees(uint16 buy, uint16 sell, uint16 transfer_, uint16 burnShare, address recipient, bool enabled) external onlyOwner {
        if (!feesModuleEnabled) revert FeesModuleDisabled();
        if (feesFrozen) revert FeesFrozen();
        if (buy > maxBuyFeeBps || sell > maxSellFeeBps || transfer_ > maxTransferFeeBps) revert FeeAboveMax();
        if (burnShare > 10000) revert BurnShareTooHigh();
        if (recipient == address(0) && enabled && burnShare < 10000) revert RecipientZero();

        buyFeeBps = buy;
        sellFeeBps = sell;
        transferFeeBps = transfer_;
        feeBurnShareBps = burnShare;
        feeRecipient = recipient;
        feesEnabled = enabled;
        emit FeesUpdated(buy, sell, transfer_, burnShare, recipient, enabled);
    }

    function setFeeExempt(address account, bool exempt) external onlyOwner {
        if (!feesModuleEnabled) revert FeesModuleDisabled();
        isFeeExempt[account] = exempt;
    }

    function freezeFees() external onlyOwner {
        if (!feesModuleEnabled) revert FeesModuleDisabled();
        if (feesFrozen) revert FeesFrozen();
        feesFrozen = true;
        emit FeesFrozenEvt();
    }

    // ============ Limits Functions ============
    function setLimits(uint256 maxWallet, uint256 maxTx, uint64 endTime) external onlyOwner {
        if (!limitsModuleEnabled) revert LimitsModuleDisabled();
        if (limitsFrozen) revert LimitsFrozen();
        maxWalletAmount = maxWallet;
        maxTxAmount = maxTx;
        limitsEndTime = endTime;
        emit LimitsUpdated(maxWallet, maxTx, endTime);
    }

    function setLimitExempt(address account, bool exempt) external onlyOwner {
        if (!limitsModuleEnabled) revert LimitsModuleDisabled();
        isLimitExempt[account] = exempt;
    }

    function freezeLimits() external onlyOwner {
        if (!limitsModuleEnabled) revert LimitsModuleDisabled();
        if (limitsFrozen) revert LimitsFrozen();
        limitsFrozen = true;
        emit LimitsFrozenEvt();
    }

    // ============ Cooldown Functions ============
    function setCooldown(uint32 seconds_) external onlyOwner {
        if (!cooldownModuleEnabled) revert CooldownModuleDisabled();
        if (cooldownFrozen) revert CooldownFrozen();
        if (seconds_ > maxCooldownSeconds) revert CooldownAboveMax();
        if (tradingEnabled && seconds_ > cooldownSeconds) revert CooldownCannotIncrease();
        cooldownSeconds = seconds_;
        emit CooldownUpdated(seconds_);
    }

    function setCooldownExempt(address account, bool exempt) external onlyOwner {
        if (!cooldownModuleEnabled) revert CooldownModuleDisabled();
        isCooldownExempt[account] = exempt;
    }

    function freezeCooldown() external onlyOwner {
        if (!cooldownModuleEnabled) revert CooldownModuleDisabled();
        if (cooldownFrozen) revert CooldownFrozen();
        cooldownFrozen = true;
        emit CooldownFrozenEvt();
    }

    // ============ Blacklist Functions ============
    function setBlacklist(address account, bool value) external onlyOwner {
        if (!blacklistModuleEnabled) revert BlacklistModuleDisabled();
        if (blacklistFrozen) revert BlacklistFrozen();
        isBlacklisted[account] = value;
        emit BlacklistUpdated(account, value);
    }

    function freezeBlacklist() external onlyOwner {
        if (!blacklistModuleEnabled) revert BlacklistModuleDisabled();
        if (blacklistFrozen) revert BlacklistFrozen();
        blacklistFrozen = true;
        emit BlacklistFrozenEvt();
    }

    // ============ Whitelist Functions ============
    function setWhitelisted(address account, bool status) external onlyOwner {
        if (!whitelistModuleEnabled) revert WhitelistModuleDisabled();
        if (!whitelistMutable) revert WhitelistNotMutable();
        isWhitelisted[account] = status;
        emit WhitelistUpdated(account, status);
    }

    function setWhitelistedBatch(address[] calldata accounts, bool status) external onlyOwner {
        if (!whitelistModuleEnabled) revert WhitelistModuleDisabled();
        if (!whitelistMutable) revert WhitelistNotMutable();
        uint256 len = accounts.length;
        for (uint256 i; i < len;) {
            isWhitelisted[accounts[i]] = status;
            unchecked { ++i; }
        }
        emit WhitelistBatchUpdated(len, status);
    }

    function disableWhitelist() external onlyOwner {
        if (!whitelistModuleEnabled) revert WhitelistModuleDisabled();
        if (!whitelistActive) revert WhitelistAlreadyDisabled();
        whitelistActive = false;
        emit WhitelistDisabled();
    }

    function freezeWhitelist() external onlyOwner {
        if (!whitelistModuleEnabled) revert WhitelistModuleDisabled();
        if (!whitelistMutable) revert WhitelistNotMutable();
        whitelistMutable = false;
        emit WhitelistFrozen();
    }

    // ============ Anti-Dump Functions ============
    function setAntiDump(uint256 limit, uint64 period, uint64 endTime) external onlyOwner {
        if (!antiDumpModuleEnabled) revert AntiDumpModuleDisabled();
        if (antiDumpFrozen) revert AntiDumpFrozen();
        if (maxAntiDumpLimit > 0 && limit > maxAntiDumpLimit) revert AntiDumpAboveMax();
        if (maxAntiDumpPeriod > 0 && period > maxAntiDumpPeriod) revert AntiDumpPeriodAboveMax();
        antiDumpLimit = limit;
        antiDumpPeriod = period;
        antiDumpEndTime = endTime;
        emit AntiDumpUpdated(limit, period, endTime);
    }

    function setAntiDumpExempt(address account, bool exempt) external onlyOwner {
        if (!antiDumpModuleEnabled) revert AntiDumpModuleDisabled();
        isAntiDumpExempt[account] = exempt;
        emit AntiDumpExemptUpdated(account, exempt);
    }

    function freezeAntiDump() external onlyOwner {
        if (!antiDumpModuleEnabled) revert AntiDumpModuleDisabled();
        if (antiDumpFrozen) revert AntiDumpFrozen();
        antiDumpFrozen = true;
        emit AntiDumpFrozenEvt();
    }

    // ============ Batch Transfer Function ============
    function batchTransfer(address[] calldata recipients, uint256[] calldata amounts) external returns (uint256 totalTransferred) {
        uint256 len = recipients.length;
        if (len != amounts.length) revert BatchArrayMismatch();
        if (len > maxBatchSize) revert BatchTooLarge();
        if (batchTransferAccess == 1 && msg.sender != owner()) revert BatchAccessDenied();

        bool skipFees = batchTransferFees == 1 || (batchTransferFees == 2 && msg.sender == owner());

        for (uint256 i; i < len;) {
            uint256 amt = amounts[i];
            address to = recipients[i];

            if (skipFees) {
                _directTransfer(msg.sender, to, amt);
            } else {
                transfer(to, amt);
            }

            totalTransferred += amt;
            unchecked { ++i; }
        }

        emit BatchTransfer(msg.sender, len, totalTransferred);
    }

    function _directTransfer(address from, address to, uint256 amount) internal {
        _preTransferChecks(from, to, amount, amount);
        super._update(from, to, amount);
    }

    // ============ Rescue Functions ============
    function rescueERC20(address token, uint256 amount, address to) external onlyOwner {
        if (!rescueEnabled) revert RescueDisabled();
        if (token == address(this)) revert CannotRescueSelf();
        if (to == address(0)) revert RecipientZero();
        IERC20(token).safeTransfer(to, amount);
    }

    function rescueETH(address to, uint256 amount) external onlyOwner nonReentrant {
        if (!rescueEnabled) revert RescueDisabled();
        if (to == address(0)) revert RecipientZero();
        (bool ok,) = to.call{value: amount}("");
        if (!ok) revert TransferFailed();
    }

    receive() external payable {}

    // ============ Metadata Functions ============
    function setTokenMetadata(string calldata newName, string calldata newSymbol) external onlyOwner {
        if (!metadataMutable) revert MetadataLocked();
        _customName = newName;
        _customSymbol = newSymbol;
        emit MetadataUpdated(newName, newSymbol);
    }

    function lockMetadata() external onlyOwner {
        if (!metadataMutable) revert MetadataLocked();
        metadataMutable = false;
        emit MetadataFrozen();
    }

    // ============ Socials Functions ============
    function setSocials(string calldata w, string calldata t, string calldata x, string calldata d) external onlyOwner {
        if (!socialsMutable) revert SocialsLocked();
        website = w;
        telegram = t;
        xHandle = x;
        discord = d;
        emit SocialsUpdated(w, t, x, d);
    }

    function lockSocials() external onlyOwner {
        if (!socialsMutable) revert SocialsLocked();
        socialsMutable = false;
        emit SocialsFrozen();
    }

    // ============ Ownership Transfer Control ============
    function blockOwnershipTransfer() external onlyOwner {
        if (ownershipTransferBlocked) revert OwnershipTransferBlocked();
        ownershipTransferBlocked = true;
        emit OwnershipBlocked();
    }

    function transferOwnership(address newOwner) public override onlyOwner {
        if (ownershipTransferBlocked) revert OwnershipTransferBlocked();
        super.transferOwnership(newOwner);
    }

    // ============ Permit Override ============
    function permit(
        address owner_,
        address spender,
        uint256 value,
        uint256 deadline,
        uint8 v,
        bytes32 r,
        bytes32 s
    ) public override {
        if (!permitEnabled) revert PermitDisabled();
        super.permit(owner_, spender, value, deadline, v, r, s);
    }

    // ============ Internal Transfer Checks ============
    function _preTransferChecks(address from, address to, uint256 amount, uint256 sendAmount) internal {
        if (!tradingEnabled && tradingSchedule != 0 && block.timestamp >= tradingSchedule) {
            tradingSchedule = 0;
            emit TradingScheduleCleared();
            _enableTrading();
        }

        if (blacklistModuleEnabled && (isBlacklisted[from] || isBlacklisted[to])) revert Blacklisted();

        if (whitelistModuleEnabled && whitelistActive && whitelistMode == 2) {
            if (!isWhitelisted[to]) revert NotWhitelisted();
        }

        if (!tradingEnabled) {
            if (whitelistModuleEnabled && whitelistActive && whitelistMode == 1) {
                bool fromOk = isWhitelisted[from] || from == owner();
                bool toOk = isWhitelisted[to] || to == owner();
                if (!fromOk && !toOk) revert NotWhitelisted();

                if (routerProtectionEnabled && (from == router || to == router)) {
                    if (!whitelistBypassesRouter) revert RouterBlocked();
                }
            } else {
                bool fromOk = (from == owner()) || isLimitExempt[from];
                bool toOk = (to == owner()) || isLimitExempt[to];
                if (!fromOk && !toOk) revert TradingNotEnabled();
                if (routerProtectionEnabled && (from == router || to == router)) revert RouterBlocked();
            }
            return;
        }

        if (deadblocksEnabled && deadBlocks > 0 && block.number <= tradingEnabledBlock + deadBlocks) {
            bool isBuy = automatedMarketMakerPairs[from];
            bool isSell = automatedMarketMakerPairs[to];
            bool blocked = (deadblockMode == 0 && isBuy) || (deadblockMode == 1 && isSell) || (deadblockMode == 2 && (isBuy || isSell));
            if (blocked && !(deadblockExemptLimitExempt && (isLimitExempt[from] || isLimitExempt[to]))) {
                revert DeadblockActive();
            }
        }

        if (antiDumpModuleEnabled && antiDumpLimit > 0 && automatedMarketMakerPairs[to]) {
            if (antiDumpEndTime == 0 || block.timestamp <= antiDumpEndTime) {
                if (!isAntiDumpExempt[from]) {
                    if (block.timestamp > periodStartTime[from] + antiDumpPeriod) {
                        soldInPeriod[from] = 0;
                        periodStartTime[from] = uint64(block.timestamp);
                        balanceAtPeriodStart[from] = balanceOf(from);
                    }

                    uint256 maxSell;
                    if (antiDumpType == 0) {
                        maxSell = antiDumpLimit;
                    } else {
                        uint256 snapshotBalance = balanceAtPeriodStart[from];
                        if (snapshotBalance == 0) snapshotBalance = balanceOf(from);
                        maxSell = (snapshotBalance * antiDumpLimit) / 10000;
                    }

                    if (soldInPeriod[from] + amount > maxSell) revert AntiDumpLimitExceeded();
                    soldInPeriod[from] += amount;
                }
            }
        }

        if (limitsModuleEnabled && (maxWalletAmount > 0 || maxTxAmount > 0) && (limitsEndTime == 0 || block.timestamp <= limitsEndTime)) {
            if (maxTxAmount > 0 && !isLimitExempt[from] && amount > maxTxAmount) revert MaxTxExceeded();
            if (maxWalletAmount > 0 && !isLimitExempt[to] && !automatedMarketMakerPairs[to] && balanceOf(to) + sendAmount > maxWalletAmount) revert MaxWalletExceeded();
        }

        if (cooldownModuleEnabled && cooldownSeconds > 0) {
            if (!isCooldownExempt[from]) {
                if (uint64(block.timestamp) <= lastTradeTime[from] + cooldownSeconds) revert CooldownActive();
                lastTradeTime[from] = uint64(block.timestamp);
            }
            if (automatedMarketMakerPairs[from] && !isCooldownExempt[to]) {
                if (uint64(block.timestamp) <= lastTradeTime[to] + cooldownSeconds) revert CooldownActive();
                lastTradeTime[to] = uint64(block.timestamp);
            }
        }
    }

}

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

pragma solidity ^0.8.20;

import {Create2} from "../utils/Create2.sol";
import {Errors} from "../utils/Errors.sol";

/**
 * @dev https://eips.ethereum.org/EIPS/eip-1167[ERC-1167] is a standard for
 * deploying minimal proxy contracts, also known as "clones".
 *
 * > To simply and cheaply clone contract functionality in an immutable way, this standard specifies
 * > a minimal bytecode implementation that delegates all calls to a known, fixed address.
 *
 * The library includes functions to deploy a proxy using either `create` (traditional deployment) or `create2`
 * (salted deterministic deployment). It also includes functions to predict the addresses of clones deployed using the
 * deterministic method.
 */
library Clones {
    error CloneArgumentsTooLong();

    /**
     * @dev Deploys and returns the address of a clone that mimics the behavior of `implementation`.
     *
     * This function uses the create opcode, which should never revert.
     *
     * WARNING: This function does not check if `implementation` has code. A clone that points to an address
     * without code cannot be initialized. Initialization calls may appear to be successful when, in reality, they
     * have no effect and leave the clone uninitialized, allowing a third party to initialize it later.
     */
    function clone(address implementation) internal returns (address instance) {
        return clone(implementation, 0);
    }

    /**
     * @dev Same as {xref-Clones-clone-address-}[clone], but with a `value` parameter to send native currency
     * to the new contract.
     *
     * WARNING: This function does not check if `implementation` has code. A clone that points to an address
     * without code cannot be initialized. Initialization calls may appear to be successful when, in reality, they
     * have no effect and leave the clone uninitialized, allowing a third party to initialize it later.
     *
     * NOTE: Using a non-zero value at creation will require the contract using this function (e.g. a factory)
     * to always have enough balance for new deployments. Consider exposing this function under a payable method.
     */
    function clone(address implementation, uint256 value) internal returns (address instance) {
        if (address(this).balance < value) {
            revert Errors.InsufficientBalance(address(this).balance, value);
        }
        assembly ("memory-safe") {
            // Cleans the upper 96 bits of the `implementation` word, then packs the first 3 bytes
            // of the `implementation` address with the bytecode before the address.
            mstore(0x00, or(shr(232, shl(96, implementation)), 0x3d602d80600a3d3981f3363d3d373d3d3d363d73000000))
            // Packs the remaining 17 bytes of `implementation` with the bytecode after the address.
            mstore(0x20, or(shl(120, implementation), 0x5af43d82803e903d91602b57fd5bf3))
            instance := create(value, 0x09, 0x37)
        }
        if (instance == address(0)) {
            revert Errors.FailedDeployment();
        }
    }

    /**
     * @dev Deploys and returns the address of a clone that mimics the behavior of `implementation`.
     *
     * This function uses the create2 opcode and a `salt` to deterministically deploy
     * the clone. Using the same `implementation` and `salt` multiple times will revert, since
     * the clones cannot be deployed twice at the same address.
     *
     * WARNING: This function does not check if `implementation` has code. A clone that points to an address
     * without code cannot be initialized. Initialization calls may appear to be successful when, in reality, they
     * have no effect and leave the clone uninitialized, allowing a third party to initialize it later.
     */
    function cloneDeterministic(address implementation, bytes32 salt) internal returns (address instance) {
        return cloneDeterministic(implementation, salt, 0);
    }

    /**
     * @dev Same as {xref-Clones-cloneDeterministic-address-bytes32-}[cloneDeterministic], but with
     * a `value` parameter to send native currency to the new contract.
     *
     * WARNING: This function does not check if `implementation` has code. A clone that points to an address
     * without code cannot be initialized. Initialization calls may appear to be successful when, in reality, they
     * have no effect and leave the clone uninitialized, allowing a third party to initialize it later.
     *
     * NOTE: Using a non-zero value at creation will require the contract using this function (e.g. a factory)
     * to always have enough balance for new deployments. Consider exposing this function under a payable method.
     */
    function cloneDeterministic(address implementation, bytes32 salt, uint256 value)
        internal
        returns (address instance)
    {
        if (address(this).balance < value) {
            revert Errors.InsufficientBalance(address(this).balance, value);
        }
        assembly ("memory-safe") {
            // Cleans the upper 96 bits of the `implementation` word, then packs the first 3 bytes
            // of the `implementation` address with the bytecode before the address.
            mstore(0x00, or(shr(232, shl(96, implementation)), 0x3d602d80600a3d3981f3363d3d373d3d3d363d73000000))
            // Packs the remaining 17 bytes of `implementation` with the bytecode after the address.
            mstore(0x20, or(shl(120, implementation), 0x5af43d82803e903d91602b57fd5bf3))
            instance := create2(value, 0x09, 0x37, salt)
        }
        if (instance == address(0)) {
            revert Errors.FailedDeployment();
        }
    }

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

    /**
     * @dev Computes the address of a clone deployed using {Clones-cloneDeterministic}.
     */
    function predictDeterministicAddress(address implementation, bytes32 salt)
        internal
        view
        returns (address predicted)
    {
        return predictDeterministicAddress(implementation, salt, address(this));
    }

    /**
     * @dev Deploys and returns the address of a clone that mimics the behavior of `implementation` with custom
     * immutable arguments. These are provided through `args` and cannot be changed after deployment. To
     * access the arguments within the implementation, use {fetchCloneArgs}.
     *
     * This function uses the create opcode, which should never revert.
     *
     * WARNING: This function does not check if `implementation` has code. A clone that points to an address
     * without code cannot be initialized. Initialization calls may appear to be successful when, in reality, they
     * have no effect and leave the clone uninitialized, allowing a third party to initialize it later.
     */
    function cloneWithImmutableArgs(address implementation, bytes memory args) internal returns (address instance) {
        return cloneWithImmutableArgs(implementation, args, 0);
    }

    /**
     * @dev Same as {xref-Clones-cloneWithImmutableArgs-address-bytes-}[cloneWithImmutableArgs], but with a `value`
     * parameter to send native currency to the new contract.
     *
     * WARNING: This function does not check if `implementation` has code. A clone that points to an address
     * without code cannot be initialized. Initialization calls may appear to be successful when, in reality, they
     * have no effect and leave the clone uninitialized, allowing a third party to initialize it later.
     *
     * NOTE: Using a non-zero value at creation will require the contract using this function (e.g. a factory)
     * to always have enough balance for new deployments. Consider exposing this function under a payable method.
     */
    function cloneWithImmutableArgs(address implementation, bytes memory args, uint256 value)
        internal
        returns (address instance)
    {
        if (address(this).balance < value) {
            revert Errors.InsufficientBalance(address(this).balance, value);
        }
        bytes memory bytecode = _cloneCodeWithImmutableArgs(implementation, args);
        assembly ("memory-safe") {
            instance := create(value, add(bytecode, 0x20), mload(bytecode))
        }
        if (instance == address(0)) {
            revert Errors.FailedDeployment();
        }
    }

    /**
     * @dev Deploys and returns the address of a clone that mimics the behavior of `implementation` with custom
     * immutable arguments. These are provided through `args` and cannot be changed after deployment. To
     * access the arguments within the implementation, use {fetchCloneArgs}.
     *
     * This function uses the create2 opcode and a `salt` to deterministically deploy the clone. Using the same
     * `implementation`, `args` and `salt` multiple times will revert, since the clones cannot be deployed twice
     * at the same address.
     *
     * WARNING: This function does not check if `implementation` has code. A clone that points to an address
     * without code cannot be initialized. Initialization calls may appear to be successful when, in reality, they
     * have no effect and leave the clone uninitialized, allowing a third party to initialize it later.
     */
    function cloneDeterministicWithImmutableArgs(address implementation, bytes memory args, bytes32 salt)
        internal
        returns (address instance)
    {
        return cloneDeterministicWithImmutableArgs(implementation, args, salt, 0);
    }

    /**
     * @dev Same as {xref-Clones-cloneDeterministicWithImmutableArgs-address-bytes-bytes32-}[cloneDeterministicWithImmutableArgs],
     * but with a `value` parameter to send native currency to the new contract.
     *
     * WARNING: This function does not check if `implementation` has code. A clone that points to an address
     * without code cannot be initialized. Initialization calls may appear to be successful when, in reality, they
     * have no effect and leave the clone uninitialized, allowing a third party to initialize it later.
     *
     * NOTE: Using a non-zero value at creation will require the contract using this function (e.g. a factory)
     * to always have enough balance for new deployments. Consider exposing this function under a payable method.
     */
    function cloneDeterministicWithImmutableArgs(address implementation, bytes memory args, bytes32 salt, uint256 value)
        internal
        returns (address instance)
    {
        bytes memory bytecode = _cloneCodeWithImmutableArgs(implementation, args);
        return Create2.deploy(value, salt, bytecode);
    }

    /**
     * @dev Computes the address of a clone deployed using {Clones-cloneDeterministicWithImmutableArgs}.
     */
    function predictDeterministicAddressWithImmutableArgs(
        address implementation,
        bytes memory args,
        bytes32 salt,
        address deployer
    ) internal pure returns (address predicted) {
        bytes memory bytecode = _cloneCodeWithImmutableArgs(implementation, args);
        return Create2.computeAddress(salt, keccak256(bytecode), deployer);
    }

    /**
     * @dev Computes the address of a clone deployed using {Clones-cloneDeterministicWithImmutableArgs}.
     */
    function predictDeterministicAddressWithImmutableArgs(address implementation, bytes memory args, bytes32 salt)
        internal
        view
        returns (address predicted)
    {
        return predictDeterministicAddressWithImmutableArgs(implementation, args, salt, address(this));
    }

    /**
     * @dev Get the immutable args attached to a clone.
     *
     * - If `instance` is a clone that was deployed using `clone` or `cloneDeterministic`, this
     *   function will return an empty array.
     * - If `instance` is a clone that was deployed using `cloneWithImmutableArgs` or
     *   `cloneDeterministicWithImmutableArgs`, this function will return the args array used at
     *   creation.
     * - If `instance` is NOT a clone deployed using this library, the behavior is undefined. This
     *   function should only be used to check addresses that are known to be clones.
     */
    function fetchCloneArgs(address instance) internal view returns (bytes memory) {
        bytes memory result = new bytes(instance.code.length - 0x2d); // revert if length is too short
        assembly ("memory-safe") {
            extcodecopy(instance, add(result, 0x20), 0x2d, mload(result))
        }
        return result;
    }

    /**
     * @dev Helper that prepares the initcode of the proxy with immutable args.
     *
     * An assembly variant of this function requires copying the `args` array, which can be efficiently done using
     * `mcopy`. Unfortunately, that opcode is not available before cancun. A pure solidity implementation using
     * abi.encodePacked is more expensive but also more portable and easier to review.
     *
     * NOTE: https://eips.ethereum.org/EIPS/eip-170[EIP-170] limits the length of the contract code to 24576 bytes.
     * With the proxy code taking 45 bytes, that limits the length of the immutable args to 24531 bytes.
     */
    function _cloneCodeWithImmutableArgs(address implementation, bytes memory args)
        private
        pure
        returns (bytes memory)
    {
        if (args.length > 0x5fd3) revert CloneArgumentsTooLong();
        return abi.encodePacked(
            hex"61",
            uint16(args.length + 0x2d),
            hex"3d81600a3d39f3363d3d373d3d3d363d73",
            implementation,
            hex"5af43d82803e903d91602b57fd5bf3",
            args
        );
    }
}

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

pragma solidity ^0.8.20;

import {IERC20} from "@openzeppelin/contracts/token/ERC20/IERC20.sol";
import {IERC20Metadata} from "@openzeppelin/contracts/token/ERC20/extensions/IERC20Metadata.sol";
import {ContextUpgradeable} from "../../utils/ContextUpgradeable.sol";
import {IERC20Errors} from "@openzeppelin/contracts/interfaces/draft-IERC6093.sol";
import {Initializable} from "@openzeppelin/contracts/proxy/utils/Initializable.sol";

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

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

        uint256 _totalSupply;

        string _name;
        string _symbol;
    }

    // keccak256(abi.encode(uint256(keccak256("openzeppelin.storage.ERC20")) - 1)) & ~bytes32(uint256(0xff))
    bytes32 private constant ERC20StorageLocation = 0x52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace00;

    function _getERC20Storage() private pure returns (ERC20Storage storage $) {
        assembly {
            $.slot := ERC20StorageLocation
        }
    }

    /**
     * @dev Sets the values for {name} and {symbol}.
     *
     * Both values are immutable: they can only be set once during construction.
     */
    function __ERC20_init(string memory name_, string memory symbol_) internal onlyInitializing {
        __ERC20_init_unchained(name_, symbol_);
    }

    function __ERC20_init_unchained(string memory name_, string memory symbol_) internal onlyInitializing {
        ERC20Storage storage $ = _getERC20Storage();
        $._name = name_;
        $._symbol = symbol_;
    }

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

    /**
     * @dev Returns the symbol of the token, usually a shorter version of the
     * name.
     */
    function symbol() public view virtual returns (string memory) {
        ERC20Storage storage $ = _getERC20Storage();
        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;
    }

    /// @inheritdoc IERC20
    function totalSupply() public view virtual returns (uint256) {
        ERC20Storage storage $ = _getERC20Storage();
        return $._totalSupply;
    }

    /// @inheritdoc IERC20
    function balanceOf(address account) public view virtual returns (uint256) {
        ERC20Storage storage $ = _getERC20Storage();
        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;
    }

    /// @inheritdoc IERC20
    function allowance(address owner, address spender) public view virtual returns (uint256) {
        ERC20Storage storage $ = _getERC20Storage();
        return $._allowances[owner][spender];
    }

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

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

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

    /**
     * @dev Transfers a `value` amount of tokens from `from` to `to`, or alternatively mints (or burns) if `from`
     * (or `to`) is the zero address. All customizations to transfers, mints, and burns should be done by overriding
     * this function.
     *
     * Emits a {Transfer} event.
     */
    function _update(address from, address to, uint256 value) internal virtual {
        ERC20Storage storage $ = _getERC20Storage();
        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 sets the flag to false. This saves gas by not emitting any
     * `Approval` event during `transferFrom` operations.
     *
     * Anyone who wishes to continue emitting `Approval` events on the `transferFrom` operation can force the flag to
     * true using the following override:
     *
     * ```solidity
     * function _approve(address owner, address spender, uint256 value, bool) internal virtual override {
     *     super._approve(owner, spender, value, true);
     * }
     * ```
     *
     * Requirements are the same as {_approve}.
     */
    function _approve(address owner, address spender, uint256 value, bool emitEvent) internal virtual {
        ERC20Storage storage $ = _getERC20Storage();
        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.5.0) (token/ERC20/extensions/ERC20Permit.sol)

pragma solidity ^0.8.24;

import {IERC20Permit} from "@openzeppelin/contracts/token/ERC20/extensions/IERC20Permit.sol";
import {ERC20Upgradeable} from "../ERC20Upgradeable.sol";
import {ECDSA} from "@openzeppelin/contracts/utils/cryptography/ECDSA.sol";
import {EIP712Upgradeable} from "../../../utils/cryptography/EIP712Upgradeable.sol";
import {NoncesUpgradeable} from "../../../utils/NoncesUpgradeable.sol";
import {Initializable} from "@openzeppelin/contracts/proxy/utils/Initializable.sol";

/**
 * @dev Implementation of the ERC-20 Permit extension allowing approvals to be made via signatures, as defined in
 * https://eips.ethereum.org/EIPS/eip-2612[ERC-2612].
 *
 * Adds the {permit} method, which can be used to change an account's ERC-20 allowance (see {IERC20-allowance}) by
 * presenting a message signed by the account. By not relying on `{IERC20-approve}`, the token holder account doesn't
 * need to send a transaction, and thus is not required to hold Ether at all.
 */
abstract contract ERC20PermitUpgradeable is Initializable, ERC20Upgradeable, IERC20Permit, EIP712Upgradeable, NoncesUpgradeable {
    bytes32 private constant PERMIT_TYPEHASH =
        keccak256("Permit(address owner,address spender,uint256 value,uint256 nonce,uint256 deadline)");

    /**
     * @dev Permit deadline has expired.
     */
    error ERC2612ExpiredSignature(uint256 deadline);

    /**
     * @dev Mismatched signature.
     */
    error ERC2612InvalidSigner(address signer, address owner);

    /**
     * @dev Initializes the {EIP712} domain separator using the `name` parameter, and setting `version` to `"1"`.
     *
     * It's a good idea to use the same `name` that is defined as the ERC-20 token name.
     */
    function __ERC20Permit_init(string memory name) internal onlyInitializing {
        __EIP712_init_unchained(name, "1");
    }

    function __ERC20Permit_init_unchained(string memory) internal onlyInitializing {}

    /// @inheritdoc IERC20Permit
    function permit(
        address owner,
        address spender,
        uint256 value,
        uint256 deadline,
        uint8 v,
        bytes32 r,
        bytes32 s
    ) public virtual {
        if (block.timestamp > deadline) {
            revert ERC2612ExpiredSignature(deadline);
        }

        bytes32 structHash = keccak256(abi.encode(PERMIT_TYPEHASH, owner, spender, value, _useNonce(owner), deadline));

        bytes32 hash = _hashTypedDataV4(structHash);

        address signer = ECDSA.recover(hash, v, r, s);
        if (signer != owner) {
            revert ERC2612InvalidSigner(signer, owner);
        }

        _approve(owner, spender, value);
    }

    /// @inheritdoc IERC20Permit
    function nonces(address owner) public view virtual override(IERC20Permit, NoncesUpgradeable) returns (uint256) {
        return super.nonces(owner);
    }

    /// @inheritdoc IERC20Permit
    // solhint-disable-next-line func-name-mixedcase
    function DOMAIN_SEPARATOR() external view returns (bytes32) {
        return _domainSeparatorV4();
    }
}

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

pragma solidity ^0.8.20;

import {ContextUpgradeable} from "../utils/ContextUpgradeable.sol";
import {Initializable} from "@openzeppelin/contracts/proxy/utils/Initializable.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 OwnableUpgradeable is Initializable, ContextUpgradeable {
    /// @custom:storage-location erc7201:openzeppelin.storage.Ownable
    struct OwnableStorage {
        address _owner;
    }

    // keccak256(abi.encode(uint256(keccak256("openzeppelin.storage.Ownable")) - 1)) & ~bytes32(uint256(0xff))
    bytes32 private constant OwnableStorageLocation = 0x9016d09d72d40fdae2fd8ceac6b6234c7706214fd39c1cd1e609a0528c199300;

    function _getOwnableStorage() private pure returns (OwnableStorage storage $) {
        assembly {
            $.slot := OwnableStorageLocation
        }
    }

    /**
     * @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.
     */
    function __Ownable_init(address initialOwner) internal onlyInitializing {
        __Ownable_init_unchained(initialOwner);
    }

    function __Ownable_init_unchained(address initialOwner) internal onlyInitializing {
        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) {
        OwnableStorage storage $ = _getOwnableStorage();
        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 {
        OwnableStorage storage $ = _getOwnableStorage();
        address oldOwner = $._owner;
        $._owner = newOwner;
        emit OwnershipTransferred(oldOwner, newOwner);
    }
}

// SPDX-License-Identifier: MIT

pragma solidity ^0.8.20;

import {Initializable} from "@openzeppelin/contracts/proxy/utils/Initializable.sol";

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

pragma solidity ^0.8.20;

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

/**
 * @dev Contract module that helps prevent reentrant calls to a function.
 *
 * Inheriting from `ReentrancyGuard` will make the {nonReentrant} modifier
 * available, which can be applied to functions to make sure there are no nested
 * (reentrant) calls to them.
 *
 * Note that because there is a single `nonReentrant` guard, functions marked as
 * `nonReentrant` may not call one another. This can be worked around by making
 * those functions `private`, and then adding `external` `nonReentrant` entry
 * points to them.
 *
 * TIP: If EIP-1153 (transient storage) is available on the chain you're deploying at,
 * consider using {ReentrancyGuardTransient} instead.
 *
 * TIP: If you would like to learn more about reentrancy and alternative ways
 * to protect against it, check out our blog post
 * https://blog.openzeppelin.com/reentrancy-after-istanbul/[Reentrancy After Istanbul].
 *
 * IMPORTANT: Deprecated. This storage-based reentrancy guard will be removed and replaced
 * by the {ReentrancyGuardTransient} variant in v6.0.
 *
 * @custom:stateless
 */
abstract contract ReentrancyGuard {
    using StorageSlot for bytes32;

    // keccak256(abi.encode(uint256(keccak256("openzeppelin.storage.ReentrancyGuard")) - 1)) & ~bytes32(uint256(0xff))
    bytes32 private constant REENTRANCY_GUARD_STORAGE =
        0x9b779b17422d0df92223018b32b4d1fa46e071723d6817e2486d003becc55f00;

    // Booleans are more expensive than uint256 or any type that takes up a full
    // word because each write operation emits an extra SLOAD to first read the
    // slot's contents, replace the bits taken up by the boolean, and then write
    // back. This is the compiler's defense against contract upgrades and
    // pointer aliasing, and it cannot be disabled.

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

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

    constructor() {
        _reentrancyGuardStorageSlot().getUint256Slot().value = NOT_ENTERED;
    }

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

    /**
     * @dev A `view` only version of {nonReentrant}. Use to block view functions
     * from being called, preventing reading from inconsistent contract state.
     *
     * CAUTION: This is a "view" modifier and does not change the reentrancy
     * status. Use it only on view functions. For payable or non-payable functions,
     * use the standard {nonReentrant} modifier instead.
     */
    modifier nonReentrantView() {
        _nonReentrantBeforeView();
        _;
    }

    function _nonReentrantBeforeView() private view {
        if (_reentrancyGuardEntered()) {
            revert ReentrancyGuardReentrantCall();
        }
    }

    function _nonReentrantBefore() private {
        // On the first call to nonReentrant, _status will be NOT_ENTERED
        _nonReentrantBeforeView();

        // Any calls to nonReentrant after this point will fail
        _reentrancyGuardStorageSlot().getUint256Slot().value = ENTERED;
    }

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

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

    function _reentrancyGuardStorageSlot() internal pure virtual returns (bytes32) {
        return REENTRANCY_GUARD_STORAGE;
    }
}

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

pragma solidity >=0.4.16;

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

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

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

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

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

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

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

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

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

pragma solidity ^0.8.20;

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

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

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

    /**
     * @dev Transfer `value` amount of `token` from the calling contract to `to`. If `token` returns no value,
     * non-reverting calls are assumed to be successful.
     */
    function safeTransfer(IERC20 token, address to, uint256 value) internal {
        if (!_safeTransfer(token, to, value, true)) {
            revert SafeERC20FailedOperation(address(token));
        }
    }

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

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

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

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

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

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

    /**
     * @dev Performs an {ERC1363} transferAndCall, with a fallback to the simple {ERC20} transfer if the target has no
     * code. This can be used to implement an {ERC721}-like safe transfer that relies on {ERC1363} checks when
     * targeting contracts.
     *
     * Reverts if the returned value is other than `true`.
     */
    function transferAndCallRelaxed(IERC1363 token, address to, uint256 value, bytes memory data) internal {
        if (to.code.length == 0) {
            safeTransfer(token, to, value);
        } else if (!token.transferAndCall(to, value, data)) {
            revert SafeERC20FailedOperation(address(token));
        }
    }

    /**
     * @dev Performs an {ERC1363} transferFromAndCall, with a fallback to the simple {ERC20} transferFrom if the target
     * has no code. This can be used to implement an {ERC721}-like safe transfer that relies on {ERC1363} checks when
     * targeting contracts.
     *
     * Reverts if the returned value is other than `true`.
     */
    function transferFromAndCallRelaxed(IERC1363 token, address from, address to, uint256 value, bytes memory data)
        internal
    {
        if (to.code.length == 0) {
            safeTransferFrom(token, from, to, value);
        } else if (!token.transferFromAndCall(from, to, value, data)) {
            revert SafeERC20FailedOperation(address(token));
        }
    }

    /**
     * @dev Performs an {ERC1363} approveAndCall, with a fallback to the simple {ERC20} approve if the target has no
     * code. This can be used to implement an {ERC721}-like safe transfer that rely on {ERC1363} checks when
     * targeting contracts.
     *
     * NOTE: When the recipient address (`to`) has no code (i.e. is an EOA), this function behaves as {forceApprove}.
     * Oppositely, when the recipient address (`to`) has code, this function only attempts to call {ERC1363-approveAndCall}
     * once without retrying, and relies on the returned value to be true.
     *
     * Reverts if the returned value is other than `true`.
     */
    function approveAndCallRelaxed(IERC1363 token, address to, uint256 value, bytes memory data) internal {
        if (to.code.length == 0) {
            forceApprove(token, to, value);
        } else if (!token.approveAndCall(to, value, data)) {
            revert SafeERC20FailedOperation(address(token));
        }
    }

    /**
     * @dev Imitates a Solidity `token.transfer(to, value)` call, relaxing the requirement on the return value: the
     * return value is optional (but if data is returned, it must not be false).
     *
     * @param token The token targeted by the call.
     * @param to The recipient of the tokens
     * @param value The amount of token to transfer
     * @param bubble Behavior switch if the transfer call reverts: bubble the revert reason or return a false boolean.
     */
    function _safeTransfer(IERC20 token, address to, uint256 value, bool bubble) private returns (bool success) {
        bytes4 selector = IERC20.transfer.selector;

        assembly ("memory-safe") {
            let fmp := mload(0x40)
            mstore(0x00, selector)
            mstore(0x04, and(to, shr(96, not(0))))
            mstore(0x24, value)
            success := call(gas(), token, 0, 0x00, 0x44, 0x00, 0x20)
            // if call success and return is true, all is good.
            // otherwise (not success or return is not true), we need to perform further checks
            if iszero(and(success, eq(mload(0x00), 1))) {
                // if the call was a failure and bubble is enabled, bubble the error
                if and(iszero(success), bubble) {
                    returndatacopy(fmp, 0x00, returndatasize())
                    revert(fmp, returndatasize())
                }
                // if the return value is not true, then the call is only successful if:
                // - the token address has code
                // - the returndata is empty
                success := and(success, and(iszero(returndatasize()), gt(extcodesize(token), 0)))
            }
            mstore(0x40, fmp)
        }
    }

    /**
     * @dev Imitates a Solidity `token.transferFrom(from, to, value)` call, relaxing the requirement on the return
     * value: the return value is optional (but if data is returned, it must not be false).
     *
     * @param token The token targeted by the call.
     * @param from The sender of the tokens
     * @param to The recipient of the tokens
     * @param value The amount of token to transfer
     * @param bubble Behavior switch if the transfer call reverts: bubble the revert reason or return a false boolean.
     */
    function _safeTransferFrom(IERC20 token, address from, address to, uint256 value, bool bubble)
        private
        returns (bool success)
    {
        bytes4 selector = IERC20.transferFrom.selector;

        assembly ("memory-safe") {
            let fmp := mload(0x40)
            mstore(0x00, selector)
            mstore(0x04, and(from, shr(96, not(0))))
            mstore(0x24, and(to, shr(96, not(0))))
            mstore(0x44, value)
            success := call(gas(), token, 0, 0x00, 0x64, 0x00, 0x20)
            // if call success and return is true, all is good.
            // otherwise (not success or return is not true), we need to perform further checks
            if iszero(and(success, eq(mload(0x00), 1))) {
                // if the call was a failure and bubble is enabled, bubble the error
                if and(iszero(success), bubble) {
                    returndatacopy(fmp, 0x00, returndatasize())
                    revert(fmp, returndatasize())
                }
                // if the return value is not true, then the call is only successful if:
                // - the token address has code
                // - the returndata is empty
                success := and(success, and(iszero(returndatasize()), gt(extcodesize(token), 0)))
            }
            mstore(0x40, fmp)
            mstore(0x60, 0)
        }
    }

    /**
     * @dev Imitates a Solidity `token.approve(spender, value)` call, relaxing the requirement on the return value:
     * the return value is optional (but if data is returned, it must not be false).
     *
     * @param token The token targeted by the call.
     * @param spender The spender of the tokens
     * @param value The amount of token to transfer
     * @param bubble Behavior switch if the transfer call reverts: bubble the revert reason or return a false boolean.
     */
    function _safeApprove(IERC20 token, address spender, uint256 value, bool bubble) private returns (bool success) {
        bytes4 selector = IERC20.approve.selector;

        assembly ("memory-safe") {
            let fmp := mload(0x40)
            mstore(0x00, selector)
            mstore(0x04, and(spender, shr(96, not(0))))
            mstore(0x24, value)
            success := call(gas(), token, 0, 0x00, 0x44, 0x00, 0x20)
            // if call success and return is true, all is good.
            // otherwise (not success or return is not true), we need to perform further checks
            if iszero(and(success, eq(mload(0x00), 1))) {
                // if the call was a failure and bubble is enabled, bubble the error
                if and(iszero(success), bubble) {
                    returndatacopy(fmp, 0x00, returndatasize())
                    revert(fmp, returndatasize())
                }
                // if the return value is not true, then the call is only successful if:
                // - the token address has code
                // - the returndata is empty
                success := and(success, and(iszero(returndatasize()), gt(extcodesize(token), 0)))
            }
            mstore(0x40, fmp)
        }
    }
}

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

pragma solidity ^0.8.20;

import {Errors} from "./Errors.sol";
import {LowLevelCall} from "./LowLevelCall.sol";

/**
 * @dev Helper to make usage of the `CREATE2` EVM opcode easier and safer.
 * `CREATE2` can be used to compute in advance the address where a smart
 * contract will be deployed, which allows for interesting new mechanisms known
 * as 'counterfactual interactions'.
 *
 * See the https://eips.ethereum.org/EIPS/eip-1014#motivation[EIP] for more
 * information.
 */
library Create2 {
    /**
     * @dev There's no code to deploy.
     */
    error Create2EmptyBytecode();

    /**
     * @dev Deploys a contract using `CREATE2`. The address where the contract
     * will be deployed can be known in advance via {computeAddress}.
     *
     * The bytecode for a contract can be obtained from Solidity with
     * `type(contractName).creationCode`.
     *
     * Requirements:
     *
     * - `bytecode` must not be empty.
     * - `salt` must have not been used for `bytecode` already.
     * - the factory must have a balance of at least `amount`.
     * - if `amount` is non-zero, `bytecode` must have a `payable` constructor.
     */
    function deploy(uint256 amount, bytes32 salt, bytes memory bytecode) internal returns (address addr) {
        if (address(this).balance < amount) {
            revert Errors.InsufficientBalance(address(this).balance, amount);
        }
        if (bytecode.length == 0) {
            revert Create2EmptyBytecode();
        }
        assembly ("memory-safe") {
            addr := create2(amount, add(bytecode, 0x20), mload(bytecode), salt)
        }
        if (addr == address(0)) {
            if (LowLevelCall.returnDataSize() == 0) {
                revert Errors.FailedDeployment();
            } else {
                LowLevelCall.bubbleRevert();
            }
        }
    }

    /**
     * @dev Returns the address where a contract will be stored if deployed via {deploy}. Any change in the
     * `bytecodeHash` or `salt` will result in a new destination address.
     */
    function computeAddress(bytes32 salt, bytes32 bytecodeHash) internal view returns (address) {
        return computeAddress(salt, bytecodeHash, address(this));
    }

    /**
     * @dev Returns the address where a contract will be stored if deployed via {deploy} from a contract located at
     * `deployer`. If `deployer` is this contract's address, returns the same value as {computeAddress}.
     */
    function computeAddress(bytes32 salt, bytes32 bytecodeHash, address deployer) internal pure returns (address addr) {
        assembly ("memory-safe") {
            let ptr := mload(0x40) // Get free memory pointer

            // |                     | ↓ ptr ...  ↓ ptr + 0x0B (start) ...  ↓ ptr + 0x20 ...  ↓ ptr + 0x40 ...   |
            // |---------------------|---------------------------------------------------------------------------|
            // | bytecodeHash        |                                                        CCCCCCCCCCCCC...CC |
            // | salt                |                                      BBBBBBBBBBBBB...BB                   |
            // | deployer            | 000000...0000AAAAAAAAAAAAAAAAAAA...AA                                     |
            // | 0xFF                |            FF                                                             |
            // |---------------------|---------------------------------------------------------------------------|
            // | memory              | 000000...00FFAAAAAAAAAAAAAAAAAAA...AABBBBBBBBBBBBB...BBCCCCCCCCCCCCC...CC |
            // | keccak(start, 0x55) |            ↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑ |

            mstore(add(ptr, 0x40), bytecodeHash)
            mstore(add(ptr, 0x20), salt)
            mstore(ptr, deployer) // Right-aligned with 12 preceding garbage bytes
            let start := add(ptr, 0x0b) // The hashed data starts at the final garbage byte which we will set to 0xff
            mstore8(start, 0xff)
            addr := and(keccak256(start, 0x55), 0xffffffffffffffffffffffffffffffffffffffff)
        }
    }
}

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

pragma solidity ^0.8.20;

/**
 * @dev Collection of common custom errors used in multiple contracts
 *
 * IMPORTANT: Backwards compatibility is not guaranteed in future versions of the library.
 * It is recommended to avoid relying on the error API for critical functionality.
 *
 * _Available since v5.1._
 */
library Errors {
    /**
     * @dev The ETH balance of the account is not enough to perform the operation.
     */
    error InsufficientBalance(uint256 balance, uint256 needed);

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

    /**
     * @dev The deployment failed.
     */
    error FailedDeployment();

    /**
     * @dev A necessary precompile is missing.
     */
    error MissingPrecompile(address);
}

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

pragma solidity >=0.6.2;

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

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

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

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

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

pragma solidity ^0.8.20;
import {Initializable} from "@openzeppelin/contracts/proxy/utils/Initializable.sol";

/**
 * @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 ContextUpgradeable is Initializable {
    function __Context_init() internal onlyInitializing {
    }

    function __Context_init_unchained() internal onlyInitializing {
    }
    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.5.0) (interfaces/draft-IERC6093.sol)

pragma solidity >=0.8.4;

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

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

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

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

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

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

/**
 * @dev Standard ERC-721 Errors
 * Interface of the https://eips.ethereum.org/EIPS/eip-6093[ERC-6093] custom errors for ERC-721 tokens.
 */
interface IERC721Errors {
    /**
     * @dev Indicates that an address can't be an owner. For example, `address(0)` is a forbidden owner in ERC-721.
     * 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 ERC-1155 Errors
 * Interface of the https://eips.ethereum.org/EIPS/eip-6093[ERC-6093] custom errors for ERC-1155 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.3.0) (proxy/utils/Initializable.sol)

pragma solidity ^0.8.20;

/**
 * @dev This is a base contract to aid in writing upgradeable contracts, or any kind of contract that will be deployed
 * behind a proxy. Since proxied contracts do not make use of a constructor, it's common to move constructor logic to an
 * external initializer function, usually called `initialize`. It then becomes necessary to protect this initializer
 * function so it can only be called once. The {initializer} modifier provided by this contract will have this effect.
 *
 * The initialization functions use a version number. Once a version number is used, it is consumed and cannot be
 * reused. This mechanism prevents re-execution of each "step" but allows the creation of new initialization steps in
 * case an upgrade adds a module that needs to be initialized.
 *
 * For example:
 *
 * [.hljs-theme-light.nopadding]
 * ```solidity
 * contract MyToken is ERC20Upgradeable {
 *     function initialize() initializer public {
 *         __ERC20_init("MyToken", "MTK");
 *     }
 * }
 *
 * contract MyTokenV2 is MyToken, ERC20PermitUpgradeable {
 *     function initializeV2() reinitializer(2) public {
 *         __ERC20Permit_init("MyToken");
 *     }
 * }
 * ```
 *
 * TIP: To avoid leaving the proxy in an uninitialized state, the initializer function should be called as early as
 * possible by providing the encoded function call as the `_data` argument to {ERC1967Proxy-constructor}.
 *
 * CAUTION: When used with inheritance, manual care must be taken to not invoke a parent initializer twice, or to ensure
 * that all initializers are idempotent. This is not verified automatically as constructors are by Solidity.
 *
 * [CAUTION]
 * ====
 * Avoid leaving a contract uninitialized.
 *
 * An uninitialized contract can be taken over by an attacker. This applies to both a proxy and its implementation
 * contract, which may impact the proxy. To prevent the implementation contract from being used, you should invoke
 * the {_disableInitializers} function in the constructor to automatically lock it when it is deployed:
 *
 * [.hljs-theme-light.nopadding]
 * ```
 * /// @custom:oz-upgrades-unsafe-allow constructor
 * constructor() {
 *     _disableInitializers();
 * }
 * ```
 * ====
 */
abstract contract Initializable {
    /**
     * @dev Storage of the initializable contract.
     *
     * It's implemented on a custom ERC-7201 namespace to reduce the risk of storage collisions
     * when using with upgradeable contracts.
     *
     * @custom:storage-location erc7201:openzeppelin.storage.Initializable
     */
    struct InitializableStorage {
        /**
         * @dev Indicates that the contract has been initialized.
         */
        uint64 _initialized;
        /**
         * @dev Indicates that the contract is in the process of being initialized.
         */
        bool _initializing;
    }

    // keccak256(abi.encode(uint256(keccak256("openzeppelin.storage.Initializable")) - 1)) & ~bytes32(uint256(0xff))
    bytes32 private constant INITIALIZABLE_STORAGE = 0xf0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a00;

    /**
     * @dev The contract is already initialized.
     */
    error InvalidInitialization();

    /**
     * @dev The contract is not initializing.
     */
    error NotInitializing();

    /**
     * @dev Triggered when the contract has been initialized or reinitialized.
     */
    event Initialized(uint64 version);

    /**
     * @dev A modifier that defines a protected initializer function that can be invoked at most once. In its scope,
     * `onlyInitializing` functions can be used to initialize parent contracts.
     *
     * Similar to `reinitializer(1)`, except that in the context of a constructor an `initializer` may be invoked any
     * number of times. This behavior in the constructor can be useful during testing and is not expected to be used in
     * production.
     *
     * Emits an {Initialized} event.
     */
    modifier initializer() {
        // solhint-disable-next-line var-name-mixedcase
        InitializableStorage storage $ = _getInitializableStorage();

        // Cache values to avoid duplicated sloads
        bool isTopLevelCall = !$._initializing;
        uint64 initialized = $._initialized;

        // Allowed calls:
        // - initialSetup: the contract is not in the initializing state and no previous version was
        //                 initialized
        // - construction: the contract is initialized at version 1 (no reinitialization) and the
        //                 current contract is just being deployed
        bool initialSetup = initialized == 0 && isTopLevelCall;
        bool construction = initialized == 1 && address(this).code.length == 0;

        if (!initialSetup && !construction) {
            revert InvalidInitialization();
        }
        $._initialized = 1;
        if (isTopLevelCall) {
            $._initializing = true;
        }
        _;
        if (isTopLevelCall) {
            $._initializing = false;
            emit Initialized(1);
        }
    }

    /**
     * @dev A modifier that defines a protected reinitializer function that can be invoked at most once, and only if the
     * contract hasn't been initialized to a greater version before. In its scope, `onlyInitializing` functions can be
     * used to initialize parent contracts.
     *
     * A reinitializer may be used after the original initialization step. This is essential to configure modules that
     * are added through upgrades and that require initialization.
     *
     * When `version` is 1, this modifier is similar to `initializer`, except that functions marked with `reinitializer`
     * cannot be nested. If one is invoked in the context of another, execution will revert.
     *
     * Note that versions can jump in increments greater than 1; this implies that if multiple reinitializers coexist in
     * a contract, executing them in the right order is up to the developer or operator.
     *
     * WARNING: Setting the version to 2**64 - 1 will prevent any future reinitialization.
     *
     * Emits an {Initialized} event.
     */
    modifier reinitializer(uint64 version) {
        // solhint-disable-next-line var-name-mixedcase
        InitializableStorage storage $ = _getInitializableStorage();

        if ($._initializing || $._initialized >= version) {
            revert InvalidInitialization();
        }
        $._initialized = version;
        $._initializing = true;
        _;
        $._initializing = false;
        emit Initialized(version);
    }

    /**
     * @dev Modifier to protect an initialization function so that it can only be invoked by functions with the
     * {initializer} and {reinitializer} modifiers, directly or indirectly.
     */
    modifier onlyInitializing() {
        _checkInitializing();
        _;
    }

    /**
     * @dev Reverts if the contract is not in an initializing state. See {onlyInitializing}.
     */
    function _checkInitializing() internal view virtual {
        if (!_isInitializing()) {
            revert NotInitializing();
        }
    }

    /**
     * @dev Locks the contract, preventing any future reinitialization. This cannot be part of an initializer call.
     * Calling this in the constructor of a contract will prevent that contract from being initialized or reinitialized
     * to any version. It is recommended to use this to lock implementation contracts that are designed to be called
     * through proxies.
     *
     * Emits an {Initialized} event the first time it is successfully executed.
     */
    function _disableInitializers() internal virtual {
        // solhint-disable-next-line var-name-mixedcase
        InitializableStorage storage $ = _getInitializableStorage();

        if ($._initializing) {
            revert InvalidInitialization();
        }
        if ($._initialized != type(uint64).max) {
            $._initialized = type(uint64).max;
            emit Initialized(type(uint64).max);
        }
    }

    /**
     * @dev Returns the highest version that has been initialized. See {reinitializer}.
     */
    function _getInitializedVersion() internal view returns (uint64) {
        return _getInitializableStorage()._initialized;
    }

    /**
     * @dev Returns `true` if the contract is currently initializing. See {onlyInitializing}.
     */
    function _isInitializing() internal view returns (bool) {
        return _getInitializableStorage()._initializing;
    }

    /**
     * @dev Pointer to storage slot. Allows integrators to override it with a custom storage location.
     *
     * NOTE: Consider following the ERC-7201 formula to derive storage locations.
     */
    function _initializableStorageSlot() internal pure virtual returns (bytes32) {
        return INITIALIZABLE_STORAGE;
    }

    /**
     * @dev Returns a pointer to the storage namespace.
     */
    // solhint-disable-next-line var-name-mixedcase
    function _getInitializableStorage() private pure returns (InitializableStorage storage $) {
        bytes32 slot = _initializableStorageSlot();
        assembly {
            $.slot := slot
        }
    }
}

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

pragma solidity >=0.4.16;

/**
 * @dev Interface of the ERC-20 Permit extension allowing approvals to be made via signatures, as defined in
 * https://eips.ethereum.org/EIPS/eip-2612[ERC-2612].
 *
 * Adds the {permit} method, which can be used to change an account's ERC-20 allowance (see {IERC20-allowance}) by
 * presenting a message signed by the account. By not relying on {IERC20-approve}, the token holder account doesn't
 * need to send a transaction, and thus is not required to hold Ether at all.
 *
 * ==== Security Considerations
 *
 * There are two important considerations concerning the use of `permit`. The first is that a valid permit signature
 * expresses an allowance, and it should not be assumed to convey additional meaning. In particular, it should not be
 * considered as an intention to spend the allowance in any specific way. The second is that because permits have
 * built-in replay protection and can be submitted by anyone, they can be frontrun. A protocol that uses permits should
 * take this into consideration and allow a `permit` call to fail. Combining these two aspects, a pattern that may be
 * generally recommended is:
 *
 * ```solidity
 * function doThingWithPermit(..., uint256 value, uint256 deadline, uint8 v, bytes32 r, bytes32 s) public {
 *     try token.permit(msg.sender, address(this), value, deadline, v, r, s) {} catch {}
 *     doThing(..., value);
 * }
 *
 * function doThing(..., uint256 value) public {
 *     token.safeTransferFrom(msg.sender, address(this), value);
 *     ...
 * }
 * ```
 *
 * Observe that: 1) `msg.sender` is used as the owner, leaving no ambiguity as to the signer intent, and 2) the use of
 * `try/catch` allows the permit to fail and makes the code tolerant to frontrunning. (See also
 * {SafeERC20-safeTransferFrom}).
 *
 * Additionally, note that smart contract wallets (such as Argent or Safe) are not able to produce permit signatures, so
 * contracts should have entry points that don't rely on permit.
 */
interface IERC20Permit {
    /**
     * @dev Sets `value` as the allowance of `spender` over ``owner``'s tokens,
     * given ``owner``'s signed approval.
     *
     * IMPORTANT: The same issues {IERC20-approve} has related to transaction
     * ordering also applies here.
     *
     * Emits an {Approval} event.
     *
     * Requirements:
     *
     * - `spender` cannot be the zero address.
     * - `deadline` must be a timestamp in the future.
     * - `v`, `r` and `s` must be a valid `secp256k1` signature from `owner`
     * over the EIP712-formatted function arguments.
     * - the signature must use ``owner``'s current nonce (see {nonces}).
     *
     * For more information on the signature format, see the
     * https://eips.ethereum.org/EIPS/eip-2612#specification[relevant EIP
     * section].
     *
     * CAUTION: See Security Considerations above.
     */
    function permit(address owner, address spender, uint256 value, uint256 deadline, uint8 v, bytes32 r, bytes32 s)
        external;

    /**
     * @dev Returns the current nonce for `owner`. This value must be
     * included whenever a signature is generated for {permit}.
     *
     * Every successful call to {permit} increases ``owner``'s nonce by one. This
     * prevents a signature from being used multiple times.
     */
    function nonces(address owner) external view returns (uint256);

    /**
     * @dev Returns the domain separator used in the encoding of the signature for {permit}, as defined by {EIP712}.
     */
    // solhint-disable-next-line func-name-mixedcase
    function DOMAIN_SEPARATOR() external view returns (bytes32);
}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.5.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.
     *
     * NOTE: This function only supports 65-byte signatures. ERC-2098 short signatures are rejected. This restriction
     * is DEPRECATED and will be removed in v6.0. Developers SHOULD NOT use signatures as unique identifiers; use hash
     * invalidation or nonces for replay protection.
     *
     * 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 recovered, RecoverError err, bytes32 errArg)
    {
        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.
            assembly ("memory-safe") {
                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 Variant of {tryRecover} that takes a signature in calldata
     */
    function tryRecoverCalldata(bytes32 hash, bytes calldata signature)
        internal
        pure
        returns (address recovered, RecoverError err, bytes32 errArg)
    {
        if (signature.length == 65) {
            bytes32 r;
            bytes32 s;
            uint8 v;
            // ecrecover takes the signature parameters, calldata slices would work here, but are
            // significantly more expensive (length check) than using calldataload in assembly.
            assembly ("memory-safe") {
                r := calldataload(signature.offset)
                s := calldataload(add(signature.offset, 0x20))
                v := byte(0, calldataload(add(signature.offset, 0x40)))
            }
            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.
     *
     * NOTE: This function only supports 65-byte signatures. ERC-2098 short signatures are rejected. This restriction
     * is DEPRECATED and will be removed in v6.0. Developers SHOULD NOT use signatures as unique identifiers; use hash
     * invalidation or nonces for replay protection.
     *
     * 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 Variant of {recover} that takes a signature in calldata
     */
    function recoverCalldata(bytes32 hash, bytes calldata signature) internal pure returns (address) {
        (address recovered, RecoverError error, bytes32 errorArg) = tryRecoverCalldata(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[ERC-2098 short signatures]
     */
    function tryRecover(bytes32 hash, bytes32 r, bytes32 vs)
        internal
        pure
        returns (address recovered, RecoverError err, bytes32 errArg)
    {
        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 recovered, RecoverError err, bytes32 errArg)
    {
        // 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 Parse a signature into its `v`, `r` and `s` components. Supports 65-byte and 64-byte (ERC-2098)
     * formats. Returns (0,0,0) for invalid signatures.
     *
     * For 64-byte signatures, `v` is automatically normalized to 27 or 28.
     * For 65-byte signatures, `v` is returned as-is and MUST already be 27 or 28 for use with ecrecover.
     *
     * Consider validating the result before use, or use {tryRecover}/{recover} which perform full validation.
     */
    function parse(bytes memory signature) internal pure returns (uint8 v, bytes32 r, bytes32 s) {
        assembly ("memory-safe") {
            // Check the signature length
            switch mload(signature)
            // - case 65: r,s,v signature (standard)
            case 65 {
                r := mload(add(signature, 0x20))
                s := mload(add(signature, 0x40))
                v := byte(0, mload(add(signature, 0x60)))
            }
            // - case 64: r,vs signature (cf https://eips.ethereum.org/EIPS/eip-2098)
            case 64 {
                let vs := mload(add(signature, 0x40))
                r := mload(add(signature, 0x20))
                s := and(vs, shr(1, not(0)))
                v := add(shr(255, vs), 27)
            }
            default {
                r := 0
                s := 0
                v := 0
            }
        }
    }

    /**
     * @dev Variant of {parse} that takes a signature in calldata
     */
    function parseCalldata(bytes calldata signature) internal pure returns (uint8 v, bytes32 r, bytes32 s) {
        assembly ("memory-safe") {
            // Check the signature length
            switch signature.length
            // - case 65: r,s,v signature (standard)
            case 65 {
                r := calldataload(signature.offset)
                s := calldataload(add(signature.offset, 0x20))
                v := byte(0, calldataload(add(signature.offset, 0x40)))
            }
            // - case 64: r,vs signature (cf https://eips.ethereum.org/EIPS/eip-2098)
            case 64 {
                let vs := calldataload(add(signature.offset, 0x20))
                r := calldataload(signature.offset)
                s := and(vs, shr(1, not(0)))
                v := add(shr(255, vs), 27)
            }
            default {
                r := 0
                s := 0
                v := 0
            }
        }
    }

    /**
     * @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.5.0) (utils/cryptography/EIP712.sol)

pragma solidity ^0.8.24;

import {MessageHashUtils} from "@openzeppelin/contracts/utils/cryptography/MessageHashUtils.sol";
import {IERC5267} from "@openzeppelin/contracts/interfaces/IERC5267.sol";
import {Initializable} from "@openzeppelin/contracts/proxy/utils/Initializable.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: The upgradeable version of this contract does not use an immutable cache and recomputes the domain separator
 * each time {_domainSeparatorV4} is called. That is cheaper than accessing a cached version in cold storage.
 */
abstract contract EIP712Upgradeable is Initializable, IERC5267 {
    bytes32 private constant TYPE_HASH =
        keccak256("EIP712Domain(string name,string version,uint256 chainId,address verifyingContract)");

    /// @custom:storage-location erc7201:openzeppelin.storage.EIP712
    struct EIP712Storage {
        /// @custom:oz-renamed-from _HASHED_NAME
        bytes32 _hashedName;
        /// @custom:oz-renamed-from _HASHED_VERSION
        bytes32 _hashedVersion;

        string _name;
        string _version;
    }

    // keccak256(abi.encode(uint256(keccak256("openzeppelin.storage.EIP712")) - 1)) & ~bytes32(uint256(0xff))
    bytes32 private constant EIP712StorageLocation = 0xa16a46d94261c7517cc8ff89f61c0ce93598e3c849801011dee649a6a557d100;

    function _getEIP712Storage() private pure returns (EIP712Storage storage $) {
        assembly {
            $.slot := EIP712StorageLocation
        }
    }

    /**
     * @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].
     */
    function __EIP712_init(string memory name, string memory version) internal onlyInitializing {
        __EIP712_init_unchained(name, version);
    }

    function __EIP712_init_unchained(string memory name, string memory version) internal onlyInitializing {
        EIP712Storage storage $ = _getEIP712Storage();
        $._name = name;
        $._version = version;

        // Reset prior values in storage if upgrading
        $._hashedName = 0;
        $._hashedVersion = 0;
    }

    /**
     * @dev Returns the domain separator for the current chain.
     */
    function _domainSeparatorV4() internal view returns (bytes32) {
        return _buildDomainSeparator();
    }

    function _buildDomainSeparator() private view returns (bytes32) {
        return keccak256(abi.encode(TYPE_HASH, _EIP712NameHash(), _EIP712VersionHash(), 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);
    }

    /// @inheritdoc IERC5267
    function eip712Domain()
        public
        view
        virtual
        returns (
            bytes1 fields,
            string memory name,
            string memory version,
            uint256 chainId,
            address verifyingContract,
            bytes32 salt,
            uint256[] memory extensions
        )
    {
        EIP712Storage storage $ = _getEIP712Storage();
        // If the hashed name and version in storage are non-zero, the contract hasn't been properly initialized
        // and the EIP712 domain is not reliable, as it will be missing name and version.
        require($._hashedName == 0 && $._hashedVersion == 0, "EIP712: Uninitialized");

        return (
            hex"0f", // 01111
            _EIP712Name(),
            _EIP712Version(),
            block.chainid,
            address(this),
            bytes32(0),
            new uint256[](0)
        );
    }

    /**
     * @dev The name parameter for the EIP712 domain.
     *
     * NOTE: This function reads from storage by default, but can be redefined to return a constant value if gas costs
     * are a concern.
     */
    function _EIP712Name() internal view virtual returns (string memory) {
        EIP712Storage storage $ = _getEIP712Storage();
        return $._name;
    }

    /**
     * @dev The version parameter for the EIP712 domain.
     *
     * NOTE: This function reads from storage by default, but can be redefined to return a constant value if gas costs
     * are a concern.
     */
    function _EIP712Version() internal view virtual returns (string memory) {
        EIP712Storage storage $ = _getEIP712Storage();
        return $._version;
    }

    /**
     * @dev The hash of the name parameter for the EIP712 domain.
     *
     * NOTE: In previous versions this function was virtual. In this version you should override `_EIP712Name` instead.
     */
    function _EIP712NameHash() internal view returns (bytes32) {
        EIP712Storage storage $ = _getEIP712Storage();
        string memory name = _EIP712Name();
        if (bytes(name).length > 0) {
            return keccak256(bytes(name));
        } else {
            // If the name is empty, the contract may have been upgraded without initializing the new storage.
            // We return the name hash in storage if non-zero, otherwise we assume the name is empty by design.
            bytes32 hashedName = $._hashedName;
            if (hashedName != 0) {
                return hashedName;
            } else {
                return keccak256("");
            }
        }
    }

    /**
     * @dev The hash of the version parameter for the EIP712 domain.
     *
     * NOTE: In previous versions this function was virtual. In this version you should override `_EIP712Version` instead.
     */
    function _EIP712VersionHash() internal view returns (bytes32) {
        EIP712Storage storage $ = _getEIP712Storage();
        string memory version = _EIP712Version();
        if (bytes(version).length > 0) {
            return keccak256(bytes(version));
        } else {
            // If the version is empty, the contract may have been upgraded without initializing the new storage.
            // We return the version hash in storage if non-zero, otherwise we assume the version is empty by design.
            bytes32 hashedVersion = $._hashedVersion;
            if (hashedVersion != 0) {
                return hashedVersion;
            } else {
                return keccak256("");
            }
        }
    }
}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.0.0) (utils/Nonces.sol)
pragma solidity ^0.8.20;
import {Initializable} from "@openzeppelin/contracts/proxy/utils/Initializable.sol";

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

    /// @custom:storage-location erc7201:openzeppelin.storage.Nonces
    struct NoncesStorage {
        mapping(address account => uint256) _nonces;
    }

    // keccak256(abi.encode(uint256(keccak256("openzeppelin.storage.Nonces")) - 1)) & ~bytes32(uint256(0xff))
    bytes32 private constant NoncesStorageLocation = 0x5ab42ced628888259c08ac98db1eb0cf702fc1501344311d8b100cd1bfe4bb00;

    function _getNoncesStorage() private pure returns (NoncesStorage storage $) {
        assembly {
            $.slot := NoncesStorageLocation
        }
    }

    function __Nonces_init() internal onlyInitializing {
    }

    function __Nonces_init_unchained() internal onlyInitializing {
    }
    /**
     * @dev Returns the next unused nonce for an address.
     */
    function nonces(address owner) public view virtual returns (uint256) {
        NoncesStorage storage $ = _getNoncesStorage();
        return $._nonces[owner];
    }

    /**
     * @dev Consumes a nonce.
     *
     * Returns the current value and increments nonce.
     */
    function _useNonce(address owner) internal virtual returns (uint256) {
        NoncesStorage storage $ = _getNoncesStorage();
        // 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.1.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 ERC-1967 implementation slot:
 * ```solidity
 * contract ERC1967 {
 *     // Define the slot. Alternatively, use the SlotDerivation library to derive the slot.
 *     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;
 *     }
 * }
 * ```
 *
 * TIP: Consider using this library along with {SlotDerivation}.
 */
library StorageSlot {
    struct AddressSlot {
        address value;
    }

    struct BooleanSlot {
        bool value;
    }

    struct Bytes32Slot {
        bytes32 value;
    }

    struct Uint256Slot {
        uint256 value;
    }

    struct Int256Slot {
        int256 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) {
        assembly ("memory-safe") {
            r.slot := slot
        }
    }

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

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

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

    /**
     * @dev Returns a `Int256Slot` with member `value` located at `slot`.
     */
    function getInt256Slot(bytes32 slot) internal pure returns (Int256Slot storage r) {
        assembly ("memory-safe") {
            r.slot := slot
        }
    }

    /**
     * @dev Returns a `StringSlot` with member `value` located at `slot`.
     */
    function getStringSlot(bytes32 slot) internal pure returns (StringSlot storage r) {
        assembly ("memory-safe") {
            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) {
        assembly ("memory-safe") {
            r.slot := store.slot
        }
    }

    /**
     * @dev Returns a `BytesSlot` with member `value` located at `slot`.
     */
    function getBytesSlot(bytes32 slot) internal pure returns (BytesSlot storage r) {
        assembly ("memory-safe") {
            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) {
        assembly ("memory-safe") {
            r.slot := store.slot
        }
    }
}

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

pragma solidity >=0.6.2;

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

/**
 * @title IERC1363
 * @dev Interface of the ERC-1363 standard as defined in the https://eips.ethereum.org/EIPS/eip-1363[ERC-1363].
 *
 * Defines an extension interface for ERC-20 tokens that supports executing code on a recipient contract
 * after `transfer` or `transferFrom`, or code on a spender contract after `approve`, in a single transaction.
 */
interface IERC1363 is IERC20, IERC165 {
    /*
     * Note: the ERC-165 identifier for this interface is 0xb0202a11.
     * 0xb0202a11 ===
     *   bytes4(keccak256('transferAndCall(address,uint256)')) ^
     *   bytes4(keccak256('transferAndCall(address,uint256,bytes)')) ^
     *   bytes4(keccak256('transferFromAndCall(address,address,uint256)')) ^
     *   bytes4(keccak256('transferFromAndCall(address,address,uint256,bytes)')) ^
     *   bytes4(keccak256('approveAndCall(address,uint256)')) ^
     *   bytes4(keccak256('approveAndCall(address,uint256,bytes)'))
     */

    /**
     * @dev Moves a `value` amount of tokens from the caller's account to `to`
     * and then calls {IERC1363Receiver-onTransferReceived} on `to`.
     * @param to The address which you want to transfer to.
     * @param value The amount of tokens to be transferred.
     * @return A boolean value indicating whether the operation succeeded unless throwing.
     */
    function transferAndCall(address to, uint256 value) external returns (bool);

    /**
     * @dev Moves a `value` amount of tokens from the caller's account to `to`
     * and then calls {IERC1363Receiver-onTransferReceived} on `to`.
     * @param to The address which you want to transfer to.
     * @param value The amount of tokens to be transferred.
     * @param data Additional data with no specified format, sent in call to `to`.
     * @return A boolean value indicating whether the operation succeeded unless throwing.
     */
    function transferAndCall(address to, uint256 value, bytes calldata data) external returns (bool);

    /**
     * @dev Moves a `value` amount of tokens from `from` to `to` using the allowance mechanism
     * and then calls {IERC1363Receiver-onTransferReceived} on `to`.
     * @param from The address which you want to send tokens from.
     * @param to The address which you want to transfer to.
     * @param value The amount of tokens to be transferred.
     * @return A boolean value indicating whether the operation succeeded unless throwing.
     */
    function transferFromAndCall(address from, address to, uint256 value) external returns (bool);

    /**
     * @dev Moves a `value` amount of tokens from `from` to `to` using the allowance mechanism
     * and then calls {IERC1363Receiver-onTransferReceived} on `to`.
     * @param from The address which you want to send tokens from.
     * @param to The address which you want to transfer to.
     * @param value The amount of tokens to be transferred.
     * @param data Additional data with no specified format, sent in call to `to`.
     * @return A boolean value indicating whether the operation succeeded unless throwing.
     */
    function transferFromAndCall(address from, address to, uint256 value, bytes calldata data) external returns (bool);

    /**
     * @dev Sets a `value` amount of tokens as the allowance of `spender` over the
     * caller's tokens and then calls {IERC1363Spender-onApprovalReceived} on `spender`.
     * @param spender The address which will spend the funds.
     * @param value The amount of tokens to be spent.
     * @return A boolean value indicating whether the operation succeeded unless throwing.
     */
    function approveAndCall(address spender, uint256 value) external returns (bool);

    /**
     * @dev Sets a `value` amount of tokens as the allowance of `spender` over the
     * caller's tokens and then calls {IERC1363Spender-onApprovalReceived} on `spender`.
     * @param spender The address which will spend the funds.
     * @param value The amount of tokens to be spent.
     * @param data Additional data with no specified format, sent in call to `spender`.
     * @return A boolean value indicating whether the operation succeeded unless throwing.
     */
    function approveAndCall(address spender, uint256 value, bytes calldata data) external returns (bool);
}

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

pragma solidity ^0.8.20;

/**
 * @dev Library of low level call functions that implement different calling strategies to deal with the return data.
 *
 * WARNING: Using this library requires an advanced understanding of Solidity and how the EVM works. It is recommended
 * to use the {Address} library instead.
 */
library LowLevelCall {
    /// @dev Performs a Solidity function call using a low level `call` and ignoring the return data.
    function callNoReturn(address target, bytes memory data) internal returns (bool success) {
        return callNoReturn(target, 0, data);
    }

    /// @dev Same as {callNoReturn}, but allows to specify the value to be sent in the call.
    function callNoReturn(address target, uint256 value, bytes memory data) internal returns (bool success) {
        assembly ("memory-safe") {
            success := call(gas(), target, value, add(data, 0x20), mload(data), 0x00, 0x00)
        }
    }

    /// @dev Performs a Solidity function call using a low level `call` and returns the first 64 bytes of the result
    /// in the scratch space of memory. Useful for functions that return a tuple of single-word values.
    ///
    /// WARNING: Do not assume that the results are zero if `success` is false. Memory can be already allocated
    /// and this function doesn't zero it out.
    function callReturn64Bytes(address target, bytes memory data)
        internal
        returns (bool success, bytes32 result1, bytes32 result2)
    {
        return callReturn64Bytes(target, 0, data);
    }

    /// @dev Same as {callReturnBytes32Pair}, but allows to specify the value to be sent in the call.
    function callReturn64Bytes(address target, uint256 value, bytes memory data)
        internal
        returns (bool success, bytes32 result1, bytes32 result2)
    {
        assembly ("memory-safe") {
            success := call(gas(), target, value, add(data, 0x20), mload(data), 0x00, 0x40)
            result1 := mload(0x00)
            result2 := mload(0x20)
        }
    }

    /// @dev Performs a Solidity function call using a low level `staticcall` and ignoring the return data.
    function staticcallNoReturn(address target, bytes memory data) internal view returns (bool success) {
        assembly ("memory-safe") {
            success := staticcall(gas(), target, add(data, 0x20), mload(data), 0x00, 0x00)
        }
    }

    /// @dev Performs a Solidity function call using a low level `staticcall` and returns the first 64 bytes of the result
    /// in the scratch space of memory. Useful for functions that return a tuple of single-word values.
    ///
    /// WARNING: Do not assume that the results are zero if `success` is false. Memory can be already allocated
    /// and this function doesn't zero it out.
    function staticcallReturn64Bytes(address target, bytes memory data)
        internal
        view
        returns (bool success, bytes32 result1, bytes32 result2)
    {
        assembly ("memory-safe") {
            success := staticcall(gas(), target, add(data, 0x20), mload(data), 0x00, 0x40)
            result1 := mload(0x00)
            result2 := mload(0x20)
        }
    }

    /// @dev Performs a Solidity function call using a low level `delegatecall` and ignoring the return data.
    function delegatecallNoReturn(address target, bytes memory data) internal returns (bool success) {
        assembly ("memory-safe") {
            success := delegatecall(gas(), target, add(data, 0x20), mload(data), 0x00, 0x00)
        }
    }

    /// @dev Performs a Solidity function call using a low level `delegatecall` and returns the first 64 bytes of the result
    /// in the scratch space of memory. Useful for functions that return a tuple of single-word values.
    ///
    /// WARNING: Do not assume that the results are zero if `success` is false. Memory can be already allocated
    /// and this function doesn't zero it out.
    function delegatecallReturn64Bytes(address target, bytes memory data)
        internal
        returns (bool success, bytes32 result1, bytes32 result2)
    {
        assembly ("memory-safe") {
            success := delegatecall(gas(), target, add(data, 0x20), mload(data), 0x00, 0x40)
            result1 := mload(0x00)
            result2 := mload(0x20)
        }
    }

    /// @dev Returns the size of the return data buffer.
    function returnDataSize() internal pure returns (uint256 size) {
        assembly ("memory-safe") {
            size := returndatasize()
        }
    }

    /// @dev Returns a buffer containing the return data from the last call.
    function returnData() internal pure returns (bytes memory result) {
        assembly ("memory-safe") {
            result := mload(0x40)
            mstore(result, returndatasize())
            returndatacopy(add(result, 0x20), 0x00, returndatasize())
            mstore(0x40, add(result, add(0x20, returndatasize())))
        }
    }

    /// @dev Revert with the return data from the last call.
    function bubbleRevert() internal pure {
        assembly ("memory-safe") {
            let fmp := mload(0x40)
            returndatacopy(fmp, 0x00, returndatasize())
            revert(fmp, returndatasize())
        }
    }

    function bubbleRevert(bytes memory returndata) internal pure {
        assembly ("memory-safe") {
            revert(add(returndata, 0x20), mload(returndata))
        }
    }
}

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

pragma solidity ^0.8.24;

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[ERC-191] and https://eips.ethereum.org/EIPS/eip-712[EIP 712]
 * specifications.
 */
library MessageHashUtils {
    /**
     * @dev Returns the keccak256 digest of an ERC-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://ethereum.org/en/developers/docs/apis/json-rpc/#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) {
        assembly ("memory-safe") {
            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 ERC-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://ethereum.org/en/developers/docs/apis/json-rpc/#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 ERC-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"1900", validator, data));
    }

    /**
     * @dev Variant of {toDataWithIntendedValidatorHash-address-bytes} optimized for cases where `data` is a bytes32.
     */
    function toDataWithIntendedValidatorHash(address validator, bytes32 messageHash)
        internal
        pure
        returns (bytes32 digest)
    {
        assembly ("memory-safe") {
            mstore(0x00, hex"1900")
            mstore(0x02, shl(96, validator))
            mstore(0x16, messageHash)
            digest := keccak256(0x00, 0x36)
        }
    }

    /**
     * @dev Returns the keccak256 digest of an EIP-712 typed data (ERC-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) {
        assembly ("memory-safe") {
            let ptr := mload(0x40)
            mstore(ptr, hex"1901")
            mstore(add(ptr, 0x02), domainSeparator)
            mstore(add(ptr, 0x22), structHash)
            digest := keccak256(ptr, 0x42)
        }
    }
}

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

pragma solidity >=0.4.16;

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.4.0) (interfaces/IERC20.sol)

pragma solidity >=0.4.16;

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

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

pragma solidity >=0.4.16;

import {IERC165} from "../utils/introspection/IERC165.sol";

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

pragma solidity ^0.8.24;

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

/**
 * @dev String operations.
 */
library Strings {
    using SafeCast for *;

    bytes16 private constant HEX_DIGITS = "0123456789abcdef";
    uint8 private constant ADDRESS_LENGTH = 20;
    uint256 private constant SPECIAL_CHARS_LOOKUP = (1 << 0x08) // backspace
        | (1 << 0x09) // tab
        | (1 << 0x0a) // newline
        | (1 << 0x0c) // form feed
        | (1 << 0x0d) // carriage return
        | (1 << 0x22) // double quote
        | (1 << 0x5c); // backslash

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

    /**
     * @dev The string being parsed contains characters that are not in scope of the given base.
     */
    error StringsInvalidChar();

    /**
     * @dev The string being parsed is not a properly formatted address.
     */
    error StringsInvalidAddressFormat();

    /**
     * @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;
            assembly ("memory-safe") {
                ptr := add(add(buffer, 0x20), length)
            }
            while (true) {
                ptr--;
                assembly ("memory-safe") {
                    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 Converts an `address` with fixed length of 20 bytes to its checksummed ASCII `string` hexadecimal
     * representation, according to EIP-55.
     */
    function toChecksumHexString(address addr) internal pure returns (string memory) {
        bytes memory buffer = bytes(toHexString(addr));

        // hash the hex part of buffer (skip length + 2 bytes, length 40)
        uint256 hashValue;
        assembly ("memory-safe") {
            hashValue := shr(96, keccak256(add(buffer, 0x22), 40))
        }

        for (uint256 i = 41; i > 1; --i) {
            // possible values for buffer[i] are 48 (0) to 57 (9) and 97 (a) to 102 (f)
            if (hashValue & 0xf > 7 && uint8(buffer[i]) > 96) {
                // case shift by xoring with 0x20
                buffer[i] ^= 0x20;
            }
            hashValue >>= 4;
        }
        return string(buffer);
    }

    /**
     * @dev Converts a `bytes` buffer to its ASCII `string` hexadecimal representation.
     */
    function toHexString(bytes memory input) internal pure returns (string memory) {
        unchecked {
            bytes memory buffer = new bytes(2 * input.length + 2);
            buffer[0] = "0";
            buffer[1] = "x";
            for (uint256 i = 0; i < input.length; ++i) {
                uint8 v = uint8(input[i]);
                buffer[2 * i + 2] = HEX_DIGITS[v >> 4];
                buffer[2 * i + 3] = HEX_DIGITS[v & 0xf];
            }
            return string(buffer);
        }
    }

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

    /**
     * @dev Parse a decimal string and returns the value as a `uint256`.
     *
     * Requirements:
     * - The string must be formatted as `[0-9]*`
     * - The result must fit into an `uint256` type
     */
    function parseUint(string memory input) internal pure returns (uint256) {
        return parseUint(input, 0, bytes(input).length);
    }

    /**
     * @dev Variant of {parseUint-string} that parses a substring of `input` located between position `begin` (included) and
     * `end` (excluded).
     *
     * Requirements:
     * - The substring must be formatted as `[0-9]*`
     * - The result must fit into an `uint256` type
     */
    function parseUint(string memory input, uint256 begin, uint256 end) internal pure returns (uint256) {
        (bool success, uint256 value) = tryParseUint(input, begin, end);
        if (!success) revert StringsInvalidChar();
        return value;
    }

    /**
     * @dev Variant of {parseUint-string} that returns false if the parsing fails because of an invalid character.
     *
     * NOTE: This function will revert if the result does not fit in a `uint256`.
     */
    function tryParseUint(string memory input) internal pure returns (bool success, uint256 value) {
        return _tryParseUintUncheckedBounds(input, 0, bytes(input).length);
    }

    /**
     * @dev Variant of {parseUint-string-uint256-uint256} that returns false if the parsing fails because of an invalid
     * character.
     *
     * NOTE: This function will revert if the result does not fit in a `uint256`.
     */
    function tryParseUint(string memory input, uint256 begin, uint256 end)
        internal
        pure
        returns (bool success, uint256 value)
    {
        if (end > bytes(input).length || begin > end) return (false, 0);
        return _tryParseUintUncheckedBounds(input, begin, end);
    }

    /**
     * @dev Implementation of {tryParseUint-string-uint256-uint256} that does not check bounds. Caller should make sure that
     * `begin <= end <= input.length`. Other inputs would result in undefined behavior.
     */
    function _tryParseUintUncheckedBounds(string memory input, uint256 begin, uint256 end)
        private
        pure
        returns (bool success, uint256 value)
    {
        bytes memory buffer = bytes(input);

        uint256 result = 0;
        for (uint256 i = begin; i < end; ++i) {
            uint8 chr = _tryParseChr(bytes1(_unsafeReadBytesOffset(buffer, i)));
            if (chr > 9) return (false, 0);
            result *= 10;
            result += chr;
        }
        return (true, result);
    }

    /**
     * @dev Parse a decimal string and returns the value as a `int256`.
     *
     * Requirements:
     * - The string must be formatted as `[-+]?[0-9]*`
     * - The result must fit in an `int256` type.
     */
    function parseInt(string memory input) internal pure returns (int256) {
        return parseInt(input, 0, bytes(input).length);
    }

    /**
     * @dev Variant of {parseInt-string} that parses a substring of `input` located between position `begin` (included) and
     * `end` (excluded).
     *
     * Requirements:
     * - The substring must be formatted as `[-+]?[0-9]*`
     * - The result must fit in an `int256` type.
     */
    function parseInt(string memory input, uint256 begin, uint256 end) internal pure returns (int256) {
        (bool success, int256 value) = tryParseInt(input, begin, end);
        if (!success) revert StringsInvalidChar();
        return value;
    }

    /**
     * @dev Variant of {parseInt-string} that returns false if the parsing fails because of an invalid character or if
     * the result does not fit in a `int256`.
     *
     * NOTE: This function will revert if the absolute value of the result does not fit in a `uint256`.
     */
    function tryParseInt(string memory input) internal pure returns (bool success, int256 value) {
        return _tryParseIntUncheckedBounds(input, 0, bytes(input).length);
    }

    uint256 private constant ABS_MIN_INT256 = 2 ** 255;

    /**
     * @dev Variant of {parseInt-string-uint256-uint256} that returns false if the parsing fails because of an invalid
     * character or if the result does not fit in a `int256`.
     *
     * NOTE: This function will revert if the absolute value of the result does not fit in a `uint256`.
     */
    function tryParseInt(string memory input, uint256 begin, uint256 end)
        internal
        pure
        returns (bool success, int256 value)
    {
        if (end > bytes(input).length || begin > end) return (false, 0);
        return _tryParseIntUncheckedBounds(input, begin, end);
    }

    /**
     * @dev Implementation of {tryParseInt-string-uint256-uint256} that does not check bounds. Caller should make sure that
     * `begin <= end <= input.length`. Other inputs would result in undefined behavior.
     */
    function _tryParseIntUncheckedBounds(string memory input, uint256 begin, uint256 end)
        private
        pure
        returns (bool success, int256 value)
    {
        bytes memory buffer = bytes(input);

        // Check presence of a negative sign.
        bytes1 sign = begin == end ? bytes1(0) : bytes1(_unsafeReadBytesOffset(buffer, begin)); // don't do out-of-bound (possibly unsafe) read if sub-string is empty
        bool positiveSign = sign == bytes1("+");
        bool negativeSign = sign == bytes1("-");
        uint256 offset = (positiveSign || negativeSign).toUint();

        (bool absSuccess, uint256 absValue) = tryParseUint(input, begin + offset, end);

        if (absSuccess && absValue < ABS_MIN_INT256) {
            return (true, negativeSign ? -int256(absValue) : int256(absValue));
        } else if (absSuccess && negativeSign && absValue == ABS_MIN_INT256) {
            return (true, type(int256).min);
        } else {
            return (false, 0);
        }
    }

    /**
     * @dev Parse a hexadecimal string (with or without "0x" prefix), and returns the value as a `uint256`.
     *
     * Requirements:
     * - The string must be formatted as `(0x)?[0-9a-fA-F]*`
     * - The result must fit in an `uint256` type.
     */
    function parseHexUint(string memory input) internal pure returns (uint256) {
        return parseHexUint(input, 0, bytes(input).length);
    }

    /**
     * @dev Variant of {parseHexUint-string} that parses a substring of `input` located between position `begin` (included) and
     * `end` (excluded).
     *
     * Requirements:
     * - The substring must be formatted as `(0x)?[0-9a-fA-F]*`
     * - The result must fit in an `uint256` type.
     */
    function parseHexUint(string memory input, uint256 begin, uint256 end) internal pure returns (uint256) {
        (bool success, uint256 value) = tryParseHexUint(input, begin, end);
        if (!success) revert StringsInvalidChar();
        return value;
    }

    /**
     * @dev Variant of {parseHexUint-string} that returns false if the parsing fails because of an invalid character.
     *
     * NOTE: This function will revert if the result does not fit in a `uint256`.
     */
    function tryParseHexUint(string memory input) internal pure returns (bool success, uint256 value) {
        return _tryParseHexUintUncheckedBounds(input, 0, bytes(input).length);
    }

    /**
     * @dev Variant of {parseHexUint-string-uint256-uint256} that returns false if the parsing fails because of an
     * invalid character.
     *
     * NOTE: This function will revert if the result does not fit in a `uint256`.
     */
    function tryParseHexUint(string memory input, uint256 begin, uint256 end)
        internal
        pure
        returns (bool success, uint256 value)
    {
        if (end > bytes(input).length || begin > end) return (false, 0);
        return _tryParseHexUintUncheckedBounds(input, begin, end);
    }

    /**
     * @dev Implementation of {tryParseHexUint-string-uint256-uint256} that does not check bounds. Caller should make sure that
     * `begin <= end <= input.length`. Other inputs would result in undefined behavior.
     */
    function _tryParseHexUintUncheckedBounds(string memory input, uint256 begin, uint256 end)
        private
        pure
        returns (bool success, uint256 value)
    {
        bytes memory buffer = bytes(input);

        // skip 0x prefix if present
        bool hasPrefix = (end > begin + 1) && bytes2(_unsafeReadBytesOffset(buffer, begin)) == bytes2("0x"); // don't do out-of-bound (possibly unsafe) read if sub-string is empty
        uint256 offset = hasPrefix.toUint() * 2;

        uint256 result = 0;
        for (uint256 i = begin + offset; i < end; ++i) {
            uint8 chr = _tryParseChr(bytes1(_unsafeReadBytesOffset(buffer, i)));
            if (chr > 15) return (false, 0);
            result *= 16;
            unchecked {
                // Multiplying by 16 is equivalent to a shift of 4 bits (with additional overflow check).
                // This guarantees that adding a value < 16 will not cause an overflow, hence the unchecked.
                result += chr;
            }
        }
        return (true, result);
    }

    /**
     * @dev Parse a hexadecimal string (with or without "0x" prefix), and returns the value as an `address`.
     *
     * Requirements:
     * - The string must be formatted as `(0x)?[0-9a-fA-F]{40}`
     */
    function parseAddress(string memory input) internal pure returns (address) {
        return parseAddress(input, 0, bytes(input).length);
    }

    /**
     * @dev Variant of {parseAddress-string} that parses a substring of `input` located between position `begin` (included) and
     * `end` (excluded).
     *
     * Requirements:
     * - The substring must be formatted as `(0x)?[0-9a-fA-F]{40}`
     */
    function parseAddress(string memory input, uint256 begin, uint256 end) internal pure returns (address) {
        (bool success, address value) = tryParseAddress(input, begin, end);
        if (!success) revert StringsInvalidAddressFormat();
        return value;
    }

    /**
     * @dev Variant of {parseAddress-string} that returns false if the parsing fails because the input is not a properly
     * formatted address. See {parseAddress-string} requirements.
     */
    function tryParseAddress(string memory input) internal pure returns (bool success, address value) {
        return tryParseAddress(input, 0, bytes(input).length);
    }

    /**
     * @dev Variant of {parseAddress-string-uint256-uint256} that returns false if the parsing fails because input is not a properly
     * formatted address. See {parseAddress-string-uint256-uint256} requirements.
     */
    function tryParseAddress(string memory input, uint256 begin, uint256 end)
        internal
        pure
        returns (bool success, address value)
    {
        if (end > bytes(input).length || begin > end) return (false, address(0));

        bool hasPrefix = (end > begin + 1) && bytes2(_unsafeReadBytesOffset(bytes(input), begin)) == bytes2("0x"); // don't do out-of-bound (possibly unsafe) read if sub-string is empty
        uint256 expectedLength = 40 + hasPrefix.toUint() * 2;

        // check that input is the correct length
        if (end - begin == expectedLength) {
            // length guarantees that this does not overflow, and value is at most type(uint160).max
            (bool s, uint256 v) = _tryParseHexUintUncheckedBounds(input, begin, end);
            return (s, address(uint160(v)));
        } else {
            return (false, address(0));
        }
    }

    function _tryParseChr(bytes1 chr) private pure returns (uint8) {
        uint8 value = uint8(chr);

        // Try to parse `chr`:
        // - Case 1: [0-9]
        // - Case 2: [a-f]
        // - Case 3: [A-F]
        // - otherwise not supported
        unchecked {
            if (value > 47 && value < 58) value -= 48;
            else if (value > 96 && value < 103) value -= 87;
            else if (value > 64 && value < 71) value -= 55;
            else return type(uint8).max;
        }

        return value;
    }

    /**
     * @dev Escape special characters in JSON strings. This can be useful to prevent JSON injection in NFT metadata.
     *
     * WARNING: This function should only be used in double quoted JSON strings. Single quotes are not escaped.
     *
     * NOTE: This function escapes all unicode characters, and not just the ones in ranges defined in section 2.5 of
     * RFC-4627 (U+0000 to U+001F, U+0022 and U+005C). ECMAScript's `JSON.parse` does recover escaped unicode
     * characters that are not in this range, but other tooling may provide different results.
     */
    function escapeJSON(string memory input) internal pure returns (string memory) {
        bytes memory buffer = bytes(input);
        bytes memory output = new bytes(2 * buffer.length); // worst case scenario
        uint256 outputLength = 0;

        for (uint256 i = 0; i < buffer.length; ++i) {
            bytes1 char = bytes1(_unsafeReadBytesOffset(buffer, i));
            if (((SPECIAL_CHARS_LOOKUP & (1 << uint8(char))) != 0)) {
                output[outputLength++] = "\\";
                if (char == 0x08) {
                    output[outputLength++] = "b";
                } else if (char == 0x09) {
                    output[outputLength++] = "t";
                } else if (char == 0x0a) {
                    output[outputLength++] = "n";
                } else if (char == 0x0c) {
                    output[outputLength++] = "f";
                } else if (char == 0x0d) {
                    output[outputLength++] = "r";
                } else if (char == 0x5c) {
                    output[outputLength++] = "\\";
                } else if (char == 0x22) {
                    // solhint-disable-next-line quotes
                    output[outputLength++] = '"';
                }
            } else {
                output[outputLength++] = char;
            }
        }
        // write the actual length and deallocate unused memory
        assembly ("memory-safe") {
            mstore(output, outputLength)
            mstore(0x40, add(output, shl(5, shr(5, add(outputLength, 63)))))
        }

        return string(output);
    }

    /**
     * @dev Reads a bytes32 from a bytes array without bounds checking.
     *
     * NOTE: making this function internal would mean it could be used with memory unsafe offset, and marking the
     * assembly block as such would prevent some optimizations.
     */
    function _unsafeReadBytesOffset(bytes memory buffer, uint256 offset) private pure returns (bytes32 value) {
        // This is not memory safe in the general case, but all calls to this private function are within bounds.
        assembly ("memory-safe") {
            value := mload(add(add(buffer, 0x20), offset))
        }
    }
}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.4.0) (utils/introspection/IERC165.sol)

pragma solidity >=0.4.16;

/**
 * @dev Interface of the ERC-165 standard, as defined in the
 * https://eips.ethereum.org/EIPS/eip-165[ERC].
 *
 * Implementers can declare support of contract interfaces, which can then be
 * queried by others ({ERC165Checker}).
 *
 * For an implementation, see {ERC165}.
 */
interface IERC165 {
    /**
     * @dev Returns true if this contract implements the interface defined by
     * `interfaceId`. See the corresponding
     * https://eips.ethereum.org/EIPS/eip-165#how-interfaces-are-identified[ERC section]
     * to learn more about how these ids are created.
     *
     * This function call must use less than 30 000 gas.
     */
    function supportsInterface(bytes4 interfaceId) external view returns (bool);
}

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

pragma solidity ^0.8.20;

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

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

    /**
     * @dev Return the 512-bit addition of two uint256.
     *
     * The result is stored in two 256 variables such that sum = high * 2²⁵⁶ + low.
     */
    function add512(uint256 a, uint256 b) internal pure returns (uint256 high, uint256 low) {
        assembly ("memory-safe") {
            low := add(a, b)
            high := lt(low, a)
        }
    }

    /**
     * @dev Return the 512-bit multiplication of two uint256.
     *
     * The result is stored in two 256 variables such that product = high * 2²⁵⁶ + low.
     */
    function mul512(uint256 a, uint256 b) internal pure returns (uint256 high, uint256 low) {
        // 512-bit multiply [high low] = x * y. Compute the product mod 2²⁵⁶ and mod 2²⁵⁶ - 1, then use
        // the Chinese Remainder Theorem to reconstruct the 512 bit result. The result is stored in two 256
        // variables such that product = high * 2²⁵⁶ + low.
        assembly ("memory-safe") {
            let mm := mulmod(a, b, not(0))
            low := mul(a, b)
            high := sub(sub(mm, low), lt(mm, low))
        }
    }

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

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

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

    /**
     * @dev Returns the division of two unsigned integers, with a success flag (no division by zero).
     */
    function tryDiv(uint256 a, uint256 b) internal pure returns (bool success, uint256 result) {
        unchecked {
            success = b > 0;
            assembly ("memory-safe") {
                // The `DIV` opcode returns zero when the denominator is 0.
                result := div(a, b)
            }
        }
    }

    /**
     * @dev Returns the remainder of dividing two unsigned integers, with a success flag (no division by zero).
     */
    function tryMod(uint256 a, uint256 b) internal pure returns (bool success, uint256 result) {
        unchecked {
            success = b > 0;
            assembly ("memory-safe") {
                // The `MOD` opcode returns zero when the denominator is 0.
                result := mod(a, b)
            }
        }
    }

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

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

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

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

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

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

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

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

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

    /**
     * @dev Calculates floor(x * y / denominator) with full precision. Throws if result overflows a uint256 or
     * denominator == 0.
     *
     * Original credit to Remco Bloemen under MIT license (https://xn--2-umb.com/21/muldiv) with further edits by
     * Uniswap Labs also under MIT license.
     */
    function mulDiv(uint256 x, uint256 y, uint256 denominator) internal pure returns (uint256 result) {
        unchecked {
            (uint256 high, uint256 low) = mul512(x, y);

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

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

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

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

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

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

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

                // Divide [high low] by twos.
                low := div(low, twos)

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

            // Shift in bits from high into low.
            low |= high * twos;

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

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

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

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

    /**
     * @dev Calculates floor(x * y >> n) with full precision. Throws if result overflows a uint256.
     */
    function mulShr(uint256 x, uint256 y, uint8 n) internal pure returns (uint256 result) {
        unchecked {
            (uint256 high, uint256 low) = mul512(x, y);
            if (high >= 1 << n) {
                Panic.panic(Panic.UNDER_OVERFLOW);
            }
            return (high << (256 - n)) | (low >> n);
        }
    }

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

        uint256 mLen = m.length;

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

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

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

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

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

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

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

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

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

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

    /**
     * @dev Return the log in base 2 of a positive value rounded towards zero.
     * Returns 0 if given 0.
     */
    function log2(uint256 x) internal pure returns (uint256 r) {
        // If value has upper 128 bits set, log2 result is at least 128
        r = SafeCast.toUint(x > 0xffffffffffffffffffffffffffffffff) << 7;
        // If upper 64 bits of 128-bit half set, add 64 to result
        r |= SafeCast.toUint((x >> r) > 0xffffffffffffffff) << 6;
        // If upper 32 bits of 64-bit half set, add 32 to result
        r |= SafeCast.toUint((x >> r) > 0xffffffff) << 5;
        // If upper 16 bits of 32-bit half set, add 16 to result
        r |= SafeCast.toUint((x >> r) > 0xffff) << 4;
        // If upper 8 bits of 16-bit half set, add 8 to result
        r |= SafeCast.toUint((x >> r) > 0xff) << 3;
        // If upper 4 bits of 8-bit half set, add 4 to result
        r |= SafeCast.toUint((x >> r) > 0xf) << 2;

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

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

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

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

    /**
     * @dev Return the log in base 256 of a positive value rounded towards zero.
     * Returns 0 if given 0.
     *
     * Adding one to the result gives the number of pairs of hex symbols needed to represent `value` as a hex string.
     */
    function log256(uint256 x) internal pure returns (uint256 r) {
        // If value has upper 128 bits set, log2 result is at least 128
        r = SafeCast.toUint(x > 0xffffffffffffffffffffffffffffffff) << 7;
        // If upper 64 bits of 128-bit half set, add 64 to result
        r |= SafeCast.toUint((x >> r) > 0xffffffffffffffff) << 6;
        // If upper 32 bits of 64-bit half set, add 32 to result
        r |= SafeCast.toUint((x >> r) > 0xffffffff) << 5;
        // If upper 16 bits of 32-bit half set, add 16 to result
        r |= SafeCast.toUint((x >> r) > 0xffff) << 4;
        // Add 1 if upper 8 bits of 16-bit half set, and divide accumulated result by 8
        return (r >> 3) | SafeCast.toUint((x >> r) > 0xff);
    }

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

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

    /**
     * @dev Counts the number of leading zero bits in a uint256.
     */
    function clz(uint256 x) internal pure returns (uint256) {
        return ternary(x == 0, 256, 255 - log2(x));
    }
}

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

pragma solidity ^0.8.20;

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

pragma solidity ^0.8.20;

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

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

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

    /**
     * @dev Returns the smallest of two signed numbers.
     */
    function min(int256 a, int256 b) internal pure returns (int256) {
        return ternary(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 {
            // Formula from the "Bit Twiddling Hacks" by Sean Eron Anderson.
            // Since `n` is a signed integer, the generated bytecode will use the SAR opcode to perform the right shift,
            // taking advantage of the most significant (or "sign" bit) in two's complement representation.
            // This opcode adds new most significant bits set to the value of the previous most significant bit. As a result,
            // the mask will either be `bytes32(0)` (if n is positive) or `~bytes32(0)` (if n is negative).
            int256 mask = n >> 255;

            // A `bytes32(0)` mask leaves the input unchanged, while a `~bytes32(0)` mask complements it.
            return uint256((n + mask) ^ mask);
        }
    }
}

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

pragma solidity ^0.8.24;

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

/**
 * @dev Bytes operations.
 */
library Bytes {
    /**
     * @dev Forward search for `s` in `buffer`
     * * If `s` is present in the buffer, returns the index of the first instance
     * * If `s` is not present in the buffer, returns type(uint256).max
     *
     * NOTE: replicates the behavior of https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/indexOf[Javascript's `Array.indexOf`]
     */
    function indexOf(bytes memory buffer, bytes1 s) internal pure returns (uint256) {
        return indexOf(buffer, s, 0);
    }

    /**
     * @dev Forward search for `s` in `buffer` starting at position `pos`
     * * If `s` is present in the buffer (at or after `pos`), returns the index of the next instance
     * * If `s` is not present in the buffer (at or after `pos`), returns type(uint256).max
     *
     * NOTE: replicates the behavior of https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/indexOf[Javascript's `Array.indexOf`]
     */
    function indexOf(bytes memory buffer, bytes1 s, uint256 pos) internal pure returns (uint256) {
        uint256 length = buffer.length;
        for (uint256 i = pos; i < length; ++i) {
            if (bytes1(_unsafeReadBytesOffset(buffer, i)) == s) {
                return i;
            }
        }
        return type(uint256).max;
    }

    /**
     * @dev Backward search for `s` in `buffer`
     * * If `s` is present in the buffer, returns the index of the last instance
     * * If `s` is not present in the buffer, returns type(uint256).max
     *
     * NOTE: replicates the behavior of https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/lastIndexOf[Javascript's `Array.lastIndexOf`]
     */
    function lastIndexOf(bytes memory buffer, bytes1 s) internal pure returns (uint256) {
        return lastIndexOf(buffer, s, type(uint256).max);
    }

    /**
     * @dev Backward search for `s` in `buffer` starting at position `pos`
     * * If `s` is present in the buffer (at or before `pos`), returns the index of the previous instance
     * * If `s` is not present in the buffer (at or before `pos`), returns type(uint256).max
     *
     * NOTE: replicates the behavior of https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/lastIndexOf[Javascript's `Array.lastIndexOf`]
     */
    function lastIndexOf(bytes memory buffer, bytes1 s, uint256 pos) internal pure returns (uint256) {
        unchecked {
            uint256 length = buffer.length;
            for (uint256 i = Math.min(Math.saturatingAdd(pos, 1), length); i > 0; --i) {
                if (bytes1(_unsafeReadBytesOffset(buffer, i - 1)) == s) {
                    return i - 1;
                }
            }
            return type(uint256).max;
        }
    }

    /**
     * @dev Copies the content of `buffer`, from `start` (included) to the end of `buffer` into a new bytes object in
     * memory.
     *
     * NOTE: replicates the behavior of https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/slice[Javascript's `Array.slice`]
     */
    function slice(bytes memory buffer, uint256 start) internal pure returns (bytes memory) {
        return slice(buffer, start, buffer.length);
    }

    /**
     * @dev Copies the content of `buffer`, from `start` (included) to `end` (excluded) into a new bytes object in
     * memory. The `end` argument is truncated to the length of the `buffer`.
     *
     * NOTE: replicates the behavior of https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/slice[Javascript's `Array.slice`]
     */
    function slice(bytes memory buffer, uint256 start, uint256 end) internal pure returns (bytes memory) {
        // sanitize
        end = Math.min(end, buffer.length);
        start = Math.min(start, end);

        // allocate and copy
        bytes memory result = new bytes(end - start);
        assembly ("memory-safe") {
            mcopy(add(result, 0x20), add(add(buffer, 0x20), start), sub(end, start))
        }

        return result;
    }

    /**
     * @dev Moves the content of `buffer`, from `start` (included) to the end of `buffer` to the start of that buffer.
     *
     * NOTE: This function modifies the provided buffer in place. If you need to preserve the original buffer, use {slice} instead
     * NOTE: replicates the behavior of https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/splice[Javascript's `Array.splice`]
     */
    function splice(bytes memory buffer, uint256 start) internal pure returns (bytes memory) {
        return splice(buffer, start, buffer.length);
    }

    /**
     * @dev Moves the content of `buffer`, from `start` (included) to end (excluded) to the start of that buffer. The
     * `end` argument is truncated to the length of the `buffer`.
     *
     * NOTE: This function modifies the provided buffer in place. If you need to preserve the original buffer, use {slice} instead
     * NOTE: replicates the behavior of https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/splice[Javascript's `Array.splice`]
     */
    function splice(bytes memory buffer, uint256 start, uint256 end) internal pure returns (bytes memory) {
        // sanitize
        end = Math.min(end, buffer.length);
        start = Math.min(start, end);

        // allocate and copy
        assembly ("memory-safe") {
            mcopy(add(buffer, 0x20), add(add(buffer, 0x20), start), sub(end, start))
            mstore(buffer, sub(end, start))
        }

        return buffer;
    }

    /**
     * @dev Concatenate an array of bytes into a single bytes object.
     *
     * For fixed bytes types, we recommend using the solidity built-in `bytes.concat` or (equivalent)
     * `abi.encodePacked`.
     *
     * NOTE: this could be done in assembly with a single loop that expands starting at the FMP, but that would be
     * significantly less readable. It might be worth benchmarking the savings of the full-assembly approach.
     */
    function concat(bytes[] memory buffers) internal pure returns (bytes memory) {
        uint256 length = 0;
        for (uint256 i = 0; i < buffers.length; ++i) {
            length += buffers[i].length;
        }

        bytes memory result = new bytes(length);

        uint256 offset = 0x20;
        for (uint256 i = 0; i < buffers.length; ++i) {
            bytes memory input = buffers[i];
            assembly ("memory-safe") {
                mcopy(add(result, offset), add(input, 0x20), mload(input))
            }
            unchecked {
                offset += input.length;
            }
        }

        return result;
    }

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

    /**
     * @dev Reverses the byte order of a bytes32 value, converting between little-endian and big-endian.
     * Inspired by https://graphics.stanford.edu/~seander/bithacks.html#ReverseParallel[Reverse Parallel]
     */
    function reverseBytes32(bytes32 value) internal pure returns (bytes32) {
        value = // swap bytes
             ((value >> 8) & 0x00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF)
            | ((value & 0x00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF) << 8);
        value = // swap 2-byte long pairs
             ((value >> 16) & 0x0000FFFF0000FFFF0000FFFF0000FFFF0000FFFF0000FFFF0000FFFF0000FFFF)
            | ((value & 0x0000FFFF0000FFFF0000FFFF0000FFFF0000FFFF0000FFFF0000FFFF0000FFFF) << 16);
        value = // swap 4-byte long pairs
             ((value >> 32) & 0x00000000FFFFFFFF00000000FFFFFFFF00000000FFFFFFFF00000000FFFFFFFF)
            | ((value & 0x00000000FFFFFFFF00000000FFFFFFFF00000000FFFFFFFF00000000FFFFFFFF) << 32);
        value = // swap 8-byte long pairs
             ((value >> 64) & 0x0000000000000000FFFFFFFFFFFFFFFF0000000000000000FFFFFFFFFFFFFFFF)
            | ((value & 0x0000000000000000FFFFFFFFFFFFFFFF0000000000000000FFFFFFFFFFFFFFFF) << 64);
        return (value >> 128) | (value << 128); // swap 16-byte long pairs
    }

    /// @dev Same as {reverseBytes32} but optimized for 128-bit values.
    function reverseBytes16(bytes16 value) internal pure returns (bytes16) {
        value = // swap bytes
                ((value & 0xFF00FF00FF00FF00FF00FF00FF00FF00) >> 8)
                | ((value & 0x00FF00FF00FF00FF00FF00FF00FF00FF) << 8);
        value = // swap 2-byte long pairs
                ((value & 0xFFFF0000FFFF0000FFFF0000FFFF0000) >> 16)
                | ((value & 0x0000FFFF0000FFFF0000FFFF0000FFFF) << 16);
        value = // swap 4-byte long pairs
                ((value & 0xFFFFFFFF00000000FFFFFFFF00000000) >> 32)
                | ((value & 0x00000000FFFFFFFF00000000FFFFFFFF) << 32);
        return (value >> 64) | (value << 64); // swap 8-byte long pairs
    }

    /// @dev Same as {reverseBytes32} but optimized for 64-bit values.
    function reverseBytes8(bytes8 value) internal pure returns (bytes8) {
        value = ((value & 0xFF00FF00FF00FF00) >> 8) | ((value & 0x00FF00FF00FF00FF) << 8); // swap bytes
        value = ((value & 0xFFFF0000FFFF0000) >> 16) | ((value & 0x0000FFFF0000FFFF) << 16); // swap 2-byte long pairs
        return (value >> 32) | (value << 32); // swap 4-byte long pairs
    }

    /// @dev Same as {reverseBytes32} but optimized for 32-bit values.
    function reverseBytes4(bytes4 value) internal pure returns (bytes4) {
        value = ((value & 0xFF00FF00) >> 8) | ((value & 0x00FF00FF) << 8); // swap bytes
        return (value >> 16) | (value << 16); // swap 2-byte long pairs
    }

    /// @dev Same as {reverseBytes32} but optimized for 16-bit values.
    function reverseBytes2(bytes2 value) internal pure returns (bytes2) {
        return (value >> 8) | (value << 8);
    }

    /**
     * @dev Counts the number of leading zero bits a bytes array. Returns `8 * buffer.length`
     * if the buffer is all zeros.
     */
    function clz(bytes memory buffer) internal pure returns (uint256) {
        for (uint256 i = 0; i < buffer.length; i += 0x20) {
            bytes32 chunk = _unsafeReadBytesOffset(buffer, i);
            if (chunk != bytes32(0)) {
                return Math.min(8 * i + Math.clz(uint256(chunk)), 8 * buffer.length);
            }
        }
        return 8 * buffer.length;
    }

    /**
     * @dev Reads a bytes32 from a bytes array without bounds checking.
     *
     * NOTE: making this function internal would mean it could be used with memory unsafe offset, and marking the
     * assembly block as such would prevent some optimizations.
     */
    function _unsafeReadBytesOffset(bytes memory buffer, uint256 offset) private pure returns (bytes32 value) {
        // This is not memory safe in the general case, but all calls to this private function are within bounds.
        assembly ("memory-safe") {
            value := mload(add(add(buffer, 0x20), offset))
        }
    }
}

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

pragma solidity ^0.8.20;

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

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

{
  "remappings": [
    "@openzeppelin/contracts-upgradeable/=lib/openzeppelin-contracts-upgradeable/contracts/",
    "@openzeppelin/contracts/=lib/openzeppelin-contracts/contracts/",
    "erc4626-tests/=lib/openzeppelin-contracts-upgradeable/lib/erc4626-tests/",
    "forge-std/=lib/forge-std/src/",
    "halmos-cheatcodes/=lib/openzeppelin-contracts-upgradeable/lib/halmos-cheatcodes/src/",
    "openzeppelin-contracts-upgradeable/=lib/openzeppelin-contracts-upgradeable/",
    "openzeppelin-contracts/=lib/openzeppelin-contracts/"
  ],
  "optimizer": {
    "enabled": true,
    "runs": 1
  },
  "metadata": {
    "useLiteralContent": false,
    "bytecodeHash": "ipfs",
    "appendCBOR": true
  },
  "outputSelection": {
    "*": {
      "*": [
        "evm.bytecode",
        "evm.deployedBytecode",
        "devdoc",
        "userdoc",
        "metadata",
        "abi"
      ]
    }
  },
  "evmVersion": "prague",
  "viaIR": false
}

• No Contract Security Audit Submitted- Submit Audit Here

[{"inputs":[{"internalType":"address","name":"implementation_","type":"address"},{"internalType":"address","name":"priceFeed_","type":"address"},{"internalType":"uint256","name":"fallbackFee_","type":"uint256"}],"stateMutability":"nonpayable","type":"constructor"},{"inputs":[],"name":"ArrayMismatch","type":"error"},{"inputs":[],"name":"FailedDeployment","type":"error"},{"inputs":[],"name":"FeeTransferFailed","type":"error"},{"inputs":[{"internalType":"uint256","name":"balance","type":"uint256"},{"internalType":"uint256","name":"needed","type":"uint256"}],"name":"InsufficientBalance","type":"error"},{"inputs":[],"name":"InsufficientFee","type":"error"},{"inputs":[],"name":"NotOwner","type":"error"},{"inputs":[],"name":"ZeroImplementation","type":"error"},{"inputs":[],"name":"ZeroOwner","type":"error"},{"inputs":[],"name":"ZeroSupply","type":"error"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"uint256","name":"newFee","type":"uint256"}],"name":"FallbackFeeUpdated","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"creator","type":"address"},{"indexed":false,"internalType":"uint256","name":"amount","type":"uint256"}],"name":"FeeCollected","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"token","type":"address"},{"indexed":false,"internalType":"address[]","name":"recipients","type":"address[]"},{"indexed":false,"internalType":"uint256[]","name":"amounts","type":"uint256[]"},{"indexed":false,"internalType":"string[]","name":"labels","type":"string[]"}],"name":"InitialDistribution","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":[{"indexed":true,"internalType":"address","name":"token","type":"address"},{"indexed":true,"internalType":"address","name":"owner","type":"address"},{"indexed":false,"internalType":"bytes32","name":"salt","type":"bytes32"}],"name":"TokenCreated","type":"event"},{"inputs":[],"name":"FEE_RECIPIENT","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"MAX_FALLBACK_STALENESS","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"MAX_STALENESS","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"TARGET_FEE_USD","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"components":[{"internalType":"string","name":"name","type":"string"},{"internalType":"string","name":"symbol","type":"string"},{"internalType":"uint8","name":"decimals","type":"uint8"},{"internalType":"uint256","name":"initialSupply","type":"uint256"},{"internalType":"address","name":"finalOwner","type":"address"},{"internalType":"bool","name":"mintingEnabled","type":"bool"},{"internalType":"uint256","name":"hardCap","type":"uint256"},{"internalType":"bool","name":"pausable","type":"bool"},{"internalType":"bool","name":"rescueEnabled","type":"bool"},{"internalType":"bool","name":"burnEnabled","type":"bool"},{"internalType":"bool","name":"metadataMutable","type":"bool"},{"internalType":"bool","name":"socialsMutable","type":"bool"},{"internalType":"bool","name":"feesModuleEnabled","type":"bool"},{"internalType":"bool","name":"limitsModuleEnabled","type":"bool"},{"internalType":"bool","name":"cooldownModuleEnabled","type":"bool"},{"internalType":"bool","name":"blacklistModuleEnabled","type":"bool"},{"internalType":"string","name":"website","type":"string"},{"internalType":"string","name":"telegram","type":"string"},{"internalType":"string","name":"xHandle","type":"string"},{"internalType":"string","name":"discord","type":"string"},{"internalType":"bool","name":"feesEnabled","type":"bool"},{"internalType":"uint16","name":"maxBuyFeeBps","type":"uint16"},{"internalType":"uint16","name":"maxSellFeeBps","type":"uint16"},{"internalType":"uint16","name":"maxTransferFeeBps","type":"uint16"},{"internalType":"uint16","name":"buyFeeBps","type":"uint16"},{"internalType":"uint16","name":"sellFeeBps","type":"uint16"},{"internalType":"uint16","name":"transferFeeBps","type":"uint16"},{"internalType":"uint16","name":"feeBurnShareBps","type":"uint16"},{"internalType":"address","name":"feeRecipient","type":"address"},{"internalType":"uint256","name":"maxWalletAmount","type":"uint256"},{"internalType":"uint256","name":"maxTxAmount","type":"uint256"},{"internalType":"uint64","name":"limitsEndTime","type":"uint64"},{"internalType":"bool","name":"exemptRecipientsFromLimits","type":"bool"},{"internalType":"address[]","name":"additionalLimitExempt","type":"address[]"},{"internalType":"uint32","name":"maxCooldownSeconds","type":"uint32"},{"internalType":"uint32","name":"cooldownSeconds","type":"uint32"},{"internalType":"address[]","name":"initialRecipients","type":"address[]"},{"internalType":"uint256[]","name":"initialAmounts","type":"uint256[]"},{"internalType":"string[]","name":"initialLabels","type":"string[]"},{"internalType":"uint64","name":"tradingSchedule","type":"uint64"},{"internalType":"bool","name":"enableTradingImmediately","type":"bool"},{"internalType":"address","name":"router","type":"address"},{"internalType":"bool","name":"routerProtectionEnabled","type":"bool"},{"internalType":"address[]","name":"initialBlacklist","type":"address[]"},{"internalType":"bool","name":"freezeBlacklistAfterDeploy","type":"bool"},{"internalType":"bool","name":"renounceOwnership","type":"bool"},{"internalType":"bool","name":"useSalt","type":"bool"},{"internalType":"bytes32","name":"salt","type":"bytes32"},{"internalType":"bool","name":"deadblocksEnabled","type":"bool"},{"internalType":"uint8","name":"deadBlocks","type":"uint8"},{"internalType":"uint8","name":"deadblockMode","type":"uint8"},{"internalType":"bool","name":"deadblockExemptLimitExempt","type":"bool"},{"internalType":"bool","name":"whitelistModuleEnabled","type":"bool"},{"internalType":"uint8","name":"whitelistMode","type":"uint8"},{"internalType":"bool","name":"whitelistAutoDisable","type":"bool"},{"internalType":"bool","name":"whitelistBypassesRouter","type":"bool"},{"internalType":"bool","name":"whitelistMutable","type":"bool"},{"internalType":"address[]","name":"initialWhitelist","type":"address[]"},{"internalType":"bool","name":"freezeWhitelistAfterDeploy","type":"bool"},{"internalType":"bool","name":"antiDumpModuleEnabled","type":"bool"},{"internalType":"uint8","name":"antiDumpType","type":"uint8"},{"internalType":"uint256","name":"maxAntiDumpLimit","type":"uint256"},{"internalType":"uint64","name":"maxAntiDumpPeriod","type":"uint64"},{"internalType":"uint256","name":"antiDumpLimit","type":"uint256"},{"internalType":"uint64","name":"antiDumpPeriod","type":"uint64"},{"internalType":"uint64","name":"antiDumpEndTime","type":"uint64"},{"internalType":"uint8","name":"batchTransferAccess","type":"uint8"},{"internalType":"uint8","name":"batchTransferFees","type":"uint8"},{"internalType":"uint16","name":"maxBatchSize","type":"uint16"},{"internalType":"bool","name":"permitEnabled","type":"bool"},{"internalType":"bool","name":"freezeFeesAfterDeploy","type":"bool"},{"internalType":"bool","name":"freezeLimitsAfterDeploy","type":"bool"},{"internalType":"bool","name":"freezeCooldownAfterDeploy","type":"bool"},{"internalType":"bool","name":"freezeAntiDumpAfterDeploy","type":"bool"},{"internalType":"bool","name":"blockOwnershipTransferAfterDeploy","type":"bool"}],"internalType":"struct LaunchERC20Factory.CreateParams","name":"p","type":"tuple"}],"name":"createToken","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"payable","type":"function"},{"inputs":[],"name":"fallbackFee","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"fallbackFeeUpdatedAt","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"getCreationFee","outputs":[{"internalType":"uint256","name":"fee","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"implementation","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"owner","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"bytes32","name":"salt","type":"bytes32"}],"name":"predictAddress","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"priceFeed","outputs":[{"internalType":"contract AggregatorV3Interface","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"newFee","type":"uint256"}],"name":"setFallbackFee","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"newOwner","type":"address"}],"name":"transferOwnership","outputs":[],"stateMutability":"nonpayable","type":"function"}]

60c060405234801561000f575f5ffd5b506040516127ee3803806127ee83398101604081905261002e916100ac565b6001600160a01b03831661005557604051634208d2eb60e01b815260040160405180910390fd5b6001600160a01b03808416608052821660a0526001819055801561007857426002555b50505f80546001600160a01b03191633179055506100e5565b80516001600160a01b03811681146100a7575f5ffd5b919050565b5f5f5f606084860312156100be575f5ffd5b6100c784610091565b92506100d560208501610091565b9150604084015190509250925092565b60805160a0516126bf61012f5f395f818161014b01528181610b0601528181610b350152610bd401525f818160ea01528181610994015281816109c20152610ad801526126bf5ff3fe6080604052600436106100ac575f3560e01c806354290f6f146100b05780635c60da1b146100d957806366ad079f14610119578063741bef1a1461013a57806374329fa81461016d578063797670c5146101805780637caadc3c146101955780638da5cb5b146101aa5780639c76b654146101c8578063caca95a4146101e7578063db07b68e146101fc578063e1918d9c14610210578063ebd090541461022b578063f2fde38b14610252575b5f5ffd5b3480156100bb575f5ffd5b506100c66203f48081565b6040519081526020015b60405180910390f35b3480156100e4575f5ffd5b5061010c7f000000000000000000000000000000000000000000000000000000000000000081565b6040516100d09190611d99565b348015610124575f5ffd5b50610138610133366004611dad565b610271565b005b348015610145575f5ffd5b5061010c7f000000000000000000000000000000000000000000000000000000000000000081565b61010c61017b366004611dc4565b6102da565b34801561018b575f5ffd5b506100c660015481565b3480156101a0575f5ffd5b506100c660025481565b3480156101b5575f5ffd5b505f5461010c906001600160a01b031681565b3480156101d3575f5ffd5b5061010c6101e2366004611dad565b610ad2565b3480156101f2575f5ffd5b506100c6610e1081565b348015610207575f5ffd5b506100c6610b03565b34801561021b575f5ffd5b506100c6670de0b6b3a764000081565b348015610236575f5ffd5b5061010c73d54f2b75f0afcade42e292f655f6777fd12b3dd581565b34801561025d575f5ffd5b5061013861026c366004611e16565b610cbf565b5f546001600160a01b0316331461029b576040516330cd747160e01b815260040160405180910390fd5b6001819055426002556040518181527fcc1cdf9f7984a13577af4eacf674ff95947cd3f6ee986664ff639607cdbc54599060200160405180910390a150565b5f5f6102e4610b03565b9050803410156103065760405162976f7560e21b815260040160405180910390fd5b5f34118015610313575060015b156103c9576040515f9073d54f2b75f0afcade42e292f655f6777fd12b3dd59034908381818185875af1925050503d805f811461036b576040519150601f19603f3d011682016040523d82523d5f602084013e610370565b606091505b505090508061039257604051634033e4e360e01b815260040160405180910390fd5b60405134815233907f06c5efeff5c320943d265dc4e5f1af95ad523555ce0c1957e367dda5514572df9060200160405180910390a2505b5f6103da60a0850160808601611e16565b6001600160a01b03160361040157604051639905827b60e01b815260040160405180910390fd5b82606001355f036104255760405163c16f3a9360e01b815260040160405180910390fd5b5f610434610480850185611e2f565b915061044690506104a0850185611e2f565b905081141580610465575061045f6104c0850185611e2f565b90508114155b156104835760405163b7c1140d60e01b815260040160405180910390fd5b6040805161052081019091525f908061049c8780611e7b565b8080601f0160208091040260200160405190810160405280939291908181526020018383808284375f920191909152505050908252506020908101906104e490880188611e7b565b8080601f0160208091040260200160405190810160405280939291908181526020018383808284375f9201919091525050509082525060200161052d6060880160408901611ece565b60ff16815260608088013560208301523060408301520161055460c0880160a08901611ef6565b1515815260c08701356020820152604001610576610100880160e08901611ef6565b1515815260200161058f61012088016101008901611ef6565b151581526020016105a861014088016101208901611ef6565b151581526020016105c161016088016101408901611ef6565b151581526020016105da61018088016101608901611ef6565b151581526020016105f36101a088016101808901611ef6565b1515815260200161060c6101c088016101a08901611ef6565b151581526020016106256101e088016101c08901611ef6565b1515815260200161063e61020088016101e08901611ef6565b151581526020016106576102c088016102a08901611f11565b61ffff1681526020016106726102e088016102c08901611f11565b61ffff16815260200161068d61030088016102e08901611f11565b61ffff1681526020016106a861046088016104408901611f32565b63ffffffff1681526020016106c1610200880188611e7b565b8080601f0160208091040260200160405190810160405280939291908181526020018383808284375f92019190915250505090825250602001610708610220880188611e7b565b8080601f0160208091040260200160405190810160405280939291908181526020018383808284375f9201919091525050509082525060200161074f610240880188611e7b565b8080601f0160208091040260200160405190810160405280939291908181526020018383808284375f92019190915250505090825250602001610796610260880188611e7b565b8080601f0160208091040260200160405190810160405280939291908181526020018383808284375f920191909152505050908252506020016107e161062088016106008901611ef6565b151581526020016107fa61064088016106208901611ece565b60ff16815260200161081461066088016106408901611ece565b60ff16815260200161082e61068088016106608901611ef6565b151581526020016108476106a088016106808901611ef6565b151581526020016108606106c088016106a08901611ece565b60ff16815260200161087a6106e088016106c08901611ef6565b1515815260200161089361070088016106e08901611ef6565b151581526020016108ac61072088016107008901611ef6565b151581526020016108c561078088016107608901611ef6565b151581526020016108de6107a088016107808901611ece565b60ff1681526107a087013560208201526040016109036107e088016107c08901611f55565b6001600160401b0316815260200161092361086088016108408901611ece565b60ff16815260200161093d61088088016108608901611ece565b60ff1681526020016109576108a088016108808901611f11565b61ffff1681526020016109726108c088016108a08901611ef6565b1515905290505f61098b6105e087016105c08801611ef6565b6109bd576109b87f0000000000000000000000000000000000000000000000000000000000000000610d38565b6109ec565b6109ec7f0000000000000000000000000000000000000000000000000000000000000000876105e00135610d43565b6040516347d7ce5960e01b815290915081906001600160a01b038216906347d7ce5990610a1d908690600401611fa9565b5f604051808303815f87803b158015610a34575f5ffd5b505af1158015610a46573d5f5f3e3d5ffd5b50505050610a55818886610d56565b610a6560a0880160808901611e16565b6001600160a01b039081169082167f9ea39db4a398b469ed3a81a577108b4218a8642c91546deb19e4e16ba351d34e610aa66105e08b016105c08c01611ef6565b610ab0575f610ab7565b896105e001355b60405190815260200160405180910390a39695505050505050565b5f610afd7f000000000000000000000000000000000000000000000000000000000000000083611c03565b92915050565b5f7f00000000000000000000000000000000000000000000000000000000000000006001600160a01b031615610c8d577f00000000000000000000000000000000000000000000000000000000000000006001600160a01b031663feaf968c6040518163ffffffff1660e01b815260040160a060405180830381865afa925050508015610bad575060408051601f3d908101601f19168201909252610baa918101906122db565b60015b15610c8d575f84138015610bcc5750610e10610bc9834261233d565b11155b15610c87575f7f00000000000000000000000000000000000000000000000000000000000000006001600160a01b031663313ce5676040518163ffffffff1660e01b8152600401602060405180830381865afa158015610c2e573d5f5f3e3d5ffd5b505050506040513d601f19601f82011682018060405250810190610c529190612350565b905084610c6082600a61244e565b610c7290670de0b6b3a764000061245c565b610c7c9190612473565b965050505050505090565b50505050505b5f600154118015610cae57506203f48060025442610cab919061233d565b11155b15610cba575060015490565b505f90565b5f546001600160a01b03163314610ce9576040516330cd747160e01b815260040160405180910390fd5b5f80546001600160a01b038381166001600160a01b0319831681178455604051919092169283917f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e09190a35050565b5f610afd825f611c6b565b5f610d4f83835f611d04565b9392505050565b610d686101a083016101808401611ef6565b8015610d815750610d816102a083016102808401611ef6565b15610ea4576001600160a01b03831663d46e4f31610da761032085016103008601611f11565b610db961034086016103208701611f11565b610dcb61036087016103408801611f11565b610ddd61038088016103608901611f11565b5f610df06103a08a016103808b01611e16565b6001600160a01b031603610e1357610e0e60a0890160808a01611e16565b610e25565b610e256103a089016103808a01611e16565b60405160e087901b6001600160e01b031916815261ffff95861660048201529385166024850152918416604484015290921660648201526001600160a01b039091166084820152600160a482015260c4015f604051808303815f87803b158015610e8d575f5ffd5b505af1158015610e9f573d5f5f3e3d5ffd5b505050505b610eb66101c083016101a08401611ef6565b8015610ecd57505f826103c00135836103a0013517115b15611142576001600160a01b03831663af3b6b536103a08401356103c0850135610eff61040087016103e08801611f55565b6040516001600160e01b031960e086901b168152600481019390935260248301919091526001600160401b031660448201526064015f604051808303815f87803b158015610f4b575f5ffd5b505af1158015610f5d573d5f5f3e3d5ffd5b50610f749250505061042083016104008401611ef6565b1561101e575f5b8181101561101c576001600160a01b0384166340a24e6c610fa0610480860186611e2f565b84818110610fb057610fb0612492565b9050602002016020810190610fc59190611e16565b60016040518363ffffffff1660e01b8152600401610fe49291906124a6565b5f604051808303815f87803b158015610ffb575f5ffd5b505af115801561100d573d5f5f3e3d5ffd5b50505050806001019050610f7b565b505b5f61102d610420840184611e2f565b905090505f5b818110156110d4576001600160a01b0385166340a24e6c611058610420870187611e2f565b8481811061106857611068612492565b905060200201602081019061107d9190611e16565b60016040518363ffffffff1660e01b815260040161109c9291906124a6565b5f604051808303815f87803b1580156110b3575f5ffd5b505af11580156110c5573d5f5f3e3d5ffd5b50505050806001019050611033565b506001600160a01b0384166340a24e6c6110f460a0860160808701611e16565b60016040518363ffffffff1660e01b81526004016111139291906124a6565b5f604051808303815f87803b15801561112a575f5ffd5b505af115801561113c573d5f5f3e3d5ffd5b50505050505b6111546101e083016101c08401611ef6565b801561117657505f61116e61048084016104608501611f32565b63ffffffff16115b156111ef576001600160a01b03831663f8718c5a61119c61048085016104608601611f32565b6040516001600160e01b031960e084901b16815263ffffffff9190911660048201526024015f604051808303815f87803b1580156111d8575f5ffd5b505af11580156111ea573d5f5f3e3d5ffd5b505050505b5f61120261054084016105208501611e16565b6001600160a01b0316141580611225575061122561056083016105408401611ef6565b156112a8576001600160a01b03831663c3c6467461124b61054085016105208601611e16565b61125d61056086016105408701611ef6565b6040518363ffffffff1660e01b815260040161127a9291906124a6565b5f604051808303815f87803b158015611291575f5ffd5b505af11580156112a3573d5f5f3e3d5ffd5b505050505b6112ba6106a083016106808401611ef6565b80156112d457505f6112d0610720840184611e2f565b9050115b15611344576001600160a01b038316632f6707e96112f6610720850185611e2f565b60016040518463ffffffff1660e01b815260040161131693929190612507565b5f604051808303815f87803b15801561132d575f5ffd5b505af115801561133f573d5f5f3e3d5ffd5b505050505b6113566106a083016106808401611ef6565b801561136f575061136f61076083016107408401611ef6565b156113c357826001600160a01b031663464e01a46040518163ffffffff1660e01b81526004015f604051808303815f87803b1580156113ac575f5ffd5b505af11580156113be573d5f5f3e3d5ffd5b505050505b6113d561078083016107608401611ef6565b80156113e557505f826107e00135115b15611486576001600160a01b03831663ce46dcaa6107e084013561141161082086016108008701611f55565b61142361084087016108208801611f55565b6040516001600160e01b031960e086901b16815260048101939093526001600160401b0391821660248401521660448201526064015f604051808303815f87803b15801561146f575f5ffd5b505af1158015611481573d5f5f3e3d5ffd5b505050505b6114986101a083016101808401611ef6565b80156114b157506114b16108e083016108c08401611ef6565b1561150557826001600160a01b0316634f03225d6040518163ffffffff1660e01b81526004015f604051808303815f87803b1580156114ee575f5ffd5b505af1158015611500573d5f5f3e3d5ffd5b505050505b6115176101c083016101a08401611ef6565b8015611530575061153061090083016108e08401611ef6565b1561158457826001600160a01b0316639159ed356040518163ffffffff1660e01b81526004015f604051808303815f87803b15801561156d575f5ffd5b505af115801561157f573d5f5f3e3d5ffd5b505050505b6115966101e083016101c08401611ef6565b80156115af57506115af61092083016109008401611ef6565b1561160357826001600160a01b031663bddb20736040518163ffffffff1660e01b81526004015f604051808303815f87803b1580156115ec575f5ffd5b505af11580156115fe573d5f5f3e3d5ffd5b505050505b61161561078083016107608401611ef6565b801561162e575061162e61094083016109208401611ef6565b1561168257826001600160a01b03166329d811ba6040518163ffffffff1660e01b81526004015f604051808303815f87803b15801561166b575f5ffd5b505af115801561167d573d5f5f3e3d5ffd5b505050505b5f61169561050084016104e08501611f55565b6001600160401b0316111561171e576001600160a01b03831663f8864f2b6116c561050085016104e08601611f55565b6040516001600160e01b031960e084901b1681526001600160401b0390911660048201526024015f604051808303815f87803b158015611703575f5ffd5b505af1158015611715573d5f5f3e3d5ffd5b50505050611784565b61173061052083016105008401611ef6565b1561178457826001600160a01b0316638a8c523c6040518163ffffffff1660e01b81526004015f604051808303815f87803b15801561176d575f5ffd5b505af115801561177f573d5f5f3e3d5ffd5b505050505b5f5b8181101561185b576001600160a01b03841663a9059cbb6117ab610480860186611e2f565b848181106117bb576117bb612492565b90506020020160208101906117d09190611e16565b6117de6104a0870187611e2f565b858181106117ee576117ee612492565b905060200201356040518363ffffffff1660e01b815260040161181292919061252c565b6020604051808303815f875af115801561182e573d5f5f3e3d5ffd5b505050506040513d601f19601f820116820180604052508101906118529190612545565b50600101611786565b5080156118d2576001600160a01b0383167f61c445b3ce6e12ebbefddd84cb830b4f9681450a4de4ac9493ec2f87b1e91b5961189b610480850185611e2f565b6118a96104a0870187611e2f565b6118b76104c0890189611e2f565b6040516118c996959493929190612588565b60405180910390a25b6040516370a0823160e01b81525f906001600160a01b038516906370a0823190611900903090600401611d99565b602060405180830381865afa15801561191b573d5f5f3e3d5ffd5b505050506040513d601f19601f8201168201806040525081019061193f9190612672565b905080156119c6576001600160a01b03841663a9059cbb61196660a0860160808701611e16565b836040518363ffffffff1660e01b815260040161198492919061252c565b6020604051808303815f875af11580156119a0573d5f5f3e3d5ffd5b505050506040513d601f19601f820116820180604052508101906119c49190612545565b505b6119d861020084016101e08501611ef6565b80156119f257505f6119ee610560850185611e2f565b9050115b15611aab575f5b611a07610560850185611e2f565b9050811015611aa9576001600160a01b03851663153b0d1e611a2d610560870187611e2f565b84818110611a3d57611a3d612492565b9050602002016020810190611a529190611e16565b60016040518363ffffffff1660e01b8152600401611a719291906124a6565b5f604051808303815f87803b158015611a88575f5ffd5b505af1158015611a9a573d5f5f3e3d5ffd5b505050508060010190506119f9565b505b611abd61020084016101e08501611ef6565b8015611ad65750611ad66105a084016105808501611ef6565b15611b2a57836001600160a01b031663ad1bba1c6040518163ffffffff1660e01b81526004015f604051808303815f87803b158015611b13575f5ffd5b505af1158015611b25573d5f5f3e3d5ffd5b505050505b611b3c6105c084016105a08501611ef6565b15611b9457836001600160a01b031663715018a66040518163ffffffff1660e01b81526004015f604051808303815f87803b158015611b79575f5ffd5b505af1158015611b8b573d5f5f3e3d5ffd5b50505050611bfd565b6001600160a01b03841663f2fde38b611bb360a0860160808701611e16565b6040518263ffffffff1660e01b8152600401611bcf9190611d99565b5f604051808303815f87803b158015611be6575f5ffd5b505af1158015611bf8573d5f5f3e3d5ffd5b505050505b50505050565b6040513060388201526f5af43d82803e903d91602b57fd5bf3ff602482015260148101839052733d602d80600a3d3981f3363d3d373d3d3d363d738152605881018290526037600c820120607882015260556043909101205f906001600160a01b0316610d4f565b5f81471015611c9b5760405163cf47918160e01b8152476004820152602481018390526044015b60405180910390fd5b763d602d80600a3d3981f3363d3d373d3d3d363d730000008360601b60e81c175f526e5af43d82803e903d91602b57fd5bf38360781b176020526037600983f090506001600160a01b038116610afd5760405163b06ebf3d60e01b815260040160405180910390fd5b5f81471015611d2f5760405163cf47918160e01b815247600482015260248101839052604401611c92565b763d602d80600a3d3981f3363d3d373d3d3d363d730000008460601b60e81c175f526e5af43d82803e903d91602b57fd5bf38460781b17602052826037600984f590506001600160a01b038116610d4f5760405163b06ebf3d60e01b815260040160405180910390fd5b6001600160a01b0391909116815260200190565b5f60208284031215611dbd575f5ffd5b5035919050565b5f60208284031215611dd4575f5ffd5b81356001600160401b03811115611de9575f5ffd5b82016109608185031215610d4f575f5ffd5b80356001600160a01b0381168114611e11575f5ffd5b919050565b5f60208284031215611e26575f5ffd5b610d4f82611dfb565b5f5f8335601e19843603018112611e44575f5ffd5b8301803591506001600160401b03821115611e5d575f5ffd5b6020019150600581901b3603821315611e74575f5ffd5b9250929050565b5f5f8335601e19843603018112611e90575f5ffd5b8301803591506001600160401b03821115611ea9575f5ffd5b602001915036819003821315611e74575f5ffd5b60ff81168114611ecb575f5ffd5b50565b5f60208284031215611ede575f5ffd5b8135610d4f81611ebd565b8015158114611ecb575f5ffd5b5f60208284031215611f06575f5ffd5b8135610d4f81611ee9565b5f60208284031215611f21575f5ffd5b813561ffff81168114610d4f575f5ffd5b5f60208284031215611f42575f5ffd5b813563ffffffff81168114610d4f575f5ffd5b5f60208284031215611f65575f5ffd5b81356001600160401b0381168114610d4f575f5ffd5b5f81518084528060208401602086015e5f602082860101526020601f19601f83011685010191505092915050565b602081525f82516105206020840152611fc6610540840182611f7b565b90506020840151601f19848303016040850152611fe38282611f7b565b9150506040840151611ffa606085018260ff169052565b5060608401516080840152608084015161201f60a08501826001600160a01b03169052565b5060a084015180151560c08501525060c084015160e084015260e084015161204c61010085018215159052565b50610100840151801515610120850152506101208401518015156101408501525061014084015180151561016085015250610160840151801515610180850152506101808401518015156101a0850152506101a08401518015156101c0850152506101c08401518015156101e0850152506101e08401518015156102008501525061020084015161ffff81166102208501525061022084015161ffff81166102408501525061024084015161ffff81166102608501525061026084015163ffffffff811661028085015250610280840151838203601f19016102a08501526121348282611f7b565b9150506102a0840151601f19848303016102c08501526121548282611f7b565b9150506102c0840151601f19848303016102e08501526121748282611f7b565b9150506102e0840151601f19848303016103008501526121948282611f7b565b9150506103008401516121ac61032085018215159052565b5061032084015160ff81166103408501525061034084015160ff811661036085015250610360840151801515610380850152506103808401518015156103a0850152506103a084015160ff81166103c0850152506103c08401518015156103e0850152506103e084015180151561040085015250610400840151801515610420850152506104208401518015156104408501525061044084015160ff8116610460850152506104608401516104808401526104808401516122796104a08501826001600160401b03169052565b506104a084015160ff81166104c0850152506104c084015160ff81166104e0850152506104e084015161ffff811661050085015250610500840151801515610520850152509392505050565b80516001600160501b0381168114611e11575f5ffd5b5f5f5f5f5f60a086880312156122ef575f5ffd5b6122f8866122c5565b6020870151604088015160608901519297509095509350915061231d608087016122c5565b90509295509295909350565b634e487b7160e01b5f52601160045260245ffd5b81810381811115610afd57610afd612329565b5f60208284031215612360575f5ffd5b8151610d4f81611ebd565b6001815b60018411156123a65780850481111561238a5761238a612329565b600184161561239857908102905b60019390931c92800261236f565b935093915050565b5f826123bc57506001610afd565b816123c857505f610afd565b81600181146123de57600281146123e857612404565b6001915050610afd565b60ff8411156123f9576123f9612329565b50506001821b610afd565b5060208310610133831016604e8410600b8410161715612427575081810a610afd565b6124335f19848461236b565b805f190482111561244657612446612329565b029392505050565b5f610d4f60ff8416836123ae565b8082028115828204841417610afd57610afd612329565b5f8261248d57634e487b7160e01b5f52601260045260245ffd5b500490565b634e487b7160e01b5f52603260045260245ffd5b6001600160a01b039290921682521515602082015260400190565b8183526020830192505f815f5b848110156124fd576001600160a01b036124e783611dfb565b16865260209586019591909101906001016124ce565b5093949350505050565b604081525f61251a6040830185876124c1565b90508215156020830152949350505050565b6001600160a01b03929092168252602082015260400190565b5f60208284031215612555575f5ffd5b8151610d4f81611ee9565b81835281816020850137505f828201602090810191909152601f909101601f19169091010190565b606081525f61259b60608301888a6124c1565b82810360208401528581526001600160fb1b038611156125b9575f5ffd5b8560051b80886020840137018281036020908101604080860191909152908201859052600585901b82018101908201865f36829003601e19015b8882101561266057603f198686030184528235818112612611575f5ffd5b8a016020810190356001600160401b0381111561262c575f5ffd5b80360382131561263a575f5ffd5b612645878284612560565b965050506020830192506020840193506001820191506125f3565b50929c9b505050505050505050505050565b5f60208284031215612682575f5ffd5b505191905056fea26469706673582212209b9488e194982bdef905b710c2f289204b90d629c2891980f945488fec8cae0d64736f6c634300081e003300000000000000000000000098642b5ac10167c2794729f196dcaa4db9cefa660000000000000000000000005f4ec3df9cbd43714fe2740f5e3616155c5b841900000000000000000000000000000000000000000000000000016bcc41e90000

0x6080604052600436106100ac575f3560e01c806354290f6f146100b05780635c60da1b146100d957806366ad079f14610119578063741bef1a1461013a57806374329fa81461016d578063797670c5146101805780637caadc3c146101955780638da5cb5b146101aa5780639c76b654146101c8578063caca95a4146101e7578063db07b68e146101fc578063e1918d9c14610210578063ebd090541461022b578063f2fde38b14610252575b5f5ffd5b3480156100bb575f5ffd5b506100c66203f48081565b6040519081526020015b60405180910390f35b3480156100e4575f5ffd5b5061010c7f00000000000000000000000098642b5ac10167c2794729f196dcaa4db9cefa6681565b6040516100d09190611d99565b348015610124575f5ffd5b50610138610133366004611dad565b610271565b005b348015610145575f5ffd5b5061010c7f0000000000000000000000005f4ec3df9cbd43714fe2740f5e3616155c5b841981565b61010c61017b366004611dc4565b6102da565b34801561018b575f5ffd5b506100c660015481565b3480156101a0575f5ffd5b506100c660025481565b3480156101b5575f5ffd5b505f5461010c906001600160a01b031681565b3480156101d3575f5ffd5b5061010c6101e2366004611dad565b610ad2565b3480156101f2575f5ffd5b506100c6610e1081565b348015610207575f5ffd5b506100c6610b03565b34801561021b575f5ffd5b506100c6670de0b6b3a764000081565b348015610236575f5ffd5b5061010c73d54f2b75f0afcade42e292f655f6777fd12b3dd581565b34801561025d575f5ffd5b5061013861026c366004611e16565b610cbf565b5f546001600160a01b0316331461029b576040516330cd747160e01b815260040160405180910390fd5b6001819055426002556040518181527fcc1cdf9f7984a13577af4eacf674ff95947cd3f6ee986664ff639607cdbc54599060200160405180910390a150565b5f5f6102e4610b03565b9050803410156103065760405162976f7560e21b815260040160405180910390fd5b5f34118015610313575060015b156103c9576040515f9073d54f2b75f0afcade42e292f655f6777fd12b3dd59034908381818185875af1925050503d805f811461036b576040519150601f19603f3d011682016040523d82523d5f602084013e610370565b606091505b505090508061039257604051634033e4e360e01b815260040160405180910390fd5b60405134815233907f06c5efeff5c320943d265dc4e5f1af95ad523555ce0c1957e367dda5514572df9060200160405180910390a2505b5f6103da60a0850160808601611e16565b6001600160a01b03160361040157604051639905827b60e01b815260040160405180910390fd5b82606001355f036104255760405163c16f3a9360e01b815260040160405180910390fd5b5f610434610480850185611e2f565b915061044690506104a0850185611e2f565b905081141580610465575061045f6104c0850185611e2f565b90508114155b156104835760405163b7c1140d60e01b815260040160405180910390fd5b6040805161052081019091525f908061049c8780611e7b565b8080601f0160208091040260200160405190810160405280939291908181526020018383808284375f920191909152505050908252506020908101906104e490880188611e7b565b8080601f0160208091040260200160405190810160405280939291908181526020018383808284375f9201919091525050509082525060200161052d6060880160408901611ece565b60ff16815260608088013560208301523060408301520161055460c0880160a08901611ef6565b1515815260c08701356020820152604001610576610100880160e08901611ef6565b1515815260200161058f61012088016101008901611ef6565b151581526020016105a861014088016101208901611ef6565b151581526020016105c161016088016101408901611ef6565b151581526020016105da61018088016101608901611ef6565b151581526020016105f36101a088016101808901611ef6565b1515815260200161060c6101c088016101a08901611ef6565b151581526020016106256101e088016101c08901611ef6565b1515815260200161063e61020088016101e08901611ef6565b151581526020016106576102c088016102a08901611f11565b61ffff1681526020016106726102e088016102c08901611f11565b61ffff16815260200161068d61030088016102e08901611f11565b61ffff1681526020016106a861046088016104408901611f32565b63ffffffff1681526020016106c1610200880188611e7b565b8080601f0160208091040260200160405190810160405280939291908181526020018383808284375f92019190915250505090825250602001610708610220880188611e7b565b8080601f0160208091040260200160405190810160405280939291908181526020018383808284375f9201919091525050509082525060200161074f610240880188611e7b565b8080601f0160208091040260200160405190810160405280939291908181526020018383808284375f92019190915250505090825250602001610796610260880188611e7b565b8080601f0160208091040260200160405190810160405280939291908181526020018383808284375f920191909152505050908252506020016107e161062088016106008901611ef6565b151581526020016107fa61064088016106208901611ece565b60ff16815260200161081461066088016106408901611ece565b60ff16815260200161082e61068088016106608901611ef6565b151581526020016108476106a088016106808901611ef6565b151581526020016108606106c088016106a08901611ece565b60ff16815260200161087a6106e088016106c08901611ef6565b1515815260200161089361070088016106e08901611ef6565b151581526020016108ac61072088016107008901611ef6565b151581526020016108c561078088016107608901611ef6565b151581526020016108de6107a088016107808901611ece565b60ff1681526107a087013560208201526040016109036107e088016107c08901611f55565b6001600160401b0316815260200161092361086088016108408901611ece565b60ff16815260200161093d61088088016108608901611ece565b60ff1681526020016109576108a088016108808901611f11565b61ffff1681526020016109726108c088016108a08901611ef6565b1515905290505f61098b6105e087016105c08801611ef6565b6109bd576109b87f00000000000000000000000098642b5ac10167c2794729f196dcaa4db9cefa66610d38565b6109ec565b6109ec7f00000000000000000000000098642b5ac10167c2794729f196dcaa4db9cefa66876105e00135610d43565b6040516347d7ce5960e01b815290915081906001600160a01b038216906347d7ce5990610a1d908690600401611fa9565b5f604051808303815f87803b158015610a34575f5ffd5b505af1158015610a46573d5f5f3e3d5ffd5b50505050610a55818886610d56565b610a6560a0880160808901611e16565b6001600160a01b039081169082167f9ea39db4a398b469ed3a81a577108b4218a8642c91546deb19e4e16ba351d34e610aa66105e08b016105c08c01611ef6565b610ab0575f610ab7565b896105e001355b60405190815260200160405180910390a39695505050505050565b5f610afd7f00000000000000000000000098642b5ac10167c2794729f196dcaa4db9cefa6683611c03565b92915050565b5f7f0000000000000000000000005f4ec3df9cbd43714fe2740f5e3616155c5b84196001600160a01b031615610c8d577f0000000000000000000000005f4ec3df9cbd43714fe2740f5e3616155c5b84196001600160a01b031663feaf968c6040518163ffffffff1660e01b815260040160a060405180830381865afa925050508015610bad575060408051601f3d908101601f19168201909252610baa918101906122db565b60015b15610c8d575f84138015610bcc5750610e10610bc9834261233d565b11155b15610c87575f7f0000000000000000000000005f4ec3df9cbd43714fe2740f5e3616155c5b84196001600160a01b031663313ce5676040518163ffffffff1660e01b8152600401602060405180830381865afa158015610c2e573d5f5f3e3d5ffd5b505050506040513d601f19601f82011682018060405250810190610c529190612350565b905084610c6082600a61244e565b610c7290670de0b6b3a764000061245c565b610c7c9190612473565b965050505050505090565b50505050505b5f600154118015610cae57506203f48060025442610cab919061233d565b11155b15610cba575060015490565b505f90565b5f546001600160a01b03163314610ce9576040516330cd747160e01b815260040160405180910390fd5b5f80546001600160a01b038381166001600160a01b0319831681178455604051919092169283917f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e09190a35050565b5f610afd825f611c6b565b5f610d4f83835f611d04565b9392505050565b610d686101a083016101808401611ef6565b8015610d815750610d816102a083016102808401611ef6565b15610ea4576001600160a01b03831663d46e4f31610da761032085016103008601611f11565b610db961034086016103208701611f11565b610dcb61036087016103408801611f11565b610ddd61038088016103608901611f11565b5f610df06103a08a016103808b01611e16565b6001600160a01b031603610e1357610e0e60a0890160808a01611e16565b610e25565b610e256103a089016103808a01611e16565b60405160e087901b6001600160e01b031916815261ffff95861660048201529385166024850152918416604484015290921660648201526001600160a01b039091166084820152600160a482015260c4015f604051808303815f87803b158015610e8d575f5ffd5b505af1158015610e9f573d5f5f3e3d5ffd5b505050505b610eb66101c083016101a08401611ef6565b8015610ecd57505f826103c00135836103a0013517115b15611142576001600160a01b03831663af3b6b536103a08401356103c0850135610eff61040087016103e08801611f55565b6040516001600160e01b031960e086901b168152600481019390935260248301919091526001600160401b031660448201526064015f604051808303815f87803b158015610f4b575f5ffd5b505af1158015610f5d573d5f5f3e3d5ffd5b50610f749250505061042083016104008401611ef6565b1561101e575f5b8181101561101c576001600160a01b0384166340a24e6c610fa0610480860186611e2f565b84818110610fb057610fb0612492565b9050602002016020810190610fc59190611e16565b60016040518363ffffffff1660e01b8152600401610fe49291906124a6565b5f604051808303815f87803b158015610ffb575f5ffd5b505af115801561100d573d5f5f3e3d5ffd5b50505050806001019050610f7b565b505b5f61102d610420840184611e2f565b905090505f5b818110156110d4576001600160a01b0385166340a24e6c611058610420870187611e2f565b8481811061106857611068612492565b905060200201602081019061107d9190611e16565b60016040518363ffffffff1660e01b815260040161109c9291906124a6565b5f604051808303815f87803b1580156110b3575f5ffd5b505af11580156110c5573d5f5f3e3d5ffd5b50505050806001019050611033565b506001600160a01b0384166340a24e6c6110f460a0860160808701611e16565b60016040518363ffffffff1660e01b81526004016111139291906124a6565b5f604051808303815f87803b15801561112a575f5ffd5b505af115801561113c573d5f5f3e3d5ffd5b50505050505b6111546101e083016101c08401611ef6565b801561117657505f61116e61048084016104608501611f32565b63ffffffff16115b156111ef576001600160a01b03831663f8718c5a61119c61048085016104608601611f32565b6040516001600160e01b031960e084901b16815263ffffffff9190911660048201526024015f604051808303815f87803b1580156111d8575f5ffd5b505af11580156111ea573d5f5f3e3d5ffd5b505050505b5f61120261054084016105208501611e16565b6001600160a01b0316141580611225575061122561056083016105408401611ef6565b156112a8576001600160a01b03831663c3c6467461124b61054085016105208601611e16565b61125d61056086016105408701611ef6565b6040518363ffffffff1660e01b815260040161127a9291906124a6565b5f604051808303815f87803b158015611291575f5ffd5b505af11580156112a3573d5f5f3e3d5ffd5b505050505b6112ba6106a083016106808401611ef6565b80156112d457505f6112d0610720840184611e2f565b9050115b15611344576001600160a01b038316632f6707e96112f6610720850185611e2f565b60016040518463ffffffff1660e01b815260040161131693929190612507565b5f604051808303815f87803b15801561132d575f5ffd5b505af115801561133f573d5f5f3e3d5ffd5b505050505b6113566106a083016106808401611ef6565b801561136f575061136f61076083016107408401611ef6565b156113c357826001600160a01b031663464e01a46040518163ffffffff1660e01b81526004015f604051808303815f87803b1580156113ac575f5ffd5b505af11580156113be573d5f5f3e3d5ffd5b505050505b6113d561078083016107608401611ef6565b80156113e557505f826107e00135115b15611486576001600160a01b03831663ce46dcaa6107e084013561141161082086016108008701611f55565b61142361084087016108208801611f55565b6040516001600160e01b031960e086901b16815260048101939093526001600160401b0391821660248401521660448201526064015f604051808303815f87803b15801561146f575f5ffd5b505af1158015611481573d5f5f3e3d5ffd5b505050505b6114986101a083016101808401611ef6565b80156114b157506114b16108e083016108c08401611ef6565b1561150557826001600160a01b0316634f03225d6040518163ffffffff1660e01b81526004015f604051808303815f87803b1580156114ee575f5ffd5b505af1158015611500573d5f5f3e3d5ffd5b505050505b6115176101c083016101a08401611ef6565b8015611530575061153061090083016108e08401611ef6565b1561158457826001600160a01b0316639159ed356040518163ffffffff1660e01b81526004015f604051808303815f87803b15801561156d575f5ffd5b505af115801561157f573d5f5f3e3d5ffd5b505050505b6115966101e083016101c08401611ef6565b80156115af57506115af61092083016109008401611ef6565b1561160357826001600160a01b031663bddb20736040518163ffffffff1660e01b81526004015f604051808303815f87803b1580156115ec575f5ffd5b505af11580156115fe573d5f5f3e3d5ffd5b505050505b61161561078083016107608401611ef6565b801561162e575061162e61094083016109208401611ef6565b1561168257826001600160a01b03166329d811ba6040518163ffffffff1660e01b81526004015f604051808303815f87803b15801561166b575f5ffd5b505af115801561167d573d5f5f3e3d5ffd5b505050505b5f61169561050084016104e08501611f55565b6001600160401b0316111561171e576001600160a01b03831663f8864f2b6116c561050085016104e08601611f55565b6040516001600160e01b031960e084901b1681526001600160401b0390911660048201526024015f604051808303815f87803b158015611703575f5ffd5b505af1158015611715573d5f5f3e3d5ffd5b50505050611784565b61173061052083016105008401611ef6565b1561178457826001600160a01b0316638a8c523c6040518163ffffffff1660e01b81526004015f604051808303815f87803b15801561176d575f5ffd5b505af115801561177f573d5f5f3e3d5ffd5b505050505b5f5b8181101561185b576001600160a01b03841663a9059cbb6117ab610480860186611e2f565b848181106117bb576117bb612492565b90506020020160208101906117d09190611e16565b6117de6104a0870187611e2f565b858181106117ee576117ee612492565b905060200201356040518363ffffffff1660e01b815260040161181292919061252c565b6020604051808303815f875af115801561182e573d5f5f3e3d5ffd5b505050506040513d601f19601f820116820180604052508101906118529190612545565b50600101611786565b5080156118d2576001600160a01b0383167f61c445b3ce6e12ebbefddd84cb830b4f9681450a4de4ac9493ec2f87b1e91b5961189b610480850185611e2f565b6118a96104a0870187611e2f565b6118b76104c0890189611e2f565b6040516118c996959493929190612588565b60405180910390a25b6040516370a0823160e01b81525f906001600160a01b038516906370a0823190611900903090600401611d99565b602060405180830381865afa15801561191b573d5f5f3e3d5ffd5b505050506040513d601f19601f8201168201806040525081019061193f9190612672565b905080156119c6576001600160a01b03841663a9059cbb61196660a0860160808701611e16565b836040518363ffffffff1660e01b815260040161198492919061252c565b6020604051808303815f875af11580156119a0573d5f5f3e3d5ffd5b505050506040513d601f19601f820116820180604052508101906119c49190612545565b505b6119d861020084016101e08501611ef6565b80156119f257505f6119ee610560850185611e2f565b9050115b15611aab575f5b611a07610560850185611e2f565b9050811015611aa9576001600160a01b03851663153b0d1e611a2d610560870187611e2f565b84818110611a3d57611a3d612492565b9050602002016020810190611a529190611e16565b60016040518363ffffffff1660e01b8152600401611a719291906124a6565b5f604051808303815f87803b158015611a88575f5ffd5b505af1158015611a9a573d5f5f3e3d5ffd5b505050508060010190506119f9565b505b611abd61020084016101e08501611ef6565b8015611ad65750611ad66105a084016105808501611ef6565b15611b2a57836001600160a01b031663ad1bba1c6040518163ffffffff1660e01b81526004015f604051808303815f87803b158015611b13575f5ffd5b505af1158015611b25573d5f5f3e3d5ffd5b505050505b611b3c6105c084016105a08501611ef6565b15611b9457836001600160a01b031663715018a66040518163ffffffff1660e01b81526004015f604051808303815f87803b158015611b79575f5ffd5b505af1158015611b8b573d5f5f3e3d5ffd5b50505050611bfd565b6001600160a01b03841663f2fde38b611bb360a0860160808701611e16565b6040518263ffffffff1660e01b8152600401611bcf9190611d99565b5f604051808303815f87803b158015611be6575f5ffd5b505af1158015611bf8573d5f5f3e3d5ffd5b505050505b50505050565b6040513060388201526f5af43d82803e903d91602b57fd5bf3ff602482015260148101839052733d602d80600a3d3981f3363d3d373d3d3d363d738152605881018290526037600c820120607882015260556043909101205f906001600160a01b0316610d4f565b5f81471015611c9b5760405163cf47918160e01b8152476004820152602481018390526044015b60405180910390fd5b763d602d80600a3d3981f3363d3d373d3d3d363d730000008360601b60e81c175f526e5af43d82803e903d91602b57fd5bf38360781b176020526037600983f090506001600160a01b038116610afd5760405163b06ebf3d60e01b815260040160405180910390fd5b5f81471015611d2f5760405163cf47918160e01b815247600482015260248101839052604401611c92565b763d602d80600a3d3981f3363d3d373d3d3d363d730000008460601b60e81c175f526e5af43d82803e903d91602b57fd5bf38460781b17602052826037600984f590506001600160a01b038116610d4f5760405163b06ebf3d60e01b815260040160405180910390fd5b6001600160a01b0391909116815260200190565b5f60208284031215611dbd575f5ffd5b5035919050565b5f60208284031215611dd4575f5ffd5b81356001600160401b03811115611de9575f5ffd5b82016109608185031215610d4f575f5ffd5b80356001600160a01b0381168114611e11575f5ffd5b919050565b5f60208284031215611e26575f5ffd5b610d4f82611dfb565b5f5f8335601e19843603018112611e44575f5ffd5b8301803591506001600160401b03821115611e5d575f5ffd5b6020019150600581901b3603821315611e74575f5ffd5b9250929050565b5f5f8335601e19843603018112611e90575f5ffd5b8301803591506001600160401b03821115611ea9575f5ffd5b602001915036819003821315611e74575f5ffd5b60ff81168114611ecb575f5ffd5b50565b5f60208284031215611ede575f5ffd5b8135610d4f81611ebd565b8015158114611ecb575f5ffd5b5f60208284031215611f06575f5ffd5b8135610d4f81611ee9565b5f60208284031215611f21575f5ffd5b813561ffff81168114610d4f575f5ffd5b5f60208284031215611f42575f5ffd5b813563ffffffff81168114610d4f575f5ffd5b5f60208284031215611f65575f5ffd5b81356001600160401b0381168114610d4f575f5ffd5b5f81518084528060208401602086015e5f602082860101526020601f19601f83011685010191505092915050565b602081525f82516105206020840152611fc6610540840182611f7b565b90506020840151601f19848303016040850152611fe38282611f7b565b9150506040840151611ffa606085018260ff169052565b5060608401516080840152608084015161201f60a08501826001600160a01b03169052565b5060a084015180151560c08501525060c084015160e084015260e084015161204c61010085018215159052565b50610100840151801515610120850152506101208401518015156101408501525061014084015180151561016085015250610160840151801515610180850152506101808401518015156101a0850152506101a08401518015156101c0850152506101c08401518015156101e0850152506101e08401518015156102008501525061020084015161ffff81166102208501525061022084015161ffff81166102408501525061024084015161ffff81166102608501525061026084015163ffffffff811661028085015250610280840151838203601f19016102a08501526121348282611f7b565b9150506102a0840151601f19848303016102c08501526121548282611f7b565b9150506102c0840151601f19848303016102e08501526121748282611f7b565b9150506102e0840151601f19848303016103008501526121948282611f7b565b9150506103008401516121ac61032085018215159052565b5061032084015160ff81166103408501525061034084015160ff811661036085015250610360840151801515610380850152506103808401518015156103a0850152506103a084015160ff81166103c0850152506103c08401518015156103e0850152506103e084015180151561040085015250610400840151801515610420850152506104208401518015156104408501525061044084015160ff8116610460850152506104608401516104808401526104808401516122796104a08501826001600160401b03169052565b506104a084015160ff81166104c0850152506104c084015160ff81166104e0850152506104e084015161ffff811661050085015250610500840151801515610520850152509392505050565b80516001600160501b0381168114611e11575f5ffd5b5f5f5f5f5f60a086880312156122ef575f5ffd5b6122f8866122c5565b6020870151604088015160608901519297509095509350915061231d608087016122c5565b90509295509295909350565b634e487b7160e01b5f52601160045260245ffd5b81810381811115610afd57610afd612329565b5f60208284031215612360575f5ffd5b8151610d4f81611ebd565b6001815b60018411156123a65780850481111561238a5761238a612329565b600184161561239857908102905b60019390931c92800261236f565b935093915050565b5f826123bc57506001610afd565b816123c857505f610afd565b81600181146123de57600281146123e857612404565b6001915050610afd565b60ff8411156123f9576123f9612329565b50506001821b610afd565b5060208310610133831016604e8410600b8410161715612427575081810a610afd565b6124335f19848461236b565b805f190482111561244657612446612329565b029392505050565b5f610d4f60ff8416836123ae565b8082028115828204841417610afd57610afd612329565b5f8261248d57634e487b7160e01b5f52601260045260245ffd5b500490565b634e487b7160e01b5f52603260045260245ffd5b6001600160a01b039290921682521515602082015260400190565b8183526020830192505f815f5b848110156124fd576001600160a01b036124e783611dfb565b16865260209586019591909101906001016124ce565b5093949350505050565b604081525f61251a6040830185876124c1565b90508215156020830152949350505050565b6001600160a01b03929092168252602082015260400190565b5f60208284031215612555575f5ffd5b8151610d4f81611ee9565b81835281816020850137505f828201602090810191909152601f909101601f19169091010190565b606081525f61259b60608301888a6124c1565b82810360208401528581526001600160fb1b038611156125b9575f5ffd5b8560051b80886020840137018281036020908101604080860191909152908201859052600585901b82018101908201865f36829003601e19015b8882101561266057603f198686030184528235818112612611575f5ffd5b8a016020810190356001600160401b0381111561262c575f5ffd5b80360382131561263a575f5ffd5b612645878284612560565b965050506020830192506020840193506001820191506125f3565b50929c9b505050505050505050505050565b5f60208284031215612682575f5ffd5b505191905056fea26469706673582212209b9488e194982bdef905b710c2f289204b90d629c2891980f945488fec8cae0d64736f6c634300081e0033

00000000000000000000000098642b5ac10167c2794729f196dcaa4db9cefa660000000000000000000000005f4ec3df9cbd43714fe2740f5e3616155c5b841900000000000000000000000000000000000000000000000000016bcc41e90000

-----Decoded View---------------
Arg [0] : implementation_ (address): 0x98642b5AC10167c2794729f196dcaa4Db9CEfa66
Arg [1] : priceFeed_ (address): 0x5f4eC3Df9cbd43714FE2740f5E3616155c5b8419
Arg [2] : fallbackFee_ (uint256): 400000000000000

-----Encoded View---------------
3 Constructor Arguments found :
Arg [0] : 00000000000000000000000098642b5ac10167c2794729f196dcaa4db9cefa66
Arg [1] : 0000000000000000000000005f4ec3df9cbd43714fe2740f5e3616155c5b8419
Arg [2] : 00000000000000000000000000000000000000000000000000016bcc41e90000