Contract Source Code (Solidity Standard Json-Input format)

IDE

• Blockscan IDE
• 🤖 Code ReaderBeta
• Remix IDE

More Options

• Similar
• Sol2Uml
• Submit Audit
• Compare

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

/**
 * @title AutomationExecutor
 * @author CuppyC
 * @notice Non-custodial copy-trade execution with on-chain constraint enforcement.
 *
 * ## Architecture Overview
 *
 * This contract acts as a permissioned executor for copy-trading automation.
 * Users sign EIP-712 typed permissions that define:
 *   - Which curve they authorize trades on (bound in signature)
 *   - Maximum spend limits per trade and total
 *   - Slippage tolerance (maxSlippageBps enforced via curve quote on both buys and sells; minOutput as absolute floor)
 *   - Fee bounds they accept
 *   - Originator recipient for creator fees (bound in signature)
 *   - Permission expiry
 *
 * The backend relayer monitors watched traders and submits execute() calls
 * with the user's signed permission. The contract validates all constraints
 * before executing the trade.
 *
 * ## Security Model
 *
 * - NON-CUSTODIAL: User funds remain in their wallet. For buys, we use WETH pull + unwrap.
 *   The user pre-approves this contract for WETH (buys) or tokens (sells).
 * - CONSTRAINT ENFORCEMENT: All policy limits are enforced on-chain.
 * - CURVE BINDING: The curve address is signed, preventing relayer curve substitution.
 * - FEE CAPS: Automation fees are capped at 125 bps platform + 75 bps originator.
 * - REVOCABLE: User can revoke permissions instantly via revokeNonce().
 * - PAUSABLE: Individual policies and entire contract can be paused.
 * - TRANSPARENT: All executions emit detailed events for audit.
 *
 * ## Fee Structure (Automation Layer)
 *
 * Fees are charged by this executor on top of any bonding curve fees:
 *   - Platform fee: 125 bps (1.25%) → platform recipient
 *   - Originator fee: 75 bps (0.75%) → originator recipient (per-policy, user-signed)
 *   - Relayer tip: flat wei amount → msg.sender (relayer), capped by maxRelayerTip
 *   - Total bps: 200 bps (2.00%) + relayer tip
 *
 * For BUYS: Fees + tip deducted from ETH before sending to curve.
 *   Relayer tip is pulled from user WETH alongside the trade amount.
 * For SELLS: Fees + tip deducted from ETH received before sending to user.
 *
 * ## Threat Model
 *
 * 1. Relayer submits unauthorized trade → Reverts: invalid signature
 * 2. Relayer replays revoked permission → Reverts: nonce too low (per-policy)
 * 3. Relayer exceeds spend cap → Reverts: exceeds max spend (tracked per policy)
 * 4. Relayer swaps curve address → Reverts: curve mismatch (bound in signature)
 * 5. Relayer redirects originator fee → Reverts: originator bound in signature
 * 6. Slippage too high → Reverts: slippage exceeded
 * 7. Permission expired → Reverts: permission expired
 * 8. User wants to stop → Call revokePolicyPermission() or setPolicyPaused()
 *
 * ## True Automation Model
 *
 * Unlike traditional nonce-per-trade systems, this contract allows TRUE automation:
 * - User signs ONCE with a nonce, budget limit, and expiry
 * - Multiple trades execute using the SAME signature until budget exhausted or expired
 * - Nonces only increment when user EXPLICITLY calls revokePolicyPermission()
 * - Budget tracking (spentTotal) prevents overspending
 * - Expiry prevents stale permissions from being used indefinitely
 *
 * ## Invariants
 *
 * - spentTotal[user][policyId] <= maxSpendTotal from permission
 * - Each trade amount <= maxSpendPerTrade from permission
 * - Nonces are per-policy, only change on explicit revocation
 * - Paused policies cannot execute
 * - Fees never exceed MAX_TOTAL_AUTOMATION_FEE_BPS (200)
 */

import "@openzeppelin/contracts/utils/ReentrancyGuard.sol";
import "@openzeppelin/contracts/utils/cryptography/ECDSA.sol";
import "@openzeppelin/contracts/utils/cryptography/EIP712.sol";
import "@openzeppelin/contracts/access/Ownable.sol";
import "@openzeppelin/contracts/token/ERC20/IERC20.sol";
import "@openzeppelin/contracts/token/ERC20/utils/SafeERC20.sol";

/// @notice Interface for WETH operations.
interface IWETH is IERC20 {
    function deposit() external payable;
    function withdraw(uint256 amount) external;
}

/// @notice Interface for bonding curve buy/sell operations.
interface IBondingCurve {
    function buy(uint256 amount) external payable;
    function buyExactEth() external payable;
    function sell(uint256 amount) external;
    function token() external view returns (address);
    function spotPrice() external view returns (uint256);
    function tokensOutForExactEth(uint256 ethIn) external view returns (uint256 tokens, uint256 cost);
    function ethOutForExactTokens(uint256 tokensIn) external view returns (uint256 ethOut);
    function closed() external view returns (bool);
}

contract AutomationExecutor is ReentrancyGuard, EIP712, Ownable {
    using SafeERC20 for IERC20;
    using ECDSA for bytes32;

    // =========================================================================
    // Constants
    // =========================================================================

    /// @notice Maximum platform fee: 125 bps (1.25%)
    uint16 public constant MAX_PLATFORM_FEE_BPS = 125;

    /// @notice Maximum originator fee: 75 bps (0.75%)
    uint16 public constant MAX_ORIGINATOR_FEE_BPS = 75;

    /// @notice Maximum total automation fee: 200 bps (2.00%)
    uint16 public constant MAX_TOTAL_AUTOMATION_FEE_BPS = 200;

    /// @notice Basis points denominator
    uint256 private constant BPS_DENOMINATOR = 10000;

    // =========================================================================
    // Type Definitions
    // =========================================================================

    /**
     * @notice Policy permission signed by the user.
     * @dev The backend stores the full policy; on-chain we only verify constraints.
     *      The curve and originatorRecipient are bound in the signature to prevent
     *      relayer manipulation.
     */
    struct PolicyPermission {
        bytes32 policyId;              // Unique policy identifier
        address owner;                 // User wallet that signed this permission
        address curve;                 // Bonding curve address (bound to prevent substitution)
        address originatorRecipient;   // Recipient for originator fees (bound in signature)
        uint256 maxSpendPerTrade;      // Max ETH per single trade (wei)
        uint256 maxSpendTotal;         // Lifetime spending cap for this policy (wei)
        uint16 maxSlippageBps;         // Max slippage in basis points (10000 = 100%)
        uint16 maxPlatformFeeBps;      // Max platform fee user accepts (bps)
        uint16 maxOriginatorFeeBps;    // Max originator fee user accepts (bps)
        uint64 nonce;                  // Replay protection (monotonic)
        uint64 expiresAt;              // Permission expiry timestamp
    }

    /// @notice Parameters for executing a trade.
    struct ExecuteParams {
        PolicyPermission permission;
        bytes signature;               // EIP-712 signature of permission
        bool isBuy;                    // true = buy, false = sell
        uint256 amountWei;             // ETH to spend (buy) or tokens to sell (sell)
        uint256 minOutput;             // Minimum tokens (buy) or ETH (sell) to receive
        address executionCurve;        // Actual curve to execute on (used when permission.curve is a factory wildcard)
        uint256 relayerTipWei;         // Flat gas fee sent to msg.sender (relayer), capped by maxRelayerTip
    }

    // =========================================================================
    // State
    // =========================================================================

    /// @notice WETH contract address (immutable after initialization).
    IWETH public immutable weth;

    /// @notice Tracks total ETH spent per user per policy.
    mapping(address => mapping(bytes32 => uint256)) public spentTotal;

    /// @notice Per-policy nonce for revocation (user => policyId => nonce).
    /// @dev Nonces are NOT incremented per trade. They only change when user explicitly revokes.
    ///      This allows true automation where one signature authorizes multiple trades until budget exhausted or expired.
    mapping(address => mapping(bytes32 => uint64)) public policyNonce;

    /// @notice Paused policies (user => policyId => paused).
    mapping(address => mapping(bytes32 => bool)) public pausedPolicies;

    /// @notice Global pause flag.
    bool public globalPaused;

    /// @notice Relayer addresses authorized to submit trades.
    mapping(address => bool) public authorizedRelayers;

    /// @notice Factory addresses that act as wildcards (permission.curve can be a factory).
    /// When permission.curve is a factory, executionCurve is used for the actual trade.
    mapping(address => bool) public authorizedFactories;

    /// @notice Platform fee recipient address.
    address public platformFeeRecipient;

    /// @notice Platform fee in basis points (max 125).
    uint16 public platformFeeBps;

    /// @notice Originator fee in basis points (max 75).
    uint16 public originatorFeeBps;

    /// @notice Maximum relayer tip per trade in wei. Hard cap to protect users from relayer abuse.
    uint256 public maxRelayerTip;

    // =========================================================================
    // Events
    // =========================================================================

    event TradeExecuted(
        bytes32 indexed policyId,
        address indexed owner,
        address indexed curve,
        bool isBuy,
        uint256 amountIn,
        uint256 amountOut,
        uint256 platformFee,
        uint256 originatorFee,
        uint256 relayerTip,
        uint256 spentBefore,
        uint256 spentAfter
    );

    event NonceRevoked(address indexed owner, uint64 oldNonce, uint64 newNonce);
    event PolicyPaused(address indexed owner, bytes32 indexed policyId, bool paused);
    event RelayerUpdated(address indexed relayer, bool authorized);
    event FactoryUpdated(address indexed factory, bool authorized);
    event GlobalPauseUpdated(bool paused);
    event FeeConfigUpdated(address platformRecipient, uint16 platformBps, uint16 originatorBps);
    event MaxRelayerTipUpdated(uint256 newMax);

    // =========================================================================
    // Errors
    // =========================================================================

    error NotAuthorizedRelayer();
    error GloballyPaused();
    error PolicyPausedByOwner();
    error InvalidSignature();
    error InvalidNonce();
    error PermissionExpired();
    error ExceedsMaxSpendPerTrade();
    error ExceedsMaxSpendTotal();
    error SlippageExceeded();
    error CurveClosed();
    error InsufficientWETHAllowance();
    error InsufficientTokenAllowance();
    error ZeroAddress();
    error ZeroOriginatorRecipient();
    error FeeExceedsCap();
    error FeeExceedsUserMax();
    error TransferFailed();
    error InvalidExecutionCurve();
    error RelayerTipExceedsMax();

    // =========================================================================
    // EIP-712 Type Hash
    // =========================================================================

    bytes32 private constant POLICY_PERMISSION_TYPEHASH = keccak256(
        "PolicyPermission(bytes32 policyId,address owner,address curve,address originatorRecipient,uint256 maxSpendPerTrade,uint256 maxSpendTotal,uint16 maxSlippageBps,uint16 maxPlatformFeeBps,uint16 maxOriginatorFeeBps,uint64 nonce,uint64 expiresAt)"
    );

    // =========================================================================
    // Constructor
    // =========================================================================

    /**
     * @param initialOwner The contract owner address.
     * @param _weth The WETH contract address.
     * @param _platformFeeRecipient Initial platform fee recipient.
     */
    constructor(address initialOwner, address _weth, address _platformFeeRecipient)
        EIP712("AutomationExecutor", "2")
        Ownable(initialOwner)
    {
        if (_weth == address(0)) revert ZeroAddress();
        if (_platformFeeRecipient == address(0)) revert ZeroAddress();

        weth = IWETH(_weth);
        platformFeeRecipient = _platformFeeRecipient;

        // Set default fees
        platformFeeBps = MAX_PLATFORM_FEE_BPS;    // 125 bps (1.25%)
        originatorFeeBps = 25;                     // 25 bps (0.25%) — carved from platform fee
        maxRelayerTip = 5_000_000_000_000_000;     // 0.005 ETH default cap

        // Initial owner is automatically an authorized relayer
        authorizedRelayers[initialOwner] = true;
        emit RelayerUpdated(initialOwner, true);
        emit FeeConfigUpdated(_platformFeeRecipient, platformFeeBps, originatorFeeBps);
    }

    // =========================================================================
    // External Functions
    // =========================================================================

    /**
     * @notice Execute a copy trade on behalf of a user.
     * @dev Only callable by authorized relayers. Validates all constraints.
     *      Relayer triggers execution; contract enforces all bounds.
     * @param params Execution parameters including signed permission.
     *
     * How it works for BUYS (non-custodial via WETH):
     *   1. Contract validates permission, constraints, and relayer tip cap
     *   2. Contract pulls WETH from user (amountWei + relayerTipWei)
     *   3. Contract unwraps WETH to ETH
     *   4. Contract sends relayer tip to msg.sender (gas reimbursement)
     *   5. Contract computes and deducts automation fees (platform + originator)
     *   6. Contract sends fees to recipients
     *   7. Contract calls curve.buyExactEth() with remaining ETH
     *   8. Purchased tokens are sent to the policy owner
     *   9. Contract tracks spent amount (amountWei + tip as "spent")
     *
     * How it works for SELLS:
     *   1. Owner must have approved this contract for tokens
     *   2. Contract gets quote from curve.ethOutForExactTokens()
     *   3. Contract pulls tokens from owner
     *   4. Contract sells tokens via curve.sell()
     *   5. Contract enforces maxSlippageBps on gross ETH received vs quote
     *   6. Contract computes and deducts automation fees + relayer tip from ETH received
     *   7. Contract enforces minOutput on net ETH to user (after fees + tip)
     *   8. Contract sends fees and tip to recipients
     *   9. Remaining ETH proceeds are sent to the owner
     */
    function execute(ExecuteParams calldata params)
        external
        payable
        nonReentrant
        returns (uint256 amountOut)
    {
        // Check global pause
        if (globalPaused) revert GloballyPaused();

        // Check relayer authorization
        if (!authorizedRelayers[msg.sender]) revert NotAuthorizedRelayer();

        PolicyPermission calldata perm = params.permission;

        // Check policy pause
        if (pausedPolicies[perm.owner][perm.policyId]) revert PolicyPausedByOwner();

        // Verify permission signature
        _verifyPermission(perm, params.signature);

        // Check expiry
        if (block.timestamp > perm.expiresAt) revert PermissionExpired();

        // Check nonce is valid (must be >= stored policy nonce)
        // Nonces are NOT incremented per trade - only when user explicitly revokes
        if (perm.nonce < policyNonce[perm.owner][perm.policyId]) revert InvalidNonce();

        // Resolve curve: if permission.curve is a factory wildcard, use executionCurve
        // This allows policies to authorize trades on any token from a specific factory
        IBondingCurve curve;
        if (authorizedFactories[perm.curve]) {
            // Factory wildcard: use the provided execution curve
            if (params.executionCurve == address(0)) revert InvalidExecutionCurve();
            curve = IBondingCurve(params.executionCurve);
        } else {
            // Direct curve binding: use the curve from permission
            curve = IBondingCurve(perm.curve);
        }
        if (curve.closed()) revert CurveClosed();

        // Verify configured fees don't exceed user's signed maximums
        if (platformFeeBps > perm.maxPlatformFeeBps) revert FeeExceedsUserMax();

        // Per-policy originator fee: use the lesser of contract rate and user-signed max.
        // This allows non-copy policies to sign maxOriginatorFeeBps=0 and pay no originator fee,
        // while copy/mirror policies sign maxOriginatorFeeBps=25 (or up to contract rate).
        uint16 effectiveOriginatorBps = originatorFeeBps <= perm.maxOriginatorFeeBps
            ? originatorFeeBps : perm.maxOriginatorFeeBps;

        // Only require a valid originator recipient when originator fee will be charged
        if (effectiveOriginatorBps > 0 && perm.originatorRecipient == address(0))
            revert ZeroOriginatorRecipient();

        // Validate relayer tip
        if (params.relayerTipWei > maxRelayerTip) revert RelayerTipExceedsMax();

        uint256 spentBefore = spentTotal[perm.owner][perm.policyId];
        uint256 platformFeeAmount;
        uint256 originatorFeeAmount;

        if (params.isBuy) {
            (amountOut, platformFeeAmount, originatorFeeAmount) = _executeBuy(perm, params, curve, spentBefore, effectiveOriginatorBps);
        } else {
            (amountOut, platformFeeAmount, originatorFeeAmount) = _executeSell(perm, params, curve, effectiveOriginatorBps);
        }

        uint256 spentAfter = spentTotal[perm.owner][perm.policyId];

        emit TradeExecuted(
            perm.policyId,
            perm.owner,
            address(curve), // Emit actual execution curve (may differ from perm.curve if factory wildcard)
            params.isBuy,
            params.amountWei,
            amountOut,
            platformFeeAmount,
            originatorFeeAmount,
            params.relayerTipWei,
            spentBefore,
            spentAfter
        );

        // Refund any ETH sent by relayer (buys should not require msg.value)
        if (msg.value > 0) {
            (bool success, ) = payable(msg.sender).call{value: msg.value}("");
            if (!success) revert TransferFailed();
        }
    }

    /**
     * @notice Revoke the current permission for a specific policy.
     * @dev Increments the policy nonce, invalidating any signatures with lower nonce.
     *      User must re-sign with the new nonce to re-enable automation.
     * @param policyId The policy to revoke permission for.
     */
    function revokePolicyPermission(bytes32 policyId) external {
        uint64 currentNonce = policyNonce[msg.sender][policyId];
        uint64 newNonce = currentNonce + 1;
        policyNonce[msg.sender][policyId] = newNonce;
        emit NonceRevoked(msg.sender, currentNonce, newNonce);
    }

    /**
     * @notice Revoke all permissions by incrementing global nonce for all policies.
     * @dev This is a convenience function that revokes a specific policy.
     *      For true global revocation, user should call revokePolicyPermission for each policy.
     * @param nonce The nonce to set (must be > current).
     * @param policyId The policy to revoke.
     */
    function revokeNonce(uint64 nonce, bytes32 policyId) external {
        uint64 currentNonce = policyNonce[msg.sender][policyId];
        if (nonce > currentNonce) {
            policyNonce[msg.sender][policyId] = nonce;
            emit NonceRevoked(msg.sender, currentNonce, nonce);
        }
    }

    /**
     * @notice Pause or unpause a specific policy.
     * @dev Allows users to temporarily stop automation without revoking permission.
     */
    function setPolicyPaused(bytes32 policyId, bool paused) external {
        pausedPolicies[msg.sender][policyId] = paused;
        emit PolicyPaused(msg.sender, policyId, paused);
    }

    /**
     * @notice Get the remaining budget for a policy.
     * @param policyOwner The policy owner address.
     * @param policyId The policy identifier.
     * @param maxSpendTotal The max spend total from the permission.
     * @return remaining The remaining spendable amount in wei.
     */
    function getRemainingBudget(address policyOwner, bytes32 policyId, uint256 maxSpendTotal)
        external
        view
        returns (uint256 remaining)
    {
        uint256 spent = spentTotal[policyOwner][policyId];
        if (spent >= maxSpendTotal) return 0;
        return maxSpendTotal - spent;
    }

    /**
     * @notice Get the current nonce for a user's policy.
     * @param user The user address.
     * @param policyId The policy identifier.
     * @return The current nonce (signatures must have nonce >= this value).
     */
    function getPolicyNonce(address user, bytes32 policyId) external view returns (uint64) {
        return policyNonce[user][policyId];
    }

    /**
     * @notice Legacy function for backward compatibility.
     * @dev Returns 0 since nonces are now per-policy. Use getPolicyNonce instead.
     */
    function getNextNonce(address) external pure returns (uint64) {
        return 0;
    }

    // =========================================================================
    // Admin Functions
    // =========================================================================

    /**
     * @notice Set relayer authorization.
     */
    function setRelayer(address relayer, bool authorized) external onlyOwner {
        if (relayer == address(0)) revert ZeroAddress();
        authorizedRelayers[relayer] = authorized;
        emit RelayerUpdated(relayer, authorized);
    }

    /**
     * @notice Set factory authorization for wildcard permissions.
     * @dev When a permission's curve is an authorized factory, the executionCurve param is used instead.
     *      This enables policies that can trade on any token deployed from a specific factory.
     */
    function setFactory(address factory, bool authorized) external onlyOwner {
        if (factory == address(0)) revert ZeroAddress();
        authorizedFactories[factory] = authorized;
        emit FactoryUpdated(factory, authorized);
    }

    /**
     * @notice Set global pause state.
     */
    function setGlobalPaused(bool paused) external onlyOwner {
        globalPaused = paused;
        emit GlobalPauseUpdated(paused);
    }

    /**
     * @notice Set the maximum relayer tip per trade.
     * @dev Prevents relayer from extracting excessive tips from user WETH.
     * @param _maxTip Maximum tip in wei (0 = tips disabled).
     */
    function setMaxRelayerTip(uint256 _maxTip) external onlyOwner {
        maxRelayerTip = _maxTip;
        emit MaxRelayerTipUpdated(_maxTip);
    }

    /**
     * @notice Configure automation fees.
     * @dev Fees can only be set at or below the hard caps.
     * @param recipient Platform fee recipient address.
     * @param _platformBps Platform fee in basis points (max 125).
     * @param _originatorBps Originator fee in basis points (max 75).
     */
    function setFeeConfig(address recipient, uint16 _platformBps, uint16 _originatorBps) external onlyOwner {
        if (recipient == address(0)) revert ZeroAddress();
        if (_platformBps > MAX_PLATFORM_FEE_BPS) revert FeeExceedsCap();
        if (_originatorBps > MAX_ORIGINATOR_FEE_BPS) revert FeeExceedsCap();
        if (_platformBps + _originatorBps > MAX_TOTAL_AUTOMATION_FEE_BPS) revert FeeExceedsCap();

        platformFeeRecipient = recipient;
        platformFeeBps = _platformBps;
        originatorFeeBps = _originatorBps;
        emit FeeConfigUpdated(recipient, _platformBps, _originatorBps);
    }

    /**
     * @notice Withdraw stuck ETH (emergency only).
     */
    function withdrawETH(address to, uint256 amount) external onlyOwner {
        if (to == address(0)) revert ZeroAddress();
        (bool success, ) = payable(to).call{value: amount}("");
        if (!success) revert TransferFailed();
    }

    /**
     * @notice Withdraw stuck tokens (emergency only).
     */
    function withdrawToken(address token, address to, uint256 amount) external onlyOwner {
        if (to == address(0)) revert ZeroAddress();
        IERC20(token).safeTransfer(to, amount);
    }

    // =========================================================================
    // Internal Functions
    // =========================================================================

    /**
     * @dev Execute a buy trade using WETH from user.
     * @return tokensReceived Tokens received by user.
     * @return platformFeeAmount Platform fee deducted.
     * @return originatorFeeAmount Originator fee deducted.
     */
    function _executeBuy(
        PolicyPermission calldata perm,
        ExecuteParams calldata params,
        IBondingCurve curve,
        uint256 spentBefore,
        uint16 _originatorBps
    ) internal returns (uint256 tokensReceived, uint256 platformFeeAmount, uint256 originatorFeeAmount) {
        uint256 ethToSpend = params.amountWei;
        uint256 tip = params.relayerTipWei;
        uint256 totalCost = ethToSpend + tip;

        // Check per-trade limit (trade amount + relayer tip)
        if (totalCost > perm.maxSpendPerTrade) revert ExceedsMaxSpendPerTrade();

        // Check total limit
        if (spentBefore + totalCost > perm.maxSpendTotal) revert ExceedsMaxSpendTotal();

        // Pull WETH from user (trade amount + relayer tip)
        uint256 wethAllowance = weth.allowance(perm.owner, address(this));
        if (wethAllowance < totalCost) revert InsufficientWETHAllowance();
        IERC20(address(weth)).safeTransferFrom(perm.owner, address(this), totalCost);

        // Unwrap WETH to ETH
        weth.withdraw(totalCost);

        // Send relayer tip to msg.sender (covers gas costs)
        if (tip > 0) {
            (bool tipOk, ) = payable(msg.sender).call{value: tip}("");
            if (!tipOk) revert TransferFailed();
        }

        // Compute fees: total fee = platformFeeBps, originator carved out of it.
        // Fees are computed on ethToSpend only (not including tip).
        // e.g. platform=125, originator=25 → platformFee=100bps, originatorFee=25bps, total=125bps.
        uint256 totalFeeAmount = (ethToSpend * platformFeeBps) / BPS_DENOMINATOR;
        originatorFeeAmount = (ethToSpend * _originatorBps) / BPS_DENOMINATOR;
        platformFeeAmount = totalFeeAmount - originatorFeeAmount;
        uint256 netEthForCurve = ethToSpend - totalFeeAmount;

        // Send fees
        if (platformFeeAmount > 0) {
            (bool success, ) = payable(platformFeeRecipient).call{value: platformFeeAmount}("");
            if (!success) revert TransferFailed();
        }
        if (originatorFeeAmount > 0) {
            (bool success, ) = payable(perm.originatorRecipient).call{value: originatorFeeAmount}("");
            if (!success) revert TransferFailed();
        }

        // Get quote for slippage checks (using net ETH that actually goes to curve)
        (uint256 expectedTokens, ) = curve.tokensOutForExactEth(netEthForCurve);

        // Enforce user-provided absolute minimum, if any
        if (expectedTokens < params.minOutput) revert SlippageExceeded();

        // Enforce maxSlippageBps even when minOutput == 0.
        // Interpret maxSlippageBps as: the execution must return at least
        // (1 - maxSlippageBps) of the quoted expectedTokens.
        uint256 minBySlippage = 0;
        if (expectedTokens > 0) {
            minBySlippage = (expectedTokens * (BPS_DENOMINATOR - perm.maxSlippageBps)) / BPS_DENOMINATOR;
        }

        // Required minimum is the stricter of user minOutput and slippage-derived minimum.
        uint256 requiredMinOut = params.minOutput;
        if (minBySlippage > requiredMinOut) requiredMinOut = minBySlippage;

        // Get token address
        address tokenAddr = curve.token();
        uint256 balanceBefore = IERC20(tokenAddr).balanceOf(address(this));

        // Update spent tracking BEFORE external call (CEI pattern)
        // Track full amount including fees and tip as "spent"
        spentTotal[perm.owner][perm.policyId] = spentBefore + totalCost;

        // Execute buy with net ETH
        curve.buyExactEth{value: netEthForCurve}();

        // Calculate tokens received
        uint256 balanceAfter = IERC20(tokenAddr).balanceOf(address(this));
        tokensReceived = balanceAfter - balanceBefore;

        // Verify slippage against the stricter bound (user minOutput and maxSlippageBps)
        if (tokensReceived < requiredMinOut) revert SlippageExceeded();

        // Transfer tokens to owner
        IERC20(tokenAddr).safeTransfer(perm.owner, tokensReceived);
    }

    /**
     * @dev Execute a sell trade.
     * @return ethReceived Net ETH received by user (after executor fees).
     * @return platformFeeAmount Platform fee deducted.
     * @return originatorFeeAmount Originator fee deducted.
     */
    function _executeSell(
        PolicyPermission calldata perm,
        ExecuteParams calldata params,
        IBondingCurve curve,
        uint16 _originatorBps
    ) internal returns (uint256 ethReceived, uint256 platformFeeAmount, uint256 originatorFeeAmount) {
        uint256 tokensToSell = params.amountWei;
        address tokenAddr = curve.token();

        // Check owner has approved tokens
        uint256 allowance = IERC20(tokenAddr).allowance(perm.owner, address(this));
        if (allowance < tokensToSell) revert InsufficientTokenAllowance();

        // Get quote for slippage check BEFORE pulling tokens
        // This returns the net ETH from the curve (after curve-level fees)
        uint256 expectedGrossEth = curve.ethOutForExactTokens(tokensToSell);

        // Compute slippage-derived minimum gross ETH from curve
        uint256 minGrossBySlippage = 0;
        if (expectedGrossEth > 0) {
            minGrossBySlippage = (expectedGrossEth * (BPS_DENOMINATOR - perm.maxSlippageBps)) / BPS_DENOMINATOR;
        }

        // Pull tokens from owner
        IERC20(tokenAddr).safeTransferFrom(perm.owner, address(this), tokensToSell);

        // Approve curve to spend tokens (use forceApprove for safety with non-standard tokens)
        IERC20(tokenAddr).forceApprove(address(curve), tokensToSell);

        // Get ETH balance before
        uint256 ethBefore = address(this).balance;

        // Execute sell
        curve.sell(tokensToSell);

        // Calculate gross ETH received from curve
        uint256 ethAfter = address(this).balance;
        uint256 grossEthReceived = ethAfter - ethBefore;

        // Enforce maxSlippageBps on gross ETH from curve
        if (grossEthReceived < minGrossBySlippage) revert SlippageExceeded();

        // Compute fees: total fee = platformFeeBps, originator carved out of it.
        uint256 totalFeeAmount = (grossEthReceived * platformFeeBps) / BPS_DENOMINATOR;
        originatorFeeAmount = (grossEthReceived * _originatorBps) / BPS_DENOMINATOR;
        platformFeeAmount = totalFeeAmount - originatorFeeAmount;
        uint256 tip = params.relayerTipWei;
        ethReceived = grossEthReceived - totalFeeAmount - tip;

        // Enforce minOutput on net ETH to user (after executor fees and relayer tip)
        if (ethReceived < params.minOutput) revert SlippageExceeded();

        // Send fees
        if (platformFeeAmount > 0) {
            (bool ok1, ) = payable(platformFeeRecipient).call{value: platformFeeAmount}("");
            if (!ok1) revert TransferFailed();
        }
        if (originatorFeeAmount > 0) {
            (bool ok2, ) = payable(perm.originatorRecipient).call{value: originatorFeeAmount}("");
            if (!ok2) revert TransferFailed();
        }

        // Send relayer tip to msg.sender (covers gas costs)
        if (tip > 0) {
            (bool tipOk, ) = payable(msg.sender).call{value: tip}("");
            if (!tipOk) revert TransferFailed();
        }

        // Transfer net ETH to owner
        (bool ok3, ) = payable(perm.owner).call{value: ethReceived}("");
        if (!ok3) revert TransferFailed();
    }

    /**
     * @dev Verify the EIP-712 signature of a policy permission.
     */
    function _verifyPermission(PolicyPermission calldata perm, bytes calldata signature) internal view {
        bytes32 structHash = keccak256(abi.encode(
            POLICY_PERMISSION_TYPEHASH,
            perm.policyId,
            perm.owner,
            perm.curve,
            perm.originatorRecipient,
            perm.maxSpendPerTrade,
            perm.maxSpendTotal,
            perm.maxSlippageBps,
            perm.maxPlatformFeeBps,
            perm.maxOriginatorFeeBps,
            perm.nonce,
            perm.expiresAt
        ));

        bytes32 digest = _hashTypedDataV4(structHash);
        address signer = ECDSA.recover(digest, signature);

        if (signer != perm.owner) revert InvalidSignature();
    }

    /**
     * @notice Get the EIP-712 domain separator.
     */
    function domainSeparator() external view returns (bytes32) {
        return _domainSeparatorV4();
    }

    /**
     * @notice Compute the hash of a policy permission for signing.
     */
    function hashPermission(PolicyPermission calldata perm) external view returns (bytes32) {
        bytes32 structHash = keccak256(abi.encode(
            POLICY_PERMISSION_TYPEHASH,
            perm.policyId,
            perm.owner,
            perm.curve,
            perm.originatorRecipient,
            perm.maxSpendPerTrade,
            perm.maxSpendTotal,
            perm.maxSlippageBps,
            perm.maxPlatformFeeBps,
            perm.maxOriginatorFeeBps,
            perm.nonce,
            perm.expiresAt
        ));
        return _hashTypedDataV4(structHash);
    }

    /**
     * @dev Receive ETH (from WETH unwrap and curve sells).
     */
    receive() external payable {}
}

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

pragma solidity ^0.8.20;

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

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

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

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

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

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

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

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

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

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

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

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

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.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.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.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/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) (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.3.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 {
        _callOptionalReturn(token, abi.encodeCall(token.transfer, (to, value)));
    }

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

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

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

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

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

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

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

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

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

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

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

pragma solidity ^0.8.20;

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

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

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

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

pragma solidity ^0.8.20;

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

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

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

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

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

    /**
     * @dev Overload of {ECDSA-tryRecover} that receives the `r` and `vs` short-signature fields separately.
     *
     * See https://eips.ethereum.org/EIPS/eip-2098[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 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.4.0) (utils/cryptography/EIP712.sol)

pragma solidity ^0.8.20;

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

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

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

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

    bytes32 private immutable _hashedName;
    bytes32 private immutable _hashedVersion;

    ShortString private immutable _name;
    ShortString private immutable _version;
    // slither-disable-next-line constable-states
    string private _nameFallback;
    // slither-disable-next-line constable-states
    string private _versionFallback;

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

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

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

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

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

    /// @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
        )
    {
        return (
            hex"0f", // 01111
            _EIP712Name(),
            _EIP712Version(),
            block.chainid,
            address(this),
            bytes32(0),
            new uint256[](0)
        );
    }

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

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

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

pragma solidity ^0.8.20;

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

/**
 * @dev Signature message hash utilities for producing digests to be consumed by {ECDSA} recovery or signing.
 *
 * The library provides methods for generating a hash of a message that conforms to the
 * https://eips.ethereum.org/EIPS/eip-191[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"19_00", 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"19_00")
            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"19_01")
            mstore(add(ptr, 0x02), domainSeparator)
            mstore(add(ptr, 0x22), structHash)
            digest := keccak256(ptr, 0x42)
        }
    }
}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.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.3.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 `a ? b : c`. Gas costs are constant.
     *
     * IMPORTANT: This function may reduce bytecode size and consume less gas when used standalone.
     * However, the compiler may optimize Solidity ternary operations (i.e. `a ? b : c`) to only compute
     * one branch when needed, making this function more expensive.
     */
    function ternary(bool condition, uint256 a, uint256 b) internal pure returns (uint256) {
        unchecked {
            // branchless ternary works because:
            // b ^ (a ^ b) == a
            // b ^ 0 == b
            return b ^ ((a ^ b) * SafeCast.toUint(condition));
        }
    }

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

        uint256 mLen = m.length;

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.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.1.0) (utils/Panic.sol)

pragma solidity ^0.8.20;

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

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

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

pragma solidity ^0.8.20;

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

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

    uint256 private _status;

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

    constructor() {
        _status = NOT_ENTERED;
    }

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

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

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

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

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

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

pragma solidity ^0.8.20;

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

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

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

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

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

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

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

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

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

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

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.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) (utils/Strings.sol)

pragma solidity ^0.8.20;

import {Math} from "./math/Math.sol";
import {SafeCast} from "./math/SafeCast.sol";
import {SignedMath} from "./math/SignedMath.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 Returns true if the two strings are equal.
     */
    function equal(string memory a, string memory b) internal pure returns (bool) {
        return bytes(a).length == bytes(b).length && keccak256(bytes(a)) == keccak256(bytes(b));
    }

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

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

• No Contract Security Audit Submitted- Submit Audit Here

[{"inputs":[{"internalType":"address","name":"initialOwner","type":"address"},{"internalType":"address","name":"_weth","type":"address"},{"internalType":"address","name":"_platformFeeRecipient","type":"address"}],"stateMutability":"nonpayable","type":"constructor"},{"inputs":[],"name":"CurveClosed","type":"error"},{"inputs":[],"name":"ECDSAInvalidSignature","type":"error"},{"inputs":[{"internalType":"uint256","name":"length","type":"uint256"}],"name":"ECDSAInvalidSignatureLength","type":"error"},{"inputs":[{"internalType":"bytes32","name":"s","type":"bytes32"}],"name":"ECDSAInvalidSignatureS","type":"error"},{"inputs":[],"name":"ExceedsMaxSpendPerTrade","type":"error"},{"inputs":[],"name":"ExceedsMaxSpendTotal","type":"error"},{"inputs":[],"name":"FeeExceedsCap","type":"error"},{"inputs":[],"name":"FeeExceedsUserMax","type":"error"},{"inputs":[],"name":"GloballyPaused","type":"error"},{"inputs":[],"name":"InsufficientTokenAllowance","type":"error"},{"inputs":[],"name":"InsufficientWETHAllowance","type":"error"},{"inputs":[],"name":"InvalidExecutionCurve","type":"error"},{"inputs":[],"name":"InvalidNonce","type":"error"},{"inputs":[],"name":"InvalidShortString","type":"error"},{"inputs":[],"name":"InvalidSignature","type":"error"},{"inputs":[],"name":"NotAuthorizedRelayer","type":"error"},{"inputs":[{"internalType":"address","name":"owner","type":"address"}],"name":"OwnableInvalidOwner","type":"error"},{"inputs":[{"internalType":"address","name":"account","type":"address"}],"name":"OwnableUnauthorizedAccount","type":"error"},{"inputs":[],"name":"PermissionExpired","type":"error"},{"inputs":[],"name":"PolicyPausedByOwner","type":"error"},{"inputs":[],"name":"ReentrancyGuardReentrantCall","type":"error"},{"inputs":[],"name":"RelayerTipExceedsMax","type":"error"},{"inputs":[{"internalType":"address","name":"token","type":"address"}],"name":"SafeERC20FailedOperation","type":"error"},{"inputs":[],"name":"SlippageExceeded","type":"error"},{"inputs":[{"internalType":"string","name":"str","type":"string"}],"name":"StringTooLong","type":"error"},{"inputs":[],"name":"TransferFailed","type":"error"},{"inputs":[],"name":"ZeroAddress","type":"error"},{"inputs":[],"name":"ZeroOriginatorRecipient","type":"error"},{"anonymous":false,"inputs":[],"name":"EIP712DomainChanged","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"factory","type":"address"},{"indexed":false,"internalType":"bool","name":"authorized","type":"bool"}],"name":"FactoryUpdated","type":"event"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"address","name":"platformRecipient","type":"address"},{"indexed":false,"internalType":"uint16","name":"platformBps","type":"uint16"},{"indexed":false,"internalType":"uint16","name":"originatorBps","type":"uint16"}],"name":"FeeConfigUpdated","type":"event"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"bool","name":"paused","type":"bool"}],"name":"GlobalPauseUpdated","type":"event"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"uint256","name":"newMax","type":"uint256"}],"name":"MaxRelayerTipUpdated","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"owner","type":"address"},{"indexed":false,"internalType":"uint64","name":"oldNonce","type":"uint64"},{"indexed":false,"internalType":"uint64","name":"newNonce","type":"uint64"}],"name":"NonceRevoked","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":"owner","type":"address"},{"indexed":true,"internalType":"bytes32","name":"policyId","type":"bytes32"},{"indexed":false,"internalType":"bool","name":"paused","type":"bool"}],"name":"PolicyPaused","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"relayer","type":"address"},{"indexed":false,"internalType":"bool","name":"authorized","type":"bool"}],"name":"RelayerUpdated","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"bytes32","name":"policyId","type":"bytes32"},{"indexed":true,"internalType":"address","name":"owner","type":"address"},{"indexed":true,"internalType":"address","name":"curve","type":"address"},{"indexed":false,"internalType":"bool","name":"isBuy","type":"bool"},{"indexed":false,"internalType":"uint256","name":"amountIn","type":"uint256"},{"indexed":false,"internalType":"uint256","name":"amountOut","type":"uint256"},{"indexed":false,"internalType":"uint256","name":"platformFee","type":"uint256"},{"indexed":false,"internalType":"uint256","name":"originatorFee","type":"uint256"},{"indexed":false,"internalType":"uint256","name":"relayerTip","type":"uint256"},{"indexed":false,"internalType":"uint256","name":"spentBefore","type":"uint256"},{"indexed":false,"internalType":"uint256","name":"spentAfter","type":"uint256"}],"name":"TradeExecuted","type":"event"},{"inputs":[],"name":"MAX_ORIGINATOR_FEE_BPS","outputs":[{"internalType":"uint16","name":"","type":"uint16"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"MAX_PLATFORM_FEE_BPS","outputs":[{"internalType":"uint16","name":"","type":"uint16"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"MAX_TOTAL_AUTOMATION_FEE_BPS","outputs":[{"internalType":"uint16","name":"","type":"uint16"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"","type":"address"}],"name":"authorizedFactories","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"","type":"address"}],"name":"authorizedRelayers","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"domainSeparator","outputs":[{"internalType":"bytes32","name":"","type":"bytes32"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"eip712Domain","outputs":[{"internalType":"bytes1","name":"fields","type":"bytes1"},{"internalType":"string","name":"name","type":"string"},{"internalType":"string","name":"version","type":"string"},{"internalType":"uint256","name":"chainId","type":"uint256"},{"internalType":"address","name":"verifyingContract","type":"address"},{"internalType":"bytes32","name":"salt","type":"bytes32"},{"internalType":"uint256[]","name":"extensions","type":"uint256[]"}],"stateMutability":"view","type":"function"},{"inputs":[{"components":[{"components":[{"internalType":"bytes32","name":"policyId","type":"bytes32"},{"internalType":"address","name":"owner","type":"address"},{"internalType":"address","name":"curve","type":"address"},{"internalType":"address","name":"originatorRecipient","type":"address"},{"internalType":"uint256","name":"maxSpendPerTrade","type":"uint256"},{"internalType":"uint256","name":"maxSpendTotal","type":"uint256"},{"internalType":"uint16","name":"maxSlippageBps","type":"uint16"},{"internalType":"uint16","name":"maxPlatformFeeBps","type":"uint16"},{"internalType":"uint16","name":"maxOriginatorFeeBps","type":"uint16"},{"internalType":"uint64","name":"nonce","type":"uint64"},{"internalType":"uint64","name":"expiresAt","type":"uint64"}],"internalType":"struct AutomationExecutor.PolicyPermission","name":"permission","type":"tuple"},{"internalType":"bytes","name":"signature","type":"bytes"},{"internalType":"bool","name":"isBuy","type":"bool"},{"internalType":"uint256","name":"amountWei","type":"uint256"},{"internalType":"uint256","name":"minOutput","type":"uint256"},{"internalType":"address","name":"executionCurve","type":"address"},{"internalType":"uint256","name":"relayerTipWei","type":"uint256"}],"internalType":"struct AutomationExecutor.ExecuteParams","name":"params","type":"tuple"}],"name":"execute","outputs":[{"internalType":"uint256","name":"amountOut","type":"uint256"}],"stateMutability":"payable","type":"function"},{"inputs":[{"internalType":"address","name":"","type":"address"}],"name":"getNextNonce","outputs":[{"internalType":"uint64","name":"","type":"uint64"}],"stateMutability":"pure","type":"function"},{"inputs":[{"internalType":"address","name":"user","type":"address"},{"internalType":"bytes32","name":"policyId","type":"bytes32"}],"name":"getPolicyNonce","outputs":[{"internalType":"uint64","name":"","type":"uint64"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"policyOwner","type":"address"},{"internalType":"bytes32","name":"policyId","type":"bytes32"},{"internalType":"uint256","name":"maxSpendTotal","type":"uint256"}],"name":"getRemainingBudget","outputs":[{"internalType":"uint256","name":"remaining","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"globalPaused","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[{"components":[{"internalType":"bytes32","name":"policyId","type":"bytes32"},{"internalType":"address","name":"owner","type":"address"},{"internalType":"address","name":"curve","type":"address"},{"internalType":"address","name":"originatorRecipient","type":"address"},{"internalType":"uint256","name":"maxSpendPerTrade","type":"uint256"},{"internalType":"uint256","name":"maxSpendTotal","type":"uint256"},{"internalType":"uint16","name":"maxSlippageBps","type":"uint16"},{"internalType":"uint16","name":"maxPlatformFeeBps","type":"uint16"},{"internalType":"uint16","name":"maxOriginatorFeeBps","type":"uint16"},{"internalType":"uint64","name":"nonce","type":"uint64"},{"internalType":"uint64","name":"expiresAt","type":"uint64"}],"internalType":"struct AutomationExecutor.PolicyPermission","name":"perm","type":"tuple"}],"name":"hashPermission","outputs":[{"internalType":"bytes32","name":"","type":"bytes32"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"maxRelayerTip","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"originatorFeeBps","outputs":[{"internalType":"uint16","name":"","type":"uint16"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"owner","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"","type":"address"},{"internalType":"bytes32","name":"","type":"bytes32"}],"name":"pausedPolicies","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"platformFeeBps","outputs":[{"internalType":"uint16","name":"","type":"uint16"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"platformFeeRecipient","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"","type":"address"},{"internalType":"bytes32","name":"","type":"bytes32"}],"name":"policyNonce","outputs":[{"internalType":"uint64","name":"","type":"uint64"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"renounceOwnership","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint64","name":"nonce","type":"uint64"},{"internalType":"bytes32","name":"policyId","type":"bytes32"}],"name":"revokeNonce","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"bytes32","name":"policyId","type":"bytes32"}],"name":"revokePolicyPermission","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"factory","type":"address"},{"internalType":"bool","name":"authorized","type":"bool"}],"name":"setFactory","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"recipient","type":"address"},{"internalType":"uint16","name":"_platformBps","type":"uint16"},{"internalType":"uint16","name":"_originatorBps","type":"uint16"}],"name":"setFeeConfig","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"bool","name":"paused","type":"bool"}],"name":"setGlobalPaused","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"_maxTip","type":"uint256"}],"name":"setMaxRelayerTip","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"bytes32","name":"policyId","type":"bytes32"},{"internalType":"bool","name":"paused","type":"bool"}],"name":"setPolicyPaused","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"relayer","type":"address"},{"internalType":"bool","name":"authorized","type":"bool"}],"name":"setRelayer","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"","type":"address"},{"internalType":"bytes32","name":"","type":"bytes32"}],"name":"spentTotal","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"newOwner","type":"address"}],"name":"transferOwnership","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"weth","outputs":[{"internalType":"contract IWETH","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"to","type":"address"},{"internalType":"uint256","name":"amount","type":"uint256"}],"name":"withdrawETH","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"token","type":"address"},{"internalType":"address","name":"to","type":"address"},{"internalType":"uint256","name":"amount","type":"uint256"}],"name":"withdrawToken","outputs":[],"stateMutability":"nonpayable","type":"function"},{"stateMutability":"payable","type":"receive"}]

61018080604052346102ec57606081612b78803803809161002082856102f1565b8339810103126102ec576100338161032a565b61004b60406100446020850161032a565b930161032a565b9060405161005a6040826102f1565b6012815260208101907120baba37b6b0ba34b7b722bc32b1baba37b960711b82526040519161008a6040846102f1565b600183526020830191601960f91b835260016000556100a88161033e565b610120526100b584610502565b61014052519020918260e05251902080610100524660a0526040519060208201927f8b73c3c69bb8fe3d512ecc4cf759cc79239f7b179b0ffacaa9a75d522b39400f8452604083015260608201524660808201523060a082015260a0815261011e60c0826102f1565b5190206080523060c0526001600160a01b031680156102d657600380546001600160a01b031981168317909155604051939082906001600160a01b03167f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e0600080a36001600160a01b03169182156102c5576001600160a01b03169081156102c55761016092909252600a80546001600160b01b0319168217607d60a01b1761ffff60b01b1916601960b01b1790556611c37937e08000600b556000828152600860209081526040909120805460ff1916600190811790915584527ffc218f700eca8d3f8834187c973fff1cd7abf19039dbd4751c024df57d7385f993606093917f4b36b2e66f38ed349bec532105790177f1283bcbc094e6cd48565195d3033c4391a261ffff600a54604051928352818160a01c16602084015260b01c166040820152a16040516124d790816106a1823960805181611fc8015260a05181612085015260c05181611f92015260e051816120170152610100518161203d015261012051816114f30152610140518161151d01526101605181818161080d0152611a280152f35b63d92e233d60e01b60005260046000fd5b631e4fbdf760e01b600052600060045260246000fd5b600080fd5b601f909101601f19168101906001600160401b0382119082101761031457604052565b634e487b7160e01b600052604160045260246000fd5b51906001600160a01b03821682036102ec57565b908151602081106000146103d6575090601f81511161037a57602081519101516020821061036a571790565b6000198260200360031b1b161790565b6040519063305a27a960e01b8252602060048301528181519182602483015260005b8381106103be5750508160006044809484010152601f80199101168101030190fd5b6020828201810151604487840101528593500161039c565b6001600160401b03811161031457600154600181811c911680156104f8575b60208210146104e257601f81116104ac575b50602092601f8211600114610447579281929360009261043c575b50508160011b916000199060031b1c19161760015560ff90565b015190503880610422565b601f198216936001600052806000209160005b868110610494575083600195961061047b575b505050811b0160015560ff90565b015160001960f88460031b161c1916905538808061046d565b9192602060018192868501518155019401920161045a565b6001600052601f6020600020910160051c810190601f830160051c015b8181106104d65750610407565b600081556001016104c9565b634e487b7160e01b600052602260045260246000fd5b90607f16906103f5565b9081516020811060001461058a575090601f81511161052e57602081519101516020821061036a571790565b6040519063305a27a960e01b8252602060048301528181519182602483015260005b8381106105725750508160006044809484010152601f80199101168101030190fd5b60208282018101516044878401015285935001610550565b6001600160401b03811161031457600254600181811c91168015610696575b60208210146104e257601f8111610660575b50602092601f82116001146105fb57928192936000926105f0575b50508160011b916000199060031b1c19161760025560ff90565b0151905038806105d6565b601f198216936002600052806000209160005b868110610648575083600195961061062f575b505050811b0160025560ff90565b015160001960f88460031b161c19169055388080610621565b9192602060018192868501518155019401920161060e565b6002600052601f6020600020910160051c810190601f830160051c015b81811061068a57506105bb565b6000815560010161067d565b90607f16906105a956fe6080604052600436101561001b575b361561001957600080fd5b005b6000803560e01c806301e3366714611c4a57806322dcd13e14611c25578063240e10dc14611bf95780632412e79214611bab578063269d5c6014611b8657806329e295c514611b4757806329fc455914611a7557806337efd3b814611a575780633fc8cef314611a12578063445315eb146118f75780634636903d1461181c5780634782f779146117b157806361a552dc1461178e5780636b63846b1461171557806371013c1014611696578063715018a61461163957806376cad834146115d557806384b0196e146114d95780638d01513c146114bd5780638da5cb5b1461149457806390193b7c1461146e578063a33cca3b1461142b578063a831e1cd1461140f578063b03bc29514611331578063b4f2056414610396578063c09b0b50146103ff578063d4f0dd3d146103e3578063d5dd2cfa14610396578063eb13554f1461036d578063ecd24a821461032e578063ecd8dc3a14610294578063f2fde38b1461020b578063f698da25146101e85763ffd2f1f61461019d575061000e565b346101e55760403660031901126101e55760209060ff906040906001600160a01b036101c7611c9f565b16815260068452818120602435825284522054166040519015158152f35b80fd5b50346101e557806003193601126101e5576020610203611f8f565b604051908152f35b50346101e55760203660031901126101e557610225611c9f565b61022d611ec3565b6001600160a01b0316801561028057600380546001600160a01b0319811683179091556001600160a01b03167f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e08380a380f35b631e4fbdf760e01b82526004829052602482fd5b50346101e55760403660031901126101e5576102ae611c9f565b6102b6611cb5565b906102bf611ec3565b6001600160a01b031690811561031f5760207f4b36b2e66f38ed349bec532105790177f1283bcbc094e6cd48565195d3033c43918385526008825261031381604087209060ff801983541691151516179055565b6040519015158152a280f35b63d92e233d60e01b8352600483fd5b50346101e55760203660031901126101e55760209060ff906040906001600160a01b03610359611c9f565b168152600984522054166040519015158152f35b50346101e557806003193601126101e557600a546040516001600160a01b039091168152602090f35b50346101e55760403660031901126101e5576020906001600160401b03906040906001600160a01b036103c7611c9f565b1681526005845281812060243582528452205416604051908152f35b50346101e557806003193601126101e557602060405160c88152f35b5060203660031901126101e5576001600160401b03600435116101e5576004353603610220600319820112610c02576002825414611322576002825560ff6007541661131357338252600860205260ff60408320541615611304576001600160a01b03610470600435602401611d65565b16825260066020526040822060043560040135835260205260ff6040832054166112f55760043561016401359060221901811215610c02576001600160401b03600482813501013511610c025760048181350101353603602482600435010113610c02576104e2602460043501611d65565b906104f1604460043501611d65565b9183610501606460043501611d65565b9261059f61051360c460043501611d79565b9461052260e460043501611d79565b94610597610104600435019861058961053a8b611d79565b99610124600435019a61054c8c611d88565b90610144600435019b61055e8d611d88565b93604051988997602089019b8c9160a460043501359360846004350135936004356004013590611d9c565b03601f198101835282611e34565b519020611f2a565b6105af6004838135010135611e6b565b906105bd6040519283611e34565b60048035840190810135808452369101602401116112865761060a936020600485816106019781350101356024828435010184880137813501013584010152612354565b90929192612390565b6001600160a01b03610620600435602401611d65565b166001600160a01b03909116036112e6576106426001600160401b0391611d88565b1642116112d75761065290611d88565b6001600160a01b03610668600435602401611d65565b1683526005602052604083206004356004013584526020526001600160401b03806040852054169116106112c8576001600160a01b036106ac600435604401611d65565b1682526009602052604082205460ff16156112ac576004356101e4016001600160a01b036106d982611d65565b161561129d576001600160a01b03906106f190611d65565b165b60405163597e1fb560e01b81526001600160a01b03919091169190602081600481865afa908115611292578491611253575b5061124457600a5461ffff61073e60e460043501611d79565b1661ffff8260a01c1611611235579061ffff809260b01c16908261076182611d79565b16821161122657505b169081151580611208575b6111f957610204600435013591600b5483116111ea576001600160a01b036107a1600435602401611d65565b168452600460205260408420600435600401358552602052604084205461018460043501906107cf82611eb6565b15610e1c576101a46004350135906107e78683611f82565b93608460043501358511610e0d5760a460043501356108068684611f82565b11610dfe577f00000000000000000000000000000000000000000000000000000000000000006001600160a01b03166108776020610848600435602401611d65565b604051636eb1769f60e11b81526001600160a01b03909116600482015230602482015291829081906044820190565b0381855afa8015610d0f5787918b91610dc9575b5010610dba5788906108ac87306108a6602460043501611d65565b84612310565b803b15610c0257818091602460405180948193632e1a7d4d60e01b83528c60048401525af18015610bf757610da1575b505086610d7c575b600a548861091d61271061090b8161090361ffff8760a01c168a611f6f565b049588611f6f565b04936109178582611d05565b96611d05565b918580610d55575b50505081610d1a575b60405195637544c85960e11b87528160048801526040876024818b5afa968715610d0f578a97610cdb575b506101c4600435013596878110610ccc578a9080610c82575b50878111610c7a575b50604051637e062a3560e11b81528a906020816004818d5afa908115610bf7578291610c4b575b506040516370a0823160e01b81523060048201526001600160a01b0391909116939092602084602481885afa938415610c40578394610c06575b506109e79087611f82565b6001600160a01b036109fd600435602401611d65565b1683526004602052604083206004356004013584526020526040832055893b15610c0257818a600460405180948193639598747560e01b83525af18015610bf757610bde575b50506040516370a0823160e01b815230600482015290602082602481865afa8015610bd3578b90610b9a575b610a799250611d05565b958610610b8b5785610a9991610a93602460043501611d65565b90611eec565b9193955b6001600160a01b03610ab3600435602401611d65565b168852600460205260408820600435600401358952602052604088205492610ae8610ae2602460043501611d65565b95611eb6565b9560405196151587526101a4600435013560208801528860408801526060870152608086015260a085015260c084015260e083015260018060a01b0316907fc5ee5180faa1ee306746d2ee2d0f9f0c7eff4a1e28ed0c6da7de68da71f330f06101006004356004013592a434610b67575b600160209255604051908152f35b8180808034335af1610b77611e86565b50610b59576312171d8360e31b8252600482fd5b638199f5f360e01b8952600489fd5b506020823d602011610bcb575b81610bb460209383611e34565b81010312610bc657610a799151610a6f565b600080fd5b3d9150610ba7565b6040513d8d823e3d90fd5b81610be891611e34565b610bf3578938610a43565b8980fd5b6040513d84823e3d90fd5b5080fd5b925092506020823d602011610c38575b81610c2360209383611e34565b81010312610bc6576109e78c925193906109dc565b3d9150610c16565b6040513d85823e3d90fd5b610c6d915060203d602011610c73575b610c658183611e34565b810190611f50565b386109a2565b503d610c5b565b96503861097b565b905061ffff610c9560c460043501611d79565b1661271003906127108211610cb85761271091610cb191611f6f565b0438610972565b634e487b7160e01b8c52601160045260248cfd5b638199f5f360e01b8b5260048bfd5b9096506040813d604011610d07575b81610cf760409383611e34565b81010312610bf357519538610959565b3d9150610cea565b6040513d8c823e3d90fd5b88808080856001600160a01b03610d35600435606401611d65565b165af1610d40611e86565b5061092e575b6312171d8360e31b8952600489fd5b8291829182916001600160a01b03165af1610d6e611e86565b5015610d4657883885610925565b878080808a335af1610d8c611e86565b506108e4575b6312171d8360e31b8852600488fd5b81610dab91611e34565b610db65787386108dc565b8780fd5b6308e4216160e31b8952600489fd5b9150506020813d602011610df6575b81610de560209383611e34565b81010312610bc6578690513861088b565b3d9150610dd8565b63fa2bfd8360e01b8852600488fd5b637ed21b9d60e11b8852600488fd5b6101a4600435013590604051637e062a3560e11b8152602081600481895afa9081156111df5788916111c0575b506001600160a01b031691610e676020610848600435602401611d65565b0381875afa801561108d5782918a9161118b575b501061117c57604051634693bb3760e01b815260048101829052926020846024818a5afa93841561108d578994611148575b508893806110fc575b50610eca82306108a6602460043501611d65565b60405163095ea7b360e01b60208083019182526001600160a01b038a16602484015260448084018690528352908b90610f04606485611e34565b83519082865af18a513d826110e0575b50501561109c575b50504790863b1561109857604051906372424d9960e11b825260048201528881602481838b5af1801561108d57611077575b50610f599047611d05565b91821061106857600a5493610f8887610f8361271061090b8161090361ffff8c60a01c168a611f6f565b611d05565b946101c460043501358610610b8b5788908480611041575b50505080611007575b86610fe3575b87808080886001600160a01b03610fca600435602401611d65565b165af1610fd5611e86565b5015610d9257919395610a9d565b878080808a335af1610ff3611e86565b50610faf576312171d8360e31b8852600488fd5b87808080846001600160a01b03611022600435606401611d65565b165af161102d611e86565b50610fa9576312171d8360e31b8852600488fd5b8291829182916001600160a01b03165af161105a611e86565b5015610d9257873884610fa0565b638199f5f360e01b8752600487fd5b9761108681610f59939a611e34565b9790610f4e565b6040513d8b823e3d90fd5b8880fd5b6110d9916110d460405163095ea7b360e01b60208201528a60248201528c6044820152604481526110ce606482611e34565b826120ab565b6120ab565b3880610f1c565b9091506110f45750813b15155b3880610f14565b6001146110ed565b90935061ffff61111060c460043501611d79565b1661271003906127108211611134576127109161112c91611f6f565b049238610eb6565b634e487b7160e01b8a52601160045260248afd5b9093506020813d602011611174575b8161116460209383611e34565b8101031261109857519238610ead565b3d9150611157565b63a085b77b60e01b8852600488fd5b9150506020813d6020116111b8575b816111a760209383611e34565b810103126110985781905138610e7b565b3d915061119a565b6111d9915060203d602011610c7357610c658183611e34565b38610e49565b6040513d8a823e3d90fd5b63dbb4b05360e01b8452600484fd5b6372b653ab60e11b8352600483fd5b506001600160a01b0361121f600435606401611d65565b1615610775565b6112309150611d79565b61076a565b6329270b4160e11b8452600484fd5b63210b9e2d60e01b8352600483fd5b90506020813d60201161128a575b8161126e60209383611e34565b81010312611286575180151581036112865738610725565b8380fd5b3d9150611261565b6040513d86823e3d90fd5b636c2d501760e11b8352600483fd5b6001600160a01b036112c2600435604401611d65565b166106f3565b633ab3447f60e11b8252600482fd5b63e64c17a160e01b8352600483fd5b638baa579f60e01b8452600484fd5b634e70989960e11b8252600482fd5b630bfd903360e11b8252600482fd5b63068f1cbb60e31b8252600482fd5b633ee5aeb560e01b8252600482fd5b50346101e55760203660031901126101e5576004353382526005602052604082208183526020526001600160401b036040832054169060018201906001600160401b0382116113fb577f4cad2741d132794d9ef1ff3c383b7ff44326c0bad8e5d2aeeff6b657df39c881916113f591338652600560205260408620908652602052604085206001600160401b0382166001600160401b03198254161790556040519182913395839092916001600160401b0360209181604085019616845216910152565b0390a280f35b634e487b7160e01b84526011600452602484fd5b50346101e557806003193601126101e5576020604051604b8152f35b50346101e55760403660031901126101e5576020906040906001600160a01b03611453611c9f565b16815260048352818120602435825283522054604051908152f35b50346101e55760203660031901126101e55760209061148b611c9f565b50604051908152f35b50346101e557806003193601126101e5576003546040516001600160a01b039091168152602090f35b50346101e557806003193601126101e5576020604051607d8152f35b50346101e557806003193601126101e557611579906115177f0000000000000000000000000000000000000000000000000000000000000000612112565b906115417f000000000000000000000000000000000000000000000000000000000000000061223e565b906020611587604051936115558386611e34565b83855283368137604051968796600f60f81b885260e08589015260e0880190611cc4565b908682036040880152611cc4565b904660608601523060808601528260a086015284820360c08601528080855193848152019401925b8281106115be57505050500390f35b8351855286955093810193928101926001016115af565b50346101e55760203660031901126101e557600435801515809103610c025760207f256bf8e8b40cbfb88946b4d95d17bf45cb52d93ba9d2f767df67c6c15f0253f791611620611ec3565b60ff196007541660ff821617600755604051908152a180f35b50346101e557806003193601126101e557611652611ec3565b600380546001600160a01b0319811690915581906001600160a01b03167f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e08280a380f35b50346101e55760403660031901126101e5576116b0611c9f565b6116b8611cb5565b906116c1611ec3565b6001600160a01b031690811561031f5760207f309e49506b5bfa680b6edfbee91c1314f386b28cfb0cb8d2980bab7af0ef4927918385526009825261031381604087209060ff801983541691151516179055565b50346101e55760403660031901126101e557600435611732611cb5565b33835260066020526040832082845260205261175d81604085209060ff801983541691151516179055565b60405190151581527f6e0bc5b67e21dcfe45042e437c45920631d9aff7285f40fc895fbca6350a055660203392a380f35b50346101e557806003193601126101e557602060ff600754166040519015158152f35b50346101e55760403660031901126101e5576117cb611c9f565b6117d3611ec3565b6001600160a01b0316801561180d578180808093602435905af16117f5611e86565b50156117fe5780f35b6312171d8360e31b8152600490fd5b63d92e233d60e01b8252600482fd5b50346101e5576101603660031901126101e5576024356001600160a01b0381168103610c02576044356001600160a01b03811681036118f357606435926001600160a01b03841684036101e55760c43561ffff81168103610c025760e43561ffff811681036118f357610104359061ffff821682036112865761012435926001600160401b03841684036118ef5761014435946001600160401b03861686036101e55760206102038a8a6105978b6105898c8c8c8c8c6040519889978d89019b8c9160a435936084359360043590611d9c565b8480fd5b8280fd5b50346101e55760603660031901126101e557611911611c9f565b6024359061ffff82168083036112865760443561ffff811692838203611a0e57611939611ec3565b6001600160a01b03169384156119ff57607d83116119dc57604b84116119dc5783830161ffff81116119eb5761ffff60c89116116119dc57916060939185937ffc218f700eca8d3f8834187c973fff1cd7abf19039dbd4751c024df57d7385f996600a549261ffff60b01b9060b01b16926001600160401b0360c01b16179061ffff60a01b9060a01b161717600a5560405192835260208301526040820152a180f35b63179381e360e31b8652600486fd5b634e487b7160e01b87526011600452602487fd5b63d92e233d60e01b8652600486fd5b8580fd5b50346101e557806003193601126101e5576040517f00000000000000000000000000000000000000000000000000000000000000006001600160a01b03168152602090f35b50346101e557806003193601126101e5576020600b54604051908152f35b50346101e55760403660031901126101e5576004356001600160401b0381168082036118f3576024353384526005602052604084208185526020526001600160401b0360408520541692838311611aca578480f35b7f4cad2741d132794d9ef1ff3c383b7ff44326c0bad8e5d2aeeff6b657df39c88192611b3c9233875260056020526040872090875260205260408620906001600160401b03198254161790556040519182913395839092916001600160401b0360209181604085019616845216910152565b0390a2388080808480f35b50346101e55760203660031901126101e55760209060ff906040906001600160a01b03611b72611c9f565b168152600884522054166040519015158152f35b50346101e557806003193601126101e557602061ffff600a5460b01c16604051908152f35b50346101e55760203660031901126101e5577ffe4854088567f60c35f5ea9e20d26d58526113bdd746d51c5336b351cbd84bda6020600435611beb611ec3565b80600b55604051908152a180f35b50346101e55760603660031901126101e5576020610203611c18611c9f565b6044359060243590611d28565b50346101e557806003193601126101e557602061ffff600a5460a01c16604051908152f35b50346101e55760603660031901126101e557611c64611c9f565b6024356001600160a01b03811680820361128657611c80611ec3565b1561031f57611c9c9160443591906001600160a01b0316611eec565b80f35b600435906001600160a01b0382168203610bc657565b602435908115158203610bc657565b919082519283825260005b848110611cf0575050826000602080949584010152601f8019910116010190565b80602080928401015182828601015201611ccf565b91908203918211611d1257565b634e487b7160e01b600052601160045260246000fd5b60018060a01b0316600052600460205260406000209060005260205260406000205481811015611d5e57611d5b91611d05565b90565b5050600090565b356001600160a01b0381168103610bc65790565b3561ffff81168103610bc65790565b356001600160401b0381168103610bc65790565b7fd4aabb10d908e9304108999ab5cfbb23f3c5c0a641ad76aeafb50b77aceaeccf815260208101919091526001600160a01b0391821660408201529181166060830152909116608082015260a081019190915260c081019190915261ffff91821660e08201529181166101008301529091166101208201526001600160401b0391821661014082015291166101608201526101800190565b90601f801991011681019081106001600160401b03821117611e5557604052565b634e487b7160e01b600052604160045260246000fd5b6001600160401b038111611e5557601f01601f191660200190565b3d15611eb1573d90611e9782611e6b565b91611ea56040519384611e34565b82523d6000602084013e565b606090565b358015158103610bc65790565b6003546001600160a01b03163303611ed757565b63118cdaa760e01b6000523360045260246000fd5b60405163a9059cbb60e01b60208201526001600160a01b03929092166024830152604480830193909352918152611f28916110d4606483611e34565b565b604290611f35611f8f565b906040519161190160f01b8352600283015260228201522090565b90816020910312610bc657516001600160a01b0381168103610bc65790565b81810292918115918404141715611d1257565b91908201809211611d1257565b307f00000000000000000000000000000000000000000000000000000000000000006001600160a01b03161480612082575b15611fea577f000000000000000000000000000000000000000000000000000000000000000090565b60405160208101907f8b73c3c69bb8fe3d512ecc4cf759cc79239f7b179b0ffacaa9a75d522b39400f82527f000000000000000000000000000000000000000000000000000000000000000060408201527f000000000000000000000000000000000000000000000000000000000000000060608201524660808201523060a082015260a0815261207c60c082611e34565b51902090565b507f00000000000000000000000000000000000000000000000000000000000000004614611fc1565b906000602091828151910182855af115612106576000513d6120fd57506001600160a01b0381163b155b6120dc5750565b635274afe760e01b60009081526001600160a01b0391909116600452602490fd5b600114156120d5565b6040513d6000823e3d90fd5b60ff811461215c5760ff811690601f821161214b5760408051926121368285611e34565b6020808552840191601f190136833783525290565b632cd44ac360e21b60005260046000fd5b506040516000600154908160011c91600181168015612234575b60208410811461222057838552849291811561220157506001146121a1575b611d5b92500382611e34565b506001600090815290917fb10e2d527612073b26eecdfd717e6a320cf44b4afac2b0732d9fcbe2b7fa0cf65b8183106121e5575050906020611d5b92820101612195565b60209193508060019154838588010152019101909183926121cd565b60209250611d5b94915060ff191682840152151560051b820101612195565b634e487b7160e01b83526022600452602483fd5b92607f1692612176565b60ff81146122625760ff811690601f821161214b5760408051926121368285611e34565b506040516000600254908160011c91600181168015612306575b60208410811461222057838552849291811561220157506001146122a657611d5b92500382611e34565b506002600090815290917f405787fa12a823e0f2b7631cc41b3ba8828b3321ca811111fa75cd3aa3bb5ace5b8183106122ea575050906020611d5b92820101612195565b60209193508060019154838588010152019101909183926122d2565b92607f169261227c565b6040516323b872dd60e01b60208201526001600160a01b039283166024820152929091166044830152606480830193909352918152611f28916110d4608483611e34565b81519190604183036123855761237e92506020820151906060604084015193015160001a90612418565b9192909190565b505060009160029190565b919091600481101561240257806123a657509050565b6000600182036123c15763f645eedf60e01b60005260046000fd5b50600281036123df578263fce698f760e01b60005260045260246000fd5b90916003600092146123ef575050565b6335e2f38360e21b825260045260249150fd5b634e487b7160e01b600052602160045260246000fd5b91907f7fffffffffffffffffffffffffffffff5d576e7357a4501ddfe92f46681b20a08411612495579160209360809260ff60009560405194855216868401526040830152606082015282805260015afa15612106576000516001600160a01b038116156124895790600090600090565b50600090600190600090565b5050506000916003919056fea26469706673582212203ef9e442ca0bd6376be7813b64f9f3821a2de4434de060380a24e17191e4e06964736f6c634300081c0033000000000000000000000000e7c69f26344dcb5862f829cedd1b518671b15e28000000000000000000000000c02aaa39b223fe8d0a0e5c4f27ead9083c756cc20000000000000000000000003fc9ab11ed43ce6142fbe5519301a1953c040306

0x6080604052600436101561001b575b361561001957600080fd5b005b6000803560e01c806301e3366714611c4a57806322dcd13e14611c25578063240e10dc14611bf95780632412e79214611bab578063269d5c6014611b8657806329e295c514611b4757806329fc455914611a7557806337efd3b814611a575780633fc8cef314611a12578063445315eb146118f75780634636903d1461181c5780634782f779146117b157806361a552dc1461178e5780636b63846b1461171557806371013c1014611696578063715018a61461163957806376cad834146115d557806384b0196e146114d95780638d01513c146114bd5780638da5cb5b1461149457806390193b7c1461146e578063a33cca3b1461142b578063a831e1cd1461140f578063b03bc29514611331578063b4f2056414610396578063c09b0b50146103ff578063d4f0dd3d146103e3578063d5dd2cfa14610396578063eb13554f1461036d578063ecd24a821461032e578063ecd8dc3a14610294578063f2fde38b1461020b578063f698da25146101e85763ffd2f1f61461019d575061000e565b346101e55760403660031901126101e55760209060ff906040906001600160a01b036101c7611c9f565b16815260068452818120602435825284522054166040519015158152f35b80fd5b50346101e557806003193601126101e5576020610203611f8f565b604051908152f35b50346101e55760203660031901126101e557610225611c9f565b61022d611ec3565b6001600160a01b0316801561028057600380546001600160a01b0319811683179091556001600160a01b03167f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e08380a380f35b631e4fbdf760e01b82526004829052602482fd5b50346101e55760403660031901126101e5576102ae611c9f565b6102b6611cb5565b906102bf611ec3565b6001600160a01b031690811561031f5760207f4b36b2e66f38ed349bec532105790177f1283bcbc094e6cd48565195d3033c43918385526008825261031381604087209060ff801983541691151516179055565b6040519015158152a280f35b63d92e233d60e01b8352600483fd5b50346101e55760203660031901126101e55760209060ff906040906001600160a01b03610359611c9f565b168152600984522054166040519015158152f35b50346101e557806003193601126101e557600a546040516001600160a01b039091168152602090f35b50346101e55760403660031901126101e5576020906001600160401b03906040906001600160a01b036103c7611c9f565b1681526005845281812060243582528452205416604051908152f35b50346101e557806003193601126101e557602060405160c88152f35b5060203660031901126101e5576001600160401b03600435116101e5576004353603610220600319820112610c02576002825414611322576002825560ff6007541661131357338252600860205260ff60408320541615611304576001600160a01b03610470600435602401611d65565b16825260066020526040822060043560040135835260205260ff6040832054166112f55760043561016401359060221901811215610c02576001600160401b03600482813501013511610c025760048181350101353603602482600435010113610c02576104e2602460043501611d65565b906104f1604460043501611d65565b9183610501606460043501611d65565b9261059f61051360c460043501611d79565b9461052260e460043501611d79565b94610597610104600435019861058961053a8b611d79565b99610124600435019a61054c8c611d88565b90610144600435019b61055e8d611d88565b93604051988997602089019b8c9160a460043501359360846004350135936004356004013590611d9c565b03601f198101835282611e34565b519020611f2a565b6105af6004838135010135611e6b565b906105bd6040519283611e34565b60048035840190810135808452369101602401116112865761060a936020600485816106019781350101356024828435010184880137813501013584010152612354565b90929192612390565b6001600160a01b03610620600435602401611d65565b166001600160a01b03909116036112e6576106426001600160401b0391611d88565b1642116112d75761065290611d88565b6001600160a01b03610668600435602401611d65565b1683526005602052604083206004356004013584526020526001600160401b03806040852054169116106112c8576001600160a01b036106ac600435604401611d65565b1682526009602052604082205460ff16156112ac576004356101e4016001600160a01b036106d982611d65565b161561129d576001600160a01b03906106f190611d65565b165b60405163597e1fb560e01b81526001600160a01b03919091169190602081600481865afa908115611292578491611253575b5061124457600a5461ffff61073e60e460043501611d79565b1661ffff8260a01c1611611235579061ffff809260b01c16908261076182611d79565b16821161122657505b169081151580611208575b6111f957610204600435013591600b5483116111ea576001600160a01b036107a1600435602401611d65565b168452600460205260408420600435600401358552602052604084205461018460043501906107cf82611eb6565b15610e1c576101a46004350135906107e78683611f82565b93608460043501358511610e0d5760a460043501356108068684611f82565b11610dfe577f000000000000000000000000c02aaa39b223fe8d0a0e5c4f27ead9083c756cc26001600160a01b03166108776020610848600435602401611d65565b604051636eb1769f60e11b81526001600160a01b03909116600482015230602482015291829081906044820190565b0381855afa8015610d0f5787918b91610dc9575b5010610dba5788906108ac87306108a6602460043501611d65565b84612310565b803b15610c0257818091602460405180948193632e1a7d4d60e01b83528c60048401525af18015610bf757610da1575b505086610d7c575b600a548861091d61271061090b8161090361ffff8760a01c168a611f6f565b049588611f6f565b04936109178582611d05565b96611d05565b918580610d55575b50505081610d1a575b60405195637544c85960e11b87528160048801526040876024818b5afa968715610d0f578a97610cdb575b506101c4600435013596878110610ccc578a9080610c82575b50878111610c7a575b50604051637e062a3560e11b81528a906020816004818d5afa908115610bf7578291610c4b575b506040516370a0823160e01b81523060048201526001600160a01b0391909116939092602084602481885afa938415610c40578394610c06575b506109e79087611f82565b6001600160a01b036109fd600435602401611d65565b1683526004602052604083206004356004013584526020526040832055893b15610c0257818a600460405180948193639598747560e01b83525af18015610bf757610bde575b50506040516370a0823160e01b815230600482015290602082602481865afa8015610bd3578b90610b9a575b610a799250611d05565b958610610b8b5785610a9991610a93602460043501611d65565b90611eec565b9193955b6001600160a01b03610ab3600435602401611d65565b168852600460205260408820600435600401358952602052604088205492610ae8610ae2602460043501611d65565b95611eb6565b9560405196151587526101a4600435013560208801528860408801526060870152608086015260a085015260c084015260e083015260018060a01b0316907fc5ee5180faa1ee306746d2ee2d0f9f0c7eff4a1e28ed0c6da7de68da71f330f06101006004356004013592a434610b67575b600160209255604051908152f35b8180808034335af1610b77611e86565b50610b59576312171d8360e31b8252600482fd5b638199f5f360e01b8952600489fd5b506020823d602011610bcb575b81610bb460209383611e34565b81010312610bc657610a799151610a6f565b600080fd5b3d9150610ba7565b6040513d8d823e3d90fd5b81610be891611e34565b610bf3578938610a43565b8980fd5b6040513d84823e3d90fd5b5080fd5b925092506020823d602011610c38575b81610c2360209383611e34565b81010312610bc6576109e78c925193906109dc565b3d9150610c16565b6040513d85823e3d90fd5b610c6d915060203d602011610c73575b610c658183611e34565b810190611f50565b386109a2565b503d610c5b565b96503861097b565b905061ffff610c9560c460043501611d79565b1661271003906127108211610cb85761271091610cb191611f6f565b0438610972565b634e487b7160e01b8c52601160045260248cfd5b638199f5f360e01b8b5260048bfd5b9096506040813d604011610d07575b81610cf760409383611e34565b81010312610bf357519538610959565b3d9150610cea565b6040513d8c823e3d90fd5b88808080856001600160a01b03610d35600435606401611d65565b165af1610d40611e86565b5061092e575b6312171d8360e31b8952600489fd5b8291829182916001600160a01b03165af1610d6e611e86565b5015610d4657883885610925565b878080808a335af1610d8c611e86565b506108e4575b6312171d8360e31b8852600488fd5b81610dab91611e34565b610db65787386108dc565b8780fd5b6308e4216160e31b8952600489fd5b9150506020813d602011610df6575b81610de560209383611e34565b81010312610bc6578690513861088b565b3d9150610dd8565b63fa2bfd8360e01b8852600488fd5b637ed21b9d60e11b8852600488fd5b6101a4600435013590604051637e062a3560e11b8152602081600481895afa9081156111df5788916111c0575b506001600160a01b031691610e676020610848600435602401611d65565b0381875afa801561108d5782918a9161118b575b501061117c57604051634693bb3760e01b815260048101829052926020846024818a5afa93841561108d578994611148575b508893806110fc575b50610eca82306108a6602460043501611d65565b60405163095ea7b360e01b60208083019182526001600160a01b038a16602484015260448084018690528352908b90610f04606485611e34565b83519082865af18a513d826110e0575b50501561109c575b50504790863b1561109857604051906372424d9960e11b825260048201528881602481838b5af1801561108d57611077575b50610f599047611d05565b91821061106857600a5493610f8887610f8361271061090b8161090361ffff8c60a01c168a611f6f565b611d05565b946101c460043501358610610b8b5788908480611041575b50505080611007575b86610fe3575b87808080886001600160a01b03610fca600435602401611d65565b165af1610fd5611e86565b5015610d9257919395610a9d565b878080808a335af1610ff3611e86565b50610faf576312171d8360e31b8852600488fd5b87808080846001600160a01b03611022600435606401611d65565b165af161102d611e86565b50610fa9576312171d8360e31b8852600488fd5b8291829182916001600160a01b03165af161105a611e86565b5015610d9257873884610fa0565b638199f5f360e01b8752600487fd5b9761108681610f59939a611e34565b9790610f4e565b6040513d8b823e3d90fd5b8880fd5b6110d9916110d460405163095ea7b360e01b60208201528a60248201528c6044820152604481526110ce606482611e34565b826120ab565b6120ab565b3880610f1c565b9091506110f45750813b15155b3880610f14565b6001146110ed565b90935061ffff61111060c460043501611d79565b1661271003906127108211611134576127109161112c91611f6f565b049238610eb6565b634e487b7160e01b8a52601160045260248afd5b9093506020813d602011611174575b8161116460209383611e34565b8101031261109857519238610ead565b3d9150611157565b63a085b77b60e01b8852600488fd5b9150506020813d6020116111b8575b816111a760209383611e34565b810103126110985781905138610e7b565b3d915061119a565b6111d9915060203d602011610c7357610c658183611e34565b38610e49565b6040513d8a823e3d90fd5b63dbb4b05360e01b8452600484fd5b6372b653ab60e11b8352600483fd5b506001600160a01b0361121f600435606401611d65565b1615610775565b6112309150611d79565b61076a565b6329270b4160e11b8452600484fd5b63210b9e2d60e01b8352600483fd5b90506020813d60201161128a575b8161126e60209383611e34565b81010312611286575180151581036112865738610725565b8380fd5b3d9150611261565b6040513d86823e3d90fd5b636c2d501760e11b8352600483fd5b6001600160a01b036112c2600435604401611d65565b166106f3565b633ab3447f60e11b8252600482fd5b63e64c17a160e01b8352600483fd5b638baa579f60e01b8452600484fd5b634e70989960e11b8252600482fd5b630bfd903360e11b8252600482fd5b63068f1cbb60e31b8252600482fd5b633ee5aeb560e01b8252600482fd5b50346101e55760203660031901126101e5576004353382526005602052604082208183526020526001600160401b036040832054169060018201906001600160401b0382116113fb577f4cad2741d132794d9ef1ff3c383b7ff44326c0bad8e5d2aeeff6b657df39c881916113f591338652600560205260408620908652602052604085206001600160401b0382166001600160401b03198254161790556040519182913395839092916001600160401b0360209181604085019616845216910152565b0390a280f35b634e487b7160e01b84526011600452602484fd5b50346101e557806003193601126101e5576020604051604b8152f35b50346101e55760403660031901126101e5576020906040906001600160a01b03611453611c9f565b16815260048352818120602435825283522054604051908152f35b50346101e55760203660031901126101e55760209061148b611c9f565b50604051908152f35b50346101e557806003193601126101e5576003546040516001600160a01b039091168152602090f35b50346101e557806003193601126101e5576020604051607d8152f35b50346101e557806003193601126101e557611579906115177f4175746f6d6174696f6e4578656375746f720000000000000000000000000012612112565b906115417f320000000000000000000000000000000000000000000000000000000000000161223e565b906020611587604051936115558386611e34565b83855283368137604051968796600f60f81b885260e08589015260e0880190611cc4565b908682036040880152611cc4565b904660608601523060808601528260a086015284820360c08601528080855193848152019401925b8281106115be57505050500390f35b8351855286955093810193928101926001016115af565b50346101e55760203660031901126101e557600435801515809103610c025760207f256bf8e8b40cbfb88946b4d95d17bf45cb52d93ba9d2f767df67c6c15f0253f791611620611ec3565b60ff196007541660ff821617600755604051908152a180f35b50346101e557806003193601126101e557611652611ec3565b600380546001600160a01b0319811690915581906001600160a01b03167f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e08280a380f35b50346101e55760403660031901126101e5576116b0611c9f565b6116b8611cb5565b906116c1611ec3565b6001600160a01b031690811561031f5760207f309e49506b5bfa680b6edfbee91c1314f386b28cfb0cb8d2980bab7af0ef4927918385526009825261031381604087209060ff801983541691151516179055565b50346101e55760403660031901126101e557600435611732611cb5565b33835260066020526040832082845260205261175d81604085209060ff801983541691151516179055565b60405190151581527f6e0bc5b67e21dcfe45042e437c45920631d9aff7285f40fc895fbca6350a055660203392a380f35b50346101e557806003193601126101e557602060ff600754166040519015158152f35b50346101e55760403660031901126101e5576117cb611c9f565b6117d3611ec3565b6001600160a01b0316801561180d578180808093602435905af16117f5611e86565b50156117fe5780f35b6312171d8360e31b8152600490fd5b63d92e233d60e01b8252600482fd5b50346101e5576101603660031901126101e5576024356001600160a01b0381168103610c02576044356001600160a01b03811681036118f357606435926001600160a01b03841684036101e55760c43561ffff81168103610c025760e43561ffff811681036118f357610104359061ffff821682036112865761012435926001600160401b03841684036118ef5761014435946001600160401b03861686036101e55760206102038a8a6105978b6105898c8c8c8c8c6040519889978d89019b8c9160a435936084359360043590611d9c565b8480fd5b8280fd5b50346101e55760603660031901126101e557611911611c9f565b6024359061ffff82168083036112865760443561ffff811692838203611a0e57611939611ec3565b6001600160a01b03169384156119ff57607d83116119dc57604b84116119dc5783830161ffff81116119eb5761ffff60c89116116119dc57916060939185937ffc218f700eca8d3f8834187c973fff1cd7abf19039dbd4751c024df57d7385f996600a549261ffff60b01b9060b01b16926001600160401b0360c01b16179061ffff60a01b9060a01b161717600a5560405192835260208301526040820152a180f35b63179381e360e31b8652600486fd5b634e487b7160e01b87526011600452602487fd5b63d92e233d60e01b8652600486fd5b8580fd5b50346101e557806003193601126101e5576040517f000000000000000000000000c02aaa39b223fe8d0a0e5c4f27ead9083c756cc26001600160a01b03168152602090f35b50346101e557806003193601126101e5576020600b54604051908152f35b50346101e55760403660031901126101e5576004356001600160401b0381168082036118f3576024353384526005602052604084208185526020526001600160401b0360408520541692838311611aca578480f35b7f4cad2741d132794d9ef1ff3c383b7ff44326c0bad8e5d2aeeff6b657df39c88192611b3c9233875260056020526040872090875260205260408620906001600160401b03198254161790556040519182913395839092916001600160401b0360209181604085019616845216910152565b0390a2388080808480f35b50346101e55760203660031901126101e55760209060ff906040906001600160a01b03611b72611c9f565b168152600884522054166040519015158152f35b50346101e557806003193601126101e557602061ffff600a5460b01c16604051908152f35b50346101e55760203660031901126101e5577ffe4854088567f60c35f5ea9e20d26d58526113bdd746d51c5336b351cbd84bda6020600435611beb611ec3565b80600b55604051908152a180f35b50346101e55760603660031901126101e5576020610203611c18611c9f565b6044359060243590611d28565b50346101e557806003193601126101e557602061ffff600a5460a01c16604051908152f35b50346101e55760603660031901126101e557611c64611c9f565b6024356001600160a01b03811680820361128657611c80611ec3565b1561031f57611c9c9160443591906001600160a01b0316611eec565b80f35b600435906001600160a01b0382168203610bc657565b602435908115158203610bc657565b919082519283825260005b848110611cf0575050826000602080949584010152601f8019910116010190565b80602080928401015182828601015201611ccf565b91908203918211611d1257565b634e487b7160e01b600052601160045260246000fd5b60018060a01b0316600052600460205260406000209060005260205260406000205481811015611d5e57611d5b91611d05565b90565b5050600090565b356001600160a01b0381168103610bc65790565b3561ffff81168103610bc65790565b356001600160401b0381168103610bc65790565b7fd4aabb10d908e9304108999ab5cfbb23f3c5c0a641ad76aeafb50b77aceaeccf815260208101919091526001600160a01b0391821660408201529181166060830152909116608082015260a081019190915260c081019190915261ffff91821660e08201529181166101008301529091166101208201526001600160401b0391821661014082015291166101608201526101800190565b90601f801991011681019081106001600160401b03821117611e5557604052565b634e487b7160e01b600052604160045260246000fd5b6001600160401b038111611e5557601f01601f191660200190565b3d15611eb1573d90611e9782611e6b565b91611ea56040519384611e34565b82523d6000602084013e565b606090565b358015158103610bc65790565b6003546001600160a01b03163303611ed757565b63118cdaa760e01b6000523360045260246000fd5b60405163a9059cbb60e01b60208201526001600160a01b03929092166024830152604480830193909352918152611f28916110d4606483611e34565b565b604290611f35611f8f565b906040519161190160f01b8352600283015260228201522090565b90816020910312610bc657516001600160a01b0381168103610bc65790565b81810292918115918404141715611d1257565b91908201809211611d1257565b307f000000000000000000000000f31928cc83216e7e43be1e2ab4b9ef2df3cfcd2a6001600160a01b03161480612082575b15611fea577f27a58ca589c2cc0b0dc2842ff178acbeb90b706f01fe4161c2fcd559930bf9c890565b60405160208101907f8b73c3c69bb8fe3d512ecc4cf759cc79239f7b179b0ffacaa9a75d522b39400f82527f06223d6c742731fabf812d0bef1b161a1e9e32fe14028d4cda43b060a528d7f460408201527fad7c5bef027816a800da1736444fb58a807ef4c9603b7848673f7e3a68eb14a560608201524660808201523060a082015260a0815261207c60c082611e34565b51902090565b507f00000000000000000000000000000000000000000000000000000000000000014614611fc1565b906000602091828151910182855af115612106576000513d6120fd57506001600160a01b0381163b155b6120dc5750565b635274afe760e01b60009081526001600160a01b0391909116600452602490fd5b600114156120d5565b6040513d6000823e3d90fd5b60ff811461215c5760ff811690601f821161214b5760408051926121368285611e34565b6020808552840191601f190136833783525290565b632cd44ac360e21b60005260046000fd5b506040516000600154908160011c91600181168015612234575b60208410811461222057838552849291811561220157506001146121a1575b611d5b92500382611e34565b506001600090815290917fb10e2d527612073b26eecdfd717e6a320cf44b4afac2b0732d9fcbe2b7fa0cf65b8183106121e5575050906020611d5b92820101612195565b60209193508060019154838588010152019101909183926121cd565b60209250611d5b94915060ff191682840152151560051b820101612195565b634e487b7160e01b83526022600452602483fd5b92607f1692612176565b60ff81146122625760ff811690601f821161214b5760408051926121368285611e34565b506040516000600254908160011c91600181168015612306575b60208410811461222057838552849291811561220157506001146122a657611d5b92500382611e34565b506002600090815290917f405787fa12a823e0f2b7631cc41b3ba8828b3321ca811111fa75cd3aa3bb5ace5b8183106122ea575050906020611d5b92820101612195565b60209193508060019154838588010152019101909183926122d2565b92607f169261227c565b6040516323b872dd60e01b60208201526001600160a01b039283166024820152929091166044830152606480830193909352918152611f28916110d4608483611e34565b81519190604183036123855761237e92506020820151906060604084015193015160001a90612418565b9192909190565b505060009160029190565b919091600481101561240257806123a657509050565b6000600182036123c15763f645eedf60e01b60005260046000fd5b50600281036123df578263fce698f760e01b60005260045260246000fd5b90916003600092146123ef575050565b6335e2f38360e21b825260045260249150fd5b634e487b7160e01b600052602160045260246000fd5b91907f7fffffffffffffffffffffffffffffff5d576e7357a4501ddfe92f46681b20a08411612495579160209360809260ff60009560405194855216868401526040830152606082015282805260015afa15612106576000516001600160a01b038116156124895790600090600090565b50600090600190600090565b5050506000916003919056fea26469706673582212203ef9e442ca0bd6376be7813b64f9f3821a2de4434de060380a24e17191e4e06964736f6c634300081c0033

000000000000000000000000e7c69f26344dcb5862f829cedd1b518671b15e28000000000000000000000000c02aaa39b223fe8d0a0e5c4f27ead9083c756cc20000000000000000000000003fc9ab11ed43ce6142fbe5519301a1953c040306

-----Decoded View---------------
Arg [0] : initialOwner (address): 0xE7c69f26344dCb5862f829CEdD1B518671b15E28
Arg [1] : _weth (address): 0xC02aaA39b223FE8D0A0e5C4F27eAD9083C756Cc2
Arg [2] : _platformFeeRecipient (address): 0x3Fc9AB11ed43Ce6142FBe5519301A1953c040306

-----Encoded View---------------
3 Constructor Arguments found :
Arg [0] : 000000000000000000000000e7c69f26344dcb5862f829cedd1b518671b15e28
Arg [1] : 000000000000000000000000c02aaa39b223fe8d0a0e5c4f27ead9083c756cc2
Arg [2] : 0000000000000000000000003fc9ab11ed43ce6142fbe5519301a1953c040306