Contract Source Code (Solidity Standard Json-Input format)

IDE

• Blockscan IDE
• 🤖 Code ReaderBeta

More Options

• Similar
• Submit Audit
• Compare

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

import { EnumerableSet } from "@openzeppelin/contracts/utils/structs/EnumerableSet.sol";
import {
    IERC20,
    ERC4626,
    ERC20,
    Math,
    SafeERC20
} from "@openzeppelin/contracts/token/ERC20/extensions/ERC4626.sol";
import { ReentrancyGuard } from "@openzeppelin/contracts/utils/ReentrancyGuard.sol";

import { IBrinkVault } from "./interfaces/IBrinkVault.sol";
import { IBaseStrategy } from "./interfaces/IBaseStrategy.sol";
import { ErrorsLib } from "./libraries/ErrorsLib.sol";

/// @title BrinkVault
/// @notice A vault contract that manages multiple Strategy positions
/// @dev Inherits and implements IBrinkVault
/// @author b11a
contract BrinkVault is IBrinkVault, ERC4626, ReentrancyGuard {
    using EnumerableSet for EnumerableSet.AddressSet;
    using SafeERC20 for IERC20;
    using Math for uint256;

    //////////////////////////////////////////////////////////////
    //                     STATE VARIABLES                      //
    //////////////////////////////////////////////////////////////

    /// @notice The total weight used for calculating proportions (10000 = 100%)
    uint256 private constant TOTAL_WEIGHT = 10_000;

    /// @notice The maximum allowed slippage (1% = 100)
    uint256 private constant MAX_SLIPPAGE = 100;

    /// @notice The number of Strategies in the vault
    uint256 public numberOfStrategies;

    /// @notice The deposit limit for the vault
    uint256 public depositLimit;

    address public strategist;
    address public vaultManager;

    /// @notice Set of whitelisted Strategies in the whole vault
    EnumerableSet.AddressSet private whitelistedStrategiesSet;

    StrategyConfig[] public strategyConfigs;

    bool public initialized;

    //////////////////////////////////////////////////////////////
    //                       MODIFIERS                          //
    //////////////////////////////////////////////////////////////

    /// @notice Ensures that only the Brink Vaults Strategist can call the function
    modifier onlyVaultStrategist() {
        if (strategist != msg.sender) {
            revert NOT_VAULT_STRATEGIST();
        }
        _;
    }

    /// @notice Ensures that only the Vault Manager can call the function
    modifier onlyVaultManager() {
        if (vaultManager != msg.sender) {
            revert NOT_VAULT_MANAGER();
        }
        _;
    }

    //////////////////////////////////////////////////////////////
    //                       CONSTRUCTOR                        //
    //////////////////////////////////////////////////////////////

    /**
     * @notice Constructor for the BrinkVault contract
     * @param _asset Address of the asset token
     * @param _strategist Address of the strategist
     * @param _vaultManager Address of the vault manager
     * @param _name Name of the BrinkVault shares
     * @param _symbol Symbol of the BrinkVault shares
     * @param _depositLimit Maximum deposit limit
     */
    constructor(
        address _asset,
        address _strategist,
        address _vaultManager,
        string memory _name,
        string memory _symbol,
        uint256 _depositLimit
    ) 
        ERC4626(IERC20(_asset)) ERC20(_name, _symbol)
    {
        if (_strategist == address(0) || _vaultManager == address(0)) {
            revert ErrorsLib.ZERO_ADDRESS();
        }

        strategist = _strategist;
        vaultManager = _vaultManager;
        depositLimit = _depositLimit;
    }

    //////////////////////////////////////////////////////////////
    //                  EXTERNAL FUNCTIONS                      //
    //////////////////////////////////////////////////////////////

    function initialize(address[] calldata _strategies, uint256[] calldata _weights) external onlyVaultManager {
        if (initialized) revert ALREADY_INITIALIZED();

        uint256 _numberOfStrategies = _strategies.length;

        if (_numberOfStrategies == 0) revert ErrorsLib.ZERO_STRATEGIES();

        if (_numberOfStrategies != _weights.length) revert ErrorsLib.ARRAY_LENGTH_MISMATCH();

        uint256 totalWeight;
        address strategy;
        StrategyConfig memory _strategyConfig;

        for (uint256 i; i < _numberOfStrategies; ++i) {
            /// @dev this BrinkVault only supports strategy that have the same asset as the vault
            strategy = _strategies[i];

            if (IBaseStrategy(strategy).asset() != asset()) revert STRATEGY_DOES_NOT_SUPPORT_ASSET();

            if (IBaseStrategy(strategy).brinkVault() != address(this)) revert STRATEGY_DOES_NOT_SUPPORT_VAULT();

            bool isAdded = _addToWhitelist(_strategies[i]);
            if (!isAdded) revert ErrorsLib.DUPLICATE_STRATEGY(_strategies[i]);
            _strategyConfig = StrategyConfig(_strategies[i], _weights[i]);
            strategyConfigs.push(_strategyConfig);

            totalWeight += _weights[i];
        }

        if (totalWeight != TOTAL_WEIGHT) revert INVALID_WEIGHTS();

        numberOfStrategies = strategyConfigs.length;

        initialized = true;

        emit Initialized(_strategies, _weights);
    }

    /// @notice Sets the strategist for the vault
    /// @param strategist_ The new strategist
    function setStrategist(address strategist_) external onlyVaultManager {
        strategist = strategist_;

        emit StrategistSet(strategist_);
    }

    /// @notice Sets the vault manager
    /// @param _vaultManager The new vault manager
    function setVaultManager(address _vaultManager) external onlyVaultManager {
        if (_vaultManager == address(0)) revert ErrorsLib.ZERO_ADDRESS();
        vaultManager = _vaultManager;

        emit VaultManagerSet(_vaultManager);
    }

    function setStrategy(address _strategy, bool _isWhitelisted) external onlyVaultManager {
        bool currentlyWhitelisted = whitelistedStrategiesSet.contains(_strategy);

        // Only process if there's an actual change
        if (currentlyWhitelisted != _isWhitelisted) {
            if (_isWhitelisted) {
                _addToWhitelist(_strategy);
            } else {
                uint256 bal_ = IBaseStrategy(_strategy).balance();
                if (bal_ != 0) revert CANNOT_REMOVE_NOT_EMPTY_STRATEGY();
                if (whitelistedStrategiesSet.length() == 1) revert CANNOT_REMOVE_LAST_STRATEGY();
                _removeFromWhitelist(_strategy);
            }

            emit StrategyWhitelisted(_strategy, _isWhitelisted);
        }
    }

    function setDepositLimit(uint256 _depositLimit) external onlyVaultManager {
        depositLimit = _depositLimit;

        emit DepositLimitSet(_depositLimit);
    }

    function depositFunds() external onlyVaultStrategist {
        uint256 _assets = _getAssetBalance(asset());
        _executeSupplyOrWithdraw(
            numberOfStrategies, _assets, strategyConfigs, true
        );

        emit DepositFunds(_getAssetBalance(address(0)));
    }

    function withdrawFunds() external onlyVaultStrategist {
        StrategyConfig[] memory _strategyConfigs = strategyConfigs;
        uint256 numberOfStrategies_ = numberOfStrategies;
        address _strategy;
        for (uint256 i; i < numberOfStrategies_;) {
            harvest();

            _strategy = _strategyConfigs[i].strategy;

            uint256 bal = IBaseStrategy(_strategy).balance();
            IBaseStrategy(_strategy).withdraw(bal);

            unchecked {
                ++i;
            }
        }

        emit WithdrawFunds(_getAssetBalance(asset()));
    }

    /// @notice Rebalances the BrinkVault
    /// @notice _rebalanceArgs.strategiesRebalanceFrom must be an ordered array of strategy addresses with no duplicates
    /// @notice the logic is as follows:
    /// select the addresses to rebalance from
    /// send an amount to take from those addresses
    /// the total underlying asset amount is redestributed according to the desired weights
    function rebalance(RebalanceArgs calldata _rebalanceArgs) external onlyVaultStrategist {
        uint256 lenRebalanceFrom = _rebalanceArgs.strategiesRebalanceFrom.length;
        uint256 lenWeightsRebalanceFrom = _rebalanceArgs.weightsRebalanceFrom.length;
        uint256 letRebalanceTo = _rebalanceArgs.strategiesRebalanceTo.length;

        if (lenWeightsRebalanceFrom == 0) revert EMPTY_WEIGHTS_REBALANCE_FROM();
        if (letRebalanceTo == 0 || lenRebalanceFrom == 0) revert EMPTY_STRATEGY_ARRAYS();
        if (lenRebalanceFrom != lenWeightsRebalanceFrom || letRebalanceTo != _rebalanceArgs.weightsOfRedestribution.length) {
            revert ErrorsLib.ARRAY_LENGTH_MISMATCH();
        }

        {
            /// @dev caching to avoid multiple loads
            uint256 foundCount;
            uint256 nStrategies = numberOfStrategies;
            for (uint256 i; i < lenRebalanceFrom; ++i) {
                for (uint256 j; j < nStrategies; ++j) {
                    if (_rebalanceArgs.strategiesRebalanceFrom[i] == strategyConfigs[j].strategy) {
                        foundCount++;
                        break;
                    }
                }
            }

            if (foundCount != lenRebalanceFrom) {
                revert INVALID_STRATEGY_REBALANCE_FROM();
            }
        }
        for (uint256 i = 1; i < lenRebalanceFrom; ++i) {
            if (_rebalanceArgs.strategiesRebalanceFrom[i] <= _rebalanceArgs.strategiesRebalanceFrom[i - 1]) {
                revert DUPLICATE_STRATEGY_REBALANCE_FROM();
            }
        }

        for (uint256 i; i < letRebalanceTo; ++i) {
            if (i >= 1 && _rebalanceArgs.strategiesRebalanceTo[i] <= _rebalanceArgs.strategiesRebalanceTo[i - 1]) {
                revert DUPLICATE_STRATEGIES_REBALANCE_TO();
            }
            if (!whitelistedStrategiesSet.contains(_rebalanceArgs.strategiesRebalanceTo[i])) {
                revert STRATEGY_NOT_WHITELISTED();
            }
        }

        StrategyConfig[] memory _localStrategyConfigs = new StrategyConfig[](lenRebalanceFrom);
        for(uint256 i = 0; i < lenRebalanceFrom;) {
            _localStrategyConfigs[i] = StrategyConfig(_rebalanceArgs.strategiesRebalanceFrom[i], _rebalanceArgs.weightsRebalanceFrom[i]);

            unchecked {
                ++i;
            }
        }


        /// @dev step 1: prepare withdraw arguments
        WithdrawArgs memory withdrawArgs_ = WithdrawArgs({
            recipient: address(this),
            owner: address(this),
            assets: 0,
            shares: 0,
            numberOfStrategies: _rebalanceArgs.strategiesRebalanceFrom.length,
            strategyConfigs: _localStrategyConfigs
        });

        /// @dev step 2: do withdraw
        uint256 receivedAmount_ = _executeSupplyOrWithdraw(
            withdrawArgs_.numberOfStrategies, 
            withdrawArgs_.assets,
            withdrawArgs_.strategyConfigs, 
            false
        );

        StrategyConfig[] memory filteredConfigs_ =
            _filterNonZeroWeights(_rebalanceArgs.strategiesRebalanceTo, _rebalanceArgs.weightsOfRedestribution);

        /// @dev step 3: prepare deposit arguments
        uint256 shares_ = previewDeposit(receivedAmount_);
        DepositArgs memory depositArgs_ = DepositArgs({
            recipient: address(this),
            assets: receivedAmount_,
            shares: shares_,
            numberOfStrategies: _rebalanceArgs.strategiesRebalanceTo.length,
            strategyConfigs: filteredConfigs_
        });

        /// @dev step 4: do deposit
        _executeSupplyOrWithdraw(
            depositArgs_.numberOfStrategies, 
            depositArgs_.assets, 
            depositArgs_.strategyConfigs,
            true
        );

        /// @dev step 5: update BV data
        /// @notice no issue about reentrancy as the external contracts are trusted
        /// @notice updateBV emits rebalance event
        _updateBVData(filteredConfigs_);
    }

    /// @notice Forwards dust to the vaultManager
    function forwardDustToVaultManager() external onlyVaultManager {
        address token = asset();
        uint256 dust = _getAssetBalance(token);

        if (dust != 0) {
            IERC20(token).safeTransfer(vaultManager, dust);
            emit DustForwardedToPaymaster(dust);
        }
    }

    //////////////////////////////////////////////////////////////
    //                 EXTERNAL VIEW/PURE FUNCTIONS             //
    //////////////////////////////////////////////////////////////

    /// @notice Returns whether a strategy is whitelisted
    /// @param _strategies Array of strategy addresses
    /// @return _isWhitelisted Array of booleans indicating whether each strategy is whitelisted
    function getIsWhitelisted(address[] memory _strategies) external view returns (bool[] memory _isWhitelisted) {
        uint256 length = _strategies.length;
        _isWhitelisted = new bool[](length);

        for (uint256 i; i < length; ++i) {
            _isWhitelisted[i] = whitelistedStrategiesSet.contains(_strategies[i]);
        }

        return _isWhitelisted;
    }

    /// @notice Returns the array of whitelisted strategy addresses
    /// @return Array of whitelisted strategy addresses
    function getWhitelist() external view returns (address[] memory) {
        return whitelistedStrategiesSet.values();
    }

    /// @notice Returns the strategy addresses and weights of the BrinkVault
    /// @return _strategyConfigs Struct containing the strategy addresses and weights
    function getBrinkVaultData() external view returns (StrategyConfig[] memory) {
        return strategyConfigs;
    }

    /// @notice Returns whether the deposit limit has been reached
    /// @param _assets The amount of asset to check
    /// @return _result Whether the deposit limit has been reached
    function checkDepositLimit(uint256 _assets) public view returns (bool _result) { 
        uint256 balance = _getAssetBalance(address(0));
        _result = (_assets + balance < depositLimit);
    }

    //////////////////////////////////////////////////////////////
    //            VAULTS PUBLIC OVERRIDES                       //
    //////////////////////////////////////////////////////////////

    function totalAssets() public view override returns (uint256 _totalAssets) {
        uint256 numberOfStrategies_ = numberOfStrategies;
        for (uint256 i; i < numberOfStrategies_;) {
            _totalAssets += IBaseStrategy(strategyConfigs[i].strategy).balance();

            unchecked {
                ++i;
            }
        }
        _totalAssets += _getAssetBalance(asset());
    }

    /// @notice Deposit assets to the strategies
    /// @param _assets The amount of assets to supply
    /// @param _recipient The recipient of the shares
    function deposit(uint256 _assets, address _recipient) public override nonReentrant returns (uint256 _shares) {
        if (_assets == 0) revert ErrorsLib.ZERO_AMOUNT();
        if (!checkDepositLimit(_assets)) revert DEPOSIT_LIMIT_EXCEEDED();

        harvest();

        _shares = previewDeposit(_assets);
        DepositArgs memory depositArgs_ = DepositArgs(
            _recipient,
            _assets,
            _shares,
            numberOfStrategies,
            strategyConfigs
        );
        _deposit(depositArgs_);
    }

    function mint(uint256 _shares, address _recipient) public override nonReentrant returns (uint256 _assets) {
        harvest();

        _assets = previewMint(_shares);
        if (_assets == 0) revert ErrorsLib.ZERO_AMOUNT();
        if (!checkDepositLimit(_assets)) revert DEPOSIT_LIMIT_EXCEEDED();

        DepositArgs memory depositArgs_ = DepositArgs(
            _recipient,
            _assets,
            _shares,
            numberOfStrategies,
            strategyConfigs
        );
        _deposit(depositArgs_);
    }

    /// @notice Withdraw funds from the strategies
    /// @param _assets The amount of funds to withdraw
    function withdraw(uint256 _assets, address _recipient, address _owner) public override nonReentrant returns (uint256 _shares) {
        if (_assets == 0) revert ErrorsLib.ZERO_AMOUNT();

        harvest();

        _shares = previewWithdraw(_assets);
        WithdrawArgs memory withdrawArgs_ = WithdrawArgs(
            _recipient,
            _owner,
            _assets,
            _shares,
            numberOfStrategies,
            strategyConfigs
        );
        _withdraw(withdrawArgs_);
    }

    function redeem(uint256 _shares, address _recipient, address _owner) public override nonReentrant returns (uint256 _assets) {
        harvest();

        _assets = previewRedeem(_shares);
        if (_assets == 0) revert ErrorsLib.ZERO_AMOUNT();

        WithdrawArgs memory withdrawArgs_ = WithdrawArgs(
            _recipient,
            _owner,
            _assets,
            _shares,
            numberOfStrategies,
            strategyConfigs
        );
        _withdraw(withdrawArgs_);
    }

    function harvest() public {
        uint256 numberOfStrategies_ = numberOfStrategies;
        for (uint256 i; i < numberOfStrategies_;) {
            IBaseStrategy(strategyConfigs[i].strategy).harvest();

            unchecked {
                ++i;
            }
        }
    } 

    //////////////////////////////////////////////////////////////
    //                     INTERNAL FUNCTIONS                   //
    //////////////////////////////////////////////////////////////

    function _deposit(DepositArgs memory _args) internal {
        address caller_ = _msgSender();
        IERC20 asset = IERC20(asset());

        asset.safeTransferFrom(caller_, address(this), _args.assets);

        _executeSupplyOrWithdraw(
            _args.numberOfStrategies, _args.assets, _args.strategyConfigs, true);

        _mint(_args.recipient, _args.shares);

        emit Deposited(caller_, _args.recipient, _args.assets, _args.shares);
    }

    function _withdraw(WithdrawArgs memory _args) internal {
        address caller_ = _msgSender();
        IERC20 asset = IERC20(asset());

        uint256 receivedAmount_ = _executeSupplyOrWithdraw(
            _args.numberOfStrategies, _args.assets, _args.strategyConfigs, false);

        if (caller_ != _args.owner) {
            _spendAllowance(_args.owner, caller_, _args.shares);
        }
        _burn(_args.owner, _args.shares);

        asset.safeTransfer(_args.recipient, receivedAmount_);

        emit Withdrawal(caller_, _args.recipient, receivedAmount_, _args.shares);
    }

    function _executeSupplyOrWithdraw(
        uint256 _numberOfStrategies,
        uint256 _assets,
        StrategyConfig[] memory _strategyConfigs,
        bool _isSupply
    ) internal returns (uint256 receivedAmount_) {
        address token = asset();
        IERC20 asset = IERC20(token);
        uint256[] memory amounts_ = new uint256[](_numberOfStrategies);
        address _strategy;

        if (_isSupply) {
            for (uint256 i; i < _numberOfStrategies;) {
                _strategy = _strategyConfigs[i].strategy;
                amounts_[i] = _assets.mulDiv(_strategyConfigs[i].weight, TOTAL_WEIGHT, Math.Rounding.Floor);

                asset.safeIncreaseAllowance(_strategy, amounts_[i]);

                IBaseStrategy(_strategy).supply(amounts_[i]);

                if (asset.allowance(address(this), _strategy) > 0) asset.forceApprove(_strategy, 0);

                unchecked {
                    ++i;
                }
            }
        } else {
            uint256 balBefore_ = _getAssetBalance(token);
            uint256 _assets_;

            for (uint256 i; i < _numberOfStrategies;) {
                _strategy = _strategyConfigs[i].strategy;
                _assets_ = _assets;
                if (_assets == 0) {
                    _assets_ = IBaseStrategy(_strategy).balance();
                }
                amounts_[i] = _assets_.mulDiv(_strategyConfigs[i].weight, TOTAL_WEIGHT, Math.Rounding.Floor);

                IBaseStrategy(_strategy).withdraw(amounts_[i]);

                unchecked {
                    ++i;
                }
            }

            uint256 balAfter_ = _getAssetBalance(token);
            receivedAmount_ = balAfter_ - balBefore_;
            _checkSlippage(_assets, receivedAmount_);
        }
    }

    /// @notice Gets the current balance of the asset token held by this contract
    /// @return balance The current balance of the asset token
    function _getAssetBalance(address _token) internal view returns (uint256 balance) {
        balance = (_token == address(0))
            ? _convertToAssets(totalSupply(), Math.Rounding.Floor)
            : IERC20(_token).balanceOf(address(this));
    }

    function _checkStrategyZeroBalance(address _strategy) internal view returns (bool) {
        return IBaseStrategy(_strategy).balance() == 0;
    }

    function _checkSlippage(uint256 _expectedAmount, uint256 _actualAmount) internal pure {
        uint256 slippage = _expectedAmount > _actualAmount
            ? ((_expectedAmount - _actualAmount) * TOTAL_WEIGHT) / _expectedAmount
            : 0;

        if (slippage > MAX_SLIPPAGE) {
            revert SLIPPAGE_TOO_HIGH();
        }
    }

    /// @notice Filters out zero weights and returns corresponding strategy addresses and weights
    /// @param _strategies Array of strategy addresses
    /// @param _weights Array of weights
    /// @return _filteredStruct Array of strategy addresses and weights
    function _filterNonZeroWeights(
        address[] calldata _strategies,
        uint256[] calldata _weights
    )
        internal
        pure
        returns (StrategyConfig[] memory _filteredStruct)
    {
        uint256 count;
        uint256 length = _weights.length;
        for (uint256 i; i < length; ++i) {
            if (_weights[i] != 0) {
                count++;
            }
        }

        // Initialize the array with the correct size
        _filteredStruct = new StrategyConfig[](count);
        
        uint256 j;
        uint256 totalWeight;
        for (uint256 i; i < length; ++i) {
            if (_weights[i] != 0) {
                _filteredStruct[j] = StrategyConfig(_strategies[i], _weights[i]);
                totalWeight += _weights[i];
                j++;
            }
        }
        if (totalWeight != TOTAL_WEIGHT) revert INVALID_WEIGHTS();
    }

    /// @notice Updates the BrinkVault data after rebalancing
    /// @param _finalStrategies Array of final strategies to rebalance to (with target weights)
    function _updateBVData(StrategyConfig[] memory _finalStrategies) internal {
        // Cache current strategies and asset address
        StrategyConfig[] memory _currentStrategyConfigs = strategyConfigs;
        address assetCache = address(asset());
        uint256 numFinalStrategies = _finalStrategies.length;
        uint256 numCurrentStrategies = _currentStrategyConfigs.length;
        
        if (numFinalStrategies == 0) revert ErrorsLib.ZERO_STRATEGIES();
        
        // Count strategies that need to be added (current strategies not in final list with non-zero balance)
        uint256 additionalStrategies = 0;
        for (uint256 i; i < numCurrentStrategies;) {
            bool found = false;
            for (uint256 j; j < numFinalStrategies;) {
                if (_currentStrategyConfigs[i].strategy == _finalStrategies[j].strategy) {
                    found = true;
                    break;
                }
                unchecked {
                    ++j;
                }
            }
            if (!found && !_checkStrategyZeroBalance(_currentStrategyConfigs[i].strategy)) {
                additionalStrategies++;
            }
            unchecked {
                ++i;
            }
        }
        
        // Create final array with exact size needed
        uint256 totalStrategies = numFinalStrategies + additionalStrategies;
        StrategyConfig[] memory finalStrategies = new StrategyConfig[](totalStrategies);
        
        // Copy strategies from _finalStrategies first
        for (uint256 i; i < numFinalStrategies;) {
            finalStrategies[i] = _finalStrategies[i];
            unchecked {
                ++i;
            }
        }
        
        // Add current strategies that weren't in final list but have non-zero balance
        uint256 currentIndex = numFinalStrategies;
        for (uint256 i; i < numCurrentStrategies;) {
            bool found = false;
            for (uint256 j; j < numFinalStrategies;) {
                if (_currentStrategyConfigs[i].strategy == _finalStrategies[j].strategy) {
                    found = true;
                    break;
                }
                unchecked {
                    ++j;
                }
            }
            if (!found && !_checkStrategyZeroBalance(_currentStrategyConfigs[i].strategy)) {
                finalStrategies[currentIndex] = StrategyConfig(_currentStrategyConfigs[i].strategy, 0);
                unchecked {
                    ++currentIndex;
                }
            }
            unchecked {
                ++i;
            }
        }
        
        // Validate strategies and get their actual balances
        uint256 totalValue = 0;
        for (uint256 i; i < totalStrategies;) {
            address strategy = finalStrategies[i].strategy;
            
            // Validate strategy supports the vault's asset
            if (IBaseStrategy(strategy).asset() != assetCache) {
                revert STRATEGY_DOES_NOT_SUPPORT_ASSET();
            }
            
            // Validate strategy supports this vault
            if (IBaseStrategy(strategy).brinkVault() != address(this)) {
                revert STRATEGY_DOES_NOT_SUPPORT_VAULT();
            }
            
            // Get the actual balance and update the strategy config
            uint256 actualBalance = IBaseStrategy(strategy).balance();
            finalStrategies[i].weight = actualBalance;
            totalValue += actualBalance;
            
            unchecked {
                ++i;
            }
        }
        
        // Calculate new weights as percentages, ensuring they sum to TOTAL_WEIGHT
        if (totalValue > 0) {
            uint256 totalAssignedWeight = 0;
            for (uint256 i; i < totalStrategies - 1;) {
                finalStrategies[i].weight = finalStrategies[i].weight.mulDiv(
                    TOTAL_WEIGHT, 
                    totalValue, 
                    Math.Rounding.Floor
                );
                totalAssignedWeight += finalStrategies[i].weight;
                unchecked {
                    ++i;
                }
            }
            // Assign remaining weight to the last strategy to ensure total equals TOTAL_WEIGHT
            finalStrategies[totalStrategies - 1].weight = TOTAL_WEIGHT - totalAssignedWeight;
        } else {
            // If total value is 0, distribute weights equally
            uint256 equalWeight = TOTAL_WEIGHT / totalStrategies;
            uint256 remainder = TOTAL_WEIGHT % totalStrategies;
            
            for (uint256 i; i < totalStrategies;) {
                finalStrategies[i].weight = equalWeight + (i < remainder ? 1 : 0);
                unchecked {
                    ++i;
                }
            }
        }
        
        // Update strategyConfigs
        delete strategyConfigs;
        for (uint256 i = 0; i < totalStrategies;) {
            strategyConfigs.push(finalStrategies[i]);
            unchecked {
                ++i;
            }
        }
        
        numberOfStrategies = totalStrategies;
        
        emit RebalanceComplete(_extractStrategies(finalStrategies), _extractWeights(finalStrategies));
    }

    /// @notice Extracts strategy addresses from StrategyConfig array
    /// @param _strategyConfigs Array of StrategyConfig
    /// @return strategies Array of strategy addresses
    function _extractStrategies(StrategyConfig[] memory _strategyConfigs) internal pure returns (address[] memory strategies) {
        uint256 length = _strategyConfigs.length;
        strategies = new address[](length);
        for (uint256 i; i < length;) {
            strategies[i] = _strategyConfigs[i].strategy;
            unchecked {
                ++i;
            }
        }
    }

    /// @notice Extracts weights from StrategyConfig array
    /// @param _strategyConfigs Array of StrategyConfig
    /// @return weights Array of weights
    function _extractWeights(StrategyConfig[] memory _strategyConfigs) internal pure returns (uint256[] memory weights) {
        uint256 length = _strategyConfigs.length;
        weights = new uint256[](length);
        for (uint256 i; i < length;) {
            weights[i] = _strategyConfigs[i].weight;
            unchecked {
                ++i;
            }
        }
    }

    /// @notice Adds a strategy address to the whitelist array
    /// @param _strategy The strategy address to add
    function _addToWhitelist(address _strategy) internal returns (bool) {
        return whitelistedStrategiesSet.add(_strategy);
    }

    /// @notice Removes a strategy address from the whitelist array
    /// @param _strategy The strategy address to remove
    function _removeFromWhitelist(address _strategy) internal {
        whitelistedStrategiesSet.remove(_strategy);
    }
}

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

pragma solidity ^0.8.20;

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.0.0) (interfaces/IERC165.sol)

pragma solidity ^0.8.20;

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

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

pragma solidity ^0.8.20;

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

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

pragma solidity ^0.8.20;

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

/**
 * @dev Interface of the ERC-4626 "Tokenized Vault Standard", as defined in
 * https://eips.ethereum.org/EIPS/eip-4626[ERC-4626].
 */
interface IERC4626 is IERC20, IERC20Metadata {
    event Deposit(address indexed sender, address indexed owner, uint256 assets, uint256 shares);

    event Withdraw(
        address indexed sender,
        address indexed receiver,
        address indexed owner,
        uint256 assets,
        uint256 shares
    );

    /**
     * @dev Returns the address of the underlying token used for the Vault for accounting, depositing, and withdrawing.
     *
     * - MUST be an ERC-20 token contract.
     * - MUST NOT revert.
     */
    function asset() external view returns (address assetTokenAddress);

    /**
     * @dev Returns the total amount of the underlying asset that is “managed” by Vault.
     *
     * - SHOULD include any compounding that occurs from yield.
     * - MUST be inclusive of any fees that are charged against assets in the Vault.
     * - MUST NOT revert.
     */
    function totalAssets() external view returns (uint256 totalManagedAssets);

    /**
     * @dev Returns the amount of shares that the Vault would exchange for the amount of assets provided, in an ideal
     * scenario where all the conditions are met.
     *
     * - MUST NOT be inclusive of any fees that are charged against assets in the Vault.
     * - MUST NOT show any variations depending on the caller.
     * - MUST NOT reflect slippage or other on-chain conditions, when performing the actual exchange.
     * - MUST NOT revert.
     *
     * NOTE: This calculation MAY NOT reflect the “per-user” price-per-share, and instead should reflect the
     * “average-user’s” price-per-share, meaning what the average user should expect to see when exchanging to and
     * from.
     */
    function convertToShares(uint256 assets) external view returns (uint256 shares);

    /**
     * @dev Returns the amount of assets that the Vault would exchange for the amount of shares provided, in an ideal
     * scenario where all the conditions are met.
     *
     * - MUST NOT be inclusive of any fees that are charged against assets in the Vault.
     * - MUST NOT show any variations depending on the caller.
     * - MUST NOT reflect slippage or other on-chain conditions, when performing the actual exchange.
     * - MUST NOT revert.
     *
     * NOTE: This calculation MAY NOT reflect the “per-user” price-per-share, and instead should reflect the
     * “average-user’s” price-per-share, meaning what the average user should expect to see when exchanging to and
     * from.
     */
    function convertToAssets(uint256 shares) external view returns (uint256 assets);

    /**
     * @dev Returns the maximum amount of the underlying asset that can be deposited into the Vault for the receiver,
     * through a deposit call.
     *
     * - MUST return a limited value if receiver is subject to some deposit limit.
     * - MUST return 2 ** 256 - 1 if there is no limit on the maximum amount of assets that may be deposited.
     * - MUST NOT revert.
     */
    function maxDeposit(address receiver) external view returns (uint256 maxAssets);

    /**
     * @dev Allows an on-chain or off-chain user to simulate the effects of their deposit at the current block, given
     * current on-chain conditions.
     *
     * - MUST return as close to and no more than the exact amount of Vault shares that would be minted in a deposit
     *   call in the same transaction. I.e. deposit should return the same or more shares as previewDeposit if called
     *   in the same transaction.
     * - MUST NOT account for deposit limits like those returned from maxDeposit and should always act as though the
     *   deposit would be accepted, regardless if the user has enough tokens approved, etc.
     * - MUST be inclusive of deposit fees. Integrators should be aware of the existence of deposit fees.
     * - MUST NOT revert.
     *
     * NOTE: any unfavorable discrepancy between convertToShares and previewDeposit SHOULD be considered slippage in
     * share price or some other type of condition, meaning the depositor will lose assets by depositing.
     */
    function previewDeposit(uint256 assets) external view returns (uint256 shares);

    /**
     * @dev Mints shares Vault shares to receiver by depositing exactly amount of underlying tokens.
     *
     * - MUST emit the Deposit event.
     * - MAY support an additional flow in which the underlying tokens are owned by the Vault contract before the
     *   deposit execution, and are accounted for during deposit.
     * - MUST revert if all of assets cannot be deposited (due to deposit limit being reached, slippage, the user not
     *   approving enough underlying tokens to the Vault contract, etc).
     *
     * NOTE: most implementations will require pre-approval of the Vault with the Vault’s underlying asset token.
     */
    function deposit(uint256 assets, address receiver) external returns (uint256 shares);

    /**
     * @dev Returns the maximum amount of the Vault shares that can be minted for the receiver, through a mint call.
     * - MUST return a limited value if receiver is subject to some mint limit.
     * - MUST return 2 ** 256 - 1 if there is no limit on the maximum amount of shares that may be minted.
     * - MUST NOT revert.
     */
    function maxMint(address receiver) external view returns (uint256 maxShares);

    /**
     * @dev Allows an on-chain or off-chain user to simulate the effects of their mint at the current block, given
     * current on-chain conditions.
     *
     * - MUST return as close to and no fewer than the exact amount of assets that would be deposited in a mint call
     *   in the same transaction. I.e. mint should return the same or fewer assets as previewMint if called in the
     *   same transaction.
     * - MUST NOT account for mint limits like those returned from maxMint and should always act as though the mint
     *   would be accepted, regardless if the user has enough tokens approved, etc.
     * - MUST be inclusive of deposit fees. Integrators should be aware of the existence of deposit fees.
     * - MUST NOT revert.
     *
     * NOTE: any unfavorable discrepancy between convertToAssets and previewMint SHOULD be considered slippage in
     * share price or some other type of condition, meaning the depositor will lose assets by minting.
     */
    function previewMint(uint256 shares) external view returns (uint256 assets);

    /**
     * @dev Mints exactly shares Vault shares to receiver by depositing amount of underlying tokens.
     *
     * - MUST emit the Deposit event.
     * - MAY support an additional flow in which the underlying tokens are owned by the Vault contract before the mint
     *   execution, and are accounted for during mint.
     * - MUST revert if all of shares cannot be minted (due to deposit limit being reached, slippage, the user not
     *   approving enough underlying tokens to the Vault contract, etc).
     *
     * NOTE: most implementations will require pre-approval of the Vault with the Vault’s underlying asset token.
     */
    function mint(uint256 shares, address receiver) external returns (uint256 assets);

    /**
     * @dev Returns the maximum amount of the underlying asset that can be withdrawn from the owner balance in the
     * Vault, through a withdraw call.
     *
     * - MUST return a limited value if owner is subject to some withdrawal limit or timelock.
     * - MUST NOT revert.
     */
    function maxWithdraw(address owner) external view returns (uint256 maxAssets);

    /**
     * @dev Allows an on-chain or off-chain user to simulate the effects of their withdrawal at the current block,
     * given current on-chain conditions.
     *
     * - MUST return as close to and no fewer than the exact amount of Vault shares that would be burned in a withdraw
     *   call in the same transaction. I.e. withdraw should return the same or fewer shares as previewWithdraw if
     *   called
     *   in the same transaction.
     * - MUST NOT account for withdrawal limits like those returned from maxWithdraw and should always act as though
     *   the withdrawal would be accepted, regardless if the user has enough shares, etc.
     * - MUST be inclusive of withdrawal fees. Integrators should be aware of the existence of withdrawal fees.
     * - MUST NOT revert.
     *
     * NOTE: any unfavorable discrepancy between convertToShares and previewWithdraw SHOULD be considered slippage in
     * share price or some other type of condition, meaning the depositor will lose assets by depositing.
     */
    function previewWithdraw(uint256 assets) external view returns (uint256 shares);

    /**
     * @dev Burns shares from owner and sends exactly assets of underlying tokens to receiver.
     *
     * - MUST emit the Withdraw event.
     * - MAY support an additional flow in which the underlying tokens are owned by the Vault contract before the
     *   withdraw execution, and are accounted for during withdraw.
     * - MUST revert if all of assets cannot be withdrawn (due to withdrawal limit being reached, slippage, the owner
     *   not having enough shares, etc).
     *
     * Note that some implementations will require pre-requesting to the Vault before a withdrawal may be performed.
     * Those methods should be performed separately.
     */
    function withdraw(uint256 assets, address receiver, address owner) external returns (uint256 shares);

    /**
     * @dev Returns the maximum amount of Vault shares that can be redeemed from the owner balance in the Vault,
     * through a redeem call.
     *
     * - MUST return a limited value if owner is subject to some withdrawal limit or timelock.
     * - MUST return balanceOf(owner) if owner is not subject to any withdrawal limit or timelock.
     * - MUST NOT revert.
     */
    function maxRedeem(address owner) external view returns (uint256 maxShares);

    /**
     * @dev Allows an on-chain or off-chain user to simulate the effects of their redemption at the current block,
     * given current on-chain conditions.
     *
     * - MUST return as close to and no more than the exact amount of assets that would be withdrawn in a redeem call
     *   in the same transaction. I.e. redeem should return the same or more assets as previewRedeem if called in the
     *   same transaction.
     * - MUST NOT account for redemption limits like those returned from maxRedeem and should always act as though the
     *   redemption would be accepted, regardless if the user has enough shares, etc.
     * - MUST be inclusive of withdrawal fees. Integrators should be aware of the existence of withdrawal fees.
     * - MUST NOT revert.
     *
     * NOTE: any unfavorable discrepancy between convertToAssets and previewRedeem SHOULD be considered slippage in
     * share price or some other type of condition, meaning the depositor will lose assets by redeeming.
     */
    function previewRedeem(uint256 shares) external view returns (uint256 assets);

    /**
     * @dev Burns exactly shares from owner and sends assets of underlying tokens to receiver.
     *
     * - MUST emit the Withdraw event.
     * - MAY support an additional flow in which the underlying tokens are owned by the Vault contract before the
     *   redeem execution, and are accounted for during redeem.
     * - MUST revert if all of shares cannot be redeemed (due to withdrawal limit being reached, slippage, the owner
     *   not having enough shares, etc).
     *
     * NOTE: some implementations will require pre-requesting to the Vault before a withdrawal may be performed.
     * Those methods should be performed separately.
     */
    function redeem(uint256 shares, address receiver, address owner) external returns (uint256 assets);
}

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

pragma solidity ^0.8.20;

import {IERC20} from "./IERC20.sol";
import {IERC20Metadata} from "./extensions/IERC20Metadata.sol";
import {Context} from "../../utils/Context.sol";
import {IERC20Errors} from "../../interfaces/draft-IERC6093.sol";

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

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

    uint256 private _totalSupply;

    string private _name;
    string private _symbol;

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

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

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

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

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

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

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

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

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

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

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

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

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

        emit Transfer(from, to, value);
    }

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

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

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

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

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

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

pragma solidity ^0.8.20;

import {IERC20, IERC20Metadata, ERC20} from "../ERC20.sol";
import {SafeERC20} from "../utils/SafeERC20.sol";
import {IERC4626} from "../../../interfaces/IERC4626.sol";
import {Math} from "../../../utils/math/Math.sol";

/**
 * @dev Implementation of the ERC-4626 "Tokenized Vault Standard" as defined in
 * https://eips.ethereum.org/EIPS/eip-4626[ERC-4626].
 *
 * This extension allows the minting and burning of "shares" (represented using the ERC-20 inheritance) in exchange for
 * underlying "assets" through standardized {deposit}, {mint}, {redeem} and {burn} workflows. This contract extends
 * the ERC-20 standard. Any additional extensions included along it would affect the "shares" token represented by this
 * contract and not the "assets" token which is an independent contract.
 *
 * [CAUTION]
 * ====
 * In empty (or nearly empty) ERC-4626 vaults, deposits are at high risk of being stolen through frontrunning
 * with a "donation" to the vault that inflates the price of a share. This is variously known as a donation or inflation
 * attack and is essentially a problem of slippage. Vault deployers can protect against this attack by making an initial
 * deposit of a non-trivial amount of the asset, such that price manipulation becomes infeasible. Withdrawals may
 * similarly be affected by slippage. Users can protect against this attack as well as unexpected slippage in general by
 * verifying the amount received is as expected, using a wrapper that performs these checks such as
 * https://github.com/fei-protocol/ERC4626#erc4626router-and-base[ERC4626Router].
 *
 * Since v4.9, this implementation introduces configurable virtual assets and shares to help developers mitigate that risk.
 * The `_decimalsOffset()` corresponds to an offset in the decimal representation between the underlying asset's decimals
 * and the vault decimals. This offset also determines the rate of virtual shares to virtual assets in the vault, which
 * itself determines the initial exchange rate. While not fully preventing the attack, analysis shows that the default
 * offset (0) makes it non-profitable even if an attacker is able to capture value from multiple user deposits, as a result
 * of the value being captured by the virtual shares (out of the attacker's donation) matching the attacker's expected gains.
 * With a larger offset, the attack becomes orders of magnitude more expensive than it is profitable. More details about the
 * underlying math can be found xref:ROOT:erc4626.adoc#inflation-attack[here].
 *
 * The drawback of this approach is that the virtual shares do capture (a very small) part of the value being accrued
 * to the vault. Also, if the vault experiences losses, the users try to exit the vault, the virtual shares and assets
 * will cause the first user to exit to experience reduced losses in detriment to the last users that will experience
 * bigger losses. Developers willing to revert back to the pre-v4.9 behavior just need to override the
 * `_convertToShares` and `_convertToAssets` functions.
 *
 * To learn more, check out our xref:ROOT:erc4626.adoc[ERC-4626 guide].
 * ====
 */
abstract contract ERC4626 is ERC20, IERC4626 {
    using Math for uint256;

    IERC20 private immutable _asset;
    uint8 private immutable _underlyingDecimals;

    /**
     * @dev Attempted to deposit more assets than the max amount for `receiver`.
     */
    error ERC4626ExceededMaxDeposit(address receiver, uint256 assets, uint256 max);

    /**
     * @dev Attempted to mint more shares than the max amount for `receiver`.
     */
    error ERC4626ExceededMaxMint(address receiver, uint256 shares, uint256 max);

    /**
     * @dev Attempted to withdraw more assets than the max amount for `receiver`.
     */
    error ERC4626ExceededMaxWithdraw(address owner, uint256 assets, uint256 max);

    /**
     * @dev Attempted to redeem more shares than the max amount for `receiver`.
     */
    error ERC4626ExceededMaxRedeem(address owner, uint256 shares, uint256 max);

    /**
     * @dev Set the underlying asset contract. This must be an ERC20-compatible contract (ERC-20 or ERC-777).
     */
    constructor(IERC20 asset_) {
        (bool success, uint8 assetDecimals) = _tryGetAssetDecimals(asset_);
        _underlyingDecimals = success ? assetDecimals : 18;
        _asset = asset_;
    }

    /**
     * @dev Attempts to fetch the asset decimals. A return value of false indicates that the attempt failed in some way.
     */
    function _tryGetAssetDecimals(IERC20 asset_) private view returns (bool ok, uint8 assetDecimals) {
        (bool success, bytes memory encodedDecimals) = address(asset_).staticcall(
            abi.encodeCall(IERC20Metadata.decimals, ())
        );
        if (success && encodedDecimals.length >= 32) {
            uint256 returnedDecimals = abi.decode(encodedDecimals, (uint256));
            if (returnedDecimals <= type(uint8).max) {
                return (true, uint8(returnedDecimals));
            }
        }
        return (false, 0);
    }

    /**
     * @dev Decimals are computed by adding the decimal offset on top of the underlying asset's decimals. This
     * "original" value is cached during construction of the vault contract. If this read operation fails (e.g., the
     * asset has not been created yet), a default of 18 is used to represent the underlying asset's decimals.
     *
     * See {IERC20Metadata-decimals}.
     */
    function decimals() public view virtual override(IERC20Metadata, ERC20) returns (uint8) {
        return _underlyingDecimals + _decimalsOffset();
    }

    /** @dev See {IERC4626-asset}. */
    function asset() public view virtual returns (address) {
        return address(_asset);
    }

    /** @dev See {IERC4626-totalAssets}. */
    function totalAssets() public view virtual returns (uint256) {
        return IERC20(asset()).balanceOf(address(this));
    }

    /** @dev See {IERC4626-convertToShares}. */
    function convertToShares(uint256 assets) public view virtual returns (uint256) {
        return _convertToShares(assets, Math.Rounding.Floor);
    }

    /** @dev See {IERC4626-convertToAssets}. */
    function convertToAssets(uint256 shares) public view virtual returns (uint256) {
        return _convertToAssets(shares, Math.Rounding.Floor);
    }

    /** @dev See {IERC4626-maxDeposit}. */
    function maxDeposit(address) public view virtual returns (uint256) {
        return type(uint256).max;
    }

    /** @dev See {IERC4626-maxMint}. */
    function maxMint(address) public view virtual returns (uint256) {
        return type(uint256).max;
    }

    /** @dev See {IERC4626-maxWithdraw}. */
    function maxWithdraw(address owner) public view virtual returns (uint256) {
        return _convertToAssets(balanceOf(owner), Math.Rounding.Floor);
    }

    /** @dev See {IERC4626-maxRedeem}. */
    function maxRedeem(address owner) public view virtual returns (uint256) {
        return balanceOf(owner);
    }

    /** @dev See {IERC4626-previewDeposit}. */
    function previewDeposit(uint256 assets) public view virtual returns (uint256) {
        return _convertToShares(assets, Math.Rounding.Floor);
    }

    /** @dev See {IERC4626-previewMint}. */
    function previewMint(uint256 shares) public view virtual returns (uint256) {
        return _convertToAssets(shares, Math.Rounding.Ceil);
    }

    /** @dev See {IERC4626-previewWithdraw}. */
    function previewWithdraw(uint256 assets) public view virtual returns (uint256) {
        return _convertToShares(assets, Math.Rounding.Ceil);
    }

    /** @dev See {IERC4626-previewRedeem}. */
    function previewRedeem(uint256 shares) public view virtual returns (uint256) {
        return _convertToAssets(shares, Math.Rounding.Floor);
    }

    /** @dev See {IERC4626-deposit}. */
    function deposit(uint256 assets, address receiver) public virtual returns (uint256) {
        uint256 maxAssets = maxDeposit(receiver);
        if (assets > maxAssets) {
            revert ERC4626ExceededMaxDeposit(receiver, assets, maxAssets);
        }

        uint256 shares = previewDeposit(assets);
        _deposit(_msgSender(), receiver, assets, shares);

        return shares;
    }

    /** @dev See {IERC4626-mint}. */
    function mint(uint256 shares, address receiver) public virtual returns (uint256) {
        uint256 maxShares = maxMint(receiver);
        if (shares > maxShares) {
            revert ERC4626ExceededMaxMint(receiver, shares, maxShares);
        }

        uint256 assets = previewMint(shares);
        _deposit(_msgSender(), receiver, assets, shares);

        return assets;
    }

    /** @dev See {IERC4626-withdraw}. */
    function withdraw(uint256 assets, address receiver, address owner) public virtual returns (uint256) {
        uint256 maxAssets = maxWithdraw(owner);
        if (assets > maxAssets) {
            revert ERC4626ExceededMaxWithdraw(owner, assets, maxAssets);
        }

        uint256 shares = previewWithdraw(assets);
        _withdraw(_msgSender(), receiver, owner, assets, shares);

        return shares;
    }

    /** @dev See {IERC4626-redeem}. */
    function redeem(uint256 shares, address receiver, address owner) public virtual returns (uint256) {
        uint256 maxShares = maxRedeem(owner);
        if (shares > maxShares) {
            revert ERC4626ExceededMaxRedeem(owner, shares, maxShares);
        }

        uint256 assets = previewRedeem(shares);
        _withdraw(_msgSender(), receiver, owner, assets, shares);

        return assets;
    }

    /**
     * @dev Internal conversion function (from assets to shares) with support for rounding direction.
     */
    function _convertToShares(uint256 assets, Math.Rounding rounding) internal view virtual returns (uint256) {
        return assets.mulDiv(totalSupply() + 10 ** _decimalsOffset(), totalAssets() + 1, rounding);
    }

    /**
     * @dev Internal conversion function (from shares to assets) with support for rounding direction.
     */
    function _convertToAssets(uint256 shares, Math.Rounding rounding) internal view virtual returns (uint256) {
        return shares.mulDiv(totalAssets() + 1, totalSupply() + 10 ** _decimalsOffset(), rounding);
    }

    /**
     * @dev Deposit/mint common workflow.
     */
    function _deposit(address caller, address receiver, uint256 assets, uint256 shares) internal virtual {
        // If asset() is ERC-777, `transferFrom` can trigger a reentrancy BEFORE the transfer happens through the
        // `tokensToSend` hook. On the other hand, the `tokenReceived` hook, that is triggered after the transfer,
        // calls the vault, which is assumed not malicious.
        //
        // Conclusion: we need to do the transfer before we mint so that any reentrancy would happen before the
        // assets are transferred and before the shares are minted, which is a valid state.
        // slither-disable-next-line reentrancy-no-eth
        SafeERC20.safeTransferFrom(IERC20(asset()), caller, address(this), assets);
        _mint(receiver, shares);

        emit Deposit(caller, receiver, assets, shares);
    }

    /**
     * @dev Withdraw/redeem common workflow.
     */
    function _withdraw(
        address caller,
        address receiver,
        address owner,
        uint256 assets,
        uint256 shares
    ) internal virtual {
        if (caller != owner) {
            _spendAllowance(owner, caller, shares);
        }

        // If asset() is ERC-777, `transfer` can trigger a reentrancy AFTER the transfer happens through the
        // `tokensReceived` hook. On the other hand, the `tokensToSend` hook, that is triggered before the transfer,
        // calls the vault, which is assumed not malicious.
        //
        // Conclusion: we need to do the transfer after the burn so that any reentrancy would happen after the
        // shares are burned and after the assets are transferred, which is a valid state.
        _burn(owner, shares);
        SafeERC20.safeTransfer(IERC20(asset()), receiver, assets);

        emit Withdraw(caller, receiver, owner, assets, shares);
    }

    function _decimalsOffset() internal view virtual returns (uint8) {
        return 0;
    }
}

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

pragma solidity ^0.8.20;

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

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

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

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

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

pragma solidity ^0.8.20;

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

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

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

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

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

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

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

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

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.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.3.0) (utils/Arrays.sol)
// This file was procedurally generated from scripts/generate/templates/Arrays.js.

pragma solidity ^0.8.20;

import {Comparators} from "./Comparators.sol";
import {SlotDerivation} from "./SlotDerivation.sol";
import {StorageSlot} from "./StorageSlot.sol";
import {Math} from "./math/Math.sol";

/**
 * @dev Collection of functions related to array types.
 */
library Arrays {
    using SlotDerivation for bytes32;
    using StorageSlot for bytes32;

    /**
     * @dev Sort an array of uint256 (in memory) following the provided comparator function.
     *
     * This function does the sorting "in place", meaning that it overrides the input. The object is returned for
     * convenience, but that returned value can be discarded safely if the caller has a memory pointer to the array.
     *
     * NOTE: this function's cost is `O(n · log(n))` in average and `O(n²)` in the worst case, with n the length of the
     * array. Using it in view functions that are executed through `eth_call` is safe, but one should be very careful
     * when executing this as part of a transaction. If the array being sorted is too large, the sort operation may
     * consume more gas than is available in a block, leading to potential DoS.
     *
     * IMPORTANT: Consider memory side-effects when using custom comparator functions that access memory in an unsafe way.
     */
    function sort(
        uint256[] memory array,
        function(uint256, uint256) pure returns (bool) comp
    ) internal pure returns (uint256[] memory) {
        _quickSort(_begin(array), _end(array), comp);
        return array;
    }

    /**
     * @dev Variant of {sort} that sorts an array of uint256 in increasing order.
     */
    function sort(uint256[] memory array) internal pure returns (uint256[] memory) {
        sort(array, Comparators.lt);
        return array;
    }

    /**
     * @dev Sort an array of address (in memory) following the provided comparator function.
     *
     * This function does the sorting "in place", meaning that it overrides the input. The object is returned for
     * convenience, but that returned value can be discarded safely if the caller has a memory pointer to the array.
     *
     * NOTE: this function's cost is `O(n · log(n))` in average and `O(n²)` in the worst case, with n the length of the
     * array. Using it in view functions that are executed through `eth_call` is safe, but one should be very careful
     * when executing this as part of a transaction. If the array being sorted is too large, the sort operation may
     * consume more gas than is available in a block, leading to potential DoS.
     *
     * IMPORTANT: Consider memory side-effects when using custom comparator functions that access memory in an unsafe way.
     */
    function sort(
        address[] memory array,
        function(address, address) pure returns (bool) comp
    ) internal pure returns (address[] memory) {
        sort(_castToUint256Array(array), _castToUint256Comp(comp));
        return array;
    }

    /**
     * @dev Variant of {sort} that sorts an array of address in increasing order.
     */
    function sort(address[] memory array) internal pure returns (address[] memory) {
        sort(_castToUint256Array(array), Comparators.lt);
        return array;
    }

    /**
     * @dev Sort an array of bytes32 (in memory) following the provided comparator function.
     *
     * This function does the sorting "in place", meaning that it overrides the input. The object is returned for
     * convenience, but that returned value can be discarded safely if the caller has a memory pointer to the array.
     *
     * NOTE: this function's cost is `O(n · log(n))` in average and `O(n²)` in the worst case, with n the length of the
     * array. Using it in view functions that are executed through `eth_call` is safe, but one should be very careful
     * when executing this as part of a transaction. If the array being sorted is too large, the sort operation may
     * consume more gas than is available in a block, leading to potential DoS.
     *
     * IMPORTANT: Consider memory side-effects when using custom comparator functions that access memory in an unsafe way.
     */
    function sort(
        bytes32[] memory array,
        function(bytes32, bytes32) pure returns (bool) comp
    ) internal pure returns (bytes32[] memory) {
        sort(_castToUint256Array(array), _castToUint256Comp(comp));
        return array;
    }

    /**
     * @dev Variant of {sort} that sorts an array of bytes32 in increasing order.
     */
    function sort(bytes32[] memory array) internal pure returns (bytes32[] memory) {
        sort(_castToUint256Array(array), Comparators.lt);
        return array;
    }

    /**
     * @dev Performs a quick sort of a segment of memory. The segment sorted starts at `begin` (inclusive), and stops
     * at end (exclusive). Sorting follows the `comp` comparator.
     *
     * Invariant: `begin <= end`. This is the case when initially called by {sort} and is preserved in subcalls.
     *
     * IMPORTANT: Memory locations between `begin` and `end` are not validated/zeroed. This function should
     * be used only if the limits are within a memory array.
     */
    function _quickSort(uint256 begin, uint256 end, function(uint256, uint256) pure returns (bool) comp) private pure {
        unchecked {
            if (end - begin < 0x40) return;

            // Use first element as pivot
            uint256 pivot = _mload(begin);
            // Position where the pivot should be at the end of the loop
            uint256 pos = begin;

            for (uint256 it = begin + 0x20; it < end; it += 0x20) {
                if (comp(_mload(it), pivot)) {
                    // If the value stored at the iterator's position comes before the pivot, we increment the
                    // position of the pivot and move the value there.
                    pos += 0x20;
                    _swap(pos, it);
                }
            }

            _swap(begin, pos); // Swap pivot into place
            _quickSort(begin, pos, comp); // Sort the left side of the pivot
            _quickSort(pos + 0x20, end, comp); // Sort the right side of the pivot
        }
    }

    /**
     * @dev Pointer to the memory location of the first element of `array`.
     */
    function _begin(uint256[] memory array) private pure returns (uint256 ptr) {
        assembly ("memory-safe") {
            ptr := add(array, 0x20)
        }
    }

    /**
     * @dev Pointer to the memory location of the first memory word (32bytes) after `array`. This is the memory word
     * that comes just after the last element of the array.
     */
    function _end(uint256[] memory array) private pure returns (uint256 ptr) {
        unchecked {
            return _begin(array) + array.length * 0x20;
        }
    }

    /**
     * @dev Load memory word (as a uint256) at location `ptr`.
     */
    function _mload(uint256 ptr) private pure returns (uint256 value) {
        assembly {
            value := mload(ptr)
        }
    }

    /**
     * @dev Swaps the elements memory location `ptr1` and `ptr2`.
     */
    function _swap(uint256 ptr1, uint256 ptr2) private pure {
        assembly {
            let value1 := mload(ptr1)
            let value2 := mload(ptr2)
            mstore(ptr1, value2)
            mstore(ptr2, value1)
        }
    }

    /// @dev Helper: low level cast address memory array to uint256 memory array
    function _castToUint256Array(address[] memory input) private pure returns (uint256[] memory output) {
        assembly {
            output := input
        }
    }

    /// @dev Helper: low level cast bytes32 memory array to uint256 memory array
    function _castToUint256Array(bytes32[] memory input) private pure returns (uint256[] memory output) {
        assembly {
            output := input
        }
    }

    /// @dev Helper: low level cast address comp function to uint256 comp function
    function _castToUint256Comp(
        function(address, address) pure returns (bool) input
    ) private pure returns (function(uint256, uint256) pure returns (bool) output) {
        assembly {
            output := input
        }
    }

    /// @dev Helper: low level cast bytes32 comp function to uint256 comp function
    function _castToUint256Comp(
        function(bytes32, bytes32) pure returns (bool) input
    ) private pure returns (function(uint256, uint256) pure returns (bool) output) {
        assembly {
            output := input
        }
    }

    /**
     * @dev Searches a sorted `array` and returns the first index that contains
     * a value greater or equal to `element`. If no such index exists (i.e. all
     * values in the array are strictly less than `element`), the array length is
     * returned. Time complexity O(log n).
     *
     * NOTE: The `array` is expected to be sorted in ascending order, and to
     * contain no repeated elements.
     *
     * IMPORTANT: Deprecated. This implementation behaves as {lowerBound} but lacks
     * support for repeated elements in the array. The {lowerBound} function should
     * be used instead.
     */
    function findUpperBound(uint256[] storage array, uint256 element) internal view returns (uint256) {
        uint256 low = 0;
        uint256 high = array.length;

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

        while (low < high) {
            uint256 mid = Math.average(low, high);

            // Note that mid will always be strictly less than high (i.e. it will be a valid array index)
            // because Math.average rounds towards zero (it does integer division with truncation).
            if (unsafeAccess(array, mid).value > element) {
                high = mid;
            } else {
                low = mid + 1;
            }
        }

        // At this point `low` is the exclusive upper bound. We will return the inclusive upper bound.
        if (low > 0 && unsafeAccess(array, low - 1).value == element) {
            return low - 1;
        } else {
            return low;
        }
    }

    /**
     * @dev Searches an `array` sorted in ascending order and returns the first
     * index that contains a value greater or equal than `element`. If no such index
     * exists (i.e. all values in the array are strictly less than `element`), the array
     * length is returned. Time complexity O(log n).
     *
     * See C++'s https://en.cppreference.com/w/cpp/algorithm/lower_bound[lower_bound].
     */
    function lowerBound(uint256[] storage array, uint256 element) internal view returns (uint256) {
        uint256 low = 0;
        uint256 high = array.length;

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

        while (low < high) {
            uint256 mid = Math.average(low, high);

            // Note that mid will always be strictly less than high (i.e. it will be a valid array index)
            // because Math.average rounds towards zero (it does integer division with truncation).
            if (unsafeAccess(array, mid).value < element) {
                // this cannot overflow because mid < high
                unchecked {
                    low = mid + 1;
                }
            } else {
                high = mid;
            }
        }

        return low;
    }

    /**
     * @dev Searches an `array` sorted in ascending order and returns the first
     * index that contains a value strictly greater than `element`. If no such index
     * exists (i.e. all values in the array are strictly less than `element`), the array
     * length is returned. Time complexity O(log n).
     *
     * See C++'s https://en.cppreference.com/w/cpp/algorithm/upper_bound[upper_bound].
     */
    function upperBound(uint256[] storage array, uint256 element) internal view returns (uint256) {
        uint256 low = 0;
        uint256 high = array.length;

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

        while (low < high) {
            uint256 mid = Math.average(low, high);

            // Note that mid will always be strictly less than high (i.e. it will be a valid array index)
            // because Math.average rounds towards zero (it does integer division with truncation).
            if (unsafeAccess(array, mid).value > element) {
                high = mid;
            } else {
                // this cannot overflow because mid < high
                unchecked {
                    low = mid + 1;
                }
            }
        }

        return low;
    }

    /**
     * @dev Same as {lowerBound}, but with an array in memory.
     */
    function lowerBoundMemory(uint256[] memory array, uint256 element) internal pure returns (uint256) {
        uint256 low = 0;
        uint256 high = array.length;

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

        while (low < high) {
            uint256 mid = Math.average(low, high);

            // Note that mid will always be strictly less than high (i.e. it will be a valid array index)
            // because Math.average rounds towards zero (it does integer division with truncation).
            if (unsafeMemoryAccess(array, mid) < element) {
                // this cannot overflow because mid < high
                unchecked {
                    low = mid + 1;
                }
            } else {
                high = mid;
            }
        }

        return low;
    }

    /**
     * @dev Same as {upperBound}, but with an array in memory.
     */
    function upperBoundMemory(uint256[] memory array, uint256 element) internal pure returns (uint256) {
        uint256 low = 0;
        uint256 high = array.length;

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

        while (low < high) {
            uint256 mid = Math.average(low, high);

            // Note that mid will always be strictly less than high (i.e. it will be a valid array index)
            // because Math.average rounds towards zero (it does integer division with truncation).
            if (unsafeMemoryAccess(array, mid) > element) {
                high = mid;
            } else {
                // this cannot overflow because mid < high
                unchecked {
                    low = mid + 1;
                }
            }
        }

        return low;
    }

    /**
     * @dev Access an array in an "unsafe" way. Skips solidity "index-out-of-range" check.
     *
     * WARNING: Only use if you are certain `pos` is lower than the array length.
     */
    function unsafeAccess(address[] storage arr, uint256 pos) internal pure returns (StorageSlot.AddressSlot storage) {
        bytes32 slot;
        assembly ("memory-safe") {
            slot := arr.slot
        }
        return slot.deriveArray().offset(pos).getAddressSlot();
    }

    /**
     * @dev Access an array in an "unsafe" way. Skips solidity "index-out-of-range" check.
     *
     * WARNING: Only use if you are certain `pos` is lower than the array length.
     */
    function unsafeAccess(bytes32[] storage arr, uint256 pos) internal pure returns (StorageSlot.Bytes32Slot storage) {
        bytes32 slot;
        assembly ("memory-safe") {
            slot := arr.slot
        }
        return slot.deriveArray().offset(pos).getBytes32Slot();
    }

    /**
     * @dev Access an array in an "unsafe" way. Skips solidity "index-out-of-range" check.
     *
     * WARNING: Only use if you are certain `pos` is lower than the array length.
     */
    function unsafeAccess(uint256[] storage arr, uint256 pos) internal pure returns (StorageSlot.Uint256Slot storage) {
        bytes32 slot;
        assembly ("memory-safe") {
            slot := arr.slot
        }
        return slot.deriveArray().offset(pos).getUint256Slot();
    }

    /**
     * @dev Access an array in an "unsafe" way. Skips solidity "index-out-of-range" check.
     *
     * WARNING: Only use if you are certain `pos` is lower than the array length.
     */
    function unsafeMemoryAccess(address[] memory arr, uint256 pos) internal pure returns (address res) {
        assembly {
            res := mload(add(add(arr, 0x20), mul(pos, 0x20)))
        }
    }

    /**
     * @dev Access an array in an "unsafe" way. Skips solidity "index-out-of-range" check.
     *
     * WARNING: Only use if you are certain `pos` is lower than the array length.
     */
    function unsafeMemoryAccess(bytes32[] memory arr, uint256 pos) internal pure returns (bytes32 res) {
        assembly {
            res := mload(add(add(arr, 0x20), mul(pos, 0x20)))
        }
    }

    /**
     * @dev Access an array in an "unsafe" way. Skips solidity "index-out-of-range" check.
     *
     * WARNING: Only use if you are certain `pos` is lower than the array length.
     */
    function unsafeMemoryAccess(uint256[] memory arr, uint256 pos) internal pure returns (uint256 res) {
        assembly {
            res := mload(add(add(arr, 0x20), mul(pos, 0x20)))
        }
    }

    /**
     * @dev Helper to set the length of a dynamic array. Directly writing to `.length` is forbidden.
     *
     * WARNING: this does not clear elements if length is reduced, of initialize elements if length is increased.
     */
    function unsafeSetLength(address[] storage array, uint256 len) internal {
        assembly ("memory-safe") {
            sstore(array.slot, len)
        }
    }

    /**
     * @dev Helper to set the length of a dynamic array. Directly writing to `.length` is forbidden.
     *
     * WARNING: this does not clear elements if length is reduced, of initialize elements if length is increased.
     */
    function unsafeSetLength(bytes32[] storage array, uint256 len) internal {
        assembly ("memory-safe") {
            sstore(array.slot, len)
        }
    }

    /**
     * @dev Helper to set the length of a dynamic array. Directly writing to `.length` is forbidden.
     *
     * WARNING: this does not clear elements if length is reduced, of initialize elements if length is increased.
     */
    function unsafeSetLength(uint256[] storage array, uint256 len) internal {
        assembly ("memory-safe") {
            sstore(array.slot, len)
        }
    }
}

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

pragma solidity ^0.8.20;

/**
 * @dev Provides a set of functions to compare values.
 *
 * _Available since v5.1._
 */
library Comparators {
    function lt(uint256 a, uint256 b) internal pure returns (bool) {
        return a < b;
    }

    function gt(uint256 a, uint256 b) internal pure returns (bool) {
        return a > b;
    }
}

// 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/introspection/IERC165.sol)

pragma solidity ^0.8.20;

/**
 * @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/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/SlotDerivation.sol)
// This file was procedurally generated from scripts/generate/templates/SlotDerivation.js.

pragma solidity ^0.8.20;

/**
 * @dev Library for computing storage (and transient storage) locations from namespaces and deriving slots
 * corresponding to standard patterns. The derivation method for array and mapping matches the storage layout used by
 * the solidity language / compiler.
 *
 * See https://docs.soliditylang.org/en/v0.8.20/internals/layout_in_storage.html#mappings-and-dynamic-arrays[Solidity docs for mappings and dynamic arrays.].
 *
 * Example usage:
 * ```solidity
 * contract Example {
 *     // Add the library methods
 *     using StorageSlot for bytes32;
 *     using SlotDerivation for bytes32;
 *
 *     // Declare a namespace
 *     string private constant _NAMESPACE = "<namespace>"; // eg. OpenZeppelin.Slot
 *
 *     function setValueInNamespace(uint256 key, address newValue) internal {
 *         _NAMESPACE.erc7201Slot().deriveMapping(key).getAddressSlot().value = newValue;
 *     }
 *
 *     function getValueInNamespace(uint256 key) internal view returns (address) {
 *         return _NAMESPACE.erc7201Slot().deriveMapping(key).getAddressSlot().value;
 *     }
 * }
 * ```
 *
 * TIP: Consider using this library along with {StorageSlot}.
 *
 * NOTE: This library provides a way to manipulate storage locations in a non-standard way. Tooling for checking
 * upgrade safety will ignore the slots accessed through this library.
 *
 * _Available since v5.1._
 */
library SlotDerivation {
    /**
     * @dev Derive an ERC-7201 slot from a string (namespace).
     */
    function erc7201Slot(string memory namespace) internal pure returns (bytes32 slot) {
        assembly ("memory-safe") {
            mstore(0x00, sub(keccak256(add(namespace, 0x20), mload(namespace)), 1))
            slot := and(keccak256(0x00, 0x20), not(0xff))
        }
    }

    /**
     * @dev Add an offset to a slot to get the n-th element of a structure or an array.
     */
    function offset(bytes32 slot, uint256 pos) internal pure returns (bytes32 result) {
        unchecked {
            return bytes32(uint256(slot) + pos);
        }
    }

    /**
     * @dev Derive the location of the first element in an array from the slot where the length is stored.
     */
    function deriveArray(bytes32 slot) internal pure returns (bytes32 result) {
        assembly ("memory-safe") {
            mstore(0x00, slot)
            result := keccak256(0x00, 0x20)
        }
    }

    /**
     * @dev Derive the location of a mapping element from the key.
     */
    function deriveMapping(bytes32 slot, address key) internal pure returns (bytes32 result) {
        assembly ("memory-safe") {
            mstore(0x00, and(key, shr(96, not(0))))
            mstore(0x20, slot)
            result := keccak256(0x00, 0x40)
        }
    }

    /**
     * @dev Derive the location of a mapping element from the key.
     */
    function deriveMapping(bytes32 slot, bool key) internal pure returns (bytes32 result) {
        assembly ("memory-safe") {
            mstore(0x00, iszero(iszero(key)))
            mstore(0x20, slot)
            result := keccak256(0x00, 0x40)
        }
    }

    /**
     * @dev Derive the location of a mapping element from the key.
     */
    function deriveMapping(bytes32 slot, bytes32 key) internal pure returns (bytes32 result) {
        assembly ("memory-safe") {
            mstore(0x00, key)
            mstore(0x20, slot)
            result := keccak256(0x00, 0x40)
        }
    }

    /**
     * @dev Derive the location of a mapping element from the key.
     */
    function deriveMapping(bytes32 slot, uint256 key) internal pure returns (bytes32 result) {
        assembly ("memory-safe") {
            mstore(0x00, key)
            mstore(0x20, slot)
            result := keccak256(0x00, 0x40)
        }
    }

    /**
     * @dev Derive the location of a mapping element from the key.
     */
    function deriveMapping(bytes32 slot, int256 key) internal pure returns (bytes32 result) {
        assembly ("memory-safe") {
            mstore(0x00, key)
            mstore(0x20, slot)
            result := keccak256(0x00, 0x40)
        }
    }

    /**
     * @dev Derive the location of a mapping element from the key.
     */
    function deriveMapping(bytes32 slot, string memory key) internal pure returns (bytes32 result) {
        assembly ("memory-safe") {
            let length := mload(key)
            let begin := add(key, 0x20)
            let end := add(begin, length)
            let cache := mload(end)
            mstore(end, slot)
            result := keccak256(begin, add(length, 0x20))
            mstore(end, cache)
        }
    }

    /**
     * @dev Derive the location of a mapping element from the key.
     */
    function deriveMapping(bytes32 slot, bytes memory key) internal pure returns (bytes32 result) {
        assembly ("memory-safe") {
            let length := mload(key)
            let begin := add(key, 0x20)
            let end := add(begin, length)
            let cache := mload(end)
            mstore(end, slot)
            result := keccak256(begin, add(length, 0x20))
            mstore(end, cache)
        }
    }
}

// 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.3.0) (utils/structs/EnumerableSet.sol)
// This file was procedurally generated from scripts/generate/templates/EnumerableSet.js.

pragma solidity ^0.8.20;

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

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

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

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

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

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

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

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

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

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

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

            return true;
        } else {
            return false;
        }
    }

    /**
     * @dev Removes all the values from a set. O(n).
     *
     * WARNING: Developers should keep in mind that this function has an unbounded cost and using it may render the
     * function uncallable if the set grows to the point where clearing it consumes too much gas to fit in a block.
     */
    function _clear(Set storage set) private {
        uint256 len = _length(set);
        for (uint256 i = 0; i < len; ++i) {
            delete set._positions[set._values[i]];
        }
        Arrays.unsafeSetLength(set._values, 0);
    }

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

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

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

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

    // Bytes32Set

    struct Bytes32Set {
        Set _inner;
    }

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

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

    /**
     * @dev Removes all the values from a set. O(n).
     *
     * WARNING: Developers should keep in mind that this function has an unbounded cost and using it may render the
     * function uncallable if the set grows to the point where clearing it consumes too much gas to fit in a block.
     */
    function clear(Bytes32Set storage set) internal {
        _clear(set._inner);
    }

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

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

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

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

        assembly ("memory-safe") {
            result := store
        }

        return result;
    }

    // AddressSet

    struct AddressSet {
        Set _inner;
    }

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

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

    /**
     * @dev Removes all the values from a set. O(n).
     *
     * WARNING: Developers should keep in mind that this function has an unbounded cost and using it may render the
     * function uncallable if the set grows to the point where clearing it consumes too much gas to fit in a block.
     */
    function clear(AddressSet storage set) internal {
        _clear(set._inner);
    }

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

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

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

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

        assembly ("memory-safe") {
            result := store
        }

        return result;
    }

    // UintSet

    struct UintSet {
        Set _inner;
    }

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

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

    /**
     * @dev Removes all the values from a set. O(n).
     *
     * WARNING: Developers should keep in mind that this function has an unbounded cost and using it may render the
     * function uncallable if the set grows to the point where clearing it consumes too much gas to fit in a block.
     */
    function clear(UintSet storage set) internal {
        _clear(set._inner);
    }

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

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

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

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

        assembly ("memory-safe") {
            result := store
        }

        return result;
    }
}

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

interface IBaseStrategy {
    function brinkVault() external view returns (address);
    function asset() external view returns (address);
    function reserve() external view returns (address);
    function balance() external view returns (uint256);
    function supply(uint256 assetAmount) external;
    function withdraw(uint256 assetAmount) external;
    function harvest() external;
}

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

interface IBrinkVault {
    //////////////////////////////////////////////////////////////
    //                  STRUCTS                                   //
    //////////////////////////////////////////////////////////////

    /// @notice Struct to hold rebalance arguments
    /// @notice strategiesRebalanceFrom must be an ordered array of strategy addresses with no duplicates
    /// @param strategiesRebalanceFrom Array of strategy addresses to rebalance from
    /// @param weightsRebalanceFrom Array of weights to rebalance from each strategy
    /// @param strategiesRebalanceTo Array of strategy addresses to rebalance to
    /// @param weightsOfRedestribution Array of weights for redistribution
    /// @param slippage Slippage tolerance for the rebalance
    struct RebalanceArgs {
        address[] strategiesRebalanceFrom;
        uint256[] weightsRebalanceFrom;
        address[] strategiesRebalanceTo;
        uint256[] weightsOfRedestribution;
    }

    /// @notice Structure of strategies which are active right now and their weights
    struct StrategyConfig {
        address strategy;
        uint256 weight;
    }

    struct DepositArgs {
        address recipient;
        uint256 assets;
        uint256 shares;
        uint256 numberOfStrategies;
        StrategyConfig[] strategyConfigs;
    }

    struct WithdrawArgs {
        address recipient;
        address owner;
        uint256 assets;
        uint256 shares;
        uint256 numberOfStrategies;
        StrategyConfig[] strategyConfigs;
    }



    //////////////////////////////////////////////////////////////
    //                  ErrorsLib                                   //
    //////////////////////////////////////////////////////////////

    error STRATEGY_DOES_NOT_EXIST();
    error STRATEGY_ALREADY_EXISTS();
    error STRATEGY_DOES_NOT_SUPPORT_ASSET();
    error STRATEGY_DOES_NOT_SUPPORT_VAULT();
    error CANNOT_REMOVE_NOT_EMPTY_STRATEGY();
    error CANNOT_REMOVE_LAST_STRATEGY();
    error ALREADY_INITIALIZED();
    error NOT_VAULT_STRATEGIST();
    error NOT_VAULT_MANAGER();
    error EMPTY_WEIGHTS_REBALANCE_FROM();
    error EMPTY_STRATEGY_ARRAYS();
    error INVALID_STRATEGY_REBALANCE_FROM();
    error DUPLICATE_STRATEGY_REBALANCE_FROM();
    error DUPLICATE_STRATEGIES_REBALANCE_TO();
    error STRATEGY_NOT_WHITELISTED();
    error INVALID_WEIGHTS();
    error DEPOSIT_LIMIT_EXCEEDED();
    error SLIPPAGE_TOO_HIGH();

    //////////////////////////////////////////////////////////////
    //                  EVENTS                                   //
    //////////////////////////////////////////////////////////////

    /// @notice Emitted when the BrinkVault is rebalanced
    /// @param strategies Array of final strategy addresses of the BrinkVault
    /// @param finalWeights Array of final weights of the BrinkVault
    event RebalanceComplete(address[] strategies, uint256[] finalWeights);

    /// @notice Emitted when the deposit limit is set
    /// @param depositLimit The new deposit limit
    event DepositLimitSet(uint256 depositLimit);

    /// @notice Emitted when dust is forwarded to the paymaster
    /// @param dust The amount of dust forwarded
    event DustForwardedToPaymaster(uint256 dust);

    /// @notice Emitted when the strategist is set
    /// @param strategist The new strategist
    event StrategistSet(address strategist);

    event Initialized(address[] strategies, uint256[] weights);

    /// @notice Emitted when a strategy is whitelisted
    /// @param strategy The strategy address that was whitelisted
    /// @param isWhitelisted Whether the strategy was whitelisted
    event StrategyWhitelisted(address strategy, bool isWhitelisted);

    /// @notice Emitted when the vault manager is set
    /// @param vaultManager The new vault manager
    event VaultManagerSet(address vaultManager);

    event Deposited(address caller, address receiver, uint256 assetAmount, uint256 shares);

    event Withdrawal(address caller, address receiver, uint256 assetAmount, uint256 shares);

    /// @notice Emitted when funds are deposited into strategies by strategist
    /// @param assets The amount of funds deposited
    event DepositFunds(uint256 assets);

    /// @notice Emitted when funds are withdrawn from strategies by strategist
    /// @param assets The amount of funds withdrawn
    event WithdrawFunds(uint256 assets);
}

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

library ErrorsLib {
    /// @notice Error thrown when a zero address is provided
    error ZERO_ADDRESS();

    /// @notice Error thrown when a zero amount is provided
    error ZERO_AMOUNT();

    /// @notice Error thrown when a zero byte array is provided
    error ZERO_BYTES();

    /// @notice Error thrown when the number of strategies is zero
    error ZERO_STRATEGIES();

    /// @notice Error thrown when array lengths do not match
    error ARRAY_LENGTH_MISMATCH();

    /// @notice Error thrown when the asset address does not match
    error ASSET_MISMATCH();

    /// @notice Error thrown when a strategy already exists
    error DUPLICATE_STRATEGY(address strategy);
}

{
  "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":"_asset","type":"address"},{"internalType":"address","name":"_strategist","type":"address"},{"internalType":"address","name":"_vaultManager","type":"address"},{"internalType":"string","name":"_name","type":"string"},{"internalType":"string","name":"_symbol","type":"string"},{"internalType":"uint256","name":"_depositLimit","type":"uint256"}],"stateMutability":"nonpayable","type":"constructor"},{"inputs":[],"name":"ALREADY_INITIALIZED","type":"error"},{"inputs":[],"name":"ARRAY_LENGTH_MISMATCH","type":"error"},{"inputs":[],"name":"CANNOT_REMOVE_LAST_STRATEGY","type":"error"},{"inputs":[],"name":"CANNOT_REMOVE_NOT_EMPTY_STRATEGY","type":"error"},{"inputs":[],"name":"DEPOSIT_LIMIT_EXCEEDED","type":"error"},{"inputs":[],"name":"DUPLICATE_STRATEGIES_REBALANCE_TO","type":"error"},{"inputs":[{"internalType":"address","name":"strategy","type":"address"}],"name":"DUPLICATE_STRATEGY","type":"error"},{"inputs":[],"name":"DUPLICATE_STRATEGY_REBALANCE_FROM","type":"error"},{"inputs":[],"name":"EMPTY_STRATEGY_ARRAYS","type":"error"},{"inputs":[],"name":"EMPTY_WEIGHTS_REBALANCE_FROM","type":"error"},{"inputs":[{"internalType":"address","name":"spender","type":"address"},{"internalType":"uint256","name":"allowance","type":"uint256"},{"internalType":"uint256","name":"needed","type":"uint256"}],"name":"ERC20InsufficientAllowance","type":"error"},{"inputs":[{"internalType":"address","name":"sender","type":"address"},{"internalType":"uint256","name":"balance","type":"uint256"},{"internalType":"uint256","name":"needed","type":"uint256"}],"name":"ERC20InsufficientBalance","type":"error"},{"inputs":[{"internalType":"address","name":"approver","type":"address"}],"name":"ERC20InvalidApprover","type":"error"},{"inputs":[{"internalType":"address","name":"receiver","type":"address"}],"name":"ERC20InvalidReceiver","type":"error"},{"inputs":[{"internalType":"address","name":"sender","type":"address"}],"name":"ERC20InvalidSender","type":"error"},{"inputs":[{"internalType":"address","name":"spender","type":"address"}],"name":"ERC20InvalidSpender","type":"error"},{"inputs":[{"internalType":"address","name":"receiver","type":"address"},{"internalType":"uint256","name":"assets","type":"uint256"},{"internalType":"uint256","name":"max","type":"uint256"}],"name":"ERC4626ExceededMaxDeposit","type":"error"},{"inputs":[{"internalType":"address","name":"receiver","type":"address"},{"internalType":"uint256","name":"shares","type":"uint256"},{"internalType":"uint256","name":"max","type":"uint256"}],"name":"ERC4626ExceededMaxMint","type":"error"},{"inputs":[{"internalType":"address","name":"owner","type":"address"},{"internalType":"uint256","name":"shares","type":"uint256"},{"internalType":"uint256","name":"max","type":"uint256"}],"name":"ERC4626ExceededMaxRedeem","type":"error"},{"inputs":[{"internalType":"address","name":"owner","type":"address"},{"internalType":"uint256","name":"assets","type":"uint256"},{"internalType":"uint256","name":"max","type":"uint256"}],"name":"ERC4626ExceededMaxWithdraw","type":"error"},{"inputs":[],"name":"INVALID_STRATEGY_REBALANCE_FROM","type":"error"},{"inputs":[],"name":"INVALID_WEIGHTS","type":"error"},{"inputs":[],"name":"NOT_VAULT_MANAGER","type":"error"},{"inputs":[],"name":"NOT_VAULT_STRATEGIST","type":"error"},{"inputs":[],"name":"ReentrancyGuardReentrantCall","type":"error"},{"inputs":[],"name":"SLIPPAGE_TOO_HIGH","type":"error"},{"inputs":[],"name":"STRATEGY_ALREADY_EXISTS","type":"error"},{"inputs":[],"name":"STRATEGY_DOES_NOT_EXIST","type":"error"},{"inputs":[],"name":"STRATEGY_DOES_NOT_SUPPORT_ASSET","type":"error"},{"inputs":[],"name":"STRATEGY_DOES_NOT_SUPPORT_VAULT","type":"error"},{"inputs":[],"name":"STRATEGY_NOT_WHITELISTED","type":"error"},{"inputs":[{"internalType":"address","name":"token","type":"address"}],"name":"SafeERC20FailedOperation","type":"error"},{"inputs":[],"name":"ZERO_ADDRESS","type":"error"},{"inputs":[],"name":"ZERO_AMOUNT","type":"error"},{"inputs":[],"name":"ZERO_STRATEGIES","type":"error"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"owner","type":"address"},{"indexed":true,"internalType":"address","name":"spender","type":"address"},{"indexed":false,"internalType":"uint256","name":"value","type":"uint256"}],"name":"Approval","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"sender","type":"address"},{"indexed":true,"internalType":"address","name":"owner","type":"address"},{"indexed":false,"internalType":"uint256","name":"assets","type":"uint256"},{"indexed":false,"internalType":"uint256","name":"shares","type":"uint256"}],"name":"Deposit","type":"event"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"uint256","name":"assets","type":"uint256"}],"name":"DepositFunds","type":"event"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"uint256","name":"depositLimit","type":"uint256"}],"name":"DepositLimitSet","type":"event"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"address","name":"caller","type":"address"},{"indexed":false,"internalType":"address","name":"receiver","type":"address"},{"indexed":false,"internalType":"uint256","name":"assetAmount","type":"uint256"},{"indexed":false,"internalType":"uint256","name":"shares","type":"uint256"}],"name":"Deposited","type":"event"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"uint256","name":"dust","type":"uint256"}],"name":"DustForwardedToPaymaster","type":"event"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"address[]","name":"strategies","type":"address[]"},{"indexed":false,"internalType":"uint256[]","name":"weights","type":"uint256[]"}],"name":"Initialized","type":"event"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"address[]","name":"strategies","type":"address[]"},{"indexed":false,"internalType":"uint256[]","name":"finalWeights","type":"uint256[]"}],"name":"RebalanceComplete","type":"event"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"address","name":"strategist","type":"address"}],"name":"StrategistSet","type":"event"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"address","name":"strategy","type":"address"},{"indexed":false,"internalType":"bool","name":"isWhitelisted","type":"bool"}],"name":"StrategyWhitelisted","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"from","type":"address"},{"indexed":true,"internalType":"address","name":"to","type":"address"},{"indexed":false,"internalType":"uint256","name":"value","type":"uint256"}],"name":"Transfer","type":"event"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"address","name":"vaultManager","type":"address"}],"name":"VaultManagerSet","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"sender","type":"address"},{"indexed":true,"internalType":"address","name":"receiver","type":"address"},{"indexed":true,"internalType":"address","name":"owner","type":"address"},{"indexed":false,"internalType":"uint256","name":"assets","type":"uint256"},{"indexed":false,"internalType":"uint256","name":"shares","type":"uint256"}],"name":"Withdraw","type":"event"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"uint256","name":"assets","type":"uint256"}],"name":"WithdrawFunds","type":"event"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"address","name":"caller","type":"address"},{"indexed":false,"internalType":"address","name":"receiver","type":"address"},{"indexed":false,"internalType":"uint256","name":"assetAmount","type":"uint256"},{"indexed":false,"internalType":"uint256","name":"shares","type":"uint256"}],"name":"Withdrawal","type":"event"},{"inputs":[{"internalType":"address","name":"owner","type":"address"},{"internalType":"address","name":"spender","type":"address"}],"name":"allowance","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"spender","type":"address"},{"internalType":"uint256","name":"value","type":"uint256"}],"name":"approve","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"asset","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"account","type":"address"}],"name":"balanceOf","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"_assets","type":"uint256"}],"name":"checkDepositLimit","outputs":[{"internalType":"bool","name":"_result","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"shares","type":"uint256"}],"name":"convertToAssets","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"assets","type":"uint256"}],"name":"convertToShares","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"decimals","outputs":[{"internalType":"uint8","name":"","type":"uint8"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"_assets","type":"uint256"},{"internalType":"address","name":"_recipient","type":"address"}],"name":"deposit","outputs":[{"internalType":"uint256","name":"_shares","type":"uint256"}],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"depositFunds","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"depositLimit","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"forwardDustToVaultManager","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"getBrinkVaultData","outputs":[{"components":[{"internalType":"address","name":"strategy","type":"address"},{"internalType":"uint256","name":"weight","type":"uint256"}],"internalType":"struct IBrinkVault.StrategyConfig[]","name":"","type":"tuple[]"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address[]","name":"_strategies","type":"address[]"}],"name":"getIsWhitelisted","outputs":[{"internalType":"bool[]","name":"_isWhitelisted","type":"bool[]"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"getWhitelist","outputs":[{"internalType":"address[]","name":"","type":"address[]"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"harvest","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address[]","name":"_strategies","type":"address[]"},{"internalType":"uint256[]","name":"_weights","type":"uint256[]"}],"name":"initialize","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"initialized","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"","type":"address"}],"name":"maxDeposit","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"","type":"address"}],"name":"maxMint","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"owner","type":"address"}],"name":"maxRedeem","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"owner","type":"address"}],"name":"maxWithdraw","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"_shares","type":"uint256"},{"internalType":"address","name":"_recipient","type":"address"}],"name":"mint","outputs":[{"internalType":"uint256","name":"_assets","type":"uint256"}],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"name","outputs":[{"internalType":"string","name":"","type":"string"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"numberOfStrategies","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"assets","type":"uint256"}],"name":"previewDeposit","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"shares","type":"uint256"}],"name":"previewMint","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"shares","type":"uint256"}],"name":"previewRedeem","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"assets","type":"uint256"}],"name":"previewWithdraw","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"components":[{"internalType":"address[]","name":"strategiesRebalanceFrom","type":"address[]"},{"internalType":"uint256[]","name":"weightsRebalanceFrom","type":"uint256[]"},{"internalType":"address[]","name":"strategiesRebalanceTo","type":"address[]"},{"internalType":"uint256[]","name":"weightsOfRedestribution","type":"uint256[]"}],"internalType":"struct IBrinkVault.RebalanceArgs","name":"_rebalanceArgs","type":"tuple"}],"name":"rebalance","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"_shares","type":"uint256"},{"internalType":"address","name":"_recipient","type":"address"},{"internalType":"address","name":"_owner","type":"address"}],"name":"redeem","outputs":[{"internalType":"uint256","name":"_assets","type":"uint256"}],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"_depositLimit","type":"uint256"}],"name":"setDepositLimit","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"strategist_","type":"address"}],"name":"setStrategist","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"_strategy","type":"address"},{"internalType":"bool","name":"_isWhitelisted","type":"bool"}],"name":"setStrategy","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"_vaultManager","type":"address"}],"name":"setVaultManager","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"strategist","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"","type":"uint256"}],"name":"strategyConfigs","outputs":[{"internalType":"address","name":"strategy","type":"address"},{"internalType":"uint256","name":"weight","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"symbol","outputs":[{"internalType":"string","name":"","type":"string"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"totalAssets","outputs":[{"internalType":"uint256","name":"_totalAssets","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"totalSupply","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"to","type":"address"},{"internalType":"uint256","name":"value","type":"uint256"}],"name":"transfer","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"from","type":"address"},{"internalType":"address","name":"to","type":"address"},{"internalType":"uint256","name":"value","type":"uint256"}],"name":"transferFrom","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"vaultManager","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"_assets","type":"uint256"},{"internalType":"address","name":"_recipient","type":"address"},{"internalType":"address","name":"_owner","type":"address"}],"name":"withdraw","outputs":[{"internalType":"uint256","name":"_shares","type":"uint256"}],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"withdrawFunds","outputs":[],"stateMutability":"nonpayable","type":"function"}]

60c060405234801561001057600080fd5b5060405161485938038061485983398101604081905261002f916102b7565b858383600361003e83826103ea565b50600461004b82826103ea565b505050600080610060836100fc60201b60201c565b9150915081610070576012610072565b805b60ff1660a05250506001600160a01b039081166080526001600555851615806100a257506001600160a01b038416155b156100c05760405163538ba4f960e01b815260040160405180910390fd5b600880546001600160a01b039687166001600160a01b031991821617909155600980549590961694169390931790935550600755506104dd9050565b60408051600481526024810182526020810180516001600160e01b031663313ce56760e01b17905290516000918291829182916001600160a01b03871691610143916104a8565b600060405180830381855afa9150503d806000811461017e576040519150601f19603f3d011682016040523d82523d6000602084013e610183565b606091505b509150915081801561019757506020815110155b156101cb576000818060200190518101906101b291906104c4565b905060ff81116101c9576001969095509350505050565b505b5060009485945092505050565b80516001600160a01b03811681146101ef57600080fd5b919050565b634e487b7160e01b600052604160045260246000fd5b60005b8381101561022557818101518382015260200161020d565b50506000910152565b600082601f83011261023f57600080fd5b81516001600160401b03811115610258576102586101f4565b604051601f8201601f19908116603f011681016001600160401b0381118282101715610286576102866101f4565b60405281815283820160200185101561029e57600080fd5b6102af82602083016020870161020a565b949350505050565b60008060008060008060c087890312156102d057600080fd5b6102d9876101d8565b95506102e7602088016101d8565b94506102f5604088016101d8565b60608801519094506001600160401b0381111561031157600080fd5b61031d89828a0161022e565b608089015190945090506001600160401b0381111561033b57600080fd5b61034789828a0161022e565b925050600060a08801519050809150509295509295509295565b600181811c9082168061037557607f821691505b60208210810361039557634e487b7160e01b600052602260045260246000fd5b50919050565b601f8211156103e557806000526020600020601f840160051c810160208510156103c25750805b601f840160051c820191505b818110156103e257600081556001016103ce565b50505b505050565b81516001600160401b03811115610403576104036101f4565b610417816104118454610361565b8461039b565b6020601f82116001811461044b57600083156104335750848201515b600019600385901b1c1916600184901b1784556103e2565b600084815260208120601f198516915b8281101561047b578785015182556020948501946001909201910161045b565b50848210156104995786840151600019600387901b60f8161c191681555b50505050600190811b01905550565b600082516104ba81846020870161020a565b9190910192915050565b6000602082840312156104d657600080fd5b5051919050565b60805160a0516143186105416000396000610a200152600081816103b0015281816106ed015281816109dd01528181610b0b01528181610e0201528181611e2b01528181612178015281816122680152818161287c0152612f8a01526143186000f3fe608060405234801561001057600080fd5b506004361061027e5760003560e01c80638a4adf241161015c578063bdc8144b116100ce578063d905777e11610087578063d905777e14610591578063dd62ed3e146105a4578063de6dd7a4146105dd578063e2c41dbc146105f0578063ecf70858146105f8578063ef8b30f71461054357600080fd5b8063bdc8144b14610530578063c63d75b6146103d4578063c6e6f59214610543578063c7b9d53014610556578063ce96cb7714610569578063d01f63f51461057c57600080fd5b8063a9059cbb11610120578063a9059cbb146104be578063b3d7f6b9146104d1578063b460af94146104e4578063b543503e146104f7578063ba0876521461050a578063baa82a341461051d57600080fd5b80638a4adf241461045d57806394bf804d1461047057806395d89b41146104835780639b91d9461461048b578063a720d027146104ab57600080fd5b806324600fc3116101f55780634cdad506116101b95780634cdad506146102e557806364bfceec146103f15780636e553f65146103f957806370a082311461040c57806374111b50146104355780637fbbe46f1461044a57600080fd5b806324600fc31461038a578063313ce5671461039457806338d52e0f146103ae578063402d267d146103d45780634641257d146103e957600080fd5b8063095ea7b311610247578063095ea7b3146103015780630a28a47714610324578063158ef93e1461033757806318160ddd146103445780631fe4a6861461034c57806323b872dd1461037757600080fd5b8062e6e2d81461028357806301e1d114146102ba57806306fdde03146102d057806307a2d13a146102e55780630956e5a6146102f8575b600080fd5b610296610291366004613a8a565b610601565b604080516001600160a01b0390931683526020830191909152015b60405180910390f35b6102c2610639565b6040519081526020016102b1565b6102d8610721565b6040516102b19190613aa3565b6102c26102f3366004613a8a565b6107b3565b6102c260065481565b61031461030f366004613b16565b6107c6565b60405190151581526020016102b1565b6102c2610332366004613a8a565b6107de565b600d546103149060ff1681565b6002546102c2565b60085461035f906001600160a01b031681565b6040516001600160a01b0390911681526020016102b1565b610314610385366004613b42565b6107eb565b610392610811565b005b61039c610a18565b60405160ff90911681526020016102b1565b7f000000000000000000000000000000000000000000000000000000000000000061035f565b6102c26103e2366004613b83565b5060001990565b610392610a49565b610392610ade565b6102c2610407366004613ba0565b610b8e565b6102c261041a366004613b83565b6001600160a01b031660009081526020819052604090205490565b61043d610ca8565b6040516102b19190613bd0565b610392610458366004613c73565b610d1d565b60095461035f906001600160a01b031681565b6102c261047e366004613ba0565b61115f565b6102d861125c565b61049e610499366004613cf8565b61126b565b6040516102b19190613dc5565b6103926104b9366004613dff565b61131d565b6103146104cc366004613b16565b61189b565b6102c26104df366004613a8a565b6118a9565b6102c26104f2366004613e39565b6118b6565b610392610505366004613b83565b6119b9565b6102c2610518366004613e39565b611a60565b61039261052b366004613e7b565b611b46565b61039261053e366004613a8a565b611c9f565b6102c2610551366004613a8a565b611cff565b610392610564366004613b83565b611d0c565b6102c2610577366004613b83565b611d85565b610584611daa565b6040516102b19190613ef3565b6102c261059f366004613b83565b611db6565b6102c26105b2366004613f06565b6001600160a01b03918216600090815260016020908152604080832093909416825291909152205490565b6103146105eb366004613a8a565b611dd4565b610392611df9565b6102c260075481565b600c818154811061061157600080fd5b6000918252602090912060029091020180546001909101546001600160a01b03909116915082565b600654600090815b818110156106e757600c818154811061065c5761065c613f34565b600091825260209182902060029091020154604080516316d3df1560e31b815290516001600160a01b039092169263b69ef8a8926004808401938290030181865afa1580156106af573d6000803e3d6000fd5b505050506040513d601f19601f820116820180604052508101906106d39190613f4a565b6106dd9084613f79565b9250600101610641565b506107117f0000000000000000000000000000000000000000000000000000000000000000611f07565b61071b9083613f79565b91505090565b60606003805461073090613f8c565b80601f016020809104026020016040519081016040528092919081815260200182805461075c90613f8c565b80156107a95780601f1061077e576101008083540402835291602001916107a9565b820191906000526020600020905b81548152906001019060200180831161078c57829003601f168201915b5050505050905090565b60006107c0826000611f91565b92915050565b6000336107d4818585611fcb565b5060019392505050565b60006107c0826001611fd8565b6000336107f9858285612008565b610804858585612087565b60019150505b9392505050565b6008546001600160a01b0316331461083c5760405163c80d5fa560e01b815260040160405180910390fd5b6000600c805480602002602001604051908101604052809291908181526020016000905b828210156108a8576000848152602090819020604080518082019091526002850290910180546001600160a01b03168252600190810154828401529083529092019101610860565b505050509050600060065490506000805b828110156109b6576108c9610a49565b8381815181106108db576108db613f34565b60200260200101516000015191506000826001600160a01b031663b69ef8a86040518163ffffffff1660e01b8152600401602060405180830381865afa158015610929573d6000803e3d6000fd5b505050506040513d601f19601f8201168201806040525081019061094d9190613f4a565b604051632e1a7d4d60e01b8152600481018290529091506001600160a01b03841690632e1a7d4d90602401600060405180830381600087803b15801561099257600080fd5b505af11580156109a6573d6000803e3d6000fd5b50505050816001019150506108b9565b507fc67387b8229e689a6f1e2c3feafcfae2206a4d6e581bf95e25dbb0c934432a64610a017f0000000000000000000000000000000000000000000000000000000000000000611f07565b6040519081526020015b60405180910390a1505050565b6000610a44817f0000000000000000000000000000000000000000000000000000000000000000613fc6565b905090565b60065460005b81811015610ada57600c8181548110610a6a57610a6a613f34565b6000918252602082206002909102015460408051634641257d60e01b815290516001600160a01b0390921692634641257d9260048084019382900301818387803b158015610ab757600080fd5b505af1158015610acb573d6000803e3d6000fd5b50505050806001019050610a4f565b5050565b6009546001600160a01b03163314610b0957604051634f9aa11760e11b815260040160405180910390fd5b7f00000000000000000000000000000000000000000000000000000000000000006000610b3582611f07565b90508015610ada57600954610b57906001600160a01b038481169116836120e6565b6040518181527f76a820ad5e56aebcfa13f60a4ec2e8453550cca0e77446a259782e547c68b32b9060200160405180910390a15050565b6000610b98612145565b82600003610bb957604051630f6fa54560e41b815260040160405180910390fd5b610bc283611dd4565b610bdf57604051630795800760e31b815260040160405180910390fd5b610be7610a49565b610bf083611cff565b905060006040518060a00160405280846001600160a01b031681526020018581526020018381526020016006548152602001600c805480602002602001604051908101604052809291908181526020016000905b82821015610c8c576000848152602090819020604080518082019091526002850290910180546001600160a01b03168252600190810154828401529083529092019101610c44565b5050509152509050610c9d8161216f565b506107c06001600555565b6060600c805480602002602001604051908101604052809291908181526020016000905b82821015610d14576000848152602090819020604080518082019091526002850290910180546001600160a01b03168252600190810154828401529083529092019101610ccc565b50505050905090565b6009546001600160a01b03163314610d4857604051634f9aa11760e11b815260040160405180910390fd5b600d5460ff1615610d6c5760405163439a74c960e01b815260040160405180910390fd5b826000819003610d8f57604051638c305f6d60e01b815260040160405180910390fd5b808214610daf57604051634456f5e960e11b815260040160405180910390fd5b600080610dcc604080518082019091526000808252602082015290565b60005b848110156110e157888882818110610de957610de9613f34565b9050602002016020810190610dfe9190613b83565b92507f00000000000000000000000000000000000000000000000000000000000000006001600160a01b0316836001600160a01b03166338d52e0f6040518163ffffffff1660e01b8152600401602060405180830381865afa158015610e68573d6000803e3d6000fd5b505050506040513d601f19601f82011682018060405250810190610e8c9190613fdf565b6001600160a01b031614610eb35760405163010fa87160e01b815260040160405180910390fd5b306001600160a01b0316836001600160a01b031663e9d3c1546040518163ffffffff1660e01b8152600401602060405180830381865afa158015610efb573d6000803e3d6000fd5b505050506040513d601f19601f82011682018060405250810190610f1f9190613fdf565b6001600160a01b031614610f46576040516306a6fe6960e21b815260040160405180910390fd5b6000610f778a8a84818110610f5d57610f5d613f34565b9050602002016020810190610f729190613b83565b612235565b905080610fcf57898983818110610f9057610f90613f34565b9050602002016020810190610fa59190613b83565b604051630e23e61560e01b81526001600160a01b0390911660048201526024015b60405180910390fd5b60405180604001604052808b8b85818110610fec57610fec613f34565b90506020020160208101906110019190613b83565b6001600160a01b0316815260200189898581811061102157611021613f34565b60209081029290920135909252600c805460018101825560009190915283517fdf6966c971051c3d54ec59162606531493a51404a002842f56009d7e5cf4a8c7600290920291820180546001600160a01b0319166001600160a01b03909216919091179055908301517fdf6966c971051c3d54ec59162606531493a51404a002842f56009d7e5cf4a8c8909101555092508787838181106110c4576110c4613f34565b90506020020135856110d69190613f79565b945050600101610dcf565b506127108314611104576040516314ccf61760e31b815260040160405180910390fd5b600c54600655600d805460ff191660011790556040517fab8addcb3e4c6388fadb3059c28a92327ce30ea8c442e6c45e9caaddb4466faf9061114d908a908a908a908a90613ffc565b60405180910390a15050505050505050565b6000611169612145565b611171610a49565b61117a836118a9565b90508060000361119d57604051630f6fa54560e41b815260040160405180910390fd5b6111a681611dd4565b6111c357604051630795800760e31b815260040160405180910390fd5b60006040518060a00160405280846001600160a01b031681526020018381526020018581526020016006548152602001600c8054806020026020016040519081016040528092919081815260200160009082821015610c8c576000848152602090819020604080518082019091526002850290910180546001600160a01b03168252600190810154828401529083529092019101610c44565b60606004805461073090613f8c565b8051606090806001600160401b0381111561128857611288613ce2565b6040519080825280602002602001820160405280156112b1578160200160208202803683370190505b50915060005b81811015611316576112ec8482815181106112d4576112d4613f34565b6020026020010151600a61224290919063ffffffff16565b8382815181106112fe576112fe613f34565b911515602092830291909101909101526001016112b7565b5050919050565b6008546001600160a01b031633146113485760405163c80d5fa560e01b815260040160405180910390fd5b6000611354828061407a565b915060009050611367602084018461407a565b91506000905061137a604085018561407a565b905090508160000361139f57604051630fd59abf60e31b815260040160405180910390fd5b8015806113aa575082155b156113c857604051637c8c272560e11b815260040160405180910390fd5b81831415806113e557506113df606085018561407a565b90508114155b1561140357604051634456f5e960e11b815260040160405180910390fd5b600654600090815b858110156114ab5760005b828110156114a257600c818154811061143157611431613f34565b60009182526020909120600290910201546001600160a01b0316611455898061407a565b8481811061146557611465613f34565b905060200201602081019061147a9190613b83565b6001600160a01b03160361149a5783611492816140c3565b9450506114a2565b600101611416565b5060010161140b565b508482146114cb576040516290f7d960e41b815260040160405180910390fd5b50600190505b83811015611579576114e3858061407a565b6114ee6001846140dc565b8181106114fd576114fd613f34565b90506020020160208101906115129190613b83565b6001600160a01b0316611525868061407a565b8381811061153557611535613f34565b905060200201602081019061154a9190613b83565b6001600160a01b0316116115715760405163260a69b160e21b815260040160405180910390fd5b6001016114d1565b5060005b818110156116945760018110158015611614575061159e604086018661407a565b6115a96001846140dc565b8181106115b8576115b8613f34565b90506020020160208101906115cd9190613b83565b6001600160a01b03166115e3604087018761407a565b838181106115f3576115f3613f34565b90506020020160208101906116089190613b83565b6001600160a01b031611155b156116325760405163fa6979a960e01b815260040160405180910390fd5b61166f611642604087018761407a565b8381811061165257611652613f34565b90506020020160208101906116679190613b83565b600a90612242565b61168c576040516334c680eb60e11b815260040160405180910390fd5b60010161157d565b506000836001600160401b038111156116af576116af613ce2565b6040519080825280602002602001820160405280156116f457816020015b60408051808201909152600080825260208201528152602001906001900390816116cd5790505b50905060005b84811015611799576040805180820190915280611717888061407a565b8481811061172757611727613f34565b905060200201602081019061173c9190613b83565b6001600160a01b0316815260200187806020019061175a919061407a565b8481811061176a5761176a613f34565b9050602002013581525082828151811061178657611786613f34565b60209081029190910101526001016116fa565b506040805160c081018252308082526020820152600091810182905260608101829052608081016117ca888061407a565b9050815260200183815250905060006117f2826080015183604001518460a001516000612264565b9050600061181861180660408a018a61407a565b61181360608c018c61407a565b612657565b9050600061182583611cff565b905060006040518060a00160405280306001600160a01b031681526020018581526020018381526020018b806040019061185f919061407a565b905081526020018481525090506118858160600151826020015183608001516001612264565b5061188f83612803565b50505050505050505050565b6000336107d4818585612087565b60006107c0826001611f91565b60006118c0612145565b836000036118e157604051630f6fa54560e41b815260040160405180910390fd5b6118e9610a49565b6118f2846107de565b905060006040518060c00160405280856001600160a01b03168152602001846001600160a01b031681526020018681526020018381526020016006548152602001600c805480602002602001604051908101604052809291908181526020016000905b8282101561199d576000848152602090819020604080518082019091526002850290910180546001600160a01b03168252600190810154828401529083529092019101611955565b50505091525090506119ae81612f81565b5061080a6001600555565b6009546001600160a01b031633146119e457604051634f9aa11760e11b815260040160405180910390fd5b6001600160a01b038116611a0b5760405163538ba4f960e01b815260040160405180910390fd5b600980546001600160a01b0319166001600160a01b0383169081179091556040519081527f8e902340d35762a5a36507c20fe38e5d549a721d9f846d6de7f397b5c26ab853906020015b60405180910390a150565b6000611a6a612145565b611a72610a49565b611a7b846107b3565b905080600003611a9e57604051630f6fa54560e41b815260040160405180910390fd5b60006040518060c00160405280856001600160a01b03168152602001846001600160a01b031681526020018381526020018681526020016006548152602001600c805480602002602001604051908101604052809291908181526020016000908282101561199d576000848152602090819020604080518082019091526002850290910180546001600160a01b03168252600190810154828401529083529092019101611955565b6009546001600160a01b03163314611b7157604051634f9aa11760e11b815260040160405180910390fd5b6000611b7e600a84612242565b905081151581151514611c9a578115611ba057611b9a83612235565b50611c5a565b6000836001600160a01b031663b69ef8a86040518163ffffffff1660e01b8152600401602060405180830381865afa158015611be0573d6000803e3d6000fd5b505050506040513d601f19601f82011682018060405250810190611c049190613f4a565b90508015611c2557604051631e576dd560e11b815260040160405180910390fd5b611c2f600a61307e565b600103611c4f576040516316b0551b60e01b815260040160405180910390fd5b611c5884613088565b505b604080516001600160a01b038516815283151560208201527f8bec79f539f27f15b7cbae2d61ec86cf9788feb3166ac06d6ae2cd4d3d06c2f59101610a0b565b505050565b6009546001600160a01b03163314611cca57604051634f9aa11760e11b815260040160405180910390fd5b60078190556040518181527f5d2e73196f8ba1b44e887e2bcc9bcd1f3e657add341d4a0a632ffff00d6903f290602001611a55565b60006107c0826000611fd8565b6009546001600160a01b03163314611d3757604051634f9aa11760e11b815260040160405180910390fd5b600880546001600160a01b0319166001600160a01b0383169081179091556040519081527f276625620b877c2ddc0a05d68b81971639085fa26d23dfa86eec6460e6fac5b990602001611a55565b6001600160a01b0381166000908152602081905260408120546107c0905b6000611f91565b6060610a44600a613093565b6001600160a01b0381166000908152602081905260408120546107c0565b600080611de16000611f07565b600754909150611df18285613f79565b109392505050565b6008546001600160a01b03163314611e245760405163c80d5fa560e01b815260040160405180910390fd5b6000611e4f7f0000000000000000000000000000000000000000000000000000000000000000611f07565b9050611ecd60065482600c805480602002602001604051908101604052809291908181526020016000905b82821015611ec2576000848152602090819020604080518082019091526002850290910180546001600160a01b03168252600190810154828401529083529092019101611e7a565b505050506001612264565b507fea9d44aea9d9b19064c11e8d92087621b04bda9bc740e82436a7cd583ffa7a90611ef96000611f07565b604051908152602001611a55565b60006001600160a01b03821615611f85576040516370a0823160e01b81523060048201526001600160a01b038316906370a0823190602401602060405180830381865afa158015611f5c573d6000803e3d6000fd5b505050506040513d601f19601f82011682018060405250810190611f809190613f4a565b6107c0565b6107c0611da360025490565b600061080a611f9e610639565b611fa9906001613f79565b611fb56000600a6141d6565b600254611fc29190613f79565b859190856130a0565b611c9a83838360016130ed565b600061080a611fe882600a6141d6565b600254611ff59190613f79565b611ffd610639565b611fc2906001613f79565b6001600160a01b03838116600090815260016020908152604080832093861683529290522054600019811015612081578181101561207257604051637dc7a0d960e11b81526001600160a01b03841660048201526024810182905260448101839052606401610fc6565b612081848484840360006130ed565b50505050565b6001600160a01b0383166120b157604051634b637e8f60e11b815260006004820152602401610fc6565b6001600160a01b0382166120db5760405163ec442f0560e01b815260006004820152602401610fc6565b611c9a8383836131c2565b6040516001600160a01b03838116602483015260448201839052611c9a91859182169063a9059cbb906064015b604051602081830303815290604052915060e01b6020820180516001600160e01b0383818316178352505050506132ec565b60026005540361216857604051633ee5aeb560e01b815260040160405180910390fd5b6002600555565b602081015133907f0000000000000000000000000000000000000000000000000000000000000000906121b0906001600160a01b038316908490309061335d565b6121c98360600151846020015185608001516001612264565b506121dc83600001518460400151613396565b825160208085015160408087015181516001600160a01b0380891682529095169385019390935283015260608201527ff5681f9d0db1b911ac18ee83d515a1cf1051853a9eae418316a2fdf7dea427c590608001610a0b565b60006107c0600a836133cc565b6001600160a01b0381166000908152600183016020526040812054151561080a565b60007f00000000000000000000000000000000000000000000000000000000000000008082876001600160401b038111156122a1576122a1613ce2565b6040519080825280602002602001820160405280156122ca578160200160208202803683370190505b509050600085156124a15760005b8981101561249b578781815181106122f2576122f2613f34565b602002602001015160000151915061233788828151811061231557612315613f34565b60200260200101516020015161271060008c6130a0909392919063ffffffff16565b83828151811061234957612349613f34565b60200260200101818152505061238c8284838151811061236b5761236b613f34565b6020026020010151866001600160a01b03166133e19092919063ffffffff16565b816001600160a01b031663354030238483815181106123ad576123ad613f34565b60200260200101516040518263ffffffff1660e01b81526004016123d391815260200190565b600060405180830381600087803b1580156123ed57600080fd5b505af1158015612401573d6000803e3d6000fd5b5050604051636eb1769f60e11b81523060048201526001600160a01b038581166024830152600093508716915063dd62ed3e90604401602060405180830381865afa158015612454573d6000803e3d6000fd5b505050506040513d601f19601f820116820180604052508101906124789190613f4a565b1115612493576124936001600160a01b038516836000613466565b6001016122d8565b5061264b565b60006124ac85611f07565b90506000805b8b811015612623578981815181106124cc576124cc613f34565b60200260200101516000015193508a91508a60000361254a57836001600160a01b031663b69ef8a86040518163ffffffff1660e01b8152600401602060405180830381865afa158015612523573d6000803e3d6000fd5b505050506040513d601f19601f820116820180604052508101906125479190613f4a565b91505b6125818a828151811061255f5761255f613f34565b6020026020010151602001516127106000856130a0909392919063ffffffff16565b85828151811061259357612593613f34565b602002602001018181525050836001600160a01b0316632e1a7d4d8683815181106125c0576125c0613f34565b60200260200101516040518263ffffffff1660e01b81526004016125e691815260200190565b600060405180830381600087803b15801561260057600080fd5b505af1158015612614573d6000803e3d6000fd5b505050508060010190506124b2565b50600061262f87611f07565b905061263b83826140dc565b97506126478b896134f6565b5050505b50505050949350505050565b6060600082815b8181101561269c5785858281811061267857612678613f34565b905060200201356000146126945782612690816140c3565b9350505b60010161265e565b50816001600160401b038111156126b5576126b5613ce2565b6040519080825280602002602001820160405280156126fa57816020015b60408051808201909152600080825260208201528152602001906001900390816126d35790505b50925060008060005b838110156127e05787878281811061271d5761271d613f34565b905060200201356000146127d85760405180604001604052808b8b8481811061274857612748613f34565b905060200201602081019061275d9190613b83565b6001600160a01b0316815260200189898481811061277d5761277d613f34565b9050602002013581525086848151811061279957612799613f34565b60200260200101819052508787828181106127b6576127b6613f34565b90506020020135826127c89190613f79565b9150826127d4816140c3565b9350505b600101612703565b50612710811461264b576040516314ccf61760e31b815260040160405180910390fd5b6000600c805480602002602001604051908101604052809291908181526020016000905b8282101561286f576000848152602090819020604080518082019091526002850290910180546001600160a01b03168252600190810154828401529083529092019101612827565b505050509050600061289e7f000000000000000000000000000000000000000000000000000000000000000090565b835183519192509060008290036128c857604051638c305f6d60e01b815260040160405180910390fd5b6000805b82811015612992576000805b85811015612944578881815181106128f2576128f2613f34565b6020026020010151600001516001600160a01b031688848151811061291957612919613f34565b6020026020010151600001516001600160a01b03160361293c5760019150612944565b6001016128d8565b5080158015612976575061297487838151811061296357612963613f34565b60200260200101516000015161354c565b155b156129895782612985816140c3565b9350505b506001016128cc565b50600061299f8285613f79565b90506000816001600160401b038111156129bb576129bb613ce2565b604051908082528060200260200182016040528015612a0057816020015b60408051808201909152600080825260208201528152602001906001900390816129d95790505b50905060005b85811015612a4d57888181518110612a2057612a20613f34565b6020026020010151828281518110612a3a57612a3a613f34565b6020908102919091010152600101612a06565b508460005b85811015612b59576000805b88811015612aca578b8181518110612a7857612a78613f34565b6020026020010151600001516001600160a01b03168b8481518110612a9f57612a9f613f34565b6020026020010151600001516001600160a01b031603612ac25760019150612aca565b600101612a5e565b5080158015612aeb5750612ae98a838151811061296357612963613f34565b155b15612b505760405180604001604052808b8481518110612b0d57612b0d613f34565b6020026020010151600001516001600160a01b031681526020016000815250848481518110612b3e57612b3e613f34565b60200260200101819052508260010192505b50600101612a52565b506000805b84811015612d4e576000848281518110612b7a57612b7a613f34565b6020026020010151600001519050896001600160a01b0316816001600160a01b03166338d52e0f6040518163ffffffff1660e01b8152600401602060405180830381865afa158015612bd0573d6000803e3d6000fd5b505050506040513d601f19601f82011682018060405250810190612bf49190613fdf565b6001600160a01b031614612c1b5760405163010fa87160e01b815260040160405180910390fd5b306001600160a01b0316816001600160a01b031663e9d3c1546040518163ffffffff1660e01b8152600401602060405180830381865afa158015612c63573d6000803e3d6000fd5b505050506040513d601f19601f82011682018060405250810190612c879190613fdf565b6001600160a01b031614612cae576040516306a6fe6960e21b815260040160405180910390fd5b6000816001600160a01b031663b69ef8a86040518163ffffffff1660e01b8152600401602060405180830381865afa158015612cee573d6000803e3d6000fd5b505050506040513d601f19601f82011682018060405250810190612d129190613f4a565b905080868481518110612d2757612d27613f34565b6020908102919091018101510152612d3f8185613f79565b93508260010192505050612b5e565b508015612e36576000805b612d646001876140dc565b811015612df757612da2612710846000888581518110612d8657612d86613f34565b6020026020010151602001516130a0909392919063ffffffff16565b858281518110612db457612db4613f34565b60200260200101516020018181525050848181518110612dd657612dd6613f34565b60200260200101516020015182612ded9190613f79565b9150600101612d59565b50612e04816127106140dc565b84612e106001886140dc565b81518110612e2057612e20613f34565b6020026020010151602001818152505050612eab565b6000612e44856127106141fb565b90506000612e548661271061420f565b905060005b86811015612ea757818110612e6f576000612e72565b60015b612e7f9060ff1684613f79565b868281518110612e9157612e91613f34565b6020908102919091018101510152600101612e59565b5050505b612eb7600c6000613a3c565b60005b84811015612f2657600c848281518110612ed657612ed6613f34565b602090810291909101810151825460018082018555600094855293839020825160029092020180546001600160a01b0319166001600160a01b039092169190911781559101519082015501612eba565b5060068490557fb4ea704c0ca1f1317ac7737b8105ac22eb9e9d7f6bbf36b335784817e2ecc43c612f56846135b7565b612f5f8561365b565b604051612f6d929190614223565b60405180910390a150505050505050505050565b600033905060007f000000000000000000000000000000000000000000000000000000000000000090506000612fc6846080015185604001518660a001516000612264565b905083602001516001600160a01b0316836001600160a01b031614612ff857612ff88460200151848660600151612008565b61300a846020015185606001516136f2565b8351613021906001600160a01b03841690836120e6565b8351606080860151604080516001600160a01b03808916825290941660208501528301849052908201527fc2b4a290c20fb28939d29f102514fbffd2b73c059ffba8b78250c94161d5fcc69060800160405180910390a150505050565b60006107c0825490565b610ada600a82613728565b6060600061080a8361373d565b60006130cf6130ae83613799565b80156130ca5750600084806130c5576130c56141e5565b868809115b151590565b6130da8686866137c6565b6130e49190613f79565b95945050505050565b6001600160a01b0384166131175760405163e602df0560e01b815260006004820152602401610fc6565b6001600160a01b03831661314157604051634a1406b160e11b815260006004820152602401610fc6565b6001600160a01b038085166000908152600160209081526040808320938716835292905220829055801561208157826001600160a01b0316846001600160a01b03167f8c5be1e5ebec7d5bd14f71427d1e84f3dd0314c0f7b2291e5b200ac8c7c3b925846040516131b491815260200190565b60405180910390a350505050565b6001600160a01b0383166131ed5780600260008282546131e29190613f79565b9091555061325f9050565b6001600160a01b038316600090815260208190526040902054818110156132405760405163391434e360e21b81526001600160a01b03851660048201526024810182905260448101839052606401610fc6565b6001600160a01b03841660009081526020819052604090209082900390555b6001600160a01b03821661327b5760028054829003905561329a565b6001600160a01b03821660009081526020819052604090208054820190555b816001600160a01b0316836001600160a01b03167fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef836040516132df91815260200190565b60405180910390a3505050565b600080602060008451602086016000885af18061330f576040513d6000823e3d81fd5b50506000513d91508115613327578060011415613334565b6001600160a01b0384163b155b1561208157604051635274afe760e01b81526001600160a01b0385166004820152602401610fc6565b6040516001600160a01b0384811660248301528381166044830152606482018390526120819186918216906323b872dd90608401612113565b6001600160a01b0382166133c05760405163ec442f0560e01b815260006004820152602401610fc6565b610ada600083836131c2565b600061080a836001600160a01b03841661387b565b604051636eb1769f60e11b81523060048201526001600160a01b0383811660248301526000919085169063dd62ed3e90604401602060405180830381865afa158015613431573d6000803e3d6000fd5b505050506040513d601f19601f820116820180604052508101906134559190613f4a565b905061208184846134668585613f79565b604080516001600160a01b038416602482015260448082018490528251808303909101815260649091019091526020810180516001600160e01b031663095ea7b360e01b1790526134b784826138ca565b612081576040516001600160a01b038481166024830152600060448301526134ec91869182169063095ea7b390606401612113565b61208184826132ec565b6000818311613506576000613528565b8261271061351484836140dc565b61351e919061427d565b61352891906141fb565b90506064811115611c9a576040516304a6523360e01b815260040160405180910390fd5b6000816001600160a01b031663b69ef8a86040518163ffffffff1660e01b8152600401602060405180830381865afa15801561358c573d6000803e3d6000fd5b505050506040513d601f19601f820116820180604052508101906135b09190613f4a565b1592915050565b8051606090806001600160401b038111156135d4576135d4613ce2565b6040519080825280602002602001820160405280156135fd578160200160208202803683370190505b50915060005b818110156113165783818151811061361d5761361d613f34565b60200260200101516000015183828151811061363b5761363b613f34565b6001600160a01b0390921660209283029190910190910152600101613603565b8051606090806001600160401b0381111561367857613678613ce2565b6040519080825280602002602001820160405280156136a1578160200160208202803683370190505b50915060005b81811015611316578381815181106136c1576136c1613f34565b6020026020010151602001518382815181106136df576136df613f34565b60209081029190910101526001016136a7565b6001600160a01b03821661371c57604051634b637e8f60e11b815260006004820152602401610fc6565b610ada826000836131c2565b600061080a836001600160a01b038416613919565b60608160000180548060200260200160405190810160405280929190818152602001828054801561378d57602002820191906000526020600020905b815481526020019060010190808311613779575b50505050509050919050565b600060028260038111156137af576137af614294565b6137b991906142aa565b60ff166001149050919050565b60008060006137d58686613a0c565b91509150816000036137fa578381816137f0576137f06141e5565b049250505061080a565b818411613811576138116003851502601118613a2a565b6000848688096000868103871696879004966002600389028118808a02820302808a02820302808a02820302808a02820302808a02820302808a02909103029181900381900460010185841190960395909502919093039390930492909217029150509392505050565b60008181526001830160205260408120546138c2575081546001818101845560008481526020808220909301849055845484825282860190935260409020919091556107c0565b5060006107c0565b6000806000806020600086516020880160008a5af192503d9150600051905082801561390f57508115613900578060011461390f565b6000866001600160a01b03163b115b9695505050505050565b60008181526001830160205260408120548015613a0257600061393d6001836140dc565b8554909150600090613951906001906140dc565b90508082146139b657600086600001828154811061397157613971613f34565b906000526020600020015490508087600001848154811061399457613994613f34565b6000918252602080832090910192909255918252600188019052604090208390555b85548690806139c7576139c76142cc565b6001900381819060005260206000200160009055905585600101600086815260200190815260200160002060009055600193505050506107c0565b60009150506107c0565b60008060001983850993909202808410938190039390930393915050565b634e487b71600052806020526024601cfd5b5080546000825560020290600052602060002090810190613a5d9190613a60565b50565b5b80821115613a865780546001600160a01b031916815560006001820155600201613a61565b5090565b600060208284031215613a9c57600080fd5b5035919050565b602081526000825180602084015260005b81811015613ad15760208186018101516040868401015201613ab4565b506000604082850101526040601f19601f83011684010191505092915050565b6001600160a01b0381168114613a5d57600080fd5b8035613b1181613af1565b919050565b60008060408385031215613b2957600080fd5b8235613b3481613af1565b946020939093013593505050565b600080600060608486031215613b5757600080fd5b8335613b6281613af1565b92506020840135613b7281613af1565b929592945050506040919091013590565b600060208284031215613b9557600080fd5b813561080a81613af1565b60008060408385031215613bb357600080fd5b823591506020830135613bc581613af1565b809150509250929050565b602080825282518282018190526000918401906040840190835b81811015613c1d57835180516001600160a01b031684526020908101518185015290930192604090920191600101613bea565b509095945050505050565b60008083601f840112613c3a57600080fd5b5081356001600160401b03811115613c5157600080fd5b6020830191508360208260051b8501011115613c6c57600080fd5b9250929050565b60008060008060408587031215613c8957600080fd5b84356001600160401b03811115613c9f57600080fd5b613cab87828801613c28565b90955093505060208501356001600160401b03811115613cca57600080fd5b613cd687828801613c28565b95989497509550505050565b634e487b7160e01b600052604160045260246000fd5b600060208284031215613d0a57600080fd5b81356001600160401b03811115613d2057600080fd5b8201601f81018413613d3157600080fd5b80356001600160401b03811115613d4a57613d4a613ce2565b8060051b604051601f19603f83011681018181106001600160401b0382111715613d7657613d76613ce2565b604052918252602081840181019290810187841115613d9457600080fd5b6020850194505b83851015613dba57613dac85613b06565b815260209485019401613d9b565b509695505050505050565b602080825282518282018190526000918401906040840190835b81811015613c1d5783511515835260209384019390920191600101613ddf565b600060208284031215613e1157600080fd5b81356001600160401b03811115613e2757600080fd5b82016080818503121561080a57600080fd5b600080600060608486031215613e4e57600080fd5b833592506020840135613e6081613af1565b91506040840135613e7081613af1565b809150509250925092565b60008060408385031215613e8e57600080fd5b8235613e9981613af1565b915060208301358015158114613bc557600080fd5b600081518084526020840193506020830160005b82811015613ee95781516001600160a01b0316865260209586019590910190600101613ec2565b5093949350505050565b60208152600061080a6020830184613eae565b60008060408385031215613f1957600080fd5b8235613f2481613af1565b91506020830135613bc581613af1565b634e487b7160e01b600052603260045260246000fd5b600060208284031215613f5c57600080fd5b5051919050565b634e487b7160e01b600052601160045260246000fd5b808201808211156107c0576107c0613f63565b600181811c90821680613fa057607f821691505b602082108103613fc057634e487b7160e01b600052602260045260246000fd5b50919050565b60ff81811683821601908111156107c0576107c0613f63565b600060208284031215613ff157600080fd5b815161080a81613af1565b6040808252810184905260008560608301825b8781101561403f57823561402281613af1565b6001600160a01b031682526020928301929091019060010161400f565b5083810360208501528481526001600160fb1b0385111561405f57600080fd5b8460051b915081866020830137016020019695505050505050565b6000808335601e1984360301811261409157600080fd5b8301803591506001600160401b038211156140ab57600080fd5b6020019150600581901b3603821315613c6c57600080fd5b6000600182016140d5576140d5613f63565b5060010190565b818103818111156107c0576107c0613f63565b6001815b600184111561412a5780850481111561410e5761410e613f63565b600184161561411c57908102905b60019390931c9280026140f3565b935093915050565b600082614141575060016107c0565b8161414e575060006107c0565b8160018114614164576002811461416e5761418a565b60019150506107c0565b60ff84111561417f5761417f613f63565b50506001821b6107c0565b5060208310610133831016604e8410600b84101617156141ad575081810a6107c0565b6141ba60001984846140ef565b80600019048211156141ce576141ce613f63565b029392505050565b600061080a60ff841683614132565b634e487b7160e01b600052601260045260246000fd5b60008261420a5761420a6141e5565b500490565b60008261421e5761421e6141e5565b500690565b6040815260006142366040830185613eae565b828103602084015280845180835260208301915060208601925060005b81811015614271578351835260209384019390920191600101614253565b50909695505050505050565b80820281158282048414176107c0576107c0613f63565b634e487b7160e01b600052602160045260246000fd5b600060ff8316806142bd576142bd6141e5565b8060ff84160691505092915050565b634e487b7160e01b600052603160045260246000fdfea264697066735822122028d98721dfaa444e51cd0f8599e4e928b03de7ea7f673661a10f3ab68fa0108564736f6c634300081c0033000000000000000000000000b8ce59fc3717ada4c02eadf9682a9e934f625ebb00000000000000000000000083d47dcc9e5467f32a5e0e587335a11f773b887d00000000000000000000000062007a126bab6bd6c3cc56896aa59080a3e5533400000000000000000000000000000000000000000000000000000000000000c00000000000000000000000000000000000000000000000000000000000000100000000000000000000000000000000000000000000000000000000e8d4a51000000000000000000000000000000000000000000000000000000000000000000a4272696e6b20555344540000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000096272696e6b555344540000000000000000000000000000000000000000000000

0x608060405234801561001057600080fd5b506004361061027e5760003560e01c80638a4adf241161015c578063bdc8144b116100ce578063d905777e11610087578063d905777e14610591578063dd62ed3e146105a4578063de6dd7a4146105dd578063e2c41dbc146105f0578063ecf70858146105f8578063ef8b30f71461054357600080fd5b8063bdc8144b14610530578063c63d75b6146103d4578063c6e6f59214610543578063c7b9d53014610556578063ce96cb7714610569578063d01f63f51461057c57600080fd5b8063a9059cbb11610120578063a9059cbb146104be578063b3d7f6b9146104d1578063b460af94146104e4578063b543503e146104f7578063ba0876521461050a578063baa82a341461051d57600080fd5b80638a4adf241461045d57806394bf804d1461047057806395d89b41146104835780639b91d9461461048b578063a720d027146104ab57600080fd5b806324600fc3116101f55780634cdad506116101b95780634cdad506146102e557806364bfceec146103f15780636e553f65146103f957806370a082311461040c57806374111b50146104355780637fbbe46f1461044a57600080fd5b806324600fc31461038a578063313ce5671461039457806338d52e0f146103ae578063402d267d146103d45780634641257d146103e957600080fd5b8063095ea7b311610247578063095ea7b3146103015780630a28a47714610324578063158ef93e1461033757806318160ddd146103445780631fe4a6861461034c57806323b872dd1461037757600080fd5b8062e6e2d81461028357806301e1d114146102ba57806306fdde03146102d057806307a2d13a146102e55780630956e5a6146102f8575b600080fd5b610296610291366004613a8a565b610601565b604080516001600160a01b0390931683526020830191909152015b60405180910390f35b6102c2610639565b6040519081526020016102b1565b6102d8610721565b6040516102b19190613aa3565b6102c26102f3366004613a8a565b6107b3565b6102c260065481565b61031461030f366004613b16565b6107c6565b60405190151581526020016102b1565b6102c2610332366004613a8a565b6107de565b600d546103149060ff1681565b6002546102c2565b60085461035f906001600160a01b031681565b6040516001600160a01b0390911681526020016102b1565b610314610385366004613b42565b6107eb565b610392610811565b005b61039c610a18565b60405160ff90911681526020016102b1565b7f000000000000000000000000b8ce59fc3717ada4c02eadf9682a9e934f625ebb61035f565b6102c26103e2366004613b83565b5060001990565b610392610a49565b610392610ade565b6102c2610407366004613ba0565b610b8e565b6102c261041a366004613b83565b6001600160a01b031660009081526020819052604090205490565b61043d610ca8565b6040516102b19190613bd0565b610392610458366004613c73565b610d1d565b60095461035f906001600160a01b031681565b6102c261047e366004613ba0565b61115f565b6102d861125c565b61049e610499366004613cf8565b61126b565b6040516102b19190613dc5565b6103926104b9366004613dff565b61131d565b6103146104cc366004613b16565b61189b565b6102c26104df366004613a8a565b6118a9565b6102c26104f2366004613e39565b6118b6565b610392610505366004613b83565b6119b9565b6102c2610518366004613e39565b611a60565b61039261052b366004613e7b565b611b46565b61039261053e366004613a8a565b611c9f565b6102c2610551366004613a8a565b611cff565b610392610564366004613b83565b611d0c565b6102c2610577366004613b83565b611d85565b610584611daa565b6040516102b19190613ef3565b6102c261059f366004613b83565b611db6565b6102c26105b2366004613f06565b6001600160a01b03918216600090815260016020908152604080832093909416825291909152205490565b6103146105eb366004613a8a565b611dd4565b610392611df9565b6102c260075481565b600c818154811061061157600080fd5b6000918252602090912060029091020180546001909101546001600160a01b03909116915082565b600654600090815b818110156106e757600c818154811061065c5761065c613f34565b600091825260209182902060029091020154604080516316d3df1560e31b815290516001600160a01b039092169263b69ef8a8926004808401938290030181865afa1580156106af573d6000803e3d6000fd5b505050506040513d601f19601f820116820180604052508101906106d39190613f4a565b6106dd9084613f79565b9250600101610641565b506107117f000000000000000000000000b8ce59fc3717ada4c02eadf9682a9e934f625ebb611f07565b61071b9083613f79565b91505090565b60606003805461073090613f8c565b80601f016020809104026020016040519081016040528092919081815260200182805461075c90613f8c565b80156107a95780601f1061077e576101008083540402835291602001916107a9565b820191906000526020600020905b81548152906001019060200180831161078c57829003601f168201915b5050505050905090565b60006107c0826000611f91565b92915050565b6000336107d4818585611fcb565b5060019392505050565b60006107c0826001611fd8565b6000336107f9858285612008565b610804858585612087565b60019150505b9392505050565b6008546001600160a01b0316331461083c5760405163c80d5fa560e01b815260040160405180910390fd5b6000600c805480602002602001604051908101604052809291908181526020016000905b828210156108a8576000848152602090819020604080518082019091526002850290910180546001600160a01b03168252600190810154828401529083529092019101610860565b505050509050600060065490506000805b828110156109b6576108c9610a49565b8381815181106108db576108db613f34565b60200260200101516000015191506000826001600160a01b031663b69ef8a86040518163ffffffff1660e01b8152600401602060405180830381865afa158015610929573d6000803e3d6000fd5b505050506040513d601f19601f8201168201806040525081019061094d9190613f4a565b604051632e1a7d4d60e01b8152600481018290529091506001600160a01b03841690632e1a7d4d90602401600060405180830381600087803b15801561099257600080fd5b505af11580156109a6573d6000803e3d6000fd5b50505050816001019150506108b9565b507fc67387b8229e689a6f1e2c3feafcfae2206a4d6e581bf95e25dbb0c934432a64610a017f000000000000000000000000b8ce59fc3717ada4c02eadf9682a9e934f625ebb611f07565b6040519081526020015b60405180910390a1505050565b6000610a44817f0000000000000000000000000000000000000000000000000000000000000006613fc6565b905090565b60065460005b81811015610ada57600c8181548110610a6a57610a6a613f34565b6000918252602082206002909102015460408051634641257d60e01b815290516001600160a01b0390921692634641257d9260048084019382900301818387803b158015610ab757600080fd5b505af1158015610acb573d6000803e3d6000fd5b50505050806001019050610a4f565b5050565b6009546001600160a01b03163314610b0957604051634f9aa11760e11b815260040160405180910390fd5b7f000000000000000000000000b8ce59fc3717ada4c02eadf9682a9e934f625ebb6000610b3582611f07565b90508015610ada57600954610b57906001600160a01b038481169116836120e6565b6040518181527f76a820ad5e56aebcfa13f60a4ec2e8453550cca0e77446a259782e547c68b32b9060200160405180910390a15050565b6000610b98612145565b82600003610bb957604051630f6fa54560e41b815260040160405180910390fd5b610bc283611dd4565b610bdf57604051630795800760e31b815260040160405180910390fd5b610be7610a49565b610bf083611cff565b905060006040518060a00160405280846001600160a01b031681526020018581526020018381526020016006548152602001600c805480602002602001604051908101604052809291908181526020016000905b82821015610c8c576000848152602090819020604080518082019091526002850290910180546001600160a01b03168252600190810154828401529083529092019101610c44565b5050509152509050610c9d8161216f565b506107c06001600555565b6060600c805480602002602001604051908101604052809291908181526020016000905b82821015610d14576000848152602090819020604080518082019091526002850290910180546001600160a01b03168252600190810154828401529083529092019101610ccc565b50505050905090565b6009546001600160a01b03163314610d4857604051634f9aa11760e11b815260040160405180910390fd5b600d5460ff1615610d6c5760405163439a74c960e01b815260040160405180910390fd5b826000819003610d8f57604051638c305f6d60e01b815260040160405180910390fd5b808214610daf57604051634456f5e960e11b815260040160405180910390fd5b600080610dcc604080518082019091526000808252602082015290565b60005b848110156110e157888882818110610de957610de9613f34565b9050602002016020810190610dfe9190613b83565b92507f000000000000000000000000b8ce59fc3717ada4c02eadf9682a9e934f625ebb6001600160a01b0316836001600160a01b03166338d52e0f6040518163ffffffff1660e01b8152600401602060405180830381865afa158015610e68573d6000803e3d6000fd5b505050506040513d601f19601f82011682018060405250810190610e8c9190613fdf565b6001600160a01b031614610eb35760405163010fa87160e01b815260040160405180910390fd5b306001600160a01b0316836001600160a01b031663e9d3c1546040518163ffffffff1660e01b8152600401602060405180830381865afa158015610efb573d6000803e3d6000fd5b505050506040513d601f19601f82011682018060405250810190610f1f9190613fdf565b6001600160a01b031614610f46576040516306a6fe6960e21b815260040160405180910390fd5b6000610f778a8a84818110610f5d57610f5d613f34565b9050602002016020810190610f729190613b83565b612235565b905080610fcf57898983818110610f9057610f90613f34565b9050602002016020810190610fa59190613b83565b604051630e23e61560e01b81526001600160a01b0390911660048201526024015b60405180910390fd5b60405180604001604052808b8b85818110610fec57610fec613f34565b90506020020160208101906110019190613b83565b6001600160a01b0316815260200189898581811061102157611021613f34565b60209081029290920135909252600c805460018101825560009190915283517fdf6966c971051c3d54ec59162606531493a51404a002842f56009d7e5cf4a8c7600290920291820180546001600160a01b0319166001600160a01b03909216919091179055908301517fdf6966c971051c3d54ec59162606531493a51404a002842f56009d7e5cf4a8c8909101555092508787838181106110c4576110c4613f34565b90506020020135856110d69190613f79565b945050600101610dcf565b506127108314611104576040516314ccf61760e31b815260040160405180910390fd5b600c54600655600d805460ff191660011790556040517fab8addcb3e4c6388fadb3059c28a92327ce30ea8c442e6c45e9caaddb4466faf9061114d908a908a908a908a90613ffc565b60405180910390a15050505050505050565b6000611169612145565b611171610a49565b61117a836118a9565b90508060000361119d57604051630f6fa54560e41b815260040160405180910390fd5b6111a681611dd4565b6111c357604051630795800760e31b815260040160405180910390fd5b60006040518060a00160405280846001600160a01b031681526020018381526020018581526020016006548152602001600c8054806020026020016040519081016040528092919081815260200160009082821015610c8c576000848152602090819020604080518082019091526002850290910180546001600160a01b03168252600190810154828401529083529092019101610c44565b60606004805461073090613f8c565b8051606090806001600160401b0381111561128857611288613ce2565b6040519080825280602002602001820160405280156112b1578160200160208202803683370190505b50915060005b81811015611316576112ec8482815181106112d4576112d4613f34565b6020026020010151600a61224290919063ffffffff16565b8382815181106112fe576112fe613f34565b911515602092830291909101909101526001016112b7565b5050919050565b6008546001600160a01b031633146113485760405163c80d5fa560e01b815260040160405180910390fd5b6000611354828061407a565b915060009050611367602084018461407a565b91506000905061137a604085018561407a565b905090508160000361139f57604051630fd59abf60e31b815260040160405180910390fd5b8015806113aa575082155b156113c857604051637c8c272560e11b815260040160405180910390fd5b81831415806113e557506113df606085018561407a565b90508114155b1561140357604051634456f5e960e11b815260040160405180910390fd5b600654600090815b858110156114ab5760005b828110156114a257600c818154811061143157611431613f34565b60009182526020909120600290910201546001600160a01b0316611455898061407a565b8481811061146557611465613f34565b905060200201602081019061147a9190613b83565b6001600160a01b03160361149a5783611492816140c3565b9450506114a2565b600101611416565b5060010161140b565b508482146114cb576040516290f7d960e41b815260040160405180910390fd5b50600190505b83811015611579576114e3858061407a565b6114ee6001846140dc565b8181106114fd576114fd613f34565b90506020020160208101906115129190613b83565b6001600160a01b0316611525868061407a565b8381811061153557611535613f34565b905060200201602081019061154a9190613b83565b6001600160a01b0316116115715760405163260a69b160e21b815260040160405180910390fd5b6001016114d1565b5060005b818110156116945760018110158015611614575061159e604086018661407a565b6115a96001846140dc565b8181106115b8576115b8613f34565b90506020020160208101906115cd9190613b83565b6001600160a01b03166115e3604087018761407a565b838181106115f3576115f3613f34565b90506020020160208101906116089190613b83565b6001600160a01b031611155b156116325760405163fa6979a960e01b815260040160405180910390fd5b61166f611642604087018761407a565b8381811061165257611652613f34565b90506020020160208101906116679190613b83565b600a90612242565b61168c576040516334c680eb60e11b815260040160405180910390fd5b60010161157d565b506000836001600160401b038111156116af576116af613ce2565b6040519080825280602002602001820160405280156116f457816020015b60408051808201909152600080825260208201528152602001906001900390816116cd5790505b50905060005b84811015611799576040805180820190915280611717888061407a565b8481811061172757611727613f34565b905060200201602081019061173c9190613b83565b6001600160a01b0316815260200187806020019061175a919061407a565b8481811061176a5761176a613f34565b9050602002013581525082828151811061178657611786613f34565b60209081029190910101526001016116fa565b506040805160c081018252308082526020820152600091810182905260608101829052608081016117ca888061407a565b9050815260200183815250905060006117f2826080015183604001518460a001516000612264565b9050600061181861180660408a018a61407a565b61181360608c018c61407a565b612657565b9050600061182583611cff565b905060006040518060a00160405280306001600160a01b031681526020018581526020018381526020018b806040019061185f919061407a565b905081526020018481525090506118858160600151826020015183608001516001612264565b5061188f83612803565b50505050505050505050565b6000336107d4818585612087565b60006107c0826001611f91565b60006118c0612145565b836000036118e157604051630f6fa54560e41b815260040160405180910390fd5b6118e9610a49565b6118f2846107de565b905060006040518060c00160405280856001600160a01b03168152602001846001600160a01b031681526020018681526020018381526020016006548152602001600c805480602002602001604051908101604052809291908181526020016000905b8282101561199d576000848152602090819020604080518082019091526002850290910180546001600160a01b03168252600190810154828401529083529092019101611955565b50505091525090506119ae81612f81565b5061080a6001600555565b6009546001600160a01b031633146119e457604051634f9aa11760e11b815260040160405180910390fd5b6001600160a01b038116611a0b5760405163538ba4f960e01b815260040160405180910390fd5b600980546001600160a01b0319166001600160a01b0383169081179091556040519081527f8e902340d35762a5a36507c20fe38e5d549a721d9f846d6de7f397b5c26ab853906020015b60405180910390a150565b6000611a6a612145565b611a72610a49565b611a7b846107b3565b905080600003611a9e57604051630f6fa54560e41b815260040160405180910390fd5b60006040518060c00160405280856001600160a01b03168152602001846001600160a01b031681526020018381526020018681526020016006548152602001600c805480602002602001604051908101604052809291908181526020016000908282101561199d576000848152602090819020604080518082019091526002850290910180546001600160a01b03168252600190810154828401529083529092019101611955565b6009546001600160a01b03163314611b7157604051634f9aa11760e11b815260040160405180910390fd5b6000611b7e600a84612242565b905081151581151514611c9a578115611ba057611b9a83612235565b50611c5a565b6000836001600160a01b031663b69ef8a86040518163ffffffff1660e01b8152600401602060405180830381865afa158015611be0573d6000803e3d6000fd5b505050506040513d601f19601f82011682018060405250810190611c049190613f4a565b90508015611c2557604051631e576dd560e11b815260040160405180910390fd5b611c2f600a61307e565b600103611c4f576040516316b0551b60e01b815260040160405180910390fd5b611c5884613088565b505b604080516001600160a01b038516815283151560208201527f8bec79f539f27f15b7cbae2d61ec86cf9788feb3166ac06d6ae2cd4d3d06c2f59101610a0b565b505050565b6009546001600160a01b03163314611cca57604051634f9aa11760e11b815260040160405180910390fd5b60078190556040518181527f5d2e73196f8ba1b44e887e2bcc9bcd1f3e657add341d4a0a632ffff00d6903f290602001611a55565b60006107c0826000611fd8565b6009546001600160a01b03163314611d3757604051634f9aa11760e11b815260040160405180910390fd5b600880546001600160a01b0319166001600160a01b0383169081179091556040519081527f276625620b877c2ddc0a05d68b81971639085fa26d23dfa86eec6460e6fac5b990602001611a55565b6001600160a01b0381166000908152602081905260408120546107c0905b6000611f91565b6060610a44600a613093565b6001600160a01b0381166000908152602081905260408120546107c0565b600080611de16000611f07565b600754909150611df18285613f79565b109392505050565b6008546001600160a01b03163314611e245760405163c80d5fa560e01b815260040160405180910390fd5b6000611e4f7f000000000000000000000000b8ce59fc3717ada4c02eadf9682a9e934f625ebb611f07565b9050611ecd60065482600c805480602002602001604051908101604052809291908181526020016000905b82821015611ec2576000848152602090819020604080518082019091526002850290910180546001600160a01b03168252600190810154828401529083529092019101611e7a565b505050506001612264565b507fea9d44aea9d9b19064c11e8d92087621b04bda9bc740e82436a7cd583ffa7a90611ef96000611f07565b604051908152602001611a55565b60006001600160a01b03821615611f85576040516370a0823160e01b81523060048201526001600160a01b038316906370a0823190602401602060405180830381865afa158015611f5c573d6000803e3d6000fd5b505050506040513d601f19601f82011682018060405250810190611f809190613f4a565b6107c0565b6107c0611da360025490565b600061080a611f9e610639565b611fa9906001613f79565b611fb56000600a6141d6565b600254611fc29190613f79565b859190856130a0565b611c9a83838360016130ed565b600061080a611fe882600a6141d6565b600254611ff59190613f79565b611ffd610639565b611fc2906001613f79565b6001600160a01b03838116600090815260016020908152604080832093861683529290522054600019811015612081578181101561207257604051637dc7a0d960e11b81526001600160a01b03841660048201526024810182905260448101839052606401610fc6565b612081848484840360006130ed565b50505050565b6001600160a01b0383166120b157604051634b637e8f60e11b815260006004820152602401610fc6565b6001600160a01b0382166120db5760405163ec442f0560e01b815260006004820152602401610fc6565b611c9a8383836131c2565b6040516001600160a01b03838116602483015260448201839052611c9a91859182169063a9059cbb906064015b604051602081830303815290604052915060e01b6020820180516001600160e01b0383818316178352505050506132ec565b60026005540361216857604051633ee5aeb560e01b815260040160405180910390fd5b6002600555565b602081015133907f000000000000000000000000b8ce59fc3717ada4c02eadf9682a9e934f625ebb906121b0906001600160a01b038316908490309061335d565b6121c98360600151846020015185608001516001612264565b506121dc83600001518460400151613396565b825160208085015160408087015181516001600160a01b0380891682529095169385019390935283015260608201527ff5681f9d0db1b911ac18ee83d515a1cf1051853a9eae418316a2fdf7dea427c590608001610a0b565b60006107c0600a836133cc565b6001600160a01b0381166000908152600183016020526040812054151561080a565b60007f000000000000000000000000b8ce59fc3717ada4c02eadf9682a9e934f625ebb8082876001600160401b038111156122a1576122a1613ce2565b6040519080825280602002602001820160405280156122ca578160200160208202803683370190505b509050600085156124a15760005b8981101561249b578781815181106122f2576122f2613f34565b602002602001015160000151915061233788828151811061231557612315613f34565b60200260200101516020015161271060008c6130a0909392919063ffffffff16565b83828151811061234957612349613f34565b60200260200101818152505061238c8284838151811061236b5761236b613f34565b6020026020010151866001600160a01b03166133e19092919063ffffffff16565b816001600160a01b031663354030238483815181106123ad576123ad613f34565b60200260200101516040518263ffffffff1660e01b81526004016123d391815260200190565b600060405180830381600087803b1580156123ed57600080fd5b505af1158015612401573d6000803e3d6000fd5b5050604051636eb1769f60e11b81523060048201526001600160a01b038581166024830152600093508716915063dd62ed3e90604401602060405180830381865afa158015612454573d6000803e3d6000fd5b505050506040513d601f19601f820116820180604052508101906124789190613f4a565b1115612493576124936001600160a01b038516836000613466565b6001016122d8565b5061264b565b60006124ac85611f07565b90506000805b8b811015612623578981815181106124cc576124cc613f34565b60200260200101516000015193508a91508a60000361254a57836001600160a01b031663b69ef8a86040518163ffffffff1660e01b8152600401602060405180830381865afa158015612523573d6000803e3d6000fd5b505050506040513d601f19601f820116820180604052508101906125479190613f4a565b91505b6125818a828151811061255f5761255f613f34565b6020026020010151602001516127106000856130a0909392919063ffffffff16565b85828151811061259357612593613f34565b602002602001018181525050836001600160a01b0316632e1a7d4d8683815181106125c0576125c0613f34565b60200260200101516040518263ffffffff1660e01b81526004016125e691815260200190565b600060405180830381600087803b15801561260057600080fd5b505af1158015612614573d6000803e3d6000fd5b505050508060010190506124b2565b50600061262f87611f07565b905061263b83826140dc565b97506126478b896134f6565b5050505b50505050949350505050565b6060600082815b8181101561269c5785858281811061267857612678613f34565b905060200201356000146126945782612690816140c3565b9350505b60010161265e565b50816001600160401b038111156126b5576126b5613ce2565b6040519080825280602002602001820160405280156126fa57816020015b60408051808201909152600080825260208201528152602001906001900390816126d35790505b50925060008060005b838110156127e05787878281811061271d5761271d613f34565b905060200201356000146127d85760405180604001604052808b8b8481811061274857612748613f34565b905060200201602081019061275d9190613b83565b6001600160a01b0316815260200189898481811061277d5761277d613f34565b9050602002013581525086848151811061279957612799613f34565b60200260200101819052508787828181106127b6576127b6613f34565b90506020020135826127c89190613f79565b9150826127d4816140c3565b9350505b600101612703565b50612710811461264b576040516314ccf61760e31b815260040160405180910390fd5b6000600c805480602002602001604051908101604052809291908181526020016000905b8282101561286f576000848152602090819020604080518082019091526002850290910180546001600160a01b03168252600190810154828401529083529092019101612827565b505050509050600061289e7f000000000000000000000000b8ce59fc3717ada4c02eadf9682a9e934f625ebb90565b835183519192509060008290036128c857604051638c305f6d60e01b815260040160405180910390fd5b6000805b82811015612992576000805b85811015612944578881815181106128f2576128f2613f34565b6020026020010151600001516001600160a01b031688848151811061291957612919613f34565b6020026020010151600001516001600160a01b03160361293c5760019150612944565b6001016128d8565b5080158015612976575061297487838151811061296357612963613f34565b60200260200101516000015161354c565b155b156129895782612985816140c3565b9350505b506001016128cc565b50600061299f8285613f79565b90506000816001600160401b038111156129bb576129bb613ce2565b604051908082528060200260200182016040528015612a0057816020015b60408051808201909152600080825260208201528152602001906001900390816129d95790505b50905060005b85811015612a4d57888181518110612a2057612a20613f34565b6020026020010151828281518110612a3a57612a3a613f34565b6020908102919091010152600101612a06565b508460005b85811015612b59576000805b88811015612aca578b8181518110612a7857612a78613f34565b6020026020010151600001516001600160a01b03168b8481518110612a9f57612a9f613f34565b6020026020010151600001516001600160a01b031603612ac25760019150612aca565b600101612a5e565b5080158015612aeb5750612ae98a838151811061296357612963613f34565b155b15612b505760405180604001604052808b8481518110612b0d57612b0d613f34565b6020026020010151600001516001600160a01b031681526020016000815250848481518110612b3e57612b3e613f34565b60200260200101819052508260010192505b50600101612a52565b506000805b84811015612d4e576000848281518110612b7a57612b7a613f34565b6020026020010151600001519050896001600160a01b0316816001600160a01b03166338d52e0f6040518163ffffffff1660e01b8152600401602060405180830381865afa158015612bd0573d6000803e3d6000fd5b505050506040513d601f19601f82011682018060405250810190612bf49190613fdf565b6001600160a01b031614612c1b5760405163010fa87160e01b815260040160405180910390fd5b306001600160a01b0316816001600160a01b031663e9d3c1546040518163ffffffff1660e01b8152600401602060405180830381865afa158015612c63573d6000803e3d6000fd5b505050506040513d601f19601f82011682018060405250810190612c879190613fdf565b6001600160a01b031614612cae576040516306a6fe6960e21b815260040160405180910390fd5b6000816001600160a01b031663b69ef8a86040518163ffffffff1660e01b8152600401602060405180830381865afa158015612cee573d6000803e3d6000fd5b505050506040513d601f19601f82011682018060405250810190612d129190613f4a565b905080868481518110612d2757612d27613f34565b6020908102919091018101510152612d3f8185613f79565b93508260010192505050612b5e565b508015612e36576000805b612d646001876140dc565b811015612df757612da2612710846000888581518110612d8657612d86613f34565b6020026020010151602001516130a0909392919063ffffffff16565b858281518110612db457612db4613f34565b60200260200101516020018181525050848181518110612dd657612dd6613f34565b60200260200101516020015182612ded9190613f79565b9150600101612d59565b50612e04816127106140dc565b84612e106001886140dc565b81518110612e2057612e20613f34565b6020026020010151602001818152505050612eab565b6000612e44856127106141fb565b90506000612e548661271061420f565b905060005b86811015612ea757818110612e6f576000612e72565b60015b612e7f9060ff1684613f79565b868281518110612e9157612e91613f34565b6020908102919091018101510152600101612e59565b5050505b612eb7600c6000613a3c565b60005b84811015612f2657600c848281518110612ed657612ed6613f34565b602090810291909101810151825460018082018555600094855293839020825160029092020180546001600160a01b0319166001600160a01b039092169190911781559101519082015501612eba565b5060068490557fb4ea704c0ca1f1317ac7737b8105ac22eb9e9d7f6bbf36b335784817e2ecc43c612f56846135b7565b612f5f8561365b565b604051612f6d929190614223565b60405180910390a150505050505050505050565b600033905060007f000000000000000000000000b8ce59fc3717ada4c02eadf9682a9e934f625ebb90506000612fc6846080015185604001518660a001516000612264565b905083602001516001600160a01b0316836001600160a01b031614612ff857612ff88460200151848660600151612008565b61300a846020015185606001516136f2565b8351613021906001600160a01b03841690836120e6565b8351606080860151604080516001600160a01b03808916825290941660208501528301849052908201527fc2b4a290c20fb28939d29f102514fbffd2b73c059ffba8b78250c94161d5fcc69060800160405180910390a150505050565b60006107c0825490565b610ada600a82613728565b6060600061080a8361373d565b60006130cf6130ae83613799565b80156130ca5750600084806130c5576130c56141e5565b868809115b151590565b6130da8686866137c6565b6130e49190613f79565b95945050505050565b6001600160a01b0384166131175760405163e602df0560e01b815260006004820152602401610fc6565b6001600160a01b03831661314157604051634a1406b160e11b815260006004820152602401610fc6565b6001600160a01b038085166000908152600160209081526040808320938716835292905220829055801561208157826001600160a01b0316846001600160a01b03167f8c5be1e5ebec7d5bd14f71427d1e84f3dd0314c0f7b2291e5b200ac8c7c3b925846040516131b491815260200190565b60405180910390a350505050565b6001600160a01b0383166131ed5780600260008282546131e29190613f79565b9091555061325f9050565b6001600160a01b038316600090815260208190526040902054818110156132405760405163391434e360e21b81526001600160a01b03851660048201526024810182905260448101839052606401610fc6565b6001600160a01b03841660009081526020819052604090209082900390555b6001600160a01b03821661327b5760028054829003905561329a565b6001600160a01b03821660009081526020819052604090208054820190555b816001600160a01b0316836001600160a01b03167fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef836040516132df91815260200190565b60405180910390a3505050565b600080602060008451602086016000885af18061330f576040513d6000823e3d81fd5b50506000513d91508115613327578060011415613334565b6001600160a01b0384163b155b1561208157604051635274afe760e01b81526001600160a01b0385166004820152602401610fc6565b6040516001600160a01b0384811660248301528381166044830152606482018390526120819186918216906323b872dd90608401612113565b6001600160a01b0382166133c05760405163ec442f0560e01b815260006004820152602401610fc6565b610ada600083836131c2565b600061080a836001600160a01b03841661387b565b604051636eb1769f60e11b81523060048201526001600160a01b0383811660248301526000919085169063dd62ed3e90604401602060405180830381865afa158015613431573d6000803e3d6000fd5b505050506040513d601f19601f820116820180604052508101906134559190613f4a565b905061208184846134668585613f79565b604080516001600160a01b038416602482015260448082018490528251808303909101815260649091019091526020810180516001600160e01b031663095ea7b360e01b1790526134b784826138ca565b612081576040516001600160a01b038481166024830152600060448301526134ec91869182169063095ea7b390606401612113565b61208184826132ec565b6000818311613506576000613528565b8261271061351484836140dc565b61351e919061427d565b61352891906141fb565b90506064811115611c9a576040516304a6523360e01b815260040160405180910390fd5b6000816001600160a01b031663b69ef8a86040518163ffffffff1660e01b8152600401602060405180830381865afa15801561358c573d6000803e3d6000fd5b505050506040513d601f19601f820116820180604052508101906135b09190613f4a565b1592915050565b8051606090806001600160401b038111156135d4576135d4613ce2565b6040519080825280602002602001820160405280156135fd578160200160208202803683370190505b50915060005b818110156113165783818151811061361d5761361d613f34565b60200260200101516000015183828151811061363b5761363b613f34565b6001600160a01b0390921660209283029190910190910152600101613603565b8051606090806001600160401b0381111561367857613678613ce2565b6040519080825280602002602001820160405280156136a1578160200160208202803683370190505b50915060005b81811015611316578381815181106136c1576136c1613f34565b6020026020010151602001518382815181106136df576136df613f34565b60209081029190910101526001016136a7565b6001600160a01b03821661371c57604051634b637e8f60e11b815260006004820152602401610fc6565b610ada826000836131c2565b600061080a836001600160a01b038416613919565b60608160000180548060200260200160405190810160405280929190818152602001828054801561378d57602002820191906000526020600020905b815481526020019060010190808311613779575b50505050509050919050565b600060028260038111156137af576137af614294565b6137b991906142aa565b60ff166001149050919050565b60008060006137d58686613a0c565b91509150816000036137fa578381816137f0576137f06141e5565b049250505061080a565b818411613811576138116003851502601118613a2a565b6000848688096000868103871696879004966002600389028118808a02820302808a02820302808a02820302808a02820302808a02820302808a02909103029181900381900460010185841190960395909502919093039390930492909217029150509392505050565b60008181526001830160205260408120546138c2575081546001818101845560008481526020808220909301849055845484825282860190935260409020919091556107c0565b5060006107c0565b6000806000806020600086516020880160008a5af192503d9150600051905082801561390f57508115613900578060011461390f565b6000866001600160a01b03163b115b9695505050505050565b60008181526001830160205260408120548015613a0257600061393d6001836140dc565b8554909150600090613951906001906140dc565b90508082146139b657600086600001828154811061397157613971613f34565b906000526020600020015490508087600001848154811061399457613994613f34565b6000918252602080832090910192909255918252600188019052604090208390555b85548690806139c7576139c76142cc565b6001900381819060005260206000200160009055905585600101600086815260200190815260200160002060009055600193505050506107c0565b60009150506107c0565b60008060001983850993909202808410938190039390930393915050565b634e487b71600052806020526024601cfd5b5080546000825560020290600052602060002090810190613a5d9190613a60565b50565b5b80821115613a865780546001600160a01b031916815560006001820155600201613a61565b5090565b600060208284031215613a9c57600080fd5b5035919050565b602081526000825180602084015260005b81811015613ad15760208186018101516040868401015201613ab4565b506000604082850101526040601f19601f83011684010191505092915050565b6001600160a01b0381168114613a5d57600080fd5b8035613b1181613af1565b919050565b60008060408385031215613b2957600080fd5b8235613b3481613af1565b946020939093013593505050565b600080600060608486031215613b5757600080fd5b8335613b6281613af1565b92506020840135613b7281613af1565b929592945050506040919091013590565b600060208284031215613b9557600080fd5b813561080a81613af1565b60008060408385031215613bb357600080fd5b823591506020830135613bc581613af1565b809150509250929050565b602080825282518282018190526000918401906040840190835b81811015613c1d57835180516001600160a01b031684526020908101518185015290930192604090920191600101613bea565b509095945050505050565b60008083601f840112613c3a57600080fd5b5081356001600160401b03811115613c5157600080fd5b6020830191508360208260051b8501011115613c6c57600080fd5b9250929050565b60008060008060408587031215613c8957600080fd5b84356001600160401b03811115613c9f57600080fd5b613cab87828801613c28565b90955093505060208501356001600160401b03811115613cca57600080fd5b613cd687828801613c28565b95989497509550505050565b634e487b7160e01b600052604160045260246000fd5b600060208284031215613d0a57600080fd5b81356001600160401b03811115613d2057600080fd5b8201601f81018413613d3157600080fd5b80356001600160401b03811115613d4a57613d4a613ce2565b8060051b604051601f19603f83011681018181106001600160401b0382111715613d7657613d76613ce2565b604052918252602081840181019290810187841115613d9457600080fd5b6020850194505b83851015613dba57613dac85613b06565b815260209485019401613d9b565b509695505050505050565b602080825282518282018190526000918401906040840190835b81811015613c1d5783511515835260209384019390920191600101613ddf565b600060208284031215613e1157600080fd5b81356001600160401b03811115613e2757600080fd5b82016080818503121561080a57600080fd5b600080600060608486031215613e4e57600080fd5b833592506020840135613e6081613af1565b91506040840135613e7081613af1565b809150509250925092565b60008060408385031215613e8e57600080fd5b8235613e9981613af1565b915060208301358015158114613bc557600080fd5b600081518084526020840193506020830160005b82811015613ee95781516001600160a01b0316865260209586019590910190600101613ec2565b5093949350505050565b60208152600061080a6020830184613eae565b60008060408385031215613f1957600080fd5b8235613f2481613af1565b91506020830135613bc581613af1565b634e487b7160e01b600052603260045260246000fd5b600060208284031215613f5c57600080fd5b5051919050565b634e487b7160e01b600052601160045260246000fd5b808201808211156107c0576107c0613f63565b600181811c90821680613fa057607f821691505b602082108103613fc057634e487b7160e01b600052602260045260246000fd5b50919050565b60ff81811683821601908111156107c0576107c0613f63565b600060208284031215613ff157600080fd5b815161080a81613af1565b6040808252810184905260008560608301825b8781101561403f57823561402281613af1565b6001600160a01b031682526020928301929091019060010161400f565b5083810360208501528481526001600160fb1b0385111561405f57600080fd5b8460051b915081866020830137016020019695505050505050565b6000808335601e1984360301811261409157600080fd5b8301803591506001600160401b038211156140ab57600080fd5b6020019150600581901b3603821315613c6c57600080fd5b6000600182016140d5576140d5613f63565b5060010190565b818103818111156107c0576107c0613f63565b6001815b600184111561412a5780850481111561410e5761410e613f63565b600184161561411c57908102905b60019390931c9280026140f3565b935093915050565b600082614141575060016107c0565b8161414e575060006107c0565b8160018114614164576002811461416e5761418a565b60019150506107c0565b60ff84111561417f5761417f613f63565b50506001821b6107c0565b5060208310610133831016604e8410600b84101617156141ad575081810a6107c0565b6141ba60001984846140ef565b80600019048211156141ce576141ce613f63565b029392505050565b600061080a60ff841683614132565b634e487b7160e01b600052601260045260246000fd5b60008261420a5761420a6141e5565b500490565b60008261421e5761421e6141e5565b500690565b6040815260006142366040830185613eae565b828103602084015280845180835260208301915060208601925060005b81811015614271578351835260209384019390920191600101614253565b50909695505050505050565b80820281158282048414176107c0576107c0613f63565b634e487b7160e01b600052602160045260246000fd5b600060ff8316806142bd576142bd6141e5565b8060ff84160691505092915050565b634e487b7160e01b600052603160045260246000fdfea264697066735822122028d98721dfaa444e51cd0f8599e4e928b03de7ea7f673661a10f3ab68fa0108564736f6c634300081c0033

000000000000000000000000b8ce59fc3717ada4c02eadf9682a9e934f625ebb00000000000000000000000083d47dcc9e5467f32a5e0e587335a11f773b887d00000000000000000000000062007a126bab6bd6c3cc56896aa59080a3e5533400000000000000000000000000000000000000000000000000000000000000c00000000000000000000000000000000000000000000000000000000000000100000000000000000000000000000000000000000000000000000000e8d4a51000000000000000000000000000000000000000000000000000000000000000000a4272696e6b20555344540000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000096272696e6b555344540000000000000000000000000000000000000000000000

-----Decoded View---------------
Arg [0] : _asset (address): 0xB8CE59FC3717ada4C02eaDF9682A9e934F625ebb
Arg [1] : _strategist (address): 0x83d47dCC9e5467f32A5e0e587335a11f773B887D
Arg [2] : _vaultManager (address): 0x62007a126BAb6BD6C3CC56896aa59080a3e55334
Arg [3] : _name (string): Brink USDT
Arg [4] : _symbol (string): brinkUSDT
Arg [5] : _depositLimit (uint256): 1000000000000

-----Encoded View---------------
10 Constructor Arguments found :
Arg [0] : 000000000000000000000000b8ce59fc3717ada4c02eadf9682a9e934f625ebb
Arg [1] : 00000000000000000000000083d47dcc9e5467f32a5e0e587335a11f773b887d
Arg [2] : 00000000000000000000000062007a126bab6bd6c3cc56896aa59080a3e55334
Arg [3] : 00000000000000000000000000000000000000000000000000000000000000c0
Arg [4] : 0000000000000000000000000000000000000000000000000000000000000100
Arg [5] : 000000000000000000000000000000000000000000000000000000e8d4a51000
Arg [6] : 000000000000000000000000000000000000000000000000000000000000000a
Arg [7] : 4272696e6b205553445400000000000000000000000000000000000000000000
Arg [8] : 0000000000000000000000000000000000000000000000000000000000000009
Arg [9] : 6272696e6b555344540000000000000000000000000000000000000000000000